lib/CodeGen/IfConversion.cpp

1261   BBInfo *BBI2 = &FalseBBI;
1277     std::swap(BBI1, BBI2);
1291   MachineBasicBlock::iterator DI2 = BBI2->BB->begin();
1293   MachineBasicBlock::iterator DIE2 = BBI2->BB->end();
1300   BBI2->NonPredSize -= NumDups1;
1318   for (MachineBasicBlock::reverse_iterator I = BBI2->BB->rbegin(),
1328   BBI2->BB->erase(BBI2->BB->begin(), DI2);
1349   BBI2->NonPredSize -= TII->RemoveBranch(*BBI2->BB);
1350   DI2 = BBI2->BB->end();
1354     assert (DI2 != BBI2->BB->begin());
1371   if (TII->isProfitableToUnpredicate(*BBI1->BB, *BBI2->BB)) {
1372     for (MachineBasicBlock::iterator FI = BBI2->BB->begin(); FI != DI2; ++FI) {
1409   PredicateBlock(*BBI2, DI2, *Cond2);
1413   MergeBlocks(BBI, *BBI2, TailBB == 0);
1423     // There may still be a fall-through edge from BBI1 or BBI2 to TailBB;
1430       if (*PI != BBI1->BB && *PI != BBI2->BB)
1445   // explicitly remove BBI1 and BBI2 as successors.
1447   BBI.BB->removeSuccessor(BBI2->BB);