1 //===-- PrologEpilogInserter.cpp - Insert Prolog/Epilog code in function --===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This pass is responsible for finalizing the functions frame layout, saving
11 // callee saved registers, and for emitting prolog & epilog code for the
14 // This pass must be run after register allocation. After this pass is
15 // executed, it is illegal to construct MO_FrameIndex operands.
17 // This pass provides an optional shrink wrapping variant of prolog/epilog
18 // insertion, enabled via --shrink-wrap. See ShrinkWrapping.cpp.
20 //===----------------------------------------------------------------------===//
22 #define DEBUG_TYPE "pei"
23 #include "PrologEpilogInserter.h"
24 #include "llvm/CodeGen/MachineDominators.h"
25 #include "llvm/CodeGen/MachineLoopInfo.h"
26 #include "llvm/CodeGen/MachineInstr.h"
27 #include "llvm/CodeGen/MachineFrameInfo.h"
28 #include "llvm/CodeGen/MachineRegisterInfo.h"
29 #include "llvm/CodeGen/RegisterScavenging.h"
30 #include "llvm/Target/TargetMachine.h"
31 #include "llvm/Target/TargetRegisterInfo.h"
32 #include "llvm/Target/TargetFrameInfo.h"
33 #include "llvm/Target/TargetInstrInfo.h"
34 #include "llvm/Support/CommandLine.h"
35 #include "llvm/Support/Compiler.h"
36 #include "llvm/Support/Debug.h"
37 #include "llvm/ADT/IndexedMap.h"
38 #include "llvm/ADT/SmallSet.h"
39 #include "llvm/ADT/STLExtras.h"
44 // FIXME: For testing purposes only. Remove once the pre-allocation pass
46 extern cl::opt<bool> EnableLocalStackAlloc;
50 INITIALIZE_PASS(PEI, "prologepilog",
51 "Prologue/Epilogue Insertion", false, false);
53 /// createPrologEpilogCodeInserter - This function returns a pass that inserts
54 /// prolog and epilog code, and eliminates abstract frame references.
56 FunctionPass *llvm::createPrologEpilogCodeInserter() { return new PEI(); }
58 /// runOnMachineFunction - Insert prolog/epilog code and replace abstract
59 /// frame indexes with appropriate references.
61 bool PEI::runOnMachineFunction(MachineFunction &Fn) {
62 const Function* F = Fn.getFunction();
63 const TargetRegisterInfo *TRI = Fn.getTarget().getRegisterInfo();
64 RS = TRI->requiresRegisterScavenging(Fn) ? new RegScavenger() : NULL;
65 FrameIndexVirtualScavenging = TRI->requiresFrameIndexScavenging(Fn);
66 FrameConstantRegMap.clear();
68 // Calculate the MaxCallFrameSize and AdjustsStack variables for the
69 // function's frame information. Also eliminates call frame pseudo
71 calculateCallsInformation(Fn);
73 // Allow the target machine to make some adjustments to the function
74 // e.g. UsedPhysRegs before calculateCalleeSavedRegisters.
75 TRI->processFunctionBeforeCalleeSavedScan(Fn, RS);
77 // Scan the function for modified callee saved registers and insert spill code
78 // for any callee saved registers that are modified.
79 calculateCalleeSavedRegisters(Fn);
81 // Determine placement of CSR spill/restore code:
82 // - With shrink wrapping, place spills and restores to tightly
83 // enclose regions in the Machine CFG of the function where
85 // - Without shink wrapping (default), place all spills in the
86 // entry block, all restores in return blocks.
87 placeCSRSpillsAndRestores(Fn);
89 // Add the code to save and restore the callee saved registers
90 if (!F->hasFnAttr(Attribute::Naked))
91 insertCSRSpillsAndRestores(Fn);
93 // Allow the target machine to make final modifications to the function
94 // before the frame layout is finalized.
95 TRI->processFunctionBeforeFrameFinalized(Fn);
97 // Calculate actual frame offsets for all abstract stack objects...
98 calculateFrameObjectOffsets(Fn);
100 // Add prolog and epilog code to the function. This function is required
101 // to align the stack frame as necessary for any stack variables or
102 // called functions. Because of this, calculateCalleeSavedRegisters()
103 // must be called before this function in order to set the AdjustsStack
104 // and MaxCallFrameSize variables.
105 if (!F->hasFnAttr(Attribute::Naked))
106 insertPrologEpilogCode(Fn);
108 // Replace all MO_FrameIndex operands with physical register references
109 // and actual offsets.
111 replaceFrameIndices(Fn);
113 // If register scavenging is needed, as we've enabled doing it as a
114 // post-pass, scavenge the virtual registers that frame index elimiation
116 if (TRI->requiresRegisterScavenging(Fn) && FrameIndexVirtualScavenging)
117 scavengeFrameVirtualRegs(Fn);
125 void PEI::getAnalysisUsage(AnalysisUsage &AU) const {
126 AU.setPreservesCFG();
127 if (ShrinkWrapping || ShrinkWrapFunc != "") {
128 AU.addRequired<MachineLoopInfo>();
129 AU.addRequired<MachineDominatorTree>();
131 AU.addPreserved<MachineLoopInfo>();
132 AU.addPreserved<MachineDominatorTree>();
133 MachineFunctionPass::getAnalysisUsage(AU);
137 /// calculateCallsInformation - Calculate the MaxCallFrameSize and AdjustsStack
138 /// variables for the function's frame information and eliminate call frame
139 /// pseudo instructions.
140 void PEI::calculateCallsInformation(MachineFunction &Fn) {
141 const TargetRegisterInfo *RegInfo = Fn.getTarget().getRegisterInfo();
142 MachineFrameInfo *MFI = Fn.getFrameInfo();
144 unsigned MaxCallFrameSize = 0;
145 bool AdjustsStack = MFI->adjustsStack();
147 // Get the function call frame set-up and tear-down instruction opcode
148 int FrameSetupOpcode = RegInfo->getCallFrameSetupOpcode();
149 int FrameDestroyOpcode = RegInfo->getCallFrameDestroyOpcode();
151 // Early exit for targets which have no call frame setup/destroy pseudo
153 if (FrameSetupOpcode == -1 && FrameDestroyOpcode == -1)
156 std::vector<MachineBasicBlock::iterator> FrameSDOps;
157 for (MachineFunction::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB)
158 for (MachineBasicBlock::iterator I = BB->begin(); I != BB->end(); ++I)
159 if (I->getOpcode() == FrameSetupOpcode ||
160 I->getOpcode() == FrameDestroyOpcode) {
161 assert(I->getNumOperands() >= 1 && "Call Frame Setup/Destroy Pseudo"
162 " instructions should have a single immediate argument!");
163 unsigned Size = I->getOperand(0).getImm();
164 if (Size > MaxCallFrameSize) MaxCallFrameSize = Size;
166 FrameSDOps.push_back(I);
167 } else if (I->isInlineAsm()) {
168 // Some inline asm's need a stack frame, as indicated by operand 1.
169 if (I->getOperand(1).getImm())
173 MFI->setAdjustsStack(AdjustsStack);
174 MFI->setMaxCallFrameSize(MaxCallFrameSize);
176 for (std::vector<MachineBasicBlock::iterator>::iterator
177 i = FrameSDOps.begin(), e = FrameSDOps.end(); i != e; ++i) {
178 MachineBasicBlock::iterator I = *i;
180 // If call frames are not being included as part of the stack frame, and
181 // the target doesn't indicate otherwise, remove the call frame pseudos
182 // here. The sub/add sp instruction pairs are still inserted, but we don't
183 // need to track the SP adjustment for frame index elimination.
184 if (RegInfo->canSimplifyCallFramePseudos(Fn))
185 RegInfo->eliminateCallFramePseudoInstr(Fn, *I->getParent(), I);
190 /// calculateCalleeSavedRegisters - Scan the function for modified callee saved
192 void PEI::calculateCalleeSavedRegisters(MachineFunction &Fn) {
193 const TargetRegisterInfo *RegInfo = Fn.getTarget().getRegisterInfo();
194 const TargetFrameInfo *TFI = Fn.getTarget().getFrameInfo();
195 MachineFrameInfo *MFI = Fn.getFrameInfo();
197 // Get the callee saved register list...
198 const unsigned *CSRegs = RegInfo->getCalleeSavedRegs(&Fn);
200 // These are used to keep track the callee-save area. Initialize them.
201 MinCSFrameIndex = INT_MAX;
204 // Early exit for targets which have no callee saved registers.
205 if (CSRegs == 0 || CSRegs[0] == 0)
208 // In Naked functions we aren't going to save any registers.
209 if (Fn.getFunction()->hasFnAttr(Attribute::Naked))
212 std::vector<CalleeSavedInfo> CSI;
213 for (unsigned i = 0; CSRegs[i]; ++i) {
214 unsigned Reg = CSRegs[i];
215 if (Fn.getRegInfo().isPhysRegUsed(Reg)) {
216 // If the reg is modified, save it!
217 CSI.push_back(CalleeSavedInfo(Reg));
219 for (const unsigned *AliasSet = RegInfo->getAliasSet(Reg);
220 *AliasSet; ++AliasSet) { // Check alias registers too.
221 if (Fn.getRegInfo().isPhysRegUsed(*AliasSet)) {
222 CSI.push_back(CalleeSavedInfo(Reg));
230 return; // Early exit if no callee saved registers are modified!
232 unsigned NumFixedSpillSlots;
233 const TargetFrameInfo::SpillSlot *FixedSpillSlots =
234 TFI->getCalleeSavedSpillSlots(NumFixedSpillSlots);
236 // Now that we know which registers need to be saved and restored, allocate
237 // stack slots for them.
238 for (std::vector<CalleeSavedInfo>::iterator
239 I = CSI.begin(), E = CSI.end(); I != E; ++I) {
240 unsigned Reg = I->getReg();
241 const TargetRegisterClass *RC = RegInfo->getMinimalPhysRegClass(Reg);
244 if (RegInfo->hasReservedSpillSlot(Fn, Reg, FrameIdx)) {
245 I->setFrameIdx(FrameIdx);
249 // Check to see if this physreg must be spilled to a particular stack slot
251 const TargetFrameInfo::SpillSlot *FixedSlot = FixedSpillSlots;
252 while (FixedSlot != FixedSpillSlots+NumFixedSpillSlots &&
253 FixedSlot->Reg != Reg)
256 if (FixedSlot == FixedSpillSlots + NumFixedSpillSlots) {
257 // Nope, just spill it anywhere convenient.
258 unsigned Align = RC->getAlignment();
259 unsigned StackAlign = TFI->getStackAlignment();
261 // We may not be able to satisfy the desired alignment specification of
262 // the TargetRegisterClass if the stack alignment is smaller. Use the
264 Align = std::min(Align, StackAlign);
265 FrameIdx = MFI->CreateStackObject(RC->getSize(), Align, true);
266 if ((unsigned)FrameIdx < MinCSFrameIndex) MinCSFrameIndex = FrameIdx;
267 if ((unsigned)FrameIdx > MaxCSFrameIndex) MaxCSFrameIndex = FrameIdx;
269 // Spill it to the stack where we must.
270 FrameIdx = MFI->CreateFixedObject(RC->getSize(), FixedSlot->Offset, true);
273 I->setFrameIdx(FrameIdx);
276 MFI->setCalleeSavedInfo(CSI);
279 /// insertCSRSpillsAndRestores - Insert spill and restore code for
280 /// callee saved registers used in the function, handling shrink wrapping.
282 void PEI::insertCSRSpillsAndRestores(MachineFunction &Fn) {
283 // Get callee saved register information.
284 MachineFrameInfo *MFI = Fn.getFrameInfo();
285 const std::vector<CalleeSavedInfo> &CSI = MFI->getCalleeSavedInfo();
287 MFI->setCalleeSavedInfoValid(true);
289 // Early exit if no callee saved registers are modified!
293 const TargetInstrInfo &TII = *Fn.getTarget().getInstrInfo();
294 const TargetRegisterInfo *TRI = Fn.getTarget().getRegisterInfo();
295 MachineBasicBlock::iterator I;
297 if (! ShrinkWrapThisFunction) {
298 // Spill using target interface.
299 I = EntryBlock->begin();
300 if (!TII.spillCalleeSavedRegisters(*EntryBlock, I, CSI, TRI)) {
301 for (unsigned i = 0, e = CSI.size(); i != e; ++i) {
302 // Add the callee-saved register as live-in.
303 // It's killed at the spill.
304 EntryBlock->addLiveIn(CSI[i].getReg());
306 // Insert the spill to the stack frame.
307 unsigned Reg = CSI[i].getReg();
308 const TargetRegisterClass *RC = TRI->getMinimalPhysRegClass(Reg);
309 TII.storeRegToStackSlot(*EntryBlock, I, Reg, true,
310 CSI[i].getFrameIdx(), RC, TRI);
314 // Restore using target interface.
315 for (unsigned ri = 0, re = ReturnBlocks.size(); ri != re; ++ri) {
316 MachineBasicBlock* MBB = ReturnBlocks[ri];
319 // Skip over all terminator instructions, which are part of the return
321 MachineBasicBlock::iterator I2 = I;
322 while (I2 != MBB->begin() && (--I2)->getDesc().isTerminator())
325 bool AtStart = I == MBB->begin();
326 MachineBasicBlock::iterator BeforeI = I;
330 // Restore all registers immediately before the return and any
331 // terminators that preceed it.
332 if (!TII.restoreCalleeSavedRegisters(*MBB, I, CSI, TRI)) {
333 for (unsigned i = 0, e = CSI.size(); i != e; ++i) {
334 unsigned Reg = CSI[i].getReg();
335 const TargetRegisterClass *RC = TRI->getMinimalPhysRegClass(Reg);
336 TII.loadRegFromStackSlot(*MBB, I, Reg,
337 CSI[i].getFrameIdx(),
339 assert(I != MBB->begin() &&
340 "loadRegFromStackSlot didn't insert any code!");
341 // Insert in reverse order. loadRegFromStackSlot can insert
342 // multiple instructions.
356 std::vector<CalleeSavedInfo> blockCSI;
357 for (CSRegBlockMap::iterator BI = CSRSave.begin(),
358 BE = CSRSave.end(); BI != BE; ++BI) {
359 MachineBasicBlock* MBB = BI->first;
360 CSRegSet save = BI->second;
366 for (CSRegSet::iterator RI = save.begin(),
367 RE = save.end(); RI != RE; ++RI) {
368 blockCSI.push_back(CSI[*RI]);
370 assert(blockCSI.size() > 0 &&
371 "Could not collect callee saved register info");
375 // When shrink wrapping, use stack slot stores/loads.
376 for (unsigned i = 0, e = blockCSI.size(); i != e; ++i) {
377 // Add the callee-saved register as live-in.
378 // It's killed at the spill.
379 MBB->addLiveIn(blockCSI[i].getReg());
381 // Insert the spill to the stack frame.
382 unsigned Reg = blockCSI[i].getReg();
383 const TargetRegisterClass *RC = TRI->getMinimalPhysRegClass(Reg);
384 TII.storeRegToStackSlot(*MBB, I, Reg,
386 blockCSI[i].getFrameIdx(),
391 for (CSRegBlockMap::iterator BI = CSRRestore.begin(),
392 BE = CSRRestore.end(); BI != BE; ++BI) {
393 MachineBasicBlock* MBB = BI->first;
394 CSRegSet restore = BI->second;
400 for (CSRegSet::iterator RI = restore.begin(),
401 RE = restore.end(); RI != RE; ++RI) {
402 blockCSI.push_back(CSI[*RI]);
404 assert(blockCSI.size() > 0 &&
405 "Could not find callee saved register info");
407 // If MBB is empty and needs restores, insert at the _beginning_.
414 // Skip over all terminator instructions, which are part of the
416 if (! I->getDesc().isTerminator()) {
419 MachineBasicBlock::iterator I2 = I;
420 while (I2 != MBB->begin() && (--I2)->getDesc().isTerminator())
425 bool AtStart = I == MBB->begin();
426 MachineBasicBlock::iterator BeforeI = I;
430 // Restore all registers immediately before the return and any
431 // terminators that preceed it.
432 for (unsigned i = 0, e = blockCSI.size(); i != e; ++i) {
433 unsigned Reg = blockCSI[i].getReg();
434 const TargetRegisterClass *RC = TRI->getMinimalPhysRegClass(Reg);
435 TII.loadRegFromStackSlot(*MBB, I, Reg,
436 blockCSI[i].getFrameIdx(),
438 assert(I != MBB->begin() &&
439 "loadRegFromStackSlot didn't insert any code!");
440 // Insert in reverse order. loadRegFromStackSlot can insert
441 // multiple instructions.
452 /// AdjustStackOffset - Helper function used to adjust the stack frame offset.
454 AdjustStackOffset(MachineFrameInfo *MFI, int FrameIdx,
455 bool StackGrowsDown, int64_t &Offset,
456 unsigned &MaxAlign) {
457 // If the stack grows down, add the object size to find the lowest address.
459 Offset += MFI->getObjectSize(FrameIdx);
461 unsigned Align = MFI->getObjectAlignment(FrameIdx);
463 // If the alignment of this object is greater than that of the stack, then
464 // increase the stack alignment to match.
465 MaxAlign = std::max(MaxAlign, Align);
467 // Adjust to alignment boundary.
468 Offset = (Offset + Align - 1) / Align * Align;
470 if (StackGrowsDown) {
471 DEBUG(dbgs() << "alloc FI(" << FrameIdx << ") at SP[" << -Offset << "]\n");
472 MFI->setObjectOffset(FrameIdx, -Offset); // Set the computed offset
474 DEBUG(dbgs() << "alloc FI(" << FrameIdx << ") at SP[" << Offset << "]\n");
475 MFI->setObjectOffset(FrameIdx, Offset);
476 Offset += MFI->getObjectSize(FrameIdx);
480 /// calculateFrameObjectOffsets - Calculate actual frame offsets for all of the
481 /// abstract stack objects.
483 void PEI::calculateFrameObjectOffsets(MachineFunction &Fn) {
484 const TargetFrameInfo &TFI = *Fn.getTarget().getFrameInfo();
486 bool StackGrowsDown =
487 TFI.getStackGrowthDirection() == TargetFrameInfo::StackGrowsDown;
489 // Loop over all of the stack objects, assigning sequential addresses...
490 MachineFrameInfo *MFI = Fn.getFrameInfo();
492 // Start at the beginning of the local area.
493 // The Offset is the distance from the stack top in the direction
494 // of stack growth -- so it's always nonnegative.
495 int LocalAreaOffset = TFI.getOffsetOfLocalArea();
497 LocalAreaOffset = -LocalAreaOffset;
498 assert(LocalAreaOffset >= 0
499 && "Local area offset should be in direction of stack growth");
500 int64_t Offset = LocalAreaOffset;
502 // If there are fixed sized objects that are preallocated in the local area,
503 // non-fixed objects can't be allocated right at the start of local area.
504 // We currently don't support filling in holes in between fixed sized
505 // objects, so we adjust 'Offset' to point to the end of last fixed sized
506 // preallocated object.
507 for (int i = MFI->getObjectIndexBegin(); i != 0; ++i) {
509 if (StackGrowsDown) {
510 // The maximum distance from the stack pointer is at lower address of
511 // the object -- which is given by offset. For down growing stack
512 // the offset is negative, so we negate the offset to get the distance.
513 FixedOff = -MFI->getObjectOffset(i);
515 // The maximum distance from the start pointer is at the upper
516 // address of the object.
517 FixedOff = MFI->getObjectOffset(i) + MFI->getObjectSize(i);
519 if (FixedOff > Offset) Offset = FixedOff;
522 // First assign frame offsets to stack objects that are used to spill
523 // callee saved registers.
524 if (StackGrowsDown) {
525 for (unsigned i = MinCSFrameIndex; i <= MaxCSFrameIndex; ++i) {
526 // If the stack grows down, we need to add the size to find the lowest
527 // address of the object.
528 Offset += MFI->getObjectSize(i);
530 unsigned Align = MFI->getObjectAlignment(i);
531 // Adjust to alignment boundary
532 Offset = (Offset+Align-1)/Align*Align;
534 MFI->setObjectOffset(i, -Offset); // Set the computed offset
537 int MaxCSFI = MaxCSFrameIndex, MinCSFI = MinCSFrameIndex;
538 for (int i = MaxCSFI; i >= MinCSFI ; --i) {
539 unsigned Align = MFI->getObjectAlignment(i);
540 // Adjust to alignment boundary
541 Offset = (Offset+Align-1)/Align*Align;
543 MFI->setObjectOffset(i, Offset);
544 Offset += MFI->getObjectSize(i);
548 unsigned MaxAlign = MFI->getMaxAlignment();
550 // Make sure the special register scavenging spill slot is closest to the
551 // frame pointer if a frame pointer is required.
552 const TargetRegisterInfo *RegInfo = Fn.getTarget().getRegisterInfo();
553 if (RS && RegInfo->hasFP(Fn) && !RegInfo->needsStackRealignment(Fn)) {
554 int SFI = RS->getScavengingFrameIndex();
556 AdjustStackOffset(MFI, SFI, StackGrowsDown, Offset, MaxAlign);
559 // Store the offset of the start of the local allocation block. This
560 // will be used later when resolving frame base virtual register pseudos.
561 MFI->setLocalFrameBaseOffset(Offset);
562 if (EnableLocalStackAlloc) {
563 // Allocate the local block
564 Offset += MFI->getLocalFrameSize();
566 // Resolve offsets for objects in the local block.
567 for (unsigned i = 0, e = MFI->getLocalFrameObjectCount(); i != e; ++i) {
568 std::pair<int, int64_t> Entry = MFI->getLocalFrameObjectMap(i);
569 int64_t FIOffset = MFI->getLocalFrameBaseOffset() + Entry.second;
571 AdjustStackOffset(MFI, Entry.first, StackGrowsDown, FIOffset, MaxAlign);
574 // FIXME: Allocate locals. Once the block allocation pass is turned on,
575 // this simplifies to just the second loop, since all of the large objects
576 // will have already been handled. The second loop can also simplify a
577 // bit, as the conditionals inside aren't all necessary.
579 // Make sure that the stack protector comes before the local variables on the
581 SmallSet<int, 16> LargeStackObjs;
582 if (MFI->getStackProtectorIndex() >= 0) {
583 AdjustStackOffset(MFI, MFI->getStackProtectorIndex(), StackGrowsDown,
586 // Assign large stack objects first.
587 for (unsigned i = 0, e = MFI->getObjectIndexEnd(); i != e; ++i) {
588 if (MFI->isObjectPreAllocated(i))
590 if (i >= MinCSFrameIndex && i <= MaxCSFrameIndex)
592 if (RS && (int)i == RS->getScavengingFrameIndex())
594 if (MFI->isDeadObjectIndex(i))
596 if (MFI->getStackProtectorIndex() == (int)i)
598 if (!MFI->MayNeedStackProtector(i))
601 AdjustStackOffset(MFI, i, StackGrowsDown, Offset, MaxAlign);
602 LargeStackObjs.insert(i);
606 // Then assign frame offsets to stack objects that are not used to spill
607 // callee saved registers.
608 for (unsigned i = 0, e = MFI->getObjectIndexEnd(); i != e; ++i) {
609 if (MFI->isObjectPreAllocated(i))
611 if (i >= MinCSFrameIndex && i <= MaxCSFrameIndex)
613 if (RS && (int)i == RS->getScavengingFrameIndex())
615 if (MFI->isDeadObjectIndex(i))
617 if (MFI->getStackProtectorIndex() == (int)i)
619 if (LargeStackObjs.count(i))
622 AdjustStackOffset(MFI, i, StackGrowsDown, Offset, MaxAlign);
625 // Make sure the special register scavenging spill slot is closest to the
627 if (RS && (!RegInfo->hasFP(Fn) || RegInfo->needsStackRealignment(Fn))) {
628 int SFI = RS->getScavengingFrameIndex();
630 AdjustStackOffset(MFI, SFI, StackGrowsDown, Offset, MaxAlign);
633 if (!RegInfo->targetHandlesStackFrameRounding()) {
634 // If we have reserved argument space for call sites in the function
635 // immediately on entry to the current function, count it as part of the
636 // overall stack size.
637 if (MFI->adjustsStack() && RegInfo->hasReservedCallFrame(Fn))
638 Offset += MFI->getMaxCallFrameSize();
640 // Round up the size to a multiple of the alignment. If the function has
641 // any calls or alloca's, align to the target's StackAlignment value to
642 // ensure that the callee's frame or the alloca data is suitably aligned;
643 // otherwise, for leaf functions, align to the TransientStackAlignment
646 if (MFI->adjustsStack() || MFI->hasVarSizedObjects() ||
647 (RegInfo->needsStackRealignment(Fn) && MFI->getObjectIndexEnd() != 0))
648 StackAlign = TFI.getStackAlignment();
650 StackAlign = TFI.getTransientStackAlignment();
652 // If the frame pointer is eliminated, all frame offsets will be relative to
653 // SP not FP. Align to MaxAlign so this works.
654 StackAlign = std::max(StackAlign, MaxAlign);
655 unsigned AlignMask = StackAlign - 1;
656 Offset = (Offset + AlignMask) & ~uint64_t(AlignMask);
659 // Update frame info to pretend that this is part of the stack...
660 MFI->setStackSize(Offset - LocalAreaOffset);
663 /// insertPrologEpilogCode - Scan the function for modified callee saved
664 /// registers, insert spill code for these callee saved registers, then add
665 /// prolog and epilog code to the function.
667 void PEI::insertPrologEpilogCode(MachineFunction &Fn) {
668 const TargetRegisterInfo *TRI = Fn.getTarget().getRegisterInfo();
670 // Add prologue to the function...
671 TRI->emitPrologue(Fn);
673 // Add epilogue to restore the callee-save registers in each exiting block
674 for (MachineFunction::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) {
675 // If last instruction is a return instruction, add an epilogue
676 if (!I->empty() && I->back().getDesc().isReturn())
677 TRI->emitEpilogue(Fn, *I);
681 /// replaceFrameIndices - Replace all MO_FrameIndex operands with physical
682 /// register references and actual offsets.
684 void PEI::replaceFrameIndices(MachineFunction &Fn) {
685 if (!Fn.getFrameInfo()->hasStackObjects()) return; // Nothing to do?
687 const TargetMachine &TM = Fn.getTarget();
688 assert(TM.getRegisterInfo() && "TM::getRegisterInfo() must be implemented!");
689 const TargetRegisterInfo &TRI = *TM.getRegisterInfo();
690 const TargetFrameInfo *TFI = TM.getFrameInfo();
691 bool StackGrowsDown =
692 TFI->getStackGrowthDirection() == TargetFrameInfo::StackGrowsDown;
693 int FrameSetupOpcode = TRI.getCallFrameSetupOpcode();
694 int FrameDestroyOpcode = TRI.getCallFrameDestroyOpcode();
696 for (MachineFunction::iterator BB = Fn.begin(),
697 E = Fn.end(); BB != E; ++BB) {
699 int SPAdjCount = 0; // frame setup / destroy count.
701 int SPAdj = 0; // SP offset due to call frame setup / destroy.
702 if (RS && !FrameIndexVirtualScavenging) RS->enterBasicBlock(BB);
704 for (MachineBasicBlock::iterator I = BB->begin(); I != BB->end(); ) {
706 if (I->getOpcode() == FrameSetupOpcode ||
707 I->getOpcode() == FrameDestroyOpcode) {
709 // Track whether we see even pairs of them
710 SPAdjCount += I->getOpcode() == FrameSetupOpcode ? 1 : -1;
712 // Remember how much SP has been adjusted to create the call
714 int Size = I->getOperand(0).getImm();
716 if ((!StackGrowsDown && I->getOpcode() == FrameSetupOpcode) ||
717 (StackGrowsDown && I->getOpcode() == FrameDestroyOpcode))
722 MachineBasicBlock::iterator PrevI = BB->end();
723 if (I != BB->begin()) PrevI = prior(I);
724 TRI.eliminateCallFramePseudoInstr(Fn, *BB, I);
726 // Visit the instructions created by eliminateCallFramePseudoInstr().
727 if (PrevI == BB->end())
728 I = BB->begin(); // The replaced instr was the first in the block.
730 I = llvm::next(PrevI);
734 MachineInstr *MI = I;
736 for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i)
737 if (MI->getOperand(i).isFI()) {
738 // Some instructions (e.g. inline asm instructions) can have
739 // multiple frame indices and/or cause eliminateFrameIndex
740 // to insert more than one instruction. We need the register
741 // scavenger to go through all of these instructions so that
742 // it can update its register information. We keep the
743 // iterator at the point before insertion so that we can
744 // revisit them in full.
745 bool AtBeginning = (I == BB->begin());
746 if (!AtBeginning) --I;
748 // If this instruction has a FrameIndex operand, we need to
749 // use that target machine register info object to eliminate
751 TargetRegisterInfo::FrameIndexValue Value;
753 TRI.eliminateFrameIndex(MI, SPAdj, &Value,
754 FrameIndexVirtualScavenging ? NULL : RS);
756 assert (FrameIndexVirtualScavenging &&
757 "Not scavenging, but virtual returned from "
758 "eliminateFrameIndex()!");
759 FrameConstantRegMap[VReg] = FrameConstantEntry(Value, SPAdj);
762 // Reset the iterator if we were at the beginning of the BB.
772 if (DoIncr && I != BB->end()) ++I;
774 // Update register states.
775 if (RS && !FrameIndexVirtualScavenging && MI) RS->forward(MI);
778 // If we have evenly matched pairs of frame setup / destroy instructions,
779 // make sure the adjustments come out to zero. If we don't have matched
780 // pairs, we can't be sure the missing bit isn't in another basic block
781 // due to a custom inserter playing tricks, so just asserting SPAdj==0
782 // isn't sufficient. See tMOVCC on Thumb1, for example.
783 assert((SPAdjCount || SPAdj == 0) &&
784 "Unbalanced call frame setup / destroy pairs?");
788 /// findLastUseReg - find the killing use of the specified register within
789 /// the instruciton range. Return the operand number of the kill in Operand.
790 static MachineBasicBlock::iterator
791 findLastUseReg(MachineBasicBlock::iterator I, MachineBasicBlock::iterator ME,
793 // Scan forward to find the last use of this virtual register
794 for (++I; I != ME; ++I) {
795 MachineInstr *MI = I;
796 bool isDefInsn = false;
797 bool isKillInsn = false;
798 for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i)
799 if (MI->getOperand(i).isReg()) {
800 unsigned OpReg = MI->getOperand(i).getReg();
801 if (OpReg == 0 || !TargetRegisterInfo::isVirtualRegister(OpReg))
804 && "overlapping use of scavenged index register!");
805 // If this is the killing use, we have a candidate.
806 if (MI->getOperand(i).isKill())
808 else if (MI->getOperand(i).isDef())
811 if (isKillInsn && !isDefInsn)
814 // If we hit the end of the basic block, there was no kill of
815 // the virtual register, which is wrong.
816 assert (0 && "scavenged index register never killed!");
820 /// scavengeFrameVirtualRegs - Replace all frame index virtual registers
821 /// with physical registers. Use the register scavenger to find an
822 /// appropriate register to use.
823 void PEI::scavengeFrameVirtualRegs(MachineFunction &Fn) {
824 // Run through the instructions and find any virtual registers.
825 for (MachineFunction::iterator BB = Fn.begin(),
826 E = Fn.end(); BB != E; ++BB) {
827 RS->enterBasicBlock(BB);
829 // FIXME: The logic flow in this function is still too convoluted.
830 // It needs a cleanup refactoring. Do that in preparation for tracking
831 // more than one scratch register value and using ranges to find
832 // available scratch registers.
833 unsigned CurrentVirtReg = 0;
834 unsigned CurrentScratchReg = 0;
835 bool havePrevValue = false;
836 TargetRegisterInfo::FrameIndexValue PrevValue(0,0);
837 TargetRegisterInfo::FrameIndexValue Value(0,0);
838 MachineInstr *PrevLastUseMI = NULL;
839 unsigned PrevLastUseOp = 0;
840 bool trackingCurrentValue = false;
843 // The instruction stream may change in the loop, so check BB->end()
845 for (MachineBasicBlock::iterator I = BB->begin(); I != BB->end(); ) {
846 MachineInstr *MI = I;
847 bool isDefInsn = false;
848 bool isKillInsn = false;
849 bool clobbersScratchReg = false;
851 for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
852 if (MI->getOperand(i).isReg()) {
853 MachineOperand &MO = MI->getOperand(i);
854 unsigned Reg = MO.getReg();
857 if (!TargetRegisterInfo::isVirtualRegister(Reg)) {
858 // If we have a previous scratch reg, check and see if anything
859 // here kills whatever value is in there.
860 if (Reg == CurrentScratchReg) {
862 // Two-address operands implicitly kill
863 if (MO.isKill() || MI->isRegTiedToDefOperand(i))
864 clobbersScratchReg = true;
867 clobbersScratchReg = true;
872 // If this is a def, remember that this insn defines the value.
873 // This lets us properly consider insns which re-use the scratch
874 // register, such as r2 = sub r2, #imm, in the middle of the
879 // Have we already allocated a scratch register for this virtual?
880 if (Reg != CurrentVirtReg) {
881 // When we first encounter a new virtual register, it
882 // must be a definition.
883 assert(MI->getOperand(i).isDef() &&
884 "frame index virtual missing def!");
885 // We can't have nested virtual register live ranges because
886 // there's only a guarantee of one scavenged register at a time.
887 assert (CurrentVirtReg == 0 &&
888 "overlapping frame index virtual registers!");
890 // If the target gave us information about what's in the register,
891 // we can use that to re-use scratch regs.
892 DenseMap<unsigned, FrameConstantEntry>::iterator Entry =
893 FrameConstantRegMap.find(Reg);
894 trackingCurrentValue = Entry != FrameConstantRegMap.end();
895 if (trackingCurrentValue) {
896 SPAdj = (*Entry).second.second;
897 Value = (*Entry).second.first;
904 // If the scratch register from the last allocation is still
905 // available, see if the value matches. If it does, just re-use it.
906 if (trackingCurrentValue && havePrevValue && PrevValue == Value) {
907 // FIXME: This assumes that the instructions in the live range
908 // for the virtual register are exclusively for the purpose
909 // of populating the value in the register. That's reasonable
910 // for these frame index registers, but it's still a very, very
911 // strong assumption. rdar://7322732. Better would be to
912 // explicitly check each instruction in the range for references
913 // to the virtual register. Only delete those insns that
914 // touch the virtual register.
916 // Find the last use of the new virtual register. Remove all
917 // instruction between here and there, and update the current
918 // instruction to reference the last use insn instead.
919 MachineBasicBlock::iterator LastUseMI =
920 findLastUseReg(I, BB->end(), Reg);
922 // Remove all instructions up 'til the last use, since they're
923 // just calculating the value we already have.
924 BB->erase(I, LastUseMI);
927 // Extend the live range of the scratch register
928 PrevLastUseMI->getOperand(PrevLastUseOp).setIsKill(false);
929 RS->setUsed(CurrentScratchReg);
930 CurrentVirtReg = Reg;
932 // We deleted the instruction we were scanning the operands of.
933 // Jump back to the instruction iterator loop. Don't increment
934 // past this instruction since we updated the iterator already.
939 // Scavenge a new scratch register
940 CurrentVirtReg = Reg;
941 const TargetRegisterClass *RC = Fn.getRegInfo().getRegClass(Reg);
942 CurrentScratchReg = RS->scavengeRegister(RC, I, SPAdj);
945 // replace this reference to the virtual register with the
947 assert (CurrentScratchReg && "Missing scratch register!");
948 MI->getOperand(i).setReg(CurrentScratchReg);
950 if (MI->getOperand(i).isKill()) {
957 // If this is the last use of the scratch, stop tracking it. The
958 // last use will be a kill operand in an instruction that does
959 // not also define the scratch register.
960 if (isKillInsn && !isDefInsn) {
962 havePrevValue = trackingCurrentValue;
964 // Similarly, notice if instruction clobbered the value in the
965 // register we're tracking for possible later reuse. This is noted
966 // above, but enforced here since the value is still live while we
967 // process the rest of the operands of the instruction.
968 if (clobbersScratchReg) {
969 havePrevValue = false;
970 CurrentScratchReg = 0;