331                                         MachineBasicBlock *MBB2,  in ComputeCommonTailLength()  argument
335   I2 = MBB2->end();  in ComputeCommonTailLength()
338   while (I1 != MBB1->begin() && I2 != MBB2->begin()) {  in ComputeCommonTailLength()
344           if (I2==MBB2->begin())  in ComputeCommonTailLength()
357       if (I2==MBB2->begin()) {  in ComputeCommonTailLength()
381   if (I1 == MBB1->begin() && I2 != MBB2->begin()) {  in ComputeCommonTailLength()
384       if (I2 == MBB2->begin())  in ComputeCommonTailLength()
390   if (I2 == MBB2->begin() && I1 != MBB1->begin()) {  in ComputeCommonTailLength()
595 ProfitableToMerge(MachineBasicBlock *MBB1, MachineBasicBlock *MBB2,  in ProfitableToMerge()  argument
605     auto Funclet2 = FuncletMembership.find(MBB2);  in ProfitableToMerge()
611   CommonTailLen = ComputeCommonTailLength(MBB1, MBB2, I1, I2);  in ProfitableToMerge()
615                << " and BB#" << MBB2->getNumber() << " is " << CommonTailLen  in ProfitableToMerge()
620   if (MBB1 == PredBB || MBB2 == PredBB) {  in ProfitableToMerge()
622     unsigned NumTerms = CountTerminators(MBB1 == PredBB ? MBB2 : MBB1, I);  in ProfitableToMerge()
631   if (MBB1->isLayoutSuccessor(MBB2) && I2 == MBB2->begin())  in ProfitableToMerge()
633   if (MBB2->isLayoutSuccessor(MBB1) && I1 == MBB1->begin())  in ProfitableToMerge()
640   if (SuccBB && MBB1 != PredBB && MBB2 != PredBB &&  in ProfitableToMerge()
642       !MBB2->back().isBarrier())  in ProfitableToMerge()
655          (I1 == MBB1->begin() || I2 == MBB2->begin());  in ProfitableToMerge()
1194                                 MachineBasicBlock *MBB2) {  in IsBetterFallthrough()  argument
1200   MachineBasicBlock::iterator MBB2I = MBB2->getLastNonDebugInstr();  in IsBetterFallthrough()
1201   if (MBB1I == MBB1->end() || MBB2I == MBB2->end())  in IsBetterFallthrough()
1206   if (MBB1->isSuccessor(MBB2)) return true;  in IsBetterFallthrough()
1207   if (MBB2->isSuccessor(MBB1)) return false;  in IsBetterFallthrough()