blob: 26f1316899531fcf78b74cad8d0b542aee8d1742 [file] [log] [blame]
Nate Begeman21e463b2005-10-16 05:39:50 +00001//===-- PPCISelDAGToDAG.cpp - PPC --pattern matching inst selector --------===//
Chris Lattnera5a91b12005-08-17 19:33:03 +00002//
3// The LLVM Compiler Infrastructure
4//
5// This file was developed by Chris Lattner and is distributed under
6// the University of Illinois Open Source License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
Nate Begeman21e463b2005-10-16 05:39:50 +000010// This file defines a pattern matching instruction selector for PowerPC,
Chris Lattnera5a91b12005-08-17 19:33:03 +000011// converting from a legalized dag to a PPC dag.
12//
13//===----------------------------------------------------------------------===//
14
Chris Lattner26689592005-10-14 23:51:18 +000015#include "PPC.h"
Chris Lattner16e71f22005-10-14 23:59:06 +000016#include "PPCTargetMachine.h"
17#include "PPCISelLowering.h"
Chris Lattnerc6644182006-03-07 06:32:48 +000018#include "PPCHazardRecognizers.h"
Chris Lattner4416f1a2005-08-19 22:38:53 +000019#include "llvm/CodeGen/MachineInstrBuilder.h"
20#include "llvm/CodeGen/MachineFunction.h"
21#include "llvm/CodeGen/SSARegMap.h"
Chris Lattnera5a91b12005-08-17 19:33:03 +000022#include "llvm/CodeGen/SelectionDAG.h"
23#include "llvm/CodeGen/SelectionDAGISel.h"
24#include "llvm/Target/TargetOptions.h"
25#include "llvm/ADT/Statistic.h"
Chris Lattner2fe76e52005-08-25 04:47:18 +000026#include "llvm/Constants.h"
Chris Lattner4416f1a2005-08-19 22:38:53 +000027#include "llvm/GlobalValue.h"
Chris Lattner420736d2006-03-25 06:47:10 +000028#include "llvm/Intrinsics.h"
Chris Lattnera5a91b12005-08-17 19:33:03 +000029#include "llvm/Support/Debug.h"
30#include "llvm/Support/MathExtras.h"
Chris Lattner2c2c6c62006-01-22 23:41:00 +000031#include <iostream>
Evan Chengba2f0a92006-02-05 06:46:41 +000032#include <set>
Chris Lattnera5a91b12005-08-17 19:33:03 +000033using namespace llvm;
34
35namespace {
Chris Lattnera5a91b12005-08-17 19:33:03 +000036 Statistic<> FrameOff("ppc-codegen", "Number of frame idx offsets collapsed");
37
38 //===--------------------------------------------------------------------===//
Nate Begeman1d9d7422005-10-18 00:28:58 +000039 /// PPCDAGToDAGISel - PPC specific code to select PPC machine
Chris Lattnera5a91b12005-08-17 19:33:03 +000040 /// instructions for SelectionDAG operations.
41 ///
Nate Begeman1d9d7422005-10-18 00:28:58 +000042 class PPCDAGToDAGISel : public SelectionDAGISel {
Chris Lattner4bb18952006-03-16 18:25:23 +000043 PPCTargetMachine &TM;
Nate Begeman21e463b2005-10-16 05:39:50 +000044 PPCTargetLowering PPCLowering;
Chris Lattner4416f1a2005-08-19 22:38:53 +000045 unsigned GlobalBaseReg;
Chris Lattnera5a91b12005-08-17 19:33:03 +000046 public:
Chris Lattner4bb18952006-03-16 18:25:23 +000047 PPCDAGToDAGISel(PPCTargetMachine &tm)
48 : SelectionDAGISel(PPCLowering), TM(tm),
49 PPCLowering(*TM.getTargetLowering()) {}
Chris Lattnera5a91b12005-08-17 19:33:03 +000050
Chris Lattner4416f1a2005-08-19 22:38:53 +000051 virtual bool runOnFunction(Function &Fn) {
52 // Make sure we re-emit a set of the global base reg if necessary
53 GlobalBaseReg = 0;
Chris Lattner4bb18952006-03-16 18:25:23 +000054 SelectionDAGISel::runOnFunction(Fn);
55
56 InsertVRSaveCode(Fn);
57 return true;
Chris Lattner4416f1a2005-08-19 22:38:53 +000058 }
59
Chris Lattnera5a91b12005-08-17 19:33:03 +000060 /// getI32Imm - Return a target constant with the specified value, of type
61 /// i32.
62 inline SDOperand getI32Imm(unsigned Imm) {
63 return CurDAG->getTargetConstant(Imm, MVT::i32);
64 }
Chris Lattner4416f1a2005-08-19 22:38:53 +000065
66 /// getGlobalBaseReg - insert code into the entry mbb to materialize the PIC
67 /// base register. Return the virtual register that holds this value.
Chris Lattner9944b762005-08-21 22:31:09 +000068 SDOperand getGlobalBaseReg();
Chris Lattnera5a91b12005-08-17 19:33:03 +000069
70 // Select - Convert the specified operand from a target-independent to a
71 // target-specific node if it hasn't already been changed.
Evan Cheng34167212006-02-09 00:37:58 +000072 void Select(SDOperand &Result, SDOperand Op);
Chris Lattnera5a91b12005-08-17 19:33:03 +000073
Nate Begeman02b88a42005-08-19 00:38:14 +000074 SDNode *SelectBitfieldInsert(SDNode *N);
75
Chris Lattner2fbb4572005-08-21 18:50:37 +000076 /// SelectCC - Select a comparison of the specified values with the
77 /// specified condition code, returning the CR# of the expression.
78 SDOperand SelectCC(SDOperand LHS, SDOperand RHS, ISD::CondCode CC);
79
Nate Begeman7fd1edd2005-12-19 23:25:09 +000080 /// SelectAddrImm - Returns true if the address N can be represented by
81 /// a base register plus a signed 16-bit displacement [r+imm].
82 bool SelectAddrImm(SDOperand N, SDOperand &Disp, SDOperand &Base);
83
84 /// SelectAddrIdx - Given the specified addressed, check to see if it can be
85 /// represented as an indexed [r+r] operation. Returns false if it can
86 /// be represented by [r+imm], which are preferred.
87 bool SelectAddrIdx(SDOperand N, SDOperand &Base, SDOperand &Index);
Nate Begemanf43a3ca2005-11-30 08:22:07 +000088
Nate Begeman7fd1edd2005-12-19 23:25:09 +000089 /// SelectAddrIdxOnly - Given the specified addressed, force it to be
90 /// represented as an indexed [r+r] operation.
91 bool SelectAddrIdxOnly(SDOperand N, SDOperand &Base, SDOperand &Index);
Chris Lattner9944b762005-08-21 22:31:09 +000092
Chris Lattnere5ba5802006-03-22 05:26:03 +000093 /// SelectAddrImmShift - Returns true if the address N can be represented by
94 /// a base register plus a signed 14-bit displacement [r+imm*4]. Suitable
95 /// for use by STD and friends.
96 bool SelectAddrImmShift(SDOperand N, SDOperand &Disp, SDOperand &Base);
97
Chris Lattnere5d88612006-02-24 02:13:12 +000098 /// SelectInlineAsmMemoryOperand - Implement addressing mode selection for
99 /// inline asm expressions.
100 virtual bool SelectInlineAsmMemoryOperand(const SDOperand &Op,
101 char ConstraintCode,
102 std::vector<SDOperand> &OutOps,
103 SelectionDAG &DAG) {
104 SDOperand Op0, Op1;
105 switch (ConstraintCode) {
106 default: return true;
107 case 'm': // memory
108 if (!SelectAddrIdx(Op, Op0, Op1))
109 SelectAddrImm(Op, Op0, Op1);
110 break;
111 case 'o': // offsetable
112 if (!SelectAddrImm(Op, Op0, Op1)) {
113 Select(Op0, Op); // r+0.
114 Op1 = getI32Imm(0);
115 }
116 break;
117 case 'v': // not offsetable
118 SelectAddrIdxOnly(Op, Op0, Op1);
119 break;
120 }
121
122 OutOps.push_back(Op0);
123 OutOps.push_back(Op1);
124 return false;
125 }
126
Chris Lattner047b9522005-08-25 22:04:30 +0000127 SDOperand BuildSDIVSequence(SDNode *N);
128 SDOperand BuildUDIVSequence(SDNode *N);
129
Chris Lattnera5a91b12005-08-17 19:33:03 +0000130 /// InstructionSelectBasicBlock - This callback is invoked by
131 /// SelectionDAGISel when it has created a SelectionDAG for us to codegen.
Chris Lattnerbd937b92005-10-06 18:45:51 +0000132 virtual void InstructionSelectBasicBlock(SelectionDAG &DAG);
133
Chris Lattner4bb18952006-03-16 18:25:23 +0000134 void InsertVRSaveCode(Function &Fn);
135
Chris Lattnera5a91b12005-08-17 19:33:03 +0000136 virtual const char *getPassName() const {
137 return "PowerPC DAG->DAG Pattern Instruction Selection";
138 }
Chris Lattnerc6644182006-03-07 06:32:48 +0000139
Chris Lattnerb0d21ef2006-03-08 04:25:59 +0000140 /// CreateTargetHazardRecognizer - Return the hazard recognizer to use for this
Chris Lattnerc6644182006-03-07 06:32:48 +0000141 /// target when scheduling the DAG.
Chris Lattnerb0d21ef2006-03-08 04:25:59 +0000142 virtual HazardRecognizer *CreateTargetHazardRecognizer() {
Chris Lattnerc6644182006-03-07 06:32:48 +0000143 // Should use subtarget info to pick the right hazard recognizer. For
144 // now, always return a PPC970 recognizer.
Chris Lattner88d211f2006-03-12 09:13:49 +0000145 const TargetInstrInfo *II = PPCLowering.getTargetMachine().getInstrInfo();
146 assert(II && "No InstrInfo?");
147 return new PPCHazardRecognizer970(*II);
Chris Lattnerc6644182006-03-07 06:32:48 +0000148 }
Chris Lattneraf165382005-09-13 22:03:06 +0000149
150// Include the pieces autogenerated from the target description.
Chris Lattner4c7b43b2005-10-14 23:37:35 +0000151#include "PPCGenDAGISel.inc"
Chris Lattnerbd937b92005-10-06 18:45:51 +0000152
153private:
Chris Lattner222adac2005-10-06 19:03:35 +0000154 SDOperand SelectSETCC(SDOperand Op);
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000155 SDOperand SelectCALL(SDOperand Op);
Chris Lattnera5a91b12005-08-17 19:33:03 +0000156 };
157}
158
Chris Lattnerbd937b92005-10-06 18:45:51 +0000159/// InstructionSelectBasicBlock - This callback is invoked by
160/// SelectionDAGISel when it has created a SelectionDAG for us to codegen.
Nate Begeman1d9d7422005-10-18 00:28:58 +0000161void PPCDAGToDAGISel::InstructionSelectBasicBlock(SelectionDAG &DAG) {
Chris Lattnerbd937b92005-10-06 18:45:51 +0000162 DEBUG(BB->dump());
163
164 // The selection process is inherently a bottom-up recursive process (users
165 // select their uses before themselves). Given infinite stack space, we
166 // could just start selecting on the root and traverse the whole graph. In
167 // practice however, this causes us to run out of stack space on large basic
168 // blocks. To avoid this problem, select the entry node, then all its uses,
169 // iteratively instead of recursively.
170 std::vector<SDOperand> Worklist;
171 Worklist.push_back(DAG.getEntryNode());
172
173 // Note that we can do this in the PPC target (scanning forward across token
174 // chain edges) because no nodes ever get folded across these edges. On a
175 // target like X86 which supports load/modify/store operations, this would
176 // have to be more careful.
177 while (!Worklist.empty()) {
178 SDOperand Node = Worklist.back();
179 Worklist.pop_back();
180
Chris Lattnercf01a702005-10-07 22:10:27 +0000181 // Chose from the least deep of the top two nodes.
182 if (!Worklist.empty() &&
183 Worklist.back().Val->getNodeDepth() < Node.Val->getNodeDepth())
184 std::swap(Worklist.back(), Node);
185
Chris Lattnerbd937b92005-10-06 18:45:51 +0000186 if ((Node.Val->getOpcode() >= ISD::BUILTIN_OP_END &&
187 Node.Val->getOpcode() < PPCISD::FIRST_NUMBER) ||
188 CodeGenMap.count(Node)) continue;
189
190 for (SDNode::use_iterator UI = Node.Val->use_begin(),
191 E = Node.Val->use_end(); UI != E; ++UI) {
192 // Scan the values. If this use has a value that is a token chain, add it
193 // to the worklist.
194 SDNode *User = *UI;
195 for (unsigned i = 0, e = User->getNumValues(); i != e; ++i)
196 if (User->getValueType(i) == MVT::Other) {
197 Worklist.push_back(SDOperand(User, i));
198 break;
199 }
200 }
201
202 // Finally, legalize this node.
Evan Cheng34167212006-02-09 00:37:58 +0000203 SDOperand Dummy;
204 Select(Dummy, Node);
Chris Lattnerbd937b92005-10-06 18:45:51 +0000205 }
Chris Lattnercf01a702005-10-07 22:10:27 +0000206
Chris Lattnerbd937b92005-10-06 18:45:51 +0000207 // Select target instructions for the DAG.
Evan Chengba2f0a92006-02-05 06:46:41 +0000208 DAG.setRoot(SelectRoot(DAG.getRoot()));
Chris Lattnerbd937b92005-10-06 18:45:51 +0000209 CodeGenMap.clear();
210 DAG.RemoveDeadNodes();
211
Chris Lattner1877ec92006-03-13 21:52:10 +0000212 // Emit machine code to BB.
Chris Lattnerbd937b92005-10-06 18:45:51 +0000213 ScheduleAndEmitDAG(DAG);
Chris Lattner4bb18952006-03-16 18:25:23 +0000214}
215
216/// InsertVRSaveCode - Once the entire function has been instruction selected,
217/// all virtual registers are created and all machine instructions are built,
218/// check to see if we need to save/restore VRSAVE. If so, do it.
219void PPCDAGToDAGISel::InsertVRSaveCode(Function &F) {
Chris Lattner1877ec92006-03-13 21:52:10 +0000220 // Check to see if this function uses vector registers, which means we have to
221 // save and restore the VRSAVE register and update it with the regs we use.
222 //
223 // In this case, there will be virtual registers of vector type type created
224 // by the scheduler. Detect them now.
Chris Lattner4bb18952006-03-16 18:25:23 +0000225 MachineFunction &Fn = MachineFunction::get(&F);
226 SSARegMap *RegMap = Fn.getSSARegMap();
Chris Lattner1877ec92006-03-13 21:52:10 +0000227 bool HasVectorVReg = false;
228 for (unsigned i = MRegisterInfo::FirstVirtualRegister,
Chris Lattnera08610c2006-03-14 17:56:49 +0000229 e = RegMap->getLastVirtReg()+1; i != e; ++i)
Chris Lattner1877ec92006-03-13 21:52:10 +0000230 if (RegMap->getRegClass(i) == &PPC::VRRCRegClass) {
231 HasVectorVReg = true;
232 break;
233 }
Chris Lattner4bb18952006-03-16 18:25:23 +0000234 if (!HasVectorVReg) return; // nothing to do.
235
Chris Lattner1877ec92006-03-13 21:52:10 +0000236 // If we have a vector register, we want to emit code into the entry and exit
237 // blocks to save and restore the VRSAVE register. We do this here (instead
238 // of marking all vector instructions as clobbering VRSAVE) for two reasons:
239 //
240 // 1. This (trivially) reduces the load on the register allocator, by not
241 // having to represent the live range of the VRSAVE register.
242 // 2. This (more significantly) allows us to create a temporary virtual
243 // register to hold the saved VRSAVE value, allowing this temporary to be
244 // register allocated, instead of forcing it to be spilled to the stack.
Chris Lattner4bb18952006-03-16 18:25:23 +0000245
246 // Create two vregs - one to hold the VRSAVE register that is live-in to the
247 // function and one for the value after having bits or'd into it.
248 unsigned InVRSAVE = RegMap->createVirtualRegister(&PPC::GPRCRegClass);
249 unsigned UpdatedVRSAVE = RegMap->createVirtualRegister(&PPC::GPRCRegClass);
250
251 MachineBasicBlock &EntryBB = *Fn.begin();
252 // Emit the following code into the entry block:
253 // InVRSAVE = MFVRSAVE
254 // UpdatedVRSAVE = UPDATE_VRSAVE InVRSAVE
255 // MTVRSAVE UpdatedVRSAVE
256 MachineBasicBlock::iterator IP = EntryBB.begin(); // Insert Point
257 BuildMI(EntryBB, IP, PPC::MFVRSAVE, 0, InVRSAVE);
258 BuildMI(EntryBB, IP, PPC::UPDATE_VRSAVE, 1, UpdatedVRSAVE).addReg(InVRSAVE);
259 BuildMI(EntryBB, IP, PPC::MTVRSAVE, 1).addReg(UpdatedVRSAVE);
260
261 // Find all return blocks, outputting a restore in each epilog.
262 const TargetInstrInfo &TII = *TM.getInstrInfo();
263 for (MachineFunction::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) {
264 if (!BB->empty() && TII.isReturn(BB->back().getOpcode())) {
265 IP = BB->end(); --IP;
266
267 // Skip over all terminator instructions, which are part of the return
268 // sequence.
269 MachineBasicBlock::iterator I2 = IP;
270 while (I2 != BB->begin() && TII.isTerminatorInstr((--I2)->getOpcode()))
271 IP = I2;
272
273 // Emit: MTVRSAVE InVRSave
274 BuildMI(*BB, IP, PPC::MTVRSAVE, 1).addReg(InVRSAVE);
275 }
Chris Lattner1877ec92006-03-13 21:52:10 +0000276 }
Chris Lattnerbd937b92005-10-06 18:45:51 +0000277}
Chris Lattner6cd40d52005-09-03 01:17:22 +0000278
Chris Lattner4bb18952006-03-16 18:25:23 +0000279
Chris Lattner4416f1a2005-08-19 22:38:53 +0000280/// getGlobalBaseReg - Output the instructions required to put the
281/// base address to use for accessing globals into a register.
282///
Nate Begeman1d9d7422005-10-18 00:28:58 +0000283SDOperand PPCDAGToDAGISel::getGlobalBaseReg() {
Chris Lattner4416f1a2005-08-19 22:38:53 +0000284 if (!GlobalBaseReg) {
285 // Insert the set of GlobalBaseReg into the first MBB of the function
286 MachineBasicBlock &FirstMBB = BB->getParent()->front();
287 MachineBasicBlock::iterator MBBI = FirstMBB.begin();
288 SSARegMap *RegMap = BB->getParent()->getSSARegMap();
Nate Begeman1d9d7422005-10-18 00:28:58 +0000289 // FIXME: when we get to LP64, we will need to create the appropriate
290 // type of register here.
291 GlobalBaseReg = RegMap->createVirtualRegister(PPC::GPRCRegisterClass);
Chris Lattner4416f1a2005-08-19 22:38:53 +0000292 BuildMI(FirstMBB, MBBI, PPC::MovePCtoLR, 0, PPC::LR);
293 BuildMI(FirstMBB, MBBI, PPC::MFLR, 1, GlobalBaseReg);
294 }
Chris Lattner9944b762005-08-21 22:31:09 +0000295 return CurDAG->getRegister(GlobalBaseReg, MVT::i32);
Chris Lattner4416f1a2005-08-19 22:38:53 +0000296}
297
298
Nate Begeman0f3257a2005-08-18 05:00:13 +0000299// isIntImmediate - This method tests to see if a constant operand.
300// If so Imm will receive the 32 bit value.
301static bool isIntImmediate(SDNode *N, unsigned& Imm) {
302 if (N->getOpcode() == ISD::Constant) {
303 Imm = cast<ConstantSDNode>(N)->getValue();
304 return true;
305 }
306 return false;
307}
308
Nate Begemancffc32b2005-08-18 07:30:46 +0000309// isRunOfOnes - Returns true iff Val consists of one contiguous run of 1s with
310// any number of 0s on either side. The 1s are allowed to wrap from LSB to
311// MSB, so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is
312// not, since all 1s are not contiguous.
313static bool isRunOfOnes(unsigned Val, unsigned &MB, unsigned &ME) {
314 if (isShiftedMask_32(Val)) {
315 // look for the first non-zero bit
316 MB = CountLeadingZeros_32(Val);
317 // look for the first zero bit after the run of ones
318 ME = CountLeadingZeros_32((Val - 1) ^ Val);
319 return true;
Chris Lattner2fe76e52005-08-25 04:47:18 +0000320 } else {
321 Val = ~Val; // invert mask
322 if (isShiftedMask_32(Val)) {
323 // effectively look for the first zero bit
324 ME = CountLeadingZeros_32(Val) - 1;
325 // effectively look for the first one bit after the run of zeros
326 MB = CountLeadingZeros_32((Val - 1) ^ Val) + 1;
327 return true;
328 }
Nate Begemancffc32b2005-08-18 07:30:46 +0000329 }
330 // no run present
331 return false;
332}
333
Chris Lattner65a419a2005-10-09 05:36:17 +0000334// isRotateAndMask - Returns true if Mask and Shift can be folded into a rotate
Nate Begemancffc32b2005-08-18 07:30:46 +0000335// and mask opcode and mask operation.
336static bool isRotateAndMask(SDNode *N, unsigned Mask, bool IsShiftMask,
337 unsigned &SH, unsigned &MB, unsigned &ME) {
Nate Begemanda32c9e2005-10-19 00:05:37 +0000338 // Don't even go down this path for i64, since different logic will be
339 // necessary for rldicl/rldicr/rldimi.
340 if (N->getValueType(0) != MVT::i32)
341 return false;
342
Nate Begemancffc32b2005-08-18 07:30:46 +0000343 unsigned Shift = 32;
344 unsigned Indeterminant = ~0; // bit mask marking indeterminant results
345 unsigned Opcode = N->getOpcode();
Chris Lattner15055732005-08-30 00:59:16 +0000346 if (N->getNumOperands() != 2 ||
347 !isIntImmediate(N->getOperand(1).Val, Shift) || (Shift > 31))
Nate Begemancffc32b2005-08-18 07:30:46 +0000348 return false;
349
350 if (Opcode == ISD::SHL) {
351 // apply shift left to mask if it comes first
352 if (IsShiftMask) Mask = Mask << Shift;
353 // determine which bits are made indeterminant by shift
354 Indeterminant = ~(0xFFFFFFFFu << Shift);
Chris Lattner651dea72005-10-15 21:40:12 +0000355 } else if (Opcode == ISD::SRL) {
Nate Begemancffc32b2005-08-18 07:30:46 +0000356 // apply shift right to mask if it comes first
357 if (IsShiftMask) Mask = Mask >> Shift;
358 // determine which bits are made indeterminant by shift
359 Indeterminant = ~(0xFFFFFFFFu >> Shift);
360 // adjust for the left rotate
361 Shift = 32 - Shift;
362 } else {
363 return false;
364 }
365
366 // if the mask doesn't intersect any Indeterminant bits
367 if (Mask && !(Mask & Indeterminant)) {
368 SH = Shift;
369 // make sure the mask is still a mask (wrap arounds may not be)
370 return isRunOfOnes(Mask, MB, ME);
371 }
372 return false;
373}
374
Nate Begeman0f3257a2005-08-18 05:00:13 +0000375// isOpcWithIntImmediate - This method tests to see if the node is a specific
376// opcode and that it has a immediate integer right operand.
377// If so Imm will receive the 32 bit value.
378static bool isOpcWithIntImmediate(SDNode *N, unsigned Opc, unsigned& Imm) {
379 return N->getOpcode() == Opc && isIntImmediate(N->getOperand(1).Val, Imm);
380}
381
Chris Lattnera5a91b12005-08-17 19:33:03 +0000382// isIntImmediate - This method tests to see if a constant operand.
383// If so Imm will receive the 32 bit value.
384static bool isIntImmediate(SDOperand N, unsigned& Imm) {
385 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N)) {
386 Imm = (unsigned)CN->getSignExtended();
387 return true;
388 }
389 return false;
390}
391
Nate Begeman02b88a42005-08-19 00:38:14 +0000392/// SelectBitfieldInsert - turn an or of two masked values into
393/// the rotate left word immediate then mask insert (rlwimi) instruction.
Nate Begeman1d9d7422005-10-18 00:28:58 +0000394SDNode *PPCDAGToDAGISel::SelectBitfieldInsert(SDNode *N) {
Nate Begeman02b88a42005-08-19 00:38:14 +0000395 unsigned TgtMask = 0xFFFFFFFF, InsMask = 0xFFFFFFFF, SH = 0;
396 unsigned Value;
397
398 SDOperand Op0 = N->getOperand(0);
399 SDOperand Op1 = N->getOperand(1);
400
401 unsigned Op0Opc = Op0.getOpcode();
402 unsigned Op1Opc = Op1.getOpcode();
403
Nate Begeman77f361f2006-05-07 00:23:38 +0000404 uint64_t LKZ, LKO, RKZ, RKO;
405 TLI.ComputeMaskedBits(Op0, TgtMask, LKZ, LKO);
406 TLI.ComputeMaskedBits(Op1, TgtMask, RKZ, RKO);
Nate Begeman02b88a42005-08-19 00:38:14 +0000407
Nate Begeman77f361f2006-05-07 00:23:38 +0000408 // FIXME: rotrwi / rotlwi
409 if ((LKZ | RKZ) == 0x00000000FFFFFFFFULL) {
410 unsigned PInsMask = ~RKZ;
411 unsigned PTgtMask = ~LKZ;
412
413 // If the LHS has a foldable shift, then swap it to the RHS so that we can
414 // fold the shift into the insert.
415 if (Op0Opc == ISD::AND && Op1Opc == ISD::AND) {
416 if (Op0.getOperand(0).getOpcode() == ISD::SHL ||
417 Op0.getOperand(0).getOpcode() == ISD::SRL) {
418 if (Op1.getOperand(0).getOpcode() != ISD::SHL &&
419 Op1.getOperand(0).getOpcode() != ISD::SRL) {
420 std::swap(Op0, Op1);
421 std::swap(Op0Opc, Op1Opc);
422 std::swap(PInsMask, PTgtMask);
423 }
Nate Begeman02b88a42005-08-19 00:38:14 +0000424 }
425 }
Nate Begeman77f361f2006-05-07 00:23:38 +0000426
427 unsigned MB, ME;
428 if (isRunOfOnes(PInsMask, MB, ME)) {
429 SDOperand Tmp1, Tmp2, Tmp3;
430 bool DisjointMask = (PTgtMask ^ PInsMask) == 0xFFFFFFFF;
431
432 if ((Op1Opc == ISD::SHL || Op1Opc == ISD::SRL) &&
433 isIntImmediate(Op1.getOperand(1), Value)) {
434 Op1 = Op1.getOperand(0);
435 SH = (Op1Opc == ISD::SHL) ? Value : 32 - Value;
436 }
437 if (Op1Opc == ISD::AND) {
438 unsigned SHOpc = Op1.getOperand(0).getOpcode();
439 if ((SHOpc == ISD::SHL || SHOpc == ISD::SRL) &&
440 isIntImmediate(Op1.getOperand(0).getOperand(1), Value)) {
441 Op1 = Op1.getOperand(0).getOperand(0);
442 SH = (SHOpc == ISD::SHL) ? Value : 32 - Value;
443 } else {
444 Op1 = Op1.getOperand(0);
445 }
446 }
447
448 Tmp3 = (Op0Opc == ISD::AND && DisjointMask) ? Op0.getOperand(0) : Op0;
449 Select(Tmp1, Tmp3);
450 Select(Tmp2, Op1);
451 return CurDAG->getTargetNode(PPC::RLWIMI, MVT::i32, Tmp1, Tmp2,
452 getI32Imm(SH), getI32Imm(MB), getI32Imm(ME));
Nate Begeman02b88a42005-08-19 00:38:14 +0000453 }
Nate Begeman02b88a42005-08-19 00:38:14 +0000454 }
455 return 0;
456}
457
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000458/// SelectAddrImm - Returns true if the address N can be represented by
459/// a base register plus a signed 16-bit displacement [r+imm].
460bool PPCDAGToDAGISel::SelectAddrImm(SDOperand N, SDOperand &Disp,
461 SDOperand &Base) {
Chris Lattner0f6ab6f2006-03-01 07:14:48 +0000462 // If this can be more profitably realized as r+r, fail.
463 if (SelectAddrIdx(N, Disp, Base))
464 return false;
465
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000466 if (N.getOpcode() == ISD::ADD) {
467 unsigned imm = 0;
468 if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm)) {
Chris Lattner17e82d22006-01-12 01:54:15 +0000469 Disp = getI32Imm(imm & 0xFFFF);
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000470 if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(N.getOperand(0))) {
471 Base = CurDAG->getTargetFrameIndex(FI->getIndex(), MVT::i32);
Chris Lattner9944b762005-08-21 22:31:09 +0000472 } else {
Evan Cheng7564e0b2006-02-05 08:45:01 +0000473 Base = N.getOperand(0);
Chris Lattner9944b762005-08-21 22:31:09 +0000474 }
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000475 return true; // [r+i]
476 } else if (N.getOperand(1).getOpcode() == PPCISD::Lo) {
Chris Lattner4f0f86d2005-11-17 18:02:16 +0000477 // Match LOAD (ADD (X, Lo(G))).
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000478 assert(!cast<ConstantSDNode>(N.getOperand(1).getOperand(1))->getValue()
Chris Lattner4f0f86d2005-11-17 18:02:16 +0000479 && "Cannot handle constant offsets yet!");
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000480 Disp = N.getOperand(1).getOperand(0); // The global address.
481 assert(Disp.getOpcode() == ISD::TargetGlobalAddress ||
Nate Begeman37efe672006-04-22 18:53:45 +0000482 Disp.getOpcode() == ISD::TargetConstantPool ||
483 Disp.getOpcode() == ISD::TargetJumpTable);
Evan Cheng7564e0b2006-02-05 08:45:01 +0000484 Base = N.getOperand(0);
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000485 return true; // [&g+r]
Chris Lattner9944b762005-08-21 22:31:09 +0000486 }
Chris Lattner0f6ab6f2006-03-01 07:14:48 +0000487 } else if (N.getOpcode() == ISD::OR) {
488 unsigned imm = 0;
489 if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm)) {
490 // If this is an or of disjoint bitfields, we can codegen this as an add
491 // (for better address arithmetic) if the LHS and RHS of the OR are
492 // provably disjoint.
493 uint64_t LHSKnownZero, LHSKnownOne;
494 PPCLowering.ComputeMaskedBits(N.getOperand(0), ~0U,
495 LHSKnownZero, LHSKnownOne);
496 if ((LHSKnownZero|~imm) == ~0U) {
497 // If all of the bits are known zero on the LHS or RHS, the add won't
498 // carry.
499 Base = N.getOperand(0);
500 Disp = getI32Imm(imm & 0xFFFF);
501 return true;
502 }
503 }
Chris Lattnerd9796442006-03-20 22:38:22 +0000504 } else if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N)) {
505 // Loading from a constant address.
506 int Addr = (int)CN->getValue();
507
508 // If this address fits entirely in a 16-bit sext immediate field, codegen
509 // this as "d, 0"
510 if (Addr == (short)Addr) {
511 Disp = getI32Imm(Addr);
512 Base = CurDAG->getRegister(PPC::R0, MVT::i32);
513 return true;
514 }
515
516 // Otherwise, break this down into an LIS + disp.
517 Disp = getI32Imm((short)Addr);
518 Base = CurDAG->getConstant(Addr - (signed short)Addr, MVT::i32);
519 return true;
Chris Lattner9944b762005-08-21 22:31:09 +0000520 }
Chris Lattnerd9796442006-03-20 22:38:22 +0000521
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000522 Disp = getI32Imm(0);
523 if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(N))
524 Base = CurDAG->getTargetFrameIndex(FI->getIndex(), MVT::i32);
Nate Begeman28a6b022005-12-10 02:36:00 +0000525 else
Evan Cheng7564e0b2006-02-05 08:45:01 +0000526 Base = N;
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000527 return true; // [r+0]
Chris Lattner9944b762005-08-21 22:31:09 +0000528}
Chris Lattnera5a91b12005-08-17 19:33:03 +0000529
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000530/// SelectAddrIdx - Given the specified addressed, check to see if it can be
531/// represented as an indexed [r+r] operation. Returns false if it can
532/// be represented by [r+imm], which are preferred.
533bool PPCDAGToDAGISel::SelectAddrIdx(SDOperand N, SDOperand &Base,
534 SDOperand &Index) {
Chris Lattner0f6ab6f2006-03-01 07:14:48 +0000535 unsigned imm = 0;
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000536 if (N.getOpcode() == ISD::ADD) {
Chris Lattner0f6ab6f2006-03-01 07:14:48 +0000537 if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm))
538 return false; // r+i
539 if (N.getOperand(1).getOpcode() == PPCISD::Lo)
540 return false; // r+i
541
Evan Cheng7564e0b2006-02-05 08:45:01 +0000542 Base = N.getOperand(0);
543 Index = N.getOperand(1);
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000544 return true;
Chris Lattner0f6ab6f2006-03-01 07:14:48 +0000545 } else if (N.getOpcode() == ISD::OR) {
546 if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm))
547 return false; // r+i can fold it if we can.
548
549 // If this is an or of disjoint bitfields, we can codegen this as an add
550 // (for better address arithmetic) if the LHS and RHS of the OR are provably
551 // disjoint.
552 uint64_t LHSKnownZero, LHSKnownOne;
553 uint64_t RHSKnownZero, RHSKnownOne;
554 PPCLowering.ComputeMaskedBits(N.getOperand(0), ~0U,
555 LHSKnownZero, LHSKnownOne);
556
557 if (LHSKnownZero) {
558 PPCLowering.ComputeMaskedBits(N.getOperand(1), ~0U,
559 RHSKnownZero, RHSKnownOne);
560 // If all of the bits are known zero on the LHS or RHS, the add won't
561 // carry.
562 if ((LHSKnownZero | RHSKnownZero) == ~0U) {
563 Base = N.getOperand(0);
564 Index = N.getOperand(1);
565 return true;
566 }
567 }
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000568 }
Chris Lattner0f6ab6f2006-03-01 07:14:48 +0000569
570 return false;
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000571}
572
573/// SelectAddrIdxOnly - Given the specified addressed, force it to be
574/// represented as an indexed [r+r] operation.
575bool PPCDAGToDAGISel::SelectAddrIdxOnly(SDOperand N, SDOperand &Base,
576 SDOperand &Index) {
Chris Lattner0f6ab6f2006-03-01 07:14:48 +0000577 // Check to see if we can easily represent this as an [r+r] address. This
578 // will fail if it thinks that the address is more profitably represented as
579 // reg+imm, e.g. where imm = 0.
Chris Lattner54e869e2006-03-24 17:58:06 +0000580 if (SelectAddrIdx(N, Base, Index))
581 return true;
582
583 // If the operand is an addition, always emit this as [r+r], since this is
584 // better (for code size, and execution, as the memop does the add for free)
585 // than emitting an explicit add.
586 if (N.getOpcode() == ISD::ADD) {
587 Base = N.getOperand(0);
588 Index = N.getOperand(1);
589 return true;
Nate Begemanf43a3ca2005-11-30 08:22:07 +0000590 }
Chris Lattner54e869e2006-03-24 17:58:06 +0000591
592 // Otherwise, do it the hard way, using R0 as the base register.
593 Base = CurDAG->getRegister(PPC::R0, MVT::i32);
594 Index = N;
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000595 return true;
Nate Begemanf43a3ca2005-11-30 08:22:07 +0000596}
597
Chris Lattnere5ba5802006-03-22 05:26:03 +0000598/// SelectAddrImmShift - Returns true if the address N can be represented by
599/// a base register plus a signed 14-bit displacement [r+imm*4]. Suitable
600/// for use by STD and friends.
601bool PPCDAGToDAGISel::SelectAddrImmShift(SDOperand N, SDOperand &Disp,
602 SDOperand &Base) {
603 // If this can be more profitably realized as r+r, fail.
604 if (SelectAddrIdx(N, Disp, Base))
605 return false;
606
607 if (N.getOpcode() == ISD::ADD) {
608 unsigned imm = 0;
609 if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm) &&
610 (imm & 3) == 0) {
611 Disp = getI32Imm((imm & 0xFFFF) >> 2);
612 if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(N.getOperand(0))) {
613 Base = CurDAG->getTargetFrameIndex(FI->getIndex(), MVT::i32);
614 } else {
615 Base = N.getOperand(0);
616 }
617 return true; // [r+i]
618 } else if (N.getOperand(1).getOpcode() == PPCISD::Lo) {
619 // Match LOAD (ADD (X, Lo(G))).
620 assert(!cast<ConstantSDNode>(N.getOperand(1).getOperand(1))->getValue()
621 && "Cannot handle constant offsets yet!");
622 Disp = N.getOperand(1).getOperand(0); // The global address.
623 assert(Disp.getOpcode() == ISD::TargetGlobalAddress ||
Nate Begeman37efe672006-04-22 18:53:45 +0000624 Disp.getOpcode() == ISD::TargetConstantPool ||
625 Disp.getOpcode() == ISD::TargetJumpTable);
Chris Lattnere5ba5802006-03-22 05:26:03 +0000626 Base = N.getOperand(0);
627 return true; // [&g+r]
628 }
629 } else if (N.getOpcode() == ISD::OR) {
630 unsigned imm = 0;
631 if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm) &&
632 (imm & 3) == 0) {
633 // If this is an or of disjoint bitfields, we can codegen this as an add
634 // (for better address arithmetic) if the LHS and RHS of the OR are
635 // provably disjoint.
636 uint64_t LHSKnownZero, LHSKnownOne;
637 PPCLowering.ComputeMaskedBits(N.getOperand(0), ~0U,
638 LHSKnownZero, LHSKnownOne);
639 if ((LHSKnownZero|~imm) == ~0U) {
640 // If all of the bits are known zero on the LHS or RHS, the add won't
641 // carry.
642 Base = N.getOperand(0);
643 Disp = getI32Imm((imm & 0xFFFF) >> 2);
644 return true;
645 }
646 }
647 } else if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N)) {
648 // Loading from a constant address.
649 int Addr = (int)CN->getValue();
650 if ((Addr & 3) == 0) {
651 // If this address fits entirely in a 16-bit sext immediate field, codegen
652 // this as "d, 0"
653 if (Addr == (short)Addr) {
654 Disp = getI32Imm(Addr >> 2);
655 Base = CurDAG->getRegister(PPC::R0, MVT::i32);
656 return true;
657 }
658
659 // Otherwise, break this down into an LIS + disp.
660 Disp = getI32Imm((short)Addr >> 2);
661 Base = CurDAG->getConstant(Addr - (signed short)Addr, MVT::i32);
662 return true;
663 }
664 }
665
666 Disp = getI32Imm(0);
667 if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(N))
668 Base = CurDAG->getTargetFrameIndex(FI->getIndex(), MVT::i32);
669 else
670 Base = N;
671 return true; // [r+0]
672}
673
674
Chris Lattner2fbb4572005-08-21 18:50:37 +0000675/// SelectCC - Select a comparison of the specified values with the specified
676/// condition code, returning the CR# of the expression.
Nate Begeman1d9d7422005-10-18 00:28:58 +0000677SDOperand PPCDAGToDAGISel::SelectCC(SDOperand LHS, SDOperand RHS,
678 ISD::CondCode CC) {
Chris Lattner2fbb4572005-08-21 18:50:37 +0000679 // Always select the LHS.
Evan Cheng34167212006-02-09 00:37:58 +0000680 Select(LHS, LHS);
Chris Lattner2fbb4572005-08-21 18:50:37 +0000681
682 // Use U to determine whether the SETCC immediate range is signed or not.
683 if (MVT::isInteger(LHS.getValueType())) {
684 bool U = ISD::isUnsignedIntSetCC(CC);
685 unsigned Imm;
686 if (isIntImmediate(RHS, Imm) &&
687 ((U && isUInt16(Imm)) || (!U && isInt16(Imm))))
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000688 return SDOperand(CurDAG->getTargetNode(U ? PPC::CMPLWI : PPC::CMPWI,
689 MVT::i32, LHS, getI32Imm(Imm & 0xFFFF)), 0);
Evan Cheng34167212006-02-09 00:37:58 +0000690 Select(RHS, RHS);
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000691 return SDOperand(CurDAG->getTargetNode(U ? PPC::CMPLW : PPC::CMPW, MVT::i32,
692 LHS, RHS), 0);
Chris Lattner919c0322005-10-01 01:35:02 +0000693 } else if (LHS.getValueType() == MVT::f32) {
Evan Cheng34167212006-02-09 00:37:58 +0000694 Select(RHS, RHS);
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000695 return SDOperand(CurDAG->getTargetNode(PPC::FCMPUS, MVT::i32, LHS, RHS), 0);
Chris Lattner2fbb4572005-08-21 18:50:37 +0000696 } else {
Evan Cheng34167212006-02-09 00:37:58 +0000697 Select(RHS, RHS);
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000698 return SDOperand(CurDAG->getTargetNode(PPC::FCMPUD, MVT::i32, LHS, RHS), 0);
Chris Lattner2fbb4572005-08-21 18:50:37 +0000699 }
700}
701
702/// getBCCForSetCC - Returns the PowerPC condition branch mnemonic corresponding
703/// to Condition.
704static unsigned getBCCForSetCC(ISD::CondCode CC) {
705 switch (CC) {
706 default: assert(0 && "Unknown condition!"); abort();
Chris Lattnered048c02005-10-28 20:49:47 +0000707 case ISD::SETOEQ: // FIXME: This is incorrect see PR642.
Chris Lattner2fbb4572005-08-21 18:50:37 +0000708 case ISD::SETEQ: return PPC::BEQ;
Chris Lattnered048c02005-10-28 20:49:47 +0000709 case ISD::SETONE: // FIXME: This is incorrect see PR642.
Chris Lattner2fbb4572005-08-21 18:50:37 +0000710 case ISD::SETNE: return PPC::BNE;
Chris Lattnered048c02005-10-28 20:49:47 +0000711 case ISD::SETOLT: // FIXME: This is incorrect see PR642.
Chris Lattner2fbb4572005-08-21 18:50:37 +0000712 case ISD::SETULT:
713 case ISD::SETLT: return PPC::BLT;
Chris Lattnered048c02005-10-28 20:49:47 +0000714 case ISD::SETOLE: // FIXME: This is incorrect see PR642.
Chris Lattner2fbb4572005-08-21 18:50:37 +0000715 case ISD::SETULE:
716 case ISD::SETLE: return PPC::BLE;
Chris Lattnered048c02005-10-28 20:49:47 +0000717 case ISD::SETOGT: // FIXME: This is incorrect see PR642.
Chris Lattner2fbb4572005-08-21 18:50:37 +0000718 case ISD::SETUGT:
719 case ISD::SETGT: return PPC::BGT;
Chris Lattnered048c02005-10-28 20:49:47 +0000720 case ISD::SETOGE: // FIXME: This is incorrect see PR642.
Chris Lattner2fbb4572005-08-21 18:50:37 +0000721 case ISD::SETUGE:
722 case ISD::SETGE: return PPC::BGE;
Chris Lattner6df25072005-10-28 20:32:44 +0000723
724 case ISD::SETO: return PPC::BUN;
725 case ISD::SETUO: return PPC::BNU;
Chris Lattner2fbb4572005-08-21 18:50:37 +0000726 }
727 return 0;
728}
729
Chris Lattner64906a02005-08-25 20:08:18 +0000730/// getCRIdxForSetCC - Return the index of the condition register field
731/// associated with the SetCC condition, and whether or not the field is
732/// treated as inverted. That is, lt = 0; ge = 0 inverted.
733static unsigned getCRIdxForSetCC(ISD::CondCode CC, bool& Inv) {
734 switch (CC) {
735 default: assert(0 && "Unknown condition!"); abort();
Chris Lattnered048c02005-10-28 20:49:47 +0000736 case ISD::SETOLT: // FIXME: This is incorrect see PR642.
Chris Lattner64906a02005-08-25 20:08:18 +0000737 case ISD::SETULT:
738 case ISD::SETLT: Inv = false; return 0;
Chris Lattnered048c02005-10-28 20:49:47 +0000739 case ISD::SETOGE: // FIXME: This is incorrect see PR642.
Chris Lattner64906a02005-08-25 20:08:18 +0000740 case ISD::SETUGE:
741 case ISD::SETGE: Inv = true; return 0;
Chris Lattnered048c02005-10-28 20:49:47 +0000742 case ISD::SETOGT: // FIXME: This is incorrect see PR642.
Chris Lattner64906a02005-08-25 20:08:18 +0000743 case ISD::SETUGT:
744 case ISD::SETGT: Inv = false; return 1;
Chris Lattnered048c02005-10-28 20:49:47 +0000745 case ISD::SETOLE: // FIXME: This is incorrect see PR642.
Chris Lattner64906a02005-08-25 20:08:18 +0000746 case ISD::SETULE:
747 case ISD::SETLE: Inv = true; return 1;
Chris Lattnered048c02005-10-28 20:49:47 +0000748 case ISD::SETOEQ: // FIXME: This is incorrect see PR642.
Chris Lattner64906a02005-08-25 20:08:18 +0000749 case ISD::SETEQ: Inv = false; return 2;
Chris Lattnered048c02005-10-28 20:49:47 +0000750 case ISD::SETONE: // FIXME: This is incorrect see PR642.
Chris Lattner64906a02005-08-25 20:08:18 +0000751 case ISD::SETNE: Inv = true; return 2;
Chris Lattner6df25072005-10-28 20:32:44 +0000752 case ISD::SETO: Inv = true; return 3;
753 case ISD::SETUO: Inv = false; return 3;
Chris Lattner64906a02005-08-25 20:08:18 +0000754 }
755 return 0;
756}
Chris Lattner9944b762005-08-21 22:31:09 +0000757
Nate Begeman1d9d7422005-10-18 00:28:58 +0000758SDOperand PPCDAGToDAGISel::SelectSETCC(SDOperand Op) {
Chris Lattner222adac2005-10-06 19:03:35 +0000759 SDNode *N = Op.Val;
760 unsigned Imm;
761 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(2))->get();
762 if (isIntImmediate(N->getOperand(1), Imm)) {
763 // We can codegen setcc op, imm very efficiently compared to a brcond.
764 // Check for those cases here.
765 // setcc op, 0
766 if (Imm == 0) {
Evan Cheng34167212006-02-09 00:37:58 +0000767 SDOperand Op;
768 Select(Op, N->getOperand(0));
Chris Lattner222adac2005-10-06 19:03:35 +0000769 switch (CC) {
Chris Lattnerdabb8292005-10-21 21:17:10 +0000770 default: break;
771 case ISD::SETEQ:
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000772 Op = SDOperand(CurDAG->getTargetNode(PPC::CNTLZW, MVT::i32, Op), 0);
Chris Lattner71d3d502005-11-30 22:53:06 +0000773 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Op, getI32Imm(27),
774 getI32Imm(5), getI32Imm(31));
Chris Lattnerdabb8292005-10-21 21:17:10 +0000775 case ISD::SETNE: {
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000776 SDOperand AD =
777 SDOperand(CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
778 Op, getI32Imm(~0U)), 0);
Chris Lattner71d3d502005-11-30 22:53:06 +0000779 return CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, AD, Op,
780 AD.getValue(1));
Chris Lattner222adac2005-10-06 19:03:35 +0000781 }
Chris Lattnerdabb8292005-10-21 21:17:10 +0000782 case ISD::SETLT:
Chris Lattner71d3d502005-11-30 22:53:06 +0000783 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Op, getI32Imm(1),
784 getI32Imm(31), getI32Imm(31));
Chris Lattnerdabb8292005-10-21 21:17:10 +0000785 case ISD::SETGT: {
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000786 SDOperand T =
787 SDOperand(CurDAG->getTargetNode(PPC::NEG, MVT::i32, Op), 0);
788 T = SDOperand(CurDAG->getTargetNode(PPC::ANDC, MVT::i32, T, Op), 0);
Chris Lattner71d3d502005-11-30 22:53:06 +0000789 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, T, getI32Imm(1),
790 getI32Imm(31), getI32Imm(31));
Chris Lattnerdabb8292005-10-21 21:17:10 +0000791 }
792 }
Chris Lattner222adac2005-10-06 19:03:35 +0000793 } else if (Imm == ~0U) { // setcc op, -1
Evan Cheng34167212006-02-09 00:37:58 +0000794 SDOperand Op;
795 Select(Op, N->getOperand(0));
Chris Lattner222adac2005-10-06 19:03:35 +0000796 switch (CC) {
Chris Lattnerdabb8292005-10-21 21:17:10 +0000797 default: break;
798 case ISD::SETEQ:
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000799 Op = SDOperand(CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
800 Op, getI32Imm(1)), 0);
Chris Lattner71d3d502005-11-30 22:53:06 +0000801 return CurDAG->SelectNodeTo(N, PPC::ADDZE, MVT::i32,
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000802 SDOperand(CurDAG->getTargetNode(PPC::LI, MVT::i32,
803 getI32Imm(0)), 0),
Chris Lattner71d3d502005-11-30 22:53:06 +0000804 Op.getValue(1));
Chris Lattnerdabb8292005-10-21 21:17:10 +0000805 case ISD::SETNE: {
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000806 Op = SDOperand(CurDAG->getTargetNode(PPC::NOR, MVT::i32, Op, Op), 0);
807 SDNode *AD = CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
808 Op, getI32Imm(~0U));
809 return CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, SDOperand(AD, 0), Op,
810 SDOperand(AD, 1));
Chris Lattner222adac2005-10-06 19:03:35 +0000811 }
Chris Lattnerdabb8292005-10-21 21:17:10 +0000812 case ISD::SETLT: {
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000813 SDOperand AD = SDOperand(CurDAG->getTargetNode(PPC::ADDI, MVT::i32, Op,
814 getI32Imm(1)), 0);
815 SDOperand AN = SDOperand(CurDAG->getTargetNode(PPC::AND, MVT::i32, AD,
816 Op), 0);
Chris Lattner71d3d502005-11-30 22:53:06 +0000817 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, AN, getI32Imm(1),
818 getI32Imm(31), getI32Imm(31));
Chris Lattnerdabb8292005-10-21 21:17:10 +0000819 }
820 case ISD::SETGT:
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000821 Op = SDOperand(CurDAG->getTargetNode(PPC::RLWINM, MVT::i32, Op,
822 getI32Imm(1), getI32Imm(31),
823 getI32Imm(31)), 0);
Chris Lattner71d3d502005-11-30 22:53:06 +0000824 return CurDAG->SelectNodeTo(N, PPC::XORI, MVT::i32, Op, getI32Imm(1));
Chris Lattnerdabb8292005-10-21 21:17:10 +0000825 }
Chris Lattner222adac2005-10-06 19:03:35 +0000826 }
827 }
828
829 bool Inv;
830 unsigned Idx = getCRIdxForSetCC(CC, Inv);
831 SDOperand CCReg = SelectCC(N->getOperand(0), N->getOperand(1), CC);
832 SDOperand IntCR;
833
834 // Force the ccreg into CR7.
835 SDOperand CR7Reg = CurDAG->getRegister(PPC::CR7, MVT::i32);
836
Chris Lattner85961d52005-12-06 20:56:18 +0000837 SDOperand InFlag(0, 0); // Null incoming flag value.
Chris Lattnerdb1cb2b2005-12-01 03:50:19 +0000838 CCReg = CurDAG->getCopyToReg(CurDAG->getEntryNode(), CR7Reg, CCReg,
839 InFlag).getValue(1);
Chris Lattner222adac2005-10-06 19:03:35 +0000840
841 if (TLI.getTargetMachine().getSubtarget<PPCSubtarget>().isGigaProcessor())
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000842 IntCR = SDOperand(CurDAG->getTargetNode(PPC::MFOCRF, MVT::i32, CR7Reg,
843 CCReg), 0);
Chris Lattner222adac2005-10-06 19:03:35 +0000844 else
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000845 IntCR = SDOperand(CurDAG->getTargetNode(PPC::MFCR, MVT::i32, CCReg), 0);
Chris Lattner222adac2005-10-06 19:03:35 +0000846
847 if (!Inv) {
Chris Lattner71d3d502005-11-30 22:53:06 +0000848 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, IntCR,
849 getI32Imm((32-(3-Idx)) & 31),
850 getI32Imm(31), getI32Imm(31));
Chris Lattner222adac2005-10-06 19:03:35 +0000851 } else {
852 SDOperand Tmp =
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000853 SDOperand(CurDAG->getTargetNode(PPC::RLWINM, MVT::i32, IntCR,
854 getI32Imm((32-(3-Idx)) & 31),
855 getI32Imm(31),getI32Imm(31)), 0);
Chris Lattner71d3d502005-11-30 22:53:06 +0000856 return CurDAG->SelectNodeTo(N, PPC::XORI, MVT::i32, Tmp, getI32Imm(1));
Chris Lattner222adac2005-10-06 19:03:35 +0000857 }
Chris Lattner222adac2005-10-06 19:03:35 +0000858}
Chris Lattner2b63e4c2005-10-06 18:56:10 +0000859
Nate Begeman422b0ce2005-11-16 00:48:01 +0000860/// isCallCompatibleAddress - Return true if the specified 32-bit value is
861/// representable in the immediate field of a Bx instruction.
862static bool isCallCompatibleAddress(ConstantSDNode *C) {
863 int Addr = C->getValue();
864 if (Addr & 3) return false; // Low 2 bits are implicitly zero.
865 return (Addr << 6 >> 6) == Addr; // Top 6 bits have to be sext of immediate.
866}
867
Nate Begeman1d9d7422005-10-18 00:28:58 +0000868SDOperand PPCDAGToDAGISel::SelectCALL(SDOperand Op) {
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000869 SDNode *N = Op.Val;
Evan Cheng34167212006-02-09 00:37:58 +0000870 SDOperand Chain;
871 Select(Chain, N->getOperand(0));
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000872
873 unsigned CallOpcode;
874 std::vector<SDOperand> CallOperands;
875
876 if (GlobalAddressSDNode *GASD =
877 dyn_cast<GlobalAddressSDNode>(N->getOperand(1))) {
Nate Begeman422b0ce2005-11-16 00:48:01 +0000878 CallOpcode = PPC::BL;
Chris Lattner2823b3e2005-11-17 05:56:14 +0000879 CallOperands.push_back(N->getOperand(1));
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000880 } else if (ExternalSymbolSDNode *ESSDN =
881 dyn_cast<ExternalSymbolSDNode>(N->getOperand(1))) {
Nate Begeman422b0ce2005-11-16 00:48:01 +0000882 CallOpcode = PPC::BL;
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000883 CallOperands.push_back(N->getOperand(1));
Nate Begeman422b0ce2005-11-16 00:48:01 +0000884 } else if (isa<ConstantSDNode>(N->getOperand(1)) &&
885 isCallCompatibleAddress(cast<ConstantSDNode>(N->getOperand(1)))) {
886 ConstantSDNode *C = cast<ConstantSDNode>(N->getOperand(1));
887 CallOpcode = PPC::BLA;
888 CallOperands.push_back(getI32Imm((int)C->getValue() >> 2));
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000889 } else {
890 // Copy the callee address into the CTR register.
Evan Cheng34167212006-02-09 00:37:58 +0000891 SDOperand Callee;
892 Select(Callee, N->getOperand(1));
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000893 Chain = SDOperand(CurDAG->getTargetNode(PPC::MTCTR, MVT::Other, Callee,
894 Chain), 0);
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000895
896 // Copy the callee address into R12 on darwin.
897 SDOperand R12 = CurDAG->getRegister(PPC::R12, MVT::i32);
898 Chain = CurDAG->getNode(ISD::CopyToReg, MVT::Other, Chain, R12, Callee);
Nate Begeman422b0ce2005-11-16 00:48:01 +0000899
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000900 CallOperands.push_back(R12);
Nate Begeman422b0ce2005-11-16 00:48:01 +0000901 CallOpcode = PPC::BCTRL;
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000902 }
903
904 unsigned GPR_idx = 0, FPR_idx = 0;
905 static const unsigned GPR[] = {
906 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
907 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
908 };
909 static const unsigned FPR[] = {
910 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
911 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
912 };
913
914 SDOperand InFlag; // Null incoming flag value.
915
916 for (unsigned i = 2, e = N->getNumOperands(); i != e; ++i) {
917 unsigned DestReg = 0;
918 MVT::ValueType RegTy = N->getOperand(i).getValueType();
919 if (RegTy == MVT::i32) {
920 assert(GPR_idx < 8 && "Too many int args");
921 DestReg = GPR[GPR_idx++];
922 } else {
923 assert(MVT::isFloatingPoint(N->getOperand(i).getValueType()) &&
924 "Unpromoted integer arg?");
925 assert(FPR_idx < 13 && "Too many fp args");
926 DestReg = FPR[FPR_idx++];
927 }
928
929 if (N->getOperand(i).getOpcode() != ISD::UNDEF) {
Evan Cheng34167212006-02-09 00:37:58 +0000930 SDOperand Val;
931 Select(Val, N->getOperand(i));
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000932 Chain = CurDAG->getCopyToReg(Chain, DestReg, Val, InFlag);
933 InFlag = Chain.getValue(1);
934 CallOperands.push_back(CurDAG->getRegister(DestReg, RegTy));
935 }
936 }
937
938 // Finally, once everything is in registers to pass to the call, emit the
939 // call itself.
940 if (InFlag.Val)
941 CallOperands.push_back(InFlag); // Strong dep on register copies.
942 else
943 CallOperands.push_back(Chain); // Weak dep on whatever occurs before
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000944 Chain = SDOperand(CurDAG->getTargetNode(CallOpcode, MVT::Other, MVT::Flag,
945 CallOperands), 0);
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000946
947 std::vector<SDOperand> CallResults;
948
949 // If the call has results, copy the values out of the ret val registers.
950 switch (N->getValueType(0)) {
951 default: assert(0 && "Unexpected ret value!");
952 case MVT::Other: break;
953 case MVT::i32:
954 if (N->getValueType(1) == MVT::i32) {
955 Chain = CurDAG->getCopyFromReg(Chain, PPC::R4, MVT::i32,
956 Chain.getValue(1)).getValue(1);
957 CallResults.push_back(Chain.getValue(0));
958 Chain = CurDAG->getCopyFromReg(Chain, PPC::R3, MVT::i32,
959 Chain.getValue(2)).getValue(1);
960 CallResults.push_back(Chain.getValue(0));
961 } else {
962 Chain = CurDAG->getCopyFromReg(Chain, PPC::R3, MVT::i32,
963 Chain.getValue(1)).getValue(1);
964 CallResults.push_back(Chain.getValue(0));
965 }
966 break;
967 case MVT::f32:
968 case MVT::f64:
969 Chain = CurDAG->getCopyFromReg(Chain, PPC::F1, N->getValueType(0),
970 Chain.getValue(1)).getValue(1);
971 CallResults.push_back(Chain.getValue(0));
972 break;
973 }
974
975 CallResults.push_back(Chain);
976 for (unsigned i = 0, e = CallResults.size(); i != e; ++i)
977 CodeGenMap[Op.getValue(i)] = CallResults[i];
978 return CallResults[Op.ResNo];
979}
980
Chris Lattnera5a91b12005-08-17 19:33:03 +0000981// Select - Convert the specified operand from a target-independent to a
982// target-specific node if it hasn't already been changed.
Evan Cheng34167212006-02-09 00:37:58 +0000983void PPCDAGToDAGISel::Select(SDOperand &Result, SDOperand Op) {
Chris Lattnera5a91b12005-08-17 19:33:03 +0000984 SDNode *N = Op.Val;
Chris Lattner0bbea952005-08-26 20:25:03 +0000985 if (N->getOpcode() >= ISD::BUILTIN_OP_END &&
Evan Cheng34167212006-02-09 00:37:58 +0000986 N->getOpcode() < PPCISD::FIRST_NUMBER) {
987 Result = Op;
988 return; // Already selected.
989 }
Chris Lattnerd3d2cf52005-09-29 00:59:32 +0000990
991 // If this has already been converted, use it.
992 std::map<SDOperand, SDOperand>::iterator CGMI = CodeGenMap.find(Op);
Evan Cheng34167212006-02-09 00:37:58 +0000993 if (CGMI != CodeGenMap.end()) {
994 Result = CGMI->second;
995 return;
996 }
Chris Lattnera5a91b12005-08-17 19:33:03 +0000997
998 switch (N->getOpcode()) {
Chris Lattner19c09072005-09-07 23:45:15 +0000999 default: break;
Evan Cheng34167212006-02-09 00:37:58 +00001000 case ISD::SETCC:
1001 Result = SelectSETCC(Op);
1002 return;
1003 case PPCISD::CALL:
1004 Result = SelectCALL(Op);
1005 return;
1006 case PPCISD::GlobalBaseReg:
1007 Result = getGlobalBaseReg();
1008 return;
Chris Lattner860e8862005-11-17 07:30:41 +00001009
Chris Lattnere28e40a2005-08-25 00:45:43 +00001010 case ISD::FrameIndex: {
1011 int FI = cast<FrameIndexSDNode>(N)->getIndex();
Evan Cheng34167212006-02-09 00:37:58 +00001012 if (N->hasOneUse()) {
1013 Result = CurDAG->SelectNodeTo(N, PPC::ADDI, MVT::i32,
1014 CurDAG->getTargetFrameIndex(FI, MVT::i32),
1015 getI32Imm(0));
1016 return;
1017 }
1018 Result = CodeGenMap[Op] =
Evan Cheng7e9b26f2006-02-09 07:17:49 +00001019 SDOperand(CurDAG->getTargetNode(PPC::ADDI, MVT::i32,
1020 CurDAG->getTargetFrameIndex(FI, MVT::i32),
1021 getI32Imm(0)), 0);
Evan Cheng34167212006-02-09 00:37:58 +00001022 return;
Chris Lattnere28e40a2005-08-25 00:45:43 +00001023 }
Chris Lattner6d92cad2006-03-26 10:06:40 +00001024
1025 case PPCISD::MFCR: {
1026 SDOperand InFlag;
1027 Select(InFlag, N->getOperand(1));
1028 // Use MFOCRF if supported.
1029 if (TLI.getTargetMachine().getSubtarget<PPCSubtarget>().isGigaProcessor())
1030 Result = SDOperand(CurDAG->getTargetNode(PPC::MFOCRF, MVT::i32,
1031 N->getOperand(0), InFlag), 0);
1032 else
1033 Result = SDOperand(CurDAG->getTargetNode(PPC::MFCR, MVT::i32, InFlag), 0);
1034 CodeGenMap[Op] = Result;
1035 return;
1036 }
1037
Chris Lattner88add102005-09-28 22:50:24 +00001038 case ISD::SDIV: {
Nate Begeman405e3ec2005-10-21 00:02:42 +00001039 // FIXME: since this depends on the setting of the carry flag from the srawi
1040 // we should really be making notes about that for the scheduler.
1041 // FIXME: It sure would be nice if we could cheaply recognize the
1042 // srl/add/sra pattern the dag combiner will generate for this as
1043 // sra/addze rather than having to handle sdiv ourselves. oh well.
Chris Lattner8784a232005-08-25 17:50:06 +00001044 unsigned Imm;
1045 if (isIntImmediate(N->getOperand(1), Imm)) {
Evan Cheng34167212006-02-09 00:37:58 +00001046 SDOperand N0;
1047 Select(N0, N->getOperand(0));
Chris Lattner8784a232005-08-25 17:50:06 +00001048 if ((signed)Imm > 0 && isPowerOf2_32(Imm)) {
Evan Cheng7e9b26f2006-02-09 07:17:49 +00001049 SDNode *Op =
Chris Lattner8784a232005-08-25 17:50:06 +00001050 CurDAG->getTargetNode(PPC::SRAWI, MVT::i32, MVT::Flag,
Evan Cheng34167212006-02-09 00:37:58 +00001051 N0, getI32Imm(Log2_32(Imm)));
1052 Result = CurDAG->SelectNodeTo(N, PPC::ADDZE, MVT::i32,
Evan Cheng7e9b26f2006-02-09 07:17:49 +00001053 SDOperand(Op, 0), SDOperand(Op, 1));
Chris Lattner8784a232005-08-25 17:50:06 +00001054 } else if ((signed)Imm < 0 && isPowerOf2_32(-Imm)) {
Evan Cheng7e9b26f2006-02-09 07:17:49 +00001055 SDNode *Op =
Chris Lattner2501d5e2005-08-30 17:13:58 +00001056 CurDAG->getTargetNode(PPC::SRAWI, MVT::i32, MVT::Flag,
Evan Cheng34167212006-02-09 00:37:58 +00001057 N0, getI32Imm(Log2_32(-Imm)));
Chris Lattner8784a232005-08-25 17:50:06 +00001058 SDOperand PT =
Evan Cheng7e9b26f2006-02-09 07:17:49 +00001059 SDOperand(CurDAG->getTargetNode(PPC::ADDZE, MVT::i32,
1060 SDOperand(Op, 0), SDOperand(Op, 1)),
1061 0);
Evan Cheng34167212006-02-09 00:37:58 +00001062 Result = CurDAG->SelectNodeTo(N, PPC::NEG, MVT::i32, PT);
Chris Lattner8784a232005-08-25 17:50:06 +00001063 }
Evan Cheng34167212006-02-09 00:37:58 +00001064 return;
Chris Lattner8784a232005-08-25 17:50:06 +00001065 }
Chris Lattner047b9522005-08-25 22:04:30 +00001066
Chris Lattner237733e2005-09-29 23:33:31 +00001067 // Other cases are autogenerated.
1068 break;
Chris Lattner047b9522005-08-25 22:04:30 +00001069 }
Nate Begemancffc32b2005-08-18 07:30:46 +00001070 case ISD::AND: {
Nate Begeman50fb3c42005-12-24 01:00:15 +00001071 unsigned Imm, Imm2;
Nate Begemancffc32b2005-08-18 07:30:46 +00001072 // If this is an and of a value rotated between 0 and 31 bits and then and'd
1073 // with a mask, emit rlwinm
1074 if (isIntImmediate(N->getOperand(1), Imm) && (isShiftedMask_32(Imm) ||
1075 isShiftedMask_32(~Imm))) {
1076 SDOperand Val;
Nate Begemana6940472005-08-18 18:01:39 +00001077 unsigned SH, MB, ME;
Nate Begemancffc32b2005-08-18 07:30:46 +00001078 if (isRotateAndMask(N->getOperand(0).Val, Imm, false, SH, MB, ME)) {
Evan Cheng34167212006-02-09 00:37:58 +00001079 Select(Val, N->getOperand(0).getOperand(0));
Chris Lattner3393e802005-10-25 19:32:37 +00001080 } else if (Imm == 0) {
1081 // AND X, 0 -> 0, not "rlwinm 32".
Evan Cheng34167212006-02-09 00:37:58 +00001082 Select(Result, N->getOperand(1));
1083 return ;
Chris Lattner3393e802005-10-25 19:32:37 +00001084 } else {
Evan Cheng34167212006-02-09 00:37:58 +00001085 Select(Val, N->getOperand(0));
Nate Begemancffc32b2005-08-18 07:30:46 +00001086 isRunOfOnes(Imm, MB, ME);
1087 SH = 0;
1088 }
Evan Cheng34167212006-02-09 00:37:58 +00001089 Result = CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Val,
1090 getI32Imm(SH), getI32Imm(MB),
1091 getI32Imm(ME));
1092 return;
Nate Begemancffc32b2005-08-18 07:30:46 +00001093 }
Nate Begeman50fb3c42005-12-24 01:00:15 +00001094 // ISD::OR doesn't get all the bitfield insertion fun.
1095 // (and (or x, c1), c2) where isRunOfOnes(~(c1^c2)) is a bitfield insert
1096 if (isIntImmediate(N->getOperand(1), Imm) &&
1097 N->getOperand(0).getOpcode() == ISD::OR &&
1098 isIntImmediate(N->getOperand(0).getOperand(1), Imm2)) {
Chris Lattnerc9a5ef52006-01-05 18:32:49 +00001099 unsigned MB, ME;
Nate Begeman50fb3c42005-12-24 01:00:15 +00001100 Imm = ~(Imm^Imm2);
1101 if (isRunOfOnes(Imm, MB, ME)) {
Evan Cheng34167212006-02-09 00:37:58 +00001102 SDOperand Tmp1, Tmp2;
1103 Select(Tmp1, N->getOperand(0).getOperand(0));
1104 Select(Tmp2, N->getOperand(0).getOperand(1));
Evan Cheng7e9b26f2006-02-09 07:17:49 +00001105 Result = SDOperand(CurDAG->getTargetNode(PPC::RLWIMI, MVT::i32,
1106 Tmp1, Tmp2,
1107 getI32Imm(0), getI32Imm(MB),
1108 getI32Imm(ME)), 0);
Evan Cheng34167212006-02-09 00:37:58 +00001109 return;
Nate Begeman50fb3c42005-12-24 01:00:15 +00001110 }
1111 }
Chris Lattner237733e2005-09-29 23:33:31 +00001112
1113 // Other cases are autogenerated.
1114 break;
Nate Begemancffc32b2005-08-18 07:30:46 +00001115 }
Nate Begeman02b88a42005-08-19 00:38:14 +00001116 case ISD::OR:
Evan Cheng34167212006-02-09 00:37:58 +00001117 if (SDNode *I = SelectBitfieldInsert(N)) {
1118 Result = CodeGenMap[Op] = SDOperand(I, 0);
1119 return;
1120 }
Chris Lattnerd3d2cf52005-09-29 00:59:32 +00001121
Chris Lattner237733e2005-09-29 23:33:31 +00001122 // Other cases are autogenerated.
1123 break;
Nate Begemanc15ed442005-08-18 23:38:00 +00001124 case ISD::SHL: {
1125 unsigned Imm, SH, MB, ME;
1126 if (isOpcWithIntImmediate(N->getOperand(0).Val, ISD::AND, Imm) &&
Nate Begeman2d5aff72005-10-19 18:42:01 +00001127 isRotateAndMask(N, Imm, true, SH, MB, ME)) {
Evan Cheng34167212006-02-09 00:37:58 +00001128 SDOperand Val;
1129 Select(Val, N->getOperand(0).getOperand(0));
1130 Result = CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32,
1131 Val, getI32Imm(SH), getI32Imm(MB),
1132 getI32Imm(ME));
1133 return;
Nate Begeman8d948322005-10-19 01:12:32 +00001134 }
Nate Begeman2d5aff72005-10-19 18:42:01 +00001135
1136 // Other cases are autogenerated.
1137 break;
Nate Begemanc15ed442005-08-18 23:38:00 +00001138 }
1139 case ISD::SRL: {
1140 unsigned Imm, SH, MB, ME;
1141 if (isOpcWithIntImmediate(N->getOperand(0).Val, ISD::AND, Imm) &&
Nate Begeman2d5aff72005-10-19 18:42:01 +00001142 isRotateAndMask(N, Imm, true, SH, MB, ME)) {
Evan Cheng34167212006-02-09 00:37:58 +00001143 SDOperand Val;
1144 Select(Val, N->getOperand(0).getOperand(0));
1145 Result = CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32,
1146 Val, getI32Imm(SH & 0x1F), getI32Imm(MB),
1147 getI32Imm(ME));
1148 return;
Nate Begeman8d948322005-10-19 01:12:32 +00001149 }
Nate Begeman2d5aff72005-10-19 18:42:01 +00001150
1151 // Other cases are autogenerated.
1152 break;
Nate Begemanc15ed442005-08-18 23:38:00 +00001153 }
Chris Lattner13794f52005-08-26 18:46:49 +00001154 case ISD::SELECT_CC: {
1155 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(4))->get();
1156
1157 // handle the setcc cases here. select_cc lhs, 0, 1, 0, cc
1158 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N->getOperand(1)))
1159 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N->getOperand(2)))
1160 if (ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N->getOperand(3)))
1161 if (N1C->isNullValue() && N3C->isNullValue() &&
1162 N2C->getValue() == 1ULL && CC == ISD::SETNE) {
Evan Cheng34167212006-02-09 00:37:58 +00001163 SDOperand LHS;
1164 Select(LHS, N->getOperand(0));
Evan Cheng7e9b26f2006-02-09 07:17:49 +00001165 SDNode *Tmp =
Chris Lattner13794f52005-08-26 18:46:49 +00001166 CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
1167 LHS, getI32Imm(~0U));
Evan Cheng7e9b26f2006-02-09 07:17:49 +00001168 Result = CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32,
1169 SDOperand(Tmp, 0), LHS,
1170 SDOperand(Tmp, 1));
Evan Cheng34167212006-02-09 00:37:58 +00001171 return;
Chris Lattner13794f52005-08-26 18:46:49 +00001172 }
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00001173
Chris Lattner50ff55c2005-09-01 19:20:44 +00001174 SDOperand CCReg = SelectCC(N->getOperand(0), N->getOperand(1), CC);
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00001175 unsigned BROpc = getBCCForSetCC(CC);
1176
1177 bool isFP = MVT::isFloatingPoint(N->getValueType(0));
Chris Lattner919c0322005-10-01 01:35:02 +00001178 unsigned SelectCCOp;
1179 if (MVT::isInteger(N->getValueType(0)))
1180 SelectCCOp = PPC::SELECT_CC_Int;
1181 else if (N->getValueType(0) == MVT::f32)
1182 SelectCCOp = PPC::SELECT_CC_F4;
Chris Lattner710ff322006-04-08 22:45:08 +00001183 else if (N->getValueType(0) == MVT::f64)
Chris Lattner919c0322005-10-01 01:35:02 +00001184 SelectCCOp = PPC::SELECT_CC_F8;
Chris Lattner710ff322006-04-08 22:45:08 +00001185 else
1186 SelectCCOp = PPC::SELECT_CC_VRRC;
1187
Evan Cheng34167212006-02-09 00:37:58 +00001188 SDOperand N2, N3;
1189 Select(N2, N->getOperand(2));
1190 Select(N3, N->getOperand(3));
1191 Result = CurDAG->SelectNodeTo(N, SelectCCOp, N->getValueType(0), CCReg,
1192 N2, N3, getI32Imm(BROpc));
1193 return;
Chris Lattner13794f52005-08-26 18:46:49 +00001194 }
Nate Begeman81e80972006-03-17 01:40:33 +00001195 case ISD::BR_CC: {
Evan Cheng34167212006-02-09 00:37:58 +00001196 SDOperand Chain;
1197 Select(Chain, N->getOperand(0));
Chris Lattner2fbb4572005-08-21 18:50:37 +00001198 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(1))->get();
1199 SDOperand CondCode = SelectCC(N->getOperand(2), N->getOperand(3), CC);
Nate Begeman81e80972006-03-17 01:40:33 +00001200 Result = CurDAG->SelectNodeTo(N, PPC::COND_BRANCH, MVT::Other,
1201 CondCode, getI32Imm(getBCCForSetCC(CC)),
1202 N->getOperand(4), Chain);
Evan Cheng34167212006-02-09 00:37:58 +00001203 return;
Chris Lattner2fbb4572005-08-21 18:50:37 +00001204 }
Nate Begeman37efe672006-04-22 18:53:45 +00001205 case ISD::BRIND: {
1206 SDOperand Chain, Target;
1207 Select(Chain, N->getOperand(0));
1208 Select(Target,N->getOperand(1));
1209 Chain = SDOperand(CurDAG->getTargetNode(PPC::MTCTR, MVT::Other, Target,
1210 Chain), 0);
1211 Result = CurDAG->SelectNodeTo(N, PPC::BCTR, MVT::Other, Chain);
1212 return;
1213 }
Chris Lattnera5a91b12005-08-17 19:33:03 +00001214 }
Chris Lattner25dae722005-09-03 00:53:47 +00001215
Evan Cheng34167212006-02-09 00:37:58 +00001216 SelectCode(Result, Op);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001217}
1218
1219
Nate Begeman1d9d7422005-10-18 00:28:58 +00001220/// createPPCISelDag - This pass converts a legalized DAG into a
Chris Lattnera5a91b12005-08-17 19:33:03 +00001221/// PowerPC-specific DAG, ready for instruction scheduling.
1222///
Evan Chengc4c62572006-03-13 23:20:37 +00001223FunctionPass *llvm::createPPCISelDag(PPCTargetMachine &TM) {
Nate Begeman1d9d7422005-10-18 00:28:58 +00001224 return new PPCDAGToDAGISel(TM);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001225}
1226