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

/freebsd-current/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericDomTree.h498 DomTreeNodeBase<NodeT> *NodeA = getNode(A); local
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-current/contrib/llvm-project/llvm/lib/CodeGen/
H A DComplexDeinterleavingPass.cpp1218 auto NodeA = It->second; local
1220 auto IsMultiplicandReal = PMI.Common == NodeA->Real;
1262 dbgs().indent(4) << "X: " << *NodeA->Real << "\n";
1263 dbgs().indent(4) << "Y: " << *NodeA->Imag << "\n";
1272 NodeMul->addOperand(NodeA);
1867 auto NodeA = identifyNode(AR, AI);
1868 if (!NodeA)
1877 PlaceholderNode->addOperand(NodeA);
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp8678 auto *NodeA = DT->getNode(A->getParent());
8680 assert(NodeA && "Should only process reachable instructions");
8682 assert((NodeA == NodeB) == (NodeA->getDFSNumIn() == NodeB->getDFSNumIn()) &&
8684 if (NodeA != NodeB)
8685 return NodeA->getDFSNumIn() > NodeB->getDFSNumIn();
9854 auto *NodeA = DT->getNode(LastInst->getParent());
9856 assert(NodeA && "Should only process reachable instructions");
9858 assert((NodeA == NodeB) ==
9859 (NodeA
[all...]

Completed in 283 milliseconds