1486   LazyCallGraph::Node &BN = *CG.lookup(lookupFunction(*M, "b"));  in TEST()  local
1489   EXPECT_EQ(&RC, CG.lookupRefSCC(BN));  in TEST()
1492   EXPECT_EQ(&C, CG.lookupSCC(BN));  in TEST()
1500   EXPECT_EQ(&RC, CG.lookupRefSCC(BN));  in TEST()
1503   EXPECT_EQ(&C, CG.lookupSCC(BN));  in TEST()
1512   NewRCs = RC.removeInternalRefEdge(BN, {&AN});  in TEST()
1513   NewRCs = RC.removeInternalRefEdge(CN, {&BN});  in TEST()
1516   EXPECT_EQ(&RC, CG.lookupRefSCC(BN));  in TEST()
1519   EXPECT_EQ(&C, CG.lookupSCC(BN));  in TEST()
1563   LazyCallGraph::Node &BN = *CG.lookup(lookupFunction(*M, "b"));  in TEST()  local
1566   EXPECT_EQ(&AC, CG.lookupSCC(BN));  in TEST()
1572   auto NewCs = RC.switchInternalEdgeToRef(BN, AN);  in TEST()
1576   EXPECT_EQ(&AC, CG.lookupSCC(BN));  in TEST()
1585   LazyCallGraph::SCC &BC = *CG.lookupSCC(BN);  in TEST()
1597   NewCs = RC.switchInternalEdgeToRef(CN, BN);  in TEST()
1601   EXPECT_EQ(&BC, CG.lookupSCC(BN));  in TEST()
2061   LazyCallGraph::Node &BN = *CG.lookup(lookupFunction(*M, "b"));  in TEST()  local
2066   EXPECT_EQ(&C2, CG.lookupSCC(BN));  in TEST()
2069   EXPECT_EQ(&RC1, CG.lookupRefSCC(BN));  in TEST()
2092   EXPECT_EQ(&DN, &(*BN)[DN].getNode());  in TEST()
2129   LazyCallGraph::Node &BN = CG.get(lookupFunction(*M, "b"));  in TEST()  local
2134   BN.populate();  in TEST()
2139   CG.insertEdge(BN, DeadN, LazyCallGraph::Edge::Ref);  in TEST()
2158   EXPECT_EQ(&C2, CG.lookupSCC(BN));  in TEST()
2161   EXPECT_EQ(&RC1, CG.lookupRefSCC(BN));  in TEST()