296 static unsigned ComputeCommonTailLength(MachineBasicBlock *MBB1,  in ComputeCommonTailLength()  argument
300   I1 = MBB1->end();  in ComputeCommonTailLength()
304   while (I1 != MBB1->begin() && I2 != MBB2->begin()) {  in ComputeCommonTailLength()
308       if (I1==MBB1->begin()) {  in ComputeCommonTailLength()
347   if (I1 == MBB1->begin() && I2 != MBB2->begin()) {  in ComputeCommonTailLength()
357   if (I2 == MBB2->begin() && I1 != MBB1->begin()) {  in ComputeCommonTailLength()
360       if (I1 == MBB1->begin())  in ComputeCommonTailLength()
515 static bool ProfitableToMerge(MachineBasicBlock *MBB1,  in ProfitableToMerge()  argument
523   CommonTailLen = ComputeCommonTailLength(MBB1, MBB2, I1, I2);  in ProfitableToMerge()
526   DEBUG(dbgs() << "Common tail length of BB#" << MBB1->getNumber()  in ProfitableToMerge()
532   if (MBB1 == PredBB || MBB2 == PredBB) {  in ProfitableToMerge()
534     unsigned NumTerms = CountTerminators(MBB1 == PredBB ? MBB2 : MBB1, I);  in ProfitableToMerge()
543   if (MBB1->isLayoutSuccessor(MBB2) && I2 == MBB2->begin())  in ProfitableToMerge()
545   if (MBB2->isLayoutSuccessor(MBB1) && I1 == MBB1->begin())  in ProfitableToMerge()
552   if (SuccBB && MBB1 != PredBB && MBB2 != PredBB &&  in ProfitableToMerge()
553       !MBB1->back().getDesc().isBarrier() &&  in ProfitableToMerge()
565   MachineFunction *MF = MBB1->getParent();  in ProfitableToMerge()
568       (I1 == MBB1->begin() || I2 == MBB2->begin()))  in ProfitableToMerge()
990 static bool IsBetterFallthrough(MachineBasicBlock *MBB1,  in IsBetterFallthrough()  argument
996   if (IsEmptyBlock(MBB1) || IsEmptyBlock(MBB2)) return false;  in IsBetterFallthrough()
1000   if (MBB1->isSuccessor(MBB2)) return true;  in IsBetterFallthrough()
1001   if (MBB2->isSuccessor(MBB1)) return false;  in IsBetterFallthrough()
1005   MachineBasicBlock::iterator MBB1I = --MBB1->end();  in IsBetterFallthrough()