From: alex-t Date: Wed, 28 Oct 2020 16:01:02 +0000 (+0300) Subject: [AMDGPU] SILowerControlFlow::removeMBBifRedundant. Refactoring plus fix for the null... X-Git-Tag: llvmorg-13-init~7630 X-Git-Url: http://review.tizen.org/git/?a=commitdiff_plain;h=a4f7e4264cfcc67dad971477c32a01fffa61c3fa;p=platform%2Fupstream%2Fllvm.git [AMDGPU] SILowerControlFlow::removeMBBifRedundant. Refactoring plus fix for the null MBB pointer in MF->splice Detailed description: This change addresses the refactoring adviced by foad. It also contain the fix for the case when getNextNode is null if the successor block is the last in MachineFunction. Reviewed By: foad Differential Revision: https://reviews.llvm.org/D90314 --- diff --git a/llvm/lib/Target/AMDGPU/SILowerControlFlow.cpp b/llvm/lib/Target/AMDGPU/SILowerControlFlow.cpp index af1204c..563a52f 100644 --- a/llvm/lib/Target/AMDGPU/SILowerControlFlow.cpp +++ b/llvm/lib/Target/AMDGPU/SILowerControlFlow.cpp @@ -680,60 +680,58 @@ MachineBasicBlock *SILowerControlFlow::process(MachineInstr &MI) { } bool SILowerControlFlow::removeMBBifRedundant(MachineBasicBlock &MBB) { - auto getFallThroughSucc = [=](MachineBasicBlock * MBB) { - MachineBasicBlock *Ret = nullptr; - for (auto S : MBB->successors()) { - if (MBB->isLayoutSuccessor(S)) { - // The only fallthrough candidate - MachineBasicBlock::iterator I(MBB->getFirstInstrTerminator()); - while (I != MBB->end()) { - if (I->isBranch() && TII->getBranchDestBlock(*I) == S) - // We have unoptimized branch to layout successor - break; - I++; - } - if (I == MBB->end()) - Ret = S; - break; + auto GetFallThroughSucc = [=](MachineBasicBlock *B) -> MachineBasicBlock * { + auto *S = B->getNextNode(); + if (!S) + return nullptr; + if (B->isSuccessor(S)) { + // The only fallthrough candidate + MachineBasicBlock::iterator I(B->getFirstInstrTerminator()); + MachineBasicBlock::iterator E = B->end(); + for (; I != E; I++) { + if (I->isBranch() && TII->getBranchDestBlock(*I) == S) + // We have unoptimized branch to layout successor + return nullptr; } } - return Ret; + return S; }; - bool Redundant = true; + for (auto &I : MBB.instrs()) { if (!I.isDebugInstr() && !I.isUnconditionalBranch()) - Redundant = false; + return false; } - if (Redundant) { - MachineBasicBlock *Succ = *MBB.succ_begin(); - SmallVector Preds(MBB.predecessors()); - MachineBasicBlock *FallThrough = nullptr; - for (auto P : Preds) { - if (getFallThroughSucc(P) == &MBB) - FallThrough = P; - P->ReplaceUsesOfBlockWith(&MBB, Succ); - } - MBB.removeSuccessor(Succ); - if (LIS) { - for (auto &I : MBB.instrs()) - LIS->RemoveMachineInstrFromMaps(I); - } - MBB.clear(); - MBB.eraseFromParent(); - if (FallThrough && !FallThrough->isLayoutSuccessor(Succ)) { - MachineFunction *MF = FallThrough->getParent(); - if (!getFallThroughSucc(Succ)) { - MachineFunction::iterator InsertPt(FallThrough->getNextNode()); - MF->splice(InsertPt, Succ); - } else - BuildMI(*FallThrough, FallThrough->end(), - FallThrough->findBranchDebugLoc(), TII->get(AMDGPU::S_BRANCH)) - .addMBB(Succ); - } - return true; + assert(MBB.succ_size() == 1 && "MBB has more than one successor"); + + MachineBasicBlock *Succ = *MBB.succ_begin(); + MachineBasicBlock *FallThrough = nullptr; + + while (!MBB.predecessors().empty()) { + MachineBasicBlock *P = *MBB.pred_begin(); + if (GetFallThroughSucc(P) == &MBB) + FallThrough = P; + P->ReplaceUsesOfBlockWith(&MBB, Succ); } - return false; + MBB.removeSuccessor(Succ); + if (LIS) { + for (auto &I : MBB.instrs()) + LIS->RemoveMachineInstrFromMaps(I); + } + MBB.clear(); + MBB.eraseFromParent(); + if (FallThrough && !FallThrough->isLayoutSuccessor(Succ)) { + if (!GetFallThroughSucc(Succ)) { + MachineFunction *MF = FallThrough->getParent(); + MachineFunction::iterator FallThroughPos(FallThrough); + MF->splice(std::next(FallThroughPos), Succ); + } else + BuildMI(*FallThrough, FallThrough->end(), + FallThrough->findBranchDebugLoc(), TII->get(AMDGPU::S_BRANCH)) + .addMBB(Succ); + } + + return true; } bool SILowerControlFlow::runOnMachineFunction(MachineFunction &MF) {