Lines Matching refs:LazyCallGraph
125 LazyCallGraph CG(*M); in TEST()
131 LazyCallGraph::Node &A1 = *I++; in TEST()
133 LazyCallGraph::Node &A2 = *I++; in TEST()
135 LazyCallGraph::Node &A3 = *I++; in TEST()
137 LazyCallGraph::Node &B1 = *I++; in TEST()
139 LazyCallGraph::Node &B2 = *I++; in TEST()
141 LazyCallGraph::Node &B3 = *I++; in TEST()
143 LazyCallGraph::Node &C1 = *I++; in TEST()
145 LazyCallGraph::Node &C2 = *I++; in TEST()
147 LazyCallGraph::Node &C3 = *I++; in TEST()
149 LazyCallGraph::Node &D1 = *I++; in TEST()
151 LazyCallGraph::Node &D2 = *I++; in TEST()
153 LazyCallGraph::Node &D3 = *I++; in TEST()
161 for (LazyCallGraph::Node &N : A1) in TEST()
174 for (LazyCallGraph::Node &N : B1) in TEST()
186 for (LazyCallGraph::Node &N : C1) in TEST()
208 LazyCallGraph::SCC &D = *SCCI++; in TEST()
209 for (LazyCallGraph::Node *N : D) in TEST()
222 LazyCallGraph::SCC &C = *SCCI++; in TEST()
223 for (LazyCallGraph::Node *N : C) in TEST()
236 LazyCallGraph::SCC &B = *SCCI++; in TEST()
237 for (LazyCallGraph::Node *N : B) in TEST()
252 LazyCallGraph::SCC &A = *SCCI++; in TEST()
253 for (LazyCallGraph::Node *N : A) in TEST()
294 LazyCallGraph CG(*M); in TEST()
296 LazyCallGraph::Node &A = CG.get(lookupFunction(*M, "a")); in TEST()
297 LazyCallGraph::Node &B = CG.get(lookupFunction(*M, "b")); in TEST()
303 LazyCallGraph::Node &C = *B.begin(); in TEST()
357 LazyCallGraph CG(*M); in TEST()
361 LazyCallGraph::SCC &SCC = *SCCI++; in TEST()
364 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); in TEST()
365 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); in TEST()
366 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); in TEST()
367 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d")); in TEST()
368 LazyCallGraph::Node &E = *CG.lookup(lookupFunction(*M, "e")); in TEST()
398 LazyCallGraph CG(*M); in TEST()
401 for (LazyCallGraph::SCC &C : CG.postorder_sccs()) in TEST()
404 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); in TEST()
405 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); in TEST()
406 LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c")); in TEST()
407 LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d")); in TEST()
408 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); in TEST()
409 LazyCallGraph::SCC &BC = *CG.lookupSCC(B); in TEST()
410 LazyCallGraph::SCC &CC = *CG.lookupSCC(C); in TEST()
411 LazyCallGraph::SCC &DC = *CG.lookupSCC(D); in TEST()
447 LazyCallGraph CG(*M); in TEST()
450 for (LazyCallGraph::SCC &C : CG.postorder_sccs()) in TEST()
453 LazyCallGraph::Node &A1 = *CG.lookup(lookupFunction(*M, "a1")); in TEST()
454 LazyCallGraph::Node &A2 = *CG.lookup(lookupFunction(*M, "a2")); in TEST()
455 LazyCallGraph::Node &A3 = *CG.lookup(lookupFunction(*M, "a3")); in TEST()
456 LazyCallGraph::Node &B1 = *CG.lookup(lookupFunction(*M, "b1")); in TEST()
457 LazyCallGraph::Node &B2 = *CG.lookup(lookupFunction(*M, "b2")); in TEST()
458 LazyCallGraph::Node &B3 = *CG.lookup(lookupFunction(*M, "b3")); in TEST()
459 LazyCallGraph::Node &C1 = *CG.lookup(lookupFunction(*M, "c1")); in TEST()
460 LazyCallGraph::Node &C2 = *CG.lookup(lookupFunction(*M, "c2")); in TEST()
461 LazyCallGraph::Node &C3 = *CG.lookup(lookupFunction(*M, "c3")); in TEST()
462 LazyCallGraph::Node &D1 = *CG.lookup(lookupFunction(*M, "d1")); in TEST()
463 LazyCallGraph::Node &D2 = *CG.lookup(lookupFunction(*M, "d2")); in TEST()
464 LazyCallGraph::Node &D3 = *CG.lookup(lookupFunction(*M, "d3")); in TEST()
465 LazyCallGraph::SCC &AC = *CG.lookupSCC(A1); in TEST()
466 LazyCallGraph::SCC &BC = *CG.lookupSCC(B1); in TEST()
467 LazyCallGraph::SCC &CC = *CG.lookupSCC(C1); in TEST()
468 LazyCallGraph::SCC &DC = *CG.lookupSCC(D1); in TEST()
522 LazyCallGraph CG(*M); in TEST()
527 LazyCallGraph::SCC &DC = *SCCI; in TEST()
531 LazyCallGraph::SCC &CC = *SCCI; in TEST()
540 LazyCallGraph::Node &C1 = *CG.lookup(lookupFunction(*M, "c1")); in TEST()
541 LazyCallGraph::Node &C2 = *CG.lookup(lookupFunction(*M, "c2")); in TEST()
542 LazyCallGraph::Node &C3 = *CG.lookup(lookupFunction(*M, "c3")); in TEST()
543 LazyCallGraph::Node &D1 = *CG.lookup(lookupFunction(*M, "d1")); in TEST()
544 LazyCallGraph::Node &D2 = *CG.lookup(lookupFunction(*M, "d2")); in TEST()
545 LazyCallGraph::Node &D3 = *CG.lookup(lookupFunction(*M, "d3")); in TEST()
568 LazyCallGraph::SCC &BC = *SCCI; in TEST()
575 LazyCallGraph::SCC &AC = *SCCI; in TEST()
595 LazyCallGraph CG(*M); in TEST()
598 for (LazyCallGraph::SCC &C : CG.postorder_sccs()) in TEST()
601 LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a")); in TEST()
602 LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b")); in TEST()
603 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); in TEST()
604 LazyCallGraph::SCC &BC = *CG.lookupSCC(B); in TEST()
634 LazyCallGraph CG1(*M1); in TEST()
638 LazyCallGraph::SCC &SCC = *SCCI++; in TEST()
641 LazyCallGraph::Node &A = *CG1.lookup(lookupFunction(*M1, "a")); in TEST()
642 LazyCallGraph::Node &B = *CG1.lookup(lookupFunction(*M1, "b")); in TEST()
643 LazyCallGraph::Node &C = *CG1.lookup(lookupFunction(*M1, "c")); in TEST()
687 LazyCallGraph CG1(*M1); in TEST()
691 LazyCallGraph::SCC &SCC = *SCCI++; in TEST()
694 LazyCallGraph::Node &A = *CG1.lookup(lookupFunction(*M1, "a")); in TEST()
695 LazyCallGraph::Node &B = *CG1.lookup(lookupFunction(*M1, "b")); in TEST()
696 LazyCallGraph::Node &C = *CG1.lookup(lookupFunction(*M1, "c")); in TEST()
703 SmallVector<LazyCallGraph::SCC *, 1> NewSCCs = SCC.removeIntraSCCEdge(B, A); in TEST()
715 LazyCallGraph::SCC *SCC2 = CG1.lookupSCC(B); in TEST()