blob: 36cb869abda341951a9b31c4bd9a02c990b9820f [file] [log] [blame]
Nate Begeman21e463b2005-10-16 05:39:50 +00001//===- PPCRegisterInfo.cpp - PowerPC Register Information -------*- C++ -*-===//
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002//
Misha Brukmanf2ccb772004-08-17 04:55:41 +00003// The LLVM Compiler Infrastructure
4//
5// This file was developed by the LLVM research group and is distributed under
6// the University of Illinois Open Source License. See LICENSE.TXT for details.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00007//
Misha Brukmanf2ccb772004-08-17 04:55:41 +00008//===----------------------------------------------------------------------===//
9//
Nate Begeman21e463b2005-10-16 05:39:50 +000010// This file contains the PowerPC implementation of the MRegisterInfo class.
Misha Brukmanf2ccb772004-08-17 04:55:41 +000011//
12//===----------------------------------------------------------------------===//
13
14#define DEBUG_TYPE "reginfo"
Chris Lattner26689592005-10-14 23:51:18 +000015#include "PPC.h"
Chris Lattner26bd0d42005-10-14 23:45:43 +000016#include "PPCInstrBuilder.h"
Chris Lattner16e71f22005-10-14 23:59:06 +000017#include "PPCRegisterInfo.h"
Misha Brukmanf2ccb772004-08-17 04:55:41 +000018#include "llvm/Constants.h"
19#include "llvm/Type.h"
20#include "llvm/CodeGen/ValueTypes.h"
21#include "llvm/CodeGen/MachineInstrBuilder.h"
Jim Laskey41886992006-04-07 16:34:46 +000022#include "llvm/CodeGen/MachineDebugInfo.h"
Misha Brukmanf2ccb772004-08-17 04:55:41 +000023#include "llvm/CodeGen/MachineFunction.h"
24#include "llvm/CodeGen/MachineFrameInfo.h"
Jim Laskeyf1d78e82006-03-23 18:12:57 +000025#include "llvm/CodeGen/MachineLocation.h"
Jim Laskey41886992006-04-07 16:34:46 +000026#include "llvm/CodeGen/SelectionDAGNodes.h"
Misha Brukmanf2ccb772004-08-17 04:55:41 +000027#include "llvm/Target/TargetFrameInfo.h"
Chris Lattnerf9568d82006-04-17 21:48:13 +000028#include "llvm/Target/TargetInstrInfo.h"
Misha Brukmanf2ccb772004-08-17 04:55:41 +000029#include "llvm/Target/TargetMachine.h"
30#include "llvm/Target/TargetOptions.h"
Reid Spencer551ccae2004-09-01 22:55:40 +000031#include "llvm/Support/CommandLine.h"
32#include "llvm/Support/Debug.h"
Nate Begemanae232e72005-11-06 09:00:38 +000033#include "llvm/Support/MathExtras.h"
Reid Spencer551ccae2004-09-01 22:55:40 +000034#include "llvm/ADT/STLExtras.h"
Misha Brukmanf2ccb772004-08-17 04:55:41 +000035#include <cstdlib>
36#include <iostream>
37using namespace llvm;
38
Chris Lattner369503f2006-04-17 21:07:20 +000039/// getRegisterNumbering - Given the enum value for some register, e.g.
40/// PPC::F14, return the number that it corresponds to (e.g. 14).
41unsigned PPCRegisterInfo::getRegisterNumbering(unsigned RegEnum) {
42 switch (RegEnum) {
43 case PPC::R0 : case PPC::F0 : case PPC::V0 : case PPC::CR0: return 0;
44 case PPC::R1 : case PPC::F1 : case PPC::V1 : case PPC::CR1: return 1;
45 case PPC::R2 : case PPC::F2 : case PPC::V2 : case PPC::CR2: return 2;
46 case PPC::R3 : case PPC::F3 : case PPC::V3 : case PPC::CR3: return 3;
47 case PPC::R4 : case PPC::F4 : case PPC::V4 : case PPC::CR4: return 4;
48 case PPC::R5 : case PPC::F5 : case PPC::V5 : case PPC::CR5: return 5;
49 case PPC::R6 : case PPC::F6 : case PPC::V6 : case PPC::CR6: return 6;
50 case PPC::R7 : case PPC::F7 : case PPC::V7 : case PPC::CR7: return 7;
51 case PPC::R8 : case PPC::F8 : case PPC::V8 : return 8;
52 case PPC::R9 : case PPC::F9 : case PPC::V9 : return 9;
53 case PPC::R10: case PPC::F10: case PPC::V10: return 10;
54 case PPC::R11: case PPC::F11: case PPC::V11: return 11;
55 case PPC::R12: case PPC::F12: case PPC::V12: return 12;
56 case PPC::R13: case PPC::F13: case PPC::V13: return 13;
57 case PPC::R14: case PPC::F14: case PPC::V14: return 14;
58 case PPC::R15: case PPC::F15: case PPC::V15: return 15;
59 case PPC::R16: case PPC::F16: case PPC::V16: return 16;
60 case PPC::R17: case PPC::F17: case PPC::V17: return 17;
61 case PPC::R18: case PPC::F18: case PPC::V18: return 18;
62 case PPC::R19: case PPC::F19: case PPC::V19: return 19;
63 case PPC::R20: case PPC::F20: case PPC::V20: return 20;
64 case PPC::R21: case PPC::F21: case PPC::V21: return 21;
65 case PPC::R22: case PPC::F22: case PPC::V22: return 22;
66 case PPC::R23: case PPC::F23: case PPC::V23: return 23;
67 case PPC::R24: case PPC::F24: case PPC::V24: return 24;
68 case PPC::R25: case PPC::F25: case PPC::V25: return 25;
69 case PPC::R26: case PPC::F26: case PPC::V26: return 26;
70 case PPC::R27: case PPC::F27: case PPC::V27: return 27;
71 case PPC::R28: case PPC::F28: case PPC::V28: return 28;
72 case PPC::R29: case PPC::F29: case PPC::V29: return 29;
73 case PPC::R30: case PPC::F30: case PPC::V30: return 30;
74 case PPC::R31: case PPC::F31: case PPC::V31: return 31;
75 default:
76 std::cerr << "Unhandled reg in PPCRegisterInfo::getRegisterNumbering!\n";
77 abort();
78 }
79}
80
Nate Begeman21e463b2005-10-16 05:39:50 +000081PPCRegisterInfo::PPCRegisterInfo()
Chris Lattner4c7b43b2005-10-14 23:37:35 +000082 : PPCGenRegisterInfo(PPC::ADJCALLSTACKDOWN, PPC::ADJCALLSTACKUP) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +000083 ImmToIdxMap[PPC::LD] = PPC::LDX; ImmToIdxMap[PPC::STD] = PPC::STDX;
Misha Brukmanf2ccb772004-08-17 04:55:41 +000084 ImmToIdxMap[PPC::LBZ] = PPC::LBZX; ImmToIdxMap[PPC::STB] = PPC::STBX;
85 ImmToIdxMap[PPC::LHZ] = PPC::LHZX; ImmToIdxMap[PPC::LHA] = PPC::LHAX;
86 ImmToIdxMap[PPC::LWZ] = PPC::LWZX; ImmToIdxMap[PPC::LWA] = PPC::LWAX;
87 ImmToIdxMap[PPC::LFS] = PPC::LFSX; ImmToIdxMap[PPC::LFD] = PPC::LFDX;
88 ImmToIdxMap[PPC::STH] = PPC::STHX; ImmToIdxMap[PPC::STW] = PPC::STWX;
89 ImmToIdxMap[PPC::STFS] = PPC::STFSX; ImmToIdxMap[PPC::STFD] = PPC::STFDX;
Nate Begeman1d9d7422005-10-18 00:28:58 +000090 ImmToIdxMap[PPC::ADDI] = PPC::ADD4;
Misha Brukmanf2ccb772004-08-17 04:55:41 +000091}
92
Misha Brukmanb5f662f2005-04-21 23:30:14 +000093void
Nate Begeman21e463b2005-10-16 05:39:50 +000094PPCRegisterInfo::storeRegToStackSlot(MachineBasicBlock &MBB,
95 MachineBasicBlock::iterator MI,
96 unsigned SrcReg, int FrameIdx,
97 const TargetRegisterClass *RC) const {
Misha Brukmanf2ccb772004-08-17 04:55:41 +000098 if (SrcReg == PPC::LR) {
Chris Lattner9c09c9e2006-03-16 22:24:02 +000099 // FIXME: this spills LR immediately to memory in one step. To do this, we
100 // use R11, which we know cannot be used in the prolog/epilog. This is a
101 // hack.
Chris Lattner3f852b42005-08-18 23:24:50 +0000102 BuildMI(MBB, MI, PPC::MFLR, 1, PPC::R11);
Chris Lattner919c0322005-10-01 01:35:02 +0000103 addFrameReference(BuildMI(MBB, MI, PPC::STW, 3).addReg(PPC::R11), FrameIdx);
Nate Begeman1d9d7422005-10-18 00:28:58 +0000104 } else if (RC == PPC::CRRCRegisterClass) {
Chris Lattnere45aa732006-05-04 16:56:45 +0000105 BuildMI(MBB, MI, PPC::MFCR, 0, PPC::R11);
106 addFrameReference(BuildMI(MBB, MI, PPC::STW, 3).addReg(PPC::R11), FrameIdx);
Nate Begeman1d9d7422005-10-18 00:28:58 +0000107 } else if (RC == PPC::GPRCRegisterClass) {
Chris Lattner919c0322005-10-01 01:35:02 +0000108 addFrameReference(BuildMI(MBB, MI, PPC::STW, 3).addReg(SrcReg),FrameIdx);
Nate Begeman1d9d7422005-10-18 00:28:58 +0000109 } else if (RC == PPC::G8RCRegisterClass) {
110 addFrameReference(BuildMI(MBB, MI, PPC::STD, 3).addReg(SrcReg),FrameIdx);
111 } else if (RC == PPC::F8RCRegisterClass) {
Chris Lattner919c0322005-10-01 01:35:02 +0000112 addFrameReference(BuildMI(MBB, MI, PPC::STFD, 3).addReg(SrcReg),FrameIdx);
Nate Begeman1d9d7422005-10-18 00:28:58 +0000113 } else if (RC == PPC::F4RCRegisterClass) {
Chris Lattner919c0322005-10-01 01:35:02 +0000114 addFrameReference(BuildMI(MBB, MI, PPC::STFS, 3).addReg(SrcReg),FrameIdx);
Chris Lattner9c09c9e2006-03-16 22:24:02 +0000115 } else if (RC == PPC::VRRCRegisterClass) {
116 // We don't have indexed addressing for vector loads. Emit:
117 // R11 = ADDI FI#
118 // Dest = LVX R0, R11
119 //
120 // FIXME: We use R0 here, because it isn't available for RA.
Chris Lattnere45aa732006-05-04 16:56:45 +0000121 addFrameReference(BuildMI(MBB, MI, PPC::ADDI, 1, PPC::R0), FrameIdx, 0, 0);
Chris Lattner9c09c9e2006-03-16 22:24:02 +0000122 BuildMI(MBB, MI, PPC::STVX, 3)
123 .addReg(SrcReg).addReg(PPC::R0).addReg(PPC::R0);
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000124 } else {
Chris Lattner919c0322005-10-01 01:35:02 +0000125 assert(0 && "Unknown regclass!");
126 abort();
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000127 }
128}
129
130void
Nate Begeman21e463b2005-10-16 05:39:50 +0000131PPCRegisterInfo::loadRegFromStackSlot(MachineBasicBlock &MBB,
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000132 MachineBasicBlock::iterator MI,
Chris Lattnerb48d2cf2005-09-30 01:31:52 +0000133 unsigned DestReg, int FrameIdx,
134 const TargetRegisterClass *RC) const {
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000135 if (DestReg == PPC::LR) {
Chris Lattner919c0322005-10-01 01:35:02 +0000136 addFrameReference(BuildMI(MBB, MI, PPC::LWZ, 2, PPC::R11), FrameIdx);
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000137 BuildMI(MBB, MI, PPC::MTLR, 1).addReg(PPC::R11);
Nate Begeman1d9d7422005-10-18 00:28:58 +0000138 } else if (RC == PPC::CRRCRegisterClass) {
Chris Lattnere45aa732006-05-04 16:56:45 +0000139 addFrameReference(BuildMI(MBB, MI, PPC::LWZ, 2, PPC::R11), FrameIdx);
140 BuildMI(MBB, MI, PPC::MTCRF, 1, DestReg).addReg(PPC::R11);
Nate Begeman1d9d7422005-10-18 00:28:58 +0000141 } else if (RC == PPC::GPRCRegisterClass) {
Chris Lattner919c0322005-10-01 01:35:02 +0000142 addFrameReference(BuildMI(MBB, MI, PPC::LWZ, 2, DestReg), FrameIdx);
Nate Begeman1d9d7422005-10-18 00:28:58 +0000143 } else if (RC == PPC::G8RCRegisterClass) {
144 addFrameReference(BuildMI(MBB, MI, PPC::LD, 2, DestReg), FrameIdx);
145 } else if (RC == PPC::F8RCRegisterClass) {
Chris Lattner919c0322005-10-01 01:35:02 +0000146 addFrameReference(BuildMI(MBB, MI, PPC::LFD, 2, DestReg), FrameIdx);
Nate Begeman1d9d7422005-10-18 00:28:58 +0000147 } else if (RC == PPC::F4RCRegisterClass) {
Chris Lattner919c0322005-10-01 01:35:02 +0000148 addFrameReference(BuildMI(MBB, MI, PPC::LFS, 2, DestReg), FrameIdx);
Chris Lattner9c09c9e2006-03-16 22:24:02 +0000149 } else if (RC == PPC::VRRCRegisterClass) {
150 // We don't have indexed addressing for vector loads. Emit:
151 // R11 = ADDI FI#
152 // Dest = LVX R0, R11
153 //
154 // FIXME: We use R0 here, because it isn't available for RA.
Chris Lattnere45aa732006-05-04 16:56:45 +0000155 addFrameReference(BuildMI(MBB, MI, PPC::ADDI, 1, PPC::R0), FrameIdx, 0, 0);
Chris Lattner9c09c9e2006-03-16 22:24:02 +0000156 BuildMI(MBB, MI, PPC::LVX, 2, DestReg).addReg(PPC::R0).addReg(PPC::R0);
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000157 } else {
Chris Lattner919c0322005-10-01 01:35:02 +0000158 assert(0 && "Unknown regclass!");
159 abort();
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000160 }
161}
162
Nate Begeman21e463b2005-10-16 05:39:50 +0000163void PPCRegisterInfo::copyRegToReg(MachineBasicBlock &MBB,
164 MachineBasicBlock::iterator MI,
165 unsigned DestReg, unsigned SrcReg,
166 const TargetRegisterClass *RC) const {
Nate Begeman1d9d7422005-10-18 00:28:58 +0000167 if (RC == PPC::GPRCRegisterClass) {
168 BuildMI(MBB, MI, PPC::OR4, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
169 } else if (RC == PPC::G8RCRegisterClass) {
170 BuildMI(MBB, MI, PPC::OR8, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
171 } else if (RC == PPC::F4RCRegisterClass) {
Chris Lattner919c0322005-10-01 01:35:02 +0000172 BuildMI(MBB, MI, PPC::FMRS, 1, DestReg).addReg(SrcReg);
Nate Begeman1d9d7422005-10-18 00:28:58 +0000173 } else if (RC == PPC::F8RCRegisterClass) {
Chris Lattner919c0322005-10-01 01:35:02 +0000174 BuildMI(MBB, MI, PPC::FMRD, 1, DestReg).addReg(SrcReg);
Nate Begeman1d9d7422005-10-18 00:28:58 +0000175 } else if (RC == PPC::CRRCRegisterClass) {
Nate Begeman7af02482005-04-12 07:04:16 +0000176 BuildMI(MBB, MI, PPC::MCRF, 1, DestReg).addReg(SrcReg);
Chris Lattner335fd3c2006-03-16 20:03:58 +0000177 } else if (RC == PPC::VRRCRegisterClass) {
178 BuildMI(MBB, MI, PPC::VOR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Nate Begeman7af02482005-04-12 07:04:16 +0000179 } else {
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000180 std::cerr << "Attempt to copy register that is not GPR or FPR";
181 abort();
182 }
183}
184
Chris Lattnerf38df042005-09-09 21:46:49 +0000185/// foldMemoryOperand - PowerPC (like most RISC's) can only fold spills into
186/// copy instructions, turning them into load/store instructions.
Nate Begeman21e463b2005-10-16 05:39:50 +0000187MachineInstr *PPCRegisterInfo::foldMemoryOperand(MachineInstr *MI,
188 unsigned OpNum,
189 int FrameIndex) const {
Chris Lattnerf38df042005-09-09 21:46:49 +0000190 // Make sure this is a reg-reg copy. Note that we can't handle MCRF, because
191 // it takes more than one instruction to store it.
192 unsigned Opc = MI->getOpcode();
193
Nate Begeman1d9d7422005-10-18 00:28:58 +0000194 if ((Opc == PPC::OR4 &&
Chris Lattnerf38df042005-09-09 21:46:49 +0000195 MI->getOperand(1).getReg() == MI->getOperand(2).getReg())) {
196 if (OpNum == 0) { // move -> store
197 unsigned InReg = MI->getOperand(1).getReg();
198 return addFrameReference(BuildMI(PPC::STW,
199 3).addReg(InReg), FrameIndex);
Chris Lattnerc9fe7502005-09-09 21:59:44 +0000200 } else { // move -> load
Chris Lattnerf38df042005-09-09 21:46:49 +0000201 unsigned OutReg = MI->getOperand(0).getReg();
202 return addFrameReference(BuildMI(PPC::LWZ, 2, OutReg), FrameIndex);
203 }
Nate Begeman1d9d7422005-10-18 00:28:58 +0000204 } else if ((Opc == PPC::OR8 &&
205 MI->getOperand(1).getReg() == MI->getOperand(2).getReg())) {
206 if (OpNum == 0) { // move -> store
207 unsigned InReg = MI->getOperand(1).getReg();
208 return addFrameReference(BuildMI(PPC::STD,
209 3).addReg(InReg), FrameIndex);
210 } else { // move -> load
211 unsigned OutReg = MI->getOperand(0).getReg();
212 return addFrameReference(BuildMI(PPC::LD, 2, OutReg), FrameIndex);
213 }
Chris Lattner919c0322005-10-01 01:35:02 +0000214 } else if (Opc == PPC::FMRD) {
Chris Lattnerc9fe7502005-09-09 21:59:44 +0000215 if (OpNum == 0) { // move -> store
216 unsigned InReg = MI->getOperand(1).getReg();
217 return addFrameReference(BuildMI(PPC::STFD,
218 3).addReg(InReg), FrameIndex);
219 } else { // move -> load
220 unsigned OutReg = MI->getOperand(0).getReg();
221 return addFrameReference(BuildMI(PPC::LFD, 2, OutReg), FrameIndex);
222 }
Chris Lattner919c0322005-10-01 01:35:02 +0000223 } else if (Opc == PPC::FMRS) {
224 if (OpNum == 0) { // move -> store
225 unsigned InReg = MI->getOperand(1).getReg();
226 return addFrameReference(BuildMI(PPC::STFS,
227 3).addReg(InReg), FrameIndex);
228 } else { // move -> load
229 unsigned OutReg = MI->getOperand(0).getReg();
230 return addFrameReference(BuildMI(PPC::LFS, 2, OutReg), FrameIndex);
231 }
Chris Lattnerf38df042005-09-09 21:46:49 +0000232 }
233 return 0;
234}
235
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000236//===----------------------------------------------------------------------===//
237// Stack Frame Processing methods
238//===----------------------------------------------------------------------===//
239
240// hasFP - Return true if the specified function should have a dedicated frame
241// pointer register. This is true if the function has variable sized allocas or
242// if frame pointer elimination is disabled.
243//
Chris Lattner4f91a4c2006-04-03 22:03:29 +0000244static bool hasFP(const MachineFunction &MF) {
245 const MachineFrameInfo *MFI = MF.getFrameInfo();
246 unsigned TargetAlign = MF.getTarget().getFrameInfo()->getStackAlignment();
247
Nate Begeman030514c2006-04-11 19:29:21 +0000248 // If frame pointers are forced, or if there are variable sized stack objects,
249 // use a frame pointer.
Chris Lattner4f91a4c2006-04-03 22:03:29 +0000250 //
Nate Begeman030514c2006-04-11 19:29:21 +0000251 return NoFramePointerElim || MFI->hasVarSizedObjects();
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000252}
253
Nate Begeman21e463b2005-10-16 05:39:50 +0000254void PPCRegisterInfo::
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000255eliminateCallFramePseudoInstr(MachineFunction &MF, MachineBasicBlock &MBB,
256 MachineBasicBlock::iterator I) const {
257 if (hasFP(MF)) {
258 // If we have a frame pointer, convert as follows:
259 // ADJCALLSTACKDOWN -> addi, r1, r1, -amount
260 // ADJCALLSTACKUP -> addi, r1, r1, amount
261 MachineInstr *Old = I;
262 unsigned Amount = Old->getOperand(0).getImmedValue();
263 if (Amount != 0) {
264 // We need to keep the stack aligned properly. To do this, we round the
265 // amount of space needed for the outgoing arguments up to the next
266 // alignment boundary.
267 unsigned Align = MF.getTarget().getFrameInfo()->getStackAlignment();
268 Amount = (Amount+Align-1)/Align*Align;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000269
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000270 // Replace the pseudo instruction with a new instruction...
271 if (Old->getOpcode() == PPC::ADJCALLSTACKDOWN) {
Chris Lattner63b3d712006-05-04 17:21:20 +0000272 BuildMI(MBB, I, PPC::ADDI, 2, PPC::R1).addReg(PPC::R1).addImm(-Amount);
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000273 } else {
274 assert(Old->getOpcode() == PPC::ADJCALLSTACKUP);
Chris Lattner63b3d712006-05-04 17:21:20 +0000275 BuildMI(MBB, I, PPC::ADDI, 2, PPC::R1).addReg(PPC::R1).addImm(Amount);
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000276 }
277 }
278 }
279 MBB.erase(I);
280}
281
282void
Nate Begeman21e463b2005-10-16 05:39:50 +0000283PPCRegisterInfo::eliminateFrameIndex(MachineBasicBlock::iterator II) const {
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000284 unsigned i = 0;
285 MachineInstr &MI = *II;
286 MachineBasicBlock &MBB = *MI.getParent();
287 MachineFunction &MF = *MBB.getParent();
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000288
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000289 while (!MI.getOperand(i).isFrameIndex()) {
290 ++i;
291 assert(i < MI.getNumOperands() && "Instr doesn't have FrameIndex operand!");
292 }
293
294 int FrameIndex = MI.getOperand(i).getFrameIndex();
295
296 // Replace the FrameIndex with base register with GPR1 (SP) or GPR31 (FP).
Chris Lattnere53f4a02006-05-04 17:52:23 +0000297 MI.getOperand(i).ChangeToRegister(hasFP(MF) ? PPC::R31 : PPC::R1);
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000298
299 // Take into account whether it's an add or mem instruction
300 unsigned OffIdx = (i == 2) ? 1 : 2;
301
302 // Now add the frame object offset to the offset from r1.
303 int Offset = MF.getFrameInfo()->getObjectOffset(FrameIndex) +
304 MI.getOperand(OffIdx).getImmedValue();
305
306 // If we're not using a Frame Pointer that has been set to the value of the
307 // SP before having the stack size subtracted from it, then add the stack size
308 // to Offset to get the correct offset.
309 Offset += MF.getFrameInfo()->getStackSize();
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000310
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000311 if (Offset > 32767 || Offset < -32768) {
312 // Insert a set of r0 with the full offset value before the ld, st, or add
313 MachineBasicBlock *MBB = MI.getParent();
Chris Lattner63b3d712006-05-04 17:21:20 +0000314 BuildMI(*MBB, II, PPC::LIS, 1, PPC::R0).addImm(Offset >> 16);
Chris Lattnerc6d48d32006-01-11 23:07:57 +0000315 BuildMI(*MBB, II, PPC::ORI, 2, PPC::R0).addReg(PPC::R0).addImm(Offset);
316
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000317 // convert into indexed form of the instruction
318 // sth 0:rA, 1:imm 2:(rB) ==> sthx 0:rA, 2:rB, 1:r0
319 // addi 0:rA 1:rB, 2, imm ==> add 0:rA, 1:rB, 2:r0
Chris Lattner14630192005-09-09 20:51:08 +0000320 assert(ImmToIdxMap.count(MI.getOpcode()) &&
321 "No indexed form of load or store available!");
322 unsigned NewOpcode = ImmToIdxMap.find(MI.getOpcode())->second;
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000323 MI.setOpcode(NewOpcode);
Chris Lattnere53f4a02006-05-04 17:52:23 +0000324 MI.getOperand(1).ChangeToRegister(MI.getOperand(i).getReg());
325 MI.getOperand(2).ChangeToRegister(PPC::R0);
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000326 } else {
Chris Lattner841d12d2005-10-18 16:51:22 +0000327 switch (MI.getOpcode()) {
328 case PPC::LWA:
329 case PPC::LD:
330 case PPC::STD:
Chris Lattnerecfe55e2006-03-22 05:30:33 +0000331 case PPC::STD_32:
Chris Lattner841d12d2005-10-18 16:51:22 +0000332 assert((Offset & 3) == 0 && "Invalid frame offset!");
333 Offset >>= 2; // The actual encoded value has the low two bits zero.
334 break;
335 }
Chris Lattnere53f4a02006-05-04 17:52:23 +0000336 MI.getOperand(OffIdx).ChangeToImmediate(Offset);
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000337 }
338}
339
Chris Lattnerf7d23722006-04-17 20:59:25 +0000340/// VRRegNo - Map from a numbered VR register to its enum value.
341///
342static const unsigned short VRRegNo[] = {
343 PPC::V0 , PPC::V1 , PPC::V2 , PPC::V3 , PPC::V4 , PPC::V5 , PPC::V6 , PPC::V7 ,
344 PPC::V8 , PPC::V9 , PPC::V10, PPC::V11, PPC::V12, PPC::V13, PPC::V14, PPC::V15,
345 PPC::V16, PPC::V17, PPC::V18, PPC::V19, PPC::V20, PPC::V21, PPC::V22, PPC::V23,
346 PPC::V24, PPC::V25, PPC::V26, PPC::V27, PPC::V28, PPC::V29, PPC::V30, PPC::V31
347};
348
Chris Lattnerf9568d82006-04-17 21:48:13 +0000349/// RemoveVRSaveCode - We have found that this function does not need any code
350/// to manipulate the VRSAVE register, even though it uses vector registers.
351/// This can happen when the only registers used are known to be live in or out
352/// of the function. Remove all of the VRSAVE related code from the function.
353static void RemoveVRSaveCode(MachineInstr *MI) {
354 MachineBasicBlock *Entry = MI->getParent();
355 MachineFunction *MF = Entry->getParent();
356
357 // We know that the MTVRSAVE instruction immediately follows MI. Remove it.
358 MachineBasicBlock::iterator MBBI = MI;
359 ++MBBI;
360 assert(MBBI != Entry->end() && MBBI->getOpcode() == PPC::MTVRSAVE);
361 MBBI->eraseFromParent();
362
363 bool RemovedAllMTVRSAVEs = true;
364 // See if we can find and remove the MTVRSAVE instruction from all of the
365 // epilog blocks.
366 const TargetInstrInfo &TII = *MF->getTarget().getInstrInfo();
367 for (MachineFunction::iterator I = MF->begin(), E = MF->end(); I != E; ++I) {
368 // If last instruction is a return instruction, add an epilogue
369 if (!I->empty() && TII.isReturn(I->back().getOpcode())) {
370 bool FoundIt = false;
371 for (MBBI = I->end(); MBBI != I->begin(); ) {
372 --MBBI;
373 if (MBBI->getOpcode() == PPC::MTVRSAVE) {
374 MBBI->eraseFromParent(); // remove it.
375 FoundIt = true;
376 break;
377 }
378 }
379 RemovedAllMTVRSAVEs &= FoundIt;
380 }
381 }
382
383 // If we found and removed all MTVRSAVE instructions, remove the read of
384 // VRSAVE as well.
385 if (RemovedAllMTVRSAVEs) {
386 MBBI = MI;
387 assert(MBBI != Entry->begin() && "UPDATE_VRSAVE is first instr in block?");
388 --MBBI;
389 assert(MBBI->getOpcode() == PPC::MFVRSAVE && "VRSAVE instrs wandered?");
390 MBBI->eraseFromParent();
391 }
392
393 // Finally, nuke the UPDATE_VRSAVE.
394 MI->eraseFromParent();
395}
396
Chris Lattner1877ec92006-03-13 21:52:10 +0000397// HandleVRSaveUpdate - MI is the UPDATE_VRSAVE instruction introduced by the
398// instruction selector. Based on the vector registers that have been used,
399// transform this into the appropriate ORI instruction.
400static void HandleVRSaveUpdate(MachineInstr *MI, const bool *UsedRegs) {
401 unsigned UsedRegMask = 0;
Chris Lattnerf7d23722006-04-17 20:59:25 +0000402 for (unsigned i = 0; i != 32; ++i)
403 if (UsedRegs[VRRegNo[i]])
404 UsedRegMask |= 1 << (31-i);
405
Chris Lattner402504b2006-04-17 21:22:06 +0000406 // Live in and live out values already must be in the mask, so don't bother
407 // marking them.
408 MachineFunction *MF = MI->getParent()->getParent();
409 for (MachineFunction::livein_iterator I =
410 MF->livein_begin(), E = MF->livein_end(); I != E; ++I) {
411 unsigned RegNo = PPCRegisterInfo::getRegisterNumbering(I->first);
412 if (VRRegNo[RegNo] == I->first) // If this really is a vector reg.
413 UsedRegMask &= ~(1 << (31-RegNo)); // Doesn't need to be marked.
414 }
415 for (MachineFunction::liveout_iterator I =
416 MF->liveout_begin(), E = MF->liveout_end(); I != E; ++I) {
417 unsigned RegNo = PPCRegisterInfo::getRegisterNumbering(*I);
418 if (VRRegNo[RegNo] == *I) // If this really is a vector reg.
419 UsedRegMask &= ~(1 << (31-RegNo)); // Doesn't need to be marked.
420 }
421
Chris Lattner1877ec92006-03-13 21:52:10 +0000422 unsigned SrcReg = MI->getOperand(1).getReg();
423 unsigned DstReg = MI->getOperand(0).getReg();
424 // If no registers are used, turn this into a copy.
425 if (UsedRegMask == 0) {
Chris Lattnerf9568d82006-04-17 21:48:13 +0000426 // Remove all VRSAVE code.
427 RemoveVRSaveCode(MI);
428 return;
Chris Lattner1877ec92006-03-13 21:52:10 +0000429 } else if ((UsedRegMask & 0xFFFF) == UsedRegMask) {
430 BuildMI(*MI->getParent(), MI, PPC::ORI, 2, DstReg)
431 .addReg(SrcReg).addImm(UsedRegMask);
432 } else if ((UsedRegMask & 0xFFFF0000) == UsedRegMask) {
433 BuildMI(*MI->getParent(), MI, PPC::ORIS, 2, DstReg)
434 .addReg(SrcReg).addImm(UsedRegMask >> 16);
435 } else {
436 BuildMI(*MI->getParent(), MI, PPC::ORIS, 2, DstReg)
437 .addReg(SrcReg).addImm(UsedRegMask >> 16);
438 BuildMI(*MI->getParent(), MI, PPC::ORI, 2, DstReg)
439 .addReg(DstReg).addImm(UsedRegMask & 0xFFFF);
440 }
441
442 // Remove the old UPDATE_VRSAVE instruction.
Chris Lattnerf9568d82006-04-17 21:48:13 +0000443 MI->eraseFromParent();
Chris Lattner1877ec92006-03-13 21:52:10 +0000444}
445
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000446
Nate Begeman21e463b2005-10-16 05:39:50 +0000447void PPCRegisterInfo::emitPrologue(MachineFunction &MF) const {
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000448 MachineBasicBlock &MBB = MF.front(); // Prolog goes in entry BB
449 MachineBasicBlock::iterator MBBI = MBB.begin();
450 MachineFrameInfo *MFI = MF.getFrameInfo();
Jim Laskey41886992006-04-07 16:34:46 +0000451 MachineDebugInfo *DebugInfo = MFI->getMachineDebugInfo();
Chris Lattner4f91a4c2006-04-03 22:03:29 +0000452
453 // Do we have a frame pointer for this function?
454 bool HasFP = hasFP(MF);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000455
Chris Lattner4f91a4c2006-04-03 22:03:29 +0000456 // Scan the prolog, looking for an UPDATE_VRSAVE instruction. If we find it,
457 // process it.
Chris Lattner8aa777d2006-03-16 21:31:45 +0000458 for (unsigned i = 0; MBBI != MBB.end(); ++i, ++MBBI) {
Chris Lattner1877ec92006-03-13 21:52:10 +0000459 if (MBBI->getOpcode() == PPC::UPDATE_VRSAVE) {
460 HandleVRSaveUpdate(MBBI, MF.getUsedPhysregs());
461 break;
462 }
463 }
464
465 // Move MBBI back to the beginning of the function.
466 MBBI = MBB.begin();
467
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000468 // Get the number of bytes to allocate from the FrameInfo
469 unsigned NumBytes = MFI->getStackSize();
Nate Begemanae232e72005-11-06 09:00:38 +0000470
471 // Get the alignments provided by the target, and the maximum alignment
472 // (if any) of the fixed frame objects.
473 unsigned TargetAlign = MF.getTarget().getFrameInfo()->getStackAlignment();
474 unsigned MaxAlign = MFI->getMaxAlignment();
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000475
476 // If we have calls, we cannot use the red zone to store callee save registers
477 // and we must set up a stack frame, so calculate the necessary size here.
478 if (MFI->hasCalls()) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000479 // We reserve argument space for call sites in the function immediately on
480 // entry to the current function. This eliminates the need for add/sub
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000481 // brackets around call sites.
482 NumBytes += MFI->getMaxCallFrameSize();
483 }
484
Jeff Cohend29b6aa2005-07-30 18:33:25 +0000485 // If we are a leaf function, and use up to 224 bytes of stack space,
Nate Begeman54eed362005-07-27 06:06:29 +0000486 // and don't have a frame pointer, then we do not need to adjust the stack
487 // pointer (we fit in the Red Zone).
Chris Lattner4f91a4c2006-04-03 22:03:29 +0000488 if ((NumBytes == 0) || (NumBytes <= 224 && !HasFP && !MFI->hasCalls() &&
Nate Begemanae232e72005-11-06 09:00:38 +0000489 MaxAlign <= TargetAlign)) {
Nate Begeman54eed362005-07-27 06:06:29 +0000490 MFI->setStackSize(0);
491 return;
492 }
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000493
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000494 // Add the size of R1 to NumBytes size for the store of R1 to the bottom
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000495 // of the stack and round the size to a multiple of the alignment.
Nate Begemanae232e72005-11-06 09:00:38 +0000496 unsigned Align = std::max(TargetAlign, MaxAlign);
Chris Lattner5802be12005-09-30 17:16:59 +0000497 unsigned GPRSize = 4;
Chris Lattner4f91a4c2006-04-03 22:03:29 +0000498 unsigned Size = HasFP ? GPRSize + GPRSize : GPRSize;
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000499 NumBytes = (NumBytes+Size+Align-1)/Align*Align;
500
501 // Update frame info to pretend that this is part of the stack...
502 MFI->setStackSize(NumBytes);
Jim Laskey41886992006-04-07 16:34:46 +0000503 int NegNumbytes = -NumBytes;
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000504
Nate Begeman3dee1752005-07-27 23:11:27 +0000505 // Adjust stack pointer: r1 -= numbytes.
Nate Begeman030514c2006-04-11 19:29:21 +0000506 // If there is a preferred stack alignment, align R1 now
507 if (MaxAlign > TargetAlign) {
508 assert(isPowerOf2_32(MaxAlign) && MaxAlign < 32767 && "Invalid alignment!");
Nate Begeman21862982006-04-11 19:44:43 +0000509 assert(isInt16(MaxAlign-NumBytes) && "Unhandled stack size and alignment!");
Nate Begeman030514c2006-04-11 19:29:21 +0000510 BuildMI(MBB, MBBI, PPC::RLWINM, 4, PPC::R0)
511 .addReg(PPC::R1).addImm(0).addImm(32-Log2_32(MaxAlign)).addImm(31);
Nate Begeman21862982006-04-11 19:44:43 +0000512 BuildMI(MBB, MBBI, PPC::SUBFIC,2,PPC::R0).addReg(PPC::R0)
Chris Lattner63b3d712006-05-04 17:21:20 +0000513 .addImm(MaxAlign-NumBytes);
Nate Begeman030514c2006-04-11 19:29:21 +0000514 BuildMI(MBB, MBBI, PPC::STWUX, 3)
515 .addReg(PPC::R1).addReg(PPC::R1).addReg(PPC::R0);
516 } else if (NumBytes <= 32768) {
Chris Lattner63b3d712006-05-04 17:21:20 +0000517 BuildMI(MBB, MBBI, PPC::STWU, 3).addReg(PPC::R1).addImm(NegNumbytes)
Nate Begeman030514c2006-04-11 19:29:21 +0000518 .addReg(PPC::R1);
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000519 } else {
Chris Lattner63b3d712006-05-04 17:21:20 +0000520 BuildMI(MBB, MBBI, PPC::LIS, 1, PPC::R0).addImm(NegNumbytes >> 16);
Nate Begeman030514c2006-04-11 19:29:21 +0000521 BuildMI(MBB, MBBI, PPC::ORI, 2, PPC::R0).addReg(PPC::R0)
522 .addImm(NegNumbytes & 0xFFFF);
523 BuildMI(MBB, MBBI, PPC::STWUX, 3).addReg(PPC::R1).addReg(PPC::R1)
524 .addReg(PPC::R0);
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000525 }
Nate Begemanae232e72005-11-06 09:00:38 +0000526
Jim Laskey52fa2442006-04-11 08:11:53 +0000527 if (DebugInfo && DebugInfo->hasInfo()) {
Jim Laskey41886992006-04-07 16:34:46 +0000528 std::vector<MachineMove *> &Moves = DebugInfo->getFrameMoves();
529 unsigned LabelID = DebugInfo->NextLabelID();
530
531 // Show update of SP.
532 MachineLocation Dst(MachineLocation::VirtualFP);
533 MachineLocation Src(MachineLocation::VirtualFP, NegNumbytes);
534 Moves.push_back(new MachineMove(LabelID, Dst, Src));
535
Chris Lattner63b3d712006-05-04 17:21:20 +0000536 BuildMI(MBB, MBBI, PPC::DWARF_LABEL, 1).addImm(LabelID);
Jim Laskey41886992006-04-07 16:34:46 +0000537 }
538
Nate Begemanae232e72005-11-06 09:00:38 +0000539 // If there is a frame pointer, copy R1 (SP) into R31 (FP)
Chris Lattner4f91a4c2006-04-03 22:03:29 +0000540 if (HasFP) {
Chris Lattnerc6d48d32006-01-11 23:07:57 +0000541 BuildMI(MBB, MBBI, PPC::STW, 3)
Chris Lattner63b3d712006-05-04 17:21:20 +0000542 .addReg(PPC::R31).addImm(GPRSize).addReg(PPC::R1);
Chris Lattnerc6d48d32006-01-11 23:07:57 +0000543 BuildMI(MBB, MBBI, PPC::OR4, 2, PPC::R31).addReg(PPC::R1).addReg(PPC::R1);
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000544 }
545}
546
Nate Begeman21e463b2005-10-16 05:39:50 +0000547void PPCRegisterInfo::emitEpilogue(MachineFunction &MF,
548 MachineBasicBlock &MBB) const {
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000549 MachineBasicBlock::iterator MBBI = prior(MBB.end());
Evan Cheng6da8d992006-01-09 18:28:21 +0000550 assert(MBBI->getOpcode() == PPC::BLR &&
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000551 "Can only insert epilog into returning blocks");
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000552
Nate Begeman030514c2006-04-11 19:29:21 +0000553 // Get alignment info so we know how to restore r1
554 const MachineFrameInfo *MFI = MF.getFrameInfo();
555 unsigned TargetAlign = MF.getTarget().getFrameInfo()->getStackAlignment();
556
Chris Lattner64da1722006-01-11 23:03:54 +0000557 // Get the number of bytes allocated from the FrameInfo.
Nate Begeman030514c2006-04-11 19:29:21 +0000558 unsigned NumBytes = MFI->getStackSize();
Chris Lattner64da1722006-01-11 23:03:54 +0000559 unsigned GPRSize = 4;
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000560
561 if (NumBytes != 0) {
Chris Lattner64da1722006-01-11 23:03:54 +0000562 // If this function has a frame pointer, load the saved stack pointer from
563 // its stack slot.
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000564 if (hasFP(MF)) {
Chris Lattner64da1722006-01-11 23:03:54 +0000565 BuildMI(MBB, MBBI, PPC::LWZ, 2, PPC::R31)
Chris Lattner63b3d712006-05-04 17:21:20 +0000566 .addImm(GPRSize).addReg(PPC::R31);
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000567 }
Chris Lattner64da1722006-01-11 23:03:54 +0000568
569 // The loaded (or persistent) stack pointer value is offseted by the 'stwu'
570 // on entry to the function. Add this offset back now.
Nate Begeman030514c2006-04-11 19:29:21 +0000571 if (NumBytes < 32768 && TargetAlign >= MFI->getMaxAlignment()) {
Chris Lattner64da1722006-01-11 23:03:54 +0000572 BuildMI(MBB, MBBI, PPC::ADDI, 2, PPC::R1)
Chris Lattner63b3d712006-05-04 17:21:20 +0000573 .addReg(PPC::R1).addImm(NumBytes);
Chris Lattner64da1722006-01-11 23:03:54 +0000574 } else {
Chris Lattner63b3d712006-05-04 17:21:20 +0000575 BuildMI(MBB, MBBI, PPC::LWZ, 2, PPC::R1).addImm(0).addReg(PPC::R1);
Chris Lattner64da1722006-01-11 23:03:54 +0000576 }
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000577 }
578}
579
Jim Laskey41886992006-04-07 16:34:46 +0000580unsigned PPCRegisterInfo::getRARegister() const {
581 return PPC::LR;
582}
583
Jim Laskeya9979182006-03-28 13:48:33 +0000584unsigned PPCRegisterInfo::getFrameRegister(MachineFunction &MF) const {
Jim Laskey41886992006-04-07 16:34:46 +0000585 return hasFP(MF) ? PPC::R31 : PPC::R1;
586}
587
588void PPCRegisterInfo::getInitialFrameState(std::vector<MachineMove *> &Moves)
589 const {
590 // Initial state is the frame pointer is R1.
591 MachineLocation Dst(MachineLocation::VirtualFP);
592 MachineLocation Src(PPC::R1, 0);
593 Moves.push_back(new MachineMove(0, Dst, Src));
Jim Laskeyf1d78e82006-03-23 18:12:57 +0000594}
595
Chris Lattner4c7b43b2005-10-14 23:37:35 +0000596#include "PPCGenRegisterInfo.inc"
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000597