blob: 39f380acfae0d4f89a6c0270376dbf21e13cf4d1 [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"
29using namespace llvm;
30
31namespace {
Chris Lattnera5a91b12005-08-17 19:33:03 +000032 Statistic<> FusedFP ("ppc-codegen", "Number of fused fp operations");
33 Statistic<> FrameOff("ppc-codegen", "Number of frame idx offsets collapsed");
34
35 //===--------------------------------------------------------------------===//
Nate Begeman1d9d7422005-10-18 00:28:58 +000036 /// PPCDAGToDAGISel - PPC specific code to select PPC machine
Chris Lattnera5a91b12005-08-17 19:33:03 +000037 /// instructions for SelectionDAG operations.
38 ///
Nate Begeman1d9d7422005-10-18 00:28:58 +000039 class PPCDAGToDAGISel : public SelectionDAGISel {
Nate Begeman21e463b2005-10-16 05:39:50 +000040 PPCTargetLowering PPCLowering;
Chris Lattner4416f1a2005-08-19 22:38:53 +000041 unsigned GlobalBaseReg;
Chris Lattnera5a91b12005-08-17 19:33:03 +000042 public:
Nate Begeman1d9d7422005-10-18 00:28:58 +000043 PPCDAGToDAGISel(TargetMachine &TM)
Nate Begeman21e463b2005-10-16 05:39:50 +000044 : SelectionDAGISel(PPCLowering), PPCLowering(TM) {}
Chris Lattnera5a91b12005-08-17 19:33:03 +000045
Chris Lattner4416f1a2005-08-19 22:38:53 +000046 virtual bool runOnFunction(Function &Fn) {
47 // Make sure we re-emit a set of the global base reg if necessary
48 GlobalBaseReg = 0;
49 return SelectionDAGISel::runOnFunction(Fn);
50 }
51
Chris Lattnera5a91b12005-08-17 19:33:03 +000052 /// getI32Imm - Return a target constant with the specified value, of type
53 /// i32.
54 inline SDOperand getI32Imm(unsigned Imm) {
55 return CurDAG->getTargetConstant(Imm, MVT::i32);
56 }
Chris Lattner4416f1a2005-08-19 22:38:53 +000057
58 /// getGlobalBaseReg - insert code into the entry mbb to materialize the PIC
59 /// base register. Return the virtual register that holds this value.
Chris Lattner9944b762005-08-21 22:31:09 +000060 SDOperand getGlobalBaseReg();
Chris Lattnera5a91b12005-08-17 19:33:03 +000061
62 // Select - Convert the specified operand from a target-independent to a
63 // target-specific node if it hasn't already been changed.
64 SDOperand Select(SDOperand Op);
65
Nate Begeman02b88a42005-08-19 00:38:14 +000066 SDNode *SelectBitfieldInsert(SDNode *N);
67
Chris Lattner2fbb4572005-08-21 18:50:37 +000068 /// SelectCC - Select a comparison of the specified values with the
69 /// specified condition code, returning the CR# of the expression.
70 SDOperand SelectCC(SDOperand LHS, SDOperand RHS, ISD::CondCode CC);
71
Chris Lattner9944b762005-08-21 22:31:09 +000072 /// SelectAddr - Given the specified address, return the two operands for a
73 /// load/store instruction, and return true if it should be an indexed [r+r]
74 /// operation.
75 bool SelectAddr(SDOperand Addr, SDOperand &Op1, SDOperand &Op2);
76
Chris Lattner047b9522005-08-25 22:04:30 +000077 SDOperand BuildSDIVSequence(SDNode *N);
78 SDOperand BuildUDIVSequence(SDNode *N);
79
Chris Lattnera5a91b12005-08-17 19:33:03 +000080 /// InstructionSelectBasicBlock - This callback is invoked by
81 /// SelectionDAGISel when it has created a SelectionDAG for us to codegen.
Chris Lattnerbd937b92005-10-06 18:45:51 +000082 virtual void InstructionSelectBasicBlock(SelectionDAG &DAG);
83
Chris Lattnera5a91b12005-08-17 19:33:03 +000084 virtual const char *getPassName() const {
85 return "PowerPC DAG->DAG Pattern Instruction Selection";
86 }
Chris Lattneraf165382005-09-13 22:03:06 +000087
88// Include the pieces autogenerated from the target description.
Chris Lattner4c7b43b2005-10-14 23:37:35 +000089#include "PPCGenDAGISel.inc"
Chris Lattnerbd937b92005-10-06 18:45:51 +000090
91private:
Chris Lattner222adac2005-10-06 19:03:35 +000092 SDOperand SelectDYNAMIC_STACKALLOC(SDOperand Op);
93 SDOperand SelectADD_PARTS(SDOperand Op);
94 SDOperand SelectSUB_PARTS(SDOperand Op);
95 SDOperand SelectSETCC(SDOperand Op);
Chris Lattner6a16f6a2005-10-06 19:07:45 +000096 SDOperand SelectCALL(SDOperand Op);
Chris Lattnera5a91b12005-08-17 19:33:03 +000097 };
98}
99
Chris Lattnerbd937b92005-10-06 18:45:51 +0000100/// InstructionSelectBasicBlock - This callback is invoked by
101/// SelectionDAGISel when it has created a SelectionDAG for us to codegen.
Nate Begeman1d9d7422005-10-18 00:28:58 +0000102void PPCDAGToDAGISel::InstructionSelectBasicBlock(SelectionDAG &DAG) {
Chris Lattnerbd937b92005-10-06 18:45:51 +0000103 DEBUG(BB->dump());
104
105 // The selection process is inherently a bottom-up recursive process (users
106 // select their uses before themselves). Given infinite stack space, we
107 // could just start selecting on the root and traverse the whole graph. In
108 // practice however, this causes us to run out of stack space on large basic
109 // blocks. To avoid this problem, select the entry node, then all its uses,
110 // iteratively instead of recursively.
111 std::vector<SDOperand> Worklist;
112 Worklist.push_back(DAG.getEntryNode());
113
114 // Note that we can do this in the PPC target (scanning forward across token
115 // chain edges) because no nodes ever get folded across these edges. On a
116 // target like X86 which supports load/modify/store operations, this would
117 // have to be more careful.
118 while (!Worklist.empty()) {
119 SDOperand Node = Worklist.back();
120 Worklist.pop_back();
121
Chris Lattnercf01a702005-10-07 22:10:27 +0000122 // Chose from the least deep of the top two nodes.
123 if (!Worklist.empty() &&
124 Worklist.back().Val->getNodeDepth() < Node.Val->getNodeDepth())
125 std::swap(Worklist.back(), Node);
126
Chris Lattnerbd937b92005-10-06 18:45:51 +0000127 if ((Node.Val->getOpcode() >= ISD::BUILTIN_OP_END &&
128 Node.Val->getOpcode() < PPCISD::FIRST_NUMBER) ||
129 CodeGenMap.count(Node)) continue;
130
131 for (SDNode::use_iterator UI = Node.Val->use_begin(),
132 E = Node.Val->use_end(); UI != E; ++UI) {
133 // Scan the values. If this use has a value that is a token chain, add it
134 // to the worklist.
135 SDNode *User = *UI;
136 for (unsigned i = 0, e = User->getNumValues(); i != e; ++i)
137 if (User->getValueType(i) == MVT::Other) {
138 Worklist.push_back(SDOperand(User, i));
139 break;
140 }
141 }
142
143 // Finally, legalize this node.
144 Select(Node);
145 }
Chris Lattnercf01a702005-10-07 22:10:27 +0000146
Chris Lattnerbd937b92005-10-06 18:45:51 +0000147 // Select target instructions for the DAG.
148 DAG.setRoot(Select(DAG.getRoot()));
149 CodeGenMap.clear();
150 DAG.RemoveDeadNodes();
151
152 // Emit machine code to BB.
153 ScheduleAndEmitDAG(DAG);
154}
Chris Lattner6cd40d52005-09-03 01:17:22 +0000155
Chris Lattner4416f1a2005-08-19 22:38:53 +0000156/// getGlobalBaseReg - Output the instructions required to put the
157/// base address to use for accessing globals into a register.
158///
Nate Begeman1d9d7422005-10-18 00:28:58 +0000159SDOperand PPCDAGToDAGISel::getGlobalBaseReg() {
Chris Lattner4416f1a2005-08-19 22:38:53 +0000160 if (!GlobalBaseReg) {
161 // Insert the set of GlobalBaseReg into the first MBB of the function
162 MachineBasicBlock &FirstMBB = BB->getParent()->front();
163 MachineBasicBlock::iterator MBBI = FirstMBB.begin();
164 SSARegMap *RegMap = BB->getParent()->getSSARegMap();
Nate Begeman1d9d7422005-10-18 00:28:58 +0000165 // FIXME: when we get to LP64, we will need to create the appropriate
166 // type of register here.
167 GlobalBaseReg = RegMap->createVirtualRegister(PPC::GPRCRegisterClass);
Chris Lattner4416f1a2005-08-19 22:38:53 +0000168 BuildMI(FirstMBB, MBBI, PPC::MovePCtoLR, 0, PPC::LR);
169 BuildMI(FirstMBB, MBBI, PPC::MFLR, 1, GlobalBaseReg);
170 }
Chris Lattner9944b762005-08-21 22:31:09 +0000171 return CurDAG->getRegister(GlobalBaseReg, MVT::i32);
Chris Lattner4416f1a2005-08-19 22:38:53 +0000172}
173
174
Nate Begeman0f3257a2005-08-18 05:00:13 +0000175// isIntImmediate - This method tests to see if a constant operand.
176// If so Imm will receive the 32 bit value.
177static bool isIntImmediate(SDNode *N, unsigned& Imm) {
178 if (N->getOpcode() == ISD::Constant) {
179 Imm = cast<ConstantSDNode>(N)->getValue();
180 return true;
181 }
182 return false;
183}
184
Nate Begemancffc32b2005-08-18 07:30:46 +0000185// isOprShiftImm - Returns true if the specified operand is a shift opcode with
186// a immediate shift count less than 32.
187static bool isOprShiftImm(SDNode *N, unsigned& Opc, unsigned& SH) {
188 Opc = N->getOpcode();
189 return (Opc == ISD::SHL || Opc == ISD::SRL || Opc == ISD::SRA) &&
190 isIntImmediate(N->getOperand(1).Val, SH) && SH < 32;
191}
192
193// isRunOfOnes - Returns true iff Val consists of one contiguous run of 1s with
194// any number of 0s on either side. The 1s are allowed to wrap from LSB to
195// MSB, so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is
196// not, since all 1s are not contiguous.
197static bool isRunOfOnes(unsigned Val, unsigned &MB, unsigned &ME) {
198 if (isShiftedMask_32(Val)) {
199 // look for the first non-zero bit
200 MB = CountLeadingZeros_32(Val);
201 // look for the first zero bit after the run of ones
202 ME = CountLeadingZeros_32((Val - 1) ^ Val);
203 return true;
Chris Lattner2fe76e52005-08-25 04:47:18 +0000204 } else {
205 Val = ~Val; // invert mask
206 if (isShiftedMask_32(Val)) {
207 // effectively look for the first zero bit
208 ME = CountLeadingZeros_32(Val) - 1;
209 // effectively look for the first one bit after the run of zeros
210 MB = CountLeadingZeros_32((Val - 1) ^ Val) + 1;
211 return true;
212 }
Nate Begemancffc32b2005-08-18 07:30:46 +0000213 }
214 // no run present
215 return false;
216}
217
Chris Lattner65a419a2005-10-09 05:36:17 +0000218// isRotateAndMask - Returns true if Mask and Shift can be folded into a rotate
Nate Begemancffc32b2005-08-18 07:30:46 +0000219// and mask opcode and mask operation.
220static bool isRotateAndMask(SDNode *N, unsigned Mask, bool IsShiftMask,
221 unsigned &SH, unsigned &MB, unsigned &ME) {
Nate Begemanda32c9e2005-10-19 00:05:37 +0000222 // Don't even go down this path for i64, since different logic will be
223 // necessary for rldicl/rldicr/rldimi.
224 if (N->getValueType(0) != MVT::i32)
225 return false;
226
Nate Begemancffc32b2005-08-18 07:30:46 +0000227 unsigned Shift = 32;
228 unsigned Indeterminant = ~0; // bit mask marking indeterminant results
229 unsigned Opcode = N->getOpcode();
Chris Lattner15055732005-08-30 00:59:16 +0000230 if (N->getNumOperands() != 2 ||
231 !isIntImmediate(N->getOperand(1).Val, Shift) || (Shift > 31))
Nate Begemancffc32b2005-08-18 07:30:46 +0000232 return false;
233
234 if (Opcode == ISD::SHL) {
235 // apply shift left to mask if it comes first
236 if (IsShiftMask) Mask = Mask << Shift;
237 // determine which bits are made indeterminant by shift
238 Indeterminant = ~(0xFFFFFFFFu << Shift);
Chris Lattner651dea72005-10-15 21:40:12 +0000239 } else if (Opcode == ISD::SRL) {
Nate Begemancffc32b2005-08-18 07:30:46 +0000240 // apply shift right to mask if it comes first
241 if (IsShiftMask) Mask = Mask >> Shift;
242 // determine which bits are made indeterminant by shift
243 Indeterminant = ~(0xFFFFFFFFu >> Shift);
244 // adjust for the left rotate
245 Shift = 32 - Shift;
246 } else {
247 return false;
248 }
249
250 // if the mask doesn't intersect any Indeterminant bits
251 if (Mask && !(Mask & Indeterminant)) {
252 SH = Shift;
253 // make sure the mask is still a mask (wrap arounds may not be)
254 return isRunOfOnes(Mask, MB, ME);
255 }
256 return false;
257}
258
Nate Begeman0f3257a2005-08-18 05:00:13 +0000259// isOpcWithIntImmediate - This method tests to see if the node is a specific
260// opcode and that it has a immediate integer right operand.
261// If so Imm will receive the 32 bit value.
262static bool isOpcWithIntImmediate(SDNode *N, unsigned Opc, unsigned& Imm) {
263 return N->getOpcode() == Opc && isIntImmediate(N->getOperand(1).Val, Imm);
264}
265
266// isOprNot - Returns true if the specified operand is an xor with immediate -1.
267static bool isOprNot(SDNode *N) {
268 unsigned Imm;
269 return isOpcWithIntImmediate(N, ISD::XOR, Imm) && (signed)Imm == -1;
270}
271
Chris Lattnera5a91b12005-08-17 19:33:03 +0000272// Immediate constant composers.
273// Lo16 - grabs the lo 16 bits from a 32 bit constant.
274// Hi16 - grabs the hi 16 bits from a 32 bit constant.
275// HA16 - computes the hi bits required if the lo bits are add/subtracted in
276// arithmethically.
277static unsigned Lo16(unsigned x) { return x & 0x0000FFFF; }
278static unsigned Hi16(unsigned x) { return Lo16(x >> 16); }
279static unsigned HA16(unsigned x) { return Hi16((signed)x - (signed short)x); }
280
281// isIntImmediate - This method tests to see if a constant operand.
282// If so Imm will receive the 32 bit value.
283static bool isIntImmediate(SDOperand N, unsigned& Imm) {
284 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N)) {
285 Imm = (unsigned)CN->getSignExtended();
286 return true;
287 }
288 return false;
289}
290
Nate Begeman02b88a42005-08-19 00:38:14 +0000291/// SelectBitfieldInsert - turn an or of two masked values into
292/// the rotate left word immediate then mask insert (rlwimi) instruction.
293/// Returns true on success, false if the caller still needs to select OR.
294///
295/// Patterns matched:
296/// 1. or shl, and 5. or and, and
297/// 2. or and, shl 6. or shl, shr
298/// 3. or shr, and 7. or shr, shl
299/// 4. or and, shr
Nate Begeman1d9d7422005-10-18 00:28:58 +0000300SDNode *PPCDAGToDAGISel::SelectBitfieldInsert(SDNode *N) {
Nate Begeman02b88a42005-08-19 00:38:14 +0000301 bool IsRotate = false;
302 unsigned TgtMask = 0xFFFFFFFF, InsMask = 0xFFFFFFFF, SH = 0;
303 unsigned Value;
304
305 SDOperand Op0 = N->getOperand(0);
306 SDOperand Op1 = N->getOperand(1);
307
308 unsigned Op0Opc = Op0.getOpcode();
309 unsigned Op1Opc = Op1.getOpcode();
310
311 // Verify that we have the correct opcodes
312 if (ISD::SHL != Op0Opc && ISD::SRL != Op0Opc && ISD::AND != Op0Opc)
313 return false;
314 if (ISD::SHL != Op1Opc && ISD::SRL != Op1Opc && ISD::AND != Op1Opc)
315 return false;
316
317 // Generate Mask value for Target
318 if (isIntImmediate(Op0.getOperand(1), Value)) {
319 switch(Op0Opc) {
Chris Lattner13687212005-08-30 18:37:48 +0000320 case ISD::SHL: TgtMask <<= Value; break;
321 case ISD::SRL: TgtMask >>= Value; break;
322 case ISD::AND: TgtMask &= Value; break;
Nate Begeman02b88a42005-08-19 00:38:14 +0000323 }
324 } else {
325 return 0;
326 }
327
328 // Generate Mask value for Insert
Chris Lattner13687212005-08-30 18:37:48 +0000329 if (!isIntImmediate(Op1.getOperand(1), Value))
Nate Begeman02b88a42005-08-19 00:38:14 +0000330 return 0;
Chris Lattner13687212005-08-30 18:37:48 +0000331
332 switch(Op1Opc) {
333 case ISD::SHL:
334 SH = Value;
335 InsMask <<= SH;
336 if (Op0Opc == ISD::SRL) IsRotate = true;
337 break;
338 case ISD::SRL:
339 SH = Value;
340 InsMask >>= SH;
341 SH = 32-SH;
342 if (Op0Opc == ISD::SHL) IsRotate = true;
343 break;
344 case ISD::AND:
345 InsMask &= Value;
346 break;
Nate Begeman02b88a42005-08-19 00:38:14 +0000347 }
348
349 // If both of the inputs are ANDs and one of them has a logical shift by
350 // constant as its input, make that AND the inserted value so that we can
351 // combine the shift into the rotate part of the rlwimi instruction
352 bool IsAndWithShiftOp = false;
353 if (Op0Opc == ISD::AND && Op1Opc == ISD::AND) {
354 if (Op1.getOperand(0).getOpcode() == ISD::SHL ||
355 Op1.getOperand(0).getOpcode() == ISD::SRL) {
356 if (isIntImmediate(Op1.getOperand(0).getOperand(1), Value)) {
357 SH = Op1.getOperand(0).getOpcode() == ISD::SHL ? Value : 32 - Value;
358 IsAndWithShiftOp = true;
359 }
360 } else if (Op0.getOperand(0).getOpcode() == ISD::SHL ||
361 Op0.getOperand(0).getOpcode() == ISD::SRL) {
362 if (isIntImmediate(Op0.getOperand(0).getOperand(1), Value)) {
363 std::swap(Op0, Op1);
364 std::swap(TgtMask, InsMask);
365 SH = Op1.getOperand(0).getOpcode() == ISD::SHL ? Value : 32 - Value;
366 IsAndWithShiftOp = true;
367 }
368 }
369 }
370
371 // Verify that the Target mask and Insert mask together form a full word mask
372 // and that the Insert mask is a run of set bits (which implies both are runs
373 // of set bits). Given that, Select the arguments and generate the rlwimi
374 // instruction.
375 unsigned MB, ME;
376 if (((TgtMask & InsMask) == 0) && isRunOfOnes(InsMask, MB, ME)) {
377 bool fullMask = (TgtMask ^ InsMask) == 0xFFFFFFFF;
378 bool Op0IsAND = Op0Opc == ISD::AND;
379 // Check for rotlwi / rotrwi here, a special case of bitfield insert
380 // where both bitfield halves are sourced from the same value.
381 if (IsRotate && fullMask &&
382 N->getOperand(0).getOperand(0) == N->getOperand(1).getOperand(0)) {
383 Op0 = CurDAG->getTargetNode(PPC::RLWINM, MVT::i32,
384 Select(N->getOperand(0).getOperand(0)),
385 getI32Imm(SH), getI32Imm(0), getI32Imm(31));
386 return Op0.Val;
387 }
388 SDOperand Tmp1 = (Op0IsAND && fullMask) ? Select(Op0.getOperand(0))
389 : Select(Op0);
390 SDOperand Tmp2 = IsAndWithShiftOp ? Select(Op1.getOperand(0).getOperand(0))
391 : Select(Op1.getOperand(0));
392 Op0 = CurDAG->getTargetNode(PPC::RLWIMI, MVT::i32, Tmp1, Tmp2,
393 getI32Imm(SH), getI32Imm(MB), getI32Imm(ME));
394 return Op0.Val;
395 }
396 return 0;
397}
398
Chris Lattner9944b762005-08-21 22:31:09 +0000399/// SelectAddr - Given the specified address, return the two operands for a
400/// load/store instruction, and return true if it should be an indexed [r+r]
401/// operation.
Nate Begeman1d9d7422005-10-18 00:28:58 +0000402bool PPCDAGToDAGISel::SelectAddr(SDOperand Addr, SDOperand &Op1,
403 SDOperand &Op2) {
Chris Lattner9944b762005-08-21 22:31:09 +0000404 unsigned imm = 0;
405 if (Addr.getOpcode() == ISD::ADD) {
406 if (isIntImmediate(Addr.getOperand(1), imm) && isInt16(imm)) {
407 Op1 = getI32Imm(Lo16(imm));
Chris Lattnere28e40a2005-08-25 00:45:43 +0000408 if (FrameIndexSDNode *FI =
409 dyn_cast<FrameIndexSDNode>(Addr.getOperand(0))) {
Chris Lattner9944b762005-08-21 22:31:09 +0000410 ++FrameOff;
Chris Lattnere28e40a2005-08-25 00:45:43 +0000411 Op2 = CurDAG->getTargetFrameIndex(FI->getIndex(), MVT::i32);
Chris Lattner9944b762005-08-21 22:31:09 +0000412 } else {
413 Op2 = Select(Addr.getOperand(0));
414 }
415 return false;
416 } else {
417 Op1 = Select(Addr.getOperand(0));
418 Op2 = Select(Addr.getOperand(1));
419 return true; // [r+r]
420 }
421 }
422
423 // Now check if we're dealing with a global, and whether or not we should emit
424 // an optimized load or store for statics.
425 if (GlobalAddressSDNode *GN = dyn_cast<GlobalAddressSDNode>(Addr)) {
426 GlobalValue *GV = GN->getGlobal();
427 if (!GV->hasWeakLinkage() && !GV->isExternal()) {
428 Op1 = CurDAG->getTargetGlobalAddress(GV, MVT::i32);
429 if (PICEnabled)
430 Op2 = CurDAG->getTargetNode(PPC::ADDIS, MVT::i32, getGlobalBaseReg(),
431 Op1);
432 else
433 Op2 = CurDAG->getTargetNode(PPC::LIS, MVT::i32, Op1);
434 return false;
435 }
Chris Lattnere28e40a2005-08-25 00:45:43 +0000436 } else if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(Addr)) {
Chris Lattner9944b762005-08-21 22:31:09 +0000437 Op1 = getI32Imm(0);
Chris Lattnere28e40a2005-08-25 00:45:43 +0000438 Op2 = CurDAG->getTargetFrameIndex(FI->getIndex(), MVT::i32);
Chris Lattner9944b762005-08-21 22:31:09 +0000439 return false;
440 } else if (ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(Addr)) {
441 Op1 = Addr;
442 if (PICEnabled)
443 Op2 = CurDAG->getTargetNode(PPC::ADDIS, MVT::i32, getGlobalBaseReg(),Op1);
444 else
445 Op2 = CurDAG->getTargetNode(PPC::LIS, MVT::i32, Op1);
446 return false;
447 }
448 Op1 = getI32Imm(0);
449 Op2 = Select(Addr);
450 return false;
451}
Chris Lattnera5a91b12005-08-17 19:33:03 +0000452
Chris Lattner2fbb4572005-08-21 18:50:37 +0000453/// SelectCC - Select a comparison of the specified values with the specified
454/// condition code, returning the CR# of the expression.
Nate Begeman1d9d7422005-10-18 00:28:58 +0000455SDOperand PPCDAGToDAGISel::SelectCC(SDOperand LHS, SDOperand RHS,
456 ISD::CondCode CC) {
Chris Lattner2fbb4572005-08-21 18:50:37 +0000457 // Always select the LHS.
458 LHS = Select(LHS);
459
460 // Use U to determine whether the SETCC immediate range is signed or not.
461 if (MVT::isInteger(LHS.getValueType())) {
462 bool U = ISD::isUnsignedIntSetCC(CC);
463 unsigned Imm;
464 if (isIntImmediate(RHS, Imm) &&
465 ((U && isUInt16(Imm)) || (!U && isInt16(Imm))))
466 return CurDAG->getTargetNode(U ? PPC::CMPLWI : PPC::CMPWI, MVT::i32,
467 LHS, getI32Imm(Lo16(Imm)));
468 return CurDAG->getTargetNode(U ? PPC::CMPLW : PPC::CMPW, MVT::i32,
469 LHS, Select(RHS));
Chris Lattner919c0322005-10-01 01:35:02 +0000470 } else if (LHS.getValueType() == MVT::f32) {
471 return CurDAG->getTargetNode(PPC::FCMPUS, MVT::i32, LHS, Select(RHS));
Chris Lattner2fbb4572005-08-21 18:50:37 +0000472 } else {
Chris Lattner919c0322005-10-01 01:35:02 +0000473 return CurDAG->getTargetNode(PPC::FCMPUD, MVT::i32, LHS, Select(RHS));
Chris Lattner2fbb4572005-08-21 18:50:37 +0000474 }
475}
476
477/// getBCCForSetCC - Returns the PowerPC condition branch mnemonic corresponding
478/// to Condition.
479static unsigned getBCCForSetCC(ISD::CondCode CC) {
480 switch (CC) {
481 default: assert(0 && "Unknown condition!"); abort();
482 case ISD::SETEQ: return PPC::BEQ;
483 case ISD::SETNE: return PPC::BNE;
484 case ISD::SETULT:
485 case ISD::SETLT: return PPC::BLT;
486 case ISD::SETULE:
487 case ISD::SETLE: return PPC::BLE;
488 case ISD::SETUGT:
489 case ISD::SETGT: return PPC::BGT;
490 case ISD::SETUGE:
491 case ISD::SETGE: return PPC::BGE;
492 }
493 return 0;
494}
495
Chris Lattner64906a02005-08-25 20:08:18 +0000496/// getCRIdxForSetCC - Return the index of the condition register field
497/// associated with the SetCC condition, and whether or not the field is
498/// treated as inverted. That is, lt = 0; ge = 0 inverted.
499static unsigned getCRIdxForSetCC(ISD::CondCode CC, bool& Inv) {
500 switch (CC) {
501 default: assert(0 && "Unknown condition!"); abort();
502 case ISD::SETULT:
503 case ISD::SETLT: Inv = false; return 0;
504 case ISD::SETUGE:
505 case ISD::SETGE: Inv = true; return 0;
506 case ISD::SETUGT:
507 case ISD::SETGT: Inv = false; return 1;
508 case ISD::SETULE:
509 case ISD::SETLE: Inv = true; return 1;
510 case ISD::SETEQ: Inv = false; return 2;
511 case ISD::SETNE: Inv = true; return 2;
512 }
513 return 0;
514}
Chris Lattner9944b762005-08-21 22:31:09 +0000515
Chris Lattner047b9522005-08-25 22:04:30 +0000516// Structure used to return the necessary information to codegen an SDIV as
517// a multiply.
518struct ms {
519 int m; // magic number
520 int s; // shift amount
521};
522
523struct mu {
524 unsigned int m; // magic number
525 int a; // add indicator
526 int s; // shift amount
527};
528
529/// magic - calculate the magic numbers required to codegen an integer sdiv as
530/// a sequence of multiply and shifts. Requires that the divisor not be 0, 1,
531/// or -1.
532static struct ms magic(int d) {
533 int p;
534 unsigned int ad, anc, delta, q1, r1, q2, r2, t;
535 const unsigned int two31 = 0x80000000U;
536 struct ms mag;
537
538 ad = abs(d);
539 t = two31 + ((unsigned int)d >> 31);
540 anc = t - 1 - t%ad; // absolute value of nc
541 p = 31; // initialize p
542 q1 = two31/anc; // initialize q1 = 2p/abs(nc)
543 r1 = two31 - q1*anc; // initialize r1 = rem(2p,abs(nc))
544 q2 = two31/ad; // initialize q2 = 2p/abs(d)
545 r2 = two31 - q2*ad; // initialize r2 = rem(2p,abs(d))
546 do {
547 p = p + 1;
548 q1 = 2*q1; // update q1 = 2p/abs(nc)
549 r1 = 2*r1; // update r1 = rem(2p/abs(nc))
550 if (r1 >= anc) { // must be unsigned comparison
551 q1 = q1 + 1;
552 r1 = r1 - anc;
553 }
554 q2 = 2*q2; // update q2 = 2p/abs(d)
555 r2 = 2*r2; // update r2 = rem(2p/abs(d))
556 if (r2 >= ad) { // must be unsigned comparison
557 q2 = q2 + 1;
558 r2 = r2 - ad;
559 }
560 delta = ad - r2;
561 } while (q1 < delta || (q1 == delta && r1 == 0));
562
563 mag.m = q2 + 1;
564 if (d < 0) mag.m = -mag.m; // resulting magic number
565 mag.s = p - 32; // resulting shift
566 return mag;
567}
568
569/// magicu - calculate the magic numbers required to codegen an integer udiv as
570/// a sequence of multiply, add and shifts. Requires that the divisor not be 0.
571static struct mu magicu(unsigned d)
572{
573 int p;
574 unsigned int nc, delta, q1, r1, q2, r2;
575 struct mu magu;
576 magu.a = 0; // initialize "add" indicator
577 nc = - 1 - (-d)%d;
578 p = 31; // initialize p
579 q1 = 0x80000000/nc; // initialize q1 = 2p/nc
580 r1 = 0x80000000 - q1*nc; // initialize r1 = rem(2p,nc)
581 q2 = 0x7FFFFFFF/d; // initialize q2 = (2p-1)/d
582 r2 = 0x7FFFFFFF - q2*d; // initialize r2 = rem((2p-1),d)
583 do {
584 p = p + 1;
585 if (r1 >= nc - r1 ) {
586 q1 = 2*q1 + 1; // update q1
587 r1 = 2*r1 - nc; // update r1
588 }
589 else {
590 q1 = 2*q1; // update q1
591 r1 = 2*r1; // update r1
592 }
593 if (r2 + 1 >= d - r2) {
594 if (q2 >= 0x7FFFFFFF) magu.a = 1;
595 q2 = 2*q2 + 1; // update q2
596 r2 = 2*r2 + 1 - d; // update r2
597 }
598 else {
599 if (q2 >= 0x80000000) magu.a = 1;
600 q2 = 2*q2; // update q2
601 r2 = 2*r2 + 1; // update r2
602 }
603 delta = d - 1 - r2;
604 } while (p < 64 && (q1 < delta || (q1 == delta && r1 == 0)));
605 magu.m = q2 + 1; // resulting magic number
606 magu.s = p - 32; // resulting shift
607 return magu;
608}
609
610/// BuildSDIVSequence - Given an ISD::SDIV node expressing a divide by constant,
611/// return a DAG expression to select that will generate the same value by
612/// multiplying by a magic number. See:
613/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
Nate Begeman1d9d7422005-10-18 00:28:58 +0000614SDOperand PPCDAGToDAGISel::BuildSDIVSequence(SDNode *N) {
Chris Lattner047b9522005-08-25 22:04:30 +0000615 int d = (int)cast<ConstantSDNode>(N->getOperand(1))->getValue();
616 ms magics = magic(d);
617 // Multiply the numerator (operand 0) by the magic value
618 SDOperand Q = CurDAG->getNode(ISD::MULHS, MVT::i32, N->getOperand(0),
619 CurDAG->getConstant(magics.m, MVT::i32));
620 // If d > 0 and m < 0, add the numerator
621 if (d > 0 && magics.m < 0)
622 Q = CurDAG->getNode(ISD::ADD, MVT::i32, Q, N->getOperand(0));
623 // If d < 0 and m > 0, subtract the numerator.
624 if (d < 0 && magics.m > 0)
625 Q = CurDAG->getNode(ISD::SUB, MVT::i32, Q, N->getOperand(0));
626 // Shift right algebraic if shift value is nonzero
627 if (magics.s > 0)
628 Q = CurDAG->getNode(ISD::SRA, MVT::i32, Q,
629 CurDAG->getConstant(magics.s, MVT::i32));
630 // Extract the sign bit and add it to the quotient
631 SDOperand T =
632 CurDAG->getNode(ISD::SRL, MVT::i32, Q, CurDAG->getConstant(31, MVT::i32));
633 return CurDAG->getNode(ISD::ADD, MVT::i32, Q, T);
634}
635
636/// BuildUDIVSequence - Given an ISD::UDIV node expressing a divide by constant,
637/// return a DAG expression to select that will generate the same value by
638/// multiplying by a magic number. See:
639/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
Nate Begeman1d9d7422005-10-18 00:28:58 +0000640SDOperand PPCDAGToDAGISel::BuildUDIVSequence(SDNode *N) {
Chris Lattner047b9522005-08-25 22:04:30 +0000641 unsigned d = (unsigned)cast<ConstantSDNode>(N->getOperand(1))->getValue();
642 mu magics = magicu(d);
643 // Multiply the numerator (operand 0) by the magic value
644 SDOperand Q = CurDAG->getNode(ISD::MULHU, MVT::i32, N->getOperand(0),
645 CurDAG->getConstant(magics.m, MVT::i32));
646 if (magics.a == 0) {
647 return CurDAG->getNode(ISD::SRL, MVT::i32, Q,
648 CurDAG->getConstant(magics.s, MVT::i32));
649 } else {
650 SDOperand NPQ = CurDAG->getNode(ISD::SUB, MVT::i32, N->getOperand(0), Q);
651 NPQ = CurDAG->getNode(ISD::SRL, MVT::i32, NPQ,
652 CurDAG->getConstant(1, MVT::i32));
653 NPQ = CurDAG->getNode(ISD::ADD, MVT::i32, NPQ, Q);
654 return CurDAG->getNode(ISD::SRL, MVT::i32, NPQ,
655 CurDAG->getConstant(magics.s-1, MVT::i32));
656 }
657}
658
Nate Begeman1d9d7422005-10-18 00:28:58 +0000659SDOperand PPCDAGToDAGISel::SelectDYNAMIC_STACKALLOC(SDOperand Op) {
Chris Lattnerbd937b92005-10-06 18:45:51 +0000660 SDNode *N = Op.Val;
661
662 // FIXME: We are currently ignoring the requested alignment for handling
663 // greater than the stack alignment. This will need to be revisited at some
664 // point. Align = N.getOperand(2);
665 if (!isa<ConstantSDNode>(N->getOperand(2)) ||
666 cast<ConstantSDNode>(N->getOperand(2))->getValue() != 0) {
667 std::cerr << "Cannot allocate stack object with greater alignment than"
668 << " the stack alignment yet!";
669 abort();
670 }
671 SDOperand Chain = Select(N->getOperand(0));
672 SDOperand Amt = Select(N->getOperand(1));
673
674 SDOperand R1Reg = CurDAG->getRegister(PPC::R1, MVT::i32);
675
676 SDOperand R1Val = CurDAG->getCopyFromReg(Chain, PPC::R1, MVT::i32);
677 Chain = R1Val.getValue(1);
678
679 // Subtract the amount (guaranteed to be a multiple of the stack alignment)
680 // from the stack pointer, giving us the result pointer.
681 SDOperand Result = CurDAG->getTargetNode(PPC::SUBF, MVT::i32, Amt, R1Val);
682
683 // Copy this result back into R1.
684 Chain = CurDAG->getNode(ISD::CopyToReg, MVT::Other, Chain, R1Reg, Result);
685
686 // Copy this result back out of R1 to make sure we're not using the stack
687 // space without decrementing the stack pointer.
688 Result = CurDAG->getCopyFromReg(Chain, PPC::R1, MVT::i32);
689
690 // Finally, replace the DYNAMIC_STACKALLOC with the copyfromreg.
691 CodeGenMap[Op.getValue(0)] = Result;
692 CodeGenMap[Op.getValue(1)] = Result.getValue(1);
693 return SDOperand(Result.Val, Op.ResNo);
694}
695
Nate Begeman1d9d7422005-10-18 00:28:58 +0000696SDOperand PPCDAGToDAGISel::SelectADD_PARTS(SDOperand Op) {
Chris Lattner2b63e4c2005-10-06 18:56:10 +0000697 SDNode *N = Op.Val;
698 SDOperand LHSL = Select(N->getOperand(0));
699 SDOperand LHSH = Select(N->getOperand(1));
700
701 unsigned Imm;
702 bool ME = false, ZE = false;
703 if (isIntImmediate(N->getOperand(3), Imm)) {
704 ME = (signed)Imm == -1;
705 ZE = Imm == 0;
706 }
707
708 std::vector<SDOperand> Result;
709 SDOperand CarryFromLo;
710 if (isIntImmediate(N->getOperand(2), Imm) &&
711 ((signed)Imm >= -32768 || (signed)Imm < 32768)) {
712 // Codegen the low 32 bits of the add. Interestingly, there is no
713 // shifted form of add immediate carrying.
714 CarryFromLo = CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
715 LHSL, getI32Imm(Imm));
716 } else {
717 CarryFromLo = CurDAG->getTargetNode(PPC::ADDC, MVT::i32, MVT::Flag,
718 LHSL, Select(N->getOperand(2)));
719 }
720 CarryFromLo = CarryFromLo.getValue(1);
721
722 // Codegen the high 32 bits, adding zero, minus one, or the full value
723 // along with the carry flag produced by addc/addic.
724 SDOperand ResultHi;
725 if (ZE)
726 ResultHi = CurDAG->getTargetNode(PPC::ADDZE, MVT::i32, LHSH, CarryFromLo);
727 else if (ME)
728 ResultHi = CurDAG->getTargetNode(PPC::ADDME, MVT::i32, LHSH, CarryFromLo);
729 else
730 ResultHi = CurDAG->getTargetNode(PPC::ADDE, MVT::i32, LHSH,
731 Select(N->getOperand(3)), CarryFromLo);
732 Result.push_back(CarryFromLo.getValue(0));
733 Result.push_back(ResultHi);
734
735 CodeGenMap[Op.getValue(0)] = Result[0];
736 CodeGenMap[Op.getValue(1)] = Result[1];
737 return Result[Op.ResNo];
738}
Nate Begeman1d9d7422005-10-18 00:28:58 +0000739SDOperand PPCDAGToDAGISel::SelectSUB_PARTS(SDOperand Op) {
Chris Lattner2b63e4c2005-10-06 18:56:10 +0000740 SDNode *N = Op.Val;
741 SDOperand LHSL = Select(N->getOperand(0));
742 SDOperand LHSH = Select(N->getOperand(1));
743 SDOperand RHSL = Select(N->getOperand(2));
744 SDOperand RHSH = Select(N->getOperand(3));
745
746 std::vector<SDOperand> Result;
747 Result.push_back(CurDAG->getTargetNode(PPC::SUBFC, MVT::i32, MVT::Flag,
748 RHSL, LHSL));
749 Result.push_back(CurDAG->getTargetNode(PPC::SUBFE, MVT::i32, RHSH, LHSH,
750 Result[0].getValue(1)));
751 CodeGenMap[Op.getValue(0)] = Result[0];
752 CodeGenMap[Op.getValue(1)] = Result[1];
753 return Result[Op.ResNo];
754}
755
Nate Begeman1d9d7422005-10-18 00:28:58 +0000756SDOperand PPCDAGToDAGISel::SelectSETCC(SDOperand Op) {
Chris Lattner222adac2005-10-06 19:03:35 +0000757 SDNode *N = Op.Val;
758 unsigned Imm;
759 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(2))->get();
760 if (isIntImmediate(N->getOperand(1), Imm)) {
761 // We can codegen setcc op, imm very efficiently compared to a brcond.
762 // Check for those cases here.
763 // setcc op, 0
764 if (Imm == 0) {
765 SDOperand Op = Select(N->getOperand(0));
766 switch (CC) {
767 default: assert(0 && "Unhandled SetCC condition"); abort();
768 case ISD::SETEQ:
769 Op = CurDAG->getTargetNode(PPC::CNTLZW, MVT::i32, Op);
770 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Op, getI32Imm(27),
771 getI32Imm(5), getI32Imm(31));
772 break;
773 case ISD::SETNE: {
774 SDOperand AD = CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
775 Op, getI32Imm(~0U));
776 CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, AD, Op, AD.getValue(1));
777 break;
778 }
779 case ISD::SETLT:
780 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Op, getI32Imm(1),
781 getI32Imm(31), getI32Imm(31));
782 break;
783 case ISD::SETGT: {
784 SDOperand T = CurDAG->getTargetNode(PPC::NEG, MVT::i32, Op);
785 T = CurDAG->getTargetNode(PPC::ANDC, MVT::i32, T, Op);;
786 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, T, getI32Imm(1),
787 getI32Imm(31), getI32Imm(31));
788 break;
789 }
790 }
791 return SDOperand(N, 0);
792 } else if (Imm == ~0U) { // setcc op, -1
793 SDOperand Op = Select(N->getOperand(0));
794 switch (CC) {
795 default: assert(0 && "Unhandled SetCC condition"); abort();
796 case ISD::SETEQ:
797 Op = CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
798 Op, getI32Imm(1));
799 CurDAG->SelectNodeTo(N, PPC::ADDZE, MVT::i32,
800 CurDAG->getTargetNode(PPC::LI, MVT::i32,
801 getI32Imm(0)),
802 Op.getValue(1));
803 break;
804 case ISD::SETNE: {
805 Op = CurDAG->getTargetNode(PPC::NOR, MVT::i32, Op, Op);
806 SDOperand AD = CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
807 Op, getI32Imm(~0U));
808 CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, AD, Op, AD.getValue(1));
809 break;
810 }
811 case ISD::SETLT: {
812 SDOperand AD = CurDAG->getTargetNode(PPC::ADDI, MVT::i32, Op,
813 getI32Imm(1));
814 SDOperand AN = CurDAG->getTargetNode(PPC::AND, MVT::i32, AD, Op);
815 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, AN, getI32Imm(1),
816 getI32Imm(31), getI32Imm(31));
817 break;
818 }
819 case ISD::SETGT:
820 Op = CurDAG->getTargetNode(PPC::RLWINM, MVT::i32, Op, getI32Imm(1),
821 getI32Imm(31), getI32Imm(31));
822 CurDAG->SelectNodeTo(N, PPC::XORI, MVT::i32, Op, getI32Imm(1));
823 break;
824 }
825 return SDOperand(N, 0);
826 }
827 }
828
829 bool Inv;
830 unsigned Idx = getCRIdxForSetCC(CC, Inv);
831 SDOperand CCReg = SelectCC(N->getOperand(0), N->getOperand(1), CC);
832 SDOperand IntCR;
833
834 // Force the ccreg into CR7.
835 SDOperand CR7Reg = CurDAG->getRegister(PPC::CR7, MVT::i32);
836
837 std::vector<MVT::ValueType> VTs;
838 VTs.push_back(MVT::Other);
839 VTs.push_back(MVT::Flag); // NONSTANDARD CopyToReg node: defines a flag
840 std::vector<SDOperand> Ops;
841 Ops.push_back(CurDAG->getEntryNode());
842 Ops.push_back(CR7Reg);
843 Ops.push_back(CCReg);
844 CCReg = CurDAG->getNode(ISD::CopyToReg, VTs, Ops).getValue(1);
845
846 if (TLI.getTargetMachine().getSubtarget<PPCSubtarget>().isGigaProcessor())
847 IntCR = CurDAG->getTargetNode(PPC::MFOCRF, MVT::i32, CR7Reg, CCReg);
848 else
849 IntCR = CurDAG->getTargetNode(PPC::MFCR, MVT::i32, CCReg);
850
851 if (!Inv) {
852 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, IntCR,
853 getI32Imm(32-(3-Idx)), getI32Imm(31), getI32Imm(31));
854 } else {
855 SDOperand Tmp =
856 CurDAG->getTargetNode(PPC::RLWINM, MVT::i32, IntCR,
857 getI32Imm(32-(3-Idx)), getI32Imm(31),getI32Imm(31));
858 CurDAG->SelectNodeTo(N, PPC::XORI, MVT::i32, Tmp, getI32Imm(1));
859 }
860
861 return SDOperand(N, 0);
862}
Chris Lattner2b63e4c2005-10-06 18:56:10 +0000863
Nate Begeman1d9d7422005-10-18 00:28:58 +0000864SDOperand PPCDAGToDAGISel::SelectCALL(SDOperand Op) {
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000865 SDNode *N = Op.Val;
866 SDOperand Chain = Select(N->getOperand(0));
867
868 unsigned CallOpcode;
869 std::vector<SDOperand> CallOperands;
870
871 if (GlobalAddressSDNode *GASD =
872 dyn_cast<GlobalAddressSDNode>(N->getOperand(1))) {
873 CallOpcode = PPC::CALLpcrel;
874 CallOperands.push_back(CurDAG->getTargetGlobalAddress(GASD->getGlobal(),
875 MVT::i32));
876 } else if (ExternalSymbolSDNode *ESSDN =
877 dyn_cast<ExternalSymbolSDNode>(N->getOperand(1))) {
878 CallOpcode = PPC::CALLpcrel;
879 CallOperands.push_back(N->getOperand(1));
880 } else {
881 // Copy the callee address into the CTR register.
882 SDOperand Callee = Select(N->getOperand(1));
883 Chain = CurDAG->getTargetNode(PPC::MTCTR, MVT::Other, Callee, Chain);
884
885 // Copy the callee address into R12 on darwin.
886 SDOperand R12 = CurDAG->getRegister(PPC::R12, MVT::i32);
887 Chain = CurDAG->getNode(ISD::CopyToReg, MVT::Other, Chain, R12, Callee);
888
889 CallOperands.push_back(getI32Imm(20)); // Information to encode indcall
890 CallOperands.push_back(getI32Imm(0)); // Information to encode indcall
891 CallOperands.push_back(R12);
892 CallOpcode = PPC::CALLindirect;
893 }
894
895 unsigned GPR_idx = 0, FPR_idx = 0;
896 static const unsigned GPR[] = {
897 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
898 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
899 };
900 static const unsigned FPR[] = {
901 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
902 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
903 };
904
905 SDOperand InFlag; // Null incoming flag value.
906
907 for (unsigned i = 2, e = N->getNumOperands(); i != e; ++i) {
908 unsigned DestReg = 0;
909 MVT::ValueType RegTy = N->getOperand(i).getValueType();
910 if (RegTy == MVT::i32) {
911 assert(GPR_idx < 8 && "Too many int args");
912 DestReg = GPR[GPR_idx++];
913 } else {
914 assert(MVT::isFloatingPoint(N->getOperand(i).getValueType()) &&
915 "Unpromoted integer arg?");
916 assert(FPR_idx < 13 && "Too many fp args");
917 DestReg = FPR[FPR_idx++];
918 }
919
920 if (N->getOperand(i).getOpcode() != ISD::UNDEF) {
921 SDOperand Val = Select(N->getOperand(i));
922 Chain = CurDAG->getCopyToReg(Chain, DestReg, Val, InFlag);
923 InFlag = Chain.getValue(1);
924 CallOperands.push_back(CurDAG->getRegister(DestReg, RegTy));
925 }
926 }
927
928 // Finally, once everything is in registers to pass to the call, emit the
929 // call itself.
930 if (InFlag.Val)
931 CallOperands.push_back(InFlag); // Strong dep on register copies.
932 else
933 CallOperands.push_back(Chain); // Weak dep on whatever occurs before
934 Chain = CurDAG->getTargetNode(CallOpcode, MVT::Other, MVT::Flag,
935 CallOperands);
936
937 std::vector<SDOperand> CallResults;
938
939 // If the call has results, copy the values out of the ret val registers.
940 switch (N->getValueType(0)) {
941 default: assert(0 && "Unexpected ret value!");
942 case MVT::Other: break;
943 case MVT::i32:
944 if (N->getValueType(1) == MVT::i32) {
945 Chain = CurDAG->getCopyFromReg(Chain, PPC::R4, MVT::i32,
946 Chain.getValue(1)).getValue(1);
947 CallResults.push_back(Chain.getValue(0));
948 Chain = CurDAG->getCopyFromReg(Chain, PPC::R3, MVT::i32,
949 Chain.getValue(2)).getValue(1);
950 CallResults.push_back(Chain.getValue(0));
951 } else {
952 Chain = CurDAG->getCopyFromReg(Chain, PPC::R3, MVT::i32,
953 Chain.getValue(1)).getValue(1);
954 CallResults.push_back(Chain.getValue(0));
955 }
956 break;
957 case MVT::f32:
958 case MVT::f64:
959 Chain = CurDAG->getCopyFromReg(Chain, PPC::F1, N->getValueType(0),
960 Chain.getValue(1)).getValue(1);
961 CallResults.push_back(Chain.getValue(0));
962 break;
963 }
964
965 CallResults.push_back(Chain);
966 for (unsigned i = 0, e = CallResults.size(); i != e; ++i)
967 CodeGenMap[Op.getValue(i)] = CallResults[i];
968 return CallResults[Op.ResNo];
969}
970
Chris Lattnera5a91b12005-08-17 19:33:03 +0000971// Select - Convert the specified operand from a target-independent to a
972// target-specific node if it hasn't already been changed.
Nate Begeman1d9d7422005-10-18 00:28:58 +0000973SDOperand PPCDAGToDAGISel::Select(SDOperand Op) {
Chris Lattnera5a91b12005-08-17 19:33:03 +0000974 SDNode *N = Op.Val;
Chris Lattner0bbea952005-08-26 20:25:03 +0000975 if (N->getOpcode() >= ISD::BUILTIN_OP_END &&
976 N->getOpcode() < PPCISD::FIRST_NUMBER)
Chris Lattnera5a91b12005-08-17 19:33:03 +0000977 return Op; // Already selected.
Chris Lattnerd3d2cf52005-09-29 00:59:32 +0000978
979 // If this has already been converted, use it.
980 std::map<SDOperand, SDOperand>::iterator CGMI = CodeGenMap.find(Op);
981 if (CGMI != CodeGenMap.end()) return CGMI->second;
Chris Lattnera5a91b12005-08-17 19:33:03 +0000982
983 switch (N->getOpcode()) {
Chris Lattner19c09072005-09-07 23:45:15 +0000984 default: break;
Chris Lattner222adac2005-10-06 19:03:35 +0000985 case ISD::DYNAMIC_STACKALLOC: return SelectDYNAMIC_STACKALLOC(Op);
986 case ISD::ADD_PARTS: return SelectADD_PARTS(Op);
987 case ISD::SUB_PARTS: return SelectSUB_PARTS(Op);
988 case ISD::SETCC: return SelectSETCC(Op);
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000989 case ISD::CALL: return SelectCALL(Op);
990 case ISD::TAILCALL: return SelectCALL(Op);
991
Chris Lattnera5a91b12005-08-17 19:33:03 +0000992 case ISD::TokenFactor: {
993 SDOperand New;
994 if (N->getNumOperands() == 2) {
995 SDOperand Op0 = Select(N->getOperand(0));
996 SDOperand Op1 = Select(N->getOperand(1));
997 New = CurDAG->getNode(ISD::TokenFactor, MVT::Other, Op0, Op1);
998 } else {
999 std::vector<SDOperand> Ops;
1000 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
Chris Lattner7e659972005-08-19 21:33:02 +00001001 Ops.push_back(Select(N->getOperand(i)));
Chris Lattnera5a91b12005-08-17 19:33:03 +00001002 New = CurDAG->getNode(ISD::TokenFactor, MVT::Other, Ops);
1003 }
1004
Chris Lattnercf01a702005-10-07 22:10:27 +00001005 CodeGenMap[Op] = New;
Chris Lattnerd3d2cf52005-09-29 00:59:32 +00001006 return New;
Chris Lattnera5a91b12005-08-17 19:33:03 +00001007 }
1008 case ISD::CopyFromReg: {
1009 SDOperand Chain = Select(N->getOperand(0));
1010 if (Chain == N->getOperand(0)) return Op; // No change
1011 SDOperand New = CurDAG->getCopyFromReg(Chain,
1012 cast<RegisterSDNode>(N->getOperand(1))->getReg(), N->getValueType(0));
1013 return New.getValue(Op.ResNo);
1014 }
1015 case ISD::CopyToReg: {
1016 SDOperand Chain = Select(N->getOperand(0));
1017 SDOperand Reg = N->getOperand(1);
1018 SDOperand Val = Select(N->getOperand(2));
Chris Lattnerd3d2cf52005-09-29 00:59:32 +00001019 SDOperand New = CurDAG->getNode(ISD::CopyToReg, MVT::Other,
1020 Chain, Reg, Val);
Chris Lattnercf01a702005-10-07 22:10:27 +00001021 CodeGenMap[Op] = New;
Chris Lattnerd3d2cf52005-09-29 00:59:32 +00001022 return New;
Chris Lattnera5a91b12005-08-17 19:33:03 +00001023 }
Chris Lattner2b544002005-08-24 23:08:16 +00001024 case ISD::UNDEF:
1025 if (N->getValueType(0) == MVT::i32)
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001026 CurDAG->SelectNodeTo(N, PPC::IMPLICIT_DEF_GPR, MVT::i32);
Chris Lattner919c0322005-10-01 01:35:02 +00001027 else if (N->getValueType(0) == MVT::f32)
1028 CurDAG->SelectNodeTo(N, PPC::IMPLICIT_DEF_F4, MVT::f32);
1029 else
1030 CurDAG->SelectNodeTo(N, PPC::IMPLICIT_DEF_F8, MVT::f64);
Chris Lattner25dae722005-09-03 00:53:47 +00001031 return SDOperand(N, 0);
Chris Lattnere28e40a2005-08-25 00:45:43 +00001032 case ISD::FrameIndex: {
1033 int FI = cast<FrameIndexSDNode>(N)->getIndex();
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001034 CurDAG->SelectNodeTo(N, PPC::ADDI, MVT::i32,
Chris Lattnere28e40a2005-08-25 00:45:43 +00001035 CurDAG->getTargetFrameIndex(FI, MVT::i32),
1036 getI32Imm(0));
Chris Lattner25dae722005-09-03 00:53:47 +00001037 return SDOperand(N, 0);
Chris Lattnere28e40a2005-08-25 00:45:43 +00001038 }
Chris Lattner34e17052005-08-25 05:04:11 +00001039 case ISD::ConstantPool: {
Chris Lattner5839bf22005-08-26 17:15:30 +00001040 Constant *C = cast<ConstantPoolSDNode>(N)->get();
1041 SDOperand Tmp, CPI = CurDAG->getTargetConstantPool(C, MVT::i32);
Chris Lattner34e17052005-08-25 05:04:11 +00001042 if (PICEnabled)
1043 Tmp = CurDAG->getTargetNode(PPC::ADDIS, MVT::i32, getGlobalBaseReg(),CPI);
1044 else
1045 Tmp = CurDAG->getTargetNode(PPC::LIS, MVT::i32, CPI);
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001046 CurDAG->SelectNodeTo(N, PPC::LA, MVT::i32, Tmp, CPI);
Chris Lattner25dae722005-09-03 00:53:47 +00001047 return SDOperand(N, 0);
Chris Lattner34e17052005-08-25 05:04:11 +00001048 }
Chris Lattner4416f1a2005-08-19 22:38:53 +00001049 case ISD::GlobalAddress: {
1050 GlobalValue *GV = cast<GlobalAddressSDNode>(N)->getGlobal();
1051 SDOperand Tmp;
1052 SDOperand GA = CurDAG->getTargetGlobalAddress(GV, MVT::i32);
Chris Lattner9944b762005-08-21 22:31:09 +00001053 if (PICEnabled)
1054 Tmp = CurDAG->getTargetNode(PPC::ADDIS, MVT::i32, getGlobalBaseReg(), GA);
1055 else
Chris Lattner4416f1a2005-08-19 22:38:53 +00001056 Tmp = CurDAG->getTargetNode(PPC::LIS, MVT::i32, GA);
Chris Lattner9944b762005-08-21 22:31:09 +00001057
Chris Lattner4416f1a2005-08-19 22:38:53 +00001058 if (GV->hasWeakLinkage() || GV->isExternal())
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001059 CurDAG->SelectNodeTo(N, PPC::LWZ, MVT::i32, GA, Tmp);
Chris Lattner4416f1a2005-08-19 22:38:53 +00001060 else
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001061 CurDAG->SelectNodeTo(N, PPC::LA, MVT::i32, Tmp, GA);
Chris Lattner25dae722005-09-03 00:53:47 +00001062 return SDOperand(N, 0);
Chris Lattner4416f1a2005-08-19 22:38:53 +00001063 }
Chris Lattner222adac2005-10-06 19:03:35 +00001064
Chris Lattner867940d2005-10-02 06:58:23 +00001065 case PPCISD::FSEL: {
Chris Lattner43f07a42005-10-02 07:07:49 +00001066 SDOperand Comparison = Select(N->getOperand(0));
1067 // Extend the comparison to 64-bits.
1068 if (Comparison.getValueType() == MVT::f32)
1069 Comparison = CurDAG->getTargetNode(PPC::FMRSD, MVT::f64, Comparison);
1070
1071 unsigned Opc = N->getValueType(0) == MVT::f32 ? PPC::FSELS : PPC::FSELD;
1072 CurDAG->SelectNodeTo(N, Opc, N->getValueType(0), Comparison,
1073 Select(N->getOperand(1)), Select(N->getOperand(2)));
Chris Lattner25dae722005-09-03 00:53:47 +00001074 return SDOperand(N, 0);
Chris Lattner867940d2005-10-02 06:58:23 +00001075 }
Nate Begemanc09eeec2005-09-06 22:03:27 +00001076 case PPCISD::FCFID:
1077 CurDAG->SelectNodeTo(N, PPC::FCFID, N->getValueType(0),
1078 Select(N->getOperand(0)));
1079 return SDOperand(N, 0);
1080 case PPCISD::FCTIDZ:
1081 CurDAG->SelectNodeTo(N, PPC::FCTIDZ, N->getValueType(0),
1082 Select(N->getOperand(0)));
1083 return SDOperand(N, 0);
Chris Lattnerf7605322005-08-31 21:09:52 +00001084 case PPCISD::FCTIWZ:
1085 CurDAG->SelectNodeTo(N, PPC::FCTIWZ, N->getValueType(0),
1086 Select(N->getOperand(0)));
Chris Lattner25dae722005-09-03 00:53:47 +00001087 return SDOperand(N, 0);
Chris Lattner615c2d02005-09-28 22:29:58 +00001088 case ISD::FADD: {
1089 MVT::ValueType Ty = N->getValueType(0);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001090 if (!NoExcessFPPrecision) { // Match FMA ops
Chris Lattner615c2d02005-09-28 22:29:58 +00001091 if (N->getOperand(0).getOpcode() == ISD::FMUL &&
Chris Lattnera5a91b12005-08-17 19:33:03 +00001092 N->getOperand(0).Val->hasOneUse()) {
1093 ++FusedFP; // Statistic
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001094 CurDAG->SelectNodeTo(N, Ty == MVT::f64 ? PPC::FMADD : PPC::FMADDS, Ty,
Chris Lattnera5a91b12005-08-17 19:33:03 +00001095 Select(N->getOperand(0).getOperand(0)),
1096 Select(N->getOperand(0).getOperand(1)),
1097 Select(N->getOperand(1)));
Chris Lattner25dae722005-09-03 00:53:47 +00001098 return SDOperand(N, 0);
Chris Lattner615c2d02005-09-28 22:29:58 +00001099 } else if (N->getOperand(1).getOpcode() == ISD::FMUL &&
Chris Lattnera5a91b12005-08-17 19:33:03 +00001100 N->getOperand(1).hasOneUse()) {
1101 ++FusedFP; // Statistic
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001102 CurDAG->SelectNodeTo(N, Ty == MVT::f64 ? PPC::FMADD : PPC::FMADDS, Ty,
Chris Lattnera5a91b12005-08-17 19:33:03 +00001103 Select(N->getOperand(1).getOperand(0)),
1104 Select(N->getOperand(1).getOperand(1)),
1105 Select(N->getOperand(0)));
Chris Lattner25dae722005-09-03 00:53:47 +00001106 return SDOperand(N, 0);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001107 }
1108 }
1109
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001110 CurDAG->SelectNodeTo(N, Ty == MVT::f64 ? PPC::FADD : PPC::FADDS, Ty,
Chris Lattnera5a91b12005-08-17 19:33:03 +00001111 Select(N->getOperand(0)), Select(N->getOperand(1)));
Chris Lattner25dae722005-09-03 00:53:47 +00001112 return SDOperand(N, 0);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001113 }
Chris Lattner615c2d02005-09-28 22:29:58 +00001114 case ISD::FSUB: {
1115 MVT::ValueType Ty = N->getValueType(0);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001116
1117 if (!NoExcessFPPrecision) { // Match FMA ops
Chris Lattner615c2d02005-09-28 22:29:58 +00001118 if (N->getOperand(0).getOpcode() == ISD::FMUL &&
Chris Lattnera5a91b12005-08-17 19:33:03 +00001119 N->getOperand(0).Val->hasOneUse()) {
1120 ++FusedFP; // Statistic
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001121 CurDAG->SelectNodeTo(N, Ty == MVT::f64 ? PPC::FMSUB : PPC::FMSUBS, Ty,
Chris Lattnera5a91b12005-08-17 19:33:03 +00001122 Select(N->getOperand(0).getOperand(0)),
1123 Select(N->getOperand(0).getOperand(1)),
1124 Select(N->getOperand(1)));
Chris Lattner25dae722005-09-03 00:53:47 +00001125 return SDOperand(N, 0);
Chris Lattner615c2d02005-09-28 22:29:58 +00001126 } else if (N->getOperand(1).getOpcode() == ISD::FMUL &&
Chris Lattnera5a91b12005-08-17 19:33:03 +00001127 N->getOperand(1).Val->hasOneUse()) {
1128 ++FusedFP; // Statistic
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001129 CurDAG->SelectNodeTo(N, Ty == MVT::f64 ? PPC::FNMSUB : PPC::FNMSUBS, Ty,
Chris Lattnera5a91b12005-08-17 19:33:03 +00001130 Select(N->getOperand(1).getOperand(0)),
1131 Select(N->getOperand(1).getOperand(1)),
1132 Select(N->getOperand(0)));
Chris Lattner25dae722005-09-03 00:53:47 +00001133 return SDOperand(N, 0);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001134 }
1135 }
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001136 CurDAG->SelectNodeTo(N, Ty == MVT::f64 ? PPC::FSUB : PPC::FSUBS, Ty,
Chris Lattnera5a91b12005-08-17 19:33:03 +00001137 Select(N->getOperand(0)),
1138 Select(N->getOperand(1)));
Chris Lattner25dae722005-09-03 00:53:47 +00001139 return SDOperand(N, 0);
Nate Begeman26653502005-08-17 23:46:35 +00001140 }
Chris Lattner88add102005-09-28 22:50:24 +00001141 case ISD::SDIV: {
Chris Lattner8784a232005-08-25 17:50:06 +00001142 unsigned Imm;
1143 if (isIntImmediate(N->getOperand(1), Imm)) {
1144 if ((signed)Imm > 0 && isPowerOf2_32(Imm)) {
1145 SDOperand Op =
1146 CurDAG->getTargetNode(PPC::SRAWI, MVT::i32, MVT::Flag,
1147 Select(N->getOperand(0)),
1148 getI32Imm(Log2_32(Imm)));
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001149 CurDAG->SelectNodeTo(N, PPC::ADDZE, MVT::i32,
Chris Lattner8784a232005-08-25 17:50:06 +00001150 Op.getValue(0), Op.getValue(1));
Chris Lattner25dae722005-09-03 00:53:47 +00001151 return SDOperand(N, 0);
Chris Lattner8784a232005-08-25 17:50:06 +00001152 } else if ((signed)Imm < 0 && isPowerOf2_32(-Imm)) {
1153 SDOperand Op =
Chris Lattner2501d5e2005-08-30 17:13:58 +00001154 CurDAG->getTargetNode(PPC::SRAWI, MVT::i32, MVT::Flag,
Chris Lattner8784a232005-08-25 17:50:06 +00001155 Select(N->getOperand(0)),
1156 getI32Imm(Log2_32(-Imm)));
1157 SDOperand PT =
Chris Lattner2501d5e2005-08-30 17:13:58 +00001158 CurDAG->getTargetNode(PPC::ADDZE, MVT::i32, Op.getValue(0),
1159 Op.getValue(1));
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001160 CurDAG->SelectNodeTo(N, PPC::NEG, MVT::i32, PT);
Chris Lattner25dae722005-09-03 00:53:47 +00001161 return SDOperand(N, 0);
Chris Lattner047b9522005-08-25 22:04:30 +00001162 } else if (Imm) {
1163 SDOperand Result = Select(BuildSDIVSequence(N));
Chris Lattnerd3d2cf52005-09-29 00:59:32 +00001164 CodeGenMap[Op] = Result;
1165 return Result;
Chris Lattner8784a232005-08-25 17:50:06 +00001166 }
1167 }
Chris Lattner047b9522005-08-25 22:04:30 +00001168
Chris Lattner237733e2005-09-29 23:33:31 +00001169 // Other cases are autogenerated.
1170 break;
Chris Lattner047b9522005-08-25 22:04:30 +00001171 }
1172 case ISD::UDIV: {
1173 // If this is a divide by constant, we can emit code using some magic
1174 // constants to implement it as a multiply instead.
1175 unsigned Imm;
Chris Lattnera9317ed2005-08-25 23:21:06 +00001176 if (isIntImmediate(N->getOperand(1), Imm) && Imm) {
Chris Lattner047b9522005-08-25 22:04:30 +00001177 SDOperand Result = Select(BuildUDIVSequence(N));
Chris Lattnerd3d2cf52005-09-29 00:59:32 +00001178 CodeGenMap[Op] = Result;
1179 return Result;
Chris Lattner047b9522005-08-25 22:04:30 +00001180 }
1181
Chris Lattner237733e2005-09-29 23:33:31 +00001182 // Other cases are autogenerated.
1183 break;
Chris Lattner047b9522005-08-25 22:04:30 +00001184 }
Nate Begemancffc32b2005-08-18 07:30:46 +00001185 case ISD::AND: {
Nate Begemana6940472005-08-18 18:01:39 +00001186 unsigned Imm;
Nate Begemancffc32b2005-08-18 07:30:46 +00001187 // If this is an and of a value rotated between 0 and 31 bits and then and'd
1188 // with a mask, emit rlwinm
1189 if (isIntImmediate(N->getOperand(1), Imm) && (isShiftedMask_32(Imm) ||
1190 isShiftedMask_32(~Imm))) {
1191 SDOperand Val;
Nate Begemana6940472005-08-18 18:01:39 +00001192 unsigned SH, MB, ME;
Nate Begemancffc32b2005-08-18 07:30:46 +00001193 if (isRotateAndMask(N->getOperand(0).Val, Imm, false, SH, MB, ME)) {
1194 Val = Select(N->getOperand(0).getOperand(0));
1195 } else {
1196 Val = Select(N->getOperand(0));
1197 isRunOfOnes(Imm, MB, ME);
1198 SH = 0;
1199 }
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001200 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Val, getI32Imm(SH),
Nate Begemancffc32b2005-08-18 07:30:46 +00001201 getI32Imm(MB), getI32Imm(ME));
Chris Lattner25dae722005-09-03 00:53:47 +00001202 return SDOperand(N, 0);
Nate Begemancffc32b2005-08-18 07:30:46 +00001203 }
Chris Lattner237733e2005-09-29 23:33:31 +00001204
1205 // Other cases are autogenerated.
1206 break;
Nate Begemancffc32b2005-08-18 07:30:46 +00001207 }
Nate Begeman02b88a42005-08-19 00:38:14 +00001208 case ISD::OR:
Chris Lattnerd3d2cf52005-09-29 00:59:32 +00001209 if (SDNode *I = SelectBitfieldInsert(N))
1210 return CodeGenMap[Op] = SDOperand(I, 0);
Chris Lattnerd3d2cf52005-09-29 00:59:32 +00001211
Chris Lattner237733e2005-09-29 23:33:31 +00001212 // Other cases are autogenerated.
1213 break;
Nate Begemanda32c9e2005-10-19 00:05:37 +00001214 case ISD::TRUNCATE: {
1215 assert(N->getValueType(0) == MVT::i32 &&
1216 N->getOperand(0).getValueType() == MVT::i64 &&
1217 "TRUNCATE only supported for i64 -> i32");
1218 // FIXME: this code breaks ScheduleDAG since Op0 is an i64 and OR4
1219 // takes i32s.
1220 SDOperand Op0 = Select(N->getOperand(0));
1221 CurDAG->SelectNodeTo(N, PPC::OR4, MVT::i32, Op0, Op0);
1222 break;
1223 }
Nate Begeman4a959452005-10-18 23:23:37 +00001224 case ISD::ANY_EXTEND:
1225 switch(N->getValueType(0)) {
1226 default: assert(0 && "Unhandled type in ANY_EXTEND");
Nate Begemanda32c9e2005-10-19 00:05:37 +00001227 case MVT::i64: {
1228 // FIXME: this code breaks ScheduleDAG since Op0 is an i32 and OR8
1229 // takes i64s.
1230 SDOperand Op0 = Select(N->getOperand(0));
1231 CurDAG->SelectNodeTo(N, PPC::OR8, MVT::i64, Op0, Op0);
Nate Begeman4a959452005-10-18 23:23:37 +00001232 break;
1233 }
Nate Begemanda32c9e2005-10-19 00:05:37 +00001234 }
Nate Begeman4a959452005-10-18 23:23:37 +00001235 return SDOperand(N, 0);
1236 case ISD::ZERO_EXTEND:
1237 assert(N->getValueType(0) == MVT::i64 &&
1238 N->getOperand(0).getValueType() == MVT::i32 &&
1239 "ZERO_EXTEND only supported for i32 -> i64");
1240 CurDAG->SelectNodeTo(N, PPC::RLDICL, MVT::i64, Select(N->getOperand(0)),
1241 getI32Imm(32));
1242 return SDOperand(N, 0);
Nate Begemanc15ed442005-08-18 23:38:00 +00001243 case ISD::SHL: {
1244 unsigned Imm, SH, MB, ME;
1245 if (isOpcWithIntImmediate(N->getOperand(0).Val, ISD::AND, Imm) &&
1246 isRotateAndMask(N, Imm, true, SH, MB, ME))
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001247 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32,
Nate Begemanc15ed442005-08-18 23:38:00 +00001248 Select(N->getOperand(0).getOperand(0)),
1249 getI32Imm(SH), getI32Imm(MB), getI32Imm(ME));
1250 else if (isIntImmediate(N->getOperand(1), Imm))
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001251 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Select(N->getOperand(0)),
Nate Begemanc15ed442005-08-18 23:38:00 +00001252 getI32Imm(Imm), getI32Imm(0), getI32Imm(31-Imm));
1253 else
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001254 CurDAG->SelectNodeTo(N, PPC::SLW, MVT::i32, Select(N->getOperand(0)),
Nate Begemanc15ed442005-08-18 23:38:00 +00001255 Select(N->getOperand(1)));
Chris Lattner25dae722005-09-03 00:53:47 +00001256 return SDOperand(N, 0);
Nate Begemanc15ed442005-08-18 23:38:00 +00001257 }
1258 case ISD::SRL: {
1259 unsigned Imm, SH, MB, ME;
1260 if (isOpcWithIntImmediate(N->getOperand(0).Val, ISD::AND, Imm) &&
1261 isRotateAndMask(N, Imm, true, SH, MB, ME))
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001262 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32,
Nate Begemanc15ed442005-08-18 23:38:00 +00001263 Select(N->getOperand(0).getOperand(0)),
Nate Begemanc09eeec2005-09-06 22:03:27 +00001264 getI32Imm(SH & 0x1F), getI32Imm(MB), getI32Imm(ME));
Nate Begemanc15ed442005-08-18 23:38:00 +00001265 else if (isIntImmediate(N->getOperand(1), Imm))
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001266 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Select(N->getOperand(0)),
Nate Begemanc09eeec2005-09-06 22:03:27 +00001267 getI32Imm((32-Imm) & 0x1F), getI32Imm(Imm),
1268 getI32Imm(31));
Nate Begemanc15ed442005-08-18 23:38:00 +00001269 else
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001270 CurDAG->SelectNodeTo(N, PPC::SRW, MVT::i32, Select(N->getOperand(0)),
Nate Begemanc15ed442005-08-18 23:38:00 +00001271 Select(N->getOperand(1)));
Chris Lattner25dae722005-09-03 00:53:47 +00001272 return SDOperand(N, 0);
Nate Begemanc15ed442005-08-18 23:38:00 +00001273 }
Nate Begeman26653502005-08-17 23:46:35 +00001274 case ISD::FNEG: {
1275 SDOperand Val = Select(N->getOperand(0));
1276 MVT::ValueType Ty = N->getValueType(0);
Chris Lattner4cb5a1b2005-10-15 22:06:18 +00001277 if (N->getOperand(0).Val->hasOneUse()) {
Nate Begeman26653502005-08-17 23:46:35 +00001278 unsigned Opc;
Chris Lattner528f58e2005-08-28 23:39:22 +00001279 switch (Val.isTargetOpcode() ? Val.getTargetOpcode() : 0) {
Nate Begeman26653502005-08-17 23:46:35 +00001280 default: Opc = 0; break;
Chris Lattner919c0322005-10-01 01:35:02 +00001281 case PPC::FABSS: Opc = PPC::FNABSS; break;
1282 case PPC::FABSD: Opc = PPC::FNABSD; break;
Nate Begeman26653502005-08-17 23:46:35 +00001283 case PPC::FMADD: Opc = PPC::FNMADD; break;
1284 case PPC::FMADDS: Opc = PPC::FNMADDS; break;
1285 case PPC::FMSUB: Opc = PPC::FNMSUB; break;
1286 case PPC::FMSUBS: Opc = PPC::FNMSUBS; break;
1287 }
1288 // If we inverted the opcode, then emit the new instruction with the
1289 // inverted opcode and the original instruction's operands. Otherwise,
1290 // fall through and generate a fneg instruction.
1291 if (Opc) {
Chris Lattner919c0322005-10-01 01:35:02 +00001292 if (Opc == PPC::FNABSS || Opc == PPC::FNABSD)
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001293 CurDAG->SelectNodeTo(N, Opc, Ty, Val.getOperand(0));
Nate Begeman26653502005-08-17 23:46:35 +00001294 else
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001295 CurDAG->SelectNodeTo(N, Opc, Ty, Val.getOperand(0),
Nate Begeman26653502005-08-17 23:46:35 +00001296 Val.getOperand(1), Val.getOperand(2));
Chris Lattner25dae722005-09-03 00:53:47 +00001297 return SDOperand(N, 0);
Nate Begeman26653502005-08-17 23:46:35 +00001298 }
1299 }
Chris Lattner919c0322005-10-01 01:35:02 +00001300 if (Ty == MVT::f32)
1301 CurDAG->SelectNodeTo(N, PPC::FNEGS, MVT::f32, Val);
1302 else
Chris Lattner2c1760f2005-10-01 02:51:36 +00001303 CurDAG->SelectNodeTo(N, PPC::FNEGD, MVT::f64, Val);
Chris Lattner25dae722005-09-03 00:53:47 +00001304 return SDOperand(N, 0);
Nate Begeman26653502005-08-17 23:46:35 +00001305 }
Chris Lattner9944b762005-08-21 22:31:09 +00001306 case ISD::LOAD:
1307 case ISD::EXTLOAD:
1308 case ISD::ZEXTLOAD:
1309 case ISD::SEXTLOAD: {
1310 SDOperand Op1, Op2;
1311 bool isIdx = SelectAddr(N->getOperand(1), Op1, Op2);
1312
1313 MVT::ValueType TypeBeingLoaded = (N->getOpcode() == ISD::LOAD) ?
1314 N->getValueType(0) : cast<VTSDNode>(N->getOperand(3))->getVT();
1315 unsigned Opc;
1316 switch (TypeBeingLoaded) {
1317 default: N->dump(); assert(0 && "Cannot load this type!");
1318 case MVT::i1:
1319 case MVT::i8: Opc = isIdx ? PPC::LBZX : PPC::LBZ; break;
1320 case MVT::i16:
1321 if (N->getOpcode() == ISD::SEXTLOAD) { // SEXT load?
1322 Opc = isIdx ? PPC::LHAX : PPC::LHA;
1323 } else {
1324 Opc = isIdx ? PPC::LHZX : PPC::LHZ;
1325 }
1326 break;
1327 case MVT::i32: Opc = isIdx ? PPC::LWZX : PPC::LWZ; break;
1328 case MVT::f32: Opc = isIdx ? PPC::LFSX : PPC::LFS; break;
1329 case MVT::f64: Opc = isIdx ? PPC::LFDX : PPC::LFD; break;
1330 }
1331
Chris Lattner919c0322005-10-01 01:35:02 +00001332 // If this is an f32 -> f64 load, emit the f32 load, then use an 'extending
1333 // copy'.
1334 if (TypeBeingLoaded != MVT::f32 || N->getOpcode() == ISD::LOAD) {
1335 CurDAG->SelectNodeTo(N, Opc, N->getValueType(0), MVT::Other,
1336 Op1, Op2, Select(N->getOperand(0)));
1337 return SDOperand(N, Op.ResNo);
1338 } else {
1339 std::vector<SDOperand> Ops;
1340 Ops.push_back(Op1);
1341 Ops.push_back(Op2);
1342 Ops.push_back(Select(N->getOperand(0)));
1343 SDOperand Res = CurDAG->getTargetNode(Opc, MVT::f32, MVT::Other, Ops);
1344 SDOperand Ext = CurDAG->getTargetNode(PPC::FMRSD, MVT::f64, Res);
1345 CodeGenMap[Op.getValue(0)] = Ext;
1346 CodeGenMap[Op.getValue(1)] = Res.getValue(1);
1347 if (Op.ResNo)
1348 return Res.getValue(1);
1349 else
1350 return Ext;
1351 }
Chris Lattner9944b762005-08-21 22:31:09 +00001352 }
Chris Lattnerf7f22552005-08-22 01:27:59 +00001353 case ISD::TRUNCSTORE:
1354 case ISD::STORE: {
1355 SDOperand AddrOp1, AddrOp2;
1356 bool isIdx = SelectAddr(N->getOperand(2), AddrOp1, AddrOp2);
1357
1358 unsigned Opc;
1359 if (N->getOpcode() == ISD::STORE) {
1360 switch (N->getOperand(1).getValueType()) {
1361 default: assert(0 && "unknown Type in store");
1362 case MVT::i32: Opc = isIdx ? PPC::STWX : PPC::STW; break;
1363 case MVT::f64: Opc = isIdx ? PPC::STFDX : PPC::STFD; break;
1364 case MVT::f32: Opc = isIdx ? PPC::STFSX : PPC::STFS; break;
1365 }
1366 } else { //ISD::TRUNCSTORE
1367 switch(cast<VTSDNode>(N->getOperand(4))->getVT()) {
1368 default: assert(0 && "unknown Type in store");
Chris Lattnerf7f22552005-08-22 01:27:59 +00001369 case MVT::i8: Opc = isIdx ? PPC::STBX : PPC::STB; break;
1370 case MVT::i16: Opc = isIdx ? PPC::STHX : PPC::STH; break;
1371 }
1372 }
Chris Lattnerfb0c9642005-08-24 22:45:17 +00001373
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001374 CurDAG->SelectNodeTo(N, Opc, MVT::Other, Select(N->getOperand(1)),
Chris Lattnerf7f22552005-08-22 01:27:59 +00001375 AddrOp1, AddrOp2, Select(N->getOperand(0)));
Chris Lattner25dae722005-09-03 00:53:47 +00001376 return SDOperand(N, 0);
Chris Lattnerf7f22552005-08-22 01:27:59 +00001377 }
Chris Lattner64906a02005-08-25 20:08:18 +00001378
Chris Lattner13794f52005-08-26 18:46:49 +00001379 case ISD::SELECT_CC: {
1380 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(4))->get();
1381
1382 // handle the setcc cases here. select_cc lhs, 0, 1, 0, cc
1383 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N->getOperand(1)))
1384 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N->getOperand(2)))
1385 if (ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N->getOperand(3)))
1386 if (N1C->isNullValue() && N3C->isNullValue() &&
1387 N2C->getValue() == 1ULL && CC == ISD::SETNE) {
1388 SDOperand LHS = Select(N->getOperand(0));
1389 SDOperand Tmp =
1390 CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
1391 LHS, getI32Imm(~0U));
1392 CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, Tmp, LHS,
1393 Tmp.getValue(1));
Chris Lattner25dae722005-09-03 00:53:47 +00001394 return SDOperand(N, 0);
Chris Lattner13794f52005-08-26 18:46:49 +00001395 }
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00001396
Chris Lattner50ff55c2005-09-01 19:20:44 +00001397 SDOperand CCReg = SelectCC(N->getOperand(0), N->getOperand(1), CC);
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00001398 unsigned BROpc = getBCCForSetCC(CC);
1399
1400 bool isFP = MVT::isFloatingPoint(N->getValueType(0));
Chris Lattner919c0322005-10-01 01:35:02 +00001401 unsigned SelectCCOp;
1402 if (MVT::isInteger(N->getValueType(0)))
1403 SelectCCOp = PPC::SELECT_CC_Int;
1404 else if (N->getValueType(0) == MVT::f32)
1405 SelectCCOp = PPC::SELECT_CC_F4;
1406 else
1407 SelectCCOp = PPC::SELECT_CC_F8;
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00001408 CurDAG->SelectNodeTo(N, SelectCCOp, N->getValueType(0), CCReg,
1409 Select(N->getOperand(2)), Select(N->getOperand(3)),
1410 getI32Imm(BROpc));
Chris Lattner25dae722005-09-03 00:53:47 +00001411 return SDOperand(N, 0);
Chris Lattner13794f52005-08-26 18:46:49 +00001412 }
1413
Chris Lattnera2590c52005-08-24 00:47:15 +00001414 case ISD::CALLSEQ_START:
1415 case ISD::CALLSEQ_END: {
1416 unsigned Amt = cast<ConstantSDNode>(N->getOperand(1))->getValue();
1417 unsigned Opc = N->getOpcode() == ISD::CALLSEQ_START ?
1418 PPC::ADJCALLSTACKDOWN : PPC::ADJCALLSTACKUP;
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001419 CurDAG->SelectNodeTo(N, Opc, MVT::Other,
Chris Lattnerfb0c9642005-08-24 22:45:17 +00001420 getI32Imm(Amt), Select(N->getOperand(0)));
Chris Lattner25dae722005-09-03 00:53:47 +00001421 return SDOperand(N, 0);
Chris Lattnera2590c52005-08-24 00:47:15 +00001422 }
Chris Lattnera5a91b12005-08-17 19:33:03 +00001423 case ISD::RET: {
1424 SDOperand Chain = Select(N->getOperand(0)); // Token chain.
1425
Chris Lattner7a49fdc2005-08-31 01:34:29 +00001426 if (N->getNumOperands() == 2) {
Chris Lattnera5a91b12005-08-17 19:33:03 +00001427 SDOperand Val = Select(N->getOperand(1));
Chris Lattnereb80fe82005-08-30 22:59:48 +00001428 if (N->getOperand(1).getValueType() == MVT::i32) {
Chris Lattnera5a91b12005-08-17 19:33:03 +00001429 Chain = CurDAG->getCopyToReg(Chain, PPC::R3, Val);
Chris Lattnereb80fe82005-08-30 22:59:48 +00001430 } else {
1431 assert(MVT::isFloatingPoint(N->getOperand(1).getValueType()));
1432 Chain = CurDAG->getCopyToReg(Chain, PPC::F1, Val);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001433 }
Chris Lattner7a49fdc2005-08-31 01:34:29 +00001434 } else if (N->getNumOperands() > 1) {
1435 assert(N->getOperand(1).getValueType() == MVT::i32 &&
1436 N->getOperand(2).getValueType() == MVT::i32 &&
1437 N->getNumOperands() == 3 && "Unknown two-register ret value!");
1438 Chain = CurDAG->getCopyToReg(Chain, PPC::R4, Select(N->getOperand(1)));
1439 Chain = CurDAG->getCopyToReg(Chain, PPC::R3, Select(N->getOperand(2)));
Chris Lattnera5a91b12005-08-17 19:33:03 +00001440 }
1441
1442 // Finally, select this to a blr (return) instruction.
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001443 CurDAG->SelectNodeTo(N, PPC::BLR, MVT::Other, Chain);
Chris Lattner25dae722005-09-03 00:53:47 +00001444 return SDOperand(N, 0);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001445 }
Chris Lattner89532c72005-08-25 00:29:58 +00001446 case ISD::BR:
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001447 CurDAG->SelectNodeTo(N, PPC::B, MVT::Other, N->getOperand(1),
Chris Lattner89532c72005-08-25 00:29:58 +00001448 Select(N->getOperand(0)));
Chris Lattner25dae722005-09-03 00:53:47 +00001449 return SDOperand(N, 0);
Chris Lattner2fbb4572005-08-21 18:50:37 +00001450 case ISD::BR_CC:
1451 case ISD::BRTWOWAY_CC: {
1452 SDOperand Chain = Select(N->getOperand(0));
1453 MachineBasicBlock *Dest =
1454 cast<BasicBlockSDNode>(N->getOperand(4))->getBasicBlock();
1455 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(1))->get();
1456 SDOperand CondCode = SelectCC(N->getOperand(2), N->getOperand(3), CC);
Chris Lattner2fbb4572005-08-21 18:50:37 +00001457
1458 // If this is a two way branch, then grab the fallthrough basic block
1459 // argument and build a PowerPC branch pseudo-op, suitable for long branch
1460 // conversion if necessary by the branch selection pass. Otherwise, emit a
1461 // standard conditional branch.
1462 if (N->getOpcode() == ISD::BRTWOWAY_CC) {
Chris Lattnerca0a4772005-10-01 23:06:26 +00001463 SDOperand CondTrueBlock = N->getOperand(4);
1464 SDOperand CondFalseBlock = N->getOperand(5);
1465
1466 // If the false case is the current basic block, then this is a self loop.
1467 // We do not want to emit "Loop: ... brcond Out; br Loop", as it adds an
1468 // extra dispatch group to the loop. Instead, invert the condition and
1469 // emit "Loop: ... br!cond Loop; br Out
1470 if (cast<BasicBlockSDNode>(CondFalseBlock)->getBasicBlock() == BB) {
1471 std::swap(CondTrueBlock, CondFalseBlock);
1472 CC = getSetCCInverse(CC,
1473 MVT::isInteger(N->getOperand(2).getValueType()));
1474 }
1475
1476 unsigned Opc = getBCCForSetCC(CC);
Chris Lattner2fbb4572005-08-21 18:50:37 +00001477 SDOperand CB = CurDAG->getTargetNode(PPC::COND_BRANCH, MVT::Other,
1478 CondCode, getI32Imm(Opc),
Chris Lattnerca0a4772005-10-01 23:06:26 +00001479 CondTrueBlock, CondFalseBlock,
Chris Lattner2fbb4572005-08-21 18:50:37 +00001480 Chain);
Chris Lattnerca0a4772005-10-01 23:06:26 +00001481 CurDAG->SelectNodeTo(N, PPC::B, MVT::Other, CondFalseBlock, CB);
Chris Lattner2fbb4572005-08-21 18:50:37 +00001482 } else {
1483 // Iterate to the next basic block
1484 ilist<MachineBasicBlock>::iterator It = BB;
1485 ++It;
1486
1487 // If the fallthrough path is off the end of the function, which would be
1488 // undefined behavior, set it to be the same as the current block because
1489 // we have nothing better to set it to, and leaving it alone will cause
1490 // the PowerPC Branch Selection pass to crash.
1491 if (It == BB->getParent()->end()) It = Dest;
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001492 CurDAG->SelectNodeTo(N, PPC::COND_BRANCH, MVT::Other, CondCode,
Chris Lattnerca0a4772005-10-01 23:06:26 +00001493 getI32Imm(getBCCForSetCC(CC)), N->getOperand(4),
Chris Lattner2fbb4572005-08-21 18:50:37 +00001494 CurDAG->getBasicBlock(It), Chain);
1495 }
Chris Lattner25dae722005-09-03 00:53:47 +00001496 return SDOperand(N, 0);
Chris Lattner2fbb4572005-08-21 18:50:37 +00001497 }
Chris Lattnera5a91b12005-08-17 19:33:03 +00001498 }
Chris Lattner25dae722005-09-03 00:53:47 +00001499
Chris Lattner19c09072005-09-07 23:45:15 +00001500 return SelectCode(Op);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001501}
1502
1503
Nate Begeman1d9d7422005-10-18 00:28:58 +00001504/// createPPCISelDag - This pass converts a legalized DAG into a
Chris Lattnera5a91b12005-08-17 19:33:03 +00001505/// PowerPC-specific DAG, ready for instruction scheduling.
1506///
Nate Begeman1d9d7422005-10-18 00:28:58 +00001507FunctionPass *llvm::createPPCISelDag(TargetMachine &TM) {
1508 return new PPCDAGToDAGISel(TM);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001509}
1510