74   assert(!Edges && "Must not have already populated the edges for this node!");  in populateSlow()
137   assert(F != &NewF && "Must not replace a function with itself!");  in replaceFunction()
246   assert(OuterRefSCC && "Can't have a null RefSCC!");  in verify()
247   assert(!Nodes.empty() && "Can't have an empty SCC!");  in verify()
250     assert(N && "Can't have a null node!");  in verify()
251     assert(OuterRefSCC->G->lookupSCC(*N) == this &&  in verify()
253     assert(N->DFSNumber == -1 &&  in verify()
255     assert(N->LowLink == -1 &&  in verify()
258       assert(E.getNode().isPopulated() && "Can't have an unpopulated node!");  in verify()
273       assert(Visited.contains(NodeToVisit) &&  in verify()
338   assert(G && "Can't have a null graph!");  in verify()
339   assert(!SCCs.empty() && "Can't have an empty SCC!");  in verify()
344     assert(C && "Can't have a null SCC!");  in verify()
346     assert(&C->getOuterRefSCC() == this &&  in verify()
349     assert(Inserted && "Found a duplicate SCC!");  in verify()
351     assert(IndexIt != SCCIndices.end() &&  in verify()
359     assert(C && "Can't have a null SCC in the indices!");  in verify()
360     assert(SCCSet.count(C) && "Found an index for an SCC not in the RefSCC!");  in verify()
361     assert(SCCs[i] == C && "Index doesn't point to SCC!");  in verify()
373           assert(SCCIndices.find(&TargetSCC)->second <= i &&  in verify()
399       assert(Visited.contains(NodeToVisit) &&  in verify()
522   assert(SourceIdx < TargetIdx && "Cannot have equal indices here!");  in updatePostorderSequenceForEdgeInsertion()
541     assert(SourceI > (SCCs.begin() + SourceIdx) &&  in updatePostorderSequenceForEdgeInsertion()
543     assert(*std::prev(SourceI) == &TargetSCC &&  in updatePostorderSequenceForEdgeInsertion()
551   assert(SCCs[TargetIdx] == &TargetSCC &&  in updatePostorderSequenceForEdgeInsertion()
554   assert(SCCs[SourceIdx] == &SourceSCC &&  in updatePostorderSequenceForEdgeInsertion()
573     assert(SCCs[TargetIdx] == &TargetSCC &&  in updatePostorderSequenceForEdgeInsertion()
588   assert(!(*SourceN)[TargetN].isCall() && "Must start with a ref edge!");  in switchInternalEdgeToCall()
708     assert(C != &TargetSCC &&  in switchInternalEdgeToCall()
734   assert((*SourceN)[TargetN].isCall() && "Must start with a call edge!");  in switchTrivialInternalEdgeToRef()
741   assert(G->lookupRefSCC(SourceN) == this &&  in switchTrivialInternalEdgeToRef()
743   assert(G->lookupRefSCC(TargetN) == this &&  in switchTrivialInternalEdgeToRef()
745   assert(G->lookupSCC(SourceN) != G->lookupSCC(TargetN) &&  in switchTrivialInternalEdgeToRef()
754   assert((*SourceN)[TargetN].isCall() && "Must start with a call edge!");  in switchInternalEdgeToRef()
761   assert(G->lookupRefSCC(SourceN) == this &&  in switchInternalEdgeToRef()
763   assert(G->lookupRefSCC(TargetN) == this &&  in switchInternalEdgeToRef()
767   assert(G->lookupSCC(SourceN) == &TargetSCC && "Source and Target must be in "  in switchInternalEdgeToRef()
813     assert(DFSStack.empty() &&  in switchInternalEdgeToRef()
815     assert(PendingSCCStack.empty() &&  in switchInternalEdgeToRef()
820       assert(RootN->DFSNumber == -1 &&  in switchInternalEdgeToRef()
841           assert(!G->SCCMap.count(&ChildN) &&  in switchInternalEdgeToRef()
879         assert(ChildN.LowLink > 0 && "Must have a positive low-link number!");  in switchInternalEdgeToRef()
939   assert(!(*SourceN)[TargetN].isCall() && "Must start with a ref edge!");  in switchOutgoingEdgeToCall()
941   assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC.");  in switchOutgoingEdgeToCall()
942   assert(G->lookupRefSCC(TargetN) != this &&  in switchOutgoingEdgeToCall()
945   assert(G->lookupRefSCC(TargetN)->isDescendantOf(*this) &&  in switchOutgoingEdgeToCall()
960   assert((*SourceN)[TargetN].isCall() && "Must start with a call edge!");  in switchOutgoingEdgeToRef()
962   assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC.");  in switchOutgoingEdgeToRef()
963   assert(G->lookupRefSCC(TargetN) != this &&  in switchOutgoingEdgeToRef()
966   assert(G->lookupRefSCC(TargetN)->isDescendantOf(*this) &&  in switchOutgoingEdgeToRef()
981   assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC.");  in insertInternalRefEdge()
982   assert(G->lookupRefSCC(TargetN) == this && "Target must be in this RefSCC.");  in insertInternalRefEdge()
996   assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC.");  in insertOutgoingEdge()
998   assert(G->lookupRefSCC(TargetN) != this &&  in insertOutgoingEdge()
1001   assert(G->lookupRefSCC(TargetN)->isDescendantOf(*this) &&  in insertOutgoingEdge()
1012   assert(G->lookupRefSCC(TargetN) == this && "Target must be in this RefSCC.");  in insertIncomingRefEdge()
1014   assert(&SourceC != this && "Source must not be in this RefSCC.");  in insertIncomingRefEdge()
1016   assert(SourceC.isDescendantOf(*this) &&  in insertIncomingRefEdge()
1029   assert(SourceIdx < TargetIdx &&  in insertIncomingRefEdge()
1102     assert(RC != this && "We're merging into the target RefSCC, so it "  in insertIncomingRefEdge()
1153   assert(G->lookupRefSCC(SourceN) == this &&  in removeOutgoingEdge()
1155   assert(G->lookupRefSCC(TargetN) != this &&  in removeOutgoingEdge()
1166   assert(Removed && "Target not in the edge set for this caller?");  in removeOutgoingEdge()
1190     assert(!(*SourceN)[*TargetN].isCall() &&  in removeInternalRefEdge()
1195     assert(Removed && "Target not in the edge set for this caller?");  in removeInternalRefEdge()
1237     assert(DFSStack.empty() &&  in removeInternalRefEdge()
1239     assert(PendingRefSCCStack.empty() &&  in removeInternalRefEdge()
1245       assert(RootN->DFSNumber == -1 &&  in removeInternalRefEdge()
1260       assert(N->DFSNumber != 0 && "We should always assign a DFS number "  in removeInternalRefEdge()
1287         assert(ChildN.LowLink != 0 &&  in removeInternalRefEdge()
1301         assert(!DFSStack.empty() &&  in removeInternalRefEdge()
1344     assert(DFSStack.empty() && "Didn't flush the entire DFS stack!");  in removeInternalRefEdge()
1345     assert(PendingRefSCCStack.empty() && "Didn't flush all pending nodes!");  in removeInternalRefEdge()
1348   assert(PostOrderNumber > 1 &&  in removeInternalRefEdge()
1378       assert(N.LowLink == SCCNumber &&  in removeInternalRefEdge()
1416     assert(SourceC.isAncestorOf(TargetC) &&  in insertTrivialCallEdge()
1443     assert(SourceRC.isAncestorOf(TargetRC) &&  in insertTrivialRefEdge()
1464   assert(G->lookupRefSCC(N) == this &&  in replaceNodeFunction()
1467   assert(G->NodeMap.find(&NewF) == G->NodeMap.end() &&  in replaceNodeFunction()
1476   assert(&OldF != &NewF && "Cannot replace a function with itself!");  in replaceNodeFunction()
1477   assert(OldF.use_empty() &&  in replaceNodeFunction()
1489   assert(SCCMap.empty() &&  in insertEdge()
1496   assert(SCCMap.empty() &&  in removeEdge()
1501   assert(Removed && "Target not in the edge set for this caller?");  in removeEdge()
1507   assert(F.use_empty() &&  in removeDeadFunction()
1512   assert(!isLibFunction(F) &&  in removeDeadFunction()
1536   assert(CI != SCCMap.end() &&  in removeDeadFunction()
1545   assert(C.size() == 1 && "Dead functions must be in a singular SCC");  in removeDeadFunction()
1546   assert(RC.size() == 1 && "Dead functions must be in a singular RefSCC");  in removeDeadFunction()
1606   assert(FoundNewFunction && "No edge from original function to new function");  in getEdgeKind()
1614   assert(lookup(OriginalFunction) &&  in addSplitFunction()
1625   assert(!lookup(NewFunction) &&  in addSplitFunction()
1693   assert(!NewFunctions.empty() && "Can't add zero functions");  in addSplitRefRecursiveFunctions()
1694   assert(lookup(OriginalFunction) &&  in addSplitRefRecursiveFunctions()
1761     assert(getEdgeKind(OriginalFunction, *F1) == Edge::Kind::Ref &&  in addSplitRefRecursiveFunctions()
1768       assert(!N1->lookup(N2)->isCall() &&  in addSplitRefRecursiveFunctions()
1809     assert(DFSStack.empty() &&  in buildGenericSCCs()
1811     assert(PendingSCCStack.empty() &&  in buildGenericSCCs()
1816       assert(RootN->DFSNumber == -1 &&  in buildGenericSCCs()
1853         assert(ChildN.LowLink > 0 && "Must have a positive low-link number!");  in buildGenericSCCs()
1894   assert(RC.SCCs.empty() && "Already built SCCs!");  in buildSCCs()
1895   assert(RC.SCCIndices.empty() && "Already mapped SCC indices!");  in buildSCCs()
1898     assert(N->LowLink >= (*Nodes.begin())->LowLink &&  in buildSCCs()
1932   assert(RefSCCIndices.empty() && "Already mapped RefSCC indices!");  in buildRefSCCs()
1957         assert(Inserted && "Cannot already have this RefSCC in the index map!");  in buildRefSCCs()