reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
109 SuccInsert[U.getFrom()].push_back(U.getTo()); 110 PredInsert[U.getTo()].push_back(U.getFrom()); 112 SuccDelete[U.getFrom()].push_back(U.getTo()); 113 PredDelete[U.getTo()].push_back(U.getFrom());include/llvm/Support/CFGUpdate.h
48 getTo()->printAsOperand(OS, false); 76 NodePtr To = U.getTo(); 102 Operations[{U.getFrom(), U.getTo()}] = int(i); 104 Operations[{U.getTo(), U.getFrom()}] = int(i); 109 return Operations[{A.getFrom(), A.getTo()}] > 110 Operations[{B.getFrom(), B.getTo()}];include/llvm/Support/GenericDomTreeConstruction.h
1165 DT.insertEdge(Update.getFrom(), Update.getTo()); 1167 DT.deleteEdge(Update.getFrom(), Update.getTo()); 1184 BUI.FutureSuccessors[U.getFrom()].push_back({U.getTo(), U.getKind()}); 1185 BUI.FuturePredecessors[U.getTo()].push_back({U.getFrom(), U.getKind()}); 1238 assert(FS.back().getPointer() == CurrentUpdate.getTo() && 1243 auto &FP = BUI.FuturePredecessors[CurrentUpdate.getTo()]; 1247 if (FP.empty()) BUI.FuturePredecessors.erase(CurrentUpdate.getTo()); 1250 InsertEdge(DT, &BUI, CurrentUpdate.getFrom(), CurrentUpdate.getTo()); 1252 DeleteEdge(DT, &BUI, CurrentUpdate.getFrom(), CurrentUpdate.getTo()); 1615 BUI.FutureSuccessors[U.getFrom()].push_back({U.getTo(), U.getKind()}); 1616 BUI.FuturePredecessors[U.getTo()].push_back({U.getFrom(), U.getKind()});lib/Analysis/DomTreeUpdater.cpp
28 const auto *To = Update.getTo(); 55 return Update.getFrom() == Update.getTo(); 257 auto Edge = std::make_pair(U.getFrom(), U.getTo()); 476 BasicBlock *To = U.getTo();lib/Analysis/MemorySSAUpdater.cpp
788 InsertUpdates.push_back({DT.Insert, Update.getFrom(), Update.getTo()}); 790 RevDeleteUpdates.push_back({DT.Insert, Update.getFrom(), Update.getTo()}); 810 removeEdge(Update.getFrom(), Update.getTo()); 915 BasicBlock *BB = Edge.getTo(); 961 BasicBlock *BB = Edge.getTo();