Home
last modified time | relevance | path

Searched refs:Ldn (Results 1 – 2 of 2) sorted by relevance

/external/llvm/lib/CodeGen/SelectionDAG/
DDAGCombiner.cpp11454 } else if (LoadSDNode *Ldn = dyn_cast<LoadSDNode>(NextInChain)) { in getStoreMergeAndAliasCandidates() local
11455 if (Ldn->isVolatile()) { in getStoreMergeAndAliasCandidates()
11461 AliasLoadNodes.push_back(Ldn); in getStoreMergeAndAliasCandidates()
11462 NextInChain = Ldn->getChain().getNode(); in getStoreMergeAndAliasCandidates()
11586 [&](LSBaseSDNode* Ldn) { in MergeConsecutiveStores() argument
11587 return isAlias(Ldn, StoreNodes[i].MemNode); in MergeConsecutiveStores()
14995 } else if (LoadSDNode *Ldn = dyn_cast<LoadSDNode>(NextInChain)) { in findBetterNeighborChains() local
14996 NextInChain = Ldn->getChain().getNode(); in findBetterNeighborChains()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/SelectionDAG/
DDAGCombiner.cpp13923 if (LoadSDNode *Ldn = dyn_cast<LoadSDNode>(RootNode)) { in getStoreMergeCandidates() local
13924 RootNode = Ldn->getChain().getNode(); in getStoreMergeCandidates()
18642 } else if (LoadSDNode *Ldn = dyn_cast<LoadSDNode>(NextInChain)) { in findBetterNeighborChains() local
18643 NextInChain = Ldn->getChain().getNode(); in findBetterNeighborChains()