Lines Matching refs:assert
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()
220 assert(OuterRefSCC && "Can't have a null RefSCC!"); in verify()
221 assert(!Nodes.empty() && "Can't have an empty SCC!"); in verify()
224 assert(N && "Can't have a null node!"); in verify()
225 assert(OuterRefSCC->G->lookupSCC(*N) == this && in verify()
227 assert(N->DFSNumber == -1 && in verify()
229 assert(N->LowLink == -1 && in verify()
232 assert(E.getNode().isPopulated() && "Can't have an unpopulated node!"); in verify()
294 assert(G && "Can't have a null graph!"); in verify()
295 assert(!SCCs.empty() && "Can't have an empty SCC!"); in verify()
300 assert(C && "Can't have a null SCC!"); in verify()
302 assert(&C->getOuterRefSCC() == this && in verify()
305 assert(Inserted && "Found a duplicate SCC!"); in verify()
307 assert(IndexIt != SCCIndices.end() && in verify()
315 assert(C && "Can't have a null SCC in the indices!"); in verify()
316 assert(SCCSet.count(C) && "Found an index for an SCC not in the RefSCC!"); in verify()
317 assert(SCCs[i] == C && "Index doesn't point to SCC!"); in verify()
329 assert(SCCIndices.find(&TargetSCC)->second <= i && in verify()
453 assert(SourceIdx < TargetIdx && "Cannot have equal indices here!"); in updatePostorderSequenceForEdgeInsertion()
472 assert(SourceI > (SCCs.begin() + SourceIdx) && in updatePostorderSequenceForEdgeInsertion()
474 assert(*std::prev(SourceI) == &TargetSCC && in updatePostorderSequenceForEdgeInsertion()
482 assert(SCCs[TargetIdx] == &TargetSCC && in updatePostorderSequenceForEdgeInsertion()
485 assert(SCCs[SourceIdx] == &SourceSCC && in updatePostorderSequenceForEdgeInsertion()
504 assert(SCCs[TargetIdx] == &TargetSCC && in updatePostorderSequenceForEdgeInsertion()
519 assert(!(*SourceN)[TargetN].isCall() && "Must start with a ref edge!"); in switchInternalEdgeToCall()
641 assert(C != &TargetSCC && in switchInternalEdgeToCall()
667 assert((*SourceN)[TargetN].isCall() && "Must start with a call edge!"); in switchTrivialInternalEdgeToRef()
676 assert(G->lookupRefSCC(SourceN) == this && in switchTrivialInternalEdgeToRef()
678 assert(G->lookupRefSCC(TargetN) == this && in switchTrivialInternalEdgeToRef()
680 assert(G->lookupSCC(SourceN) != G->lookupSCC(TargetN) && in switchTrivialInternalEdgeToRef()
689 assert((*SourceN)[TargetN].isCall() && "Must start with a call edge!"); in switchInternalEdgeToRef()
698 assert(G->lookupRefSCC(SourceN) == this && in switchInternalEdgeToRef()
700 assert(G->lookupRefSCC(TargetN) == this && in switchInternalEdgeToRef()
704 assert(G->lookupSCC(SourceN) == &TargetSCC && "Source and Target must be in " in switchInternalEdgeToRef()
750 assert(DFSStack.empty() && in switchInternalEdgeToRef()
752 assert(PendingSCCStack.empty() && in switchInternalEdgeToRef()
757 assert(RootN->DFSNumber == -1 && in switchInternalEdgeToRef()
778 assert(!G->SCCMap.count(&ChildN) && in switchInternalEdgeToRef()
816 assert(ChildN.LowLink > 0 && "Must have a positive low-link number!"); in switchInternalEdgeToRef()
876 assert(!(*SourceN)[TargetN].isCall() && "Must start with a ref edge!"); in switchOutgoingEdgeToCall()
878 assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC."); in switchOutgoingEdgeToCall()
879 assert(G->lookupRefSCC(TargetN) != this && in switchOutgoingEdgeToCall()
882 assert(G->lookupRefSCC(TargetN)->isDescendantOf(*this) && in switchOutgoingEdgeToCall()
898 assert((*SourceN)[TargetN].isCall() && "Must start with a call edge!"); in switchOutgoingEdgeToRef()
900 assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC."); in switchOutgoingEdgeToRef()
901 assert(G->lookupRefSCC(TargetN) != this && in switchOutgoingEdgeToRef()
904 assert(G->lookupRefSCC(TargetN)->isDescendantOf(*this) && in switchOutgoingEdgeToRef()
920 assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC."); in insertInternalRefEdge()
921 assert(G->lookupRefSCC(TargetN) == this && "Target must be in this RefSCC."); in insertInternalRefEdge()
936 assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC."); in insertOutgoingEdge()
938 assert(G->lookupRefSCC(TargetN) != this && in insertOutgoingEdge()
941 assert(G->lookupRefSCC(TargetN)->isDescendantOf(*this) && in insertOutgoingEdge()
953 assert(G->lookupRefSCC(TargetN) == this && "Target must be in this RefSCC."); in insertIncomingRefEdge()
955 assert(&SourceC != this && "Source must not be in this RefSCC."); in insertIncomingRefEdge()
957 assert(SourceC.isDescendantOf(*this) && in insertIncomingRefEdge()
972 assert(SourceIdx < TargetIdx && in insertIncomingRefEdge()
1045 assert(RC != this && "We're merging into the target RefSCC, so it " in insertIncomingRefEdge()
1096 assert(G->lookupRefSCC(SourceN) == this && in removeOutgoingEdge()
1098 assert(G->lookupRefSCC(TargetN) != this && in removeOutgoingEdge()
1111 assert(Removed && "Target not in the edge set for this caller?"); in removeOutgoingEdge()
1135 assert(!(*SourceN)[*TargetN].isCall() && in removeInternalRefEdge()
1140 assert(Removed && "Target not in the edge set for this caller?"); in removeInternalRefEdge()
1182 assert(DFSStack.empty() && in removeInternalRefEdge()
1184 assert(PendingRefSCCStack.empty() && in removeInternalRefEdge()
1190 assert(RootN->DFSNumber == -1 && in removeInternalRefEdge()
1205 assert(N->DFSNumber != 0 && "We should always assign a DFS number " in removeInternalRefEdge()
1232 assert(ChildN.LowLink != 0 && in removeInternalRefEdge()
1246 assert(!DFSStack.empty() && in removeInternalRefEdge()
1289 assert(DFSStack.empty() && "Didn't flush the entire DFS stack!"); in removeInternalRefEdge()
1290 assert(PendingRefSCCStack.empty() && "Didn't flush all pending nodes!"); in removeInternalRefEdge()
1293 assert(PostOrderNumber > 1 && in removeInternalRefEdge()
1323 assert(N.LowLink == SCCNumber && in removeInternalRefEdge()
1357 assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC."); in handleTrivialEdgeInsertion()
1363 assert(TargetRC.isDescendantOf(*this) && in handleTrivialEdgeInsertion()
1380 assert(SourceC.isAncestorOf(TargetC) && in insertTrivialCallEdge()
1413 assert(SourceRC.isAncestorOf(TargetRC) && in insertTrivialRefEdge()
1439 assert(G->lookupRefSCC(N) == this && in replaceNodeFunction()
1442 assert(G->NodeMap.find(&NewF) == G->NodeMap.end() && in replaceNodeFunction()
1451 assert(&OldF != &NewF && "Cannot replace a function with itself!"); in replaceNodeFunction()
1452 assert(OldF.use_empty() && in replaceNodeFunction()
1464 assert(SCCMap.empty() && in insertEdge()
1471 assert(SCCMap.empty() && in removeEdge()
1476 assert(Removed && "Target not in the edge set for this caller?"); in removeEdge()
1482 assert(F.use_empty() && in removeDeadFunction()
1487 assert(!isLibFunction(F) && in removeDeadFunction()
1511 assert(CI != SCCMap.end() && in removeDeadFunction()
1520 assert(C.size() == 1 && "Dead functions must be in a singular SCC"); in removeDeadFunction()
1521 assert(RC.size() == 1 && "Dead functions must be in a singular RefSCC"); in removeDeadFunction()
1569 assert(DFSStack.empty() && in buildGenericSCCs()
1571 assert(PendingSCCStack.empty() && in buildGenericSCCs()
1576 assert(RootN->DFSNumber == -1 && in buildGenericSCCs()
1613 assert(ChildN.LowLink > 0 && "Must have a positive low-link number!"); in buildGenericSCCs()
1654 assert(RC.SCCs.empty() && "Already built SCCs!"); in buildSCCs()
1655 assert(RC.SCCIndices.empty() && "Already mapped SCC indices!"); in buildSCCs()
1658 assert(N->LowLink >= (*Nodes.begin())->LowLink && in buildSCCs()
1692 assert(RefSCCIndices.empty() && "Already mapped RefSCC indices!"); in buildRefSCCs()
1720 assert(Inserted && "Cannot already have this RefSCC in the index map!"); in buildRefSCCs()