blob: b74c7df344f3d1d9712ccb0bdcae5fa7e7ae7cde [file] [log] [blame]
Chris Lattner5074bb52002-04-09 05:18:31 +00001//===-- PrologEpilogCodeInserter.cpp - Insert Prolog & Epilog code for fn -===//
2//
3// Insert SAVE/RESTORE instructions for the function
4//
5// Insert prolog code at the unique function entry point.
6// Insert epilog code at each function exit point.
7// InsertPrologEpilog invokes these only if the function is not compiled
8// with the leaf function optimization.
9//
10//===----------------------------------------------------------------------===//
11
12#include "SparcInternals.h"
13#include "SparcRegClassInfo.h"
Chris Lattnerd2a67df2002-12-28 20:16:08 +000014#include "llvm/CodeGen/MachineFunctionPass.h"
15#include "llvm/CodeGen/MachineFunctionInfo.h"
Chris Lattner5074bb52002-04-09 05:18:31 +000016#include "llvm/CodeGen/MachineCodeForInstruction.h"
Chris Lattnercbe63852002-10-28 21:43:57 +000017#include "llvm/CodeGen/MachineInstrBuilder.h"
Chris Lattner5074bb52002-04-09 05:18:31 +000018#include "llvm/Pass.h"
19#include "llvm/Function.h"
Vikram S. Advec9a0a1d2003-05-25 15:59:47 +000020#include "llvm/DerivedTypes.h"
21#include "llvm/Intrinsics.h"
Chris Lattner5074bb52002-04-09 05:18:31 +000022
23namespace {
Chris Lattnerd2a67df2002-12-28 20:16:08 +000024 struct InsertPrologEpilogCode : public MachineFunctionPass {
Chris Lattner7076ff22002-06-25 16:13:21 +000025 const char *getPassName() const { return "Sparc Prolog/Epilog Inserter"; }
26
Chris Lattnerd2a67df2002-12-28 20:16:08 +000027 bool runOnMachineFunction(MachineFunction &F) {
28 if (!F.getInfo()->isCompiledAsLeafMethod()) {
Chris Lattner7076ff22002-06-25 16:13:21 +000029 InsertPrologCode(F);
30 InsertEpilogCode(F);
31 }
32 return false;
Chris Lattner5074bb52002-04-09 05:18:31 +000033 }
Chris Lattner7076ff22002-06-25 16:13:21 +000034
Chris Lattnerd2a67df2002-12-28 20:16:08 +000035 void InsertPrologCode(MachineFunction &F);
36 void InsertEpilogCode(MachineFunction &F);
Chris Lattner7076ff22002-06-25 16:13:21 +000037 };
Chris Lattner5074bb52002-04-09 05:18:31 +000038
39} // End anonymous namespace
40
41//------------------------------------------------------------------------
Chris Lattner5074bb52002-04-09 05:18:31 +000042// Create prolog and epilog code for procedure entry and exit
43//------------------------------------------------------------------------
44
Chris Lattnerd2a67df2002-12-28 20:16:08 +000045void InsertPrologEpilogCode::InsertPrologCode(MachineFunction &MF)
Chris Lattner5074bb52002-04-09 05:18:31 +000046{
Anand Shukla458496c2002-06-25 20:55:50 +000047 std::vector<MachineInstr*> mvec;
Chris Lattnerd2a67df2002-12-28 20:16:08 +000048 const TargetMachine &TM = MF.getTarget();
49 const TargetFrameInfo& frameInfo = TM.getFrameInfo();
Chris Lattner5074bb52002-04-09 05:18:31 +000050
51 // The second operand is the stack size. If it does not fit in the
52 // immediate field, we have to use a free register to hold the size.
Vikram S. Adve78044fb2002-10-13 00:24:06 +000053 // See the comments below for the choice of this register.
Chris Lattner5074bb52002-04-09 05:18:31 +000054 //
Chris Lattnerd2a67df2002-12-28 20:16:08 +000055 unsigned staticStackSize = MF.getInfo()->getStaticStackSize();
Chris Lattner5074bb52002-04-09 05:18:31 +000056
57 if (staticStackSize < (unsigned) frameInfo.getMinStackFrameSize())
58 staticStackSize = (unsigned) frameInfo.getMinStackFrameSize();
Vikram S. Adve78044fb2002-10-13 00:24:06 +000059
Chris Lattner5074bb52002-04-09 05:18:31 +000060 if (unsigned padsz = (staticStackSize %
61 (unsigned) frameInfo.getStackFrameSizeAlignment()))
62 staticStackSize += frameInfo.getStackFrameSizeAlignment() - padsz;
63
Chris Lattnercbe63852002-10-28 21:43:57 +000064 int32_t C = - (int) staticStackSize;
Chris Lattnerd2a67df2002-12-28 20:16:08 +000065 int SP = TM.getRegInfo().getStackPointer();
Misha Brukman8bde6a62003-05-27 22:35:43 +000066 if (TM.getInstrInfo().constantFitsInImmedField(V9::SAVEi,staticStackSize)) {
67 mvec.push_back(BuildMI(V9::SAVEi, 3).addMReg(SP).addSImm(C)
68 .addMReg(SP, MOTy::Def));
Chris Lattnercbe63852002-10-28 21:43:57 +000069 } else {
Chris Lattnerd2a67df2002-12-28 20:16:08 +000070 // We have to put the stack size value into a register before SAVE.
71 // Use register %g1 since it is volatile across calls. Note that the
72 // local (%l) and in (%i) registers cannot be used before the SAVE!
73 // Do this by creating a code sequence equivalent to:
74 // SETSW -(stackSize), %g1
75 int uregNum = TM.getRegInfo().getUnifiedRegNum(
76 TM.getRegInfo().getRegClassIDOfType(Type::IntTy),
77 SparcIntRegClass::g1);
Chris Lattner5074bb52002-04-09 05:18:31 +000078
Misha Brukman56f4fa12003-05-20 20:32:24 +000079 MachineInstr* M = BuildMI(V9::SETHI, 2).addSImm(C)
80 .addMReg(uregNum, MOTy::Def);
Chris Lattnerd2a67df2002-12-28 20:16:08 +000081 M->setOperandHi32(0);
82 mvec.push_back(M);
83
Misha Brukman8bde6a62003-05-27 22:35:43 +000084 M = BuildMI(V9::ORi, 3).addMReg(uregNum).addSImm(C)
Misha Brukman56f4fa12003-05-20 20:32:24 +000085 .addMReg(uregNum, MOTy::Def);
Chris Lattnerd2a67df2002-12-28 20:16:08 +000086 M->setOperandLo32(1);
87 mvec.push_back(M);
88
Misha Brukman2969ec52003-06-06 09:52:23 +000089 M = BuildMI(V9::SRAi5, 3).addMReg(uregNum).addZImm(0)
Misha Brukman56f4fa12003-05-20 20:32:24 +000090 .addMReg(uregNum, MOTy::Def);
Chris Lattnerd2a67df2002-12-28 20:16:08 +000091 mvec.push_back(M);
92
93 // Now generate the SAVE using the value in register %g1
Misha Brukman8bde6a62003-05-27 22:35:43 +000094 M = BuildMI(V9::SAVEr,3).addMReg(SP).addMReg(uregNum).addMReg(SP,MOTy::Def);
Chris Lattnerd2a67df2002-12-28 20:16:08 +000095 mvec.push_back(M);
96 }
97
Vikram S. Advec9a0a1d2003-05-25 15:59:47 +000098 // For varargs function bodies, insert instructions to copy incoming
99 // register arguments for the ... list to the stack.
100 // The first K=6 arguments are always received via int arg regs
101 // (%i0 ... %i5 if K=6) .
102 // By copying the varargs arguments to the stack, va_arg() then can
103 // simply assume that all vararg arguments are in an array on the stack.
104 //
105 if (MF.getFunction()->getFunctionType()->isVarArg()) {
106 int numFixedArgs = MF.getFunction()->getFunctionType()->getNumParams();
107 int numArgRegs = TM.getRegInfo().getNumOfIntArgRegs();
108 if (numFixedArgs < numArgRegs) {
109 bool ignore;
110 int firstArgReg = TM.getRegInfo().getUnifiedRegNum(
111 TM.getRegInfo().getRegClassIDOfType(Type::IntTy),
112 SparcIntRegClass::i0);
113 int fpReg = TM.getFrameInfo().getIncomingArgBaseRegNum();
114 int argSize = TM.getFrameInfo().getSizeOfEachArgOnStack();
115 int firstArgOffset=TM.getFrameInfo().getFirstIncomingArgOffset(MF,ignore);
116 int nextArgOffset = firstArgOffset + numFixedArgs * argSize;
117
118 for (int i=numFixedArgs; i < numArgRegs; ++i) {
Misha Brukman8bde6a62003-05-27 22:35:43 +0000119 mvec.push_back(BuildMI(V9::STXi, 3).addMReg(firstArgReg+i).
Vikram S. Advec9a0a1d2003-05-25 15:59:47 +0000120 addMReg(fpReg).addSImm(nextArgOffset));
121 nextArgOffset += argSize;
122 }
123 }
124 }
125
Chris Lattnerd2a67df2002-12-28 20:16:08 +0000126 MF.front().insert(MF.front().begin(), mvec.begin(), mvec.end());
Chris Lattner5074bb52002-04-09 05:18:31 +0000127}
128
Chris Lattnerd2a67df2002-12-28 20:16:08 +0000129void InsertPrologEpilogCode::InsertEpilogCode(MachineFunction &MF)
Chris Lattner5074bb52002-04-09 05:18:31 +0000130{
Chris Lattnerd2a67df2002-12-28 20:16:08 +0000131 const TargetMachine &TM = MF.getTarget();
Chris Lattnerb4d58d72003-01-14 22:00:31 +0000132 const TargetInstrInfo &MII = TM.getInstrInfo();
Chris Lattnerd2a67df2002-12-28 20:16:08 +0000133
Misha Brukman181ea4a2002-10-28 20:01:13 +0000134 for (MachineFunction::iterator I = MF.begin(), E = MF.end(); I != E; ++I) {
135 MachineBasicBlock &MBB = *I;
Chris Lattner99dbdf72003-07-26 23:04:00 +0000136 const BasicBlock &BB = *I->getBasicBlock();
137 const Instruction *TermInst = (Instruction*)BB.getTerminator();
Chris Lattner5074bb52002-04-09 05:18:31 +0000138 if (TermInst->getOpcode() == Instruction::Ret)
Misha Brukman56f4fa12003-05-20 20:32:24 +0000139 {
140 int ZR = TM.getRegInfo().getZeroRegNum();
141 MachineInstr *Restore =
Misha Brukman8bde6a62003-05-27 22:35:43 +0000142 BuildMI(V9::RESTOREi, 3).addMReg(ZR).addSImm(0).addMReg(ZR, MOTy::Def);
Misha Brukman56f4fa12003-05-20 20:32:24 +0000143
144 MachineCodeForInstruction &termMvec =
145 MachineCodeForInstruction::get(TermInst);
146
147 // Remove the NOPs in the delay slots of the return instruction
148 unsigned numNOPs = 0;
149 while (termMvec.back()->getOpCode() == V9::NOP)
Chris Lattner5074bb52002-04-09 05:18:31 +0000150 {
Misha Brukman56f4fa12003-05-20 20:32:24 +0000151 assert( termMvec.back() == MBB.back());
152 delete MBB.pop_back();
153 termMvec.pop_back();
154 ++numNOPs;
Chris Lattner5074bb52002-04-09 05:18:31 +0000155 }
Misha Brukman56f4fa12003-05-20 20:32:24 +0000156 assert(termMvec.back() == MBB.back());
157
158 // Check that we found the right number of NOPs and have the right
159 // number of instructions to replace them.
160 unsigned ndelays = MII.getNumDelaySlots(termMvec.back()->getOpCode());
161 assert(numNOPs == ndelays && "Missing NOPs in delay slots?");
162 assert(ndelays == 1 && "Cannot use epilog code for delay slots?");
163
164 // Append the epilog code to the end of the basic block.
165 MBB.push_back(Restore);
166 }
Chris Lattner5074bb52002-04-09 05:18:31 +0000167 }
168}
169
Brian Gaeke8c14ba92003-08-14 06:09:32 +0000170FunctionPass *UltraSparc::getPrologEpilogInsertionPass() {
Chris Lattnerd2a67df2002-12-28 20:16:08 +0000171 return new InsertPrologEpilogCode();
Chris Lattner5074bb52002-04-09 05:18:31 +0000172}