Searched refs:lookupRefSCC (Results 1 – 3 of 3) sorted by relevance
439 EXPECT_EQ(&RC, CG.lookupRefSCC(N1)); in TEST()440 EXPECT_EQ(&RC, CG.lookupRefSCC(N2)); in TEST()441 EXPECT_EQ(&RC, CG.lookupRefSCC(N3)); in TEST()442 EXPECT_EQ(&RC, CG.lookupRefSCC(N4)); in TEST()443 EXPECT_EQ(&RC, CG.lookupRefSCC(N5)); in TEST()491 LazyCallGraph::RefSCC &ARC = *CG.lookupRefSCC(A); in TEST()492 LazyCallGraph::RefSCC &BRC = *CG.lookupRefSCC(B); in TEST()493 LazyCallGraph::RefSCC &CRC = *CG.lookupRefSCC(C); in TEST()494 LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D); in TEST()522 EXPECT_EQ(&ARC, CG.lookupRefSCC(A)); in TEST()[all …]
676 assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC."); in switchOutgoingEdgeToCall()677 assert(G->lookupRefSCC(TargetN) != this && in switchOutgoingEdgeToCall()679 assert(G->lookupRefSCC(TargetN)->isDescendantOf(*this) && in switchOutgoingEdgeToCall()696 assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC."); in switchOutgoingEdgeToRef()697 assert(G->lookupRefSCC(TargetN) != this && in switchOutgoingEdgeToRef()699 assert(G->lookupRefSCC(TargetN)->isDescendantOf(*this) && in switchOutgoingEdgeToRef()714 assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC."); in insertInternalRefEdge()715 assert(G->lookupRefSCC(TargetN) == this && "Target must be in this RefSCC."); in insertInternalRefEdge()730 assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC."); in insertOutgoingEdge()732 RefSCC &TargetC = *G->lookupRefSCC(TargetN); in insertOutgoingEdge()[all …]
788 RefSCC *lookupRefSCC(Node &N) const { in lookupRefSCC() function