reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
478 if (CG.lookupSCC(*N) != CurrentC) 508 CG.lookupSCC(*N) == CurrentC &&include/llvm/Analysis/LazyCallGraph.h
977 if (SCC *C = lookupSCC(N))
lib/Analysis/CGSCCPassManager.cpp386 assert(G.lookupSCC(N) == C && "Failed to update current SCC!"); 509 SCC &TargetC = *G.lookupSCC(E.getNode()); 529 SCC &TargetC = *G.lookupSCC(*TargetN); 556 assert(G.lookupSCC(N) == C && "Changed the SCC when splitting RefSCCs!"); 579 SCC &TargetC = *G.lookupSCC(*RefTarget); 608 SCC &TargetC = *G.lookupSCC(*CallTarget); 655 assert(G.lookupSCC(N) == C && "Failed to update current SCC!");lib/Analysis/LazyCallGraph.cpp
238 assert(OuterRefSCC->G->lookupSCC(*N) == this && 256 if (OuterRefSCC->G->lookupSCC(E.getNode()) == &C) 278 SCC *CalleeC = G.lookupSCC(E.getNode()); 340 SCC &TargetSCC = *G->lookupSCC(E.getNode()); 542 SCC &SourceSCC = *G->lookupSCC(SourceN); 543 SCC &TargetSCC = *G->lookupSCC(TargetN); 576 if (ConnectedSet.count(G->lookupSCC(E.getNode()))) 607 SCC &EdgeC = *G->lookupSCC(E.getNode()); 693 assert(G->lookupSCC(SourceN) != G->lookupSCC(TargetN) && 693 assert(G->lookupSCC(SourceN) != G->lookupSCC(TargetN) && 716 SCC &TargetSCC = *G->lookupSCC(TargetN); 717 assert(G->lookupSCC(SourceN) == &TargetSCC && "Source and Target must be in " 802 if (G->lookupSCC(ChildN) == &OldSCC) { 1163 SCC &SourceC = *G->lookupSCC(SourceN); 1165 return G->lookupSCC(*TargetN) == &SourceC;lib/Transforms/IPO/Inliner.cpp
979 if (CG.lookupSCC(N) != C) 1042 if (CG.lookupSCC(*CG.lookup(Callee)) == C && 1193 return CG.lookupSCC(*CG.lookup(*Callee)) == OldC; 1212 auto &DeadC = *CG.lookupSCC(*CG.lookup(*DeadF));unittests/Analysis/CGSCCPassManagerTest.cpp
977 *CGAM.getCachedResult<TestSCCAnalysis>(*CG.lookupSCC(*CG.lookup(F)));
unittests/Analysis/LazyCallGraphTest.cpp575 EXPECT_EQ(&C, CG.lookupSCC(N1)); 576 EXPECT_EQ(&C, CG.lookupSCC(N2)); 577 EXPECT_EQ(&C, CG.lookupSCC(N3)); 578 EXPECT_EQ(&C, CG.lookupSCC(N4)); 579 EXPECT_EQ(&C, CG.lookupSCC(N5)); 615 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); 616 LazyCallGraph::SCC &BC = *CG.lookupSCC(B); 617 LazyCallGraph::SCC &CC = *CG.lookupSCC(C); 618 LazyCallGraph::SCC &DC = *CG.lookupSCC(D); 658 EXPECT_EQ(&AC, CG.lookupSCC(A)); 659 EXPECT_EQ(&BC, CG.lookupSCC(B)); 660 EXPECT_EQ(&CC, CG.lookupSCC(C)); 661 EXPECT_EQ(&DC, CG.lookupSCC(D)); 679 EXPECT_EQ(&AC, CG.lookupSCC(A)); 680 EXPECT_EQ(&BC, CG.lookupSCC(B)); 681 EXPECT_EQ(&CC, CG.lookupSCC(C)); 682 EXPECT_EQ(&DC, CG.lookupSCC(D)); 700 EXPECT_EQ(&AC, CG.lookupSCC(A)); 701 EXPECT_EQ(&BC, CG.lookupSCC(B)); 702 EXPECT_EQ(&CC, CG.lookupSCC(C)); 703 EXPECT_EQ(&DC, CG.lookupSCC(D)); 721 EXPECT_EQ(&AC, CG.lookupSCC(A)); 722 EXPECT_EQ(&BC, CG.lookupSCC(B)); 723 EXPECT_EQ(&CC, CG.lookupSCC(C)); 724 EXPECT_EQ(&DC, CG.lookupSCC(D)); 960 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); 961 LazyCallGraph::SCC &BC = *CG.lookupSCC(B); 962 LazyCallGraph::SCC &CC = *CG.lookupSCC(C); 963 LazyCallGraph::SCC &DC = *CG.lookupSCC(D); 1163 LazyCallGraph::SCC &DC = *CG.lookupSCC(D2); 1165 EXPECT_EQ(&DC, CG.lookupSCC(D2)); 1168 EXPECT_EQ(&NewDC, CG.lookupSCC(D1)); 1169 EXPECT_EQ(&NewDC, CG.lookupSCC(D3)); 1248 EXPECT_EQ(&*RC.begin(), CG.lookupSCC(A)); 1249 EXPECT_EQ(&*RC.begin(), CG.lookupSCC(B)); 1250 EXPECT_EQ(&*RC.begin(), CG.lookupSCC(C)); 1259 EXPECT_EQ(&*RC.begin(), CG.lookupSCC(A)); 1260 EXPECT_EQ(&*RC.begin(), CG.lookupSCC(B)); 1261 EXPECT_EQ(&*RC.begin(), CG.lookupSCC(C)); 1274 EXPECT_EQ(&*J++, CG.lookupSCC(B)); 1275 EXPECT_EQ(&*J++, CG.lookupSCC(A)); 1276 EXPECT_EQ(&*J++, CG.lookupSCC(C)); 1287 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); 1288 LazyCallGraph::SCC &CC = *CG.lookupSCC(C); 1294 EXPECT_EQ(&CC, CG.lookupSCC(A)); 1295 EXPECT_EQ(&CC, CG.lookupSCC(C)); 1297 EXPECT_EQ(&*J++, CG.lookupSCC(B)); 1298 EXPECT_EQ(&*J++, CG.lookupSCC(C)); 1489 EXPECT_EQ(&C, CG.lookupSCC(AN)); 1490 EXPECT_EQ(&C, CG.lookupSCC(BN)); 1491 EXPECT_EQ(&C, CG.lookupSCC(CN)); 1500 EXPECT_EQ(&C, CG.lookupSCC(AN)); 1501 EXPECT_EQ(&C, CG.lookupSCC(BN)); 1502 EXPECT_EQ(&C, CG.lookupSCC(CN)); 1516 EXPECT_EQ(&C, CG.lookupSCC(AN)); 1517 EXPECT_EQ(&C, CG.lookupSCC(BN)); 1518 EXPECT_EQ(&C, CG.lookupSCC(CN)); 1563 EXPECT_EQ(&AC, CG.lookupSCC(AN)); 1564 EXPECT_EQ(&AC, CG.lookupSCC(BN)); 1565 EXPECT_EQ(&AC, CG.lookupSCC(CN)); 1573 EXPECT_EQ(&AC, CG.lookupSCC(AN)); 1574 EXPECT_EQ(&AC, CG.lookupSCC(BN)); 1575 EXPECT_EQ(&AC, CG.lookupSCC(CN)); 1582 EXPECT_EQ(&AC, CG.lookupSCC(AN)); 1583 LazyCallGraph::SCC &BC = *CG.lookupSCC(BN); 1585 EXPECT_EQ(&BC, CG.lookupSCC(CN)); 1598 EXPECT_EQ(&AC, CG.lookupSCC(AN)); 1599 EXPECT_EQ(&BC, CG.lookupSCC(BN)); 1600 LazyCallGraph::SCC &CC = *CG.lookupSCC(CN); 1654 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); 1655 LazyCallGraph::SCC &BC = *CG.lookupSCC(B); 1656 LazyCallGraph::SCC &CC = *CG.lookupSCC(C); 1657 LazyCallGraph::SCC &DC = *CG.lookupSCC(D); 1695 EXPECT_EQ(&BC, CG.lookupSCC(B)); 1696 EXPECT_EQ(&BC, CG.lookupSCC(C)); 1770 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); 1771 LazyCallGraph::SCC &B1C = *CG.lookupSCC(B1); 1772 LazyCallGraph::SCC &B2C = *CG.lookupSCC(B2); 1773 LazyCallGraph::SCC &B3C = *CG.lookupSCC(B3); 1774 LazyCallGraph::SCC &C1C = *CG.lookupSCC(C1); 1775 LazyCallGraph::SCC &C2C = *CG.lookupSCC(C2); 1776 LazyCallGraph::SCC &C3C = *CG.lookupSCC(C3); 1777 LazyCallGraph::SCC &DC = *CG.lookupSCC(D); 1899 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); 1900 LazyCallGraph::SCC &BC = *CG.lookupSCC(B); 1901 LazyCallGraph::SCC &CC = *CG.lookupSCC(C); 1902 LazyCallGraph::SCC &DC = *CG.lookupSCC(D); 1903 LazyCallGraph::SCC &EC = *CG.lookupSCC(E); 1904 LazyCallGraph::SCC &FC = *CG.lookupSCC(F); 1905 LazyCallGraph::SCC &GC = *CG.lookupSCC(G); 2061 EXPECT_EQ(&C1, CG.lookupSCC(DN)); 2062 EXPECT_EQ(&C1, CG.lookupSCC(CN)); 2063 EXPECT_EQ(&C2, CG.lookupSCC(BN)); 2153 EXPECT_EQ(&C1, CG.lookupSCC(DN)); 2154 EXPECT_EQ(&C1, CG.lookupSCC(CN)); 2155 EXPECT_EQ(&C2, CG.lookupSCC(BN));