blob: 6b2ec4a8904fb9d7962a762f762ac340061168b8 [file] [log] [blame]
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001//===-- PPCISelDAGToDAG.cpp - PPC --pattern matching inst selector --------===//
2//
3// The LLVM Compiler Infrastructure
4//
Chris Lattner081ce942007-12-29 20:36:04 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Dan Gohmanf17a25c2007-07-18 16:29:46 +00007//
8//===----------------------------------------------------------------------===//
9//
10// This file defines a pattern matching instruction selector for PowerPC,
11// converting from a legalized dag to a PPC dag.
12//
13//===----------------------------------------------------------------------===//
14
15#define DEBUG_TYPE "ppc-codegen"
16#include "PPC.h"
17#include "PPCPredicates.h"
18#include "PPCTargetMachine.h"
19#include "PPCISelLowering.h"
20#include "PPCHazardRecognizers.h"
21#include "llvm/CodeGen/MachineInstrBuilder.h"
22#include "llvm/CodeGen/MachineFunction.h"
Chris Lattner1b989192007-12-31 04:13:23 +000023#include "llvm/CodeGen/MachineRegisterInfo.h"
Dan Gohmanf17a25c2007-07-18 16:29:46 +000024#include "llvm/CodeGen/SelectionDAG.h"
25#include "llvm/CodeGen/SelectionDAGISel.h"
26#include "llvm/Target/TargetOptions.h"
27#include "llvm/Constants.h"
28#include "llvm/GlobalValue.h"
29#include "llvm/Intrinsics.h"
30#include "llvm/Support/Debug.h"
31#include "llvm/Support/MathExtras.h"
32#include "llvm/Support/Compiler.h"
33#include <queue>
34#include <set>
35using namespace llvm;
36
37namespace {
38 //===--------------------------------------------------------------------===//
39 /// PPCDAGToDAGISel - PPC specific code to select PPC machine
40 /// instructions for SelectionDAG operations.
41 ///
42 class VISIBILITY_HIDDEN PPCDAGToDAGISel : public SelectionDAGISel {
43 PPCTargetMachine &TM;
44 PPCTargetLowering PPCLowering;
Evan Cheng9d99c5e2007-10-23 06:42:42 +000045 const PPCSubtarget &PPCSubTarget;
Dan Gohmanf17a25c2007-07-18 16:29:46 +000046 unsigned GlobalBaseReg;
47 public:
Dan Gohmane887fdf2008-07-07 18:00:37 +000048 explicit PPCDAGToDAGISel(PPCTargetMachine &tm)
Dan Gohmanf17a25c2007-07-18 16:29:46 +000049 : SelectionDAGISel(PPCLowering), TM(tm),
Evan Cheng9d99c5e2007-10-23 06:42:42 +000050 PPCLowering(*TM.getTargetLowering()),
51 PPCSubTarget(*TM.getSubtargetImpl()) {}
Dan Gohmanf17a25c2007-07-18 16:29:46 +000052
53 virtual bool runOnFunction(Function &Fn) {
54 // Make sure we re-emit a set of the global base reg if necessary
55 GlobalBaseReg = 0;
56 SelectionDAGISel::runOnFunction(Fn);
57
58 InsertVRSaveCode(Fn);
59 return true;
60 }
61
62 /// getI32Imm - Return a target constant with the specified value, of type
63 /// i32.
Dan Gohman8181bd12008-07-27 21:46:04 +000064 inline SDValue getI32Imm(unsigned Imm) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +000065 return CurDAG->getTargetConstant(Imm, MVT::i32);
66 }
67
68 /// getI64Imm - Return a target constant with the specified value, of type
69 /// i64.
Dan Gohman8181bd12008-07-27 21:46:04 +000070 inline SDValue getI64Imm(uint64_t Imm) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +000071 return CurDAG->getTargetConstant(Imm, MVT::i64);
72 }
73
74 /// getSmallIPtrImm - Return a target constant of pointer type.
Dan Gohman8181bd12008-07-27 21:46:04 +000075 inline SDValue getSmallIPtrImm(unsigned Imm) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +000076 return CurDAG->getTargetConstant(Imm, PPCLowering.getPointerTy());
77 }
78
79 /// isRunOfOnes - Returns true iff Val consists of one contiguous run of 1s
80 /// with any number of 0s on either side. The 1s are allowed to wrap from
81 /// LSB to MSB, so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs.
82 /// 0x0F0F0000 is not, since all 1s are not contiguous.
83 static bool isRunOfOnes(unsigned Val, unsigned &MB, unsigned &ME);
84
85
86 /// isRotateAndMask - Returns true if Mask and Shift can be folded into a
87 /// rotate and mask opcode and mask operation.
88 static bool isRotateAndMask(SDNode *N, unsigned Mask, bool IsShiftMask,
89 unsigned &SH, unsigned &MB, unsigned &ME);
90
91 /// getGlobalBaseReg - insert code into the entry mbb to materialize the PIC
92 /// base register. Return the virtual register that holds this value.
93 SDNode *getGlobalBaseReg();
94
95 // Select - Convert the specified operand from a target-independent to a
96 // target-specific node if it hasn't already been changed.
Dan Gohman8181bd12008-07-27 21:46:04 +000097 SDNode *Select(SDValue Op);
Dan Gohmanf17a25c2007-07-18 16:29:46 +000098
99 SDNode *SelectBitfieldInsert(SDNode *N);
100
101 /// SelectCC - Select a comparison of the specified values with the
102 /// specified condition code, returning the CR# of the expression.
Dan Gohman8181bd12008-07-27 21:46:04 +0000103 SDValue SelectCC(SDValue LHS, SDValue RHS, ISD::CondCode CC);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000104
105 /// SelectAddrImm - Returns true if the address N can be represented by
106 /// a base register plus a signed 16-bit displacement [r+imm].
Dan Gohman8181bd12008-07-27 21:46:04 +0000107 bool SelectAddrImm(SDValue Op, SDValue N, SDValue &Disp,
108 SDValue &Base) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000109 return PPCLowering.SelectAddressRegImm(N, Disp, Base, *CurDAG);
110 }
111
112 /// SelectAddrImmOffs - Return true if the operand is valid for a preinc
113 /// immediate field. Because preinc imms have already been validated, just
114 /// accept it.
Dan Gohman8181bd12008-07-27 21:46:04 +0000115 bool SelectAddrImmOffs(SDValue Op, SDValue N, SDValue &Out) const {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000116 Out = N;
117 return true;
118 }
119
120 /// SelectAddrIdx - Given the specified addressed, check to see if it can be
121 /// represented as an indexed [r+r] operation. Returns false if it can
122 /// be represented by [r+imm], which are preferred.
Dan Gohman8181bd12008-07-27 21:46:04 +0000123 bool SelectAddrIdx(SDValue Op, SDValue N, SDValue &Base,
124 SDValue &Index) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000125 return PPCLowering.SelectAddressRegReg(N, Base, Index, *CurDAG);
126 }
127
128 /// SelectAddrIdxOnly - Given the specified addressed, force it to be
129 /// represented as an indexed [r+r] operation.
Dan Gohman8181bd12008-07-27 21:46:04 +0000130 bool SelectAddrIdxOnly(SDValue Op, SDValue N, SDValue &Base,
131 SDValue &Index) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000132 return PPCLowering.SelectAddressRegRegOnly(N, Base, Index, *CurDAG);
133 }
134
135 /// SelectAddrImmShift - Returns true if the address N can be represented by
136 /// a base register plus a signed 14-bit displacement [r+imm*4]. Suitable
137 /// for use by STD and friends.
Dan Gohman8181bd12008-07-27 21:46:04 +0000138 bool SelectAddrImmShift(SDValue Op, SDValue N, SDValue &Disp,
139 SDValue &Base) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000140 return PPCLowering.SelectAddressRegImmShift(N, Disp, Base, *CurDAG);
141 }
142
143 /// SelectInlineAsmMemoryOperand - Implement addressing mode selection for
144 /// inline asm expressions.
Dan Gohman8181bd12008-07-27 21:46:04 +0000145 virtual bool SelectInlineAsmMemoryOperand(const SDValue &Op,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000146 char ConstraintCode,
Dan Gohman14a66442008-08-23 02:25:05 +0000147 std::vector<SDValue> &OutOps) {
Dan Gohman8181bd12008-07-27 21:46:04 +0000148 SDValue Op0, Op1;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000149 switch (ConstraintCode) {
150 default: return true;
151 case 'm': // memory
152 if (!SelectAddrIdx(Op, Op, Op0, Op1))
153 SelectAddrImm(Op, Op, Op0, Op1);
154 break;
155 case 'o': // offsetable
156 if (!SelectAddrImm(Op, Op, Op0, Op1)) {
157 Op0 = Op;
158 AddToISelQueue(Op0); // r+0.
159 Op1 = getSmallIPtrImm(0);
160 }
161 break;
162 case 'v': // not offsetable
163 SelectAddrIdxOnly(Op, Op, Op0, Op1);
164 break;
165 }
166
167 OutOps.push_back(Op0);
168 OutOps.push_back(Op1);
169 return false;
170 }
171
Dan Gohman8181bd12008-07-27 21:46:04 +0000172 SDValue BuildSDIVSequence(SDNode *N);
173 SDValue BuildUDIVSequence(SDNode *N);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000174
Evan Cheng34fd4f32008-06-30 20:45:06 +0000175 /// InstructionSelect - This callback is invoked by
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000176 /// SelectionDAGISel when it has created a SelectionDAG for us to codegen.
Dan Gohman14a66442008-08-23 02:25:05 +0000177 virtual void InstructionSelect();
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000178
179 void InsertVRSaveCode(Function &Fn);
180
181 virtual const char *getPassName() const {
182 return "PowerPC DAG->DAG Pattern Instruction Selection";
183 }
184
185 /// CreateTargetHazardRecognizer - Return the hazard recognizer to use for
186 /// this target when scheduling the DAG.
187 virtual HazardRecognizer *CreateTargetHazardRecognizer() {
188 // Should use subtarget info to pick the right hazard recognizer. For
189 // now, always return a PPC970 recognizer.
Dan Gohman404e8542008-09-04 15:39:15 +0000190 const TargetInstrInfo *II = TM.getInstrInfo();
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000191 assert(II && "No InstrInfo?");
192 return new PPCHazardRecognizer970(*II);
193 }
194
195// Include the pieces autogenerated from the target description.
196#include "PPCGenDAGISel.inc"
197
198private:
Dan Gohman8181bd12008-07-27 21:46:04 +0000199 SDNode *SelectSETCC(SDValue Op);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000200 };
201}
202
Evan Cheng34fd4f32008-06-30 20:45:06 +0000203/// InstructionSelect - This callback is invoked by
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000204/// SelectionDAGISel when it has created a SelectionDAG for us to codegen.
Dan Gohman14a66442008-08-23 02:25:05 +0000205void PPCDAGToDAGISel::InstructionSelect() {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000206 DEBUG(BB->dump());
207
208 // Select target instructions for the DAG.
Dan Gohmanbd3f8822008-08-21 16:36:34 +0000209 SelectRoot();
Dan Gohman14a66442008-08-23 02:25:05 +0000210 CurDAG->RemoveDeadNodes();
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000211}
212
213/// InsertVRSaveCode - Once the entire function has been instruction selected,
214/// all virtual registers are created and all machine instructions are built,
215/// check to see if we need to save/restore VRSAVE. If so, do it.
216void PPCDAGToDAGISel::InsertVRSaveCode(Function &F) {
217 // Check to see if this function uses vector registers, which means we have to
218 // save and restore the VRSAVE register and update it with the regs we use.
219 //
220 // In this case, there will be virtual registers of vector type type created
221 // by the scheduler. Detect them now.
222 MachineFunction &Fn = MachineFunction::get(&F);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000223 bool HasVectorVReg = false;
Dan Gohman1e57df32008-02-10 18:45:23 +0000224 for (unsigned i = TargetRegisterInfo::FirstVirtualRegister,
Chris Lattner1b989192007-12-31 04:13:23 +0000225 e = RegInfo->getLastVirtReg()+1; i != e; ++i)
226 if (RegInfo->getRegClass(i) == &PPC::VRRCRegClass) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000227 HasVectorVReg = true;
228 break;
229 }
230 if (!HasVectorVReg) return; // nothing to do.
231
232 // If we have a vector register, we want to emit code into the entry and exit
233 // blocks to save and restore the VRSAVE register. We do this here (instead
234 // of marking all vector instructions as clobbering VRSAVE) for two reasons:
235 //
236 // 1. This (trivially) reduces the load on the register allocator, by not
237 // having to represent the live range of the VRSAVE register.
238 // 2. This (more significantly) allows us to create a temporary virtual
239 // register to hold the saved VRSAVE value, allowing this temporary to be
240 // register allocated, instead of forcing it to be spilled to the stack.
241
242 // Create two vregs - one to hold the VRSAVE register that is live-in to the
243 // function and one for the value after having bits or'd into it.
Chris Lattner1b989192007-12-31 04:13:23 +0000244 unsigned InVRSAVE = RegInfo->createVirtualRegister(&PPC::GPRCRegClass);
245 unsigned UpdatedVRSAVE = RegInfo->createVirtualRegister(&PPC::GPRCRegClass);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000246
247 const TargetInstrInfo &TII = *TM.getInstrInfo();
248 MachineBasicBlock &EntryBB = *Fn.begin();
249 // Emit the following code into the entry block:
250 // InVRSAVE = MFVRSAVE
251 // UpdatedVRSAVE = UPDATE_VRSAVE InVRSAVE
252 // MTVRSAVE UpdatedVRSAVE
253 MachineBasicBlock::iterator IP = EntryBB.begin(); // Insert Point
254 BuildMI(EntryBB, IP, TII.get(PPC::MFVRSAVE), InVRSAVE);
Chris Lattner62327602008-01-07 01:56:04 +0000255 BuildMI(EntryBB, IP, TII.get(PPC::UPDATE_VRSAVE),
256 UpdatedVRSAVE).addReg(InVRSAVE);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000257 BuildMI(EntryBB, IP, TII.get(PPC::MTVRSAVE)).addReg(UpdatedVRSAVE);
258
259 // Find all return blocks, outputting a restore in each epilog.
260 for (MachineFunction::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) {
Chris Lattner5b930372008-01-07 07:27:27 +0000261 if (!BB->empty() && BB->back().getDesc().isReturn()) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000262 IP = BB->end(); --IP;
263
264 // Skip over all terminator instructions, which are part of the return
265 // sequence.
266 MachineBasicBlock::iterator I2 = IP;
Chris Lattner5b930372008-01-07 07:27:27 +0000267 while (I2 != BB->begin() && (--I2)->getDesc().isTerminator())
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000268 IP = I2;
269
270 // Emit: MTVRSAVE InVRSave
271 BuildMI(*BB, IP, TII.get(PPC::MTVRSAVE)).addReg(InVRSAVE);
272 }
273 }
274}
275
276
277/// getGlobalBaseReg - Output the instructions required to put the
278/// base address to use for accessing globals into a register.
279///
280SDNode *PPCDAGToDAGISel::getGlobalBaseReg() {
281 if (!GlobalBaseReg) {
282 const TargetInstrInfo &TII = *TM.getInstrInfo();
283 // Insert the set of GlobalBaseReg into the first MBB of the function
284 MachineBasicBlock &FirstMBB = BB->getParent()->front();
285 MachineBasicBlock::iterator MBBI = FirstMBB.begin();
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000286
287 if (PPCLowering.getPointerTy() == MVT::i32) {
Chris Lattner1b989192007-12-31 04:13:23 +0000288 GlobalBaseReg = RegInfo->createVirtualRegister(PPC::GPRCRegisterClass);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000289 BuildMI(FirstMBB, MBBI, TII.get(PPC::MovePCtoLR), PPC::LR);
290 BuildMI(FirstMBB, MBBI, TII.get(PPC::MFLR), GlobalBaseReg);
291 } else {
Chris Lattner1b989192007-12-31 04:13:23 +0000292 GlobalBaseReg = RegInfo->createVirtualRegister(PPC::G8RCRegisterClass);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000293 BuildMI(FirstMBB, MBBI, TII.get(PPC::MovePCtoLR8), PPC::LR8);
294 BuildMI(FirstMBB, MBBI, TII.get(PPC::MFLR8), GlobalBaseReg);
295 }
296 }
Gabor Greife9f7f582008-08-31 15:37:04 +0000297 return CurDAG->getRegister(GlobalBaseReg,
298 PPCLowering.getPointerTy()).getNode();
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000299}
300
301/// isIntS16Immediate - This method tests to see if the node is either a 32-bit
302/// or 64-bit immediate, and if the value can be accurately represented as a
303/// sign extension from a 16-bit value. If so, this returns true and the
304/// immediate.
305static bool isIntS16Immediate(SDNode *N, short &Imm) {
306 if (N->getOpcode() != ISD::Constant)
307 return false;
308
Dan Gohmanfaeb4a32008-09-12 16:56:44 +0000309 Imm = (short)cast<ConstantSDNode>(N)->getZExtValue();
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000310 if (N->getValueType(0) == MVT::i32)
Dan Gohmanfaeb4a32008-09-12 16:56:44 +0000311 return Imm == (int32_t)cast<ConstantSDNode>(N)->getZExtValue();
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000312 else
Dan Gohmanfaeb4a32008-09-12 16:56:44 +0000313 return Imm == (int64_t)cast<ConstantSDNode>(N)->getZExtValue();
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000314}
315
Dan Gohman8181bd12008-07-27 21:46:04 +0000316static bool isIntS16Immediate(SDValue Op, short &Imm) {
Gabor Greif1c80d112008-08-28 21:40:38 +0000317 return isIntS16Immediate(Op.getNode(), Imm);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000318}
319
320
321/// isInt32Immediate - This method tests to see if the node is a 32-bit constant
322/// operand. If so Imm will receive the 32-bit value.
323static bool isInt32Immediate(SDNode *N, unsigned &Imm) {
324 if (N->getOpcode() == ISD::Constant && N->getValueType(0) == MVT::i32) {
Dan Gohmanfaeb4a32008-09-12 16:56:44 +0000325 Imm = cast<ConstantSDNode>(N)->getZExtValue();
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000326 return true;
327 }
328 return false;
329}
330
331/// isInt64Immediate - This method tests to see if the node is a 64-bit constant
332/// operand. If so Imm will receive the 64-bit value.
333static bool isInt64Immediate(SDNode *N, uint64_t &Imm) {
334 if (N->getOpcode() == ISD::Constant && N->getValueType(0) == MVT::i64) {
Dan Gohmanfaeb4a32008-09-12 16:56:44 +0000335 Imm = cast<ConstantSDNode>(N)->getZExtValue();
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000336 return true;
337 }
338 return false;
339}
340
341// isInt32Immediate - This method tests to see if a constant operand.
342// If so Imm will receive the 32 bit value.
Dan Gohman8181bd12008-07-27 21:46:04 +0000343static bool isInt32Immediate(SDValue N, unsigned &Imm) {
Gabor Greif1c80d112008-08-28 21:40:38 +0000344 return isInt32Immediate(N.getNode(), Imm);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000345}
346
347
348// isOpcWithIntImmediate - This method tests to see if the node is a specific
349// opcode and that it has a immediate integer right operand.
350// If so Imm will receive the 32 bit value.
351static bool isOpcWithIntImmediate(SDNode *N, unsigned Opc, unsigned& Imm) {
Gabor Greife9f7f582008-08-31 15:37:04 +0000352 return N->getOpcode() == Opc
353 && isInt32Immediate(N->getOperand(1).getNode(), Imm);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000354}
355
356bool PPCDAGToDAGISel::isRunOfOnes(unsigned Val, unsigned &MB, unsigned &ME) {
357 if (isShiftedMask_32(Val)) {
358 // look for the first non-zero bit
359 MB = CountLeadingZeros_32(Val);
360 // look for the first zero bit after the run of ones
361 ME = CountLeadingZeros_32((Val - 1) ^ Val);
362 return true;
363 } else {
364 Val = ~Val; // invert mask
365 if (isShiftedMask_32(Val)) {
366 // effectively look for the first zero bit
367 ME = CountLeadingZeros_32(Val) - 1;
368 // effectively look for the first one bit after the run of zeros
369 MB = CountLeadingZeros_32((Val - 1) ^ Val) + 1;
370 return true;
371 }
372 }
373 // no run present
374 return false;
375}
376
377bool PPCDAGToDAGISel::isRotateAndMask(SDNode *N, unsigned Mask,
378 bool IsShiftMask, unsigned &SH,
379 unsigned &MB, unsigned &ME) {
380 // Don't even go down this path for i64, since different logic will be
381 // necessary for rldicl/rldicr/rldimi.
382 if (N->getValueType(0) != MVT::i32)
383 return false;
384
385 unsigned Shift = 32;
386 unsigned Indeterminant = ~0; // bit mask marking indeterminant results
387 unsigned Opcode = N->getOpcode();
388 if (N->getNumOperands() != 2 ||
Gabor Greif1c80d112008-08-28 21:40:38 +0000389 !isInt32Immediate(N->getOperand(1).getNode(), Shift) || (Shift > 31))
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000390 return false;
391
392 if (Opcode == ISD::SHL) {
393 // apply shift left to mask if it comes first
394 if (IsShiftMask) Mask = Mask << Shift;
395 // determine which bits are made indeterminant by shift
396 Indeterminant = ~(0xFFFFFFFFu << Shift);
397 } else if (Opcode == ISD::SRL) {
398 // apply shift right to mask if it comes first
399 if (IsShiftMask) Mask = Mask >> Shift;
400 // determine which bits are made indeterminant by shift
401 Indeterminant = ~(0xFFFFFFFFu >> Shift);
402 // adjust for the left rotate
403 Shift = 32 - Shift;
404 } else if (Opcode == ISD::ROTL) {
405 Indeterminant = 0;
406 } else {
407 return false;
408 }
409
410 // if the mask doesn't intersect any Indeterminant bits
411 if (Mask && !(Mask & Indeterminant)) {
412 SH = Shift & 31;
413 // make sure the mask is still a mask (wrap arounds may not be)
414 return isRunOfOnes(Mask, MB, ME);
415 }
416 return false;
417}
418
419/// SelectBitfieldInsert - turn an or of two masked values into
420/// the rotate left word immediate then mask insert (rlwimi) instruction.
421SDNode *PPCDAGToDAGISel::SelectBitfieldInsert(SDNode *N) {
Dan Gohman8181bd12008-07-27 21:46:04 +0000422 SDValue Op0 = N->getOperand(0);
423 SDValue Op1 = N->getOperand(1);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000424
Dan Gohman63f4e462008-02-27 01:23:58 +0000425 APInt LKZ, LKO, RKZ, RKO;
426 CurDAG->ComputeMaskedBits(Op0, APInt::getAllOnesValue(32), LKZ, LKO);
427 CurDAG->ComputeMaskedBits(Op1, APInt::getAllOnesValue(32), RKZ, RKO);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000428
Dan Gohman63f4e462008-02-27 01:23:58 +0000429 unsigned TargetMask = LKZ.getZExtValue();
430 unsigned InsertMask = RKZ.getZExtValue();
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000431
432 if ((TargetMask | InsertMask) == 0xFFFFFFFF) {
433 unsigned Op0Opc = Op0.getOpcode();
434 unsigned Op1Opc = Op1.getOpcode();
435 unsigned Value, SH = 0;
436 TargetMask = ~TargetMask;
437 InsertMask = ~InsertMask;
438
439 // If the LHS has a foldable shift and the RHS does not, then swap it to the
440 // RHS so that we can fold the shift into the insert.
441 if (Op0Opc == ISD::AND && Op1Opc == ISD::AND) {
442 if (Op0.getOperand(0).getOpcode() == ISD::SHL ||
443 Op0.getOperand(0).getOpcode() == ISD::SRL) {
444 if (Op1.getOperand(0).getOpcode() != ISD::SHL &&
445 Op1.getOperand(0).getOpcode() != ISD::SRL) {
446 std::swap(Op0, Op1);
447 std::swap(Op0Opc, Op1Opc);
448 std::swap(TargetMask, InsertMask);
449 }
450 }
451 } else if (Op0Opc == ISD::SHL || Op0Opc == ISD::SRL) {
452 if (Op1Opc == ISD::AND && Op1.getOperand(0).getOpcode() != ISD::SHL &&
453 Op1.getOperand(0).getOpcode() != ISD::SRL) {
454 std::swap(Op0, Op1);
455 std::swap(Op0Opc, Op1Opc);
456 std::swap(TargetMask, InsertMask);
457 }
458 }
459
460 unsigned MB, ME;
461 if (InsertMask && isRunOfOnes(InsertMask, MB, ME)) {
Dan Gohman8181bd12008-07-27 21:46:04 +0000462 SDValue Tmp1, Tmp2, Tmp3;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000463 bool DisjointMask = (TargetMask ^ InsertMask) == 0xFFFFFFFF;
464
465 if ((Op1Opc == ISD::SHL || Op1Opc == ISD::SRL) &&
466 isInt32Immediate(Op1.getOperand(1), Value)) {
467 Op1 = Op1.getOperand(0);
468 SH = (Op1Opc == ISD::SHL) ? Value : 32 - Value;
469 }
470 if (Op1Opc == ISD::AND) {
471 unsigned SHOpc = Op1.getOperand(0).getOpcode();
472 if ((SHOpc == ISD::SHL || SHOpc == ISD::SRL) &&
473 isInt32Immediate(Op1.getOperand(0).getOperand(1), Value)) {
474 Op1 = Op1.getOperand(0).getOperand(0);
475 SH = (SHOpc == ISD::SHL) ? Value : 32 - Value;
476 } else {
477 Op1 = Op1.getOperand(0);
478 }
479 }
480
481 Tmp3 = (Op0Opc == ISD::AND && DisjointMask) ? Op0.getOperand(0) : Op0;
482 AddToISelQueue(Tmp3);
483 AddToISelQueue(Op1);
484 SH &= 31;
Dan Gohman8181bd12008-07-27 21:46:04 +0000485 SDValue Ops[] = { Tmp3, Op1, getI32Imm(SH), getI32Imm(MB),
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000486 getI32Imm(ME) };
487 return CurDAG->getTargetNode(PPC::RLWIMI, MVT::i32, Ops, 5);
488 }
489 }
490 return 0;
491}
492
493/// SelectCC - Select a comparison of the specified values with the specified
494/// condition code, returning the CR# of the expression.
Dan Gohman8181bd12008-07-27 21:46:04 +0000495SDValue PPCDAGToDAGISel::SelectCC(SDValue LHS, SDValue RHS,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000496 ISD::CondCode CC) {
497 // Always select the LHS.
498 AddToISelQueue(LHS);
499 unsigned Opc;
500
501 if (LHS.getValueType() == MVT::i32) {
502 unsigned Imm;
503 if (CC == ISD::SETEQ || CC == ISD::SETNE) {
504 if (isInt32Immediate(RHS, Imm)) {
505 // SETEQ/SETNE comparison with 16-bit immediate, fold it.
506 if (isUInt16(Imm))
Dan Gohman8181bd12008-07-27 21:46:04 +0000507 return SDValue(CurDAG->getTargetNode(PPC::CMPLWI, MVT::i32, LHS,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000508 getI32Imm(Imm & 0xFFFF)), 0);
509 // If this is a 16-bit signed immediate, fold it.
510 if (isInt16((int)Imm))
Dan Gohman8181bd12008-07-27 21:46:04 +0000511 return SDValue(CurDAG->getTargetNode(PPC::CMPWI, MVT::i32, LHS,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000512 getI32Imm(Imm & 0xFFFF)), 0);
513
514 // For non-equality comparisons, the default code would materialize the
515 // constant, then compare against it, like this:
516 // lis r2, 4660
517 // ori r2, r2, 22136
518 // cmpw cr0, r3, r2
519 // Since we are just comparing for equality, we can emit this instead:
520 // xoris r0,r3,0x1234
521 // cmplwi cr0,r0,0x5678
522 // beq cr0,L6
Dan Gohman8181bd12008-07-27 21:46:04 +0000523 SDValue Xor(CurDAG->getTargetNode(PPC::XORIS, MVT::i32, LHS,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000524 getI32Imm(Imm >> 16)), 0);
Dan Gohman8181bd12008-07-27 21:46:04 +0000525 return SDValue(CurDAG->getTargetNode(PPC::CMPLWI, MVT::i32, Xor,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000526 getI32Imm(Imm & 0xFFFF)), 0);
527 }
528 Opc = PPC::CMPLW;
529 } else if (ISD::isUnsignedIntSetCC(CC)) {
530 if (isInt32Immediate(RHS, Imm) && isUInt16(Imm))
Dan Gohman8181bd12008-07-27 21:46:04 +0000531 return SDValue(CurDAG->getTargetNode(PPC::CMPLWI, MVT::i32, LHS,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000532 getI32Imm(Imm & 0xFFFF)), 0);
533 Opc = PPC::CMPLW;
534 } else {
535 short SImm;
536 if (isIntS16Immediate(RHS, SImm))
Dan Gohman8181bd12008-07-27 21:46:04 +0000537 return SDValue(CurDAG->getTargetNode(PPC::CMPWI, MVT::i32, LHS,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000538 getI32Imm((int)SImm & 0xFFFF)),
539 0);
540 Opc = PPC::CMPW;
541 }
542 } else if (LHS.getValueType() == MVT::i64) {
543 uint64_t Imm;
544 if (CC == ISD::SETEQ || CC == ISD::SETNE) {
Gabor Greif1c80d112008-08-28 21:40:38 +0000545 if (isInt64Immediate(RHS.getNode(), Imm)) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000546 // SETEQ/SETNE comparison with 16-bit immediate, fold it.
547 if (isUInt16(Imm))
Dan Gohman8181bd12008-07-27 21:46:04 +0000548 return SDValue(CurDAG->getTargetNode(PPC::CMPLDI, MVT::i64, LHS,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000549 getI32Imm(Imm & 0xFFFF)), 0);
550 // If this is a 16-bit signed immediate, fold it.
551 if (isInt16(Imm))
Dan Gohman8181bd12008-07-27 21:46:04 +0000552 return SDValue(CurDAG->getTargetNode(PPC::CMPDI, MVT::i64, LHS,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000553 getI32Imm(Imm & 0xFFFF)), 0);
554
555 // For non-equality comparisons, the default code would materialize the
556 // constant, then compare against it, like this:
557 // lis r2, 4660
558 // ori r2, r2, 22136
559 // cmpd cr0, r3, r2
560 // Since we are just comparing for equality, we can emit this instead:
561 // xoris r0,r3,0x1234
562 // cmpldi cr0,r0,0x5678
563 // beq cr0,L6
564 if (isUInt32(Imm)) {
Dan Gohman8181bd12008-07-27 21:46:04 +0000565 SDValue Xor(CurDAG->getTargetNode(PPC::XORIS8, MVT::i64, LHS,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000566 getI64Imm(Imm >> 16)), 0);
Dan Gohman8181bd12008-07-27 21:46:04 +0000567 return SDValue(CurDAG->getTargetNode(PPC::CMPLDI, MVT::i64, Xor,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000568 getI64Imm(Imm & 0xFFFF)), 0);
569 }
570 }
571 Opc = PPC::CMPLD;
572 } else if (ISD::isUnsignedIntSetCC(CC)) {
Gabor Greif1c80d112008-08-28 21:40:38 +0000573 if (isInt64Immediate(RHS.getNode(), Imm) && isUInt16(Imm))
Dan Gohman8181bd12008-07-27 21:46:04 +0000574 return SDValue(CurDAG->getTargetNode(PPC::CMPLDI, MVT::i64, LHS,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000575 getI64Imm(Imm & 0xFFFF)), 0);
576 Opc = PPC::CMPLD;
577 } else {
578 short SImm;
579 if (isIntS16Immediate(RHS, SImm))
Dan Gohman8181bd12008-07-27 21:46:04 +0000580 return SDValue(CurDAG->getTargetNode(PPC::CMPDI, MVT::i64, LHS,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000581 getI64Imm(SImm & 0xFFFF)),
582 0);
583 Opc = PPC::CMPD;
584 }
585 } else if (LHS.getValueType() == MVT::f32) {
586 Opc = PPC::FCMPUS;
587 } else {
588 assert(LHS.getValueType() == MVT::f64 && "Unknown vt!");
589 Opc = PPC::FCMPUD;
590 }
591 AddToISelQueue(RHS);
Dan Gohman8181bd12008-07-27 21:46:04 +0000592 return SDValue(CurDAG->getTargetNode(Opc, MVT::i32, LHS, RHS), 0);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000593}
594
595static PPC::Predicate getPredicateForSetCC(ISD::CondCode CC) {
596 switch (CC) {
597 default: assert(0 && "Unknown condition!"); abort();
598 case ISD::SETOEQ: // FIXME: This is incorrect see PR642.
599 case ISD::SETUEQ:
600 case ISD::SETEQ: return PPC::PRED_EQ;
601 case ISD::SETONE: // FIXME: This is incorrect see PR642.
602 case ISD::SETUNE:
603 case ISD::SETNE: return PPC::PRED_NE;
604 case ISD::SETOLT: // FIXME: This is incorrect see PR642.
605 case ISD::SETULT:
606 case ISD::SETLT: return PPC::PRED_LT;
607 case ISD::SETOLE: // FIXME: This is incorrect see PR642.
608 case ISD::SETULE:
609 case ISD::SETLE: return PPC::PRED_LE;
610 case ISD::SETOGT: // FIXME: This is incorrect see PR642.
611 case ISD::SETUGT:
612 case ISD::SETGT: return PPC::PRED_GT;
613 case ISD::SETOGE: // FIXME: This is incorrect see PR642.
614 case ISD::SETUGE:
615 case ISD::SETGE: return PPC::PRED_GE;
616
617 case ISD::SETO: return PPC::PRED_NU;
618 case ISD::SETUO: return PPC::PRED_UN;
619 }
620}
621
622/// getCRIdxForSetCC - Return the index of the condition register field
623/// associated with the SetCC condition, and whether or not the field is
624/// treated as inverted. That is, lt = 0; ge = 0 inverted.
Chris Lattner6c36fb52008-01-08 06:46:30 +0000625///
626/// If this returns with Other != -1, then the returned comparison is an or of
627/// two simpler comparisons. In this case, Invert is guaranteed to be false.
628static unsigned getCRIdxForSetCC(ISD::CondCode CC, bool &Invert, int &Other) {
629 Invert = false;
630 Other = -1;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000631 switch (CC) {
632 default: assert(0 && "Unknown condition!"); abort();
Chris Lattner6c36fb52008-01-08 06:46:30 +0000633 case ISD::SETOLT:
634 case ISD::SETLT: return 0; // Bit #0 = SETOLT
635 case ISD::SETOGT:
636 case ISD::SETGT: return 1; // Bit #1 = SETOGT
637 case ISD::SETOEQ:
638 case ISD::SETEQ: return 2; // Bit #2 = SETOEQ
639 case ISD::SETUO: return 3; // Bit #3 = SETUO
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000640 case ISD::SETUGE:
Chris Lattner6c36fb52008-01-08 06:46:30 +0000641 case ISD::SETGE: Invert = true; return 0; // !Bit #0 = SETUGE
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000642 case ISD::SETULE:
Chris Lattner6c36fb52008-01-08 06:46:30 +0000643 case ISD::SETLE: Invert = true; return 1; // !Bit #1 = SETULE
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000644 case ISD::SETUNE:
Chris Lattner6c36fb52008-01-08 06:46:30 +0000645 case ISD::SETNE: Invert = true; return 2; // !Bit #2 = SETUNE
646 case ISD::SETO: Invert = true; return 3; // !Bit #3 = SETO
647 case ISD::SETULT: Other = 0; return 3; // SETOLT | SETUO
648 case ISD::SETUGT: Other = 1; return 3; // SETOGT | SETUO
649 case ISD::SETUEQ: Other = 2; return 3; // SETOEQ | SETUO
650 case ISD::SETOGE: Other = 1; return 2; // SETOGT | SETOEQ
651 case ISD::SETOLE: Other = 0; return 2; // SETOLT | SETOEQ
652 case ISD::SETONE: Other = 0; return 1; // SETOLT | SETOGT
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000653 }
654 return 0;
655}
656
Dan Gohman8181bd12008-07-27 21:46:04 +0000657SDNode *PPCDAGToDAGISel::SelectSETCC(SDValue Op) {
Gabor Greif1c80d112008-08-28 21:40:38 +0000658 SDNode *N = Op.getNode();
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000659 unsigned Imm;
660 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(2))->get();
661 if (isInt32Immediate(N->getOperand(1), Imm)) {
662 // We can codegen setcc op, imm very efficiently compared to a brcond.
663 // Check for those cases here.
664 // setcc op, 0
665 if (Imm == 0) {
Dan Gohman8181bd12008-07-27 21:46:04 +0000666 SDValue Op = N->getOperand(0);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000667 AddToISelQueue(Op);
668 switch (CC) {
669 default: break;
670 case ISD::SETEQ: {
Dan Gohman8181bd12008-07-27 21:46:04 +0000671 Op = SDValue(CurDAG->getTargetNode(PPC::CNTLZW, MVT::i32, Op), 0);
672 SDValue Ops[] = { Op, getI32Imm(27), getI32Imm(5), getI32Imm(31) };
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000673 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
674 }
675 case ISD::SETNE: {
Dan Gohman8181bd12008-07-27 21:46:04 +0000676 SDValue AD =
677 SDValue(CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000678 Op, getI32Imm(~0U)), 0);
679 return CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, AD, Op,
680 AD.getValue(1));
681 }
682 case ISD::SETLT: {
Dan Gohman8181bd12008-07-27 21:46:04 +0000683 SDValue Ops[] = { Op, getI32Imm(1), getI32Imm(31), getI32Imm(31) };
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000684 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
685 }
686 case ISD::SETGT: {
Dan Gohman8181bd12008-07-27 21:46:04 +0000687 SDValue T =
688 SDValue(CurDAG->getTargetNode(PPC::NEG, MVT::i32, Op), 0);
689 T = SDValue(CurDAG->getTargetNode(PPC::ANDC, MVT::i32, T, Op), 0);
690 SDValue Ops[] = { T, getI32Imm(1), getI32Imm(31), getI32Imm(31) };
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000691 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
692 }
693 }
694 } else if (Imm == ~0U) { // setcc op, -1
Dan Gohman8181bd12008-07-27 21:46:04 +0000695 SDValue Op = N->getOperand(0);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000696 AddToISelQueue(Op);
697 switch (CC) {
698 default: break;
699 case ISD::SETEQ:
Dan Gohman8181bd12008-07-27 21:46:04 +0000700 Op = SDValue(CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000701 Op, getI32Imm(1)), 0);
702 return CurDAG->SelectNodeTo(N, PPC::ADDZE, MVT::i32,
Dan Gohman8181bd12008-07-27 21:46:04 +0000703 SDValue(CurDAG->getTargetNode(PPC::LI, MVT::i32,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000704 getI32Imm(0)), 0),
705 Op.getValue(1));
706 case ISD::SETNE: {
Dan Gohman8181bd12008-07-27 21:46:04 +0000707 Op = SDValue(CurDAG->getTargetNode(PPC::NOR, MVT::i32, Op, Op), 0);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000708 SDNode *AD = CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
709 Op, getI32Imm(~0U));
Dan Gohman8181bd12008-07-27 21:46:04 +0000710 return CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, SDValue(AD, 0),
711 Op, SDValue(AD, 1));
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000712 }
713 case ISD::SETLT: {
Dan Gohman8181bd12008-07-27 21:46:04 +0000714 SDValue AD = SDValue(CurDAG->getTargetNode(PPC::ADDI, MVT::i32, Op,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000715 getI32Imm(1)), 0);
Dan Gohman8181bd12008-07-27 21:46:04 +0000716 SDValue AN = SDValue(CurDAG->getTargetNode(PPC::AND, MVT::i32, AD,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000717 Op), 0);
Dan Gohman8181bd12008-07-27 21:46:04 +0000718 SDValue Ops[] = { AN, getI32Imm(1), getI32Imm(31), getI32Imm(31) };
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000719 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
720 }
721 case ISD::SETGT: {
Dan Gohman8181bd12008-07-27 21:46:04 +0000722 SDValue Ops[] = { Op, getI32Imm(1), getI32Imm(31), getI32Imm(31) };
723 Op = SDValue(CurDAG->getTargetNode(PPC::RLWINM, MVT::i32, Ops, 4), 0);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000724 return CurDAG->SelectNodeTo(N, PPC::XORI, MVT::i32, Op,
725 getI32Imm(1));
726 }
727 }
728 }
729 }
730
731 bool Inv;
Chris Lattner6c36fb52008-01-08 06:46:30 +0000732 int OtherCondIdx;
733 unsigned Idx = getCRIdxForSetCC(CC, Inv, OtherCondIdx);
Dan Gohman8181bd12008-07-27 21:46:04 +0000734 SDValue CCReg = SelectCC(N->getOperand(0), N->getOperand(1), CC);
735 SDValue IntCR;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000736
737 // Force the ccreg into CR7.
Dan Gohman8181bd12008-07-27 21:46:04 +0000738 SDValue CR7Reg = CurDAG->getRegister(PPC::CR7, MVT::i32);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000739
Dan Gohman8181bd12008-07-27 21:46:04 +0000740 SDValue InFlag(0, 0); // Null incoming flag value.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000741 CCReg = CurDAG->getCopyToReg(CurDAG->getEntryNode(), CR7Reg, CCReg,
742 InFlag).getValue(1);
743
Chris Lattner6c36fb52008-01-08 06:46:30 +0000744 if (PPCSubTarget.isGigaProcessor() && OtherCondIdx == -1)
Dan Gohman8181bd12008-07-27 21:46:04 +0000745 IntCR = SDValue(CurDAG->getTargetNode(PPC::MFOCRF, MVT::i32, CR7Reg,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000746 CCReg), 0);
747 else
Dan Gohman8181bd12008-07-27 21:46:04 +0000748 IntCR = SDValue(CurDAG->getTargetNode(PPC::MFCR, MVT::i32, CCReg), 0);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000749
Dan Gohman8181bd12008-07-27 21:46:04 +0000750 SDValue Ops[] = { IntCR, getI32Imm((32-(3-Idx)) & 31),
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000751 getI32Imm(31), getI32Imm(31) };
Chris Lattner6c36fb52008-01-08 06:46:30 +0000752 if (OtherCondIdx == -1 && !Inv)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000753 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
Chris Lattner6c36fb52008-01-08 06:46:30 +0000754
755 // Get the specified bit.
Dan Gohman8181bd12008-07-27 21:46:04 +0000756 SDValue Tmp =
757 SDValue(CurDAG->getTargetNode(PPC::RLWINM, MVT::i32, Ops, 4), 0);
Chris Lattner6c36fb52008-01-08 06:46:30 +0000758 if (Inv) {
759 assert(OtherCondIdx == -1 && "Can't have split plus negation");
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000760 return CurDAG->SelectNodeTo(N, PPC::XORI, MVT::i32, Tmp, getI32Imm(1));
761 }
Chris Lattner6c36fb52008-01-08 06:46:30 +0000762
763 // Otherwise, we have to turn an operation like SETONE -> SETOLT | SETOGT.
764 // We already got the bit for the first part of the comparison (e.g. SETULE).
765
766 // Get the other bit of the comparison.
767 Ops[1] = getI32Imm((32-(3-OtherCondIdx)) & 31);
Dan Gohman8181bd12008-07-27 21:46:04 +0000768 SDValue OtherCond =
769 SDValue(CurDAG->getTargetNode(PPC::RLWINM, MVT::i32, Ops, 4), 0);
Chris Lattner6c36fb52008-01-08 06:46:30 +0000770
771 return CurDAG->SelectNodeTo(N, PPC::OR, MVT::i32, Tmp, OtherCond);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000772}
773
774
775// Select - Convert the specified operand from a target-independent to a
776// target-specific node if it hasn't already been changed.
Dan Gohman8181bd12008-07-27 21:46:04 +0000777SDNode *PPCDAGToDAGISel::Select(SDValue Op) {
Gabor Greif1c80d112008-08-28 21:40:38 +0000778 SDNode *N = Op.getNode();
Dan Gohmanbd68c792008-07-17 19:10:17 +0000779 if (N->isMachineOpcode())
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000780 return NULL; // Already selected.
781
782 switch (N->getOpcode()) {
783 default: break;
784
785 case ISD::Constant: {
786 if (N->getValueType(0) == MVT::i64) {
787 // Get 64 bit value.
Dan Gohmanfaeb4a32008-09-12 16:56:44 +0000788 int64_t Imm = cast<ConstantSDNode>(N)->getZExtValue();
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000789 // Assume no remaining bits.
790 unsigned Remainder = 0;
791 // Assume no shift required.
792 unsigned Shift = 0;
793
794 // If it can't be represented as a 32 bit value.
795 if (!isInt32(Imm)) {
796 Shift = CountTrailingZeros_64(Imm);
797 int64_t ImmSh = static_cast<uint64_t>(Imm) >> Shift;
798
799 // If the shifted value fits 32 bits.
800 if (isInt32(ImmSh)) {
801 // Go with the shifted value.
802 Imm = ImmSh;
803 } else {
804 // Still stuck with a 64 bit value.
805 Remainder = Imm;
806 Shift = 32;
807 Imm >>= 32;
808 }
809 }
810
811 // Intermediate operand.
812 SDNode *Result;
813
814 // Handle first 32 bits.
815 unsigned Lo = Imm & 0xFFFF;
816 unsigned Hi = (Imm >> 16) & 0xFFFF;
817
818 // Simple value.
819 if (isInt16(Imm)) {
820 // Just the Lo bits.
821 Result = CurDAG->getTargetNode(PPC::LI8, MVT::i64, getI32Imm(Lo));
822 } else if (Lo) {
823 // Handle the Hi bits.
824 unsigned OpC = Hi ? PPC::LIS8 : PPC::LI8;
825 Result = CurDAG->getTargetNode(OpC, MVT::i64, getI32Imm(Hi));
826 // And Lo bits.
827 Result = CurDAG->getTargetNode(PPC::ORI8, MVT::i64,
Dan Gohman8181bd12008-07-27 21:46:04 +0000828 SDValue(Result, 0), getI32Imm(Lo));
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000829 } else {
830 // Just the Hi bits.
831 Result = CurDAG->getTargetNode(PPC::LIS8, MVT::i64, getI32Imm(Hi));
832 }
833
834 // If no shift, we're done.
835 if (!Shift) return Result;
836
837 // Shift for next step if the upper 32-bits were not zero.
838 if (Imm) {
839 Result = CurDAG->getTargetNode(PPC::RLDICR, MVT::i64,
Dan Gohman8181bd12008-07-27 21:46:04 +0000840 SDValue(Result, 0),
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000841 getI32Imm(Shift), getI32Imm(63 - Shift));
842 }
843
844 // Add in the last bits as required.
845 if ((Hi = (Remainder >> 16) & 0xFFFF)) {
846 Result = CurDAG->getTargetNode(PPC::ORIS8, MVT::i64,
Dan Gohman8181bd12008-07-27 21:46:04 +0000847 SDValue(Result, 0), getI32Imm(Hi));
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000848 }
849 if ((Lo = Remainder & 0xFFFF)) {
850 Result = CurDAG->getTargetNode(PPC::ORI8, MVT::i64,
Dan Gohman8181bd12008-07-27 21:46:04 +0000851 SDValue(Result, 0), getI32Imm(Lo));
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000852 }
853
854 return Result;
855 }
856 break;
857 }
858
859 case ISD::SETCC:
860 return SelectSETCC(Op);
861 case PPCISD::GlobalBaseReg:
862 return getGlobalBaseReg();
863
864 case ISD::FrameIndex: {
865 int FI = cast<FrameIndexSDNode>(N)->getIndex();
Dan Gohman8181bd12008-07-27 21:46:04 +0000866 SDValue TFI = CurDAG->getTargetFrameIndex(FI, Op.getValueType());
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000867 unsigned Opc = Op.getValueType() == MVT::i32 ? PPC::ADDI : PPC::ADDI8;
868 if (N->hasOneUse())
869 return CurDAG->SelectNodeTo(N, Opc, Op.getValueType(), TFI,
870 getSmallIPtrImm(0));
871 return CurDAG->getTargetNode(Opc, Op.getValueType(), TFI,
872 getSmallIPtrImm(0));
873 }
874
875 case PPCISD::MFCR: {
Dan Gohman8181bd12008-07-27 21:46:04 +0000876 SDValue InFlag = N->getOperand(1);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000877 AddToISelQueue(InFlag);
878 // Use MFOCRF if supported.
Evan Cheng9d99c5e2007-10-23 06:42:42 +0000879 if (PPCSubTarget.isGigaProcessor())
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000880 return CurDAG->getTargetNode(PPC::MFOCRF, MVT::i32,
881 N->getOperand(0), InFlag);
882 else
883 return CurDAG->getTargetNode(PPC::MFCR, MVT::i32, InFlag);
884 }
885
886 case ISD::SDIV: {
887 // FIXME: since this depends on the setting of the carry flag from the srawi
888 // we should really be making notes about that for the scheduler.
889 // FIXME: It sure would be nice if we could cheaply recognize the
890 // srl/add/sra pattern the dag combiner will generate for this as
891 // sra/addze rather than having to handle sdiv ourselves. oh well.
892 unsigned Imm;
893 if (isInt32Immediate(N->getOperand(1), Imm)) {
Dan Gohman8181bd12008-07-27 21:46:04 +0000894 SDValue N0 = N->getOperand(0);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000895 AddToISelQueue(N0);
896 if ((signed)Imm > 0 && isPowerOf2_32(Imm)) {
897 SDNode *Op =
898 CurDAG->getTargetNode(PPC::SRAWI, MVT::i32, MVT::Flag,
899 N0, getI32Imm(Log2_32(Imm)));
900 return CurDAG->SelectNodeTo(N, PPC::ADDZE, MVT::i32,
Dan Gohman8181bd12008-07-27 21:46:04 +0000901 SDValue(Op, 0), SDValue(Op, 1));
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000902 } else if ((signed)Imm < 0 && isPowerOf2_32(-Imm)) {
903 SDNode *Op =
904 CurDAG->getTargetNode(PPC::SRAWI, MVT::i32, MVT::Flag,
905 N0, getI32Imm(Log2_32(-Imm)));
Dan Gohman8181bd12008-07-27 21:46:04 +0000906 SDValue PT =
907 SDValue(CurDAG->getTargetNode(PPC::ADDZE, MVT::i32,
908 SDValue(Op, 0), SDValue(Op, 1)),
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000909 0);
910 return CurDAG->SelectNodeTo(N, PPC::NEG, MVT::i32, PT);
911 }
912 }
913
914 // Other cases are autogenerated.
915 break;
916 }
917
918 case ISD::LOAD: {
919 // Handle preincrement loads.
920 LoadSDNode *LD = cast<LoadSDNode>(Op);
Duncan Sands92c43912008-06-06 12:08:01 +0000921 MVT LoadedVT = LD->getMemoryVT();
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000922
923 // Normal loads are handled by code generated from the .td file.
924 if (LD->getAddressingMode() != ISD::PRE_INC)
925 break;
926
Dan Gohman8181bd12008-07-27 21:46:04 +0000927 SDValue Offset = LD->getOffset();
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000928 if (isa<ConstantSDNode>(Offset) ||
929 Offset.getOpcode() == ISD::TargetGlobalAddress) {
930
931 unsigned Opcode;
932 bool isSExt = LD->getExtensionType() == ISD::SEXTLOAD;
933 if (LD->getValueType(0) != MVT::i64) {
934 // Handle PPC32 integer and normal FP loads.
Anton Korobeynikov8c90d2a2008-02-20 11:22:39 +0000935 assert((!isSExt || LoadedVT == MVT::i16) && "Invalid sext update load");
Duncan Sands92c43912008-06-06 12:08:01 +0000936 switch (LoadedVT.getSimpleVT()) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000937 default: assert(0 && "Invalid PPC load type!");
938 case MVT::f64: Opcode = PPC::LFDU; break;
939 case MVT::f32: Opcode = PPC::LFSU; break;
940 case MVT::i32: Opcode = PPC::LWZU; break;
941 case MVT::i16: Opcode = isSExt ? PPC::LHAU : PPC::LHZU; break;
942 case MVT::i1:
943 case MVT::i8: Opcode = PPC::LBZU; break;
944 }
945 } else {
946 assert(LD->getValueType(0) == MVT::i64 && "Unknown load result type!");
Anton Korobeynikov8c90d2a2008-02-20 11:22:39 +0000947 assert((!isSExt || LoadedVT == MVT::i16) && "Invalid sext update load");
Duncan Sands92c43912008-06-06 12:08:01 +0000948 switch (LoadedVT.getSimpleVT()) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000949 default: assert(0 && "Invalid PPC load type!");
950 case MVT::i64: Opcode = PPC::LDU; break;
951 case MVT::i32: Opcode = PPC::LWZU8; break;
952 case MVT::i16: Opcode = isSExt ? PPC::LHAU8 : PPC::LHZU8; break;
953 case MVT::i1:
954 case MVT::i8: Opcode = PPC::LBZU8; break;
955 }
956 }
957
Dan Gohman8181bd12008-07-27 21:46:04 +0000958 SDValue Chain = LD->getChain();
959 SDValue Base = LD->getBasePtr();
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000960 AddToISelQueue(Chain);
961 AddToISelQueue(Base);
962 AddToISelQueue(Offset);
Dan Gohman8181bd12008-07-27 21:46:04 +0000963 SDValue Ops[] = { Offset, Base, Chain };
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000964 // FIXME: PPC64
Dan Gohmanbd68c792008-07-17 19:10:17 +0000965 return CurDAG->getTargetNode(Opcode, LD->getValueType(0),
966 PPCLowering.getPointerTy(),
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000967 MVT::Other, Ops, 3);
968 } else {
969 assert(0 && "R+R preindex loads not supported yet!");
970 }
971 }
972
973 case ISD::AND: {
974 unsigned Imm, Imm2, SH, MB, ME;
975
976 // If this is an and of a value rotated between 0 and 31 bits and then and'd
977 // with a mask, emit rlwinm
978 if (isInt32Immediate(N->getOperand(1), Imm) &&
Gabor Greif1c80d112008-08-28 21:40:38 +0000979 isRotateAndMask(N->getOperand(0).getNode(), Imm, false, SH, MB, ME)) {
Dan Gohman8181bd12008-07-27 21:46:04 +0000980 SDValue Val = N->getOperand(0).getOperand(0);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000981 AddToISelQueue(Val);
Dan Gohman8181bd12008-07-27 21:46:04 +0000982 SDValue Ops[] = { Val, getI32Imm(SH), getI32Imm(MB), getI32Imm(ME) };
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000983 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
984 }
985 // If this is just a masked value where the input is not handled above, and
986 // is not a rotate-left (handled by a pattern in the .td file), emit rlwinm
987 if (isInt32Immediate(N->getOperand(1), Imm) &&
988 isRunOfOnes(Imm, MB, ME) &&
989 N->getOperand(0).getOpcode() != ISD::ROTL) {
Dan Gohman8181bd12008-07-27 21:46:04 +0000990 SDValue Val = N->getOperand(0);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000991 AddToISelQueue(Val);
Dan Gohman8181bd12008-07-27 21:46:04 +0000992 SDValue Ops[] = { Val, getI32Imm(0), getI32Imm(MB), getI32Imm(ME) };
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000993 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
994 }
995 // AND X, 0 -> 0, not "rlwinm 32".
996 if (isInt32Immediate(N->getOperand(1), Imm) && (Imm == 0)) {
997 AddToISelQueue(N->getOperand(1));
Dan Gohman8181bd12008-07-27 21:46:04 +0000998 ReplaceUses(SDValue(N, 0), N->getOperand(1));
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000999 return NULL;
1000 }
1001 // ISD::OR doesn't get all the bitfield insertion fun.
1002 // (and (or x, c1), c2) where isRunOfOnes(~(c1^c2)) is a bitfield insert
1003 if (isInt32Immediate(N->getOperand(1), Imm) &&
1004 N->getOperand(0).getOpcode() == ISD::OR &&
1005 isInt32Immediate(N->getOperand(0).getOperand(1), Imm2)) {
1006 unsigned MB, ME;
1007 Imm = ~(Imm^Imm2);
1008 if (isRunOfOnes(Imm, MB, ME)) {
1009 AddToISelQueue(N->getOperand(0).getOperand(0));
1010 AddToISelQueue(N->getOperand(0).getOperand(1));
Dan Gohman8181bd12008-07-27 21:46:04 +00001011 SDValue Ops[] = { N->getOperand(0).getOperand(0),
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001012 N->getOperand(0).getOperand(1),
1013 getI32Imm(0), getI32Imm(MB),getI32Imm(ME) };
1014 return CurDAG->getTargetNode(PPC::RLWIMI, MVT::i32, Ops, 5);
1015 }
1016 }
1017
1018 // Other cases are autogenerated.
1019 break;
1020 }
1021 case ISD::OR:
1022 if (N->getValueType(0) == MVT::i32)
1023 if (SDNode *I = SelectBitfieldInsert(N))
1024 return I;
1025
1026 // Other cases are autogenerated.
1027 break;
1028 case ISD::SHL: {
1029 unsigned Imm, SH, MB, ME;
Gabor Greif1c80d112008-08-28 21:40:38 +00001030 if (isOpcWithIntImmediate(N->getOperand(0).getNode(), ISD::AND, Imm) &&
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001031 isRotateAndMask(N, Imm, true, SH, MB, ME)) {
1032 AddToISelQueue(N->getOperand(0).getOperand(0));
Dan Gohman8181bd12008-07-27 21:46:04 +00001033 SDValue Ops[] = { N->getOperand(0).getOperand(0),
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001034 getI32Imm(SH), getI32Imm(MB), getI32Imm(ME) };
1035 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
1036 }
1037
1038 // Other cases are autogenerated.
1039 break;
1040 }
1041 case ISD::SRL: {
1042 unsigned Imm, SH, MB, ME;
Gabor Greif1c80d112008-08-28 21:40:38 +00001043 if (isOpcWithIntImmediate(N->getOperand(0).getNode(), ISD::AND, Imm) &&
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001044 isRotateAndMask(N, Imm, true, SH, MB, ME)) {
1045 AddToISelQueue(N->getOperand(0).getOperand(0));
Dan Gohman8181bd12008-07-27 21:46:04 +00001046 SDValue Ops[] = { N->getOperand(0).getOperand(0),
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001047 getI32Imm(SH), getI32Imm(MB), getI32Imm(ME) };
1048 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
1049 }
1050
1051 // Other cases are autogenerated.
1052 break;
1053 }
1054 case ISD::SELECT_CC: {
1055 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(4))->get();
1056
1057 // Handle the setcc cases here. select_cc lhs, 0, 1, 0, cc
1058 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N->getOperand(1)))
1059 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N->getOperand(2)))
1060 if (ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N->getOperand(3)))
1061 if (N1C->isNullValue() && N3C->isNullValue() &&
Dan Gohmanfaeb4a32008-09-12 16:56:44 +00001062 N2C->getZExtValue() == 1ULL && CC == ISD::SETNE &&
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001063 // FIXME: Implement this optzn for PPC64.
1064 N->getValueType(0) == MVT::i32) {
1065 AddToISelQueue(N->getOperand(0));
1066 SDNode *Tmp =
1067 CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
1068 N->getOperand(0), getI32Imm(~0U));
1069 return CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32,
Dan Gohman8181bd12008-07-27 21:46:04 +00001070 SDValue(Tmp, 0), N->getOperand(0),
1071 SDValue(Tmp, 1));
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001072 }
1073
Dan Gohman8181bd12008-07-27 21:46:04 +00001074 SDValue CCReg = SelectCC(N->getOperand(0), N->getOperand(1), CC);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001075 unsigned BROpc = getPredicateForSetCC(CC);
1076
1077 unsigned SelectCCOp;
1078 if (N->getValueType(0) == MVT::i32)
1079 SelectCCOp = PPC::SELECT_CC_I4;
1080 else if (N->getValueType(0) == MVT::i64)
1081 SelectCCOp = PPC::SELECT_CC_I8;
1082 else if (N->getValueType(0) == MVT::f32)
1083 SelectCCOp = PPC::SELECT_CC_F4;
1084 else if (N->getValueType(0) == MVT::f64)
1085 SelectCCOp = PPC::SELECT_CC_F8;
1086 else
1087 SelectCCOp = PPC::SELECT_CC_VRRC;
1088
1089 AddToISelQueue(N->getOperand(2));
1090 AddToISelQueue(N->getOperand(3));
Dan Gohman8181bd12008-07-27 21:46:04 +00001091 SDValue Ops[] = { CCReg, N->getOperand(2), N->getOperand(3),
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001092 getI32Imm(BROpc) };
1093 return CurDAG->SelectNodeTo(N, SelectCCOp, N->getValueType(0), Ops, 4);
1094 }
1095 case PPCISD::COND_BRANCH: {
1096 AddToISelQueue(N->getOperand(0)); // Op #0 is the Chain.
1097 // Op #1 is the PPC::PRED_* number.
1098 // Op #2 is the CR#
1099 // Op #3 is the Dest MBB
1100 AddToISelQueue(N->getOperand(4)); // Op #4 is the Flag.
1101 // Prevent PPC::PRED_* from being selected into LI.
Dan Gohman8181bd12008-07-27 21:46:04 +00001102 SDValue Pred =
Dan Gohmanfaeb4a32008-09-12 16:56:44 +00001103 getI32Imm(cast<ConstantSDNode>(N->getOperand(1))->getZExtValue());
Dan Gohman8181bd12008-07-27 21:46:04 +00001104 SDValue Ops[] = { Pred, N->getOperand(2), N->getOperand(3),
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001105 N->getOperand(0), N->getOperand(4) };
1106 return CurDAG->SelectNodeTo(N, PPC::BCC, MVT::Other, Ops, 5);
1107 }
1108 case ISD::BR_CC: {
1109 AddToISelQueue(N->getOperand(0));
1110 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(1))->get();
Dan Gohman8181bd12008-07-27 21:46:04 +00001111 SDValue CondCode = SelectCC(N->getOperand(2), N->getOperand(3), CC);
1112 SDValue Ops[] = { getI32Imm(getPredicateForSetCC(CC)), CondCode,
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001113 N->getOperand(4), N->getOperand(0) };
1114 return CurDAG->SelectNodeTo(N, PPC::BCC, MVT::Other, Ops, 4);
1115 }
1116 case ISD::BRIND: {
1117 // FIXME: Should custom lower this.
Dan Gohman8181bd12008-07-27 21:46:04 +00001118 SDValue Chain = N->getOperand(0);
1119 SDValue Target = N->getOperand(1);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001120 AddToISelQueue(Chain);
1121 AddToISelQueue(Target);
1122 unsigned Opc = Target.getValueType() == MVT::i32 ? PPC::MTCTR : PPC::MTCTR8;
Dan Gohman8181bd12008-07-27 21:46:04 +00001123 Chain = SDValue(CurDAG->getTargetNode(Opc, MVT::Other, Target,
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001124 Chain), 0);
1125 return CurDAG->SelectNodeTo(N, PPC::BCTR, MVT::Other, Chain);
1126 }
1127 }
1128
1129 return SelectCode(Op);
1130}
1131
1132
1133
1134/// createPPCISelDag - This pass converts a legalized DAG into a
1135/// PowerPC-specific DAG, ready for instruction scheduling.
1136///
1137FunctionPass *llvm::createPPCISelDag(PPCTargetMachine &TM) {
1138 return new PPCDAGToDAGISel(TM);
1139}
1140