Lines Matching defs:BN

1487   LazyCallGraph::Node &BN = *CG.lookup(lookupFunction(*M, "b"));
1490   EXPECT_EQ(&RC, CG.lookupRefSCC(BN));
1493   EXPECT_EQ(&C, CG.lookupSCC(BN));
1501   EXPECT_EQ(&RC, CG.lookupRefSCC(BN));
1504   EXPECT_EQ(&C, CG.lookupSCC(BN));
1513   NewRCs = RC.removeInternalRefEdges({{&BN, &AN}});
1514   NewRCs = RC.removeInternalRefEdges({{&CN, &BN}});
1517   EXPECT_EQ(&RC, CG.lookupRefSCC(BN));
1520   EXPECT_EQ(&C, CG.lookupSCC(BN));
1564   LazyCallGraph::Node &BN = *CG.lookup(lookupFunction(*M, "b"));
1567   EXPECT_EQ(&AC, CG.lookupSCC(BN));
1573   auto NewCs = RC.switchInternalEdgeToRef(BN, AN);
1577   EXPECT_EQ(&AC, CG.lookupSCC(BN));
1586   LazyCallGraph::SCC &BC = *CG.lookupSCC(BN);
1598   NewCs = RC.switchInternalEdgeToRef(CN, BN);
1602   EXPECT_EQ(&BC, CG.lookupSCC(BN));
2062   LazyCallGraph::Node &BN = *CG.lookup(lookupFunction(*M, "b"));
2067   EXPECT_EQ(&C2, CG.lookupSCC(BN));
2070   EXPECT_EQ(&RC1, CG.lookupRefSCC(BN));
2093   EXPECT_EQ(&DN, &(*BN)[DN].getNode());
2130   LazyCallGraph::Node &BN = CG.get(lookupFunction(*M, "b"));
2135   BN.populate();
2140   CG.insertEdge(BN, DeadN, LazyCallGraph::Edge::Ref);
2159   EXPECT_EQ(&C2, CG.lookupSCC(BN));
2162   EXPECT_EQ(&RC1, CG.lookupRefSCC(BN));
2195   LazyCallGraph::Node &BN = CG.get(lookupFunction(*M, "b"));
2198   BN.populate();
2212   EXPECT_EQ(&RC, CG.lookupRefSCC(BN));
2224   EXPECT_EQ(CG.lookupRefSCC(BN), &*I++);
2250   LazyCallGraph::Node &BN = CG.get(lookupFunction(*M, "b"));
2254   BN.populate();
2269   EXPECT_EQ(&RC, CG.lookupRefSCC(BN));
2283   EXPECT_EQ(CG.lookupRefSCC(BN), &*I++);
2304   LazyCallGraph::Node &BN = CG.get(lookupFunction(*M, "b"));
2307   BN.populate();
2311   CG.insertEdge(BN, AN, LazyCallGraph::Edge::Ref);
2322   EXPECT_EQ(&RC, CG.lookupRefSCC(BN));
2334   EXPECT_EQ(CG.lookupRefSCC(BN), &*I++);