Lines Matching refs:MBB
154 void BranchFolder::RemoveDeadBlock(MachineBasicBlock *MBB) { in RemoveDeadBlock() argument
155 assert(MBB->pred_empty() && "MBB must be dead!"); in RemoveDeadBlock()
156 LLVM_DEBUG(dbgs() << "\nRemoving MBB: " << *MBB); in RemoveDeadBlock()
158 MachineFunction *MF = MBB->getParent(); in RemoveDeadBlock()
160 while (!MBB->succ_empty()) in RemoveDeadBlock()
161 MBB->removeSuccessor(MBB->succ_end()-1); in RemoveDeadBlock()
164 TriedMerging.erase(MBB); in RemoveDeadBlock()
167 std::for_each(MBB->begin(), MBB->end(), [MF](const MachineInstr &MI) { in RemoveDeadBlock()
172 MF->erase(MBB); in RemoveDeadBlock()
173 EHScopeMembership.erase(MBB); in RemoveDeadBlock()
175 MLI->removeBlock(MBB); in RemoveDeadBlock()
288 static unsigned HashEndOfMBB(const MachineBasicBlock &MBB) { in HashEndOfMBB() argument
289 MachineBasicBlock::const_iterator I = MBB.getLastNonDebugInstr(); in HashEndOfMBB()
290 if (I == MBB.end()) in HashEndOfMBB()
306 MachineBasicBlock *MBB) { in skipBackwardPastNonInstructions() argument
307 while (I != MBB->begin()) { in skipBackwardPastNonInstructions()
312 return MBB->end(); in skipBackwardPastNonInstructions()
496 static unsigned CountTerminators(MachineBasicBlock *MBB, in CountTerminators() argument
498 I = MBB->end(); in CountTerminators()
501 if (I == MBB->begin()) { in CountTerminators()
502 I = MBB->end(); in CountTerminators()
515 static bool blockEndsInUnreachable(const MachineBasicBlock *MBB) { in blockEndsInUnreachable() argument
516 if (!MBB->succ_empty()) in blockEndsInUnreachable()
518 if (MBB->empty()) in blockEndsInUnreachable()
520 return !(MBB->back().isReturn() || MBB->back().isIndirectBranch()); in blockEndsInUnreachable()
613 auto BothFallThrough = [](MachineBasicBlock *MBB) { in ProfitableToMerge() argument
614 if (MBB->succ_size() != 0 && !MBB->canFallThrough()) in ProfitableToMerge()
616 MachineFunction::iterator I(MBB); in ProfitableToMerge()
617 MachineFunction *MF = MBB->getParent(); in ProfitableToMerge()
618 return (MBB != &*MF->begin()) && std::prev(I)->canFallThrough(); in ProfitableToMerge()
732 MachineBasicBlock *MBB = SameTails[commonTailIndex].getBlock(); in CreateCommonTailOnlyBlock() local
734 LLVM_DEBUG(dbgs() << "\nSplitting " << printMBBReference(*MBB) << ", size " in CreateCommonTailOnlyBlock()
740 const BasicBlock *BB = (SuccBB && MBB->succ_size() == 1) ? in CreateCommonTailOnlyBlock()
741 SuccBB->getBasicBlock() : MBB->getBasicBlock(); in CreateCommonTailOnlyBlock()
742 MachineBasicBlock *newMBB = SplitMBBAt(*MBB, BBI, BB); in CreateCommonTailOnlyBlock()
752 if (PredBB == MBB) in CreateCommonTailOnlyBlock()
761 MachineBasicBlock *MBB = MBBIStartPos->getParent(); in mergeOperations() local
766 for (auto E = MBB->end(); MBBIStartPos != E; ++MBBIStartPos) in mergeOperations()
769 MachineBasicBlock::reverse_iterator MBBI = MBB->rbegin(); in mergeOperations()
770 MachineBasicBlock::reverse_iterator MBBIE = MBB->rend(); in mergeOperations()
792 MBBICommon->cloneMergedMemRefs(*MBB->getParent(), {&*MBBICommon, &*MBBI}); in mergeOperations()
809 MachineBasicBlock *MBB = SameTails[commonTailIndex].getBlock(); in mergeCommonTails() local
815 mergeOperations(SameTails[i].getTailStartPos(), *MBB); in mergeCommonTails()
817 assert(SameTails[i].getTailStartPos() == MBB->begin() && in mergeCommonTails()
822 for (auto &MI : *MBB) { in mergeCommonTails()
847 computeLiveIns(NewLiveIns, *MBB); in mergeCommonTails()
852 for (MachineBasicBlock *Pred : MBB->predecessors()) { in mergeCommonTails()
865 MBB->clearLiveIns(); in mergeCommonTails()
866 addLiveIns(*MBB, NewLiveIns); in mergeCommonTails()
942 MachineBasicBlock *MBB = SameTails[i].getBlock(); in TryTailMergeBlocks() local
943 if ((MBB == EntryBB || MBB->isEHPad()) && in TryTailMergeBlocks()
946 if (MBB == PredBB) { in TryTailMergeBlocks()
967 MachineBasicBlock *MBB = SameTails[commonTailIndex].getBlock(); in TryTailMergeBlocks() local
970 setCommonTailEdgeWeights(*MBB); in TryTailMergeBlocks()
978 LLVM_DEBUG(dbgs() << "\nUsing common tail in " << printMBBReference(*MBB) in TryTailMergeBlocks()
986 replaceTailWithBranchTo(SameTails[i].getTailStartPos(), *MBB); in TryTailMergeBlocks()
1006 for (MachineBasicBlock &MBB : MF) { in TailMergeBlocks()
1009 if (!TriedMerging.count(&MBB) && MBB.succ_empty()) in TailMergeBlocks()
1010 MergePotentials.push_back(MergePotentialsElt(HashEndOfMBB(MBB), &MBB)); in TailMergeBlocks()
1203 MachineBasicBlock *MBB = &*I++; in OptimizeBranches() local
1204 MadeChange |= OptimizeBlock(MBB); in OptimizeBranches()
1207 if (MBB->pred_empty()) { in OptimizeBranches()
1208 RemoveDeadBlock(MBB); in OptimizeBranches()
1219 static bool IsEmptyBlock(MachineBasicBlock *MBB) { in IsEmptyBlock() argument
1220 return MBB->getFirstNonDebugInstr() == MBB->end(); in IsEmptyBlock()
1225 static bool IsBranchOnlyBlock(MachineBasicBlock *MBB) { in IsBranchOnlyBlock() argument
1226 MachineBasicBlock::iterator I = MBB->getFirstNonDebugInstr(); in IsBranchOnlyBlock()
1227 assert(I != MBB->end() && "empty block!"); in IsBranchOnlyBlock()
1258 static DebugLoc getBranchDebugLoc(MachineBasicBlock &MBB) { in getBranchDebugLoc() argument
1259 MachineBasicBlock::iterator I = MBB.getLastNonDebugInstr(); in getBranchDebugLoc()
1260 if (I != MBB.end() && I->isBranch()) in getBranchDebugLoc()
1266 MachineBasicBlock &MBB, in copyDebugInfoToPredecessor() argument
1269 for (MachineInstr &MI : MBB.instrs()) in copyDebugInfoToPredecessor()
1278 MachineBasicBlock &MBB, in copyDebugInfoToSuccessor() argument
1281 for (MachineInstr &MI : MBB.instrs()) in copyDebugInfoToSuccessor()
1297 MachineBasicBlock &MBB) { in salvageDebugInfoFromEmptyBlock() argument
1298 assert(IsEmptyBlock(&MBB) && "Expected an empty block (except debug info)."); in salvageDebugInfoFromEmptyBlock()
1301 for (MachineBasicBlock *SuccBB : MBB.successors()) in salvageDebugInfoFromEmptyBlock()
1303 copyDebugInfoToSuccessor(TII, MBB, *SuccBB); in salvageDebugInfoFromEmptyBlock()
1307 for (MachineBasicBlock *PredBB : MBB.predecessors()) in salvageDebugInfoFromEmptyBlock()
1309 copyDebugInfoToPredecessor(TII, MBB, *PredBB); in salvageDebugInfoFromEmptyBlock()
1312 bool BranchFolder::OptimizeBlock(MachineBasicBlock *MBB) { in OptimizeBlock() argument
1314 MachineFunction &MF = *MBB->getParent(); in OptimizeBlock()
1317 MachineFunction::iterator FallThrough = MBB->getIterator(); in OptimizeBlock()
1323 auto MBBEHScope = EHScopeMembership.find(MBB); in OptimizeBlock()
1335 TII->analyzeBranch(*MBB, CurTBB, CurFBB, CurCond, true); in OptimizeBlock()
1341 if (IsEmptyBlock(MBB) && !MBB->isEHPad() && !MBB->hasAddressTaken() && in OptimizeBlock()
1343 salvageDebugInfoFromEmptyBlock(TII, *MBB); in OptimizeBlock()
1345 if (MBB->pred_empty()) return MadeChange; in OptimizeBlock()
1354 } else if (MBB->isSuccessor(&*FallThrough)) { in OptimizeBlock()
1357 while (!MBB->pred_empty()) { in OptimizeBlock()
1358 MachineBasicBlock *Pred = *(MBB->pred_end()-1); in OptimizeBlock()
1359 Pred->ReplaceUsesOfBlockWith(MBB, &*FallThrough); in OptimizeBlock()
1364 MJTI->ReplaceMBBInJumpTables(MBB, &*FallThrough); in OptimizeBlock()
1372 MachineBasicBlock &PrevBB = *std::prev(MachineFunction::iterator(MBB)); in OptimizeBlock()
1386 if (PriorTBB != MBB) in OptimizeBlock()
1400 if (PriorCond.empty() && !PriorTBB && MBB->pred_size() == 1 && in OptimizeBlock()
1402 !MBB->hasAddressTaken() && !MBB->isEHPad()) { in OptimizeBlock()
1404 << "From MBB: " << *MBB); in OptimizeBlock()
1409 MachineBasicBlock::iterator MBBIter = MBB->begin(); in OptimizeBlock()
1412 while (PrevBBIter != PrevBB.begin() && MBBIter != MBB->end() in OptimizeBlock()
1421 PrevBB.splice(PrevBB.end(), MBB, MBB->begin(), MBB->end()); in OptimizeBlock()
1424 PrevBB.transferSuccessors(MBB); in OptimizeBlock()
1431 if (PriorTBB == MBB && !PriorFBB) { in OptimizeBlock()
1440 if (PriorFBB == MBB) { in OptimizeBlock()
1452 if (PriorTBB == MBB) { in OptimizeBlock()
1472 if (MBB->succ_empty() && !PriorCond.empty() && !PriorFBB && in OptimizeBlock()
1474 !MBB->canFallThrough()) { in OptimizeBlock()
1483 !IsBetterFallthrough(PriorTBB, MBB)) in OptimizeBlock()
1490 LLVM_DEBUG(dbgs() << "\nMoving MBB: " << *MBB in OptimizeBlock()
1495 TII->insertBranch(PrevBB, MBB, nullptr, NewPriorCond, dl); in OptimizeBlock()
1498 MBB->moveAfter(&MF.back()); in OptimizeBlock()
1509 llvm::shouldOptimizeForSize(MBB, PSI, &MBBFreqInfo); in OptimizeBlock()
1510 if (!IsEmptyBlock(MBB) && MBB->pred_size() == 1 && OptForSize) { in OptimizeBlock()
1514 MachineInstr &TailCall = *MBB->getFirstNonDebugInstr(); in OptimizeBlock()
1516 MachineBasicBlock *Pred = *MBB->pred_begin(); in OptimizeBlock()
1522 if (PredAnalyzable && !PredCond.empty() && PredTBB == MBB && in OptimizeBlock()
1533 Pred->removeSuccessor(MBB); in OptimizeBlock()
1552 if (CurTBB && CurFBB && CurFBB == MBB && CurTBB != MBB) { in OptimizeBlock()
1555 DebugLoc dl = getBranchDebugLoc(*MBB); in OptimizeBlock()
1556 TII->removeBranch(*MBB); in OptimizeBlock()
1557 TII->insertBranch(*MBB, CurFBB, CurTBB, NewCond, dl); in OptimizeBlock()
1567 IsBranchOnlyBlock(MBB) && CurTBB != MBB && in OptimizeBlock()
1568 !MBB->hasAddressTaken() && !MBB->isEHPad()) { in OptimizeBlock()
1569 DebugLoc dl = getBranchDebugLoc(*MBB); in OptimizeBlock()
1573 TII->removeBranch(*MBB); in OptimizeBlock()
1577 if (IsEmptyBlock(MBB)) { in OptimizeBlock()
1580 MBB->erase(MBB->begin(), MBB->end()); in OptimizeBlock()
1587 if (MBB->empty()) { in OptimizeBlock()
1590 !PrevBB.isSuccessor(MBB)) { in OptimizeBlock()
1593 if (!PredHasNoFallThrough && PrevBB.isSuccessor(MBB) && in OptimizeBlock()
1594 PriorTBB != MBB && PriorFBB != MBB) { in OptimizeBlock()
1598 PriorTBB = MBB; in OptimizeBlock()
1601 PriorFBB = MBB; in OptimizeBlock()
1612 while(PI != MBB->pred_size()) { in OptimizeBlock()
1613 MachineBasicBlock *PMBB = *(MBB->pred_begin() + PI); in OptimizeBlock()
1614 if (PMBB == MBB) { in OptimizeBlock()
1620 PMBB->ReplaceUsesOfBlockWith(MBB, CurTBB); in OptimizeBlock()
1641 MJTI->ReplaceMBBInJumpTables(MBB, CurTBB); in OptimizeBlock()
1651 TII->insertBranch(*MBB, CurTBB, nullptr, CurCond, dl); in OptimizeBlock()
1661 bool CurFallsThru = MBB->canFallThrough(); in OptimizeBlock()
1663 if (!MBB->isEHPad()) { in OptimizeBlock()
1667 for (MachineBasicBlock *PredBB : MBB->predecessors()) { in OptimizeBlock()
1671 if (PredBB != MBB && !PredBB->canFallThrough() && in OptimizeBlock()
1673 (PredTBB == MBB || PredFBB == MBB) && in OptimizeBlock()
1675 (!CurFallsThru || MBB->getNumber() >= PredBB->getNumber())) { in OptimizeBlock()
1687 MachineBasicBlock *NextBB = &*std::next(MBB->getIterator()); in OptimizeBlock()
1689 TII->insertBranch(*MBB, NextBB, nullptr, CurCond, DebugLoc()); in OptimizeBlock()
1691 MBB->moveAfter(PredBB); in OptimizeBlock()
1711 if (SuccBB != MBB && &*SuccPrev != MBB && in OptimizeBlock()
1713 MBB->moveBefore(SuccBB); in OptimizeBlock()
1740 MBB->moveAfter(&MF.back()); in OptimizeBlock()
1757 MachineBasicBlock *MBB = &*I++; in HoistCommonCode() local
1758 MadeChange |= HoistCommonCodeInSuccs(MBB); in HoistCommonCode()
1793 MachineBasicBlock::iterator findHoistingInsertPosAndDeps(MachineBasicBlock *MBB, in findHoistingInsertPosAndDeps() argument
1798 MachineBasicBlock::iterator Loc = MBB->getFirstTerminator(); in findHoistingInsertPosAndDeps()
1800 return MBB->end(); in findHoistingInsertPosAndDeps()
1814 return MBB->end(); in findHoistingInsertPosAndDeps()
1828 if (Loc == MBB->begin()) in findHoistingInsertPosAndDeps()
1833 MachineBasicBlock::iterator PI = prev_nodbg(Loc, MBB->begin()); in findHoistingInsertPosAndDeps()
1863 return MBB->end(); in findHoistingInsertPosAndDeps()
1889 bool BranchFolder::HoistCommonCodeInSuccs(MachineBasicBlock *MBB) { in HoistCommonCodeInSuccs() argument
1892 if (TII->analyzeBranch(*MBB, TBB, FBB, Cond, true) || !TBB || Cond.empty()) in HoistCommonCodeInSuccs()
1895 if (!FBB) FBB = findFalseBlock(MBB, TBB); in HoistCommonCodeInSuccs()
1910 findHoistingInsertPosAndDeps(MBB, TII, TRI, Uses, Defs); in HoistCommonCodeInSuccs()
1911 if (Loc == MBB->end()) in HoistCommonCodeInSuccs()
2026 MBB->splice(Loc, TBB, TBB->begin(), TIB); in HoistCommonCodeInSuccs()