blob: 185afd1a6d7c351a97abeee13ddaccdf97ec6235 [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 Lattner4416f1a2005-08-19 22:38:53 +000018#include "llvm/CodeGen/MachineInstrBuilder.h"
19#include "llvm/CodeGen/MachineFunction.h"
20#include "llvm/CodeGen/SSARegMap.h"
Chris Lattnera5a91b12005-08-17 19:33:03 +000021#include "llvm/CodeGen/SelectionDAG.h"
22#include "llvm/CodeGen/SelectionDAGISel.h"
23#include "llvm/Target/TargetOptions.h"
24#include "llvm/ADT/Statistic.h"
Chris Lattner2fe76e52005-08-25 04:47:18 +000025#include "llvm/Constants.h"
Chris Lattner4416f1a2005-08-19 22:38:53 +000026#include "llvm/GlobalValue.h"
Chris Lattnera5a91b12005-08-17 19:33:03 +000027#include "llvm/Support/Debug.h"
28#include "llvm/Support/MathExtras.h"
Chris Lattner2c2c6c62006-01-22 23:41:00 +000029#include <iostream>
Evan Chengba2f0a92006-02-05 06:46:41 +000030#include <set>
Chris Lattnera5a91b12005-08-17 19:33:03 +000031using namespace llvm;
32
33namespace {
Chris Lattnera5a91b12005-08-17 19:33:03 +000034 Statistic<> FrameOff("ppc-codegen", "Number of frame idx offsets collapsed");
35
36 //===--------------------------------------------------------------------===//
Nate Begeman1d9d7422005-10-18 00:28:58 +000037 /// PPCDAGToDAGISel - PPC specific code to select PPC machine
Chris Lattnera5a91b12005-08-17 19:33:03 +000038 /// instructions for SelectionDAG operations.
39 ///
Nate Begeman1d9d7422005-10-18 00:28:58 +000040 class PPCDAGToDAGISel : public SelectionDAGISel {
Nate Begeman21e463b2005-10-16 05:39:50 +000041 PPCTargetLowering PPCLowering;
Chris Lattner4416f1a2005-08-19 22:38:53 +000042 unsigned GlobalBaseReg;
Chris Lattnera5a91b12005-08-17 19:33:03 +000043 public:
Nate Begeman1d9d7422005-10-18 00:28:58 +000044 PPCDAGToDAGISel(TargetMachine &TM)
Nate Begeman21e463b2005-10-16 05:39:50 +000045 : SelectionDAGISel(PPCLowering), PPCLowering(TM) {}
Chris Lattnera5a91b12005-08-17 19:33:03 +000046
Chris Lattner4416f1a2005-08-19 22:38:53 +000047 virtual bool runOnFunction(Function &Fn) {
48 // Make sure we re-emit a set of the global base reg if necessary
49 GlobalBaseReg = 0;
50 return SelectionDAGISel::runOnFunction(Fn);
51 }
52
Chris Lattnera5a91b12005-08-17 19:33:03 +000053 /// getI32Imm - Return a target constant with the specified value, of type
54 /// i32.
55 inline SDOperand getI32Imm(unsigned Imm) {
56 return CurDAG->getTargetConstant(Imm, MVT::i32);
57 }
Chris Lattner4416f1a2005-08-19 22:38:53 +000058
59 /// getGlobalBaseReg - insert code into the entry mbb to materialize the PIC
60 /// base register. Return the virtual register that holds this value.
Chris Lattner9944b762005-08-21 22:31:09 +000061 SDOperand getGlobalBaseReg();
Chris Lattnera5a91b12005-08-17 19:33:03 +000062
63 // Select - Convert the specified operand from a target-independent to a
64 // target-specific node if it hasn't already been changed.
Evan Cheng34167212006-02-09 00:37:58 +000065 void Select(SDOperand &Result, SDOperand Op);
Chris Lattnera5a91b12005-08-17 19:33:03 +000066
Nate Begeman02b88a42005-08-19 00:38:14 +000067 SDNode *SelectBitfieldInsert(SDNode *N);
68
Chris Lattner2fbb4572005-08-21 18:50:37 +000069 /// SelectCC - Select a comparison of the specified values with the
70 /// specified condition code, returning the CR# of the expression.
71 SDOperand SelectCC(SDOperand LHS, SDOperand RHS, ISD::CondCode CC);
72
Nate Begeman7fd1edd2005-12-19 23:25:09 +000073 /// SelectAddrImm - Returns true if the address N can be represented by
74 /// a base register plus a signed 16-bit displacement [r+imm].
75 bool SelectAddrImm(SDOperand N, SDOperand &Disp, SDOperand &Base);
76
77 /// SelectAddrIdx - Given the specified addressed, check to see if it can be
78 /// represented as an indexed [r+r] operation. Returns false if it can
79 /// be represented by [r+imm], which are preferred.
80 bool SelectAddrIdx(SDOperand N, SDOperand &Base, SDOperand &Index);
Nate Begemanf43a3ca2005-11-30 08:22:07 +000081
Nate Begeman7fd1edd2005-12-19 23:25:09 +000082 /// SelectAddrIdxOnly - Given the specified addressed, force it to be
83 /// represented as an indexed [r+r] operation.
84 bool SelectAddrIdxOnly(SDOperand N, SDOperand &Base, SDOperand &Index);
Chris Lattner9944b762005-08-21 22:31:09 +000085
Chris Lattnere5d88612006-02-24 02:13:12 +000086 /// SelectInlineAsmMemoryOperand - Implement addressing mode selection for
87 /// inline asm expressions.
88 virtual bool SelectInlineAsmMemoryOperand(const SDOperand &Op,
89 char ConstraintCode,
90 std::vector<SDOperand> &OutOps,
91 SelectionDAG &DAG) {
92 SDOperand Op0, Op1;
93 switch (ConstraintCode) {
94 default: return true;
95 case 'm': // memory
96 if (!SelectAddrIdx(Op, Op0, Op1))
97 SelectAddrImm(Op, Op0, Op1);
98 break;
99 case 'o': // offsetable
100 if (!SelectAddrImm(Op, Op0, Op1)) {
101 Select(Op0, Op); // r+0.
102 Op1 = getI32Imm(0);
103 }
104 break;
105 case 'v': // not offsetable
106 SelectAddrIdxOnly(Op, Op0, Op1);
107 break;
108 }
109
110 OutOps.push_back(Op0);
111 OutOps.push_back(Op1);
112 return false;
113 }
114
Chris Lattner047b9522005-08-25 22:04:30 +0000115 SDOperand BuildSDIVSequence(SDNode *N);
116 SDOperand BuildUDIVSequence(SDNode *N);
117
Chris Lattnera5a91b12005-08-17 19:33:03 +0000118 /// InstructionSelectBasicBlock - This callback is invoked by
119 /// SelectionDAGISel when it has created a SelectionDAG for us to codegen.
Chris Lattnerbd937b92005-10-06 18:45:51 +0000120 virtual void InstructionSelectBasicBlock(SelectionDAG &DAG);
121
Chris Lattnera5a91b12005-08-17 19:33:03 +0000122 virtual const char *getPassName() const {
123 return "PowerPC DAG->DAG Pattern Instruction Selection";
124 }
Chris Lattneraf165382005-09-13 22:03:06 +0000125
126// Include the pieces autogenerated from the target description.
Chris Lattner4c7b43b2005-10-14 23:37:35 +0000127#include "PPCGenDAGISel.inc"
Chris Lattnerbd937b92005-10-06 18:45:51 +0000128
129private:
Chris Lattner222adac2005-10-06 19:03:35 +0000130 SDOperand SelectADD_PARTS(SDOperand Op);
131 SDOperand SelectSUB_PARTS(SDOperand Op);
132 SDOperand SelectSETCC(SDOperand Op);
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000133 SDOperand SelectCALL(SDOperand Op);
Chris Lattnera5a91b12005-08-17 19:33:03 +0000134 };
135}
136
Chris Lattnerbd937b92005-10-06 18:45:51 +0000137/// InstructionSelectBasicBlock - This callback is invoked by
138/// SelectionDAGISel when it has created a SelectionDAG for us to codegen.
Nate Begeman1d9d7422005-10-18 00:28:58 +0000139void PPCDAGToDAGISel::InstructionSelectBasicBlock(SelectionDAG &DAG) {
Chris Lattnerbd937b92005-10-06 18:45:51 +0000140 DEBUG(BB->dump());
141
142 // The selection process is inherently a bottom-up recursive process (users
143 // select their uses before themselves). Given infinite stack space, we
144 // could just start selecting on the root and traverse the whole graph. In
145 // practice however, this causes us to run out of stack space on large basic
146 // blocks. To avoid this problem, select the entry node, then all its uses,
147 // iteratively instead of recursively.
148 std::vector<SDOperand> Worklist;
149 Worklist.push_back(DAG.getEntryNode());
150
151 // Note that we can do this in the PPC target (scanning forward across token
152 // chain edges) because no nodes ever get folded across these edges. On a
153 // target like X86 which supports load/modify/store operations, this would
154 // have to be more careful.
155 while (!Worklist.empty()) {
156 SDOperand Node = Worklist.back();
157 Worklist.pop_back();
158
Chris Lattnercf01a702005-10-07 22:10:27 +0000159 // Chose from the least deep of the top two nodes.
160 if (!Worklist.empty() &&
161 Worklist.back().Val->getNodeDepth() < Node.Val->getNodeDepth())
162 std::swap(Worklist.back(), Node);
163
Chris Lattnerbd937b92005-10-06 18:45:51 +0000164 if ((Node.Val->getOpcode() >= ISD::BUILTIN_OP_END &&
165 Node.Val->getOpcode() < PPCISD::FIRST_NUMBER) ||
166 CodeGenMap.count(Node)) continue;
167
168 for (SDNode::use_iterator UI = Node.Val->use_begin(),
169 E = Node.Val->use_end(); UI != E; ++UI) {
170 // Scan the values. If this use has a value that is a token chain, add it
171 // to the worklist.
172 SDNode *User = *UI;
173 for (unsigned i = 0, e = User->getNumValues(); i != e; ++i)
174 if (User->getValueType(i) == MVT::Other) {
175 Worklist.push_back(SDOperand(User, i));
176 break;
177 }
178 }
179
180 // Finally, legalize this node.
Evan Cheng34167212006-02-09 00:37:58 +0000181 SDOperand Dummy;
182 Select(Dummy, Node);
Chris Lattnerbd937b92005-10-06 18:45:51 +0000183 }
Chris Lattnercf01a702005-10-07 22:10:27 +0000184
Chris Lattnerbd937b92005-10-06 18:45:51 +0000185 // Select target instructions for the DAG.
Evan Chengba2f0a92006-02-05 06:46:41 +0000186 DAG.setRoot(SelectRoot(DAG.getRoot()));
Chris Lattnerbd937b92005-10-06 18:45:51 +0000187 CodeGenMap.clear();
188 DAG.RemoveDeadNodes();
189
190 // Emit machine code to BB.
191 ScheduleAndEmitDAG(DAG);
192}
Chris Lattner6cd40d52005-09-03 01:17:22 +0000193
Chris Lattner4416f1a2005-08-19 22:38:53 +0000194/// getGlobalBaseReg - Output the instructions required to put the
195/// base address to use for accessing globals into a register.
196///
Nate Begeman1d9d7422005-10-18 00:28:58 +0000197SDOperand PPCDAGToDAGISel::getGlobalBaseReg() {
Chris Lattner4416f1a2005-08-19 22:38:53 +0000198 if (!GlobalBaseReg) {
199 // Insert the set of GlobalBaseReg into the first MBB of the function
200 MachineBasicBlock &FirstMBB = BB->getParent()->front();
201 MachineBasicBlock::iterator MBBI = FirstMBB.begin();
202 SSARegMap *RegMap = BB->getParent()->getSSARegMap();
Nate Begeman1d9d7422005-10-18 00:28:58 +0000203 // FIXME: when we get to LP64, we will need to create the appropriate
204 // type of register here.
205 GlobalBaseReg = RegMap->createVirtualRegister(PPC::GPRCRegisterClass);
Chris Lattner4416f1a2005-08-19 22:38:53 +0000206 BuildMI(FirstMBB, MBBI, PPC::MovePCtoLR, 0, PPC::LR);
207 BuildMI(FirstMBB, MBBI, PPC::MFLR, 1, GlobalBaseReg);
208 }
Chris Lattner9944b762005-08-21 22:31:09 +0000209 return CurDAG->getRegister(GlobalBaseReg, MVT::i32);
Chris Lattner4416f1a2005-08-19 22:38:53 +0000210}
211
212
Nate Begeman0f3257a2005-08-18 05:00:13 +0000213// isIntImmediate - This method tests to see if a constant operand.
214// If so Imm will receive the 32 bit value.
215static bool isIntImmediate(SDNode *N, unsigned& Imm) {
216 if (N->getOpcode() == ISD::Constant) {
217 Imm = cast<ConstantSDNode>(N)->getValue();
218 return true;
219 }
220 return false;
221}
222
Nate Begemancffc32b2005-08-18 07:30:46 +0000223// isRunOfOnes - Returns true iff Val consists of one contiguous run of 1s with
224// any number of 0s on either side. The 1s are allowed to wrap from LSB to
225// MSB, so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is
226// not, since all 1s are not contiguous.
227static bool isRunOfOnes(unsigned Val, unsigned &MB, unsigned &ME) {
228 if (isShiftedMask_32(Val)) {
229 // look for the first non-zero bit
230 MB = CountLeadingZeros_32(Val);
231 // look for the first zero bit after the run of ones
232 ME = CountLeadingZeros_32((Val - 1) ^ Val);
233 return true;
Chris Lattner2fe76e52005-08-25 04:47:18 +0000234 } else {
235 Val = ~Val; // invert mask
236 if (isShiftedMask_32(Val)) {
237 // effectively look for the first zero bit
238 ME = CountLeadingZeros_32(Val) - 1;
239 // effectively look for the first one bit after the run of zeros
240 MB = CountLeadingZeros_32((Val - 1) ^ Val) + 1;
241 return true;
242 }
Nate Begemancffc32b2005-08-18 07:30:46 +0000243 }
244 // no run present
245 return false;
246}
247
Chris Lattner65a419a2005-10-09 05:36:17 +0000248// isRotateAndMask - Returns true if Mask and Shift can be folded into a rotate
Nate Begemancffc32b2005-08-18 07:30:46 +0000249// and mask opcode and mask operation.
250static bool isRotateAndMask(SDNode *N, unsigned Mask, bool IsShiftMask,
251 unsigned &SH, unsigned &MB, unsigned &ME) {
Nate Begemanda32c9e2005-10-19 00:05:37 +0000252 // Don't even go down this path for i64, since different logic will be
253 // necessary for rldicl/rldicr/rldimi.
254 if (N->getValueType(0) != MVT::i32)
255 return false;
256
Nate Begemancffc32b2005-08-18 07:30:46 +0000257 unsigned Shift = 32;
258 unsigned Indeterminant = ~0; // bit mask marking indeterminant results
259 unsigned Opcode = N->getOpcode();
Chris Lattner15055732005-08-30 00:59:16 +0000260 if (N->getNumOperands() != 2 ||
261 !isIntImmediate(N->getOperand(1).Val, Shift) || (Shift > 31))
Nate Begemancffc32b2005-08-18 07:30:46 +0000262 return false;
263
264 if (Opcode == ISD::SHL) {
265 // apply shift left to mask if it comes first
266 if (IsShiftMask) Mask = Mask << Shift;
267 // determine which bits are made indeterminant by shift
268 Indeterminant = ~(0xFFFFFFFFu << Shift);
Chris Lattner651dea72005-10-15 21:40:12 +0000269 } else if (Opcode == ISD::SRL) {
Nate Begemancffc32b2005-08-18 07:30:46 +0000270 // apply shift right to mask if it comes first
271 if (IsShiftMask) Mask = Mask >> Shift;
272 // determine which bits are made indeterminant by shift
273 Indeterminant = ~(0xFFFFFFFFu >> Shift);
274 // adjust for the left rotate
275 Shift = 32 - Shift;
276 } else {
277 return false;
278 }
279
280 // if the mask doesn't intersect any Indeterminant bits
281 if (Mask && !(Mask & Indeterminant)) {
282 SH = Shift;
283 // make sure the mask is still a mask (wrap arounds may not be)
284 return isRunOfOnes(Mask, MB, ME);
285 }
286 return false;
287}
288
Nate Begeman0f3257a2005-08-18 05:00:13 +0000289// isOpcWithIntImmediate - This method tests to see if the node is a specific
290// opcode and that it has a immediate integer right operand.
291// If so Imm will receive the 32 bit value.
292static bool isOpcWithIntImmediate(SDNode *N, unsigned Opc, unsigned& Imm) {
293 return N->getOpcode() == Opc && isIntImmediate(N->getOperand(1).Val, Imm);
294}
295
Chris Lattnera5a91b12005-08-17 19:33:03 +0000296// isIntImmediate - This method tests to see if a constant operand.
297// If so Imm will receive the 32 bit value.
298static bool isIntImmediate(SDOperand N, unsigned& Imm) {
299 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N)) {
300 Imm = (unsigned)CN->getSignExtended();
301 return true;
302 }
303 return false;
304}
305
Nate Begeman02b88a42005-08-19 00:38:14 +0000306/// SelectBitfieldInsert - turn an or of two masked values into
307/// the rotate left word immediate then mask insert (rlwimi) instruction.
308/// Returns true on success, false if the caller still needs to select OR.
309///
310/// Patterns matched:
311/// 1. or shl, and 5. or and, and
312/// 2. or and, shl 6. or shl, shr
313/// 3. or shr, and 7. or shr, shl
314/// 4. or and, shr
Nate Begeman1d9d7422005-10-18 00:28:58 +0000315SDNode *PPCDAGToDAGISel::SelectBitfieldInsert(SDNode *N) {
Nate Begeman02b88a42005-08-19 00:38:14 +0000316 bool IsRotate = false;
317 unsigned TgtMask = 0xFFFFFFFF, InsMask = 0xFFFFFFFF, SH = 0;
318 unsigned Value;
319
320 SDOperand Op0 = N->getOperand(0);
321 SDOperand Op1 = N->getOperand(1);
322
323 unsigned Op0Opc = Op0.getOpcode();
324 unsigned Op1Opc = Op1.getOpcode();
325
326 // Verify that we have the correct opcodes
327 if (ISD::SHL != Op0Opc && ISD::SRL != Op0Opc && ISD::AND != Op0Opc)
328 return false;
329 if (ISD::SHL != Op1Opc && ISD::SRL != Op1Opc && ISD::AND != Op1Opc)
330 return false;
331
332 // Generate Mask value for Target
333 if (isIntImmediate(Op0.getOperand(1), Value)) {
334 switch(Op0Opc) {
Chris Lattner13687212005-08-30 18:37:48 +0000335 case ISD::SHL: TgtMask <<= Value; break;
336 case ISD::SRL: TgtMask >>= Value; break;
337 case ISD::AND: TgtMask &= Value; break;
Nate Begeman02b88a42005-08-19 00:38:14 +0000338 }
339 } else {
340 return 0;
341 }
342
343 // Generate Mask value for Insert
Chris Lattner13687212005-08-30 18:37:48 +0000344 if (!isIntImmediate(Op1.getOperand(1), Value))
Nate Begeman02b88a42005-08-19 00:38:14 +0000345 return 0;
Chris Lattner13687212005-08-30 18:37:48 +0000346
347 switch(Op1Opc) {
348 case ISD::SHL:
349 SH = Value;
350 InsMask <<= SH;
351 if (Op0Opc == ISD::SRL) IsRotate = true;
352 break;
353 case ISD::SRL:
354 SH = Value;
355 InsMask >>= SH;
356 SH = 32-SH;
357 if (Op0Opc == ISD::SHL) IsRotate = true;
358 break;
359 case ISD::AND:
360 InsMask &= Value;
361 break;
Nate Begeman02b88a42005-08-19 00:38:14 +0000362 }
363
364 // If both of the inputs are ANDs and one of them has a logical shift by
365 // constant as its input, make that AND the inserted value so that we can
366 // combine the shift into the rotate part of the rlwimi instruction
367 bool IsAndWithShiftOp = false;
368 if (Op0Opc == ISD::AND && Op1Opc == ISD::AND) {
369 if (Op1.getOperand(0).getOpcode() == ISD::SHL ||
370 Op1.getOperand(0).getOpcode() == ISD::SRL) {
371 if (isIntImmediate(Op1.getOperand(0).getOperand(1), Value)) {
372 SH = Op1.getOperand(0).getOpcode() == ISD::SHL ? Value : 32 - Value;
373 IsAndWithShiftOp = true;
374 }
375 } else if (Op0.getOperand(0).getOpcode() == ISD::SHL ||
376 Op0.getOperand(0).getOpcode() == ISD::SRL) {
377 if (isIntImmediate(Op0.getOperand(0).getOperand(1), Value)) {
378 std::swap(Op0, Op1);
379 std::swap(TgtMask, InsMask);
380 SH = Op1.getOperand(0).getOpcode() == ISD::SHL ? Value : 32 - Value;
381 IsAndWithShiftOp = true;
382 }
383 }
384 }
385
386 // Verify that the Target mask and Insert mask together form a full word mask
387 // and that the Insert mask is a run of set bits (which implies both are runs
388 // of set bits). Given that, Select the arguments and generate the rlwimi
389 // instruction.
390 unsigned MB, ME;
391 if (((TgtMask & InsMask) == 0) && isRunOfOnes(InsMask, MB, ME)) {
392 bool fullMask = (TgtMask ^ InsMask) == 0xFFFFFFFF;
393 bool Op0IsAND = Op0Opc == ISD::AND;
394 // Check for rotlwi / rotrwi here, a special case of bitfield insert
395 // where both bitfield halves are sourced from the same value.
396 if (IsRotate && fullMask &&
397 N->getOperand(0).getOperand(0) == N->getOperand(1).getOperand(0)) {
Evan Cheng34167212006-02-09 00:37:58 +0000398 SDOperand Tmp;
399 Select(Tmp, N->getOperand(0).getOperand(0));
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000400 return CurDAG->getTargetNode(PPC::RLWINM, MVT::i32, Tmp,
401 getI32Imm(SH), getI32Imm(0), getI32Imm(31));
Nate Begeman02b88a42005-08-19 00:38:14 +0000402 }
Evan Cheng34167212006-02-09 00:37:58 +0000403 SDOperand Tmp1, Tmp2;
404 Select(Tmp1, ((Op0IsAND && fullMask) ? Op0.getOperand(0) : Op0));
405 Select(Tmp2, (IsAndWithShiftOp ? Op1.getOperand(0).getOperand(0)
406 : Op1.getOperand(0)));
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000407 return CurDAG->getTargetNode(PPC::RLWIMI, MVT::i32, Tmp1, Tmp2,
408 getI32Imm(SH), getI32Imm(MB), getI32Imm(ME));
Nate Begeman02b88a42005-08-19 00:38:14 +0000409 }
410 return 0;
411}
412
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000413/// SelectAddrImm - Returns true if the address N can be represented by
414/// a base register plus a signed 16-bit displacement [r+imm].
415bool PPCDAGToDAGISel::SelectAddrImm(SDOperand N, SDOperand &Disp,
416 SDOperand &Base) {
Chris Lattner0f6ab6f2006-03-01 07:14:48 +0000417 // If this can be more profitably realized as r+r, fail.
418 if (SelectAddrIdx(N, Disp, Base))
419 return false;
420
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000421 if (N.getOpcode() == ISD::ADD) {
422 unsigned imm = 0;
423 if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm)) {
Chris Lattner17e82d22006-01-12 01:54:15 +0000424 Disp = getI32Imm(imm & 0xFFFF);
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000425 if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(N.getOperand(0))) {
426 Base = CurDAG->getTargetFrameIndex(FI->getIndex(), MVT::i32);
Chris Lattner9944b762005-08-21 22:31:09 +0000427 } else {
Evan Cheng7564e0b2006-02-05 08:45:01 +0000428 Base = N.getOperand(0);
Chris Lattner9944b762005-08-21 22:31:09 +0000429 }
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000430 return true; // [r+i]
431 } else if (N.getOperand(1).getOpcode() == PPCISD::Lo) {
Chris Lattner4f0f86d2005-11-17 18:02:16 +0000432 // Match LOAD (ADD (X, Lo(G))).
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000433 assert(!cast<ConstantSDNode>(N.getOperand(1).getOperand(1))->getValue()
Chris Lattner4f0f86d2005-11-17 18:02:16 +0000434 && "Cannot handle constant offsets yet!");
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000435 Disp = N.getOperand(1).getOperand(0); // The global address.
436 assert(Disp.getOpcode() == ISD::TargetGlobalAddress ||
437 Disp.getOpcode() == ISD::TargetConstantPool);
Evan Cheng7564e0b2006-02-05 08:45:01 +0000438 Base = N.getOperand(0);
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000439 return true; // [&g+r]
Chris Lattner9944b762005-08-21 22:31:09 +0000440 }
Chris Lattner0f6ab6f2006-03-01 07:14:48 +0000441 } else if (N.getOpcode() == ISD::OR) {
442 unsigned imm = 0;
443 if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm)) {
444 // If this is an or of disjoint bitfields, we can codegen this as an add
445 // (for better address arithmetic) if the LHS and RHS of the OR are
446 // provably disjoint.
447 uint64_t LHSKnownZero, LHSKnownOne;
448 PPCLowering.ComputeMaskedBits(N.getOperand(0), ~0U,
449 LHSKnownZero, LHSKnownOne);
450 if ((LHSKnownZero|~imm) == ~0U) {
451 // If all of the bits are known zero on the LHS or RHS, the add won't
452 // carry.
453 Base = N.getOperand(0);
454 Disp = getI32Imm(imm & 0xFFFF);
455 return true;
456 }
457 }
Chris Lattner9944b762005-08-21 22:31:09 +0000458 }
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000459 Disp = getI32Imm(0);
460 if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(N))
461 Base = CurDAG->getTargetFrameIndex(FI->getIndex(), MVT::i32);
Nate Begeman28a6b022005-12-10 02:36:00 +0000462 else
Evan Cheng7564e0b2006-02-05 08:45:01 +0000463 Base = N;
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000464 return true; // [r+0]
Chris Lattner9944b762005-08-21 22:31:09 +0000465}
Chris Lattnera5a91b12005-08-17 19:33:03 +0000466
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000467/// SelectAddrIdx - Given the specified addressed, check to see if it can be
468/// represented as an indexed [r+r] operation. Returns false if it can
469/// be represented by [r+imm], which are preferred.
470bool PPCDAGToDAGISel::SelectAddrIdx(SDOperand N, SDOperand &Base,
471 SDOperand &Index) {
Chris Lattner0f6ab6f2006-03-01 07:14:48 +0000472 unsigned imm = 0;
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000473 if (N.getOpcode() == ISD::ADD) {
Chris Lattner0f6ab6f2006-03-01 07:14:48 +0000474 if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm))
475 return false; // r+i
476 if (N.getOperand(1).getOpcode() == PPCISD::Lo)
477 return false; // r+i
478
Evan Cheng7564e0b2006-02-05 08:45:01 +0000479 Base = N.getOperand(0);
480 Index = N.getOperand(1);
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000481 return true;
Chris Lattner0f6ab6f2006-03-01 07:14:48 +0000482 } else if (N.getOpcode() == ISD::OR) {
483 if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm))
484 return false; // r+i can fold it if we can.
485
486 // If this is an or of disjoint bitfields, we can codegen this as an add
487 // (for better address arithmetic) if the LHS and RHS of the OR are provably
488 // disjoint.
489 uint64_t LHSKnownZero, LHSKnownOne;
490 uint64_t RHSKnownZero, RHSKnownOne;
491 PPCLowering.ComputeMaskedBits(N.getOperand(0), ~0U,
492 LHSKnownZero, LHSKnownOne);
493
494 if (LHSKnownZero) {
495 PPCLowering.ComputeMaskedBits(N.getOperand(1), ~0U,
496 RHSKnownZero, RHSKnownOne);
497 // If all of the bits are known zero on the LHS or RHS, the add won't
498 // carry.
499 if ((LHSKnownZero | RHSKnownZero) == ~0U) {
500 Base = N.getOperand(0);
501 Index = N.getOperand(1);
502 return true;
503 }
504 }
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000505 }
Chris Lattner0f6ab6f2006-03-01 07:14:48 +0000506
507 return false;
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000508}
509
510/// SelectAddrIdxOnly - Given the specified addressed, force it to be
511/// represented as an indexed [r+r] operation.
512bool PPCDAGToDAGISel::SelectAddrIdxOnly(SDOperand N, SDOperand &Base,
513 SDOperand &Index) {
Chris Lattner0f6ab6f2006-03-01 07:14:48 +0000514 // Check to see if we can easily represent this as an [r+r] address. This
515 // will fail if it thinks that the address is more profitably represented as
516 // reg+imm, e.g. where imm = 0.
517 if (!SelectAddrIdx(N, Base, Index)) {
518 // Nope, do it the hard way.
519 Base = CurDAG->getRegister(PPC::R0, MVT::i32);
520 Index = N;
Nate Begemanf43a3ca2005-11-30 08:22:07 +0000521 }
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000522 return true;
Nate Begemanf43a3ca2005-11-30 08:22:07 +0000523}
524
Chris Lattner2fbb4572005-08-21 18:50:37 +0000525/// SelectCC - Select a comparison of the specified values with the specified
526/// condition code, returning the CR# of the expression.
Nate Begeman1d9d7422005-10-18 00:28:58 +0000527SDOperand PPCDAGToDAGISel::SelectCC(SDOperand LHS, SDOperand RHS,
528 ISD::CondCode CC) {
Chris Lattner2fbb4572005-08-21 18:50:37 +0000529 // Always select the LHS.
Evan Cheng34167212006-02-09 00:37:58 +0000530 Select(LHS, LHS);
Chris Lattner2fbb4572005-08-21 18:50:37 +0000531
532 // Use U to determine whether the SETCC immediate range is signed or not.
533 if (MVT::isInteger(LHS.getValueType())) {
534 bool U = ISD::isUnsignedIntSetCC(CC);
535 unsigned Imm;
536 if (isIntImmediate(RHS, Imm) &&
537 ((U && isUInt16(Imm)) || (!U && isInt16(Imm))))
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000538 return SDOperand(CurDAG->getTargetNode(U ? PPC::CMPLWI : PPC::CMPWI,
539 MVT::i32, LHS, getI32Imm(Imm & 0xFFFF)), 0);
Evan Cheng34167212006-02-09 00:37:58 +0000540 Select(RHS, RHS);
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000541 return SDOperand(CurDAG->getTargetNode(U ? PPC::CMPLW : PPC::CMPW, MVT::i32,
542 LHS, RHS), 0);
Chris Lattner919c0322005-10-01 01:35:02 +0000543 } else if (LHS.getValueType() == MVT::f32) {
Evan Cheng34167212006-02-09 00:37:58 +0000544 Select(RHS, RHS);
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000545 return SDOperand(CurDAG->getTargetNode(PPC::FCMPUS, MVT::i32, LHS, RHS), 0);
Chris Lattner2fbb4572005-08-21 18:50:37 +0000546 } else {
Evan Cheng34167212006-02-09 00:37:58 +0000547 Select(RHS, RHS);
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000548 return SDOperand(CurDAG->getTargetNode(PPC::FCMPUD, MVT::i32, LHS, RHS), 0);
Chris Lattner2fbb4572005-08-21 18:50:37 +0000549 }
550}
551
552/// getBCCForSetCC - Returns the PowerPC condition branch mnemonic corresponding
553/// to Condition.
554static unsigned getBCCForSetCC(ISD::CondCode CC) {
555 switch (CC) {
556 default: assert(0 && "Unknown condition!"); abort();
Chris Lattnered048c02005-10-28 20:49:47 +0000557 case ISD::SETOEQ: // FIXME: This is incorrect see PR642.
Chris Lattner2fbb4572005-08-21 18:50:37 +0000558 case ISD::SETEQ: return PPC::BEQ;
Chris Lattnered048c02005-10-28 20:49:47 +0000559 case ISD::SETONE: // FIXME: This is incorrect see PR642.
Chris Lattner2fbb4572005-08-21 18:50:37 +0000560 case ISD::SETNE: return PPC::BNE;
Chris Lattnered048c02005-10-28 20:49:47 +0000561 case ISD::SETOLT: // FIXME: This is incorrect see PR642.
Chris Lattner2fbb4572005-08-21 18:50:37 +0000562 case ISD::SETULT:
563 case ISD::SETLT: return PPC::BLT;
Chris Lattnered048c02005-10-28 20:49:47 +0000564 case ISD::SETOLE: // FIXME: This is incorrect see PR642.
Chris Lattner2fbb4572005-08-21 18:50:37 +0000565 case ISD::SETULE:
566 case ISD::SETLE: return PPC::BLE;
Chris Lattnered048c02005-10-28 20:49:47 +0000567 case ISD::SETOGT: // FIXME: This is incorrect see PR642.
Chris Lattner2fbb4572005-08-21 18:50:37 +0000568 case ISD::SETUGT:
569 case ISD::SETGT: return PPC::BGT;
Chris Lattnered048c02005-10-28 20:49:47 +0000570 case ISD::SETOGE: // FIXME: This is incorrect see PR642.
Chris Lattner2fbb4572005-08-21 18:50:37 +0000571 case ISD::SETUGE:
572 case ISD::SETGE: return PPC::BGE;
Chris Lattner6df25072005-10-28 20:32:44 +0000573
574 case ISD::SETO: return PPC::BUN;
575 case ISD::SETUO: return PPC::BNU;
Chris Lattner2fbb4572005-08-21 18:50:37 +0000576 }
577 return 0;
578}
579
Chris Lattner64906a02005-08-25 20:08:18 +0000580/// getCRIdxForSetCC - Return the index of the condition register field
581/// associated with the SetCC condition, and whether or not the field is
582/// treated as inverted. That is, lt = 0; ge = 0 inverted.
583static unsigned getCRIdxForSetCC(ISD::CondCode CC, bool& Inv) {
584 switch (CC) {
585 default: assert(0 && "Unknown condition!"); abort();
Chris Lattnered048c02005-10-28 20:49:47 +0000586 case ISD::SETOLT: // FIXME: This is incorrect see PR642.
Chris Lattner64906a02005-08-25 20:08:18 +0000587 case ISD::SETULT:
588 case ISD::SETLT: Inv = false; return 0;
Chris Lattnered048c02005-10-28 20:49:47 +0000589 case ISD::SETOGE: // FIXME: This is incorrect see PR642.
Chris Lattner64906a02005-08-25 20:08:18 +0000590 case ISD::SETUGE:
591 case ISD::SETGE: Inv = true; return 0;
Chris Lattnered048c02005-10-28 20:49:47 +0000592 case ISD::SETOGT: // FIXME: This is incorrect see PR642.
Chris Lattner64906a02005-08-25 20:08:18 +0000593 case ISD::SETUGT:
594 case ISD::SETGT: Inv = false; return 1;
Chris Lattnered048c02005-10-28 20:49:47 +0000595 case ISD::SETOLE: // FIXME: This is incorrect see PR642.
Chris Lattner64906a02005-08-25 20:08:18 +0000596 case ISD::SETULE:
597 case ISD::SETLE: Inv = true; return 1;
Chris Lattnered048c02005-10-28 20:49:47 +0000598 case ISD::SETOEQ: // FIXME: This is incorrect see PR642.
Chris Lattner64906a02005-08-25 20:08:18 +0000599 case ISD::SETEQ: Inv = false; return 2;
Chris Lattnered048c02005-10-28 20:49:47 +0000600 case ISD::SETONE: // FIXME: This is incorrect see PR642.
Chris Lattner64906a02005-08-25 20:08:18 +0000601 case ISD::SETNE: Inv = true; return 2;
Chris Lattner6df25072005-10-28 20:32:44 +0000602 case ISD::SETO: Inv = true; return 3;
603 case ISD::SETUO: Inv = false; return 3;
Chris Lattner64906a02005-08-25 20:08:18 +0000604 }
605 return 0;
606}
Chris Lattner9944b762005-08-21 22:31:09 +0000607
Nate Begeman1d9d7422005-10-18 00:28:58 +0000608SDOperand PPCDAGToDAGISel::SelectSETCC(SDOperand Op) {
Chris Lattner222adac2005-10-06 19:03:35 +0000609 SDNode *N = Op.Val;
610 unsigned Imm;
611 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(2))->get();
612 if (isIntImmediate(N->getOperand(1), Imm)) {
613 // We can codegen setcc op, imm very efficiently compared to a brcond.
614 // Check for those cases here.
615 // setcc op, 0
616 if (Imm == 0) {
Evan Cheng34167212006-02-09 00:37:58 +0000617 SDOperand Op;
618 Select(Op, N->getOperand(0));
Chris Lattner222adac2005-10-06 19:03:35 +0000619 switch (CC) {
Chris Lattnerdabb8292005-10-21 21:17:10 +0000620 default: break;
621 case ISD::SETEQ:
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000622 Op = SDOperand(CurDAG->getTargetNode(PPC::CNTLZW, MVT::i32, Op), 0);
Chris Lattner71d3d502005-11-30 22:53:06 +0000623 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Op, getI32Imm(27),
624 getI32Imm(5), getI32Imm(31));
Chris Lattnerdabb8292005-10-21 21:17:10 +0000625 case ISD::SETNE: {
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000626 SDOperand AD =
627 SDOperand(CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
628 Op, getI32Imm(~0U)), 0);
Chris Lattner71d3d502005-11-30 22:53:06 +0000629 return CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, AD, Op,
630 AD.getValue(1));
Chris Lattner222adac2005-10-06 19:03:35 +0000631 }
Chris Lattnerdabb8292005-10-21 21:17:10 +0000632 case ISD::SETLT:
Chris Lattner71d3d502005-11-30 22:53:06 +0000633 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Op, getI32Imm(1),
634 getI32Imm(31), getI32Imm(31));
Chris Lattnerdabb8292005-10-21 21:17:10 +0000635 case ISD::SETGT: {
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000636 SDOperand T =
637 SDOperand(CurDAG->getTargetNode(PPC::NEG, MVT::i32, Op), 0);
638 T = SDOperand(CurDAG->getTargetNode(PPC::ANDC, MVT::i32, T, Op), 0);
Chris Lattner71d3d502005-11-30 22:53:06 +0000639 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, T, getI32Imm(1),
640 getI32Imm(31), getI32Imm(31));
Chris Lattnerdabb8292005-10-21 21:17:10 +0000641 }
642 }
Chris Lattner222adac2005-10-06 19:03:35 +0000643 } else if (Imm == ~0U) { // setcc op, -1
Evan Cheng34167212006-02-09 00:37:58 +0000644 SDOperand Op;
645 Select(Op, N->getOperand(0));
Chris Lattner222adac2005-10-06 19:03:35 +0000646 switch (CC) {
Chris Lattnerdabb8292005-10-21 21:17:10 +0000647 default: break;
648 case ISD::SETEQ:
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000649 Op = SDOperand(CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
650 Op, getI32Imm(1)), 0);
Chris Lattner71d3d502005-11-30 22:53:06 +0000651 return CurDAG->SelectNodeTo(N, PPC::ADDZE, MVT::i32,
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000652 SDOperand(CurDAG->getTargetNode(PPC::LI, MVT::i32,
653 getI32Imm(0)), 0),
Chris Lattner71d3d502005-11-30 22:53:06 +0000654 Op.getValue(1));
Chris Lattnerdabb8292005-10-21 21:17:10 +0000655 case ISD::SETNE: {
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000656 Op = SDOperand(CurDAG->getTargetNode(PPC::NOR, MVT::i32, Op, Op), 0);
657 SDNode *AD = CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
658 Op, getI32Imm(~0U));
659 return CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, SDOperand(AD, 0), Op,
660 SDOperand(AD, 1));
Chris Lattner222adac2005-10-06 19:03:35 +0000661 }
Chris Lattnerdabb8292005-10-21 21:17:10 +0000662 case ISD::SETLT: {
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000663 SDOperand AD = SDOperand(CurDAG->getTargetNode(PPC::ADDI, MVT::i32, Op,
664 getI32Imm(1)), 0);
665 SDOperand AN = SDOperand(CurDAG->getTargetNode(PPC::AND, MVT::i32, AD,
666 Op), 0);
Chris Lattner71d3d502005-11-30 22:53:06 +0000667 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, AN, getI32Imm(1),
668 getI32Imm(31), getI32Imm(31));
Chris Lattnerdabb8292005-10-21 21:17:10 +0000669 }
670 case ISD::SETGT:
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000671 Op = SDOperand(CurDAG->getTargetNode(PPC::RLWINM, MVT::i32, Op,
672 getI32Imm(1), getI32Imm(31),
673 getI32Imm(31)), 0);
Chris Lattner71d3d502005-11-30 22:53:06 +0000674 return CurDAG->SelectNodeTo(N, PPC::XORI, MVT::i32, Op, getI32Imm(1));
Chris Lattnerdabb8292005-10-21 21:17:10 +0000675 }
Chris Lattner222adac2005-10-06 19:03:35 +0000676 }
677 }
678
679 bool Inv;
680 unsigned Idx = getCRIdxForSetCC(CC, Inv);
681 SDOperand CCReg = SelectCC(N->getOperand(0), N->getOperand(1), CC);
682 SDOperand IntCR;
683
684 // Force the ccreg into CR7.
685 SDOperand CR7Reg = CurDAG->getRegister(PPC::CR7, MVT::i32);
686
Chris Lattner85961d52005-12-06 20:56:18 +0000687 SDOperand InFlag(0, 0); // Null incoming flag value.
Chris Lattnerdb1cb2b2005-12-01 03:50:19 +0000688 CCReg = CurDAG->getCopyToReg(CurDAG->getEntryNode(), CR7Reg, CCReg,
689 InFlag).getValue(1);
Chris Lattner222adac2005-10-06 19:03:35 +0000690
691 if (TLI.getTargetMachine().getSubtarget<PPCSubtarget>().isGigaProcessor())
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000692 IntCR = SDOperand(CurDAG->getTargetNode(PPC::MFOCRF, MVT::i32, CR7Reg,
693 CCReg), 0);
Chris Lattner222adac2005-10-06 19:03:35 +0000694 else
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000695 IntCR = SDOperand(CurDAG->getTargetNode(PPC::MFCR, MVT::i32, CCReg), 0);
Chris Lattner222adac2005-10-06 19:03:35 +0000696
697 if (!Inv) {
Chris Lattner71d3d502005-11-30 22:53:06 +0000698 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, IntCR,
699 getI32Imm((32-(3-Idx)) & 31),
700 getI32Imm(31), getI32Imm(31));
Chris Lattner222adac2005-10-06 19:03:35 +0000701 } else {
702 SDOperand Tmp =
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000703 SDOperand(CurDAG->getTargetNode(PPC::RLWINM, MVT::i32, IntCR,
704 getI32Imm((32-(3-Idx)) & 31),
705 getI32Imm(31),getI32Imm(31)), 0);
Chris Lattner71d3d502005-11-30 22:53:06 +0000706 return CurDAG->SelectNodeTo(N, PPC::XORI, MVT::i32, Tmp, getI32Imm(1));
Chris Lattner222adac2005-10-06 19:03:35 +0000707 }
Chris Lattner222adac2005-10-06 19:03:35 +0000708}
Chris Lattner2b63e4c2005-10-06 18:56:10 +0000709
Nate Begeman422b0ce2005-11-16 00:48:01 +0000710/// isCallCompatibleAddress - Return true if the specified 32-bit value is
711/// representable in the immediate field of a Bx instruction.
712static bool isCallCompatibleAddress(ConstantSDNode *C) {
713 int Addr = C->getValue();
714 if (Addr & 3) return false; // Low 2 bits are implicitly zero.
715 return (Addr << 6 >> 6) == Addr; // Top 6 bits have to be sext of immediate.
716}
717
Nate Begeman1d9d7422005-10-18 00:28:58 +0000718SDOperand PPCDAGToDAGISel::SelectCALL(SDOperand Op) {
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000719 SDNode *N = Op.Val;
Evan Cheng34167212006-02-09 00:37:58 +0000720 SDOperand Chain;
721 Select(Chain, N->getOperand(0));
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000722
723 unsigned CallOpcode;
724 std::vector<SDOperand> CallOperands;
725
726 if (GlobalAddressSDNode *GASD =
727 dyn_cast<GlobalAddressSDNode>(N->getOperand(1))) {
Nate Begeman422b0ce2005-11-16 00:48:01 +0000728 CallOpcode = PPC::BL;
Chris Lattner2823b3e2005-11-17 05:56:14 +0000729 CallOperands.push_back(N->getOperand(1));
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000730 } else if (ExternalSymbolSDNode *ESSDN =
731 dyn_cast<ExternalSymbolSDNode>(N->getOperand(1))) {
Nate Begeman422b0ce2005-11-16 00:48:01 +0000732 CallOpcode = PPC::BL;
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000733 CallOperands.push_back(N->getOperand(1));
Nate Begeman422b0ce2005-11-16 00:48:01 +0000734 } else if (isa<ConstantSDNode>(N->getOperand(1)) &&
735 isCallCompatibleAddress(cast<ConstantSDNode>(N->getOperand(1)))) {
736 ConstantSDNode *C = cast<ConstantSDNode>(N->getOperand(1));
737 CallOpcode = PPC::BLA;
738 CallOperands.push_back(getI32Imm((int)C->getValue() >> 2));
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000739 } else {
740 // Copy the callee address into the CTR register.
Evan Cheng34167212006-02-09 00:37:58 +0000741 SDOperand Callee;
742 Select(Callee, N->getOperand(1));
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000743 Chain = SDOperand(CurDAG->getTargetNode(PPC::MTCTR, MVT::Other, Callee,
744 Chain), 0);
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000745
746 // Copy the callee address into R12 on darwin.
747 SDOperand R12 = CurDAG->getRegister(PPC::R12, MVT::i32);
748 Chain = CurDAG->getNode(ISD::CopyToReg, MVT::Other, Chain, R12, Callee);
Nate Begeman422b0ce2005-11-16 00:48:01 +0000749
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000750 CallOperands.push_back(R12);
Nate Begeman422b0ce2005-11-16 00:48:01 +0000751 CallOpcode = PPC::BCTRL;
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000752 }
753
754 unsigned GPR_idx = 0, FPR_idx = 0;
755 static const unsigned GPR[] = {
756 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
757 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
758 };
759 static const unsigned FPR[] = {
760 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
761 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
762 };
763
764 SDOperand InFlag; // Null incoming flag value.
765
766 for (unsigned i = 2, e = N->getNumOperands(); i != e; ++i) {
767 unsigned DestReg = 0;
768 MVT::ValueType RegTy = N->getOperand(i).getValueType();
769 if (RegTy == MVT::i32) {
770 assert(GPR_idx < 8 && "Too many int args");
771 DestReg = GPR[GPR_idx++];
772 } else {
773 assert(MVT::isFloatingPoint(N->getOperand(i).getValueType()) &&
774 "Unpromoted integer arg?");
775 assert(FPR_idx < 13 && "Too many fp args");
776 DestReg = FPR[FPR_idx++];
777 }
778
779 if (N->getOperand(i).getOpcode() != ISD::UNDEF) {
Evan Cheng34167212006-02-09 00:37:58 +0000780 SDOperand Val;
781 Select(Val, N->getOperand(i));
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000782 Chain = CurDAG->getCopyToReg(Chain, DestReg, Val, InFlag);
783 InFlag = Chain.getValue(1);
784 CallOperands.push_back(CurDAG->getRegister(DestReg, RegTy));
785 }
786 }
787
788 // Finally, once everything is in registers to pass to the call, emit the
789 // call itself.
790 if (InFlag.Val)
791 CallOperands.push_back(InFlag); // Strong dep on register copies.
792 else
793 CallOperands.push_back(Chain); // Weak dep on whatever occurs before
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000794 Chain = SDOperand(CurDAG->getTargetNode(CallOpcode, MVT::Other, MVT::Flag,
795 CallOperands), 0);
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000796
797 std::vector<SDOperand> CallResults;
798
799 // If the call has results, copy the values out of the ret val registers.
800 switch (N->getValueType(0)) {
801 default: assert(0 && "Unexpected ret value!");
802 case MVT::Other: break;
803 case MVT::i32:
804 if (N->getValueType(1) == MVT::i32) {
805 Chain = CurDAG->getCopyFromReg(Chain, PPC::R4, MVT::i32,
806 Chain.getValue(1)).getValue(1);
807 CallResults.push_back(Chain.getValue(0));
808 Chain = CurDAG->getCopyFromReg(Chain, PPC::R3, MVT::i32,
809 Chain.getValue(2)).getValue(1);
810 CallResults.push_back(Chain.getValue(0));
811 } else {
812 Chain = CurDAG->getCopyFromReg(Chain, PPC::R3, MVT::i32,
813 Chain.getValue(1)).getValue(1);
814 CallResults.push_back(Chain.getValue(0));
815 }
816 break;
817 case MVT::f32:
818 case MVT::f64:
819 Chain = CurDAG->getCopyFromReg(Chain, PPC::F1, N->getValueType(0),
820 Chain.getValue(1)).getValue(1);
821 CallResults.push_back(Chain.getValue(0));
822 break;
823 }
824
825 CallResults.push_back(Chain);
826 for (unsigned i = 0, e = CallResults.size(); i != e; ++i)
827 CodeGenMap[Op.getValue(i)] = CallResults[i];
828 return CallResults[Op.ResNo];
829}
830
Chris Lattnera5a91b12005-08-17 19:33:03 +0000831// Select - Convert the specified operand from a target-independent to a
832// target-specific node if it hasn't already been changed.
Evan Cheng34167212006-02-09 00:37:58 +0000833void PPCDAGToDAGISel::Select(SDOperand &Result, SDOperand Op) {
Chris Lattnera5a91b12005-08-17 19:33:03 +0000834 SDNode *N = Op.Val;
Chris Lattner0bbea952005-08-26 20:25:03 +0000835 if (N->getOpcode() >= ISD::BUILTIN_OP_END &&
Evan Cheng34167212006-02-09 00:37:58 +0000836 N->getOpcode() < PPCISD::FIRST_NUMBER) {
837 Result = Op;
838 return; // Already selected.
839 }
Chris Lattnerd3d2cf52005-09-29 00:59:32 +0000840
841 // If this has already been converted, use it.
842 std::map<SDOperand, SDOperand>::iterator CGMI = CodeGenMap.find(Op);
Evan Cheng34167212006-02-09 00:37:58 +0000843 if (CGMI != CodeGenMap.end()) {
844 Result = CGMI->second;
845 return;
846 }
Chris Lattnera5a91b12005-08-17 19:33:03 +0000847
848 switch (N->getOpcode()) {
Chris Lattner19c09072005-09-07 23:45:15 +0000849 default: break;
Evan Cheng34167212006-02-09 00:37:58 +0000850 case ISD::SETCC:
851 Result = SelectSETCC(Op);
852 return;
853 case PPCISD::CALL:
854 Result = SelectCALL(Op);
855 return;
856 case PPCISD::GlobalBaseReg:
857 Result = getGlobalBaseReg();
858 return;
Chris Lattner860e8862005-11-17 07:30:41 +0000859
Chris Lattnere28e40a2005-08-25 00:45:43 +0000860 case ISD::FrameIndex: {
861 int FI = cast<FrameIndexSDNode>(N)->getIndex();
Evan Cheng34167212006-02-09 00:37:58 +0000862 if (N->hasOneUse()) {
863 Result = CurDAG->SelectNodeTo(N, PPC::ADDI, MVT::i32,
864 CurDAG->getTargetFrameIndex(FI, MVT::i32),
865 getI32Imm(0));
866 return;
867 }
868 Result = CodeGenMap[Op] =
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000869 SDOperand(CurDAG->getTargetNode(PPC::ADDI, MVT::i32,
870 CurDAG->getTargetFrameIndex(FI, MVT::i32),
871 getI32Imm(0)), 0);
Evan Cheng34167212006-02-09 00:37:58 +0000872 return;
Chris Lattnere28e40a2005-08-25 00:45:43 +0000873 }
Chris Lattner88add102005-09-28 22:50:24 +0000874 case ISD::SDIV: {
Nate Begeman405e3ec2005-10-21 00:02:42 +0000875 // FIXME: since this depends on the setting of the carry flag from the srawi
876 // we should really be making notes about that for the scheduler.
877 // FIXME: It sure would be nice if we could cheaply recognize the
878 // srl/add/sra pattern the dag combiner will generate for this as
879 // sra/addze rather than having to handle sdiv ourselves. oh well.
Chris Lattner8784a232005-08-25 17:50:06 +0000880 unsigned Imm;
881 if (isIntImmediate(N->getOperand(1), Imm)) {
Evan Cheng34167212006-02-09 00:37:58 +0000882 SDOperand N0;
883 Select(N0, N->getOperand(0));
Chris Lattner8784a232005-08-25 17:50:06 +0000884 if ((signed)Imm > 0 && isPowerOf2_32(Imm)) {
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000885 SDNode *Op =
Chris Lattner8784a232005-08-25 17:50:06 +0000886 CurDAG->getTargetNode(PPC::SRAWI, MVT::i32, MVT::Flag,
Evan Cheng34167212006-02-09 00:37:58 +0000887 N0, getI32Imm(Log2_32(Imm)));
888 Result = CurDAG->SelectNodeTo(N, PPC::ADDZE, MVT::i32,
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000889 SDOperand(Op, 0), SDOperand(Op, 1));
Chris Lattner8784a232005-08-25 17:50:06 +0000890 } else if ((signed)Imm < 0 && isPowerOf2_32(-Imm)) {
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000891 SDNode *Op =
Chris Lattner2501d5e2005-08-30 17:13:58 +0000892 CurDAG->getTargetNode(PPC::SRAWI, MVT::i32, MVT::Flag,
Evan Cheng34167212006-02-09 00:37:58 +0000893 N0, getI32Imm(Log2_32(-Imm)));
Chris Lattner8784a232005-08-25 17:50:06 +0000894 SDOperand PT =
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000895 SDOperand(CurDAG->getTargetNode(PPC::ADDZE, MVT::i32,
896 SDOperand(Op, 0), SDOperand(Op, 1)),
897 0);
Evan Cheng34167212006-02-09 00:37:58 +0000898 Result = CurDAG->SelectNodeTo(N, PPC::NEG, MVT::i32, PT);
Chris Lattner8784a232005-08-25 17:50:06 +0000899 }
Evan Cheng34167212006-02-09 00:37:58 +0000900 return;
Chris Lattner8784a232005-08-25 17:50:06 +0000901 }
Chris Lattner047b9522005-08-25 22:04:30 +0000902
Chris Lattner237733e2005-09-29 23:33:31 +0000903 // Other cases are autogenerated.
904 break;
Chris Lattner047b9522005-08-25 22:04:30 +0000905 }
Nate Begemancffc32b2005-08-18 07:30:46 +0000906 case ISD::AND: {
Nate Begeman50fb3c42005-12-24 01:00:15 +0000907 unsigned Imm, Imm2;
Nate Begemancffc32b2005-08-18 07:30:46 +0000908 // If this is an and of a value rotated between 0 and 31 bits and then and'd
909 // with a mask, emit rlwinm
910 if (isIntImmediate(N->getOperand(1), Imm) && (isShiftedMask_32(Imm) ||
911 isShiftedMask_32(~Imm))) {
912 SDOperand Val;
Nate Begemana6940472005-08-18 18:01:39 +0000913 unsigned SH, MB, ME;
Nate Begemancffc32b2005-08-18 07:30:46 +0000914 if (isRotateAndMask(N->getOperand(0).Val, Imm, false, SH, MB, ME)) {
Evan Cheng34167212006-02-09 00:37:58 +0000915 Select(Val, N->getOperand(0).getOperand(0));
Chris Lattner3393e802005-10-25 19:32:37 +0000916 } else if (Imm == 0) {
917 // AND X, 0 -> 0, not "rlwinm 32".
Evan Cheng34167212006-02-09 00:37:58 +0000918 Select(Result, N->getOperand(1));
919 return ;
Chris Lattner3393e802005-10-25 19:32:37 +0000920 } else {
Evan Cheng34167212006-02-09 00:37:58 +0000921 Select(Val, N->getOperand(0));
Nate Begemancffc32b2005-08-18 07:30:46 +0000922 isRunOfOnes(Imm, MB, ME);
923 SH = 0;
924 }
Evan Cheng34167212006-02-09 00:37:58 +0000925 Result = CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Val,
926 getI32Imm(SH), getI32Imm(MB),
927 getI32Imm(ME));
928 return;
Nate Begemancffc32b2005-08-18 07:30:46 +0000929 }
Nate Begeman50fb3c42005-12-24 01:00:15 +0000930 // ISD::OR doesn't get all the bitfield insertion fun.
931 // (and (or x, c1), c2) where isRunOfOnes(~(c1^c2)) is a bitfield insert
932 if (isIntImmediate(N->getOperand(1), Imm) &&
933 N->getOperand(0).getOpcode() == ISD::OR &&
934 isIntImmediate(N->getOperand(0).getOperand(1), Imm2)) {
Chris Lattnerc9a5ef52006-01-05 18:32:49 +0000935 unsigned MB, ME;
Nate Begeman50fb3c42005-12-24 01:00:15 +0000936 Imm = ~(Imm^Imm2);
937 if (isRunOfOnes(Imm, MB, ME)) {
Evan Cheng34167212006-02-09 00:37:58 +0000938 SDOperand Tmp1, Tmp2;
939 Select(Tmp1, N->getOperand(0).getOperand(0));
940 Select(Tmp2, N->getOperand(0).getOperand(1));
Evan Cheng7e9b26f2006-02-09 07:17:49 +0000941 Result = SDOperand(CurDAG->getTargetNode(PPC::RLWIMI, MVT::i32,
942 Tmp1, Tmp2,
943 getI32Imm(0), getI32Imm(MB),
944 getI32Imm(ME)), 0);
Evan Cheng34167212006-02-09 00:37:58 +0000945 return;
Nate Begeman50fb3c42005-12-24 01:00:15 +0000946 }
947 }
Chris Lattner237733e2005-09-29 23:33:31 +0000948
949 // Other cases are autogenerated.
950 break;
Nate Begemancffc32b2005-08-18 07:30:46 +0000951 }
Nate Begeman02b88a42005-08-19 00:38:14 +0000952 case ISD::OR:
Evan Cheng34167212006-02-09 00:37:58 +0000953 if (SDNode *I = SelectBitfieldInsert(N)) {
954 Result = CodeGenMap[Op] = SDOperand(I, 0);
955 return;
956 }
Chris Lattnerd3d2cf52005-09-29 00:59:32 +0000957
Chris Lattner237733e2005-09-29 23:33:31 +0000958 // Other cases are autogenerated.
959 break;
Nate Begemanc15ed442005-08-18 23:38:00 +0000960 case ISD::SHL: {
961 unsigned Imm, SH, MB, ME;
962 if (isOpcWithIntImmediate(N->getOperand(0).Val, ISD::AND, Imm) &&
Nate Begeman2d5aff72005-10-19 18:42:01 +0000963 isRotateAndMask(N, Imm, true, SH, MB, ME)) {
Evan Cheng34167212006-02-09 00:37:58 +0000964 SDOperand Val;
965 Select(Val, N->getOperand(0).getOperand(0));
966 Result = CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32,
967 Val, getI32Imm(SH), getI32Imm(MB),
968 getI32Imm(ME));
969 return;
Nate Begeman8d948322005-10-19 01:12:32 +0000970 }
Nate Begeman2d5aff72005-10-19 18:42:01 +0000971
972 // Other cases are autogenerated.
973 break;
Nate Begemanc15ed442005-08-18 23:38:00 +0000974 }
975 case ISD::SRL: {
976 unsigned Imm, SH, MB, ME;
977 if (isOpcWithIntImmediate(N->getOperand(0).Val, ISD::AND, Imm) &&
Nate Begeman2d5aff72005-10-19 18:42:01 +0000978 isRotateAndMask(N, Imm, true, SH, MB, ME)) {
Evan Cheng34167212006-02-09 00:37:58 +0000979 SDOperand Val;
980 Select(Val, N->getOperand(0).getOperand(0));
981 Result = CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32,
982 Val, getI32Imm(SH & 0x1F), getI32Imm(MB),
983 getI32Imm(ME));
984 return;
Nate Begeman8d948322005-10-19 01:12:32 +0000985 }
Nate Begeman2d5aff72005-10-19 18:42:01 +0000986
987 // Other cases are autogenerated.
988 break;
Nate Begemanc15ed442005-08-18 23:38:00 +0000989 }
Chris Lattner13794f52005-08-26 18:46:49 +0000990 case ISD::SELECT_CC: {
991 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(4))->get();
992
993 // handle the setcc cases here. select_cc lhs, 0, 1, 0, cc
994 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N->getOperand(1)))
995 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N->getOperand(2)))
996 if (ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N->getOperand(3)))
997 if (N1C->isNullValue() && N3C->isNullValue() &&
998 N2C->getValue() == 1ULL && CC == ISD::SETNE) {
Evan Cheng34167212006-02-09 00:37:58 +0000999 SDOperand LHS;
1000 Select(LHS, N->getOperand(0));
Evan Cheng7e9b26f2006-02-09 07:17:49 +00001001 SDNode *Tmp =
Chris Lattner13794f52005-08-26 18:46:49 +00001002 CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
1003 LHS, getI32Imm(~0U));
Evan Cheng7e9b26f2006-02-09 07:17:49 +00001004 Result = CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32,
1005 SDOperand(Tmp, 0), LHS,
1006 SDOperand(Tmp, 1));
Evan Cheng34167212006-02-09 00:37:58 +00001007 return;
Chris Lattner13794f52005-08-26 18:46:49 +00001008 }
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00001009
Chris Lattner50ff55c2005-09-01 19:20:44 +00001010 SDOperand CCReg = SelectCC(N->getOperand(0), N->getOperand(1), CC);
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00001011 unsigned BROpc = getBCCForSetCC(CC);
1012
1013 bool isFP = MVT::isFloatingPoint(N->getValueType(0));
Chris Lattner919c0322005-10-01 01:35:02 +00001014 unsigned SelectCCOp;
1015 if (MVT::isInteger(N->getValueType(0)))
1016 SelectCCOp = PPC::SELECT_CC_Int;
1017 else if (N->getValueType(0) == MVT::f32)
1018 SelectCCOp = PPC::SELECT_CC_F4;
1019 else
1020 SelectCCOp = PPC::SELECT_CC_F8;
Evan Cheng34167212006-02-09 00:37:58 +00001021 SDOperand N2, N3;
1022 Select(N2, N->getOperand(2));
1023 Select(N3, N->getOperand(3));
1024 Result = CurDAG->SelectNodeTo(N, SelectCCOp, N->getValueType(0), CCReg,
1025 N2, N3, getI32Imm(BROpc));
1026 return;
Chris Lattner13794f52005-08-26 18:46:49 +00001027 }
Chris Lattner2fbb4572005-08-21 18:50:37 +00001028 case ISD::BR_CC:
1029 case ISD::BRTWOWAY_CC: {
Evan Cheng34167212006-02-09 00:37:58 +00001030 SDOperand Chain;
1031 Select(Chain, N->getOperand(0));
Chris Lattner2fbb4572005-08-21 18:50:37 +00001032 MachineBasicBlock *Dest =
1033 cast<BasicBlockSDNode>(N->getOperand(4))->getBasicBlock();
1034 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(1))->get();
1035 SDOperand CondCode = SelectCC(N->getOperand(2), N->getOperand(3), CC);
Chris Lattner2fbb4572005-08-21 18:50:37 +00001036
1037 // If this is a two way branch, then grab the fallthrough basic block
1038 // argument and build a PowerPC branch pseudo-op, suitable for long branch
1039 // conversion if necessary by the branch selection pass. Otherwise, emit a
1040 // standard conditional branch.
1041 if (N->getOpcode() == ISD::BRTWOWAY_CC) {
Chris Lattnerca0a4772005-10-01 23:06:26 +00001042 SDOperand CondTrueBlock = N->getOperand(4);
1043 SDOperand CondFalseBlock = N->getOperand(5);
Chris Lattnerca0a4772005-10-01 23:06:26 +00001044 unsigned Opc = getBCCForSetCC(CC);
Evan Cheng7e9b26f2006-02-09 07:17:49 +00001045 SDOperand CB =
1046 SDOperand(CurDAG->getTargetNode(PPC::COND_BRANCH, MVT::Other,
1047 CondCode, getI32Imm(Opc),
1048 CondTrueBlock, CondFalseBlock,
1049 Chain), 0);
Evan Cheng34167212006-02-09 00:37:58 +00001050 Result = CurDAG->SelectNodeTo(N, PPC::B, MVT::Other, CondFalseBlock, CB);
Chris Lattner2fbb4572005-08-21 18:50:37 +00001051 } else {
1052 // Iterate to the next basic block
1053 ilist<MachineBasicBlock>::iterator It = BB;
1054 ++It;
1055
1056 // If the fallthrough path is off the end of the function, which would be
1057 // undefined behavior, set it to be the same as the current block because
1058 // we have nothing better to set it to, and leaving it alone will cause
1059 // the PowerPC Branch Selection pass to crash.
1060 if (It == BB->getParent()->end()) It = Dest;
Evan Cheng34167212006-02-09 00:37:58 +00001061 Result = CurDAG->SelectNodeTo(N, PPC::COND_BRANCH, MVT::Other, CondCode,
1062 getI32Imm(getBCCForSetCC(CC)),
1063 N->getOperand(4), CurDAG->getBasicBlock(It),
1064 Chain);
Chris Lattner2fbb4572005-08-21 18:50:37 +00001065 }
Evan Cheng34167212006-02-09 00:37:58 +00001066 return;
Chris Lattner2fbb4572005-08-21 18:50:37 +00001067 }
Chris Lattnera5a91b12005-08-17 19:33:03 +00001068 }
Chris Lattner25dae722005-09-03 00:53:47 +00001069
Evan Cheng34167212006-02-09 00:37:58 +00001070 SelectCode(Result, Op);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001071}
1072
1073
Nate Begeman1d9d7422005-10-18 00:28:58 +00001074/// createPPCISelDag - This pass converts a legalized DAG into a
Chris Lattnera5a91b12005-08-17 19:33:03 +00001075/// PowerPC-specific DAG, ready for instruction scheduling.
1076///
Nate Begeman1d9d7422005-10-18 00:28:58 +00001077FunctionPass *llvm::createPPCISelDag(TargetMachine &TM) {
1078 return new PPCDAGToDAGISel(TM);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001079}
1080