Searched refs:lookupSCC (Results 1 – 3 of 3) sorted by relevance
448 EXPECT_EQ(&C, CG.lookupSCC(N1)); in TEST()449 EXPECT_EQ(&C, CG.lookupSCC(N2)); in TEST()450 EXPECT_EQ(&C, CG.lookupSCC(N3)); in TEST()451 EXPECT_EQ(&C, CG.lookupSCC(N4)); in TEST()452 EXPECT_EQ(&C, CG.lookupSCC(N5)); in TEST()487 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); in TEST()488 LazyCallGraph::SCC &BC = *CG.lookupSCC(B); in TEST()489 LazyCallGraph::SCC &CC = *CG.lookupSCC(C); in TEST()490 LazyCallGraph::SCC &DC = *CG.lookupSCC(D); in TEST()518 EXPECT_EQ(&AC, CG.lookupSCC(A)); in TEST()[all …]
190 assert(OuterRefSCC->G->lookupSCC(*N) == this && in verify()236 SCC &TargetSCC = *G->lookupSCC(*E.getNode()); in verify()270 SCC &SourceSCC = *G->lookupSCC(SourceN); in switchInternalEdgeToCall()271 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()349 if (ConnectedSet.count(G->lookupSCC(*E.getNode()))) in switchInternalEdgeToCall()412 SCC &EdgeC = *G->lookupSCC(*E.getNode()); in switchInternalEdgeToCall()485 SCC &SourceSCC = *G->lookupSCC(SourceN); in switchInternalEdgeToRef()486 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()584 if (G->lookupSCC(ChildN) == &OldSCC) { in switchInternalEdgeToRef()997 SCC &TargetC = *G->lookupSCC(TargetN); in removeInternalRefEdge()[all …]
782 SCC *lookupSCC(Node &N) const { return SCCMap.lookup(&N); } in lookupSCC() function789 if (SCC *C = lookupSCC(N)) in lookupRefSCC()