Lines Matching defs:MBB1
305 static unsigned ComputeCommonTailLength(MachineBasicBlock *MBB1,
309 I1 = MBB1->end();
313 while (I1 != MBB1->begin() && I2 != MBB2->begin()) {
317 if (I1==MBB1->begin()) {
355 // I1==MBB1->begin() work as expected.)
356 if (I1 == MBB1->begin() && I2 != MBB2->begin()) {
365 if (I2 == MBB2->begin() && I1 != MBB1->begin()) {
368 if (I1 == MBB1->begin())
522 static bool ProfitableToMerge(MachineBasicBlock *MBB1,
530 CommonTailLen = ComputeCommonTailLength(MBB1, MBB2, I1, I2);
533 DEBUG(dbgs() << "Common tail length of BB#" << MBB1->getNumber()
539 if (MBB1 == PredBB || MBB2 == PredBB) {
541 unsigned NumTerms = CountTerminators(MBB1 == PredBB ? MBB2 : MBB1, I);
550 if (MBB1->isLayoutSuccessor(MBB2) && I2 == MBB2->begin())
552 if (MBB2->isLayoutSuccessor(MBB1) && I1 == MBB1->begin())
559 if (SuccBB && MBB1 != PredBB && MBB2 != PredBB &&
560 !MBB1->back().isBarrier() &&
572 MachineFunction *MF = MBB1->getParent();
576 (I1 == MBB1->begin() || I2 == MBB2->begin()))
1013 /// fall-through to MBB1 than to fall through into MBB2. This has to return
1014 /// a strict ordering, returning true for both (MBB1,MBB2) and (MBB2,MBB1) will
1016 static bool IsBetterFallthrough(MachineBasicBlock *MBB1,
1019 // MBB1 doesn't, we prefer to fall through into MBB1. This allows us to
1022 if (IsEmptyBlock(MBB1) || IsEmptyBlock(MBB2)) return false;
1026 if (MBB1->isSuccessor(MBB2)) return true;
1027 if (MBB2->isSuccessor(MBB1)) return false;
1031 MachineBasicBlock::iterator MBB1I = --MBB1->end();