Lines Matching full:mbb2
297 MachineBasicBlock *MBB2,
301 I2 = MBB2->end();
304 while (I1 != MBB1->begin() && I2 != MBB2->begin()) {
310 if (I2==MBB2->begin())
323 if (I2==MBB2->begin()) {
347 if (I1 == MBB1->begin() && I2 != MBB2->begin()) {
350 if (I2 == MBB2->begin()) {
357 if (I2 == MBB2->begin() && I1 != MBB1->begin()) {
516 MachineBasicBlock *MBB2,
523 CommonTailLen = ComputeCommonTailLength(MBB1, MBB2, I1, I2);
527 << " and BB#" << MBB2->getNumber() << " is " << CommonTailLen
532 if (MBB1 == PredBB || MBB2 == PredBB) {
534 unsigned NumTerms = CountTerminators(MBB1 == PredBB ? MBB2 : MBB1, I);
543 if (MBB1->isLayoutSuccessor(MBB2) && I2 == MBB2->begin())
545 if (MBB2->isLayoutSuccessor(MBB1) && I1 == MBB1->begin())
552 if (SuccBB && MBB1 != PredBB && MBB2 != PredBB &&
554 !MBB2->back().getDesc().isBarrier())
568 (I1 == MBB1->begin() || I2 == MBB2->begin()))
987 /// fall-through to MBB1 than to fall through into MBB2. This has to return
988 /// a strict ordering, returning true for both (MBB1,MBB2) and (MBB2,MBB1) will
991 MachineBasicBlock *MBB2) {
992 // Right now, we use a simple heuristic. If MBB2 ends with a call, and
996 if (IsEmptyBlock(MBB1) || IsEmptyBlock(MBB2)) return false;
1000 if (MBB1->isSuccessor(MBB2)) return true;
1001 if (MBB2->isSuccessor(MBB1)) return false;
1008 MachineBasicBlock::iterator MBB2I = --MBB2->end();
