LLVM 22.0.0git
PPCEarlyReturn.cpp
Go to the documentation of this file.
1//===------------- PPCEarlyReturn.cpp - Form Early Returns ----------------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8//
9// A pass that form early (predicated) returns. If-conversion handles some of
10// this, but this pass picks up some remaining cases.
11//
12//===----------------------------------------------------------------------===//
13
14#include "PPC.h"
15#include "PPCInstrInfo.h"
16#include "llvm/ADT/STLExtras.h"
17#include "llvm/ADT/Statistic.h"
23
24using namespace llvm;
25
26#define DEBUG_TYPE "ppc-early-ret"
27STATISTIC(NumBCLR, "Number of early conditional returns");
28STATISTIC(NumBLR, "Number of early returns");
29
30namespace {
31 // PPCEarlyReturn pass - For simple functions without epilogue code, move
32 // returns up, and create conditional returns, to avoid unnecessary
33 // branch-to-blr sequences.
34 struct PPCEarlyReturn : public MachineFunctionPass {
35 static char ID;
36 PPCEarlyReturn() : MachineFunctionPass(ID) {}
37
38 const TargetInstrInfo *TII;
39
40protected:
41 bool processBlock(MachineBasicBlock &ReturnMBB) {
42 bool Changed = false;
43
45 I = ReturnMBB.SkipPHIsLabelsAndDebug(I);
46
47 // The block must be essentially empty except for the blr.
48 if (I == ReturnMBB.end() ||
49 (I->getOpcode() != PPC::BLR && I->getOpcode() != PPC::BLR8) ||
50 I != ReturnMBB.getLastNonDebugInstr())
51 return Changed;
52
54 for (MachineBasicBlock *Pred : ReturnMBB.predecessors()) {
55 bool OtherReference = false, BlockChanged = false;
56
57 if (Pred->empty())
58 continue;
59
60 for (MachineBasicBlock::iterator J = Pred->getLastNonDebugInstr();;) {
61 if (J == Pred->end())
62 break;
63
64 if (J->getOpcode() == PPC::B) {
65 if (J->getOperand(0).getMBB() == &ReturnMBB) {
66 // This is an unconditional branch to the return. Replace the
67 // branch with a blr.
68 MachineInstr *MI = ReturnMBB.getParent()->CloneMachineInstr(&*I);
69 Pred->insert(J, MI);
70
72 K->eraseFromParent();
73 BlockChanged = true;
74 ++NumBLR;
75 continue;
76 }
77 } else if (J->getOpcode() == PPC::BCC) {
78 if (J->getOperand(2).getMBB() == &ReturnMBB) {
79 // This is a conditional branch to the return. Replace the branch
80 // with a bclr.
81 MachineInstr *MI = ReturnMBB.getParent()->CloneMachineInstr(&*I);
82 MI->setDesc(TII->get(PPC::BCCLR));
83 MachineInstrBuilder(*ReturnMBB.getParent(), MI)
84 .add(J->getOperand(0))
85 .add(J->getOperand(1));
86 Pred->insert(J, MI);
87
89 K->eraseFromParent();
90 BlockChanged = true;
91 ++NumBCLR;
92 continue;
93 }
94 } else if (J->getOpcode() == PPC::BC || J->getOpcode() == PPC::BCn) {
95 if (J->getOperand(1).getMBB() == &ReturnMBB) {
96 // This is a conditional branch to the return. Replace the branch
97 // with a bclr.
98 MachineInstr *MI = ReturnMBB.getParent()->CloneMachineInstr(&*I);
99 MI->setDesc(
100 TII->get(J->getOpcode() == PPC::BC ? PPC::BCLR : PPC::BCLRn));
101 MachineInstrBuilder(*ReturnMBB.getParent(), MI)
102 .add(J->getOperand(0));
103 Pred->insert(J, MI);
104
106 K->eraseFromParent();
107 BlockChanged = true;
108 ++NumBCLR;
109 continue;
110 }
111 } else if (J->isBranch()) {
112 if (J->isIndirectBranch()) {
113 if (ReturnMBB.hasAddressTaken())
114 OtherReference = true;
115 } else
116 for (unsigned i = 0; i < J->getNumOperands(); ++i)
117 if (J->getOperand(i).isMBB() &&
118 J->getOperand(i).getMBB() == &ReturnMBB)
119 OtherReference = true;
120 } else if (!J->isTerminator() && !J->isDebugInstr())
121 break;
122
123 if (J == Pred->begin())
124 break;
125
126 --J;
127 }
128
129 if (Pred->canFallThrough() && Pred->isLayoutSuccessor(&ReturnMBB))
130 OtherReference = true;
131
132 // Predecessors are stored in a vector and can't be removed here.
133 if (!OtherReference && BlockChanged) {
134 PredToRemove.push_back(Pred);
135 }
136
137 if (BlockChanged)
138 Changed = true;
139 }
140
141 for (MachineBasicBlock *MBB : PredToRemove)
142 MBB->removeSuccessor(&ReturnMBB, true);
143
144 if (Changed && !ReturnMBB.hasAddressTaken()) {
145 // We now might be able to merge this blr-only block into its
146 // by-layout predecessor.
147 if (ReturnMBB.pred_size() == 1) {
148 MachineBasicBlock &PrevMBB = **ReturnMBB.pred_begin();
149 if (PrevMBB.isLayoutSuccessor(&ReturnMBB) && PrevMBB.canFallThrough()) {
150 // Move the blr into the preceding block.
151 PrevMBB.splice(PrevMBB.end(), &ReturnMBB, I);
152 PrevMBB.removeSuccessor(&ReturnMBB, true);
153 }
154 }
155
156 if (ReturnMBB.pred_empty())
157 ReturnMBB.eraseFromParent();
158 }
159
160 return Changed;
161 }
162
163public:
164 bool runOnMachineFunction(MachineFunction &MF) override {
165 if (skipFunction(MF.getFunction()))
166 return false;
167
169
170 bool Changed = false;
171
172 // If the function does not have at least two blocks, then there is
173 // nothing to do.
174 if (MF.size() < 2)
175 return Changed;
176
178 Changed |= processBlock(B);
179
180 return Changed;
181 }
182
184 return MachineFunctionProperties().setNoVRegs();
185 }
186
187 void getAnalysisUsage(AnalysisUsage &AU) const override {
189 }
190 };
191}
192
193INITIALIZE_PASS(PPCEarlyReturn, DEBUG_TYPE,
194 "PowerPC Early-Return Creation", false, false)
195
196char PPCEarlyReturn::ID = 0;
198llvm::createPPCEarlyReturnPass() { return new PPCEarlyReturn(); }
MachineBasicBlock & MBB
static GCRegistry::Add< OcamlGC > B("ocaml", "ocaml 3.10-compatible GC")
const HexagonInstrInfo * TII
IRTranslator LLVM IR MI
#define I(x, y, z)
Definition: MD5.cpp:58
#define DEBUG_TYPE
#define INITIALIZE_PASS(passName, arg, name, cfg, analysis)
Definition: PassSupport.h:56
This file contains some templates that are useful if you are working with the STL at all.
This file defines the 'Statistic' class, which is designed to be an easy way to expose various metric...
#define STATISTIC(VARNAME, DESC)
Definition: Statistic.h:167
Represent the analysis usage information of a pass.
FunctionPass class - This class is used to implement most global optimizations.
Definition: Pass.h:314
bool skipFunction(const Function &F) const
Optional passes call this function to check whether the pass should be skipped.
Definition: Pass.cpp:188
unsigned pred_size() const
LLVM_ABI iterator SkipPHIsLabelsAndDebug(iterator I, Register Reg=Register(), bool SkipPseudoOp=true)
Return the first instruction in MBB after I that is not a PHI, label or debug.
LLVM_ABI bool canFallThrough()
Return true if the block can implicitly transfer control to the block after it by falling off the end...
bool hasAddressTaken() const
Test whether this block is used as something other than the target of a terminator,...
LLVM_ABI void removeSuccessor(MachineBasicBlock *Succ, bool NormalizeSuccProbs=false)
Remove successor from the successors list of this MachineBasicBlock.
LLVM_ABI iterator getLastNonDebugInstr(bool SkipPseudoOp=true)
Returns an iterator to the last non-debug instruction in the basic block, or end().
LLVM_ABI bool isLayoutSuccessor(const MachineBasicBlock *MBB) const
Return true if the specified MBB will be emitted immediately after this block, such that if this bloc...
LLVM_ABI void eraseFromParent()
This method unlinks 'this' from the containing function and deletes it.
const MachineFunction * getParent() const
Return the MachineFunction containing this basic block.
iterator_range< pred_iterator > predecessors()
void splice(iterator Where, MachineBasicBlock *Other, iterator From)
Take an instruction from MBB 'Other' at the position From, and insert it into this MBB right before '...
MachineFunctionPass - This class adapts the FunctionPass interface to allow convenient creation of pa...
void getAnalysisUsage(AnalysisUsage &AU) const override
getAnalysisUsage - Subclasses that override getAnalysisUsage must call this.
virtual bool runOnMachineFunction(MachineFunction &MF)=0
runOnMachineFunction - This method must be overloaded to perform the desired machine code transformat...
virtual MachineFunctionProperties getRequiredProperties() const
Properties which a MachineFunction may have at a given point in time.
const TargetSubtargetInfo & getSubtarget() const
getSubtarget - Return the subtarget for which this machine code is being compiled.
unsigned size() const
Function & getFunction()
Return the LLVM function that this machine code represents.
MachineInstr * CloneMachineInstr(const MachineInstr *Orig)
Create a new MachineInstr which is a copy of Orig, identical in all ways except the instruction has n...
const MachineInstrBuilder & add(const MachineOperand &MO) const
Representation of each machine instruction.
Definition: MachineInstr.h:72
LLVM_ABI void insert(mop_iterator InsertBefore, ArrayRef< MachineOperand > Ops)
Inserts Ops BEFORE It. Can untie/retie tied operands.
void push_back(const T &Elt)
Definition: SmallVector.h:414
This is a 'vector' (really, a variable-sized array), optimized for the case when the array is small.
Definition: SmallVector.h:1197
TargetInstrInfo - Interface to description of machine instruction set.
virtual const TargetInstrInfo * getInstrInfo() const
unsigned ID
LLVM IR allows to use arbitrary numbers as calling convention identifiers.
Definition: CallingConv.h:24
This is an optimization pass for GlobalISel generic memory operations.
Definition: AddressRanges.h:18
iterator_range< early_inc_iterator_impl< detail::IterOfRange< RangeT > > > make_early_inc_range(RangeT &&Range)
Make a range that does early increment to allow mutation of the underlying range without disrupting i...
Definition: STLExtras.h:663
FunctionPass * createPPCEarlyReturnPass()