Searched refs:NodeA (Results 1 – 3 of 3) sorted by relevance
481 DomTreeNodeBase<NodeT> *NodeA = getNode(A);483 assert(NodeA && "A must be in the tree");488 while (NodeA != NodeB) {489 if (NodeA->getLevel() < NodeB->getLevel()) std::swap(NodeA, NodeB);491 NodeA = NodeA->IDom;494 return NodeA->getBlock();
66 class NodeA<int val> : NodeBase {87 def NodeA0 : NodeA<0>;
6777 auto *NodeA = DT->getNode(A->getParent()); in getSpillCost() local6779 assert(NodeA && "Should only process reachable instructions"); in getSpillCost()6781 assert((NodeA == NodeB) == (NodeA->getDFSNumIn() == NodeB->getDFSNumIn()) && in getSpillCost()6783 if (NodeA != NodeB) in getSpillCost()6784 return NodeA->getDFSNumIn() < NodeB->getDFSNumIn(); in getSpillCost()7476 auto *NodeA = DT->getNode(LastInst->getParent()); in setInsertPointAfterBundle() local7478 assert(NodeA && "Should only process reachable instructions"); in setInsertPointAfterBundle()7480 assert((NodeA == NodeB) == in setInsertPointAfterBundle()7481 (NodeA->getDFSNumIn() == NodeB->getDFSNumIn()) && in setInsertPointAfterBundle()7483 if (NodeA->getDFSNumIn() < NodeB->getDFSNumIn()) in setInsertPointAfterBundle()