326                                         MachineBasicBlock *MBB2,  in ComputeCommonTailLength()  argument
330   I2 = MBB2->end();  in ComputeCommonTailLength()
333   while (I1 != MBB1->begin() && I2 != MBB2->begin()) {  in ComputeCommonTailLength()
339           if (I2==MBB2->begin())  in ComputeCommonTailLength()
352       if (I2==MBB2->begin()) {  in ComputeCommonTailLength()
376   if (I1 == MBB1->begin() && I2 != MBB2->begin()) {  in ComputeCommonTailLength()
379       if (I2 == MBB2->begin())  in ComputeCommonTailLength()
385   if (I2 == MBB2->begin() && I1 != MBB1->begin()) {  in ComputeCommonTailLength()
564 ProfitableToMerge(MachineBasicBlock *MBB1, MachineBasicBlock *MBB2,  in ProfitableToMerge()  argument
574     auto Funclet2 = FuncletMembership.find(MBB2);  in ProfitableToMerge()
580   CommonTailLen = ComputeCommonTailLength(MBB1, MBB2, I1, I2);  in ProfitableToMerge()
584                << " and BB#" << MBB2->getNumber() << " is " << CommonTailLen  in ProfitableToMerge()
589   if (MBB1 == PredBB || MBB2 == PredBB) {  in ProfitableToMerge()
591     unsigned NumTerms = CountTerminators(MBB1 == PredBB ? MBB2 : MBB1, I);  in ProfitableToMerge()
600   if (MBB1->isLayoutSuccessor(MBB2) && I2 == MBB2->begin())  in ProfitableToMerge()
602   if (MBB2->isLayoutSuccessor(MBB1) && I1 == MBB1->begin())  in ProfitableToMerge()
609   if (SuccBB && MBB1 != PredBB && MBB2 != PredBB &&  in ProfitableToMerge()
611       !MBB2->back().isBarrier())  in ProfitableToMerge()
624          (I1 == MBB1->begin() || I2 == MBB2->begin());  in ProfitableToMerge()
1164                                 MachineBasicBlock *MBB2) {  in IsBetterFallthrough()  argument
1170   MachineBasicBlock::iterator MBB2I = MBB2->getLastNonDebugInstr();  in IsBetterFallthrough()
1171   if (MBB1I == MBB1->end() || MBB2I == MBB2->end())  in IsBetterFallthrough()
1176   if (MBB1->isSuccessor(MBB2)) return true;  in IsBetterFallthrough()
1177   if (MBB2->isSuccessor(MBB1)) return false;  in IsBetterFallthrough()