Searched refs:NodeA (Results 1 – 4 of 4) sorted by relevance
458 DomTreeNodeBase<NodeT> *NodeA = getNode(A);461 if (!NodeA || !NodeB) return nullptr;465 while (NodeA && NodeA != NodeB) {466 if (NodeA->getLevel() < NodeB->getLevel()) std::swap(NodeA, NodeB);468 NodeA = NodeA->IDom;471 return NodeA ? NodeA->getBlock() : nullptr;
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>;
503 DomTreeNodeBase<NodeT> *NodeA = getNode(A); in findNearestCommonDominator() local512 DomTreeNodeBase<NodeT> *IDomA = NodeA->getIDom(); in findNearestCommonDominator()523 NodeADoms.insert(NodeA); in findNearestCommonDominator()524 DomTreeNodeBase<NodeT> *IDomA = NodeA->getIDom(); in findNearestCommonDominator()