Searched refs:NodeB (Results 1 – 3 of 3) sorted by relevance
70 class NodeB<int val> : NodeBase {88 def NodeB0 : NodeB<0>;
482 DomTreeNodeBase<NodeT> *NodeB = getNode(B);484 assert(NodeB && "B must be in the tree");488 while (NodeA != NodeB) {489 if (NodeA->getLevel() < NodeB->getLevel()) std::swap(NodeA, NodeB);
6778 auto *NodeB = DT->getNode(B->getParent()); in getSpillCost() local6780 assert(NodeB && "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()7477 auto *NodeB = DT->getNode(I->getParent()); in setInsertPointAfterBundle() local7479 assert(NodeB && "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()