blob: efebd2e16cd38296e12c5e2f9e219fbf4f64bbdc [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 Begemana3fd4002005-07-19 16:51:05 +000020#include "llvm/Constants.h"
Nate Begemana9795f82005-03-24 04:41:43 +000021#include "llvm/Function.h"
Nate Begemana3fd4002005-07-19 16:51:05 +000022#include "llvm/CodeGen/MachineConstantPool.h"
Nate Begemana9795f82005-03-24 04:41:43 +000023#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
Chris Lattner0561b3f2005-08-02 19:26:06 +000038
Nate Begemana9795f82005-03-24 04:41:43 +000039//===----------------------------------------------------------------------===//
40// PPC32TargetLowering - PPC32 Implementation of the TargetLowering interface
41namespace {
42 class PPC32TargetLowering : public TargetLowering {
43 int VarArgsFrameIndex; // FrameIndex for start of varargs area.
44 int ReturnAddrIndex; // FrameIndex for return slot.
45 public:
46 PPC32TargetLowering(TargetMachine &TM) : TargetLowering(TM) {
Chris Lattner9bce0f92005-05-12 02:06:00 +000047 // Fold away setcc operations if possible.
48 setSetCCIsExpensive();
49
Nate Begemana9795f82005-03-24 04:41:43 +000050 // Set up the register classes.
51 addRegisterClass(MVT::i32, PPC32::GPRCRegisterClass);
Nate Begeman7532e2f2005-03-26 08:25:22 +000052 addRegisterClass(MVT::f32, PPC32::FPRCRegisterClass);
Nate Begemana9795f82005-03-24 04:41:43 +000053 addRegisterClass(MVT::f64, PPC32::FPRCRegisterClass);
Misha Brukmanb5f662f2005-04-21 23:30:14 +000054
Nate Begeman74d73452005-03-31 00:15:26 +000055 // PowerPC has no intrinsics for these particular operations
Nate Begeman01d05262005-03-30 01:45:43 +000056 setOperationAction(ISD::MEMMOVE, MVT::Other, Expand);
57 setOperationAction(ISD::MEMSET, MVT::Other, Expand);
58 setOperationAction(ISD::MEMCPY, MVT::Other, Expand);
59
Nate Begeman74d73452005-03-31 00:15:26 +000060 // PowerPC has an i16 but no i8 (or i1) SEXTLOAD
61 setOperationAction(ISD::SEXTLOAD, MVT::i1, Expand);
62 setOperationAction(ISD::SEXTLOAD, MVT::i8, Expand);
Misha Brukmanb5f662f2005-04-21 23:30:14 +000063
Nate Begeman815d6da2005-04-06 00:25:27 +000064 // PowerPC has no SREM/UREM instructions
65 setOperationAction(ISD::SREM, MVT::i32, Expand);
66 setOperationAction(ISD::UREM, MVT::i32, Expand);
Chris Lattner43fdea02005-04-02 05:03:24 +000067
Chris Lattner32f3cf62005-05-13 16:20:22 +000068 // We don't support sin/cos/sqrt/fmod
Chris Lattner17234b72005-04-30 04:26:06 +000069 setOperationAction(ISD::FSIN , MVT::f64, Expand);
70 setOperationAction(ISD::FCOS , 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);
Chris Lattner32f3cf62005-05-13 16:20:22 +000074 setOperationAction(ISD::SREM , MVT::f32, Expand);
Chris Lattner17234b72005-04-30 04:26:06 +000075
Nate Begemanadeb43d2005-07-20 22:42:00 +000076 // If we're enabling GP optimizations, use hardware square root
Chris Lattner3c304a32005-08-05 22:05:03 +000077 if (!TM.getSubtarget<PPCSubtarget>().isGigaProcessor()) {
Nate Begemanadeb43d2005-07-20 22:42:00 +000078 setOperationAction(ISD::FSQRT, MVT::f64, Expand);
79 setOperationAction(ISD::FSQRT, MVT::f32, Expand);
80 }
Jeff Cohen00b168892005-07-27 06:12:32 +000081
Nate Begemand7c4a4a2005-05-11 23:43:56 +000082 //PowerPC does not have CTPOP or CTTZ
Andrew Lenharth691ef2b2005-05-03 17:19:30 +000083 setOperationAction(ISD::CTPOP, MVT::i32 , Expand);
84 setOperationAction(ISD::CTTZ , MVT::i32 , Expand);
Andrew Lenharth691ef2b2005-05-03 17:19:30 +000085
Chris Lattnercbd06fc2005-04-07 19:41:49 +000086 setSetCCResultContents(ZeroOrOneSetCCResult);
Nate Begeman3e897162005-03-31 23:55:40 +000087 addLegalFPImmediate(+0.0); // Necessary for FSEL
Misha Brukmanb5f662f2005-04-21 23:30:14 +000088 addLegalFPImmediate(-0.0); //
Nate Begeman3e897162005-03-31 23:55:40 +000089
Nate Begemana9795f82005-03-24 04:41:43 +000090 computeRegisterProperties();
91 }
92
93 /// LowerArguments - This hook must be implemented to indicate how we should
94 /// lower the arguments for the specified function, into the specified DAG.
95 virtual std::vector<SDOperand>
96 LowerArguments(Function &F, SelectionDAG &DAG);
Misha Brukmanb5f662f2005-04-21 23:30:14 +000097
Nate Begemana9795f82005-03-24 04:41:43 +000098 /// LowerCallTo - This hook lowers an abstract call to a function into an
99 /// actual call.
100 virtual std::pair<SDOperand, SDOperand>
Chris Lattnerc57f6822005-05-12 19:56:45 +0000101 LowerCallTo(SDOperand Chain, const Type *RetTy, bool isVarArg, unsigned CC,
Chris Lattneradf6a962005-05-13 18:50:42 +0000102 bool isTailCall, SDOperand Callee, ArgListTy &Args,
103 SelectionDAG &DAG);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000104
Chris Lattnere0fe2252005-07-05 19:58:54 +0000105 virtual SDOperand LowerVAStart(SDOperand Chain, SDOperand VAListP,
106 Value *VAListV, SelectionDAG &DAG);
Jeff Cohen00b168892005-07-27 06:12:32 +0000107
Nate Begemana9795f82005-03-24 04:41:43 +0000108 virtual std::pair<SDOperand,SDOperand>
Chris Lattnere0fe2252005-07-05 19:58:54 +0000109 LowerVAArg(SDOperand Chain, SDOperand VAListP, Value *VAListV,
110 const Type *ArgTy, SelectionDAG &DAG);
Jeff Cohen00b168892005-07-27 06:12:32 +0000111
Nate Begemana9795f82005-03-24 04:41:43 +0000112 virtual std::pair<SDOperand, SDOperand>
113 LowerFrameReturnAddress(bool isFrameAddr, SDOperand Chain, unsigned Depth,
114 SelectionDAG &DAG);
115 };
116}
117
118
119std::vector<SDOperand>
120PPC32TargetLowering::LowerArguments(Function &F, SelectionDAG &DAG) {
121 //
122 // add beautiful description of PPC stack frame format, or at least some docs
123 //
124 MachineFunction &MF = DAG.getMachineFunction();
125 MachineFrameInfo *MFI = MF.getFrameInfo();
126 MachineBasicBlock& BB = MF.front();
127 std::vector<SDOperand> ArgValues;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000128
129 // Due to the rather complicated nature of the PowerPC ABI, rather than a
Nate Begemana9795f82005-03-24 04:41:43 +0000130 // fixed size array of physical args, for the sake of simplicity let the STL
131 // handle tracking them for us.
132 std::vector<unsigned> argVR, argPR, argOp;
133 unsigned ArgOffset = 24;
134 unsigned GPR_remaining = 8;
135 unsigned FPR_remaining = 13;
136 unsigned GPR_idx = 0, FPR_idx = 0;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000137 static const unsigned GPR[] = {
Nate Begemana9795f82005-03-24 04:41:43 +0000138 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
139 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
140 };
141 static const unsigned FPR[] = {
142 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
143 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
144 };
145
146 // Add DAG nodes to load the arguments... On entry to a function on PPC,
147 // the arguments start at offset 24, although they are likely to be passed
148 // in registers.
149 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; ++I) {
150 SDOperand newroot, argt;
151 unsigned ObjSize;
152 bool needsLoad = false;
Nate Begemancd08e4c2005-04-09 20:09:12 +0000153 bool ArgLive = !I->use_empty();
Nate Begemana9795f82005-03-24 04:41:43 +0000154 MVT::ValueType ObjectVT = getValueType(I->getType());
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000155
Nate Begemana9795f82005-03-24 04:41:43 +0000156 switch (ObjectVT) {
157 default: assert(0 && "Unhandled argument type!");
158 case MVT::i1:
159 case MVT::i8:
160 case MVT::i16:
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000161 case MVT::i32:
Nate Begemana9795f82005-03-24 04:41:43 +0000162 ObjSize = 4;
Nate Begemancd08e4c2005-04-09 20:09:12 +0000163 if (!ArgLive) break;
Nate Begemana9795f82005-03-24 04:41:43 +0000164 if (GPR_remaining > 0) {
Nate Begemancd08e4c2005-04-09 20:09:12 +0000165 MF.addLiveIn(GPR[GPR_idx]);
Nate Begemanf70b5762005-03-28 23:08:54 +0000166 argt = newroot = DAG.getCopyFromReg(GPR[GPR_idx], MVT::i32,
167 DAG.getRoot());
Nate Begemana9795f82005-03-24 04:41:43 +0000168 if (ObjectVT != MVT::i32)
169 argt = DAG.getNode(ISD::TRUNCATE, ObjectVT, newroot);
Nate Begemana9795f82005-03-24 04:41:43 +0000170 } else {
171 needsLoad = true;
172 }
173 break;
Nate Begemanf7e43382005-03-26 07:46:36 +0000174 case MVT::i64: ObjSize = 8;
Nate Begemancd08e4c2005-04-09 20:09:12 +0000175 if (!ArgLive) break;
Nate Begemanc5b1cd22005-04-10 05:53:14 +0000176 if (GPR_remaining > 0) {
177 SDOperand argHi, argLo;
Nate Begemancd08e4c2005-04-09 20:09:12 +0000178 MF.addLiveIn(GPR[GPR_idx]);
Nate Begemanc5b1cd22005-04-10 05:53:14 +0000179 argHi = DAG.getCopyFromReg(GPR[GPR_idx], MVT::i32, DAG.getRoot());
180 // If we have two or more remaining argument registers, then both halves
181 // of the i64 can be sourced from there. Otherwise, the lower half will
182 // have to come off the stack. This can happen when an i64 is preceded
183 // by 28 bytes of arguments.
184 if (GPR_remaining > 1) {
185 MF.addLiveIn(GPR[GPR_idx+1]);
186 argLo = DAG.getCopyFromReg(GPR[GPR_idx+1], MVT::i32, argHi);
187 } else {
188 int FI = MFI->CreateFixedObject(4, ArgOffset+4);
189 SDOperand FIN = DAG.getFrameIndex(FI, MVT::i32);
Chris Lattner022ed322005-05-15 19:54:37 +0000190 argLo = DAG.getLoad(MVT::i32, DAG.getEntryNode(), FIN,
191 DAG.getSrcValue(NULL));
Nate Begemanc5b1cd22005-04-10 05:53:14 +0000192 }
Nate Begemanca12a2b2005-03-28 22:28:37 +0000193 // Build the outgoing arg thingy
Nate Begemanf70b5762005-03-28 23:08:54 +0000194 argt = DAG.getNode(ISD::BUILD_PAIR, MVT::i64, argLo, argHi);
195 newroot = argLo;
Nate Begemana9795f82005-03-24 04:41:43 +0000196 } else {
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000197 needsLoad = true;
Nate Begemana9795f82005-03-24 04:41:43 +0000198 }
199 break;
Nate Begemancd08e4c2005-04-09 20:09:12 +0000200 case MVT::f32:
201 case MVT::f64:
202 ObjSize = (ObjectVT == MVT::f64) ? 8 : 4;
203 if (!ArgLive) break;
Nate Begemana9795f82005-03-24 04:41:43 +0000204 if (FPR_remaining > 0) {
Nate Begemancd08e4c2005-04-09 20:09:12 +0000205 MF.addLiveIn(FPR[FPR_idx]);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000206 argt = newroot = DAG.getCopyFromReg(FPR[FPR_idx], ObjectVT,
Nate Begemanf70b5762005-03-28 23:08:54 +0000207 DAG.getRoot());
Nate Begemana9795f82005-03-24 04:41:43 +0000208 --FPR_remaining;
209 ++FPR_idx;
210 } else {
211 needsLoad = true;
212 }
213 break;
214 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000215
Nate Begemana9795f82005-03-24 04:41:43 +0000216 // We need to load the argument to a virtual register if we determined above
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000217 // that we ran out of physical registers of the appropriate type
Nate Begemana9795f82005-03-24 04:41:43 +0000218 if (needsLoad) {
Nate Begemane5846682005-04-04 06:52:38 +0000219 unsigned SubregOffset = 0;
Nate Begemanc3e2db42005-04-04 09:09:00 +0000220 if (ObjectVT == MVT::i8 || ObjectVT == MVT::i1) SubregOffset = 3;
Nate Begemane5846682005-04-04 06:52:38 +0000221 if (ObjectVT == MVT::i16) SubregOffset = 2;
Nate Begemana9795f82005-03-24 04:41:43 +0000222 int FI = MFI->CreateFixedObject(ObjSize, ArgOffset);
223 SDOperand FIN = DAG.getFrameIndex(FI, MVT::i32);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000224 FIN = DAG.getNode(ISD::ADD, MVT::i32, FIN,
Nate Begemane5846682005-04-04 06:52:38 +0000225 DAG.getConstant(SubregOffset, MVT::i32));
Chris Lattner022ed322005-05-15 19:54:37 +0000226 argt = newroot = DAG.getLoad(ObjectVT, DAG.getEntryNode(), FIN,
227 DAG.getSrcValue(NULL));
Nate Begemana9795f82005-03-24 04:41:43 +0000228 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000229
Nate Begemana9795f82005-03-24 04:41:43 +0000230 // Every 4 bytes of argument space consumes one of the GPRs available for
231 // argument passing.
232 if (GPR_remaining > 0) {
233 unsigned delta = (GPR_remaining > 1 && ObjSize == 8) ? 2 : 1;
234 GPR_remaining -= delta;
235 GPR_idx += delta;
236 }
237 ArgOffset += ObjSize;
Chris Lattner91277ea2005-04-09 21:23:24 +0000238 if (newroot.Val)
239 DAG.setRoot(newroot.getValue(1));
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000240
Nate Begemana9795f82005-03-24 04:41:43 +0000241 ArgValues.push_back(argt);
242 }
243
Nate Begemana9795f82005-03-24 04:41:43 +0000244 // If the function takes variable number of arguments, make a frame index for
245 // the start of the first vararg value... for expansion of llvm.va_start.
Nate Begemanfa554702005-04-03 22:13:27 +0000246 if (F.isVarArg()) {
Nate Begemana9795f82005-03-24 04:41:43 +0000247 VarArgsFrameIndex = MFI->CreateFixedObject(4, ArgOffset);
Nate Begemanfa554702005-04-03 22:13:27 +0000248 SDOperand FIN = DAG.getFrameIndex(VarArgsFrameIndex, MVT::i32);
Nate Begeman6644d4c2005-04-03 23:11:17 +0000249 // If this function is vararg, store any remaining integer argument regs
250 // to their spots on the stack so that they may be loaded by deferencing the
251 // result of va_next.
252 std::vector<SDOperand> MemOps;
253 for (; GPR_remaining > 0; --GPR_remaining, ++GPR_idx) {
Nate Begemancd08e4c2005-04-09 20:09:12 +0000254 MF.addLiveIn(GPR[GPR_idx]);
Nate Begeman6644d4c2005-04-03 23:11:17 +0000255 SDOperand Val = DAG.getCopyFromReg(GPR[GPR_idx], MVT::i32, DAG.getRoot());
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000256 SDOperand Store = DAG.getNode(ISD::STORE, MVT::Other, Val.getValue(1),
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000257 Val, FIN, DAG.getSrcValue(NULL));
Nate Begeman6644d4c2005-04-03 23:11:17 +0000258 MemOps.push_back(Store);
259 // Increment the address by four for the next argument to store
260 SDOperand PtrOff = DAG.getConstant(4, getPointerTy());
261 FIN = DAG.getNode(ISD::ADD, MVT::i32, FIN, PtrOff);
262 }
263 DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, MemOps));
Nate Begemanfa554702005-04-03 22:13:27 +0000264 }
Nate Begemana9795f82005-03-24 04:41:43 +0000265
Nate Begemancd08e4c2005-04-09 20:09:12 +0000266 // Finally, inform the code generator which regs we return values in.
267 switch (getValueType(F.getReturnType())) {
268 default: assert(0 && "Unknown type!");
269 case MVT::isVoid: break;
270 case MVT::i1:
271 case MVT::i8:
272 case MVT::i16:
273 case MVT::i32:
274 MF.addLiveOut(PPC::R3);
275 break;
276 case MVT::i64:
277 MF.addLiveOut(PPC::R3);
278 MF.addLiveOut(PPC::R4);
279 break;
280 case MVT::f32:
281 case MVT::f64:
282 MF.addLiveOut(PPC::F1);
283 break;
284 }
285
Nate Begemana9795f82005-03-24 04:41:43 +0000286 return ArgValues;
287}
288
289std::pair<SDOperand, SDOperand>
290PPC32TargetLowering::LowerCallTo(SDOperand Chain,
Misha Brukman7847fca2005-04-22 17:54:37 +0000291 const Type *RetTy, bool isVarArg,
Jeff Cohen00b168892005-07-27 06:12:32 +0000292 unsigned CallingConv, bool isTailCall,
Misha Brukman7847fca2005-04-22 17:54:37 +0000293 SDOperand Callee, ArgListTy &Args,
294 SelectionDAG &DAG) {
Nate Begeman307e7442005-03-26 01:28:53 +0000295 // args_to_use will accumulate outgoing args for the ISD::CALL case in
296 // SelectExpr to use to put the arguments in the appropriate registers.
Nate Begemana9795f82005-03-24 04:41:43 +0000297 std::vector<SDOperand> args_to_use;
Nate Begeman307e7442005-03-26 01:28:53 +0000298
299 // Count how many bytes are to be pushed on the stack, including the linkage
300 // area, and parameter passing area.
301 unsigned NumBytes = 24;
302
303 if (Args.empty()) {
Chris Lattner16cd04d2005-05-12 23:24:06 +0000304 Chain = DAG.getNode(ISD::CALLSEQ_START, MVT::Other, Chain,
Nate Begemana7e11a42005-04-01 05:57:17 +0000305 DAG.getConstant(NumBytes, getPointerTy()));
Nate Begeman307e7442005-03-26 01:28:53 +0000306 } else {
307 for (unsigned i = 0, e = Args.size(); i != e; ++i)
308 switch (getValueType(Args[i].second)) {
309 default: assert(0 && "Unknown value type!");
310 case MVT::i1:
311 case MVT::i8:
312 case MVT::i16:
313 case MVT::i32:
314 case MVT::f32:
315 NumBytes += 4;
316 break;
317 case MVT::i64:
318 case MVT::f64:
319 NumBytes += 8;
320 break;
321 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000322
323 // Just to be safe, we'll always reserve the full 24 bytes of linkage area
Nate Begeman307e7442005-03-26 01:28:53 +0000324 // plus 32 bytes of argument space in case any called code gets funky on us.
Chris Lattner0561b3f2005-08-02 19:26:06 +0000325 // (Required by ABI to support var arg)
Nate Begeman307e7442005-03-26 01:28:53 +0000326 if (NumBytes < 56) NumBytes = 56;
327
328 // Adjust the stack pointer for the new arguments...
329 // These operations are automatically eliminated by the prolog/epilog pass
Chris Lattner16cd04d2005-05-12 23:24:06 +0000330 Chain = DAG.getNode(ISD::CALLSEQ_START, MVT::Other, Chain,
Nate Begeman307e7442005-03-26 01:28:53 +0000331 DAG.getConstant(NumBytes, getPointerTy()));
332
333 // Set up a copy of the stack pointer for use loading and storing any
334 // arguments that may not fit in the registers available for argument
335 // passing.
336 SDOperand StackPtr = DAG.getCopyFromReg(PPC::R1, MVT::i32,
337 DAG.getEntryNode());
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000338
Nate Begeman307e7442005-03-26 01:28:53 +0000339 // Figure out which arguments are going to go in registers, and which in
340 // memory. Also, if this is a vararg function, floating point operations
341 // must be stored to our stack, and loaded into integer regs as well, if
342 // any integer regs are available for argument passing.
343 unsigned ArgOffset = 24;
344 unsigned GPR_remaining = 8;
345 unsigned FPR_remaining = 13;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000346
Nate Begeman74d73452005-03-31 00:15:26 +0000347 std::vector<SDOperand> MemOps;
Nate Begeman307e7442005-03-26 01:28:53 +0000348 for (unsigned i = 0, e = Args.size(); i != e; ++i) {
349 // PtrOff will be used to store the current argument to the stack if a
350 // register cannot be found for it.
351 SDOperand PtrOff = DAG.getConstant(ArgOffset, getPointerTy());
352 PtrOff = DAG.getNode(ISD::ADD, MVT::i32, StackPtr, PtrOff);
Nate Begemanf7e43382005-03-26 07:46:36 +0000353 MVT::ValueType ArgVT = getValueType(Args[i].second);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000354
Nate Begemanf7e43382005-03-26 07:46:36 +0000355 switch (ArgVT) {
Nate Begeman307e7442005-03-26 01:28:53 +0000356 default: assert(0 && "Unexpected ValueType for argument!");
357 case MVT::i1:
358 case MVT::i8:
359 case MVT::i16:
360 // Promote the integer to 32 bits. If the input type is signed use a
361 // sign extend, otherwise use a zero extend.
362 if (Args[i].second->isSigned())
363 Args[i].first =DAG.getNode(ISD::SIGN_EXTEND, MVT::i32, Args[i].first);
364 else
365 Args[i].first =DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, Args[i].first);
366 // FALL THROUGH
367 case MVT::i32:
368 if (GPR_remaining > 0) {
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000369 args_to_use.push_back(Args[i].first);
Nate Begeman307e7442005-03-26 01:28:53 +0000370 --GPR_remaining;
371 } else {
Nate Begeman74d73452005-03-31 00:15:26 +0000372 MemOps.push_back(DAG.getNode(ISD::STORE, MVT::Other, Chain,
Chris Lattner022ed322005-05-15 19:54:37 +0000373 Args[i].first, PtrOff,
374 DAG.getSrcValue(NULL)));
Nate Begeman307e7442005-03-26 01:28:53 +0000375 }
376 ArgOffset += 4;
377 break;
378 case MVT::i64:
Nate Begemanf7e43382005-03-26 07:46:36 +0000379 // If we have one free GPR left, we can place the upper half of the i64
380 // in it, and store the other half to the stack. If we have two or more
381 // free GPRs, then we can pass both halves of the i64 in registers.
382 if (GPR_remaining > 0) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000383 SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, MVT::i32,
Nate Begemanf2622612005-03-26 02:17:46 +0000384 Args[i].first, DAG.getConstant(1, MVT::i32));
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000385 SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, MVT::i32,
Nate Begemanf2622612005-03-26 02:17:46 +0000386 Args[i].first, DAG.getConstant(0, MVT::i32));
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000387 args_to_use.push_back(Hi);
Nate Begeman74d73452005-03-31 00:15:26 +0000388 --GPR_remaining;
Nate Begeman74d73452005-03-31 00:15:26 +0000389 if (GPR_remaining > 0) {
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000390 args_to_use.push_back(Lo);
Nate Begeman74d73452005-03-31 00:15:26 +0000391 --GPR_remaining;
Nate Begemanf7e43382005-03-26 07:46:36 +0000392 } else {
393 SDOperand ConstFour = DAG.getConstant(4, getPointerTy());
394 PtrOff = DAG.getNode(ISD::ADD, MVT::i32, PtrOff, ConstFour);
Nate Begeman74d73452005-03-31 00:15:26 +0000395 MemOps.push_back(DAG.getNode(ISD::STORE, MVT::Other, Chain,
Andrew Lenharth2d86ea22005-04-27 20:10:01 +0000396 Lo, PtrOff, DAG.getSrcValue(NULL)));
Nate Begemanf7e43382005-03-26 07:46:36 +0000397 }
Nate Begeman307e7442005-03-26 01:28:53 +0000398 } else {
Nate Begeman74d73452005-03-31 00:15:26 +0000399 MemOps.push_back(DAG.getNode(ISD::STORE, MVT::Other, Chain,
Chris Lattner022ed322005-05-15 19:54:37 +0000400 Args[i].first, PtrOff,
401 DAG.getSrcValue(NULL)));
Nate Begeman307e7442005-03-26 01:28:53 +0000402 }
403 ArgOffset += 8;
404 break;
405 case MVT::f32:
Nate Begeman307e7442005-03-26 01:28:53 +0000406 case MVT::f64:
Nate Begemanf7e43382005-03-26 07:46:36 +0000407 if (FPR_remaining > 0) {
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000408 args_to_use.push_back(Args[i].first);
409 --FPR_remaining;
Nate Begemanf7e43382005-03-26 07:46:36 +0000410 if (isVarArg) {
Nate Begeman96fc6812005-03-31 02:05:53 +0000411 SDOperand Store = DAG.getNode(ISD::STORE, MVT::Other, Chain,
Chris Lattner022ed322005-05-15 19:54:37 +0000412 Args[i].first, PtrOff,
413 DAG.getSrcValue(NULL));
Nate Begeman96fc6812005-03-31 02:05:53 +0000414 MemOps.push_back(Store);
Nate Begeman74d73452005-03-31 00:15:26 +0000415 // Float varargs are always shadowed in available integer registers
416 if (GPR_remaining > 0) {
Chris Lattner022ed322005-05-15 19:54:37 +0000417 SDOperand Load = DAG.getLoad(MVT::i32, Store, PtrOff,
418 DAG.getSrcValue(NULL));
Nate Begeman74d73452005-03-31 00:15:26 +0000419 MemOps.push_back(Load);
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000420 args_to_use.push_back(Load);
421 --GPR_remaining;
Nate Begeman74d73452005-03-31 00:15:26 +0000422 }
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000423 if (GPR_remaining > 0 && MVT::f64 == ArgVT) {
Nate Begeman74d73452005-03-31 00:15:26 +0000424 SDOperand ConstFour = DAG.getConstant(4, getPointerTy());
425 PtrOff = DAG.getNode(ISD::ADD, MVT::i32, PtrOff, ConstFour);
Chris Lattner022ed322005-05-15 19:54:37 +0000426 SDOperand Load = DAG.getLoad(MVT::i32, Store, PtrOff,
427 DAG.getSrcValue(NULL));
Nate Begeman74d73452005-03-31 00:15:26 +0000428 MemOps.push_back(Load);
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000429 args_to_use.push_back(Load);
430 --GPR_remaining;
Nate Begeman74d73452005-03-31 00:15:26 +0000431 }
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000432 } else {
433 // If we have any FPRs remaining, we may also have GPRs remaining.
434 // Args passed in FPRs consume either 1 (f32) or 2 (f64) available
435 // GPRs.
436 if (GPR_remaining > 0) {
437 args_to_use.push_back(DAG.getNode(ISD::UNDEF, MVT::i32));
438 --GPR_remaining;
439 }
440 if (GPR_remaining > 0 && MVT::f64 == ArgVT) {
441 args_to_use.push_back(DAG.getNode(ISD::UNDEF, MVT::i32));
442 --GPR_remaining;
443 }
Nate Begeman74d73452005-03-31 00:15:26 +0000444 }
Nate Begeman307e7442005-03-26 01:28:53 +0000445 } else {
Nate Begeman74d73452005-03-31 00:15:26 +0000446 MemOps.push_back(DAG.getNode(ISD::STORE, MVT::Other, Chain,
Chris Lattner022ed322005-05-15 19:54:37 +0000447 Args[i].first, PtrOff,
448 DAG.getSrcValue(NULL)));
Nate Begeman307e7442005-03-26 01:28:53 +0000449 }
Nate Begemanf7e43382005-03-26 07:46:36 +0000450 ArgOffset += (ArgVT == MVT::f32) ? 4 : 8;
Nate Begeman307e7442005-03-26 01:28:53 +0000451 break;
452 }
Nate Begemana9795f82005-03-24 04:41:43 +0000453 }
Nate Begeman74d73452005-03-31 00:15:26 +0000454 if (!MemOps.empty())
455 Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, MemOps);
Nate Begemana9795f82005-03-24 04:41:43 +0000456 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000457
Nate Begemana9795f82005-03-24 04:41:43 +0000458 std::vector<MVT::ValueType> RetVals;
459 MVT::ValueType RetTyVT = getValueType(RetTy);
460 if (RetTyVT != MVT::isVoid)
461 RetVals.push_back(RetTyVT);
462 RetVals.push_back(MVT::Other);
463
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000464 SDOperand TheCall = SDOperand(DAG.getCall(RetVals,
Nate Begemana9795f82005-03-24 04:41:43 +0000465 Chain, Callee, args_to_use), 0);
466 Chain = TheCall.getValue(RetTyVT != MVT::isVoid);
Chris Lattner16cd04d2005-05-12 23:24:06 +0000467 Chain = DAG.getNode(ISD::CALLSEQ_END, MVT::Other, Chain,
Nate Begemana9795f82005-03-24 04:41:43 +0000468 DAG.getConstant(NumBytes, getPointerTy()));
469 return std::make_pair(TheCall, Chain);
470}
471
Chris Lattnere0fe2252005-07-05 19:58:54 +0000472SDOperand PPC32TargetLowering::LowerVAStart(SDOperand Chain, SDOperand VAListP,
473 Value *VAListV, SelectionDAG &DAG) {
Chris Lattnerf84a2ac2005-07-05 17:48:31 +0000474 // vastart just stores the address of the VarArgsFrameIndex slot into the
475 // memory location argument.
476 SDOperand FR = DAG.getFrameIndex(VarArgsFrameIndex, MVT::i32);
Chris Lattnere0fe2252005-07-05 19:58:54 +0000477 return DAG.getNode(ISD::STORE, MVT::Other, Chain, FR, VAListP,
478 DAG.getSrcValue(VAListV));
Nate Begemana9795f82005-03-24 04:41:43 +0000479}
480
Chris Lattnere0fe2252005-07-05 19:58:54 +0000481std::pair<SDOperand,SDOperand>
482PPC32TargetLowering::LowerVAArg(SDOperand Chain,
483 SDOperand VAListP, Value *VAListV,
484 const Type *ArgTy, SelectionDAG &DAG) {
Nate Begemanc7b09f12005-03-25 08:34:25 +0000485 MVT::ValueType ArgVT = getValueType(ArgTy);
Chris Lattnerf84a2ac2005-07-05 17:48:31 +0000486
487 SDOperand VAList =
Chris Lattnere0fe2252005-07-05 19:58:54 +0000488 DAG.getLoad(MVT::i32, Chain, VAListP, DAG.getSrcValue(VAListV));
489 SDOperand Result = DAG.getLoad(ArgVT, Chain, VAList, DAG.getSrcValue(NULL));
Chris Lattnerf84a2ac2005-07-05 17:48:31 +0000490 unsigned Amt;
491 if (ArgVT == MVT::i32 || ArgVT == MVT::f32)
492 Amt = 4;
493 else {
494 assert((ArgVT == MVT::i64 || ArgVT == MVT::f64) &&
495 "Other types should have been promoted for varargs!");
496 Amt = 8;
Nate Begemanc7b09f12005-03-25 08:34:25 +0000497 }
Chris Lattnerf84a2ac2005-07-05 17:48:31 +0000498 VAList = DAG.getNode(ISD::ADD, VAList.getValueType(), VAList,
499 DAG.getConstant(Amt, VAList.getValueType()));
500 Chain = DAG.getNode(ISD::STORE, MVT::Other, Chain,
Chris Lattnere0fe2252005-07-05 19:58:54 +0000501 VAList, VAListP, DAG.getSrcValue(VAListV));
Nate Begemanc7b09f12005-03-25 08:34:25 +0000502 return std::make_pair(Result, Chain);
Nate Begemana9795f82005-03-24 04:41:43 +0000503}
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000504
Nate Begemana9795f82005-03-24 04:41:43 +0000505
506std::pair<SDOperand, SDOperand> PPC32TargetLowering::
507LowerFrameReturnAddress(bool isFrameAddress, SDOperand Chain, unsigned Depth,
508 SelectionDAG &DAG) {
Nate Begeman01d05262005-03-30 01:45:43 +0000509 assert(0 && "LowerFrameReturnAddress unimplemented");
Nate Begemana9795f82005-03-24 04:41:43 +0000510 abort();
511}
512
513namespace {
Nate Begemanc7bd4822005-04-11 06:34:10 +0000514Statistic<>Recorded("ppc-codegen", "Number of recording ops emitted");
Nate Begeman93075ec2005-04-04 23:40:36 +0000515Statistic<>FusedFP("ppc-codegen", "Number of fused fp operations");
Nate Begeman2a05c8e2005-07-28 03:02:05 +0000516Statistic<>FrameOff("ppc-codegen", "Number of frame idx offsets collapsed");
Chris Lattner3c304a32005-08-05 22:05:03 +0000517
Nate Begemana9795f82005-03-24 04:41:43 +0000518//===--------------------------------------------------------------------===//
519/// ISel - PPC32 specific code to select PPC32 machine instructions for
520/// SelectionDAG operations.
521//===--------------------------------------------------------------------===//
522class ISel : public SelectionDAGISel {
Nate Begemana9795f82005-03-24 04:41:43 +0000523 PPC32TargetLowering PPC32Lowering;
Nate Begeman815d6da2005-04-06 00:25:27 +0000524 SelectionDAG *ISelDAG; // Hack to support us having a dag->dag transform
525 // for sdiv and udiv until it is put into the future
526 // dag combiner.
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000527
Nate Begemana9795f82005-03-24 04:41:43 +0000528 /// ExprMap - As shared expressions are codegen'd, we keep track of which
529 /// vreg the value is produced in, so we only emit one copy of each compiled
530 /// tree.
531 std::map<SDOperand, unsigned> ExprMap;
Nate Begemanc7b09f12005-03-25 08:34:25 +0000532
533 unsigned GlobalBaseReg;
534 bool GlobalBaseInitialized;
Nate Begemanc7bd4822005-04-11 06:34:10 +0000535 bool RecordSuccess;
Nate Begemana9795f82005-03-24 04:41:43 +0000536public:
Nate Begeman815d6da2005-04-06 00:25:27 +0000537 ISel(TargetMachine &TM) : SelectionDAGISel(PPC32Lowering), PPC32Lowering(TM),
538 ISelDAG(0) {}
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000539
Nate Begemanc7b09f12005-03-25 08:34:25 +0000540 /// runOnFunction - Override this function in order to reset our per-function
541 /// variables.
542 virtual bool runOnFunction(Function &Fn) {
543 // Make sure we re-emit a set of the global base reg if necessary
544 GlobalBaseInitialized = false;
545 return SelectionDAGISel::runOnFunction(Fn);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000546 }
547
Nate Begemana9795f82005-03-24 04:41:43 +0000548 /// InstructionSelectBasicBlock - This callback is invoked by
549 /// SelectionDAGISel when it has created a SelectionDAG for us to codegen.
550 virtual void InstructionSelectBasicBlock(SelectionDAG &DAG) {
551 DEBUG(BB->dump());
552 // Codegen the basic block.
Nate Begeman815d6da2005-04-06 00:25:27 +0000553 ISelDAG = &DAG;
Nate Begemana9795f82005-03-24 04:41:43 +0000554 Select(DAG.getRoot());
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000555
Nate Begemana9795f82005-03-24 04:41:43 +0000556 // Clear state used for selection.
557 ExprMap.clear();
Nate Begeman815d6da2005-04-06 00:25:27 +0000558 ISelDAG = 0;
Nate Begemana9795f82005-03-24 04:41:43 +0000559 }
Nate Begeman815d6da2005-04-06 00:25:27 +0000560
561 // dag -> dag expanders for integer divide by constant
562 SDOperand BuildSDIVSequence(SDOperand N);
563 SDOperand BuildUDIVSequence(SDOperand N);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000564
Nate Begemandffcfcc2005-04-01 00:32:34 +0000565 unsigned getGlobalBaseReg();
Nate Begeman6b559972005-04-01 02:59:27 +0000566 unsigned getConstDouble(double floatVal, unsigned Result);
Nate Begeman1cbf3ab2005-04-18 07:48:09 +0000567 void MoveCRtoGPR(unsigned CCReg, bool Inv, unsigned Idx, unsigned Result);
Nate Begeman7ddecb42005-04-06 23:51:40 +0000568 bool SelectBitfieldInsert(SDOperand OR, unsigned Result);
Nate Begeman3664cef2005-04-13 22:14:14 +0000569 unsigned FoldIfWideZeroExtend(SDOperand N);
Nate Begeman1cbf3ab2005-04-18 07:48:09 +0000570 unsigned SelectCC(SDOperand CC, unsigned &Opc, bool &Inv, unsigned &Idx);
571 unsigned SelectCCExpr(SDOperand N, unsigned& Opc, bool &Inv, unsigned &Idx);
Nate Begemanc7bd4822005-04-11 06:34:10 +0000572 unsigned SelectExpr(SDOperand N, bool Recording=false);
Nate Begemana9795f82005-03-24 04:41:43 +0000573 void Select(SDOperand N);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000574
Nate Begeman2a05c8e2005-07-28 03:02:05 +0000575 unsigned SelectAddr(SDOperand N, unsigned& Reg, int& offset);
Nate Begemana9795f82005-03-24 04:41:43 +0000576 void SelectBranchCC(SDOperand N);
Chris Lattner3f270132005-08-02 19:07:49 +0000577
578 virtual const char *getPassName() const {
579 return "PowerPC Pattern Instruction Selection";
580 }
Nate Begemana9795f82005-03-24 04:41:43 +0000581};
582
Chris Lattner02efa6c2005-08-08 21:08:09 +0000583// isRunOfOnes - Returns true iff Val consists of one contiguous run of 1s with
584// any number of 0s on either side. The 1s are allowed to wrap from LSB to
585// MSB, so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is
586// not, since all 1s are not contiguous.
587static bool isRunOfOnes(unsigned Val, unsigned &MB, unsigned &ME) {
588 if (isShiftedMask_32(Val)) {
589 // look for the first non-zero bit
590 MB = CountLeadingZeros_32(Val);
591 // look for the first zero bit after the run of ones
592 ME = CountLeadingZeros_32((Val - 1) ^ Val);
593 return true;
594 } else if (isShiftedMask_32(Val = ~Val)) { // invert mask
595 // effectively look for the first zero bit
596 ME = CountLeadingZeros_32(Val) - 1;
597 // effectively look for the first one bit after the run of zeros
598 MB = CountLeadingZeros_32((Val - 1) ^ Val) + 1;
599 return true;
600 }
601 // no run present
602 return false;
603}
604
Chris Lattnercf1cf182005-08-08 21:10:27 +0000605// isRotateAndMask - Returns true if Mask and Shift can be folded in to a rotate
606// and mask opcode and mask operation.
607static bool isRotateAndMask(unsigned Opcode, unsigned Shift, unsigned Mask,
608 bool IsShiftMask,
609 unsigned &SH, unsigned &MB, unsigned &ME) {
610 if (Shift > 31) return false;
611 unsigned Indeterminant = ~0; // bit mask marking indeterminant results
612
613 if (Opcode == ISD::SHL) { // shift left
614 // apply shift to mask if it comes first
615 if (IsShiftMask) Mask = Mask << Shift;
616 // determine which bits are made indeterminant by shift
617 Indeterminant = ~(0xFFFFFFFFu << Shift);
618 } else if (Opcode == ISD::SRA || Opcode == ISD::SRL) { // shift rights
619 // apply shift to mask if it comes first
620 if (IsShiftMask) Mask = Mask >> Shift;
621 // determine which bits are made indeterminant by shift
622 Indeterminant = ~(0xFFFFFFFFu >> Shift);
623 // adjust for the left rotate
624 Shift = 32 - Shift;
625 }
626
627 // if the mask doesn't intersect any Indeterminant bits
628 if (!(Mask & Indeterminant)) {
629 SH = Shift;
630 // make sure the mask is still a mask (wrap arounds may not be)
631 return isRunOfOnes(Mask, MB, ME);
632 }
633
634 // can't do it
635 return false;
636}
637
638// isImmediate - This method tests to see if a constant operand.
639// If so Imm will receive the 32 bit value.
640static bool isImmediate(SDOperand N, unsigned& Imm) {
641 // test for constant
642 if (N.getOpcode() == ISD::Constant) {
643 // retrieve value
644 Imm = (unsigned)cast<ConstantSDNode>(N)->getSignExtended();
645 // passes muster
646 return true;
647 }
648 // not a constant
649 return false;
650}
651
652// isOprShiftImm - Returns true if the specified operand is a shift opcode with
653// a immediate shift count less than 32.
654static bool isOprShiftImm(SDOperand N, unsigned& Opc, unsigned& SH) {
655 Opc = N.getOpcode();
656 return (Opc == ISD::SHL || Opc == ISD::SRL || Opc == ISD::SRA) &&
657 isImmediate(N.getOperand(1), SH) && SH < 32;
658}
659
660// isOprNot - Returns true if the specified operand is an xor with immediate -1.
661static bool isOprNot(SDOperand N) {
662 unsigned Imm;
663 return N.getOpcode() == ISD::XOR &&
664 isImmediate(N.getOperand(1), Imm) && (signed)Imm == -1;
665}
666
667// Immediate constant composers.
668// Lo16 - grabs the lo 16 bits from a 32 bit constant.
669// Hi16 - grabs the hi 16 bits from a 32 bit constant.
670// HA16 - computes the hi bits required if the lo bits are add/subtracted in
671// arithmethically.
672static unsigned Lo16(unsigned x) { return x & 0x0000FFFF; }
673static unsigned Hi16(unsigned x) { return Lo16(x >> 16); }
674static unsigned HA16(unsigned x) { return Hi16((signed)x - (signed short)x); }
675
Nate Begeman439b4442005-04-05 04:22:58 +0000676/// getImmediateForOpcode - This method returns a value indicating whether
Nate Begemana9795f82005-03-24 04:41:43 +0000677/// the ConstantSDNode N can be used as an immediate to Opcode. The return
678/// values are either 0, 1 or 2. 0 indicates that either N is not a
Nate Begeman9f833d32005-04-12 00:10:02 +0000679/// ConstantSDNode, or is not suitable for use by that opcode.
680/// Return value codes for turning into an enum someday:
681/// 1: constant may be used in normal immediate form.
682/// 2: constant may be used in shifted immediate form.
683/// 3: log base 2 of the constant may be used.
684/// 4: constant is suitable for integer division conversion
685/// 5: constant is a bitfield mask
Nate Begemana9795f82005-03-24 04:41:43 +0000686///
Nate Begeman439b4442005-04-05 04:22:58 +0000687static unsigned getImmediateForOpcode(SDOperand N, unsigned Opcode,
688 unsigned& Imm, bool U = false) {
Nate Begemana9795f82005-03-24 04:41:43 +0000689 if (N.getOpcode() != ISD::Constant) return 0;
690
691 int v = (int)cast<ConstantSDNode>(N)->getSignExtended();
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000692
Nate Begemana9795f82005-03-24 04:41:43 +0000693 switch(Opcode) {
694 default: return 0;
695 case ISD::ADD:
Chris Lattner0561b3f2005-08-02 19:26:06 +0000696 if (isInt16(v)) { Imm = v & 0xFFFF; return 1; }
Nate Begemana9795f82005-03-24 04:41:43 +0000697 if ((v & 0x0000FFFF) == 0) { Imm = v >> 16; return 2; }
698 break;
Nate Begeman9f833d32005-04-12 00:10:02 +0000699 case ISD::AND: {
700 unsigned MB, ME;
Chris Lattner02efa6c2005-08-08 21:08:09 +0000701 if (isRunOfOnes(v, MB, ME)) { Imm = MB << 16 | ME & 0xFFFF; return 5; }
Chris Lattner0561b3f2005-08-02 19:26:06 +0000702 if (isUInt16(v)) { Imm = v & 0xFFFF; return 1; }
Nate Begeman9f833d32005-04-12 00:10:02 +0000703 if ((v & 0x0000FFFF) == 0) { Imm = v >> 16; return 2; }
704 break;
705 }
Nate Begemana9795f82005-03-24 04:41:43 +0000706 case ISD::XOR:
707 case ISD::OR:
Chris Lattner0561b3f2005-08-02 19:26:06 +0000708 if (isUInt16(v)) { Imm = v & 0xFFFF; return 1; }
Nate Begemana9795f82005-03-24 04:41:43 +0000709 if ((v & 0x0000FFFF) == 0) { Imm = v >> 16; return 2; }
710 break;
Nate Begeman307e7442005-03-26 01:28:53 +0000711 case ISD::MUL:
Chris Lattner0561b3f2005-08-02 19:26:06 +0000712 if (isInt16(v)) { Imm = v & 0xFFFF; return 1; }
Nate Begeman307e7442005-03-26 01:28:53 +0000713 break;
Nate Begemand7c4a4a2005-05-11 23:43:56 +0000714 case ISD::SUB:
715 // handle subtract-from separately from subtract, since subi is really addi
Chris Lattner0561b3f2005-08-02 19:26:06 +0000716 if (U && isInt16(v)) { Imm = v & 0xFFFF; return 1; }
717 if (!U && isInt16(-v)) { Imm = (-v) & 0xFFFF; return 1; }
Nate Begemand7c4a4a2005-05-11 23:43:56 +0000718 break;
Nate Begeman3e897162005-03-31 23:55:40 +0000719 case ISD::SETCC:
Chris Lattner0561b3f2005-08-02 19:26:06 +0000720 if (U && isUInt16(v)) { Imm = v & 0xFFFF; return 1; }
721 if (!U && isInt16(v)) { Imm = v & 0xFFFF; return 1; }
Nate Begeman3e897162005-03-31 23:55:40 +0000722 break;
Nate Begeman80196b12005-04-05 00:15:08 +0000723 case ISD::SDIV:
Chris Lattner0561b3f2005-08-02 19:26:06 +0000724 if (isPowerOf2_32(v)) { Imm = Log2_32(v); return 3; }
725 if (isPowerOf2_32(-v)) { Imm = Log2_32(-v); return 3; }
Nate Begeman815d6da2005-04-06 00:25:27 +0000726 if (v <= -2 || v >= 2) { return 4; }
727 break;
728 case ISD::UDIV:
Nate Begeman27b4c232005-04-06 06:44:57 +0000729 if (v > 1) { return 4; }
Nate Begeman80196b12005-04-05 00:15:08 +0000730 break;
Nate Begemana9795f82005-03-24 04:41:43 +0000731 }
732 return 0;
733}
Nate Begeman3e897162005-03-31 23:55:40 +0000734
Nate Begemanc7bd4822005-04-11 06:34:10 +0000735/// NodeHasRecordingVariant - If SelectExpr can always produce code for
736/// NodeOpcode that also sets CR0 as a side effect, return true. Otherwise,
737/// return false.
738static bool NodeHasRecordingVariant(unsigned NodeOpcode) {
739 switch(NodeOpcode) {
740 default: return false;
741 case ISD::AND:
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000742 case ISD::OR:
Chris Lattner519f40b2005-04-13 02:46:17 +0000743 return true;
Nate Begemanc7bd4822005-04-11 06:34:10 +0000744 }
745}
746
Nate Begeman3e897162005-03-31 23:55:40 +0000747/// getBCCForSetCC - Returns the PowerPC condition branch mnemonic corresponding
748/// to Condition. If the Condition is unordered or unsigned, the bool argument
749/// U is set to true, otherwise it is set to false.
750static unsigned getBCCForSetCC(unsigned Condition, bool& U) {
751 U = false;
752 switch (Condition) {
753 default: assert(0 && "Unknown condition!"); abort();
754 case ISD::SETEQ: return PPC::BEQ;
755 case ISD::SETNE: return PPC::BNE;
756 case ISD::SETULT: U = true;
757 case ISD::SETLT: return PPC::BLT;
758 case ISD::SETULE: U = true;
759 case ISD::SETLE: return PPC::BLE;
760 case ISD::SETUGT: U = true;
761 case ISD::SETGT: return PPC::BGT;
762 case ISD::SETUGE: U = true;
763 case ISD::SETGE: return PPC::BGE;
764 }
Nate Begeman04730362005-04-01 04:45:11 +0000765 return 0;
766}
767
Nate Begeman7bfba7d2005-04-14 09:45:08 +0000768/// getCROpForOp - Return the condition register opcode (or inverted opcode)
769/// associated with the SelectionDAG opcode.
770static unsigned getCROpForSetCC(unsigned Opcode, bool Inv1, bool Inv2) {
771 switch (Opcode) {
772 default: assert(0 && "Unknown opcode!"); abort();
773 case ISD::AND:
774 if (Inv1 && Inv2) return PPC::CRNOR; // De Morgan's Law
775 if (!Inv1 && !Inv2) return PPC::CRAND;
776 if (Inv1 ^ Inv2) return PPC::CRANDC;
777 case ISD::OR:
778 if (Inv1 && Inv2) return PPC::CRNAND; // De Morgan's Law
779 if (!Inv1 && !Inv2) return PPC::CROR;
780 if (Inv1 ^ Inv2) return PPC::CRORC;
781 }
782 return 0;
783}
784
785/// getCRIdxForSetCC - Return the index of the condition register field
786/// associated with the SetCC condition, and whether or not the field is
787/// treated as inverted. That is, lt = 0; ge = 0 inverted.
788static unsigned getCRIdxForSetCC(unsigned Condition, bool& Inv) {
789 switch (Condition) {
790 default: assert(0 && "Unknown condition!"); abort();
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000791 case ISD::SETULT:
Nate Begeman7bfba7d2005-04-14 09:45:08 +0000792 case ISD::SETLT: Inv = false; return 0;
793 case ISD::SETUGE:
794 case ISD::SETGE: Inv = true; return 0;
795 case ISD::SETUGT:
796 case ISD::SETGT: Inv = false; return 1;
797 case ISD::SETULE:
798 case ISD::SETLE: Inv = true; return 1;
799 case ISD::SETEQ: Inv = false; return 2;
800 case ISD::SETNE: Inv = true; return 2;
801 }
802 return 0;
803}
804
Nate Begeman04730362005-04-01 04:45:11 +0000805/// IndexedOpForOp - Return the indexed variant for each of the PowerPC load
806/// and store immediate instructions.
807static unsigned IndexedOpForOp(unsigned Opcode) {
808 switch(Opcode) {
809 default: assert(0 && "Unknown opcode!"); abort();
810 case PPC::LBZ: return PPC::LBZX; case PPC::STB: return PPC::STBX;
811 case PPC::LHZ: return PPC::LHZX; case PPC::STH: return PPC::STHX;
812 case PPC::LHA: return PPC::LHAX; case PPC::STW: return PPC::STWX;
813 case PPC::LWZ: return PPC::LWZX; case PPC::STFS: return PPC::STFSX;
814 case PPC::LFS: return PPC::LFSX; case PPC::STFD: return PPC::STFDX;
815 case PPC::LFD: return PPC::LFDX;
816 }
817 return 0;
Nate Begeman3e897162005-03-31 23:55:40 +0000818}
Nate Begeman815d6da2005-04-06 00:25:27 +0000819
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000820// Structure used to return the necessary information to codegen an SDIV as
Nate Begeman815d6da2005-04-06 00:25:27 +0000821// a multiply.
822struct ms {
823 int m; // magic number
824 int s; // shift amount
825};
826
827struct mu {
828 unsigned int m; // magic number
829 int a; // add indicator
830 int s; // shift amount
831};
832
833/// magic - calculate the magic numbers required to codegen an integer sdiv as
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000834/// a sequence of multiply and shifts. Requires that the divisor not be 0, 1,
Nate Begeman815d6da2005-04-06 00:25:27 +0000835/// or -1.
836static struct ms magic(int d) {
837 int p;
838 unsigned int ad, anc, delta, q1, r1, q2, r2, t;
Chris Lattner0561b3f2005-08-02 19:26:06 +0000839 const unsigned int two31 = 0x80000000U;
Nate Begeman815d6da2005-04-06 00:25:27 +0000840 struct ms mag;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000841
Nate Begeman815d6da2005-04-06 00:25:27 +0000842 ad = abs(d);
843 t = two31 + ((unsigned int)d >> 31);
844 anc = t - 1 - t%ad; // absolute value of nc
845 p = 31; // initialize p
846 q1 = two31/anc; // initialize q1 = 2p/abs(nc)
847 r1 = two31 - q1*anc; // initialize r1 = rem(2p,abs(nc))
848 q2 = two31/ad; // initialize q2 = 2p/abs(d)
849 r2 = two31 - q2*ad; // initialize r2 = rem(2p,abs(d))
850 do {
851 p = p + 1;
852 q1 = 2*q1; // update q1 = 2p/abs(nc)
853 r1 = 2*r1; // update r1 = rem(2p/abs(nc))
854 if (r1 >= anc) { // must be unsigned comparison
855 q1 = q1 + 1;
856 r1 = r1 - anc;
857 }
858 q2 = 2*q2; // update q2 = 2p/abs(d)
859 r2 = 2*r2; // update r2 = rem(2p/abs(d))
860 if (r2 >= ad) { // must be unsigned comparison
861 q2 = q2 + 1;
862 r2 = r2 - ad;
863 }
864 delta = ad - r2;
865 } while (q1 < delta || (q1 == delta && r1 == 0));
866
867 mag.m = q2 + 1;
868 if (d < 0) mag.m = -mag.m; // resulting magic number
869 mag.s = p - 32; // resulting shift
870 return mag;
871}
872
873/// magicu - calculate the magic numbers required to codegen an integer udiv as
874/// a sequence of multiply, add and shifts. Requires that the divisor not be 0.
875static struct mu magicu(unsigned d)
876{
877 int p;
878 unsigned int nc, delta, q1, r1, q2, r2;
879 struct mu magu;
880 magu.a = 0; // initialize "add" indicator
881 nc = - 1 - (-d)%d;
882 p = 31; // initialize p
883 q1 = 0x80000000/nc; // initialize q1 = 2p/nc
884 r1 = 0x80000000 - q1*nc; // initialize r1 = rem(2p,nc)
885 q2 = 0x7FFFFFFF/d; // initialize q2 = (2p-1)/d
886 r2 = 0x7FFFFFFF - q2*d; // initialize r2 = rem((2p-1),d)
887 do {
888 p = p + 1;
889 if (r1 >= nc - r1 ) {
890 q1 = 2*q1 + 1; // update q1
891 r1 = 2*r1 - nc; // update r1
892 }
893 else {
894 q1 = 2*q1; // update q1
895 r1 = 2*r1; // update r1
896 }
897 if (r2 + 1 >= d - r2) {
898 if (q2 >= 0x7FFFFFFF) magu.a = 1;
899 q2 = 2*q2 + 1; // update q2
900 r2 = 2*r2 + 1 - d; // update r2
901 }
902 else {
903 if (q2 >= 0x80000000) magu.a = 1;
904 q2 = 2*q2; // update q2
905 r2 = 2*r2 + 1; // update r2
906 }
907 delta = d - 1 - r2;
908 } while (p < 64 && (q1 < delta || (q1 == delta && r1 == 0)));
909 magu.m = q2 + 1; // resulting magic number
910 magu.s = p - 32; // resulting shift
911 return magu;
912}
913}
914
915/// BuildSDIVSequence - Given an ISD::SDIV node expressing a divide by constant,
916/// return a DAG expression to select that will generate the same value by
917/// multiplying by a magic number. See:
918/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
919SDOperand ISel::BuildSDIVSequence(SDOperand N) {
920 int d = (int)cast<ConstantSDNode>(N.getOperand(1))->getSignExtended();
921 ms magics = magic(d);
922 // Multiply the numerator (operand 0) by the magic value
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000923 SDOperand Q = ISelDAG->getNode(ISD::MULHS, MVT::i32, N.getOperand(0),
Nate Begeman815d6da2005-04-06 00:25:27 +0000924 ISelDAG->getConstant(magics.m, MVT::i32));
925 // If d > 0 and m < 0, add the numerator
926 if (d > 0 && magics.m < 0)
927 Q = ISelDAG->getNode(ISD::ADD, MVT::i32, Q, N.getOperand(0));
928 // If d < 0 and m > 0, subtract the numerator.
929 if (d < 0 && magics.m > 0)
930 Q = ISelDAG->getNode(ISD::SUB, MVT::i32, Q, N.getOperand(0));
931 // Shift right algebraic if shift value is nonzero
932 if (magics.s > 0)
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000933 Q = ISelDAG->getNode(ISD::SRA, MVT::i32, Q,
Nate Begeman815d6da2005-04-06 00:25:27 +0000934 ISelDAG->getConstant(magics.s, MVT::i32));
935 // Extract the sign bit and add it to the quotient
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000936 SDOperand T =
Nate Begeman815d6da2005-04-06 00:25:27 +0000937 ISelDAG->getNode(ISD::SRL, MVT::i32, Q, ISelDAG->getConstant(31, MVT::i32));
Nate Begeman27b4c232005-04-06 06:44:57 +0000938 return ISelDAG->getNode(ISD::ADD, MVT::i32, Q, T);
Nate Begeman815d6da2005-04-06 00:25:27 +0000939}
940
941/// BuildUDIVSequence - Given an ISD::UDIV node expressing a divide by constant,
942/// return a DAG expression to select that will generate the same value by
943/// multiplying by a magic number. See:
944/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
945SDOperand ISel::BuildUDIVSequence(SDOperand N) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000946 unsigned d =
Nate Begeman815d6da2005-04-06 00:25:27 +0000947 (unsigned)cast<ConstantSDNode>(N.getOperand(1))->getSignExtended();
948 mu magics = magicu(d);
949 // Multiply the numerator (operand 0) by the magic value
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000950 SDOperand Q = ISelDAG->getNode(ISD::MULHU, MVT::i32, N.getOperand(0),
Nate Begeman815d6da2005-04-06 00:25:27 +0000951 ISelDAG->getConstant(magics.m, MVT::i32));
952 if (magics.a == 0) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000953 Q = ISelDAG->getNode(ISD::SRL, MVT::i32, Q,
Nate Begeman815d6da2005-04-06 00:25:27 +0000954 ISelDAG->getConstant(magics.s, MVT::i32));
955 } else {
956 SDOperand NPQ = ISelDAG->getNode(ISD::SUB, MVT::i32, N.getOperand(0), Q);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000957 NPQ = ISelDAG->getNode(ISD::SRL, MVT::i32, NPQ,
Nate Begeman815d6da2005-04-06 00:25:27 +0000958 ISelDAG->getConstant(1, MVT::i32));
959 NPQ = ISelDAG->getNode(ISD::ADD, MVT::i32, NPQ, Q);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000960 Q = ISelDAG->getNode(ISD::SRL, MVT::i32, NPQ,
Nate Begeman815d6da2005-04-06 00:25:27 +0000961 ISelDAG->getConstant(magics.s-1, MVT::i32));
962 }
Nate Begeman27b4c232005-04-06 06:44:57 +0000963 return Q;
Nate Begemana9795f82005-03-24 04:41:43 +0000964}
965
Nate Begemanc7b09f12005-03-25 08:34:25 +0000966/// getGlobalBaseReg - Output the instructions required to put the
967/// base address to use for accessing globals into a register.
968///
969unsigned ISel::getGlobalBaseReg() {
970 if (!GlobalBaseInitialized) {
971 // Insert the set of GlobalBaseReg into the first MBB of the function
972 MachineBasicBlock &FirstMBB = BB->getParent()->front();
973 MachineBasicBlock::iterator MBBI = FirstMBB.begin();
974 GlobalBaseReg = MakeReg(MVT::i32);
975 BuildMI(FirstMBB, MBBI, PPC::MovePCtoLR, 0, PPC::LR);
976 BuildMI(FirstMBB, MBBI, PPC::MFLR, 1, GlobalBaseReg).addReg(PPC::LR);
977 GlobalBaseInitialized = true;
978 }
979 return GlobalBaseReg;
980}
981
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000982/// getConstDouble - Loads a floating point value into a register, via the
Nate Begeman6b559972005-04-01 02:59:27 +0000983/// Constant Pool. Optionally takes a register in which to load the value.
984unsigned ISel::getConstDouble(double doubleVal, unsigned Result=0) {
985 unsigned Tmp1 = MakeReg(MVT::i32);
986 if (0 == Result) Result = MakeReg(MVT::f64);
987 MachineConstantPool *CP = BB->getParent()->getConstantPool();
988 ConstantFP *CFP = ConstantFP::get(Type::DoubleTy, doubleVal);
989 unsigned CPI = CP->getConstantPoolIndex(CFP);
Nate Begeman2497e632005-07-21 20:44:43 +0000990 if (PICEnabled)
991 BuildMI(BB, PPC::ADDIS, 2, Tmp1).addReg(getGlobalBaseReg())
992 .addConstantPoolIndex(CPI);
993 else
994 BuildMI(BB, PPC::LIS, 1, Tmp1).addConstantPoolIndex(CPI);
Nate Begeman6b559972005-04-01 02:59:27 +0000995 BuildMI(BB, PPC::LFD, 2, Result).addConstantPoolIndex(CPI).addReg(Tmp1);
996 return Result;
997}
998
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000999/// MoveCRtoGPR - Move CCReg[Idx] to the least significant bit of Result. If
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001000/// Inv is true, then invert the result.
1001void ISel::MoveCRtoGPR(unsigned CCReg, bool Inv, unsigned Idx, unsigned Result){
1002 unsigned IntCR = MakeReg(MVT::i32);
1003 BuildMI(BB, PPC::MCRF, 1, PPC::CR7).addReg(CCReg);
Chris Lattner3c304a32005-08-05 22:05:03 +00001004 bool GPOpt =
1005 TLI.getTargetMachine().getSubtarget<PPCSubtarget>().isGigaProcessor();
1006 BuildMI(BB, GPOpt ? PPC::MFOCRF : PPC::MFCR, 1, IntCR).addReg(PPC::CR7);
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001007 if (Inv) {
1008 unsigned Tmp1 = MakeReg(MVT::i32);
1009 BuildMI(BB, PPC::RLWINM, 4, Tmp1).addReg(IntCR).addImm(32-(3-Idx))
1010 .addImm(31).addImm(31);
1011 BuildMI(BB, PPC::XORI, 2, Result).addReg(Tmp1).addImm(1);
1012 } else {
1013 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(IntCR).addImm(32-(3-Idx))
1014 .addImm(31).addImm(31);
1015 }
1016}
1017
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001018/// SelectBitfieldInsert - turn an or of two masked values into
Nate Begeman7ddecb42005-04-06 23:51:40 +00001019/// the rotate left word immediate then mask insert (rlwimi) instruction.
1020/// Returns true on success, false if the caller still needs to select OR.
1021///
1022/// Patterns matched:
1023/// 1. or shl, and 5. or and, and
1024/// 2. or and, shl 6. or shl, shr
1025/// 3. or shr, and 7. or shr, shl
1026/// 4. or and, shr
1027bool ISel::SelectBitfieldInsert(SDOperand OR, unsigned Result) {
Nate Begemancd08e4c2005-04-09 20:09:12 +00001028 bool IsRotate = false;
Nate Begeman7ddecb42005-04-06 23:51:40 +00001029 unsigned TgtMask = 0xFFFFFFFF, InsMask = 0xFFFFFFFF, Amount = 0;
Jeff Cohen00b168892005-07-27 06:12:32 +00001030
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001031 SDOperand Op0 = OR.getOperand(0);
1032 SDOperand Op1 = OR.getOperand(1);
1033
1034 unsigned Op0Opc = Op0.getOpcode();
1035 unsigned Op1Opc = Op1.getOpcode();
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001036
Nate Begeman7ddecb42005-04-06 23:51:40 +00001037 // Verify that we have the correct opcodes
1038 if (ISD::SHL != Op0Opc && ISD::SRL != Op0Opc && ISD::AND != Op0Opc)
1039 return false;
1040 if (ISD::SHL != Op1Opc && ISD::SRL != Op1Opc && ISD::AND != Op1Opc)
1041 return false;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001042
Nate Begeman7ddecb42005-04-06 23:51:40 +00001043 // Generate Mask value for Target
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001044 if (ConstantSDNode *CN =
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001045 dyn_cast<ConstantSDNode>(Op0.getOperand(1).Val)) {
Nate Begeman7ddecb42005-04-06 23:51:40 +00001046 switch(Op0Opc) {
1047 case ISD::SHL: TgtMask <<= (unsigned)CN->getValue(); break;
1048 case ISD::SRL: TgtMask >>= (unsigned)CN->getValue(); break;
1049 case ISD::AND: TgtMask &= (unsigned)CN->getValue(); break;
1050 }
1051 } else {
1052 return false;
1053 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001054
Nate Begeman7ddecb42005-04-06 23:51:40 +00001055 // Generate Mask value for Insert
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001056 if (ConstantSDNode *CN =
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001057 dyn_cast<ConstantSDNode>(Op1.getOperand(1).Val)) {
Nate Begeman7ddecb42005-04-06 23:51:40 +00001058 switch(Op1Opc) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001059 case ISD::SHL:
1060 Amount = CN->getValue();
Nate Begemancd08e4c2005-04-09 20:09:12 +00001061 InsMask <<= Amount;
1062 if (Op0Opc == ISD::SRL) IsRotate = true;
Nate Begeman7ddecb42005-04-06 23:51:40 +00001063 break;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001064 case ISD::SRL:
1065 Amount = CN->getValue();
1066 InsMask >>= Amount;
Nate Begeman7ddecb42005-04-06 23:51:40 +00001067 Amount = 32-Amount;
Nate Begemancd08e4c2005-04-09 20:09:12 +00001068 if (Op0Opc == ISD::SHL) IsRotate = true;
Nate Begeman7ddecb42005-04-06 23:51:40 +00001069 break;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001070 case ISD::AND:
Nate Begeman7ddecb42005-04-06 23:51:40 +00001071 InsMask &= (unsigned)CN->getValue();
1072 break;
1073 }
1074 } else {
1075 return false;
1076 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001077
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001078 unsigned Tmp3 = 0;
1079
1080 // If both of the inputs are ANDs and one of them has a logical shift by
1081 // constant as its input, make that the inserted value so that we can combine
1082 // the shift into the rotate part of the rlwimi instruction
1083 if (Op0Opc == ISD::AND && Op1Opc == ISD::AND) {
Jeff Cohen00b168892005-07-27 06:12:32 +00001084 if (Op1.getOperand(0).getOpcode() == ISD::SHL ||
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001085 Op1.getOperand(0).getOpcode() == ISD::SRL) {
Jeff Cohen00b168892005-07-27 06:12:32 +00001086 if (ConstantSDNode *CN =
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001087 dyn_cast<ConstantSDNode>(Op1.getOperand(0).getOperand(1).Val)) {
Jeff Cohen00b168892005-07-27 06:12:32 +00001088 Amount = Op1.getOperand(0).getOpcode() == ISD::SHL ?
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001089 CN->getValue() : 32 - CN->getValue();
1090 Tmp3 = SelectExpr(Op1.getOperand(0).getOperand(0));
1091 }
1092 } else if (Op0.getOperand(0).getOpcode() == ISD::SHL ||
1093 Op0.getOperand(0).getOpcode() == ISD::SRL) {
Jeff Cohen00b168892005-07-27 06:12:32 +00001094 if (ConstantSDNode *CN =
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001095 dyn_cast<ConstantSDNode>(Op0.getOperand(0).getOperand(1).Val)) {
1096 std::swap(Op0, Op1);
1097 std::swap(TgtMask, InsMask);
Jeff Cohen00b168892005-07-27 06:12:32 +00001098 Amount = Op1.getOperand(0).getOpcode() == ISD::SHL ?
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001099 CN->getValue() : 32 - CN->getValue();
1100 Tmp3 = SelectExpr(Op1.getOperand(0).getOperand(0));
1101 }
1102 }
1103 }
1104
Nate Begeman7ddecb42005-04-06 23:51:40 +00001105 // Verify that the Target mask and Insert mask together form a full word mask
1106 // and that the Insert mask is a run of set bits (which implies both are runs
1107 // of set bits). Given that, Select the arguments and generate the rlwimi
1108 // instruction.
1109 unsigned MB, ME;
Chris Lattner02efa6c2005-08-08 21:08:09 +00001110 if (((TgtMask & InsMask) == 0) && isRunOfOnes(InsMask, MB, ME)) {
Nate Begeman7ddecb42005-04-06 23:51:40 +00001111 unsigned Tmp1, Tmp2;
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001112 bool fullMask = (TgtMask ^ InsMask) == 0xFFFFFFFF;
Nate Begemancd08e4c2005-04-09 20:09:12 +00001113 // Check for rotlwi / rotrwi here, a special case of bitfield insert
1114 // where both bitfield halves are sourced from the same value.
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001115 if (IsRotate && fullMask &&
Nate Begemancd08e4c2005-04-09 20:09:12 +00001116 OR.getOperand(0).getOperand(0) == OR.getOperand(1).getOperand(0)) {
Nate Begemancd08e4c2005-04-09 20:09:12 +00001117 Tmp1 = SelectExpr(OR.getOperand(0).getOperand(0));
1118 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp1).addImm(Amount)
1119 .addImm(0).addImm(31);
1120 return true;
1121 }
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001122 if (Op0Opc == ISD::AND && fullMask)
1123 Tmp1 = SelectExpr(Op0.getOperand(0));
Nate Begeman7ddecb42005-04-06 23:51:40 +00001124 else
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001125 Tmp1 = SelectExpr(Op0);
1126 Tmp2 = Tmp3 ? Tmp3 : SelectExpr(Op1.getOperand(0));
Nate Begeman7ddecb42005-04-06 23:51:40 +00001127 BuildMI(BB, PPC::RLWIMI, 5, Result).addReg(Tmp1).addReg(Tmp2)
1128 .addImm(Amount).addImm(MB).addImm(ME);
1129 return true;
1130 }
1131 return false;
1132}
1133
Nate Begeman3664cef2005-04-13 22:14:14 +00001134/// FoldIfWideZeroExtend - 32 bit PowerPC implicit masks shift amounts to the
1135/// low six bits. If the shift amount is an ISD::AND node with a mask that is
1136/// wider than the implicit mask, then we can get rid of the AND and let the
1137/// shift do the mask.
1138unsigned ISel::FoldIfWideZeroExtend(SDOperand N) {
1139 unsigned C;
1140 if (N.getOpcode() == ISD::AND &&
1141 5 == getImmediateForOpcode(N.getOperand(1), ISD::AND, C) && // isMask
1142 31 == (C & 0xFFFF) && // ME
1143 26 >= (C >> 16)) // MB
1144 return SelectExpr(N.getOperand(0));
1145 else
1146 return SelectExpr(N);
1147}
1148
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001149unsigned ISel::SelectCC(SDOperand CC, unsigned& Opc, bool &Inv, unsigned& Idx) {
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001150 unsigned Result, Tmp1, Tmp2;
Nate Begeman9765c252005-04-12 21:22:28 +00001151 bool AlreadySelected = false;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001152 static const unsigned CompareOpcodes[] =
Nate Begemandffcfcc2005-04-01 00:32:34 +00001153 { PPC::FCMPU, PPC::FCMPU, PPC::CMPW, PPC::CMPLW };
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001154
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001155 // Allocate a condition register for this expression
1156 Result = RegMap->createVirtualRegister(PPC32::CRRCRegisterClass);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001157
Nate Begemandffcfcc2005-04-01 00:32:34 +00001158 // If the first operand to the select is a SETCC node, then we can fold it
1159 // into the branch that selects which value to return.
Nate Begeman16ac7092005-04-18 02:43:24 +00001160 if (SetCCSDNode* SetCC = dyn_cast<SetCCSDNode>(CC.Val)) {
Nate Begemandffcfcc2005-04-01 00:32:34 +00001161 bool U;
1162 Opc = getBCCForSetCC(SetCC->getCondition(), U);
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001163 Idx = getCRIdxForSetCC(SetCC->getCondition(), Inv);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001164
Nate Begeman439b4442005-04-05 04:22:58 +00001165 // Pass the optional argument U to getImmediateForOpcode for SETCC,
Nate Begemandffcfcc2005-04-01 00:32:34 +00001166 // so that it knows whether the SETCC immediate range is signed or not.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001167 if (1 == getImmediateForOpcode(SetCC->getOperand(1), ISD::SETCC,
Nate Begeman439b4442005-04-05 04:22:58 +00001168 Tmp2, U)) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001169 // For comparisons against zero, we can implicity set CR0 if a recording
Nate Begemanc7bd4822005-04-11 06:34:10 +00001170 // variant (e.g. 'or.' instead of 'or') of the instruction that defines
1171 // operand zero of the SetCC node is available.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001172 if (0 == Tmp2 &&
Nate Begeman9765c252005-04-12 21:22:28 +00001173 NodeHasRecordingVariant(SetCC->getOperand(0).getOpcode()) &&
1174 SetCC->getOperand(0).Val->hasOneUse()) {
Nate Begemanc7bd4822005-04-11 06:34:10 +00001175 RecordSuccess = false;
1176 Tmp1 = SelectExpr(SetCC->getOperand(0), true);
1177 if (RecordSuccess) {
1178 ++Recorded;
Nate Begeman7bfba7d2005-04-14 09:45:08 +00001179 BuildMI(BB, PPC::MCRF, 1, Result).addReg(PPC::CR0);
1180 return Result;
Nate Begemanc7bd4822005-04-11 06:34:10 +00001181 }
1182 AlreadySelected = true;
1183 }
1184 // If we could not implicitly set CR0, then emit a compare immediate
1185 // instead.
1186 if (!AlreadySelected) Tmp1 = SelectExpr(SetCC->getOperand(0));
Nate Begemandffcfcc2005-04-01 00:32:34 +00001187 if (U)
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001188 BuildMI(BB, PPC::CMPLWI, 2, Result).addReg(Tmp1).addImm(Tmp2);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001189 else
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001190 BuildMI(BB, PPC::CMPWI, 2, Result).addReg(Tmp1).addSImm(Tmp2);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001191 } else {
1192 bool IsInteger = MVT::isInteger(SetCC->getOperand(0).getValueType());
1193 unsigned CompareOpc = CompareOpcodes[2 * IsInteger + U];
Nate Begemanc7bd4822005-04-11 06:34:10 +00001194 Tmp1 = SelectExpr(SetCC->getOperand(0));
Nate Begemandffcfcc2005-04-01 00:32:34 +00001195 Tmp2 = SelectExpr(SetCC->getOperand(1));
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001196 BuildMI(BB, CompareOpc, 2, Result).addReg(Tmp1).addReg(Tmp2);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001197 }
1198 } else {
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001199 // If this isn't a SetCC, then select the value and compare it against zero,
1200 // treating it as if it were a boolean.
Nate Begeman9765c252005-04-12 21:22:28 +00001201 Opc = PPC::BNE;
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001202 Idx = getCRIdxForSetCC(ISD::SETNE, Inv);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001203 Tmp1 = SelectExpr(CC);
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001204 BuildMI(BB, PPC::CMPLWI, 2, Result).addReg(Tmp1).addImm(0);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001205 }
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001206 return Result;
Nate Begemandffcfcc2005-04-01 00:32:34 +00001207}
1208
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001209unsigned ISel::SelectCCExpr(SDOperand N, unsigned& Opc, bool &Inv,
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001210 unsigned &Idx) {
1211 bool Inv0, Inv1;
1212 unsigned Idx0, Idx1, CROpc, Opc1, Tmp1, Tmp2;
1213
1214 // Allocate a condition register for this expression
1215 unsigned Result = RegMap->createVirtualRegister(PPC32::CRRCRegisterClass);
1216
1217 // Check for the operations we support:
1218 switch(N.getOpcode()) {
1219 default:
1220 Opc = PPC::BNE;
1221 Idx = getCRIdxForSetCC(ISD::SETNE, Inv);
1222 Tmp1 = SelectExpr(N);
1223 BuildMI(BB, PPC::CMPLWI, 2, Result).addReg(Tmp1).addImm(0);
1224 break;
1225 case ISD::OR:
1226 case ISD::AND:
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001227 Tmp1 = SelectCCExpr(N.getOperand(0), Opc, Inv0, Idx0);
1228 Tmp2 = SelectCCExpr(N.getOperand(1), Opc1, Inv1, Idx1);
1229 CROpc = getCROpForSetCC(N.getOpcode(), Inv0, Inv1);
1230 if (Inv0 && !Inv1) {
1231 std::swap(Tmp1, Tmp2);
1232 std::swap(Idx0, Idx1);
1233 Opc = Opc1;
1234 }
1235 if (Inv0 && Inv1) Opc = PPC32InstrInfo::invertPPCBranchOpcode(Opc);
1236 BuildMI(BB, CROpc, 5, Result).addImm(Idx0).addReg(Tmp1).addImm(Idx0)
1237 .addReg(Tmp2).addImm(Idx1);
1238 Inv = false;
1239 Idx = Idx0;
1240 break;
1241 case ISD::SETCC:
1242 Tmp1 = SelectCC(N, Opc, Inv, Idx);
1243 Result = Tmp1;
1244 break;
1245 }
1246 return Result;
1247}
1248
Nate Begemandffcfcc2005-04-01 00:32:34 +00001249/// Check to see if the load is a constant offset from a base register
Nate Begeman2a05c8e2005-07-28 03:02:05 +00001250unsigned ISel::SelectAddr(SDOperand N, unsigned& Reg, int& offset)
Nate Begemana9795f82005-03-24 04:41:43 +00001251{
Nate Begeman96fc6812005-03-31 02:05:53 +00001252 unsigned imm = 0, opcode = N.getOpcode();
Nate Begeman04730362005-04-01 04:45:11 +00001253 if (N.getOpcode() == ISD::ADD) {
Nate Begeman2a05c8e2005-07-28 03:02:05 +00001254 bool isFrame = N.getOperand(0).getOpcode() == ISD::FrameIndex;
Nate Begeman439b4442005-04-05 04:22:58 +00001255 if (1 == getImmediateForOpcode(N.getOperand(1), opcode, imm)) {
Nate Begeman96fc6812005-03-31 02:05:53 +00001256 offset = imm;
Nate Begeman2a05c8e2005-07-28 03:02:05 +00001257 if (isFrame) {
1258 ++FrameOff;
1259 Reg = cast<FrameIndexSDNode>(N.getOperand(0))->getIndex();
1260 return 1;
1261 } else {
1262 Reg = SelectExpr(N.getOperand(0));
1263 return 0;
1264 }
1265 } else {
1266 Reg = SelectExpr(N.getOperand(0));
1267 offset = SelectExpr(N.getOperand(1));
1268 return 2;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001269 }
Nate Begeman04730362005-04-01 04:45:11 +00001270 }
Nate Begemana9795f82005-03-24 04:41:43 +00001271 Reg = SelectExpr(N);
1272 offset = 0;
Nate Begeman2a05c8e2005-07-28 03:02:05 +00001273 return 0;
Nate Begemana9795f82005-03-24 04:41:43 +00001274}
1275
1276void ISel::SelectBranchCC(SDOperand N)
1277{
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001278 MachineBasicBlock *Dest =
Nate Begemana9795f82005-03-24 04:41:43 +00001279 cast<BasicBlockSDNode>(N.getOperand(2))->getBasicBlock();
Nate Begeman3e897162005-03-31 23:55:40 +00001280
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001281 bool Inv;
1282 unsigned Opc, CCReg, Idx;
Nate Begemana9795f82005-03-24 04:41:43 +00001283 Select(N.getOperand(0)); //chain
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001284 CCReg = SelectCC(N.getOperand(1), Opc, Inv, Idx);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001285
Nate Begeman439009c2005-06-15 18:22:43 +00001286 // Iterate to the next basic block
1287 ilist<MachineBasicBlock>::iterator It = BB;
1288 ++It;
Nate Begemancd08e4c2005-04-09 20:09:12 +00001289
1290 // If this is a two way branch, then grab the fallthrough basic block argument
1291 // and build a PowerPC branch pseudo-op, suitable for long branch conversion
1292 // if necessary by the branch selection pass. Otherwise, emit a standard
1293 // conditional branch.
1294 if (N.getOpcode() == ISD::BRCONDTWOWAY) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001295 MachineBasicBlock *Fallthrough =
Nate Begemancd08e4c2005-04-09 20:09:12 +00001296 cast<BasicBlockSDNode>(N.getOperand(3))->getBasicBlock();
1297 if (Dest != It) {
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001298 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(CCReg).addImm(Opc)
Nate Begemancd08e4c2005-04-09 20:09:12 +00001299 .addMBB(Dest).addMBB(Fallthrough);
1300 if (Fallthrough != It)
1301 BuildMI(BB, PPC::B, 1).addMBB(Fallthrough);
1302 } else {
1303 if (Fallthrough != It) {
1304 Opc = PPC32InstrInfo::invertPPCBranchOpcode(Opc);
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001305 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(CCReg).addImm(Opc)
Nate Begemancd08e4c2005-04-09 20:09:12 +00001306 .addMBB(Fallthrough).addMBB(Dest);
1307 }
1308 }
1309 } else {
Nate Begeman439009c2005-06-15 18:22:43 +00001310 // If the fallthrough path is off the end of the function, which would be
1311 // undefined behavior, set it to be the same as the current block because
1312 // we have nothing better to set it to, and leaving it alone will cause the
1313 // PowerPC Branch Selection pass to crash.
1314 if (It == BB->getParent()->end()) It = Dest;
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001315 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(CCReg).addImm(Opc)
Nate Begeman27499e32005-04-10 01:48:29 +00001316 .addMBB(Dest).addMBB(It);
Nate Begemancd08e4c2005-04-09 20:09:12 +00001317 }
Nate Begemana9795f82005-03-24 04:41:43 +00001318 return;
1319}
1320
Nate Begemanc7bd4822005-04-11 06:34:10 +00001321unsigned ISel::SelectExpr(SDOperand N, bool Recording) {
Nate Begemana9795f82005-03-24 04:41:43 +00001322 unsigned Result;
1323 unsigned Tmp1, Tmp2, Tmp3;
1324 unsigned Opc = 0;
1325 unsigned opcode = N.getOpcode();
1326
1327 SDNode *Node = N.Val;
1328 MVT::ValueType DestType = N.getValueType();
1329
Nate Begemana43b1762005-06-14 03:55:23 +00001330 if (Node->getOpcode() == ISD::CopyFromReg &&
Chris Lattner988b1dd2005-07-28 05:23:43 +00001331 (MRegisterInfo::isVirtualRegister(cast<RegSDNode>(Node)->getReg()) ||
1332 cast<RegSDNode>(Node)->getReg() == PPC::R1))
Nate Begemana43b1762005-06-14 03:55:23 +00001333 // Just use the specified register as our input.
1334 return cast<RegSDNode>(Node)->getReg();
1335
Nate Begemana9795f82005-03-24 04:41:43 +00001336 unsigned &Reg = ExprMap[N];
1337 if (Reg) return Reg;
1338
Nate Begeman27eeb002005-04-02 05:59:34 +00001339 switch (N.getOpcode()) {
1340 default:
Nate Begemana9795f82005-03-24 04:41:43 +00001341 Reg = Result = (N.getValueType() != MVT::Other) ?
Nate Begeman27eeb002005-04-02 05:59:34 +00001342 MakeReg(N.getValueType()) : 1;
1343 break;
Chris Lattnerb5d8e6e2005-05-13 20:29:26 +00001344 case ISD::TAILCALL:
Nate Begeman27eeb002005-04-02 05:59:34 +00001345 case ISD::CALL:
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001346 // If this is a call instruction, make sure to prepare ALL of the result
1347 // values as well as the chain.
Nate Begeman27eeb002005-04-02 05:59:34 +00001348 if (Node->getNumValues() == 1)
1349 Reg = Result = 1; // Void call, just a chain.
1350 else {
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001351 Result = MakeReg(Node->getValueType(0));
1352 ExprMap[N.getValue(0)] = Result;
Nate Begeman27eeb002005-04-02 05:59:34 +00001353 for (unsigned i = 1, e = N.Val->getNumValues()-1; i != e; ++i)
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001354 ExprMap[N.getValue(i)] = MakeReg(Node->getValueType(i));
Nate Begeman27eeb002005-04-02 05:59:34 +00001355 ExprMap[SDOperand(Node, Node->getNumValues()-1)] = 1;
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001356 }
Nate Begeman27eeb002005-04-02 05:59:34 +00001357 break;
1358 case ISD::ADD_PARTS:
1359 case ISD::SUB_PARTS:
1360 case ISD::SHL_PARTS:
1361 case ISD::SRL_PARTS:
1362 case ISD::SRA_PARTS:
1363 Result = MakeReg(Node->getValueType(0));
1364 ExprMap[N.getValue(0)] = Result;
1365 for (unsigned i = 1, e = N.Val->getNumValues(); i != e; ++i)
1366 ExprMap[N.getValue(i)] = MakeReg(Node->getValueType(i));
1367 break;
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001368 }
1369
Nate Begemana9795f82005-03-24 04:41:43 +00001370 switch (opcode) {
1371 default:
1372 Node->dump();
1373 assert(0 && "Node not handled!\n");
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001374 case ISD::UNDEF:
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001375 BuildMI(BB, PPC::IMPLICIT_DEF, 0, Result);
1376 return Result;
Nate Begemana9795f82005-03-24 04:41:43 +00001377 case ISD::DYNAMIC_STACKALLOC:
Nate Begeman5e966612005-03-24 06:28:42 +00001378 // Generate both result values. FIXME: Need a better commment here?
1379 if (Result != 1)
1380 ExprMap[N.getValue(1)] = 1;
1381 else
1382 Result = ExprMap[N.getValue(0)] = MakeReg(N.getValue(0).getValueType());
1383
1384 // FIXME: We are currently ignoring the requested alignment for handling
1385 // greater than the stack alignment. This will need to be revisited at some
1386 // point. Align = N.getOperand(2);
1387 if (!isa<ConstantSDNode>(N.getOperand(2)) ||
1388 cast<ConstantSDNode>(N.getOperand(2))->getValue() != 0) {
1389 std::cerr << "Cannot allocate stack object with greater alignment than"
1390 << " the stack alignment yet!";
1391 abort();
1392 }
1393 Select(N.getOperand(0));
1394 Tmp1 = SelectExpr(N.getOperand(1));
1395 // Subtract size from stack pointer, thereby allocating some space.
1396 BuildMI(BB, PPC::SUBF, 2, PPC::R1).addReg(Tmp1).addReg(PPC::R1);
1397 // Put a pointer to the space into the result register by copying the SP
1398 BuildMI(BB, PPC::OR, 2, Result).addReg(PPC::R1).addReg(PPC::R1);
1399 return Result;
Nate Begemana9795f82005-03-24 04:41:43 +00001400
1401 case ISD::ConstantPool:
Nate Begemanca12a2b2005-03-28 22:28:37 +00001402 Tmp1 = cast<ConstantPoolSDNode>(N)->getIndex();
1403 Tmp2 = MakeReg(MVT::i32);
Nate Begeman2497e632005-07-21 20:44:43 +00001404 if (PICEnabled)
1405 BuildMI(BB, PPC::ADDIS, 2, Tmp2).addReg(getGlobalBaseReg())
1406 .addConstantPoolIndex(Tmp1);
1407 else
1408 BuildMI(BB, PPC::LIS, 1, Tmp2).addConstantPoolIndex(Tmp1);
Nate Begemanca12a2b2005-03-28 22:28:37 +00001409 BuildMI(BB, PPC::LA, 2, Result).addReg(Tmp2).addConstantPoolIndex(Tmp1);
1410 return Result;
Nate Begemana9795f82005-03-24 04:41:43 +00001411
1412 case ISD::FrameIndex:
Nate Begemanf3d08f32005-03-29 00:03:27 +00001413 Tmp1 = cast<FrameIndexSDNode>(N)->getIndex();
Nate Begeman58f718c2005-03-30 02:23:08 +00001414 addFrameReference(BuildMI(BB, PPC::ADDI, 2, Result), (int)Tmp1, 0, false);
Nate Begemanf3d08f32005-03-29 00:03:27 +00001415 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001416
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001417 case ISD::GlobalAddress: {
1418 GlobalValue *GV = cast<GlobalAddressSDNode>(N)->getGlobal();
Nate Begemanca12a2b2005-03-28 22:28:37 +00001419 Tmp1 = MakeReg(MVT::i32);
Nate Begeman2497e632005-07-21 20:44:43 +00001420 if (PICEnabled)
1421 BuildMI(BB, PPC::ADDIS, 2, Tmp1).addReg(getGlobalBaseReg())
1422 .addGlobalAddress(GV);
1423 else
Chris Lattner4015ea82005-07-28 04:42:11 +00001424 BuildMI(BB, PPC::LIS, 1, Tmp1).addGlobalAddress(GV);
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001425 if (GV->hasWeakLinkage() || GV->isExternal()) {
1426 BuildMI(BB, PPC::LWZ, 2, Result).addGlobalAddress(GV).addReg(Tmp1);
1427 } else {
1428 BuildMI(BB, PPC::LA, 2, Result).addReg(Tmp1).addGlobalAddress(GV);
1429 }
1430 return Result;
1431 }
1432
Nate Begeman5e966612005-03-24 06:28:42 +00001433 case ISD::LOAD:
Nate Begemana9795f82005-03-24 04:41:43 +00001434 case ISD::EXTLOAD:
1435 case ISD::ZEXTLOAD:
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001436 case ISD::SEXTLOAD: {
Nate Begeman9db505c2005-03-28 19:36:43 +00001437 MVT::ValueType TypeBeingLoaded = (ISD::LOAD == opcode) ?
Chris Lattnerbce81ae2005-07-10 01:56:13 +00001438 Node->getValueType(0) : cast<VTSDNode>(Node->getOperand(3))->getVT();
Nate Begeman74d73452005-03-31 00:15:26 +00001439 bool sext = (ISD::SEXTLOAD == opcode);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001440
Nate Begeman5e966612005-03-24 06:28:42 +00001441 // Make sure we generate both values.
1442 if (Result != 1)
1443 ExprMap[N.getValue(1)] = 1; // Generate the token
1444 else
1445 Result = ExprMap[N.getValue(0)] = MakeReg(N.getValue(0).getValueType());
1446
1447 SDOperand Chain = N.getOperand(0);
1448 SDOperand Address = N.getOperand(1);
1449 Select(Chain);
1450
Nate Begeman9db505c2005-03-28 19:36:43 +00001451 switch (TypeBeingLoaded) {
Nate Begeman74d73452005-03-31 00:15:26 +00001452 default: Node->dump(); assert(0 && "Cannot load this type!");
Nate Begeman9db505c2005-03-28 19:36:43 +00001453 case MVT::i1: Opc = PPC::LBZ; break;
1454 case MVT::i8: Opc = PPC::LBZ; break;
1455 case MVT::i16: Opc = sext ? PPC::LHA : PPC::LHZ; break;
1456 case MVT::i32: Opc = PPC::LWZ; break;
Nate Begeman74d73452005-03-31 00:15:26 +00001457 case MVT::f32: Opc = PPC::LFS; break;
1458 case MVT::f64: Opc = PPC::LFD; break;
Nate Begeman5e966612005-03-24 06:28:42 +00001459 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001460
Nate Begeman74d73452005-03-31 00:15:26 +00001461 if (ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(Address)) {
1462 Tmp1 = MakeReg(MVT::i32);
1463 int CPI = CP->getIndex();
Nate Begeman2497e632005-07-21 20:44:43 +00001464 if (PICEnabled)
1465 BuildMI(BB, PPC::ADDIS, 2, Tmp1).addReg(getGlobalBaseReg())
1466 .addConstantPoolIndex(CPI);
1467 else
1468 BuildMI(BB, PPC::LIS, 1, Tmp1).addConstantPoolIndex(CPI);
Nate Begeman74d73452005-03-31 00:15:26 +00001469 BuildMI(BB, Opc, 2, Result).addConstantPoolIndex(CPI).addReg(Tmp1);
Nate Begeman2497e632005-07-21 20:44:43 +00001470 } else if (Address.getOpcode() == ISD::FrameIndex) {
Nate Begeman58f718c2005-03-30 02:23:08 +00001471 Tmp1 = cast<FrameIndexSDNode>(Address)->getIndex();
1472 addFrameReference(BuildMI(BB, Opc, 2, Result), (int)Tmp1);
Nate Begeman2497e632005-07-21 20:44:43 +00001473 } else if(GlobalAddressSDNode *GN = dyn_cast<GlobalAddressSDNode>(Address)){
1474 GlobalValue *GV = GN->getGlobal();
1475 Tmp1 = MakeReg(MVT::i32);
1476 if (PICEnabled)
1477 BuildMI(BB, PPC::ADDIS, 2, Tmp1).addReg(getGlobalBaseReg())
1478 .addGlobalAddress(GV);
1479 else
Chris Lattner4015ea82005-07-28 04:42:11 +00001480 BuildMI(BB, PPC::LIS, 1, Tmp1).addGlobalAddress(GV);
Nate Begeman2497e632005-07-21 20:44:43 +00001481 if (GV->hasWeakLinkage() || GV->isExternal()) {
1482 Tmp2 = MakeReg(MVT::i32);
1483 BuildMI(BB, PPC::LWZ, 2, Tmp2).addGlobalAddress(GV).addReg(Tmp1);
Nate Begeman7b4f0a82005-07-25 21:15:28 +00001484 BuildMI(BB, Opc, 2, Result).addSImm(0).addReg(Tmp2);
1485 } else {
1486 BuildMI(BB, Opc, 2, Result).addGlobalAddress(GV).addReg(Tmp1);
Nate Begeman2497e632005-07-21 20:44:43 +00001487 }
Nate Begeman5e966612005-03-24 06:28:42 +00001488 } else {
1489 int offset;
Nate Begeman2a05c8e2005-07-28 03:02:05 +00001490 switch(SelectAddr(Address, Tmp1, offset)) {
1491 default: assert(0 && "Unhandled return value from SelectAddr");
1492 case 0: // imm offset, no frame, no index
1493 BuildMI(BB, Opc, 2, Result).addSImm(offset).addReg(Tmp1);
1494 break;
1495 case 1: // imm offset + frame index
1496 addFrameReference(BuildMI(BB, Opc, 2, Result), (int)Tmp1, offset);
1497 break;
1498 case 2: // base+index addressing
Nate Begeman04730362005-04-01 04:45:11 +00001499 Opc = IndexedOpForOp(Opc);
1500 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(offset);
Nate Begeman2a05c8e2005-07-28 03:02:05 +00001501 break;
Nate Begeman04730362005-04-01 04:45:11 +00001502 }
Nate Begeman5e966612005-03-24 06:28:42 +00001503 }
1504 return Result;
1505 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001506
Chris Lattnerb5d8e6e2005-05-13 20:29:26 +00001507 case ISD::TAILCALL:
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001508 case ISD::CALL: {
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001509 unsigned GPR_idx = 0, FPR_idx = 0;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001510 static const unsigned GPR[] = {
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001511 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
1512 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
1513 };
1514 static const unsigned FPR[] = {
1515 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
1516 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
1517 };
1518
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001519 // Lower the chain for this call.
1520 Select(N.getOperand(0));
1521 ExprMap[N.getValue(Node->getNumValues()-1)] = 1;
Nate Begeman74d73452005-03-31 00:15:26 +00001522
Nate Begemand860aa62005-04-04 22:17:48 +00001523 MachineInstr *CallMI;
1524 // Emit the correct call instruction based on the type of symbol called.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001525 if (GlobalAddressSDNode *GASD =
Nate Begemand860aa62005-04-04 22:17:48 +00001526 dyn_cast<GlobalAddressSDNode>(N.getOperand(1))) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001527 CallMI = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(GASD->getGlobal(),
Nate Begemand860aa62005-04-04 22:17:48 +00001528 true);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001529 } else if (ExternalSymbolSDNode *ESSDN =
Nate Begemand860aa62005-04-04 22:17:48 +00001530 dyn_cast<ExternalSymbolSDNode>(N.getOperand(1))) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001531 CallMI = BuildMI(PPC::CALLpcrel, 1).addExternalSymbol(ESSDN->getSymbol(),
Nate Begemand860aa62005-04-04 22:17:48 +00001532 true);
1533 } else {
1534 Tmp1 = SelectExpr(N.getOperand(1));
1535 BuildMI(BB, PPC::OR, 2, PPC::R12).addReg(Tmp1).addReg(Tmp1);
1536 BuildMI(BB, PPC::MTCTR, 1).addReg(PPC::R12);
1537 CallMI = BuildMI(PPC::CALLindirect, 3).addImm(20).addImm(0)
1538 .addReg(PPC::R12);
1539 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001540
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001541 // Load the register args to virtual regs
1542 std::vector<unsigned> ArgVR;
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001543 for(int i = 2, e = Node->getNumOperands(); i < e; ++i)
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001544 ArgVR.push_back(SelectExpr(N.getOperand(i)));
1545
1546 // Copy the virtual registers into the appropriate argument register
1547 for(int i = 0, e = ArgVR.size(); i < e; ++i) {
1548 switch(N.getOperand(i+2).getValueType()) {
1549 default: Node->dump(); assert(0 && "Unknown value type for call");
1550 case MVT::i1:
1551 case MVT::i8:
1552 case MVT::i16:
1553 case MVT::i32:
1554 assert(GPR_idx < 8 && "Too many int args");
Nate Begemand860aa62005-04-04 22:17:48 +00001555 if (N.getOperand(i+2).getOpcode() != ISD::UNDEF) {
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001556 BuildMI(BB, PPC::OR,2,GPR[GPR_idx]).addReg(ArgVR[i]).addReg(ArgVR[i]);
Nate Begemand860aa62005-04-04 22:17:48 +00001557 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1558 }
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001559 ++GPR_idx;
1560 break;
1561 case MVT::f64:
1562 case MVT::f32:
1563 assert(FPR_idx < 13 && "Too many fp args");
1564 BuildMI(BB, PPC::FMR, 1, FPR[FPR_idx]).addReg(ArgVR[i]);
Nate Begemand860aa62005-04-04 22:17:48 +00001565 CallMI->addRegOperand(FPR[FPR_idx], MachineOperand::Use);
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001566 ++FPR_idx;
1567 break;
1568 }
1569 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001570
Nate Begemand860aa62005-04-04 22:17:48 +00001571 // Put the call instruction in the correct place in the MachineBasicBlock
1572 BB->push_back(CallMI);
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001573
1574 switch (Node->getValueType(0)) {
1575 default: assert(0 && "Unknown value type for call result!");
1576 case MVT::Other: return 1;
1577 case MVT::i1:
1578 case MVT::i8:
1579 case MVT::i16:
1580 case MVT::i32:
Nate Begemane5846682005-04-04 06:52:38 +00001581 if (Node->getValueType(1) == MVT::i32) {
1582 BuildMI(BB, PPC::OR, 2, Result+1).addReg(PPC::R3).addReg(PPC::R3);
1583 BuildMI(BB, PPC::OR, 2, Result).addReg(PPC::R4).addReg(PPC::R4);
1584 } else {
1585 BuildMI(BB, PPC::OR, 2, Result).addReg(PPC::R3).addReg(PPC::R3);
1586 }
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001587 break;
1588 case MVT::f32:
1589 case MVT::f64:
1590 BuildMI(BB, PPC::FMR, 1, Result).addReg(PPC::F1);
1591 break;
1592 }
1593 return Result+N.ResNo;
1594 }
Nate Begemana9795f82005-03-24 04:41:43 +00001595
1596 case ISD::SIGN_EXTEND:
1597 case ISD::SIGN_EXTEND_INREG:
1598 Tmp1 = SelectExpr(N.getOperand(0));
Chris Lattnerbce81ae2005-07-10 01:56:13 +00001599 switch(cast<VTSDNode>(Node->getOperand(1))->getVT()) {
Nate Begeman9db505c2005-03-28 19:36:43 +00001600 default: Node->dump(); assert(0 && "Unhandled SIGN_EXTEND type"); break;
Nate Begemanc7bd4822005-04-11 06:34:10 +00001601 case MVT::i16:
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001602 BuildMI(BB, PPC::EXTSH, 1, Result).addReg(Tmp1);
Nate Begeman9db505c2005-03-28 19:36:43 +00001603 break;
Nate Begemanc7bd4822005-04-11 06:34:10 +00001604 case MVT::i8:
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001605 BuildMI(BB, PPC::EXTSB, 1, Result).addReg(Tmp1);
Nate Begeman9db505c2005-03-28 19:36:43 +00001606 break;
Nate Begeman74747862005-03-29 22:24:51 +00001607 case MVT::i1:
1608 BuildMI(BB, PPC::SUBFIC, 2, Result).addReg(Tmp1).addSImm(0);
1609 break;
Nate Begeman9db505c2005-03-28 19:36:43 +00001610 }
Nate Begemana9795f82005-03-24 04:41:43 +00001611 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001612
Nate Begemana9795f82005-03-24 04:41:43 +00001613 case ISD::CopyFromReg:
Nate Begemana3fd4002005-07-19 16:51:05 +00001614 DestType = N.getValue(0).getValueType();
Nate Begemana9795f82005-03-24 04:41:43 +00001615 if (Result == 1)
Nate Begemana3fd4002005-07-19 16:51:05 +00001616 Result = ExprMap[N.getValue(0)] = MakeReg(DestType);
Nate Begemana9795f82005-03-24 04:41:43 +00001617 Tmp1 = dyn_cast<RegSDNode>(Node)->getReg();
Nate Begemana3fd4002005-07-19 16:51:05 +00001618 if (MVT::isInteger(DestType))
1619 BuildMI(BB, PPC::OR, 2, Result).addReg(Tmp1).addReg(Tmp1);
1620 else
1621 BuildMI(BB, PPC::FMR, 1, Result).addReg(Tmp1);
Nate Begemana9795f82005-03-24 04:41:43 +00001622 return Result;
1623
1624 case ISD::SHL:
Nate Begeman5e966612005-03-24 06:28:42 +00001625 Tmp1 = SelectExpr(N.getOperand(0));
1626 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.getOperand(1))) {
1627 Tmp2 = CN->getValue() & 0x1F;
Nate Begeman33162522005-03-29 21:54:38 +00001628 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp1).addImm(Tmp2).addImm(0)
Nate Begeman5e966612005-03-24 06:28:42 +00001629 .addImm(31-Tmp2);
1630 } else {
Nate Begeman3664cef2005-04-13 22:14:14 +00001631 Tmp2 = FoldIfWideZeroExtend(N.getOperand(1));
Nate Begeman5e966612005-03-24 06:28:42 +00001632 BuildMI(BB, PPC::SLW, 2, Result).addReg(Tmp1).addReg(Tmp2);
1633 }
1634 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001635
Nate Begeman5e966612005-03-24 06:28:42 +00001636 case ISD::SRL:
1637 Tmp1 = SelectExpr(N.getOperand(0));
1638 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.getOperand(1))) {
1639 Tmp2 = CN->getValue() & 0x1F;
Nate Begeman33162522005-03-29 21:54:38 +00001640 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp1).addImm(32-Tmp2)
Nate Begeman5e966612005-03-24 06:28:42 +00001641 .addImm(Tmp2).addImm(31);
1642 } else {
Nate Begeman3664cef2005-04-13 22:14:14 +00001643 Tmp2 = FoldIfWideZeroExtend(N.getOperand(1));
Nate Begeman5e966612005-03-24 06:28:42 +00001644 BuildMI(BB, PPC::SRW, 2, Result).addReg(Tmp1).addReg(Tmp2);
1645 }
1646 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001647
Nate Begeman5e966612005-03-24 06:28:42 +00001648 case ISD::SRA:
1649 Tmp1 = SelectExpr(N.getOperand(0));
1650 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.getOperand(1))) {
1651 Tmp2 = CN->getValue() & 0x1F;
1652 BuildMI(BB, PPC::SRAWI, 2, Result).addReg(Tmp1).addImm(Tmp2);
1653 } else {
Nate Begeman3664cef2005-04-13 22:14:14 +00001654 Tmp2 = FoldIfWideZeroExtend(N.getOperand(1));
Nate Begeman5e966612005-03-24 06:28:42 +00001655 BuildMI(BB, PPC::SRAW, 2, Result).addReg(Tmp1).addReg(Tmp2);
1656 }
1657 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001658
Nate Begemand7c4a4a2005-05-11 23:43:56 +00001659 case ISD::CTLZ:
1660 Tmp1 = SelectExpr(N.getOperand(0));
1661 BuildMI(BB, PPC::CNTLZW, 1, Result).addReg(Tmp1);
1662 return Result;
1663
Nate Begemana9795f82005-03-24 04:41:43 +00001664 case ISD::ADD:
Nate Begemana3fd4002005-07-19 16:51:05 +00001665 if (!MVT::isInteger(DestType)) {
1666 if (!NoExcessFPPrecision && N.getOperand(0).getOpcode() == ISD::MUL &&
1667 N.getOperand(0).Val->hasOneUse()) {
1668 ++FusedFP; // Statistic
1669 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1670 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1));
1671 Tmp3 = SelectExpr(N.getOperand(1));
1672 Opc = DestType == MVT::f64 ? PPC::FMADD : PPC::FMADDS;
1673 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
1674 return Result;
1675 }
1676 if (!NoExcessFPPrecision && N.getOperand(1).getOpcode() == ISD::MUL &&
1677 N.getOperand(1).Val->hasOneUse()) {
1678 ++FusedFP; // Statistic
1679 Tmp1 = SelectExpr(N.getOperand(1).getOperand(0));
1680 Tmp2 = SelectExpr(N.getOperand(1).getOperand(1));
1681 Tmp3 = SelectExpr(N.getOperand(0));
1682 Opc = DestType == MVT::f64 ? PPC::FMADD : PPC::FMADDS;
1683 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
1684 return Result;
1685 }
1686 Opc = DestType == MVT::f64 ? PPC::FADD : PPC::FADDS;
1687 Tmp1 = SelectExpr(N.getOperand(0));
1688 Tmp2 = SelectExpr(N.getOperand(1));
1689 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
1690 return Result;
1691 }
Nate Begemana9795f82005-03-24 04:41:43 +00001692 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman439b4442005-04-05 04:22:58 +00001693 switch(getImmediateForOpcode(N.getOperand(1), opcode, Tmp2)) {
Nate Begemana9795f82005-03-24 04:41:43 +00001694 default: assert(0 && "unhandled result code");
1695 case 0: // No immediate
1696 Tmp2 = SelectExpr(N.getOperand(1));
1697 BuildMI(BB, PPC::ADD, 2, Result).addReg(Tmp1).addReg(Tmp2);
1698 break;
1699 case 1: // Low immediate
1700 BuildMI(BB, PPC::ADDI, 2, Result).addReg(Tmp1).addSImm(Tmp2);
1701 break;
1702 case 2: // Shifted immediate
1703 BuildMI(BB, PPC::ADDIS, 2, Result).addReg(Tmp1).addSImm(Tmp2);
1704 break;
1705 }
1706 return Result;
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001707
Nate Begemana9795f82005-03-24 04:41:43 +00001708 case ISD::AND:
Nate Begeman7ddecb42005-04-06 23:51:40 +00001709 switch(getImmediateForOpcode(N.getOperand(1), opcode, Tmp2)) {
1710 default: assert(0 && "unhandled result code");
1711 case 0: // No immediate
Nate Begemand7c4a4a2005-05-11 23:43:56 +00001712 // Check for andc: and, (xor a, -1), b
1713 if (N.getOperand(0).getOpcode() == ISD::XOR &&
1714 N.getOperand(0).getOperand(1).getOpcode() == ISD::Constant &&
1715 cast<ConstantSDNode>(N.getOperand(0).getOperand(1))->isAllOnesValue()) {
1716 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1717 Tmp2 = SelectExpr(N.getOperand(1));
1718 BuildMI(BB, PPC::ANDC, 2, Result).addReg(Tmp2).addReg(Tmp1);
1719 return Result;
1720 }
1721 // It wasn't and-with-complement, emit a regular and
Chris Lattnercafb67b2005-05-09 17:39:48 +00001722 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman7ddecb42005-04-06 23:51:40 +00001723 Tmp2 = SelectExpr(N.getOperand(1));
Nate Begemanc7bd4822005-04-11 06:34:10 +00001724 Opc = Recording ? PPC::ANDo : PPC::AND;
1725 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
Nate Begeman7ddecb42005-04-06 23:51:40 +00001726 break;
1727 case 1: // Low immediate
Chris Lattnercafb67b2005-05-09 17:39:48 +00001728 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman7ddecb42005-04-06 23:51:40 +00001729 BuildMI(BB, PPC::ANDIo, 2, Result).addReg(Tmp1).addImm(Tmp2);
1730 break;
1731 case 2: // Shifted immediate
Chris Lattnercafb67b2005-05-09 17:39:48 +00001732 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman7ddecb42005-04-06 23:51:40 +00001733 BuildMI(BB, PPC::ANDISo, 2, Result).addReg(Tmp1).addImm(Tmp2);
1734 break;
Nate Begeman9f833d32005-04-12 00:10:02 +00001735 case 5: // Bitfield mask
1736 Opc = Recording ? PPC::RLWINMo : PPC::RLWINM;
1737 Tmp3 = Tmp2 >> 16; // MB
1738 Tmp2 &= 0xFFFF; // ME
Chris Lattnercafb67b2005-05-09 17:39:48 +00001739
Nate Begeman3dee1752005-07-27 23:11:27 +00001740 // FIXME: Catch SHL-AND in addition to SRL-AND in this block.
Chris Lattnercafb67b2005-05-09 17:39:48 +00001741 if (N.getOperand(0).getOpcode() == ISD::SRL)
1742 if (ConstantSDNode *SA =
1743 dyn_cast<ConstantSDNode>(N.getOperand(0).getOperand(1))) {
1744
1745 // We can fold the RLWINM and the SRL together if the mask is
1746 // clearing the top bits which are rotated around.
1747 unsigned RotAmt = 32-(SA->getValue() & 31);
1748 if (Tmp2 <= RotAmt) {
1749 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1750 BuildMI(BB, Opc, 4, Result).addReg(Tmp1).addImm(RotAmt)
1751 .addImm(Tmp3).addImm(Tmp2);
1752 break;
1753 }
1754 }
1755
1756 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman9f833d32005-04-12 00:10:02 +00001757 BuildMI(BB, Opc, 4, Result).addReg(Tmp1).addImm(0)
1758 .addImm(Tmp3).addImm(Tmp2);
1759 break;
Nate Begeman7ddecb42005-04-06 23:51:40 +00001760 }
Nate Begemanc7bd4822005-04-11 06:34:10 +00001761 RecordSuccess = true;
Nate Begeman7ddecb42005-04-06 23:51:40 +00001762 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001763
Nate Begemana9795f82005-03-24 04:41:43 +00001764 case ISD::OR:
Nate Begeman7ddecb42005-04-06 23:51:40 +00001765 if (SelectBitfieldInsert(N, Result))
1766 return Result;
Nate Begemana9795f82005-03-24 04:41:43 +00001767 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman439b4442005-04-05 04:22:58 +00001768 switch(getImmediateForOpcode(N.getOperand(1), opcode, Tmp2)) {
Nate Begemana9795f82005-03-24 04:41:43 +00001769 default: assert(0 && "unhandled result code");
1770 case 0: // No immediate
1771 Tmp2 = SelectExpr(N.getOperand(1));
Nate Begemanc7bd4822005-04-11 06:34:10 +00001772 Opc = Recording ? PPC::ORo : PPC::OR;
1773 RecordSuccess = true;
1774 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
Nate Begemana9795f82005-03-24 04:41:43 +00001775 break;
1776 case 1: // Low immediate
Nate Begeman7ddecb42005-04-06 23:51:40 +00001777 BuildMI(BB, PPC::ORI, 2, Result).addReg(Tmp1).addImm(Tmp2);
Nate Begemana9795f82005-03-24 04:41:43 +00001778 break;
1779 case 2: // Shifted immediate
Nate Begeman7ddecb42005-04-06 23:51:40 +00001780 BuildMI(BB, PPC::ORIS, 2, Result).addReg(Tmp1).addImm(Tmp2);
Nate Begemana9795f82005-03-24 04:41:43 +00001781 break;
1782 }
1783 return Result;
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001784
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001785 case ISD::XOR: {
1786 // Check for EQV: xor, (xor a, -1), b
1787 if (N.getOperand(0).getOpcode() == ISD::XOR &&
1788 N.getOperand(0).getOperand(1).getOpcode() == ISD::Constant &&
1789 cast<ConstantSDNode>(N.getOperand(0).getOperand(1))->isAllOnesValue()) {
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001790 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1791 Tmp2 = SelectExpr(N.getOperand(1));
1792 BuildMI(BB, PPC::EQV, 2, Result).addReg(Tmp1).addReg(Tmp2);
1793 return Result;
1794 }
Chris Lattner837a5212005-04-21 21:09:11 +00001795 // Check for NOT, NOR, EQV, and NAND: xor (copy, or, xor, and), -1
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001796 if (N.getOperand(1).getOpcode() == ISD::Constant &&
1797 cast<ConstantSDNode>(N.getOperand(1))->isAllOnesValue()) {
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001798 switch(N.getOperand(0).getOpcode()) {
1799 case ISD::OR:
1800 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1801 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1));
1802 BuildMI(BB, PPC::NOR, 2, Result).addReg(Tmp1).addReg(Tmp2);
1803 break;
1804 case ISD::AND:
1805 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1806 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1));
1807 BuildMI(BB, PPC::NAND, 2, Result).addReg(Tmp1).addReg(Tmp2);
1808 break;
Chris Lattner837a5212005-04-21 21:09:11 +00001809 case ISD::XOR:
1810 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1811 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1));
1812 BuildMI(BB, PPC::EQV, 2, Result).addReg(Tmp1).addReg(Tmp2);
1813 break;
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001814 default:
1815 Tmp1 = SelectExpr(N.getOperand(0));
1816 BuildMI(BB, PPC::NOR, 2, Result).addReg(Tmp1).addReg(Tmp1);
1817 break;
1818 }
1819 return Result;
1820 }
1821 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman439b4442005-04-05 04:22:58 +00001822 switch(getImmediateForOpcode(N.getOperand(1), opcode, Tmp2)) {
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001823 default: assert(0 && "unhandled result code");
1824 case 0: // No immediate
1825 Tmp2 = SelectExpr(N.getOperand(1));
1826 BuildMI(BB, PPC::XOR, 2, Result).addReg(Tmp1).addReg(Tmp2);
1827 break;
1828 case 1: // Low immediate
1829 BuildMI(BB, PPC::XORI, 2, Result).addReg(Tmp1).addImm(Tmp2);
1830 break;
1831 case 2: // Shifted immediate
1832 BuildMI(BB, PPC::XORIS, 2, Result).addReg(Tmp1).addImm(Tmp2);
1833 break;
1834 }
1835 return Result;
1836 }
1837
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001838 case ISD::SUB:
Nate Begemana3fd4002005-07-19 16:51:05 +00001839 if (!MVT::isInteger(DestType)) {
1840 if (!NoExcessFPPrecision && N.getOperand(0).getOpcode() == ISD::MUL &&
1841 N.getOperand(0).Val->hasOneUse()) {
1842 ++FusedFP; // Statistic
1843 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1844 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1));
1845 Tmp3 = SelectExpr(N.getOperand(1));
1846 Opc = DestType == MVT::f64 ? PPC::FMSUB : PPC::FMSUBS;
1847 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
1848 return Result;
1849 }
1850 if (!NoExcessFPPrecision && N.getOperand(1).getOpcode() == ISD::MUL &&
1851 N.getOperand(1).Val->hasOneUse()) {
1852 ++FusedFP; // Statistic
1853 Tmp1 = SelectExpr(N.getOperand(1).getOperand(0));
1854 Tmp2 = SelectExpr(N.getOperand(1).getOperand(1));
1855 Tmp3 = SelectExpr(N.getOperand(0));
1856 Opc = DestType == MVT::f64 ? PPC::FNMSUB : PPC::FNMSUBS;
1857 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
1858 return Result;
1859 }
1860 Opc = DestType == MVT::f64 ? PPC::FSUB : PPC::FSUBS;
1861 Tmp1 = SelectExpr(N.getOperand(0));
1862 Tmp2 = SelectExpr(N.getOperand(1));
1863 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
1864 return Result;
1865 }
Nate Begemand7c4a4a2005-05-11 23:43:56 +00001866 if (1 == getImmediateForOpcode(N.getOperand(0), opcode, Tmp1, true)) {
1867 Tmp2 = SelectExpr(N.getOperand(1));
Nate Begeman27523a12005-04-02 00:42:16 +00001868 BuildMI(BB, PPC::SUBFIC, 2, Result).addReg(Tmp2).addSImm(Tmp1);
Nate Begemand7c4a4a2005-05-11 23:43:56 +00001869 } else if (1 == getImmediateForOpcode(N.getOperand(1), opcode, Tmp2)) {
Nate Begeman27523a12005-04-02 00:42:16 +00001870 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begemand7c4a4a2005-05-11 23:43:56 +00001871 BuildMI(BB, PPC::ADDI, 2, Result).addReg(Tmp1).addSImm(Tmp2);
1872 } else {
1873 Tmp1 = SelectExpr(N.getOperand(0));
1874 Tmp2 = SelectExpr(N.getOperand(1));
Nate Begeman27523a12005-04-02 00:42:16 +00001875 BuildMI(BB, PPC::SUBF, 2, Result).addReg(Tmp2).addReg(Tmp1);
1876 }
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001877 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001878
Nate Begeman5e966612005-03-24 06:28:42 +00001879 case ISD::MUL:
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001880 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman439b4442005-04-05 04:22:58 +00001881 if (1 == getImmediateForOpcode(N.getOperand(1), opcode, Tmp2))
Nate Begeman307e7442005-03-26 01:28:53 +00001882 BuildMI(BB, PPC::MULLI, 2, Result).addReg(Tmp1).addSImm(Tmp2);
1883 else {
1884 Tmp2 = SelectExpr(N.getOperand(1));
Nate Begemana3fd4002005-07-19 16:51:05 +00001885 switch (DestType) {
1886 default: assert(0 && "Unknown type to ISD::MUL"); break;
1887 case MVT::i32: Opc = PPC::MULLW; break;
1888 case MVT::f32: Opc = PPC::FMULS; break;
1889 case MVT::f64: Opc = PPC::FMUL; break;
1890 }
1891 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
Nate Begeman307e7442005-03-26 01:28:53 +00001892 }
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001893 return Result;
1894
Nate Begeman815d6da2005-04-06 00:25:27 +00001895 case ISD::MULHS:
1896 case ISD::MULHU:
1897 Tmp1 = SelectExpr(N.getOperand(0));
1898 Tmp2 = SelectExpr(N.getOperand(1));
1899 Opc = (ISD::MULHU == opcode) ? PPC::MULHWU : PPC::MULHW;
1900 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
1901 return Result;
1902
Nate Begemanf3d08f32005-03-29 00:03:27 +00001903 case ISD::SDIV:
1904 case ISD::UDIV:
Nate Begeman815d6da2005-04-06 00:25:27 +00001905 switch (getImmediateForOpcode(N.getOperand(1), opcode, Tmp3)) {
1906 default: break;
1907 // If this is an sdiv by a power of two, we can use an srawi/addze pair.
1908 case 3:
Nate Begeman80196b12005-04-05 00:15:08 +00001909 Tmp1 = MakeReg(MVT::i32);
1910 Tmp2 = SelectExpr(N.getOperand(0));
Nate Begeman9f833d32005-04-12 00:10:02 +00001911 if ((int)Tmp3 < 0) {
1912 unsigned Tmp4 = MakeReg(MVT::i32);
1913 BuildMI(BB, PPC::SRAWI, 2, Tmp1).addReg(Tmp2).addImm(-Tmp3);
1914 BuildMI(BB, PPC::ADDZE, 1, Tmp4).addReg(Tmp1);
1915 BuildMI(BB, PPC::NEG, 1, Result).addReg(Tmp4);
1916 } else {
1917 BuildMI(BB, PPC::SRAWI, 2, Tmp1).addReg(Tmp2).addImm(Tmp3);
1918 BuildMI(BB, PPC::ADDZE, 1, Result).addReg(Tmp1);
1919 }
Nate Begeman80196b12005-04-05 00:15:08 +00001920 return Result;
Nate Begeman815d6da2005-04-06 00:25:27 +00001921 // If this is a divide by constant, we can emit code using some magic
1922 // constants to implement it as a multiply instead.
Nate Begeman27b4c232005-04-06 06:44:57 +00001923 case 4:
1924 ExprMap.erase(N);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001925 if (opcode == ISD::SDIV)
Nate Begeman27b4c232005-04-06 06:44:57 +00001926 return SelectExpr(BuildSDIVSequence(N));
1927 else
1928 return SelectExpr(BuildUDIVSequence(N));
Jeff Cohen00b168892005-07-27 06:12:32 +00001929 }
Nate Begemanf3d08f32005-03-29 00:03:27 +00001930 Tmp1 = SelectExpr(N.getOperand(0));
1931 Tmp2 = SelectExpr(N.getOperand(1));
Nate Begemana3fd4002005-07-19 16:51:05 +00001932 switch (DestType) {
1933 default: assert(0 && "Unknown type to ISD::SDIV"); break;
1934 case MVT::i32: Opc = (ISD::UDIV == opcode) ? PPC::DIVWU : PPC::DIVW; break;
1935 case MVT::f32: Opc = PPC::FDIVS; break;
1936 case MVT::f64: Opc = PPC::FDIV; break;
1937 }
Nate Begemanf3d08f32005-03-29 00:03:27 +00001938 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
1939 return Result;
1940
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001941 case ISD::ADD_PARTS:
Nate Begemanca12a2b2005-03-28 22:28:37 +00001942 case ISD::SUB_PARTS: {
1943 assert(N.getNumOperands() == 4 && N.getValueType() == MVT::i32 &&
1944 "Not an i64 add/sub!");
1945 // Emit all of the operands.
1946 std::vector<unsigned> InVals;
1947 for (unsigned i = 0, e = N.getNumOperands(); i != e; ++i)
1948 InVals.push_back(SelectExpr(N.getOperand(i)));
1949 if (N.getOpcode() == ISD::ADD_PARTS) {
Nate Begeman27eeb002005-04-02 05:59:34 +00001950 BuildMI(BB, PPC::ADDC, 2, Result).addReg(InVals[0]).addReg(InVals[2]);
1951 BuildMI(BB, PPC::ADDE, 2, Result+1).addReg(InVals[1]).addReg(InVals[3]);
Nate Begemanca12a2b2005-03-28 22:28:37 +00001952 } else {
Nate Begeman27eeb002005-04-02 05:59:34 +00001953 BuildMI(BB, PPC::SUBFC, 2, Result).addReg(InVals[2]).addReg(InVals[0]);
1954 BuildMI(BB, PPC::SUBFE, 2, Result+1).addReg(InVals[3]).addReg(InVals[1]);
1955 }
1956 return Result+N.ResNo;
1957 }
1958
1959 case ISD::SHL_PARTS:
1960 case ISD::SRA_PARTS:
1961 case ISD::SRL_PARTS: {
1962 assert(N.getNumOperands() == 3 && N.getValueType() == MVT::i32 &&
1963 "Not an i64 shift!");
1964 unsigned ShiftOpLo = SelectExpr(N.getOperand(0));
1965 unsigned ShiftOpHi = SelectExpr(N.getOperand(1));
Nate Begeman3664cef2005-04-13 22:14:14 +00001966 unsigned SHReg = FoldIfWideZeroExtend(N.getOperand(2));
1967 Tmp1 = MakeReg(MVT::i32);
1968 Tmp2 = MakeReg(MVT::i32);
Nate Begeman27eeb002005-04-02 05:59:34 +00001969 Tmp3 = MakeReg(MVT::i32);
1970 unsigned Tmp4 = MakeReg(MVT::i32);
1971 unsigned Tmp5 = MakeReg(MVT::i32);
1972 unsigned Tmp6 = MakeReg(MVT::i32);
1973 BuildMI(BB, PPC::SUBFIC, 2, Tmp1).addReg(SHReg).addSImm(32);
1974 if (ISD::SHL_PARTS == opcode) {
1975 BuildMI(BB, PPC::SLW, 2, Tmp2).addReg(ShiftOpHi).addReg(SHReg);
1976 BuildMI(BB, PPC::SRW, 2, Tmp3).addReg(ShiftOpLo).addReg(Tmp1);
1977 BuildMI(BB, PPC::OR, 2, Tmp4).addReg(Tmp2).addReg(Tmp3);
1978 BuildMI(BB, PPC::ADDI, 2, Tmp5).addReg(SHReg).addSImm(-32);
Nate Begemanfa554702005-04-03 22:13:27 +00001979 BuildMI(BB, PPC::SLW, 2, Tmp6).addReg(ShiftOpLo).addReg(Tmp5);
Nate Begeman27eeb002005-04-02 05:59:34 +00001980 BuildMI(BB, PPC::OR, 2, Result+1).addReg(Tmp4).addReg(Tmp6);
1981 BuildMI(BB, PPC::SLW, 2, Result).addReg(ShiftOpLo).addReg(SHReg);
1982 } else if (ISD::SRL_PARTS == opcode) {
1983 BuildMI(BB, PPC::SRW, 2, Tmp2).addReg(ShiftOpLo).addReg(SHReg);
1984 BuildMI(BB, PPC::SLW, 2, Tmp3).addReg(ShiftOpHi).addReg(Tmp1);
1985 BuildMI(BB, PPC::OR, 2, Tmp4).addReg(Tmp2).addReg(Tmp3);
1986 BuildMI(BB, PPC::ADDI, 2, Tmp5).addReg(SHReg).addSImm(-32);
1987 BuildMI(BB, PPC::SRW, 2, Tmp6).addReg(ShiftOpHi).addReg(Tmp5);
1988 BuildMI(BB, PPC::OR, 2, Result).addReg(Tmp4).addReg(Tmp6);
1989 BuildMI(BB, PPC::SRW, 2, Result+1).addReg(ShiftOpHi).addReg(SHReg);
1990 } else {
1991 MachineBasicBlock *TmpMBB = new MachineBasicBlock(BB->getBasicBlock());
1992 MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock());
1993 MachineBasicBlock *OldMBB = BB;
1994 MachineFunction *F = BB->getParent();
1995 ilist<MachineBasicBlock>::iterator It = BB; ++It;
1996 F->getBasicBlockList().insert(It, TmpMBB);
1997 F->getBasicBlockList().insert(It, PhiMBB);
1998 BB->addSuccessor(TmpMBB);
1999 BB->addSuccessor(PhiMBB);
2000 BuildMI(BB, PPC::SRW, 2, Tmp2).addReg(ShiftOpLo).addReg(SHReg);
2001 BuildMI(BB, PPC::SLW, 2, Tmp3).addReg(ShiftOpHi).addReg(Tmp1);
2002 BuildMI(BB, PPC::OR, 2, Tmp4).addReg(Tmp2).addReg(Tmp3);
2003 BuildMI(BB, PPC::ADDICo, 2, Tmp5).addReg(SHReg).addSImm(-32);
2004 BuildMI(BB, PPC::SRAW, 2, Tmp6).addReg(ShiftOpHi).addReg(Tmp5);
2005 BuildMI(BB, PPC::SRAW, 2, Result+1).addReg(ShiftOpHi).addReg(SHReg);
2006 BuildMI(BB, PPC::BLE, 2).addReg(PPC::CR0).addMBB(PhiMBB);
2007 // Select correct least significant half if the shift amount > 32
2008 BB = TmpMBB;
2009 unsigned Tmp7 = MakeReg(MVT::i32);
2010 BuildMI(BB, PPC::OR, 2, Tmp7).addReg(Tmp6).addReg(Tmp6);
2011 TmpMBB->addSuccessor(PhiMBB);
2012 BB = PhiMBB;
2013 BuildMI(BB, PPC::PHI, 4, Result).addReg(Tmp4).addMBB(OldMBB)
2014 .addReg(Tmp7).addMBB(TmpMBB);
Nate Begemanca12a2b2005-03-28 22:28:37 +00002015 }
2016 return Result+N.ResNo;
2017 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002018
Nate Begemana9795f82005-03-24 04:41:43 +00002019 case ISD::FP_TO_UINT:
Nate Begeman6b559972005-04-01 02:59:27 +00002020 case ISD::FP_TO_SINT: {
2021 bool U = (ISD::FP_TO_UINT == opcode);
2022 Tmp1 = SelectExpr(N.getOperand(0));
2023 if (!U) {
2024 Tmp2 = MakeReg(MVT::f64);
2025 BuildMI(BB, PPC::FCTIWZ, 1, Tmp2).addReg(Tmp1);
2026 int FrameIdx = BB->getParent()->getFrameInfo()->CreateStackObject(8, 8);
2027 addFrameReference(BuildMI(BB, PPC::STFD, 3).addReg(Tmp2), FrameIdx);
2028 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Result), FrameIdx, 4);
2029 return Result;
2030 } else {
2031 unsigned Zero = getConstDouble(0.0);
2032 unsigned MaxInt = getConstDouble((1LL << 32) - 1);
2033 unsigned Border = getConstDouble(1LL << 31);
2034 unsigned UseZero = MakeReg(MVT::f64);
2035 unsigned UseMaxInt = MakeReg(MVT::f64);
2036 unsigned UseChoice = MakeReg(MVT::f64);
2037 unsigned TmpReg = MakeReg(MVT::f64);
2038 unsigned TmpReg2 = MakeReg(MVT::f64);
2039 unsigned ConvReg = MakeReg(MVT::f64);
2040 unsigned IntTmp = MakeReg(MVT::i32);
2041 unsigned XorReg = MakeReg(MVT::i32);
2042 MachineFunction *F = BB->getParent();
2043 int FrameIdx = F->getFrameInfo()->CreateStackObject(8, 8);
2044 // Update machine-CFG edges
2045 MachineBasicBlock *XorMBB = new MachineBasicBlock(BB->getBasicBlock());
2046 MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock());
2047 MachineBasicBlock *OldMBB = BB;
2048 ilist<MachineBasicBlock>::iterator It = BB; ++It;
2049 F->getBasicBlockList().insert(It, XorMBB);
2050 F->getBasicBlockList().insert(It, PhiMBB);
2051 BB->addSuccessor(XorMBB);
2052 BB->addSuccessor(PhiMBB);
2053 // Convert from floating point to unsigned 32-bit value
2054 // Use 0 if incoming value is < 0.0
2055 BuildMI(BB, PPC::FSEL, 3, UseZero).addReg(Tmp1).addReg(Tmp1).addReg(Zero);
2056 // Use 2**32 - 1 if incoming value is >= 2**32
2057 BuildMI(BB, PPC::FSUB, 2, UseMaxInt).addReg(MaxInt).addReg(Tmp1);
2058 BuildMI(BB, PPC::FSEL, 3, UseChoice).addReg(UseMaxInt).addReg(UseZero)
2059 .addReg(MaxInt);
2060 // Subtract 2**31
2061 BuildMI(BB, PPC::FSUB, 2, TmpReg).addReg(UseChoice).addReg(Border);
2062 // Use difference if >= 2**31
2063 BuildMI(BB, PPC::FCMPU, 2, PPC::CR0).addReg(UseChoice).addReg(Border);
2064 BuildMI(BB, PPC::FSEL, 3, TmpReg2).addReg(TmpReg).addReg(TmpReg)
2065 .addReg(UseChoice);
2066 // Convert to integer
2067 BuildMI(BB, PPC::FCTIWZ, 1, ConvReg).addReg(TmpReg2);
2068 addFrameReference(BuildMI(BB, PPC::STFD, 3).addReg(ConvReg), FrameIdx);
2069 addFrameReference(BuildMI(BB, PPC::LWZ, 2, IntTmp), FrameIdx, 4);
2070 BuildMI(BB, PPC::BLT, 2).addReg(PPC::CR0).addMBB(PhiMBB);
2071 BuildMI(BB, PPC::B, 1).addMBB(XorMBB);
2072
2073 // XorMBB:
2074 // add 2**31 if input was >= 2**31
2075 BB = XorMBB;
2076 BuildMI(BB, PPC::XORIS, 2, XorReg).addReg(IntTmp).addImm(0x8000);
2077 XorMBB->addSuccessor(PhiMBB);
2078
2079 // PhiMBB:
2080 // DestReg = phi [ IntTmp, OldMBB ], [ XorReg, XorMBB ]
2081 BB = PhiMBB;
2082 BuildMI(BB, PPC::PHI, 4, Result).addReg(IntTmp).addMBB(OldMBB)
2083 .addReg(XorReg).addMBB(XorMBB);
2084 return Result;
2085 }
2086 assert(0 && "Should never get here");
2087 return 0;
2088 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002089
Nate Begeman9e3e1b52005-03-24 23:35:30 +00002090 case ISD::SETCC:
Nate Begeman33162522005-03-29 21:54:38 +00002091 if (SetCCSDNode *SetCC = dyn_cast<SetCCSDNode>(Node)) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002092 if (ConstantSDNode *CN =
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002093 dyn_cast<ConstantSDNode>(SetCC->getOperand(1).Val)) {
Nate Begeman9765c252005-04-12 21:22:28 +00002094 // We can codegen setcc op, imm very efficiently compared to a brcond.
2095 // Check for those cases here.
2096 // setcc op, 0
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002097 if (CN->getValue() == 0) {
2098 Tmp1 = SelectExpr(SetCC->getOperand(0));
2099 switch (SetCC->getCondition()) {
Nate Begeman7bfba7d2005-04-14 09:45:08 +00002100 default: SetCC->dump(); assert(0 && "Unhandled SetCC condition"); abort();
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002101 case ISD::SETEQ:
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002102 Tmp2 = MakeReg(MVT::i32);
2103 BuildMI(BB, PPC::CNTLZW, 1, Tmp2).addReg(Tmp1);
2104 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp2).addImm(27)
2105 .addImm(5).addImm(31);
2106 break;
2107 case ISD::SETNE:
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002108 Tmp2 = MakeReg(MVT::i32);
2109 BuildMI(BB, PPC::ADDIC, 2, Tmp2).addReg(Tmp1).addSImm(-1);
2110 BuildMI(BB, PPC::SUBFE, 2, Result).addReg(Tmp2).addReg(Tmp1);
2111 break;
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002112 case ISD::SETLT:
2113 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp1).addImm(1)
2114 .addImm(31).addImm(31);
2115 break;
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002116 case ISD::SETGT:
2117 Tmp2 = MakeReg(MVT::i32);
2118 Tmp3 = MakeReg(MVT::i32);
2119 BuildMI(BB, PPC::NEG, 2, Tmp2).addReg(Tmp1);
2120 BuildMI(BB, PPC::ANDC, 2, Tmp3).addReg(Tmp2).addReg(Tmp1);
2121 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp3).addImm(1)
2122 .addImm(31).addImm(31);
2123 break;
Nate Begeman9765c252005-04-12 21:22:28 +00002124 }
2125 return Result;
2126 }
2127 // setcc op, -1
2128 if (CN->isAllOnesValue()) {
2129 Tmp1 = SelectExpr(SetCC->getOperand(0));
2130 switch (SetCC->getCondition()) {
2131 default: assert(0 && "Unhandled SetCC condition"); abort();
2132 case ISD::SETEQ:
2133 Tmp2 = MakeReg(MVT::i32);
2134 Tmp3 = MakeReg(MVT::i32);
2135 BuildMI(BB, PPC::ADDIC, 2, Tmp2).addReg(Tmp1).addSImm(1);
2136 BuildMI(BB, PPC::LI, 1, Tmp3).addSImm(0);
2137 BuildMI(BB, PPC::ADDZE, 1, Result).addReg(Tmp3);
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002138 break;
Nate Begeman9765c252005-04-12 21:22:28 +00002139 case ISD::SETNE:
2140 Tmp2 = MakeReg(MVT::i32);
2141 Tmp3 = MakeReg(MVT::i32);
2142 BuildMI(BB, PPC::NOR, 2, Tmp2).addReg(Tmp1).addReg(Tmp1);
2143 BuildMI(BB, PPC::ADDIC, 2, Tmp3).addReg(Tmp2).addSImm(-1);
2144 BuildMI(BB, PPC::SUBFE, 2, Result).addReg(Tmp3).addReg(Tmp2);
2145 break;
2146 case ISD::SETLT:
2147 Tmp2 = MakeReg(MVT::i32);
2148 Tmp3 = MakeReg(MVT::i32);
2149 BuildMI(BB, PPC::ADDI, 2, Tmp2).addReg(Tmp1).addSImm(1);
2150 BuildMI(BB, PPC::AND, 2, Tmp3).addReg(Tmp2).addReg(Tmp1);
2151 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp3).addImm(1)
2152 .addImm(31).addImm(31);
2153 break;
2154 case ISD::SETGT:
2155 Tmp2 = MakeReg(MVT::i32);
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002156 BuildMI(BB, PPC::RLWINM, 4, Tmp2).addReg(Tmp1).addImm(1)
2157 .addImm(31).addImm(31);
2158 BuildMI(BB, PPC::XORI, 2, Result).addReg(Tmp2).addImm(1);
2159 break;
2160 }
2161 return Result;
2162 }
2163 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002164
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00002165 bool Inv;
2166 unsigned CCReg = SelectCC(N, Opc, Inv, Tmp2);
2167 MoveCRtoGPR(CCReg, Inv, Tmp2, Result);
Nate Begeman33162522005-03-29 21:54:38 +00002168 return Result;
2169 }
2170 assert(0 && "Is this legal?");
2171 return 0;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002172
Nate Begeman74747862005-03-29 22:24:51 +00002173 case ISD::SELECT: {
Nate Begemana3fd4002005-07-19 16:51:05 +00002174 SetCCSDNode* SetCC = dyn_cast<SetCCSDNode>(N.getOperand(0).Val);
2175 if (SetCC && N.getOperand(0).getOpcode() == ISD::SETCC &&
2176 !MVT::isInteger(SetCC->getOperand(0).getValueType()) &&
2177 !MVT::isInteger(N.getOperand(1).getValueType()) &&
2178 !MVT::isInteger(N.getOperand(2).getValueType()) &&
2179 SetCC->getCondition() != ISD::SETEQ &&
2180 SetCC->getCondition() != ISD::SETNE) {
2181 MVT::ValueType VT = SetCC->getOperand(0).getValueType();
2182 unsigned TV = SelectExpr(N.getOperand(1)); // Use if TRUE
2183 unsigned FV = SelectExpr(N.getOperand(2)); // Use if FALSE
2184
2185 ConstantFPSDNode *CN = dyn_cast<ConstantFPSDNode>(SetCC->getOperand(1));
2186 if (CN && (CN->isExactlyValue(-0.0) || CN->isExactlyValue(0.0))) {
2187 switch(SetCC->getCondition()) {
2188 default: assert(0 && "Invalid FSEL condition"); abort();
2189 case ISD::SETULT:
2190 case ISD::SETLT:
2191 std::swap(TV, FV); // fsel is natively setge, swap operands for setlt
2192 case ISD::SETUGE:
2193 case ISD::SETGE:
2194 Tmp1 = SelectExpr(SetCC->getOperand(0)); // Val to compare against
2195 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp1).addReg(TV).addReg(FV);
2196 return Result;
2197 case ISD::SETUGT:
2198 case ISD::SETGT:
2199 std::swap(TV, FV); // fsel is natively setge, swap operands for setlt
2200 case ISD::SETULE:
2201 case ISD::SETLE: {
2202 if (SetCC->getOperand(0).getOpcode() == ISD::FNEG) {
2203 Tmp2 = SelectExpr(SetCC->getOperand(0).getOperand(0));
2204 } else {
2205 Tmp2 = MakeReg(VT);
2206 Tmp1 = SelectExpr(SetCC->getOperand(0)); // Val to compare against
2207 BuildMI(BB, PPC::FNEG, 1, Tmp2).addReg(Tmp1);
2208 }
2209 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp2).addReg(TV).addReg(FV);
2210 return Result;
2211 }
2212 }
2213 } else {
2214 Opc = (MVT::f64 == VT) ? PPC::FSUB : PPC::FSUBS;
2215 Tmp1 = SelectExpr(SetCC->getOperand(0)); // Val to compare against
2216 Tmp2 = SelectExpr(SetCC->getOperand(1));
2217 Tmp3 = MakeReg(VT);
2218 switch(SetCC->getCondition()) {
2219 default: assert(0 && "Invalid FSEL condition"); abort();
2220 case ISD::SETULT:
2221 case ISD::SETLT:
2222 BuildMI(BB, Opc, 2, Tmp3).addReg(Tmp1).addReg(Tmp2);
2223 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp3).addReg(FV).addReg(TV);
2224 return Result;
2225 case ISD::SETUGE:
2226 case ISD::SETGE:
2227 BuildMI(BB, Opc, 2, Tmp3).addReg(Tmp1).addReg(Tmp2);
2228 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp3).addReg(TV).addReg(FV);
2229 return Result;
2230 case ISD::SETUGT:
2231 case ISD::SETGT:
2232 BuildMI(BB, Opc, 2, Tmp3).addReg(Tmp2).addReg(Tmp1);
2233 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp3).addReg(FV).addReg(TV);
2234 return Result;
2235 case ISD::SETULE:
2236 case ISD::SETLE:
2237 BuildMI(BB, Opc, 2, Tmp3).addReg(Tmp2).addReg(Tmp1);
2238 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp3).addReg(TV).addReg(FV);
2239 return Result;
2240 }
2241 }
2242 assert(0 && "Should never get here");
2243 return 0;
2244 }
2245
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00002246 bool Inv;
Chris Lattner30710192005-04-01 07:10:02 +00002247 unsigned TrueValue = SelectExpr(N.getOperand(1)); //Use if TRUE
2248 unsigned FalseValue = SelectExpr(N.getOperand(2)); //Use if FALSE
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00002249 unsigned CCReg = SelectCC(N.getOperand(0), Opc, Inv, Tmp3);
Chris Lattner30710192005-04-01 07:10:02 +00002250
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002251 // Create an iterator with which to insert the MBB for copying the false
Nate Begeman74747862005-03-29 22:24:51 +00002252 // value and the MBB to hold the PHI instruction for this SetCC.
2253 MachineBasicBlock *thisMBB = BB;
2254 const BasicBlock *LLVM_BB = BB->getBasicBlock();
2255 ilist<MachineBasicBlock>::iterator It = BB;
2256 ++It;
2257
2258 // thisMBB:
2259 // ...
2260 // TrueVal = ...
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00002261 // cmpTY ccX, r1, r2
Nate Begeman74747862005-03-29 22:24:51 +00002262 // bCC copy1MBB
2263 // fallthrough --> copy0MBB
Nate Begeman74747862005-03-29 22:24:51 +00002264 MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB);
2265 MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB);
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00002266 BuildMI(BB, Opc, 2).addReg(CCReg).addMBB(sinkMBB);
Nate Begeman74747862005-03-29 22:24:51 +00002267 MachineFunction *F = BB->getParent();
2268 F->getBasicBlockList().insert(It, copy0MBB);
2269 F->getBasicBlockList().insert(It, sinkMBB);
2270 // Update machine-CFG edges
2271 BB->addSuccessor(copy0MBB);
2272 BB->addSuccessor(sinkMBB);
2273
2274 // copy0MBB:
2275 // %FalseValue = ...
2276 // # fallthrough to sinkMBB
2277 BB = copy0MBB;
Nate Begeman74747862005-03-29 22:24:51 +00002278 // Update machine-CFG edges
2279 BB->addSuccessor(sinkMBB);
2280
2281 // sinkMBB:
2282 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
2283 // ...
2284 BB = sinkMBB;
2285 BuildMI(BB, PPC::PHI, 4, Result).addReg(FalseValue)
2286 .addMBB(copy0MBB).addReg(TrueValue).addMBB(thisMBB);
Nate Begeman74747862005-03-29 22:24:51 +00002287 return Result;
2288 }
Nate Begemana9795f82005-03-24 04:41:43 +00002289
2290 case ISD::Constant:
2291 switch (N.getValueType()) {
2292 default: assert(0 && "Cannot use constants of this type!");
2293 case MVT::i1:
2294 BuildMI(BB, PPC::LI, 1, Result)
2295 .addSImm(!cast<ConstantSDNode>(N)->isNullValue());
2296 break;
2297 case MVT::i32:
2298 {
2299 int v = (int)cast<ConstantSDNode>(N)->getSignExtended();
2300 if (v < 32768 && v >= -32768) {
2301 BuildMI(BB, PPC::LI, 1, Result).addSImm(v);
2302 } else {
Nate Begeman5e966612005-03-24 06:28:42 +00002303 Tmp1 = MakeReg(MVT::i32);
2304 BuildMI(BB, PPC::LIS, 1, Tmp1).addSImm(v >> 16);
2305 BuildMI(BB, PPC::ORI, 2, Result).addReg(Tmp1).addImm(v & 0xFFFF);
Nate Begemana9795f82005-03-24 04:41:43 +00002306 }
2307 }
2308 }
2309 return Result;
Nate Begemana3fd4002005-07-19 16:51:05 +00002310
2311 case ISD::ConstantFP: {
2312 ConstantFPSDNode *CN = cast<ConstantFPSDNode>(N);
2313 Result = getConstDouble(CN->getValue(), Result);
2314 return Result;
Nate Begemana9795f82005-03-24 04:41:43 +00002315 }
2316
Nate Begemana3fd4002005-07-19 16:51:05 +00002317 case ISD::FNEG:
2318 if (!NoExcessFPPrecision &&
2319 ISD::ADD == N.getOperand(0).getOpcode() &&
2320 N.getOperand(0).Val->hasOneUse() &&
2321 ISD::MUL == N.getOperand(0).getOperand(0).getOpcode() &&
2322 N.getOperand(0).getOperand(0).Val->hasOneUse()) {
2323 ++FusedFP; // Statistic
2324 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0).getOperand(0));
2325 Tmp2 = SelectExpr(N.getOperand(0).getOperand(0).getOperand(1));
2326 Tmp3 = SelectExpr(N.getOperand(0).getOperand(1));
2327 Opc = DestType == MVT::f64 ? PPC::FNMADD : PPC::FNMADDS;
2328 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
2329 } else if (!NoExcessFPPrecision &&
2330 ISD::ADD == N.getOperand(0).getOpcode() &&
2331 N.getOperand(0).Val->hasOneUse() &&
2332 ISD::MUL == N.getOperand(0).getOperand(1).getOpcode() &&
2333 N.getOperand(0).getOperand(1).Val->hasOneUse()) {
2334 ++FusedFP; // Statistic
2335 Tmp1 = SelectExpr(N.getOperand(0).getOperand(1).getOperand(0));
2336 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1).getOperand(1));
2337 Tmp3 = SelectExpr(N.getOperand(0).getOperand(0));
2338 Opc = DestType == MVT::f64 ? PPC::FNMADD : PPC::FNMADDS;
2339 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
2340 } else if (ISD::FABS == N.getOperand(0).getOpcode()) {
2341 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
2342 BuildMI(BB, PPC::FNABS, 1, Result).addReg(Tmp1);
2343 } else {
2344 Tmp1 = SelectExpr(N.getOperand(0));
2345 BuildMI(BB, PPC::FNEG, 1, Result).addReg(Tmp1);
2346 }
2347 return Result;
2348
2349 case ISD::FABS:
2350 Tmp1 = SelectExpr(N.getOperand(0));
2351 BuildMI(BB, PPC::FABS, 1, Result).addReg(Tmp1);
2352 return Result;
2353
Nate Begemanadeb43d2005-07-20 22:42:00 +00002354 case ISD::FSQRT:
2355 Tmp1 = SelectExpr(N.getOperand(0));
2356 Opc = DestType == MVT::f64 ? PPC::FSQRT : PPC::FSQRTS;
2357 BuildMI(BB, Opc, 1, Result).addReg(Tmp1);
2358 return Result;
2359
Nate Begemana3fd4002005-07-19 16:51:05 +00002360 case ISD::FP_ROUND:
2361 assert (DestType == MVT::f32 &&
2362 N.getOperand(0).getValueType() == MVT::f64 &&
2363 "only f64 to f32 conversion supported here");
2364 Tmp1 = SelectExpr(N.getOperand(0));
2365 BuildMI(BB, PPC::FRSP, 1, Result).addReg(Tmp1);
2366 return Result;
2367
2368 case ISD::FP_EXTEND:
2369 assert (DestType == MVT::f64 &&
2370 N.getOperand(0).getValueType() == MVT::f32 &&
2371 "only f32 to f64 conversion supported here");
2372 Tmp1 = SelectExpr(N.getOperand(0));
2373 BuildMI(BB, PPC::FMR, 1, Result).addReg(Tmp1);
2374 return Result;
2375
2376 case ISD::UINT_TO_FP:
2377 case ISD::SINT_TO_FP: {
2378 assert (N.getOperand(0).getValueType() == MVT::i32
2379 && "int to float must operate on i32");
2380 bool IsUnsigned = (ISD::UINT_TO_FP == opcode);
2381 Tmp1 = SelectExpr(N.getOperand(0)); // Get the operand register
2382 Tmp2 = MakeReg(MVT::f64); // temp reg to load the integer value into
2383 Tmp3 = MakeReg(MVT::i32); // temp reg to hold the conversion constant
2384
2385 int FrameIdx = BB->getParent()->getFrameInfo()->CreateStackObject(8, 8);
2386 MachineConstantPool *CP = BB->getParent()->getConstantPool();
2387
2388 if (IsUnsigned) {
2389 unsigned ConstF = getConstDouble(0x1.000000p52);
2390 // Store the hi & low halves of the fp value, currently in int regs
2391 BuildMI(BB, PPC::LIS, 1, Tmp3).addSImm(0x4330);
2392 addFrameReference(BuildMI(BB, PPC::STW, 3).addReg(Tmp3), FrameIdx);
2393 addFrameReference(BuildMI(BB, PPC::STW, 3).addReg(Tmp1), FrameIdx, 4);
2394 addFrameReference(BuildMI(BB, PPC::LFD, 2, Tmp2), FrameIdx);
2395 // Generate the return value with a subtract
2396 BuildMI(BB, PPC::FSUB, 2, Result).addReg(Tmp2).addReg(ConstF);
2397 } else {
2398 unsigned ConstF = getConstDouble(0x1.000008p52);
2399 unsigned TmpL = MakeReg(MVT::i32);
2400 // Store the hi & low halves of the fp value, currently in int regs
2401 BuildMI(BB, PPC::LIS, 1, Tmp3).addSImm(0x4330);
2402 addFrameReference(BuildMI(BB, PPC::STW, 3).addReg(Tmp3), FrameIdx);
2403 BuildMI(BB, PPC::XORIS, 2, TmpL).addReg(Tmp1).addImm(0x8000);
2404 addFrameReference(BuildMI(BB, PPC::STW, 3).addReg(TmpL), FrameIdx, 4);
2405 addFrameReference(BuildMI(BB, PPC::LFD, 2, Tmp2), FrameIdx);
2406 // Generate the return value with a subtract
2407 BuildMI(BB, PPC::FSUB, 2, Result).addReg(Tmp2).addReg(ConstF);
2408 }
2409 return Result;
2410 }
2411 }
Nate Begemana9795f82005-03-24 04:41:43 +00002412 return 0;
2413}
2414
2415void ISel::Select(SDOperand N) {
Nate Begeman2497e632005-07-21 20:44:43 +00002416 unsigned Tmp1, Tmp2, Tmp3, Opc;
Nate Begemana9795f82005-03-24 04:41:43 +00002417 unsigned opcode = N.getOpcode();
2418
2419 if (!ExprMap.insert(std::make_pair(N, 1)).second)
2420 return; // Already selected.
2421
2422 SDNode *Node = N.Val;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002423
Nate Begemana9795f82005-03-24 04:41:43 +00002424 switch (Node->getOpcode()) {
2425 default:
2426 Node->dump(); std::cerr << "\n";
2427 assert(0 && "Node not handled yet!");
2428 case ISD::EntryToken: return; // Noop
2429 case ISD::TokenFactor:
2430 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
2431 Select(Node->getOperand(i));
2432 return;
Chris Lattner16cd04d2005-05-12 23:24:06 +00002433 case ISD::CALLSEQ_START:
2434 case ISD::CALLSEQ_END:
Nate Begemana9795f82005-03-24 04:41:43 +00002435 Select(N.getOperand(0));
2436 Tmp1 = cast<ConstantSDNode>(N.getOperand(1))->getValue();
Chris Lattner16cd04d2005-05-12 23:24:06 +00002437 Opc = N.getOpcode() == ISD::CALLSEQ_START ? PPC::ADJCALLSTACKDOWN :
Nate Begemana9795f82005-03-24 04:41:43 +00002438 PPC::ADJCALLSTACKUP;
2439 BuildMI(BB, Opc, 1).addImm(Tmp1);
2440 return;
2441 case ISD::BR: {
2442 MachineBasicBlock *Dest =
2443 cast<BasicBlockSDNode>(N.getOperand(1))->getBasicBlock();
Nate Begemana9795f82005-03-24 04:41:43 +00002444 Select(N.getOperand(0));
2445 BuildMI(BB, PPC::B, 1).addMBB(Dest);
2446 return;
2447 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002448 case ISD::BRCOND:
Nate Begemancd08e4c2005-04-09 20:09:12 +00002449 case ISD::BRCONDTWOWAY:
Nate Begemana9795f82005-03-24 04:41:43 +00002450 SelectBranchCC(N);
2451 return;
2452 case ISD::CopyToReg:
2453 Select(N.getOperand(0));
2454 Tmp1 = SelectExpr(N.getOperand(1));
2455 Tmp2 = cast<RegSDNode>(N)->getReg();
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002456
Nate Begemana9795f82005-03-24 04:41:43 +00002457 if (Tmp1 != Tmp2) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002458 if (N.getOperand(1).getValueType() == MVT::f64 ||
Nate Begemana9795f82005-03-24 04:41:43 +00002459 N.getOperand(1).getValueType() == MVT::f32)
2460 BuildMI(BB, PPC::FMR, 1, Tmp2).addReg(Tmp1);
2461 else
2462 BuildMI(BB, PPC::OR, 2, Tmp2).addReg(Tmp1).addReg(Tmp1);
2463 }
2464 return;
2465 case ISD::ImplicitDef:
2466 Select(N.getOperand(0));
2467 BuildMI(BB, PPC::IMPLICIT_DEF, 0, cast<RegSDNode>(N)->getReg());
2468 return;
2469 case ISD::RET:
2470 switch (N.getNumOperands()) {
2471 default:
2472 assert(0 && "Unknown return instruction!");
2473 case 3:
2474 assert(N.getOperand(1).getValueType() == MVT::i32 &&
2475 N.getOperand(2).getValueType() == MVT::i32 &&
Misha Brukman7847fca2005-04-22 17:54:37 +00002476 "Unknown two-register value!");
Nate Begemana9795f82005-03-24 04:41:43 +00002477 Select(N.getOperand(0));
2478 Tmp1 = SelectExpr(N.getOperand(1));
2479 Tmp2 = SelectExpr(N.getOperand(2));
Nate Begeman27523a12005-04-02 00:42:16 +00002480 BuildMI(BB, PPC::OR, 2, PPC::R3).addReg(Tmp2).addReg(Tmp2);
2481 BuildMI(BB, PPC::OR, 2, PPC::R4).addReg(Tmp1).addReg(Tmp1);
Nate Begemana9795f82005-03-24 04:41:43 +00002482 break;
2483 case 2:
2484 Select(N.getOperand(0));
2485 Tmp1 = SelectExpr(N.getOperand(1));
2486 switch (N.getOperand(1).getValueType()) {
2487 default:
2488 assert(0 && "Unknown return type!");
2489 case MVT::f64:
2490 case MVT::f32:
2491 BuildMI(BB, PPC::FMR, 1, PPC::F1).addReg(Tmp1);
2492 break;
2493 case MVT::i32:
2494 BuildMI(BB, PPC::OR, 2, PPC::R3).addReg(Tmp1).addReg(Tmp1);
2495 break;
2496 }
Nate Begeman9e3e1b52005-03-24 23:35:30 +00002497 case 1:
2498 Select(N.getOperand(0));
2499 break;
Nate Begemana9795f82005-03-24 04:41:43 +00002500 }
2501 BuildMI(BB, PPC::BLR, 0); // Just emit a 'ret' instruction
2502 return;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002503 case ISD::TRUNCSTORE:
Nate Begeman2497e632005-07-21 20:44:43 +00002504 case ISD::STORE: {
2505 SDOperand Chain = N.getOperand(0);
2506 SDOperand Value = N.getOperand(1);
2507 SDOperand Address = N.getOperand(2);
2508 Select(Chain);
Nate Begemana9795f82005-03-24 04:41:43 +00002509
Nate Begeman2497e632005-07-21 20:44:43 +00002510 Tmp1 = SelectExpr(Value); //value
Nate Begemana9795f82005-03-24 04:41:43 +00002511
Nate Begeman2497e632005-07-21 20:44:43 +00002512 if (opcode == ISD::STORE) {
2513 switch(Value.getValueType()) {
2514 default: assert(0 && "unknown Type in store");
2515 case MVT::i32: Opc = PPC::STW; break;
2516 case MVT::f64: Opc = PPC::STFD; break;
2517 case MVT::f32: Opc = PPC::STFS; break;
Nate Begemana9795f82005-03-24 04:41:43 +00002518 }
Nate Begeman2497e632005-07-21 20:44:43 +00002519 } else { //ISD::TRUNCSTORE
2520 switch(cast<VTSDNode>(Node->getOperand(4))->getVT()) {
2521 default: assert(0 && "unknown Type in store");
2522 case MVT::i1:
2523 case MVT::i8: Opc = PPC::STB; break;
2524 case MVT::i16: Opc = PPC::STH; break;
Nate Begemana9795f82005-03-24 04:41:43 +00002525 }
Nate Begemana9795f82005-03-24 04:41:43 +00002526 }
Nate Begeman2497e632005-07-21 20:44:43 +00002527
2528 if(Address.getOpcode() == ISD::FrameIndex) {
2529 Tmp2 = cast<FrameIndexSDNode>(Address)->getIndex();
2530 addFrameReference(BuildMI(BB, Opc, 3).addReg(Tmp1), (int)Tmp2);
2531 } else if(GlobalAddressSDNode *GN = dyn_cast<GlobalAddressSDNode>(Address)){
2532 GlobalValue *GV = GN->getGlobal();
2533 Tmp2 = MakeReg(MVT::i32);
2534 if (PICEnabled)
2535 BuildMI(BB, PPC::ADDIS, 2, Tmp2).addReg(getGlobalBaseReg())
2536 .addGlobalAddress(GV);
2537 else
Chris Lattner4015ea82005-07-28 04:42:11 +00002538 BuildMI(BB, PPC::LIS, 1, Tmp2).addGlobalAddress(GV);
Nate Begeman2497e632005-07-21 20:44:43 +00002539 if (GV->hasWeakLinkage() || GV->isExternal()) {
2540 Tmp3 = MakeReg(MVT::i32);
2541 BuildMI(BB, PPC::LWZ, 2, Tmp3).addGlobalAddress(GV).addReg(Tmp2);
Nate Begeman7b4f0a82005-07-25 21:15:28 +00002542 BuildMI(BB, Opc, 3).addReg(Tmp1).addSImm(0).addReg(Tmp3);
2543 } else {
2544 BuildMI(BB, Opc, 3).addReg(Tmp1).addGlobalAddress(GV).addReg(Tmp2);
Nate Begeman2497e632005-07-21 20:44:43 +00002545 }
Nate Begeman2497e632005-07-21 20:44:43 +00002546 } else {
2547 int offset;
Nate Begeman2a05c8e2005-07-28 03:02:05 +00002548 switch(SelectAddr(Address, Tmp2, offset)) {
2549 default: assert(0 && "Unhandled return value from SelectAddr");
2550 case 0: // imm offset, no frame, no index
2551 BuildMI(BB, Opc, 3).addReg(Tmp1).addSImm(offset).addReg(Tmp2);
2552 break;
2553 case 1: // imm offset + frame index
2554 addFrameReference(BuildMI(BB, Opc, 3).addReg(Tmp1), (int)Tmp2, offset);
2555 break;
2556 case 2: // base+index addressing
Nate Begeman2497e632005-07-21 20:44:43 +00002557 Opc = IndexedOpForOp(Opc);
2558 BuildMI(BB, Opc, 3).addReg(Tmp1).addReg(Tmp2).addReg(offset);
Nate Begeman2a05c8e2005-07-28 03:02:05 +00002559 break;
Nate Begeman2497e632005-07-21 20:44:43 +00002560 }
2561 }
2562 return;
2563 }
Nate Begemana9795f82005-03-24 04:41:43 +00002564 case ISD::EXTLOAD:
2565 case ISD::SEXTLOAD:
2566 case ISD::ZEXTLOAD:
2567 case ISD::LOAD:
2568 case ISD::CopyFromReg:
Chris Lattnerb5d8e6e2005-05-13 20:29:26 +00002569 case ISD::TAILCALL:
Nate Begemana9795f82005-03-24 04:41:43 +00002570 case ISD::CALL:
2571 case ISD::DYNAMIC_STACKALLOC:
2572 ExprMap.erase(N);
2573 SelectExpr(N);
2574 return;
2575 }
2576 assert(0 && "Should not be reached!");
2577}
2578
2579
2580/// createPPC32PatternInstructionSelector - This pass converts an LLVM function
2581/// into a machine code representation using pattern matching and a machine
2582/// description file.
2583///
2584FunctionPass *llvm::createPPC32ISelPattern(TargetMachine &TM) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002585 return new ISel(TM);
Chris Lattner246fa632005-03-24 06:16:18 +00002586}
2587