Lines Matching refs:MBB
158 void BranchFolder::RemoveDeadBlock(MachineBasicBlock *MBB) { in RemoveDeadBlock() argument
159 assert(MBB->pred_empty() && "MBB must be dead!"); in RemoveDeadBlock()
160 LLVM_DEBUG(dbgs() << "\nRemoving MBB: " << *MBB); in RemoveDeadBlock()
162 MachineFunction *MF = MBB->getParent(); in RemoveDeadBlock()
164 while (!MBB->succ_empty()) in RemoveDeadBlock()
165 MBB->removeSuccessor(MBB->succ_end()-1); in RemoveDeadBlock()
168 TriedMerging.erase(MBB); in RemoveDeadBlock()
171 for (const MachineInstr &MI : *MBB) in RemoveDeadBlock()
176 MF->erase(MBB); in RemoveDeadBlock()
177 EHScopeMembership.erase(MBB); in RemoveDeadBlock()
179 MLI->removeBlock(MBB); in RemoveDeadBlock()
292 static unsigned HashEndOfMBB(const MachineBasicBlock &MBB) { in HashEndOfMBB() argument
293 MachineBasicBlock::const_iterator I = MBB.getLastNonDebugInstr(false); in HashEndOfMBB()
294 if (I == MBB.end()) in HashEndOfMBB()
310 MachineBasicBlock *MBB) { in skipBackwardPastNonInstructions() argument
311 while (I != MBB->begin()) { in skipBackwardPastNonInstructions()
316 return MBB->end(); in skipBackwardPastNonInstructions()
494 static unsigned CountTerminators(MachineBasicBlock *MBB, in CountTerminators() argument
496 I = MBB->end(); in CountTerminators()
499 if (I == MBB->begin()) { in CountTerminators()
500 I = MBB->end(); in CountTerminators()
513 static bool blockEndsInUnreachable(const MachineBasicBlock *MBB) { in blockEndsInUnreachable() argument
514 if (!MBB->succ_empty()) in blockEndsInUnreachable()
516 if (MBB->empty()) in blockEndsInUnreachable()
518 return !(MBB->back().isReturn() || MBB->back().isIndirectBranch()); in blockEndsInUnreachable()
611 auto BothFallThrough = [](MachineBasicBlock *MBB) { in ProfitableToMerge() argument
612 if (!MBB->succ_empty() && !MBB->canFallThrough()) in ProfitableToMerge()
614 MachineFunction::iterator I(MBB); in ProfitableToMerge()
615 MachineFunction *MF = MBB->getParent(); in ProfitableToMerge()
616 return (MBB != &*MF->begin()) && std::prev(I)->canFallThrough(); in ProfitableToMerge()
730 MachineBasicBlock *MBB = SameTails[commonTailIndex].getBlock(); in CreateCommonTailOnlyBlock() local
732 LLVM_DEBUG(dbgs() << "\nSplitting " << printMBBReference(*MBB) << ", size " in CreateCommonTailOnlyBlock()
738 const BasicBlock *BB = (SuccBB && MBB->succ_size() == 1) ? in CreateCommonTailOnlyBlock()
739 SuccBB->getBasicBlock() : MBB->getBasicBlock(); in CreateCommonTailOnlyBlock()
740 MachineBasicBlock *newMBB = SplitMBBAt(*MBB, BBI, BB); in CreateCommonTailOnlyBlock()
750 if (PredBB == MBB) in CreateCommonTailOnlyBlock()
759 MachineBasicBlock *MBB = MBBIStartPos->getParent(); in mergeOperations() local
764 for (auto E = MBB->end(); MBBIStartPos != E; ++MBBIStartPos) in mergeOperations()
767 MachineBasicBlock::reverse_iterator MBBI = MBB->rbegin(); in mergeOperations()
768 MachineBasicBlock::reverse_iterator MBBIE = MBB->rend(); in mergeOperations()
790 MBBICommon->cloneMergedMemRefs(*MBB->getParent(), {&*MBBICommon, &*MBBI}); in mergeOperations()
807 MachineBasicBlock *MBB = SameTails[commonTailIndex].getBlock(); in mergeCommonTails() local
813 mergeOperations(SameTails[i].getTailStartPos(), *MBB); in mergeCommonTails()
815 assert(SameTails[i].getTailStartPos() == MBB->begin() && in mergeCommonTails()
820 for (auto &MI : *MBB) { in mergeCommonTails()
845 computeLiveIns(NewLiveIns, *MBB); in mergeCommonTails()
850 for (MachineBasicBlock *Pred : MBB->predecessors()) { in mergeCommonTails()
871 MBB->clearLiveIns(); in mergeCommonTails()
872 addLiveIns(*MBB, NewLiveIns); in mergeCommonTails()
948 MachineBasicBlock *MBB = SameTails[i].getBlock(); in TryTailMergeBlocks() local
949 if ((MBB == EntryBB || MBB->isEHPad()) && in TryTailMergeBlocks()
952 if (MBB == PredBB) { in TryTailMergeBlocks()
973 MachineBasicBlock *MBB = SameTails[commonTailIndex].getBlock(); in TryTailMergeBlocks() local
976 setCommonTailEdgeWeights(*MBB); in TryTailMergeBlocks()
984 LLVM_DEBUG(dbgs() << "\nUsing common tail in " << printMBBReference(*MBB) in TryTailMergeBlocks()
992 replaceTailWithBranchTo(SameTails[i].getTailStartPos(), *MBB); in TryTailMergeBlocks()
1012 for (MachineBasicBlock &MBB : MF) { in TailMergeBlocks()
1015 if (!TriedMerging.count(&MBB) && MBB.succ_empty()) in TailMergeBlocks()
1016 MergePotentials.push_back(MergePotentialsElt(HashEndOfMBB(MBB), &MBB)); in TailMergeBlocks()
1207 for (MachineBasicBlock &MBB : in OptimizeBranches()
1209 MadeChange |= OptimizeBlock(&MBB); in OptimizeBranches()
1212 if (MBB.pred_empty() && !MBB.isMachineBlockAddressTaken()) { in OptimizeBranches()
1213 RemoveDeadBlock(&MBB); in OptimizeBranches()
1224 static bool IsEmptyBlock(MachineBasicBlock *MBB) { in IsEmptyBlock() argument
1225 return MBB->getFirstNonDebugInstr(true) == MBB->end(); in IsEmptyBlock()
1230 static bool IsBranchOnlyBlock(MachineBasicBlock *MBB) { in IsBranchOnlyBlock() argument
1231 MachineBasicBlock::iterator I = MBB->getFirstNonDebugInstr(); in IsBranchOnlyBlock()
1232 assert(I != MBB->end() && "empty block!"); in IsBranchOnlyBlock()
1263 static DebugLoc getBranchDebugLoc(MachineBasicBlock &MBB) { in getBranchDebugLoc() argument
1264 MachineBasicBlock::iterator I = MBB.getLastNonDebugInstr(); in getBranchDebugLoc()
1265 if (I != MBB.end() && I->isBranch()) in getBranchDebugLoc()
1271 MachineBasicBlock &MBB, in copyDebugInfoToPredecessor() argument
1274 for (MachineInstr &MI : MBB.instrs()) in copyDebugInfoToPredecessor()
1283 MachineBasicBlock &MBB, in copyDebugInfoToSuccessor() argument
1286 for (MachineInstr &MI : MBB.instrs()) in copyDebugInfoToSuccessor()
1302 MachineBasicBlock &MBB) { in salvageDebugInfoFromEmptyBlock() argument
1303 assert(IsEmptyBlock(&MBB) && "Expected an empty block (except debug info)."); in salvageDebugInfoFromEmptyBlock()
1306 for (MachineBasicBlock *SuccBB : MBB.successors()) in salvageDebugInfoFromEmptyBlock()
1308 copyDebugInfoToSuccessor(TII, MBB, *SuccBB); in salvageDebugInfoFromEmptyBlock()
1312 for (MachineBasicBlock *PredBB : MBB.predecessors()) in salvageDebugInfoFromEmptyBlock()
1314 copyDebugInfoToPredecessor(TII, MBB, *PredBB); in salvageDebugInfoFromEmptyBlock()
1317 bool BranchFolder::OptimizeBlock(MachineBasicBlock *MBB) { in OptimizeBlock() argument
1319 MachineFunction &MF = *MBB->getParent(); in OptimizeBlock()
1322 MachineFunction::iterator FallThrough = MBB->getIterator(); in OptimizeBlock()
1328 auto MBBEHScope = EHScopeMembership.find(MBB); in OptimizeBlock()
1340 TII->analyzeBranch(*MBB, CurTBB, CurFBB, CurCond, true); in OptimizeBlock()
1346 if (IsEmptyBlock(MBB) && !MBB->isEHPad() && !MBB->hasAddressTaken() && in OptimizeBlock()
1348 salvageDebugInfoFromEmptyBlock(TII, *MBB); in OptimizeBlock()
1350 if (MBB->pred_empty()) return MadeChange; in OptimizeBlock()
1359 } else if (MBB->isSuccessor(&*FallThrough)) { in OptimizeBlock()
1362 while (!MBB->pred_empty()) { in OptimizeBlock()
1363 MachineBasicBlock *Pred = *(MBB->pred_end()-1); in OptimizeBlock()
1364 Pred->ReplaceUsesOfBlockWith(MBB, &*FallThrough); in OptimizeBlock()
1369 for (auto SI = MBB->succ_begin(), SE = MBB->succ_end(); SI != SE; ++SI) in OptimizeBlock()
1372 FallThrough->copySuccessor(MBB, SI); in OptimizeBlock()
1377 MJTI->ReplaceMBBInJumpTables(MBB, &*FallThrough); in OptimizeBlock()
1385 MachineBasicBlock &PrevBB = *std::prev(MachineFunction::iterator(MBB)); in OptimizeBlock()
1399 if (PriorTBB != MBB) in OptimizeBlock()
1413 if (PriorCond.empty() && !PriorTBB && MBB->pred_size() == 1 && in OptimizeBlock()
1414 PrevBB.succ_size() == 1 && PrevBB.isSuccessor(MBB) && in OptimizeBlock()
1415 !MBB->hasAddressTaken() && !MBB->isEHPad()) { in OptimizeBlock()
1417 << "From MBB: " << *MBB); in OptimizeBlock()
1422 MachineBasicBlock::iterator MBBIter = MBB->begin(); in OptimizeBlock()
1425 while (PrevBBIter != PrevBB.begin() && MBBIter != MBB->end() in OptimizeBlock()
1434 PrevBB.splice(PrevBB.end(), MBB, MBB->begin(), MBB->end()); in OptimizeBlock()
1437 PrevBB.transferSuccessors(MBB); in OptimizeBlock()
1444 if (PriorTBB == MBB && !PriorFBB) { in OptimizeBlock()
1453 if (PriorFBB == MBB) { in OptimizeBlock()
1465 if (PriorTBB == MBB) { in OptimizeBlock()
1485 if (MBB->succ_empty() && !PriorCond.empty() && !PriorFBB && in OptimizeBlock()
1487 !MBB->canFallThrough()) { in OptimizeBlock()
1496 !IsBetterFallthrough(PriorTBB, MBB)) in OptimizeBlock()
1503 LLVM_DEBUG(dbgs() << "\nMoving MBB: " << *MBB in OptimizeBlock()
1508 TII->insertBranch(PrevBB, MBB, nullptr, NewPriorCond, dl); in OptimizeBlock()
1511 MBB->moveAfter(&MF.back()); in OptimizeBlock()
1520 if (!IsEmptyBlock(MBB)) { in OptimizeBlock()
1521 MachineInstr &TailCall = *MBB->getFirstNonDebugInstr(); in OptimizeBlock()
1524 for (auto &Pred : MBB->predecessors()) { in OptimizeBlock()
1531 if (PredAnalyzable && !PredCond.empty() && PredTBB == MBB && in OptimizeBlock()
1553 Pred->removeSuccessor(MBB); in OptimizeBlock()
1566 if (CurTBB && CurFBB && CurFBB == MBB && CurTBB != MBB) { in OptimizeBlock()
1569 DebugLoc dl = getBranchDebugLoc(*MBB); in OptimizeBlock()
1570 TII->removeBranch(*MBB); in OptimizeBlock()
1571 TII->insertBranch(*MBB, CurFBB, CurTBB, NewCond, dl); in OptimizeBlock()
1581 IsBranchOnlyBlock(MBB) && CurTBB != MBB && in OptimizeBlock()
1582 !MBB->hasAddressTaken() && !MBB->isEHPad()) { in OptimizeBlock()
1583 DebugLoc dl = getBranchDebugLoc(*MBB); in OptimizeBlock()
1587 TII->removeBranch(*MBB); in OptimizeBlock()
1591 if (IsEmptyBlock(MBB)) { in OptimizeBlock()
1594 MBB->erase(MBB->begin(), MBB->end()); in OptimizeBlock()
1601 if (MBB->empty()) { in OptimizeBlock()
1604 !PrevBB.isSuccessor(MBB)) { in OptimizeBlock()
1607 if (!PredHasNoFallThrough && PrevBB.isSuccessor(MBB) && in OptimizeBlock()
1608 PriorTBB != MBB && PriorFBB != MBB) { in OptimizeBlock()
1612 PriorTBB = MBB; in OptimizeBlock()
1615 PriorFBB = MBB; in OptimizeBlock()
1626 while(PI != MBB->pred_size()) { in OptimizeBlock()
1627 MachineBasicBlock *PMBB = *(MBB->pred_begin() + PI); in OptimizeBlock()
1628 if (PMBB == MBB) { in OptimizeBlock()
1634 PMBB->ReplaceUsesOfBlockWith(MBB, CurTBB); in OptimizeBlock()
1638 for (auto SI = MBB->succ_begin(), SE = MBB->succ_end(); SI != SE; in OptimizeBlock()
1642 CurTBB->copySuccessor(MBB, SI); in OptimizeBlock()
1664 MJTI->ReplaceMBBInJumpTables(MBB, CurTBB); in OptimizeBlock()
1674 TII->insertBranch(*MBB, CurTBB, nullptr, CurCond, dl); in OptimizeBlock()
1684 bool CurFallsThru = MBB->canFallThrough(); in OptimizeBlock()
1686 if (!MBB->isEHPad()) { in OptimizeBlock()
1690 for (MachineBasicBlock *PredBB : MBB->predecessors()) { in OptimizeBlock()
1694 if (PredBB != MBB && !PredBB->canFallThrough() && in OptimizeBlock()
1696 (PredTBB == MBB || PredFBB == MBB) && in OptimizeBlock()
1698 (!CurFallsThru || MBB->getNumber() >= PredBB->getNumber())) { in OptimizeBlock()
1710 MachineBasicBlock *NextBB = &*std::next(MBB->getIterator()); in OptimizeBlock()
1712 TII->insertBranch(*MBB, NextBB, nullptr, CurCond, DebugLoc()); in OptimizeBlock()
1714 MBB->moveAfter(PredBB); in OptimizeBlock()
1734 if (SuccBB != MBB && &*SuccPrev != MBB && in OptimizeBlock()
1736 MBB->moveBefore(SuccBB); in OptimizeBlock()
1763 MBB->moveAfter(&MF.back()); in OptimizeBlock()
1779 for (MachineBasicBlock &MBB : llvm::make_early_inc_range(MF)) in HoistCommonCode()
1780 MadeChange |= HoistCommonCodeInSuccs(&MBB); in HoistCommonCode()
1814 MachineBasicBlock::iterator findHoistingInsertPosAndDeps(MachineBasicBlock *MBB, in findHoistingInsertPosAndDeps() argument
1819 MachineBasicBlock::iterator Loc = MBB->getFirstTerminator(); in findHoistingInsertPosAndDeps()
1821 return MBB->end(); in findHoistingInsertPosAndDeps()
1835 return MBB->end(); in findHoistingInsertPosAndDeps()
1849 if (Loc == MBB->begin()) in findHoistingInsertPosAndDeps()
1854 MachineBasicBlock::iterator PI = prev_nodbg(Loc, MBB->begin()); in findHoistingInsertPosAndDeps()
1884 return MBB->end(); in findHoistingInsertPosAndDeps()
1910 bool BranchFolder::HoistCommonCodeInSuccs(MachineBasicBlock *MBB) { in HoistCommonCodeInSuccs() argument
1913 if (TII->analyzeBranch(*MBB, TBB, FBB, Cond, true) || !TBB || Cond.empty()) in HoistCommonCodeInSuccs()
1916 if (!FBB) FBB = findFalseBlock(MBB, TBB); in HoistCommonCodeInSuccs()
1931 findHoistingInsertPosAndDeps(MBB, TII, TRI, Uses, Defs); in HoistCommonCodeInSuccs()
1932 if (Loc == MBB->end()) in HoistCommonCodeInSuccs()
2047 MBB->splice(Loc, TBB, TBB->begin(), TIB); in HoistCommonCodeInSuccs()