diff options
author | Kang Zhang <shkzhang@cn.ibm.com> | 2019-07-26 01:58:53 +0000 |
---|---|---|
committer | Kang Zhang <shkzhang@cn.ibm.com> | 2019-07-26 01:58:53 +0000 |
commit | 5c61015455839a35fe9641759648947f8991477b (patch) | |
tree | 07427a78d5a47e2a5bfd735e638241d17c948788 /llvm/lib/CodeGen/MachineBlockPlacement.cpp | |
parent | 5620e7530f0767ba8aa4ab0a4667ba785ee6b5a1 (diff) | |
download | bcm5719-llvm-5c61015455839a35fe9641759648947f8991477b.tar.gz bcm5719-llvm-5c61015455839a35fe9641759648947f8991477b.zip |
[PowerPC] Do the Simple Early Return in block-placement pass to optimize the blocks
Summary:
In `block-placement` pass, it will create some patterns for unconditional we can do the simple early retrun.
But the `early-ret` pass is before `block-placement`, we don't want to run it again.
This patch is to do the simple early return to optimize the blocks at the last of `block-placement`.
Below is an example
```
BB: | BB:
XOR 3, 3, 4 | XOR 3, 3, 4
B TBB | B ChainBB
... | ...
ChainBB: | ChainBB:
B TBB | ADD 3, 3, 4
... | BLR
TBB: |
ADD 3, 3, 4 |
BLR |
```
Reviewed By: efriedma
Differential Revision: https://reviews.llvm.org/D63972
llvm-svn: 367080
Diffstat (limited to 'llvm/lib/CodeGen/MachineBlockPlacement.cpp')
-rw-r--r-- | llvm/lib/CodeGen/MachineBlockPlacement.cpp | 25 |
1 files changed, 25 insertions, 0 deletions
diff --git a/llvm/lib/CodeGen/MachineBlockPlacement.cpp b/llvm/lib/CodeGen/MachineBlockPlacement.cpp index 639b588766a..a469f893ce1 100644 --- a/llvm/lib/CodeGen/MachineBlockPlacement.cpp +++ b/llvm/lib/CodeGen/MachineBlockPlacement.cpp @@ -2730,6 +2730,31 @@ void MachineBlockPlacement::optimizeBranches() { TII->removeBranch(*ChainBB); TII->insertBranch(*ChainBB, FBB, TBB, Cond, dl); ChainBB->updateTerminator(); + } else if (Cond.empty() && TBB && ChainBB != TBB && + !TBB->canFallThrough()) { + // When ChainBB is unconditional branch to the TBB, and TBB has no + // fallthrough predecessor and fallthrough successor, try to merge + // ChainBB and TBB. This is legal under the one of following conditions: + // 1. ChainBB is empty except for an unconditional branch. + // 2. TBB has only one predecessor. + MachineFunction::iterator I(TBB); + if (((TBB == &*F->begin()) || !std::prev(I)->canFallThrough()) && + (TailDup.isSimpleBB(ChainBB) || (TBB->pred_size() == 1))) { + TII->removeBranch(*ChainBB); + ChainBB->removeSuccessor(TBB); + + // Update the CFG. + for (MachineBasicBlock::pred_iterator PI = TBB->pred_begin(), + PE = TBB->pred_end(); PI != PE; PI++) + (*PI)->ReplaceUsesOfBlockWith(TBB, ChainBB); + + for (MachineBasicBlock *Succ : TBB->successors()) + ChainBB->addSuccessor(Succ, MBPI->getEdgeProbability(TBB, Succ)); + + // Move all the instructions of TBB to ChainBB. + ChainBB->splice(ChainBB->end(), TBB, TBB->begin(), TBB->end()); + F->remove(TBB); + } } } } |