Lines Matching refs:LazyCallGraph
126 LazyCallGraph CG(*M); in TEST()
132 LazyCallGraph::Node &A1 = (I++)->getNode(CG); in TEST()
134 LazyCallGraph::Node &A2 = (I++)->getNode(CG); in TEST()
136 LazyCallGraph::Node &A3 = (I++)->getNode(CG); in TEST()
138 LazyCallGraph::Node &B1 = (I++)->getNode(CG); in TEST()
140 LazyCallGraph::Node &B2 = (I++)->getNode(CG); in TEST()
142 LazyCallGraph::Node &B3 = (I++)->getNode(CG); in TEST()
144 LazyCallGraph::Node &C1 = (I++)->getNode(CG); in TEST()
146 LazyCallGraph::Node &C2 = (I++)->getNode(CG); in TEST()
148 LazyCallGraph::Node &C3 = (I++)->getNode(CG); in TEST()
150 LazyCallGraph::Node &D1 = (I++)->getNode(CG); in TEST()
152 LazyCallGraph::Node &D2 = (I++)->getNode(CG); in TEST()
154 LazyCallGraph::Node &D3 = (I++)->getNode(CG); in TEST()
162 for (LazyCallGraph::Edge &E : A1) in TEST()
175 for (LazyCallGraph::Edge &E : B1) in TEST()
187 for (LazyCallGraph::Edge &E : C1) in TEST()
209 LazyCallGraph::RefSCC &D = *J++; in TEST()
211 for (LazyCallGraph::Node &N : *D.begin()) in TEST()
224 LazyCallGraph::RefSCC &C = *J++; in TEST()
226 for (LazyCallGraph::Node &N : *C.begin()) in TEST()
239 LazyCallGraph::RefSCC &B = *J++; in TEST()
241 for (LazyCallGraph::Node &N : *B.begin()) in TEST()
256 LazyCallGraph::RefSCC &A = *J++; in TEST()
258 for (LazyCallGraph::Node &N : *A.begin()) in TEST()
299 LazyCallGraph CG(*M); in TEST()
301 LazyCallGraph::Node &A = CG.get(lookupFunction(*M, "a")); in TEST()
302 LazyCallGraph::Node &B = CG.get(lookupFunction(*M, "b")); in TEST()
306 CG.insertEdge(B, lookupFunction(*M, "c"), LazyCallGraph::Edge::Call); in TEST()
308 LazyCallGraph::Node &C = B.begin()->getNode(CG); in TEST()
311 CG.insertEdge(C, B.getFunction(), LazyCallGraph::Edge::Call); in TEST()
315 CG.insertEdge(C, C.getFunction(), LazyCallGraph::Edge::Call); in TEST()
334 LazyCallGraph CG(*M); in TEST()
339 LazyCallGraph::Edge::Ref); in TEST()
347 LazyCallGraph::RefSCC &RC = *I++; in TEST()
352 LazyCallGraph::SCC &D = *J++; in TEST()
353 for (LazyCallGraph::Node &N : D) in TEST()
362 LazyCallGraph::SCC &B = *J++; in TEST()
363 for (LazyCallGraph::Node &N : B) in TEST()
372 LazyCallGraph::SCC &C = *J++; in TEST()
373 for (LazyCallGraph::Node &N : C) in TEST()
382 LazyCallGraph::SCC &A = *J++; in TEST()
383 for (LazyCallGraph::Node &N : A) in TEST()
427 LazyCallGraph CG(*M); in TEST()
431 LazyCallGraph::RefSCC &RC = *I++; in TEST()
434 LazyCallGraph::Node &N1 = *CG.lookup(lookupFunction(*M, "f1")); in TEST()
435 LazyCallGraph::Node &N2 = *CG.lookup(lookupFunction(*M, "f2")); in TEST()
436 LazyCallGraph::Node &N3 = *CG.lookup(lookupFunction(*M, "f3")); in TEST()
437 LazyCallGraph::Node &N4 = *CG.lookup(lookupFunction(*M, "f4")); in TEST()
438 LazyCallGraph::Node &N5 = *CG.lookup(lookupFunction(*M, "f4")); in TEST()
447 LazyCallGraph::SCC &C = *RC.begin(); in TEST()
477 LazyCallGraph CG(*M); in TEST()
480 for (LazyCallGraph::RefSCC &RC : CG.postorder_ref_sccs()) in TEST()
483 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); in TEST()
484 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); in TEST()
485 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); in TEST()
486 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d")); in TEST()
487 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); in TEST()
488 LazyCallGraph::SCC &BC = *CG.lookupSCC(B); in TEST()
489 LazyCallGraph::SCC &CC = *CG.lookupSCC(C); in TEST()
490 LazyCallGraph::SCC &DC = *CG.lookupSCC(D); in TEST()
491 LazyCallGraph::RefSCC &ARC = *CG.lookupRefSCC(A); in TEST()
492 LazyCallGraph::RefSCC &BRC = *CG.lookupRefSCC(B); in TEST()
493 LazyCallGraph::RefSCC &CRC = *CG.lookupRefSCC(C); in TEST()
494 LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D); in TEST()
505 ARC.insertOutgoingEdge(A, D, LazyCallGraph::Edge::Call); in TEST()
507 const LazyCallGraph::Edge &NewE = A[D]; in TEST()
598 LazyCallGraph CG(*M); in TEST()
601 for (LazyCallGraph::RefSCC &RC : CG.postorder_ref_sccs()) in TEST()
604 LazyCallGraph::Node &A1 = *CG.lookup(lookupFunction(*M, "a1")); in TEST()
605 LazyCallGraph::Node &A2 = *CG.lookup(lookupFunction(*M, "a2")); in TEST()
606 LazyCallGraph::Node &A3 = *CG.lookup(lookupFunction(*M, "a3")); in TEST()
607 LazyCallGraph::Node &B1 = *CG.lookup(lookupFunction(*M, "b1")); in TEST()
608 LazyCallGraph::Node &B2 = *CG.lookup(lookupFunction(*M, "b2")); in TEST()
609 LazyCallGraph::Node &B3 = *CG.lookup(lookupFunction(*M, "b3")); in TEST()
610 LazyCallGraph::Node &C1 = *CG.lookup(lookupFunction(*M, "c1")); in TEST()
611 LazyCallGraph::Node &C2 = *CG.lookup(lookupFunction(*M, "c2")); in TEST()
612 LazyCallGraph::Node &C3 = *CG.lookup(lookupFunction(*M, "c3")); in TEST()
613 LazyCallGraph::Node &D1 = *CG.lookup(lookupFunction(*M, "d1")); in TEST()
614 LazyCallGraph::Node &D2 = *CG.lookup(lookupFunction(*M, "d2")); in TEST()
615 LazyCallGraph::Node &D3 = *CG.lookup(lookupFunction(*M, "d3")); in TEST()
616 LazyCallGraph::RefSCC &ARC = *CG.lookupRefSCC(A1); in TEST()
617 LazyCallGraph::RefSCC &BRC = *CG.lookupRefSCC(B1); in TEST()
618 LazyCallGraph::RefSCC &CRC = *CG.lookupRefSCC(C1); in TEST()
619 LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D1); in TEST()
645 for (LazyCallGraph::Edge E : D2) { in TEST()
678 LazyCallGraph CG(*M); in TEST()
683 LazyCallGraph::RefSCC &DRC = *I; in TEST()
687 LazyCallGraph::RefSCC &CRC = *I; in TEST()
696 LazyCallGraph::Node &C1 = *CG.lookup(lookupFunction(*M, "c1")); in TEST()
697 LazyCallGraph::Node &C2 = *CG.lookup(lookupFunction(*M, "c2")); in TEST()
698 LazyCallGraph::Node &C3 = *CG.lookup(lookupFunction(*M, "c3")); in TEST()
699 LazyCallGraph::Node &D1 = *CG.lookup(lookupFunction(*M, "d1")); in TEST()
700 LazyCallGraph::Node &D2 = *CG.lookup(lookupFunction(*M, "d2")); in TEST()
701 LazyCallGraph::Node &D3 = *CG.lookup(lookupFunction(*M, "d3")); in TEST()
712 for (LazyCallGraph::Edge E : D2) { in TEST()
732 LazyCallGraph::RefSCC &BRC = *I; in TEST()
740 LazyCallGraph::RefSCC &ARC = *I; in TEST()
767 LazyCallGraph CG(*M); in TEST()
771 LazyCallGraph::RefSCC &RC = *I++; in TEST()
774 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); in TEST()
775 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); in TEST()
776 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); in TEST()
816 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); in TEST()
817 LazyCallGraph::SCC &CC = *CG.lookupSCC(C); in TEST()
855 LazyCallGraph CG(*M); in TEST()
859 LazyCallGraph::RefSCC &RC = *I++; in TEST()
862 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); in TEST()
863 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); in TEST()
864 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); in TEST()
871 SmallVector<LazyCallGraph::RefSCC *, 1> NewRCs = in TEST()
884 LazyCallGraph::RefSCC *RC2 = CG.lookupRefSCC(B); in TEST()
913 LazyCallGraph CG(*M); in TEST()
917 LazyCallGraph::RefSCC &RC = *I++; in TEST()
921 LazyCallGraph::SCC &CallC = *RC.begin(); in TEST()
923 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); in TEST()
924 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); in TEST()
925 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); in TEST()
944 LazyCallGraph::SCC &BCallC = *CG.lookupSCC(B); in TEST()
959 LazyCallGraph::SCC &CCallC = *CG.lookupSCC(C); in TEST()
1000 LazyCallGraph CG(*M); in TEST()
1004 LazyCallGraph::RefSCC &RC = *I++; in TEST()
1007 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); in TEST()
1008 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); in TEST()
1009 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); in TEST()
1010 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d")); in TEST()
1011 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); in TEST()
1012 LazyCallGraph::SCC &BC = *CG.lookupSCC(B); in TEST()
1013 LazyCallGraph::SCC &CC = *CG.lookupSCC(C); in TEST()
1014 LazyCallGraph::SCC &DC = *CG.lookupSCC(D); in TEST()
1112 LazyCallGraph CG(*M); in TEST()
1116 LazyCallGraph::RefSCC &RC = *I++; in TEST()
1119 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); in TEST()
1120 LazyCallGraph::Node &B1 = *CG.lookup(lookupFunction(*M, "b1")); in TEST()
1121 LazyCallGraph::Node &B2 = *CG.lookup(lookupFunction(*M, "b2")); in TEST()
1122 LazyCallGraph::Node &B3 = *CG.lookup(lookupFunction(*M, "b3")); in TEST()
1123 LazyCallGraph::Node &C1 = *CG.lookup(lookupFunction(*M, "c1")); in TEST()
1124 LazyCallGraph::Node &C2 = *CG.lookup(lookupFunction(*M, "c2")); in TEST()
1125 LazyCallGraph::Node &C3 = *CG.lookup(lookupFunction(*M, "c3")); in TEST()
1126 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d")); in TEST()
1127 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); in TEST()
1128 LazyCallGraph::SCC &B1C = *CG.lookupSCC(B1); in TEST()
1129 LazyCallGraph::SCC &B2C = *CG.lookupSCC(B2); in TEST()
1130 LazyCallGraph::SCC &B3C = *CG.lookupSCC(B3); in TEST()
1131 LazyCallGraph::SCC &C1C = *CG.lookupSCC(C1); in TEST()
1132 LazyCallGraph::SCC &C2C = *CG.lookupSCC(C2); in TEST()
1133 LazyCallGraph::SCC &C3C = *CG.lookupSCC(C3); in TEST()
1134 LazyCallGraph::SCC &DC = *CG.lookupSCC(D); in TEST()
1242 LazyCallGraph CG(*M); in TEST()
1246 LazyCallGraph::RefSCC &RC = *I++; in TEST()
1249 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); in TEST()
1250 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); in TEST()
1251 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); in TEST()
1252 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d")); in TEST()
1253 LazyCallGraph::Node &E = *CG.lookup(lookupFunction(*M, "e")); in TEST()
1254 LazyCallGraph::Node &F = *CG.lookup(lookupFunction(*M, "f")); in TEST()
1255 LazyCallGraph::Node &G = *CG.lookup(lookupFunction(*M, "g")); in TEST()
1256 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); in TEST()
1257 LazyCallGraph::SCC &BC = *CG.lookupSCC(B); in TEST()
1258 LazyCallGraph::SCC &CC = *CG.lookupSCC(C); in TEST()
1259 LazyCallGraph::SCC &DC = *CG.lookupSCC(D); in TEST()
1260 LazyCallGraph::SCC &EC = *CG.lookupSCC(E); in TEST()
1261 LazyCallGraph::SCC &FC = *CG.lookupSCC(F); in TEST()
1262 LazyCallGraph::SCC &GC = *CG.lookupSCC(G); in TEST()