Home
last modified time | relevance | path

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

/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericDomTree.h498 DomTreeNodeBase<NodeT> *NodeA = getNode(A);
500 assert(NodeA && "A must be in the tree");
505 while (NodeA != NodeB) {
506 if (NodeA->getLevel() < NodeB->getLevel()) std::swap(NodeA, NodeB);
508 NodeA = NodeA->IDom;
511 return NodeA->getBlock();
/freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/
H A DComplexDeinterleavingPass.cpp1218 auto NodeA = It->second; in identifyMultiplications() local
1220 auto IsMultiplicandReal = PMI.Common == NodeA->Real; in identifyMultiplications()
1262 dbgs().indent(4) << "X: " << *NodeA->Real << "\n"; in identifyMultiplications()
1263 dbgs().indent(4) << "Y: " << *NodeA->Imag << "\n"; in identifyMultiplications()
1272 NodeMul->addOperand(NodeA); in identifyMultiplications()
1867 auto NodeA = identifyNode(AR, AI); in identifySelectNode() local
1868 if (!NodeA) in identifySelectNode()
1877 PlaceholderNode->addOperand(NodeA); in identifySelectNode()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp8678 auto *NodeA = DT->getNode(A->getParent()); in getSpillCost() local
8680 assert(NodeA && "Should only process reachable instructions"); in getSpillCost()
8682 assert((NodeA == NodeB) == (NodeA->getDFSNumIn() == NodeB->getDFSNumIn()) && in getSpillCost()
8684 if (NodeA != NodeB) in getSpillCost()
8685 return NodeA->getDFSNumIn() > NodeB->getDFSNumIn(); in getSpillCost()
9854 auto *NodeA = DT->getNode(LastInst->getParent()); in getLastInstructionInBundle() local
9858 assert((NodeA == NodeB) == in getLastInstructionInBundle()
9861 if (NodeA->getDFSNumIn() < NodeB->getDFSNumIn()) in getLastInstructionInBundle()
9890 auto *NodeA = DT->getNode(FirstInst->getParent()); in getLastInstructionInBundle() local
9894 assert((NodeA == NodeB) == in getLastInstructionInBundle()
[all …]