Lines Matching refs:BB2
39 i32 1, label %bb2
44 bb2:
70 BasicBlock *BB2 = &*FI++;
85 // Invalid Insert: no edge bb1 -> bb2 after change to bb0.
86 Updates.push_back({DominatorTree::Insert, BB1, BB2});
108 // Invalid Insert: no edge bb1 -> bb2 after change to bb0.
109 DTU.insertEdgeRelaxed(BB1, BB2);
131 // Remove all case branch to BB2 to test Eager recalculation.
134 if (i->getCaseSuccessor() == BB2) {
136 BB2->removePredecessor(BB0);
221 i32 0, label %bb2
222 i32 1, label %bb2
227 bb2:
251 BasicBlock *BB2 = &*FI++;
265 // Invalid Insert: no edge bb1 -> bb2 after change to bb0.
266 Updates.push_back({DominatorTree::Insert, BB1, BB2});
270 // CFG Change: remove edge bb0 -> bb3 and one duplicate edge bb0 -> bb2.
273 BranchInst::Create(BB1, BB2, ConstantInt::getTrue(F->getContext()), BB0);
311 i32 2, label %bb2
316 bb2:
340 BasicBlock *BB2 = &*FI++;
366 // remove bb2.
375 BasicBlocks.push_back(BB2);
383 // Remove bb2 from F. This has to happen before the call to applyUpdates() for
384 // DTU to detect there is no longer an edge between bb2 -> bb3. The deleteBB()
385 // method converts bb2's TI into "unreachable".
386 ASSERT_FALSE(isa<UnreachableInst>(BB2->getTerminator()));
387 EXPECT_FALSE(DTU.isBBPendingDeletion(BB2));
388 DTU.callbackDeleteBB(BB2, Eraser);
389 EXPECT_TRUE(DTU.isBBPendingDeletion(BB2));
390 ASSERT_TRUE(isa<UnreachableInst>(BB2->getTerminator()));
391 EXPECT_EQ(BB2->getParent(), F);
396 Updates.push_back({DominatorTree::Delete, BB0, BB2});
397 Updates.push_back({DominatorTree::Delete, BB2, BB3});
437 i32 0, label %bb2
438 i32 1, label %bb2
443 bb2:
468 BasicBlock *BB2 = &*FI++;
480 // Unnecessary Insert: no edge bb1 -> bb2 after change to bb0.
481 Updates.push_back({DominatorTree::Insert, BB1, BB2});
485 // CFG Change: remove edge bb0 -> bb3 and one duplicate edge bb0 -> bb2.
488 BranchInst::Create(BB1, BB2, ConstantInt::getTrue(F->getContext()), BB0);
609 i32 1, label %bb2
615 bb2:
642 BasicBlock *BB2 = &*FI++;
680 // Remove all case branch to BB2 to test Eager recalculation.
683 if (i->getCaseSuccessor() == BB2) {
685 BB2->removePredecessor(BB0);
688 Updates.push_back({DominatorTree::Delete, BB0, BB2});
