Lines Matching defs:AN

1486   LazyCallGraph::Node &AN = *CG.lookup(lookupFunction(*M, "a"));
1489   EXPECT_EQ(&RC, CG.lookupRefSCC(AN));
1492   EXPECT_EQ(&C, CG.lookupSCC(AN));
1498       RC.removeInternalRefEdges({{&AN, &CN}});
1500   EXPECT_EQ(&RC, CG.lookupRefSCC(AN));
1503   EXPECT_EQ(&C, CG.lookupSCC(AN));
1513   NewRCs = RC.removeInternalRefEdges({{&BN, &AN}});
1516   EXPECT_EQ(&RC, CG.lookupRefSCC(AN));
1519   EXPECT_EQ(&C, CG.lookupSCC(AN));
1563   LazyCallGraph::Node &AN = *CG.lookup(lookupFunction(*M, "a"));
1566   EXPECT_EQ(&AC, CG.lookupSCC(AN));
1573   auto NewCs = RC.switchInternalEdgeToRef(BN, AN);
1576   EXPECT_EQ(&AC, CG.lookupSCC(AN));
1582   NewCs = RC.switchInternalEdgeToRef(CN, AN);
1585   EXPECT_EQ(&AC, CG.lookupSCC(AN));
1601   EXPECT_EQ(&AC, CG.lookupSCC(AN));
2061   LazyCallGraph::Node &AN = *CG.lookup(lookupFunction(*M, "a"));
2071   EXPECT_EQ(&RC2, CG.lookupRefSCC(AN));
2129   LazyCallGraph::Node &AN = CG.get(lookupFunction(*M, "a"));
2134   AN.populate();
2139   CG.insertEdge(AN, DeadN, LazyCallGraph::Edge::Ref);
2163   EXPECT_EQ(&RC2, CG.lookupRefSCC(AN));
2194   LazyCallGraph::Node &AN = CG.get(lookupFunction(*M, "a"));
2197   AN.populate();
2201   CG.insertEdge(CN, AN, LazyCallGraph::Edge::Ref);
2211   EXPECT_EQ(&RC, CG.lookupRefSCC(AN));
2217   CG.markDeadFunction(AN.getFunction());
2218   CG.removeDeadFunctions({&AN.getFunction()});
2249   LazyCallGraph::Node &AN = CG.get(lookupFunction(*M, "a"));
2253   AN.populate();
2258   CG.insertEdge(DN, AN, LazyCallGraph::Edge::Ref);
2268   EXPECT_EQ(&RC, CG.lookupRefSCC(AN));
2275   CG.markDeadFunction(AN.getFunction());
2276   CG.removeDeadFunctions({&AN.getFunction()});
2303   LazyCallGraph::Node &AN = CG.get(lookupFunction(*M, "a"));
2306   AN.populate();
2310   CG.insertEdge(CN, AN, LazyCallGraph::Edge::Ref);
2311   CG.insertEdge(BN, AN, LazyCallGraph::Edge::Ref);
2321   EXPECT_EQ(&RC, CG.lookupRefSCC(AN));
2327   CG.markDeadFunction(AN.getFunction());
2328   CG.removeDeadFunctions({&AN.getFunction()});