reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
152 LLVM_DEBUG(dbgs() << "\tHiding edge " << BlockNamePrinter(N) << " -> " 153 << BlockNamePrinter(Child) << "\n"); 159 LLVM_DEBUG(dbgs() << "\tShowing virtual edge " << BlockNamePrinter(N) 160 << " -> " << BlockNamePrinter(Child) << "\n"); 416 LLVM_DEBUG(dbgs() << "Found a new trivial root: " << BlockNamePrinter(N) 419 << BlockNamePrinter(SNCA.NumToNode[Num]) << "\n"); 444 << "\t\t\tVisiting node " << BlockNamePrinter(I) << "\n"); 461 << BlockNamePrinter(FurthestAway) << "\n"); 469 << BlockNamePrinter(N) << "\n"); 478 << BlockNamePrinter(SNCA.NumToNode[i]) << "\n"); 486 << i << ": " << BlockNamePrinter(SNCA.NumToNode[i]) << "\n"); 496 << BlockNamePrinter(Root) << " "); 521 LLVM_DEBUG(dbgs() << "\tChecking if " << BlockNamePrinter(Root) 535 << BlockNamePrinter(N) << "\n\tRemoving root " 536 << BlockNamePrinter(Root) << "\n"); 601 << BlockNamePrinter(W) << "\n"); 654 LLVM_DEBUG(dbgs() << "Inserting edge " << BlockNamePrinter(From) << " -> " 655 << BlockNamePrinter(To) << "\n"); 694 LLVM_DEBUG(dbgs() << "\t\tAfter the insertion, " << BlockNamePrinter(To) 743 LLVM_DEBUG(dbgs() << "\tReachable " << BlockNamePrinter(From->getBlock()) 744 << " -> " << BlockNamePrinter(To->getBlock()) << "\n"); 757 LLVM_DEBUG(dbgs() << "\t\tNCA == " << BlockNamePrinter(NCD) << "\n"); 784 LLVM_DEBUG(dbgs() << "Mark " << BlockNamePrinter(TN) << 805 LLVM_DEBUG(dbgs() << "\tSuccessor " << BlockNamePrinter(Succ) 822 << BlockNamePrinter(Succ) << "\n"); 830 LLVM_DEBUG(dbgs() << "\t\tAdd " << BlockNamePrinter(Succ) 839 LLVM_DEBUG(dbgs() << " Next: " << BlockNamePrinter(TN) << "\n"); 850 LLVM_DEBUG(dbgs() << "Updating NCD = " << BlockNamePrinter(NCD) << "\n"); 853 LLVM_DEBUG(dbgs() << "\tIDom(" << BlockNamePrinter(TN) 854 << ") = " << BlockNamePrinter(NCD) << "\n"); 870 LLVM_DEBUG(dbgs() << "Inserting " << BlockNamePrinter(From) 871 << " -> (unreachable) " << BlockNamePrinter(To) << "\n"); 878 LLVM_DEBUG(dbgs() << "Inserted " << BlockNamePrinter(From) 879 << " -> (prev unreachable) " << BlockNamePrinter(To) 886 << BlockNamePrinter(Edge.first) << " -> " 887 << BlockNamePrinter(Edge.second) << "\n"); 921 LLVM_DEBUG(dbgs() << "Deleting edge " << BlockNamePrinter(From) << " -> " 922 << BlockNamePrinter(To) << "\n"); 943 dbgs() << "\tTo (" << BlockNamePrinter(To) 956 LLVM_DEBUG(dbgs() << "\tNCD " << BlockNamePrinter(NCD) << ", ToIDom " 957 << BlockNamePrinter(ToIDom) << "\n"); 974 LLVM_DEBUG(dbgs() << "Deleting reachable " << BlockNamePrinter(FromTN) 975 << " -> " << BlockNamePrinter(ToTN) << "\n"); 1000 LLVM_DEBUG(dbgs() << "\tTop of subtree: " << BlockNamePrinter(ToIDomTN) 1014 LLVM_DEBUG(dbgs() << "IsReachableFromIDom " << BlockNamePrinter(TN) 1018 LLVM_DEBUG(dbgs() << "\tPred " << BlockNamePrinter(Pred) << "\n"); 1023 LLVM_DEBUG(dbgs() << "\tSupport " << BlockNamePrinter(Support) << "\n"); 1025 LLVM_DEBUG(dbgs() << "\t" << BlockNamePrinter(TN) 1027 << BlockNamePrinter(Support) << "\n"); 1040 << BlockNamePrinter(ToTN) << "\n"); 1049 LLVM_DEBUG(dbgs() << "\tAdding new root " << BlockNamePrinter(ToTN) 1087 LLVM_DEBUG(dbgs() << "Processing affected node " << BlockNamePrinter(TN) 1088 << " with NCD = " << BlockNamePrinter(NCD) 1089 << ", MinNode =" << BlockNamePrinter(MinNode) << "\n"); 1105 LLVM_DEBUG(dbgs() << "Erasing node " << BlockNamePrinter(TN) << "\n"); 1114 << BlockNamePrinter(MinNode) << "\n"); 1128 << BlockNamePrinter(PrevIDom) << "\nRunning Semi-NCA\n"); 1289 for (const NodePtr N : DT.Roots) errs() << BlockNamePrinter(N) << ", "; 1292 errs() << BlockNamePrinter(N) << ", "; 1315 errs() << "DomTree node " << BlockNamePrinter(BB) 1325 errs() << "CFG node " << BlockNamePrinter(N) 1347 errs() << "Node without an IDom " << BlockNamePrinter(BB) 1355 errs() << "Node " << BlockNamePrinter(BB) << " has level " 1357 << BlockNamePrinter(IDom->getBlock()) << " has level " 1379 errs() << BlockNamePrinter(TN) << " {" << TN->getDFSNumIn() << ", " 1514 << BlockNamePrinter(TN) << "\n"); 1522 errs() << "Child " << BlockNamePrinter(Child) 1523 << " reachable after its parent " << BlockNamePrinter(BB) 1558 errs() << "Node " << BlockNamePrinter(S) 1559 << " not reachable when its sibling " << BlockNamePrinter(N)