623   LazyCallGraph::RefSCC &CRC = *CG.lookupRefSCC(C);  in TEST()  local
627   EXPECT_TRUE(ARC.isParentOf(CRC));  in TEST()
639   EXPECT_TRUE(DRC.isChildOf(CRC));  in TEST()
666   EXPECT_EQ(&CRC, CG.lookupRefSCC(C));  in TEST()
687   EXPECT_EQ(&CRC, CG.lookupRefSCC(C));  in TEST()
708   EXPECT_EQ(&CRC, CG.lookupRefSCC(C));  in TEST()
729   EXPECT_EQ(&CRC, CG.lookupRefSCC(C));  in TEST()
773   LazyCallGraph::RefSCC &CRC = *CG.lookupRefSCC(C1);  in TEST()  local
779   ASSERT_EQ(&CRC, CG.lookupRefSCC(C2));  in TEST()
780   ASSERT_EQ(&CRC, CG.lookupRefSCC(C3));  in TEST()
798   auto MergedRCs = CRC.insertIncomingRefEdge(D2, C2);  in TEST()
816   EXPECT_EQ(&CRC, CG.lookupRefSCC(C1));  in TEST()
817   EXPECT_EQ(&CRC, CG.lookupRefSCC(C2));  in TEST()
818   EXPECT_EQ(&CRC, CG.lookupRefSCC(C3));  in TEST()
819   EXPECT_EQ(&CRC, CG.lookupRefSCC(D1));  in TEST()
820   EXPECT_EQ(&CRC, CG.lookupRefSCC(D2));  in TEST()
821   EXPECT_EQ(&CRC, CG.lookupRefSCC(D3));  in TEST()
824   EXPECT_TRUE(ARC.isParentOf(CRC));  in TEST()
825   EXPECT_TRUE(BRC.isParentOf(CRC));  in TEST()
830   EXPECT_EQ(&CRC, &*I) << "Actual RefSCC: " << *I;  in TEST()
865   LazyCallGraph::RefSCC &CRC = *CG.lookupRefSCC(C1);  in TEST()  local
871   ASSERT_EQ(&CRC, CG.lookupRefSCC(C2));  in TEST()
872   ASSERT_EQ(&CRC, CG.lookupRefSCC(C3));  in TEST()
890   auto MergedRCs = CRC.insertIncomingRefEdge(D2, C2);  in TEST()
908   EXPECT_EQ(&CRC, CG.lookupRefSCC(C1));  in TEST()
909   EXPECT_EQ(&CRC, CG.lookupRefSCC(C2));  in TEST()
910   EXPECT_EQ(&CRC, CG.lookupRefSCC(C3));  in TEST()
911   EXPECT_EQ(&CRC, CG.lookupRefSCC(D1));  in TEST()
912   EXPECT_EQ(&CRC, CG.lookupRefSCC(D2));  in TEST()
913   EXPECT_EQ(&CRC, CG.lookupRefSCC(D3));  in TEST()
916   EXPECT_TRUE(ARC.isParentOf(CRC));  in TEST()
917   EXPECT_TRUE(BRC.isParentOf(CRC));  in TEST()
922   EXPECT_EQ(&CRC, &*I) << "Actual RefSCC: " << *I;  in TEST()
968   LazyCallGraph::RefSCC &CRC = *CG.lookupRefSCC(C);  in TEST()  local
980   EXPECT_NE(find(MergedRCs, &CRC), MergedRCs.end());  in TEST()
1041   LazyCallGraph::RefSCC &CRC = *CG.lookupRefSCC(C);  in TEST()  local
1054   EXPECT_NE(find(MergedRCs, &CRC), MergedRCs.end());  in TEST()
1111   LazyCallGraph::RefSCC &CRC = *CG.lookupRefSCC(C1);  in TEST()  local
1117   ASSERT_EQ(&CRC, CG.lookupRefSCC(C2));  in TEST()
1118   ASSERT_EQ(&CRC, CG.lookupRefSCC(C3));  in TEST()
1161   CRC.insertTrivialCallEdge(C1, D3);  in TEST()
1180   EXPECT_TRUE(CRC.isParentOf(D2RC));  in TEST()
1181   EXPECT_TRUE(CRC.isParentOf(NewDRC));  in TEST()
1183   CRC.removeOutgoingEdge(C1, D2);  in TEST()
1184   EXPECT_FALSE(CRC.isParentOf(D2RC));  in TEST()
1185   EXPECT_TRUE(CRC.isParentOf(NewDRC));  in TEST()
1198   EXPECT_EQ(&CRC, CG.lookupRefSCC(C1));  in TEST()
1199   EXPECT_EQ(&CRC, CG.lookupRefSCC(C2));  in TEST()
1200   EXPECT_EQ(&CRC, CG.lookupRefSCC(C3));  in TEST()
1203   EXPECT_TRUE(CRC.isParentOf(NewDRC));  in TEST()
1212   EXPECT_EQ(&CRC, &*I) << "Actual RefSCC: " << *I;  in TEST()