LLVM 24.0.0git
X86DynAllocaExpander.cpp
Go to the documentation of this file.
1//===----- X86DynAllocaExpander.cpp - Expand DynAlloca pseudo instruction -===//
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// This file defines a pass that expands DynAlloca pseudo-instructions.
10//
11// It performs a conservative analysis to determine whether each allocation
12// falls within a region of the stack that is safe to use, or whether stack
13// probes must be emitted.
14//
15//===----------------------------------------------------------------------===//
16
17#include "X86.h"
18#include "X86InstrInfo.h"
20#include "X86Subtarget.h"
21#include "llvm/ADT/MapVector.h"
27#include "llvm/CodeGen/Passes.h"
30#include "llvm/IR/Analysis.h"
31#include "llvm/IR/Function.h"
32
33using namespace llvm;
34
35namespace {
36
37class X86DynAllocaExpander {
38public:
39 bool run(MachineFunction &MF);
40
41private:
42 /// Strategies for lowering a DynAlloca.
43 enum Lowering { TouchAndSub, Sub, Probe };
44
45 /// Deterministic-order map from DynAlloca instruction to desired lowering.
46 typedef MapVector<MachineInstr*, Lowering> LoweringMap;
47
48 /// Compute which lowering to use for each DynAlloca instruction.
49 void computeLowerings(MachineFunction &MF, LoweringMap& Lowerings);
50
51 /// Get the appropriate lowering based on current offset and amount.
52 Lowering getLowering(int64_t CurrentOffset, int64_t AllocaAmount);
53
54 /// Lower a DynAlloca instruction.
55 void lower(MachineInstr* MI, Lowering L);
56
57 MachineRegisterInfo *MRI = nullptr;
58 const X86Subtarget *STI = nullptr;
59 const TargetInstrInfo *TII = nullptr;
60 const X86RegisterInfo *TRI = nullptr;
61 Register StackPtr;
62 unsigned SlotSize = 0;
63 int64_t StackProbeSize = 0;
64 bool NoStackArgProbe = false;
65};
66
67class X86DynAllocaExpanderLegacy : public MachineFunctionPass {
68public:
69 X86DynAllocaExpanderLegacy() : MachineFunctionPass(ID) {}
70
71 bool runOnMachineFunction(MachineFunction &MF) override;
72
73 void getAnalysisUsage(AnalysisUsage &AU) const override {
74 AU.addPreserved<MachineRegisterClassInfoWrapperPass>();
76 }
77
78private:
79 StringRef getPassName() const override { return "X86 DynAlloca Expander"; }
80
81public:
82 static char ID;
83};
84
85char X86DynAllocaExpanderLegacy::ID = 0;
86
87} // end anonymous namespace
88
89INITIALIZE_PASS(X86DynAllocaExpanderLegacy, "x86-dyn-alloca-expander",
90 "X86 DynAlloca Expander", false, false)
91
93 return new X86DynAllocaExpanderLegacy();
94}
95
96/// Return the allocation amount for a DynAlloca instruction, or -1 if unknown.
98 assert(MI->getOpcode() == X86::DYN_ALLOCA_32 ||
99 MI->getOpcode() == X86::DYN_ALLOCA_64);
100 assert(MI->getOperand(0).isReg());
101
102 Register AmountReg = MI->getOperand(0).getReg();
103 MachineInstr *Def = MRI->getUniqueVRegDef(AmountReg);
104
105 if (!Def ||
106 (Def->getOpcode() != X86::MOV32ri && Def->getOpcode() != X86::MOV64ri) ||
107 !Def->getOperand(1).isImm())
108 return -1;
109
110 return Def->getOperand(1).getImm();
111}
112
113X86DynAllocaExpander::Lowering
114X86DynAllocaExpander::getLowering(int64_t CurrentOffset,
115 int64_t AllocaAmount) {
116 // For a non-constant amount or a large amount, we have to probe.
117 if (AllocaAmount < 0 || AllocaAmount > StackProbeSize)
118 return Probe;
119
120 // If it fits within the safe region of the stack, just subtract.
121 if (CurrentOffset + AllocaAmount <= StackProbeSize)
122 return Sub;
123
124 // Otherwise, touch the current tip of the stack, then subtract.
125 return TouchAndSub;
126}
127
128static bool isPushPop(const MachineInstr &MI) {
129 switch (MI.getOpcode()) {
130 case X86::PUSH32r:
131 case X86::PUSH32rmm:
132 case X86::PUSH32rmr:
133 case X86::PUSH32i:
134 case X86::PUSH64r:
135 case X86::PUSH64rmm:
136 case X86::PUSH64rmr:
137 case X86::PUSH64i32:
138 case X86::POP32r:
139 case X86::POP64r:
140 return true;
141 default:
142 return false;
143 }
144}
145
146void X86DynAllocaExpander::computeLowerings(MachineFunction &MF,
147 LoweringMap &Lowerings) {
148 // Do a one-pass reverse post-order walk of the CFG to conservatively estimate
149 // the offset between the stack pointer and the lowest touched part of the
150 // stack, and use that to decide how to lower each DynAlloca instruction.
151
152 // Initialize OutOffset[B], the stack offset at exit from B, to something big.
153 DenseMap<MachineBasicBlock *, int64_t> OutOffset;
154 for (MachineBasicBlock &MBB : MF)
155 OutOffset[&MBB] = INT32_MAX;
156
157 // Note: we don't know the offset at the start of the entry block since the
158 // prologue hasn't been inserted yet, and how much that will adjust the stack
159 // pointer depends on register spills, which have not been computed yet.
160
161 // Compute the reverse post-order.
162 ReversePostOrderTraversal<MachineFunction*> RPO(&MF);
163
164 for (MachineBasicBlock *MBB : RPO) {
165 int64_t Offset = -1;
166 for (MachineBasicBlock *Pred : MBB->predecessors())
167 Offset = std::max(Offset, OutOffset[Pred]);
168 if (Offset == -1) Offset = INT32_MAX;
169
170 for (MachineInstr &MI : *MBB) {
171 if (MI.getOpcode() == X86::DYN_ALLOCA_32 ||
172 MI.getOpcode() == X86::DYN_ALLOCA_64) {
173 // A DynAlloca moves StackPtr, and potentially touches it.
174 int64_t Amount = getDynAllocaAmount(&MI, MRI);
175 Lowering L = getLowering(Offset, Amount);
176 Lowerings[&MI] = L;
177 switch (L) {
178 case Sub:
179 Offset += Amount;
180 break;
181 case TouchAndSub:
182 Offset = Amount;
183 break;
184 case Probe:
185 Offset = 0;
186 break;
187 }
188 } else if (MI.isCall() || isPushPop(MI)) {
189 // Calls, pushes and pops touch the tip of the stack.
190 Offset = 0;
191 } else if (MI.getOpcode() == X86::ADJCALLSTACKUP32 ||
192 MI.getOpcode() == X86::ADJCALLSTACKUP64) {
193 Offset -= MI.getOperand(0).getImm();
194 } else if (MI.getOpcode() == X86::ADJCALLSTACKDOWN32 ||
195 MI.getOpcode() == X86::ADJCALLSTACKDOWN64) {
196 Offset += MI.getOperand(0).getImm();
197 } else if (MI.modifiesRegister(StackPtr, TRI)) {
198 // Any other modification of SP means we've lost track of it.
199 Offset = INT32_MAX;
200 }
201 }
202
203 OutOffset[MBB] = Offset;
204 }
205}
206
207static unsigned getSubOpcode(bool Is64Bit) {
208 if (Is64Bit)
209 return X86::SUB64ri32;
210 return X86::SUB32ri;
211}
212
213void X86DynAllocaExpander::lower(MachineInstr *MI, Lowering L) {
214 const DebugLoc &DL = MI->getDebugLoc();
215 MachineBasicBlock *MBB = MI->getParent();
217
218 int64_t Amount = getDynAllocaAmount(MI, MRI);
219 if (Amount == 0) {
220 MI->eraseFromParent();
221 return;
222 }
223
224 // These two variables differ on x32, which is a 64-bit target with a
225 // 32-bit alloca.
226 bool Is64Bit = STI->is64Bit();
227 bool Is64BitAlloca = MI->getOpcode() == X86::DYN_ALLOCA_64;
228 assert(SlotSize == 4 || SlotSize == 8);
229
230 std::optional<MachineFunction::DebugInstrOperandPair> InstrNum;
231 if (unsigned Num = MI->peekDebugInstrNum()) {
232 // Operand 2 of DYN_ALLOCAs contains the stack def.
233 InstrNum = {Num, 2};
234 }
235
236 switch (L) {
237 case TouchAndSub: {
238 assert(Amount >= SlotSize);
239
240 // Use a push to touch the top of the stack.
241 unsigned RegA = Is64Bit ? X86::RAX : X86::EAX;
242 BuildMI(*MBB, I, DL, TII->get(Is64Bit ? X86::PUSH64r : X86::PUSH32r))
243 .addReg(RegA, RegState::Undef);
244 Amount -= SlotSize;
245 if (!Amount)
246 break;
247
248 // Fall through to make any remaining adjustment.
249 [[fallthrough]];
250 }
251 case Sub:
252 assert(Amount > 0);
253 if (Amount == SlotSize) {
254 // Use push to save size.
255 unsigned RegA = Is64Bit ? X86::RAX : X86::EAX;
256 BuildMI(*MBB, I, DL, TII->get(Is64Bit ? X86::PUSH64r : X86::PUSH32r))
257 .addReg(RegA, RegState::Undef);
258 } else {
259 // Sub.
260 BuildMI(*MBB, I, DL, TII->get(getSubOpcode(Is64BitAlloca)), StackPtr)
261 .addReg(StackPtr)
262 .addImm(Amount);
263 }
264 break;
265 case Probe:
266 if (!NoStackArgProbe) {
267 // The probe lowering expects the amount in RAX/EAX.
268 unsigned RegA = Is64BitAlloca ? X86::RAX : X86::EAX;
269 BuildMI(*MBB, MI, DL, TII->get(TargetOpcode::COPY), RegA)
270 .addReg(MI->getOperand(0).getReg());
271
272 // Do the probe.
274 /*InProlog=*/false, InstrNum);
275 } else {
276 // Sub
277 BuildMI(*MBB, I, DL,
278 TII->get(Is64BitAlloca ? X86::SUB64rr : X86::SUB32rr), StackPtr)
279 .addReg(StackPtr)
280 .addReg(MI->getOperand(0).getReg());
281 }
282 break;
283 }
284
285 Register AmountReg = MI->getOperand(0).getReg();
286 MI->eraseFromParent();
287
288 // Delete the definition of AmountReg.
289 if (MRI->use_empty(AmountReg))
290 if (MachineInstr *AmountDef = MRI->getUniqueVRegDef(AmountReg))
291 AmountDef->eraseFromParent();
292}
293
294bool X86DynAllocaExpander::run(MachineFunction &MF) {
295 if (!MF.getInfo<X86MachineFunctionInfo>()->hasDynAlloca())
296 return false;
297
298 MRI = &MF.getRegInfo();
299 STI = &MF.getSubtarget<X86Subtarget>();
300 TII = STI->getInstrInfo();
301 TRI = STI->getRegisterInfo();
302 StackPtr = TRI->getStackRegister();
303 SlotSize = TRI->getSlotSize();
304 StackProbeSize = STI->getTargetLowering()->getStackProbeSize(MF);
305 NoStackArgProbe = MF.getFunction().hasFnAttribute("no-stack-arg-probe");
306 if (NoStackArgProbe)
307 StackProbeSize = INT64_MAX;
308
309 LoweringMap Lowerings;
310 computeLowerings(MF, Lowerings);
311 for (auto &P : Lowerings)
312 lower(P.first, P.second);
313
314 return true;
315}
316
317bool X86DynAllocaExpanderLegacy::runOnMachineFunction(MachineFunction &MF) {
318 return X86DynAllocaExpander().run(MF);
319}
320
321PreservedAnalyses
324 bool Changed = X86DynAllocaExpander().run(MF);
325 if (!Changed)
326 return PreservedAnalyses::all();
327
329}
assert(UImm &&(UImm !=~static_cast< T >(0)) &&"Invalid immediate!")
MachineBasicBlock & MBB
MachineBasicBlock MachineBasicBlock::iterator DebugLoc DL
const HexagonInstrInfo * TII
IRTranslator LLVM IR MI
#define I(x, y, z)
Definition MD5.cpp:57
Register const TargetRegisterInfo * TRI
This file implements a map that provides insertion order iteration.
Promote Memory to Register
Definition Mem2Reg.cpp:110
#define P(N)
#define INITIALIZE_PASS(passName, arg, name, cfg, analysis)
Definition PassSupport.h:56
This file builds on the ADT/GraphTraits.h file to build a generic graph post order iterator.
pre isel intrinsic Pre ISel Intrinsic Lowering
static bool isPushPop(const MachineInstr &MI)
static int64_t getDynAllocaAmount(MachineInstr *MI, MachineRegisterInfo *MRI)
Return the allocation amount for a DynAlloca instruction, or -1 if unknown.
static unsigned getSubOpcode(bool Is64Bit)
AnalysisUsage & addPreserved()
Add the specified Pass class to the set of analyses preserved by this pass.
Represents analyses that only rely on functions' control flow.
Definition Analysis.h:73
FunctionPass class - This class is used to implement most global optimizations.
Definition Pass.h:314
bool hasFnAttribute(Attribute::AttrKind Kind) const
Return true if the function has the attribute.
Definition Function.cpp:723
const MachineFunction * getParent() const
Return the MachineFunction containing this basic block.
iterator_range< pred_iterator > predecessors()
MachineInstrBundleIterator< MachineInstr > iterator
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.
const TargetSubtargetInfo & getSubtarget() const
getSubtarget - Return the subtarget for which this machine code is being compiled.
MachineRegisterInfo & getRegInfo()
getRegInfo - Return information about the registers currently in use.
Function & getFunction()
Return the LLVM function that this machine code represents.
Ty * getInfo()
getInfo - Keep track of various per-function pieces of information for backends that would like to do...
const MachineInstrBuilder & addReg(Register RegNo, RegState Flags={}, unsigned SubReg=0) const
Add a new virtual register operand.
const MachineInstrBuilder & addImm(int64_t Val) const
Add a new immediate operand.
Representation of each machine instruction.
MachineRegisterInfo - Keep track of information for virtual and physical registers,...
bool use_empty(Register RegNo) const
use_empty - Return true if there are no instructions using the specified register.
LLVM_ABI MachineInstr * getUniqueVRegDef(Register Reg) const
getUniqueVRegDef - Return the unique machine instr that defines the specified virtual register or nul...
static PreservedAnalyses all()
Construct a special preserved set that preserves all passes.
Definition Analysis.h:118
PreservedAnalyses & preserveSet()
Mark an analysis set as preserved.
Definition Analysis.h:151
Wrapper class representing virtual and physical registers.
Definition Register.h:20
PreservedAnalyses run(MachineFunction &MF, MachineFunctionAnalysisManager &MFAM)
void emitStackProbe(MachineFunction &MF, MachineBasicBlock &MBB, MachineBasicBlock::iterator MBBI, const DebugLoc &DL, bool InProlog, std::optional< MachineFunction::DebugInstrOperandPair > InstrNum=std::nullopt) const
Emit target stack probe code.
const X86TargetLowering * getTargetLowering() const override
const X86InstrInfo * getInstrInfo() const override
const X86RegisterInfo * getRegisterInfo() const override
const X86FrameLowering * getFrameLowering() const override
unsigned getStackProbeSize(const MachineFunction &MF) const
Changed
#define INT64_MAX
Definition DataTypes.h:71
Pass manager infrastructure for declaring and invalidating analyses.
DXILDebugInfoMap run(Module &M)
This is an optimization pass for GlobalISel generic memory operations.
@ Offset
Definition DWP.cpp:578
MachineInstrBuilder BuildMI(MachineFunction &MF, const MIMetadata &MIMD, const MCInstrDesc &MCID)
Builder interface. Specify how to create the initial instruction itself.
FunctionPass * createX86DynAllocaExpanderLegacyPass()
AnalysisManager< MachineFunction > MachineFunctionAnalysisManager
LLVM_ABI PreservedAnalyses getMachineFunctionPassPreservedAnalyses()
Returns the minimum set of Analyses that all machine function passes must preserve.
@ Sub
Subtraction of integers.