Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericDomTree.h534 DomTreeNodeBase<NodeT> *NodeB = getNode(B);
536 assert(NodeB && "B must be in the tree");
540 while (NodeA != NodeB) {
541 if (NodeA->getLevel() < NodeB->getLevel()) std::swap(NodeA, NodeB);
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DComplexDeinterleavingPass.cpp1383 auto NodeB = PMI.Node; in identifyMultiplications() local
1428 dbgs().indent(4) << "U: " << *NodeB->Real << "\n"; in identifyMultiplications()
1429 dbgs().indent(4) << "V: " << *NodeB->Imag << "\n"; in identifyMultiplications()
1437 NodeMul->addOperand(NodeB); in identifyMultiplications()
2095 auto NodeB = identifyNode(RA, BI); in identifySelectNode() local
2096 if (!NodeB) in identifySelectNode()
2102 PlaceholderNode->addOperand(NodeB); in identifySelectNode()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp6797 auto *NodeB = DT->getNode(BB2); in getReorderingData() local
6799 assert(NodeB && "Should only process reachable instructions"); in getReorderingData()
6800 assert((NodeA == NodeB) == in getReorderingData()
6801 (NodeA->getDFSNumIn() == NodeB->getDFSNumIn()) && in getReorderingData()
6803 return NodeA->getDFSNumIn() < NodeB->getDFSNumIn(); in getReorderingData()
16055 auto *NodeB = DT->getNode(I->getParent()); in getLastInstructionInBundle() local
16057 assert(NodeB && "Should only process reachable instructions"); in getLastInstructionInBundle()
16058 assert((NodeA == NodeB) == in getLastInstructionInBundle()
16059 (NodeA->getDFSNumIn() == NodeB->getDFSNumIn()) && in getLastInstructionInBundle()
16061 if (NodeA->getDFSNumIn() < NodeB->getDFSNumIn()) in getLastInstructionInBundle()
[all …]