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" |
Chris Lattner | d2a67df | 2002-12-28 20:16:08 +0000 | [diff] [blame] | 14 | #include "llvm/CodeGen/MachineFunctionPass.h" |
| 15 | #include "llvm/CodeGen/MachineFunctionInfo.h" |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 16 | #include "llvm/CodeGen/MachineCodeForInstruction.h" |
Chris Lattner | cbe6385 | 2002-10-28 21:43:57 +0000 | [diff] [blame] | 17 | #include "llvm/CodeGen/MachineInstrBuilder.h" |
Vikram S. Adve | e997a11 | 2002-07-10 21:42:13 +0000 | [diff] [blame] | 18 | #include "llvm/CodeGen/InstrSelectionSupport.h" |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 19 | #include "llvm/Pass.h" |
| 20 | #include "llvm/Function.h" |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 21 | |
| 22 | namespace { |
Chris Lattner | d2a67df | 2002-12-28 20:16:08 +0000 | [diff] [blame] | 23 | struct InsertPrologEpilogCode : public MachineFunctionPass { |
Chris Lattner | 7076ff2 | 2002-06-25 16:13:21 +0000 | [diff] [blame] | 24 | const char *getPassName() const { return "Sparc Prolog/Epilog Inserter"; } |
| 25 | |
Chris Lattner | d2a67df | 2002-12-28 20:16:08 +0000 | [diff] [blame] | 26 | bool runOnMachineFunction(MachineFunction &F) { |
| 27 | if (!F.getInfo()->isCompiledAsLeafMethod()) { |
Chris Lattner | 7076ff2 | 2002-06-25 16:13:21 +0000 | [diff] [blame] | 28 | InsertPrologCode(F); |
| 29 | InsertEpilogCode(F); |
| 30 | } |
| 31 | return false; |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 32 | } |
Chris Lattner | 7076ff2 | 2002-06-25 16:13:21 +0000 | [diff] [blame] | 33 | |
Chris Lattner | d2a67df | 2002-12-28 20:16:08 +0000 | [diff] [blame] | 34 | void InsertPrologCode(MachineFunction &F); |
| 35 | void InsertEpilogCode(MachineFunction &F); |
Chris Lattner | 7076ff2 | 2002-06-25 16:13:21 +0000 | [diff] [blame] | 36 | }; |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 37 | |
| 38 | } // End anonymous namespace |
| 39 | |
| 40 | //------------------------------------------------------------------------ |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 41 | // Create prolog and epilog code for procedure entry and exit |
| 42 | //------------------------------------------------------------------------ |
| 43 | |
Chris Lattner | d2a67df | 2002-12-28 20:16:08 +0000 | [diff] [blame] | 44 | void InsertPrologEpilogCode::InsertPrologCode(MachineFunction &MF) |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 45 | { |
Anand Shukla | 458496c | 2002-06-25 20:55:50 +0000 | [diff] [blame] | 46 | std::vector<MachineInstr*> mvec; |
Chris Lattner | d2a67df | 2002-12-28 20:16:08 +0000 | [diff] [blame] | 47 | const TargetMachine &TM = MF.getTarget(); |
| 48 | const TargetFrameInfo& frameInfo = TM.getFrameInfo(); |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 49 | |
| 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. Adve | 78044fb | 2002-10-13 00:24:06 +0000 | [diff] [blame] | 52 | // See the comments below for the choice of this register. |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 53 | // |
Chris Lattner | d2a67df | 2002-12-28 20:16:08 +0000 | [diff] [blame] | 54 | unsigned staticStackSize = MF.getInfo()->getStaticStackSize(); |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 55 | |
| 56 | if (staticStackSize < (unsigned) frameInfo.getMinStackFrameSize()) |
| 57 | staticStackSize = (unsigned) frameInfo.getMinStackFrameSize(); |
Vikram S. Adve | 78044fb | 2002-10-13 00:24:06 +0000 | [diff] [blame] | 58 | |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 59 | if (unsigned padsz = (staticStackSize % |
| 60 | (unsigned) frameInfo.getStackFrameSizeAlignment())) |
| 61 | staticStackSize += frameInfo.getStackFrameSizeAlignment() - padsz; |
| 62 | |
Chris Lattner | cbe6385 | 2002-10-28 21:43:57 +0000 | [diff] [blame] | 63 | int32_t C = - (int) staticStackSize; |
Chris Lattner | d2a67df | 2002-12-28 20:16:08 +0000 | [diff] [blame] | 64 | 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 Lattner | cbe6385 | 2002-10-28 21:43:57 +0000 | [diff] [blame] | 67 | } else { |
Chris Lattner | d2a67df | 2002-12-28 20:16:08 +0000 | [diff] [blame] | 68 | // 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 Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 76 | |
Chris Lattner | d2a67df | 2002-12-28 20:16:08 +0000 | [diff] [blame] | 77 | 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 Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 94 | } |
| 95 | |
Chris Lattner | d2a67df | 2002-12-28 20:16:08 +0000 | [diff] [blame] | 96 | void InsertPrologEpilogCode::InsertEpilogCode(MachineFunction &MF) |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 97 | { |
Chris Lattner | d2a67df | 2002-12-28 20:16:08 +0000 | [diff] [blame] | 98 | const TargetMachine &TM = MF.getTarget(); |
Chris Lattner | b4d58d7 | 2003-01-14 22:00:31 +0000 | [diff] [blame] | 99 | const TargetInstrInfo &MII = TM.getInstrInfo(); |
Chris Lattner | d2a67df | 2002-12-28 20:16:08 +0000 | [diff] [blame] | 100 | |
Misha Brukman | 181ea4a | 2002-10-28 20:01:13 +0000 | [diff] [blame] | 101 | 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 Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 105 | if (TermInst->getOpcode() == Instruction::Ret) |
| 106 | { |
Chris Lattner | d2a67df | 2002-12-28 20:16:08 +0000 | [diff] [blame] | 107 | int ZR = TM.getRegInfo().getZeroRegNum(); |
Chris Lattner | cbe6385 | 2002-10-28 21:43:57 +0000 | [diff] [blame] | 108 | MachineInstr *Restore = |
| 109 | BuildMI(RESTORE, 3).addMReg(ZR).addSImm(0).addMReg(ZR); |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 110 | |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 111 | MachineCodeForInstruction &termMvec = |
| 112 | MachineCodeForInstruction::get(TermInst); |
| 113 | |
| 114 | // Remove the NOPs in the delay slots of the return instruction |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 115 | unsigned numNOPs = 0; |
| 116 | while (termMvec.back()->getOpCode() == NOP) |
| 117 | { |
Misha Brukman | 181ea4a | 2002-10-28 20:01:13 +0000 | [diff] [blame] | 118 | assert( termMvec.back() == MBB.back()); |
| 119 | delete MBB.pop_back(); |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 120 | termMvec.pop_back(); |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 121 | ++numNOPs; |
| 122 | } |
Misha Brukman | 181ea4a | 2002-10-28 20:01:13 +0000 | [diff] [blame] | 123 | assert(termMvec.back() == MBB.back()); |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 124 | |
| 125 | // Check that we found the right number of NOPs and have the right |
| 126 | // number of instructions to replace them. |
Chris Lattner | d2a67df | 2002-12-28 20:16:08 +0000 | [diff] [blame] | 127 | unsigned ndelays = MII.getNumDelaySlots(termMvec.back()->getOpCode()); |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 128 | 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 Brukman | 181ea4a | 2002-10-28 20:01:13 +0000 | [diff] [blame] | 132 | MBB.push_back(Restore); |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 133 | } |
| 134 | } |
| 135 | } |
| 136 | |
Vikram S. Adve | 36d3e03 | 2002-09-16 15:39:26 +0000 | [diff] [blame] | 137 | Pass* UltraSparc::getPrologEpilogInsertionPass() { |
Chris Lattner | d2a67df | 2002-12-28 20:16:08 +0000 | [diff] [blame] | 138 | return new InsertPrologEpilogCode(); |
Chris Lattner | 5074bb5 | 2002-04-09 05:18:31 +0000 | [diff] [blame] | 139 | } |