Lines Matching defs:BB2

70   BasicBlock *BB2 = &*FI++;
87   Updates.push_back({DominatorTree::Insert, BB1, BB2});
112       {{DominatorTree::Insert, BB1, BB2}, {DominatorTree::Delete, BB0, BB1}});
132   // Remove all case branch to BB2 to test Eager recalculation.
135     if (i->getCaseSuccessor() == BB2) {
137       BB2->removePredecessor(BB0);
252   BasicBlock *BB2 = &*FI++;
267   Updates.push_back({DominatorTree::Insert, BB1, BB2});
274   BranchInst::Create(BB1, BB2, ConstantInt::getTrue(F->getContext()), BB0);
341   BasicBlock *BB2 = &*FI++;
378   BasicBlocks.push_back(BB2);
384   ASSERT_FALSE(isa<UnreachableInst>(BB2->getTerminator()));
385   EXPECT_FALSE(DTU.isBBPendingDeletion(BB2));
386   DTU.callbackDeleteBB(BB2, Eraser);
387   EXPECT_TRUE(DTU.isBBPendingDeletion(BB2));
388   ASSERT_TRUE(isa<UnreachableInst>(BB2->getTerminator()));
389   EXPECT_EQ(BB2->getParent(), F);
394   Updates.push_back({DominatorTree::Delete, BB0, BB2});
395   Updates.push_back({DominatorTree::Delete, BB2, BB3});
466   BasicBlock *BB2 = &*FI++;
479   Updates.push_back({DominatorTree::Insert, BB1, BB2});
486   BranchInst::Create(BB1, BB2, ConstantInt::getTrue(F->getContext()), BB0);
640   BasicBlock *BB2 = &*FI++;
677   // Remove all case branch to BB2 to test Eager recalculation.
680     if (i->getCaseSuccessor() == BB2) {
682       BB2->removePredecessor(BB0);
685       Updates.push_back({DominatorTree::Delete, BB0, BB2});
751   BasicBlock *BB2 = &*FI++;
786   BranchInst::Create(BB2, BB0);
788   DTU.applyUpdates({{DominatorTree::Insert, BB0, BB2}});