reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
454 Node &CalleeN = *G.lookup(*Callee); 479 Node &RefereeN = *G.lookup(Referee);lib/Transforms/IPO/Inliner.cpp
978 LazyCallGraph::Node &N = *CG.lookup(F); 1042 if (CG.lookupSCC(*CG.lookup(Callee)) == C && 1155 LazyCallGraph::Node &CalleeN = *CG.lookup(*InlinedCallee); 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.cpp561 LazyCallGraph::Node &N1 = *CG.lookup(lookupFunction(*M, "f1")); 562 LazyCallGraph::Node &N2 = *CG.lookup(lookupFunction(*M, "f2")); 563 LazyCallGraph::Node &N3 = *CG.lookup(lookupFunction(*M, "f3")); 564 LazyCallGraph::Node &N4 = *CG.lookup(lookupFunction(*M, "f4")); 565 LazyCallGraph::Node &N5 = *CG.lookup(lookupFunction(*M, "f4")); 611 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); 612 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); 613 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); 614 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d")); 757 LazyCallGraph::Node &A1 = *CG.lookup(lookupFunction(*M, "a1")); 758 LazyCallGraph::Node &A2 = *CG.lookup(lookupFunction(*M, "a2")); 759 LazyCallGraph::Node &A3 = *CG.lookup(lookupFunction(*M, "a3")); 760 LazyCallGraph::Node &B1 = *CG.lookup(lookupFunction(*M, "b1")); 761 LazyCallGraph::Node &B2 = *CG.lookup(lookupFunction(*M, "b2")); 762 LazyCallGraph::Node &B3 = *CG.lookup(lookupFunction(*M, "b3")); 763 LazyCallGraph::Node &C1 = *CG.lookup(lookupFunction(*M, "c1")); 764 LazyCallGraph::Node &C2 = *CG.lookup(lookupFunction(*M, "c2")); 765 LazyCallGraph::Node &C3 = *CG.lookup(lookupFunction(*M, "c3")); 766 LazyCallGraph::Node &D1 = *CG.lookup(lookupFunction(*M, "d1")); 767 LazyCallGraph::Node &D2 = *CG.lookup(lookupFunction(*M, "d2")); 768 LazyCallGraph::Node &D3 = *CG.lookup(lookupFunction(*M, "d3")); 849 LazyCallGraph::Node &A1 = *CG.lookup(lookupFunction(*M, "a1")); 850 LazyCallGraph::Node &A2 = *CG.lookup(lookupFunction(*M, "a2")); 851 LazyCallGraph::Node &A3 = *CG.lookup(lookupFunction(*M, "a3")); 852 LazyCallGraph::Node &B1 = *CG.lookup(lookupFunction(*M, "b1")); 853 LazyCallGraph::Node &B2 = *CG.lookup(lookupFunction(*M, "b2")); 854 LazyCallGraph::Node &B3 = *CG.lookup(lookupFunction(*M, "b3")); 855 LazyCallGraph::Node &C1 = *CG.lookup(lookupFunction(*M, "c1")); 856 LazyCallGraph::Node &C2 = *CG.lookup(lookupFunction(*M, "c2")); 857 LazyCallGraph::Node &C3 = *CG.lookup(lookupFunction(*M, "c3")); 858 LazyCallGraph::Node &D1 = *CG.lookup(lookupFunction(*M, "d1")); 859 LazyCallGraph::Node &D2 = *CG.lookup(lookupFunction(*M, "d2")); 860 LazyCallGraph::Node &D3 = *CG.lookup(lookupFunction(*M, "d3")); 956 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); 957 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); 958 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); 959 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d")); 1033 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); 1034 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); 1035 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); 1036 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d")); 1095 LazyCallGraph::Node &A1 = *CG.lookup(lookupFunction(*M, "a1")); 1096 LazyCallGraph::Node &A2 = *CG.lookup(lookupFunction(*M, "a2")); 1097 LazyCallGraph::Node &A3 = *CG.lookup(lookupFunction(*M, "a3")); 1098 LazyCallGraph::Node &B1 = *CG.lookup(lookupFunction(*M, "b1")); 1099 LazyCallGraph::Node &B2 = *CG.lookup(lookupFunction(*M, "b2")); 1100 LazyCallGraph::Node &B3 = *CG.lookup(lookupFunction(*M, "b3")); 1101 LazyCallGraph::Node &C1 = *CG.lookup(lookupFunction(*M, "c1")); 1102 LazyCallGraph::Node &C2 = *CG.lookup(lookupFunction(*M, "c2")); 1103 LazyCallGraph::Node &C3 = *CG.lookup(lookupFunction(*M, "c3")); 1104 LazyCallGraph::Node &D1 = *CG.lookup(lookupFunction(*M, "d1")); 1105 LazyCallGraph::Node &D2 = *CG.lookup(lookupFunction(*M, "d2")); 1106 LazyCallGraph::Node &D3 = *CG.lookup(lookupFunction(*M, "d3")); 1241 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); 1242 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); 1243 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); 1335 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); 1336 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); 1337 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); 1413 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); 1414 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); 1415 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); 1483 LazyCallGraph::Node &AN = *CG.lookup(lookupFunction(*M, "a")); 1484 LazyCallGraph::Node &BN = *CG.lookup(lookupFunction(*M, "b")); 1485 LazyCallGraph::Node &CN = *CG.lookup(lookupFunction(*M, "c")); 1560 LazyCallGraph::Node &AN = *CG.lookup(lookupFunction(*M, "a")); 1561 LazyCallGraph::Node &BN = *CG.lookup(lookupFunction(*M, "b")); 1562 LazyCallGraph::Node &CN = *CG.lookup(lookupFunction(*M, "c")); 1650 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); 1651 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); 1652 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); 1653 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d")); 1762 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); 1763 LazyCallGraph::Node &B1 = *CG.lookup(lookupFunction(*M, "b1")); 1764 LazyCallGraph::Node &B2 = *CG.lookup(lookupFunction(*M, "b2")); 1765 LazyCallGraph::Node &B3 = *CG.lookup(lookupFunction(*M, "b3")); 1766 LazyCallGraph::Node &C1 = *CG.lookup(lookupFunction(*M, "c1")); 1767 LazyCallGraph::Node &C2 = *CG.lookup(lookupFunction(*M, "c2")); 1768 LazyCallGraph::Node &C3 = *CG.lookup(lookupFunction(*M, "c3")); 1769 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d")); 1892 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); 1893 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); 1894 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); 1895 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d")); 1896 LazyCallGraph::Node &E = *CG.lookup(lookupFunction(*M, "e")); 1897 LazyCallGraph::Node &F = *CG.lookup(lookupFunction(*M, "f")); 1898 LazyCallGraph::Node &G = *CG.lookup(lookupFunction(*M, "g")); 1975 LazyCallGraph::Node &F = *CG.lookup(lookupFunction(*M, "f")); 1976 LazyCallGraph::Node &G = *CG.lookup(lookupFunction(*M, "g")); 2003 LazyCallGraph::Node &F = *CG.lookup(lookupFunction(*M, "f")); 2004 LazyCallGraph::Node &G = *CG.lookup(lookupFunction(*M, "g")); 2057 LazyCallGraph::Node &AN = *CG.lookup(lookupFunction(*M, "a")); 2058 LazyCallGraph::Node &BN = *CG.lookup(lookupFunction(*M, "b")); 2059 LazyCallGraph::Node &CN = *CG.lookup(lookupFunction(*M, "c")); 2060 LazyCallGraph::Node &DN = *CG.lookup(lookupFunction(*M, "d"));