blob: 5859cb0ededba2294a393effadcbabe320e3fe26 [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"
Vikram S. Advee997a112002-07-10 21:42:13 +000018#include "llvm/CodeGen/InstrSelectionSupport.h"
Chris Lattner5074bb52002-04-09 05:18:31 +000019#include "llvm/Pass.h"
20#include "llvm/Function.h"
Chris Lattner5074bb52002-04-09 05:18:31 +000021
22namespace {
Chris Lattnerd2a67df2002-12-28 20:16:08 +000023 struct InsertPrologEpilogCode : public MachineFunctionPass {
Chris Lattner7076ff22002-06-25 16:13:21 +000024 const char *getPassName() const { return "Sparc Prolog/Epilog Inserter"; }
25
Chris Lattnerd2a67df2002-12-28 20:16:08 +000026 bool runOnMachineFunction(MachineFunction &F) {
27 if (!F.getInfo()->isCompiledAsLeafMethod()) {
Chris Lattner7076ff22002-06-25 16:13:21 +000028 InsertPrologCode(F);
29 InsertEpilogCode(F);
30 }
31 return false;
Chris Lattner5074bb52002-04-09 05:18:31 +000032 }
Chris Lattner7076ff22002-06-25 16:13:21 +000033
Chris Lattnerd2a67df2002-12-28 20:16:08 +000034 void InsertPrologCode(MachineFunction &F);
35 void InsertEpilogCode(MachineFunction &F);
Chris Lattner7076ff22002-06-25 16:13:21 +000036 };
Chris Lattner5074bb52002-04-09 05:18:31 +000037
38} // End anonymous namespace
39
40//------------------------------------------------------------------------
Chris Lattner5074bb52002-04-09 05:18:31 +000041// Create prolog and epilog code for procedure entry and exit
42//------------------------------------------------------------------------
43
Chris Lattnerd2a67df2002-12-28 20:16:08 +000044void InsertPrologEpilogCode::InsertPrologCode(MachineFunction &MF)
Chris Lattner5074bb52002-04-09 05:18:31 +000045{
Anand Shukla458496c2002-06-25 20:55:50 +000046 std::vector<MachineInstr*> mvec;
Chris Lattnerd2a67df2002-12-28 20:16:08 +000047 const TargetMachine &TM = MF.getTarget();
48 const TargetFrameInfo& frameInfo = TM.getFrameInfo();
Chris Lattner5074bb52002-04-09 05:18:31 +000049
50 // The second operand is the stack size. If it does not fit in the
51 // immediate field, we have to use a free register to hold the size.
Vikram S. Adve78044fb2002-10-13 00:24:06 +000052 // See the comments below for the choice of this register.
Chris Lattner5074bb52002-04-09 05:18:31 +000053 //
Chris Lattnerd2a67df2002-12-28 20:16:08 +000054 unsigned staticStackSize = MF.getInfo()->getStaticStackSize();
Chris Lattner5074bb52002-04-09 05:18:31 +000055
56 if (staticStackSize < (unsigned) frameInfo.getMinStackFrameSize())
57 staticStackSize = (unsigned) frameInfo.getMinStackFrameSize();
Vikram S. Adve78044fb2002-10-13 00:24:06 +000058
Chris Lattner5074bb52002-04-09 05:18:31 +000059 if (unsigned padsz = (staticStackSize %
60 (unsigned) frameInfo.getStackFrameSizeAlignment()))
61 staticStackSize += frameInfo.getStackFrameSizeAlignment() - padsz;
62
Chris Lattnercbe63852002-10-28 21:43:57 +000063 int32_t C = - (int) staticStackSize;
Chris Lattnerd2a67df2002-12-28 20:16:08 +000064 int SP = TM.getRegInfo().getStackPointer();
65 if (TM.getInstrInfo().constantFitsInImmedField(SAVE, staticStackSize)) {
66 mvec.push_back(BuildMI(SAVE, 3).addMReg(SP).addSImm(C).addMReg(SP));
Chris Lattnercbe63852002-10-28 21:43:57 +000067 } else {
Chris Lattnerd2a67df2002-12-28 20:16:08 +000068 // We have to put the stack size value into a register before SAVE.
69 // Use register %g1 since it is volatile across calls. Note that the
70 // local (%l) and in (%i) registers cannot be used before the SAVE!
71 // Do this by creating a code sequence equivalent to:
72 // SETSW -(stackSize), %g1
73 int uregNum = TM.getRegInfo().getUnifiedRegNum(
74 TM.getRegInfo().getRegClassIDOfType(Type::IntTy),
75 SparcIntRegClass::g1);
Chris Lattner5074bb52002-04-09 05:18:31 +000076
Chris Lattnerd2a67df2002-12-28 20:16:08 +000077 MachineInstr* M = BuildMI(SETHI, 2).addSImm(C).addMReg(uregNum);
78 M->setOperandHi32(0);
79 mvec.push_back(M);
80
81 M = BuildMI(OR, 3).addMReg(uregNum).addSImm(C).addMReg(uregNum);
82 M->setOperandLo32(1);
83 mvec.push_back(M);
84
85 M = BuildMI(SRA, 3).addMReg(uregNum).addZImm(0).addMReg(uregNum);
86 mvec.push_back(M);
87
88 // Now generate the SAVE using the value in register %g1
89 M = BuildMI(SAVE, 3).addMReg(SP).addMReg(uregNum).addMReg(SP);
90 mvec.push_back(M);
91 }
92
93 MF.front().insert(MF.front().begin(), mvec.begin(), mvec.end());
Chris Lattner5074bb52002-04-09 05:18:31 +000094}
95
Chris Lattnerd2a67df2002-12-28 20:16:08 +000096void InsertPrologEpilogCode::InsertEpilogCode(MachineFunction &MF)
Chris Lattner5074bb52002-04-09 05:18:31 +000097{
Chris Lattnerd2a67df2002-12-28 20:16:08 +000098 const TargetMachine &TM = MF.getTarget();
Chris Lattnerb4d58d72003-01-14 22:00:31 +000099 const TargetInstrInfo &MII = TM.getInstrInfo();
Chris Lattnerd2a67df2002-12-28 20:16:08 +0000100
Misha Brukman181ea4a2002-10-28 20:01:13 +0000101 for (MachineFunction::iterator I = MF.begin(), E = MF.end(); I != E; ++I) {
102 MachineBasicBlock &MBB = *I;
103 BasicBlock &BB = *I->getBasicBlock();
104 Instruction *TermInst = (Instruction*)BB.getTerminator();
Chris Lattner5074bb52002-04-09 05:18:31 +0000105 if (TermInst->getOpcode() == Instruction::Ret)
106 {
Chris Lattnerd2a67df2002-12-28 20:16:08 +0000107 int ZR = TM.getRegInfo().getZeroRegNum();
Chris Lattnercbe63852002-10-28 21:43:57 +0000108 MachineInstr *Restore =
109 BuildMI(RESTORE, 3).addMReg(ZR).addSImm(0).addMReg(ZR);
Chris Lattner5074bb52002-04-09 05:18:31 +0000110
Chris Lattner5074bb52002-04-09 05:18:31 +0000111 MachineCodeForInstruction &termMvec =
112 MachineCodeForInstruction::get(TermInst);
113
114 // Remove the NOPs in the delay slots of the return instruction
Chris Lattner5074bb52002-04-09 05:18:31 +0000115 unsigned numNOPs = 0;
116 while (termMvec.back()->getOpCode() == NOP)
117 {
Misha Brukman181ea4a2002-10-28 20:01:13 +0000118 assert( termMvec.back() == MBB.back());
119 delete MBB.pop_back();
Chris Lattner5074bb52002-04-09 05:18:31 +0000120 termMvec.pop_back();
Chris Lattner5074bb52002-04-09 05:18:31 +0000121 ++numNOPs;
122 }
Misha Brukman181ea4a2002-10-28 20:01:13 +0000123 assert(termMvec.back() == MBB.back());
Chris Lattner5074bb52002-04-09 05:18:31 +0000124
125 // Check that we found the right number of NOPs and have the right
126 // number of instructions to replace them.
Chris Lattnerd2a67df2002-12-28 20:16:08 +0000127 unsigned ndelays = MII.getNumDelaySlots(termMvec.back()->getOpCode());
Chris Lattner5074bb52002-04-09 05:18:31 +0000128 assert(numNOPs == ndelays && "Missing NOPs in delay slots?");
129 assert(ndelays == 1 && "Cannot use epilog code for delay slots?");
130
131 // Append the epilog code to the end of the basic block.
Misha Brukman181ea4a2002-10-28 20:01:13 +0000132 MBB.push_back(Restore);
Chris Lattner5074bb52002-04-09 05:18:31 +0000133 }
134 }
135}
136
Vikram S. Adve36d3e032002-09-16 15:39:26 +0000137Pass* UltraSparc::getPrologEpilogInsertionPass() {
Chris Lattnerd2a67df2002-12-28 20:16:08 +0000138 return new InsertPrologEpilogCode();
Chris Lattner5074bb52002-04-09 05:18:31 +0000139}