Lines Matching refs:lookupSCC
254 assert(OuterRefSCC->G->lookupSCC(*N) == this && in verify()
290 if (OuterRefSCC->G->lookupSCC(E.getNode()) == &C) in isParentOf()
312 SCC *CalleeC = G.lookupSCC(E.getNode()); in isAncestorOf()
372 SCC &TargetSCC = *G->lookupSCC(E.getNode()); in verify()
595 SCC &SourceSCC = *G->lookupSCC(SourceN); in switchInternalEdgeToCall()
596 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
629 if (ConnectedSet.count(G->lookupSCC(E.getNode()))) in switchInternalEdgeToCall()
660 SCC &EdgeC = *G->lookupSCC(E.getNode()); in switchInternalEdgeToCall()
742 assert(G->lookupSCC(SourceN) != G->lookupSCC(TargetN) && in switchTrivialInternalEdgeToRef()
761 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
762 assert(G->lookupSCC(SourceN) == &TargetSCC && "Source and Target must be in " in switchInternalEdgeToRef()
845 if (G->lookupSCC(ChildN) == &OldSCC) { in switchInternalEdgeToRef()
1196 G->lookupSCC(*E.first) == G->lookupSCC(*E.second); in removeInternalRefEdges()
1400 SCC &SourceC = *G->lookupSCC(SourceN); in insertTrivialCallEdge()
1401 SCC &TargetC = *G->lookupSCC(TargetN); in insertTrivialCallEdge()
1625 SCC *OriginalC = lookupSCC(OriginalN); in addSplitFunction()
1642 if (EK == Edge::Kind::Call && E.isCall() && lookupSCC(EN) == OriginalC) { in addSplitFunction()