Lines Matching refs:MBB2
326 MachineBasicBlock *MBB2,
330 MachineBasicBlock::iterator MBBI2 = MBB2->end();
335 MBBI2 = skipBackwardPastNonInstructions(MBBI2, MBB2);
336 if (MBBI1 == MBB1->end() || MBBI2 == MBB2->end())
531 /// MBB1, MBB2 The blocks to check
534 /// MBB1 and MBB2
536 /// instruction in the common tail shared by MBB1,MBB2
537 /// SuccBB A common successor of MBB1, MBB2 which are in a canonical form
544 ProfitableToMerge(MachineBasicBlock *MBB1, MachineBasicBlock *MBB2,
557 auto EHScope2 = EHScopeMembership.find(MBB2);
563 CommonTailLen = ComputeCommonTailLength(MBB1, MBB2, I1, I2);
567 << " and " << printMBBReference(*MBB2) << " is "
575 if (skipDebugInstructionsForward(MBB2->begin(), MBB2->end()) == I2)
576 I2 = MBB2->begin();
579 bool FullBlockTail2 = I2 == MBB2->begin();
586 if ((MBB1 == PredBB || MBB2 == PredBB) &&
589 unsigned NumTerms = CountTerminators(MBB1 == PredBB ? MBB2 : MBB1, I);
600 blockEndsInUnreachable(MBB1) && blockEndsInUnreachable(MBB2))
607 if (MBB1->isLayoutSuccessor(MBB2) && FullBlockTail2)
609 if (MBB2->isLayoutSuccessor(MBB1) && FullBlockTail1)
624 if (!BothFallThrough(MBB1) || !BothFallThrough(MBB2))
634 if (SuccBB && MBB1 != PredBB && MBB2 != PredBB &&
637 !MBB2->back().isBarrier())
652 llvm::shouldOptimizeForSize(MBB2, PSI, &MBBFreqInfo));
1236 /// fall-through to MBB1 than to fall through into MBB2. This has to return
1237 /// a strict ordering, returning true for both (MBB1,MBB2) and (MBB2,MBB1) will
1240 MachineBasicBlock *MBB2) {
1241 assert(MBB1 && MBB2 && "Unknown MachineBasicBlock");
1243 // Right now, we use a simple heuristic. If MBB2 ends with a call, and
1248 MachineBasicBlock::iterator MBB2I = MBB2->getLastNonDebugInstr();
1249 if (MBB1I == MBB1->end() || MBB2I == MBB2->end())
1254 if (MBB1->isSuccessor(MBB2)) return true;
1255 if (MBB2->isSuccessor(MBB1)) return false;