blob: 3281313617dafdc5fa3c18b705f0f1e5b84e8381 [file] [log] [blame]
Nate Begemana9795f82005-03-24 04:41:43 +00001//===-- PPC32ISelPattern.cpp - A pattern matching inst selector for PPC32 -===//
2//
3// The LLVM Compiler Infrastructure
4//
Nate Begeman5e966612005-03-24 06:28:42 +00005// This file was developed by Nate Begeman and is distributed under
Nate Begemana9795f82005-03-24 04:41:43 +00006// the University of Illinois Open Source License. See LICENSE.TXT for details.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00007//
Nate Begemana9795f82005-03-24 04:41:43 +00008//===----------------------------------------------------------------------===//
9//
10// This file defines a pattern matching instruction selector for 32 bit PowerPC.
Nate Begeman815d6da2005-04-06 00:25:27 +000011// Magic number generation for integer divide from the PowerPC Compiler Writer's
12// Guide, section 3.2.3.5
Nate Begemana9795f82005-03-24 04:41:43 +000013//
14//===----------------------------------------------------------------------===//
15
16#include "PowerPC.h"
17#include "PowerPCInstrBuilder.h"
18#include "PowerPCInstrInfo.h"
Nate Begemancd08e4c2005-04-09 20:09:12 +000019#include "PPC32TargetMachine.h"
Nate Begemana9795f82005-03-24 04:41:43 +000020#include "llvm/Constants.h" // FIXME: REMOVE
21#include "llvm/Function.h"
22#include "llvm/CodeGen/MachineConstantPool.h" // FIXME: REMOVE
23#include "llvm/CodeGen/MachineFunction.h"
24#include "llvm/CodeGen/MachineFrameInfo.h"
25#include "llvm/CodeGen/SelectionDAG.h"
26#include "llvm/CodeGen/SelectionDAGISel.h"
27#include "llvm/CodeGen/SSARegMap.h"
28#include "llvm/Target/TargetData.h"
29#include "llvm/Target/TargetLowering.h"
Nate Begeman93075ec2005-04-04 23:40:36 +000030#include "llvm/Target/TargetOptions.h"
Nate Begemana9795f82005-03-24 04:41:43 +000031#include "llvm/Support/Debug.h"
32#include "llvm/Support/MathExtras.h"
33#include "llvm/ADT/Statistic.h"
34#include <set>
35#include <algorithm>
36using namespace llvm;
37
38//===----------------------------------------------------------------------===//
39// PPC32TargetLowering - PPC32 Implementation of the TargetLowering interface
40namespace {
41 class PPC32TargetLowering : public TargetLowering {
42 int VarArgsFrameIndex; // FrameIndex for start of varargs area.
43 int ReturnAddrIndex; // FrameIndex for return slot.
44 public:
45 PPC32TargetLowering(TargetMachine &TM) : TargetLowering(TM) {
Chris Lattner9bce0f92005-05-12 02:06:00 +000046 // Fold away setcc operations if possible.
47 setSetCCIsExpensive();
48
Nate Begemana9795f82005-03-24 04:41:43 +000049 // Set up the register classes.
50 addRegisterClass(MVT::i32, PPC32::GPRCRegisterClass);
Nate Begeman7532e2f2005-03-26 08:25:22 +000051 addRegisterClass(MVT::f32, PPC32::FPRCRegisterClass);
Nate Begemana9795f82005-03-24 04:41:43 +000052 addRegisterClass(MVT::f64, PPC32::FPRCRegisterClass);
Misha Brukmanb5f662f2005-04-21 23:30:14 +000053
Nate Begeman74d73452005-03-31 00:15:26 +000054 // PowerPC has no intrinsics for these particular operations
Nate Begeman01d05262005-03-30 01:45:43 +000055 setOperationAction(ISD::MEMMOVE, MVT::Other, Expand);
56 setOperationAction(ISD::MEMSET, MVT::Other, Expand);
57 setOperationAction(ISD::MEMCPY, MVT::Other, Expand);
58
Nate Begeman74d73452005-03-31 00:15:26 +000059 // PowerPC has an i16 but no i8 (or i1) SEXTLOAD
60 setOperationAction(ISD::SEXTLOAD, MVT::i1, Expand);
61 setOperationAction(ISD::SEXTLOAD, MVT::i8, Expand);
Misha Brukmanb5f662f2005-04-21 23:30:14 +000062
Nate Begeman815d6da2005-04-06 00:25:27 +000063 // PowerPC has no SREM/UREM instructions
64 setOperationAction(ISD::SREM, MVT::i32, Expand);
65 setOperationAction(ISD::UREM, MVT::i32, Expand);
Chris Lattner43fdea02005-04-02 05:03:24 +000066
Chris Lattner17234b72005-04-30 04:26:06 +000067 // We don't support sin/cos/sqrt
68 setOperationAction(ISD::FSIN , MVT::f64, Expand);
69 setOperationAction(ISD::FCOS , MVT::f64, Expand);
70 setOperationAction(ISD::FSQRT, MVT::f64, Expand);
71 setOperationAction(ISD::FSIN , MVT::f32, Expand);
72 setOperationAction(ISD::FCOS , MVT::f32, Expand);
73 setOperationAction(ISD::FSQRT, MVT::f32, Expand);
74
Nate Begemand7c4a4a2005-05-11 23:43:56 +000075 //PowerPC does not have CTPOP or CTTZ
Andrew Lenharth691ef2b2005-05-03 17:19:30 +000076 setOperationAction(ISD::CTPOP, MVT::i32 , Expand);
77 setOperationAction(ISD::CTTZ , MVT::i32 , Expand);
Andrew Lenharth691ef2b2005-05-03 17:19:30 +000078
Chris Lattnercbd06fc2005-04-07 19:41:49 +000079 setSetCCResultContents(ZeroOrOneSetCCResult);
Nate Begeman3e897162005-03-31 23:55:40 +000080 addLegalFPImmediate(+0.0); // Necessary for FSEL
Misha Brukmanb5f662f2005-04-21 23:30:14 +000081 addLegalFPImmediate(-0.0); //
Nate Begeman3e897162005-03-31 23:55:40 +000082
Nate Begemana9795f82005-03-24 04:41:43 +000083 computeRegisterProperties();
84 }
85
86 /// LowerArguments - This hook must be implemented to indicate how we should
87 /// lower the arguments for the specified function, into the specified DAG.
88 virtual std::vector<SDOperand>
89 LowerArguments(Function &F, SelectionDAG &DAG);
Misha Brukmanb5f662f2005-04-21 23:30:14 +000090
Nate Begemana9795f82005-03-24 04:41:43 +000091 /// LowerCallTo - This hook lowers an abstract call to a function into an
92 /// actual call.
93 virtual std::pair<SDOperand, SDOperand>
Nate Begeman307e7442005-03-26 01:28:53 +000094 LowerCallTo(SDOperand Chain, const Type *RetTy, bool isVarArg,
95 SDOperand Callee, ArgListTy &Args, SelectionDAG &DAG);
Misha Brukmanb5f662f2005-04-21 23:30:14 +000096
Nate Begemana9795f82005-03-24 04:41:43 +000097 virtual std::pair<SDOperand, SDOperand>
98 LowerVAStart(SDOperand Chain, SelectionDAG &DAG);
Misha Brukmanb5f662f2005-04-21 23:30:14 +000099
Nate Begemana9795f82005-03-24 04:41:43 +0000100 virtual std::pair<SDOperand,SDOperand>
101 LowerVAArgNext(bool isVANext, SDOperand Chain, SDOperand VAList,
102 const Type *ArgTy, SelectionDAG &DAG);
103
104 virtual std::pair<SDOperand, SDOperand>
105 LowerFrameReturnAddress(bool isFrameAddr, SDOperand Chain, unsigned Depth,
106 SelectionDAG &DAG);
107 };
108}
109
110
111std::vector<SDOperand>
112PPC32TargetLowering::LowerArguments(Function &F, SelectionDAG &DAG) {
113 //
114 // add beautiful description of PPC stack frame format, or at least some docs
115 //
116 MachineFunction &MF = DAG.getMachineFunction();
117 MachineFrameInfo *MFI = MF.getFrameInfo();
118 MachineBasicBlock& BB = MF.front();
119 std::vector<SDOperand> ArgValues;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000120
121 // Due to the rather complicated nature of the PowerPC ABI, rather than a
Nate Begemana9795f82005-03-24 04:41:43 +0000122 // fixed size array of physical args, for the sake of simplicity let the STL
123 // handle tracking them for us.
124 std::vector<unsigned> argVR, argPR, argOp;
125 unsigned ArgOffset = 24;
126 unsigned GPR_remaining = 8;
127 unsigned FPR_remaining = 13;
128 unsigned GPR_idx = 0, FPR_idx = 0;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000129 static const unsigned GPR[] = {
Nate Begemana9795f82005-03-24 04:41:43 +0000130 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
131 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
132 };
133 static const unsigned FPR[] = {
134 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
135 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
136 };
137
138 // Add DAG nodes to load the arguments... On entry to a function on PPC,
139 // the arguments start at offset 24, although they are likely to be passed
140 // in registers.
141 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; ++I) {
142 SDOperand newroot, argt;
143 unsigned ObjSize;
144 bool needsLoad = false;
Nate Begemancd08e4c2005-04-09 20:09:12 +0000145 bool ArgLive = !I->use_empty();
Nate Begemana9795f82005-03-24 04:41:43 +0000146 MVT::ValueType ObjectVT = getValueType(I->getType());
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000147
Nate Begemana9795f82005-03-24 04:41:43 +0000148 switch (ObjectVT) {
149 default: assert(0 && "Unhandled argument type!");
150 case MVT::i1:
151 case MVT::i8:
152 case MVT::i16:
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000153 case MVT::i32:
Nate Begemana9795f82005-03-24 04:41:43 +0000154 ObjSize = 4;
Nate Begemancd08e4c2005-04-09 20:09:12 +0000155 if (!ArgLive) break;
Nate Begemana9795f82005-03-24 04:41:43 +0000156 if (GPR_remaining > 0) {
Nate Begemancd08e4c2005-04-09 20:09:12 +0000157 MF.addLiveIn(GPR[GPR_idx]);
Nate Begemanf70b5762005-03-28 23:08:54 +0000158 argt = newroot = DAG.getCopyFromReg(GPR[GPR_idx], MVT::i32,
159 DAG.getRoot());
Nate Begemana9795f82005-03-24 04:41:43 +0000160 if (ObjectVT != MVT::i32)
161 argt = DAG.getNode(ISD::TRUNCATE, ObjectVT, newroot);
Nate Begemana9795f82005-03-24 04:41:43 +0000162 } else {
163 needsLoad = true;
164 }
165 break;
Nate Begemanf7e43382005-03-26 07:46:36 +0000166 case MVT::i64: ObjSize = 8;
Nate Begemancd08e4c2005-04-09 20:09:12 +0000167 if (!ArgLive) break;
Nate Begemanc5b1cd22005-04-10 05:53:14 +0000168 if (GPR_remaining > 0) {
169 SDOperand argHi, argLo;
Nate Begemancd08e4c2005-04-09 20:09:12 +0000170 MF.addLiveIn(GPR[GPR_idx]);
Nate Begemanc5b1cd22005-04-10 05:53:14 +0000171 argHi = DAG.getCopyFromReg(GPR[GPR_idx], MVT::i32, DAG.getRoot());
172 // If we have two or more remaining argument registers, then both halves
173 // of the i64 can be sourced from there. Otherwise, the lower half will
174 // have to come off the stack. This can happen when an i64 is preceded
175 // by 28 bytes of arguments.
176 if (GPR_remaining > 1) {
177 MF.addLiveIn(GPR[GPR_idx+1]);
178 argLo = DAG.getCopyFromReg(GPR[GPR_idx+1], MVT::i32, argHi);
179 } else {
180 int FI = MFI->CreateFixedObject(4, ArgOffset+4);
181 SDOperand FIN = DAG.getFrameIndex(FI, MVT::i32);
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000182 argLo = DAG.getLoad(MVT::i32, DAG.getEntryNode(), FIN, DAG.getSrcValue(NULL));
Nate Begemanc5b1cd22005-04-10 05:53:14 +0000183 }
Nate Begemanca12a2b2005-03-28 22:28:37 +0000184 // Build the outgoing arg thingy
Nate Begemanf70b5762005-03-28 23:08:54 +0000185 argt = DAG.getNode(ISD::BUILD_PAIR, MVT::i64, argLo, argHi);
186 newroot = argLo;
Nate Begemana9795f82005-03-24 04:41:43 +0000187 } else {
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000188 needsLoad = true;
Nate Begemana9795f82005-03-24 04:41:43 +0000189 }
190 break;
Nate Begemancd08e4c2005-04-09 20:09:12 +0000191 case MVT::f32:
192 case MVT::f64:
193 ObjSize = (ObjectVT == MVT::f64) ? 8 : 4;
194 if (!ArgLive) break;
Nate Begemana9795f82005-03-24 04:41:43 +0000195 if (FPR_remaining > 0) {
Nate Begemancd08e4c2005-04-09 20:09:12 +0000196 MF.addLiveIn(FPR[FPR_idx]);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000197 argt = newroot = DAG.getCopyFromReg(FPR[FPR_idx], ObjectVT,
Nate Begemanf70b5762005-03-28 23:08:54 +0000198 DAG.getRoot());
Nate Begemana9795f82005-03-24 04:41:43 +0000199 --FPR_remaining;
200 ++FPR_idx;
201 } else {
202 needsLoad = true;
203 }
204 break;
205 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000206
Nate Begemana9795f82005-03-24 04:41:43 +0000207 // We need to load the argument to a virtual register if we determined above
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000208 // that we ran out of physical registers of the appropriate type
Nate Begemana9795f82005-03-24 04:41:43 +0000209 if (needsLoad) {
Nate Begemane5846682005-04-04 06:52:38 +0000210 unsigned SubregOffset = 0;
Nate Begemanc3e2db42005-04-04 09:09:00 +0000211 if (ObjectVT == MVT::i8 || ObjectVT == MVT::i1) SubregOffset = 3;
Nate Begemane5846682005-04-04 06:52:38 +0000212 if (ObjectVT == MVT::i16) SubregOffset = 2;
Nate Begemana9795f82005-03-24 04:41:43 +0000213 int FI = MFI->CreateFixedObject(ObjSize, ArgOffset);
214 SDOperand FIN = DAG.getFrameIndex(FI, MVT::i32);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000215 FIN = DAG.getNode(ISD::ADD, MVT::i32, FIN,
Nate Begemane5846682005-04-04 06:52:38 +0000216 DAG.getConstant(SubregOffset, MVT::i32));
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000217 argt = newroot = DAG.getLoad(ObjectVT, DAG.getEntryNode(), FIN, DAG.getSrcValue(NULL));
Nate Begemana9795f82005-03-24 04:41:43 +0000218 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000219
Nate Begemana9795f82005-03-24 04:41:43 +0000220 // Every 4 bytes of argument space consumes one of the GPRs available for
221 // argument passing.
222 if (GPR_remaining > 0) {
223 unsigned delta = (GPR_remaining > 1 && ObjSize == 8) ? 2 : 1;
224 GPR_remaining -= delta;
225 GPR_idx += delta;
226 }
227 ArgOffset += ObjSize;
Chris Lattner91277ea2005-04-09 21:23:24 +0000228 if (newroot.Val)
229 DAG.setRoot(newroot.getValue(1));
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000230
Nate Begemana9795f82005-03-24 04:41:43 +0000231 ArgValues.push_back(argt);
232 }
233
Nate Begemana9795f82005-03-24 04:41:43 +0000234 // If the function takes variable number of arguments, make a frame index for
235 // the start of the first vararg value... for expansion of llvm.va_start.
Nate Begemanfa554702005-04-03 22:13:27 +0000236 if (F.isVarArg()) {
Nate Begemana9795f82005-03-24 04:41:43 +0000237 VarArgsFrameIndex = MFI->CreateFixedObject(4, ArgOffset);
Nate Begemanfa554702005-04-03 22:13:27 +0000238 SDOperand FIN = DAG.getFrameIndex(VarArgsFrameIndex, MVT::i32);
Nate Begeman6644d4c2005-04-03 23:11:17 +0000239 // If this function is vararg, store any remaining integer argument regs
240 // to their spots on the stack so that they may be loaded by deferencing the
241 // result of va_next.
242 std::vector<SDOperand> MemOps;
243 for (; GPR_remaining > 0; --GPR_remaining, ++GPR_idx) {
Nate Begemancd08e4c2005-04-09 20:09:12 +0000244 MF.addLiveIn(GPR[GPR_idx]);
Nate Begeman6644d4c2005-04-03 23:11:17 +0000245 SDOperand Val = DAG.getCopyFromReg(GPR[GPR_idx], MVT::i32, DAG.getRoot());
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000246 SDOperand Store = DAG.getNode(ISD::STORE, MVT::Other, Val.getValue(1),
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000247 Val, FIN, DAG.getSrcValue(NULL));
Nate Begeman6644d4c2005-04-03 23:11:17 +0000248 MemOps.push_back(Store);
249 // Increment the address by four for the next argument to store
250 SDOperand PtrOff = DAG.getConstant(4, getPointerTy());
251 FIN = DAG.getNode(ISD::ADD, MVT::i32, FIN, PtrOff);
252 }
253 DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, MemOps));
Nate Begemanfa554702005-04-03 22:13:27 +0000254 }
Nate Begemana9795f82005-03-24 04:41:43 +0000255
Nate Begemancd08e4c2005-04-09 20:09:12 +0000256 // Finally, inform the code generator which regs we return values in.
257 switch (getValueType(F.getReturnType())) {
258 default: assert(0 && "Unknown type!");
259 case MVT::isVoid: break;
260 case MVT::i1:
261 case MVT::i8:
262 case MVT::i16:
263 case MVT::i32:
264 MF.addLiveOut(PPC::R3);
265 break;
266 case MVT::i64:
267 MF.addLiveOut(PPC::R3);
268 MF.addLiveOut(PPC::R4);
269 break;
270 case MVT::f32:
271 case MVT::f64:
272 MF.addLiveOut(PPC::F1);
273 break;
274 }
275
Nate Begemana9795f82005-03-24 04:41:43 +0000276 return ArgValues;
277}
278
279std::pair<SDOperand, SDOperand>
280PPC32TargetLowering::LowerCallTo(SDOperand Chain,
Misha Brukman7847fca2005-04-22 17:54:37 +0000281 const Type *RetTy, bool isVarArg,
282 SDOperand Callee, ArgListTy &Args,
283 SelectionDAG &DAG) {
Nate Begeman307e7442005-03-26 01:28:53 +0000284 // args_to_use will accumulate outgoing args for the ISD::CALL case in
285 // SelectExpr to use to put the arguments in the appropriate registers.
Nate Begemana9795f82005-03-24 04:41:43 +0000286 std::vector<SDOperand> args_to_use;
Nate Begeman307e7442005-03-26 01:28:53 +0000287
288 // Count how many bytes are to be pushed on the stack, including the linkage
289 // area, and parameter passing area.
290 unsigned NumBytes = 24;
291
292 if (Args.empty()) {
Nate Begemana7e11a42005-04-01 05:57:17 +0000293 Chain = DAG.getNode(ISD::ADJCALLSTACKDOWN, MVT::Other, Chain,
294 DAG.getConstant(NumBytes, getPointerTy()));
Nate Begeman307e7442005-03-26 01:28:53 +0000295 } else {
296 for (unsigned i = 0, e = Args.size(); i != e; ++i)
297 switch (getValueType(Args[i].second)) {
298 default: assert(0 && "Unknown value type!");
299 case MVT::i1:
300 case MVT::i8:
301 case MVT::i16:
302 case MVT::i32:
303 case MVT::f32:
304 NumBytes += 4;
305 break;
306 case MVT::i64:
307 case MVT::f64:
308 NumBytes += 8;
309 break;
310 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000311
312 // Just to be safe, we'll always reserve the full 24 bytes of linkage area
Nate Begeman307e7442005-03-26 01:28:53 +0000313 // plus 32 bytes of argument space in case any called code gets funky on us.
314 if (NumBytes < 56) NumBytes = 56;
315
316 // Adjust the stack pointer for the new arguments...
317 // These operations are automatically eliminated by the prolog/epilog pass
318 Chain = DAG.getNode(ISD::ADJCALLSTACKDOWN, MVT::Other, Chain,
319 DAG.getConstant(NumBytes, getPointerTy()));
320
321 // Set up a copy of the stack pointer for use loading and storing any
322 // arguments that may not fit in the registers available for argument
323 // passing.
324 SDOperand StackPtr = DAG.getCopyFromReg(PPC::R1, MVT::i32,
325 DAG.getEntryNode());
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000326
Nate Begeman307e7442005-03-26 01:28:53 +0000327 // Figure out which arguments are going to go in registers, and which in
328 // memory. Also, if this is a vararg function, floating point operations
329 // must be stored to our stack, and loaded into integer regs as well, if
330 // any integer regs are available for argument passing.
331 unsigned ArgOffset = 24;
332 unsigned GPR_remaining = 8;
333 unsigned FPR_remaining = 13;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000334
Nate Begeman74d73452005-03-31 00:15:26 +0000335 std::vector<SDOperand> MemOps;
Nate Begeman307e7442005-03-26 01:28:53 +0000336 for (unsigned i = 0, e = Args.size(); i != e; ++i) {
337 // PtrOff will be used to store the current argument to the stack if a
338 // register cannot be found for it.
339 SDOperand PtrOff = DAG.getConstant(ArgOffset, getPointerTy());
340 PtrOff = DAG.getNode(ISD::ADD, MVT::i32, StackPtr, PtrOff);
Nate Begemanf7e43382005-03-26 07:46:36 +0000341 MVT::ValueType ArgVT = getValueType(Args[i].second);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000342
Nate Begemanf7e43382005-03-26 07:46:36 +0000343 switch (ArgVT) {
Nate Begeman307e7442005-03-26 01:28:53 +0000344 default: assert(0 && "Unexpected ValueType for argument!");
345 case MVT::i1:
346 case MVT::i8:
347 case MVT::i16:
348 // Promote the integer to 32 bits. If the input type is signed use a
349 // sign extend, otherwise use a zero extend.
350 if (Args[i].second->isSigned())
351 Args[i].first =DAG.getNode(ISD::SIGN_EXTEND, MVT::i32, Args[i].first);
352 else
353 Args[i].first =DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, Args[i].first);
354 // FALL THROUGH
355 case MVT::i32:
356 if (GPR_remaining > 0) {
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000357 args_to_use.push_back(Args[i].first);
Nate Begeman307e7442005-03-26 01:28:53 +0000358 --GPR_remaining;
359 } else {
Nate Begeman74d73452005-03-31 00:15:26 +0000360 MemOps.push_back(DAG.getNode(ISD::STORE, MVT::Other, Chain,
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000361 Args[i].first, PtrOff, DAG.getSrcValue(NULL)));
Nate Begeman307e7442005-03-26 01:28:53 +0000362 }
363 ArgOffset += 4;
364 break;
365 case MVT::i64:
Nate Begemanf7e43382005-03-26 07:46:36 +0000366 // If we have one free GPR left, we can place the upper half of the i64
367 // in it, and store the other half to the stack. If we have two or more
368 // free GPRs, then we can pass both halves of the i64 in registers.
369 if (GPR_remaining > 0) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000370 SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, MVT::i32,
Nate Begemanf2622612005-03-26 02:17:46 +0000371 Args[i].first, DAG.getConstant(1, MVT::i32));
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000372 SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, MVT::i32,
Nate Begemanf2622612005-03-26 02:17:46 +0000373 Args[i].first, DAG.getConstant(0, MVT::i32));
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000374 args_to_use.push_back(Hi);
Nate Begeman74d73452005-03-31 00:15:26 +0000375 --GPR_remaining;
Nate Begeman74d73452005-03-31 00:15:26 +0000376 if (GPR_remaining > 0) {
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000377 args_to_use.push_back(Lo);
Nate Begeman74d73452005-03-31 00:15:26 +0000378 --GPR_remaining;
Nate Begemanf7e43382005-03-26 07:46:36 +0000379 } else {
380 SDOperand ConstFour = DAG.getConstant(4, getPointerTy());
381 PtrOff = DAG.getNode(ISD::ADD, MVT::i32, PtrOff, ConstFour);
Nate Begeman74d73452005-03-31 00:15:26 +0000382 MemOps.push_back(DAG.getNode(ISD::STORE, MVT::Other, Chain,
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000383 Lo, PtrOff, DAG.getSrcValue(NULL)));
Nate Begemanf7e43382005-03-26 07:46:36 +0000384 }
Nate Begeman307e7442005-03-26 01:28:53 +0000385 } else {
Nate Begeman74d73452005-03-31 00:15:26 +0000386 MemOps.push_back(DAG.getNode(ISD::STORE, MVT::Other, Chain,
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000387 Args[i].first, PtrOff, DAG.getSrcValue(NULL)));
Nate Begeman307e7442005-03-26 01:28:53 +0000388 }
389 ArgOffset += 8;
390 break;
391 case MVT::f32:
Nate Begeman307e7442005-03-26 01:28:53 +0000392 case MVT::f64:
Nate Begemanf7e43382005-03-26 07:46:36 +0000393 if (FPR_remaining > 0) {
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000394 args_to_use.push_back(Args[i].first);
395 --FPR_remaining;
Nate Begemanf7e43382005-03-26 07:46:36 +0000396 if (isVarArg) {
Nate Begeman96fc6812005-03-31 02:05:53 +0000397 SDOperand Store = DAG.getNode(ISD::STORE, MVT::Other, Chain,
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000398 Args[i].first, PtrOff, DAG.getSrcValue(NULL));
Nate Begeman96fc6812005-03-31 02:05:53 +0000399 MemOps.push_back(Store);
Nate Begeman74d73452005-03-31 00:15:26 +0000400 // Float varargs are always shadowed in available integer registers
401 if (GPR_remaining > 0) {
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000402 SDOperand Load = DAG.getLoad(MVT::i32, Store, PtrOff, DAG.getSrcValue(NULL));
Nate Begeman74d73452005-03-31 00:15:26 +0000403 MemOps.push_back(Load);
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000404 args_to_use.push_back(Load);
405 --GPR_remaining;
Nate Begeman74d73452005-03-31 00:15:26 +0000406 }
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000407 if (GPR_remaining > 0 && MVT::f64 == ArgVT) {
Nate Begeman74d73452005-03-31 00:15:26 +0000408 SDOperand ConstFour = DAG.getConstant(4, getPointerTy());
409 PtrOff = DAG.getNode(ISD::ADD, MVT::i32, PtrOff, ConstFour);
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000410 SDOperand Load = DAG.getLoad(MVT::i32, Store, PtrOff, DAG.getSrcValue(NULL));
Nate Begeman74d73452005-03-31 00:15:26 +0000411 MemOps.push_back(Load);
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000412 args_to_use.push_back(Load);
413 --GPR_remaining;
Nate Begeman74d73452005-03-31 00:15:26 +0000414 }
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000415 } else {
416 // If we have any FPRs remaining, we may also have GPRs remaining.
417 // Args passed in FPRs consume either 1 (f32) or 2 (f64) available
418 // GPRs.
419 if (GPR_remaining > 0) {
420 args_to_use.push_back(DAG.getNode(ISD::UNDEF, MVT::i32));
421 --GPR_remaining;
422 }
423 if (GPR_remaining > 0 && MVT::f64 == ArgVT) {
424 args_to_use.push_back(DAG.getNode(ISD::UNDEF, MVT::i32));
425 --GPR_remaining;
426 }
Nate Begeman74d73452005-03-31 00:15:26 +0000427 }
Nate Begeman307e7442005-03-26 01:28:53 +0000428 } else {
Nate Begeman74d73452005-03-31 00:15:26 +0000429 MemOps.push_back(DAG.getNode(ISD::STORE, MVT::Other, Chain,
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000430 Args[i].first, PtrOff, DAG.getSrcValue(NULL)));
Nate Begeman307e7442005-03-26 01:28:53 +0000431 }
Nate Begemanf7e43382005-03-26 07:46:36 +0000432 ArgOffset += (ArgVT == MVT::f32) ? 4 : 8;
Nate Begeman307e7442005-03-26 01:28:53 +0000433 break;
434 }
Nate Begemana9795f82005-03-24 04:41:43 +0000435 }
Nate Begeman74d73452005-03-31 00:15:26 +0000436 if (!MemOps.empty())
437 Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, MemOps);
Nate Begemana9795f82005-03-24 04:41:43 +0000438 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000439
Nate Begemana9795f82005-03-24 04:41:43 +0000440 std::vector<MVT::ValueType> RetVals;
441 MVT::ValueType RetTyVT = getValueType(RetTy);
442 if (RetTyVT != MVT::isVoid)
443 RetVals.push_back(RetTyVT);
444 RetVals.push_back(MVT::Other);
445
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000446 SDOperand TheCall = SDOperand(DAG.getCall(RetVals,
Nate Begemana9795f82005-03-24 04:41:43 +0000447 Chain, Callee, args_to_use), 0);
448 Chain = TheCall.getValue(RetTyVT != MVT::isVoid);
449 Chain = DAG.getNode(ISD::ADJCALLSTACKUP, MVT::Other, Chain,
450 DAG.getConstant(NumBytes, getPointerTy()));
451 return std::make_pair(TheCall, Chain);
452}
453
454std::pair<SDOperand, SDOperand>
455PPC32TargetLowering::LowerVAStart(SDOperand Chain, SelectionDAG &DAG) {
456 //vastart just returns the address of the VarArgsFrameIndex slot.
457 return std::make_pair(DAG.getFrameIndex(VarArgsFrameIndex, MVT::i32), Chain);
458}
459
460std::pair<SDOperand,SDOperand> PPC32TargetLowering::
461LowerVAArgNext(bool isVANext, SDOperand Chain, SDOperand VAList,
462 const Type *ArgTy, SelectionDAG &DAG) {
Nate Begemanc7b09f12005-03-25 08:34:25 +0000463 MVT::ValueType ArgVT = getValueType(ArgTy);
464 SDOperand Result;
465 if (!isVANext) {
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000466 Result = DAG.getLoad(ArgVT, DAG.getEntryNode(), VAList, DAG.getSrcValue(NULL));
Nate Begemanc7b09f12005-03-25 08:34:25 +0000467 } else {
468 unsigned Amt;
469 if (ArgVT == MVT::i32 || ArgVT == MVT::f32)
470 Amt = 4;
471 else {
472 assert((ArgVT == MVT::i64 || ArgVT == MVT::f64) &&
473 "Other types should have been promoted for varargs!");
474 Amt = 8;
475 }
476 Result = DAG.getNode(ISD::ADD, VAList.getValueType(), VAList,
477 DAG.getConstant(Amt, VAList.getValueType()));
478 }
479 return std::make_pair(Result, Chain);
Nate Begemana9795f82005-03-24 04:41:43 +0000480}
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000481
Nate Begemana9795f82005-03-24 04:41:43 +0000482
483std::pair<SDOperand, SDOperand> PPC32TargetLowering::
484LowerFrameReturnAddress(bool isFrameAddress, SDOperand Chain, unsigned Depth,
485 SelectionDAG &DAG) {
Nate Begeman01d05262005-03-30 01:45:43 +0000486 assert(0 && "LowerFrameReturnAddress unimplemented");
Nate Begemana9795f82005-03-24 04:41:43 +0000487 abort();
488}
489
490namespace {
Nate Begemanc7bd4822005-04-11 06:34:10 +0000491Statistic<>Recorded("ppc-codegen", "Number of recording ops emitted");
Nate Begeman93075ec2005-04-04 23:40:36 +0000492Statistic<>FusedFP("ppc-codegen", "Number of fused fp operations");
Nate Begeman7bfba7d2005-04-14 09:45:08 +0000493Statistic<>MultiBranch("ppc-codegen", "Number of setcc logical ops collapsed");
Nate Begemana9795f82005-03-24 04:41:43 +0000494//===--------------------------------------------------------------------===//
495/// ISel - PPC32 specific code to select PPC32 machine instructions for
496/// SelectionDAG operations.
497//===--------------------------------------------------------------------===//
498class ISel : public SelectionDAGISel {
Nate Begemana9795f82005-03-24 04:41:43 +0000499 PPC32TargetLowering PPC32Lowering;
Nate Begeman815d6da2005-04-06 00:25:27 +0000500 SelectionDAG *ISelDAG; // Hack to support us having a dag->dag transform
501 // for sdiv and udiv until it is put into the future
502 // dag combiner.
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000503
Nate Begemana9795f82005-03-24 04:41:43 +0000504 /// ExprMap - As shared expressions are codegen'd, we keep track of which
505 /// vreg the value is produced in, so we only emit one copy of each compiled
506 /// tree.
507 std::map<SDOperand, unsigned> ExprMap;
Nate Begemanc7b09f12005-03-25 08:34:25 +0000508
509 unsigned GlobalBaseReg;
510 bool GlobalBaseInitialized;
Nate Begemanc7bd4822005-04-11 06:34:10 +0000511 bool RecordSuccess;
Nate Begemana9795f82005-03-24 04:41:43 +0000512public:
Nate Begeman815d6da2005-04-06 00:25:27 +0000513 ISel(TargetMachine &TM) : SelectionDAGISel(PPC32Lowering), PPC32Lowering(TM),
514 ISelDAG(0) {}
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000515
Nate Begemanc7b09f12005-03-25 08:34:25 +0000516 /// runOnFunction - Override this function in order to reset our per-function
517 /// variables.
518 virtual bool runOnFunction(Function &Fn) {
519 // Make sure we re-emit a set of the global base reg if necessary
520 GlobalBaseInitialized = false;
521 return SelectionDAGISel::runOnFunction(Fn);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000522 }
523
Nate Begemana9795f82005-03-24 04:41:43 +0000524 /// InstructionSelectBasicBlock - This callback is invoked by
525 /// SelectionDAGISel when it has created a SelectionDAG for us to codegen.
526 virtual void InstructionSelectBasicBlock(SelectionDAG &DAG) {
527 DEBUG(BB->dump());
528 // Codegen the basic block.
Nate Begeman815d6da2005-04-06 00:25:27 +0000529 ISelDAG = &DAG;
Nate Begemana9795f82005-03-24 04:41:43 +0000530 Select(DAG.getRoot());
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000531
Nate Begemana9795f82005-03-24 04:41:43 +0000532 // Clear state used for selection.
533 ExprMap.clear();
Nate Begeman815d6da2005-04-06 00:25:27 +0000534 ISelDAG = 0;
Nate Begemana9795f82005-03-24 04:41:43 +0000535 }
Nate Begeman815d6da2005-04-06 00:25:27 +0000536
537 // dag -> dag expanders for integer divide by constant
538 SDOperand BuildSDIVSequence(SDOperand N);
539 SDOperand BuildUDIVSequence(SDOperand N);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000540
Nate Begemandffcfcc2005-04-01 00:32:34 +0000541 unsigned getGlobalBaseReg();
Nate Begeman6b559972005-04-01 02:59:27 +0000542 unsigned getConstDouble(double floatVal, unsigned Result);
Nate Begeman1cbf3ab2005-04-18 07:48:09 +0000543 void MoveCRtoGPR(unsigned CCReg, bool Inv, unsigned Idx, unsigned Result);
Nate Begeman7ddecb42005-04-06 23:51:40 +0000544 bool SelectBitfieldInsert(SDOperand OR, unsigned Result);
Nate Begeman3664cef2005-04-13 22:14:14 +0000545 unsigned FoldIfWideZeroExtend(SDOperand N);
Nate Begeman1cbf3ab2005-04-18 07:48:09 +0000546 unsigned SelectCC(SDOperand CC, unsigned &Opc, bool &Inv, unsigned &Idx);
547 unsigned SelectCCExpr(SDOperand N, unsigned& Opc, bool &Inv, unsigned &Idx);
Nate Begemanc7bd4822005-04-11 06:34:10 +0000548 unsigned SelectExpr(SDOperand N, bool Recording=false);
Nate Begemana9795f82005-03-24 04:41:43 +0000549 unsigned SelectExprFP(SDOperand N, unsigned Result);
550 void Select(SDOperand N);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000551
Nate Begeman04730362005-04-01 04:45:11 +0000552 bool SelectAddr(SDOperand N, unsigned& Reg, int& offset);
Nate Begemana9795f82005-03-24 04:41:43 +0000553 void SelectBranchCC(SDOperand N);
554};
555
Nate Begeman80196b12005-04-05 00:15:08 +0000556/// ExactLog2 - This function solves for (Val == 1 << (N-1)) and returns N. It
557/// returns zero when the input is not exactly a power of two.
558static unsigned ExactLog2(unsigned Val) {
559 if (Val == 0 || (Val & (Val-1))) return 0;
560 unsigned Count = 0;
561 while (Val != 1) {
562 Val >>= 1;
563 ++Count;
564 }
565 return Count;
566}
567
Nate Begeman7ddecb42005-04-06 23:51:40 +0000568// IsRunOfOnes - returns true if Val consists of one contiguous run of 1's with
569// any number of 0's on either side. the 1's are allowed to wrap from LSB to
570// MSB. so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is
571// not, since all 1's are not contiguous.
572static bool IsRunOfOnes(unsigned Val, unsigned &MB, unsigned &ME) {
573 bool isRun = true;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000574 MB = 0;
Nate Begeman7ddecb42005-04-06 23:51:40 +0000575 ME = 0;
576
577 // look for first set bit
578 int i = 0;
579 for (; i < 32; i++) {
580 if ((Val & (1 << (31 - i))) != 0) {
581 MB = i;
582 ME = i;
583 break;
584 }
585 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000586
Nate Begeman7ddecb42005-04-06 23:51:40 +0000587 // look for last set bit
588 for (; i < 32; i++) {
589 if ((Val & (1 << (31 - i))) == 0)
590 break;
591 ME = i;
592 }
593
594 // look for next set bit
595 for (; i < 32; i++) {
596 if ((Val & (1 << (31 - i))) != 0)
597 break;
598 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000599
Nate Begeman7ddecb42005-04-06 23:51:40 +0000600 // if we exhausted all the bits, we found a match at this point for 0*1*0*
601 if (i == 32)
602 return true;
603
604 // since we just encountered more 1's, if it doesn't wrap around to the
605 // most significant bit of the word, then we did not find a match to 1*0*1* so
606 // exit.
607 if (MB != 0)
608 return false;
609
610 // look for last set bit
611 for (MB = i; i < 32; i++) {
612 if ((Val & (1 << (31 - i))) == 0)
613 break;
614 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000615
Nate Begeman7ddecb42005-04-06 23:51:40 +0000616 // if we exhausted all the bits, then we found a match for 1*0*1*, otherwise,
617 // the value is not a run of ones.
618 if (i == 32)
619 return true;
620 return false;
621}
622
Nate Begeman439b4442005-04-05 04:22:58 +0000623/// getImmediateForOpcode - This method returns a value indicating whether
Nate Begemana9795f82005-03-24 04:41:43 +0000624/// the ConstantSDNode N can be used as an immediate to Opcode. The return
625/// values are either 0, 1 or 2. 0 indicates that either N is not a
Nate Begeman9f833d32005-04-12 00:10:02 +0000626/// ConstantSDNode, or is not suitable for use by that opcode.
627/// Return value codes for turning into an enum someday:
628/// 1: constant may be used in normal immediate form.
629/// 2: constant may be used in shifted immediate form.
630/// 3: log base 2 of the constant may be used.
631/// 4: constant is suitable for integer division conversion
632/// 5: constant is a bitfield mask
Nate Begemana9795f82005-03-24 04:41:43 +0000633///
Nate Begeman439b4442005-04-05 04:22:58 +0000634static unsigned getImmediateForOpcode(SDOperand N, unsigned Opcode,
635 unsigned& Imm, bool U = false) {
Nate Begemana9795f82005-03-24 04:41:43 +0000636 if (N.getOpcode() != ISD::Constant) return 0;
637
638 int v = (int)cast<ConstantSDNode>(N)->getSignExtended();
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000639
Nate Begemana9795f82005-03-24 04:41:43 +0000640 switch(Opcode) {
641 default: return 0;
642 case ISD::ADD:
643 if (v <= 32767 && v >= -32768) { Imm = v & 0xFFFF; return 1; }
644 if ((v & 0x0000FFFF) == 0) { Imm = v >> 16; return 2; }
645 break;
Nate Begeman9f833d32005-04-12 00:10:02 +0000646 case ISD::AND: {
647 unsigned MB, ME;
648 if (IsRunOfOnes(v, MB, ME)) { Imm = MB << 16 | ME & 0xFFFF; return 5; }
649 if (v >= 0 && v <= 65535) { Imm = v & 0xFFFF; return 1; }
650 if ((v & 0x0000FFFF) == 0) { Imm = v >> 16; return 2; }
651 break;
652 }
Nate Begemana9795f82005-03-24 04:41:43 +0000653 case ISD::XOR:
654 case ISD::OR:
655 if (v >= 0 && v <= 65535) { Imm = v & 0xFFFF; return 1; }
656 if ((v & 0x0000FFFF) == 0) { Imm = v >> 16; return 2; }
657 break;
Nate Begeman307e7442005-03-26 01:28:53 +0000658 case ISD::MUL:
659 if (v <= 32767 && v >= -32768) { Imm = v & 0xFFFF; return 1; }
660 break;
Nate Begemand7c4a4a2005-05-11 23:43:56 +0000661 case ISD::SUB:
662 // handle subtract-from separately from subtract, since subi is really addi
663 if (U && v <= 32767 && v >= -32768) { Imm = v & 0xFFFF; return 1; }
664 if (!U && v <= 32768 && v >= -32767) { Imm = (-v) & 0xFFFF; return 1; }
665 break;
Nate Begeman3e897162005-03-31 23:55:40 +0000666 case ISD::SETCC:
667 if (U && (v >= 0 && v <= 65535)) { Imm = v & 0xFFFF; return 1; }
668 if (!U && (v <= 32767 && v >= -32768)) { Imm = v & 0xFFFF; return 1; }
669 break;
Nate Begeman80196b12005-04-05 00:15:08 +0000670 case ISD::SDIV:
Nate Begeman439b4442005-04-05 04:22:58 +0000671 if ((Imm = ExactLog2(v))) { return 3; }
Nate Begeman9f833d32005-04-12 00:10:02 +0000672 if ((Imm = ExactLog2(-v))) { Imm = -Imm; return 3; }
Nate Begeman815d6da2005-04-06 00:25:27 +0000673 if (v <= -2 || v >= 2) { return 4; }
674 break;
675 case ISD::UDIV:
Nate Begeman27b4c232005-04-06 06:44:57 +0000676 if (v > 1) { return 4; }
Nate Begeman80196b12005-04-05 00:15:08 +0000677 break;
Nate Begemana9795f82005-03-24 04:41:43 +0000678 }
679 return 0;
680}
Nate Begeman3e897162005-03-31 23:55:40 +0000681
Nate Begemanc7bd4822005-04-11 06:34:10 +0000682/// NodeHasRecordingVariant - If SelectExpr can always produce code for
683/// NodeOpcode that also sets CR0 as a side effect, return true. Otherwise,
684/// return false.
685static bool NodeHasRecordingVariant(unsigned NodeOpcode) {
686 switch(NodeOpcode) {
687 default: return false;
688 case ISD::AND:
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000689 case ISD::OR:
Chris Lattner519f40b2005-04-13 02:46:17 +0000690 return true;
Nate Begemanc7bd4822005-04-11 06:34:10 +0000691 }
692}
693
Nate Begeman3e897162005-03-31 23:55:40 +0000694/// getBCCForSetCC - Returns the PowerPC condition branch mnemonic corresponding
695/// to Condition. If the Condition is unordered or unsigned, the bool argument
696/// U is set to true, otherwise it is set to false.
697static unsigned getBCCForSetCC(unsigned Condition, bool& U) {
698 U = false;
699 switch (Condition) {
700 default: assert(0 && "Unknown condition!"); abort();
701 case ISD::SETEQ: return PPC::BEQ;
702 case ISD::SETNE: return PPC::BNE;
703 case ISD::SETULT: U = true;
704 case ISD::SETLT: return PPC::BLT;
705 case ISD::SETULE: U = true;
706 case ISD::SETLE: return PPC::BLE;
707 case ISD::SETUGT: U = true;
708 case ISD::SETGT: return PPC::BGT;
709 case ISD::SETUGE: U = true;
710 case ISD::SETGE: return PPC::BGE;
711 }
Nate Begeman04730362005-04-01 04:45:11 +0000712 return 0;
713}
714
Nate Begeman7bfba7d2005-04-14 09:45:08 +0000715/// getCROpForOp - Return the condition register opcode (or inverted opcode)
716/// associated with the SelectionDAG opcode.
717static unsigned getCROpForSetCC(unsigned Opcode, bool Inv1, bool Inv2) {
718 switch (Opcode) {
719 default: assert(0 && "Unknown opcode!"); abort();
720 case ISD::AND:
721 if (Inv1 && Inv2) return PPC::CRNOR; // De Morgan's Law
722 if (!Inv1 && !Inv2) return PPC::CRAND;
723 if (Inv1 ^ Inv2) return PPC::CRANDC;
724 case ISD::OR:
725 if (Inv1 && Inv2) return PPC::CRNAND; // De Morgan's Law
726 if (!Inv1 && !Inv2) return PPC::CROR;
727 if (Inv1 ^ Inv2) return PPC::CRORC;
728 }
729 return 0;
730}
731
732/// getCRIdxForSetCC - Return the index of the condition register field
733/// associated with the SetCC condition, and whether or not the field is
734/// treated as inverted. That is, lt = 0; ge = 0 inverted.
735static unsigned getCRIdxForSetCC(unsigned Condition, bool& Inv) {
736 switch (Condition) {
737 default: assert(0 && "Unknown condition!"); abort();
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000738 case ISD::SETULT:
Nate Begeman7bfba7d2005-04-14 09:45:08 +0000739 case ISD::SETLT: Inv = false; return 0;
740 case ISD::SETUGE:
741 case ISD::SETGE: Inv = true; return 0;
742 case ISD::SETUGT:
743 case ISD::SETGT: Inv = false; return 1;
744 case ISD::SETULE:
745 case ISD::SETLE: Inv = true; return 1;
746 case ISD::SETEQ: Inv = false; return 2;
747 case ISD::SETNE: Inv = true; return 2;
748 }
749 return 0;
750}
751
Nate Begeman04730362005-04-01 04:45:11 +0000752/// IndexedOpForOp - Return the indexed variant for each of the PowerPC load
753/// and store immediate instructions.
754static unsigned IndexedOpForOp(unsigned Opcode) {
755 switch(Opcode) {
756 default: assert(0 && "Unknown opcode!"); abort();
757 case PPC::LBZ: return PPC::LBZX; case PPC::STB: return PPC::STBX;
758 case PPC::LHZ: return PPC::LHZX; case PPC::STH: return PPC::STHX;
759 case PPC::LHA: return PPC::LHAX; case PPC::STW: return PPC::STWX;
760 case PPC::LWZ: return PPC::LWZX; case PPC::STFS: return PPC::STFSX;
761 case PPC::LFS: return PPC::LFSX; case PPC::STFD: return PPC::STFDX;
762 case PPC::LFD: return PPC::LFDX;
763 }
764 return 0;
Nate Begeman3e897162005-03-31 23:55:40 +0000765}
Nate Begeman815d6da2005-04-06 00:25:27 +0000766
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000767// Structure used to return the necessary information to codegen an SDIV as
Nate Begeman815d6da2005-04-06 00:25:27 +0000768// a multiply.
769struct ms {
770 int m; // magic number
771 int s; // shift amount
772};
773
774struct mu {
775 unsigned int m; // magic number
776 int a; // add indicator
777 int s; // shift amount
778};
779
780/// magic - calculate the magic numbers required to codegen an integer sdiv as
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000781/// a sequence of multiply and shifts. Requires that the divisor not be 0, 1,
Nate Begeman815d6da2005-04-06 00:25:27 +0000782/// or -1.
783static struct ms magic(int d) {
784 int p;
785 unsigned int ad, anc, delta, q1, r1, q2, r2, t;
786 const unsigned int two31 = 2147483648U; // 2^31
787 struct ms mag;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000788
Nate Begeman815d6da2005-04-06 00:25:27 +0000789 ad = abs(d);
790 t = two31 + ((unsigned int)d >> 31);
791 anc = t - 1 - t%ad; // absolute value of nc
792 p = 31; // initialize p
793 q1 = two31/anc; // initialize q1 = 2p/abs(nc)
794 r1 = two31 - q1*anc; // initialize r1 = rem(2p,abs(nc))
795 q2 = two31/ad; // initialize q2 = 2p/abs(d)
796 r2 = two31 - q2*ad; // initialize r2 = rem(2p,abs(d))
797 do {
798 p = p + 1;
799 q1 = 2*q1; // update q1 = 2p/abs(nc)
800 r1 = 2*r1; // update r1 = rem(2p/abs(nc))
801 if (r1 >= anc) { // must be unsigned comparison
802 q1 = q1 + 1;
803 r1 = r1 - anc;
804 }
805 q2 = 2*q2; // update q2 = 2p/abs(d)
806 r2 = 2*r2; // update r2 = rem(2p/abs(d))
807 if (r2 >= ad) { // must be unsigned comparison
808 q2 = q2 + 1;
809 r2 = r2 - ad;
810 }
811 delta = ad - r2;
812 } while (q1 < delta || (q1 == delta && r1 == 0));
813
814 mag.m = q2 + 1;
815 if (d < 0) mag.m = -mag.m; // resulting magic number
816 mag.s = p - 32; // resulting shift
817 return mag;
818}
819
820/// magicu - calculate the magic numbers required to codegen an integer udiv as
821/// a sequence of multiply, add and shifts. Requires that the divisor not be 0.
822static struct mu magicu(unsigned d)
823{
824 int p;
825 unsigned int nc, delta, q1, r1, q2, r2;
826 struct mu magu;
827 magu.a = 0; // initialize "add" indicator
828 nc = - 1 - (-d)%d;
829 p = 31; // initialize p
830 q1 = 0x80000000/nc; // initialize q1 = 2p/nc
831 r1 = 0x80000000 - q1*nc; // initialize r1 = rem(2p,nc)
832 q2 = 0x7FFFFFFF/d; // initialize q2 = (2p-1)/d
833 r2 = 0x7FFFFFFF - q2*d; // initialize r2 = rem((2p-1),d)
834 do {
835 p = p + 1;
836 if (r1 >= nc - r1 ) {
837 q1 = 2*q1 + 1; // update q1
838 r1 = 2*r1 - nc; // update r1
839 }
840 else {
841 q1 = 2*q1; // update q1
842 r1 = 2*r1; // update r1
843 }
844 if (r2 + 1 >= d - r2) {
845 if (q2 >= 0x7FFFFFFF) magu.a = 1;
846 q2 = 2*q2 + 1; // update q2
847 r2 = 2*r2 + 1 - d; // update r2
848 }
849 else {
850 if (q2 >= 0x80000000) magu.a = 1;
851 q2 = 2*q2; // update q2
852 r2 = 2*r2 + 1; // update r2
853 }
854 delta = d - 1 - r2;
855 } while (p < 64 && (q1 < delta || (q1 == delta && r1 == 0)));
856 magu.m = q2 + 1; // resulting magic number
857 magu.s = p - 32; // resulting shift
858 return magu;
859}
860}
861
862/// BuildSDIVSequence - Given an ISD::SDIV node expressing a divide by constant,
863/// return a DAG expression to select that will generate the same value by
864/// multiplying by a magic number. See:
865/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
866SDOperand ISel::BuildSDIVSequence(SDOperand N) {
867 int d = (int)cast<ConstantSDNode>(N.getOperand(1))->getSignExtended();
868 ms magics = magic(d);
869 // Multiply the numerator (operand 0) by the magic value
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000870 SDOperand Q = ISelDAG->getNode(ISD::MULHS, MVT::i32, N.getOperand(0),
Nate Begeman815d6da2005-04-06 00:25:27 +0000871 ISelDAG->getConstant(magics.m, MVT::i32));
872 // If d > 0 and m < 0, add the numerator
873 if (d > 0 && magics.m < 0)
874 Q = ISelDAG->getNode(ISD::ADD, MVT::i32, Q, N.getOperand(0));
875 // If d < 0 and m > 0, subtract the numerator.
876 if (d < 0 && magics.m > 0)
877 Q = ISelDAG->getNode(ISD::SUB, MVT::i32, Q, N.getOperand(0));
878 // Shift right algebraic if shift value is nonzero
879 if (magics.s > 0)
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000880 Q = ISelDAG->getNode(ISD::SRA, MVT::i32, Q,
Nate Begeman815d6da2005-04-06 00:25:27 +0000881 ISelDAG->getConstant(magics.s, MVT::i32));
882 // Extract the sign bit and add it to the quotient
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000883 SDOperand T =
Nate Begeman815d6da2005-04-06 00:25:27 +0000884 ISelDAG->getNode(ISD::SRL, MVT::i32, Q, ISelDAG->getConstant(31, MVT::i32));
Nate Begeman27b4c232005-04-06 06:44:57 +0000885 return ISelDAG->getNode(ISD::ADD, MVT::i32, Q, T);
Nate Begeman815d6da2005-04-06 00:25:27 +0000886}
887
888/// BuildUDIVSequence - Given an ISD::UDIV node expressing a divide by constant,
889/// return a DAG expression to select that will generate the same value by
890/// multiplying by a magic number. See:
891/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
892SDOperand ISel::BuildUDIVSequence(SDOperand N) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000893 unsigned d =
Nate Begeman815d6da2005-04-06 00:25:27 +0000894 (unsigned)cast<ConstantSDNode>(N.getOperand(1))->getSignExtended();
895 mu magics = magicu(d);
896 // Multiply the numerator (operand 0) by the magic value
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000897 SDOperand Q = ISelDAG->getNode(ISD::MULHU, MVT::i32, N.getOperand(0),
Nate Begeman815d6da2005-04-06 00:25:27 +0000898 ISelDAG->getConstant(magics.m, MVT::i32));
899 if (magics.a == 0) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000900 Q = ISelDAG->getNode(ISD::SRL, MVT::i32, Q,
Nate Begeman815d6da2005-04-06 00:25:27 +0000901 ISelDAG->getConstant(magics.s, MVT::i32));
902 } else {
903 SDOperand NPQ = ISelDAG->getNode(ISD::SUB, MVT::i32, N.getOperand(0), Q);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000904 NPQ = ISelDAG->getNode(ISD::SRL, MVT::i32, NPQ,
Nate Begeman815d6da2005-04-06 00:25:27 +0000905 ISelDAG->getConstant(1, MVT::i32));
906 NPQ = ISelDAG->getNode(ISD::ADD, MVT::i32, NPQ, Q);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000907 Q = ISelDAG->getNode(ISD::SRL, MVT::i32, NPQ,
Nate Begeman815d6da2005-04-06 00:25:27 +0000908 ISelDAG->getConstant(magics.s-1, MVT::i32));
909 }
Nate Begeman27b4c232005-04-06 06:44:57 +0000910 return Q;
Nate Begemana9795f82005-03-24 04:41:43 +0000911}
912
Nate Begemanc7b09f12005-03-25 08:34:25 +0000913/// getGlobalBaseReg - Output the instructions required to put the
914/// base address to use for accessing globals into a register.
915///
916unsigned ISel::getGlobalBaseReg() {
917 if (!GlobalBaseInitialized) {
918 // Insert the set of GlobalBaseReg into the first MBB of the function
919 MachineBasicBlock &FirstMBB = BB->getParent()->front();
920 MachineBasicBlock::iterator MBBI = FirstMBB.begin();
921 GlobalBaseReg = MakeReg(MVT::i32);
922 BuildMI(FirstMBB, MBBI, PPC::MovePCtoLR, 0, PPC::LR);
923 BuildMI(FirstMBB, MBBI, PPC::MFLR, 1, GlobalBaseReg).addReg(PPC::LR);
924 GlobalBaseInitialized = true;
925 }
926 return GlobalBaseReg;
927}
928
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000929/// getConstDouble - Loads a floating point value into a register, via the
Nate Begeman6b559972005-04-01 02:59:27 +0000930/// Constant Pool. Optionally takes a register in which to load the value.
931unsigned ISel::getConstDouble(double doubleVal, unsigned Result=0) {
932 unsigned Tmp1 = MakeReg(MVT::i32);
933 if (0 == Result) Result = MakeReg(MVT::f64);
934 MachineConstantPool *CP = BB->getParent()->getConstantPool();
935 ConstantFP *CFP = ConstantFP::get(Type::DoubleTy, doubleVal);
936 unsigned CPI = CP->getConstantPoolIndex(CFP);
937 BuildMI(BB, PPC::LOADHiAddr, 2, Tmp1).addReg(getGlobalBaseReg())
938 .addConstantPoolIndex(CPI);
939 BuildMI(BB, PPC::LFD, 2, Result).addConstantPoolIndex(CPI).addReg(Tmp1);
940 return Result;
941}
942
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000943/// MoveCRtoGPR - Move CCReg[Idx] to the least significant bit of Result. If
Nate Begeman1cbf3ab2005-04-18 07:48:09 +0000944/// Inv is true, then invert the result.
945void ISel::MoveCRtoGPR(unsigned CCReg, bool Inv, unsigned Idx, unsigned Result){
946 unsigned IntCR = MakeReg(MVT::i32);
947 BuildMI(BB, PPC::MCRF, 1, PPC::CR7).addReg(CCReg);
948 BuildMI(BB, PPC::MFCR, 1, IntCR).addReg(PPC::CR7);
949 if (Inv) {
950 unsigned Tmp1 = MakeReg(MVT::i32);
951 BuildMI(BB, PPC::RLWINM, 4, Tmp1).addReg(IntCR).addImm(32-(3-Idx))
952 .addImm(31).addImm(31);
953 BuildMI(BB, PPC::XORI, 2, Result).addReg(Tmp1).addImm(1);
954 } else {
955 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(IntCR).addImm(32-(3-Idx))
956 .addImm(31).addImm(31);
957 }
958}
959
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000960/// SelectBitfieldInsert - turn an or of two masked values into
Nate Begeman7ddecb42005-04-06 23:51:40 +0000961/// the rotate left word immediate then mask insert (rlwimi) instruction.
962/// Returns true on success, false if the caller still needs to select OR.
963///
964/// Patterns matched:
965/// 1. or shl, and 5. or and, and
966/// 2. or and, shl 6. or shl, shr
967/// 3. or shr, and 7. or shr, shl
968/// 4. or and, shr
969bool ISel::SelectBitfieldInsert(SDOperand OR, unsigned Result) {
Nate Begemancd08e4c2005-04-09 20:09:12 +0000970 bool IsRotate = false;
Nate Begeman7ddecb42005-04-06 23:51:40 +0000971 unsigned TgtMask = 0xFFFFFFFF, InsMask = 0xFFFFFFFF, Amount = 0;
972 unsigned Op0Opc = OR.getOperand(0).getOpcode();
973 unsigned Op1Opc = OR.getOperand(1).getOpcode();
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000974
Nate Begeman7ddecb42005-04-06 23:51:40 +0000975 // Verify that we have the correct opcodes
976 if (ISD::SHL != Op0Opc && ISD::SRL != Op0Opc && ISD::AND != Op0Opc)
977 return false;
978 if (ISD::SHL != Op1Opc && ISD::SRL != Op1Opc && ISD::AND != Op1Opc)
979 return false;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000980
Nate Begeman7ddecb42005-04-06 23:51:40 +0000981 // Generate Mask value for Target
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000982 if (ConstantSDNode *CN =
Nate Begeman7ddecb42005-04-06 23:51:40 +0000983 dyn_cast<ConstantSDNode>(OR.getOperand(0).getOperand(1).Val)) {
984 switch(Op0Opc) {
985 case ISD::SHL: TgtMask <<= (unsigned)CN->getValue(); break;
986 case ISD::SRL: TgtMask >>= (unsigned)CN->getValue(); break;
987 case ISD::AND: TgtMask &= (unsigned)CN->getValue(); break;
988 }
989 } else {
990 return false;
991 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000992
Nate Begeman7ddecb42005-04-06 23:51:40 +0000993 // Generate Mask value for Insert
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000994 if (ConstantSDNode *CN =
Nate Begeman7ddecb42005-04-06 23:51:40 +0000995 dyn_cast<ConstantSDNode>(OR.getOperand(1).getOperand(1).Val)) {
996 switch(Op1Opc) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000997 case ISD::SHL:
998 Amount = CN->getValue();
Nate Begemancd08e4c2005-04-09 20:09:12 +0000999 InsMask <<= Amount;
1000 if (Op0Opc == ISD::SRL) IsRotate = true;
Nate Begeman7ddecb42005-04-06 23:51:40 +00001001 break;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001002 case ISD::SRL:
1003 Amount = CN->getValue();
1004 InsMask >>= Amount;
Nate Begeman7ddecb42005-04-06 23:51:40 +00001005 Amount = 32-Amount;
Nate Begemancd08e4c2005-04-09 20:09:12 +00001006 if (Op0Opc == ISD::SHL) IsRotate = true;
Nate Begeman7ddecb42005-04-06 23:51:40 +00001007 break;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001008 case ISD::AND:
Nate Begeman7ddecb42005-04-06 23:51:40 +00001009 InsMask &= (unsigned)CN->getValue();
1010 break;
1011 }
1012 } else {
1013 return false;
1014 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001015
Nate Begeman7ddecb42005-04-06 23:51:40 +00001016 // Verify that the Target mask and Insert mask together form a full word mask
1017 // and that the Insert mask is a run of set bits (which implies both are runs
1018 // of set bits). Given that, Select the arguments and generate the rlwimi
1019 // instruction.
1020 unsigned MB, ME;
1021 if (((TgtMask ^ InsMask) == 0xFFFFFFFF) && IsRunOfOnes(InsMask, MB, ME)) {
1022 unsigned Tmp1, Tmp2;
Nate Begemancd08e4c2005-04-09 20:09:12 +00001023 // Check for rotlwi / rotrwi here, a special case of bitfield insert
1024 // where both bitfield halves are sourced from the same value.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001025 if (IsRotate &&
Nate Begemancd08e4c2005-04-09 20:09:12 +00001026 OR.getOperand(0).getOperand(0) == OR.getOperand(1).getOperand(0)) {
Nate Begemancd08e4c2005-04-09 20:09:12 +00001027 Tmp1 = SelectExpr(OR.getOperand(0).getOperand(0));
1028 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp1).addImm(Amount)
1029 .addImm(0).addImm(31);
1030 return true;
1031 }
Nate Begeman7ddecb42005-04-06 23:51:40 +00001032 if (Op0Opc == ISD::AND)
1033 Tmp1 = SelectExpr(OR.getOperand(0).getOperand(0));
1034 else
1035 Tmp1 = SelectExpr(OR.getOperand(0));
1036 Tmp2 = SelectExpr(OR.getOperand(1).getOperand(0));
1037 BuildMI(BB, PPC::RLWIMI, 5, Result).addReg(Tmp1).addReg(Tmp2)
1038 .addImm(Amount).addImm(MB).addImm(ME);
1039 return true;
1040 }
1041 return false;
1042}
1043
Nate Begeman3664cef2005-04-13 22:14:14 +00001044/// FoldIfWideZeroExtend - 32 bit PowerPC implicit masks shift amounts to the
1045/// low six bits. If the shift amount is an ISD::AND node with a mask that is
1046/// wider than the implicit mask, then we can get rid of the AND and let the
1047/// shift do the mask.
1048unsigned ISel::FoldIfWideZeroExtend(SDOperand N) {
1049 unsigned C;
1050 if (N.getOpcode() == ISD::AND &&
1051 5 == getImmediateForOpcode(N.getOperand(1), ISD::AND, C) && // isMask
1052 31 == (C & 0xFFFF) && // ME
1053 26 >= (C >> 16)) // MB
1054 return SelectExpr(N.getOperand(0));
1055 else
1056 return SelectExpr(N);
1057}
1058
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001059unsigned ISel::SelectCC(SDOperand CC, unsigned& Opc, bool &Inv, unsigned& Idx) {
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001060 unsigned Result, Tmp1, Tmp2;
Nate Begeman9765c252005-04-12 21:22:28 +00001061 bool AlreadySelected = false;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001062 static const unsigned CompareOpcodes[] =
Nate Begemandffcfcc2005-04-01 00:32:34 +00001063 { PPC::FCMPU, PPC::FCMPU, PPC::CMPW, PPC::CMPLW };
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001064
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001065 // Allocate a condition register for this expression
1066 Result = RegMap->createVirtualRegister(PPC32::CRRCRegisterClass);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001067
Nate Begemandffcfcc2005-04-01 00:32:34 +00001068 // If the first operand to the select is a SETCC node, then we can fold it
1069 // into the branch that selects which value to return.
Nate Begeman16ac7092005-04-18 02:43:24 +00001070 if (SetCCSDNode* SetCC = dyn_cast<SetCCSDNode>(CC.Val)) {
Nate Begemandffcfcc2005-04-01 00:32:34 +00001071 bool U;
1072 Opc = getBCCForSetCC(SetCC->getCondition(), U);
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001073 Idx = getCRIdxForSetCC(SetCC->getCondition(), Inv);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001074
Nate Begeman439b4442005-04-05 04:22:58 +00001075 // Pass the optional argument U to getImmediateForOpcode for SETCC,
Nate Begemandffcfcc2005-04-01 00:32:34 +00001076 // so that it knows whether the SETCC immediate range is signed or not.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001077 if (1 == getImmediateForOpcode(SetCC->getOperand(1), ISD::SETCC,
Nate Begeman439b4442005-04-05 04:22:58 +00001078 Tmp2, U)) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001079 // For comparisons against zero, we can implicity set CR0 if a recording
Nate Begemanc7bd4822005-04-11 06:34:10 +00001080 // variant (e.g. 'or.' instead of 'or') of the instruction that defines
1081 // operand zero of the SetCC node is available.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001082 if (0 == Tmp2 &&
Nate Begeman9765c252005-04-12 21:22:28 +00001083 NodeHasRecordingVariant(SetCC->getOperand(0).getOpcode()) &&
1084 SetCC->getOperand(0).Val->hasOneUse()) {
Nate Begemanc7bd4822005-04-11 06:34:10 +00001085 RecordSuccess = false;
1086 Tmp1 = SelectExpr(SetCC->getOperand(0), true);
1087 if (RecordSuccess) {
1088 ++Recorded;
Nate Begeman7bfba7d2005-04-14 09:45:08 +00001089 BuildMI(BB, PPC::MCRF, 1, Result).addReg(PPC::CR0);
1090 return Result;
Nate Begemanc7bd4822005-04-11 06:34:10 +00001091 }
1092 AlreadySelected = true;
1093 }
1094 // If we could not implicitly set CR0, then emit a compare immediate
1095 // instead.
1096 if (!AlreadySelected) Tmp1 = SelectExpr(SetCC->getOperand(0));
Nate Begemandffcfcc2005-04-01 00:32:34 +00001097 if (U)
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001098 BuildMI(BB, PPC::CMPLWI, 2, Result).addReg(Tmp1).addImm(Tmp2);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001099 else
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001100 BuildMI(BB, PPC::CMPWI, 2, Result).addReg(Tmp1).addSImm(Tmp2);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001101 } else {
1102 bool IsInteger = MVT::isInteger(SetCC->getOperand(0).getValueType());
1103 unsigned CompareOpc = CompareOpcodes[2 * IsInteger + U];
Nate Begemanc7bd4822005-04-11 06:34:10 +00001104 Tmp1 = SelectExpr(SetCC->getOperand(0));
Nate Begemandffcfcc2005-04-01 00:32:34 +00001105 Tmp2 = SelectExpr(SetCC->getOperand(1));
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001106 BuildMI(BB, CompareOpc, 2, Result).addReg(Tmp1).addReg(Tmp2);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001107 }
1108 } else {
Nate Begemanf8b02942005-04-15 22:12:16 +00001109 if (PPCCRopts)
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001110 return SelectCCExpr(CC, Opc, Inv, Idx);
1111 // If this isn't a SetCC, then select the value and compare it against zero,
1112 // treating it as if it were a boolean.
Nate Begeman9765c252005-04-12 21:22:28 +00001113 Opc = PPC::BNE;
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001114 Idx = getCRIdxForSetCC(ISD::SETNE, Inv);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001115 Tmp1 = SelectExpr(CC);
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001116 BuildMI(BB, PPC::CMPLWI, 2, Result).addReg(Tmp1).addImm(0);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001117 }
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001118 return Result;
Nate Begemandffcfcc2005-04-01 00:32:34 +00001119}
1120
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001121unsigned ISel::SelectCCExpr(SDOperand N, unsigned& Opc, bool &Inv,
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001122 unsigned &Idx) {
1123 bool Inv0, Inv1;
1124 unsigned Idx0, Idx1, CROpc, Opc1, Tmp1, Tmp2;
1125
1126 // Allocate a condition register for this expression
1127 unsigned Result = RegMap->createVirtualRegister(PPC32::CRRCRegisterClass);
1128
1129 // Check for the operations we support:
1130 switch(N.getOpcode()) {
1131 default:
1132 Opc = PPC::BNE;
1133 Idx = getCRIdxForSetCC(ISD::SETNE, Inv);
1134 Tmp1 = SelectExpr(N);
1135 BuildMI(BB, PPC::CMPLWI, 2, Result).addReg(Tmp1).addImm(0);
1136 break;
1137 case ISD::OR:
1138 case ISD::AND:
1139 ++MultiBranch;
1140 Tmp1 = SelectCCExpr(N.getOperand(0), Opc, Inv0, Idx0);
1141 Tmp2 = SelectCCExpr(N.getOperand(1), Opc1, Inv1, Idx1);
1142 CROpc = getCROpForSetCC(N.getOpcode(), Inv0, Inv1);
1143 if (Inv0 && !Inv1) {
1144 std::swap(Tmp1, Tmp2);
1145 std::swap(Idx0, Idx1);
1146 Opc = Opc1;
1147 }
1148 if (Inv0 && Inv1) Opc = PPC32InstrInfo::invertPPCBranchOpcode(Opc);
1149 BuildMI(BB, CROpc, 5, Result).addImm(Idx0).addReg(Tmp1).addImm(Idx0)
1150 .addReg(Tmp2).addImm(Idx1);
1151 Inv = false;
1152 Idx = Idx0;
1153 break;
1154 case ISD::SETCC:
1155 Tmp1 = SelectCC(N, Opc, Inv, Idx);
1156 Result = Tmp1;
1157 break;
1158 }
1159 return Result;
1160}
1161
Nate Begemandffcfcc2005-04-01 00:32:34 +00001162/// Check to see if the load is a constant offset from a base register
Nate Begeman04730362005-04-01 04:45:11 +00001163bool ISel::SelectAddr(SDOperand N, unsigned& Reg, int& offset)
Nate Begemana9795f82005-03-24 04:41:43 +00001164{
Nate Begeman96fc6812005-03-31 02:05:53 +00001165 unsigned imm = 0, opcode = N.getOpcode();
Nate Begeman04730362005-04-01 04:45:11 +00001166 if (N.getOpcode() == ISD::ADD) {
1167 Reg = SelectExpr(N.getOperand(0));
Nate Begeman439b4442005-04-05 04:22:58 +00001168 if (1 == getImmediateForOpcode(N.getOperand(1), opcode, imm)) {
Nate Begeman96fc6812005-03-31 02:05:53 +00001169 offset = imm;
Nate Begeman04730362005-04-01 04:45:11 +00001170 return false;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001171 }
Nate Begeman04730362005-04-01 04:45:11 +00001172 offset = SelectExpr(N.getOperand(1));
1173 return true;
1174 }
Nate Begemana9795f82005-03-24 04:41:43 +00001175 Reg = SelectExpr(N);
1176 offset = 0;
Nate Begeman04730362005-04-01 04:45:11 +00001177 return false;
Nate Begemana9795f82005-03-24 04:41:43 +00001178}
1179
1180void ISel::SelectBranchCC(SDOperand N)
1181{
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001182 MachineBasicBlock *Dest =
Nate Begemana9795f82005-03-24 04:41:43 +00001183 cast<BasicBlockSDNode>(N.getOperand(2))->getBasicBlock();
Nate Begeman3e897162005-03-31 23:55:40 +00001184
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001185 bool Inv;
1186 unsigned Opc, CCReg, Idx;
Nate Begemana9795f82005-03-24 04:41:43 +00001187 Select(N.getOperand(0)); //chain
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001188 CCReg = SelectCC(N.getOperand(1), Opc, Inv, Idx);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001189
Nate Begemancd08e4c2005-04-09 20:09:12 +00001190 // Iterate to the next basic block, unless we're already at the end of the
1191 ilist<MachineBasicBlock>::iterator It = BB, E = BB->getParent()->end();
Nate Begeman706471e2005-04-09 23:35:05 +00001192 if (++It == E) It = BB;
Nate Begemancd08e4c2005-04-09 20:09:12 +00001193
1194 // If this is a two way branch, then grab the fallthrough basic block argument
1195 // and build a PowerPC branch pseudo-op, suitable for long branch conversion
1196 // if necessary by the branch selection pass. Otherwise, emit a standard
1197 // conditional branch.
1198 if (N.getOpcode() == ISD::BRCONDTWOWAY) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001199 MachineBasicBlock *Fallthrough =
Nate Begemancd08e4c2005-04-09 20:09:12 +00001200 cast<BasicBlockSDNode>(N.getOperand(3))->getBasicBlock();
1201 if (Dest != It) {
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001202 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(CCReg).addImm(Opc)
Nate Begemancd08e4c2005-04-09 20:09:12 +00001203 .addMBB(Dest).addMBB(Fallthrough);
1204 if (Fallthrough != It)
1205 BuildMI(BB, PPC::B, 1).addMBB(Fallthrough);
1206 } else {
1207 if (Fallthrough != It) {
1208 Opc = PPC32InstrInfo::invertPPCBranchOpcode(Opc);
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001209 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(CCReg).addImm(Opc)
Nate Begemancd08e4c2005-04-09 20:09:12 +00001210 .addMBB(Fallthrough).addMBB(Dest);
1211 }
1212 }
1213 } else {
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001214 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(CCReg).addImm(Opc)
Nate Begeman27499e32005-04-10 01:48:29 +00001215 .addMBB(Dest).addMBB(It);
Nate Begemancd08e4c2005-04-09 20:09:12 +00001216 }
Nate Begemana9795f82005-03-24 04:41:43 +00001217 return;
1218}
1219
1220unsigned ISel::SelectExprFP(SDOperand N, unsigned Result)
1221{
1222 unsigned Tmp1, Tmp2, Tmp3;
1223 unsigned Opc = 0;
1224 SDNode *Node = N.Val;
1225 MVT::ValueType DestType = N.getValueType();
1226 unsigned opcode = N.getOpcode();
1227
1228 switch (opcode) {
1229 default:
1230 Node->dump();
1231 assert(0 && "Node not handled!\n");
1232
Nate Begeman23afcfb2005-03-29 22:48:55 +00001233 case ISD::SELECT: {
Nate Begeman3e897162005-03-31 23:55:40 +00001234 // Attempt to generate FSEL. We can do this whenever we have an FP result,
1235 // and an FP comparison in the SetCC node.
1236 SetCCSDNode* SetCC = dyn_cast<SetCCSDNode>(N.getOperand(0).Val);
1237 if (SetCC && N.getOperand(0).getOpcode() == ISD::SETCC &&
1238 !MVT::isInteger(SetCC->getOperand(0).getValueType()) &&
1239 SetCC->getCondition() != ISD::SETEQ &&
1240 SetCC->getCondition() != ISD::SETNE) {
1241 MVT::ValueType VT = SetCC->getOperand(0).getValueType();
Nate Begeman3e897162005-03-31 23:55:40 +00001242 unsigned TV = SelectExpr(N.getOperand(1)); // Use if TRUE
1243 unsigned FV = SelectExpr(N.getOperand(2)); // Use if FALSE
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001244
Nate Begeman3e897162005-03-31 23:55:40 +00001245 ConstantFPSDNode *CN = dyn_cast<ConstantFPSDNode>(SetCC->getOperand(1));
1246 if (CN && (CN->isExactlyValue(-0.0) || CN->isExactlyValue(0.0))) {
1247 switch(SetCC->getCondition()) {
1248 default: assert(0 && "Invalid FSEL condition"); abort();
1249 case ISD::SETULT:
1250 case ISD::SETLT:
Nate Begemanaf4ab1b2005-04-09 09:33:07 +00001251 std::swap(TV, FV); // fsel is natively setge, swap operands for setlt
Nate Begeman3e897162005-03-31 23:55:40 +00001252 case ISD::SETUGE:
1253 case ISD::SETGE:
Nate Begemanaf4ab1b2005-04-09 09:33:07 +00001254 Tmp1 = SelectExpr(SetCC->getOperand(0)); // Val to compare against
Nate Begeman3e897162005-03-31 23:55:40 +00001255 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp1).addReg(TV).addReg(FV);
1256 return Result;
1257 case ISD::SETUGT:
Nate Begemanaf4ab1b2005-04-09 09:33:07 +00001258 case ISD::SETGT:
1259 std::swap(TV, FV); // fsel is natively setge, swap operands for setlt
Nate Begeman3e897162005-03-31 23:55:40 +00001260 case ISD::SETULE:
1261 case ISD::SETLE: {
Nate Begemanaf4ab1b2005-04-09 09:33:07 +00001262 if (SetCC->getOperand(0).getOpcode() == ISD::FNEG) {
1263 Tmp2 = SelectExpr(SetCC->getOperand(0).getOperand(0));
1264 } else {
1265 Tmp2 = MakeReg(VT);
1266 Tmp1 = SelectExpr(SetCC->getOperand(0)); // Val to compare against
1267 BuildMI(BB, PPC::FNEG, 1, Tmp2).addReg(Tmp1);
1268 }
Nate Begeman3e897162005-03-31 23:55:40 +00001269 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp2).addReg(TV).addReg(FV);
1270 return Result;
1271 }
1272 }
1273 } else {
1274 Opc = (MVT::f64 == VT) ? PPC::FSUB : PPC::FSUBS;
Nate Begemanaf4ab1b2005-04-09 09:33:07 +00001275 Tmp1 = SelectExpr(SetCC->getOperand(0)); // Val to compare against
Nate Begeman3e897162005-03-31 23:55:40 +00001276 Tmp2 = SelectExpr(SetCC->getOperand(1));
1277 Tmp3 = MakeReg(VT);
1278 switch(SetCC->getCondition()) {
1279 default: assert(0 && "Invalid FSEL condition"); abort();
1280 case ISD::SETULT:
1281 case ISD::SETLT:
1282 BuildMI(BB, Opc, 2, Tmp3).addReg(Tmp1).addReg(Tmp2);
1283 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp3).addReg(FV).addReg(TV);
1284 return Result;
1285 case ISD::SETUGE:
1286 case ISD::SETGE:
1287 BuildMI(BB, Opc, 2, Tmp3).addReg(Tmp1).addReg(Tmp2);
1288 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp3).addReg(TV).addReg(FV);
1289 return Result;
1290 case ISD::SETUGT:
1291 case ISD::SETGT:
1292 BuildMI(BB, Opc, 2, Tmp3).addReg(Tmp2).addReg(Tmp1);
1293 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp3).addReg(FV).addReg(TV);
1294 return Result;
1295 case ISD::SETULE:
1296 case ISD::SETLE:
1297 BuildMI(BB, Opc, 2, Tmp3).addReg(Tmp2).addReg(Tmp1);
1298 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp3).addReg(TV).addReg(FV);
1299 return Result;
1300 }
1301 }
1302 assert(0 && "Should never get here");
1303 return 0;
1304 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001305
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001306 bool Inv;
Nate Begeman31318e42005-04-01 07:21:30 +00001307 unsigned TrueValue = SelectExpr(N.getOperand(1)); //Use if TRUE
1308 unsigned FalseValue = SelectExpr(N.getOperand(2)); //Use if FALSE
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001309 unsigned CCReg = SelectCC(N.getOperand(0), Opc, Inv, Tmp3);
Nate Begeman31318e42005-04-01 07:21:30 +00001310
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001311 // Create an iterator with which to insert the MBB for copying the false
Nate Begeman23afcfb2005-03-29 22:48:55 +00001312 // value and the MBB to hold the PHI instruction for this SetCC.
1313 MachineBasicBlock *thisMBB = BB;
1314 const BasicBlock *LLVM_BB = BB->getBasicBlock();
1315 ilist<MachineBasicBlock>::iterator It = BB;
1316 ++It;
1317
1318 // thisMBB:
1319 // ...
1320 // TrueVal = ...
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001321 // cmpTY ccX, r1, r2
Nate Begeman23afcfb2005-03-29 22:48:55 +00001322 // bCC copy1MBB
1323 // fallthrough --> copy0MBB
Nate Begeman23afcfb2005-03-29 22:48:55 +00001324 MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB);
1325 MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB);
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001326 BuildMI(BB, Opc, 2).addReg(CCReg).addMBB(sinkMBB);
Nate Begeman23afcfb2005-03-29 22:48:55 +00001327 MachineFunction *F = BB->getParent();
1328 F->getBasicBlockList().insert(It, copy0MBB);
1329 F->getBasicBlockList().insert(It, sinkMBB);
1330 // Update machine-CFG edges
1331 BB->addSuccessor(copy0MBB);
1332 BB->addSuccessor(sinkMBB);
1333
1334 // copy0MBB:
1335 // %FalseValue = ...
1336 // # fallthrough to sinkMBB
1337 BB = copy0MBB;
Nate Begeman23afcfb2005-03-29 22:48:55 +00001338 // Update machine-CFG edges
1339 BB->addSuccessor(sinkMBB);
1340
1341 // sinkMBB:
1342 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
1343 // ...
1344 BB = sinkMBB;
1345 BuildMI(BB, PPC::PHI, 4, Result).addReg(FalseValue)
1346 .addMBB(copy0MBB).addReg(TrueValue).addMBB(thisMBB);
1347 return Result;
1348 }
Nate Begeman27eeb002005-04-02 05:59:34 +00001349
1350 case ISD::FNEG:
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001351 if (!NoExcessFPPrecision &&
Nate Begeman93075ec2005-04-04 23:40:36 +00001352 ISD::ADD == N.getOperand(0).getOpcode() &&
1353 N.getOperand(0).Val->hasOneUse() &&
1354 ISD::MUL == N.getOperand(0).getOperand(0).getOpcode() &&
1355 N.getOperand(0).getOperand(0).Val->hasOneUse()) {
Nate Begeman80196b12005-04-05 00:15:08 +00001356 ++FusedFP; // Statistic
Nate Begeman93075ec2005-04-04 23:40:36 +00001357 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0).getOperand(0));
1358 Tmp2 = SelectExpr(N.getOperand(0).getOperand(0).getOperand(1));
1359 Tmp3 = SelectExpr(N.getOperand(0).getOperand(1));
1360 Opc = DestType == MVT::f64 ? PPC::FNMADD : PPC::FNMADDS;
1361 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001362 } else if (!NoExcessFPPrecision &&
Nate Begemane88aa5b2005-04-09 03:05:51 +00001363 ISD::ADD == N.getOperand(0).getOpcode() &&
Nate Begeman93075ec2005-04-04 23:40:36 +00001364 N.getOperand(0).Val->hasOneUse() &&
Nate Begemane88aa5b2005-04-09 03:05:51 +00001365 ISD::MUL == N.getOperand(0).getOperand(1).getOpcode() &&
1366 N.getOperand(0).getOperand(1).Val->hasOneUse()) {
Nate Begeman80196b12005-04-05 00:15:08 +00001367 ++FusedFP; // Statistic
Nate Begemane88aa5b2005-04-09 03:05:51 +00001368 Tmp1 = SelectExpr(N.getOperand(0).getOperand(1).getOperand(0));
1369 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1).getOperand(1));
1370 Tmp3 = SelectExpr(N.getOperand(0).getOperand(0));
1371 Opc = DestType == MVT::f64 ? PPC::FNMADD : PPC::FNMADDS;
Nate Begeman93075ec2005-04-04 23:40:36 +00001372 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
1373 } else if (ISD::FABS == N.getOperand(0).getOpcode()) {
Nate Begeman27eeb002005-04-02 05:59:34 +00001374 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1375 BuildMI(BB, PPC::FNABS, 1, Result).addReg(Tmp1);
1376 } else {
1377 Tmp1 = SelectExpr(N.getOperand(0));
1378 BuildMI(BB, PPC::FNEG, 1, Result).addReg(Tmp1);
1379 }
1380 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001381
Nate Begeman27eeb002005-04-02 05:59:34 +00001382 case ISD::FABS:
1383 Tmp1 = SelectExpr(N.getOperand(0));
1384 BuildMI(BB, PPC::FABS, 1, Result).addReg(Tmp1);
1385 return Result;
1386
Nate Begemana9795f82005-03-24 04:41:43 +00001387 case ISD::FP_ROUND:
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001388 assert (DestType == MVT::f32 &&
1389 N.getOperand(0).getValueType() == MVT::f64 &&
Nate Begemana9795f82005-03-24 04:41:43 +00001390 "only f64 to f32 conversion supported here");
1391 Tmp1 = SelectExpr(N.getOperand(0));
1392 BuildMI(BB, PPC::FRSP, 1, Result).addReg(Tmp1);
1393 return Result;
1394
1395 case ISD::FP_EXTEND:
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001396 assert (DestType == MVT::f64 &&
1397 N.getOperand(0).getValueType() == MVT::f32 &&
Nate Begemana9795f82005-03-24 04:41:43 +00001398 "only f32 to f64 conversion supported here");
1399 Tmp1 = SelectExpr(N.getOperand(0));
1400 BuildMI(BB, PPC::FMR, 1, Result).addReg(Tmp1);
1401 return Result;
1402
1403 case ISD::CopyFromReg:
Nate Begemanf2622612005-03-26 02:17:46 +00001404 if (Result == 1)
1405 Result = ExprMap[N.getValue(0)] = MakeReg(N.getValue(0).getValueType());
1406 Tmp1 = dyn_cast<RegSDNode>(Node)->getReg();
1407 BuildMI(BB, PPC::FMR, 1, Result).addReg(Tmp1);
1408 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001409
Nate Begeman6d369cc2005-04-01 01:08:07 +00001410 case ISD::ConstantFP: {
Nate Begeman6d369cc2005-04-01 01:08:07 +00001411 ConstantFPSDNode *CN = cast<ConstantFPSDNode>(N);
Nate Begeman6b559972005-04-01 02:59:27 +00001412 Result = getConstDouble(CN->getValue(), Result);
Nate Begeman6d369cc2005-04-01 01:08:07 +00001413 return Result;
1414 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001415
Nate Begemana9795f82005-03-24 04:41:43 +00001416 case ISD::ADD:
Nate Begeman93075ec2005-04-04 23:40:36 +00001417 if (!NoExcessFPPrecision && N.getOperand(0).getOpcode() == ISD::MUL &&
1418 N.getOperand(0).Val->hasOneUse()) {
1419 ++FusedFP; // Statistic
1420 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1421 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1));
1422 Tmp3 = SelectExpr(N.getOperand(1));
1423 Opc = DestType == MVT::f64 ? PPC::FMADD : PPC::FMADDS;
1424 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
1425 return Result;
1426 }
Nate Begemane88aa5b2005-04-09 03:05:51 +00001427 if (!NoExcessFPPrecision && N.getOperand(1).getOpcode() == ISD::MUL &&
1428 N.getOperand(1).Val->hasOneUse()) {
1429 ++FusedFP; // Statistic
1430 Tmp1 = SelectExpr(N.getOperand(1).getOperand(0));
1431 Tmp2 = SelectExpr(N.getOperand(1).getOperand(1));
1432 Tmp3 = SelectExpr(N.getOperand(0));
1433 Opc = DestType == MVT::f64 ? PPC::FMADD : PPC::FMADDS;
1434 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
1435 return Result;
1436 }
Nate Begeman93075ec2005-04-04 23:40:36 +00001437 Opc = DestType == MVT::f64 ? PPC::FADD : PPC::FADDS;
1438 Tmp1 = SelectExpr(N.getOperand(0));
1439 Tmp2 = SelectExpr(N.getOperand(1));
1440 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
1441 return Result;
1442
Nate Begemana9795f82005-03-24 04:41:43 +00001443 case ISD::SUB:
Nate Begeman93075ec2005-04-04 23:40:36 +00001444 if (!NoExcessFPPrecision && N.getOperand(0).getOpcode() == ISD::MUL &&
1445 N.getOperand(0).Val->hasOneUse()) {
1446 ++FusedFP; // Statistic
1447 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1448 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1));
1449 Tmp3 = SelectExpr(N.getOperand(1));
1450 Opc = DestType == MVT::f64 ? PPC::FMSUB : PPC::FMSUBS;
1451 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
1452 return Result;
1453 }
Nate Begemane88aa5b2005-04-09 03:05:51 +00001454 if (!NoExcessFPPrecision && N.getOperand(1).getOpcode() == ISD::MUL &&
1455 N.getOperand(1).Val->hasOneUse()) {
1456 ++FusedFP; // Statistic
1457 Tmp1 = SelectExpr(N.getOperand(1).getOperand(0));
1458 Tmp2 = SelectExpr(N.getOperand(1).getOperand(1));
1459 Tmp3 = SelectExpr(N.getOperand(0));
1460 Opc = DestType == MVT::f64 ? PPC::FNMSUB : PPC::FNMSUBS;
1461 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
1462 return Result;
1463 }
Nate Begeman93075ec2005-04-04 23:40:36 +00001464 Opc = DestType == MVT::f64 ? PPC::FSUB : PPC::FSUBS;
1465 Tmp1 = SelectExpr(N.getOperand(0));
1466 Tmp2 = SelectExpr(N.getOperand(1));
1467 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
1468 return Result;
1469
1470 case ISD::MUL:
Nate Begemana9795f82005-03-24 04:41:43 +00001471 case ISD::SDIV:
1472 switch( opcode ) {
1473 case ISD::MUL: Opc = DestType == MVT::f64 ? PPC::FMUL : PPC::FMULS; break;
Nate Begemana9795f82005-03-24 04:41:43 +00001474 case ISD::SDIV: Opc = DestType == MVT::f64 ? PPC::FDIV : PPC::FDIVS; break;
1475 };
Nate Begemana9795f82005-03-24 04:41:43 +00001476 Tmp1 = SelectExpr(N.getOperand(0));
1477 Tmp2 = SelectExpr(N.getOperand(1));
1478 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
1479 return Result;
1480
Nate Begemana9795f82005-03-24 04:41:43 +00001481 case ISD::UINT_TO_FP:
Nate Begemanfdcf3412005-03-30 19:38:35 +00001482 case ISD::SINT_TO_FP: {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001483 assert (N.getOperand(0).getValueType() == MVT::i32
Nate Begemanfdcf3412005-03-30 19:38:35 +00001484 && "int to float must operate on i32");
1485 bool IsUnsigned = (ISD::UINT_TO_FP == opcode);
1486 Tmp1 = SelectExpr(N.getOperand(0)); // Get the operand register
1487 Tmp2 = MakeReg(MVT::f64); // temp reg to load the integer value into
1488 Tmp3 = MakeReg(MVT::i32); // temp reg to hold the conversion constant
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001489
Nate Begemanfdcf3412005-03-30 19:38:35 +00001490 int FrameIdx = BB->getParent()->getFrameInfo()->CreateStackObject(8, 8);
1491 MachineConstantPool *CP = BB->getParent()->getConstantPool();
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001492
Nate Begemanfdcf3412005-03-30 19:38:35 +00001493 if (IsUnsigned) {
Nate Begeman709c8062005-04-10 06:06:10 +00001494 unsigned ConstF = getConstDouble(0x1.000000p52);
Nate Begemanfdcf3412005-03-30 19:38:35 +00001495 // Store the hi & low halves of the fp value, currently in int regs
1496 BuildMI(BB, PPC::LIS, 1, Tmp3).addSImm(0x4330);
1497 addFrameReference(BuildMI(BB, PPC::STW, 3).addReg(Tmp3), FrameIdx);
1498 addFrameReference(BuildMI(BB, PPC::STW, 3).addReg(Tmp1), FrameIdx, 4);
1499 addFrameReference(BuildMI(BB, PPC::LFD, 2, Tmp2), FrameIdx);
1500 // Generate the return value with a subtract
1501 BuildMI(BB, PPC::FSUB, 2, Result).addReg(Tmp2).addReg(ConstF);
1502 } else {
Nate Begeman709c8062005-04-10 06:06:10 +00001503 unsigned ConstF = getConstDouble(0x1.000008p52);
Nate Begemanfdcf3412005-03-30 19:38:35 +00001504 unsigned TmpL = MakeReg(MVT::i32);
Nate Begemanfdcf3412005-03-30 19:38:35 +00001505 // Store the hi & low halves of the fp value, currently in int regs
1506 BuildMI(BB, PPC::LIS, 1, Tmp3).addSImm(0x4330);
1507 addFrameReference(BuildMI(BB, PPC::STW, 3).addReg(Tmp3), FrameIdx);
1508 BuildMI(BB, PPC::XORIS, 2, TmpL).addReg(Tmp1).addImm(0x8000);
1509 addFrameReference(BuildMI(BB, PPC::STW, 3).addReg(TmpL), FrameIdx, 4);
1510 addFrameReference(BuildMI(BB, PPC::LFD, 2, Tmp2), FrameIdx);
1511 // Generate the return value with a subtract
1512 BuildMI(BB, PPC::FSUB, 2, Result).addReg(Tmp2).addReg(ConstF);
1513 }
1514 return Result;
1515 }
Nate Begemana9795f82005-03-24 04:41:43 +00001516 }
Nate Begeman6b559972005-04-01 02:59:27 +00001517 assert(0 && "Should never get here");
Nate Begemana9795f82005-03-24 04:41:43 +00001518 return 0;
1519}
1520
Nate Begemanc7bd4822005-04-11 06:34:10 +00001521unsigned ISel::SelectExpr(SDOperand N, bool Recording) {
Nate Begemana9795f82005-03-24 04:41:43 +00001522 unsigned Result;
1523 unsigned Tmp1, Tmp2, Tmp3;
1524 unsigned Opc = 0;
1525 unsigned opcode = N.getOpcode();
1526
1527 SDNode *Node = N.Val;
1528 MVT::ValueType DestType = N.getValueType();
1529
1530 unsigned &Reg = ExprMap[N];
1531 if (Reg) return Reg;
1532
Nate Begeman27eeb002005-04-02 05:59:34 +00001533 switch (N.getOpcode()) {
1534 default:
Nate Begemana9795f82005-03-24 04:41:43 +00001535 Reg = Result = (N.getValueType() != MVT::Other) ?
Nate Begeman27eeb002005-04-02 05:59:34 +00001536 MakeReg(N.getValueType()) : 1;
1537 break;
1538 case ISD::CALL:
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001539 // If this is a call instruction, make sure to prepare ALL of the result
1540 // values as well as the chain.
Nate Begeman27eeb002005-04-02 05:59:34 +00001541 if (Node->getNumValues() == 1)
1542 Reg = Result = 1; // Void call, just a chain.
1543 else {
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001544 Result = MakeReg(Node->getValueType(0));
1545 ExprMap[N.getValue(0)] = Result;
Nate Begeman27eeb002005-04-02 05:59:34 +00001546 for (unsigned i = 1, e = N.Val->getNumValues()-1; i != e; ++i)
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001547 ExprMap[N.getValue(i)] = MakeReg(Node->getValueType(i));
Nate Begeman27eeb002005-04-02 05:59:34 +00001548 ExprMap[SDOperand(Node, Node->getNumValues()-1)] = 1;
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001549 }
Nate Begeman27eeb002005-04-02 05:59:34 +00001550 break;
1551 case ISD::ADD_PARTS:
1552 case ISD::SUB_PARTS:
1553 case ISD::SHL_PARTS:
1554 case ISD::SRL_PARTS:
1555 case ISD::SRA_PARTS:
1556 Result = MakeReg(Node->getValueType(0));
1557 ExprMap[N.getValue(0)] = Result;
1558 for (unsigned i = 1, e = N.Val->getNumValues(); i != e; ++i)
1559 ExprMap[N.getValue(i)] = MakeReg(Node->getValueType(i));
1560 break;
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001561 }
1562
Nate Begemane5846682005-04-04 06:52:38 +00001563 if (ISD::CopyFromReg == opcode)
1564 DestType = N.getValue(0).getValueType();
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001565
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001566 if (DestType == MVT::f64 || DestType == MVT::f32)
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001567 if (ISD::LOAD != opcode && ISD::EXTLOAD != opcode &&
Nate Begemana0e3e942005-04-10 01:14:13 +00001568 ISD::UNDEF != opcode && ISD::CALL != opcode)
Nate Begeman74d73452005-03-31 00:15:26 +00001569 return SelectExprFP(N, Result);
Nate Begemana9795f82005-03-24 04:41:43 +00001570
1571 switch (opcode) {
1572 default:
1573 Node->dump();
1574 assert(0 && "Node not handled!\n");
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001575 case ISD::UNDEF:
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001576 BuildMI(BB, PPC::IMPLICIT_DEF, 0, Result);
1577 return Result;
Nate Begemana9795f82005-03-24 04:41:43 +00001578 case ISD::DYNAMIC_STACKALLOC:
Nate Begeman5e966612005-03-24 06:28:42 +00001579 // Generate both result values. FIXME: Need a better commment here?
1580 if (Result != 1)
1581 ExprMap[N.getValue(1)] = 1;
1582 else
1583 Result = ExprMap[N.getValue(0)] = MakeReg(N.getValue(0).getValueType());
1584
1585 // FIXME: We are currently ignoring the requested alignment for handling
1586 // greater than the stack alignment. This will need to be revisited at some
1587 // point. Align = N.getOperand(2);
1588 if (!isa<ConstantSDNode>(N.getOperand(2)) ||
1589 cast<ConstantSDNode>(N.getOperand(2))->getValue() != 0) {
1590 std::cerr << "Cannot allocate stack object with greater alignment than"
1591 << " the stack alignment yet!";
1592 abort();
1593 }
1594 Select(N.getOperand(0));
1595 Tmp1 = SelectExpr(N.getOperand(1));
1596 // Subtract size from stack pointer, thereby allocating some space.
1597 BuildMI(BB, PPC::SUBF, 2, PPC::R1).addReg(Tmp1).addReg(PPC::R1);
1598 // Put a pointer to the space into the result register by copying the SP
1599 BuildMI(BB, PPC::OR, 2, Result).addReg(PPC::R1).addReg(PPC::R1);
1600 return Result;
Nate Begemana9795f82005-03-24 04:41:43 +00001601
1602 case ISD::ConstantPool:
Nate Begemanca12a2b2005-03-28 22:28:37 +00001603 Tmp1 = cast<ConstantPoolSDNode>(N)->getIndex();
1604 Tmp2 = MakeReg(MVT::i32);
1605 BuildMI(BB, PPC::LOADHiAddr, 2, Tmp2).addReg(getGlobalBaseReg())
1606 .addConstantPoolIndex(Tmp1);
1607 BuildMI(BB, PPC::LA, 2, Result).addReg(Tmp2).addConstantPoolIndex(Tmp1);
1608 return Result;
Nate Begemana9795f82005-03-24 04:41:43 +00001609
1610 case ISD::FrameIndex:
Nate Begemanf3d08f32005-03-29 00:03:27 +00001611 Tmp1 = cast<FrameIndexSDNode>(N)->getIndex();
Nate Begeman58f718c2005-03-30 02:23:08 +00001612 addFrameReference(BuildMI(BB, PPC::ADDI, 2, Result), (int)Tmp1, 0, false);
Nate Begemanf3d08f32005-03-29 00:03:27 +00001613 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001614
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001615 case ISD::GlobalAddress: {
1616 GlobalValue *GV = cast<GlobalAddressSDNode>(N)->getGlobal();
Nate Begemanca12a2b2005-03-28 22:28:37 +00001617 Tmp1 = MakeReg(MVT::i32);
Nate Begemanc7b09f12005-03-25 08:34:25 +00001618 BuildMI(BB, PPC::LOADHiAddr, 2, Tmp1).addReg(getGlobalBaseReg())
1619 .addGlobalAddress(GV);
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001620 if (GV->hasWeakLinkage() || GV->isExternal()) {
1621 BuildMI(BB, PPC::LWZ, 2, Result).addGlobalAddress(GV).addReg(Tmp1);
1622 } else {
1623 BuildMI(BB, PPC::LA, 2, Result).addReg(Tmp1).addGlobalAddress(GV);
1624 }
1625 return Result;
1626 }
1627
Nate Begeman5e966612005-03-24 06:28:42 +00001628 case ISD::LOAD:
Nate Begemana9795f82005-03-24 04:41:43 +00001629 case ISD::EXTLOAD:
1630 case ISD::ZEXTLOAD:
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001631 case ISD::SEXTLOAD: {
Nate Begeman9db505c2005-03-28 19:36:43 +00001632 MVT::ValueType TypeBeingLoaded = (ISD::LOAD == opcode) ?
1633 Node->getValueType(0) : cast<MVTSDNode>(Node)->getExtraValueType();
Nate Begeman74d73452005-03-31 00:15:26 +00001634 bool sext = (ISD::SEXTLOAD == opcode);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001635
Nate Begeman5e966612005-03-24 06:28:42 +00001636 // Make sure we generate both values.
1637 if (Result != 1)
1638 ExprMap[N.getValue(1)] = 1; // Generate the token
1639 else
1640 Result = ExprMap[N.getValue(0)] = MakeReg(N.getValue(0).getValueType());
1641
1642 SDOperand Chain = N.getOperand(0);
1643 SDOperand Address = N.getOperand(1);
1644 Select(Chain);
1645
Nate Begeman9db505c2005-03-28 19:36:43 +00001646 switch (TypeBeingLoaded) {
Nate Begeman74d73452005-03-31 00:15:26 +00001647 default: Node->dump(); assert(0 && "Cannot load this type!");
Nate Begeman9db505c2005-03-28 19:36:43 +00001648 case MVT::i1: Opc = PPC::LBZ; break;
1649 case MVT::i8: Opc = PPC::LBZ; break;
1650 case MVT::i16: Opc = sext ? PPC::LHA : PPC::LHZ; break;
1651 case MVT::i32: Opc = PPC::LWZ; break;
Nate Begeman74d73452005-03-31 00:15:26 +00001652 case MVT::f32: Opc = PPC::LFS; break;
1653 case MVT::f64: Opc = PPC::LFD; break;
Nate Begeman5e966612005-03-24 06:28:42 +00001654 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001655
Nate Begeman74d73452005-03-31 00:15:26 +00001656 if (ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(Address)) {
1657 Tmp1 = MakeReg(MVT::i32);
1658 int CPI = CP->getIndex();
1659 BuildMI(BB, PPC::LOADHiAddr, 2, Tmp1).addReg(getGlobalBaseReg())
1660 .addConstantPoolIndex(CPI);
1661 BuildMI(BB, Opc, 2, Result).addConstantPoolIndex(CPI).addReg(Tmp1);
Nate Begeman9db505c2005-03-28 19:36:43 +00001662 }
Nate Begeman74d73452005-03-31 00:15:26 +00001663 else if(Address.getOpcode() == ISD::FrameIndex) {
Nate Begeman58f718c2005-03-30 02:23:08 +00001664 Tmp1 = cast<FrameIndexSDNode>(Address)->getIndex();
1665 addFrameReference(BuildMI(BB, Opc, 2, Result), (int)Tmp1);
Nate Begeman5e966612005-03-24 06:28:42 +00001666 } else {
1667 int offset;
Nate Begeman04730362005-04-01 04:45:11 +00001668 bool idx = SelectAddr(Address, Tmp1, offset);
1669 if (idx) {
1670 Opc = IndexedOpForOp(Opc);
1671 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(offset);
1672 } else {
1673 BuildMI(BB, Opc, 2, Result).addSImm(offset).addReg(Tmp1);
1674 }
Nate Begeman5e966612005-03-24 06:28:42 +00001675 }
1676 return Result;
1677 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001678
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001679 case ISD::CALL: {
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001680 unsigned GPR_idx = 0, FPR_idx = 0;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001681 static const unsigned GPR[] = {
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001682 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
1683 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
1684 };
1685 static const unsigned FPR[] = {
1686 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
1687 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
1688 };
1689
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001690 // Lower the chain for this call.
1691 Select(N.getOperand(0));
1692 ExprMap[N.getValue(Node->getNumValues()-1)] = 1;
Nate Begeman74d73452005-03-31 00:15:26 +00001693
Nate Begemand860aa62005-04-04 22:17:48 +00001694 MachineInstr *CallMI;
1695 // Emit the correct call instruction based on the type of symbol called.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001696 if (GlobalAddressSDNode *GASD =
Nate Begemand860aa62005-04-04 22:17:48 +00001697 dyn_cast<GlobalAddressSDNode>(N.getOperand(1))) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001698 CallMI = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(GASD->getGlobal(),
Nate Begemand860aa62005-04-04 22:17:48 +00001699 true);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001700 } else if (ExternalSymbolSDNode *ESSDN =
Nate Begemand860aa62005-04-04 22:17:48 +00001701 dyn_cast<ExternalSymbolSDNode>(N.getOperand(1))) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001702 CallMI = BuildMI(PPC::CALLpcrel, 1).addExternalSymbol(ESSDN->getSymbol(),
Nate Begemand860aa62005-04-04 22:17:48 +00001703 true);
1704 } else {
1705 Tmp1 = SelectExpr(N.getOperand(1));
1706 BuildMI(BB, PPC::OR, 2, PPC::R12).addReg(Tmp1).addReg(Tmp1);
1707 BuildMI(BB, PPC::MTCTR, 1).addReg(PPC::R12);
1708 CallMI = BuildMI(PPC::CALLindirect, 3).addImm(20).addImm(0)
1709 .addReg(PPC::R12);
1710 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001711
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001712 // Load the register args to virtual regs
1713 std::vector<unsigned> ArgVR;
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001714 for(int i = 2, e = Node->getNumOperands(); i < e; ++i)
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001715 ArgVR.push_back(SelectExpr(N.getOperand(i)));
1716
1717 // Copy the virtual registers into the appropriate argument register
1718 for(int i = 0, e = ArgVR.size(); i < e; ++i) {
1719 switch(N.getOperand(i+2).getValueType()) {
1720 default: Node->dump(); assert(0 && "Unknown value type for call");
1721 case MVT::i1:
1722 case MVT::i8:
1723 case MVT::i16:
1724 case MVT::i32:
1725 assert(GPR_idx < 8 && "Too many int args");
Nate Begemand860aa62005-04-04 22:17:48 +00001726 if (N.getOperand(i+2).getOpcode() != ISD::UNDEF) {
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001727 BuildMI(BB, PPC::OR,2,GPR[GPR_idx]).addReg(ArgVR[i]).addReg(ArgVR[i]);
Nate Begemand860aa62005-04-04 22:17:48 +00001728 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1729 }
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001730 ++GPR_idx;
1731 break;
1732 case MVT::f64:
1733 case MVT::f32:
1734 assert(FPR_idx < 13 && "Too many fp args");
1735 BuildMI(BB, PPC::FMR, 1, FPR[FPR_idx]).addReg(ArgVR[i]);
Nate Begemand860aa62005-04-04 22:17:48 +00001736 CallMI->addRegOperand(FPR[FPR_idx], MachineOperand::Use);
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001737 ++FPR_idx;
1738 break;
1739 }
1740 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001741
Nate Begemand860aa62005-04-04 22:17:48 +00001742 // Put the call instruction in the correct place in the MachineBasicBlock
1743 BB->push_back(CallMI);
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001744
1745 switch (Node->getValueType(0)) {
1746 default: assert(0 && "Unknown value type for call result!");
1747 case MVT::Other: return 1;
1748 case MVT::i1:
1749 case MVT::i8:
1750 case MVT::i16:
1751 case MVT::i32:
Nate Begemane5846682005-04-04 06:52:38 +00001752 if (Node->getValueType(1) == MVT::i32) {
1753 BuildMI(BB, PPC::OR, 2, Result+1).addReg(PPC::R3).addReg(PPC::R3);
1754 BuildMI(BB, PPC::OR, 2, Result).addReg(PPC::R4).addReg(PPC::R4);
1755 } else {
1756 BuildMI(BB, PPC::OR, 2, Result).addReg(PPC::R3).addReg(PPC::R3);
1757 }
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001758 break;
1759 case MVT::f32:
1760 case MVT::f64:
1761 BuildMI(BB, PPC::FMR, 1, Result).addReg(PPC::F1);
1762 break;
1763 }
1764 return Result+N.ResNo;
1765 }
Nate Begemana9795f82005-03-24 04:41:43 +00001766
1767 case ISD::SIGN_EXTEND:
1768 case ISD::SIGN_EXTEND_INREG:
1769 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman9db505c2005-03-28 19:36:43 +00001770 switch(cast<MVTSDNode>(Node)->getExtraValueType()) {
1771 default: Node->dump(); assert(0 && "Unhandled SIGN_EXTEND type"); break;
Nate Begemanc7bd4822005-04-11 06:34:10 +00001772 case MVT::i16:
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001773 BuildMI(BB, PPC::EXTSH, 1, Result).addReg(Tmp1);
Nate Begeman9db505c2005-03-28 19:36:43 +00001774 break;
Nate Begemanc7bd4822005-04-11 06:34:10 +00001775 case MVT::i8:
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001776 BuildMI(BB, PPC::EXTSB, 1, Result).addReg(Tmp1);
Nate Begeman9db505c2005-03-28 19:36:43 +00001777 break;
Nate Begeman74747862005-03-29 22:24:51 +00001778 case MVT::i1:
1779 BuildMI(BB, PPC::SUBFIC, 2, Result).addReg(Tmp1).addSImm(0);
1780 break;
Nate Begeman9db505c2005-03-28 19:36:43 +00001781 }
Nate Begemana9795f82005-03-24 04:41:43 +00001782 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001783
Nate Begemana9795f82005-03-24 04:41:43 +00001784 case ISD::CopyFromReg:
1785 if (Result == 1)
1786 Result = ExprMap[N.getValue(0)] = MakeReg(N.getValue(0).getValueType());
1787 Tmp1 = dyn_cast<RegSDNode>(Node)->getReg();
1788 BuildMI(BB, PPC::OR, 2, Result).addReg(Tmp1).addReg(Tmp1);
1789 return Result;
1790
1791 case ISD::SHL:
Nate Begeman5e966612005-03-24 06:28:42 +00001792 Tmp1 = SelectExpr(N.getOperand(0));
1793 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.getOperand(1))) {
1794 Tmp2 = CN->getValue() & 0x1F;
Nate Begeman33162522005-03-29 21:54:38 +00001795 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp1).addImm(Tmp2).addImm(0)
Nate Begeman5e966612005-03-24 06:28:42 +00001796 .addImm(31-Tmp2);
1797 } else {
Nate Begeman3664cef2005-04-13 22:14:14 +00001798 Tmp2 = FoldIfWideZeroExtend(N.getOperand(1));
Nate Begeman5e966612005-03-24 06:28:42 +00001799 BuildMI(BB, PPC::SLW, 2, Result).addReg(Tmp1).addReg(Tmp2);
1800 }
1801 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001802
Nate Begeman5e966612005-03-24 06:28:42 +00001803 case ISD::SRL:
1804 Tmp1 = SelectExpr(N.getOperand(0));
1805 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.getOperand(1))) {
1806 Tmp2 = CN->getValue() & 0x1F;
Nate Begeman33162522005-03-29 21:54:38 +00001807 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp1).addImm(32-Tmp2)
Nate Begeman5e966612005-03-24 06:28:42 +00001808 .addImm(Tmp2).addImm(31);
1809 } else {
Nate Begeman3664cef2005-04-13 22:14:14 +00001810 Tmp2 = FoldIfWideZeroExtend(N.getOperand(1));
Nate Begeman5e966612005-03-24 06:28:42 +00001811 BuildMI(BB, PPC::SRW, 2, Result).addReg(Tmp1).addReg(Tmp2);
1812 }
1813 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001814
Nate Begeman5e966612005-03-24 06:28:42 +00001815 case ISD::SRA:
1816 Tmp1 = SelectExpr(N.getOperand(0));
1817 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.getOperand(1))) {
1818 Tmp2 = CN->getValue() & 0x1F;
1819 BuildMI(BB, PPC::SRAWI, 2, Result).addReg(Tmp1).addImm(Tmp2);
1820 } else {
Nate Begeman3664cef2005-04-13 22:14:14 +00001821 Tmp2 = FoldIfWideZeroExtend(N.getOperand(1));
Nate Begeman5e966612005-03-24 06:28:42 +00001822 BuildMI(BB, PPC::SRAW, 2, Result).addReg(Tmp1).addReg(Tmp2);
1823 }
1824 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001825
Nate Begemand7c4a4a2005-05-11 23:43:56 +00001826 case ISD::CTLZ:
1827 Tmp1 = SelectExpr(N.getOperand(0));
1828 BuildMI(BB, PPC::CNTLZW, 1, Result).addReg(Tmp1);
1829 return Result;
1830
Nate Begemana9795f82005-03-24 04:41:43 +00001831 case ISD::ADD:
1832 assert (DestType == MVT::i32 && "Only do arithmetic on i32s!");
1833 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman439b4442005-04-05 04:22:58 +00001834 switch(getImmediateForOpcode(N.getOperand(1), opcode, Tmp2)) {
Nate Begemana9795f82005-03-24 04:41:43 +00001835 default: assert(0 && "unhandled result code");
1836 case 0: // No immediate
1837 Tmp2 = SelectExpr(N.getOperand(1));
1838 BuildMI(BB, PPC::ADD, 2, Result).addReg(Tmp1).addReg(Tmp2);
1839 break;
1840 case 1: // Low immediate
1841 BuildMI(BB, PPC::ADDI, 2, Result).addReg(Tmp1).addSImm(Tmp2);
1842 break;
1843 case 2: // Shifted immediate
1844 BuildMI(BB, PPC::ADDIS, 2, Result).addReg(Tmp1).addSImm(Tmp2);
1845 break;
1846 }
1847 return Result;
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001848
Nate Begemana9795f82005-03-24 04:41:43 +00001849 case ISD::AND:
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001850 if (PPCCRopts) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001851 if (N.getOperand(0).getOpcode() == ISD::SETCC ||
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001852 N.getOperand(1).getOpcode() == ISD::SETCC) {
1853 bool Inv;
1854 Tmp1 = SelectCCExpr(N, Opc, Inv, Tmp2);
1855 MoveCRtoGPR(Tmp1, Inv, Tmp2, Result);
1856 return Result;
1857 }
1858 }
Nate Begeman7ddecb42005-04-06 23:51:40 +00001859 // FIXME: should add check in getImmediateForOpcode to return a value
1860 // indicating the immediate is a run of set bits so we can emit a bitfield
1861 // clear with RLWINM instead.
1862 switch(getImmediateForOpcode(N.getOperand(1), opcode, Tmp2)) {
1863 default: assert(0 && "unhandled result code");
1864 case 0: // No immediate
Nate Begemand7c4a4a2005-05-11 23:43:56 +00001865 // Check for andc: and, (xor a, -1), b
1866 if (N.getOperand(0).getOpcode() == ISD::XOR &&
1867 N.getOperand(0).getOperand(1).getOpcode() == ISD::Constant &&
1868 cast<ConstantSDNode>(N.getOperand(0).getOperand(1))->isAllOnesValue()) {
1869 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1870 Tmp2 = SelectExpr(N.getOperand(1));
1871 BuildMI(BB, PPC::ANDC, 2, Result).addReg(Tmp2).addReg(Tmp1);
1872 return Result;
1873 }
1874 // It wasn't and-with-complement, emit a regular and
Chris Lattnercafb67b2005-05-09 17:39:48 +00001875 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman7ddecb42005-04-06 23:51:40 +00001876 Tmp2 = SelectExpr(N.getOperand(1));
Nate Begemanc7bd4822005-04-11 06:34:10 +00001877 Opc = Recording ? PPC::ANDo : PPC::AND;
1878 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
Nate Begeman7ddecb42005-04-06 23:51:40 +00001879 break;
1880 case 1: // Low immediate
Chris Lattnercafb67b2005-05-09 17:39:48 +00001881 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman7ddecb42005-04-06 23:51:40 +00001882 BuildMI(BB, PPC::ANDIo, 2, Result).addReg(Tmp1).addImm(Tmp2);
1883 break;
1884 case 2: // Shifted immediate
Chris Lattnercafb67b2005-05-09 17:39:48 +00001885 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman7ddecb42005-04-06 23:51:40 +00001886 BuildMI(BB, PPC::ANDISo, 2, Result).addReg(Tmp1).addImm(Tmp2);
1887 break;
Nate Begeman9f833d32005-04-12 00:10:02 +00001888 case 5: // Bitfield mask
1889 Opc = Recording ? PPC::RLWINMo : PPC::RLWINM;
1890 Tmp3 = Tmp2 >> 16; // MB
1891 Tmp2 &= 0xFFFF; // ME
Chris Lattnercafb67b2005-05-09 17:39:48 +00001892
1893 if (N.getOperand(0).getOpcode() == ISD::SRL)
1894 if (ConstantSDNode *SA =
1895 dyn_cast<ConstantSDNode>(N.getOperand(0).getOperand(1))) {
1896
1897 // We can fold the RLWINM and the SRL together if the mask is
1898 // clearing the top bits which are rotated around.
1899 unsigned RotAmt = 32-(SA->getValue() & 31);
1900 if (Tmp2 <= RotAmt) {
1901 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1902 BuildMI(BB, Opc, 4, Result).addReg(Tmp1).addImm(RotAmt)
1903 .addImm(Tmp3).addImm(Tmp2);
1904 break;
1905 }
1906 }
1907
1908 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman9f833d32005-04-12 00:10:02 +00001909 BuildMI(BB, Opc, 4, Result).addReg(Tmp1).addImm(0)
1910 .addImm(Tmp3).addImm(Tmp2);
1911 break;
Nate Begeman7ddecb42005-04-06 23:51:40 +00001912 }
Nate Begemanc7bd4822005-04-11 06:34:10 +00001913 RecordSuccess = true;
Nate Begeman7ddecb42005-04-06 23:51:40 +00001914 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001915
Nate Begemana9795f82005-03-24 04:41:43 +00001916 case ISD::OR:
Nate Begeman7ddecb42005-04-06 23:51:40 +00001917 if (SelectBitfieldInsert(N, Result))
1918 return Result;
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001919 if (PPCCRopts) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001920 if (N.getOperand(0).getOpcode() == ISD::SETCC ||
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001921 N.getOperand(1).getOpcode() == ISD::SETCC) {
1922 bool Inv;
1923 Tmp1 = SelectCCExpr(N, Opc, Inv, Tmp2);
1924 MoveCRtoGPR(Tmp1, Inv, Tmp2, Result);
1925 return Result;
1926 }
1927 }
Nate Begemana9795f82005-03-24 04:41:43 +00001928 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman439b4442005-04-05 04:22:58 +00001929 switch(getImmediateForOpcode(N.getOperand(1), opcode, Tmp2)) {
Nate Begemana9795f82005-03-24 04:41:43 +00001930 default: assert(0 && "unhandled result code");
1931 case 0: // No immediate
1932 Tmp2 = SelectExpr(N.getOperand(1));
Nate Begemanc7bd4822005-04-11 06:34:10 +00001933 Opc = Recording ? PPC::ORo : PPC::OR;
1934 RecordSuccess = true;
1935 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
Nate Begemana9795f82005-03-24 04:41:43 +00001936 break;
1937 case 1: // Low immediate
Nate Begeman7ddecb42005-04-06 23:51:40 +00001938 BuildMI(BB, PPC::ORI, 2, Result).addReg(Tmp1).addImm(Tmp2);
Nate Begemana9795f82005-03-24 04:41:43 +00001939 break;
1940 case 2: // Shifted immediate
Nate Begeman7ddecb42005-04-06 23:51:40 +00001941 BuildMI(BB, PPC::ORIS, 2, Result).addReg(Tmp1).addImm(Tmp2);
Nate Begemana9795f82005-03-24 04:41:43 +00001942 break;
1943 }
1944 return Result;
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001945
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001946 case ISD::XOR: {
1947 // Check for EQV: xor, (xor a, -1), b
1948 if (N.getOperand(0).getOpcode() == ISD::XOR &&
1949 N.getOperand(0).getOperand(1).getOpcode() == ISD::Constant &&
1950 cast<ConstantSDNode>(N.getOperand(0).getOperand(1))->isAllOnesValue()) {
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001951 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1952 Tmp2 = SelectExpr(N.getOperand(1));
1953 BuildMI(BB, PPC::EQV, 2, Result).addReg(Tmp1).addReg(Tmp2);
1954 return Result;
1955 }
Chris Lattner837a5212005-04-21 21:09:11 +00001956 // Check for NOT, NOR, EQV, and NAND: xor (copy, or, xor, and), -1
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001957 if (N.getOperand(1).getOpcode() == ISD::Constant &&
1958 cast<ConstantSDNode>(N.getOperand(1))->isAllOnesValue()) {
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001959 switch(N.getOperand(0).getOpcode()) {
1960 case ISD::OR:
1961 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1962 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1));
1963 BuildMI(BB, PPC::NOR, 2, Result).addReg(Tmp1).addReg(Tmp2);
1964 break;
1965 case ISD::AND:
1966 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1967 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1));
1968 BuildMI(BB, PPC::NAND, 2, Result).addReg(Tmp1).addReg(Tmp2);
1969 break;
Chris Lattner837a5212005-04-21 21:09:11 +00001970 case ISD::XOR:
1971 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1972 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1));
1973 BuildMI(BB, PPC::EQV, 2, Result).addReg(Tmp1).addReg(Tmp2);
1974 break;
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001975 default:
1976 Tmp1 = SelectExpr(N.getOperand(0));
1977 BuildMI(BB, PPC::NOR, 2, Result).addReg(Tmp1).addReg(Tmp1);
1978 break;
1979 }
1980 return Result;
1981 }
1982 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman439b4442005-04-05 04:22:58 +00001983 switch(getImmediateForOpcode(N.getOperand(1), opcode, Tmp2)) {
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001984 default: assert(0 && "unhandled result code");
1985 case 0: // No immediate
1986 Tmp2 = SelectExpr(N.getOperand(1));
1987 BuildMI(BB, PPC::XOR, 2, Result).addReg(Tmp1).addReg(Tmp2);
1988 break;
1989 case 1: // Low immediate
1990 BuildMI(BB, PPC::XORI, 2, Result).addReg(Tmp1).addImm(Tmp2);
1991 break;
1992 case 2: // Shifted immediate
1993 BuildMI(BB, PPC::XORIS, 2, Result).addReg(Tmp1).addImm(Tmp2);
1994 break;
1995 }
1996 return Result;
1997 }
1998
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001999 case ISD::SUB:
Nate Begemand7c4a4a2005-05-11 23:43:56 +00002000 if (1 == getImmediateForOpcode(N.getOperand(0), opcode, Tmp1, true)) {
2001 Tmp2 = SelectExpr(N.getOperand(1));
Nate Begeman27523a12005-04-02 00:42:16 +00002002 BuildMI(BB, PPC::SUBFIC, 2, Result).addReg(Tmp2).addSImm(Tmp1);
Nate Begemand7c4a4a2005-05-11 23:43:56 +00002003 } else if (1 == getImmediateForOpcode(N.getOperand(1), opcode, Tmp2)) {
Nate Begeman27523a12005-04-02 00:42:16 +00002004 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begemand7c4a4a2005-05-11 23:43:56 +00002005 BuildMI(BB, PPC::ADDI, 2, Result).addReg(Tmp1).addSImm(Tmp2);
2006 } else {
2007 Tmp1 = SelectExpr(N.getOperand(0));
2008 Tmp2 = SelectExpr(N.getOperand(1));
Nate Begeman27523a12005-04-02 00:42:16 +00002009 BuildMI(BB, PPC::SUBF, 2, Result).addReg(Tmp2).addReg(Tmp1);
2010 }
Nate Begeman9e3e1b52005-03-24 23:35:30 +00002011 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002012
Nate Begeman5e966612005-03-24 06:28:42 +00002013 case ISD::MUL:
Nate Begeman9e3e1b52005-03-24 23:35:30 +00002014 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman439b4442005-04-05 04:22:58 +00002015 if (1 == getImmediateForOpcode(N.getOperand(1), opcode, Tmp2))
Nate Begeman307e7442005-03-26 01:28:53 +00002016 BuildMI(BB, PPC::MULLI, 2, Result).addReg(Tmp1).addSImm(Tmp2);
2017 else {
2018 Tmp2 = SelectExpr(N.getOperand(1));
2019 BuildMI(BB, PPC::MULLW, 2, Result).addReg(Tmp1).addReg(Tmp2);
2020 }
Nate Begeman9e3e1b52005-03-24 23:35:30 +00002021 return Result;
2022
Nate Begeman815d6da2005-04-06 00:25:27 +00002023 case ISD::MULHS:
2024 case ISD::MULHU:
2025 Tmp1 = SelectExpr(N.getOperand(0));
2026 Tmp2 = SelectExpr(N.getOperand(1));
2027 Opc = (ISD::MULHU == opcode) ? PPC::MULHWU : PPC::MULHW;
2028 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
2029 return Result;
2030
Nate Begemanf3d08f32005-03-29 00:03:27 +00002031 case ISD::SDIV:
2032 case ISD::UDIV:
Nate Begeman815d6da2005-04-06 00:25:27 +00002033 switch (getImmediateForOpcode(N.getOperand(1), opcode, Tmp3)) {
2034 default: break;
2035 // If this is an sdiv by a power of two, we can use an srawi/addze pair.
2036 case 3:
Nate Begeman80196b12005-04-05 00:15:08 +00002037 Tmp1 = MakeReg(MVT::i32);
2038 Tmp2 = SelectExpr(N.getOperand(0));
Nate Begeman9f833d32005-04-12 00:10:02 +00002039 if ((int)Tmp3 < 0) {
2040 unsigned Tmp4 = MakeReg(MVT::i32);
2041 BuildMI(BB, PPC::SRAWI, 2, Tmp1).addReg(Tmp2).addImm(-Tmp3);
2042 BuildMI(BB, PPC::ADDZE, 1, Tmp4).addReg(Tmp1);
2043 BuildMI(BB, PPC::NEG, 1, Result).addReg(Tmp4);
2044 } else {
2045 BuildMI(BB, PPC::SRAWI, 2, Tmp1).addReg(Tmp2).addImm(Tmp3);
2046 BuildMI(BB, PPC::ADDZE, 1, Result).addReg(Tmp1);
2047 }
Nate Begeman80196b12005-04-05 00:15:08 +00002048 return Result;
Nate Begeman815d6da2005-04-06 00:25:27 +00002049 // If this is a divide by constant, we can emit code using some magic
2050 // constants to implement it as a multiply instead.
Nate Begeman27b4c232005-04-06 06:44:57 +00002051 case 4:
2052 ExprMap.erase(N);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002053 if (opcode == ISD::SDIV)
Nate Begeman27b4c232005-04-06 06:44:57 +00002054 return SelectExpr(BuildSDIVSequence(N));
2055 else
2056 return SelectExpr(BuildUDIVSequence(N));
Nate Begeman80196b12005-04-05 00:15:08 +00002057 }
Nate Begemanf3d08f32005-03-29 00:03:27 +00002058 Tmp1 = SelectExpr(N.getOperand(0));
2059 Tmp2 = SelectExpr(N.getOperand(1));
2060 Opc = (ISD::UDIV == opcode) ? PPC::DIVWU : PPC::DIVW;
2061 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
2062 return Result;
2063
Nate Begeman9e3e1b52005-03-24 23:35:30 +00002064 case ISD::ADD_PARTS:
Nate Begemanca12a2b2005-03-28 22:28:37 +00002065 case ISD::SUB_PARTS: {
2066 assert(N.getNumOperands() == 4 && N.getValueType() == MVT::i32 &&
2067 "Not an i64 add/sub!");
2068 // Emit all of the operands.
2069 std::vector<unsigned> InVals;
2070 for (unsigned i = 0, e = N.getNumOperands(); i != e; ++i)
2071 InVals.push_back(SelectExpr(N.getOperand(i)));
2072 if (N.getOpcode() == ISD::ADD_PARTS) {
Nate Begeman27eeb002005-04-02 05:59:34 +00002073 BuildMI(BB, PPC::ADDC, 2, Result).addReg(InVals[0]).addReg(InVals[2]);
2074 BuildMI(BB, PPC::ADDE, 2, Result+1).addReg(InVals[1]).addReg(InVals[3]);
Nate Begemanca12a2b2005-03-28 22:28:37 +00002075 } else {
Nate Begeman27eeb002005-04-02 05:59:34 +00002076 BuildMI(BB, PPC::SUBFC, 2, Result).addReg(InVals[2]).addReg(InVals[0]);
2077 BuildMI(BB, PPC::SUBFE, 2, Result+1).addReg(InVals[3]).addReg(InVals[1]);
2078 }
2079 return Result+N.ResNo;
2080 }
2081
2082 case ISD::SHL_PARTS:
2083 case ISD::SRA_PARTS:
2084 case ISD::SRL_PARTS: {
2085 assert(N.getNumOperands() == 3 && N.getValueType() == MVT::i32 &&
2086 "Not an i64 shift!");
2087 unsigned ShiftOpLo = SelectExpr(N.getOperand(0));
2088 unsigned ShiftOpHi = SelectExpr(N.getOperand(1));
Nate Begeman3664cef2005-04-13 22:14:14 +00002089 unsigned SHReg = FoldIfWideZeroExtend(N.getOperand(2));
2090 Tmp1 = MakeReg(MVT::i32);
2091 Tmp2 = MakeReg(MVT::i32);
Nate Begeman27eeb002005-04-02 05:59:34 +00002092 Tmp3 = MakeReg(MVT::i32);
2093 unsigned Tmp4 = MakeReg(MVT::i32);
2094 unsigned Tmp5 = MakeReg(MVT::i32);
2095 unsigned Tmp6 = MakeReg(MVT::i32);
2096 BuildMI(BB, PPC::SUBFIC, 2, Tmp1).addReg(SHReg).addSImm(32);
2097 if (ISD::SHL_PARTS == opcode) {
2098 BuildMI(BB, PPC::SLW, 2, Tmp2).addReg(ShiftOpHi).addReg(SHReg);
2099 BuildMI(BB, PPC::SRW, 2, Tmp3).addReg(ShiftOpLo).addReg(Tmp1);
2100 BuildMI(BB, PPC::OR, 2, Tmp4).addReg(Tmp2).addReg(Tmp3);
2101 BuildMI(BB, PPC::ADDI, 2, Tmp5).addReg(SHReg).addSImm(-32);
Nate Begemanfa554702005-04-03 22:13:27 +00002102 BuildMI(BB, PPC::SLW, 2, Tmp6).addReg(ShiftOpLo).addReg(Tmp5);
Nate Begeman27eeb002005-04-02 05:59:34 +00002103 BuildMI(BB, PPC::OR, 2, Result+1).addReg(Tmp4).addReg(Tmp6);
2104 BuildMI(BB, PPC::SLW, 2, Result).addReg(ShiftOpLo).addReg(SHReg);
2105 } else if (ISD::SRL_PARTS == opcode) {
2106 BuildMI(BB, PPC::SRW, 2, Tmp2).addReg(ShiftOpLo).addReg(SHReg);
2107 BuildMI(BB, PPC::SLW, 2, Tmp3).addReg(ShiftOpHi).addReg(Tmp1);
2108 BuildMI(BB, PPC::OR, 2, Tmp4).addReg(Tmp2).addReg(Tmp3);
2109 BuildMI(BB, PPC::ADDI, 2, Tmp5).addReg(SHReg).addSImm(-32);
2110 BuildMI(BB, PPC::SRW, 2, Tmp6).addReg(ShiftOpHi).addReg(Tmp5);
2111 BuildMI(BB, PPC::OR, 2, Result).addReg(Tmp4).addReg(Tmp6);
2112 BuildMI(BB, PPC::SRW, 2, Result+1).addReg(ShiftOpHi).addReg(SHReg);
2113 } else {
2114 MachineBasicBlock *TmpMBB = new MachineBasicBlock(BB->getBasicBlock());
2115 MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock());
2116 MachineBasicBlock *OldMBB = BB;
2117 MachineFunction *F = BB->getParent();
2118 ilist<MachineBasicBlock>::iterator It = BB; ++It;
2119 F->getBasicBlockList().insert(It, TmpMBB);
2120 F->getBasicBlockList().insert(It, PhiMBB);
2121 BB->addSuccessor(TmpMBB);
2122 BB->addSuccessor(PhiMBB);
2123 BuildMI(BB, PPC::SRW, 2, Tmp2).addReg(ShiftOpLo).addReg(SHReg);
2124 BuildMI(BB, PPC::SLW, 2, Tmp3).addReg(ShiftOpHi).addReg(Tmp1);
2125 BuildMI(BB, PPC::OR, 2, Tmp4).addReg(Tmp2).addReg(Tmp3);
2126 BuildMI(BB, PPC::ADDICo, 2, Tmp5).addReg(SHReg).addSImm(-32);
2127 BuildMI(BB, PPC::SRAW, 2, Tmp6).addReg(ShiftOpHi).addReg(Tmp5);
2128 BuildMI(BB, PPC::SRAW, 2, Result+1).addReg(ShiftOpHi).addReg(SHReg);
2129 BuildMI(BB, PPC::BLE, 2).addReg(PPC::CR0).addMBB(PhiMBB);
2130 // Select correct least significant half if the shift amount > 32
2131 BB = TmpMBB;
2132 unsigned Tmp7 = MakeReg(MVT::i32);
2133 BuildMI(BB, PPC::OR, 2, Tmp7).addReg(Tmp6).addReg(Tmp6);
2134 TmpMBB->addSuccessor(PhiMBB);
2135 BB = PhiMBB;
2136 BuildMI(BB, PPC::PHI, 4, Result).addReg(Tmp4).addMBB(OldMBB)
2137 .addReg(Tmp7).addMBB(TmpMBB);
Nate Begemanca12a2b2005-03-28 22:28:37 +00002138 }
2139 return Result+N.ResNo;
2140 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002141
Nate Begemana9795f82005-03-24 04:41:43 +00002142 case ISD::FP_TO_UINT:
Nate Begeman6b559972005-04-01 02:59:27 +00002143 case ISD::FP_TO_SINT: {
2144 bool U = (ISD::FP_TO_UINT == opcode);
2145 Tmp1 = SelectExpr(N.getOperand(0));
2146 if (!U) {
2147 Tmp2 = MakeReg(MVT::f64);
2148 BuildMI(BB, PPC::FCTIWZ, 1, Tmp2).addReg(Tmp1);
2149 int FrameIdx = BB->getParent()->getFrameInfo()->CreateStackObject(8, 8);
2150 addFrameReference(BuildMI(BB, PPC::STFD, 3).addReg(Tmp2), FrameIdx);
2151 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Result), FrameIdx, 4);
2152 return Result;
2153 } else {
2154 unsigned Zero = getConstDouble(0.0);
2155 unsigned MaxInt = getConstDouble((1LL << 32) - 1);
2156 unsigned Border = getConstDouble(1LL << 31);
2157 unsigned UseZero = MakeReg(MVT::f64);
2158 unsigned UseMaxInt = MakeReg(MVT::f64);
2159 unsigned UseChoice = MakeReg(MVT::f64);
2160 unsigned TmpReg = MakeReg(MVT::f64);
2161 unsigned TmpReg2 = MakeReg(MVT::f64);
2162 unsigned ConvReg = MakeReg(MVT::f64);
2163 unsigned IntTmp = MakeReg(MVT::i32);
2164 unsigned XorReg = MakeReg(MVT::i32);
2165 MachineFunction *F = BB->getParent();
2166 int FrameIdx = F->getFrameInfo()->CreateStackObject(8, 8);
2167 // Update machine-CFG edges
2168 MachineBasicBlock *XorMBB = new MachineBasicBlock(BB->getBasicBlock());
2169 MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock());
2170 MachineBasicBlock *OldMBB = BB;
2171 ilist<MachineBasicBlock>::iterator It = BB; ++It;
2172 F->getBasicBlockList().insert(It, XorMBB);
2173 F->getBasicBlockList().insert(It, PhiMBB);
2174 BB->addSuccessor(XorMBB);
2175 BB->addSuccessor(PhiMBB);
2176 // Convert from floating point to unsigned 32-bit value
2177 // Use 0 if incoming value is < 0.0
2178 BuildMI(BB, PPC::FSEL, 3, UseZero).addReg(Tmp1).addReg(Tmp1).addReg(Zero);
2179 // Use 2**32 - 1 if incoming value is >= 2**32
2180 BuildMI(BB, PPC::FSUB, 2, UseMaxInt).addReg(MaxInt).addReg(Tmp1);
2181 BuildMI(BB, PPC::FSEL, 3, UseChoice).addReg(UseMaxInt).addReg(UseZero)
2182 .addReg(MaxInt);
2183 // Subtract 2**31
2184 BuildMI(BB, PPC::FSUB, 2, TmpReg).addReg(UseChoice).addReg(Border);
2185 // Use difference if >= 2**31
2186 BuildMI(BB, PPC::FCMPU, 2, PPC::CR0).addReg(UseChoice).addReg(Border);
2187 BuildMI(BB, PPC::FSEL, 3, TmpReg2).addReg(TmpReg).addReg(TmpReg)
2188 .addReg(UseChoice);
2189 // Convert to integer
2190 BuildMI(BB, PPC::FCTIWZ, 1, ConvReg).addReg(TmpReg2);
2191 addFrameReference(BuildMI(BB, PPC::STFD, 3).addReg(ConvReg), FrameIdx);
2192 addFrameReference(BuildMI(BB, PPC::LWZ, 2, IntTmp), FrameIdx, 4);
2193 BuildMI(BB, PPC::BLT, 2).addReg(PPC::CR0).addMBB(PhiMBB);
2194 BuildMI(BB, PPC::B, 1).addMBB(XorMBB);
2195
2196 // XorMBB:
2197 // add 2**31 if input was >= 2**31
2198 BB = XorMBB;
2199 BuildMI(BB, PPC::XORIS, 2, XorReg).addReg(IntTmp).addImm(0x8000);
2200 XorMBB->addSuccessor(PhiMBB);
2201
2202 // PhiMBB:
2203 // DestReg = phi [ IntTmp, OldMBB ], [ XorReg, XorMBB ]
2204 BB = PhiMBB;
2205 BuildMI(BB, PPC::PHI, 4, Result).addReg(IntTmp).addMBB(OldMBB)
2206 .addReg(XorReg).addMBB(XorMBB);
2207 return Result;
2208 }
2209 assert(0 && "Should never get here");
2210 return 0;
2211 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002212
Nate Begeman9e3e1b52005-03-24 23:35:30 +00002213 case ISD::SETCC:
Nate Begeman33162522005-03-29 21:54:38 +00002214 if (SetCCSDNode *SetCC = dyn_cast<SetCCSDNode>(Node)) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002215 if (ConstantSDNode *CN =
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002216 dyn_cast<ConstantSDNode>(SetCC->getOperand(1).Val)) {
Nate Begeman9765c252005-04-12 21:22:28 +00002217 // We can codegen setcc op, imm very efficiently compared to a brcond.
2218 // Check for those cases here.
2219 // setcc op, 0
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002220 if (CN->getValue() == 0) {
2221 Tmp1 = SelectExpr(SetCC->getOperand(0));
2222 switch (SetCC->getCondition()) {
Nate Begeman7bfba7d2005-04-14 09:45:08 +00002223 default: SetCC->dump(); assert(0 && "Unhandled SetCC condition"); abort();
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002224 case ISD::SETEQ:
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002225 Tmp2 = MakeReg(MVT::i32);
2226 BuildMI(BB, PPC::CNTLZW, 1, Tmp2).addReg(Tmp1);
2227 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp2).addImm(27)
2228 .addImm(5).addImm(31);
2229 break;
2230 case ISD::SETNE:
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002231 Tmp2 = MakeReg(MVT::i32);
2232 BuildMI(BB, PPC::ADDIC, 2, Tmp2).addReg(Tmp1).addSImm(-1);
2233 BuildMI(BB, PPC::SUBFE, 2, Result).addReg(Tmp2).addReg(Tmp1);
2234 break;
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002235 case ISD::SETLT:
2236 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp1).addImm(1)
2237 .addImm(31).addImm(31);
2238 break;
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002239 case ISD::SETGT:
2240 Tmp2 = MakeReg(MVT::i32);
2241 Tmp3 = MakeReg(MVT::i32);
2242 BuildMI(BB, PPC::NEG, 2, Tmp2).addReg(Tmp1);
2243 BuildMI(BB, PPC::ANDC, 2, Tmp3).addReg(Tmp2).addReg(Tmp1);
2244 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp3).addImm(1)
2245 .addImm(31).addImm(31);
2246 break;
Nate Begeman9765c252005-04-12 21:22:28 +00002247 }
2248 return Result;
2249 }
2250 // setcc op, -1
2251 if (CN->isAllOnesValue()) {
2252 Tmp1 = SelectExpr(SetCC->getOperand(0));
2253 switch (SetCC->getCondition()) {
2254 default: assert(0 && "Unhandled SetCC condition"); abort();
2255 case ISD::SETEQ:
2256 Tmp2 = MakeReg(MVT::i32);
2257 Tmp3 = MakeReg(MVT::i32);
2258 BuildMI(BB, PPC::ADDIC, 2, Tmp2).addReg(Tmp1).addSImm(1);
2259 BuildMI(BB, PPC::LI, 1, Tmp3).addSImm(0);
2260 BuildMI(BB, PPC::ADDZE, 1, Result).addReg(Tmp3);
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002261 break;
Nate Begeman9765c252005-04-12 21:22:28 +00002262 case ISD::SETNE:
2263 Tmp2 = MakeReg(MVT::i32);
2264 Tmp3 = MakeReg(MVT::i32);
2265 BuildMI(BB, PPC::NOR, 2, Tmp2).addReg(Tmp1).addReg(Tmp1);
2266 BuildMI(BB, PPC::ADDIC, 2, Tmp3).addReg(Tmp2).addSImm(-1);
2267 BuildMI(BB, PPC::SUBFE, 2, Result).addReg(Tmp3).addReg(Tmp2);
2268 break;
2269 case ISD::SETLT:
2270 Tmp2 = MakeReg(MVT::i32);
2271 Tmp3 = MakeReg(MVT::i32);
2272 BuildMI(BB, PPC::ADDI, 2, Tmp2).addReg(Tmp1).addSImm(1);
2273 BuildMI(BB, PPC::AND, 2, Tmp3).addReg(Tmp2).addReg(Tmp1);
2274 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp3).addImm(1)
2275 .addImm(31).addImm(31);
2276 break;
2277 case ISD::SETGT:
2278 Tmp2 = MakeReg(MVT::i32);
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002279 BuildMI(BB, PPC::RLWINM, 4, Tmp2).addReg(Tmp1).addImm(1)
2280 .addImm(31).addImm(31);
2281 BuildMI(BB, PPC::XORI, 2, Result).addReg(Tmp2).addImm(1);
2282 break;
2283 }
2284 return Result;
2285 }
2286 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002287
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00002288 bool Inv;
2289 unsigned CCReg = SelectCC(N, Opc, Inv, Tmp2);
2290 MoveCRtoGPR(CCReg, Inv, Tmp2, Result);
Nate Begeman33162522005-03-29 21:54:38 +00002291 return Result;
2292 }
2293 assert(0 && "Is this legal?");
2294 return 0;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002295
Nate Begeman74747862005-03-29 22:24:51 +00002296 case ISD::SELECT: {
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00002297 bool Inv;
Chris Lattner30710192005-04-01 07:10:02 +00002298 unsigned TrueValue = SelectExpr(N.getOperand(1)); //Use if TRUE
2299 unsigned FalseValue = SelectExpr(N.getOperand(2)); //Use if FALSE
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00002300 unsigned CCReg = SelectCC(N.getOperand(0), Opc, Inv, Tmp3);
Chris Lattner30710192005-04-01 07:10:02 +00002301
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002302 // Create an iterator with which to insert the MBB for copying the false
Nate Begeman74747862005-03-29 22:24:51 +00002303 // value and the MBB to hold the PHI instruction for this SetCC.
2304 MachineBasicBlock *thisMBB = BB;
2305 const BasicBlock *LLVM_BB = BB->getBasicBlock();
2306 ilist<MachineBasicBlock>::iterator It = BB;
2307 ++It;
2308
2309 // thisMBB:
2310 // ...
2311 // TrueVal = ...
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00002312 // cmpTY ccX, r1, r2
Nate Begeman74747862005-03-29 22:24:51 +00002313 // bCC copy1MBB
2314 // fallthrough --> copy0MBB
Nate Begeman74747862005-03-29 22:24:51 +00002315 MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB);
2316 MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB);
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00002317 BuildMI(BB, Opc, 2).addReg(CCReg).addMBB(sinkMBB);
Nate Begeman74747862005-03-29 22:24:51 +00002318 MachineFunction *F = BB->getParent();
2319 F->getBasicBlockList().insert(It, copy0MBB);
2320 F->getBasicBlockList().insert(It, sinkMBB);
2321 // Update machine-CFG edges
2322 BB->addSuccessor(copy0MBB);
2323 BB->addSuccessor(sinkMBB);
2324
2325 // copy0MBB:
2326 // %FalseValue = ...
2327 // # fallthrough to sinkMBB
2328 BB = copy0MBB;
Nate Begeman74747862005-03-29 22:24:51 +00002329 // Update machine-CFG edges
2330 BB->addSuccessor(sinkMBB);
2331
2332 // sinkMBB:
2333 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
2334 // ...
2335 BB = sinkMBB;
2336 BuildMI(BB, PPC::PHI, 4, Result).addReg(FalseValue)
2337 .addMBB(copy0MBB).addReg(TrueValue).addMBB(thisMBB);
Nate Begeman74747862005-03-29 22:24:51 +00002338 return Result;
2339 }
Nate Begemana9795f82005-03-24 04:41:43 +00002340
2341 case ISD::Constant:
2342 switch (N.getValueType()) {
2343 default: assert(0 && "Cannot use constants of this type!");
2344 case MVT::i1:
2345 BuildMI(BB, PPC::LI, 1, Result)
2346 .addSImm(!cast<ConstantSDNode>(N)->isNullValue());
2347 break;
2348 case MVT::i32:
2349 {
2350 int v = (int)cast<ConstantSDNode>(N)->getSignExtended();
2351 if (v < 32768 && v >= -32768) {
2352 BuildMI(BB, PPC::LI, 1, Result).addSImm(v);
2353 } else {
Nate Begeman5e966612005-03-24 06:28:42 +00002354 Tmp1 = MakeReg(MVT::i32);
2355 BuildMI(BB, PPC::LIS, 1, Tmp1).addSImm(v >> 16);
2356 BuildMI(BB, PPC::ORI, 2, Result).addReg(Tmp1).addImm(v & 0xFFFF);
Nate Begemana9795f82005-03-24 04:41:43 +00002357 }
2358 }
2359 }
2360 return Result;
2361 }
2362
2363 return 0;
2364}
2365
2366void ISel::Select(SDOperand N) {
2367 unsigned Tmp1, Tmp2, Opc;
2368 unsigned opcode = N.getOpcode();
2369
2370 if (!ExprMap.insert(std::make_pair(N, 1)).second)
2371 return; // Already selected.
2372
2373 SDNode *Node = N.Val;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002374
Nate Begemana9795f82005-03-24 04:41:43 +00002375 switch (Node->getOpcode()) {
2376 default:
2377 Node->dump(); std::cerr << "\n";
2378 assert(0 && "Node not handled yet!");
2379 case ISD::EntryToken: return; // Noop
2380 case ISD::TokenFactor:
2381 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
2382 Select(Node->getOperand(i));
2383 return;
2384 case ISD::ADJCALLSTACKDOWN:
2385 case ISD::ADJCALLSTACKUP:
2386 Select(N.getOperand(0));
2387 Tmp1 = cast<ConstantSDNode>(N.getOperand(1))->getValue();
2388 Opc = N.getOpcode() == ISD::ADJCALLSTACKDOWN ? PPC::ADJCALLSTACKDOWN :
2389 PPC::ADJCALLSTACKUP;
2390 BuildMI(BB, Opc, 1).addImm(Tmp1);
2391 return;
2392 case ISD::BR: {
2393 MachineBasicBlock *Dest =
2394 cast<BasicBlockSDNode>(N.getOperand(1))->getBasicBlock();
Nate Begemana9795f82005-03-24 04:41:43 +00002395 Select(N.getOperand(0));
2396 BuildMI(BB, PPC::B, 1).addMBB(Dest);
2397 return;
2398 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002399 case ISD::BRCOND:
Nate Begemancd08e4c2005-04-09 20:09:12 +00002400 case ISD::BRCONDTWOWAY:
Nate Begemana9795f82005-03-24 04:41:43 +00002401 SelectBranchCC(N);
2402 return;
2403 case ISD::CopyToReg:
2404 Select(N.getOperand(0));
2405 Tmp1 = SelectExpr(N.getOperand(1));
2406 Tmp2 = cast<RegSDNode>(N)->getReg();
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002407
Nate Begemana9795f82005-03-24 04:41:43 +00002408 if (Tmp1 != Tmp2) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002409 if (N.getOperand(1).getValueType() == MVT::f64 ||
Nate Begemana9795f82005-03-24 04:41:43 +00002410 N.getOperand(1).getValueType() == MVT::f32)
2411 BuildMI(BB, PPC::FMR, 1, Tmp2).addReg(Tmp1);
2412 else
2413 BuildMI(BB, PPC::OR, 2, Tmp2).addReg(Tmp1).addReg(Tmp1);
2414 }
2415 return;
2416 case ISD::ImplicitDef:
2417 Select(N.getOperand(0));
2418 BuildMI(BB, PPC::IMPLICIT_DEF, 0, cast<RegSDNode>(N)->getReg());
2419 return;
2420 case ISD::RET:
2421 switch (N.getNumOperands()) {
2422 default:
2423 assert(0 && "Unknown return instruction!");
2424 case 3:
2425 assert(N.getOperand(1).getValueType() == MVT::i32 &&
2426 N.getOperand(2).getValueType() == MVT::i32 &&
Misha Brukman7847fca2005-04-22 17:54:37 +00002427 "Unknown two-register value!");
Nate Begemana9795f82005-03-24 04:41:43 +00002428 Select(N.getOperand(0));
2429 Tmp1 = SelectExpr(N.getOperand(1));
2430 Tmp2 = SelectExpr(N.getOperand(2));
Nate Begeman27523a12005-04-02 00:42:16 +00002431 BuildMI(BB, PPC::OR, 2, PPC::R3).addReg(Tmp2).addReg(Tmp2);
2432 BuildMI(BB, PPC::OR, 2, PPC::R4).addReg(Tmp1).addReg(Tmp1);
Nate Begemana9795f82005-03-24 04:41:43 +00002433 break;
2434 case 2:
2435 Select(N.getOperand(0));
2436 Tmp1 = SelectExpr(N.getOperand(1));
2437 switch (N.getOperand(1).getValueType()) {
2438 default:
2439 assert(0 && "Unknown return type!");
2440 case MVT::f64:
2441 case MVT::f32:
2442 BuildMI(BB, PPC::FMR, 1, PPC::F1).addReg(Tmp1);
2443 break;
2444 case MVT::i32:
2445 BuildMI(BB, PPC::OR, 2, PPC::R3).addReg(Tmp1).addReg(Tmp1);
2446 break;
2447 }
Nate Begeman9e3e1b52005-03-24 23:35:30 +00002448 case 1:
2449 Select(N.getOperand(0));
2450 break;
Nate Begemana9795f82005-03-24 04:41:43 +00002451 }
2452 BuildMI(BB, PPC::BLR, 0); // Just emit a 'ret' instruction
2453 return;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002454 case ISD::TRUNCSTORE:
2455 case ISD::STORE:
Nate Begemana9795f82005-03-24 04:41:43 +00002456 {
2457 SDOperand Chain = N.getOperand(0);
2458 SDOperand Value = N.getOperand(1);
2459 SDOperand Address = N.getOperand(2);
2460 Select(Chain);
2461
2462 Tmp1 = SelectExpr(Value); //value
2463
2464 if (opcode == ISD::STORE) {
2465 switch(Value.getValueType()) {
2466 default: assert(0 && "unknown Type in store");
2467 case MVT::i32: Opc = PPC::STW; break;
2468 case MVT::f64: Opc = PPC::STFD; break;
2469 case MVT::f32: Opc = PPC::STFS; break;
2470 }
2471 } else { //ISD::TRUNCSTORE
2472 switch(cast<MVTSDNode>(Node)->getExtraValueType()) {
2473 default: assert(0 && "unknown Type in store");
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002474 case MVT::i1:
Nate Begemana9795f82005-03-24 04:41:43 +00002475 case MVT::i8: Opc = PPC::STB; break;
2476 case MVT::i16: Opc = PPC::STH; break;
2477 }
2478 }
2479
Nate Begemana7e11a42005-04-01 05:57:17 +00002480 if(Address.getOpcode() == ISD::FrameIndex)
Nate Begemana9795f82005-03-24 04:41:43 +00002481 {
Nate Begeman58f718c2005-03-30 02:23:08 +00002482 Tmp2 = cast<FrameIndexSDNode>(Address)->getIndex();
2483 addFrameReference(BuildMI(BB, Opc, 3).addReg(Tmp1), (int)Tmp2);
Nate Begemana9795f82005-03-24 04:41:43 +00002484 }
2485 else
2486 {
2487 int offset;
Nate Begeman04730362005-04-01 04:45:11 +00002488 bool idx = SelectAddr(Address, Tmp2, offset);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002489 if (idx) {
Nate Begeman04730362005-04-01 04:45:11 +00002490 Opc = IndexedOpForOp(Opc);
2491 BuildMI(BB, Opc, 3).addReg(Tmp1).addReg(Tmp2).addReg(offset);
2492 } else {
2493 BuildMI(BB, Opc, 3).addReg(Tmp1).addImm(offset).addReg(Tmp2);
2494 }
Nate Begemana9795f82005-03-24 04:41:43 +00002495 }
2496 return;
2497 }
2498 case ISD::EXTLOAD:
2499 case ISD::SEXTLOAD:
2500 case ISD::ZEXTLOAD:
2501 case ISD::LOAD:
2502 case ISD::CopyFromReg:
2503 case ISD::CALL:
2504 case ISD::DYNAMIC_STACKALLOC:
2505 ExprMap.erase(N);
2506 SelectExpr(N);
2507 return;
2508 }
2509 assert(0 && "Should not be reached!");
2510}
2511
2512
2513/// createPPC32PatternInstructionSelector - This pass converts an LLVM function
2514/// into a machine code representation using pattern matching and a machine
2515/// description file.
2516///
2517FunctionPass *llvm::createPPC32ISelPattern(TargetMachine &TM) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002518 return new ISel(TM);
Chris Lattner246fa632005-03-24 06:16:18 +00002519}
2520