reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
176 TreeNodePtr getNodeForBlock(NodePtr BB, DomTreeT &DT) { 177 if (TreeNodePtr Node = DT.getNode(BB)) return Node; 184 TreeNodePtr IDomNode = getNodeForBlock(IDom, DT); 199 BlockNamePrinter(TreeNodePtr TN) : N(TN ? TN->getBlock() : nullptr) {} 325 const TreeNodePtr TN = DT.getNode(N); 594 void attachNewSubtree(DomTreeT& DT, const TreeNodePtr AttachTo) { 609 TreeNodePtr IDomNode = getNodeForBlock(ImmDom, DT); 618 void reattachExistingSubtree(DomTreeT &DT, const TreeNodePtr AttachTo) { 622 const TreeNodePtr TN = DT.getNode(N); 624 const TreeNodePtr NewIDom = DT.getNode(NodeToInfo[N].IDom); 632 bool operator()(TreeNodePtr LHS, TreeNodePtr RHS) const { 632 bool operator()(TreeNodePtr LHS, TreeNodePtr RHS) const { 639 std::priority_queue<TreeNodePtr, SmallVector<TreeNodePtr, 8>, 639 std::priority_queue<TreeNodePtr, SmallVector<TreeNodePtr, 8>, 642 SmallDenseSet<TreeNodePtr, 8> Visited; 643 SmallVector<TreeNodePtr, 8> Affected; 645 SmallVector<TreeNodePtr, 8> VisitedUnaffected; 656 TreeNodePtr FromTN = DT.getNode(From); 663 TreeNodePtr VirtualRoot = DT.getNode(nullptr); 673 const TreeNodePtr ToTN = DT.getNode(To); 683 const TreeNodePtr From, 684 const TreeNodePtr To) { 742 const TreeNodePtr From, const TreeNodePtr To) { 742 const TreeNodePtr From, const TreeNodePtr To) { 754 const TreeNodePtr NCD = DT.getNode(NCDBlock); 774 SmallVector<TreeNodePtr, 8> UnaffectedOnCurrentLevel; 779 TreeNodePtr TN = II.Bucket.top(); 800 const TreeNodePtr SuccTN = DT.getNode(Succ); 849 const TreeNodePtr NCD, InsertionInfo &II) { 852 for (const TreeNodePtr TN : II.Affected) { 859 for (const TreeNodePtr TN : II.VisitedUnaffected) 869 const TreeNodePtr From, const NodePtr To) { 874 SmallVector<std::pair<NodePtr, TreeNodePtr>, 8> DiscoveredEdgesToReachable; 895 const TreeNodePtr Incoming, 896 SmallVectorImpl<std::pair<NodePtr, TreeNodePtr>> 903 const TreeNodePtr ToTN = DT.getNode(To); 936 const TreeNodePtr FromTN = DT.getNode(From); 940 const TreeNodePtr ToTN = DT.getNode(To); 949 const TreeNodePtr NCD = DT.getNode(NCDBlock); 955 const TreeNodePtr ToIDom = ToTN->getIDom(); 972 const TreeNodePtr FromTN, 973 const TreeNodePtr ToTN) { 983 const TreeNodePtr ToIDomTN = DT.getNode(ToIDom); 985 const TreeNodePtr PrevIDomSubTree = ToIDomTN->getIDom(); 1013 const TreeNodePtr TN) { 1038 const TreeNodePtr ToTN) { 1062 const TreeNodePtr TN = DT.getNode(To); 1075 TreeNodePtr MinNode = ToTN; 1080 const TreeNodePtr TN = DT.getNode(N); 1084 const TreeNodePtr NCD = DT.getNode(NCDBlock); 1104 const TreeNodePtr TN = DT.getNode(N); 1116 const TreeNodePtr PrevIDom = MinNode->getIDom(); 1122 const TreeNodePtr ToTN = DT.getNode(To); 1136 static void EraseNode(DomTreeT &DT, const TreeNodePtr TN) { 1140 const TreeNodePtr IDom = TN->getIDom(); 1308 const TreeNodePtr TN = NodeToTN.second.get(); 1341 const TreeNodePtr TN = NodeToTN.second.get(); 1345 const TreeNodePtr IDom = TN->getIDom(); 1376 const TreeNodePtr Root = DT.getNode(RootBB); 1396 const TreeNodePtr Node = NodeToTN.second.get(); 1413 SmallVector<TreeNodePtr, 8> Children(Node->begin(), Node->end()); 1434 for (const TreeNodePtr Ch : Children) { 1509 const TreeNodePtr TN = NodeToTN.second.get(); 1520 for (TreeNodePtr Child : TN->getChildren()) 1542 const TreeNodePtr TN = NodeToTN.second.get(); 1547 for (const TreeNodePtr N : Siblings) { 1554 for (const TreeNodePtr S : Siblings) {