Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 1 | //===-- 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" |
Misha Brukman | 7ae7f84 | 2002-10-28 00:28:31 +0000 | [diff] [blame] | 14 | #include "llvm/CodeGen/MachineFunction.h" |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 15 | #include "llvm/CodeGen/MachineCodeForInstruction.h" |
| 16 | #include "llvm/CodeGen/MachineInstr.h" |
Vikram S. Adve | e997a11 | 2002-07-10 21:42:13 +0000 | [diff] [blame] | 17 | #include "llvm/CodeGen/InstrSelectionSupport.h" |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 18 | #include "llvm/Pass.h" |
| 19 | #include "llvm/Function.h" |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 20 | |
| 21 | namespace { |
Chris Lattner | 7076ff2 | 2002-06-25 16:13:21 +0000 | [diff] [blame] | 22 | class InsertPrologEpilogCode : public FunctionPass { |
| 23 | TargetMachine &Target; |
| 24 | public: |
| 25 | InsertPrologEpilogCode(TargetMachine &T) : Target(T) {} |
| 26 | |
| 27 | const char *getPassName() const { return "Sparc Prolog/Epilog Inserter"; } |
| 28 | |
| 29 | bool runOnFunction(Function &F) { |
Misha Brukman | 7ae7f84 | 2002-10-28 00:28:31 +0000 | [diff] [blame] | 30 | MachineFunction &mcodeInfo = MachineFunction::get(&F); |
Chris Lattner | 7076ff2 | 2002-06-25 16:13:21 +0000 | [diff] [blame] | 31 | if (!mcodeInfo.isCompiledAsLeafMethod()) { |
| 32 | InsertPrologCode(F); |
| 33 | InsertEpilogCode(F); |
| 34 | } |
| 35 | return false; |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 36 | } |
Chris Lattner | 7076ff2 | 2002-06-25 16:13:21 +0000 | [diff] [blame] | 37 | |
| 38 | void InsertPrologCode(Function &F); |
| 39 | void InsertEpilogCode(Function &F); |
| 40 | }; |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 41 | |
| 42 | } // End anonymous namespace |
| 43 | |
| 44 | //------------------------------------------------------------------------ |
| 45 | // External Function: GetInstructionsForProlog |
| 46 | // External Function: GetInstructionsForEpilog |
| 47 | // |
| 48 | // Purpose: |
| 49 | // Create prolog and epilog code for procedure entry and exit |
| 50 | //------------------------------------------------------------------------ |
| 51 | |
Chris Lattner | 7076ff2 | 2002-06-25 16:13:21 +0000 | [diff] [blame] | 52 | void InsertPrologEpilogCode::InsertPrologCode(Function &F) |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 53 | { |
Anand Shukla | 458496c | 2002-06-25 20:55:50 +0000 | [diff] [blame] | 54 | std::vector<MachineInstr*> mvec; |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 55 | MachineInstr* M; |
| 56 | const MachineFrameInfo& frameInfo = Target.getFrameInfo(); |
| 57 | |
| 58 | // The second operand is the stack size. If it does not fit in the |
| 59 | // immediate field, we have to use a free register to hold the size. |
Vikram S. Adve | 78044fb | 2002-10-13 00:24:06 +0000 | [diff] [blame] | 60 | // See the comments below for the choice of this register. |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 61 | // |
Misha Brukman | 7ae7f84 | 2002-10-28 00:28:31 +0000 | [diff] [blame] | 62 | MachineFunction& mcInfo = MachineFunction::get(&F); |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 63 | unsigned int staticStackSize = mcInfo.getStaticStackSize(); |
| 64 | |
| 65 | if (staticStackSize < (unsigned) frameInfo.getMinStackFrameSize()) |
| 66 | staticStackSize = (unsigned) frameInfo.getMinStackFrameSize(); |
Vikram S. Adve | 78044fb | 2002-10-13 00:24:06 +0000 | [diff] [blame] | 67 | |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 68 | if (unsigned padsz = (staticStackSize % |
| 69 | (unsigned) frameInfo.getStackFrameSizeAlignment())) |
| 70 | staticStackSize += frameInfo.getStackFrameSizeAlignment() - padsz; |
| 71 | |
| 72 | if (Target.getInstrInfo().constantFitsInImmedField(SAVE, staticStackSize)) |
| 73 | { |
| 74 | M = new MachineInstr(SAVE); |
| 75 | M->SetMachineOperandReg(0, Target.getRegInfo().getStackPointer()); |
| 76 | M->SetMachineOperandConst(1, MachineOperand::MO_SignExtendedImmed, |
| 77 | - (int) staticStackSize); |
| 78 | M->SetMachineOperandReg(2, Target.getRegInfo().getStackPointer()); |
| 79 | mvec.push_back(M); |
| 80 | } |
| 81 | else |
| 82 | { |
Vikram S. Adve | e997a11 | 2002-07-10 21:42:13 +0000 | [diff] [blame] | 83 | // We have to put the stack size value into a register before SAVE. |
Vikram S. Adve | 78044fb | 2002-10-13 00:24:06 +0000 | [diff] [blame] | 84 | // Use register %g1 since it is volatile across calls. Note that the |
| 85 | // local (%l) and in (%i) registers cannot be used before the SAVE! |
Vikram S. Adve | e997a11 | 2002-07-10 21:42:13 +0000 | [diff] [blame] | 86 | // Do this by creating a code sequence equivalent to: |
Vikram S. Adve | 78044fb | 2002-10-13 00:24:06 +0000 | [diff] [blame] | 87 | // SETSW -(stackSize), %g1 |
Vikram S. Adve | e997a11 | 2002-07-10 21:42:13 +0000 | [diff] [blame] | 88 | int32_t C = - (int) staticStackSize; |
| 89 | int uregNum = Target.getRegInfo().getUnifiedRegNum( |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 90 | Target.getRegInfo().getRegClassIDOfType(Type::IntTy), |
Vikram S. Adve | 78044fb | 2002-10-13 00:24:06 +0000 | [diff] [blame] | 91 | SparcIntRegClass::g1); |
Vikram S. Adve | e997a11 | 2002-07-10 21:42:13 +0000 | [diff] [blame] | 92 | |
| 93 | M = new MachineInstr(SETHI); |
| 94 | M->SetMachineOperandConst(0, MachineOperand::MO_SignExtendedImmed, C); |
| 95 | M->SetMachineOperandReg(1, uregNum); |
| 96 | M->setOperandHi32(0); |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 97 | mvec.push_back(M); |
| 98 | |
Vikram S. Adve | e997a11 | 2002-07-10 21:42:13 +0000 | [diff] [blame] | 99 | M = new MachineInstr(OR); |
| 100 | M->SetMachineOperandReg(0, uregNum); |
| 101 | M->SetMachineOperandConst(1, MachineOperand::MO_SignExtendedImmed, C); |
| 102 | M->SetMachineOperandReg(2, uregNum); |
| 103 | M->setOperandLo32(1); |
| 104 | mvec.push_back(M); |
| 105 | |
| 106 | M = new MachineInstr(SRA); |
| 107 | M->SetMachineOperandReg(0, uregNum); |
| 108 | M->SetMachineOperandConst(1, MachineOperand::MO_UnextendedImmed, 0); |
| 109 | M->SetMachineOperandReg(2, uregNum); |
| 110 | mvec.push_back(M); |
| 111 | |
Vikram S. Adve | 78044fb | 2002-10-13 00:24:06 +0000 | [diff] [blame] | 112 | // Now generate the SAVE using the value in register %g1 |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 113 | M = new MachineInstr(SAVE); |
| 114 | M->SetMachineOperandReg(0, Target.getRegInfo().getStackPointer()); |
Vikram S. Adve | 6d6deba | 2002-08-01 14:26:11 +0000 | [diff] [blame] | 115 | M->SetMachineOperandReg(1, uregNum); |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 116 | M->SetMachineOperandReg(2, Target.getRegInfo().getStackPointer()); |
| 117 | mvec.push_back(M); |
| 118 | } |
| 119 | |
Misha Brukman | 181ea4a | 2002-10-28 20:01:13 +0000 | [diff] [blame] | 120 | MachineBasicBlock& bbMvec = mcInfo.front(); |
Chris Lattner | 7076ff2 | 2002-06-25 16:13:21 +0000 | [diff] [blame] | 121 | bbMvec.insert(bbMvec.begin(), mvec.begin(), mvec.end()); |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 122 | } |
| 123 | |
Chris Lattner | 7076ff2 | 2002-06-25 16:13:21 +0000 | [diff] [blame] | 124 | void InsertPrologEpilogCode::InsertEpilogCode(Function &F) |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 125 | { |
Misha Brukman | 181ea4a | 2002-10-28 20:01:13 +0000 | [diff] [blame] | 126 | MachineFunction &MF = MachineFunction::get(&F); |
| 127 | for (MachineFunction::iterator I = MF.begin(), E = MF.end(); I != E; ++I) { |
| 128 | MachineBasicBlock &MBB = *I; |
| 129 | BasicBlock &BB = *I->getBasicBlock(); |
| 130 | Instruction *TermInst = (Instruction*)BB.getTerminator(); |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 131 | if (TermInst->getOpcode() == Instruction::Ret) |
| 132 | { |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 133 | MachineInstr *Restore = new MachineInstr(RESTORE); |
| 134 | Restore->SetMachineOperandReg(0, Target.getRegInfo().getZeroRegNum()); |
| 135 | Restore->SetMachineOperandConst(1, MachineOperand::MO_SignExtendedImmed, |
| 136 | (int64_t)0); |
| 137 | Restore->SetMachineOperandReg(2, Target.getRegInfo().getZeroRegNum()); |
| 138 | |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 139 | MachineCodeForInstruction &termMvec = |
| 140 | MachineCodeForInstruction::get(TermInst); |
| 141 | |
| 142 | // Remove the NOPs in the delay slots of the return instruction |
| 143 | const MachineInstrInfo &mii = Target.getInstrInfo(); |
| 144 | unsigned numNOPs = 0; |
| 145 | while (termMvec.back()->getOpCode() == NOP) |
| 146 | { |
Misha Brukman | 181ea4a | 2002-10-28 20:01:13 +0000 | [diff] [blame] | 147 | assert( termMvec.back() == MBB.back()); |
| 148 | delete MBB.pop_back(); |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 149 | termMvec.pop_back(); |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 150 | ++numNOPs; |
| 151 | } |
Misha Brukman | 181ea4a | 2002-10-28 20:01:13 +0000 | [diff] [blame] | 152 | assert(termMvec.back() == MBB.back()); |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 153 | |
| 154 | // Check that we found the right number of NOPs and have the right |
| 155 | // number of instructions to replace them. |
| 156 | unsigned ndelays = mii.getNumDelaySlots(termMvec.back()->getOpCode()); |
| 157 | assert(numNOPs == ndelays && "Missing NOPs in delay slots?"); |
| 158 | assert(ndelays == 1 && "Cannot use epilog code for delay slots?"); |
| 159 | |
| 160 | // Append the epilog code to the end of the basic block. |
Misha Brukman | 181ea4a | 2002-10-28 20:01:13 +0000 | [diff] [blame] | 161 | MBB.push_back(Restore); |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 162 | } |
| 163 | } |
| 164 | } |
| 165 | |
Vikram S. Adve | 36d3e03 | 2002-09-16 15:39:26 +0000 | [diff] [blame] | 166 | Pass* UltraSparc::getPrologEpilogInsertionPass() { |
| 167 | return new InsertPrologEpilogCode(*this); |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 168 | } |