623   LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D);  in TEST()  local
628   EXPECT_FALSE(ARC.isParentOf(DRC));  in TEST()
630   EXPECT_TRUE(ARC.isAncestorOf(DRC));  in TEST()
632   EXPECT_FALSE(DRC.isChildOf(ARC));  in TEST()
634   EXPECT_TRUE(DRC.isDescendantOf(ARC));  in TEST()
636   EXPECT_TRUE(DRC.isChildOf(BRC));  in TEST()
638   EXPECT_TRUE(DRC.isChildOf(CRC));  in TEST()
651   EXPECT_TRUE(ARC.isParentOf(DRC));  in TEST()
653   EXPECT_TRUE(ARC.isAncestorOf(DRC));  in TEST()
655   EXPECT_TRUE(DRC.isChildOf(ARC));  in TEST()
657   EXPECT_TRUE(DRC.isDescendantOf(ARC));  in TEST()
666   EXPECT_EQ(&DRC, CG.lookupRefSCC(D));  in TEST()
672   EXPECT_TRUE(ARC.isParentOf(DRC));  in TEST()
674   EXPECT_TRUE(ARC.isAncestorOf(DRC));  in TEST()
676   EXPECT_TRUE(DRC.isChildOf(ARC));  in TEST()
678   EXPECT_TRUE(DRC.isDescendantOf(ARC));  in TEST()
687   EXPECT_EQ(&DRC, CG.lookupRefSCC(D));  in TEST()
693   EXPECT_TRUE(ARC.isParentOf(DRC));  in TEST()
695   EXPECT_TRUE(ARC.isAncestorOf(DRC));  in TEST()
697   EXPECT_TRUE(DRC.isChildOf(ARC));  in TEST()
699   EXPECT_TRUE(DRC.isDescendantOf(ARC));  in TEST()
708   EXPECT_EQ(&DRC, CG.lookupRefSCC(D));  in TEST()
714   EXPECT_FALSE(ARC.isParentOf(DRC));  in TEST()
716   EXPECT_TRUE(ARC.isAncestorOf(DRC));  in TEST()
718   EXPECT_FALSE(DRC.isChildOf(ARC));  in TEST()
720   EXPECT_TRUE(DRC.isDescendantOf(ARC));  in TEST()
729   EXPECT_EQ(&DRC, CG.lookupRefSCC(D));  in TEST()
773   LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D1);  in TEST()  local
780   ASSERT_EQ(&DRC, CG.lookupRefSCC(D2));  in TEST()
781   ASSERT_EQ(&DRC, CG.lookupRefSCC(D3));  in TEST()
806   EXPECT_EQ(&DRC, MergedRCs[0]);  in TEST()
865   LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D1);  in TEST()  local
872   ASSERT_EQ(&DRC, CG.lookupRefSCC(D2));  in TEST()
873   ASSERT_EQ(&DRC, CG.lookupRefSCC(D3));  in TEST()
898   EXPECT_EQ(&DRC, MergedRCs[0]);  in TEST()
968   LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D);  in TEST()  local
980   EXPECT_NE(find(MergedRCs, &DRC), MergedRCs.end());  in TEST()
1041   LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D);  in TEST()  local
1054   EXPECT_NE(find(MergedRCs, &DRC), MergedRCs.end());  in TEST()
1111   LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D1);  in TEST()  local
1118   ASSERT_EQ(&DRC, CG.lookupRefSCC(D2));  in TEST()
1119   ASSERT_EQ(&DRC, CG.lookupRefSCC(D3));  in TEST()
1161   DRC.insertTrivialCallEdge(D1, D3);  in TEST()
1165   auto NewCs = DRC.switchInternalEdgeToRef(D1, D2);  in TEST()
1171   auto NewRCs = DRC.removeInternalRefEdge(D1, {&D2});  in TEST()