Lines Matching refs:DominatorTree
28 function_ref<void(Function &F, DominatorTree *DT, PostDominatorTree *PDT)> in runWithDomTree()
33 DominatorTree DT(*F); in runWithDomTree()
46 TEST(DominatorTree, PHIs) { in TEST() argument
63 [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
77 TEST(DominatorTree, Unreachable) { in TEST() argument
107 *M, "f", [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
307 TEST(DominatorTree, NonUniqueEdges) { in TEST() argument
327 *M, "f", [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
393 TEST(DominatorTree, DeletingEdgesIntroducesUnreachables) { in TEST() argument
411 *M, "f", [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
435 DominatorTree NDT(F); in TEST()
485 TEST(DominatorTree, DeletingEdgesIntroducesInfiniteLoop) { in TEST() argument
505 *M, "f", [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
527 DominatorTree NDT(F); in TEST()
572 TEST(DominatorTree, DeletingEdgesIntroducesInfiniteLoop2) { in TEST() argument
594 *M, "f", [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
622 DominatorTree NDT(F); in TEST()
648 TEST(DominatorTree, IDFDeterminismTest) { in TEST() argument
668 *M, "f", [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
709 TEST(DominatorTree, InsertReachable) { in TEST() argument
720 DominatorTree DT(*Holder.F); in TEST()
737 TEST(DominatorTree, InsertReachable2) { in TEST() argument
746 DominatorTree DT(*Holder.F); in TEST()
763 TEST(DominatorTree, InsertUnreachable) { in TEST() argument
774 DominatorTree DT(*Holder.F); in TEST()
791 TEST(DominatorTree, InsertFromUnreachable) { in TEST() argument
814 TEST(DominatorTree, InsertMixed) { in TEST() argument
825 DominatorTree DT(*Holder.F); in TEST()
842 TEST(DominatorTree, InsertPermut) { in TEST() argument
855 DominatorTree DT(*Holder.F); in TEST()
873 TEST(DominatorTree, DeleteReachable) { in TEST() argument
882 DominatorTree DT(*Holder.F); in TEST()
899 TEST(DominatorTree, DeleteUnreachable) { in TEST() argument
908 DominatorTree DT(*Holder.F); in TEST()
925 TEST(DominatorTree, InsertDelete) { in TEST() argument
938 DominatorTree DT(*Holder.F); in TEST()
960 TEST(DominatorTree, InsertDeleteExhaustive) { in TEST() argument
976 DominatorTree DT(*Holder.F); in TEST()
999 TEST(DominatorTree, InsertIntoIrreducible) { in TEST() argument
1012 DominatorTree DT(*Holder.F); in TEST()
1023 TEST(DominatorTree, EdgeDomination) { in TEST() argument
1040 [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()
1075 TEST(DominatorTree, ValueDomination) { in TEST() argument
1087 [&](Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in TEST()