624   LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D);  in TEST()  local
629   EXPECT_FALSE(ARC.isParentOf(DRC));  in TEST()
631   EXPECT_TRUE(ARC.isAncestorOf(DRC));  in TEST()
633   EXPECT_FALSE(DRC.isChildOf(ARC));  in TEST()
635   EXPECT_TRUE(DRC.isDescendantOf(ARC));  in TEST()
637   EXPECT_TRUE(DRC.isChildOf(BRC));  in TEST()
639   EXPECT_TRUE(DRC.isChildOf(CRC));  in TEST()
652   EXPECT_TRUE(ARC.isParentOf(DRC));  in TEST()
654   EXPECT_TRUE(ARC.isAncestorOf(DRC));  in TEST()
656   EXPECT_TRUE(DRC.isChildOf(ARC));  in TEST()
658   EXPECT_TRUE(DRC.isDescendantOf(ARC));  in TEST()
667   EXPECT_EQ(&DRC, CG.lookupRefSCC(D));  in TEST()
673   EXPECT_TRUE(ARC.isParentOf(DRC));  in TEST()
675   EXPECT_TRUE(ARC.isAncestorOf(DRC));  in TEST()
677   EXPECT_TRUE(DRC.isChildOf(ARC));  in TEST()
679   EXPECT_TRUE(DRC.isDescendantOf(ARC));  in TEST()
688   EXPECT_EQ(&DRC, CG.lookupRefSCC(D));  in TEST()
694   EXPECT_TRUE(ARC.isParentOf(DRC));  in TEST()
696   EXPECT_TRUE(ARC.isAncestorOf(DRC));  in TEST()
698   EXPECT_TRUE(DRC.isChildOf(ARC));  in TEST()
700   EXPECT_TRUE(DRC.isDescendantOf(ARC));  in TEST()
709   EXPECT_EQ(&DRC, CG.lookupRefSCC(D));  in TEST()
715   EXPECT_FALSE(ARC.isParentOf(DRC));  in TEST()
717   EXPECT_TRUE(ARC.isAncestorOf(DRC));  in TEST()
719   EXPECT_FALSE(DRC.isChildOf(ARC));  in TEST()
721   EXPECT_TRUE(DRC.isDescendantOf(ARC));  in TEST()
730   EXPECT_EQ(&DRC, CG.lookupRefSCC(D));  in TEST()
774   LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D1);  in TEST()  local
781   ASSERT_EQ(&DRC, CG.lookupRefSCC(D2));  in TEST()
782   ASSERT_EQ(&DRC, CG.lookupRefSCC(D3));  in TEST()
807   EXPECT_EQ(&DRC, MergedRCs[0]);  in TEST()
866   LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D1);  in TEST()  local
873   ASSERT_EQ(&DRC, CG.lookupRefSCC(D2));  in TEST()
874   ASSERT_EQ(&DRC, CG.lookupRefSCC(D3));  in TEST()
899   EXPECT_EQ(&DRC, MergedRCs[0]);  in TEST()
969   LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D);  in TEST()  local
981   EXPECT_NE(find(MergedRCs, &DRC), MergedRCs.end());  in TEST()
1042   LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D);  in TEST()  local
1055   EXPECT_NE(find(MergedRCs, &DRC), MergedRCs.end());  in TEST()
1112   LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D1);  in TEST()  local
1119   ASSERT_EQ(&DRC, CG.lookupRefSCC(D2));  in TEST()
1120   ASSERT_EQ(&DRC, CG.lookupRefSCC(D3));  in TEST()
1162   DRC.insertTrivialCallEdge(D1, D3);  in TEST()
1166   auto NewCs = DRC.switchInternalEdgeToRef(D1, D2);  in TEST()
1172   auto NewRCs = DRC.removeInternalRefEdge(D1, {&D2});  in TEST()