Home
last modified time | relevance | path

Searched refs:NodeB (Results 1 – 3 of 3) sorted by relevance

/src/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericDomTree.h497 DomTreeNodeBase<NodeT> *NodeB = getNode(B);
499 assert(NodeB && "B must be in the tree");
503 while (NodeA != NodeB) {
504 if (NodeA->getLevel() < NodeB->getLevel()) std::swap(NodeA, NodeB);
/src/contrib/llvm-project/llvm/lib/CodeGen/
H A DComplexDeinterleavingPass.cpp1219 auto NodeB = PMI.Node; in identifyMultiplications() local
1264 dbgs().indent(4) << "U: " << *NodeB->Real << "\n"; in identifyMultiplications()
1265 dbgs().indent(4) << "V: " << *NodeB->Imag << "\n"; in identifyMultiplications()
1273 NodeMul->addOperand(NodeB); in identifyMultiplications()
1870 auto NodeB = identifyNode(RA, BI); in identifySelectNode() local
1871 if (!NodeB) in identifySelectNode()
1877 PlaceholderNode->addOperand(NodeB); in identifySelectNode()
/src/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp10202 auto *NodeB = DT->getNode(B->getParent()); in getSpillCost() local
10204 assert(NodeB && "Should only process reachable instructions"); in getSpillCost()
10205 assert((NodeA == NodeB) == (NodeA->getDFSNumIn() == NodeB->getDFSNumIn()) && in getSpillCost()
10207 if (NodeA != NodeB) in getSpillCost()
10208 return NodeA->getDFSNumIn() > NodeB->getDFSNumIn(); in getSpillCost()
11463 auto *NodeB = DT->getNode(I->getParent()); in getLastInstructionInBundle() local
11465 assert(NodeB && "Should only process reachable instructions"); in getLastInstructionInBundle()
11466 assert((NodeA == NodeB) == in getLastInstructionInBundle()
11467 (NodeA->getDFSNumIn() == NodeB->getDFSNumIn()) && in getLastInstructionInBundle()
11469 if (NodeA->getDFSNumIn() < NodeB->getDFSNumIn()) in getLastInstructionInBundle()
[all …]