Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericDomTree.h533 DomTreeNodeBase<NodeT> *NodeA = getNode(A);
535 assert(NodeA && "A must be in the tree");
540 while (NodeA != NodeB) {
541 if (NodeA->getLevel() < NodeB->getLevel()) std::swap(NodeA, NodeB);
543 NodeA = NodeA->IDom;
546 return NodeA->getBlock();
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DComplexDeinterleavingPass.cpp1382 auto NodeA = It->second; in identifyMultiplications() local
1384 auto IsMultiplicandReal = PMI.Common == NodeA->Real; in identifyMultiplications()
1426 dbgs().indent(4) << "X: " << *NodeA->Real << "\n"; in identifyMultiplications()
1427 dbgs().indent(4) << "Y: " << *NodeA->Imag << "\n"; in identifyMultiplications()
1436 NodeMul->addOperand(NodeA); in identifyMultiplications()
2091 auto NodeA = identifyNode(AR, AI); in identifySelectNode() local
2092 if (!NodeA) in identifySelectNode()
2101 PlaceholderNode->addOperand(NodeA); in identifySelectNode()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp6796 auto *NodeA = DT->getNode(BB1); in getReorderingData() local
6798 assert(NodeA && "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()
16054 auto *NodeA = DT->getNode(LastInst->getParent()); in getLastInstructionInBundle() local
16056 assert(NodeA && "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 …]