Searched refs:NodeB (Results 1 – 4 of 4) sorted by relevance
70 class NodeB<int val> : NodeBase {88 def NodeB0 : NodeB<0>;
459 DomTreeNodeBase<NodeT> *NodeB = getNode(B);461 if (!NodeA || !NodeB) return nullptr;465 while (NodeA && NodeA != NodeB) {466 if (NodeA->getLevel() < NodeB->getLevel()) std::swap(NodeA, NodeB);
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);
504 DomTreeNodeBase<NodeT> *NodeB = getNode(B); in findNearestCommonDominator() local514 if (NodeB->DominatedBy(IDomA)) in findNearestCommonDominator()531 DomTreeNodeBase<NodeT> *IDomB = NodeB->getIDom(); in findNearestCommonDominator()