blob: 095afc647a9ea18c3c926b8ea7fe6ba1a959f74d [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
Chris Lattner59b21c22005-08-09 18:29:55 +0000638// isIntImmediate - This method tests to see if a constant operand.
Chris Lattnercf1cf182005-08-08 21:10:27 +0000639// If so Imm will receive the 32 bit value.
Chris Lattner59b21c22005-08-09 18:29:55 +0000640static bool isIntImmediate(SDOperand N, unsigned& Imm) {
Chris Lattnercf1cf182005-08-08 21:10:27 +0000641 // test for constant
Chris Lattner59b21c22005-08-09 18:29:55 +0000642 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N)) {
Chris Lattnercf1cf182005-08-08 21:10:27 +0000643 // retrieve value
Chris Lattner59b21c22005-08-09 18:29:55 +0000644 Imm = (unsigned)CN->getSignExtended();
Chris Lattnercf1cf182005-08-08 21:10:27 +0000645 // 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) &&
Chris Lattner59b21c22005-08-09 18:29:55 +0000657 isIntImmediate(N.getOperand(1), SH) && SH < 32;
Chris Lattnercf1cf182005-08-08 21:10:27 +0000658}
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 &&
Chris Lattner59b21c22005-08-09 18:29:55 +0000664 isIntImmediate(N.getOperand(1), Imm) && (signed)Imm == -1;
Chris Lattnercf1cf182005-08-08 21:10:27 +0000665}
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 Begemanc7bd4822005-04-11 06:34:10 +0000676/// NodeHasRecordingVariant - If SelectExpr can always produce code for
677/// NodeOpcode that also sets CR0 as a side effect, return true. Otherwise,
678/// return false.
679static bool NodeHasRecordingVariant(unsigned NodeOpcode) {
680 switch(NodeOpcode) {
681 default: return false;
682 case ISD::AND:
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000683 case ISD::OR:
Chris Lattner519f40b2005-04-13 02:46:17 +0000684 return true;
Nate Begemanc7bd4822005-04-11 06:34:10 +0000685 }
686}
687
Nate Begeman3e897162005-03-31 23:55:40 +0000688/// getBCCForSetCC - Returns the PowerPC condition branch mnemonic corresponding
689/// to Condition. If the Condition is unordered or unsigned, the bool argument
690/// U is set to true, otherwise it is set to false.
691static unsigned getBCCForSetCC(unsigned Condition, bool& U) {
692 U = false;
693 switch (Condition) {
694 default: assert(0 && "Unknown condition!"); abort();
695 case ISD::SETEQ: return PPC::BEQ;
696 case ISD::SETNE: return PPC::BNE;
697 case ISD::SETULT: U = true;
698 case ISD::SETLT: return PPC::BLT;
699 case ISD::SETULE: U = true;
700 case ISD::SETLE: return PPC::BLE;
701 case ISD::SETUGT: U = true;
702 case ISD::SETGT: return PPC::BGT;
703 case ISD::SETUGE: U = true;
704 case ISD::SETGE: return PPC::BGE;
705 }
Nate Begeman04730362005-04-01 04:45:11 +0000706 return 0;
707}
708
Nate Begeman7bfba7d2005-04-14 09:45:08 +0000709/// getCROpForOp - Return the condition register opcode (or inverted opcode)
710/// associated with the SelectionDAG opcode.
711static unsigned getCROpForSetCC(unsigned Opcode, bool Inv1, bool Inv2) {
712 switch (Opcode) {
713 default: assert(0 && "Unknown opcode!"); abort();
714 case ISD::AND:
715 if (Inv1 && Inv2) return PPC::CRNOR; // De Morgan's Law
716 if (!Inv1 && !Inv2) return PPC::CRAND;
717 if (Inv1 ^ Inv2) return PPC::CRANDC;
718 case ISD::OR:
719 if (Inv1 && Inv2) return PPC::CRNAND; // De Morgan's Law
720 if (!Inv1 && !Inv2) return PPC::CROR;
721 if (Inv1 ^ Inv2) return PPC::CRORC;
722 }
723 return 0;
724}
725
726/// getCRIdxForSetCC - Return the index of the condition register field
727/// associated with the SetCC condition, and whether or not the field is
728/// treated as inverted. That is, lt = 0; ge = 0 inverted.
729static unsigned getCRIdxForSetCC(unsigned Condition, bool& Inv) {
730 switch (Condition) {
731 default: assert(0 && "Unknown condition!"); abort();
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000732 case ISD::SETULT:
Nate Begeman7bfba7d2005-04-14 09:45:08 +0000733 case ISD::SETLT: Inv = false; return 0;
734 case ISD::SETUGE:
735 case ISD::SETGE: Inv = true; return 0;
736 case ISD::SETUGT:
737 case ISD::SETGT: Inv = false; return 1;
738 case ISD::SETULE:
739 case ISD::SETLE: Inv = true; return 1;
740 case ISD::SETEQ: Inv = false; return 2;
741 case ISD::SETNE: Inv = true; return 2;
742 }
743 return 0;
744}
745
Nate Begeman04730362005-04-01 04:45:11 +0000746/// IndexedOpForOp - Return the indexed variant for each of the PowerPC load
747/// and store immediate instructions.
748static unsigned IndexedOpForOp(unsigned Opcode) {
749 switch(Opcode) {
750 default: assert(0 && "Unknown opcode!"); abort();
751 case PPC::LBZ: return PPC::LBZX; case PPC::STB: return PPC::STBX;
752 case PPC::LHZ: return PPC::LHZX; case PPC::STH: return PPC::STHX;
753 case PPC::LHA: return PPC::LHAX; case PPC::STW: return PPC::STWX;
754 case PPC::LWZ: return PPC::LWZX; case PPC::STFS: return PPC::STFSX;
755 case PPC::LFS: return PPC::LFSX; case PPC::STFD: return PPC::STFDX;
756 case PPC::LFD: return PPC::LFDX;
757 }
758 return 0;
Nate Begeman3e897162005-03-31 23:55:40 +0000759}
Nate Begeman815d6da2005-04-06 00:25:27 +0000760
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000761// Structure used to return the necessary information to codegen an SDIV as
Nate Begeman815d6da2005-04-06 00:25:27 +0000762// a multiply.
763struct ms {
764 int m; // magic number
765 int s; // shift amount
766};
767
768struct mu {
769 unsigned int m; // magic number
770 int a; // add indicator
771 int s; // shift amount
772};
773
774/// magic - calculate the magic numbers required to codegen an integer sdiv as
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000775/// a sequence of multiply and shifts. Requires that the divisor not be 0, 1,
Nate Begeman815d6da2005-04-06 00:25:27 +0000776/// or -1.
777static struct ms magic(int d) {
778 int p;
779 unsigned int ad, anc, delta, q1, r1, q2, r2, t;
Chris Lattner0561b3f2005-08-02 19:26:06 +0000780 const unsigned int two31 = 0x80000000U;
Nate Begeman815d6da2005-04-06 00:25:27 +0000781 struct ms mag;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000782
Nate Begeman815d6da2005-04-06 00:25:27 +0000783 ad = abs(d);
784 t = two31 + ((unsigned int)d >> 31);
785 anc = t - 1 - t%ad; // absolute value of nc
786 p = 31; // initialize p
787 q1 = two31/anc; // initialize q1 = 2p/abs(nc)
788 r1 = two31 - q1*anc; // initialize r1 = rem(2p,abs(nc))
789 q2 = two31/ad; // initialize q2 = 2p/abs(d)
790 r2 = two31 - q2*ad; // initialize r2 = rem(2p,abs(d))
791 do {
792 p = p + 1;
793 q1 = 2*q1; // update q1 = 2p/abs(nc)
794 r1 = 2*r1; // update r1 = rem(2p/abs(nc))
795 if (r1 >= anc) { // must be unsigned comparison
796 q1 = q1 + 1;
797 r1 = r1 - anc;
798 }
799 q2 = 2*q2; // update q2 = 2p/abs(d)
800 r2 = 2*r2; // update r2 = rem(2p/abs(d))
801 if (r2 >= ad) { // must be unsigned comparison
802 q2 = q2 + 1;
803 r2 = r2 - ad;
804 }
805 delta = ad - r2;
806 } while (q1 < delta || (q1 == delta && r1 == 0));
807
808 mag.m = q2 + 1;
809 if (d < 0) mag.m = -mag.m; // resulting magic number
810 mag.s = p - 32; // resulting shift
811 return mag;
812}
813
814/// magicu - calculate the magic numbers required to codegen an integer udiv as
815/// a sequence of multiply, add and shifts. Requires that the divisor not be 0.
816static struct mu magicu(unsigned d)
817{
818 int p;
819 unsigned int nc, delta, q1, r1, q2, r2;
820 struct mu magu;
821 magu.a = 0; // initialize "add" indicator
822 nc = - 1 - (-d)%d;
823 p = 31; // initialize p
824 q1 = 0x80000000/nc; // initialize q1 = 2p/nc
825 r1 = 0x80000000 - q1*nc; // initialize r1 = rem(2p,nc)
826 q2 = 0x7FFFFFFF/d; // initialize q2 = (2p-1)/d
827 r2 = 0x7FFFFFFF - q2*d; // initialize r2 = rem((2p-1),d)
828 do {
829 p = p + 1;
830 if (r1 >= nc - r1 ) {
831 q1 = 2*q1 + 1; // update q1
832 r1 = 2*r1 - nc; // update r1
833 }
834 else {
835 q1 = 2*q1; // update q1
836 r1 = 2*r1; // update r1
837 }
838 if (r2 + 1 >= d - r2) {
839 if (q2 >= 0x7FFFFFFF) magu.a = 1;
840 q2 = 2*q2 + 1; // update q2
841 r2 = 2*r2 + 1 - d; // update r2
842 }
843 else {
844 if (q2 >= 0x80000000) magu.a = 1;
845 q2 = 2*q2; // update q2
846 r2 = 2*r2 + 1; // update r2
847 }
848 delta = d - 1 - r2;
849 } while (p < 64 && (q1 < delta || (q1 == delta && r1 == 0)));
850 magu.m = q2 + 1; // resulting magic number
851 magu.s = p - 32; // resulting shift
852 return magu;
853}
854}
855
856/// BuildSDIVSequence - Given an ISD::SDIV node expressing a divide by constant,
857/// return a DAG expression to select that will generate the same value by
858/// multiplying by a magic number. See:
859/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
860SDOperand ISel::BuildSDIVSequence(SDOperand N) {
861 int d = (int)cast<ConstantSDNode>(N.getOperand(1))->getSignExtended();
862 ms magics = magic(d);
863 // Multiply the numerator (operand 0) by the magic value
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000864 SDOperand Q = ISelDAG->getNode(ISD::MULHS, MVT::i32, N.getOperand(0),
Nate Begeman815d6da2005-04-06 00:25:27 +0000865 ISelDAG->getConstant(magics.m, MVT::i32));
866 // If d > 0 and m < 0, add the numerator
867 if (d > 0 && magics.m < 0)
868 Q = ISelDAG->getNode(ISD::ADD, MVT::i32, Q, N.getOperand(0));
869 // If d < 0 and m > 0, subtract the numerator.
870 if (d < 0 && magics.m > 0)
871 Q = ISelDAG->getNode(ISD::SUB, MVT::i32, Q, N.getOperand(0));
872 // Shift right algebraic if shift value is nonzero
873 if (magics.s > 0)
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000874 Q = ISelDAG->getNode(ISD::SRA, MVT::i32, Q,
Nate Begeman815d6da2005-04-06 00:25:27 +0000875 ISelDAG->getConstant(magics.s, MVT::i32));
876 // Extract the sign bit and add it to the quotient
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000877 SDOperand T =
Nate Begeman815d6da2005-04-06 00:25:27 +0000878 ISelDAG->getNode(ISD::SRL, MVT::i32, Q, ISelDAG->getConstant(31, MVT::i32));
Nate Begeman27b4c232005-04-06 06:44:57 +0000879 return ISelDAG->getNode(ISD::ADD, MVT::i32, Q, T);
Nate Begeman815d6da2005-04-06 00:25:27 +0000880}
881
882/// BuildUDIVSequence - Given an ISD::UDIV node expressing a divide by constant,
883/// return a DAG expression to select that will generate the same value by
884/// multiplying by a magic number. See:
885/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
886SDOperand ISel::BuildUDIVSequence(SDOperand N) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000887 unsigned d =
Nate Begeman815d6da2005-04-06 00:25:27 +0000888 (unsigned)cast<ConstantSDNode>(N.getOperand(1))->getSignExtended();
889 mu magics = magicu(d);
890 // Multiply the numerator (operand 0) by the magic value
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000891 SDOperand Q = ISelDAG->getNode(ISD::MULHU, MVT::i32, N.getOperand(0),
Nate Begeman815d6da2005-04-06 00:25:27 +0000892 ISelDAG->getConstant(magics.m, MVT::i32));
893 if (magics.a == 0) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000894 Q = ISelDAG->getNode(ISD::SRL, MVT::i32, Q,
Nate Begeman815d6da2005-04-06 00:25:27 +0000895 ISelDAG->getConstant(magics.s, MVT::i32));
896 } else {
897 SDOperand NPQ = ISelDAG->getNode(ISD::SUB, MVT::i32, N.getOperand(0), Q);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000898 NPQ = ISelDAG->getNode(ISD::SRL, MVT::i32, NPQ,
Nate Begeman815d6da2005-04-06 00:25:27 +0000899 ISelDAG->getConstant(1, MVT::i32));
900 NPQ = ISelDAG->getNode(ISD::ADD, MVT::i32, NPQ, Q);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000901 Q = ISelDAG->getNode(ISD::SRL, MVT::i32, NPQ,
Nate Begeman815d6da2005-04-06 00:25:27 +0000902 ISelDAG->getConstant(magics.s-1, MVT::i32));
903 }
Nate Begeman27b4c232005-04-06 06:44:57 +0000904 return Q;
Nate Begemana9795f82005-03-24 04:41:43 +0000905}
906
Nate Begemanc7b09f12005-03-25 08:34:25 +0000907/// getGlobalBaseReg - Output the instructions required to put the
908/// base address to use for accessing globals into a register.
909///
910unsigned ISel::getGlobalBaseReg() {
911 if (!GlobalBaseInitialized) {
912 // Insert the set of GlobalBaseReg into the first MBB of the function
913 MachineBasicBlock &FirstMBB = BB->getParent()->front();
914 MachineBasicBlock::iterator MBBI = FirstMBB.begin();
915 GlobalBaseReg = MakeReg(MVT::i32);
916 BuildMI(FirstMBB, MBBI, PPC::MovePCtoLR, 0, PPC::LR);
917 BuildMI(FirstMBB, MBBI, PPC::MFLR, 1, GlobalBaseReg).addReg(PPC::LR);
918 GlobalBaseInitialized = true;
919 }
920 return GlobalBaseReg;
921}
922
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000923/// getConstDouble - Loads a floating point value into a register, via the
Nate Begeman6b559972005-04-01 02:59:27 +0000924/// Constant Pool. Optionally takes a register in which to load the value.
925unsigned ISel::getConstDouble(double doubleVal, unsigned Result=0) {
926 unsigned Tmp1 = MakeReg(MVT::i32);
927 if (0 == Result) Result = MakeReg(MVT::f64);
928 MachineConstantPool *CP = BB->getParent()->getConstantPool();
929 ConstantFP *CFP = ConstantFP::get(Type::DoubleTy, doubleVal);
930 unsigned CPI = CP->getConstantPoolIndex(CFP);
Nate Begeman2497e632005-07-21 20:44:43 +0000931 if (PICEnabled)
932 BuildMI(BB, PPC::ADDIS, 2, Tmp1).addReg(getGlobalBaseReg())
933 .addConstantPoolIndex(CPI);
934 else
935 BuildMI(BB, PPC::LIS, 1, Tmp1).addConstantPoolIndex(CPI);
Nate Begeman6b559972005-04-01 02:59:27 +0000936 BuildMI(BB, PPC::LFD, 2, Result).addConstantPoolIndex(CPI).addReg(Tmp1);
937 return Result;
938}
939
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000940/// MoveCRtoGPR - Move CCReg[Idx] to the least significant bit of Result. If
Nate Begeman1cbf3ab2005-04-18 07:48:09 +0000941/// Inv is true, then invert the result.
942void ISel::MoveCRtoGPR(unsigned CCReg, bool Inv, unsigned Idx, unsigned Result){
943 unsigned IntCR = MakeReg(MVT::i32);
944 BuildMI(BB, PPC::MCRF, 1, PPC::CR7).addReg(CCReg);
Chris Lattner3c304a32005-08-05 22:05:03 +0000945 bool GPOpt =
946 TLI.getTargetMachine().getSubtarget<PPCSubtarget>().isGigaProcessor();
947 BuildMI(BB, GPOpt ? PPC::MFOCRF : PPC::MFCR, 1, IntCR).addReg(PPC::CR7);
Nate Begeman1cbf3ab2005-04-18 07:48:09 +0000948 if (Inv) {
949 unsigned Tmp1 = MakeReg(MVT::i32);
950 BuildMI(BB, PPC::RLWINM, 4, Tmp1).addReg(IntCR).addImm(32-(3-Idx))
951 .addImm(31).addImm(31);
952 BuildMI(BB, PPC::XORI, 2, Result).addReg(Tmp1).addImm(1);
953 } else {
954 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(IntCR).addImm(32-(3-Idx))
955 .addImm(31).addImm(31);
956 }
957}
958
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000959/// SelectBitfieldInsert - turn an or of two masked values into
Nate Begeman7ddecb42005-04-06 23:51:40 +0000960/// the rotate left word immediate then mask insert (rlwimi) instruction.
961/// Returns true on success, false if the caller still needs to select OR.
962///
963/// Patterns matched:
964/// 1. or shl, and 5. or and, and
965/// 2. or and, shl 6. or shl, shr
966/// 3. or shr, and 7. or shr, shl
967/// 4. or and, shr
968bool ISel::SelectBitfieldInsert(SDOperand OR, unsigned Result) {
Nate Begemancd08e4c2005-04-09 20:09:12 +0000969 bool IsRotate = false;
Nate Begeman7ddecb42005-04-06 23:51:40 +0000970 unsigned TgtMask = 0xFFFFFFFF, InsMask = 0xFFFFFFFF, Amount = 0;
Jeff Cohen00b168892005-07-27 06:12:32 +0000971
Nate Begemanb2c4bf32005-06-08 04:14:27 +0000972 SDOperand Op0 = OR.getOperand(0);
973 SDOperand Op1 = OR.getOperand(1);
974
975 unsigned Op0Opc = Op0.getOpcode();
976 unsigned Op1Opc = Op1.getOpcode();
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000977
Nate Begeman7ddecb42005-04-06 23:51:40 +0000978 // Verify that we have the correct opcodes
979 if (ISD::SHL != Op0Opc && ISD::SRL != Op0Opc && ISD::AND != Op0Opc)
980 return false;
981 if (ISD::SHL != Op1Opc && ISD::SRL != Op1Opc && ISD::AND != Op1Opc)
982 return false;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000983
Nate Begeman7ddecb42005-04-06 23:51:40 +0000984 // Generate Mask value for Target
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000985 if (ConstantSDNode *CN =
Nate Begemanb2c4bf32005-06-08 04:14:27 +0000986 dyn_cast<ConstantSDNode>(Op0.getOperand(1).Val)) {
Nate Begeman7ddecb42005-04-06 23:51:40 +0000987 switch(Op0Opc) {
988 case ISD::SHL: TgtMask <<= (unsigned)CN->getValue(); break;
989 case ISD::SRL: TgtMask >>= (unsigned)CN->getValue(); break;
990 case ISD::AND: TgtMask &= (unsigned)CN->getValue(); break;
991 }
992 } else {
993 return false;
994 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000995
Nate Begeman7ddecb42005-04-06 23:51:40 +0000996 // Generate Mask value for Insert
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000997 if (ConstantSDNode *CN =
Nate Begemanb2c4bf32005-06-08 04:14:27 +0000998 dyn_cast<ConstantSDNode>(Op1.getOperand(1).Val)) {
Nate Begeman7ddecb42005-04-06 23:51:40 +0000999 switch(Op1Opc) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001000 case ISD::SHL:
1001 Amount = CN->getValue();
Nate Begemancd08e4c2005-04-09 20:09:12 +00001002 InsMask <<= Amount;
1003 if (Op0Opc == ISD::SRL) IsRotate = true;
Nate Begeman7ddecb42005-04-06 23:51:40 +00001004 break;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001005 case ISD::SRL:
1006 Amount = CN->getValue();
1007 InsMask >>= Amount;
Nate Begeman7ddecb42005-04-06 23:51:40 +00001008 Amount = 32-Amount;
Nate Begemancd08e4c2005-04-09 20:09:12 +00001009 if (Op0Opc == ISD::SHL) IsRotate = true;
Nate Begeman7ddecb42005-04-06 23:51:40 +00001010 break;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001011 case ISD::AND:
Nate Begeman7ddecb42005-04-06 23:51:40 +00001012 InsMask &= (unsigned)CN->getValue();
1013 break;
1014 }
1015 } else {
1016 return false;
1017 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001018
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001019 unsigned Tmp3 = 0;
1020
1021 // If both of the inputs are ANDs and one of them has a logical shift by
1022 // constant as its input, make that the inserted value so that we can combine
1023 // the shift into the rotate part of the rlwimi instruction
1024 if (Op0Opc == ISD::AND && Op1Opc == ISD::AND) {
Jeff Cohen00b168892005-07-27 06:12:32 +00001025 if (Op1.getOperand(0).getOpcode() == ISD::SHL ||
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001026 Op1.getOperand(0).getOpcode() == ISD::SRL) {
Jeff Cohen00b168892005-07-27 06:12:32 +00001027 if (ConstantSDNode *CN =
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001028 dyn_cast<ConstantSDNode>(Op1.getOperand(0).getOperand(1).Val)) {
Jeff Cohen00b168892005-07-27 06:12:32 +00001029 Amount = Op1.getOperand(0).getOpcode() == ISD::SHL ?
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001030 CN->getValue() : 32 - CN->getValue();
1031 Tmp3 = SelectExpr(Op1.getOperand(0).getOperand(0));
1032 }
1033 } else if (Op0.getOperand(0).getOpcode() == ISD::SHL ||
1034 Op0.getOperand(0).getOpcode() == ISD::SRL) {
Jeff Cohen00b168892005-07-27 06:12:32 +00001035 if (ConstantSDNode *CN =
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001036 dyn_cast<ConstantSDNode>(Op0.getOperand(0).getOperand(1).Val)) {
1037 std::swap(Op0, Op1);
1038 std::swap(TgtMask, InsMask);
Jeff Cohen00b168892005-07-27 06:12:32 +00001039 Amount = Op1.getOperand(0).getOpcode() == ISD::SHL ?
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001040 CN->getValue() : 32 - CN->getValue();
1041 Tmp3 = SelectExpr(Op1.getOperand(0).getOperand(0));
1042 }
1043 }
1044 }
1045
Nate Begeman7ddecb42005-04-06 23:51:40 +00001046 // Verify that the Target mask and Insert mask together form a full word mask
1047 // and that the Insert mask is a run of set bits (which implies both are runs
1048 // of set bits). Given that, Select the arguments and generate the rlwimi
1049 // instruction.
1050 unsigned MB, ME;
Chris Lattner02efa6c2005-08-08 21:08:09 +00001051 if (((TgtMask & InsMask) == 0) && isRunOfOnes(InsMask, MB, ME)) {
Nate Begeman7ddecb42005-04-06 23:51:40 +00001052 unsigned Tmp1, Tmp2;
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001053 bool fullMask = (TgtMask ^ InsMask) == 0xFFFFFFFF;
Nate Begemancd08e4c2005-04-09 20:09:12 +00001054 // Check for rotlwi / rotrwi here, a special case of bitfield insert
1055 // where both bitfield halves are sourced from the same value.
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001056 if (IsRotate && fullMask &&
Nate Begemancd08e4c2005-04-09 20:09:12 +00001057 OR.getOperand(0).getOperand(0) == OR.getOperand(1).getOperand(0)) {
Nate Begemancd08e4c2005-04-09 20:09:12 +00001058 Tmp1 = SelectExpr(OR.getOperand(0).getOperand(0));
1059 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp1).addImm(Amount)
1060 .addImm(0).addImm(31);
1061 return true;
1062 }
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001063 if (Op0Opc == ISD::AND && fullMask)
1064 Tmp1 = SelectExpr(Op0.getOperand(0));
Nate Begeman7ddecb42005-04-06 23:51:40 +00001065 else
Nate Begemanb2c4bf32005-06-08 04:14:27 +00001066 Tmp1 = SelectExpr(Op0);
1067 Tmp2 = Tmp3 ? Tmp3 : SelectExpr(Op1.getOperand(0));
Nate Begeman7ddecb42005-04-06 23:51:40 +00001068 BuildMI(BB, PPC::RLWIMI, 5, Result).addReg(Tmp1).addReg(Tmp2)
1069 .addImm(Amount).addImm(MB).addImm(ME);
1070 return true;
1071 }
1072 return false;
1073}
1074
Nate Begeman3664cef2005-04-13 22:14:14 +00001075/// FoldIfWideZeroExtend - 32 bit PowerPC implicit masks shift amounts to the
1076/// low six bits. If the shift amount is an ISD::AND node with a mask that is
1077/// wider than the implicit mask, then we can get rid of the AND and let the
1078/// shift do the mask.
1079unsigned ISel::FoldIfWideZeroExtend(SDOperand N) {
Chris Lattner8fd19802005-08-08 21:12:35 +00001080 unsigned C, MB, ME;
Nate Begeman3664cef2005-04-13 22:14:14 +00001081 if (N.getOpcode() == ISD::AND &&
Chris Lattner59b21c22005-08-09 18:29:55 +00001082 isIntImmediate(N.getOperand(1), C) && isRunOfOnes(C, MB, ME) &&
Chris Lattner8fd19802005-08-08 21:12:35 +00001083 MB <= 26 && ME == 31)
Nate Begeman3664cef2005-04-13 22:14:14 +00001084 return SelectExpr(N.getOperand(0));
1085 else
1086 return SelectExpr(N);
1087}
1088
Chris Lattner88ac32c2005-08-09 20:21:10 +00001089unsigned ISel::SelectCC(SDOperand Cond, unsigned& Opc, bool &Inv, unsigned& Idx) {
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001090 unsigned Result, Tmp1, Tmp2;
Nate Begeman9765c252005-04-12 21:22:28 +00001091 bool AlreadySelected = false;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001092 static const unsigned CompareOpcodes[] =
Nate Begemandffcfcc2005-04-01 00:32:34 +00001093 { PPC::FCMPU, PPC::FCMPU, PPC::CMPW, PPC::CMPLW };
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001094
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001095 // Allocate a condition register for this expression
1096 Result = RegMap->createVirtualRegister(PPC32::CRRCRegisterClass);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001097
Nate Begemandffcfcc2005-04-01 00:32:34 +00001098 // If the first operand to the select is a SETCC node, then we can fold it
1099 // into the branch that selects which value to return.
Chris Lattner88ac32c2005-08-09 20:21:10 +00001100 if (Cond.getOpcode() == ISD::SETCC) {
1101 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
Nate Begemandffcfcc2005-04-01 00:32:34 +00001102 bool U;
Chris Lattner88ac32c2005-08-09 20:21:10 +00001103 Opc = getBCCForSetCC(CC, U);
1104 Idx = getCRIdxForSetCC(CC, Inv);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001105
Chris Lattner8fd19802005-08-08 21:12:35 +00001106 // Use U to determine whether the SETCC immediate range is signed or not.
Chris Lattner88ac32c2005-08-09 20:21:10 +00001107 if (isIntImmediate(Cond.getOperand(1), Tmp2) &&
Chris Lattner8fd19802005-08-08 21:12:35 +00001108 ((U && isUInt16(Tmp2)) || (!U && isInt16(Tmp2)))) {
1109 Tmp2 = Lo16(Tmp2);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001110 // For comparisons against zero, we can implicity set CR0 if a recording
Nate Begemanc7bd4822005-04-11 06:34:10 +00001111 // variant (e.g. 'or.' instead of 'or') of the instruction that defines
1112 // operand zero of the SetCC node is available.
Chris Lattner88ac32c2005-08-09 20:21:10 +00001113 if (Tmp2 == 0 &&
1114 NodeHasRecordingVariant(Cond.getOperand(0).getOpcode()) &&
1115 Cond.getOperand(0).Val->hasOneUse()) {
Nate Begemanc7bd4822005-04-11 06:34:10 +00001116 RecordSuccess = false;
Chris Lattner88ac32c2005-08-09 20:21:10 +00001117 Tmp1 = SelectExpr(Cond.getOperand(0), true);
Nate Begemanc7bd4822005-04-11 06:34:10 +00001118 if (RecordSuccess) {
1119 ++Recorded;
Nate Begeman7bfba7d2005-04-14 09:45:08 +00001120 BuildMI(BB, PPC::MCRF, 1, Result).addReg(PPC::CR0);
1121 return Result;
Nate Begemanc7bd4822005-04-11 06:34:10 +00001122 }
1123 AlreadySelected = true;
1124 }
1125 // If we could not implicitly set CR0, then emit a compare immediate
1126 // instead.
Chris Lattner88ac32c2005-08-09 20:21:10 +00001127 if (!AlreadySelected) Tmp1 = SelectExpr(Cond.getOperand(0));
Nate Begemandffcfcc2005-04-01 00:32:34 +00001128 if (U)
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001129 BuildMI(BB, PPC::CMPLWI, 2, Result).addReg(Tmp1).addImm(Tmp2);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001130 else
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001131 BuildMI(BB, PPC::CMPWI, 2, Result).addReg(Tmp1).addSImm(Tmp2);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001132 } else {
Chris Lattner88ac32c2005-08-09 20:21:10 +00001133 bool IsInteger = MVT::isInteger(Cond.getOperand(0).getValueType());
Nate Begemandffcfcc2005-04-01 00:32:34 +00001134 unsigned CompareOpc = CompareOpcodes[2 * IsInteger + U];
Chris Lattner88ac32c2005-08-09 20:21:10 +00001135 Tmp1 = SelectExpr(Cond.getOperand(0));
1136 Tmp2 = SelectExpr(Cond.getOperand(1));
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001137 BuildMI(BB, CompareOpc, 2, Result).addReg(Tmp1).addReg(Tmp2);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001138 }
1139 } else {
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001140 // If this isn't a SetCC, then select the value and compare it against zero,
1141 // treating it as if it were a boolean.
Nate Begeman9765c252005-04-12 21:22:28 +00001142 Opc = PPC::BNE;
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001143 Idx = getCRIdxForSetCC(ISD::SETNE, Inv);
Chris Lattner88ac32c2005-08-09 20:21:10 +00001144 Tmp1 = SelectExpr(Cond);
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001145 BuildMI(BB, PPC::CMPLWI, 2, Result).addReg(Tmp1).addImm(0);
Nate Begemandffcfcc2005-04-01 00:32:34 +00001146 }
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001147 return Result;
Nate Begemandffcfcc2005-04-01 00:32:34 +00001148}
1149
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001150unsigned ISel::SelectCCExpr(SDOperand N, unsigned& Opc, bool &Inv,
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001151 unsigned &Idx) {
1152 bool Inv0, Inv1;
1153 unsigned Idx0, Idx1, CROpc, Opc1, Tmp1, Tmp2;
1154
1155 // Allocate a condition register for this expression
1156 unsigned Result = RegMap->createVirtualRegister(PPC32::CRRCRegisterClass);
1157
1158 // Check for the operations we support:
1159 switch(N.getOpcode()) {
1160 default:
1161 Opc = PPC::BNE;
1162 Idx = getCRIdxForSetCC(ISD::SETNE, Inv);
1163 Tmp1 = SelectExpr(N);
1164 BuildMI(BB, PPC::CMPLWI, 2, Result).addReg(Tmp1).addImm(0);
1165 break;
1166 case ISD::OR:
1167 case ISD::AND:
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001168 Tmp1 = SelectCCExpr(N.getOperand(0), Opc, Inv0, Idx0);
1169 Tmp2 = SelectCCExpr(N.getOperand(1), Opc1, Inv1, Idx1);
1170 CROpc = getCROpForSetCC(N.getOpcode(), Inv0, Inv1);
1171 if (Inv0 && !Inv1) {
1172 std::swap(Tmp1, Tmp2);
1173 std::swap(Idx0, Idx1);
1174 Opc = Opc1;
1175 }
1176 if (Inv0 && Inv1) Opc = PPC32InstrInfo::invertPPCBranchOpcode(Opc);
1177 BuildMI(BB, CROpc, 5, Result).addImm(Idx0).addReg(Tmp1).addImm(Idx0)
1178 .addReg(Tmp2).addImm(Idx1);
1179 Inv = false;
1180 Idx = Idx0;
1181 break;
1182 case ISD::SETCC:
1183 Tmp1 = SelectCC(N, Opc, Inv, Idx);
1184 Result = Tmp1;
1185 break;
1186 }
1187 return Result;
1188}
1189
Nate Begemand3ded2d2005-08-08 22:22:56 +00001190/// Check to see if the load is a constant offset from a base register.
Nate Begeman2a05c8e2005-07-28 03:02:05 +00001191unsigned ISel::SelectAddr(SDOperand N, unsigned& Reg, int& offset)
Nate Begemana9795f82005-03-24 04:41:43 +00001192{
Nate Begeman96fc6812005-03-31 02:05:53 +00001193 unsigned imm = 0, opcode = N.getOpcode();
Nate Begeman04730362005-04-01 04:45:11 +00001194 if (N.getOpcode() == ISD::ADD) {
Nate Begeman2a05c8e2005-07-28 03:02:05 +00001195 bool isFrame = N.getOperand(0).getOpcode() == ISD::FrameIndex;
Chris Lattner59b21c22005-08-09 18:29:55 +00001196 if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm)) {
Chris Lattner8fd19802005-08-08 21:12:35 +00001197 offset = Lo16(imm);
Nate Begeman2a05c8e2005-07-28 03:02:05 +00001198 if (isFrame) {
1199 ++FrameOff;
1200 Reg = cast<FrameIndexSDNode>(N.getOperand(0))->getIndex();
1201 return 1;
1202 } else {
1203 Reg = SelectExpr(N.getOperand(0));
1204 return 0;
1205 }
1206 } else {
1207 Reg = SelectExpr(N.getOperand(0));
1208 offset = SelectExpr(N.getOperand(1));
1209 return 2;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001210 }
Nate Begeman04730362005-04-01 04:45:11 +00001211 }
Nate Begemand3ded2d2005-08-08 22:22:56 +00001212 // Now check if we're dealing with a global, and whether or not we should emit
1213 // an optimized load or store for statics.
1214 if(GlobalAddressSDNode *GN = dyn_cast<GlobalAddressSDNode>(N)) {
1215 GlobalValue *GV = GN->getGlobal();
1216 if (!GV->hasWeakLinkage() && !GV->isExternal()) {
1217 unsigned GlobalHi = MakeReg(MVT::i32);
1218 if (PICEnabled)
1219 BuildMI(BB, PPC::ADDIS, 2, GlobalHi).addReg(getGlobalBaseReg())
1220 .addGlobalAddress(GV);
1221 else
1222 BuildMI(BB, PPC::LIS, 1, GlobalHi).addGlobalAddress(GV);
1223 Reg = GlobalHi;
1224 offset = 0;
1225 return 3;
1226 }
1227 }
Nate Begemana9795f82005-03-24 04:41:43 +00001228 Reg = SelectExpr(N);
1229 offset = 0;
Nate Begeman2a05c8e2005-07-28 03:02:05 +00001230 return 0;
Nate Begemana9795f82005-03-24 04:41:43 +00001231}
1232
1233void ISel::SelectBranchCC(SDOperand N)
1234{
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001235 MachineBasicBlock *Dest =
Nate Begemana9795f82005-03-24 04:41:43 +00001236 cast<BasicBlockSDNode>(N.getOperand(2))->getBasicBlock();
Nate Begeman3e897162005-03-31 23:55:40 +00001237
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001238 bool Inv;
1239 unsigned Opc, CCReg, Idx;
Nate Begemana9795f82005-03-24 04:41:43 +00001240 Select(N.getOperand(0)); //chain
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00001241 CCReg = SelectCC(N.getOperand(1), Opc, Inv, Idx);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001242
Nate Begeman439009c2005-06-15 18:22:43 +00001243 // Iterate to the next basic block
1244 ilist<MachineBasicBlock>::iterator It = BB;
1245 ++It;
Nate Begemancd08e4c2005-04-09 20:09:12 +00001246
1247 // If this is a two way branch, then grab the fallthrough basic block argument
1248 // and build a PowerPC branch pseudo-op, suitable for long branch conversion
1249 // if necessary by the branch selection pass. Otherwise, emit a standard
1250 // conditional branch.
1251 if (N.getOpcode() == ISD::BRCONDTWOWAY) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001252 MachineBasicBlock *Fallthrough =
Nate Begemancd08e4c2005-04-09 20:09:12 +00001253 cast<BasicBlockSDNode>(N.getOperand(3))->getBasicBlock();
1254 if (Dest != It) {
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001255 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(CCReg).addImm(Opc)
Nate Begemancd08e4c2005-04-09 20:09:12 +00001256 .addMBB(Dest).addMBB(Fallthrough);
1257 if (Fallthrough != It)
1258 BuildMI(BB, PPC::B, 1).addMBB(Fallthrough);
1259 } else {
1260 if (Fallthrough != It) {
1261 Opc = PPC32InstrInfo::invertPPCBranchOpcode(Opc);
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001262 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(CCReg).addImm(Opc)
Nate Begemancd08e4c2005-04-09 20:09:12 +00001263 .addMBB(Fallthrough).addMBB(Dest);
1264 }
1265 }
1266 } else {
Nate Begeman439009c2005-06-15 18:22:43 +00001267 // If the fallthrough path is off the end of the function, which would be
1268 // undefined behavior, set it to be the same as the current block because
1269 // we have nothing better to set it to, and leaving it alone will cause the
1270 // PowerPC Branch Selection pass to crash.
1271 if (It == BB->getParent()->end()) It = Dest;
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00001272 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(CCReg).addImm(Opc)
Nate Begeman27499e32005-04-10 01:48:29 +00001273 .addMBB(Dest).addMBB(It);
Nate Begemancd08e4c2005-04-09 20:09:12 +00001274 }
Nate Begemana9795f82005-03-24 04:41:43 +00001275 return;
1276}
1277
Nate Begemanc7bd4822005-04-11 06:34:10 +00001278unsigned ISel::SelectExpr(SDOperand N, bool Recording) {
Nate Begemana9795f82005-03-24 04:41:43 +00001279 unsigned Result;
1280 unsigned Tmp1, Tmp2, Tmp3;
1281 unsigned Opc = 0;
1282 unsigned opcode = N.getOpcode();
1283
1284 SDNode *Node = N.Val;
1285 MVT::ValueType DestType = N.getValueType();
1286
Nate Begemana43b1762005-06-14 03:55:23 +00001287 if (Node->getOpcode() == ISD::CopyFromReg &&
Chris Lattner988b1dd2005-07-28 05:23:43 +00001288 (MRegisterInfo::isVirtualRegister(cast<RegSDNode>(Node)->getReg()) ||
1289 cast<RegSDNode>(Node)->getReg() == PPC::R1))
Nate Begemana43b1762005-06-14 03:55:23 +00001290 // Just use the specified register as our input.
1291 return cast<RegSDNode>(Node)->getReg();
1292
Nate Begemana9795f82005-03-24 04:41:43 +00001293 unsigned &Reg = ExprMap[N];
1294 if (Reg) return Reg;
1295
Nate Begeman27eeb002005-04-02 05:59:34 +00001296 switch (N.getOpcode()) {
1297 default:
Nate Begemana9795f82005-03-24 04:41:43 +00001298 Reg = Result = (N.getValueType() != MVT::Other) ?
Nate Begeman27eeb002005-04-02 05:59:34 +00001299 MakeReg(N.getValueType()) : 1;
1300 break;
Chris Lattnerb5d8e6e2005-05-13 20:29:26 +00001301 case ISD::TAILCALL:
Nate Begeman27eeb002005-04-02 05:59:34 +00001302 case ISD::CALL:
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001303 // If this is a call instruction, make sure to prepare ALL of the result
1304 // values as well as the chain.
Nate Begeman27eeb002005-04-02 05:59:34 +00001305 if (Node->getNumValues() == 1)
1306 Reg = Result = 1; // Void call, just a chain.
1307 else {
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001308 Result = MakeReg(Node->getValueType(0));
1309 ExprMap[N.getValue(0)] = Result;
Nate Begeman27eeb002005-04-02 05:59:34 +00001310 for (unsigned i = 1, e = N.Val->getNumValues()-1; i != e; ++i)
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001311 ExprMap[N.getValue(i)] = MakeReg(Node->getValueType(i));
Nate Begeman27eeb002005-04-02 05:59:34 +00001312 ExprMap[SDOperand(Node, Node->getNumValues()-1)] = 1;
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001313 }
Nate Begeman27eeb002005-04-02 05:59:34 +00001314 break;
1315 case ISD::ADD_PARTS:
1316 case ISD::SUB_PARTS:
1317 case ISD::SHL_PARTS:
1318 case ISD::SRL_PARTS:
1319 case ISD::SRA_PARTS:
1320 Result = MakeReg(Node->getValueType(0));
1321 ExprMap[N.getValue(0)] = Result;
1322 for (unsigned i = 1, e = N.Val->getNumValues(); i != e; ++i)
1323 ExprMap[N.getValue(i)] = MakeReg(Node->getValueType(i));
1324 break;
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001325 }
1326
Nate Begemana9795f82005-03-24 04:41:43 +00001327 switch (opcode) {
1328 default:
1329 Node->dump();
1330 assert(0 && "Node not handled!\n");
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001331 case ISD::UNDEF:
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001332 BuildMI(BB, PPC::IMPLICIT_DEF, 0, Result);
1333 return Result;
Nate Begemana9795f82005-03-24 04:41:43 +00001334 case ISD::DYNAMIC_STACKALLOC:
Nate Begeman5e966612005-03-24 06:28:42 +00001335 // Generate both result values. FIXME: Need a better commment here?
1336 if (Result != 1)
1337 ExprMap[N.getValue(1)] = 1;
1338 else
1339 Result = ExprMap[N.getValue(0)] = MakeReg(N.getValue(0).getValueType());
1340
1341 // FIXME: We are currently ignoring the requested alignment for handling
1342 // greater than the stack alignment. This will need to be revisited at some
1343 // point. Align = N.getOperand(2);
1344 if (!isa<ConstantSDNode>(N.getOperand(2)) ||
1345 cast<ConstantSDNode>(N.getOperand(2))->getValue() != 0) {
1346 std::cerr << "Cannot allocate stack object with greater alignment than"
1347 << " the stack alignment yet!";
1348 abort();
1349 }
1350 Select(N.getOperand(0));
1351 Tmp1 = SelectExpr(N.getOperand(1));
1352 // Subtract size from stack pointer, thereby allocating some space.
1353 BuildMI(BB, PPC::SUBF, 2, PPC::R1).addReg(Tmp1).addReg(PPC::R1);
1354 // Put a pointer to the space into the result register by copying the SP
1355 BuildMI(BB, PPC::OR, 2, Result).addReg(PPC::R1).addReg(PPC::R1);
1356 return Result;
Nate Begemana9795f82005-03-24 04:41:43 +00001357
1358 case ISD::ConstantPool:
Nate Begemanca12a2b2005-03-28 22:28:37 +00001359 Tmp1 = cast<ConstantPoolSDNode>(N)->getIndex();
1360 Tmp2 = MakeReg(MVT::i32);
Nate Begeman2497e632005-07-21 20:44:43 +00001361 if (PICEnabled)
1362 BuildMI(BB, PPC::ADDIS, 2, Tmp2).addReg(getGlobalBaseReg())
1363 .addConstantPoolIndex(Tmp1);
1364 else
1365 BuildMI(BB, PPC::LIS, 1, Tmp2).addConstantPoolIndex(Tmp1);
Nate Begemanca12a2b2005-03-28 22:28:37 +00001366 BuildMI(BB, PPC::LA, 2, Result).addReg(Tmp2).addConstantPoolIndex(Tmp1);
1367 return Result;
Nate Begemana9795f82005-03-24 04:41:43 +00001368
1369 case ISD::FrameIndex:
Nate Begemanf3d08f32005-03-29 00:03:27 +00001370 Tmp1 = cast<FrameIndexSDNode>(N)->getIndex();
Nate Begeman58f718c2005-03-30 02:23:08 +00001371 addFrameReference(BuildMI(BB, PPC::ADDI, 2, Result), (int)Tmp1, 0, false);
Nate Begemanf3d08f32005-03-29 00:03:27 +00001372 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001373
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001374 case ISD::GlobalAddress: {
1375 GlobalValue *GV = cast<GlobalAddressSDNode>(N)->getGlobal();
Nate Begemanca12a2b2005-03-28 22:28:37 +00001376 Tmp1 = MakeReg(MVT::i32);
Nate Begeman2497e632005-07-21 20:44:43 +00001377 if (PICEnabled)
1378 BuildMI(BB, PPC::ADDIS, 2, Tmp1).addReg(getGlobalBaseReg())
1379 .addGlobalAddress(GV);
1380 else
Chris Lattner4015ea82005-07-28 04:42:11 +00001381 BuildMI(BB, PPC::LIS, 1, Tmp1).addGlobalAddress(GV);
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001382 if (GV->hasWeakLinkage() || GV->isExternal()) {
1383 BuildMI(BB, PPC::LWZ, 2, Result).addGlobalAddress(GV).addReg(Tmp1);
1384 } else {
1385 BuildMI(BB, PPC::LA, 2, Result).addReg(Tmp1).addGlobalAddress(GV);
1386 }
1387 return Result;
1388 }
1389
Nate Begeman5e966612005-03-24 06:28:42 +00001390 case ISD::LOAD:
Nate Begemana9795f82005-03-24 04:41:43 +00001391 case ISD::EXTLOAD:
1392 case ISD::ZEXTLOAD:
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001393 case ISD::SEXTLOAD: {
Nate Begeman9db505c2005-03-28 19:36:43 +00001394 MVT::ValueType TypeBeingLoaded = (ISD::LOAD == opcode) ?
Chris Lattnerbce81ae2005-07-10 01:56:13 +00001395 Node->getValueType(0) : cast<VTSDNode>(Node->getOperand(3))->getVT();
Nate Begeman74d73452005-03-31 00:15:26 +00001396 bool sext = (ISD::SEXTLOAD == opcode);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001397
Nate Begeman5e966612005-03-24 06:28:42 +00001398 // Make sure we generate both values.
1399 if (Result != 1)
1400 ExprMap[N.getValue(1)] = 1; // Generate the token
1401 else
1402 Result = ExprMap[N.getValue(0)] = MakeReg(N.getValue(0).getValueType());
1403
1404 SDOperand Chain = N.getOperand(0);
1405 SDOperand Address = N.getOperand(1);
1406 Select(Chain);
1407
Nate Begeman9db505c2005-03-28 19:36:43 +00001408 switch (TypeBeingLoaded) {
Nate Begeman74d73452005-03-31 00:15:26 +00001409 default: Node->dump(); assert(0 && "Cannot load this type!");
Nate Begeman9db505c2005-03-28 19:36:43 +00001410 case MVT::i1: Opc = PPC::LBZ; break;
1411 case MVT::i8: Opc = PPC::LBZ; break;
1412 case MVT::i16: Opc = sext ? PPC::LHA : PPC::LHZ; break;
1413 case MVT::i32: Opc = PPC::LWZ; break;
Nate Begeman74d73452005-03-31 00:15:26 +00001414 case MVT::f32: Opc = PPC::LFS; break;
1415 case MVT::f64: Opc = PPC::LFD; break;
Nate Begeman5e966612005-03-24 06:28:42 +00001416 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001417
Nate Begeman74d73452005-03-31 00:15:26 +00001418 if (ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(Address)) {
1419 Tmp1 = MakeReg(MVT::i32);
1420 int CPI = CP->getIndex();
Nate Begeman2497e632005-07-21 20:44:43 +00001421 if (PICEnabled)
1422 BuildMI(BB, PPC::ADDIS, 2, Tmp1).addReg(getGlobalBaseReg())
1423 .addConstantPoolIndex(CPI);
1424 else
1425 BuildMI(BB, PPC::LIS, 1, Tmp1).addConstantPoolIndex(CPI);
Nate Begeman74d73452005-03-31 00:15:26 +00001426 BuildMI(BB, Opc, 2, Result).addConstantPoolIndex(CPI).addReg(Tmp1);
Nate Begeman2497e632005-07-21 20:44:43 +00001427 } else if (Address.getOpcode() == ISD::FrameIndex) {
Nate Begeman58f718c2005-03-30 02:23:08 +00001428 Tmp1 = cast<FrameIndexSDNode>(Address)->getIndex();
1429 addFrameReference(BuildMI(BB, Opc, 2, Result), (int)Tmp1);
Nate Begeman5e966612005-03-24 06:28:42 +00001430 } else {
1431 int offset;
Nate Begeman2a05c8e2005-07-28 03:02:05 +00001432 switch(SelectAddr(Address, Tmp1, offset)) {
1433 default: assert(0 && "Unhandled return value from SelectAddr");
1434 case 0: // imm offset, no frame, no index
1435 BuildMI(BB, Opc, 2, Result).addSImm(offset).addReg(Tmp1);
1436 break;
1437 case 1: // imm offset + frame index
1438 addFrameReference(BuildMI(BB, Opc, 2, Result), (int)Tmp1, offset);
1439 break;
1440 case 2: // base+index addressing
Nate Begeman04730362005-04-01 04:45:11 +00001441 Opc = IndexedOpForOp(Opc);
1442 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(offset);
Nate Begeman2a05c8e2005-07-28 03:02:05 +00001443 break;
Nate Begemand3ded2d2005-08-08 22:22:56 +00001444 case 3: {
1445 GlobalAddressSDNode *GN = cast<GlobalAddressSDNode>(Address);
1446 GlobalValue *GV = GN->getGlobal();
1447 BuildMI(BB, Opc, 2, Result).addGlobalAddress(GV).addReg(Tmp1);
1448 }
Nate Begeman04730362005-04-01 04:45:11 +00001449 }
Nate Begeman5e966612005-03-24 06:28:42 +00001450 }
1451 return Result;
1452 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001453
Chris Lattnerb5d8e6e2005-05-13 20:29:26 +00001454 case ISD::TAILCALL:
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001455 case ISD::CALL: {
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001456 unsigned GPR_idx = 0, FPR_idx = 0;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001457 static const unsigned GPR[] = {
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001458 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
1459 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
1460 };
1461 static const unsigned FPR[] = {
1462 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
1463 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
1464 };
1465
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001466 // Lower the chain for this call.
1467 Select(N.getOperand(0));
1468 ExprMap[N.getValue(Node->getNumValues()-1)] = 1;
Nate Begeman74d73452005-03-31 00:15:26 +00001469
Nate Begemand860aa62005-04-04 22:17:48 +00001470 MachineInstr *CallMI;
1471 // Emit the correct call instruction based on the type of symbol called.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001472 if (GlobalAddressSDNode *GASD =
Nate Begemand860aa62005-04-04 22:17:48 +00001473 dyn_cast<GlobalAddressSDNode>(N.getOperand(1))) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001474 CallMI = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(GASD->getGlobal(),
Nate Begemand860aa62005-04-04 22:17:48 +00001475 true);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001476 } else if (ExternalSymbolSDNode *ESSDN =
Nate Begemand860aa62005-04-04 22:17:48 +00001477 dyn_cast<ExternalSymbolSDNode>(N.getOperand(1))) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001478 CallMI = BuildMI(PPC::CALLpcrel, 1).addExternalSymbol(ESSDN->getSymbol(),
Nate Begemand860aa62005-04-04 22:17:48 +00001479 true);
1480 } else {
1481 Tmp1 = SelectExpr(N.getOperand(1));
1482 BuildMI(BB, PPC::OR, 2, PPC::R12).addReg(Tmp1).addReg(Tmp1);
1483 BuildMI(BB, PPC::MTCTR, 1).addReg(PPC::R12);
1484 CallMI = BuildMI(PPC::CALLindirect, 3).addImm(20).addImm(0)
1485 .addReg(PPC::R12);
1486 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001487
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001488 // Load the register args to virtual regs
1489 std::vector<unsigned> ArgVR;
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001490 for(int i = 2, e = Node->getNumOperands(); i < e; ++i)
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001491 ArgVR.push_back(SelectExpr(N.getOperand(i)));
1492
1493 // Copy the virtual registers into the appropriate argument register
1494 for(int i = 0, e = ArgVR.size(); i < e; ++i) {
1495 switch(N.getOperand(i+2).getValueType()) {
1496 default: Node->dump(); assert(0 && "Unknown value type for call");
1497 case MVT::i1:
1498 case MVT::i8:
1499 case MVT::i16:
1500 case MVT::i32:
1501 assert(GPR_idx < 8 && "Too many int args");
Nate Begemand860aa62005-04-04 22:17:48 +00001502 if (N.getOperand(i+2).getOpcode() != ISD::UNDEF) {
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001503 BuildMI(BB, PPC::OR,2,GPR[GPR_idx]).addReg(ArgVR[i]).addReg(ArgVR[i]);
Nate Begemand860aa62005-04-04 22:17:48 +00001504 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1505 }
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001506 ++GPR_idx;
1507 break;
1508 case MVT::f64:
1509 case MVT::f32:
1510 assert(FPR_idx < 13 && "Too many fp args");
1511 BuildMI(BB, PPC::FMR, 1, FPR[FPR_idx]).addReg(ArgVR[i]);
Nate Begemand860aa62005-04-04 22:17:48 +00001512 CallMI->addRegOperand(FPR[FPR_idx], MachineOperand::Use);
Nate Begemanfc1b1da2005-04-01 22:34:39 +00001513 ++FPR_idx;
1514 break;
1515 }
1516 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001517
Nate Begemand860aa62005-04-04 22:17:48 +00001518 // Put the call instruction in the correct place in the MachineBasicBlock
1519 BB->push_back(CallMI);
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001520
1521 switch (Node->getValueType(0)) {
1522 default: assert(0 && "Unknown value type for call result!");
1523 case MVT::Other: return 1;
1524 case MVT::i1:
1525 case MVT::i8:
1526 case MVT::i16:
1527 case MVT::i32:
Nate Begemane5846682005-04-04 06:52:38 +00001528 if (Node->getValueType(1) == MVT::i32) {
1529 BuildMI(BB, PPC::OR, 2, Result+1).addReg(PPC::R3).addReg(PPC::R3);
1530 BuildMI(BB, PPC::OR, 2, Result).addReg(PPC::R4).addReg(PPC::R4);
1531 } else {
1532 BuildMI(BB, PPC::OR, 2, Result).addReg(PPC::R3).addReg(PPC::R3);
1533 }
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001534 break;
1535 case MVT::f32:
1536 case MVT::f64:
1537 BuildMI(BB, PPC::FMR, 1, Result).addReg(PPC::F1);
1538 break;
1539 }
1540 return Result+N.ResNo;
1541 }
Nate Begemana9795f82005-03-24 04:41:43 +00001542
1543 case ISD::SIGN_EXTEND:
1544 case ISD::SIGN_EXTEND_INREG:
1545 Tmp1 = SelectExpr(N.getOperand(0));
Chris Lattnerbce81ae2005-07-10 01:56:13 +00001546 switch(cast<VTSDNode>(Node->getOperand(1))->getVT()) {
Nate Begeman9db505c2005-03-28 19:36:43 +00001547 default: Node->dump(); assert(0 && "Unhandled SIGN_EXTEND type"); break;
Nate Begemanc7bd4822005-04-11 06:34:10 +00001548 case MVT::i16:
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001549 BuildMI(BB, PPC::EXTSH, 1, Result).addReg(Tmp1);
Nate Begeman9db505c2005-03-28 19:36:43 +00001550 break;
Nate Begemanc7bd4822005-04-11 06:34:10 +00001551 case MVT::i8:
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001552 BuildMI(BB, PPC::EXTSB, 1, Result).addReg(Tmp1);
Nate Begeman9db505c2005-03-28 19:36:43 +00001553 break;
Nate Begeman74747862005-03-29 22:24:51 +00001554 case MVT::i1:
1555 BuildMI(BB, PPC::SUBFIC, 2, Result).addReg(Tmp1).addSImm(0);
1556 break;
Nate Begeman9db505c2005-03-28 19:36:43 +00001557 }
Nate Begemana9795f82005-03-24 04:41:43 +00001558 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001559
Nate Begemana9795f82005-03-24 04:41:43 +00001560 case ISD::CopyFromReg:
Nate Begemana3fd4002005-07-19 16:51:05 +00001561 DestType = N.getValue(0).getValueType();
Nate Begemana9795f82005-03-24 04:41:43 +00001562 if (Result == 1)
Nate Begemana3fd4002005-07-19 16:51:05 +00001563 Result = ExprMap[N.getValue(0)] = MakeReg(DestType);
Nate Begemana9795f82005-03-24 04:41:43 +00001564 Tmp1 = dyn_cast<RegSDNode>(Node)->getReg();
Nate Begemana3fd4002005-07-19 16:51:05 +00001565 if (MVT::isInteger(DestType))
1566 BuildMI(BB, PPC::OR, 2, Result).addReg(Tmp1).addReg(Tmp1);
1567 else
1568 BuildMI(BB, PPC::FMR, 1, Result).addReg(Tmp1);
Nate Begemana9795f82005-03-24 04:41:43 +00001569 return Result;
1570
1571 case ISD::SHL:
Nate Begeman5e966612005-03-24 06:28:42 +00001572 Tmp1 = SelectExpr(N.getOperand(0));
1573 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.getOperand(1))) {
1574 Tmp2 = CN->getValue() & 0x1F;
Nate Begeman33162522005-03-29 21:54:38 +00001575 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp1).addImm(Tmp2).addImm(0)
Nate Begeman5e966612005-03-24 06:28:42 +00001576 .addImm(31-Tmp2);
1577 } else {
Nate Begeman3664cef2005-04-13 22:14:14 +00001578 Tmp2 = FoldIfWideZeroExtend(N.getOperand(1));
Nate Begeman5e966612005-03-24 06:28:42 +00001579 BuildMI(BB, PPC::SLW, 2, Result).addReg(Tmp1).addReg(Tmp2);
1580 }
1581 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001582
Nate Begeman5e966612005-03-24 06:28:42 +00001583 case ISD::SRL:
1584 Tmp1 = SelectExpr(N.getOperand(0));
1585 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.getOperand(1))) {
1586 Tmp2 = CN->getValue() & 0x1F;
Nate Begeman33162522005-03-29 21:54:38 +00001587 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp1).addImm(32-Tmp2)
Nate Begeman5e966612005-03-24 06:28:42 +00001588 .addImm(Tmp2).addImm(31);
1589 } else {
Nate Begeman3664cef2005-04-13 22:14:14 +00001590 Tmp2 = FoldIfWideZeroExtend(N.getOperand(1));
Nate Begeman5e966612005-03-24 06:28:42 +00001591 BuildMI(BB, PPC::SRW, 2, Result).addReg(Tmp1).addReg(Tmp2);
1592 }
1593 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001594
Nate Begeman5e966612005-03-24 06:28:42 +00001595 case ISD::SRA:
1596 Tmp1 = SelectExpr(N.getOperand(0));
1597 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N.getOperand(1))) {
1598 Tmp2 = CN->getValue() & 0x1F;
1599 BuildMI(BB, PPC::SRAWI, 2, Result).addReg(Tmp1).addImm(Tmp2);
1600 } else {
Nate Begeman3664cef2005-04-13 22:14:14 +00001601 Tmp2 = FoldIfWideZeroExtend(N.getOperand(1));
Nate Begeman5e966612005-03-24 06:28:42 +00001602 BuildMI(BB, PPC::SRAW, 2, Result).addReg(Tmp1).addReg(Tmp2);
1603 }
1604 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001605
Nate Begemand7c4a4a2005-05-11 23:43:56 +00001606 case ISD::CTLZ:
1607 Tmp1 = SelectExpr(N.getOperand(0));
1608 BuildMI(BB, PPC::CNTLZW, 1, Result).addReg(Tmp1);
1609 return Result;
1610
Nate Begemana9795f82005-03-24 04:41:43 +00001611 case ISD::ADD:
Nate Begemana3fd4002005-07-19 16:51:05 +00001612 if (!MVT::isInteger(DestType)) {
1613 if (!NoExcessFPPrecision && N.getOperand(0).getOpcode() == ISD::MUL &&
1614 N.getOperand(0).Val->hasOneUse()) {
1615 ++FusedFP; // Statistic
1616 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1617 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1));
1618 Tmp3 = SelectExpr(N.getOperand(1));
1619 Opc = DestType == MVT::f64 ? PPC::FMADD : PPC::FMADDS;
1620 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
1621 return Result;
1622 }
1623 if (!NoExcessFPPrecision && N.getOperand(1).getOpcode() == ISD::MUL &&
1624 N.getOperand(1).Val->hasOneUse()) {
1625 ++FusedFP; // Statistic
1626 Tmp1 = SelectExpr(N.getOperand(1).getOperand(0));
1627 Tmp2 = SelectExpr(N.getOperand(1).getOperand(1));
1628 Tmp3 = SelectExpr(N.getOperand(0));
1629 Opc = DestType == MVT::f64 ? PPC::FMADD : PPC::FMADDS;
1630 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
1631 return Result;
1632 }
1633 Opc = DestType == MVT::f64 ? PPC::FADD : PPC::FADDS;
1634 Tmp1 = SelectExpr(N.getOperand(0));
1635 Tmp2 = SelectExpr(N.getOperand(1));
1636 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
1637 return Result;
1638 }
Nate Begemana9795f82005-03-24 04:41:43 +00001639 Tmp1 = SelectExpr(N.getOperand(0));
Chris Lattner59b21c22005-08-09 18:29:55 +00001640 if (isIntImmediate(N.getOperand(1), Tmp2)) {
Chris Lattner39c68962005-08-08 21:21:03 +00001641 Tmp3 = HA16(Tmp2);
1642 Tmp2 = Lo16(Tmp2);
1643 if (Tmp2 && Tmp3) {
1644 unsigned Reg = MakeReg(MVT::i32);
1645 BuildMI(BB, PPC::ADDI, 2, Reg).addReg(Tmp1).addSImm(Tmp2);
1646 BuildMI(BB, PPC::ADDIS, 2, Result).addReg(Reg).addSImm(Tmp3);
1647 } else if (Tmp2) {
Nate Begemana9795f82005-03-24 04:41:43 +00001648 BuildMI(BB, PPC::ADDI, 2, Result).addReg(Tmp1).addSImm(Tmp2);
Chris Lattner39c68962005-08-08 21:21:03 +00001649 } else {
1650 BuildMI(BB, PPC::ADDIS, 2, Result).addReg(Tmp1).addSImm(Tmp3);
1651 }
1652 return Result;
Nate Begemana9795f82005-03-24 04:41:43 +00001653 }
Chris Lattner39c68962005-08-08 21:21:03 +00001654
1655 Tmp2 = SelectExpr(N.getOperand(1));
1656 BuildMI(BB, PPC::ADD, 2, Result).addReg(Tmp1).addReg(Tmp2);
Nate Begemana9795f82005-03-24 04:41:43 +00001657 return Result;
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001658
Nate Begemana9795f82005-03-24 04:41:43 +00001659 case ISD::AND:
Chris Lattner59b21c22005-08-09 18:29:55 +00001660 if (isIntImmediate(N.getOperand(1), Tmp2)) {
Chris Lattner2f57c4d2005-08-08 21:24:57 +00001661 if (isShiftedMask_32(Tmp2) || isShiftedMask_32(~Tmp2)) {
1662 unsigned SH, MB, ME;
1663 Opc = Recording ? PPC::RLWINMo : PPC::RLWINM;
1664 unsigned OprOpc;
1665 if (isOprShiftImm(N.getOperand(0), OprOpc, Tmp3) &&
1666 isRotateAndMask(OprOpc, Tmp3, Tmp2, false, SH, MB, ME)) {
Nate Begemand7c4a4a2005-05-11 23:43:56 +00001667 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
Chris Lattner2f57c4d2005-08-08 21:24:57 +00001668 } else {
1669 Tmp1 = SelectExpr(N.getOperand(0));
1670 isRunOfOnes(Tmp2, MB, ME);
1671 SH = 0;
Nate Begemand7c4a4a2005-05-11 23:43:56 +00001672 }
Chris Lattner2f57c4d2005-08-08 21:24:57 +00001673 BuildMI(BB, Opc, 4, Result).addReg(Tmp1).addImm(SH)
1674 .addImm(MB).addImm(ME);
1675 RecordSuccess = true;
1676 return Result;
1677 } else if (isUInt16(Tmp2)) {
1678 Tmp2 = Lo16(Tmp2);
Chris Lattnercafb67b2005-05-09 17:39:48 +00001679 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman7ddecb42005-04-06 23:51:40 +00001680 BuildMI(BB, PPC::ANDIo, 2, Result).addReg(Tmp1).addImm(Tmp2);
Chris Lattner2f57c4d2005-08-08 21:24:57 +00001681 RecordSuccess = true;
1682 return Result;
1683 } else if (isUInt16(Tmp2)) {
1684 Tmp2 = Hi16(Tmp2);
Chris Lattnercafb67b2005-05-09 17:39:48 +00001685 Tmp1 = SelectExpr(N.getOperand(0));
Nate Begeman7ddecb42005-04-06 23:51:40 +00001686 BuildMI(BB, PPC::ANDISo, 2, Result).addReg(Tmp1).addImm(Tmp2);
Chris Lattner2f57c4d2005-08-08 21:24:57 +00001687 RecordSuccess = true;
1688 return Result;
1689 }
Nate Begeman7ddecb42005-04-06 23:51:40 +00001690 }
Chris Lattner2f57c4d2005-08-08 21:24:57 +00001691 if (isOprNot(N.getOperand(0))) {
1692 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1693 Tmp2 = SelectExpr(N.getOperand(1));
1694 BuildMI(BB, PPC::ANDC, 2, Result).addReg(Tmp2).addReg(Tmp1);
1695 RecordSuccess = false;
1696 return Result;
1697 }
1698 // emit a regular and
1699 Tmp1 = SelectExpr(N.getOperand(0));
1700 Tmp2 = SelectExpr(N.getOperand(1));
1701 Opc = Recording ? PPC::ANDo : PPC::AND;
1702 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
Nate Begemanc7bd4822005-04-11 06:34:10 +00001703 RecordSuccess = true;
Nate Begeman7ddecb42005-04-06 23:51:40 +00001704 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001705
Nate Begemana9795f82005-03-24 04:41:43 +00001706 case ISD::OR:
Nate Begeman7ddecb42005-04-06 23:51:40 +00001707 if (SelectBitfieldInsert(N, Result))
1708 return Result;
Chris Lattner5b909172005-08-08 21:30:29 +00001709
Nate Begemana9795f82005-03-24 04:41:43 +00001710 Tmp1 = SelectExpr(N.getOperand(0));
Chris Lattner59b21c22005-08-09 18:29:55 +00001711 if (isIntImmediate(N.getOperand(1), Tmp2)) {
Chris Lattner5b909172005-08-08 21:30:29 +00001712 Tmp3 = Hi16(Tmp2);
1713 Tmp2 = Lo16(Tmp2);
1714 if (Tmp2 && Tmp3) {
1715 unsigned Reg = MakeReg(MVT::i32);
1716 BuildMI(BB, PPC::ORI, 2, Reg).addReg(Tmp1).addImm(Tmp2);
1717 BuildMI(BB, PPC::ORIS, 2, Result).addReg(Reg).addImm(Tmp3);
1718 } else if (Tmp2) {
Nate Begeman7ddecb42005-04-06 23:51:40 +00001719 BuildMI(BB, PPC::ORI, 2, Result).addReg(Tmp1).addImm(Tmp2);
Chris Lattner5b909172005-08-08 21:30:29 +00001720 } else {
1721 BuildMI(BB, PPC::ORIS, 2, Result).addReg(Tmp1).addImm(Tmp3);
1722 }
1723 } else {
1724 Tmp2 = SelectExpr(N.getOperand(1));
1725 Opc = Recording ? PPC::ORo : PPC::OR;
1726 RecordSuccess = true;
1727 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
Nate Begemana9795f82005-03-24 04:41:43 +00001728 }
1729 return Result;
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001730
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001731 case ISD::XOR: {
1732 // Check for EQV: xor, (xor a, -1), b
1733 if (N.getOperand(0).getOpcode() == ISD::XOR &&
Chris Lattner59b21c22005-08-09 18:29:55 +00001734 isIntImmediate(N.getOperand(0).getOperand(1), Tmp2) &&
Chris Lattner5b909172005-08-08 21:30:29 +00001735 (signed)Tmp2 == -1) {
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001736 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1737 Tmp2 = SelectExpr(N.getOperand(1));
1738 BuildMI(BB, PPC::EQV, 2, Result).addReg(Tmp1).addReg(Tmp2);
1739 return Result;
1740 }
Chris Lattner837a5212005-04-21 21:09:11 +00001741 // Check for NOT, NOR, EQV, and NAND: xor (copy, or, xor, and), -1
Chris Lattner5b909172005-08-08 21:30:29 +00001742 if (isOprNot(N)) {
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001743 switch(N.getOperand(0).getOpcode()) {
1744 case ISD::OR:
1745 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1746 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1));
1747 BuildMI(BB, PPC::NOR, 2, Result).addReg(Tmp1).addReg(Tmp2);
1748 break;
1749 case ISD::AND:
1750 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1751 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1));
1752 BuildMI(BB, PPC::NAND, 2, Result).addReg(Tmp1).addReg(Tmp2);
1753 break;
Chris Lattner837a5212005-04-21 21:09:11 +00001754 case ISD::XOR:
1755 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1756 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1));
1757 BuildMI(BB, PPC::EQV, 2, Result).addReg(Tmp1).addReg(Tmp2);
1758 break;
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001759 default:
1760 Tmp1 = SelectExpr(N.getOperand(0));
1761 BuildMI(BB, PPC::NOR, 2, Result).addReg(Tmp1).addReg(Tmp1);
1762 break;
1763 }
1764 return Result;
1765 }
1766 Tmp1 = SelectExpr(N.getOperand(0));
Chris Lattner59b21c22005-08-09 18:29:55 +00001767 if (isIntImmediate(N.getOperand(1), Tmp2)) {
Chris Lattner5b909172005-08-08 21:30:29 +00001768 Tmp3 = Hi16(Tmp2);
1769 Tmp2 = Lo16(Tmp2);
1770 if (Tmp2 && Tmp3) {
1771 unsigned Reg = MakeReg(MVT::i32);
1772 BuildMI(BB, PPC::XORI, 2, Reg).addReg(Tmp1).addImm(Tmp2);
1773 BuildMI(BB, PPC::XORIS, 2, Result).addReg(Reg).addImm(Tmp3);
1774 } else if (Tmp2) {
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001775 BuildMI(BB, PPC::XORI, 2, Result).addReg(Tmp1).addImm(Tmp2);
Chris Lattner5b909172005-08-08 21:30:29 +00001776 } else {
1777 BuildMI(BB, PPC::XORIS, 2, Result).addReg(Tmp1).addImm(Tmp3);
1778 }
1779 } else {
1780 Tmp2 = SelectExpr(N.getOperand(1));
1781 BuildMI(BB, PPC::XOR, 2, Result).addReg(Tmp1).addReg(Tmp2);
Nate Begemanaa73a9f2005-04-03 11:20:20 +00001782 }
1783 return Result;
1784 }
1785
Chris Lattner5b909172005-08-08 21:30:29 +00001786 case ISD::SUB:
Nate Begemana3fd4002005-07-19 16:51:05 +00001787 if (!MVT::isInteger(DestType)) {
1788 if (!NoExcessFPPrecision && N.getOperand(0).getOpcode() == ISD::MUL &&
1789 N.getOperand(0).Val->hasOneUse()) {
1790 ++FusedFP; // Statistic
1791 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
1792 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1));
1793 Tmp3 = SelectExpr(N.getOperand(1));
1794 Opc = DestType == MVT::f64 ? PPC::FMSUB : PPC::FMSUBS;
1795 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
1796 return Result;
1797 }
1798 if (!NoExcessFPPrecision && N.getOperand(1).getOpcode() == ISD::MUL &&
1799 N.getOperand(1).Val->hasOneUse()) {
1800 ++FusedFP; // Statistic
1801 Tmp1 = SelectExpr(N.getOperand(1).getOperand(0));
1802 Tmp2 = SelectExpr(N.getOperand(1).getOperand(1));
1803 Tmp3 = SelectExpr(N.getOperand(0));
1804 Opc = DestType == MVT::f64 ? PPC::FNMSUB : PPC::FNMSUBS;
1805 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
1806 return Result;
1807 }
1808 Opc = DestType == MVT::f64 ? PPC::FSUB : PPC::FSUBS;
1809 Tmp1 = SelectExpr(N.getOperand(0));
1810 Tmp2 = SelectExpr(N.getOperand(1));
1811 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
1812 return Result;
1813 }
Chris Lattner59b21c22005-08-09 18:29:55 +00001814 if (isIntImmediate(N.getOperand(0), Tmp1) && isInt16(Tmp1)) {
Nate Begemand7c4a4a2005-05-11 23:43:56 +00001815 Tmp2 = SelectExpr(N.getOperand(1));
Nate Begeman27523a12005-04-02 00:42:16 +00001816 BuildMI(BB, PPC::SUBFIC, 2, Result).addReg(Tmp2).addSImm(Tmp1);
Chris Lattner5b909172005-08-08 21:30:29 +00001817 return Result;
Chris Lattner59b21c22005-08-09 18:29:55 +00001818 } else if (isIntImmediate(N.getOperand(1), Tmp2)) {
Nate Begeman27523a12005-04-02 00:42:16 +00001819 Tmp1 = SelectExpr(N.getOperand(0));
Chris Lattner5b909172005-08-08 21:30:29 +00001820 Tmp2 = -Tmp2;
1821 Tmp3 = HA16(Tmp2);
1822 Tmp2 = Lo16(Tmp2);
1823 if (Tmp2 && Tmp3) {
1824 unsigned Reg = MakeReg(MVT::i32);
1825 BuildMI(BB, PPC::ADDI, 2, Reg).addReg(Tmp1).addSImm(Tmp2);
1826 BuildMI(BB, PPC::ADDIS, 2, Result).addReg(Reg).addSImm(Tmp3);
1827 } else if (Tmp2) {
1828 BuildMI(BB, PPC::ADDI, 2, Result).addReg(Tmp1).addSImm(Tmp2);
1829 } else {
1830 BuildMI(BB, PPC::ADDIS, 2, Result).addReg(Tmp1).addSImm(Tmp3);
1831 }
1832 return Result;
1833 }
1834 Tmp1 = SelectExpr(N.getOperand(0));
1835 Tmp2 = SelectExpr(N.getOperand(1));
1836 BuildMI(BB, PPC::SUBF, 2, Result).addReg(Tmp2).addReg(Tmp1);
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001837 return Result;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001838
Nate Begeman5e966612005-03-24 06:28:42 +00001839 case ISD::MUL:
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001840 Tmp1 = SelectExpr(N.getOperand(0));
Chris Lattner59b21c22005-08-09 18:29:55 +00001841 if (isIntImmediate(N.getOperand(1), Tmp2) && isInt16(Tmp2)) {
Chris Lattnerfd784542005-08-08 21:33:23 +00001842 Tmp2 = Lo16(Tmp2);
Nate Begeman307e7442005-03-26 01:28:53 +00001843 BuildMI(BB, PPC::MULLI, 2, Result).addReg(Tmp1).addSImm(Tmp2);
Chris Lattnerfd784542005-08-08 21:33:23 +00001844 } else {
Nate Begeman307e7442005-03-26 01:28:53 +00001845 Tmp2 = SelectExpr(N.getOperand(1));
Nate Begemana3fd4002005-07-19 16:51:05 +00001846 switch (DestType) {
1847 default: assert(0 && "Unknown type to ISD::MUL"); break;
1848 case MVT::i32: Opc = PPC::MULLW; break;
1849 case MVT::f32: Opc = PPC::FMULS; break;
1850 case MVT::f64: Opc = PPC::FMUL; break;
1851 }
1852 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
Nate Begeman307e7442005-03-26 01:28:53 +00001853 }
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001854 return Result;
1855
Nate Begeman815d6da2005-04-06 00:25:27 +00001856 case ISD::MULHS:
1857 case ISD::MULHU:
1858 Tmp1 = SelectExpr(N.getOperand(0));
1859 Tmp2 = SelectExpr(N.getOperand(1));
1860 Opc = (ISD::MULHU == opcode) ? PPC::MULHWU : PPC::MULHW;
1861 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
1862 return Result;
1863
Nate Begemanf3d08f32005-03-29 00:03:27 +00001864 case ISD::SDIV:
Chris Lattner59b21c22005-08-09 18:29:55 +00001865 if (isIntImmediate(N.getOperand(1), Tmp3)) {
Chris Lattnerfd784542005-08-08 21:33:23 +00001866 if ((signed)Tmp3 > 0 && isPowerOf2_32(Tmp3)) {
1867 Tmp3 = Log2_32(Tmp3);
1868 Tmp1 = MakeReg(MVT::i32);
1869 Tmp2 = SelectExpr(N.getOperand(0));
Nate Begeman9f833d32005-04-12 00:10:02 +00001870 BuildMI(BB, PPC::SRAWI, 2, Tmp1).addReg(Tmp2).addImm(Tmp3);
1871 BuildMI(BB, PPC::ADDZE, 1, Result).addReg(Tmp1);
Chris Lattnerfd784542005-08-08 21:33:23 +00001872 return Result;
1873 } else if ((signed)Tmp3 < 0 && isPowerOf2_32(-Tmp3)) {
1874 Tmp3 = Log2_32(-Tmp3);
Chris Lattner2f460552005-08-09 18:08:41 +00001875 Tmp2 = SelectExpr(N.getOperand(0));
1876 Tmp1 = MakeReg(MVT::i32);
Chris Lattnerfd784542005-08-08 21:33:23 +00001877 unsigned Tmp4 = MakeReg(MVT::i32);
1878 BuildMI(BB, PPC::SRAWI, 2, Tmp1).addReg(Tmp2).addImm(Tmp3);
1879 BuildMI(BB, PPC::ADDZE, 1, Tmp4).addReg(Tmp1);
1880 BuildMI(BB, PPC::NEG, 1, Result).addReg(Tmp4);
1881 return Result;
Nate Begeman9f833d32005-04-12 00:10:02 +00001882 }
Chris Lattnerfd784542005-08-08 21:33:23 +00001883 }
1884 // fall thru
1885 case ISD::UDIV:
Nate Begeman815d6da2005-04-06 00:25:27 +00001886 // If this is a divide by constant, we can emit code using some magic
1887 // constants to implement it as a multiply instead.
Chris Lattner59b21c22005-08-09 18:29:55 +00001888 if (isIntImmediate(N.getOperand(1), Tmp3)) {
Chris Lattnerfd784542005-08-08 21:33:23 +00001889 if (opcode == ISD::SDIV) {
1890 if ((signed)Tmp3 < -1 || (signed)Tmp3 > 1) {
1891 ExprMap.erase(N);
1892 return SelectExpr(BuildSDIVSequence(N));
1893 }
1894 } else {
1895 if ((signed)Tmp3 > 1) {
1896 ExprMap.erase(N);
1897 return SelectExpr(BuildUDIVSequence(N));
1898 }
1899 }
Jeff Cohen00b168892005-07-27 06:12:32 +00001900 }
Nate Begemanf3d08f32005-03-29 00:03:27 +00001901 Tmp1 = SelectExpr(N.getOperand(0));
1902 Tmp2 = SelectExpr(N.getOperand(1));
Nate Begemana3fd4002005-07-19 16:51:05 +00001903 switch (DestType) {
1904 default: assert(0 && "Unknown type to ISD::SDIV"); break;
1905 case MVT::i32: Opc = (ISD::UDIV == opcode) ? PPC::DIVWU : PPC::DIVW; break;
1906 case MVT::f32: Opc = PPC::FDIVS; break;
1907 case MVT::f64: Opc = PPC::FDIV; break;
1908 }
Nate Begemanf3d08f32005-03-29 00:03:27 +00001909 BuildMI(BB, Opc, 2, Result).addReg(Tmp1).addReg(Tmp2);
1910 return Result;
1911
Nate Begeman9e3e1b52005-03-24 23:35:30 +00001912 case ISD::ADD_PARTS:
Nate Begemanca12a2b2005-03-28 22:28:37 +00001913 case ISD::SUB_PARTS: {
1914 assert(N.getNumOperands() == 4 && N.getValueType() == MVT::i32 &&
1915 "Not an i64 add/sub!");
1916 // Emit all of the operands.
1917 std::vector<unsigned> InVals;
1918 for (unsigned i = 0, e = N.getNumOperands(); i != e; ++i)
1919 InVals.push_back(SelectExpr(N.getOperand(i)));
1920 if (N.getOpcode() == ISD::ADD_PARTS) {
Nate Begeman27eeb002005-04-02 05:59:34 +00001921 BuildMI(BB, PPC::ADDC, 2, Result).addReg(InVals[0]).addReg(InVals[2]);
1922 BuildMI(BB, PPC::ADDE, 2, Result+1).addReg(InVals[1]).addReg(InVals[3]);
Nate Begemanca12a2b2005-03-28 22:28:37 +00001923 } else {
Nate Begeman27eeb002005-04-02 05:59:34 +00001924 BuildMI(BB, PPC::SUBFC, 2, Result).addReg(InVals[2]).addReg(InVals[0]);
1925 BuildMI(BB, PPC::SUBFE, 2, Result+1).addReg(InVals[3]).addReg(InVals[1]);
1926 }
1927 return Result+N.ResNo;
1928 }
1929
1930 case ISD::SHL_PARTS:
1931 case ISD::SRA_PARTS:
1932 case ISD::SRL_PARTS: {
1933 assert(N.getNumOperands() == 3 && N.getValueType() == MVT::i32 &&
1934 "Not an i64 shift!");
1935 unsigned ShiftOpLo = SelectExpr(N.getOperand(0));
1936 unsigned ShiftOpHi = SelectExpr(N.getOperand(1));
Nate Begeman3664cef2005-04-13 22:14:14 +00001937 unsigned SHReg = FoldIfWideZeroExtend(N.getOperand(2));
1938 Tmp1 = MakeReg(MVT::i32);
1939 Tmp2 = MakeReg(MVT::i32);
Nate Begeman27eeb002005-04-02 05:59:34 +00001940 Tmp3 = MakeReg(MVT::i32);
1941 unsigned Tmp4 = MakeReg(MVT::i32);
1942 unsigned Tmp5 = MakeReg(MVT::i32);
1943 unsigned Tmp6 = MakeReg(MVT::i32);
1944 BuildMI(BB, PPC::SUBFIC, 2, Tmp1).addReg(SHReg).addSImm(32);
1945 if (ISD::SHL_PARTS == opcode) {
1946 BuildMI(BB, PPC::SLW, 2, Tmp2).addReg(ShiftOpHi).addReg(SHReg);
1947 BuildMI(BB, PPC::SRW, 2, Tmp3).addReg(ShiftOpLo).addReg(Tmp1);
1948 BuildMI(BB, PPC::OR, 2, Tmp4).addReg(Tmp2).addReg(Tmp3);
1949 BuildMI(BB, PPC::ADDI, 2, Tmp5).addReg(SHReg).addSImm(-32);
Nate Begemanfa554702005-04-03 22:13:27 +00001950 BuildMI(BB, PPC::SLW, 2, Tmp6).addReg(ShiftOpLo).addReg(Tmp5);
Nate Begeman27eeb002005-04-02 05:59:34 +00001951 BuildMI(BB, PPC::OR, 2, Result+1).addReg(Tmp4).addReg(Tmp6);
1952 BuildMI(BB, PPC::SLW, 2, Result).addReg(ShiftOpLo).addReg(SHReg);
1953 } else if (ISD::SRL_PARTS == opcode) {
1954 BuildMI(BB, PPC::SRW, 2, Tmp2).addReg(ShiftOpLo).addReg(SHReg);
1955 BuildMI(BB, PPC::SLW, 2, Tmp3).addReg(ShiftOpHi).addReg(Tmp1);
1956 BuildMI(BB, PPC::OR, 2, Tmp4).addReg(Tmp2).addReg(Tmp3);
1957 BuildMI(BB, PPC::ADDI, 2, Tmp5).addReg(SHReg).addSImm(-32);
1958 BuildMI(BB, PPC::SRW, 2, Tmp6).addReg(ShiftOpHi).addReg(Tmp5);
1959 BuildMI(BB, PPC::OR, 2, Result).addReg(Tmp4).addReg(Tmp6);
1960 BuildMI(BB, PPC::SRW, 2, Result+1).addReg(ShiftOpHi).addReg(SHReg);
1961 } else {
1962 MachineBasicBlock *TmpMBB = new MachineBasicBlock(BB->getBasicBlock());
1963 MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock());
1964 MachineBasicBlock *OldMBB = BB;
1965 MachineFunction *F = BB->getParent();
1966 ilist<MachineBasicBlock>::iterator It = BB; ++It;
1967 F->getBasicBlockList().insert(It, TmpMBB);
1968 F->getBasicBlockList().insert(It, PhiMBB);
1969 BB->addSuccessor(TmpMBB);
1970 BB->addSuccessor(PhiMBB);
1971 BuildMI(BB, PPC::SRW, 2, Tmp2).addReg(ShiftOpLo).addReg(SHReg);
1972 BuildMI(BB, PPC::SLW, 2, Tmp3).addReg(ShiftOpHi).addReg(Tmp1);
1973 BuildMI(BB, PPC::OR, 2, Tmp4).addReg(Tmp2).addReg(Tmp3);
1974 BuildMI(BB, PPC::ADDICo, 2, Tmp5).addReg(SHReg).addSImm(-32);
1975 BuildMI(BB, PPC::SRAW, 2, Tmp6).addReg(ShiftOpHi).addReg(Tmp5);
1976 BuildMI(BB, PPC::SRAW, 2, Result+1).addReg(ShiftOpHi).addReg(SHReg);
1977 BuildMI(BB, PPC::BLE, 2).addReg(PPC::CR0).addMBB(PhiMBB);
1978 // Select correct least significant half if the shift amount > 32
1979 BB = TmpMBB;
1980 unsigned Tmp7 = MakeReg(MVT::i32);
1981 BuildMI(BB, PPC::OR, 2, Tmp7).addReg(Tmp6).addReg(Tmp6);
1982 TmpMBB->addSuccessor(PhiMBB);
1983 BB = PhiMBB;
1984 BuildMI(BB, PPC::PHI, 4, Result).addReg(Tmp4).addMBB(OldMBB)
1985 .addReg(Tmp7).addMBB(TmpMBB);
Nate Begemanca12a2b2005-03-28 22:28:37 +00001986 }
1987 return Result+N.ResNo;
1988 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001989
Nate Begemana9795f82005-03-24 04:41:43 +00001990 case ISD::FP_TO_UINT:
Nate Begeman6b559972005-04-01 02:59:27 +00001991 case ISD::FP_TO_SINT: {
1992 bool U = (ISD::FP_TO_UINT == opcode);
1993 Tmp1 = SelectExpr(N.getOperand(0));
1994 if (!U) {
1995 Tmp2 = MakeReg(MVT::f64);
1996 BuildMI(BB, PPC::FCTIWZ, 1, Tmp2).addReg(Tmp1);
1997 int FrameIdx = BB->getParent()->getFrameInfo()->CreateStackObject(8, 8);
1998 addFrameReference(BuildMI(BB, PPC::STFD, 3).addReg(Tmp2), FrameIdx);
1999 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Result), FrameIdx, 4);
2000 return Result;
2001 } else {
2002 unsigned Zero = getConstDouble(0.0);
2003 unsigned MaxInt = getConstDouble((1LL << 32) - 1);
2004 unsigned Border = getConstDouble(1LL << 31);
2005 unsigned UseZero = MakeReg(MVT::f64);
2006 unsigned UseMaxInt = MakeReg(MVT::f64);
2007 unsigned UseChoice = MakeReg(MVT::f64);
2008 unsigned TmpReg = MakeReg(MVT::f64);
2009 unsigned TmpReg2 = MakeReg(MVT::f64);
2010 unsigned ConvReg = MakeReg(MVT::f64);
2011 unsigned IntTmp = MakeReg(MVT::i32);
2012 unsigned XorReg = MakeReg(MVT::i32);
2013 MachineFunction *F = BB->getParent();
2014 int FrameIdx = F->getFrameInfo()->CreateStackObject(8, 8);
2015 // Update machine-CFG edges
2016 MachineBasicBlock *XorMBB = new MachineBasicBlock(BB->getBasicBlock());
2017 MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock());
2018 MachineBasicBlock *OldMBB = BB;
2019 ilist<MachineBasicBlock>::iterator It = BB; ++It;
2020 F->getBasicBlockList().insert(It, XorMBB);
2021 F->getBasicBlockList().insert(It, PhiMBB);
2022 BB->addSuccessor(XorMBB);
2023 BB->addSuccessor(PhiMBB);
2024 // Convert from floating point to unsigned 32-bit value
2025 // Use 0 if incoming value is < 0.0
2026 BuildMI(BB, PPC::FSEL, 3, UseZero).addReg(Tmp1).addReg(Tmp1).addReg(Zero);
2027 // Use 2**32 - 1 if incoming value is >= 2**32
2028 BuildMI(BB, PPC::FSUB, 2, UseMaxInt).addReg(MaxInt).addReg(Tmp1);
2029 BuildMI(BB, PPC::FSEL, 3, UseChoice).addReg(UseMaxInt).addReg(UseZero)
2030 .addReg(MaxInt);
2031 // Subtract 2**31
2032 BuildMI(BB, PPC::FSUB, 2, TmpReg).addReg(UseChoice).addReg(Border);
2033 // Use difference if >= 2**31
2034 BuildMI(BB, PPC::FCMPU, 2, PPC::CR0).addReg(UseChoice).addReg(Border);
2035 BuildMI(BB, PPC::FSEL, 3, TmpReg2).addReg(TmpReg).addReg(TmpReg)
2036 .addReg(UseChoice);
2037 // Convert to integer
2038 BuildMI(BB, PPC::FCTIWZ, 1, ConvReg).addReg(TmpReg2);
2039 addFrameReference(BuildMI(BB, PPC::STFD, 3).addReg(ConvReg), FrameIdx);
2040 addFrameReference(BuildMI(BB, PPC::LWZ, 2, IntTmp), FrameIdx, 4);
2041 BuildMI(BB, PPC::BLT, 2).addReg(PPC::CR0).addMBB(PhiMBB);
2042 BuildMI(BB, PPC::B, 1).addMBB(XorMBB);
2043
2044 // XorMBB:
2045 // add 2**31 if input was >= 2**31
2046 BB = XorMBB;
2047 BuildMI(BB, PPC::XORIS, 2, XorReg).addReg(IntTmp).addImm(0x8000);
2048 XorMBB->addSuccessor(PhiMBB);
2049
2050 // PhiMBB:
2051 // DestReg = phi [ IntTmp, OldMBB ], [ XorReg, XorMBB ]
2052 BB = PhiMBB;
2053 BuildMI(BB, PPC::PHI, 4, Result).addReg(IntTmp).addMBB(OldMBB)
2054 .addReg(XorReg).addMBB(XorMBB);
2055 return Result;
2056 }
2057 assert(0 && "Should never get here");
2058 return 0;
2059 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002060
Chris Lattner88ac32c2005-08-09 20:21:10 +00002061 case ISD::SETCC: {
2062 ISD::CondCode CC = cast<CondCodeSDNode>(Node->getOperand(2))->get();
2063 if (isIntImmediate(Node->getOperand(1), Tmp3)) {
2064 // We can codegen setcc op, imm very efficiently compared to a brcond.
2065 // Check for those cases here.
2066 // setcc op, 0
2067 if (Tmp3 == 0) {
2068 Tmp1 = SelectExpr(Node->getOperand(0));
2069 switch (CC) {
2070 default: Node->dump(); assert(0 && "Unhandled SetCC condition"); abort();
2071 case ISD::SETEQ:
2072 Tmp2 = MakeReg(MVT::i32);
2073 BuildMI(BB, PPC::CNTLZW, 1, Tmp2).addReg(Tmp1);
2074 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp2).addImm(27)
2075 .addImm(5).addImm(31);
2076 break;
2077 case ISD::SETNE:
2078 Tmp2 = MakeReg(MVT::i32);
2079 BuildMI(BB, PPC::ADDIC, 2, Tmp2).addReg(Tmp1).addSImm(-1);
2080 BuildMI(BB, PPC::SUBFE, 2, Result).addReg(Tmp2).addReg(Tmp1);
2081 break;
2082 case ISD::SETLT:
2083 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp1).addImm(1)
2084 .addImm(31).addImm(31);
2085 break;
2086 case ISD::SETGT:
2087 Tmp2 = MakeReg(MVT::i32);
2088 Tmp3 = MakeReg(MVT::i32);
2089 BuildMI(BB, PPC::NEG, 2, Tmp2).addReg(Tmp1);
2090 BuildMI(BB, PPC::ANDC, 2, Tmp3).addReg(Tmp2).addReg(Tmp1);
2091 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp3).addImm(1)
2092 .addImm(31).addImm(31);
2093 break;
Nate Begeman9765c252005-04-12 21:22:28 +00002094 }
Chris Lattner88ac32c2005-08-09 20:21:10 +00002095 return Result;
2096 } else if (Tmp3 == ~0U) { // setcc op, -1
2097 Tmp1 = SelectExpr(Node->getOperand(0));
2098 switch (CC) {
2099 default: assert(0 && "Unhandled SetCC condition"); abort();
2100 case ISD::SETEQ:
2101 Tmp2 = MakeReg(MVT::i32);
2102 Tmp3 = MakeReg(MVT::i32);
2103 BuildMI(BB, PPC::ADDIC, 2, Tmp2).addReg(Tmp1).addSImm(1);
2104 BuildMI(BB, PPC::LI, 1, Tmp3).addSImm(0);
2105 BuildMI(BB, PPC::ADDZE, 1, Result).addReg(Tmp3);
2106 break;
2107 case ISD::SETNE:
2108 Tmp2 = MakeReg(MVT::i32);
2109 Tmp3 = MakeReg(MVT::i32);
2110 BuildMI(BB, PPC::NOR, 2, Tmp2).addReg(Tmp1).addReg(Tmp1);
2111 BuildMI(BB, PPC::ADDIC, 2, Tmp3).addReg(Tmp2).addSImm(-1);
2112 BuildMI(BB, PPC::SUBFE, 2, Result).addReg(Tmp3).addReg(Tmp2);
2113 break;
2114 case ISD::SETLT:
2115 Tmp2 = MakeReg(MVT::i32);
2116 Tmp3 = MakeReg(MVT::i32);
2117 BuildMI(BB, PPC::ADDI, 2, Tmp2).addReg(Tmp1).addSImm(1);
2118 BuildMI(BB, PPC::AND, 2, Tmp3).addReg(Tmp2).addReg(Tmp1);
2119 BuildMI(BB, PPC::RLWINM, 4, Result).addReg(Tmp3).addImm(1)
2120 .addImm(31).addImm(31);
2121 break;
2122 case ISD::SETGT:
2123 Tmp2 = MakeReg(MVT::i32);
2124 BuildMI(BB, PPC::RLWINM, 4, Tmp2).addReg(Tmp1).addImm(1)
2125 .addImm(31).addImm(31);
2126 BuildMI(BB, PPC::XORI, 2, Result).addReg(Tmp2).addImm(1);
2127 break;
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002128 }
Chris Lattner88ac32c2005-08-09 20:21:10 +00002129 return Result;
Nate Begeman7e7fadd2005-04-07 20:30:01 +00002130 }
Nate Begeman33162522005-03-29 21:54:38 +00002131 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002132
Chris Lattner88ac32c2005-08-09 20:21:10 +00002133 bool Inv;
2134 unsigned CCReg = SelectCC(N, Opc, Inv, Tmp2);
2135 MoveCRtoGPR(CCReg, Inv, Tmp2, Result);
2136 return Result;
2137 }
Nate Begeman74747862005-03-29 22:24:51 +00002138 case ISD::SELECT: {
Chris Lattner88ac32c2005-08-09 20:21:10 +00002139 SDNode *Cond = N.getOperand(0).Val;
2140 ISD::CondCode CC;
2141 if (Cond->getOpcode() == ISD::SETCC &&
Nate Begemana3fd4002005-07-19 16:51:05 +00002142 !MVT::isInteger(N.getOperand(1).getValueType()) &&
Chris Lattner979a21e2005-08-10 03:40:09 +00002143 !MVT::isInteger(Cond->getOperand(1).getValueType()) &&
Chris Lattner88ac32c2005-08-09 20:21:10 +00002144 cast<CondCodeSDNode>(Cond->getOperand(2))->get() != ISD::SETEQ &&
2145 cast<CondCodeSDNode>(Cond->getOperand(2))->get() != ISD::SETNE) {
2146 MVT::ValueType VT = Cond->getOperand(0).getValueType();
2147 ISD::CondCode CC = cast<CondCodeSDNode>(Cond->getOperand(2))->get();
Nate Begemana3fd4002005-07-19 16:51:05 +00002148 unsigned TV = SelectExpr(N.getOperand(1)); // Use if TRUE
2149 unsigned FV = SelectExpr(N.getOperand(2)); // Use if FALSE
2150
Chris Lattner88ac32c2005-08-09 20:21:10 +00002151 ConstantFPSDNode *CN = dyn_cast<ConstantFPSDNode>(Cond->getOperand(1));
Nate Begemana3fd4002005-07-19 16:51:05 +00002152 if (CN && (CN->isExactlyValue(-0.0) || CN->isExactlyValue(0.0))) {
Chris Lattner88ac32c2005-08-09 20:21:10 +00002153 switch(CC) {
Nate Begemana3fd4002005-07-19 16:51:05 +00002154 default: assert(0 && "Invalid FSEL condition"); abort();
2155 case ISD::SETULT:
2156 case ISD::SETLT:
2157 std::swap(TV, FV); // fsel is natively setge, swap operands for setlt
2158 case ISD::SETUGE:
2159 case ISD::SETGE:
Chris Lattner88ac32c2005-08-09 20:21:10 +00002160 Tmp1 = SelectExpr(Cond->getOperand(0)); // Val to compare against
Nate Begemana3fd4002005-07-19 16:51:05 +00002161 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp1).addReg(TV).addReg(FV);
2162 return Result;
2163 case ISD::SETUGT:
2164 case ISD::SETGT:
2165 std::swap(TV, FV); // fsel is natively setge, swap operands for setlt
2166 case ISD::SETULE:
2167 case ISD::SETLE: {
Chris Lattner88ac32c2005-08-09 20:21:10 +00002168 if (Cond->getOperand(0).getOpcode() == ISD::FNEG) {
2169 Tmp2 = SelectExpr(Cond->getOperand(0).getOperand(0));
Nate Begemana3fd4002005-07-19 16:51:05 +00002170 } else {
2171 Tmp2 = MakeReg(VT);
Chris Lattner88ac32c2005-08-09 20:21:10 +00002172 Tmp1 = SelectExpr(Cond->getOperand(0)); // Val to compare against
Nate Begemana3fd4002005-07-19 16:51:05 +00002173 BuildMI(BB, PPC::FNEG, 1, Tmp2).addReg(Tmp1);
2174 }
2175 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp2).addReg(TV).addReg(FV);
2176 return Result;
2177 }
2178 }
2179 } else {
2180 Opc = (MVT::f64 == VT) ? PPC::FSUB : PPC::FSUBS;
Chris Lattner88ac32c2005-08-09 20:21:10 +00002181 Tmp1 = SelectExpr(Cond->getOperand(0)); // Val to compare against
2182 Tmp2 = SelectExpr(Cond->getOperand(1));
Nate Begemana3fd4002005-07-19 16:51:05 +00002183 Tmp3 = MakeReg(VT);
Chris Lattner88ac32c2005-08-09 20:21:10 +00002184 switch(CC) {
Nate Begemana3fd4002005-07-19 16:51:05 +00002185 default: assert(0 && "Invalid FSEL condition"); abort();
2186 case ISD::SETULT:
2187 case ISD::SETLT:
2188 BuildMI(BB, Opc, 2, Tmp3).addReg(Tmp1).addReg(Tmp2);
2189 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp3).addReg(FV).addReg(TV);
2190 return Result;
2191 case ISD::SETUGE:
2192 case ISD::SETGE:
2193 BuildMI(BB, Opc, 2, Tmp3).addReg(Tmp1).addReg(Tmp2);
2194 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp3).addReg(TV).addReg(FV);
2195 return Result;
2196 case ISD::SETUGT:
2197 case ISD::SETGT:
2198 BuildMI(BB, Opc, 2, Tmp3).addReg(Tmp2).addReg(Tmp1);
2199 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp3).addReg(FV).addReg(TV);
2200 return Result;
2201 case ISD::SETULE:
2202 case ISD::SETLE:
2203 BuildMI(BB, Opc, 2, Tmp3).addReg(Tmp2).addReg(Tmp1);
2204 BuildMI(BB, PPC::FSEL, 3, Result).addReg(Tmp3).addReg(TV).addReg(FV);
2205 return Result;
2206 }
2207 }
2208 assert(0 && "Should never get here");
Nate Begemana3fd4002005-07-19 16:51:05 +00002209 }
2210
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00002211 bool Inv;
Chris Lattner30710192005-04-01 07:10:02 +00002212 unsigned TrueValue = SelectExpr(N.getOperand(1)); //Use if TRUE
2213 unsigned FalseValue = SelectExpr(N.getOperand(2)); //Use if FALSE
Nate Begeman1cbf3ab2005-04-18 07:48:09 +00002214 unsigned CCReg = SelectCC(N.getOperand(0), Opc, Inv, Tmp3);
Chris Lattner30710192005-04-01 07:10:02 +00002215
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002216 // Create an iterator with which to insert the MBB for copying the false
Nate Begeman74747862005-03-29 22:24:51 +00002217 // value and the MBB to hold the PHI instruction for this SetCC.
2218 MachineBasicBlock *thisMBB = BB;
2219 const BasicBlock *LLVM_BB = BB->getBasicBlock();
2220 ilist<MachineBasicBlock>::iterator It = BB;
2221 ++It;
2222
2223 // thisMBB:
2224 // ...
2225 // TrueVal = ...
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00002226 // cmpTY ccX, r1, r2
Nate Begeman74747862005-03-29 22:24:51 +00002227 // bCC copy1MBB
2228 // fallthrough --> copy0MBB
Nate Begeman74747862005-03-29 22:24:51 +00002229 MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB);
2230 MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB);
Nate Begeman1b7f7fb2005-04-13 23:15:44 +00002231 BuildMI(BB, Opc, 2).addReg(CCReg).addMBB(sinkMBB);
Nate Begeman74747862005-03-29 22:24:51 +00002232 MachineFunction *F = BB->getParent();
2233 F->getBasicBlockList().insert(It, copy0MBB);
2234 F->getBasicBlockList().insert(It, sinkMBB);
2235 // Update machine-CFG edges
2236 BB->addSuccessor(copy0MBB);
2237 BB->addSuccessor(sinkMBB);
2238
2239 // copy0MBB:
2240 // %FalseValue = ...
2241 // # fallthrough to sinkMBB
2242 BB = copy0MBB;
Nate Begeman74747862005-03-29 22:24:51 +00002243 // Update machine-CFG edges
2244 BB->addSuccessor(sinkMBB);
2245
2246 // sinkMBB:
2247 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
2248 // ...
2249 BB = sinkMBB;
2250 BuildMI(BB, PPC::PHI, 4, Result).addReg(FalseValue)
2251 .addMBB(copy0MBB).addReg(TrueValue).addMBB(thisMBB);
Nate Begeman74747862005-03-29 22:24:51 +00002252 return Result;
2253 }
Nate Begemana9795f82005-03-24 04:41:43 +00002254
2255 case ISD::Constant:
2256 switch (N.getValueType()) {
2257 default: assert(0 && "Cannot use constants of this type!");
2258 case MVT::i1:
2259 BuildMI(BB, PPC::LI, 1, Result)
2260 .addSImm(!cast<ConstantSDNode>(N)->isNullValue());
2261 break;
2262 case MVT::i32:
2263 {
2264 int v = (int)cast<ConstantSDNode>(N)->getSignExtended();
2265 if (v < 32768 && v >= -32768) {
2266 BuildMI(BB, PPC::LI, 1, Result).addSImm(v);
2267 } else {
Nate Begeman5e966612005-03-24 06:28:42 +00002268 Tmp1 = MakeReg(MVT::i32);
2269 BuildMI(BB, PPC::LIS, 1, Tmp1).addSImm(v >> 16);
2270 BuildMI(BB, PPC::ORI, 2, Result).addReg(Tmp1).addImm(v & 0xFFFF);
Nate Begemana9795f82005-03-24 04:41:43 +00002271 }
2272 }
2273 }
2274 return Result;
Nate Begemana3fd4002005-07-19 16:51:05 +00002275
2276 case ISD::ConstantFP: {
2277 ConstantFPSDNode *CN = cast<ConstantFPSDNode>(N);
2278 Result = getConstDouble(CN->getValue(), Result);
2279 return Result;
Nate Begemana9795f82005-03-24 04:41:43 +00002280 }
2281
Nate Begemana3fd4002005-07-19 16:51:05 +00002282 case ISD::FNEG:
2283 if (!NoExcessFPPrecision &&
2284 ISD::ADD == N.getOperand(0).getOpcode() &&
2285 N.getOperand(0).Val->hasOneUse() &&
2286 ISD::MUL == N.getOperand(0).getOperand(0).getOpcode() &&
2287 N.getOperand(0).getOperand(0).Val->hasOneUse()) {
2288 ++FusedFP; // Statistic
2289 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0).getOperand(0));
2290 Tmp2 = SelectExpr(N.getOperand(0).getOperand(0).getOperand(1));
2291 Tmp3 = SelectExpr(N.getOperand(0).getOperand(1));
2292 Opc = DestType == MVT::f64 ? PPC::FNMADD : PPC::FNMADDS;
2293 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
2294 } else if (!NoExcessFPPrecision &&
2295 ISD::ADD == N.getOperand(0).getOpcode() &&
2296 N.getOperand(0).Val->hasOneUse() &&
2297 ISD::MUL == N.getOperand(0).getOperand(1).getOpcode() &&
2298 N.getOperand(0).getOperand(1).Val->hasOneUse()) {
2299 ++FusedFP; // Statistic
2300 Tmp1 = SelectExpr(N.getOperand(0).getOperand(1).getOperand(0));
2301 Tmp2 = SelectExpr(N.getOperand(0).getOperand(1).getOperand(1));
2302 Tmp3 = SelectExpr(N.getOperand(0).getOperand(0));
2303 Opc = DestType == MVT::f64 ? PPC::FNMADD : PPC::FNMADDS;
2304 BuildMI(BB, Opc, 3, Result).addReg(Tmp1).addReg(Tmp2).addReg(Tmp3);
2305 } else if (ISD::FABS == N.getOperand(0).getOpcode()) {
2306 Tmp1 = SelectExpr(N.getOperand(0).getOperand(0));
2307 BuildMI(BB, PPC::FNABS, 1, Result).addReg(Tmp1);
2308 } else {
2309 Tmp1 = SelectExpr(N.getOperand(0));
2310 BuildMI(BB, PPC::FNEG, 1, Result).addReg(Tmp1);
2311 }
2312 return Result;
2313
2314 case ISD::FABS:
2315 Tmp1 = SelectExpr(N.getOperand(0));
2316 BuildMI(BB, PPC::FABS, 1, Result).addReg(Tmp1);
2317 return Result;
2318
Nate Begemanadeb43d2005-07-20 22:42:00 +00002319 case ISD::FSQRT:
2320 Tmp1 = SelectExpr(N.getOperand(0));
2321 Opc = DestType == MVT::f64 ? PPC::FSQRT : PPC::FSQRTS;
2322 BuildMI(BB, Opc, 1, Result).addReg(Tmp1);
2323 return Result;
2324
Nate Begemana3fd4002005-07-19 16:51:05 +00002325 case ISD::FP_ROUND:
2326 assert (DestType == MVT::f32 &&
2327 N.getOperand(0).getValueType() == MVT::f64 &&
2328 "only f64 to f32 conversion supported here");
2329 Tmp1 = SelectExpr(N.getOperand(0));
2330 BuildMI(BB, PPC::FRSP, 1, Result).addReg(Tmp1);
2331 return Result;
2332
2333 case ISD::FP_EXTEND:
2334 assert (DestType == MVT::f64 &&
2335 N.getOperand(0).getValueType() == MVT::f32 &&
2336 "only f32 to f64 conversion supported here");
2337 Tmp1 = SelectExpr(N.getOperand(0));
2338 BuildMI(BB, PPC::FMR, 1, Result).addReg(Tmp1);
2339 return Result;
2340
2341 case ISD::UINT_TO_FP:
2342 case ISD::SINT_TO_FP: {
2343 assert (N.getOperand(0).getValueType() == MVT::i32
2344 && "int to float must operate on i32");
2345 bool IsUnsigned = (ISD::UINT_TO_FP == opcode);
2346 Tmp1 = SelectExpr(N.getOperand(0)); // Get the operand register
2347 Tmp2 = MakeReg(MVT::f64); // temp reg to load the integer value into
2348 Tmp3 = MakeReg(MVT::i32); // temp reg to hold the conversion constant
2349
2350 int FrameIdx = BB->getParent()->getFrameInfo()->CreateStackObject(8, 8);
2351 MachineConstantPool *CP = BB->getParent()->getConstantPool();
2352
2353 if (IsUnsigned) {
2354 unsigned ConstF = getConstDouble(0x1.000000p52);
2355 // Store the hi & low halves of the fp value, currently in int regs
2356 BuildMI(BB, PPC::LIS, 1, Tmp3).addSImm(0x4330);
2357 addFrameReference(BuildMI(BB, PPC::STW, 3).addReg(Tmp3), FrameIdx);
2358 addFrameReference(BuildMI(BB, PPC::STW, 3).addReg(Tmp1), FrameIdx, 4);
2359 addFrameReference(BuildMI(BB, PPC::LFD, 2, Tmp2), FrameIdx);
2360 // Generate the return value with a subtract
2361 BuildMI(BB, PPC::FSUB, 2, Result).addReg(Tmp2).addReg(ConstF);
2362 } else {
2363 unsigned ConstF = getConstDouble(0x1.000008p52);
2364 unsigned TmpL = MakeReg(MVT::i32);
2365 // Store the hi & low halves of the fp value, currently in int regs
2366 BuildMI(BB, PPC::LIS, 1, Tmp3).addSImm(0x4330);
2367 addFrameReference(BuildMI(BB, PPC::STW, 3).addReg(Tmp3), FrameIdx);
2368 BuildMI(BB, PPC::XORIS, 2, TmpL).addReg(Tmp1).addImm(0x8000);
2369 addFrameReference(BuildMI(BB, PPC::STW, 3).addReg(TmpL), FrameIdx, 4);
2370 addFrameReference(BuildMI(BB, PPC::LFD, 2, Tmp2), FrameIdx);
2371 // Generate the return value with a subtract
2372 BuildMI(BB, PPC::FSUB, 2, Result).addReg(Tmp2).addReg(ConstF);
2373 }
2374 return Result;
2375 }
2376 }
Nate Begemana9795f82005-03-24 04:41:43 +00002377 return 0;
2378}
2379
2380void ISel::Select(SDOperand N) {
Nate Begeman2497e632005-07-21 20:44:43 +00002381 unsigned Tmp1, Tmp2, Tmp3, Opc;
Nate Begemana9795f82005-03-24 04:41:43 +00002382 unsigned opcode = N.getOpcode();
2383
2384 if (!ExprMap.insert(std::make_pair(N, 1)).second)
2385 return; // Already selected.
2386
2387 SDNode *Node = N.Val;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002388
Nate Begemana9795f82005-03-24 04:41:43 +00002389 switch (Node->getOpcode()) {
2390 default:
2391 Node->dump(); std::cerr << "\n";
2392 assert(0 && "Node not handled yet!");
2393 case ISD::EntryToken: return; // Noop
2394 case ISD::TokenFactor:
2395 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
2396 Select(Node->getOperand(i));
2397 return;
Chris Lattner16cd04d2005-05-12 23:24:06 +00002398 case ISD::CALLSEQ_START:
2399 case ISD::CALLSEQ_END:
Nate Begemana9795f82005-03-24 04:41:43 +00002400 Select(N.getOperand(0));
2401 Tmp1 = cast<ConstantSDNode>(N.getOperand(1))->getValue();
Chris Lattner16cd04d2005-05-12 23:24:06 +00002402 Opc = N.getOpcode() == ISD::CALLSEQ_START ? PPC::ADJCALLSTACKDOWN :
Nate Begemana9795f82005-03-24 04:41:43 +00002403 PPC::ADJCALLSTACKUP;
2404 BuildMI(BB, Opc, 1).addImm(Tmp1);
2405 return;
2406 case ISD::BR: {
2407 MachineBasicBlock *Dest =
2408 cast<BasicBlockSDNode>(N.getOperand(1))->getBasicBlock();
Nate Begemana9795f82005-03-24 04:41:43 +00002409 Select(N.getOperand(0));
2410 BuildMI(BB, PPC::B, 1).addMBB(Dest);
2411 return;
2412 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002413 case ISD::BRCOND:
Nate Begemancd08e4c2005-04-09 20:09:12 +00002414 case ISD::BRCONDTWOWAY:
Nate Begemana9795f82005-03-24 04:41:43 +00002415 SelectBranchCC(N);
2416 return;
2417 case ISD::CopyToReg:
2418 Select(N.getOperand(0));
2419 Tmp1 = SelectExpr(N.getOperand(1));
2420 Tmp2 = cast<RegSDNode>(N)->getReg();
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002421
Nate Begemana9795f82005-03-24 04:41:43 +00002422 if (Tmp1 != Tmp2) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002423 if (N.getOperand(1).getValueType() == MVT::f64 ||
Nate Begemana9795f82005-03-24 04:41:43 +00002424 N.getOperand(1).getValueType() == MVT::f32)
2425 BuildMI(BB, PPC::FMR, 1, Tmp2).addReg(Tmp1);
2426 else
2427 BuildMI(BB, PPC::OR, 2, Tmp2).addReg(Tmp1).addReg(Tmp1);
2428 }
2429 return;
2430 case ISD::ImplicitDef:
2431 Select(N.getOperand(0));
2432 BuildMI(BB, PPC::IMPLICIT_DEF, 0, cast<RegSDNode>(N)->getReg());
2433 return;
2434 case ISD::RET:
2435 switch (N.getNumOperands()) {
2436 default:
2437 assert(0 && "Unknown return instruction!");
2438 case 3:
2439 assert(N.getOperand(1).getValueType() == MVT::i32 &&
2440 N.getOperand(2).getValueType() == MVT::i32 &&
Misha Brukman7847fca2005-04-22 17:54:37 +00002441 "Unknown two-register value!");
Nate Begemana9795f82005-03-24 04:41:43 +00002442 Select(N.getOperand(0));
2443 Tmp1 = SelectExpr(N.getOperand(1));
2444 Tmp2 = SelectExpr(N.getOperand(2));
Nate Begeman27523a12005-04-02 00:42:16 +00002445 BuildMI(BB, PPC::OR, 2, PPC::R3).addReg(Tmp2).addReg(Tmp2);
2446 BuildMI(BB, PPC::OR, 2, PPC::R4).addReg(Tmp1).addReg(Tmp1);
Nate Begemana9795f82005-03-24 04:41:43 +00002447 break;
2448 case 2:
2449 Select(N.getOperand(0));
2450 Tmp1 = SelectExpr(N.getOperand(1));
2451 switch (N.getOperand(1).getValueType()) {
2452 default:
2453 assert(0 && "Unknown return type!");
2454 case MVT::f64:
2455 case MVT::f32:
2456 BuildMI(BB, PPC::FMR, 1, PPC::F1).addReg(Tmp1);
2457 break;
2458 case MVT::i32:
2459 BuildMI(BB, PPC::OR, 2, PPC::R3).addReg(Tmp1).addReg(Tmp1);
2460 break;
2461 }
Nate Begeman9e3e1b52005-03-24 23:35:30 +00002462 case 1:
2463 Select(N.getOperand(0));
2464 break;
Nate Begemana9795f82005-03-24 04:41:43 +00002465 }
2466 BuildMI(BB, PPC::BLR, 0); // Just emit a 'ret' instruction
2467 return;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002468 case ISD::TRUNCSTORE:
Nate Begeman2497e632005-07-21 20:44:43 +00002469 case ISD::STORE: {
2470 SDOperand Chain = N.getOperand(0);
2471 SDOperand Value = N.getOperand(1);
2472 SDOperand Address = N.getOperand(2);
2473 Select(Chain);
Nate Begemana9795f82005-03-24 04:41:43 +00002474
Nate Begeman2497e632005-07-21 20:44:43 +00002475 Tmp1 = SelectExpr(Value); //value
Nate Begemana9795f82005-03-24 04:41:43 +00002476
Nate Begeman2497e632005-07-21 20:44:43 +00002477 if (opcode == ISD::STORE) {
2478 switch(Value.getValueType()) {
2479 default: assert(0 && "unknown Type in store");
2480 case MVT::i32: Opc = PPC::STW; break;
2481 case MVT::f64: Opc = PPC::STFD; break;
2482 case MVT::f32: Opc = PPC::STFS; break;
Nate Begemana9795f82005-03-24 04:41:43 +00002483 }
Nate Begeman2497e632005-07-21 20:44:43 +00002484 } else { //ISD::TRUNCSTORE
2485 switch(cast<VTSDNode>(Node->getOperand(4))->getVT()) {
2486 default: assert(0 && "unknown Type in store");
2487 case MVT::i1:
2488 case MVT::i8: Opc = PPC::STB; break;
2489 case MVT::i16: Opc = PPC::STH; break;
Nate Begemana9795f82005-03-24 04:41:43 +00002490 }
Nate Begemana9795f82005-03-24 04:41:43 +00002491 }
Nate Begeman2497e632005-07-21 20:44:43 +00002492
2493 if(Address.getOpcode() == ISD::FrameIndex) {
2494 Tmp2 = cast<FrameIndexSDNode>(Address)->getIndex();
2495 addFrameReference(BuildMI(BB, Opc, 3).addReg(Tmp1), (int)Tmp2);
Nate Begeman2497e632005-07-21 20:44:43 +00002496 } else {
2497 int offset;
Nate Begeman2a05c8e2005-07-28 03:02:05 +00002498 switch(SelectAddr(Address, Tmp2, offset)) {
2499 default: assert(0 && "Unhandled return value from SelectAddr");
2500 case 0: // imm offset, no frame, no index
2501 BuildMI(BB, Opc, 3).addReg(Tmp1).addSImm(offset).addReg(Tmp2);
2502 break;
2503 case 1: // imm offset + frame index
2504 addFrameReference(BuildMI(BB, Opc, 3).addReg(Tmp1), (int)Tmp2, offset);
2505 break;
2506 case 2: // base+index addressing
Nate Begeman2497e632005-07-21 20:44:43 +00002507 Opc = IndexedOpForOp(Opc);
2508 BuildMI(BB, Opc, 3).addReg(Tmp1).addReg(Tmp2).addReg(offset);
Nate Begeman2a05c8e2005-07-28 03:02:05 +00002509 break;
Nate Begemand3ded2d2005-08-08 22:22:56 +00002510 case 3: {
2511 GlobalAddressSDNode *GN = cast<GlobalAddressSDNode>(Address);
2512 GlobalValue *GV = GN->getGlobal();
2513 BuildMI(BB, Opc, 3).addReg(Tmp1).addGlobalAddress(GV).addReg(Tmp2);
2514 }
Nate Begeman2497e632005-07-21 20:44:43 +00002515 }
2516 }
2517 return;
2518 }
Nate Begemana9795f82005-03-24 04:41:43 +00002519 case ISD::EXTLOAD:
2520 case ISD::SEXTLOAD:
2521 case ISD::ZEXTLOAD:
2522 case ISD::LOAD:
2523 case ISD::CopyFromReg:
Chris Lattnerb5d8e6e2005-05-13 20:29:26 +00002524 case ISD::TAILCALL:
Nate Begemana9795f82005-03-24 04:41:43 +00002525 case ISD::CALL:
2526 case ISD::DYNAMIC_STACKALLOC:
2527 ExprMap.erase(N);
2528 SelectExpr(N);
2529 return;
2530 }
2531 assert(0 && "Should not be reached!");
2532}
2533
2534
2535/// createPPC32PatternInstructionSelector - This pass converts an LLVM function
2536/// into a machine code representation using pattern matching and a machine
2537/// description file.
2538///
2539FunctionPass *llvm::createPPC32ISelPattern(TargetMachine &TM) {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002540 return new ISel(TM);
Chris Lattner246fa632005-03-24 06:16:18 +00002541}
2542