lib/Analysis/LazyCallGraph.cpp

73   assert(!Edges && "Must not have already populated the edges for this node!");
136   assert(F != &NewF && "Must not replace a function with itself!");
233   assert(OuterRefSCC && "Can't have a null RefSCC!");
234   assert(!Nodes.empty() && "Can't have an empty SCC!");
237     assert(N && "Can't have a null node!");
238     assert(OuterRefSCC->G->lookupSCC(*N) == this &&
240     assert(N->DFSNumber == -1 &&
242     assert(N->LowLink == -1 &&
245       assert(E.getNode().isPopulated() && "Can't have an unpopulated node!");
307   assert(G && "Can't have a null graph!");
308   assert(!SCCs.empty() && "Can't have an empty SCC!");
313     assert(C && "Can't have a null SCC!");
315     assert(&C->getOuterRefSCC() == this &&
318     assert(Inserted && "Found a duplicate SCC!");
320     assert(IndexIt != SCCIndices.end() &&
328     assert(C && "Can't have a null SCC in the indices!");
329     assert(SCCSet.count(C) && "Found an index for an SCC not in the RefSCC!");
330     assert(SCCs[i] == C && "Index doesn't point to SCC!");
342           assert(SCCIndices.find(&TargetSCC)->second <= i &&
466   assert(SourceIdx < TargetIdx && "Cannot have equal indices here!");
485     assert(SourceI > (SCCs.begin() + SourceIdx) &&
487     assert(*std::prev(SourceI) == &TargetSCC &&
495   assert(SCCs[TargetIdx] == &TargetSCC &&
498   assert(SCCs[SourceIdx] == &SourceSCC &&
517     assert(SCCs[TargetIdx] == &TargetSCC &&
532   assert(!(*SourceN)[TargetN].isCall() && "Must start with a ref edge!");
654     assert(C != &TargetSCC &&
680   assert((*SourceN)[TargetN].isCall() && "Must start with a call edge!");
689   assert(G->lookupRefSCC(SourceN) == this &&
691   assert(G->lookupRefSCC(TargetN) == this &&
693   assert(G->lookupSCC(SourceN) != G->lookupSCC(TargetN) &&
702   assert((*SourceN)[TargetN].isCall() && "Must start with a call edge!");
711   assert(G->lookupRefSCC(SourceN) == this &&
713   assert(G->lookupRefSCC(TargetN) == this &&
717   assert(G->lookupSCC(SourceN) == &TargetSCC && "Source and Target must be in "
763     assert(DFSStack.empty() &&
765     assert(PendingSCCStack.empty() &&
770       assert(RootN->DFSNumber == -1 &&
791           assert(!G->SCCMap.count(&ChildN) &&
829         assert(ChildN.LowLink > 0 && "Must have a positive low-link number!");
889   assert(!(*SourceN)[TargetN].isCall() && "Must start with a ref edge!");
891   assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC.");
892   assert(G->lookupRefSCC(TargetN) != this &&
895   assert(G->lookupRefSCC(TargetN)->isDescendantOf(*this) &&
911   assert((*SourceN)[TargetN].isCall() && "Must start with a call edge!");
913   assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC.");
914   assert(G->lookupRefSCC(TargetN) != this &&
917   assert(G->lookupRefSCC(TargetN)->isDescendantOf(*this) &&
933   assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC.");
934   assert(G->lookupRefSCC(TargetN) == this && "Target must be in this RefSCC.");
949   assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC.");
951   assert(G->lookupRefSCC(TargetN) != this &&
954   assert(G->lookupRefSCC(TargetN)->isDescendantOf(*this) &&
966   assert(G->lookupRefSCC(TargetN) == this && "Target must be in this RefSCC.");
968   assert(&SourceC != this && "Source must not be in this RefSCC.");
970   assert(SourceC.isDescendantOf(*this) &&
985   assert(SourceIdx < TargetIdx &&
1058     assert(RC != this && "We're merging into the target RefSCC, so it "
1109   assert(G->lookupRefSCC(SourceN) == this &&
1111   assert(G->lookupRefSCC(TargetN) != this &&
1124   assert(Removed && "Target not in the edge set for this caller?");
1148     assert(!(*SourceN)[*TargetN].isCall() &&
1153     assert(Removed && "Target not in the edge set for this caller?");
1195     assert(DFSStack.empty() &&
1197     assert(PendingRefSCCStack.empty() &&
1203       assert(RootN->DFSNumber == -1 &&
1218       assert(N->DFSNumber != 0 && "We should always assign a DFS number "
1245         assert(ChildN.LowLink != 0 &&
1259         assert(!DFSStack.empty() &&
1302     assert(DFSStack.empty() && "Didn't flush the entire DFS stack!");
1303     assert(PendingRefSCCStack.empty() && "Didn't flush all pending nodes!");
1306   assert(PostOrderNumber > 1 &&
1336       assert(N.LowLink == SCCNumber &&
1370   assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC.");
1376   assert(TargetRC.isDescendantOf(*this) &&
1393     assert(SourceC.isAncestorOf(TargetC) &&
1426     assert(SourceRC.isAncestorOf(TargetRC) &&
1452   assert(G->lookupRefSCC(N) == this &&
1455   assert(G->NodeMap.find(&NewF) == G->NodeMap.end() &&
1464   assert(&OldF != &NewF && "Cannot replace a function with itself!");
1465   assert(OldF.use_empty() &&
1477   assert(SCCMap.empty() &&
1484   assert(SCCMap.empty() &&
1489   assert(Removed && "Target not in the edge set for this caller?");
1495   assert(F.use_empty() &&
1500   assert(!isLibFunction(F) &&
1524   assert(CI != SCCMap.end() &&
1533   assert(C.size() == 1 && "Dead functions must be in a singular SCC");
1534   assert(RC.size() == 1 && "Dead functions must be in a singular RefSCC");
1582     assert(DFSStack.empty() &&
1584     assert(PendingSCCStack.empty() &&
1589       assert(RootN->DFSNumber == -1 &&
1626         assert(ChildN.LowLink > 0 && "Must have a positive low-link number!");
1667   assert(RC.SCCs.empty() && "Already built SCCs!");
1668   assert(RC.SCCIndices.empty() && "Already mapped SCC indices!");
1671     assert(N->LowLink >= (*Nodes.begin())->LowLink &&
1705   assert(RefSCCIndices.empty() && "Already mapped RefSCC indices!");
1733         assert(Inserted && "Cannot already have this RefSCC in the index map!");