Lines Matching refs:F
39 static BasicBlock *getBasicBlockByName(Function &F, StringRef Name) { in getBasicBlockByName() argument
40 for (BasicBlock &BB : F) in getBasicBlockByName()
61 Function *F = M->getFunction("has_unreachable"); in TEST() local
62 DominatorTree DT(*F); in TEST()
65 EXPECT_EQ(F->size(), (size_t)4); in TEST()
66 bool Result = EliminateUnreachableBlocks(*F, &DTU); in TEST()
68 EXPECT_EQ(F->size(), (size_t)3); in TEST()
87 Function *F = M->getFunction("foo"); in TEST() local
88 DominatorTree DT(*F); in TEST()
93 SrcBlock = getBasicBlockByName(*F, "entry"); in TEST()
94 DestBlock = getBasicBlockByName(*F, "bb0"); in TEST()
100 EXPECT_EQ(NewBB->getParent(), F); in TEST()
103 for (BasicBlock &BB : *F) { in TEST()
123 Function *F = M->getFunction("foo"); in TEST() local
124 DominatorTree DT(*F); in TEST()
130 SrcBlock = getBasicBlockByName(*F, "bb0"); in TEST()
131 DestBlock = getBasicBlockByName(*F, "bb2"); in TEST()
137 EXPECT_EQ(NewBB->getParent(), F); in TEST()
140 for (BasicBlock &BB : *F) { in TEST()
177 Function *F = M->getFunction("foo"); in TEST() local
178 DominatorTree DT(*F); in TEST()
185 AssumptionCache AC(*F); in TEST()
188 BasicAAResult BAA(DL, *F, TLI, AC, &DT); in TEST()
191 MemorySSA MSSA(*F, &AA, &DT); in TEST()
198 SrcBlock = getBasicBlockByName(*F, "header"); in TEST()
199 DestBlock = getBasicBlockByName(*F, "bb0"); in TEST()
209 EXPECT_EQ(NewBB->getParent(), F); in TEST()
212 for (BasicBlock &BB : *F) { in TEST()
252 Function *F = M->getFunction("bar"); in TEST() local
254 DominatorTree DT(*F); in TEST()
263 MemorySSA MSSA(*F, &AA, &DT); in TEST()
269 SrcBlock = getBasicBlockByName(*F, "continue"); in TEST()
270 DestBlock = getBasicBlockByName(*F, "exception"); in TEST()
294 EXPECT_EQ(NewBB->getParent(), F); in TEST()
297 for (BasicBlock &BB : *F) { in TEST()
322 Function *F = M->getFunction("foo"); in TEST() local
323 DominatorTree DT(*F); in TEST()
328 DestBlock = getBasicBlockByName(*F, "bb2"); in TEST()
357 Function *F = M->getFunction("foo"); in TEST() local
358 DominatorTree DT(*F); in TEST()
360 BasicBlock *DestBlock = getBasicBlockByName(*F, "bb2"); in TEST()
384 Function *F = M->getFunction("no_unreachable"); in TEST() local
385 DominatorTree DT(*F); in TEST()
388 EXPECT_EQ(F->size(), (size_t)3); in TEST()
389 bool Result = EliminateUnreachableBlocks(*F, &DTU); in TEST()
391 EXPECT_EQ(F->size(), (size_t)3); in TEST()
408 Function *F = M->getFunction("basic_func"); in TEST() local
409 DominatorTree DT(*F); in TEST()
413 SplitBlockPredecessors(&F->getEntryBlock(), {}, "split.entry", &DT); in TEST()
431 Function *F = M->getFunction("crit_edge"); in TEST() local
432 DominatorTree DT(*F); in TEST()
433 PostDominatorTree PDT(*F); in TEST()
436 EXPECT_EQ(1u, SplitAllCriticalEdges(*F, CESO)); in TEST()
460 Function *F = M->getFunction("crit_edge"); in TEST() local
461 DominatorTree DT(*F); in TEST()
463 BranchProbabilityInfo BPI(*F, LI); in TEST()
464 BlockFrequencyInfo BFI(*F, BPI, LI); in TEST()
466 ASSERT_TRUE(SplitIndirectBrCriticalEdges(*F, /*IgnoreBlocksWithoutPHI=*/true, in TEST()
470 BasicBlock *BB1 = getBasicBlockByName(*F, "bb1"); in TEST()
477 BasicBlock *BB0 = getBasicBlockByName(*F, "bb0"); in TEST()
480 getBasicBlockByName(*F, "bb2")); in TEST()
502 Function *F = M->getFunction("crit_edge"); in TEST() local
503 DominatorTree DT(*F); in TEST()
505 BranchProbabilityInfo BPI(*F, LI); in TEST()
506 BlockFrequencyInfo BFI(*F, BPI, LI); in TEST()
508 ASSERT_TRUE(SplitIndirectBrCriticalEdges(*F, /*IgnoreBlocksWithoutPHI=*/false, in TEST()
512 BasicBlock *BB1 = getBasicBlockByName(*F, "bb1"); in TEST()
520 BasicBlock *BB0 = getBasicBlockByName(*F, "bb0"); in TEST()
523 BasicBlock *BB2 = getBasicBlockByName(*F, "bb2"); in TEST()
604 Function *F = M->getFunction("edge_probability"); in TEST() local
605 DominatorTree DT(*F); in TEST()
607 BranchProbabilityInfo BPI(*F, LI); in TEST()
610 const BasicBlock *EntryBB = getBasicBlockByName(*F, "entry"); in TEST()
611 const BasicBlock *UnreachableBB = getBasicBlockByName(*F, "LD"); in TEST()