blob: 11b0c3df222f5f50275371aa42f2b792c43bae79 [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 if ((LKZ | RKZ) == 0x00000000FFFFFFFFULL) {
409 unsigned PInsMask = ~RKZ;
410 unsigned PTgtMask = ~LKZ;
411
412 // If the LHS has a foldable shift, then swap it to the RHS so that we can
413 // fold the shift into the insert.
414 if (Op0Opc == ISD::AND && Op1Opc == ISD::AND) {
415 if (Op0.getOperand(0).getOpcode() == ISD::SHL ||
416 Op0.getOperand(0).getOpcode() == ISD::SRL) {
417 if (Op1.getOperand(0).getOpcode() != ISD::SHL &&
418 Op1.getOperand(0).getOpcode() != ISD::SRL) {
419 std::swap(Op0, Op1);
420 std::swap(Op0Opc, Op1Opc);
421 std::swap(PInsMask, PTgtMask);
422 }
Nate Begeman02b88a42005-08-19 00:38:14 +0000423 }
424 }
Nate Begeman77f361f2006-05-07 00:23:38 +0000425
426 unsigned MB, ME;
427 if (isRunOfOnes(PInsMask, MB, ME)) {
428 SDOperand Tmp1, Tmp2, Tmp3;
429 bool DisjointMask = (PTgtMask ^ PInsMask) == 0xFFFFFFFF;
430
431 if ((Op1Opc == ISD::SHL || Op1Opc == ISD::SRL) &&
432 isIntImmediate(Op1.getOperand(1), Value)) {
433 Op1 = Op1.getOperand(0);
434 SH = (Op1Opc == ISD::SHL) ? Value : 32 - Value;
435 }
436 if (Op1Opc == ISD::AND) {
437 unsigned SHOpc = Op1.getOperand(0).getOpcode();
438 if ((SHOpc == ISD::SHL || SHOpc == ISD::SRL) &&
439 isIntImmediate(Op1.getOperand(0).getOperand(1), Value)) {
440 Op1 = Op1.getOperand(0).getOperand(0);
441 SH = (SHOpc == ISD::SHL) ? Value : 32 - Value;
442 } else {
443 Op1 = Op1.getOperand(0);
444 }
445 }
446
447 Tmp3 = (Op0Opc == ISD::AND && DisjointMask) ? Op0.getOperand(0) : Op0;
448 Select(Tmp1, Tmp3);
449 Select(Tmp2, Op1);
450 return CurDAG->getTargetNode(PPC::RLWIMI, MVT::i32, Tmp1, Tmp2,
451 getI32Imm(SH), getI32Imm(MB), getI32Imm(ME));
Nate Begeman02b88a42005-08-19 00:38:14 +0000452 }
Nate Begeman02b88a42005-08-19 00:38:14 +0000453 }
454 return 0;
455}
456
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000457/// SelectAddrImm - Returns true if the address N can be represented by
458/// a base register plus a signed 16-bit displacement [r+imm].
459bool PPCDAGToDAGISel::SelectAddrImm(SDOperand N, SDOperand &Disp,
460 SDOperand &Base) {
Chris Lattner0f6ab6f2006-03-01 07:14:48 +0000461 // If this can be more profitably realized as r+r, fail.
462 if (SelectAddrIdx(N, Disp, Base))
463 return false;
464
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000465 if (N.getOpcode() == ISD::ADD) {
466 unsigned imm = 0;
467 if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm)) {
Chris Lattner17e82d22006-01-12 01:54:15 +0000468 Disp = getI32Imm(imm & 0xFFFF);
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000469 if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(N.getOperand(0))) {
470 Base = CurDAG->getTargetFrameIndex(FI->getIndex(), MVT::i32);
Chris Lattner9944b762005-08-21 22:31:09 +0000471 } else {
Evan Cheng7564e0b2006-02-05 08:45:01 +0000472 Base = N.getOperand(0);
Chris Lattner9944b762005-08-21 22:31:09 +0000473 }
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000474 return true; // [r+i]
475 } else if (N.getOperand(1).getOpcode() == PPCISD::Lo) {
Chris Lattner4f0f86d2005-11-17 18:02:16 +0000476 // Match LOAD (ADD (X, Lo(G))).
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000477 assert(!cast<ConstantSDNode>(N.getOperand(1).getOperand(1))->getValue()
Chris Lattner4f0f86d2005-11-17 18:02:16 +0000478 && "Cannot handle constant offsets yet!");
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000479 Disp = N.getOperand(1).getOperand(0); // The global address.
480 assert(Disp.getOpcode() == ISD::TargetGlobalAddress ||
Nate Begeman37efe672006-04-22 18:53:45 +0000481 Disp.getOpcode() == ISD::TargetConstantPool ||
482 Disp.getOpcode() == ISD::TargetJumpTable);
Evan Cheng7564e0b2006-02-05 08:45:01 +0000483 Base = N.getOperand(0);
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000484 return true; // [&g+r]
Chris Lattner9944b762005-08-21 22:31:09 +0000485 }
Chris Lattner0f6ab6f2006-03-01 07:14:48 +0000486 } else if (N.getOpcode() == ISD::OR) {
487 unsigned imm = 0;
488 if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm)) {
489 // If this is an or of disjoint bitfields, we can codegen this as an add
490 // (for better address arithmetic) if the LHS and RHS of the OR are
491 // provably disjoint.
492 uint64_t LHSKnownZero, LHSKnownOne;
493 PPCLowering.ComputeMaskedBits(N.getOperand(0), ~0U,
494 LHSKnownZero, LHSKnownOne);
495 if ((LHSKnownZero|~imm) == ~0U) {
496 // If all of the bits are known zero on the LHS or RHS, the add won't
497 // carry.
498 Base = N.getOperand(0);
499 Disp = getI32Imm(imm & 0xFFFF);
500 return true;
501 }
502 }
Chris Lattnerd9796442006-03-20 22:38:22 +0000503 } else if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N)) {
504 // Loading from a constant address.
505 int Addr = (int)CN->getValue();
506
507 // If this address fits entirely in a 16-bit sext immediate field, codegen
508 // this as "d, 0"
509 if (Addr == (short)Addr) {
510 Disp = getI32Imm(Addr);
511 Base = CurDAG->getRegister(PPC::R0, MVT::i32);
512 return true;
513 }
514
515 // Otherwise, break this down into an LIS + disp.
516 Disp = getI32Imm((short)Addr);
517 Base = CurDAG->getConstant(Addr - (signed short)Addr, MVT::i32);
518 return true;
Chris Lattner9944b762005-08-21 22:31:09 +0000519 }
Chris Lattnerd9796442006-03-20 22:38:22 +0000520
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000521 Disp = getI32Imm(0);
522 if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(N))
523 Base = CurDAG->getTargetFrameIndex(FI->getIndex(), MVT::i32);
Nate Begeman28a6b022005-12-10 02:36:00 +0000524 else
Evan Cheng7564e0b2006-02-05 08:45:01 +0000525 Base = N;
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000526 return true; // [r+0]
Chris Lattner9944b762005-08-21 22:31:09 +0000527}
Chris Lattnera5a91b12005-08-17 19:33:03 +0000528
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000529/// SelectAddrIdx - Given the specified addressed, check to see if it can be
530/// represented as an indexed [r+r] operation. Returns false if it can
531/// be represented by [r+imm], which are preferred.
532bool PPCDAGToDAGISel::SelectAddrIdx(SDOperand N, SDOperand &Base,
533 SDOperand &Index) {
Chris Lattner0f6ab6f2006-03-01 07:14:48 +0000534 unsigned imm = 0;
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000535 if (N.getOpcode() == ISD::ADD) {
Chris Lattner0f6ab6f2006-03-01 07:14:48 +0000536 if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm))
537 return false; // r+i
538 if (N.getOperand(1).getOpcode() == PPCISD::Lo)
539 return false; // r+i
540
Evan Cheng7564e0b2006-02-05 08:45:01 +0000541 Base = N.getOperand(0);
542 Index = N.getOperand(1);
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000543 return true;
Chris Lattner0f6ab6f2006-03-01 07:14:48 +0000544 } else if (N.getOpcode() == ISD::OR) {
545 if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm))
546 return false; // r+i can fold it if we can.
547
548 // If this is an or of disjoint bitfields, we can codegen this as an add
549 // (for better address arithmetic) if the LHS and RHS of the OR are provably
550 // disjoint.
551 uint64_t LHSKnownZero, LHSKnownOne;
552 uint64_t RHSKnownZero, RHSKnownOne;
553 PPCLowering.ComputeMaskedBits(N.getOperand(0), ~0U,
554 LHSKnownZero, LHSKnownOne);
555
556 if (LHSKnownZero) {
557 PPCLowering.ComputeMaskedBits(N.getOperand(1), ~0U,
558 RHSKnownZero, RHSKnownOne);
559 // If all of the bits are known zero on the LHS or RHS, the add won't
560 // carry.
561 if ((LHSKnownZero | RHSKnownZero) == ~0U) {
562 Base = N.getOperand(0);
563 Index = N.getOperand(1);
564 return true;
565 }
566 }
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000567 }
Chris Lattner0f6ab6f2006-03-01 07:14:48 +0000568
569 return false;
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000570}
571
572/// SelectAddrIdxOnly - Given the specified addressed, force it to be
573/// represented as an indexed [r+r] operation.
574bool PPCDAGToDAGISel::SelectAddrIdxOnly(SDOperand N, SDOperand &Base,
575 SDOperand &Index) {
Chris Lattner0f6ab6f2006-03-01 07:14:48 +0000576 // Check to see if we can easily represent this as an [r+r] address. This
577 // will fail if it thinks that the address is more profitably represented as
578 // reg+imm, e.g. where imm = 0.
Chris Lattner54e869e2006-03-24 17:58:06 +0000579 if (SelectAddrIdx(N, Base, Index))
580 return true;
581
582 // If the operand is an addition, always emit this as [r+r], since this is
583 // better (for code size, and execution, as the memop does the add for free)
584 // than emitting an explicit add.
585 if (N.getOpcode() == ISD::ADD) {
586 Base = N.getOperand(0);
587 Index = N.getOperand(1);
588 return true;
Nate Begemanf43a3ca2005-11-30 08:22:07 +0000589 }
Chris Lattner54e869e2006-03-24 17:58:06 +0000590
591 // Otherwise, do it the hard way, using R0 as the base register.
592 Base = CurDAG->getRegister(PPC::R0, MVT::i32);
593 Index = N;
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000594 return true;
Nate Begemanf43a3ca2005-11-30 08:22:07 +0000595}
596
Chris Lattnere5ba5802006-03-22 05:26:03 +0000597/// SelectAddrImmShift - Returns true if the address N can be represented by
598/// a base register plus a signed 14-bit displacement [r+imm*4]. Suitable
599/// for use by STD and friends.
600bool PPCDAGToDAGISel::SelectAddrImmShift(SDOperand N, SDOperand &Disp,
601 SDOperand &Base) {
602 // If this can be more profitably realized as r+r, fail.
603 if (SelectAddrIdx(N, Disp, Base))
604 return false;
605
606 if (N.getOpcode() == ISD::ADD) {
607 unsigned imm = 0;
608 if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm) &&
609 (imm & 3) == 0) {
610 Disp = getI32Imm((imm & 0xFFFF) >> 2);
611 if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(N.getOperand(0))) {
612 Base = CurDAG->getTargetFrameIndex(FI->getIndex(), MVT::i32);
613 } else {
614 Base = N.getOperand(0);
615 }
616 return true; // [r+i]
617 } else if (N.getOperand(1).getOpcode() == PPCISD::Lo) {
618 // Match LOAD (ADD (X, Lo(G))).
619 assert(!cast<ConstantSDNode>(N.getOperand(1).getOperand(1))->getValue()
620 && "Cannot handle constant offsets yet!");
621 Disp = N.getOperand(1).getOperand(0); // The global address.
622 assert(Disp.getOpcode() == ISD::TargetGlobalAddress ||
Nate Begeman37efe672006-04-22 18:53:45 +0000623 Disp.getOpcode() == ISD::TargetConstantPool ||
624 Disp.getOpcode() == ISD::TargetJumpTable);
Chris Lattnere5ba5802006-03-22 05:26:03 +0000625 Base = N.getOperand(0);
626 return true; // [&g+r]
627 }
628 } else if (N.getOpcode() == ISD::OR) {
629 unsigned imm = 0;
630 if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm) &&
631 (imm & 3) == 0) {
632 // If this is an or of disjoint bitfields, we can codegen this as an add
633 // (for better address arithmetic) if the LHS and RHS of the OR are
634 // provably disjoint.
635 uint64_t LHSKnownZero, LHSKnownOne;
636 PPCLowering.ComputeMaskedBits(N.getOperand(0), ~0U,
637 LHSKnownZero, LHSKnownOne);
638 if ((LHSKnownZero|~imm) == ~0U) {
639 // If all of the bits are known zero on the LHS or RHS, the add won't
640 // carry.
641 Base = N.getOperand(0);
642 Disp = getI32Imm((imm & 0xFFFF) >> 2);
643 return true;
644 }
645 }
646 } else if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N)) {
647 // Loading from a constant address.
648 int Addr = (int)CN->getValue();
649 if ((Addr & 3) == 0) {
650 // If this address fits entirely in a 16-bit sext immediate field, codegen
651 // this as "d, 0"
652 if (Addr == (short)Addr) {
653 Disp = getI32Imm(Addr >> 2);
654 Base = CurDAG->getRegister(PPC::R0, MVT::i32);
655 return true;
656 }
657
658 // Otherwise, break this down into an LIS + disp.
659 Disp = getI32Imm((short)Addr >> 2);
660 Base = CurDAG->getConstant(Addr - (signed short)Addr, MVT::i32);
661 return true;
662 }
663 }
664
665 Disp = getI32Imm(0);
666 if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(N))
667 Base = CurDAG->getTargetFrameIndex(FI->getIndex(), MVT::i32);
668 else
669 Base = N;
670 return true; // [r+0]
671}
672
673
Chris Lattner2fbb4572005-08-21 18:50:37 +0000674/// SelectCC - Select a comparison of the specified values with the specified
675/// condition code, returning the CR# of the expression.
Nate Begeman1d9d7422005-10-18 00:28:58 +0000676SDOperand PPCDAGToDAGISel::SelectCC(SDOperand LHS, SDOperand RHS,
677 ISD::CondCode CC) {
Chris Lattner2fbb4572005-08-21 18:50:37 +0000678 // Always select the LHS.
Evan Cheng34167212006-02-09 00:37:58 +0000679 Select(LHS, LHS);
Chris Lattner2fbb4572005-08-21 18:50:37 +0000680
681 // Use U to determine whether the SETCC immediate range is signed or not.
682 if (MVT::isInteger(LHS.getValueType())) {
683 bool U = ISD::isUnsignedIntSetCC(CC);
684 unsigned Imm;
685 if (isIntImmediate(RHS, Imm) &&
686 ((U && isUInt16(Imm)) || (!U && isInt16(Imm))))
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000687 return SDOperand(CurDAG->getTargetNode(U ? PPC::CMPLWI : PPC::CMPWI,
688 MVT::i32, LHS, getI32Imm(Imm & 0xFFFF)), 0);
Evan Cheng34167212006-02-09 00:37:58 +0000689 Select(RHS, RHS);
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000690 return SDOperand(CurDAG->getTargetNode(U ? PPC::CMPLW : PPC::CMPW, MVT::i32,
691 LHS, RHS), 0);
Chris Lattner919c0322005-10-01 01:35:02 +0000692 } else if (LHS.getValueType() == MVT::f32) {
Evan Cheng34167212006-02-09 00:37:58 +0000693 Select(RHS, RHS);
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000694 return SDOperand(CurDAG->getTargetNode(PPC::FCMPUS, MVT::i32, LHS, RHS), 0);
Chris Lattner2fbb4572005-08-21 18:50:37 +0000695 } else {
Evan Cheng34167212006-02-09 00:37:58 +0000696 Select(RHS, RHS);
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000697 return SDOperand(CurDAG->getTargetNode(PPC::FCMPUD, MVT::i32, LHS, RHS), 0);
Chris Lattner2fbb4572005-08-21 18:50:37 +0000698 }
699}
700
701/// getBCCForSetCC - Returns the PowerPC condition branch mnemonic corresponding
702/// to Condition.
703static unsigned getBCCForSetCC(ISD::CondCode CC) {
704 switch (CC) {
705 default: assert(0 && "Unknown condition!"); abort();
Chris Lattnered048c02005-10-28 20:49:47 +0000706 case ISD::SETOEQ: // FIXME: This is incorrect see PR642.
Chris Lattner2fbb4572005-08-21 18:50:37 +0000707 case ISD::SETEQ: return PPC::BEQ;
Chris Lattnered048c02005-10-28 20:49:47 +0000708 case ISD::SETONE: // FIXME: This is incorrect see PR642.
Chris Lattner2fbb4572005-08-21 18:50:37 +0000709 case ISD::SETNE: return PPC::BNE;
Chris Lattnered048c02005-10-28 20:49:47 +0000710 case ISD::SETOLT: // FIXME: This is incorrect see PR642.
Chris Lattner2fbb4572005-08-21 18:50:37 +0000711 case ISD::SETULT:
712 case ISD::SETLT: return PPC::BLT;
Chris Lattnered048c02005-10-28 20:49:47 +0000713 case ISD::SETOLE: // FIXME: This is incorrect see PR642.
Chris Lattner2fbb4572005-08-21 18:50:37 +0000714 case ISD::SETULE:
715 case ISD::SETLE: return PPC::BLE;
Chris Lattnered048c02005-10-28 20:49:47 +0000716 case ISD::SETOGT: // FIXME: This is incorrect see PR642.
Chris Lattner2fbb4572005-08-21 18:50:37 +0000717 case ISD::SETUGT:
718 case ISD::SETGT: return PPC::BGT;
Chris Lattnered048c02005-10-28 20:49:47 +0000719 case ISD::SETOGE: // FIXME: This is incorrect see PR642.
Chris Lattner2fbb4572005-08-21 18:50:37 +0000720 case ISD::SETUGE:
721 case ISD::SETGE: return PPC::BGE;
Chris Lattner6df25072005-10-28 20:32:44 +0000722
723 case ISD::SETO: return PPC::BUN;
724 case ISD::SETUO: return PPC::BNU;
Chris Lattner2fbb4572005-08-21 18:50:37 +0000725 }
726 return 0;
727}
728
Chris Lattner64906a02005-08-25 20:08:18 +0000729/// getCRIdxForSetCC - Return the index of the condition register field
730/// associated with the SetCC condition, and whether or not the field is
731/// treated as inverted. That is, lt = 0; ge = 0 inverted.
732static unsigned getCRIdxForSetCC(ISD::CondCode CC, bool& Inv) {
733 switch (CC) {
734 default: assert(0 && "Unknown condition!"); abort();
Chris Lattnered048c02005-10-28 20:49:47 +0000735 case ISD::SETOLT: // FIXME: This is incorrect see PR642.
Chris Lattner64906a02005-08-25 20:08:18 +0000736 case ISD::SETULT:
737 case ISD::SETLT: Inv = false; return 0;
Chris Lattnered048c02005-10-28 20:49:47 +0000738 case ISD::SETOGE: // FIXME: This is incorrect see PR642.
Chris Lattner64906a02005-08-25 20:08:18 +0000739 case ISD::SETUGE:
740 case ISD::SETGE: Inv = true; return 0;
Chris Lattnered048c02005-10-28 20:49:47 +0000741 case ISD::SETOGT: // FIXME: This is incorrect see PR642.
Chris Lattner64906a02005-08-25 20:08:18 +0000742 case ISD::SETUGT:
743 case ISD::SETGT: Inv = false; return 1;
Chris Lattnered048c02005-10-28 20:49:47 +0000744 case ISD::SETOLE: // FIXME: This is incorrect see PR642.
Chris Lattner64906a02005-08-25 20:08:18 +0000745 case ISD::SETULE:
746 case ISD::SETLE: Inv = true; return 1;
Chris Lattnered048c02005-10-28 20:49:47 +0000747 case ISD::SETOEQ: // FIXME: This is incorrect see PR642.
Chris Lattner64906a02005-08-25 20:08:18 +0000748 case ISD::SETEQ: Inv = false; return 2;
Chris Lattnered048c02005-10-28 20:49:47 +0000749 case ISD::SETONE: // FIXME: This is incorrect see PR642.
Chris Lattner64906a02005-08-25 20:08:18 +0000750 case ISD::SETNE: Inv = true; return 2;
Chris Lattner6df25072005-10-28 20:32:44 +0000751 case ISD::SETO: Inv = true; return 3;
752 case ISD::SETUO: Inv = false; return 3;
Chris Lattner64906a02005-08-25 20:08:18 +0000753 }
754 return 0;
755}
Chris Lattner9944b762005-08-21 22:31:09 +0000756
Nate Begeman1d9d7422005-10-18 00:28:58 +0000757SDOperand PPCDAGToDAGISel::SelectSETCC(SDOperand Op) {
Chris Lattner222adac2005-10-06 19:03:35 +0000758 SDNode *N = Op.Val;
759 unsigned Imm;
760 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(2))->get();
761 if (isIntImmediate(N->getOperand(1), Imm)) {
762 // We can codegen setcc op, imm very efficiently compared to a brcond.
763 // Check for those cases here.
764 // setcc op, 0
765 if (Imm == 0) {
Evan Cheng34167212006-02-09 00:37:58 +0000766 SDOperand Op;
767 Select(Op, N->getOperand(0));
Chris Lattner222adac2005-10-06 19:03:35 +0000768 switch (CC) {
Chris Lattnerdabb8292005-10-21 21:17:10 +0000769 default: break;
770 case ISD::SETEQ:
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000771 Op = SDOperand(CurDAG->getTargetNode(PPC::CNTLZW, MVT::i32, Op), 0);
Chris Lattner71d3d502005-11-30 22:53:06 +0000772 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Op, getI32Imm(27),
773 getI32Imm(5), getI32Imm(31));
Chris Lattnerdabb8292005-10-21 21:17:10 +0000774 case ISD::SETNE: {
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000775 SDOperand AD =
776 SDOperand(CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
777 Op, getI32Imm(~0U)), 0);
Chris Lattner71d3d502005-11-30 22:53:06 +0000778 return CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, AD, Op,
779 AD.getValue(1));
Chris Lattner222adac2005-10-06 19:03:35 +0000780 }
Chris Lattnerdabb8292005-10-21 21:17:10 +0000781 case ISD::SETLT:
Chris Lattner71d3d502005-11-30 22:53:06 +0000782 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Op, getI32Imm(1),
783 getI32Imm(31), getI32Imm(31));
Chris Lattnerdabb8292005-10-21 21:17:10 +0000784 case ISD::SETGT: {
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000785 SDOperand T =
786 SDOperand(CurDAG->getTargetNode(PPC::NEG, MVT::i32, Op), 0);
787 T = SDOperand(CurDAG->getTargetNode(PPC::ANDC, MVT::i32, T, Op), 0);
Chris Lattner71d3d502005-11-30 22:53:06 +0000788 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, T, getI32Imm(1),
789 getI32Imm(31), getI32Imm(31));
Chris Lattnerdabb8292005-10-21 21:17:10 +0000790 }
791 }
Chris Lattner222adac2005-10-06 19:03:35 +0000792 } else if (Imm == ~0U) { // setcc op, -1
Evan Cheng34167212006-02-09 00:37:58 +0000793 SDOperand Op;
794 Select(Op, N->getOperand(0));
Chris Lattner222adac2005-10-06 19:03:35 +0000795 switch (CC) {
Chris Lattnerdabb8292005-10-21 21:17:10 +0000796 default: break;
797 case ISD::SETEQ:
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000798 Op = SDOperand(CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
799 Op, getI32Imm(1)), 0);
Chris Lattner71d3d502005-11-30 22:53:06 +0000800 return CurDAG->SelectNodeTo(N, PPC::ADDZE, MVT::i32,
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000801 SDOperand(CurDAG->getTargetNode(PPC::LI, MVT::i32,
802 getI32Imm(0)), 0),
Chris Lattner71d3d502005-11-30 22:53:06 +0000803 Op.getValue(1));
Chris Lattnerdabb8292005-10-21 21:17:10 +0000804 case ISD::SETNE: {
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000805 Op = SDOperand(CurDAG->getTargetNode(PPC::NOR, MVT::i32, Op, Op), 0);
806 SDNode *AD = CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
807 Op, getI32Imm(~0U));
808 return CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, SDOperand(AD, 0), Op,
809 SDOperand(AD, 1));
Chris Lattner222adac2005-10-06 19:03:35 +0000810 }
Chris Lattnerdabb8292005-10-21 21:17:10 +0000811 case ISD::SETLT: {
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000812 SDOperand AD = SDOperand(CurDAG->getTargetNode(PPC::ADDI, MVT::i32, Op,
813 getI32Imm(1)), 0);
814 SDOperand AN = SDOperand(CurDAG->getTargetNode(PPC::AND, MVT::i32, AD,
815 Op), 0);
Chris Lattner71d3d502005-11-30 22:53:06 +0000816 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, AN, getI32Imm(1),
817 getI32Imm(31), getI32Imm(31));
Chris Lattnerdabb8292005-10-21 21:17:10 +0000818 }
819 case ISD::SETGT:
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000820 Op = SDOperand(CurDAG->getTargetNode(PPC::RLWINM, MVT::i32, Op,
821 getI32Imm(1), getI32Imm(31),
822 getI32Imm(31)), 0);
Chris Lattner71d3d502005-11-30 22:53:06 +0000823 return CurDAG->SelectNodeTo(N, PPC::XORI, MVT::i32, Op, getI32Imm(1));
Chris Lattnerdabb8292005-10-21 21:17:10 +0000824 }
Chris Lattner222adac2005-10-06 19:03:35 +0000825 }
826 }
827
828 bool Inv;
829 unsigned Idx = getCRIdxForSetCC(CC, Inv);
830 SDOperand CCReg = SelectCC(N->getOperand(0), N->getOperand(1), CC);
831 SDOperand IntCR;
832
833 // Force the ccreg into CR7.
834 SDOperand CR7Reg = CurDAG->getRegister(PPC::CR7, MVT::i32);
835
Chris Lattner85961d52005-12-06 20:56:18 +0000836 SDOperand InFlag(0, 0); // Null incoming flag value.
Chris Lattnerdb1cb2b2005-12-01 03:50:19 +0000837 CCReg = CurDAG->getCopyToReg(CurDAG->getEntryNode(), CR7Reg, CCReg,
838 InFlag).getValue(1);
Chris Lattner222adac2005-10-06 19:03:35 +0000839
840 if (TLI.getTargetMachine().getSubtarget<PPCSubtarget>().isGigaProcessor())
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000841 IntCR = SDOperand(CurDAG->getTargetNode(PPC::MFOCRF, MVT::i32, CR7Reg,
842 CCReg), 0);
Chris Lattner222adac2005-10-06 19:03:35 +0000843 else
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000844 IntCR = SDOperand(CurDAG->getTargetNode(PPC::MFCR, MVT::i32, CCReg), 0);
Chris Lattner222adac2005-10-06 19:03:35 +0000845
846 if (!Inv) {
Chris Lattner71d3d502005-11-30 22:53:06 +0000847 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, IntCR,
848 getI32Imm((32-(3-Idx)) & 31),
849 getI32Imm(31), getI32Imm(31));
Chris Lattner222adac2005-10-06 19:03:35 +0000850 } else {
851 SDOperand Tmp =
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000852 SDOperand(CurDAG->getTargetNode(PPC::RLWINM, MVT::i32, IntCR,
853 getI32Imm((32-(3-Idx)) & 31),
854 getI32Imm(31),getI32Imm(31)), 0);
Chris Lattner71d3d502005-11-30 22:53:06 +0000855 return CurDAG->SelectNodeTo(N, PPC::XORI, MVT::i32, Tmp, getI32Imm(1));
Chris Lattner222adac2005-10-06 19:03:35 +0000856 }
Chris Lattner222adac2005-10-06 19:03:35 +0000857}
Chris Lattner2b63e4c2005-10-06 18:56:10 +0000858
Nate Begeman422b0ce2005-11-16 00:48:01 +0000859/// isCallCompatibleAddress - Return true if the specified 32-bit value is
860/// representable in the immediate field of a Bx instruction.
861static bool isCallCompatibleAddress(ConstantSDNode *C) {
862 int Addr = C->getValue();
863 if (Addr & 3) return false; // Low 2 bits are implicitly zero.
864 return (Addr << 6 >> 6) == Addr; // Top 6 bits have to be sext of immediate.
865}
866
Nate Begeman1d9d7422005-10-18 00:28:58 +0000867SDOperand PPCDAGToDAGISel::SelectCALL(SDOperand Op) {
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000868 SDNode *N = Op.Val;
Evan Cheng34167212006-02-09 00:37:58 +0000869 SDOperand Chain;
870 Select(Chain, N->getOperand(0));
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000871
872 unsigned CallOpcode;
873 std::vector<SDOperand> CallOperands;
874
875 if (GlobalAddressSDNode *GASD =
876 dyn_cast<GlobalAddressSDNode>(N->getOperand(1))) {
Nate Begeman422b0ce2005-11-16 00:48:01 +0000877 CallOpcode = PPC::BL;
Chris Lattner2823b3e2005-11-17 05:56:14 +0000878 CallOperands.push_back(N->getOperand(1));
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000879 } else if (ExternalSymbolSDNode *ESSDN =
880 dyn_cast<ExternalSymbolSDNode>(N->getOperand(1))) {
Nate Begeman422b0ce2005-11-16 00:48:01 +0000881 CallOpcode = PPC::BL;
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000882 CallOperands.push_back(N->getOperand(1));
Nate Begeman422b0ce2005-11-16 00:48:01 +0000883 } else if (isa<ConstantSDNode>(N->getOperand(1)) &&
884 isCallCompatibleAddress(cast<ConstantSDNode>(N->getOperand(1)))) {
885 ConstantSDNode *C = cast<ConstantSDNode>(N->getOperand(1));
886 CallOpcode = PPC::BLA;
887 CallOperands.push_back(getI32Imm((int)C->getValue() >> 2));
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000888 } else {
889 // Copy the callee address into the CTR register.
Evan Cheng34167212006-02-09 00:37:58 +0000890 SDOperand Callee;
891 Select(Callee, N->getOperand(1));
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000892 Chain = SDOperand(CurDAG->getTargetNode(PPC::MTCTR, MVT::Other, Callee,
893 Chain), 0);
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000894
895 // Copy the callee address into R12 on darwin.
896 SDOperand R12 = CurDAG->getRegister(PPC::R12, MVT::i32);
897 Chain = CurDAG->getNode(ISD::CopyToReg, MVT::Other, Chain, R12, Callee);
Nate Begeman422b0ce2005-11-16 00:48:01 +0000898
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000899 CallOperands.push_back(R12);
Nate Begeman422b0ce2005-11-16 00:48:01 +0000900 CallOpcode = PPC::BCTRL;
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000901 }
902
903 unsigned GPR_idx = 0, FPR_idx = 0;
904 static const unsigned GPR[] = {
905 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
906 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
907 };
908 static const unsigned FPR[] = {
909 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
910 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
911 };
912
913 SDOperand InFlag; // Null incoming flag value.
914
915 for (unsigned i = 2, e = N->getNumOperands(); i != e; ++i) {
916 unsigned DestReg = 0;
917 MVT::ValueType RegTy = N->getOperand(i).getValueType();
918 if (RegTy == MVT::i32) {
919 assert(GPR_idx < 8 && "Too many int args");
920 DestReg = GPR[GPR_idx++];
921 } else {
922 assert(MVT::isFloatingPoint(N->getOperand(i).getValueType()) &&
923 "Unpromoted integer arg?");
924 assert(FPR_idx < 13 && "Too many fp args");
925 DestReg = FPR[FPR_idx++];
926 }
927
928 if (N->getOperand(i).getOpcode() != ISD::UNDEF) {
Evan Cheng34167212006-02-09 00:37:58 +0000929 SDOperand Val;
930 Select(Val, N->getOperand(i));
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000931 Chain = CurDAG->getCopyToReg(Chain, DestReg, Val, InFlag);
932 InFlag = Chain.getValue(1);
933 CallOperands.push_back(CurDAG->getRegister(DestReg, RegTy));
934 }
935 }
936
937 // Finally, once everything is in registers to pass to the call, emit the
938 // call itself.
939 if (InFlag.Val)
940 CallOperands.push_back(InFlag); // Strong dep on register copies.
941 else
942 CallOperands.push_back(Chain); // Weak dep on whatever occurs before
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000943 Chain = SDOperand(CurDAG->getTargetNode(CallOpcode, MVT::Other, MVT::Flag,
944 CallOperands), 0);
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000945
946 std::vector<SDOperand> CallResults;
947
948 // If the call has results, copy the values out of the ret val registers.
949 switch (N->getValueType(0)) {
950 default: assert(0 && "Unexpected ret value!");
951 case MVT::Other: break;
952 case MVT::i32:
953 if (N->getValueType(1) == MVT::i32) {
954 Chain = CurDAG->getCopyFromReg(Chain, PPC::R4, MVT::i32,
955 Chain.getValue(1)).getValue(1);
956 CallResults.push_back(Chain.getValue(0));
957 Chain = CurDAG->getCopyFromReg(Chain, PPC::R3, MVT::i32,
958 Chain.getValue(2)).getValue(1);
959 CallResults.push_back(Chain.getValue(0));
960 } else {
961 Chain = CurDAG->getCopyFromReg(Chain, PPC::R3, MVT::i32,
962 Chain.getValue(1)).getValue(1);
963 CallResults.push_back(Chain.getValue(0));
964 }
965 break;
966 case MVT::f32:
967 case MVT::f64:
968 Chain = CurDAG->getCopyFromReg(Chain, PPC::F1, N->getValueType(0),
969 Chain.getValue(1)).getValue(1);
970 CallResults.push_back(Chain.getValue(0));
971 break;
972 }
973
974 CallResults.push_back(Chain);
975 for (unsigned i = 0, e = CallResults.size(); i != e; ++i)
976 CodeGenMap[Op.getValue(i)] = CallResults[i];
977 return CallResults[Op.ResNo];
978}
979
Chris Lattnera5a91b12005-08-17 19:33:03 +0000980// Select - Convert the specified operand from a target-independent to a
981// target-specific node if it hasn't already been changed.
Evan Cheng34167212006-02-09 00:37:58 +0000982void PPCDAGToDAGISel::Select(SDOperand &Result, SDOperand Op) {
Chris Lattnera5a91b12005-08-17 19:33:03 +0000983 SDNode *N = Op.Val;
Chris Lattner0bbea952005-08-26 20:25:03 +0000984 if (N->getOpcode() >= ISD::BUILTIN_OP_END &&
Evan Cheng34167212006-02-09 00:37:58 +0000985 N->getOpcode() < PPCISD::FIRST_NUMBER) {
986 Result = Op;
987 return; // Already selected.
988 }
Chris Lattnerd3d2cf52005-09-29 00:59:32 +0000989
990 // If this has already been converted, use it.
991 std::map<SDOperand, SDOperand>::iterator CGMI = CodeGenMap.find(Op);
Evan Cheng34167212006-02-09 00:37:58 +0000992 if (CGMI != CodeGenMap.end()) {
993 Result = CGMI->second;
994 return;
995 }
Chris Lattnera5a91b12005-08-17 19:33:03 +0000996
997 switch (N->getOpcode()) {
Chris Lattner19c09072005-09-07 23:45:15 +0000998 default: break;
Evan Cheng34167212006-02-09 00:37:58 +0000999 case ISD::SETCC:
1000 Result = SelectSETCC(Op);
1001 return;
1002 case PPCISD::CALL:
1003 Result = SelectCALL(Op);
1004 return;
1005 case PPCISD::GlobalBaseReg:
1006 Result = getGlobalBaseReg();
1007 return;
Chris Lattner860e8862005-11-17 07:30:41 +00001008
Chris Lattnere28e40a2005-08-25 00:45:43 +00001009 case ISD::FrameIndex: {
1010 int FI = cast<FrameIndexSDNode>(N)->getIndex();
Evan Cheng34167212006-02-09 00:37:58 +00001011 if (N->hasOneUse()) {
1012 Result = CurDAG->SelectNodeTo(N, PPC::ADDI, MVT::i32,
1013 CurDAG->getTargetFrameIndex(FI, MVT::i32),
1014 getI32Imm(0));
1015 return;
1016 }
1017 Result = CodeGenMap[Op] =
Evan Cheng7e9b26f2006-02-09 07:17:49 +00001018 SDOperand(CurDAG->getTargetNode(PPC::ADDI, MVT::i32,
1019 CurDAG->getTargetFrameIndex(FI, MVT::i32),
1020 getI32Imm(0)), 0);
Evan Cheng34167212006-02-09 00:37:58 +00001021 return;
Chris Lattnere28e40a2005-08-25 00:45:43 +00001022 }
Chris Lattner6d92cad2006-03-26 10:06:40 +00001023
1024 case PPCISD::MFCR: {
1025 SDOperand InFlag;
1026 Select(InFlag, N->getOperand(1));
1027 // Use MFOCRF if supported.
1028 if (TLI.getTargetMachine().getSubtarget<PPCSubtarget>().isGigaProcessor())
1029 Result = SDOperand(CurDAG->getTargetNode(PPC::MFOCRF, MVT::i32,
1030 N->getOperand(0), InFlag), 0);
1031 else
1032 Result = SDOperand(CurDAG->getTargetNode(PPC::MFCR, MVT::i32, InFlag), 0);
1033 CodeGenMap[Op] = Result;
1034 return;
1035 }
1036
Chris Lattner88add102005-09-28 22:50:24 +00001037 case ISD::SDIV: {
Nate Begeman405e3ec2005-10-21 00:02:42 +00001038 // FIXME: since this depends on the setting of the carry flag from the srawi
1039 // we should really be making notes about that for the scheduler.
1040 // FIXME: It sure would be nice if we could cheaply recognize the
1041 // srl/add/sra pattern the dag combiner will generate for this as
1042 // sra/addze rather than having to handle sdiv ourselves. oh well.
Chris Lattner8784a232005-08-25 17:50:06 +00001043 unsigned Imm;
1044 if (isIntImmediate(N->getOperand(1), Imm)) {
Evan Cheng34167212006-02-09 00:37:58 +00001045 SDOperand N0;
1046 Select(N0, N->getOperand(0));
Chris Lattner8784a232005-08-25 17:50:06 +00001047 if ((signed)Imm > 0 && isPowerOf2_32(Imm)) {
Evan Cheng7e9b26f2006-02-09 07:17:49 +00001048 SDNode *Op =
Chris Lattner8784a232005-08-25 17:50:06 +00001049 CurDAG->getTargetNode(PPC::SRAWI, MVT::i32, MVT::Flag,
Evan Cheng34167212006-02-09 00:37:58 +00001050 N0, getI32Imm(Log2_32(Imm)));
1051 Result = CurDAG->SelectNodeTo(N, PPC::ADDZE, MVT::i32,
Evan Cheng7e9b26f2006-02-09 07:17:49 +00001052 SDOperand(Op, 0), SDOperand(Op, 1));
Chris Lattner8784a232005-08-25 17:50:06 +00001053 } else if ((signed)Imm < 0 && isPowerOf2_32(-Imm)) {
Evan Cheng7e9b26f2006-02-09 07:17:49 +00001054 SDNode *Op =
Chris Lattner2501d5e2005-08-30 17:13:58 +00001055 CurDAG->getTargetNode(PPC::SRAWI, MVT::i32, MVT::Flag,
Evan Cheng34167212006-02-09 00:37:58 +00001056 N0, getI32Imm(Log2_32(-Imm)));
Chris Lattner8784a232005-08-25 17:50:06 +00001057 SDOperand PT =
Evan Cheng7e9b26f2006-02-09 07:17:49 +00001058 SDOperand(CurDAG->getTargetNode(PPC::ADDZE, MVT::i32,
1059 SDOperand(Op, 0), SDOperand(Op, 1)),
1060 0);
Evan Cheng34167212006-02-09 00:37:58 +00001061 Result = CurDAG->SelectNodeTo(N, PPC::NEG, MVT::i32, PT);
Chris Lattner8784a232005-08-25 17:50:06 +00001062 }
Evan Cheng34167212006-02-09 00:37:58 +00001063 return;
Chris Lattner8784a232005-08-25 17:50:06 +00001064 }
Chris Lattner047b9522005-08-25 22:04:30 +00001065
Chris Lattner237733e2005-09-29 23:33:31 +00001066 // Other cases are autogenerated.
1067 break;
Chris Lattner047b9522005-08-25 22:04:30 +00001068 }
Nate Begemancffc32b2005-08-18 07:30:46 +00001069 case ISD::AND: {
Nate Begeman50fb3c42005-12-24 01:00:15 +00001070 unsigned Imm, Imm2;
Nate Begemancffc32b2005-08-18 07:30:46 +00001071 // If this is an and of a value rotated between 0 and 31 bits and then and'd
1072 // with a mask, emit rlwinm
1073 if (isIntImmediate(N->getOperand(1), Imm) && (isShiftedMask_32(Imm) ||
1074 isShiftedMask_32(~Imm))) {
1075 SDOperand Val;
Nate Begemana6940472005-08-18 18:01:39 +00001076 unsigned SH, MB, ME;
Nate Begemancffc32b2005-08-18 07:30:46 +00001077 if (isRotateAndMask(N->getOperand(0).Val, Imm, false, SH, MB, ME)) {
Evan Cheng34167212006-02-09 00:37:58 +00001078 Select(Val, N->getOperand(0).getOperand(0));
Chris Lattner3393e802005-10-25 19:32:37 +00001079 } else if (Imm == 0) {
1080 // AND X, 0 -> 0, not "rlwinm 32".
Evan Cheng34167212006-02-09 00:37:58 +00001081 Select(Result, N->getOperand(1));
1082 return ;
Chris Lattner3393e802005-10-25 19:32:37 +00001083 } else {
Evan Cheng34167212006-02-09 00:37:58 +00001084 Select(Val, N->getOperand(0));
Nate Begemancffc32b2005-08-18 07:30:46 +00001085 isRunOfOnes(Imm, MB, ME);
1086 SH = 0;
1087 }
Evan Cheng34167212006-02-09 00:37:58 +00001088 Result = CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Val,
1089 getI32Imm(SH), getI32Imm(MB),
1090 getI32Imm(ME));
1091 return;
Nate Begemancffc32b2005-08-18 07:30:46 +00001092 }
Nate Begeman50fb3c42005-12-24 01:00:15 +00001093 // ISD::OR doesn't get all the bitfield insertion fun.
1094 // (and (or x, c1), c2) where isRunOfOnes(~(c1^c2)) is a bitfield insert
1095 if (isIntImmediate(N->getOperand(1), Imm) &&
1096 N->getOperand(0).getOpcode() == ISD::OR &&
1097 isIntImmediate(N->getOperand(0).getOperand(1), Imm2)) {
Chris Lattnerc9a5ef52006-01-05 18:32:49 +00001098 unsigned MB, ME;
Nate Begeman50fb3c42005-12-24 01:00:15 +00001099 Imm = ~(Imm^Imm2);
1100 if (isRunOfOnes(Imm, MB, ME)) {
Evan Cheng34167212006-02-09 00:37:58 +00001101 SDOperand Tmp1, Tmp2;
1102 Select(Tmp1, N->getOperand(0).getOperand(0));
1103 Select(Tmp2, N->getOperand(0).getOperand(1));
Evan Cheng7e9b26f2006-02-09 07:17:49 +00001104 Result = SDOperand(CurDAG->getTargetNode(PPC::RLWIMI, MVT::i32,
1105 Tmp1, Tmp2,
1106 getI32Imm(0), getI32Imm(MB),
1107 getI32Imm(ME)), 0);
Evan Cheng34167212006-02-09 00:37:58 +00001108 return;
Nate Begeman50fb3c42005-12-24 01:00:15 +00001109 }
1110 }
Chris Lattner237733e2005-09-29 23:33:31 +00001111
1112 // Other cases are autogenerated.
1113 break;
Nate Begemancffc32b2005-08-18 07:30:46 +00001114 }
Nate Begeman02b88a42005-08-19 00:38:14 +00001115 case ISD::OR:
Evan Cheng34167212006-02-09 00:37:58 +00001116 if (SDNode *I = SelectBitfieldInsert(N)) {
1117 Result = CodeGenMap[Op] = SDOperand(I, 0);
1118 return;
1119 }
Chris Lattnerd3d2cf52005-09-29 00:59:32 +00001120
Chris Lattner237733e2005-09-29 23:33:31 +00001121 // Other cases are autogenerated.
1122 break;
Nate Begemanc15ed442005-08-18 23:38:00 +00001123 case ISD::SHL: {
1124 unsigned Imm, SH, MB, ME;
1125 if (isOpcWithIntImmediate(N->getOperand(0).Val, ISD::AND, Imm) &&
Nate Begeman2d5aff72005-10-19 18:42:01 +00001126 isRotateAndMask(N, Imm, true, SH, MB, ME)) {
Evan Cheng34167212006-02-09 00:37:58 +00001127 SDOperand Val;
1128 Select(Val, N->getOperand(0).getOperand(0));
1129 Result = CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32,
1130 Val, getI32Imm(SH), getI32Imm(MB),
1131 getI32Imm(ME));
1132 return;
Nate Begeman8d948322005-10-19 01:12:32 +00001133 }
Nate Begeman2d5aff72005-10-19 18:42:01 +00001134
1135 // Other cases are autogenerated.
1136 break;
Nate Begemanc15ed442005-08-18 23:38:00 +00001137 }
1138 case ISD::SRL: {
1139 unsigned Imm, SH, MB, ME;
1140 if (isOpcWithIntImmediate(N->getOperand(0).Val, ISD::AND, Imm) &&
Nate Begeman2d5aff72005-10-19 18:42:01 +00001141 isRotateAndMask(N, Imm, true, SH, MB, ME)) {
Evan Cheng34167212006-02-09 00:37:58 +00001142 SDOperand Val;
1143 Select(Val, N->getOperand(0).getOperand(0));
1144 Result = CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32,
1145 Val, getI32Imm(SH & 0x1F), getI32Imm(MB),
1146 getI32Imm(ME));
1147 return;
Nate Begeman8d948322005-10-19 01:12:32 +00001148 }
Nate Begeman2d5aff72005-10-19 18:42:01 +00001149
1150 // Other cases are autogenerated.
1151 break;
Nate Begemanc15ed442005-08-18 23:38:00 +00001152 }
Chris Lattner13794f52005-08-26 18:46:49 +00001153 case ISD::SELECT_CC: {
1154 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(4))->get();
1155
1156 // handle the setcc cases here. select_cc lhs, 0, 1, 0, cc
1157 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N->getOperand(1)))
1158 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N->getOperand(2)))
1159 if (ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N->getOperand(3)))
1160 if (N1C->isNullValue() && N3C->isNullValue() &&
1161 N2C->getValue() == 1ULL && CC == ISD::SETNE) {
Evan Cheng34167212006-02-09 00:37:58 +00001162 SDOperand LHS;
1163 Select(LHS, N->getOperand(0));
Evan Cheng7e9b26f2006-02-09 07:17:49 +00001164 SDNode *Tmp =
Chris Lattner13794f52005-08-26 18:46:49 +00001165 CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
1166 LHS, getI32Imm(~0U));
Evan Cheng7e9b26f2006-02-09 07:17:49 +00001167 Result = CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32,
1168 SDOperand(Tmp, 0), LHS,
1169 SDOperand(Tmp, 1));
Evan Cheng34167212006-02-09 00:37:58 +00001170 return;
Chris Lattner13794f52005-08-26 18:46:49 +00001171 }
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00001172
Chris Lattner50ff55c2005-09-01 19:20:44 +00001173 SDOperand CCReg = SelectCC(N->getOperand(0), N->getOperand(1), CC);
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00001174 unsigned BROpc = getBCCForSetCC(CC);
1175
1176 bool isFP = MVT::isFloatingPoint(N->getValueType(0));
Chris Lattner919c0322005-10-01 01:35:02 +00001177 unsigned SelectCCOp;
1178 if (MVT::isInteger(N->getValueType(0)))
1179 SelectCCOp = PPC::SELECT_CC_Int;
1180 else if (N->getValueType(0) == MVT::f32)
1181 SelectCCOp = PPC::SELECT_CC_F4;
Chris Lattner710ff322006-04-08 22:45:08 +00001182 else if (N->getValueType(0) == MVT::f64)
Chris Lattner919c0322005-10-01 01:35:02 +00001183 SelectCCOp = PPC::SELECT_CC_F8;
Chris Lattner710ff322006-04-08 22:45:08 +00001184 else
1185 SelectCCOp = PPC::SELECT_CC_VRRC;
1186
Evan Cheng34167212006-02-09 00:37:58 +00001187 SDOperand N2, N3;
1188 Select(N2, N->getOperand(2));
1189 Select(N3, N->getOperand(3));
1190 Result = CurDAG->SelectNodeTo(N, SelectCCOp, N->getValueType(0), CCReg,
1191 N2, N3, getI32Imm(BROpc));
1192 return;
Chris Lattner13794f52005-08-26 18:46:49 +00001193 }
Nate Begeman81e80972006-03-17 01:40:33 +00001194 case ISD::BR_CC: {
Evan Cheng34167212006-02-09 00:37:58 +00001195 SDOperand Chain;
1196 Select(Chain, N->getOperand(0));
Chris Lattner2fbb4572005-08-21 18:50:37 +00001197 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(1))->get();
1198 SDOperand CondCode = SelectCC(N->getOperand(2), N->getOperand(3), CC);
Nate Begeman81e80972006-03-17 01:40:33 +00001199 Result = CurDAG->SelectNodeTo(N, PPC::COND_BRANCH, MVT::Other,
1200 CondCode, getI32Imm(getBCCForSetCC(CC)),
1201 N->getOperand(4), Chain);
Evan Cheng34167212006-02-09 00:37:58 +00001202 return;
Chris Lattner2fbb4572005-08-21 18:50:37 +00001203 }
Nate Begeman37efe672006-04-22 18:53:45 +00001204 case ISD::BRIND: {
1205 SDOperand Chain, Target;
1206 Select(Chain, N->getOperand(0));
1207 Select(Target,N->getOperand(1));
1208 Chain = SDOperand(CurDAG->getTargetNode(PPC::MTCTR, MVT::Other, Target,
1209 Chain), 0);
1210 Result = CurDAG->SelectNodeTo(N, PPC::BCTR, MVT::Other, Chain);
1211 return;
1212 }
Chris Lattnera5a91b12005-08-17 19:33:03 +00001213 }
Chris Lattner25dae722005-09-03 00:53:47 +00001214
Evan Cheng34167212006-02-09 00:37:58 +00001215 SelectCode(Result, Op);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001216}
1217
1218
Nate Begeman1d9d7422005-10-18 00:28:58 +00001219/// createPPCISelDag - This pass converts a legalized DAG into a
Chris Lattnera5a91b12005-08-17 19:33:03 +00001220/// PowerPC-specific DAG, ready for instruction scheduling.
1221///
Evan Chengc4c62572006-03-13 23:20:37 +00001222FunctionPass *llvm::createPPCISelDag(PPCTargetMachine &TM) {
Nate Begeman1d9d7422005-10-18 00:28:58 +00001223 return new PPCDAGToDAGISel(TM);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001224}
1225