Lines Matching defs:BBI1
1225 BBInfo *BBI1 = &TrueBBI;
1242 std::swap(BBI1, BBI2);
1252 InitPredRedefs(BBI1->BB, Redefs, TRI);
1255 MachineBasicBlock::iterator DI1 = BBI1->BB->begin();
1257 MachineBasicBlock::iterator DIE1 = BBI1->BB->end();
1264 BBI1->NonPredSize -= NumDups1;
1279 UpdatePredRedefs(BBI1->BB->begin(), DI1, Redefs, TRI);
1280 BBI.BB->splice(BBI.BB->end(), BBI1->BB, BBI1->BB->begin(), DI1);
1284 BBI1->NonPredSize -= TII->RemoveBranch(*BBI1->BB);
1285 DI1 = BBI1->BB->end();
1289 assert (DI1 != BBI1->BB->begin());
1295 BBI1->BB->erase(DI1, BBI1->BB->end());
1320 if (TII->isProfitableToUnpredicate(*BBI1->BB, *BBI2->BB)) {
1355 PredicateBlock(*BBI1, BBI1->BB->end(), *Cond1, Redefs, &RedefsByFalse);
1361 MergeBlocks(BBI, *BBI1, TailBB == 0);
1371 // There may still be a fall-through edge from BBI1 or BBI2 to TailBB;
1378 if (*PI != BBI1->BB && *PI != BBI2->BB)
1393 // explicitly remove BBI1 and BBI2 as successors.
1394 BBI.BB->removeSuccessor(BBI1->BB);