Searched refs:NodeA (Results 1 – 4 of 4) sorted by relevance
484 DomTreeNodeBase<NodeT> *NodeA = getNode(A);487 if (!NodeA || !NodeB) return nullptr;491 while (NodeA && NodeA != NodeB) {492 if (NodeA->getLevel() < NodeB->getLevel()) std::swap(NodeA, NodeB);494 NodeA = NodeA->IDom;497 return NodeA ? NodeA->getBlock() : nullptr;
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()
447 DomTreeNodeBase<NodeT> *NodeA = getNode(A); in findNearestCommonDominator() local452 NodeADoms.insert(NodeA); in findNearestCommonDominator()453 DomTreeNodeBase<NodeT> *IDomA = NodeA->getIDom(); in findNearestCommonDominator()