Lines Matching refs:LazyCallGraph
220 static LazyCallGraph buildCG(Module &M) { in buildCG()
225 LazyCallGraph CG(M, GetTLI); in buildCG()
232 LazyCallGraph CG = buildCG(*M); in TEST()
238 LazyCallGraph::Node &A1 = (I++)->getNode(); in TEST()
240 LazyCallGraph::Node &A2 = (I++)->getNode(); in TEST()
242 LazyCallGraph::Node &A3 = (I++)->getNode(); in TEST()
244 LazyCallGraph::Node &B1 = (I++)->getNode(); in TEST()
246 LazyCallGraph::Node &B2 = (I++)->getNode(); in TEST()
248 LazyCallGraph::Node &B3 = (I++)->getNode(); in TEST()
250 LazyCallGraph::Node &C1 = (I++)->getNode(); in TEST()
252 LazyCallGraph::Node &C2 = (I++)->getNode(); in TEST()
254 LazyCallGraph::Node &C3 = (I++)->getNode(); in TEST()
256 LazyCallGraph::Node &D1 = (I++)->getNode(); in TEST()
258 LazyCallGraph::Node &D2 = (I++)->getNode(); in TEST()
260 LazyCallGraph::Node &D3 = (I++)->getNode(); in TEST()
268 for (LazyCallGraph::Edge &E : A1.populate()) in TEST()
283 for (LazyCallGraph::Edge &E : B1.populate()) in TEST()
297 for (LazyCallGraph::Edge &E : C1.populate()) in TEST()
325 LazyCallGraph::RefSCC &D = *J++; in TEST()
327 for (LazyCallGraph::Node &N : *D.begin()) in TEST()
341 LazyCallGraph::RefSCC &B = *J++; in TEST()
343 for (LazyCallGraph::Node &N : *B.begin()) in TEST()
357 LazyCallGraph::RefSCC &C = *J++; in TEST()
359 for (LazyCallGraph::Node &N : *C.begin()) in TEST()
375 LazyCallGraph::RefSCC &A = *J++; in TEST()
377 for (LazyCallGraph::Node &N : *A.begin()) in TEST()
420 LazyCallGraph CG = buildCG(*M); in TEST()
422 LazyCallGraph::Node &A = CG.get(lookupFunction(*M, "a")); in TEST()
423 LazyCallGraph::Node &B = CG.get(lookupFunction(*M, "b")); in TEST()
429 LazyCallGraph::Node &C = CG.get(lookupFunction(*M, "c")); in TEST()
431 CG.insertEdge(B, C, LazyCallGraph::Edge::Call); in TEST()
435 CG.insertEdge(C, B, LazyCallGraph::Edge::Call); in TEST()
439 CG.insertEdge(C, C, LazyCallGraph::Edge::Call); in TEST()
458 LazyCallGraph CG = buildCG(*M); in TEST()
462 LazyCallGraph::Node &D1 = CG.get(lookupFunction(*M, "d1")); in TEST()
463 LazyCallGraph::Node &A1 = CG.get(lookupFunction(*M, "a1")); in TEST()
466 CG.insertEdge(D1, A1, LazyCallGraph::Edge::Ref); in TEST()
475 LazyCallGraph::RefSCC &RC = *I++; in TEST()
480 LazyCallGraph::SCC &D = *J++; in TEST()
481 for (LazyCallGraph::Node &N : D) in TEST()
490 LazyCallGraph::SCC &B = *J++; in TEST()
491 for (LazyCallGraph::Node &N : B) in TEST()
500 LazyCallGraph::SCC &C = *J++; in TEST()
501 for (LazyCallGraph::Node &N : C) in TEST()
510 LazyCallGraph::SCC &A = *J++; in TEST()
511 for (LazyCallGraph::Node &N : A) in TEST()
555 LazyCallGraph CG = buildCG(*M); in TEST()
560 LazyCallGraph::RefSCC &RC = *I++; in TEST()
563 LazyCallGraph::Node &N1 = *CG.lookup(lookupFunction(*M, "f1")); in TEST()
564 LazyCallGraph::Node &N2 = *CG.lookup(lookupFunction(*M, "f2")); in TEST()
565 LazyCallGraph::Node &N3 = *CG.lookup(lookupFunction(*M, "f3")); in TEST()
566 LazyCallGraph::Node &N4 = *CG.lookup(lookupFunction(*M, "f4")); in TEST()
567 LazyCallGraph::Node &N5 = *CG.lookup(lookupFunction(*M, "f4")); in TEST()
576 LazyCallGraph::SCC &C = *RC.begin(); in TEST()
606 LazyCallGraph CG = buildCG(*M); in TEST()
610 for (LazyCallGraph::RefSCC &RC : CG.postorder_ref_sccs()) in TEST()
613 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); in TEST()
614 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); in TEST()
615 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); in TEST()
616 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d")); in TEST()
617 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); in TEST()
618 LazyCallGraph::SCC &BC = *CG.lookupSCC(B); in TEST()
619 LazyCallGraph::SCC &CC = *CG.lookupSCC(C); in TEST()
620 LazyCallGraph::SCC &DC = *CG.lookupSCC(D); in TEST()
621 LazyCallGraph::RefSCC &ARC = *CG.lookupRefSCC(A); in TEST()
622 LazyCallGraph::RefSCC &BRC = *CG.lookupRefSCC(B); in TEST()
623 LazyCallGraph::RefSCC &CRC = *CG.lookupRefSCC(C); in TEST()
624 LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D); in TEST()
643 ARC.insertOutgoingEdge(A, D, LazyCallGraph::Edge::Call); in TEST()
645 const LazyCallGraph::Edge &NewE = (*A)[D]; in TEST()
752 LazyCallGraph CG = buildCG(*M); in TEST()
756 for (LazyCallGraph::RefSCC &RC : CG.postorder_ref_sccs()) in TEST()
759 LazyCallGraph::Node &A1 = *CG.lookup(lookupFunction(*M, "a1")); in TEST()
760 LazyCallGraph::Node &A2 = *CG.lookup(lookupFunction(*M, "a2")); in TEST()
761 LazyCallGraph::Node &A3 = *CG.lookup(lookupFunction(*M, "a3")); in TEST()
762 LazyCallGraph::Node &B1 = *CG.lookup(lookupFunction(*M, "b1")); in TEST()
763 LazyCallGraph::Node &B2 = *CG.lookup(lookupFunction(*M, "b2")); in TEST()
764 LazyCallGraph::Node &B3 = *CG.lookup(lookupFunction(*M, "b3")); in TEST()
765 LazyCallGraph::Node &C1 = *CG.lookup(lookupFunction(*M, "c1")); in TEST()
766 LazyCallGraph::Node &C2 = *CG.lookup(lookupFunction(*M, "c2")); in TEST()
767 LazyCallGraph::Node &C3 = *CG.lookup(lookupFunction(*M, "c3")); in TEST()
768 LazyCallGraph::Node &D1 = *CG.lookup(lookupFunction(*M, "d1")); in TEST()
769 LazyCallGraph::Node &D2 = *CG.lookup(lookupFunction(*M, "d2")); in TEST()
770 LazyCallGraph::Node &D3 = *CG.lookup(lookupFunction(*M, "d3")); in TEST()
771 LazyCallGraph::RefSCC &ARC = *CG.lookupRefSCC(A1); in TEST()
772 LazyCallGraph::RefSCC &BRC = *CG.lookupRefSCC(B1); in TEST()
773 LazyCallGraph::RefSCC &CRC = *CG.lookupRefSCC(C1); in TEST()
774 LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D1); in TEST()
800 for (LazyCallGraph::Edge E : *D2) { in TEST()
844 LazyCallGraph CG = buildCG(*M); in TEST()
848 for (LazyCallGraph::RefSCC &RC : CG.postorder_ref_sccs()) in TEST()
851 LazyCallGraph::Node &A1 = *CG.lookup(lookupFunction(*M, "a1")); in TEST()
852 LazyCallGraph::Node &A2 = *CG.lookup(lookupFunction(*M, "a2")); in TEST()
853 LazyCallGraph::Node &A3 = *CG.lookup(lookupFunction(*M, "a3")); in TEST()
854 LazyCallGraph::Node &B1 = *CG.lookup(lookupFunction(*M, "b1")); in TEST()
855 LazyCallGraph::Node &B2 = *CG.lookup(lookupFunction(*M, "b2")); in TEST()
856 LazyCallGraph::Node &B3 = *CG.lookup(lookupFunction(*M, "b3")); in TEST()
857 LazyCallGraph::Node &C1 = *CG.lookup(lookupFunction(*M, "c1")); in TEST()
858 LazyCallGraph::Node &C2 = *CG.lookup(lookupFunction(*M, "c2")); in TEST()
859 LazyCallGraph::Node &C3 = *CG.lookup(lookupFunction(*M, "c3")); in TEST()
860 LazyCallGraph::Node &D1 = *CG.lookup(lookupFunction(*M, "d1")); in TEST()
861 LazyCallGraph::Node &D2 = *CG.lookup(lookupFunction(*M, "d2")); in TEST()
862 LazyCallGraph::Node &D3 = *CG.lookup(lookupFunction(*M, "d3")); in TEST()
863 LazyCallGraph::RefSCC &ARC = *CG.lookupRefSCC(A1); in TEST()
864 LazyCallGraph::RefSCC &BRC = *CG.lookupRefSCC(B1); in TEST()
865 LazyCallGraph::RefSCC &CRC = *CG.lookupRefSCC(C1); in TEST()
866 LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D1); in TEST()
892 for (LazyCallGraph::Edge E : *D2) { in TEST()
951 LazyCallGraph CG = buildCG(*M); in TEST()
955 for (LazyCallGraph::RefSCC &RC : CG.postorder_ref_sccs()) in TEST()
958 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); in TEST()
959 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); in TEST()
960 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); in TEST()
961 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d")); in TEST()
962 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); in TEST()
963 LazyCallGraph::SCC &BC = *CG.lookupSCC(B); in TEST()
964 LazyCallGraph::SCC &CC = *CG.lookupSCC(C); in TEST()
965 LazyCallGraph::SCC &DC = *CG.lookupSCC(D); in TEST()
966 LazyCallGraph::RefSCC &ARC = *CG.lookupRefSCC(A); in TEST()
967 LazyCallGraph::RefSCC &BRC = *CG.lookupRefSCC(B); in TEST()
968 LazyCallGraph::RefSCC &CRC = *CG.lookupRefSCC(C); in TEST()
969 LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D); in TEST()
1028 LazyCallGraph CG = buildCG(*M); in TEST()
1032 for (LazyCallGraph::RefSCC &RC : CG.postorder_ref_sccs()) in TEST()
1035 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); in TEST()
1036 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); in TEST()
1037 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); in TEST()
1038 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d")); in TEST()
1039 LazyCallGraph::RefSCC &ARC = *CG.lookupRefSCC(A); in TEST()
1040 LazyCallGraph::RefSCC &BRC = *CG.lookupRefSCC(B); in TEST()
1041 LazyCallGraph::RefSCC &CRC = *CG.lookupRefSCC(C); in TEST()
1042 LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D); in TEST()
1090 LazyCallGraph CG = buildCG(*M); in TEST()
1094 for (LazyCallGraph::RefSCC &RC : CG.postorder_ref_sccs()) in TEST()
1097 LazyCallGraph::Node &A1 = *CG.lookup(lookupFunction(*M, "a1")); in TEST()
1098 LazyCallGraph::Node &A2 = *CG.lookup(lookupFunction(*M, "a2")); in TEST()
1099 LazyCallGraph::Node &A3 = *CG.lookup(lookupFunction(*M, "a3")); in TEST()
1100 LazyCallGraph::Node &B1 = *CG.lookup(lookupFunction(*M, "b1")); in TEST()
1101 LazyCallGraph::Node &B2 = *CG.lookup(lookupFunction(*M, "b2")); in TEST()
1102 LazyCallGraph::Node &B3 = *CG.lookup(lookupFunction(*M, "b3")); in TEST()
1103 LazyCallGraph::Node &C1 = *CG.lookup(lookupFunction(*M, "c1")); in TEST()
1104 LazyCallGraph::Node &C2 = *CG.lookup(lookupFunction(*M, "c2")); in TEST()
1105 LazyCallGraph::Node &C3 = *CG.lookup(lookupFunction(*M, "c3")); in TEST()
1106 LazyCallGraph::Node &D1 = *CG.lookup(lookupFunction(*M, "d1")); in TEST()
1107 LazyCallGraph::Node &D2 = *CG.lookup(lookupFunction(*M, "d2")); in TEST()
1108 LazyCallGraph::Node &D3 = *CG.lookup(lookupFunction(*M, "d3")); in TEST()
1109 LazyCallGraph::RefSCC &ARC = *CG.lookupRefSCC(A1); in TEST()
1110 LazyCallGraph::RefSCC &BRC = *CG.lookupRefSCC(B1); in TEST()
1111 LazyCallGraph::RefSCC &CRC = *CG.lookupRefSCC(C1); in TEST()
1112 LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D1); in TEST()
1165 LazyCallGraph::SCC &DC = *CG.lookupSCC(D2); in TEST()
1169 LazyCallGraph::SCC &NewDC = *NewCs.begin(); in TEST()
1174 LazyCallGraph::RefSCC &NewDRC = *NewRCs[0]; in TEST()
1177 LazyCallGraph::RefSCC &D2RC = *NewRCs[1]; in TEST()
1235 LazyCallGraph CG = buildCG(*M); in TEST()
1240 LazyCallGraph::RefSCC &RC = *I++; in TEST()
1243 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); in TEST()
1244 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); in TEST()
1245 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); in TEST()
1289 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); in TEST()
1290 LazyCallGraph::SCC &CC = *CG.lookupSCC(C); in TEST()
1291 EXPECT_TRUE(RC.switchInternalEdgeToCall(A, C, [&](ArrayRef<LazyCallGraph::SCC *> MergedCs) { in TEST()
1329 LazyCallGraph CG = buildCG(*M); in TEST()
1334 LazyCallGraph::RefSCC &RC = *I; in TEST()
1337 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); in TEST()
1338 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); in TEST()
1339 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); in TEST()
1346 SmallVector<LazyCallGraph::RefSCC *, 1> NewRCs = in TEST()
1365 LazyCallGraph::RefSCC &BCRC = *NewRCs[0]; in TEST()
1366 LazyCallGraph::RefSCC &ARC = *NewRCs[1]; in TEST()
1407 LazyCallGraph CG = buildCG(*M); in TEST()
1412 LazyCallGraph::RefSCC &RC = *I; in TEST()
1415 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); in TEST()
1416 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); in TEST()
1417 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); in TEST()
1427 SmallVector<LazyCallGraph::RefSCC *, 1> NewRCs = in TEST()
1431 LazyCallGraph::RefSCC &BRC = *NewRCs[0]; in TEST()
1432 LazyCallGraph::RefSCC &ACRC = *NewRCs[1]; in TEST()
1474 LazyCallGraph CG = buildCG(*M); in TEST()
1479 LazyCallGraph::RefSCC &RC = *I; in TEST()
1482 LazyCallGraph::SCC &C = *RC.begin(); in TEST()
1485 LazyCallGraph::Node &AN = *CG.lookup(lookupFunction(*M, "a")); in TEST()
1486 LazyCallGraph::Node &BN = *CG.lookup(lookupFunction(*M, "b")); in TEST()
1487 LazyCallGraph::Node &CN = *CG.lookup(lookupFunction(*M, "c")); in TEST()
1496 SmallVector<LazyCallGraph::RefSCC *, 1> NewRCs = in TEST()
1551 LazyCallGraph CG = buildCG(*M); in TEST()
1556 LazyCallGraph::RefSCC &RC = *I++; in TEST()
1560 LazyCallGraph::SCC &AC = *RC.begin(); in TEST()
1562 LazyCallGraph::Node &AN = *CG.lookup(lookupFunction(*M, "a")); in TEST()
1563 LazyCallGraph::Node &BN = *CG.lookup(lookupFunction(*M, "b")); in TEST()
1564 LazyCallGraph::Node &CN = *CG.lookup(lookupFunction(*M, "c")); in TEST()
1585 LazyCallGraph::SCC &BC = *CG.lookupSCC(BN); in TEST()
1602 LazyCallGraph::SCC &CC = *CG.lookupSCC(CN); in TEST()
1644 LazyCallGraph CG = buildCG(*M); in TEST()
1649 LazyCallGraph::RefSCC &RC = *I++; in TEST()
1652 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); in TEST()
1653 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); in TEST()
1654 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); in TEST()
1655 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d")); in TEST()
1656 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); in TEST()
1657 LazyCallGraph::SCC &BC = *CG.lookupSCC(B); in TEST()
1658 LazyCallGraph::SCC &CC = *CG.lookupSCC(C); in TEST()
1659 LazyCallGraph::SCC &DC = *CG.lookupSCC(D); in TEST()
1688 EXPECT_TRUE(RC.switchInternalEdgeToCall(C, B, [&](ArrayRef<LazyCallGraph::SCC *> MergedCs) { in TEST()
1756 LazyCallGraph CG = buildCG(*M); in TEST()
1761 LazyCallGraph::RefSCC &RC = *I++; in TEST()
1764 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); in TEST()
1765 LazyCallGraph::Node &B1 = *CG.lookup(lookupFunction(*M, "b1")); in TEST()
1766 LazyCallGraph::Node &B2 = *CG.lookup(lookupFunction(*M, "b2")); in TEST()
1767 LazyCallGraph::Node &B3 = *CG.lookup(lookupFunction(*M, "b3")); in TEST()
1768 LazyCallGraph::Node &C1 = *CG.lookup(lookupFunction(*M, "c1")); in TEST()
1769 LazyCallGraph::Node &C2 = *CG.lookup(lookupFunction(*M, "c2")); in TEST()
1770 LazyCallGraph::Node &C3 = *CG.lookup(lookupFunction(*M, "c3")); in TEST()
1771 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d")); in TEST()
1772 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); in TEST()
1773 LazyCallGraph::SCC &B1C = *CG.lookupSCC(B1); in TEST()
1774 LazyCallGraph::SCC &B2C = *CG.lookupSCC(B2); in TEST()
1775 LazyCallGraph::SCC &B3C = *CG.lookupSCC(B3); in TEST()
1776 LazyCallGraph::SCC &C1C = *CG.lookupSCC(C1); in TEST()
1777 LazyCallGraph::SCC &C2C = *CG.lookupSCC(C2); in TEST()
1778 LazyCallGraph::SCC &C3C = *CG.lookupSCC(C3); in TEST()
1779 LazyCallGraph::SCC &DC = *CG.lookupSCC(D); in TEST()
1886 LazyCallGraph CG = buildCG(*M); in TEST()
1891 LazyCallGraph::RefSCC &RC = *I++; in TEST()
1894 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); in TEST()
1895 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); in TEST()
1896 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); in TEST()
1897 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d")); in TEST()
1898 LazyCallGraph::Node &E = *CG.lookup(lookupFunction(*M, "e")); in TEST()
1899 LazyCallGraph::Node &F = *CG.lookup(lookupFunction(*M, "f")); in TEST()
1900 LazyCallGraph::Node &G = *CG.lookup(lookupFunction(*M, "g")); in TEST()
1901 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); in TEST()
1902 LazyCallGraph::SCC &BC = *CG.lookupSCC(B); in TEST()
1903 LazyCallGraph::SCC &CC = *CG.lookupSCC(C); in TEST()
1904 LazyCallGraph::SCC &DC = *CG.lookupSCC(D); in TEST()
1905 LazyCallGraph::SCC &EC = *CG.lookupSCC(E); in TEST()
1906 LazyCallGraph::SCC &FC = *CG.lookupSCC(F); in TEST()
1907 LazyCallGraph::SCC &GC = *CG.lookupSCC(G); in TEST()
1936 F, B, [&](ArrayRef<LazyCallGraph::SCC *> MergedCs) { in TEST()
1969 LazyCallGraph CG = buildCG(*M); in TEST()
1973 LazyCallGraph::RefSCC &FRC = *I++; in TEST()
1974 LazyCallGraph::RefSCC &GRC = *I++; in TEST()
1977 LazyCallGraph::Node &F = *CG.lookup(lookupFunction(*M, "f")); in TEST()
1978 LazyCallGraph::Node &G = *CG.lookup(lookupFunction(*M, "g")); in TEST()
1998 LazyCallGraph CG = buildCG(*M); in TEST()
2002 LazyCallGraph::RefSCC &FRC = *I++; in TEST()
2003 LazyCallGraph::RefSCC &GRC = *I++; in TEST()
2006 LazyCallGraph::Node &F = *CG.lookup(lookupFunction(*M, "f")); in TEST()
2007 LazyCallGraph::Node &G = *CG.lookup(lookupFunction(*M, "g")); in TEST()
2047 LazyCallGraph CG = buildCG(*M); in TEST()
2052 LazyCallGraph::RefSCC &RC1 = *I++; in TEST()
2053 LazyCallGraph::RefSCC &RC2 = *I++; in TEST()
2057 LazyCallGraph::SCC &C1 = RC1[0]; in TEST()
2058 LazyCallGraph::SCC &C2 = RC1[1]; in TEST()
2060 LazyCallGraph::Node &AN = *CG.lookup(lookupFunction(*M, "a")); in TEST()
2061 LazyCallGraph::Node &BN = *CG.lookup(lookupFunction(*M, "b")); in TEST()
2062 LazyCallGraph::Node &CN = *CG.lookup(lookupFunction(*M, "c")); in TEST()
2063 LazyCallGraph::Node &DN = *CG.lookup(lookupFunction(*M, "d")); in TEST()
2125 LazyCallGraph CG = buildCG(*M); in TEST()
2128 LazyCallGraph::Node &AN = CG.get(lookupFunction(*M, "a")); in TEST()
2129 LazyCallGraph::Node &BN = CG.get(lookupFunction(*M, "b")); in TEST()
2130 LazyCallGraph::Node &CN = CG.get(lookupFunction(*M, "c")); in TEST()
2131 LazyCallGraph::Node &DN = CG.get(lookupFunction(*M, "d")); in TEST()
2132 LazyCallGraph::Node &DeadN = CG.get(lookupFunction(*M, "dead")); in TEST()
2138 CG.insertEdge(AN, DeadN, LazyCallGraph::Edge::Ref); in TEST()
2139 CG.insertEdge(BN, DeadN, LazyCallGraph::Edge::Ref); in TEST()
2140 CG.insertEdge(CN, DeadN, LazyCallGraph::Edge::Ref); in TEST()
2141 CG.insertEdge(DN, DeadN, LazyCallGraph::Edge::Ref); in TEST()
2146 LazyCallGraph::RefSCC &DeadRC = *I++; in TEST()
2147 LazyCallGraph::RefSCC &RC1 = *I++; in TEST()
2148 LazyCallGraph::RefSCC &RC2 = *I++; in TEST()
2152 LazyCallGraph::SCC &C1 = RC1[0]; in TEST()
2153 LazyCallGraph::SCC &C2 = RC1[1]; in TEST()
2181 LazyCallGraph CG = buildCG(*M); in TEST()
2184 LazyCallGraph::Node &FN = CG.get(F); in TEST()
2189 LazyCallGraph::RefSCC *ORC = &*I++; in TEST()
2204 LazyCallGraph::Node *GN = CG.lookup(*G); in TEST()
2208 LazyCallGraph::RefSCC *RC1 = &*I++; in TEST()
2210 LazyCallGraph::RefSCC *RC2 = &*I++; in TEST()
2221 LazyCallGraph CG = buildCG(*M); in TEST()
2224 LazyCallGraph::Node &FN = CG.get(F); in TEST()
2229 LazyCallGraph::RefSCC *ORC = &*I++; in TEST()
2245 LazyCallGraph::Node *GN = CG.lookup(*G); in TEST()
2249 LazyCallGraph::RefSCC *RC1 = &*I++; in TEST()
2251 LazyCallGraph::RefSCC *RC2 = &*I++; in TEST()
2262 LazyCallGraph CG = buildCG(*M); in TEST()
2265 LazyCallGraph::Node &FN = CG.get(F); in TEST()
2270 LazyCallGraph::RefSCC *ORC = &*I++; in TEST()
2287 LazyCallGraph::Node *GN = CG.lookup(*G); in TEST()
2291 LazyCallGraph::RefSCC *RC = &*I++; in TEST()
2306 LazyCallGraph CG = buildCG(*M); in TEST()
2309 LazyCallGraph::Node &FN = CG.get(F); in TEST()
2314 LazyCallGraph::RefSCC *ORC = &*I++; in TEST()
2332 LazyCallGraph::Node *GN = CG.lookup(*G); in TEST()
2336 LazyCallGraph::RefSCC *RC = &*I++; in TEST()
2352 LazyCallGraph CG = buildCG(*M); in TEST()
2355 LazyCallGraph::Node &FN = CG.get(F); in TEST()
2360 LazyCallGraph::RefSCC *ORC = &*I++; in TEST()
2378 LazyCallGraph::Node *GN = CG.lookup(*G); in TEST()
2382 LazyCallGraph::RefSCC *RC = &*I++; in TEST()
2397 LazyCallGraph CG = buildCG(*M); in TEST()
2400 LazyCallGraph::Node &FN = CG.get(F); in TEST()
2405 LazyCallGraph::RefSCC *ORC = &*I++; in TEST()
2422 LazyCallGraph::Node *GN = CG.lookup(*G); in TEST()
2426 LazyCallGraph::RefSCC *RC = &*I++; in TEST()
2446 LazyCallGraph CG = buildCG(*M); in TEST()
2449 LazyCallGraph::Node &FN = CG.get(F); in TEST()
2451 LazyCallGraph::Node &F2N = CG.get(F2); in TEST()
2456 LazyCallGraph::RefSCC *ORC = &*I++; in TEST()
2473 LazyCallGraph::Node *GN = CG.lookup(*G); in TEST()
2477 LazyCallGraph::RefSCC *RC = &*I++; in TEST()
2498 LazyCallGraph CG = buildCG(*M); in TEST()
2501 LazyCallGraph::Node &FN = CG.get(F); in TEST()
2503 LazyCallGraph::Node &F2N = CG.get(F2); in TEST()
2508 LazyCallGraph::RefSCC *ORC = &*I++; in TEST()
2526 LazyCallGraph::Node *GN = CG.lookup(*G); in TEST()
2530 LazyCallGraph::RefSCC *RC = &*I++; in TEST()
2551 LazyCallGraph CG = buildCG(*M); in TEST()
2554 LazyCallGraph::Node &FN = CG.get(F); in TEST()
2556 LazyCallGraph::Node &F2N = CG.get(F2); in TEST()
2561 LazyCallGraph::RefSCC *ORC = &*I++; in TEST()
2578 LazyCallGraph::Node *GN = CG.lookup(*G); in TEST()
2582 LazyCallGraph::RefSCC *RC = &*I++; in TEST()
2598 LazyCallGraph CG = buildCG(*M); in TEST()
2601 LazyCallGraph::Node &FN = CG.get(F); in TEST()
2606 LazyCallGraph::RefSCC *ORC = &*I++; in TEST()
2622 LazyCallGraph::Node *GN = CG.lookup(*G); in TEST()
2626 LazyCallGraph::RefSCC *RC1 = &*I++; in TEST()
2628 LazyCallGraph::RefSCC *RC2 = &*I++; in TEST()
2639 LazyCallGraph CG = buildCG(*M); in TEST()
2642 LazyCallGraph::Node &FN = CG.get(F); in TEST()
2647 LazyCallGraph::RefSCC *ORC = &*I++; in TEST()
2665 LazyCallGraph::Node *GN = CG.lookup(*G); in TEST()
2669 LazyCallGraph::RefSCC *RC = &*I++; in TEST()
2685 LazyCallGraph CG = buildCG(*M); in TEST()
2688 LazyCallGraph::Node &FN = CG.get(F); in TEST()
2693 LazyCallGraph::RefSCC *ORC = &*I++; in TEST()
2718 LazyCallGraph::Node *G1N = CG.lookup(*G1); in TEST()
2720 LazyCallGraph::Node *G2N = CG.lookup(*G2); in TEST()
2724 LazyCallGraph::RefSCC *RC1 = &*I++; in TEST()
2728 LazyCallGraph::RefSCC *RC2 = &*I++; in TEST()
2739 LazyCallGraph CG = buildCG(*M); in TEST()
2742 LazyCallGraph::Node &FN = CG.get(F); in TEST()
2747 LazyCallGraph::RefSCC *ORC = &*I++; in TEST()
2774 LazyCallGraph::Node *G1N = CG.lookup(*G1); in TEST()
2776 LazyCallGraph::Node *G2N = CG.lookup(*G2); in TEST()
2780 LazyCallGraph::RefSCC *RC = &*I++; in TEST()
2804 LazyCallGraph CG = buildCG(*M); in TEST()
2807 LazyCallGraph::Node &FN = CG.get(F); in TEST()
2809 LazyCallGraph::Node &F2N = CG.get(F); in TEST()
2814 LazyCallGraph::RefSCC *ORC = &*I++; in TEST()
2841 LazyCallGraph::Node *G1N = CG.lookup(*G1); in TEST()
2843 LazyCallGraph::Node *G2N = CG.lookup(*G2); in TEST()
2847 LazyCallGraph::RefSCC *RC = &*I++; in TEST()