blob: 8a0f27b108c16958c0478cdebc1a9ad34037b143 [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 Lattner32f3cf62005-05-13 16:20:22 +000067 // We don't support sin/cos/sqrt/fmod
Chris Lattner17234b72005-04-30 04:26:06 +000068 setOperationAction(ISD::FSIN , MVT::f64, Expand);
69 setOperationAction(ISD::FCOS , MVT::f64, Expand);
70 setOperationAction(ISD::FSQRT, MVT::f64, Expand);
Chris Lattner32f3cf62005-05-13 16:20:22 +000071 setOperationAction(ISD::SREM , MVT::f64, Expand);
Chris Lattner17234b72005-04-30 04:26:06 +000072 setOperationAction(ISD::FSIN , MVT::f32, Expand);
73 setOperationAction(ISD::FCOS , MVT::f32, Expand);
74 setOperationAction(ISD::FSQRT, MVT::f32, Expand);
Chris Lattner32f3cf62005-05-13 16:20:22 +000075 setOperationAction(ISD::SREM , MVT::f32, Expand);
Chris Lattner17234b72005-04-30 04:26:06 +000076
Nate Begemand7c4a4a2005-05-11 23:43:56 +000077 //PowerPC does not have CTPOP or CTTZ
Andrew Lenharth691ef2b2005-05-03 17:19:30 +000078 setOperationAction(ISD::CTPOP, MVT::i32 , Expand);
79 setOperationAction(ISD::CTTZ , MVT::i32 , Expand);
Andrew Lenharth691ef2b2005-05-03 17:19:30 +000080
Chris Lattnercbd06fc2005-04-07 19:41:49 +000081 setSetCCResultContents(ZeroOrOneSetCCResult);
Nate Begeman3e897162005-03-31 23:55:40 +000082 addLegalFPImmediate(+0.0); // Necessary for FSEL
Misha Brukmanb5f662f2005-04-21 23:30:14 +000083 addLegalFPImmediate(-0.0); //
Nate Begeman3e897162005-03-31 23:55:40 +000084
Nate Begemana9795f82005-03-24 04:41:43 +000085 computeRegisterProperties();
86 }
87
88 /// LowerArguments - This hook must be implemented to indicate how we should
89 /// lower the arguments for the specified function, into the specified DAG.
90 virtual std::vector<SDOperand>
91 LowerArguments(Function &F, SelectionDAG &DAG);
Misha Brukmanb5f662f2005-04-21 23:30:14 +000092
Nate Begemana9795f82005-03-24 04:41:43 +000093 /// LowerCallTo - This hook lowers an abstract call to a function into an
94 /// actual call.
95 virtual std::pair<SDOperand, SDOperand>
Chris Lattnerc57f6822005-05-12 19:56:45 +000096 LowerCallTo(SDOperand Chain, const Type *RetTy, bool isVarArg, unsigned CC,
Nate Begeman307e7442005-03-26 01:28:53 +000097 SDOperand Callee, ArgListTy &Args, SelectionDAG &DAG);
Misha Brukmanb5f662f2005-04-21 23:30:14 +000098
Nate Begemana9795f82005-03-24 04:41:43 +000099 virtual std::pair<SDOperand, SDOperand>
100 LowerVAStart(SDOperand Chain, SelectionDAG &DAG);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000101
Nate Begemana9795f82005-03-24 04:41:43 +0000102 virtual std::pair<SDOperand,SDOperand>
103 LowerVAArgNext(bool isVANext, SDOperand Chain, SDOperand VAList,
104 const Type *ArgTy, SelectionDAG &DAG);
105
106 virtual std::pair<SDOperand, SDOperand>
107 LowerFrameReturnAddress(bool isFrameAddr, SDOperand Chain, unsigned Depth,
108 SelectionDAG &DAG);
109 };
110}
111
112
113std::vector<SDOperand>
114PPC32TargetLowering::LowerArguments(Function &F, SelectionDAG &DAG) {
115 //
116 // add beautiful description of PPC stack frame format, or at least some docs
117 //
118 MachineFunction &MF = DAG.getMachineFunction();
119 MachineFrameInfo *MFI = MF.getFrameInfo();
120 MachineBasicBlock& BB = MF.front();
121 std::vector<SDOperand> ArgValues;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000122
123 // Due to the rather complicated nature of the PowerPC ABI, rather than a
Nate Begemana9795f82005-03-24 04:41:43 +0000124 // fixed size array of physical args, for the sake of simplicity let the STL
125 // handle tracking them for us.
126 std::vector<unsigned> argVR, argPR, argOp;
127 unsigned ArgOffset = 24;
128 unsigned GPR_remaining = 8;
129 unsigned FPR_remaining = 13;
130 unsigned GPR_idx = 0, FPR_idx = 0;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000131 static const unsigned GPR[] = {
Nate Begemana9795f82005-03-24 04:41:43 +0000132 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
133 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
134 };
135 static const unsigned FPR[] = {
136 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
137 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
138 };
139
140 // Add DAG nodes to load the arguments... On entry to a function on PPC,
141 // the arguments start at offset 24, although they are likely to be passed
142 // in registers.
143 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; ++I) {
144 SDOperand newroot, argt;
145 unsigned ObjSize;
146 bool needsLoad = false;
Nate Begemancd08e4c2005-04-09 20:09:12 +0000147 bool ArgLive = !I->use_empty();
Nate Begemana9795f82005-03-24 04:41:43 +0000148 MVT::ValueType ObjectVT = getValueType(I->getType());
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000149
Nate Begemana9795f82005-03-24 04:41:43 +0000150 switch (ObjectVT) {
151 default: assert(0 && "Unhandled argument type!");
152 case MVT::i1:
153 case MVT::i8:
154 case MVT::i16:
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000155 case MVT::i32:
Nate Begemana9795f82005-03-24 04:41:43 +0000156 ObjSize = 4;
Nate Begemancd08e4c2005-04-09 20:09:12 +0000157 if (!ArgLive) break;
Nate Begemana9795f82005-03-24 04:41:43 +0000158 if (GPR_remaining > 0) {
Nate Begemancd08e4c2005-04-09 20:09:12 +0000159 MF.addLiveIn(GPR[GPR_idx]);
Nate Begemanf70b5762005-03-28 23:08:54 +0000160 argt = newroot = DAG.getCopyFromReg(GPR[GPR_idx], MVT::i32,
161 DAG.getRoot());
Nate Begemana9795f82005-03-24 04:41:43 +0000162 if (ObjectVT != MVT::i32)
163 argt = DAG.getNode(ISD::TRUNCATE, ObjectVT, newroot);
Nate Begemana9795f82005-03-24 04:41:43 +0000164 } else {
165 needsLoad = true;
166 }
167 break;
Nate Begemanf7e43382005-03-26 07:46:36 +0000168 case MVT::i64: ObjSize = 8;
Nate Begemancd08e4c2005-04-09 20:09:12 +0000169 if (!ArgLive) break;
Nate Begemanc5b1cd22005-04-10 05:53:14 +0000170 if (GPR_remaining > 0) {
171 SDOperand argHi, argLo;
Nate Begemancd08e4c2005-04-09 20:09:12 +0000172 MF.addLiveIn(GPR[GPR_idx]);
Nate Begemanc5b1cd22005-04-10 05:53:14 +0000173 argHi = DAG.getCopyFromReg(GPR[GPR_idx], MVT::i32, DAG.getRoot());
174 // If we have two or more remaining argument registers, then both halves
175 // of the i64 can be sourced from there. Otherwise, the lower half will
176 // have to come off the stack. This can happen when an i64 is preceded
177 // by 28 bytes of arguments.
178 if (GPR_remaining > 1) {
179 MF.addLiveIn(GPR[GPR_idx+1]);
180 argLo = DAG.getCopyFromReg(GPR[GPR_idx+1], MVT::i32, argHi);
181 } else {
182 int FI = MFI->CreateFixedObject(4, ArgOffset+4);
183 SDOperand FIN = DAG.getFrameIndex(FI, MVT::i32);
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000184 argLo = DAG.getLoad(MVT::i32, DAG.getEntryNode(), FIN, DAG.getSrcValue(NULL));
Nate Begemanc5b1cd22005-04-10 05:53:14 +0000185 }
Nate Begemanca12a2b2005-03-28 22:28:37 +0000186 // Build the outgoing arg thingy
Nate Begemanf70b5762005-03-28 23:08:54 +0000187 argt = DAG.getNode(ISD::BUILD_PAIR, MVT::i64, argLo, argHi);
188 newroot = argLo;
Nate Begemana9795f82005-03-24 04:41:43 +0000189 } else {
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000190 needsLoad = true;
Nate Begemana9795f82005-03-24 04:41:43 +0000191 }
192 break;
Nate Begemancd08e4c2005-04-09 20:09:12 +0000193 case MVT::f32:
194 case MVT::f64:
195 ObjSize = (ObjectVT == MVT::f64) ? 8 : 4;
196 if (!ArgLive) break;
Nate Begemana9795f82005-03-24 04:41:43 +0000197 if (FPR_remaining > 0) {
Nate Begemancd08e4c2005-04-09 20:09:12 +0000198 MF.addLiveIn(FPR[FPR_idx]);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000199 argt = newroot = DAG.getCopyFromReg(FPR[FPR_idx], ObjectVT,
Nate Begemanf70b5762005-03-28 23:08:54 +0000200 DAG.getRoot());
Nate Begemana9795f82005-03-24 04:41:43 +0000201 --FPR_remaining;
202 ++FPR_idx;
203 } else {
204 needsLoad = true;
205 }
206 break;
207 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000208
Nate Begemana9795f82005-03-24 04:41:43 +0000209 // We need to load the argument to a virtual register if we determined above
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000210 // that we ran out of physical registers of the appropriate type
Nate Begemana9795f82005-03-24 04:41:43 +0000211 if (needsLoad) {
Nate Begemane5846682005-04-04 06:52:38 +0000212 unsigned SubregOffset = 0;
Nate Begemanc3e2db42005-04-04 09:09:00 +0000213 if (ObjectVT == MVT::i8 || ObjectVT == MVT::i1) SubregOffset = 3;
Nate Begemane5846682005-04-04 06:52:38 +0000214 if (ObjectVT == MVT::i16) SubregOffset = 2;
Nate Begemana9795f82005-03-24 04:41:43 +0000215 int FI = MFI->CreateFixedObject(ObjSize, ArgOffset);
216 SDOperand FIN = DAG.getFrameIndex(FI, MVT::i32);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000217 FIN = DAG.getNode(ISD::ADD, MVT::i32, FIN,
Nate Begemane5846682005-04-04 06:52:38 +0000218 DAG.getConstant(SubregOffset, MVT::i32));
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000219 argt = newroot = DAG.getLoad(ObjectVT, DAG.getEntryNode(), FIN, DAG.getSrcValue(NULL));
Nate Begemana9795f82005-03-24 04:41:43 +0000220 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000221
Nate Begemana9795f82005-03-24 04:41:43 +0000222 // Every 4 bytes of argument space consumes one of the GPRs available for
223 // argument passing.
224 if (GPR_remaining > 0) {
225 unsigned delta = (GPR_remaining > 1 && ObjSize == 8) ? 2 : 1;
226 GPR_remaining -= delta;
227 GPR_idx += delta;
228 }
229 ArgOffset += ObjSize;
Chris Lattner91277ea2005-04-09 21:23:24 +0000230 if (newroot.Val)
231 DAG.setRoot(newroot.getValue(1));
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000232
Nate Begemana9795f82005-03-24 04:41:43 +0000233 ArgValues.push_back(argt);
234 }
235
Nate Begemana9795f82005-03-24 04:41:43 +0000236 // If the function takes variable number of arguments, make a frame index for
237 // the start of the first vararg value... for expansion of llvm.va_start.
Nate Begemanfa554702005-04-03 22:13:27 +0000238 if (F.isVarArg()) {
Nate Begemana9795f82005-03-24 04:41:43 +0000239 VarArgsFrameIndex = MFI->CreateFixedObject(4, ArgOffset);
Nate Begemanfa554702005-04-03 22:13:27 +0000240 SDOperand FIN = DAG.getFrameIndex(VarArgsFrameIndex, MVT::i32);
Nate Begeman6644d4c2005-04-03 23:11:17 +0000241 // If this function is vararg, store any remaining integer argument regs
242 // to their spots on the stack so that they may be loaded by deferencing the
243 // result of va_next.
244 std::vector<SDOperand> MemOps;
245 for (; GPR_remaining > 0; --GPR_remaining, ++GPR_idx) {
Nate Begemancd08e4c2005-04-09 20:09:12 +0000246 MF.addLiveIn(GPR[GPR_idx]);
Nate Begeman6644d4c2005-04-03 23:11:17 +0000247 SDOperand Val = DAG.getCopyFromReg(GPR[GPR_idx], MVT::i32, DAG.getRoot());
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000248 SDOperand Store = DAG.getNode(ISD::STORE, MVT::Other, Val.getValue(1),
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000249 Val, FIN, DAG.getSrcValue(NULL));
Nate Begeman6644d4c2005-04-03 23:11:17 +0000250 MemOps.push_back(Store);
251 // Increment the address by four for the next argument to store
252 SDOperand PtrOff = DAG.getConstant(4, getPointerTy());
253 FIN = DAG.getNode(ISD::ADD, MVT::i32, FIN, PtrOff);
254 }
255 DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, MemOps));
Nate Begemanfa554702005-04-03 22:13:27 +0000256 }
Nate Begemana9795f82005-03-24 04:41:43 +0000257
Nate Begemancd08e4c2005-04-09 20:09:12 +0000258 // Finally, inform the code generator which regs we return values in.
259 switch (getValueType(F.getReturnType())) {
260 default: assert(0 && "Unknown type!");
261 case MVT::isVoid: break;
262 case MVT::i1:
263 case MVT::i8:
264 case MVT::i16:
265 case MVT::i32:
266 MF.addLiveOut(PPC::R3);
267 break;
268 case MVT::i64:
269 MF.addLiveOut(PPC::R3);
270 MF.addLiveOut(PPC::R4);
271 break;
272 case MVT::f32:
273 case MVT::f64:
274 MF.addLiveOut(PPC::F1);
275 break;
276 }
277
Nate Begemana9795f82005-03-24 04:41:43 +0000278 return ArgValues;
279}
280
281std::pair<SDOperand, SDOperand>
282PPC32TargetLowering::LowerCallTo(SDOperand Chain,
Misha Brukman7847fca2005-04-22 17:54:37 +0000283 const Type *RetTy, bool isVarArg,
Chris Lattnerc57f6822005-05-12 19:56:45 +0000284 unsigned CallingConv,
Misha Brukman7847fca2005-04-22 17:54:37 +0000285 SDOperand Callee, ArgListTy &Args,
286 SelectionDAG &DAG) {
Nate Begeman307e7442005-03-26 01:28:53 +0000287 // args_to_use will accumulate outgoing args for the ISD::CALL case in
288 // SelectExpr to use to put the arguments in the appropriate registers.
Nate Begemana9795f82005-03-24 04:41:43 +0000289 std::vector<SDOperand> args_to_use;
Nate Begeman307e7442005-03-26 01:28:53 +0000290
291 // Count how many bytes are to be pushed on the stack, including the linkage
292 // area, and parameter passing area.
293 unsigned NumBytes = 24;
294
295 if (Args.empty()) {
Chris Lattner16cd04d2005-05-12 23:24:06 +0000296 Chain = DAG.getNode(ISD::CALLSEQ_START, MVT::Other, Chain,
Nate Begemana7e11a42005-04-01 05:57:17 +0000297 DAG.getConstant(NumBytes, getPointerTy()));
Nate Begeman307e7442005-03-26 01:28:53 +0000298 } else {
299 for (unsigned i = 0, e = Args.size(); i != e; ++i)
300 switch (getValueType(Args[i].second)) {
301 default: assert(0 && "Unknown value type!");
302 case MVT::i1:
303 case MVT::i8:
304 case MVT::i16:
305 case MVT::i32:
306 case MVT::f32:
307 NumBytes += 4;
308 break;
309 case MVT::i64:
310 case MVT::f64:
311 NumBytes += 8;
312 break;
313 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000314
315 // Just to be safe, we'll always reserve the full 24 bytes of linkage area
Nate Begeman307e7442005-03-26 01:28:53 +0000316 // plus 32 bytes of argument space in case any called code gets funky on us.
317 if (NumBytes < 56) NumBytes = 56;
318
319 // Adjust the stack pointer for the new arguments...
320 // These operations are automatically eliminated by the prolog/epilog pass
Chris Lattner16cd04d2005-05-12 23:24:06 +0000321 Chain = DAG.getNode(ISD::CALLSEQ_START, MVT::Other, Chain,
Nate Begeman307e7442005-03-26 01:28:53 +0000322 DAG.getConstant(NumBytes, getPointerTy()));
323
324 // Set up a copy of the stack pointer for use loading and storing any
325 // arguments that may not fit in the registers available for argument
326 // passing.
327 SDOperand StackPtr = DAG.getCopyFromReg(PPC::R1, MVT::i32,
328 DAG.getEntryNode());
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000329
Nate Begeman307e7442005-03-26 01:28:53 +0000330 // Figure out which arguments are going to go in registers, and which in
331 // memory. Also, if this is a vararg function, floating point operations
332 // must be stored to our stack, and loaded into integer regs as well, if
333 // any integer regs are available for argument passing.
334 unsigned ArgOffset = 24;
335 unsigned GPR_remaining = 8;
336 unsigned FPR_remaining = 13;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000337
Nate Begeman74d73452005-03-31 00:15:26 +0000338 std::vector<SDOperand> MemOps;
Nate Begeman307e7442005-03-26 01:28:53 +0000339 for (unsigned i = 0, e = Args.size(); i != e; ++i) {
340 // PtrOff will be used to store the current argument to the stack if a
341 // register cannot be found for it.
342 SDOperand PtrOff = DAG.getConstant(ArgOffset, getPointerTy());
343 PtrOff = DAG.getNode(ISD::ADD, MVT::i32, StackPtr, PtrOff);
Nate Begemanf7e43382005-03-26 07:46:36 +0000344 MVT::ValueType ArgVT = getValueType(Args[i].second);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000345
Nate Begemanf7e43382005-03-26 07:46:36 +0000346 switch (ArgVT) {
Nate Begeman307e7442005-03-26 01:28:53 +0000347 default: assert(0 && "Unexpected ValueType for argument!");
348 case MVT::i1:
349 case MVT::i8:
350 case MVT::i16:
351 // Promote the integer to 32 bits. If the input type is signed use a
352 // sign extend, otherwise use a zero extend.
353 if (Args[i].second->isSigned())
354 Args[i].first =DAG.getNode(ISD::SIGN_EXTEND, MVT::i32, Args[i].first);
355 else
356 Args[i].first =DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, Args[i].first);
357 // FALL THROUGH
358 case MVT::i32:
359 if (GPR_remaining > 0) {
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000360 args_to_use.push_back(Args[i].first);
Nate Begeman307e7442005-03-26 01:28:53 +0000361 --GPR_remaining;
362 } else {
Nate Begeman74d73452005-03-31 00:15:26 +0000363 MemOps.push_back(DAG.getNode(ISD::STORE, MVT::Other, Chain,
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000364 Args[i].first, PtrOff, DAG.getSrcValue(NULL)));
Nate Begeman307e7442005-03-26 01:28:53 +0000365 }
366 ArgOffset += 4;
367 break;
368 case MVT::i64:
Nate Begemanf7e43382005-03-26 07:46:36 +0000369 // If we have one free GPR left, we can place the upper half of the i64
370 // in it, and store the other half to the stack. If we have two or more
371 // free GPRs, then we can pass both halves of the i64 in registers.
372 if (GPR_remaining > 0) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000373 SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, MVT::i32,
Nate Begemanf2622612005-03-26 02:17:46 +0000374 Args[i].first, DAG.getConstant(1, MVT::i32));
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000375 SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, MVT::i32,
Nate Begemanf2622612005-03-26 02:17:46 +0000376 Args[i].first, DAG.getConstant(0, MVT::i32));
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000377 args_to_use.push_back(Hi);
Nate Begeman74d73452005-03-31 00:15:26 +0000378 --GPR_remaining;
Nate Begeman74d73452005-03-31 00:15:26 +0000379 if (GPR_remaining > 0) {
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000380 args_to_use.push_back(Lo);
Nate Begeman74d73452005-03-31 00:15:26 +0000381 --GPR_remaining;
Nate Begemanf7e43382005-03-26 07:46:36 +0000382 } else {
383 SDOperand ConstFour = DAG.getConstant(4, getPointerTy());
384 PtrOff = DAG.getNode(ISD::ADD, MVT::i32, PtrOff, ConstFour);
Nate Begeman74d73452005-03-31 00:15:26 +0000385 MemOps.push_back(DAG.getNode(ISD::STORE, MVT::Other, Chain,
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000386 Lo, PtrOff, DAG.getSrcValue(NULL)));
Nate Begemanf7e43382005-03-26 07:46:36 +0000387 }
Nate Begeman307e7442005-03-26 01:28:53 +0000388 } else {
Nate Begeman74d73452005-03-31 00:15:26 +0000389 MemOps.push_back(DAG.getNode(ISD::STORE, MVT::Other, Chain,
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000390 Args[i].first, PtrOff, DAG.getSrcValue(NULL)));
Nate Begeman307e7442005-03-26 01:28:53 +0000391 }
392 ArgOffset += 8;
393 break;
394 case MVT::f32:
Nate Begeman307e7442005-03-26 01:28:53 +0000395 case MVT::f64:
Nate Begemanf7e43382005-03-26 07:46:36 +0000396 if (FPR_remaining > 0) {
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000397 args_to_use.push_back(Args[i].first);
398 --FPR_remaining;
Nate Begemanf7e43382005-03-26 07:46:36 +0000399 if (isVarArg) {
Nate Begeman96fc6812005-03-31 02:05:53 +0000400 SDOperand Store = DAG.getNode(ISD::STORE, MVT::Other, Chain,
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000401 Args[i].first, PtrOff, DAG.getSrcValue(NULL));
Nate Begeman96fc6812005-03-31 02:05:53 +0000402 MemOps.push_back(Store);
Nate Begeman74d73452005-03-31 00:15:26 +0000403 // Float varargs are always shadowed in available integer registers
404 if (GPR_remaining > 0) {
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000405 SDOperand Load = DAG.getLoad(MVT::i32, Store, PtrOff, DAG.getSrcValue(NULL));
Nate Begeman74d73452005-03-31 00:15:26 +0000406 MemOps.push_back(Load);
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000407 args_to_use.push_back(Load);
408 --GPR_remaining;
Nate Begeman74d73452005-03-31 00:15:26 +0000409 }
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000410 if (GPR_remaining > 0 && MVT::f64 == ArgVT) {
Nate Begeman74d73452005-03-31 00:15:26 +0000411 SDOperand ConstFour = DAG.getConstant(4, getPointerTy());
412 PtrOff = DAG.getNode(ISD::ADD, MVT::i32, PtrOff, ConstFour);
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000413 SDOperand Load = DAG.getLoad(MVT::i32, Store, PtrOff, DAG.getSrcValue(NULL));
Nate Begeman74d73452005-03-31 00:15:26 +0000414 MemOps.push_back(Load);
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000415 args_to_use.push_back(Load);
416 --GPR_remaining;
Nate Begeman74d73452005-03-31 00:15:26 +0000417 }
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000418 } else {
419 // If we have any FPRs remaining, we may also have GPRs remaining.
420 // Args passed in FPRs consume either 1 (f32) or 2 (f64) available
421 // GPRs.
422 if (GPR_remaining > 0) {
423 args_to_use.push_back(DAG.getNode(ISD::UNDEF, MVT::i32));
424 --GPR_remaining;
425 }
426 if (GPR_remaining > 0 && MVT::f64 == ArgVT) {
427 args_to_use.push_back(DAG.getNode(ISD::UNDEF, MVT::i32));
428 --GPR_remaining;
429 }
Nate Begeman74d73452005-03-31 00:15:26 +0000430 }
Nate Begeman307e7442005-03-26 01:28:53 +0000431 } else {
Nate Begeman74d73452005-03-31 00:15:26 +0000432 MemOps.push_back(DAG.getNode(ISD::STORE, MVT::Other, Chain,
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000433 Args[i].first, PtrOff, DAG.getSrcValue(NULL)));
Nate Begeman307e7442005-03-26 01:28:53 +0000434 }
Nate Begemanf7e43382005-03-26 07:46:36 +0000435 ArgOffset += (ArgVT == MVT::f32) ? 4 : 8;
Nate Begeman307e7442005-03-26 01:28:53 +0000436 break;
437 }
Nate Begemana9795f82005-03-24 04:41:43 +0000438 }
Nate Begeman74d73452005-03-31 00:15:26 +0000439 if (!MemOps.empty())
440 Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, MemOps);
Nate Begemana9795f82005-03-24 04:41:43 +0000441 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000442
Nate Begemana9795f82005-03-24 04:41:43 +0000443 std::vector<MVT::ValueType> RetVals;
444 MVT::ValueType RetTyVT = getValueType(RetTy);
445 if (RetTyVT != MVT::isVoid)
446 RetVals.push_back(RetTyVT);
447 RetVals.push_back(MVT::Other);
448
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000449 SDOperand TheCall = SDOperand(DAG.getCall(RetVals,
Nate Begemana9795f82005-03-24 04:41:43 +0000450 Chain, Callee, args_to_use), 0);
451 Chain = TheCall.getValue(RetTyVT != MVT::isVoid);
Chris Lattner16cd04d2005-05-12 23:24:06 +0000452 Chain = DAG.getNode(ISD::CALLSEQ_END, MVT::Other, Chain,
Nate Begemana9795f82005-03-24 04:41:43 +0000453 DAG.getConstant(NumBytes, getPointerTy()));
454 return std::make_pair(TheCall, Chain);
455}
456
457std::pair<SDOperand, SDOperand>
458PPC32TargetLowering::LowerVAStart(SDOperand Chain, SelectionDAG &DAG) {
459 //vastart just returns the address of the VarArgsFrameIndex slot.
460 return std::make_pair(DAG.getFrameIndex(VarArgsFrameIndex, MVT::i32), Chain);
461}
462
463std::pair<SDOperand,SDOperand> PPC32TargetLowering::
464LowerVAArgNext(bool isVANext, SDOperand Chain, SDOperand VAList,
465 const Type *ArgTy, SelectionDAG &DAG) {
Nate Begemanc7b09f12005-03-25 08:34:25 +0000466 MVT::ValueType ArgVT = getValueType(ArgTy);
467 SDOperand Result;
468 if (!isVANext) {
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000469 Result = DAG.getLoad(ArgVT, DAG.getEntryNode(), VAList, DAG.getSrcValue(NULL));
Nate Begemanc7b09f12005-03-25 08:34:25 +0000470 } else {
471 unsigned Amt;
472 if (ArgVT == MVT::i32 || ArgVT == MVT::f32)
473 Amt = 4;
474 else {
475 assert((ArgVT == MVT::i64 || ArgVT == MVT::f64) &&
476 "Other types should have been promoted for varargs!");
477 Amt = 8;
478 }
479 Result = DAG.getNode(ISD::ADD, VAList.getValueType(), VAList,
480 DAG.getConstant(Amt, VAList.getValueType()));
481 }
482 return std::make_pair(Result, Chain);
Nate Begemana9795f82005-03-24 04:41:43 +0000483}
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000484
Nate Begemana9795f82005-03-24 04:41:43 +0000485
486std::pair<SDOperand, SDOperand> PPC32TargetLowering::
487LowerFrameReturnAddress(bool isFrameAddress, SDOperand Chain, unsigned Depth,
488 SelectionDAG &DAG) {
Nate Begeman01d05262005-03-30 01:45:43 +0000489 assert(0 && "LowerFrameReturnAddress unimplemented");
Nate Begemana9795f82005-03-24 04:41:43 +0000490 abort();
491}
492
493namespace {
Nate Begemanc7bd4822005-04-11 06:34:10 +0000494Statistic<>Recorded("ppc-codegen", "Number of recording ops emitted");
Nate Begeman93075ec2005-04-04 23:40:36 +0000495Statistic<>FusedFP("ppc-codegen", "Number of fused fp operations");
Nate Begeman7bfba7d2005-04-14 09:45:08 +0000496Statistic<>MultiBranch("ppc-codegen", "Number of setcc logical ops collapsed");
Nate Begemana9795f82005-03-24 04:41:43 +0000497//===--------------------------------------------------------------------===//
498/// ISel - PPC32 specific code to select PPC32 machine instructions for
499/// SelectionDAG operations.
500//===--------------------------------------------------------------------===//
501class ISel : public SelectionDAGISel {
Nate Begemana9795f82005-03-24 04:41:43 +0000502 PPC32TargetLowering PPC32Lowering;
Nate Begeman815d6da2005-04-06 00:25:27 +0000503 SelectionDAG *ISelDAG; // Hack to support us having a dag->dag transform
504 // for sdiv and udiv until it is put into the future
505 // dag combiner.
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000506
Nate Begemana9795f82005-03-24 04:41:43 +0000507 /// ExprMap - As shared expressions are codegen'd, we keep track of which
508 /// vreg the value is produced in, so we only emit one copy of each compiled
509 /// tree.
510 std::map<SDOperand, unsigned> ExprMap;
Nate Begemanc7b09f12005-03-25 08:34:25 +0000511
512 unsigned GlobalBaseReg;
513 bool GlobalBaseInitialized;
Nate Begemanc7bd4822005-04-11 06:34:10 +0000514 bool RecordSuccess;
Nate Begemana9795f82005-03-24 04:41:43 +0000515public:
Nate Begeman815d6da2005-04-06 00:25:27 +0000516 ISel(TargetMachine &TM) : SelectionDAGISel(PPC32Lowering), PPC32Lowering(TM),
517 ISelDAG(0) {}
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000518
Nate Begemanc7b09f12005-03-25 08:34:25 +0000519 /// runOnFunction - Override this function in order to reset our per-function
520 /// variables.
521 virtual bool runOnFunction(Function &Fn) {
522 // Make sure we re-emit a set of the global base reg if necessary
523 GlobalBaseInitialized = false;
524 return SelectionDAGISel::runOnFunction(Fn);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000525 }
526
Nate Begemana9795f82005-03-24 04:41:43 +0000527 /// InstructionSelectBasicBlock - This callback is invoked by
528 /// SelectionDAGISel when it has created a SelectionDAG for us to codegen.
529 virtual void InstructionSelectBasicBlock(SelectionDAG &DAG) {
530 DEBUG(BB->dump());
531 // Codegen the basic block.
Nate Begeman815d6da2005-04-06 00:25:27 +0000532 ISelDAG = &DAG;
Nate Begemana9795f82005-03-24 04:41:43 +0000533 Select(DAG.getRoot());
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000534
Nate Begemana9795f82005-03-24 04:41:43 +0000535 // Clear state used for selection.
536 ExprMap.clear();
Nate Begeman815d6da2005-04-06 00:25:27 +0000537 ISelDAG = 0;
Nate Begemana9795f82005-03-24 04:41:43 +0000538 }
Nate Begeman815d6da2005-04-06 00:25:27 +0000539
540 // dag -> dag expanders for integer divide by constant
541 SDOperand BuildSDIVSequence(SDOperand N);
542 SDOperand BuildUDIVSequence(SDOperand N);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000543
Nate Begemandffcfcc2005-04-01 00:32:34 +0000544 unsigned getGlobalBaseReg();
Nate Begeman6b559972005-04-01 02:59:27 +0000545 unsigned getConstDouble(double floatVal, unsigned Result);
Nate Begeman1cbf3ab2005-04-18 07:48:09 +0000546 void MoveCRtoGPR(unsigned CCReg, bool Inv, unsigned Idx, unsigned Result);
Nate Begeman7ddecb42005-04-06 23:51:40 +0000547 bool SelectBitfieldInsert(SDOperand OR, unsigned Result);
Nate Begeman3664cef2005-04-13 22:14:14 +0000548 unsigned FoldIfWideZeroExtend(SDOperand N);
Nate Begeman1cbf3ab2005-04-18 07:48:09 +0000549 unsigned SelectCC(SDOperand CC, unsigned &Opc, bool &Inv, unsigned &Idx);
550 unsigned SelectCCExpr(SDOperand N, unsigned& Opc, bool &Inv, unsigned &Idx);
Nate Begemanc7bd4822005-04-11 06:34:10 +0000551 unsigned SelectExpr(SDOperand N, bool Recording=false);
Nate Begemana9795f82005-03-24 04:41:43 +0000552 unsigned SelectExprFP(SDOperand N, unsigned Result);
553 void Select(SDOperand N);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000554
Nate Begeman04730362005-04-01 04:45:11 +0000555 bool SelectAddr(SDOperand N, unsigned& Reg, int& offset);
Nate Begemana9795f82005-03-24 04:41:43 +0000556 void SelectBranchCC(SDOperand N);
557};
558
Nate Begeman80196b12005-04-05 00:15:08 +0000559/// ExactLog2 - This function solves for (Val == 1 << (N-1)) and returns N. It
560/// returns zero when the input is not exactly a power of two.
561static unsigned ExactLog2(unsigned Val) {
562 if (Val == 0 || (Val & (Val-1))) return 0;
563 unsigned Count = 0;
564 while (Val != 1) {
565 Val >>= 1;
566 ++Count;
567 }
568 return Count;
569}
570
Nate Begeman7ddecb42005-04-06 23:51:40 +0000571// IsRunOfOnes - returns true if Val consists of one contiguous run of 1's with
572// any number of 0's on either side. the 1's are allowed to wrap from LSB to
573// MSB. so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is
574// not, since all 1's are not contiguous.
575static bool IsRunOfOnes(unsigned Val, unsigned &MB, unsigned &ME) {
576 bool isRun = true;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000577 MB = 0;
Nate Begeman7ddecb42005-04-06 23:51:40 +0000578 ME = 0;
579
580 // look for first set bit
581 int i = 0;
582 for (; i < 32; i++) {
583 if ((Val & (1 << (31 - i))) != 0) {
584 MB = i;
585 ME = i;
586 break;
587 }
588 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000589
Nate Begeman7ddecb42005-04-06 23:51:40 +0000590 // look for last set bit
591 for (; i < 32; i++) {
592 if ((Val & (1 << (31 - i))) == 0)
593 break;
594 ME = i;
595 }
596
597 // look for next set bit
598 for (; i < 32; i++) {
599 if ((Val & (1 << (31 - i))) != 0)
600 break;
601 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000602
Nate Begeman7ddecb42005-04-06 23:51:40 +0000603 // if we exhausted all the bits, we found a match at this point for 0*1*0*
604 if (i == 32)
605 return true;
606
607 // since we just encountered more 1's, if it doesn't wrap around to the
608 // most significant bit of the word, then we did not find a match to 1*0*1* so
609 // exit.
610 if (MB != 0)
611 return false;
612
613 // look for last set bit
614 for (MB = i; i < 32; i++) {
615 if ((Val & (1 << (31 - i))) == 0)
616 break;
617 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000618
Nate Begeman7ddecb42005-04-06 23:51:40 +0000619 // if we exhausted all the bits, then we found a match for 1*0*1*, otherwise,
620 // the value is not a run of ones.
621 if (i == 32)
622 return true;
623 return false;
624}
625
Nate Begeman439b4442005-04-05 04:22:58 +0000626/// getImmediateForOpcode - This method returns a value indicating whether
Nate Begemana9795f82005-03-24 04:41:43 +0000627/// the ConstantSDNode N can be used as an immediate to Opcode. The return
628/// values are either 0, 1 or 2. 0 indicates that either N is not a
Nate Begeman9f833d32005-04-12 00:10:02 +0000629/// ConstantSDNode, or is not suitable for use by that opcode.
630/// Return value codes for turning into an enum someday:
631/// 1: constant may be used in normal immediate form.
632/// 2: constant may be used in shifted immediate form.
633/// 3: log base 2 of the constant may be used.
634/// 4: constant is suitable for integer division conversion
635/// 5: constant is a bitfield mask
Nate Begemana9795f82005-03-24 04:41:43 +0000636///
Nate Begeman439b4442005-04-05 04:22:58 +0000637static unsigned getImmediateForOpcode(SDOperand N, unsigned Opcode,
638 unsigned& Imm, bool U = false) {
Nate Begemana9795f82005-03-24 04:41:43 +0000639 if (N.getOpcode() != ISD::Constant) return 0;
640
641 int v = (int)cast<ConstantSDNode>(N)->getSignExtended();
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000642
Nate Begemana9795f82005-03-24 04:41:43 +0000643 switch(Opcode) {
644 default: return 0;
645 case ISD::ADD:
646 if (v <= 32767 && v >= -32768) { Imm = v & 0xFFFF; return 1; }
647 if ((v & 0x0000FFFF) == 0) { Imm = v >> 16; return 2; }
648 break;
Nate Begeman9f833d32005-04-12 00:10:02 +0000649 case ISD::AND: {
650 unsigned MB, ME;
651 if (IsRunOfOnes(v, MB, ME)) { Imm = MB << 16 | ME & 0xFFFF; return 5; }
652 if (v >= 0 && v <= 65535) { Imm = v & 0xFFFF; return 1; }
653 if ((v & 0x0000FFFF) == 0) { Imm = v >> 16; return 2; }
654 break;
655 }
Nate Begemana9795f82005-03-24 04:41:43 +0000656 case ISD::XOR:
657 case ISD::OR:
658 if (v >= 0 && v <= 65535) { Imm = v & 0xFFFF; return 1; }
659 if ((v & 0x0000FFFF) == 0) { Imm = v >> 16; return 2; }
660 break;
Nate Begeman307e7442005-03-26 01:28:53 +0000661 case ISD::MUL:
662 if (v <= 32767 && v >= -32768) { Imm = v & 0xFFFF; return 1; }
663 break;
Nate Begemand7c4a4a2005-05-11 23:43:56 +0000664 case ISD::SUB:
665 // handle subtract-from separately from subtract, since subi is really addi
666 if (U && v <= 32767 && v >= -32768) { Imm = v & 0xFFFF; return 1; }
667 if (!U && v <= 32768 && v >= -32767) { Imm = (-v) & 0xFFFF; return 1; }
668 break;
Nate Begeman3e897162005-03-31 23:55:40 +0000669 case ISD::SETCC:
670 if (U && (v >= 0 && v <= 65535)) { Imm = v & 0xFFFF; return 1; }
671 if (!U && (v <= 32767 && v >= -32768)) { Imm = v & 0xFFFF; return 1; }
672 break;
Nate Begeman80196b12005-04-05 00:15:08 +0000673 case ISD::SDIV:
Nate Begeman439b4442005-04-05 04:22:58 +0000674 if ((Imm = ExactLog2(v))) { return 3; }
Nate Begeman9f833d32005-04-12 00:10:02 +0000675 if ((Imm = ExactLog2(-v))) { Imm = -Imm; return 3; }
Nate Begeman815d6da2005-04-06 00:25:27 +0000676 if (v <= -2 || v >= 2) { return 4; }
677 break;
678 case ISD::UDIV:
Nate Begeman27b4c232005-04-06 06:44:57 +0000679 if (v > 1) { return 4; }
Nate Begeman80196b12005-04-05 00:15:08 +0000680 break;
Nate Begemana9795f82005-03-24 04:41:43 +0000681 }
682 return 0;
683}
Nate Begeman3e897162005-03-31 23:55:40 +0000684
Nate Begemanc7bd4822005-04-11 06:34:10 +0000685/// NodeHasRecordingVariant - If SelectExpr can always produce code for
686/// NodeOpcode that also sets CR0 as a side effect, return true. Otherwise,
687/// return false.
688static bool NodeHasRecordingVariant(unsigned NodeOpcode) {
689 switch(NodeOpcode) {
690 default: return false;
691 case ISD::AND:
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000692 case ISD::OR:
Chris Lattner519f40b2005-04-13 02:46:17 +0000693 return true;
Nate Begemanc7bd4822005-04-11 06:34:10 +0000694 }
695}
696
Nate Begeman3e897162005-03-31 23:55:40 +0000697/// getBCCForSetCC - Returns the PowerPC condition branch mnemonic corresponding
698/// to Condition. If the Condition is unordered or unsigned, the bool argument
699/// U is set to true, otherwise it is set to false.
700static unsigned getBCCForSetCC(unsigned Condition, bool& U) {
701 U = false;
702 switch (Condition) {
703 default: assert(0 && "Unknown condition!"); abort();
704 case ISD::SETEQ: return PPC::BEQ;
705 case ISD::SETNE: return PPC::BNE;
706 case ISD::SETULT: U = true;
707 case ISD::SETLT: return PPC::BLT;
708 case ISD::SETULE: U = true;
709 case ISD::SETLE: return PPC::BLE;
710 case ISD::SETUGT: U = true;
711 case ISD::SETGT: return PPC::BGT;
712 case ISD::SETUGE: U = true;
713 case ISD::SETGE: return PPC::BGE;
714 }
Nate Begeman04730362005-04-01 04:45:11 +0000715 return 0;
716}
717
Nate Begeman7bfba7d2005-04-14 09:45:08 +0000718/// getCROpForOp - Return the condition register opcode (or inverted opcode)
719/// associated with the SelectionDAG opcode.
720static unsigned getCROpForSetCC(unsigned Opcode, bool Inv1, bool Inv2) {
721 switch (Opcode) {
722 default: assert(0 && "Unknown opcode!"); abort();
723 case ISD::AND:
724 if (Inv1 && Inv2) return PPC::CRNOR; // De Morgan's Law
725 if (!Inv1 && !Inv2) return PPC::CRAND;
726 if (Inv1 ^ Inv2) return PPC::CRANDC;
727 case ISD::OR:
728 if (Inv1 && Inv2) return PPC::CRNAND; // De Morgan's Law
729 if (!Inv1 && !Inv2) return PPC::CROR;
730 if (Inv1 ^ Inv2) return PPC::CRORC;
731 }
732 return 0;
733}
734
735/// getCRIdxForSetCC - Return the index of the condition register field
736/// associated with the SetCC condition, and whether or not the field is
737/// treated as inverted. That is, lt = 0; ge = 0 inverted.
738static unsigned getCRIdxForSetCC(unsigned Condition, bool& Inv) {
739 switch (Condition) {
740 default: assert(0 && "Unknown condition!"); abort();
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000741 case ISD::SETULT:
Nate Begeman7bfba7d2005-04-14 09:45:08 +0000742 case ISD::SETLT: Inv = false; return 0;
743 case ISD::SETUGE:
744 case ISD::SETGE: Inv = true; return 0;
745 case ISD::SETUGT:
746 case ISD::SETGT: Inv = false; return 1;
747 case ISD::SETULE:
748 case ISD::SETLE: Inv = true; return 1;
749 case ISD::SETEQ: Inv = false; return 2;
750 case ISD::SETNE: Inv = true; return 2;
751 }
752 return 0;
753}
754
Nate Begeman04730362005-04-01 04:45:11 +0000755/// IndexedOpForOp - Return the indexed variant for each of the PowerPC load
756/// and store immediate instructions.
757static unsigned IndexedOpForOp(unsigned Opcode) {
758 switch(Opcode) {
759 default: assert(0 && "Unknown opcode!"); abort();
760 case PPC::LBZ: return PPC::LBZX; case PPC::STB: return PPC::STBX;
761 case PPC::LHZ: return PPC::LHZX; case PPC::STH: return PPC::STHX;
762 case PPC::LHA: return PPC::LHAX; case PPC::STW: return PPC::STWX;
763 case PPC::LWZ: return PPC::LWZX; case PPC::STFS: return PPC::STFSX;
764 case PPC::LFS: return PPC::LFSX; case PPC::STFD: return PPC::STFDX;
765 case PPC::LFD: return PPC::LFDX;
766 }
767 return 0;
Nate Begeman3e897162005-03-31 23:55:40 +0000768}
Nate Begeman815d6da2005-04-06 00:25:27 +0000769
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000770// Structure used to return the necessary information to codegen an SDIV as
Nate Begeman815d6da2005-04-06 00:25:27 +0000771// a multiply.
772struct ms {
773 int m; // magic number
774 int s; // shift amount
775};
776
777struct mu {
778 unsigned int m; // magic number
779 int a; // add indicator
780 int s; // shift amount
781};
782
783/// magic - calculate the magic numbers required to codegen an integer sdiv as
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000784/// a sequence of multiply and shifts. Requires that the divisor not be 0, 1,
Nate Begeman815d6da2005-04-06 00:25:27 +0000785/// or -1.
786static struct ms magic(int d) {
787 int p;
788 unsigned int ad, anc, delta, q1, r1, q2, r2, t;
789 const unsigned int two31 = 2147483648U; // 2^31
790 struct ms mag;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000791
Nate Begeman815d6da2005-04-06 00:25:27 +0000792 ad = abs(d);
793 t = two31 + ((unsigned int)d >> 31);
794 anc = t - 1 - t%ad; // absolute value of nc
795 p = 31; // initialize p
796 q1 = two31/anc; // initialize q1 = 2p/abs(nc)
797 r1 = two31 - q1*anc; // initialize r1 = rem(2p,abs(nc))
798 q2 = two31/ad; // initialize q2 = 2p/abs(d)
799 r2 = two31 - q2*ad; // initialize r2 = rem(2p,abs(d))
800 do {
801 p = p + 1;
802 q1 = 2*q1; // update q1 = 2p/abs(nc)
803 r1 = 2*r1; // update r1 = rem(2p/abs(nc))
804 if (r1 >= anc) { // must be unsigned comparison
805 q1 = q1 + 1;
806 r1 = r1 - anc;
807 }
808 q2 = 2*q2; // update q2 = 2p/abs(d)
809 r2 = 2*r2; // update r2 = rem(2p/abs(d))
810 if (r2 >= ad) { // must be unsigned comparison
811 q2 = q2 + 1;
812 r2 = r2 - ad;
813 }
814 delta = ad - r2;
815 } while (q1 < delta || (q1 == delta && r1 == 0));
816
817 mag.m = q2 + 1;
818 if (d < 0) mag.m = -mag.m; // resulting magic number
819 mag.s = p - 32; // resulting shift
820 return mag;
821}
822
823/// magicu - calculate the magic numbers required to codegen an integer udiv as
824/// a sequence of multiply, add and shifts. Requires that the divisor not be 0.
825static struct mu magicu(unsigned d)
826{
827 int p;
828 unsigned int nc, delta, q1, r1, q2, r2;
829 struct mu magu;
830 magu.a = 0; // initialize "add" indicator
831 nc = - 1 - (-d)%d;
832 p = 31; // initialize p
833 q1 = 0x80000000/nc; // initialize q1 = 2p/nc
834 r1 = 0x80000000 - q1*nc; // initialize r1 = rem(2p,nc)
835 q2 = 0x7FFFFFFF/d; // initialize q2 = (2p-1)/d
836 r2 = 0x7FFFFFFF - q2*d; // initialize r2 = rem((2p-1),d)
837 do {
838 p = p + 1;
839 if (r1 >= nc - r1 ) {
840 q1 = 2*q1 + 1; // update q1
841 r1 = 2*r1 - nc; // update r1
842 }
843 else {
844 q1 = 2*q1; // update q1
845 r1 = 2*r1; // update r1
846 }
847 if (r2 + 1 >= d - r2) {
848 if (q2 >= 0x7FFFFFFF) magu.a = 1;
849 q2 = 2*q2 + 1; // update q2
850 r2 = 2*r2 + 1 - d; // update r2
851 }
852 else {
853 if (q2 >= 0x80000000) magu.a = 1;
854 q2 = 2*q2; // update q2
855 r2 = 2*r2 + 1; // update r2
856 }
857 delta = d - 1 - r2;
858 } while (p < 64 && (q1 < delta || (q1 == delta && r1 == 0)));
859 magu.m = q2 + 1; // resulting magic number
860 magu.s = p - 32; // resulting shift
861 return magu;
862}
863}
864
865/// BuildSDIVSequence - Given an ISD::SDIV node expressing a divide by constant,
866/// return a DAG expression to select that will generate the same value by
867/// multiplying by a magic number. See:
868/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
869SDOperand ISel::BuildSDIVSequence(SDOperand N) {
870 int d = (int)cast<ConstantSDNode>(N.getOperand(1))->getSignExtended();
871 ms magics = magic(d);
872 // Multiply the numerator (operand 0) by the magic value
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000873 SDOperand Q = ISelDAG->getNode(ISD::MULHS, MVT::i32, N.getOperand(0),
Nate Begeman815d6da2005-04-06 00:25:27 +0000874 ISelDAG->getConstant(magics.m, MVT::i32));
875 // If d > 0 and m < 0, add the numerator
876 if (d > 0 && magics.m < 0)
877 Q = ISelDAG->getNode(ISD::ADD, MVT::i32, Q, N.getOperand(0));
878 // If d < 0 and m > 0, subtract the numerator.
879 if (d < 0 && magics.m > 0)
880 Q = ISelDAG->getNode(ISD::SUB, MVT::i32, Q, N.getOperand(0));
881 // Shift right algebraic if shift value is nonzero
882 if (magics.s > 0)
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000883 Q = ISelDAG->getNode(ISD::SRA, MVT::i32, Q,
Nate Begeman815d6da2005-04-06 00:25:27 +0000884 ISelDAG->getConstant(magics.s, MVT::i32));
885 // Extract the sign bit and add it to the quotient
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000886 SDOperand T =
Nate Begeman815d6da2005-04-06 00:25:27 +0000887 ISelDAG->getNode(ISD::SRL, MVT::i32, Q, ISelDAG->getConstant(31, MVT::i32));
Nate Begeman27b4c232005-04-06 06:44:57 +0000888 return ISelDAG->getNode(ISD::ADD, MVT::i32, Q, T);
Nate Begeman815d6da2005-04-06 00:25:27 +0000889}
890
891/// BuildUDIVSequence - Given an ISD::UDIV node expressing a divide by constant,
892/// return a DAG expression to select that will generate the same value by
893/// multiplying by a magic number. See:
894/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
895SDOperand ISel::BuildUDIVSequence(SDOperand N) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000896 unsigned d =
Nate Begeman815d6da2005-04-06 00:25:27 +0000897 (unsigned)cast<ConstantSDNode>(N.getOperand(1))->getSignExtended();
898 mu magics = magicu(d);
899 // Multiply the numerator (operand 0) by the magic value
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000900 SDOperand Q = ISelDAG->getNode(ISD::MULHU, MVT::i32, N.getOperand(0),
Nate Begeman815d6da2005-04-06 00:25:27 +0000901 ISelDAG->getConstant(magics.m, MVT::i32));
902 if (magics.a == 0) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000903 Q = ISelDAG->getNode(ISD::SRL, MVT::i32, Q,
Nate Begeman815d6da2005-04-06 00:25:27 +0000904 ISelDAG->getConstant(magics.s, MVT::i32));
905 } else {
906 SDOperand NPQ = ISelDAG->getNode(ISD::SUB, MVT::i32, N.getOperand(0), Q);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000907 NPQ = ISelDAG->getNode(ISD::SRL, MVT::i32, NPQ,
Nate Begeman815d6da2005-04-06 00:25:27 +0000908 ISelDAG->getConstant(1, MVT::i32));
909 NPQ = ISelDAG->getNode(ISD::ADD, MVT::i32, NPQ, Q);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000910 Q = ISelDAG->getNode(ISD::SRL, MVT::i32, NPQ,
Nate Begeman815d6da2005-04-06 00:25:27 +0000911 ISelDAG->getConstant(magics.s-1, MVT::i32));
912 }
Nate Begeman27b4c232005-04-06 06:44:57 +0000913 return Q;
Nate Begemana9795f82005-03-24 04:41:43 +0000914}
915
Nate Begemanc7b09f12005-03-25 08:34:25 +0000916/// getGlobalBaseReg - Output the instructions required to put the
917/// base address to use for accessing globals into a register.
918///
919unsigned ISel::getGlobalBaseReg() {
920 if (!GlobalBaseInitialized) {
921 // Insert the set of GlobalBaseReg into the first MBB of the function
922 MachineBasicBlock &FirstMBB = BB->getParent()->front();
923 MachineBasicBlock::iterator MBBI = FirstMBB.begin();
924 GlobalBaseReg = MakeReg(MVT::i32);
925 BuildMI(FirstMBB, MBBI, PPC::MovePCtoLR, 0, PPC::LR);
926 BuildMI(FirstMBB, MBBI, PPC::MFLR, 1, GlobalBaseReg).addReg(PPC::LR);
927 GlobalBaseInitialized = true;
928 }
929 return GlobalBaseReg;
930}
931
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000932/// getConstDouble - Loads a floating point value into a register, via the
Nate Begeman6b559972005-04-01 02:59:27 +0000933/// Constant Pool. Optionally takes a register in which to load the value.
934unsigned ISel::getConstDouble(double doubleVal, unsigned Result=0) {
935 unsigned Tmp1 = MakeReg(MVT::i32);
936 if (0 == Result) Result = MakeReg(MVT::f64);
937 MachineConstantPool *CP = BB->getParent()->getConstantPool();
938 ConstantFP *CFP = ConstantFP::get(Type::DoubleTy, doubleVal);
939 unsigned CPI = CP->getConstantPoolIndex(CFP);
940 BuildMI(BB, PPC::LOADHiAddr, 2, Tmp1).addReg(getGlobalBaseReg())
941 .addConstantPoolIndex(CPI);
942 BuildMI(BB, PPC::LFD, 2, Result).addConstantPoolIndex(CPI).addReg(Tmp1);
943 return Result;
944}
945
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000946/// MoveCRtoGPR - Move CCReg[Idx] to the least significant bit of Result. If
Nate Begeman1cbf3ab2005-04-18 07:48:09 +0000947/// Inv is true, then invert the result.
948void ISel::MoveCRtoGPR(unsigned CCReg, bool Inv, unsigned Idx, unsigned Result){
949 unsigned IntCR = MakeReg(MVT::i32);
950 BuildMI(BB, PPC::MCRF, 1, PPC::CR7).addReg(CCReg);
951 BuildMI(BB, PPC::MFCR, 1, IntCR).addReg(PPC::CR7);
952 if (Inv) {
953 unsigned Tmp1 = MakeReg(MVT::i32);
954 BuildMI(BB, PPC::RLWINM, 4, Tmp1).addReg(IntCR).addImm(32-(3-Idx))
955 .addImm(31).addImm(31);
956 BuildMI(BB, PPC::XORI, 2, Result).addReg(Tmp1).addImm(1);
957 } else {
958 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(IntCR).addImm(32-(3-Idx))
959 .addImm(31).addImm(31);
960 }
961}
962
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000963/// SelectBitfieldInsert - turn an or of two masked values into
Nate Begeman7ddecb42005-04-06 23:51:40 +0000964/// the rotate left word immediate then mask insert (rlwimi) instruction.
965/// Returns true on success, false if the caller still needs to select OR.
966///
967/// Patterns matched:
968/// 1. or shl, and 5. or and, and
969/// 2. or and, shl 6. or shl, shr
970/// 3. or shr, and 7. or shr, shl
971/// 4. or and, shr
972bool ISel::SelectBitfieldInsert(SDOperand OR, unsigned Result) {
Nate Begemancd08e4c2005-04-09 20:09:12 +0000973 bool IsRotate = false;
Nate Begeman7ddecb42005-04-06 23:51:40 +0000974 unsigned TgtMask = 0xFFFFFFFF, InsMask = 0xFFFFFFFF, Amount = 0;
975 unsigned Op0Opc = OR.getOperand(0).getOpcode();
976 unsigned Op1Opc = OR.getOperand(1).getOpcode();
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000977
Nate Begeman7ddecb42005-04-06 23:51:40 +0000978 // Verify that we have the correct opcodes
979 if (ISD::SHL != Op0Opc && ISD::SRL != Op0Opc && ISD::AND != Op0Opc)
980 return false;
981 if (ISD::SHL != Op1Opc && ISD::SRL != Op1Opc && ISD::AND != Op1Opc)
982 return false;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000983
Nate Begeman7ddecb42005-04-06 23:51:40 +0000984 // Generate Mask value for Target
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000985 if (ConstantSDNode *CN =
Nate Begeman7ddecb42005-04-06 23:51:40 +0000986 dyn_cast<ConstantSDNode>(OR.getOperand(0).getOperand(1).Val)) {
987 switch(Op0Opc) {
988 case ISD::SHL: TgtMask <<= (unsigned)CN->getValue(); break;
989 case ISD::SRL: TgtMask >>= (unsigned)CN->getValue(); break;
990 case ISD::AND: TgtMask &= (unsigned)CN->getValue(); break;
991 }
992 } else {
993 return false;
994 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000995
Nate Begeman7ddecb42005-04-06 23:51:40 +0000996 // Generate Mask value for Insert
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000997 if (ConstantSDNode *CN =
Nate Begeman7ddecb42005-04-06 23:51:40 +0000998 dyn_cast<ConstantSDNode>(OR.getOperand(1).getOperand(1).Val)) {
999 switch(Op1Opc) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001000 case ISD::SHL:
1001 Amount = CN->getValue();
Nate Begemancd08e4c2005-04-09 20:09:12 +00001002 InsMask <<= Amount;
1003 if (Op0Opc == ISD::SRL) IsRotate = true;
Nate Begeman7ddecb42005-04-06 23:51:40 +00001004 break;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001005 case ISD::SRL:
1006 Amount = CN->getValue();
1007 InsMask >>= Amount;
Nate Begeman7ddecb42005-04-06 23:51:40 +00001008 Amount = 32-Amount;
Nate Begemancd08e4c2005-04-09 20:09:12 +00001009 if (Op0Opc == ISD::SHL) IsRotate = true;
Nate Begeman7ddecb42005-04-06 23:51:40 +00001010 break;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001011 case ISD::AND:
Nate Begeman7ddecb42005-04-06 23:51:40 +00001012 InsMask &= (unsigned)CN->getValue();
1013 break;
1014 }
1015 } else {
1016 return false;
1017 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001018
Nate Begeman7ddecb42005-04-06 23:51:40 +00001019 // Verify that the Target mask and Insert mask together form a full word mask
1020 // and that the Insert mask is a run of set bits (which implies both are runs
1021 // of set bits). Given that, Select the arguments and generate the rlwimi
1022 // instruction.
1023 unsigned MB, ME;
1024 if (((TgtMask ^ InsMask) == 0xFFFFFFFF) && IsRunOfOnes(InsMask, MB, ME)) {
1025 unsigned Tmp1, Tmp2;
Nate Begemancd08e4c2005-04-09 20:09:12 +00001026 // Check for rotlwi / rotrwi here, a special case of bitfield insert
1027 // where both bitfield halves are sourced from the same value.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001028 if (IsRotate &&
Nate Begemancd08e4c2005-04-09 20:09:12 +00001029 OR.getOperand(0).getOperand(0) == OR.getOperand(1).getOperand(0)) {
Nate Begemancd08e4c2005-04-09 20:09:12 +00001030 Tmp1 = SelectExpr(OR.getOperand(0).getOperand(0));
1031 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp1).addImm(Amount)
1032 .addImm(0).addImm(31);
1033 return true;
1034 }
Nate Begeman7ddecb42005-04-06 23:51:40 +00001035 if (Op0Opc == ISD::AND)
1036 Tmp1 = SelectExpr(OR.getOperand(0).getOperand(0));
1037 else
1038 Tmp1 = SelectExpr(OR.getOperand(0));
1039 Tmp2 = SelectExpr(OR.getOperand(1).getOperand(0));
1040 BuildMI(BB, PPC::RLWIMI, 5, Result).addReg(Tmp1).addReg(Tmp2)
1041 .addImm(Amount).addImm(MB).addImm(ME);
1042 return true;
1043 }
1044 return false;
1045}
1046
Nate Begeman3664cef2005-04-13 22:14:14 +00001047/// FoldIfWideZeroExtend - 32 bit PowerPC implicit masks shift amounts to the
1048/// low six bits. If the shift amount is an ISD::AND node with a mask that is
1049/// wider than the implicit mask, then we can get rid of the AND and let the
1050/// shift do the mask.
1051unsigned ISel::FoldIfWideZeroExtend(SDOperand N) {
1052 unsigned C;
1053 if (N.getOpcode() == ISD::AND &&
1054 5 == getImmediateForOpcode(N.getOperand(1), ISD::AND, C) && // isMask
1055 31 == (C & 0xFFFF) && // ME
1056 26 >= (C >> 16)) // MB
1057 return SelectExpr(N.getOperand(0));
1058 else
1059 return SelectExpr(N);
1060}
1061
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001062unsigned ISel::SelectCC(SDOperand CC, unsigned& Opc, bool &Inv, unsigned& Idx) {
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001063 unsigned Result, Tmp1, Tmp2;
Nate Begeman9765c252005-04-12 21:22:28 +00001064 bool AlreadySelected = false;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001065 static const unsigned CompareOpcodes[] =
Nate Begemandffcfcc2005-04-01 00:32:34 +00001066 { PPC::FCMPU, PPC::FCMPU, PPC::CMPW, PPC::CMPLW };
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001067
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001068 // Allocate a condition register for this expression
1069 Result = RegMap->createVirtualRegister(PPC32::CRRCRegisterClass);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001070
Nate Begemandffcfcc2005-04-01 00:32:34 +00001071 // If the first operand to the select is a SETCC node, then we can fold it
1072 // into the branch that selects which value to return.
Nate Begeman16ac7092005-04-18 02:43:24 +00001073 if (SetCCSDNode* SetCC = dyn_cast<SetCCSDNode>(CC.Val)) {
Nate Begemandffcfcc2005-04-01 00:32:34 +00001074 bool U;
1075 Opc = getBCCForSetCC(SetCC->getCondition(), U);
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001076 Idx = getCRIdxForSetCC(SetCC->getCondition(), Inv);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001077
Nate Begeman439b4442005-04-05 04:22:58 +00001078 // Pass the optional argument U to getImmediateForOpcode for SETCC,
Nate Begemandffcfcc2005-04-01 00:32:34 +00001079 // so that it knows whether the SETCC immediate range is signed or not.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001080 if (1 == getImmediateForOpcode(SetCC->getOperand(1), ISD::SETCC,
Nate Begeman439b4442005-04-05 04:22:58 +00001081 Tmp2, U)) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001082 // For comparisons against zero, we can implicity set CR0 if a recording
Nate Begemanc7bd4822005-04-11 06:34:10 +00001083 // variant (e.g. 'or.' instead of 'or') of the instruction that defines
1084 // operand zero of the SetCC node is available.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001085 if (0 == Tmp2 &&
Nate Begeman9765c252005-04-12 21:22:28 +00001086 NodeHasRecordingVariant(SetCC->getOperand(0).getOpcode()) &&
1087 SetCC->getOperand(0).Val->hasOneUse()) {
Nate Begemanc7bd4822005-04-11 06:34:10 +00001088 RecordSuccess = false;
1089 Tmp1 = SelectExpr(SetCC->getOperand(0), true);
1090 if (RecordSuccess) {
1091 ++Recorded;
Nate Begeman7bfba7d2005-04-14 09:45:08 +00001092 BuildMI(BB, PPC::MCRF, 1, Result).addReg(PPC::CR0);
1093 return Result;
Nate Begemanc7bd4822005-04-11 06:34:10 +00001094 }
1095 AlreadySelected = true;
1096 }
1097 // If we could not implicitly set CR0, then emit a compare immediate
1098 // instead.
1099 if (!AlreadySelected) Tmp1 = SelectExpr(SetCC->getOperand(0));
Nate Begemandffcfcc2005-04-01 00:32:34 +00001100 if (U)
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001101 BuildMI(BB, PPC::CMPLWI, 2, Result).addReg(Tmp1).addImm(Tmp2);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001102 else
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001103 BuildMI(BB, PPC::CMPWI, 2, Result).addReg(Tmp1).addSImm(Tmp2);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001104 } else {
1105 bool IsInteger = MVT::isInteger(SetCC->getOperand(0).getValueType());
1106 unsigned CompareOpc = CompareOpcodes[2 * IsInteger + U];
Nate Begemanc7bd4822005-04-11 06:34:10 +00001107 Tmp1 = SelectExpr(SetCC->getOperand(0));
Nate Begemandffcfcc2005-04-01 00:32:34 +00001108 Tmp2 = SelectExpr(SetCC->getOperand(1));
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001109 BuildMI(BB, CompareOpc, 2, Result).addReg(Tmp1).addReg(Tmp2);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001110 }
1111 } else {
Nate Begemanf8b02942005-04-15 22:12:16 +00001112 if (PPCCRopts)
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001113 return SelectCCExpr(CC, Opc, Inv, Idx);
1114 // If this isn't a SetCC, then select the value and compare it against zero,
1115 // treating it as if it were a boolean.
Nate Begeman9765c252005-04-12 21:22:28 +00001116 Opc = PPC::BNE;
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001117 Idx = getCRIdxForSetCC(ISD::SETNE, Inv);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001118 Tmp1 = SelectExpr(CC);
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001119 BuildMI(BB, PPC::CMPLWI, 2, Result).addReg(Tmp1).addImm(0);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001120 }
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001121 return Result;
Nate Begemandffcfcc2005-04-01 00:32:34 +00001122}
1123
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001124unsigned ISel::SelectCCExpr(SDOperand N, unsigned& Opc, bool &Inv,
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001125 unsigned &Idx) {
1126 bool Inv0, Inv1;
1127 unsigned Idx0, Idx1, CROpc, Opc1, Tmp1, Tmp2;
1128
1129 // Allocate a condition register for this expression
1130 unsigned Result = RegMap->createVirtualRegister(PPC32::CRRCRegisterClass);
1131
1132 // Check for the operations we support:
1133 switch(N.getOpcode()) {
1134 default:
1135 Opc = PPC::BNE;
1136 Idx = getCRIdxForSetCC(ISD::SETNE, Inv);
1137 Tmp1 = SelectExpr(N);
1138 BuildMI(BB, PPC::CMPLWI, 2, Result).addReg(Tmp1).addImm(0);
1139 break;
1140 case ISD::OR:
1141 case ISD::AND:
1142 ++MultiBranch;
1143 Tmp1 = SelectCCExpr(N.getOperand(0), Opc, Inv0, Idx0);
1144 Tmp2 = SelectCCExpr(N.getOperand(1), Opc1, Inv1, Idx1);
1145 CROpc = getCROpForSetCC(N.getOpcode(), Inv0, Inv1);
1146 if (Inv0 && !Inv1) {
1147 std::swap(Tmp1, Tmp2);
1148 std::swap(Idx0, Idx1);
1149 Opc = Opc1;
1150 }
1151 if (Inv0 && Inv1) Opc = PPC32InstrInfo::invertPPCBranchOpcode(Opc);
1152 BuildMI(BB, CROpc, 5, Result).addImm(Idx0).addReg(Tmp1).addImm(Idx0)
1153 .addReg(Tmp2).addImm(Idx1);
1154 Inv = false;
1155 Idx = Idx0;
1156 break;
1157 case ISD::SETCC:
1158 Tmp1 = SelectCC(N, Opc, Inv, Idx);
1159 Result = Tmp1;
1160 break;
1161 }
1162 return Result;
1163}
1164
Nate Begemandffcfcc2005-04-01 00:32:34 +00001165/// Check to see if the load is a constant offset from a base register
Nate Begeman04730362005-04-01 04:45:11 +00001166bool ISel::SelectAddr(SDOperand N, unsigned& Reg, int& offset)
Nate Begemana9795f82005-03-24 04:41:43 +00001167{
Nate Begeman96fc6812005-03-31 02:05:53 +00001168 unsigned imm = 0, opcode = N.getOpcode();
Nate Begeman04730362005-04-01 04:45:11 +00001169 if (N.getOpcode() == ISD::ADD) {
1170 Reg = SelectExpr(N.getOperand(0));
Nate Begeman439b4442005-04-05 04:22:58 +00001171 if (1 == getImmediateForOpcode(N.getOperand(1), opcode, imm)) {
Nate Begeman96fc6812005-03-31 02:05:53 +00001172 offset = imm;
Nate Begeman04730362005-04-01 04:45:11 +00001173 return false;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001174 }
Nate Begeman04730362005-04-01 04:45:11 +00001175 offset = SelectExpr(N.getOperand(1));
1176 return true;
1177 }
Nate Begemana9795f82005-03-24 04:41:43 +00001178 Reg = SelectExpr(N);
1179 offset = 0;
Nate Begeman04730362005-04-01 04:45:11 +00001180 return false;
Nate Begemana9795f82005-03-24 04:41:43 +00001181}
1182
1183void ISel::SelectBranchCC(SDOperand N)
1184{
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001185 MachineBasicBlock *Dest =
Nate Begemana9795f82005-03-24 04:41:43 +00001186 cast<BasicBlockSDNode>(N.getOperand(2))->getBasicBlock();
Nate Begeman3e897162005-03-31 23:55:40 +00001187
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001188 bool Inv;
1189 unsigned Opc, CCReg, Idx;
Nate Begemana9795f82005-03-24 04:41:43 +00001190 Select(N.getOperand(0)); //chain
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001191 CCReg = SelectCC(N.getOperand(1), Opc, Inv, Idx);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001192
Nate Begemancd08e4c2005-04-09 20:09:12 +00001193 // Iterate to the next basic block, unless we're already at the end of the
1194 ilist<MachineBasicBlock>::iterator It = BB, E = BB->getParent()->end();
Nate Begeman706471e2005-04-09 23:35:05 +00001195 if (++It == E) It = BB;
Nate Begemancd08e4c2005-04-09 20:09:12 +00001196
1197 // If this is a two way branch, then grab the fallthrough basic block argument
1198 // and build a PowerPC branch pseudo-op, suitable for long branch conversion
1199 // if necessary by the branch selection pass. Otherwise, emit a standard
1200 // conditional branch.
1201 if (N.getOpcode() == ISD::BRCONDTWOWAY) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001202 MachineBasicBlock *Fallthrough =
Nate Begemancd08e4c2005-04-09 20:09:12 +00001203 cast<BasicBlockSDNode>(N.getOperand(3))->getBasicBlock();
1204 if (Dest != It) {
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001205 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(CCReg).addImm(Opc)
Nate Begemancd08e4c2005-04-09 20:09:12 +00001206 .addMBB(Dest).addMBB(Fallthrough);
1207 if (Fallthrough != It)
1208 BuildMI(BB, PPC::B, 1).addMBB(Fallthrough);
1209 } else {
1210 if (Fallthrough != It) {
1211 Opc = PPC32InstrInfo::invertPPCBranchOpcode(Opc);
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001212 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(CCReg).addImm(Opc)
Nate Begemancd08e4c2005-04-09 20:09:12 +00001213 .addMBB(Fallthrough).addMBB(Dest);
1214 }
1215 }
1216 } else {
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001217 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(CCReg).addImm(Opc)
Nate Begeman27499e32005-04-10 01:48:29 +00001218 .addMBB(Dest).addMBB(It);
Nate Begemancd08e4c2005-04-09 20:09:12 +00001219 }
Nate Begemana9795f82005-03-24 04:41:43 +00001220 return;
1221}
1222
1223unsigned ISel::SelectExprFP(SDOperand N, unsigned Result)
1224{
1225 unsigned Tmp1, Tmp2, Tmp3;
1226 unsigned Opc = 0;
1227 SDNode *Node = N.Val;
1228 MVT::ValueType DestType = N.getValueType();
1229 unsigned opcode = N.getOpcode();
1230
1231 switch (opcode) {
1232 default:
1233 Node->dump();
1234 assert(0 && "Node not handled!\n");
1235
Nate Begeman23afcfb2005-03-29 22:48:55 +00001236 case ISD::SELECT: {
Nate Begeman3e897162005-03-31 23:55:40 +00001237 // Attempt to generate FSEL. We can do this whenever we have an FP result,
1238 // and an FP comparison in the SetCC node.
1239 SetCCSDNode* SetCC = dyn_cast<SetCCSDNode>(N.getOperand(0).Val);
1240 if (SetCC && N.getOperand(0).getOpcode() == ISD::SETCC &&
1241 !MVT::isInteger(SetCC->getOperand(0).getValueType()) &&
1242 SetCC->getCondition() != ISD::SETEQ &&
1243 SetCC->getCondition() != ISD::SETNE) {
1244 MVT::ValueType VT = SetCC->getOperand(0).getValueType();
Nate Begeman3e897162005-03-31 23:55:40 +00001245 unsigned TV = SelectExpr(N.getOperand(1)); // Use if TRUE
1246 unsigned FV = SelectExpr(N.getOperand(2)); // Use if FALSE
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001247
Nate Begeman3e897162005-03-31 23:55:40 +00001248 ConstantFPSDNode *CN = dyn_cast<ConstantFPSDNode>(SetCC->getOperand(1));
1249 if (CN && (CN->isExactlyValue(-0.0) || CN->isExactlyValue(0.0))) {
1250 switch(SetCC->getCondition()) {
1251 default: assert(0 && "Invalid FSEL condition"); abort();
1252 case ISD::SETULT:
1253 case ISD::SETLT:
Nate Begemanaf4ab1b2005-04-09 09:33:07 +00001254 std::swap(TV, FV); // fsel is natively setge, swap operands for setlt
Nate Begeman3e897162005-03-31 23:55:40 +00001255 case ISD::SETUGE:
1256 case ISD::SETGE:
Nate Begemanaf4ab1b2005-04-09 09:33:07 +00001257 Tmp1 = SelectExpr(SetCC->getOperand(0)); // Val to compare against
Nate Begeman3e897162005-03-31 23:55:40 +00001258 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp1).addReg(TV).addReg(FV);
1259 return Result;
1260 case ISD::SETUGT:
Nate Begemanaf4ab1b2005-04-09 09:33:07 +00001261 case ISD::SETGT:
1262 std::swap(TV, FV); // fsel is natively setge, swap operands for setlt
Nate Begeman3e897162005-03-31 23:55:40 +00001263 case ISD::SETULE:
1264 case ISD::SETLE: {
Nate Begemanaf4ab1b2005-04-09 09:33:07 +00001265 if (SetCC->getOperand(0).getOpcode() == ISD::FNEG) {
1266 Tmp2 = SelectExpr(SetCC->getOperand(0).getOperand(0));
1267 } else {
1268 Tmp2 = MakeReg(VT);
1269 Tmp1 = SelectExpr(SetCC->getOperand(0)); // Val to compare against
1270 BuildMI(BB, PPC::FNEG, 1, Tmp2).addReg(Tmp1);
1271 }
Nate Begeman3e897162005-03-31 23:55:40 +00001272 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp2).addReg(TV).addReg(FV);
1273 return Result;
1274 }
1275 }
1276 } else {
1277 Opc = (MVT::f64 == VT) ? PPC::FSUB : PPC::FSUBS;
Nate Begemanaf4ab1b2005-04-09 09:33:07 +00001278 Tmp1 = SelectExpr(SetCC->getOperand(0)); // Val to compare against
Nate Begeman3e897162005-03-31 23:55:40 +00001279 Tmp2 = SelectExpr(SetCC->getOperand(1));
1280 Tmp3 = MakeReg(VT);
1281 switch(SetCC->getCondition()) {
1282 default: assert(0 && "Invalid FSEL condition"); abort();
1283 case ISD::SETULT:
1284 case ISD::SETLT:
1285 BuildMI(BB, Opc, 2, Tmp3).addReg(Tmp1).addReg(Tmp2);
1286 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp3).addReg(FV).addReg(TV);
1287 return Result;
1288 case ISD::SETUGE:
1289 case ISD::SETGE:
1290 BuildMI(BB, Opc, 2, Tmp3).addReg(Tmp1).addReg(Tmp2);
1291 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp3).addReg(TV).addReg(FV);
1292 return Result;
1293 case ISD::SETUGT:
1294 case ISD::SETGT:
1295 BuildMI(BB, Opc, 2, Tmp3).addReg(Tmp2).addReg(Tmp1);
1296 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp3).addReg(FV).addReg(TV);
1297 return Result;
1298 case ISD::SETULE:
1299 case ISD::SETLE:
1300 BuildMI(BB, Opc, 2, Tmp3).addReg(Tmp2).addReg(Tmp1);
1301 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp3).addReg(TV).addReg(FV);
1302 return Result;
1303 }
1304 }
1305 assert(0 && "Should never get here");
1306 return 0;
1307 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001308
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001309 bool Inv;
Nate Begeman31318e42005-04-01 07:21:30 +00001310 unsigned TrueValue = SelectExpr(N.getOperand(1)); //Use if TRUE
1311 unsigned FalseValue = SelectExpr(N.getOperand(2)); //Use if FALSE
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001312 unsigned CCReg = SelectCC(N.getOperand(0), Opc, Inv, Tmp3);
Nate Begeman31318e42005-04-01 07:21:30 +00001313
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001314 // Create an iterator with which to insert the MBB for copying the false
Nate Begeman23afcfb2005-03-29 22:48:55 +00001315 // value and the MBB to hold the PHI instruction for this SetCC.
1316 MachineBasicBlock *thisMBB = BB;
1317 const BasicBlock *LLVM_BB = BB->getBasicBlock();
1318 ilist<MachineBasicBlock>::iterator It = BB;
1319 ++It;
1320
1321 // thisMBB:
1322 // ...
1323 // TrueVal = ...
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001324 // cmpTY ccX, r1, r2
Nate Begeman23afcfb2005-03-29 22:48:55 +00001325 // bCC copy1MBB
1326 // fallthrough --> copy0MBB
Nate Begeman23afcfb2005-03-29 22:48:55 +00001327 MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB);
1328 MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB);
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001329 BuildMI(BB, Opc, 2).addReg(CCReg).addMBB(sinkMBB);
Nate Begeman23afcfb2005-03-29 22:48:55 +00001330 MachineFunction *F = BB->getParent();
1331 F->getBasicBlockList().insert(It, copy0MBB);
1332 F->getBasicBlockList().insert(It, sinkMBB);
1333 // Update machine-CFG edges
1334 BB->addSuccessor(copy0MBB);
1335 BB->addSuccessor(sinkMBB);
1336
1337 // copy0MBB:
1338 // %FalseValue = ...
1339 // # fallthrough to sinkMBB
1340 BB = copy0MBB;
Nate Begeman23afcfb2005-03-29 22:48:55 +00001341 // Update machine-CFG edges
1342 BB->addSuccessor(sinkMBB);
1343
1344 // sinkMBB:
1345 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
1346 // ...
1347 BB = sinkMBB;
1348 BuildMI(BB, PPC::PHI, 4, Result).addReg(FalseValue)
1349 .addMBB(copy0MBB).addReg(TrueValue).addMBB(thisMBB);
1350 return Result;
1351 }
Nate Begeman27eeb002005-04-02 05:59:34 +00001352
1353 case ISD::FNEG:
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001354 if (!NoExcessFPPrecision &&
Nate Begeman93075ec2005-04-04 23:40:36 +00001355 ISD::ADD == N.getOperand(0).getOpcode() &&
1356 N.getOperand(0).Val->hasOneUse() &&
1357 ISD::MUL == N.getOperand(0).getOperand(0).getOpcode() &&
1358 N.getOperand(0).getOperand(0).Val->hasOneUse()) {
Nate Begeman80196b12005-04-05 00:15:08 +00001359 ++FusedFP; // Statistic
Nate Begeman93075ec2005-04-04 23:40:36 +00001360 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0).getOperand(0));
1361 Tmp2 = SelectExpr(N.getOperand(0).getOperand(0).getOperand(1));
1362 Tmp3 = SelectExpr(N.getOperand(0).getOperand(1));
1363 Opc = DestType == MVT::f64 ? PPC::FNMADD : PPC::FNMADDS;
1364 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001365 } else if (!NoExcessFPPrecision &&
Nate Begemane88aa5b2005-04-09 03:05:51 +00001366 ISD::ADD == N.getOperand(0).getOpcode() &&
Nate Begeman93075ec2005-04-04 23:40:36 +00001367 N.getOperand(0).Val->hasOneUse() &&
Nate Begemane88aa5b2005-04-09 03:05:51 +00001368 ISD::MUL == N.getOperand(0).getOperand(1).getOpcode() &&
1369 N.getOperand(0).getOperand(1).Val->hasOneUse()) {
Nate Begeman80196b12005-04-05 00:15:08 +00001370 ++FusedFP; // Statistic
Nate Begemane88aa5b2005-04-09 03:05:51 +00001371 Tmp1 = SelectExpr(N.getOperand(0).getOperand(1).getOperand(0));
1372 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1).getOperand(1));
1373 Tmp3 = SelectExpr(N.getOperand(0).getOperand(0));
1374 Opc = DestType == MVT::f64 ? PPC::FNMADD : PPC::FNMADDS;
Nate Begeman93075ec2005-04-04 23:40:36 +00001375 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
1376 } else if (ISD::FABS == N.getOperand(0).getOpcode()) {
Nate Begeman27eeb002005-04-02 05:59:34 +00001377 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1378 BuildMI(BB, PPC::FNABS, 1, Result).addReg(Tmp1);
1379 } else {
1380 Tmp1 = SelectExpr(N.getOperand(0));
1381 BuildMI(BB, PPC::FNEG, 1, Result).addReg(Tmp1);
1382 }
1383 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001384
Nate Begeman27eeb002005-04-02 05:59:34 +00001385 case ISD::FABS:
1386 Tmp1 = SelectExpr(N.getOperand(0));
1387 BuildMI(BB, PPC::FABS, 1, Result).addReg(Tmp1);
1388 return Result;
1389
Nate Begemana9795f82005-03-24 04:41:43 +00001390 case ISD::FP_ROUND:
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001391 assert (DestType == MVT::f32 &&
1392 N.getOperand(0).getValueType() == MVT::f64 &&
Nate Begemana9795f82005-03-24 04:41:43 +00001393 "only f64 to f32 conversion supported here");
1394 Tmp1 = SelectExpr(N.getOperand(0));
1395 BuildMI(BB, PPC::FRSP, 1, Result).addReg(Tmp1);
1396 return Result;
1397
1398 case ISD::FP_EXTEND:
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001399 assert (DestType == MVT::f64 &&
1400 N.getOperand(0).getValueType() == MVT::f32 &&
Nate Begemana9795f82005-03-24 04:41:43 +00001401 "only f32 to f64 conversion supported here");
1402 Tmp1 = SelectExpr(N.getOperand(0));
1403 BuildMI(BB, PPC::FMR, 1, Result).addReg(Tmp1);
1404 return Result;
1405
1406 case ISD::CopyFromReg:
Nate Begemanf2622612005-03-26 02:17:46 +00001407 if (Result == 1)
1408 Result = ExprMap[N.getValue(0)] = MakeReg(N.getValue(0).getValueType());
1409 Tmp1 = dyn_cast<RegSDNode>(Node)->getReg();
1410 BuildMI(BB, PPC::FMR, 1, Result).addReg(Tmp1);
1411 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001412
Nate Begeman6d369cc2005-04-01 01:08:07 +00001413 case ISD::ConstantFP: {
Nate Begeman6d369cc2005-04-01 01:08:07 +00001414 ConstantFPSDNode *CN = cast<ConstantFPSDNode>(N);
Nate Begeman6b559972005-04-01 02:59:27 +00001415 Result = getConstDouble(CN->getValue(), Result);
Nate Begeman6d369cc2005-04-01 01:08:07 +00001416 return Result;
1417 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001418
Nate Begemana9795f82005-03-24 04:41:43 +00001419 case ISD::ADD:
Nate Begeman93075ec2005-04-04 23:40:36 +00001420 if (!NoExcessFPPrecision && N.getOperand(0).getOpcode() == ISD::MUL &&
1421 N.getOperand(0).Val->hasOneUse()) {
1422 ++FusedFP; // Statistic
1423 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1424 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1));
1425 Tmp3 = SelectExpr(N.getOperand(1));
1426 Opc = DestType == MVT::f64 ? PPC::FMADD : PPC::FMADDS;
1427 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
1428 return Result;
1429 }
Nate Begemane88aa5b2005-04-09 03:05:51 +00001430 if (!NoExcessFPPrecision && N.getOperand(1).getOpcode() == ISD::MUL &&
1431 N.getOperand(1).Val->hasOneUse()) {
1432 ++FusedFP; // Statistic
1433 Tmp1 = SelectExpr(N.getOperand(1).getOperand(0));
1434 Tmp2 = SelectExpr(N.getOperand(1).getOperand(1));
1435 Tmp3 = SelectExpr(N.getOperand(0));
1436 Opc = DestType == MVT::f64 ? PPC::FMADD : PPC::FMADDS;
1437 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
1438 return Result;
1439 }
Nate Begeman93075ec2005-04-04 23:40:36 +00001440 Opc = DestType == MVT::f64 ? PPC::FADD : PPC::FADDS;
1441 Tmp1 = SelectExpr(N.getOperand(0));
1442 Tmp2 = SelectExpr(N.getOperand(1));
1443 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
1444 return Result;
1445
Nate Begemana9795f82005-03-24 04:41:43 +00001446 case ISD::SUB:
Nate Begeman93075ec2005-04-04 23:40:36 +00001447 if (!NoExcessFPPrecision && N.getOperand(0).getOpcode() == ISD::MUL &&
1448 N.getOperand(0).Val->hasOneUse()) {
1449 ++FusedFP; // Statistic
1450 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1451 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1));
1452 Tmp3 = SelectExpr(N.getOperand(1));
1453 Opc = DestType == MVT::f64 ? PPC::FMSUB : PPC::FMSUBS;
1454 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
1455 return Result;
1456 }
Nate Begemane88aa5b2005-04-09 03:05:51 +00001457 if (!NoExcessFPPrecision && N.getOperand(1).getOpcode() == ISD::MUL &&
1458 N.getOperand(1).Val->hasOneUse()) {
1459 ++FusedFP; // Statistic
1460 Tmp1 = SelectExpr(N.getOperand(1).getOperand(0));
1461 Tmp2 = SelectExpr(N.getOperand(1).getOperand(1));
1462 Tmp3 = SelectExpr(N.getOperand(0));
1463 Opc = DestType == MVT::f64 ? PPC::FNMSUB : PPC::FNMSUBS;
1464 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
1465 return Result;
1466 }
Nate Begeman93075ec2005-04-04 23:40:36 +00001467 Opc = DestType == MVT::f64 ? PPC::FSUB : PPC::FSUBS;
1468 Tmp1 = SelectExpr(N.getOperand(0));
1469 Tmp2 = SelectExpr(N.getOperand(1));
1470 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
1471 return Result;
1472
1473 case ISD::MUL:
Nate Begemana9795f82005-03-24 04:41:43 +00001474 case ISD::SDIV:
1475 switch( opcode ) {
1476 case ISD::MUL: Opc = DestType == MVT::f64 ? PPC::FMUL : PPC::FMULS; break;
Nate Begemana9795f82005-03-24 04:41:43 +00001477 case ISD::SDIV: Opc = DestType == MVT::f64 ? PPC::FDIV : PPC::FDIVS; break;
1478 };
Nate Begemana9795f82005-03-24 04:41:43 +00001479 Tmp1 = SelectExpr(N.getOperand(0));
1480 Tmp2 = SelectExpr(N.getOperand(1));
1481 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
1482 return Result;
1483
Nate Begemana9795f82005-03-24 04:41:43 +00001484 case ISD::UINT_TO_FP:
Nate Begemanfdcf3412005-03-30 19:38:35 +00001485 case ISD::SINT_TO_FP: {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001486 assert (N.getOperand(0).getValueType() == MVT::i32
Nate Begemanfdcf3412005-03-30 19:38:35 +00001487 && "int to float must operate on i32");
1488 bool IsUnsigned = (ISD::UINT_TO_FP == opcode);
1489 Tmp1 = SelectExpr(N.getOperand(0)); // Get the operand register
1490 Tmp2 = MakeReg(MVT::f64); // temp reg to load the integer value into
1491 Tmp3 = MakeReg(MVT::i32); // temp reg to hold the conversion constant
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001492
Nate Begemanfdcf3412005-03-30 19:38:35 +00001493 int FrameIdx = BB->getParent()->getFrameInfo()->CreateStackObject(8, 8);
1494 MachineConstantPool *CP = BB->getParent()->getConstantPool();
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001495
Nate Begemanfdcf3412005-03-30 19:38:35 +00001496 if (IsUnsigned) {
Nate Begeman709c8062005-04-10 06:06:10 +00001497 unsigned ConstF = getConstDouble(0x1.000000p52);
Nate Begemanfdcf3412005-03-30 19:38:35 +00001498 // Store the hi & low halves of the fp value, currently in int regs
1499 BuildMI(BB, PPC::LIS, 1, Tmp3).addSImm(0x4330);
1500 addFrameReference(BuildMI(BB, PPC::STW, 3).addReg(Tmp3), FrameIdx);
1501 addFrameReference(BuildMI(BB, PPC::STW, 3).addReg(Tmp1), FrameIdx, 4);
1502 addFrameReference(BuildMI(BB, PPC::LFD, 2, Tmp2), FrameIdx);
1503 // Generate the return value with a subtract
1504 BuildMI(BB, PPC::FSUB, 2, Result).addReg(Tmp2).addReg(ConstF);
1505 } else {
Nate Begeman709c8062005-04-10 06:06:10 +00001506 unsigned ConstF = getConstDouble(0x1.000008p52);
Nate Begemanfdcf3412005-03-30 19:38:35 +00001507 unsigned TmpL = MakeReg(MVT::i32);
Nate Begemanfdcf3412005-03-30 19:38:35 +00001508 // Store the hi & low halves of the fp value, currently in int regs
1509 BuildMI(BB, PPC::LIS, 1, Tmp3).addSImm(0x4330);
1510 addFrameReference(BuildMI(BB, PPC::STW, 3).addReg(Tmp3), FrameIdx);
1511 BuildMI(BB, PPC::XORIS, 2, TmpL).addReg(Tmp1).addImm(0x8000);
1512 addFrameReference(BuildMI(BB, PPC::STW, 3).addReg(TmpL), FrameIdx, 4);
1513 addFrameReference(BuildMI(BB, PPC::LFD, 2, Tmp2), FrameIdx);
1514 // Generate the return value with a subtract
1515 BuildMI(BB, PPC::FSUB, 2, Result).addReg(Tmp2).addReg(ConstF);
1516 }
1517 return Result;
1518 }
Nate Begemana9795f82005-03-24 04:41:43 +00001519 }
Nate Begeman6b559972005-04-01 02:59:27 +00001520 assert(0 && "Should never get here");
Nate Begemana9795f82005-03-24 04:41:43 +00001521 return 0;
1522}
1523
Nate Begemanc7bd4822005-04-11 06:34:10 +00001524unsigned ISel::SelectExpr(SDOperand N, bool Recording) {
Nate Begemana9795f82005-03-24 04:41:43 +00001525 unsigned Result;
1526 unsigned Tmp1, Tmp2, Tmp3;
1527 unsigned Opc = 0;
1528 unsigned opcode = N.getOpcode();
1529
1530 SDNode *Node = N.Val;
1531 MVT::ValueType DestType = N.getValueType();
1532
1533 unsigned &Reg = ExprMap[N];
1534 if (Reg) return Reg;
1535
Nate Begeman27eeb002005-04-02 05:59:34 +00001536 switch (N.getOpcode()) {
1537 default:
Nate Begemana9795f82005-03-24 04:41:43 +00001538 Reg = Result = (N.getValueType() != MVT::Other) ?
Nate Begeman27eeb002005-04-02 05:59:34 +00001539 MakeReg(N.getValueType()) : 1;
1540 break;
1541 case ISD::CALL:
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001542 // If this is a call instruction, make sure to prepare ALL of the result
1543 // values as well as the chain.
Nate Begeman27eeb002005-04-02 05:59:34 +00001544 if (Node->getNumValues() == 1)
1545 Reg = Result = 1; // Void call, just a chain.
1546 else {
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001547 Result = MakeReg(Node->getValueType(0));
1548 ExprMap[N.getValue(0)] = Result;
Nate Begeman27eeb002005-04-02 05:59:34 +00001549 for (unsigned i = 1, e = N.Val->getNumValues()-1; i != e; ++i)
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001550 ExprMap[N.getValue(i)] = MakeReg(Node->getValueType(i));
Nate Begeman27eeb002005-04-02 05:59:34 +00001551 ExprMap[SDOperand(Node, Node->getNumValues()-1)] = 1;
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001552 }
Nate Begeman27eeb002005-04-02 05:59:34 +00001553 break;
1554 case ISD::ADD_PARTS:
1555 case ISD::SUB_PARTS:
1556 case ISD::SHL_PARTS:
1557 case ISD::SRL_PARTS:
1558 case ISD::SRA_PARTS:
1559 Result = MakeReg(Node->getValueType(0));
1560 ExprMap[N.getValue(0)] = Result;
1561 for (unsigned i = 1, e = N.Val->getNumValues(); i != e; ++i)
1562 ExprMap[N.getValue(i)] = MakeReg(Node->getValueType(i));
1563 break;
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001564 }
1565
Nate Begemane5846682005-04-04 06:52:38 +00001566 if (ISD::CopyFromReg == opcode)
1567 DestType = N.getValue(0).getValueType();
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001568
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001569 if (DestType == MVT::f64 || DestType == MVT::f32)
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001570 if (ISD::LOAD != opcode && ISD::EXTLOAD != opcode &&
Nate Begemana0e3e942005-04-10 01:14:13 +00001571 ISD::UNDEF != opcode && ISD::CALL != opcode)
Nate Begeman74d73452005-03-31 00:15:26 +00001572 return SelectExprFP(N, Result);
Nate Begemana9795f82005-03-24 04:41:43 +00001573
1574 switch (opcode) {
1575 default:
1576 Node->dump();
1577 assert(0 && "Node not handled!\n");
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001578 case ISD::UNDEF:
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001579 BuildMI(BB, PPC::IMPLICIT_DEF, 0, Result);
1580 return Result;
Nate Begemana9795f82005-03-24 04:41:43 +00001581 case ISD::DYNAMIC_STACKALLOC:
Nate Begeman5e966612005-03-24 06:28:42 +00001582 // Generate both result values. FIXME: Need a better commment here?
1583 if (Result != 1)
1584 ExprMap[N.getValue(1)] = 1;
1585 else
1586 Result = ExprMap[N.getValue(0)] = MakeReg(N.getValue(0).getValueType());
1587
1588 // FIXME: We are currently ignoring the requested alignment for handling
1589 // greater than the stack alignment. This will need to be revisited at some
1590 // point. Align = N.getOperand(2);
1591 if (!isa<ConstantSDNode>(N.getOperand(2)) ||
1592 cast<ConstantSDNode>(N.getOperand(2))->getValue() != 0) {
1593 std::cerr << "Cannot allocate stack object with greater alignment than"
1594 << " the stack alignment yet!";
1595 abort();
1596 }
1597 Select(N.getOperand(0));
1598 Tmp1 = SelectExpr(N.getOperand(1));
1599 // Subtract size from stack pointer, thereby allocating some space.
1600 BuildMI(BB, PPC::SUBF, 2, PPC::R1).addReg(Tmp1).addReg(PPC::R1);
1601 // Put a pointer to the space into the result register by copying the SP
1602 BuildMI(BB, PPC::OR, 2, Result).addReg(PPC::R1).addReg(PPC::R1);
1603 return Result;
Nate Begemana9795f82005-03-24 04:41:43 +00001604
1605 case ISD::ConstantPool:
Nate Begemanca12a2b2005-03-28 22:28:37 +00001606 Tmp1 = cast<ConstantPoolSDNode>(N)->getIndex();
1607 Tmp2 = MakeReg(MVT::i32);
1608 BuildMI(BB, PPC::LOADHiAddr, 2, Tmp2).addReg(getGlobalBaseReg())
1609 .addConstantPoolIndex(Tmp1);
1610 BuildMI(BB, PPC::LA, 2, Result).addReg(Tmp2).addConstantPoolIndex(Tmp1);
1611 return Result;
Nate Begemana9795f82005-03-24 04:41:43 +00001612
1613 case ISD::FrameIndex:
Nate Begemanf3d08f32005-03-29 00:03:27 +00001614 Tmp1 = cast<FrameIndexSDNode>(N)->getIndex();
Nate Begeman58f718c2005-03-30 02:23:08 +00001615 addFrameReference(BuildMI(BB, PPC::ADDI, 2, Result), (int)Tmp1, 0, false);
Nate Begemanf3d08f32005-03-29 00:03:27 +00001616 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001617
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001618 case ISD::GlobalAddress: {
1619 GlobalValue *GV = cast<GlobalAddressSDNode>(N)->getGlobal();
Nate Begemanca12a2b2005-03-28 22:28:37 +00001620 Tmp1 = MakeReg(MVT::i32);
Nate Begemanc7b09f12005-03-25 08:34:25 +00001621 BuildMI(BB, PPC::LOADHiAddr, 2, Tmp1).addReg(getGlobalBaseReg())
1622 .addGlobalAddress(GV);
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001623 if (GV->hasWeakLinkage() || GV->isExternal()) {
1624 BuildMI(BB, PPC::LWZ, 2, Result).addGlobalAddress(GV).addReg(Tmp1);
1625 } else {
1626 BuildMI(BB, PPC::LA, 2, Result).addReg(Tmp1).addGlobalAddress(GV);
1627 }
1628 return Result;
1629 }
1630
Nate Begeman5e966612005-03-24 06:28:42 +00001631 case ISD::LOAD:
Nate Begemana9795f82005-03-24 04:41:43 +00001632 case ISD::EXTLOAD:
1633 case ISD::ZEXTLOAD:
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001634 case ISD::SEXTLOAD: {
Nate Begeman9db505c2005-03-28 19:36:43 +00001635 MVT::ValueType TypeBeingLoaded = (ISD::LOAD == opcode) ?
1636 Node->getValueType(0) : cast<MVTSDNode>(Node)->getExtraValueType();
Nate Begeman74d73452005-03-31 00:15:26 +00001637 bool sext = (ISD::SEXTLOAD == opcode);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001638
Nate Begeman5e966612005-03-24 06:28:42 +00001639 // Make sure we generate both values.
1640 if (Result != 1)
1641 ExprMap[N.getValue(1)] = 1; // Generate the token
1642 else
1643 Result = ExprMap[N.getValue(0)] = MakeReg(N.getValue(0).getValueType());
1644
1645 SDOperand Chain = N.getOperand(0);
1646 SDOperand Address = N.getOperand(1);
1647 Select(Chain);
1648
Nate Begeman9db505c2005-03-28 19:36:43 +00001649 switch (TypeBeingLoaded) {
Nate Begeman74d73452005-03-31 00:15:26 +00001650 default: Node->dump(); assert(0 && "Cannot load this type!");
Nate Begeman9db505c2005-03-28 19:36:43 +00001651 case MVT::i1: Opc = PPC::LBZ; break;
1652 case MVT::i8: Opc = PPC::LBZ; break;
1653 case MVT::i16: Opc = sext ? PPC::LHA : PPC::LHZ; break;
1654 case MVT::i32: Opc = PPC::LWZ; break;
Nate Begeman74d73452005-03-31 00:15:26 +00001655 case MVT::f32: Opc = PPC::LFS; break;
1656 case MVT::f64: Opc = PPC::LFD; break;
Nate Begeman5e966612005-03-24 06:28:42 +00001657 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001658
Nate Begeman74d73452005-03-31 00:15:26 +00001659 if (ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(Address)) {
1660 Tmp1 = MakeReg(MVT::i32);
1661 int CPI = CP->getIndex();
1662 BuildMI(BB, PPC::LOADHiAddr, 2, Tmp1).addReg(getGlobalBaseReg())
1663 .addConstantPoolIndex(CPI);
1664 BuildMI(BB, Opc, 2, Result).addConstantPoolIndex(CPI).addReg(Tmp1);
Nate Begeman9db505c2005-03-28 19:36:43 +00001665 }
Nate Begeman74d73452005-03-31 00:15:26 +00001666 else if(Address.getOpcode() == ISD::FrameIndex) {
Nate Begeman58f718c2005-03-30 02:23:08 +00001667 Tmp1 = cast<FrameIndexSDNode>(Address)->getIndex();
1668 addFrameReference(BuildMI(BB, Opc, 2, Result), (int)Tmp1);
Nate Begeman5e966612005-03-24 06:28:42 +00001669 } else {
1670 int offset;
Nate Begeman04730362005-04-01 04:45:11 +00001671 bool idx = SelectAddr(Address, Tmp1, offset);
1672 if (idx) {
1673 Opc = IndexedOpForOp(Opc);
1674 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(offset);
1675 } else {
1676 BuildMI(BB, Opc, 2, Result).addSImm(offset).addReg(Tmp1);
1677 }
Nate Begeman5e966612005-03-24 06:28:42 +00001678 }
1679 return Result;
1680 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001681
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001682 case ISD::CALL: {
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001683 unsigned GPR_idx = 0, FPR_idx = 0;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001684 static const unsigned GPR[] = {
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001685 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
1686 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
1687 };
1688 static const unsigned FPR[] = {
1689 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
1690 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
1691 };
1692
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001693 // Lower the chain for this call.
1694 Select(N.getOperand(0));
1695 ExprMap[N.getValue(Node->getNumValues()-1)] = 1;
Nate Begeman74d73452005-03-31 00:15:26 +00001696
Nate Begemand860aa62005-04-04 22:17:48 +00001697 MachineInstr *CallMI;
1698 // Emit the correct call instruction based on the type of symbol called.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001699 if (GlobalAddressSDNode *GASD =
Nate Begemand860aa62005-04-04 22:17:48 +00001700 dyn_cast<GlobalAddressSDNode>(N.getOperand(1))) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001701 CallMI = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(GASD->getGlobal(),
Nate Begemand860aa62005-04-04 22:17:48 +00001702 true);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001703 } else if (ExternalSymbolSDNode *ESSDN =
Nate Begemand860aa62005-04-04 22:17:48 +00001704 dyn_cast<ExternalSymbolSDNode>(N.getOperand(1))) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001705 CallMI = BuildMI(PPC::CALLpcrel, 1).addExternalSymbol(ESSDN->getSymbol(),
Nate Begemand860aa62005-04-04 22:17:48 +00001706 true);
1707 } else {
1708 Tmp1 = SelectExpr(N.getOperand(1));
1709 BuildMI(BB, PPC::OR, 2, PPC::R12).addReg(Tmp1).addReg(Tmp1);
1710 BuildMI(BB, PPC::MTCTR, 1).addReg(PPC::R12);
1711 CallMI = BuildMI(PPC::CALLindirect, 3).addImm(20).addImm(0)
1712 .addReg(PPC::R12);
1713 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001714
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001715 // Load the register args to virtual regs
1716 std::vector<unsigned> ArgVR;
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001717 for(int i = 2, e = Node->getNumOperands(); i < e; ++i)
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001718 ArgVR.push_back(SelectExpr(N.getOperand(i)));
1719
1720 // Copy the virtual registers into the appropriate argument register
1721 for(int i = 0, e = ArgVR.size(); i < e; ++i) {
1722 switch(N.getOperand(i+2).getValueType()) {
1723 default: Node->dump(); assert(0 && "Unknown value type for call");
1724 case MVT::i1:
1725 case MVT::i8:
1726 case MVT::i16:
1727 case MVT::i32:
1728 assert(GPR_idx < 8 && "Too many int args");
Nate Begemand860aa62005-04-04 22:17:48 +00001729 if (N.getOperand(i+2).getOpcode() != ISD::UNDEF) {
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001730 BuildMI(BB, PPC::OR,2,GPR[GPR_idx]).addReg(ArgVR[i]).addReg(ArgVR[i]);
Nate Begemand860aa62005-04-04 22:17:48 +00001731 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1732 }
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001733 ++GPR_idx;
1734 break;
1735 case MVT::f64:
1736 case MVT::f32:
1737 assert(FPR_idx < 13 && "Too many fp args");
1738 BuildMI(BB, PPC::FMR, 1, FPR[FPR_idx]).addReg(ArgVR[i]);
Nate Begemand860aa62005-04-04 22:17:48 +00001739 CallMI->addRegOperand(FPR[FPR_idx], MachineOperand::Use);
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001740 ++FPR_idx;
1741 break;
1742 }
1743 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001744
Nate Begemand860aa62005-04-04 22:17:48 +00001745 // Put the call instruction in the correct place in the MachineBasicBlock
1746 BB->push_back(CallMI);
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001747
1748 switch (Node->getValueType(0)) {
1749 default: assert(0 && "Unknown value type for call result!");
1750 case MVT::Other: return 1;
1751 case MVT::i1:
1752 case MVT::i8:
1753 case MVT::i16:
1754 case MVT::i32:
Nate Begemane5846682005-04-04 06:52:38 +00001755 if (Node->getValueType(1) == MVT::i32) {
1756 BuildMI(BB, PPC::OR, 2, Result+1).addReg(PPC::R3).addReg(PPC::R3);
1757 BuildMI(BB, PPC::OR, 2, Result).addReg(PPC::R4).addReg(PPC::R4);
1758 } else {
1759 BuildMI(BB, PPC::OR, 2, Result).addReg(PPC::R3).addReg(PPC::R3);
1760 }
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001761 break;
1762 case MVT::f32:
1763 case MVT::f64:
1764 BuildMI(BB, PPC::FMR, 1, Result).addReg(PPC::F1);
1765 break;
1766 }
1767 return Result+N.ResNo;
1768 }
Nate Begemana9795f82005-03-24 04:41:43 +00001769
1770 case ISD::SIGN_EXTEND:
1771 case ISD::SIGN_EXTEND_INREG:
1772 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman9db505c2005-03-28 19:36:43 +00001773 switch(cast<MVTSDNode>(Node)->getExtraValueType()) {
1774 default: Node->dump(); assert(0 && "Unhandled SIGN_EXTEND type"); break;
Nate Begemanc7bd4822005-04-11 06:34:10 +00001775 case MVT::i16:
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001776 BuildMI(BB, PPC::EXTSH, 1, Result).addReg(Tmp1);
Nate Begeman9db505c2005-03-28 19:36:43 +00001777 break;
Nate Begemanc7bd4822005-04-11 06:34:10 +00001778 case MVT::i8:
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001779 BuildMI(BB, PPC::EXTSB, 1, Result).addReg(Tmp1);
Nate Begeman9db505c2005-03-28 19:36:43 +00001780 break;
Nate Begeman74747862005-03-29 22:24:51 +00001781 case MVT::i1:
1782 BuildMI(BB, PPC::SUBFIC, 2, Result).addReg(Tmp1).addSImm(0);
1783 break;
Nate Begeman9db505c2005-03-28 19:36:43 +00001784 }
Nate Begemana9795f82005-03-24 04:41:43 +00001785 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001786
Nate Begemana9795f82005-03-24 04:41:43 +00001787 case ISD::CopyFromReg:
1788 if (Result == 1)
1789 Result = ExprMap[N.getValue(0)] = MakeReg(N.getValue(0).getValueType());
1790 Tmp1 = dyn_cast<RegSDNode>(Node)->getReg();
1791 BuildMI(BB, PPC::OR, 2, Result).addReg(Tmp1).addReg(Tmp1);
1792 return Result;
1793
1794 case ISD::SHL:
Nate Begeman5e966612005-03-24 06:28:42 +00001795 Tmp1 = SelectExpr(N.getOperand(0));
1796 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.getOperand(1))) {
1797 Tmp2 = CN->getValue() & 0x1F;
Nate Begeman33162522005-03-29 21:54:38 +00001798 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp1).addImm(Tmp2).addImm(0)
Nate Begeman5e966612005-03-24 06:28:42 +00001799 .addImm(31-Tmp2);
1800 } else {
Nate Begeman3664cef2005-04-13 22:14:14 +00001801 Tmp2 = FoldIfWideZeroExtend(N.getOperand(1));
Nate Begeman5e966612005-03-24 06:28:42 +00001802 BuildMI(BB, PPC::SLW, 2, Result).addReg(Tmp1).addReg(Tmp2);
1803 }
1804 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001805
Nate Begeman5e966612005-03-24 06:28:42 +00001806 case ISD::SRL:
1807 Tmp1 = SelectExpr(N.getOperand(0));
1808 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.getOperand(1))) {
1809 Tmp2 = CN->getValue() & 0x1F;
Nate Begeman33162522005-03-29 21:54:38 +00001810 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp1).addImm(32-Tmp2)
Nate Begeman5e966612005-03-24 06:28:42 +00001811 .addImm(Tmp2).addImm(31);
1812 } else {
Nate Begeman3664cef2005-04-13 22:14:14 +00001813 Tmp2 = FoldIfWideZeroExtend(N.getOperand(1));
Nate Begeman5e966612005-03-24 06:28:42 +00001814 BuildMI(BB, PPC::SRW, 2, Result).addReg(Tmp1).addReg(Tmp2);
1815 }
1816 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001817
Nate Begeman5e966612005-03-24 06:28:42 +00001818 case ISD::SRA:
1819 Tmp1 = SelectExpr(N.getOperand(0));
1820 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.getOperand(1))) {
1821 Tmp2 = CN->getValue() & 0x1F;
1822 BuildMI(BB, PPC::SRAWI, 2, Result).addReg(Tmp1).addImm(Tmp2);
1823 } else {
Nate Begeman3664cef2005-04-13 22:14:14 +00001824 Tmp2 = FoldIfWideZeroExtend(N.getOperand(1));
Nate Begeman5e966612005-03-24 06:28:42 +00001825 BuildMI(BB, PPC::SRAW, 2, Result).addReg(Tmp1).addReg(Tmp2);
1826 }
1827 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001828
Nate Begemand7c4a4a2005-05-11 23:43:56 +00001829 case ISD::CTLZ:
1830 Tmp1 = SelectExpr(N.getOperand(0));
1831 BuildMI(BB, PPC::CNTLZW, 1, Result).addReg(Tmp1);
1832 return Result;
1833
Nate Begemana9795f82005-03-24 04:41:43 +00001834 case ISD::ADD:
1835 assert (DestType == MVT::i32 && "Only do arithmetic on i32s!");
1836 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman439b4442005-04-05 04:22:58 +00001837 switch(getImmediateForOpcode(N.getOperand(1), opcode, Tmp2)) {
Nate Begemana9795f82005-03-24 04:41:43 +00001838 default: assert(0 && "unhandled result code");
1839 case 0: // No immediate
1840 Tmp2 = SelectExpr(N.getOperand(1));
1841 BuildMI(BB, PPC::ADD, 2, Result).addReg(Tmp1).addReg(Tmp2);
1842 break;
1843 case 1: // Low immediate
1844 BuildMI(BB, PPC::ADDI, 2, Result).addReg(Tmp1).addSImm(Tmp2);
1845 break;
1846 case 2: // Shifted immediate
1847 BuildMI(BB, PPC::ADDIS, 2, Result).addReg(Tmp1).addSImm(Tmp2);
1848 break;
1849 }
1850 return Result;
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001851
Nate Begemana9795f82005-03-24 04:41:43 +00001852 case ISD::AND:
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001853 if (PPCCRopts) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001854 if (N.getOperand(0).getOpcode() == ISD::SETCC ||
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001855 N.getOperand(1).getOpcode() == ISD::SETCC) {
1856 bool Inv;
1857 Tmp1 = SelectCCExpr(N, Opc, Inv, Tmp2);
1858 MoveCRtoGPR(Tmp1, Inv, Tmp2, Result);
1859 return Result;
1860 }
1861 }
Nate Begeman7ddecb42005-04-06 23:51:40 +00001862 // FIXME: should add check in getImmediateForOpcode to return a value
1863 // indicating the immediate is a run of set bits so we can emit a bitfield
1864 // clear with RLWINM instead.
1865 switch(getImmediateForOpcode(N.getOperand(1), opcode, Tmp2)) {
1866 default: assert(0 && "unhandled result code");
1867 case 0: // No immediate
Nate Begemand7c4a4a2005-05-11 23:43:56 +00001868 // Check for andc: and, (xor a, -1), b
1869 if (N.getOperand(0).getOpcode() == ISD::XOR &&
1870 N.getOperand(0).getOperand(1).getOpcode() == ISD::Constant &&
1871 cast<ConstantSDNode>(N.getOperand(0).getOperand(1))->isAllOnesValue()) {
1872 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1873 Tmp2 = SelectExpr(N.getOperand(1));
1874 BuildMI(BB, PPC::ANDC, 2, Result).addReg(Tmp2).addReg(Tmp1);
1875 return Result;
1876 }
1877 // It wasn't and-with-complement, emit a regular and
Chris Lattnercafb67b2005-05-09 17:39:48 +00001878 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman7ddecb42005-04-06 23:51:40 +00001879 Tmp2 = SelectExpr(N.getOperand(1));
Nate Begemanc7bd4822005-04-11 06:34:10 +00001880 Opc = Recording ? PPC::ANDo : PPC::AND;
1881 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
Nate Begeman7ddecb42005-04-06 23:51:40 +00001882 break;
1883 case 1: // Low immediate
Chris Lattnercafb67b2005-05-09 17:39:48 +00001884 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman7ddecb42005-04-06 23:51:40 +00001885 BuildMI(BB, PPC::ANDIo, 2, Result).addReg(Tmp1).addImm(Tmp2);
1886 break;
1887 case 2: // Shifted immediate
Chris Lattnercafb67b2005-05-09 17:39:48 +00001888 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman7ddecb42005-04-06 23:51:40 +00001889 BuildMI(BB, PPC::ANDISo, 2, Result).addReg(Tmp1).addImm(Tmp2);
1890 break;
Nate Begeman9f833d32005-04-12 00:10:02 +00001891 case 5: // Bitfield mask
1892 Opc = Recording ? PPC::RLWINMo : PPC::RLWINM;
1893 Tmp3 = Tmp2 >> 16; // MB
1894 Tmp2 &= 0xFFFF; // ME
Chris Lattnercafb67b2005-05-09 17:39:48 +00001895
1896 if (N.getOperand(0).getOpcode() == ISD::SRL)
1897 if (ConstantSDNode *SA =
1898 dyn_cast<ConstantSDNode>(N.getOperand(0).getOperand(1))) {
1899
1900 // We can fold the RLWINM and the SRL together if the mask is
1901 // clearing the top bits which are rotated around.
1902 unsigned RotAmt = 32-(SA->getValue() & 31);
1903 if (Tmp2 <= RotAmt) {
1904 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1905 BuildMI(BB, Opc, 4, Result).addReg(Tmp1).addImm(RotAmt)
1906 .addImm(Tmp3).addImm(Tmp2);
1907 break;
1908 }
1909 }
1910
1911 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman9f833d32005-04-12 00:10:02 +00001912 BuildMI(BB, Opc, 4, Result).addReg(Tmp1).addImm(0)
1913 .addImm(Tmp3).addImm(Tmp2);
1914 break;
Nate Begeman7ddecb42005-04-06 23:51:40 +00001915 }
Nate Begemanc7bd4822005-04-11 06:34:10 +00001916 RecordSuccess = true;
Nate Begeman7ddecb42005-04-06 23:51:40 +00001917 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001918
Nate Begemana9795f82005-03-24 04:41:43 +00001919 case ISD::OR:
Nate Begeman7ddecb42005-04-06 23:51:40 +00001920 if (SelectBitfieldInsert(N, Result))
1921 return Result;
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001922 if (PPCCRopts) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001923 if (N.getOperand(0).getOpcode() == ISD::SETCC ||
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001924 N.getOperand(1).getOpcode() == ISD::SETCC) {
1925 bool Inv;
1926 Tmp1 = SelectCCExpr(N, Opc, Inv, Tmp2);
1927 MoveCRtoGPR(Tmp1, Inv, Tmp2, Result);
1928 return Result;
1929 }
1930 }
Nate Begemana9795f82005-03-24 04:41:43 +00001931 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman439b4442005-04-05 04:22:58 +00001932 switch(getImmediateForOpcode(N.getOperand(1), opcode, Tmp2)) {
Nate Begemana9795f82005-03-24 04:41:43 +00001933 default: assert(0 && "unhandled result code");
1934 case 0: // No immediate
1935 Tmp2 = SelectExpr(N.getOperand(1));
Nate Begemanc7bd4822005-04-11 06:34:10 +00001936 Opc = Recording ? PPC::ORo : PPC::OR;
1937 RecordSuccess = true;
1938 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
Nate Begemana9795f82005-03-24 04:41:43 +00001939 break;
1940 case 1: // Low immediate
Nate Begeman7ddecb42005-04-06 23:51:40 +00001941 BuildMI(BB, PPC::ORI, 2, Result).addReg(Tmp1).addImm(Tmp2);
Nate Begemana9795f82005-03-24 04:41:43 +00001942 break;
1943 case 2: // Shifted immediate
Nate Begeman7ddecb42005-04-06 23:51:40 +00001944 BuildMI(BB, PPC::ORIS, 2, Result).addReg(Tmp1).addImm(Tmp2);
Nate Begemana9795f82005-03-24 04:41:43 +00001945 break;
1946 }
1947 return Result;
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001948
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001949 case ISD::XOR: {
1950 // Check for EQV: xor, (xor a, -1), b
1951 if (N.getOperand(0).getOpcode() == ISD::XOR &&
1952 N.getOperand(0).getOperand(1).getOpcode() == ISD::Constant &&
1953 cast<ConstantSDNode>(N.getOperand(0).getOperand(1))->isAllOnesValue()) {
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001954 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1955 Tmp2 = SelectExpr(N.getOperand(1));
1956 BuildMI(BB, PPC::EQV, 2, Result).addReg(Tmp1).addReg(Tmp2);
1957 return Result;
1958 }
Chris Lattner837a5212005-04-21 21:09:11 +00001959 // Check for NOT, NOR, EQV, and NAND: xor (copy, or, xor, and), -1
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001960 if (N.getOperand(1).getOpcode() == ISD::Constant &&
1961 cast<ConstantSDNode>(N.getOperand(1))->isAllOnesValue()) {
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001962 switch(N.getOperand(0).getOpcode()) {
1963 case ISD::OR:
1964 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1965 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1));
1966 BuildMI(BB, PPC::NOR, 2, Result).addReg(Tmp1).addReg(Tmp2);
1967 break;
1968 case ISD::AND:
1969 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1970 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1));
1971 BuildMI(BB, PPC::NAND, 2, Result).addReg(Tmp1).addReg(Tmp2);
1972 break;
Chris Lattner837a5212005-04-21 21:09:11 +00001973 case ISD::XOR:
1974 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1975 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1));
1976 BuildMI(BB, PPC::EQV, 2, Result).addReg(Tmp1).addReg(Tmp2);
1977 break;
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001978 default:
1979 Tmp1 = SelectExpr(N.getOperand(0));
1980 BuildMI(BB, PPC::NOR, 2, Result).addReg(Tmp1).addReg(Tmp1);
1981 break;
1982 }
1983 return Result;
1984 }
1985 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman439b4442005-04-05 04:22:58 +00001986 switch(getImmediateForOpcode(N.getOperand(1), opcode, Tmp2)) {
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001987 default: assert(0 && "unhandled result code");
1988 case 0: // No immediate
1989 Tmp2 = SelectExpr(N.getOperand(1));
1990 BuildMI(BB, PPC::XOR, 2, Result).addReg(Tmp1).addReg(Tmp2);
1991 break;
1992 case 1: // Low immediate
1993 BuildMI(BB, PPC::XORI, 2, Result).addReg(Tmp1).addImm(Tmp2);
1994 break;
1995 case 2: // Shifted immediate
1996 BuildMI(BB, PPC::XORIS, 2, Result).addReg(Tmp1).addImm(Tmp2);
1997 break;
1998 }
1999 return Result;
2000 }
2001
Nate Begeman9e3e1b52005-03-24 23:35:30 +00002002 case ISD::SUB:
Nate Begemand7c4a4a2005-05-11 23:43:56 +00002003 if (1 == getImmediateForOpcode(N.getOperand(0), opcode, Tmp1, true)) {
2004 Tmp2 = SelectExpr(N.getOperand(1));
Nate Begeman27523a12005-04-02 00:42:16 +00002005 BuildMI(BB, PPC::SUBFIC, 2, Result).addReg(Tmp2).addSImm(Tmp1);
Nate Begemand7c4a4a2005-05-11 23:43:56 +00002006 } else if (1 == getImmediateForOpcode(N.getOperand(1), opcode, Tmp2)) {
Nate Begeman27523a12005-04-02 00:42:16 +00002007 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begemand7c4a4a2005-05-11 23:43:56 +00002008 BuildMI(BB, PPC::ADDI, 2, Result).addReg(Tmp1).addSImm(Tmp2);
2009 } else {
2010 Tmp1 = SelectExpr(N.getOperand(0));
2011 Tmp2 = SelectExpr(N.getOperand(1));
Nate Begeman27523a12005-04-02 00:42:16 +00002012 BuildMI(BB, PPC::SUBF, 2, Result).addReg(Tmp2).addReg(Tmp1);
2013 }
Nate Begeman9e3e1b52005-03-24 23:35:30 +00002014 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002015
Nate Begeman5e966612005-03-24 06:28:42 +00002016 case ISD::MUL:
Nate Begeman9e3e1b52005-03-24 23:35:30 +00002017 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman439b4442005-04-05 04:22:58 +00002018 if (1 == getImmediateForOpcode(N.getOperand(1), opcode, Tmp2))
Nate Begeman307e7442005-03-26 01:28:53 +00002019 BuildMI(BB, PPC::MULLI, 2, Result).addReg(Tmp1).addSImm(Tmp2);
2020 else {
2021 Tmp2 = SelectExpr(N.getOperand(1));
2022 BuildMI(BB, PPC::MULLW, 2, Result).addReg(Tmp1).addReg(Tmp2);
2023 }
Nate Begeman9e3e1b52005-03-24 23:35:30 +00002024 return Result;
2025
Nate Begeman815d6da2005-04-06 00:25:27 +00002026 case ISD::MULHS:
2027 case ISD::MULHU:
2028 Tmp1 = SelectExpr(N.getOperand(0));
2029 Tmp2 = SelectExpr(N.getOperand(1));
2030 Opc = (ISD::MULHU == opcode) ? PPC::MULHWU : PPC::MULHW;
2031 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
2032 return Result;
2033
Nate Begemanf3d08f32005-03-29 00:03:27 +00002034 case ISD::SDIV:
2035 case ISD::UDIV:
Nate Begeman815d6da2005-04-06 00:25:27 +00002036 switch (getImmediateForOpcode(N.getOperand(1), opcode, Tmp3)) {
2037 default: break;
2038 // If this is an sdiv by a power of two, we can use an srawi/addze pair.
2039 case 3:
Nate Begeman80196b12005-04-05 00:15:08 +00002040 Tmp1 = MakeReg(MVT::i32);
2041 Tmp2 = SelectExpr(N.getOperand(0));
Nate Begeman9f833d32005-04-12 00:10:02 +00002042 if ((int)Tmp3 < 0) {
2043 unsigned Tmp4 = MakeReg(MVT::i32);
2044 BuildMI(BB, PPC::SRAWI, 2, Tmp1).addReg(Tmp2).addImm(-Tmp3);
2045 BuildMI(BB, PPC::ADDZE, 1, Tmp4).addReg(Tmp1);
2046 BuildMI(BB, PPC::NEG, 1, Result).addReg(Tmp4);
2047 } else {
2048 BuildMI(BB, PPC::SRAWI, 2, Tmp1).addReg(Tmp2).addImm(Tmp3);
2049 BuildMI(BB, PPC::ADDZE, 1, Result).addReg(Tmp1);
2050 }
Nate Begeman80196b12005-04-05 00:15:08 +00002051 return Result;
Nate Begeman815d6da2005-04-06 00:25:27 +00002052 // If this is a divide by constant, we can emit code using some magic
2053 // constants to implement it as a multiply instead.
Nate Begeman27b4c232005-04-06 06:44:57 +00002054 case 4:
2055 ExprMap.erase(N);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002056 if (opcode == ISD::SDIV)
Nate Begeman27b4c232005-04-06 06:44:57 +00002057 return SelectExpr(BuildSDIVSequence(N));
2058 else
2059 return SelectExpr(BuildUDIVSequence(N));
Nate Begeman80196b12005-04-05 00:15:08 +00002060 }
Nate Begemanf3d08f32005-03-29 00:03:27 +00002061 Tmp1 = SelectExpr(N.getOperand(0));
2062 Tmp2 = SelectExpr(N.getOperand(1));
2063 Opc = (ISD::UDIV == opcode) ? PPC::DIVWU : PPC::DIVW;
2064 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
2065 return Result;
2066
Nate Begeman9e3e1b52005-03-24 23:35:30 +00002067 case ISD::ADD_PARTS:
Nate Begemanca12a2b2005-03-28 22:28:37 +00002068 case ISD::SUB_PARTS: {
2069 assert(N.getNumOperands() == 4 && N.getValueType() == MVT::i32 &&
2070 "Not an i64 add/sub!");
2071 // Emit all of the operands.
2072 std::vector<unsigned> InVals;
2073 for (unsigned i = 0, e = N.getNumOperands(); i != e; ++i)
2074 InVals.push_back(SelectExpr(N.getOperand(i)));
2075 if (N.getOpcode() == ISD::ADD_PARTS) {
Nate Begeman27eeb002005-04-02 05:59:34 +00002076 BuildMI(BB, PPC::ADDC, 2, Result).addReg(InVals[0]).addReg(InVals[2]);
2077 BuildMI(BB, PPC::ADDE, 2, Result+1).addReg(InVals[1]).addReg(InVals[3]);
Nate Begemanca12a2b2005-03-28 22:28:37 +00002078 } else {
Nate Begeman27eeb002005-04-02 05:59:34 +00002079 BuildMI(BB, PPC::SUBFC, 2, Result).addReg(InVals[2]).addReg(InVals[0]);
2080 BuildMI(BB, PPC::SUBFE, 2, Result+1).addReg(InVals[3]).addReg(InVals[1]);
2081 }
2082 return Result+N.ResNo;
2083 }
2084
2085 case ISD::SHL_PARTS:
2086 case ISD::SRA_PARTS:
2087 case ISD::SRL_PARTS: {
2088 assert(N.getNumOperands() == 3 && N.getValueType() == MVT::i32 &&
2089 "Not an i64 shift!");
2090 unsigned ShiftOpLo = SelectExpr(N.getOperand(0));
2091 unsigned ShiftOpHi = SelectExpr(N.getOperand(1));
Nate Begeman3664cef2005-04-13 22:14:14 +00002092 unsigned SHReg = FoldIfWideZeroExtend(N.getOperand(2));
2093 Tmp1 = MakeReg(MVT::i32);
2094 Tmp2 = MakeReg(MVT::i32);
Nate Begeman27eeb002005-04-02 05:59:34 +00002095 Tmp3 = MakeReg(MVT::i32);
2096 unsigned Tmp4 = MakeReg(MVT::i32);
2097 unsigned Tmp5 = MakeReg(MVT::i32);
2098 unsigned Tmp6 = MakeReg(MVT::i32);
2099 BuildMI(BB, PPC::SUBFIC, 2, Tmp1).addReg(SHReg).addSImm(32);
2100 if (ISD::SHL_PARTS == opcode) {
2101 BuildMI(BB, PPC::SLW, 2, Tmp2).addReg(ShiftOpHi).addReg(SHReg);
2102 BuildMI(BB, PPC::SRW, 2, Tmp3).addReg(ShiftOpLo).addReg(Tmp1);
2103 BuildMI(BB, PPC::OR, 2, Tmp4).addReg(Tmp2).addReg(Tmp3);
2104 BuildMI(BB, PPC::ADDI, 2, Tmp5).addReg(SHReg).addSImm(-32);
Nate Begemanfa554702005-04-03 22:13:27 +00002105 BuildMI(BB, PPC::SLW, 2, Tmp6).addReg(ShiftOpLo).addReg(Tmp5);
Nate Begeman27eeb002005-04-02 05:59:34 +00002106 BuildMI(BB, PPC::OR, 2, Result+1).addReg(Tmp4).addReg(Tmp6);
2107 BuildMI(BB, PPC::SLW, 2, Result).addReg(ShiftOpLo).addReg(SHReg);
2108 } else if (ISD::SRL_PARTS == opcode) {
2109 BuildMI(BB, PPC::SRW, 2, Tmp2).addReg(ShiftOpLo).addReg(SHReg);
2110 BuildMI(BB, PPC::SLW, 2, Tmp3).addReg(ShiftOpHi).addReg(Tmp1);
2111 BuildMI(BB, PPC::OR, 2, Tmp4).addReg(Tmp2).addReg(Tmp3);
2112 BuildMI(BB, PPC::ADDI, 2, Tmp5).addReg(SHReg).addSImm(-32);
2113 BuildMI(BB, PPC::SRW, 2, Tmp6).addReg(ShiftOpHi).addReg(Tmp5);
2114 BuildMI(BB, PPC::OR, 2, Result).addReg(Tmp4).addReg(Tmp6);
2115 BuildMI(BB, PPC::SRW, 2, Result+1).addReg(ShiftOpHi).addReg(SHReg);
2116 } else {
2117 MachineBasicBlock *TmpMBB = new MachineBasicBlock(BB->getBasicBlock());
2118 MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock());
2119 MachineBasicBlock *OldMBB = BB;
2120 MachineFunction *F = BB->getParent();
2121 ilist<MachineBasicBlock>::iterator It = BB; ++It;
2122 F->getBasicBlockList().insert(It, TmpMBB);
2123 F->getBasicBlockList().insert(It, PhiMBB);
2124 BB->addSuccessor(TmpMBB);
2125 BB->addSuccessor(PhiMBB);
2126 BuildMI(BB, PPC::SRW, 2, Tmp2).addReg(ShiftOpLo).addReg(SHReg);
2127 BuildMI(BB, PPC::SLW, 2, Tmp3).addReg(ShiftOpHi).addReg(Tmp1);
2128 BuildMI(BB, PPC::OR, 2, Tmp4).addReg(Tmp2).addReg(Tmp3);
2129 BuildMI(BB, PPC::ADDICo, 2, Tmp5).addReg(SHReg).addSImm(-32);
2130 BuildMI(BB, PPC::SRAW, 2, Tmp6).addReg(ShiftOpHi).addReg(Tmp5);
2131 BuildMI(BB, PPC::SRAW, 2, Result+1).addReg(ShiftOpHi).addReg(SHReg);
2132 BuildMI(BB, PPC::BLE, 2).addReg(PPC::CR0).addMBB(PhiMBB);
2133 // Select correct least significant half if the shift amount > 32
2134 BB = TmpMBB;
2135 unsigned Tmp7 = MakeReg(MVT::i32);
2136 BuildMI(BB, PPC::OR, 2, Tmp7).addReg(Tmp6).addReg(Tmp6);
2137 TmpMBB->addSuccessor(PhiMBB);
2138 BB = PhiMBB;
2139 BuildMI(BB, PPC::PHI, 4, Result).addReg(Tmp4).addMBB(OldMBB)
2140 .addReg(Tmp7).addMBB(TmpMBB);
Nate Begemanca12a2b2005-03-28 22:28:37 +00002141 }
2142 return Result+N.ResNo;
2143 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002144
Nate Begemana9795f82005-03-24 04:41:43 +00002145 case ISD::FP_TO_UINT:
Nate Begeman6b559972005-04-01 02:59:27 +00002146 case ISD::FP_TO_SINT: {
2147 bool U = (ISD::FP_TO_UINT == opcode);
2148 Tmp1 = SelectExpr(N.getOperand(0));
2149 if (!U) {
2150 Tmp2 = MakeReg(MVT::f64);
2151 BuildMI(BB, PPC::FCTIWZ, 1, Tmp2).addReg(Tmp1);
2152 int FrameIdx = BB->getParent()->getFrameInfo()->CreateStackObject(8, 8);
2153 addFrameReference(BuildMI(BB, PPC::STFD, 3).addReg(Tmp2), FrameIdx);
2154 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Result), FrameIdx, 4);
2155 return Result;
2156 } else {
2157 unsigned Zero = getConstDouble(0.0);
2158 unsigned MaxInt = getConstDouble((1LL << 32) - 1);
2159 unsigned Border = getConstDouble(1LL << 31);
2160 unsigned UseZero = MakeReg(MVT::f64);
2161 unsigned UseMaxInt = MakeReg(MVT::f64);
2162 unsigned UseChoice = MakeReg(MVT::f64);
2163 unsigned TmpReg = MakeReg(MVT::f64);
2164 unsigned TmpReg2 = MakeReg(MVT::f64);
2165 unsigned ConvReg = MakeReg(MVT::f64);
2166 unsigned IntTmp = MakeReg(MVT::i32);
2167 unsigned XorReg = MakeReg(MVT::i32);
2168 MachineFunction *F = BB->getParent();
2169 int FrameIdx = F->getFrameInfo()->CreateStackObject(8, 8);
2170 // Update machine-CFG edges
2171 MachineBasicBlock *XorMBB = new MachineBasicBlock(BB->getBasicBlock());
2172 MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock());
2173 MachineBasicBlock *OldMBB = BB;
2174 ilist<MachineBasicBlock>::iterator It = BB; ++It;
2175 F->getBasicBlockList().insert(It, XorMBB);
2176 F->getBasicBlockList().insert(It, PhiMBB);
2177 BB->addSuccessor(XorMBB);
2178 BB->addSuccessor(PhiMBB);
2179 // Convert from floating point to unsigned 32-bit value
2180 // Use 0 if incoming value is < 0.0
2181 BuildMI(BB, PPC::FSEL, 3, UseZero).addReg(Tmp1).addReg(Tmp1).addReg(Zero);
2182 // Use 2**32 - 1 if incoming value is >= 2**32
2183 BuildMI(BB, PPC::FSUB, 2, UseMaxInt).addReg(MaxInt).addReg(Tmp1);
2184 BuildMI(BB, PPC::FSEL, 3, UseChoice).addReg(UseMaxInt).addReg(UseZero)
2185 .addReg(MaxInt);
2186 // Subtract 2**31
2187 BuildMI(BB, PPC::FSUB, 2, TmpReg).addReg(UseChoice).addReg(Border);
2188 // Use difference if >= 2**31
2189 BuildMI(BB, PPC::FCMPU, 2, PPC::CR0).addReg(UseChoice).addReg(Border);
2190 BuildMI(BB, PPC::FSEL, 3, TmpReg2).addReg(TmpReg).addReg(TmpReg)
2191 .addReg(UseChoice);
2192 // Convert to integer
2193 BuildMI(BB, PPC::FCTIWZ, 1, ConvReg).addReg(TmpReg2);
2194 addFrameReference(BuildMI(BB, PPC::STFD, 3).addReg(ConvReg), FrameIdx);
2195 addFrameReference(BuildMI(BB, PPC::LWZ, 2, IntTmp), FrameIdx, 4);
2196 BuildMI(BB, PPC::BLT, 2).addReg(PPC::CR0).addMBB(PhiMBB);
2197 BuildMI(BB, PPC::B, 1).addMBB(XorMBB);
2198
2199 // XorMBB:
2200 // add 2**31 if input was >= 2**31
2201 BB = XorMBB;
2202 BuildMI(BB, PPC::XORIS, 2, XorReg).addReg(IntTmp).addImm(0x8000);
2203 XorMBB->addSuccessor(PhiMBB);
2204
2205 // PhiMBB:
2206 // DestReg = phi [ IntTmp, OldMBB ], [ XorReg, XorMBB ]
2207 BB = PhiMBB;
2208 BuildMI(BB, PPC::PHI, 4, Result).addReg(IntTmp).addMBB(OldMBB)
2209 .addReg(XorReg).addMBB(XorMBB);
2210 return Result;
2211 }
2212 assert(0 && "Should never get here");
2213 return 0;
2214 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002215
Nate Begeman9e3e1b52005-03-24 23:35:30 +00002216 case ISD::SETCC:
Nate Begeman33162522005-03-29 21:54:38 +00002217 if (SetCCSDNode *SetCC = dyn_cast<SetCCSDNode>(Node)) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002218 if (ConstantSDNode *CN =
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002219 dyn_cast<ConstantSDNode>(SetCC->getOperand(1).Val)) {
Nate Begeman9765c252005-04-12 21:22:28 +00002220 // We can codegen setcc op, imm very efficiently compared to a brcond.
2221 // Check for those cases here.
2222 // setcc op, 0
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002223 if (CN->getValue() == 0) {
2224 Tmp1 = SelectExpr(SetCC->getOperand(0));
2225 switch (SetCC->getCondition()) {
Nate Begeman7bfba7d2005-04-14 09:45:08 +00002226 default: SetCC->dump(); assert(0 && "Unhandled SetCC condition"); abort();
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002227 case ISD::SETEQ:
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002228 Tmp2 = MakeReg(MVT::i32);
2229 BuildMI(BB, PPC::CNTLZW, 1, Tmp2).addReg(Tmp1);
2230 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp2).addImm(27)
2231 .addImm(5).addImm(31);
2232 break;
2233 case ISD::SETNE:
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002234 Tmp2 = MakeReg(MVT::i32);
2235 BuildMI(BB, PPC::ADDIC, 2, Tmp2).addReg(Tmp1).addSImm(-1);
2236 BuildMI(BB, PPC::SUBFE, 2, Result).addReg(Tmp2).addReg(Tmp1);
2237 break;
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002238 case ISD::SETLT:
2239 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp1).addImm(1)
2240 .addImm(31).addImm(31);
2241 break;
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002242 case ISD::SETGT:
2243 Tmp2 = MakeReg(MVT::i32);
2244 Tmp3 = MakeReg(MVT::i32);
2245 BuildMI(BB, PPC::NEG, 2, Tmp2).addReg(Tmp1);
2246 BuildMI(BB, PPC::ANDC, 2, Tmp3).addReg(Tmp2).addReg(Tmp1);
2247 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp3).addImm(1)
2248 .addImm(31).addImm(31);
2249 break;
Nate Begeman9765c252005-04-12 21:22:28 +00002250 }
2251 return Result;
2252 }
2253 // setcc op, -1
2254 if (CN->isAllOnesValue()) {
2255 Tmp1 = SelectExpr(SetCC->getOperand(0));
2256 switch (SetCC->getCondition()) {
2257 default: assert(0 && "Unhandled SetCC condition"); abort();
2258 case ISD::SETEQ:
2259 Tmp2 = MakeReg(MVT::i32);
2260 Tmp3 = MakeReg(MVT::i32);
2261 BuildMI(BB, PPC::ADDIC, 2, Tmp2).addReg(Tmp1).addSImm(1);
2262 BuildMI(BB, PPC::LI, 1, Tmp3).addSImm(0);
2263 BuildMI(BB, PPC::ADDZE, 1, Result).addReg(Tmp3);
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002264 break;
Nate Begeman9765c252005-04-12 21:22:28 +00002265 case ISD::SETNE:
2266 Tmp2 = MakeReg(MVT::i32);
2267 Tmp3 = MakeReg(MVT::i32);
2268 BuildMI(BB, PPC::NOR, 2, Tmp2).addReg(Tmp1).addReg(Tmp1);
2269 BuildMI(BB, PPC::ADDIC, 2, Tmp3).addReg(Tmp2).addSImm(-1);
2270 BuildMI(BB, PPC::SUBFE, 2, Result).addReg(Tmp3).addReg(Tmp2);
2271 break;
2272 case ISD::SETLT:
2273 Tmp2 = MakeReg(MVT::i32);
2274 Tmp3 = MakeReg(MVT::i32);
2275 BuildMI(BB, PPC::ADDI, 2, Tmp2).addReg(Tmp1).addSImm(1);
2276 BuildMI(BB, PPC::AND, 2, Tmp3).addReg(Tmp2).addReg(Tmp1);
2277 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp3).addImm(1)
2278 .addImm(31).addImm(31);
2279 break;
2280 case ISD::SETGT:
2281 Tmp2 = MakeReg(MVT::i32);
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002282 BuildMI(BB, PPC::RLWINM, 4, Tmp2).addReg(Tmp1).addImm(1)
2283 .addImm(31).addImm(31);
2284 BuildMI(BB, PPC::XORI, 2, Result).addReg(Tmp2).addImm(1);
2285 break;
2286 }
2287 return Result;
2288 }
2289 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002290
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00002291 bool Inv;
2292 unsigned CCReg = SelectCC(N, Opc, Inv, Tmp2);
2293 MoveCRtoGPR(CCReg, Inv, Tmp2, Result);
Nate Begeman33162522005-03-29 21:54:38 +00002294 return Result;
2295 }
2296 assert(0 && "Is this legal?");
2297 return 0;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002298
Nate Begeman74747862005-03-29 22:24:51 +00002299 case ISD::SELECT: {
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00002300 bool Inv;
Chris Lattner30710192005-04-01 07:10:02 +00002301 unsigned TrueValue = SelectExpr(N.getOperand(1)); //Use if TRUE
2302 unsigned FalseValue = SelectExpr(N.getOperand(2)); //Use if FALSE
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00002303 unsigned CCReg = SelectCC(N.getOperand(0), Opc, Inv, Tmp3);
Chris Lattner30710192005-04-01 07:10:02 +00002304
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002305 // Create an iterator with which to insert the MBB for copying the false
Nate Begeman74747862005-03-29 22:24:51 +00002306 // value and the MBB to hold the PHI instruction for this SetCC.
2307 MachineBasicBlock *thisMBB = BB;
2308 const BasicBlock *LLVM_BB = BB->getBasicBlock();
2309 ilist<MachineBasicBlock>::iterator It = BB;
2310 ++It;
2311
2312 // thisMBB:
2313 // ...
2314 // TrueVal = ...
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00002315 // cmpTY ccX, r1, r2
Nate Begeman74747862005-03-29 22:24:51 +00002316 // bCC copy1MBB
2317 // fallthrough --> copy0MBB
Nate Begeman74747862005-03-29 22:24:51 +00002318 MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB);
2319 MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB);
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00002320 BuildMI(BB, Opc, 2).addReg(CCReg).addMBB(sinkMBB);
Nate Begeman74747862005-03-29 22:24:51 +00002321 MachineFunction *F = BB->getParent();
2322 F->getBasicBlockList().insert(It, copy0MBB);
2323 F->getBasicBlockList().insert(It, sinkMBB);
2324 // Update machine-CFG edges
2325 BB->addSuccessor(copy0MBB);
2326 BB->addSuccessor(sinkMBB);
2327
2328 // copy0MBB:
2329 // %FalseValue = ...
2330 // # fallthrough to sinkMBB
2331 BB = copy0MBB;
Nate Begeman74747862005-03-29 22:24:51 +00002332 // Update machine-CFG edges
2333 BB->addSuccessor(sinkMBB);
2334
2335 // sinkMBB:
2336 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
2337 // ...
2338 BB = sinkMBB;
2339 BuildMI(BB, PPC::PHI, 4, Result).addReg(FalseValue)
2340 .addMBB(copy0MBB).addReg(TrueValue).addMBB(thisMBB);
Nate Begeman74747862005-03-29 22:24:51 +00002341 return Result;
2342 }
Nate Begemana9795f82005-03-24 04:41:43 +00002343
2344 case ISD::Constant:
2345 switch (N.getValueType()) {
2346 default: assert(0 && "Cannot use constants of this type!");
2347 case MVT::i1:
2348 BuildMI(BB, PPC::LI, 1, Result)
2349 .addSImm(!cast<ConstantSDNode>(N)->isNullValue());
2350 break;
2351 case MVT::i32:
2352 {
2353 int v = (int)cast<ConstantSDNode>(N)->getSignExtended();
2354 if (v < 32768 && v >= -32768) {
2355 BuildMI(BB, PPC::LI, 1, Result).addSImm(v);
2356 } else {
Nate Begeman5e966612005-03-24 06:28:42 +00002357 Tmp1 = MakeReg(MVT::i32);
2358 BuildMI(BB, PPC::LIS, 1, Tmp1).addSImm(v >> 16);
2359 BuildMI(BB, PPC::ORI, 2, Result).addReg(Tmp1).addImm(v & 0xFFFF);
Nate Begemana9795f82005-03-24 04:41:43 +00002360 }
2361 }
2362 }
2363 return Result;
2364 }
2365
2366 return 0;
2367}
2368
2369void ISel::Select(SDOperand N) {
2370 unsigned Tmp1, Tmp2, Opc;
2371 unsigned opcode = N.getOpcode();
2372
2373 if (!ExprMap.insert(std::make_pair(N, 1)).second)
2374 return; // Already selected.
2375
2376 SDNode *Node = N.Val;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002377
Nate Begemana9795f82005-03-24 04:41:43 +00002378 switch (Node->getOpcode()) {
2379 default:
2380 Node->dump(); std::cerr << "\n";
2381 assert(0 && "Node not handled yet!");
2382 case ISD::EntryToken: return; // Noop
2383 case ISD::TokenFactor:
2384 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
2385 Select(Node->getOperand(i));
2386 return;
Chris Lattner16cd04d2005-05-12 23:24:06 +00002387 case ISD::CALLSEQ_START:
2388 case ISD::CALLSEQ_END:
Nate Begemana9795f82005-03-24 04:41:43 +00002389 Select(N.getOperand(0));
2390 Tmp1 = cast<ConstantSDNode>(N.getOperand(1))->getValue();
Chris Lattner16cd04d2005-05-12 23:24:06 +00002391 Opc = N.getOpcode() == ISD::CALLSEQ_START ? PPC::ADJCALLSTACKDOWN :
Nate Begemana9795f82005-03-24 04:41:43 +00002392 PPC::ADJCALLSTACKUP;
2393 BuildMI(BB, Opc, 1).addImm(Tmp1);
2394 return;
2395 case ISD::BR: {
2396 MachineBasicBlock *Dest =
2397 cast<BasicBlockSDNode>(N.getOperand(1))->getBasicBlock();
Nate Begemana9795f82005-03-24 04:41:43 +00002398 Select(N.getOperand(0));
2399 BuildMI(BB, PPC::B, 1).addMBB(Dest);
2400 return;
2401 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002402 case ISD::BRCOND:
Nate Begemancd08e4c2005-04-09 20:09:12 +00002403 case ISD::BRCONDTWOWAY:
Nate Begemana9795f82005-03-24 04:41:43 +00002404 SelectBranchCC(N);
2405 return;
2406 case ISD::CopyToReg:
2407 Select(N.getOperand(0));
2408 Tmp1 = SelectExpr(N.getOperand(1));
2409 Tmp2 = cast<RegSDNode>(N)->getReg();
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002410
Nate Begemana9795f82005-03-24 04:41:43 +00002411 if (Tmp1 != Tmp2) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002412 if (N.getOperand(1).getValueType() == MVT::f64 ||
Nate Begemana9795f82005-03-24 04:41:43 +00002413 N.getOperand(1).getValueType() == MVT::f32)
2414 BuildMI(BB, PPC::FMR, 1, Tmp2).addReg(Tmp1);
2415 else
2416 BuildMI(BB, PPC::OR, 2, Tmp2).addReg(Tmp1).addReg(Tmp1);
2417 }
2418 return;
2419 case ISD::ImplicitDef:
2420 Select(N.getOperand(0));
2421 BuildMI(BB, PPC::IMPLICIT_DEF, 0, cast<RegSDNode>(N)->getReg());
2422 return;
2423 case ISD::RET:
2424 switch (N.getNumOperands()) {
2425 default:
2426 assert(0 && "Unknown return instruction!");
2427 case 3:
2428 assert(N.getOperand(1).getValueType() == MVT::i32 &&
2429 N.getOperand(2).getValueType() == MVT::i32 &&
Misha Brukman7847fca2005-04-22 17:54:37 +00002430 "Unknown two-register value!");
Nate Begemana9795f82005-03-24 04:41:43 +00002431 Select(N.getOperand(0));
2432 Tmp1 = SelectExpr(N.getOperand(1));
2433 Tmp2 = SelectExpr(N.getOperand(2));
Nate Begeman27523a12005-04-02 00:42:16 +00002434 BuildMI(BB, PPC::OR, 2, PPC::R3).addReg(Tmp2).addReg(Tmp2);
2435 BuildMI(BB, PPC::OR, 2, PPC::R4).addReg(Tmp1).addReg(Tmp1);
Nate Begemana9795f82005-03-24 04:41:43 +00002436 break;
2437 case 2:
2438 Select(N.getOperand(0));
2439 Tmp1 = SelectExpr(N.getOperand(1));
2440 switch (N.getOperand(1).getValueType()) {
2441 default:
2442 assert(0 && "Unknown return type!");
2443 case MVT::f64:
2444 case MVT::f32:
2445 BuildMI(BB, PPC::FMR, 1, PPC::F1).addReg(Tmp1);
2446 break;
2447 case MVT::i32:
2448 BuildMI(BB, PPC::OR, 2, PPC::R3).addReg(Tmp1).addReg(Tmp1);
2449 break;
2450 }
Nate Begeman9e3e1b52005-03-24 23:35:30 +00002451 case 1:
2452 Select(N.getOperand(0));
2453 break;
Nate Begemana9795f82005-03-24 04:41:43 +00002454 }
2455 BuildMI(BB, PPC::BLR, 0); // Just emit a 'ret' instruction
2456 return;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002457 case ISD::TRUNCSTORE:
2458 case ISD::STORE:
Nate Begemana9795f82005-03-24 04:41:43 +00002459 {
2460 SDOperand Chain = N.getOperand(0);
2461 SDOperand Value = N.getOperand(1);
2462 SDOperand Address = N.getOperand(2);
2463 Select(Chain);
2464
2465 Tmp1 = SelectExpr(Value); //value
2466
2467 if (opcode == ISD::STORE) {
2468 switch(Value.getValueType()) {
2469 default: assert(0 && "unknown Type in store");
2470 case MVT::i32: Opc = PPC::STW; break;
2471 case MVT::f64: Opc = PPC::STFD; break;
2472 case MVT::f32: Opc = PPC::STFS; break;
2473 }
2474 } else { //ISD::TRUNCSTORE
2475 switch(cast<MVTSDNode>(Node)->getExtraValueType()) {
2476 default: assert(0 && "unknown Type in store");
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002477 case MVT::i1:
Nate Begemana9795f82005-03-24 04:41:43 +00002478 case MVT::i8: Opc = PPC::STB; break;
2479 case MVT::i16: Opc = PPC::STH; break;
2480 }
2481 }
2482
Nate Begemana7e11a42005-04-01 05:57:17 +00002483 if(Address.getOpcode() == ISD::FrameIndex)
Nate Begemana9795f82005-03-24 04:41:43 +00002484 {
Nate Begeman58f718c2005-03-30 02:23:08 +00002485 Tmp2 = cast<FrameIndexSDNode>(Address)->getIndex();
2486 addFrameReference(BuildMI(BB, Opc, 3).addReg(Tmp1), (int)Tmp2);
Nate Begemana9795f82005-03-24 04:41:43 +00002487 }
2488 else
2489 {
2490 int offset;
Nate Begeman04730362005-04-01 04:45:11 +00002491 bool idx = SelectAddr(Address, Tmp2, offset);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002492 if (idx) {
Nate Begeman04730362005-04-01 04:45:11 +00002493 Opc = IndexedOpForOp(Opc);
2494 BuildMI(BB, Opc, 3).addReg(Tmp1).addReg(Tmp2).addReg(offset);
2495 } else {
2496 BuildMI(BB, Opc, 3).addReg(Tmp1).addImm(offset).addReg(Tmp2);
2497 }
Nate Begemana9795f82005-03-24 04:41:43 +00002498 }
2499 return;
2500 }
2501 case ISD::EXTLOAD:
2502 case ISD::SEXTLOAD:
2503 case ISD::ZEXTLOAD:
2504 case ISD::LOAD:
2505 case ISD::CopyFromReg:
2506 case ISD::CALL:
2507 case ISD::DYNAMIC_STACKALLOC:
2508 ExprMap.erase(N);
2509 SelectExpr(N);
2510 return;
2511 }
2512 assert(0 && "Should not be reached!");
2513}
2514
2515
2516/// createPPC32PatternInstructionSelector - This pass converts an LLVM function
2517/// into a machine code representation using pattern matching and a machine
2518/// description file.
2519///
2520FunctionPass *llvm::createPPC32ISelPattern(TargetMachine &TM) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002521 return new ISel(TM);
Chris Lattner246fa632005-03-24 06:16:18 +00002522}
2523