blob: 9b5c7d6444ff7c21006af020129666d38219be71 [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 //===--------------------------------------------------------------------===//
36 /// PPC32DAGToDAGISel - PPC32 specific code to select PPC32 machine
37 /// instructions for SelectionDAG operations.
38 ///
39 class PPC32DAGToDAGISel : 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:
43 PPC32DAGToDAGISel(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.
102void PPC32DAGToDAGISel::InstructionSelectBasicBlock(SelectionDAG &DAG) {
103 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///
Chris Lattner9944b762005-08-21 22:31:09 +0000159SDOperand PPC32DAGToDAGISel::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();
165 GlobalBaseReg = RegMap->createVirtualRegister(PPC32::GPRCRegisterClass);
166 BuildMI(FirstMBB, MBBI, PPC::MovePCtoLR, 0, PPC::LR);
167 BuildMI(FirstMBB, MBBI, PPC::MFLR, 1, GlobalBaseReg);
168 }
Chris Lattner9944b762005-08-21 22:31:09 +0000169 return CurDAG->getRegister(GlobalBaseReg, MVT::i32);
Chris Lattner4416f1a2005-08-19 22:38:53 +0000170}
171
172
Nate Begeman0f3257a2005-08-18 05:00:13 +0000173// isIntImmediate - This method tests to see if a constant operand.
174// If so Imm will receive the 32 bit value.
175static bool isIntImmediate(SDNode *N, unsigned& Imm) {
176 if (N->getOpcode() == ISD::Constant) {
177 Imm = cast<ConstantSDNode>(N)->getValue();
178 return true;
179 }
180 return false;
181}
182
Nate Begemancffc32b2005-08-18 07:30:46 +0000183// isOprShiftImm - Returns true if the specified operand is a shift opcode with
184// a immediate shift count less than 32.
185static bool isOprShiftImm(SDNode *N, unsigned& Opc, unsigned& SH) {
186 Opc = N->getOpcode();
187 return (Opc == ISD::SHL || Opc == ISD::SRL || Opc == ISD::SRA) &&
188 isIntImmediate(N->getOperand(1).Val, SH) && SH < 32;
189}
190
191// isRunOfOnes - Returns true iff Val consists of one contiguous run of 1s with
192// any number of 0s on either side. The 1s are allowed to wrap from LSB to
193// MSB, so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is
194// not, since all 1s are not contiguous.
195static bool isRunOfOnes(unsigned Val, unsigned &MB, unsigned &ME) {
196 if (isShiftedMask_32(Val)) {
197 // look for the first non-zero bit
198 MB = CountLeadingZeros_32(Val);
199 // look for the first zero bit after the run of ones
200 ME = CountLeadingZeros_32((Val - 1) ^ Val);
201 return true;
Chris Lattner2fe76e52005-08-25 04:47:18 +0000202 } else {
203 Val = ~Val; // invert mask
204 if (isShiftedMask_32(Val)) {
205 // effectively look for the first zero bit
206 ME = CountLeadingZeros_32(Val) - 1;
207 // effectively look for the first one bit after the run of zeros
208 MB = CountLeadingZeros_32((Val - 1) ^ Val) + 1;
209 return true;
210 }
Nate Begemancffc32b2005-08-18 07:30:46 +0000211 }
212 // no run present
213 return false;
214}
215
Chris Lattner65a419a2005-10-09 05:36:17 +0000216// isRotateAndMask - Returns true if Mask and Shift can be folded into a rotate
Nate Begemancffc32b2005-08-18 07:30:46 +0000217// and mask opcode and mask operation.
218static bool isRotateAndMask(SDNode *N, unsigned Mask, bool IsShiftMask,
219 unsigned &SH, unsigned &MB, unsigned &ME) {
220 unsigned Shift = 32;
221 unsigned Indeterminant = ~0; // bit mask marking indeterminant results
222 unsigned Opcode = N->getOpcode();
Chris Lattner15055732005-08-30 00:59:16 +0000223 if (N->getNumOperands() != 2 ||
224 !isIntImmediate(N->getOperand(1).Val, Shift) || (Shift > 31))
Nate Begemancffc32b2005-08-18 07:30:46 +0000225 return false;
226
227 if (Opcode == ISD::SHL) {
228 // apply shift left to mask if it comes first
229 if (IsShiftMask) Mask = Mask << Shift;
230 // determine which bits are made indeterminant by shift
231 Indeterminant = ~(0xFFFFFFFFu << Shift);
Chris Lattner651dea72005-10-15 21:40:12 +0000232 } else if (Opcode == ISD::SRL) {
Nate Begemancffc32b2005-08-18 07:30:46 +0000233 // apply shift right to mask if it comes first
234 if (IsShiftMask) Mask = Mask >> Shift;
235 // determine which bits are made indeterminant by shift
236 Indeterminant = ~(0xFFFFFFFFu >> Shift);
237 // adjust for the left rotate
238 Shift = 32 - Shift;
239 } else {
240 return false;
241 }
242
243 // if the mask doesn't intersect any Indeterminant bits
244 if (Mask && !(Mask & Indeterminant)) {
245 SH = Shift;
246 // make sure the mask is still a mask (wrap arounds may not be)
247 return isRunOfOnes(Mask, MB, ME);
248 }
249 return false;
250}
251
Nate Begeman0f3257a2005-08-18 05:00:13 +0000252// isOpcWithIntImmediate - This method tests to see if the node is a specific
253// opcode and that it has a immediate integer right operand.
254// If so Imm will receive the 32 bit value.
255static bool isOpcWithIntImmediate(SDNode *N, unsigned Opc, unsigned& Imm) {
256 return N->getOpcode() == Opc && isIntImmediate(N->getOperand(1).Val, Imm);
257}
258
259// isOprNot - Returns true if the specified operand is an xor with immediate -1.
260static bool isOprNot(SDNode *N) {
261 unsigned Imm;
262 return isOpcWithIntImmediate(N, ISD::XOR, Imm) && (signed)Imm == -1;
263}
264
Chris Lattnera5a91b12005-08-17 19:33:03 +0000265// Immediate constant composers.
266// Lo16 - grabs the lo 16 bits from a 32 bit constant.
267// Hi16 - grabs the hi 16 bits from a 32 bit constant.
268// HA16 - computes the hi bits required if the lo bits are add/subtracted in
269// arithmethically.
270static unsigned Lo16(unsigned x) { return x & 0x0000FFFF; }
271static unsigned Hi16(unsigned x) { return Lo16(x >> 16); }
272static unsigned HA16(unsigned x) { return Hi16((signed)x - (signed short)x); }
273
274// isIntImmediate - This method tests to see if a constant operand.
275// If so Imm will receive the 32 bit value.
276static bool isIntImmediate(SDOperand N, unsigned& Imm) {
277 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N)) {
278 Imm = (unsigned)CN->getSignExtended();
279 return true;
280 }
281 return false;
282}
283
Nate Begeman02b88a42005-08-19 00:38:14 +0000284/// SelectBitfieldInsert - turn an or of two masked values into
285/// the rotate left word immediate then mask insert (rlwimi) instruction.
286/// Returns true on success, false if the caller still needs to select OR.
287///
288/// Patterns matched:
289/// 1. or shl, and 5. or and, and
290/// 2. or and, shl 6. or shl, shr
291/// 3. or shr, and 7. or shr, shl
292/// 4. or and, shr
293SDNode *PPC32DAGToDAGISel::SelectBitfieldInsert(SDNode *N) {
294 bool IsRotate = false;
295 unsigned TgtMask = 0xFFFFFFFF, InsMask = 0xFFFFFFFF, SH = 0;
296 unsigned Value;
297
298 SDOperand Op0 = N->getOperand(0);
299 SDOperand Op1 = N->getOperand(1);
300
301 unsigned Op0Opc = Op0.getOpcode();
302 unsigned Op1Opc = Op1.getOpcode();
303
304 // Verify that we have the correct opcodes
305 if (ISD::SHL != Op0Opc && ISD::SRL != Op0Opc && ISD::AND != Op0Opc)
306 return false;
307 if (ISD::SHL != Op1Opc && ISD::SRL != Op1Opc && ISD::AND != Op1Opc)
308 return false;
309
310 // Generate Mask value for Target
311 if (isIntImmediate(Op0.getOperand(1), Value)) {
312 switch(Op0Opc) {
Chris Lattner13687212005-08-30 18:37:48 +0000313 case ISD::SHL: TgtMask <<= Value; break;
314 case ISD::SRL: TgtMask >>= Value; break;
315 case ISD::AND: TgtMask &= Value; break;
Nate Begeman02b88a42005-08-19 00:38:14 +0000316 }
317 } else {
318 return 0;
319 }
320
321 // Generate Mask value for Insert
Chris Lattner13687212005-08-30 18:37:48 +0000322 if (!isIntImmediate(Op1.getOperand(1), Value))
Nate Begeman02b88a42005-08-19 00:38:14 +0000323 return 0;
Chris Lattner13687212005-08-30 18:37:48 +0000324
325 switch(Op1Opc) {
326 case ISD::SHL:
327 SH = Value;
328 InsMask <<= SH;
329 if (Op0Opc == ISD::SRL) IsRotate = true;
330 break;
331 case ISD::SRL:
332 SH = Value;
333 InsMask >>= SH;
334 SH = 32-SH;
335 if (Op0Opc == ISD::SHL) IsRotate = true;
336 break;
337 case ISD::AND:
338 InsMask &= Value;
339 break;
Nate Begeman02b88a42005-08-19 00:38:14 +0000340 }
341
342 // If both of the inputs are ANDs and one of them has a logical shift by
343 // constant as its input, make that AND the inserted value so that we can
344 // combine the shift into the rotate part of the rlwimi instruction
345 bool IsAndWithShiftOp = false;
346 if (Op0Opc == ISD::AND && Op1Opc == ISD::AND) {
347 if (Op1.getOperand(0).getOpcode() == ISD::SHL ||
348 Op1.getOperand(0).getOpcode() == ISD::SRL) {
349 if (isIntImmediate(Op1.getOperand(0).getOperand(1), Value)) {
350 SH = Op1.getOperand(0).getOpcode() == ISD::SHL ? Value : 32 - Value;
351 IsAndWithShiftOp = true;
352 }
353 } else if (Op0.getOperand(0).getOpcode() == ISD::SHL ||
354 Op0.getOperand(0).getOpcode() == ISD::SRL) {
355 if (isIntImmediate(Op0.getOperand(0).getOperand(1), Value)) {
356 std::swap(Op0, Op1);
357 std::swap(TgtMask, InsMask);
358 SH = Op1.getOperand(0).getOpcode() == ISD::SHL ? Value : 32 - Value;
359 IsAndWithShiftOp = true;
360 }
361 }
362 }
363
364 // Verify that the Target mask and Insert mask together form a full word mask
365 // and that the Insert mask is a run of set bits (which implies both are runs
366 // of set bits). Given that, Select the arguments and generate the rlwimi
367 // instruction.
368 unsigned MB, ME;
369 if (((TgtMask & InsMask) == 0) && isRunOfOnes(InsMask, MB, ME)) {
370 bool fullMask = (TgtMask ^ InsMask) == 0xFFFFFFFF;
371 bool Op0IsAND = Op0Opc == ISD::AND;
372 // Check for rotlwi / rotrwi here, a special case of bitfield insert
373 // where both bitfield halves are sourced from the same value.
374 if (IsRotate && fullMask &&
375 N->getOperand(0).getOperand(0) == N->getOperand(1).getOperand(0)) {
376 Op0 = CurDAG->getTargetNode(PPC::RLWINM, MVT::i32,
377 Select(N->getOperand(0).getOperand(0)),
378 getI32Imm(SH), getI32Imm(0), getI32Imm(31));
379 return Op0.Val;
380 }
381 SDOperand Tmp1 = (Op0IsAND && fullMask) ? Select(Op0.getOperand(0))
382 : Select(Op0);
383 SDOperand Tmp2 = IsAndWithShiftOp ? Select(Op1.getOperand(0).getOperand(0))
384 : Select(Op1.getOperand(0));
385 Op0 = CurDAG->getTargetNode(PPC::RLWIMI, MVT::i32, Tmp1, Tmp2,
386 getI32Imm(SH), getI32Imm(MB), getI32Imm(ME));
387 return Op0.Val;
388 }
389 return 0;
390}
391
Chris Lattner9944b762005-08-21 22:31:09 +0000392/// SelectAddr - Given the specified address, return the two operands for a
393/// load/store instruction, and return true if it should be an indexed [r+r]
394/// operation.
395bool PPC32DAGToDAGISel::SelectAddr(SDOperand Addr, SDOperand &Op1,
396 SDOperand &Op2) {
397 unsigned imm = 0;
398 if (Addr.getOpcode() == ISD::ADD) {
399 if (isIntImmediate(Addr.getOperand(1), imm) && isInt16(imm)) {
400 Op1 = getI32Imm(Lo16(imm));
Chris Lattnere28e40a2005-08-25 00:45:43 +0000401 if (FrameIndexSDNode *FI =
402 dyn_cast<FrameIndexSDNode>(Addr.getOperand(0))) {
Chris Lattner9944b762005-08-21 22:31:09 +0000403 ++FrameOff;
Chris Lattnere28e40a2005-08-25 00:45:43 +0000404 Op2 = CurDAG->getTargetFrameIndex(FI->getIndex(), MVT::i32);
Chris Lattner9944b762005-08-21 22:31:09 +0000405 } else {
406 Op2 = Select(Addr.getOperand(0));
407 }
408 return false;
409 } else {
410 Op1 = Select(Addr.getOperand(0));
411 Op2 = Select(Addr.getOperand(1));
412 return true; // [r+r]
413 }
414 }
415
416 // Now check if we're dealing with a global, and whether or not we should emit
417 // an optimized load or store for statics.
418 if (GlobalAddressSDNode *GN = dyn_cast<GlobalAddressSDNode>(Addr)) {
419 GlobalValue *GV = GN->getGlobal();
420 if (!GV->hasWeakLinkage() && !GV->isExternal()) {
421 Op1 = CurDAG->getTargetGlobalAddress(GV, MVT::i32);
422 if (PICEnabled)
423 Op2 = CurDAG->getTargetNode(PPC::ADDIS, MVT::i32, getGlobalBaseReg(),
424 Op1);
425 else
426 Op2 = CurDAG->getTargetNode(PPC::LIS, MVT::i32, Op1);
427 return false;
428 }
Chris Lattnere28e40a2005-08-25 00:45:43 +0000429 } else if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(Addr)) {
Chris Lattner9944b762005-08-21 22:31:09 +0000430 Op1 = getI32Imm(0);
Chris Lattnere28e40a2005-08-25 00:45:43 +0000431 Op2 = CurDAG->getTargetFrameIndex(FI->getIndex(), MVT::i32);
Chris Lattner9944b762005-08-21 22:31:09 +0000432 return false;
433 } else if (ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(Addr)) {
434 Op1 = Addr;
435 if (PICEnabled)
436 Op2 = CurDAG->getTargetNode(PPC::ADDIS, MVT::i32, getGlobalBaseReg(),Op1);
437 else
438 Op2 = CurDAG->getTargetNode(PPC::LIS, MVT::i32, Op1);
439 return false;
440 }
441 Op1 = getI32Imm(0);
442 Op2 = Select(Addr);
443 return false;
444}
Chris Lattnera5a91b12005-08-17 19:33:03 +0000445
Chris Lattner2fbb4572005-08-21 18:50:37 +0000446/// SelectCC - Select a comparison of the specified values with the specified
447/// condition code, returning the CR# of the expression.
448SDOperand PPC32DAGToDAGISel::SelectCC(SDOperand LHS, SDOperand RHS,
449 ISD::CondCode CC) {
450 // Always select the LHS.
451 LHS = Select(LHS);
452
453 // Use U to determine whether the SETCC immediate range is signed or not.
454 if (MVT::isInteger(LHS.getValueType())) {
455 bool U = ISD::isUnsignedIntSetCC(CC);
456 unsigned Imm;
457 if (isIntImmediate(RHS, Imm) &&
458 ((U && isUInt16(Imm)) || (!U && isInt16(Imm))))
459 return CurDAG->getTargetNode(U ? PPC::CMPLWI : PPC::CMPWI, MVT::i32,
460 LHS, getI32Imm(Lo16(Imm)));
461 return CurDAG->getTargetNode(U ? PPC::CMPLW : PPC::CMPW, MVT::i32,
462 LHS, Select(RHS));
Chris Lattner919c0322005-10-01 01:35:02 +0000463 } else if (LHS.getValueType() == MVT::f32) {
464 return CurDAG->getTargetNode(PPC::FCMPUS, MVT::i32, LHS, Select(RHS));
Chris Lattner2fbb4572005-08-21 18:50:37 +0000465 } else {
Chris Lattner919c0322005-10-01 01:35:02 +0000466 return CurDAG->getTargetNode(PPC::FCMPUD, MVT::i32, LHS, Select(RHS));
Chris Lattner2fbb4572005-08-21 18:50:37 +0000467 }
468}
469
470/// getBCCForSetCC - Returns the PowerPC condition branch mnemonic corresponding
471/// to Condition.
472static unsigned getBCCForSetCC(ISD::CondCode CC) {
473 switch (CC) {
474 default: assert(0 && "Unknown condition!"); abort();
475 case ISD::SETEQ: return PPC::BEQ;
476 case ISD::SETNE: return PPC::BNE;
477 case ISD::SETULT:
478 case ISD::SETLT: return PPC::BLT;
479 case ISD::SETULE:
480 case ISD::SETLE: return PPC::BLE;
481 case ISD::SETUGT:
482 case ISD::SETGT: return PPC::BGT;
483 case ISD::SETUGE:
484 case ISD::SETGE: return PPC::BGE;
485 }
486 return 0;
487}
488
Chris Lattner64906a02005-08-25 20:08:18 +0000489/// getCRIdxForSetCC - Return the index of the condition register field
490/// associated with the SetCC condition, and whether or not the field is
491/// treated as inverted. That is, lt = 0; ge = 0 inverted.
492static unsigned getCRIdxForSetCC(ISD::CondCode CC, bool& Inv) {
493 switch (CC) {
494 default: assert(0 && "Unknown condition!"); abort();
495 case ISD::SETULT:
496 case ISD::SETLT: Inv = false; return 0;
497 case ISD::SETUGE:
498 case ISD::SETGE: Inv = true; return 0;
499 case ISD::SETUGT:
500 case ISD::SETGT: Inv = false; return 1;
501 case ISD::SETULE:
502 case ISD::SETLE: Inv = true; return 1;
503 case ISD::SETEQ: Inv = false; return 2;
504 case ISD::SETNE: Inv = true; return 2;
505 }
506 return 0;
507}
Chris Lattner9944b762005-08-21 22:31:09 +0000508
Chris Lattner047b9522005-08-25 22:04:30 +0000509// Structure used to return the necessary information to codegen an SDIV as
510// a multiply.
511struct ms {
512 int m; // magic number
513 int s; // shift amount
514};
515
516struct mu {
517 unsigned int m; // magic number
518 int a; // add indicator
519 int s; // shift amount
520};
521
522/// magic - calculate the magic numbers required to codegen an integer sdiv as
523/// a sequence of multiply and shifts. Requires that the divisor not be 0, 1,
524/// or -1.
525static struct ms magic(int d) {
526 int p;
527 unsigned int ad, anc, delta, q1, r1, q2, r2, t;
528 const unsigned int two31 = 0x80000000U;
529 struct ms mag;
530
531 ad = abs(d);
532 t = two31 + ((unsigned int)d >> 31);
533 anc = t - 1 - t%ad; // absolute value of nc
534 p = 31; // initialize p
535 q1 = two31/anc; // initialize q1 = 2p/abs(nc)
536 r1 = two31 - q1*anc; // initialize r1 = rem(2p,abs(nc))
537 q2 = two31/ad; // initialize q2 = 2p/abs(d)
538 r2 = two31 - q2*ad; // initialize r2 = rem(2p,abs(d))
539 do {
540 p = p + 1;
541 q1 = 2*q1; // update q1 = 2p/abs(nc)
542 r1 = 2*r1; // update r1 = rem(2p/abs(nc))
543 if (r1 >= anc) { // must be unsigned comparison
544 q1 = q1 + 1;
545 r1 = r1 - anc;
546 }
547 q2 = 2*q2; // update q2 = 2p/abs(d)
548 r2 = 2*r2; // update r2 = rem(2p/abs(d))
549 if (r2 >= ad) { // must be unsigned comparison
550 q2 = q2 + 1;
551 r2 = r2 - ad;
552 }
553 delta = ad - r2;
554 } while (q1 < delta || (q1 == delta && r1 == 0));
555
556 mag.m = q2 + 1;
557 if (d < 0) mag.m = -mag.m; // resulting magic number
558 mag.s = p - 32; // resulting shift
559 return mag;
560}
561
562/// magicu - calculate the magic numbers required to codegen an integer udiv as
563/// a sequence of multiply, add and shifts. Requires that the divisor not be 0.
564static struct mu magicu(unsigned d)
565{
566 int p;
567 unsigned int nc, delta, q1, r1, q2, r2;
568 struct mu magu;
569 magu.a = 0; // initialize "add" indicator
570 nc = - 1 - (-d)%d;
571 p = 31; // initialize p
572 q1 = 0x80000000/nc; // initialize q1 = 2p/nc
573 r1 = 0x80000000 - q1*nc; // initialize r1 = rem(2p,nc)
574 q2 = 0x7FFFFFFF/d; // initialize q2 = (2p-1)/d
575 r2 = 0x7FFFFFFF - q2*d; // initialize r2 = rem((2p-1),d)
576 do {
577 p = p + 1;
578 if (r1 >= nc - r1 ) {
579 q1 = 2*q1 + 1; // update q1
580 r1 = 2*r1 - nc; // update r1
581 }
582 else {
583 q1 = 2*q1; // update q1
584 r1 = 2*r1; // update r1
585 }
586 if (r2 + 1 >= d - r2) {
587 if (q2 >= 0x7FFFFFFF) magu.a = 1;
588 q2 = 2*q2 + 1; // update q2
589 r2 = 2*r2 + 1 - d; // update r2
590 }
591 else {
592 if (q2 >= 0x80000000) magu.a = 1;
593 q2 = 2*q2; // update q2
594 r2 = 2*r2 + 1; // update r2
595 }
596 delta = d - 1 - r2;
597 } while (p < 64 && (q1 < delta || (q1 == delta && r1 == 0)));
598 magu.m = q2 + 1; // resulting magic number
599 magu.s = p - 32; // resulting shift
600 return magu;
601}
602
603/// BuildSDIVSequence - Given an ISD::SDIV node expressing a divide by constant,
604/// return a DAG expression to select that will generate the same value by
605/// multiplying by a magic number. See:
606/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
607SDOperand PPC32DAGToDAGISel::BuildSDIVSequence(SDNode *N) {
608 int d = (int)cast<ConstantSDNode>(N->getOperand(1))->getValue();
609 ms magics = magic(d);
610 // Multiply the numerator (operand 0) by the magic value
611 SDOperand Q = CurDAG->getNode(ISD::MULHS, MVT::i32, N->getOperand(0),
612 CurDAG->getConstant(magics.m, MVT::i32));
613 // If d > 0 and m < 0, add the numerator
614 if (d > 0 && magics.m < 0)
615 Q = CurDAG->getNode(ISD::ADD, MVT::i32, Q, N->getOperand(0));
616 // If d < 0 and m > 0, subtract the numerator.
617 if (d < 0 && magics.m > 0)
618 Q = CurDAG->getNode(ISD::SUB, MVT::i32, Q, N->getOperand(0));
619 // Shift right algebraic if shift value is nonzero
620 if (magics.s > 0)
621 Q = CurDAG->getNode(ISD::SRA, MVT::i32, Q,
622 CurDAG->getConstant(magics.s, MVT::i32));
623 // Extract the sign bit and add it to the quotient
624 SDOperand T =
625 CurDAG->getNode(ISD::SRL, MVT::i32, Q, CurDAG->getConstant(31, MVT::i32));
626 return CurDAG->getNode(ISD::ADD, MVT::i32, Q, T);
627}
628
629/// BuildUDIVSequence - Given an ISD::UDIV node expressing a divide by constant,
630/// return a DAG expression to select that will generate the same value by
631/// multiplying by a magic number. See:
632/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
633SDOperand PPC32DAGToDAGISel::BuildUDIVSequence(SDNode *N) {
634 unsigned d = (unsigned)cast<ConstantSDNode>(N->getOperand(1))->getValue();
635 mu magics = magicu(d);
636 // Multiply the numerator (operand 0) by the magic value
637 SDOperand Q = CurDAG->getNode(ISD::MULHU, MVT::i32, N->getOperand(0),
638 CurDAG->getConstant(magics.m, MVT::i32));
639 if (magics.a == 0) {
640 return CurDAG->getNode(ISD::SRL, MVT::i32, Q,
641 CurDAG->getConstant(magics.s, MVT::i32));
642 } else {
643 SDOperand NPQ = CurDAG->getNode(ISD::SUB, MVT::i32, N->getOperand(0), Q);
644 NPQ = CurDAG->getNode(ISD::SRL, MVT::i32, NPQ,
645 CurDAG->getConstant(1, MVT::i32));
646 NPQ = CurDAG->getNode(ISD::ADD, MVT::i32, NPQ, Q);
647 return CurDAG->getNode(ISD::SRL, MVT::i32, NPQ,
648 CurDAG->getConstant(magics.s-1, MVT::i32));
649 }
650}
651
Chris Lattnerbd937b92005-10-06 18:45:51 +0000652SDOperand PPC32DAGToDAGISel::SelectDYNAMIC_STACKALLOC(SDOperand Op) {
653 SDNode *N = Op.Val;
654
655 // FIXME: We are currently ignoring the requested alignment for handling
656 // greater than the stack alignment. This will need to be revisited at some
657 // point. Align = N.getOperand(2);
658 if (!isa<ConstantSDNode>(N->getOperand(2)) ||
659 cast<ConstantSDNode>(N->getOperand(2))->getValue() != 0) {
660 std::cerr << "Cannot allocate stack object with greater alignment than"
661 << " the stack alignment yet!";
662 abort();
663 }
664 SDOperand Chain = Select(N->getOperand(0));
665 SDOperand Amt = Select(N->getOperand(1));
666
667 SDOperand R1Reg = CurDAG->getRegister(PPC::R1, MVT::i32);
668
669 SDOperand R1Val = CurDAG->getCopyFromReg(Chain, PPC::R1, MVT::i32);
670 Chain = R1Val.getValue(1);
671
672 // Subtract the amount (guaranteed to be a multiple of the stack alignment)
673 // from the stack pointer, giving us the result pointer.
674 SDOperand Result = CurDAG->getTargetNode(PPC::SUBF, MVT::i32, Amt, R1Val);
675
676 // Copy this result back into R1.
677 Chain = CurDAG->getNode(ISD::CopyToReg, MVT::Other, Chain, R1Reg, Result);
678
679 // Copy this result back out of R1 to make sure we're not using the stack
680 // space without decrementing the stack pointer.
681 Result = CurDAG->getCopyFromReg(Chain, PPC::R1, MVT::i32);
682
683 // Finally, replace the DYNAMIC_STACKALLOC with the copyfromreg.
684 CodeGenMap[Op.getValue(0)] = Result;
685 CodeGenMap[Op.getValue(1)] = Result.getValue(1);
686 return SDOperand(Result.Val, Op.ResNo);
687}
688
Chris Lattner2b63e4c2005-10-06 18:56:10 +0000689SDOperand PPC32DAGToDAGISel::SelectADD_PARTS(SDOperand Op) {
690 SDNode *N = Op.Val;
691 SDOperand LHSL = Select(N->getOperand(0));
692 SDOperand LHSH = Select(N->getOperand(1));
693
694 unsigned Imm;
695 bool ME = false, ZE = false;
696 if (isIntImmediate(N->getOperand(3), Imm)) {
697 ME = (signed)Imm == -1;
698 ZE = Imm == 0;
699 }
700
701 std::vector<SDOperand> Result;
702 SDOperand CarryFromLo;
703 if (isIntImmediate(N->getOperand(2), Imm) &&
704 ((signed)Imm >= -32768 || (signed)Imm < 32768)) {
705 // Codegen the low 32 bits of the add. Interestingly, there is no
706 // shifted form of add immediate carrying.
707 CarryFromLo = CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
708 LHSL, getI32Imm(Imm));
709 } else {
710 CarryFromLo = CurDAG->getTargetNode(PPC::ADDC, MVT::i32, MVT::Flag,
711 LHSL, Select(N->getOperand(2)));
712 }
713 CarryFromLo = CarryFromLo.getValue(1);
714
715 // Codegen the high 32 bits, adding zero, minus one, or the full value
716 // along with the carry flag produced by addc/addic.
717 SDOperand ResultHi;
718 if (ZE)
719 ResultHi = CurDAG->getTargetNode(PPC::ADDZE, MVT::i32, LHSH, CarryFromLo);
720 else if (ME)
721 ResultHi = CurDAG->getTargetNode(PPC::ADDME, MVT::i32, LHSH, CarryFromLo);
722 else
723 ResultHi = CurDAG->getTargetNode(PPC::ADDE, MVT::i32, LHSH,
724 Select(N->getOperand(3)), CarryFromLo);
725 Result.push_back(CarryFromLo.getValue(0));
726 Result.push_back(ResultHi);
727
728 CodeGenMap[Op.getValue(0)] = Result[0];
729 CodeGenMap[Op.getValue(1)] = Result[1];
730 return Result[Op.ResNo];
731}
732SDOperand PPC32DAGToDAGISel::SelectSUB_PARTS(SDOperand Op) {
733 SDNode *N = Op.Val;
734 SDOperand LHSL = Select(N->getOperand(0));
735 SDOperand LHSH = Select(N->getOperand(1));
736 SDOperand RHSL = Select(N->getOperand(2));
737 SDOperand RHSH = Select(N->getOperand(3));
738
739 std::vector<SDOperand> Result;
740 Result.push_back(CurDAG->getTargetNode(PPC::SUBFC, MVT::i32, MVT::Flag,
741 RHSL, LHSL));
742 Result.push_back(CurDAG->getTargetNode(PPC::SUBFE, MVT::i32, RHSH, LHSH,
743 Result[0].getValue(1)));
744 CodeGenMap[Op.getValue(0)] = Result[0];
745 CodeGenMap[Op.getValue(1)] = Result[1];
746 return Result[Op.ResNo];
747}
748
Chris Lattner222adac2005-10-06 19:03:35 +0000749SDOperand PPC32DAGToDAGISel::SelectSETCC(SDOperand Op) {
750 SDNode *N = Op.Val;
751 unsigned Imm;
752 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(2))->get();
753 if (isIntImmediate(N->getOperand(1), Imm)) {
754 // We can codegen setcc op, imm very efficiently compared to a brcond.
755 // Check for those cases here.
756 // setcc op, 0
757 if (Imm == 0) {
758 SDOperand Op = Select(N->getOperand(0));
759 switch (CC) {
760 default: assert(0 && "Unhandled SetCC condition"); abort();
761 case ISD::SETEQ:
762 Op = CurDAG->getTargetNode(PPC::CNTLZW, MVT::i32, Op);
763 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Op, getI32Imm(27),
764 getI32Imm(5), getI32Imm(31));
765 break;
766 case ISD::SETNE: {
767 SDOperand AD = CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
768 Op, getI32Imm(~0U));
769 CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, AD, Op, AD.getValue(1));
770 break;
771 }
772 case ISD::SETLT:
773 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Op, getI32Imm(1),
774 getI32Imm(31), getI32Imm(31));
775 break;
776 case ISD::SETGT: {
777 SDOperand T = CurDAG->getTargetNode(PPC::NEG, MVT::i32, Op);
778 T = CurDAG->getTargetNode(PPC::ANDC, MVT::i32, T, Op);;
779 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, T, getI32Imm(1),
780 getI32Imm(31), getI32Imm(31));
781 break;
782 }
783 }
784 return SDOperand(N, 0);
785 } else if (Imm == ~0U) { // setcc op, -1
786 SDOperand Op = Select(N->getOperand(0));
787 switch (CC) {
788 default: assert(0 && "Unhandled SetCC condition"); abort();
789 case ISD::SETEQ:
790 Op = CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
791 Op, getI32Imm(1));
792 CurDAG->SelectNodeTo(N, PPC::ADDZE, MVT::i32,
793 CurDAG->getTargetNode(PPC::LI, MVT::i32,
794 getI32Imm(0)),
795 Op.getValue(1));
796 break;
797 case ISD::SETNE: {
798 Op = CurDAG->getTargetNode(PPC::NOR, MVT::i32, Op, Op);
799 SDOperand AD = CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
800 Op, getI32Imm(~0U));
801 CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, AD, Op, AD.getValue(1));
802 break;
803 }
804 case ISD::SETLT: {
805 SDOperand AD = CurDAG->getTargetNode(PPC::ADDI, MVT::i32, Op,
806 getI32Imm(1));
807 SDOperand AN = CurDAG->getTargetNode(PPC::AND, MVT::i32, AD, Op);
808 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, AN, getI32Imm(1),
809 getI32Imm(31), getI32Imm(31));
810 break;
811 }
812 case ISD::SETGT:
813 Op = CurDAG->getTargetNode(PPC::RLWINM, MVT::i32, Op, getI32Imm(1),
814 getI32Imm(31), getI32Imm(31));
815 CurDAG->SelectNodeTo(N, PPC::XORI, MVT::i32, Op, getI32Imm(1));
816 break;
817 }
818 return SDOperand(N, 0);
819 }
820 }
821
822 bool Inv;
823 unsigned Idx = getCRIdxForSetCC(CC, Inv);
824 SDOperand CCReg = SelectCC(N->getOperand(0), N->getOperand(1), CC);
825 SDOperand IntCR;
826
827 // Force the ccreg into CR7.
828 SDOperand CR7Reg = CurDAG->getRegister(PPC::CR7, MVT::i32);
829
830 std::vector<MVT::ValueType> VTs;
831 VTs.push_back(MVT::Other);
832 VTs.push_back(MVT::Flag); // NONSTANDARD CopyToReg node: defines a flag
833 std::vector<SDOperand> Ops;
834 Ops.push_back(CurDAG->getEntryNode());
835 Ops.push_back(CR7Reg);
836 Ops.push_back(CCReg);
837 CCReg = CurDAG->getNode(ISD::CopyToReg, VTs, Ops).getValue(1);
838
839 if (TLI.getTargetMachine().getSubtarget<PPCSubtarget>().isGigaProcessor())
840 IntCR = CurDAG->getTargetNode(PPC::MFOCRF, MVT::i32, CR7Reg, CCReg);
841 else
842 IntCR = CurDAG->getTargetNode(PPC::MFCR, MVT::i32, CCReg);
843
844 if (!Inv) {
845 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, IntCR,
846 getI32Imm(32-(3-Idx)), getI32Imm(31), getI32Imm(31));
847 } else {
848 SDOperand Tmp =
849 CurDAG->getTargetNode(PPC::RLWINM, MVT::i32, IntCR,
850 getI32Imm(32-(3-Idx)), getI32Imm(31),getI32Imm(31));
851 CurDAG->SelectNodeTo(N, PPC::XORI, MVT::i32, Tmp, getI32Imm(1));
852 }
853
854 return SDOperand(N, 0);
855}
Chris Lattner2b63e4c2005-10-06 18:56:10 +0000856
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000857SDOperand PPC32DAGToDAGISel::SelectCALL(SDOperand Op) {
858 SDNode *N = Op.Val;
859 SDOperand Chain = Select(N->getOperand(0));
860
861 unsigned CallOpcode;
862 std::vector<SDOperand> CallOperands;
863
864 if (GlobalAddressSDNode *GASD =
865 dyn_cast<GlobalAddressSDNode>(N->getOperand(1))) {
866 CallOpcode = PPC::CALLpcrel;
867 CallOperands.push_back(CurDAG->getTargetGlobalAddress(GASD->getGlobal(),
868 MVT::i32));
869 } else if (ExternalSymbolSDNode *ESSDN =
870 dyn_cast<ExternalSymbolSDNode>(N->getOperand(1))) {
871 CallOpcode = PPC::CALLpcrel;
872 CallOperands.push_back(N->getOperand(1));
873 } else {
874 // Copy the callee address into the CTR register.
875 SDOperand Callee = Select(N->getOperand(1));
876 Chain = CurDAG->getTargetNode(PPC::MTCTR, MVT::Other, Callee, Chain);
877
878 // Copy the callee address into R12 on darwin.
879 SDOperand R12 = CurDAG->getRegister(PPC::R12, MVT::i32);
880 Chain = CurDAG->getNode(ISD::CopyToReg, MVT::Other, Chain, R12, Callee);
881
882 CallOperands.push_back(getI32Imm(20)); // Information to encode indcall
883 CallOperands.push_back(getI32Imm(0)); // Information to encode indcall
884 CallOperands.push_back(R12);
885 CallOpcode = PPC::CALLindirect;
886 }
887
888 unsigned GPR_idx = 0, FPR_idx = 0;
889 static const unsigned GPR[] = {
890 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
891 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
892 };
893 static const unsigned FPR[] = {
894 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
895 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
896 };
897
898 SDOperand InFlag; // Null incoming flag value.
899
900 for (unsigned i = 2, e = N->getNumOperands(); i != e; ++i) {
901 unsigned DestReg = 0;
902 MVT::ValueType RegTy = N->getOperand(i).getValueType();
903 if (RegTy == MVT::i32) {
904 assert(GPR_idx < 8 && "Too many int args");
905 DestReg = GPR[GPR_idx++];
906 } else {
907 assert(MVT::isFloatingPoint(N->getOperand(i).getValueType()) &&
908 "Unpromoted integer arg?");
909 assert(FPR_idx < 13 && "Too many fp args");
910 DestReg = FPR[FPR_idx++];
911 }
912
913 if (N->getOperand(i).getOpcode() != ISD::UNDEF) {
914 SDOperand Val = Select(N->getOperand(i));
915 Chain = CurDAG->getCopyToReg(Chain, DestReg, Val, InFlag);
916 InFlag = Chain.getValue(1);
917 CallOperands.push_back(CurDAG->getRegister(DestReg, RegTy));
918 }
919 }
920
921 // Finally, once everything is in registers to pass to the call, emit the
922 // call itself.
923 if (InFlag.Val)
924 CallOperands.push_back(InFlag); // Strong dep on register copies.
925 else
926 CallOperands.push_back(Chain); // Weak dep on whatever occurs before
927 Chain = CurDAG->getTargetNode(CallOpcode, MVT::Other, MVT::Flag,
928 CallOperands);
929
930 std::vector<SDOperand> CallResults;
931
932 // If the call has results, copy the values out of the ret val registers.
933 switch (N->getValueType(0)) {
934 default: assert(0 && "Unexpected ret value!");
935 case MVT::Other: break;
936 case MVT::i32:
937 if (N->getValueType(1) == MVT::i32) {
938 Chain = CurDAG->getCopyFromReg(Chain, PPC::R4, MVT::i32,
939 Chain.getValue(1)).getValue(1);
940 CallResults.push_back(Chain.getValue(0));
941 Chain = CurDAG->getCopyFromReg(Chain, PPC::R3, MVT::i32,
942 Chain.getValue(2)).getValue(1);
943 CallResults.push_back(Chain.getValue(0));
944 } else {
945 Chain = CurDAG->getCopyFromReg(Chain, PPC::R3, MVT::i32,
946 Chain.getValue(1)).getValue(1);
947 CallResults.push_back(Chain.getValue(0));
948 }
949 break;
950 case MVT::f32:
951 case MVT::f64:
952 Chain = CurDAG->getCopyFromReg(Chain, PPC::F1, N->getValueType(0),
953 Chain.getValue(1)).getValue(1);
954 CallResults.push_back(Chain.getValue(0));
955 break;
956 }
957
958 CallResults.push_back(Chain);
959 for (unsigned i = 0, e = CallResults.size(); i != e; ++i)
960 CodeGenMap[Op.getValue(i)] = CallResults[i];
961 return CallResults[Op.ResNo];
962}
963
Chris Lattnera5a91b12005-08-17 19:33:03 +0000964// Select - Convert the specified operand from a target-independent to a
965// target-specific node if it hasn't already been changed.
966SDOperand PPC32DAGToDAGISel::Select(SDOperand Op) {
967 SDNode *N = Op.Val;
Chris Lattner0bbea952005-08-26 20:25:03 +0000968 if (N->getOpcode() >= ISD::BUILTIN_OP_END &&
969 N->getOpcode() < PPCISD::FIRST_NUMBER)
Chris Lattnera5a91b12005-08-17 19:33:03 +0000970 return Op; // Already selected.
Chris Lattnerd3d2cf52005-09-29 00:59:32 +0000971
972 // If this has already been converted, use it.
973 std::map<SDOperand, SDOperand>::iterator CGMI = CodeGenMap.find(Op);
974 if (CGMI != CodeGenMap.end()) return CGMI->second;
Chris Lattnera5a91b12005-08-17 19:33:03 +0000975
976 switch (N->getOpcode()) {
Chris Lattner19c09072005-09-07 23:45:15 +0000977 default: break;
Chris Lattner222adac2005-10-06 19:03:35 +0000978 case ISD::DYNAMIC_STACKALLOC: return SelectDYNAMIC_STACKALLOC(Op);
979 case ISD::ADD_PARTS: return SelectADD_PARTS(Op);
980 case ISD::SUB_PARTS: return SelectSUB_PARTS(Op);
981 case ISD::SETCC: return SelectSETCC(Op);
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000982 case ISD::CALL: return SelectCALL(Op);
983 case ISD::TAILCALL: return SelectCALL(Op);
984
Chris Lattnera5a91b12005-08-17 19:33:03 +0000985 case ISD::TokenFactor: {
986 SDOperand New;
987 if (N->getNumOperands() == 2) {
988 SDOperand Op0 = Select(N->getOperand(0));
989 SDOperand Op1 = Select(N->getOperand(1));
990 New = CurDAG->getNode(ISD::TokenFactor, MVT::Other, Op0, Op1);
991 } else {
992 std::vector<SDOperand> Ops;
993 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
Chris Lattner7e659972005-08-19 21:33:02 +0000994 Ops.push_back(Select(N->getOperand(i)));
Chris Lattnera5a91b12005-08-17 19:33:03 +0000995 New = CurDAG->getNode(ISD::TokenFactor, MVT::Other, Ops);
996 }
997
Chris Lattnercf01a702005-10-07 22:10:27 +0000998 CodeGenMap[Op] = New;
Chris Lattnerd3d2cf52005-09-29 00:59:32 +0000999 return New;
Chris Lattnera5a91b12005-08-17 19:33:03 +00001000 }
1001 case ISD::CopyFromReg: {
1002 SDOperand Chain = Select(N->getOperand(0));
1003 if (Chain == N->getOperand(0)) return Op; // No change
1004 SDOperand New = CurDAG->getCopyFromReg(Chain,
1005 cast<RegisterSDNode>(N->getOperand(1))->getReg(), N->getValueType(0));
1006 return New.getValue(Op.ResNo);
1007 }
1008 case ISD::CopyToReg: {
1009 SDOperand Chain = Select(N->getOperand(0));
1010 SDOperand Reg = N->getOperand(1);
1011 SDOperand Val = Select(N->getOperand(2));
Chris Lattnerd3d2cf52005-09-29 00:59:32 +00001012 SDOperand New = CurDAG->getNode(ISD::CopyToReg, MVT::Other,
1013 Chain, Reg, Val);
Chris Lattnercf01a702005-10-07 22:10:27 +00001014 CodeGenMap[Op] = New;
Chris Lattnerd3d2cf52005-09-29 00:59:32 +00001015 return New;
Chris Lattnera5a91b12005-08-17 19:33:03 +00001016 }
Chris Lattner2b544002005-08-24 23:08:16 +00001017 case ISD::UNDEF:
1018 if (N->getValueType(0) == MVT::i32)
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001019 CurDAG->SelectNodeTo(N, PPC::IMPLICIT_DEF_GPR, MVT::i32);
Chris Lattner919c0322005-10-01 01:35:02 +00001020 else if (N->getValueType(0) == MVT::f32)
1021 CurDAG->SelectNodeTo(N, PPC::IMPLICIT_DEF_F4, MVT::f32);
1022 else
1023 CurDAG->SelectNodeTo(N, PPC::IMPLICIT_DEF_F8, MVT::f64);
Chris Lattner25dae722005-09-03 00:53:47 +00001024 return SDOperand(N, 0);
Chris Lattnere28e40a2005-08-25 00:45:43 +00001025 case ISD::FrameIndex: {
1026 int FI = cast<FrameIndexSDNode>(N)->getIndex();
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001027 CurDAG->SelectNodeTo(N, PPC::ADDI, MVT::i32,
Chris Lattnere28e40a2005-08-25 00:45:43 +00001028 CurDAG->getTargetFrameIndex(FI, MVT::i32),
1029 getI32Imm(0));
Chris Lattner25dae722005-09-03 00:53:47 +00001030 return SDOperand(N, 0);
Chris Lattnere28e40a2005-08-25 00:45:43 +00001031 }
Chris Lattner34e17052005-08-25 05:04:11 +00001032 case ISD::ConstantPool: {
Chris Lattner5839bf22005-08-26 17:15:30 +00001033 Constant *C = cast<ConstantPoolSDNode>(N)->get();
1034 SDOperand Tmp, CPI = CurDAG->getTargetConstantPool(C, MVT::i32);
Chris Lattner34e17052005-08-25 05:04:11 +00001035 if (PICEnabled)
1036 Tmp = CurDAG->getTargetNode(PPC::ADDIS, MVT::i32, getGlobalBaseReg(),CPI);
1037 else
1038 Tmp = CurDAG->getTargetNode(PPC::LIS, MVT::i32, CPI);
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001039 CurDAG->SelectNodeTo(N, PPC::LA, MVT::i32, Tmp, CPI);
Chris Lattner25dae722005-09-03 00:53:47 +00001040 return SDOperand(N, 0);
Chris Lattner34e17052005-08-25 05:04:11 +00001041 }
Chris Lattner4416f1a2005-08-19 22:38:53 +00001042 case ISD::GlobalAddress: {
1043 GlobalValue *GV = cast<GlobalAddressSDNode>(N)->getGlobal();
1044 SDOperand Tmp;
1045 SDOperand GA = CurDAG->getTargetGlobalAddress(GV, MVT::i32);
Chris Lattner9944b762005-08-21 22:31:09 +00001046 if (PICEnabled)
1047 Tmp = CurDAG->getTargetNode(PPC::ADDIS, MVT::i32, getGlobalBaseReg(), GA);
1048 else
Chris Lattner4416f1a2005-08-19 22:38:53 +00001049 Tmp = CurDAG->getTargetNode(PPC::LIS, MVT::i32, GA);
Chris Lattner9944b762005-08-21 22:31:09 +00001050
Chris Lattner4416f1a2005-08-19 22:38:53 +00001051 if (GV->hasWeakLinkage() || GV->isExternal())
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001052 CurDAG->SelectNodeTo(N, PPC::LWZ, MVT::i32, GA, Tmp);
Chris Lattner4416f1a2005-08-19 22:38:53 +00001053 else
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001054 CurDAG->SelectNodeTo(N, PPC::LA, MVT::i32, Tmp, GA);
Chris Lattner25dae722005-09-03 00:53:47 +00001055 return SDOperand(N, 0);
Chris Lattner4416f1a2005-08-19 22:38:53 +00001056 }
Chris Lattner222adac2005-10-06 19:03:35 +00001057
Chris Lattner867940d2005-10-02 06:58:23 +00001058 case PPCISD::FSEL: {
Chris Lattner43f07a42005-10-02 07:07:49 +00001059 SDOperand Comparison = Select(N->getOperand(0));
1060 // Extend the comparison to 64-bits.
1061 if (Comparison.getValueType() == MVT::f32)
1062 Comparison = CurDAG->getTargetNode(PPC::FMRSD, MVT::f64, Comparison);
1063
1064 unsigned Opc = N->getValueType(0) == MVT::f32 ? PPC::FSELS : PPC::FSELD;
1065 CurDAG->SelectNodeTo(N, Opc, N->getValueType(0), Comparison,
1066 Select(N->getOperand(1)), Select(N->getOperand(2)));
Chris Lattner25dae722005-09-03 00:53:47 +00001067 return SDOperand(N, 0);
Chris Lattner867940d2005-10-02 06:58:23 +00001068 }
Nate Begemanc09eeec2005-09-06 22:03:27 +00001069 case PPCISD::FCFID:
1070 CurDAG->SelectNodeTo(N, PPC::FCFID, N->getValueType(0),
1071 Select(N->getOperand(0)));
1072 return SDOperand(N, 0);
1073 case PPCISD::FCTIDZ:
1074 CurDAG->SelectNodeTo(N, PPC::FCTIDZ, N->getValueType(0),
1075 Select(N->getOperand(0)));
1076 return SDOperand(N, 0);
Chris Lattnerf7605322005-08-31 21:09:52 +00001077 case PPCISD::FCTIWZ:
1078 CurDAG->SelectNodeTo(N, PPC::FCTIWZ, N->getValueType(0),
1079 Select(N->getOperand(0)));
Chris Lattner25dae722005-09-03 00:53:47 +00001080 return SDOperand(N, 0);
Chris Lattner615c2d02005-09-28 22:29:58 +00001081 case ISD::FADD: {
1082 MVT::ValueType Ty = N->getValueType(0);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001083 if (!NoExcessFPPrecision) { // Match FMA ops
Chris Lattner615c2d02005-09-28 22:29:58 +00001084 if (N->getOperand(0).getOpcode() == ISD::FMUL &&
Chris Lattnera5a91b12005-08-17 19:33:03 +00001085 N->getOperand(0).Val->hasOneUse()) {
1086 ++FusedFP; // Statistic
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001087 CurDAG->SelectNodeTo(N, Ty == MVT::f64 ? PPC::FMADD : PPC::FMADDS, Ty,
Chris Lattnera5a91b12005-08-17 19:33:03 +00001088 Select(N->getOperand(0).getOperand(0)),
1089 Select(N->getOperand(0).getOperand(1)),
1090 Select(N->getOperand(1)));
Chris Lattner25dae722005-09-03 00:53:47 +00001091 return SDOperand(N, 0);
Chris Lattner615c2d02005-09-28 22:29:58 +00001092 } else if (N->getOperand(1).getOpcode() == ISD::FMUL &&
Chris Lattnera5a91b12005-08-17 19:33:03 +00001093 N->getOperand(1).hasOneUse()) {
1094 ++FusedFP; // Statistic
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001095 CurDAG->SelectNodeTo(N, Ty == MVT::f64 ? PPC::FMADD : PPC::FMADDS, Ty,
Chris Lattnera5a91b12005-08-17 19:33:03 +00001096 Select(N->getOperand(1).getOperand(0)),
1097 Select(N->getOperand(1).getOperand(1)),
1098 Select(N->getOperand(0)));
Chris Lattner25dae722005-09-03 00:53:47 +00001099 return SDOperand(N, 0);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001100 }
1101 }
1102
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001103 CurDAG->SelectNodeTo(N, Ty == MVT::f64 ? PPC::FADD : PPC::FADDS, Ty,
Chris Lattnera5a91b12005-08-17 19:33:03 +00001104 Select(N->getOperand(0)), Select(N->getOperand(1)));
Chris Lattner25dae722005-09-03 00:53:47 +00001105 return SDOperand(N, 0);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001106 }
Chris Lattner615c2d02005-09-28 22:29:58 +00001107 case ISD::FSUB: {
1108 MVT::ValueType Ty = N->getValueType(0);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001109
1110 if (!NoExcessFPPrecision) { // Match FMA ops
Chris Lattner615c2d02005-09-28 22:29:58 +00001111 if (N->getOperand(0).getOpcode() == ISD::FMUL &&
Chris Lattnera5a91b12005-08-17 19:33:03 +00001112 N->getOperand(0).Val->hasOneUse()) {
1113 ++FusedFP; // Statistic
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001114 CurDAG->SelectNodeTo(N, Ty == MVT::f64 ? PPC::FMSUB : PPC::FMSUBS, Ty,
Chris Lattnera5a91b12005-08-17 19:33:03 +00001115 Select(N->getOperand(0).getOperand(0)),
1116 Select(N->getOperand(0).getOperand(1)),
1117 Select(N->getOperand(1)));
Chris Lattner25dae722005-09-03 00:53:47 +00001118 return SDOperand(N, 0);
Chris Lattner615c2d02005-09-28 22:29:58 +00001119 } else if (N->getOperand(1).getOpcode() == ISD::FMUL &&
Chris Lattnera5a91b12005-08-17 19:33:03 +00001120 N->getOperand(1).Val->hasOneUse()) {
1121 ++FusedFP; // Statistic
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001122 CurDAG->SelectNodeTo(N, Ty == MVT::f64 ? PPC::FNMSUB : PPC::FNMSUBS, Ty,
Chris Lattnera5a91b12005-08-17 19:33:03 +00001123 Select(N->getOperand(1).getOperand(0)),
1124 Select(N->getOperand(1).getOperand(1)),
1125 Select(N->getOperand(0)));
Chris Lattner25dae722005-09-03 00:53:47 +00001126 return SDOperand(N, 0);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001127 }
1128 }
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001129 CurDAG->SelectNodeTo(N, Ty == MVT::f64 ? PPC::FSUB : PPC::FSUBS, Ty,
Chris Lattnera5a91b12005-08-17 19:33:03 +00001130 Select(N->getOperand(0)),
1131 Select(N->getOperand(1)));
Chris Lattner25dae722005-09-03 00:53:47 +00001132 return SDOperand(N, 0);
Nate Begeman26653502005-08-17 23:46:35 +00001133 }
Chris Lattner88add102005-09-28 22:50:24 +00001134 case ISD::SDIV: {
Chris Lattner8784a232005-08-25 17:50:06 +00001135 unsigned Imm;
1136 if (isIntImmediate(N->getOperand(1), Imm)) {
1137 if ((signed)Imm > 0 && isPowerOf2_32(Imm)) {
1138 SDOperand Op =
1139 CurDAG->getTargetNode(PPC::SRAWI, MVT::i32, MVT::Flag,
1140 Select(N->getOperand(0)),
1141 getI32Imm(Log2_32(Imm)));
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001142 CurDAG->SelectNodeTo(N, PPC::ADDZE, MVT::i32,
Chris Lattner8784a232005-08-25 17:50:06 +00001143 Op.getValue(0), Op.getValue(1));
Chris Lattner25dae722005-09-03 00:53:47 +00001144 return SDOperand(N, 0);
Chris Lattner8784a232005-08-25 17:50:06 +00001145 } else if ((signed)Imm < 0 && isPowerOf2_32(-Imm)) {
1146 SDOperand Op =
Chris Lattner2501d5e2005-08-30 17:13:58 +00001147 CurDAG->getTargetNode(PPC::SRAWI, MVT::i32, MVT::Flag,
Chris Lattner8784a232005-08-25 17:50:06 +00001148 Select(N->getOperand(0)),
1149 getI32Imm(Log2_32(-Imm)));
1150 SDOperand PT =
Chris Lattner2501d5e2005-08-30 17:13:58 +00001151 CurDAG->getTargetNode(PPC::ADDZE, MVT::i32, Op.getValue(0),
1152 Op.getValue(1));
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001153 CurDAG->SelectNodeTo(N, PPC::NEG, MVT::i32, PT);
Chris Lattner25dae722005-09-03 00:53:47 +00001154 return SDOperand(N, 0);
Chris Lattner047b9522005-08-25 22:04:30 +00001155 } else if (Imm) {
1156 SDOperand Result = Select(BuildSDIVSequence(N));
Chris Lattnerd3d2cf52005-09-29 00:59:32 +00001157 CodeGenMap[Op] = Result;
1158 return Result;
Chris Lattner8784a232005-08-25 17:50:06 +00001159 }
1160 }
Chris Lattner047b9522005-08-25 22:04:30 +00001161
Chris Lattner237733e2005-09-29 23:33:31 +00001162 // Other cases are autogenerated.
1163 break;
Chris Lattner047b9522005-08-25 22:04:30 +00001164 }
1165 case ISD::UDIV: {
1166 // If this is a divide by constant, we can emit code using some magic
1167 // constants to implement it as a multiply instead.
1168 unsigned Imm;
Chris Lattnera9317ed2005-08-25 23:21:06 +00001169 if (isIntImmediate(N->getOperand(1), Imm) && Imm) {
Chris Lattner047b9522005-08-25 22:04:30 +00001170 SDOperand Result = Select(BuildUDIVSequence(N));
Chris Lattnerd3d2cf52005-09-29 00:59:32 +00001171 CodeGenMap[Op] = Result;
1172 return Result;
Chris Lattner047b9522005-08-25 22:04:30 +00001173 }
1174
Chris Lattner237733e2005-09-29 23:33:31 +00001175 // Other cases are autogenerated.
1176 break;
Chris Lattner047b9522005-08-25 22:04:30 +00001177 }
Nate Begemancffc32b2005-08-18 07:30:46 +00001178 case ISD::AND: {
Nate Begemana6940472005-08-18 18:01:39 +00001179 unsigned Imm;
Nate Begemancffc32b2005-08-18 07:30:46 +00001180 // If this is an and of a value rotated between 0 and 31 bits and then and'd
1181 // with a mask, emit rlwinm
1182 if (isIntImmediate(N->getOperand(1), Imm) && (isShiftedMask_32(Imm) ||
1183 isShiftedMask_32(~Imm))) {
1184 SDOperand Val;
Nate Begemana6940472005-08-18 18:01:39 +00001185 unsigned SH, MB, ME;
Nate Begemancffc32b2005-08-18 07:30:46 +00001186 if (isRotateAndMask(N->getOperand(0).Val, Imm, false, SH, MB, ME)) {
1187 Val = Select(N->getOperand(0).getOperand(0));
1188 } else {
1189 Val = Select(N->getOperand(0));
1190 isRunOfOnes(Imm, MB, ME);
1191 SH = 0;
1192 }
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001193 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Val, getI32Imm(SH),
Nate Begemancffc32b2005-08-18 07:30:46 +00001194 getI32Imm(MB), getI32Imm(ME));
Chris Lattner25dae722005-09-03 00:53:47 +00001195 return SDOperand(N, 0);
Nate Begemancffc32b2005-08-18 07:30:46 +00001196 }
Chris Lattner237733e2005-09-29 23:33:31 +00001197
1198 // Other cases are autogenerated.
1199 break;
Nate Begemancffc32b2005-08-18 07:30:46 +00001200 }
Nate Begeman02b88a42005-08-19 00:38:14 +00001201 case ISD::OR:
Chris Lattnerd3d2cf52005-09-29 00:59:32 +00001202 if (SDNode *I = SelectBitfieldInsert(N))
1203 return CodeGenMap[Op] = SDOperand(I, 0);
Chris Lattnerd3d2cf52005-09-29 00:59:32 +00001204
Chris Lattner237733e2005-09-29 23:33:31 +00001205 // Other cases are autogenerated.
1206 break;
Nate Begemanc15ed442005-08-18 23:38:00 +00001207 case ISD::SHL: {
1208 unsigned Imm, SH, MB, ME;
1209 if (isOpcWithIntImmediate(N->getOperand(0).Val, ISD::AND, Imm) &&
1210 isRotateAndMask(N, Imm, true, SH, MB, ME))
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001211 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32,
Nate Begemanc15ed442005-08-18 23:38:00 +00001212 Select(N->getOperand(0).getOperand(0)),
1213 getI32Imm(SH), getI32Imm(MB), getI32Imm(ME));
1214 else if (isIntImmediate(N->getOperand(1), Imm))
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001215 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Select(N->getOperand(0)),
Nate Begemanc15ed442005-08-18 23:38:00 +00001216 getI32Imm(Imm), getI32Imm(0), getI32Imm(31-Imm));
1217 else
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001218 CurDAG->SelectNodeTo(N, PPC::SLW, MVT::i32, Select(N->getOperand(0)),
Nate Begemanc15ed442005-08-18 23:38:00 +00001219 Select(N->getOperand(1)));
Chris Lattner25dae722005-09-03 00:53:47 +00001220 return SDOperand(N, 0);
Nate Begemanc15ed442005-08-18 23:38:00 +00001221 }
1222 case ISD::SRL: {
1223 unsigned Imm, SH, MB, ME;
1224 if (isOpcWithIntImmediate(N->getOperand(0).Val, ISD::AND, Imm) &&
1225 isRotateAndMask(N, Imm, true, SH, MB, ME))
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001226 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32,
Nate Begemanc15ed442005-08-18 23:38:00 +00001227 Select(N->getOperand(0).getOperand(0)),
Nate Begemanc09eeec2005-09-06 22:03:27 +00001228 getI32Imm(SH & 0x1F), getI32Imm(MB), getI32Imm(ME));
Nate Begemanc15ed442005-08-18 23:38:00 +00001229 else if (isIntImmediate(N->getOperand(1), Imm))
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001230 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Select(N->getOperand(0)),
Nate Begemanc09eeec2005-09-06 22:03:27 +00001231 getI32Imm((32-Imm) & 0x1F), getI32Imm(Imm),
1232 getI32Imm(31));
Nate Begemanc15ed442005-08-18 23:38:00 +00001233 else
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001234 CurDAG->SelectNodeTo(N, PPC::SRW, MVT::i32, Select(N->getOperand(0)),
Nate Begemanc15ed442005-08-18 23:38:00 +00001235 Select(N->getOperand(1)));
Chris Lattner25dae722005-09-03 00:53:47 +00001236 return SDOperand(N, 0);
Nate Begemanc15ed442005-08-18 23:38:00 +00001237 }
Nate Begeman26653502005-08-17 23:46:35 +00001238 case ISD::FNEG: {
1239 SDOperand Val = Select(N->getOperand(0));
1240 MVT::ValueType Ty = N->getValueType(0);
Chris Lattner4cb5a1b2005-10-15 22:06:18 +00001241 if (N->getOperand(0).Val->hasOneUse()) {
Nate Begeman26653502005-08-17 23:46:35 +00001242 unsigned Opc;
Chris Lattner528f58e2005-08-28 23:39:22 +00001243 switch (Val.isTargetOpcode() ? Val.getTargetOpcode() : 0) {
Nate Begeman26653502005-08-17 23:46:35 +00001244 default: Opc = 0; break;
Chris Lattner919c0322005-10-01 01:35:02 +00001245 case PPC::FABSS: Opc = PPC::FNABSS; break;
1246 case PPC::FABSD: Opc = PPC::FNABSD; break;
Nate Begeman26653502005-08-17 23:46:35 +00001247 case PPC::FMADD: Opc = PPC::FNMADD; break;
1248 case PPC::FMADDS: Opc = PPC::FNMADDS; break;
1249 case PPC::FMSUB: Opc = PPC::FNMSUB; break;
1250 case PPC::FMSUBS: Opc = PPC::FNMSUBS; break;
1251 }
1252 // If we inverted the opcode, then emit the new instruction with the
1253 // inverted opcode and the original instruction's operands. Otherwise,
1254 // fall through and generate a fneg instruction.
1255 if (Opc) {
Chris Lattner919c0322005-10-01 01:35:02 +00001256 if (Opc == PPC::FNABSS || Opc == PPC::FNABSD)
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001257 CurDAG->SelectNodeTo(N, Opc, Ty, Val.getOperand(0));
Nate Begeman26653502005-08-17 23:46:35 +00001258 else
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001259 CurDAG->SelectNodeTo(N, Opc, Ty, Val.getOperand(0),
Nate Begeman26653502005-08-17 23:46:35 +00001260 Val.getOperand(1), Val.getOperand(2));
Chris Lattner25dae722005-09-03 00:53:47 +00001261 return SDOperand(N, 0);
Nate Begeman26653502005-08-17 23:46:35 +00001262 }
1263 }
Chris Lattner919c0322005-10-01 01:35:02 +00001264 if (Ty == MVT::f32)
1265 CurDAG->SelectNodeTo(N, PPC::FNEGS, MVT::f32, Val);
1266 else
Chris Lattner2c1760f2005-10-01 02:51:36 +00001267 CurDAG->SelectNodeTo(N, PPC::FNEGD, MVT::f64, Val);
Chris Lattner25dae722005-09-03 00:53:47 +00001268 return SDOperand(N, 0);
Nate Begeman26653502005-08-17 23:46:35 +00001269 }
Chris Lattner9944b762005-08-21 22:31:09 +00001270 case ISD::LOAD:
1271 case ISD::EXTLOAD:
1272 case ISD::ZEXTLOAD:
1273 case ISD::SEXTLOAD: {
1274 SDOperand Op1, Op2;
1275 bool isIdx = SelectAddr(N->getOperand(1), Op1, Op2);
1276
1277 MVT::ValueType TypeBeingLoaded = (N->getOpcode() == ISD::LOAD) ?
1278 N->getValueType(0) : cast<VTSDNode>(N->getOperand(3))->getVT();
1279 unsigned Opc;
1280 switch (TypeBeingLoaded) {
1281 default: N->dump(); assert(0 && "Cannot load this type!");
1282 case MVT::i1:
1283 case MVT::i8: Opc = isIdx ? PPC::LBZX : PPC::LBZ; break;
1284 case MVT::i16:
1285 if (N->getOpcode() == ISD::SEXTLOAD) { // SEXT load?
1286 Opc = isIdx ? PPC::LHAX : PPC::LHA;
1287 } else {
1288 Opc = isIdx ? PPC::LHZX : PPC::LHZ;
1289 }
1290 break;
1291 case MVT::i32: Opc = isIdx ? PPC::LWZX : PPC::LWZ; break;
1292 case MVT::f32: Opc = isIdx ? PPC::LFSX : PPC::LFS; break;
1293 case MVT::f64: Opc = isIdx ? PPC::LFDX : PPC::LFD; break;
1294 }
1295
Chris Lattner919c0322005-10-01 01:35:02 +00001296 // If this is an f32 -> f64 load, emit the f32 load, then use an 'extending
1297 // copy'.
1298 if (TypeBeingLoaded != MVT::f32 || N->getOpcode() == ISD::LOAD) {
1299 CurDAG->SelectNodeTo(N, Opc, N->getValueType(0), MVT::Other,
1300 Op1, Op2, Select(N->getOperand(0)));
1301 return SDOperand(N, Op.ResNo);
1302 } else {
1303 std::vector<SDOperand> Ops;
1304 Ops.push_back(Op1);
1305 Ops.push_back(Op2);
1306 Ops.push_back(Select(N->getOperand(0)));
1307 SDOperand Res = CurDAG->getTargetNode(Opc, MVT::f32, MVT::Other, Ops);
1308 SDOperand Ext = CurDAG->getTargetNode(PPC::FMRSD, MVT::f64, Res);
1309 CodeGenMap[Op.getValue(0)] = Ext;
1310 CodeGenMap[Op.getValue(1)] = Res.getValue(1);
1311 if (Op.ResNo)
1312 return Res.getValue(1);
1313 else
1314 return Ext;
1315 }
Chris Lattner9944b762005-08-21 22:31:09 +00001316 }
Chris Lattnerf7f22552005-08-22 01:27:59 +00001317 case ISD::TRUNCSTORE:
1318 case ISD::STORE: {
1319 SDOperand AddrOp1, AddrOp2;
1320 bool isIdx = SelectAddr(N->getOperand(2), AddrOp1, AddrOp2);
1321
1322 unsigned Opc;
1323 if (N->getOpcode() == ISD::STORE) {
1324 switch (N->getOperand(1).getValueType()) {
1325 default: assert(0 && "unknown Type in store");
1326 case MVT::i32: Opc = isIdx ? PPC::STWX : PPC::STW; break;
1327 case MVT::f64: Opc = isIdx ? PPC::STFDX : PPC::STFD; break;
1328 case MVT::f32: Opc = isIdx ? PPC::STFSX : PPC::STFS; break;
1329 }
1330 } else { //ISD::TRUNCSTORE
1331 switch(cast<VTSDNode>(N->getOperand(4))->getVT()) {
1332 default: assert(0 && "unknown Type in store");
Chris Lattnerf7f22552005-08-22 01:27:59 +00001333 case MVT::i8: Opc = isIdx ? PPC::STBX : PPC::STB; break;
1334 case MVT::i16: Opc = isIdx ? PPC::STHX : PPC::STH; break;
1335 }
1336 }
Chris Lattnerfb0c9642005-08-24 22:45:17 +00001337
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001338 CurDAG->SelectNodeTo(N, Opc, MVT::Other, Select(N->getOperand(1)),
Chris Lattnerf7f22552005-08-22 01:27:59 +00001339 AddrOp1, AddrOp2, Select(N->getOperand(0)));
Chris Lattner25dae722005-09-03 00:53:47 +00001340 return SDOperand(N, 0);
Chris Lattnerf7f22552005-08-22 01:27:59 +00001341 }
Chris Lattner64906a02005-08-25 20:08:18 +00001342
Chris Lattner13794f52005-08-26 18:46:49 +00001343 case ISD::SELECT_CC: {
1344 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(4))->get();
1345
1346 // handle the setcc cases here. select_cc lhs, 0, 1, 0, cc
1347 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N->getOperand(1)))
1348 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N->getOperand(2)))
1349 if (ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N->getOperand(3)))
1350 if (N1C->isNullValue() && N3C->isNullValue() &&
1351 N2C->getValue() == 1ULL && CC == ISD::SETNE) {
1352 SDOperand LHS = Select(N->getOperand(0));
1353 SDOperand Tmp =
1354 CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
1355 LHS, getI32Imm(~0U));
1356 CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, Tmp, LHS,
1357 Tmp.getValue(1));
Chris Lattner25dae722005-09-03 00:53:47 +00001358 return SDOperand(N, 0);
Chris Lattner13794f52005-08-26 18:46:49 +00001359 }
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00001360
Chris Lattner50ff55c2005-09-01 19:20:44 +00001361 SDOperand CCReg = SelectCC(N->getOperand(0), N->getOperand(1), CC);
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00001362 unsigned BROpc = getBCCForSetCC(CC);
1363
1364 bool isFP = MVT::isFloatingPoint(N->getValueType(0));
Chris Lattner919c0322005-10-01 01:35:02 +00001365 unsigned SelectCCOp;
1366 if (MVT::isInteger(N->getValueType(0)))
1367 SelectCCOp = PPC::SELECT_CC_Int;
1368 else if (N->getValueType(0) == MVT::f32)
1369 SelectCCOp = PPC::SELECT_CC_F4;
1370 else
1371 SelectCCOp = PPC::SELECT_CC_F8;
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00001372 CurDAG->SelectNodeTo(N, SelectCCOp, N->getValueType(0), CCReg,
1373 Select(N->getOperand(2)), Select(N->getOperand(3)),
1374 getI32Imm(BROpc));
Chris Lattner25dae722005-09-03 00:53:47 +00001375 return SDOperand(N, 0);
Chris Lattner13794f52005-08-26 18:46:49 +00001376 }
1377
Chris Lattnera2590c52005-08-24 00:47:15 +00001378 case ISD::CALLSEQ_START:
1379 case ISD::CALLSEQ_END: {
1380 unsigned Amt = cast<ConstantSDNode>(N->getOperand(1))->getValue();
1381 unsigned Opc = N->getOpcode() == ISD::CALLSEQ_START ?
1382 PPC::ADJCALLSTACKDOWN : PPC::ADJCALLSTACKUP;
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001383 CurDAG->SelectNodeTo(N, Opc, MVT::Other,
Chris Lattnerfb0c9642005-08-24 22:45:17 +00001384 getI32Imm(Amt), Select(N->getOperand(0)));
Chris Lattner25dae722005-09-03 00:53:47 +00001385 return SDOperand(N, 0);
Chris Lattnera2590c52005-08-24 00:47:15 +00001386 }
Chris Lattnera5a91b12005-08-17 19:33:03 +00001387 case ISD::RET: {
1388 SDOperand Chain = Select(N->getOperand(0)); // Token chain.
1389
Chris Lattner7a49fdc2005-08-31 01:34:29 +00001390 if (N->getNumOperands() == 2) {
Chris Lattnera5a91b12005-08-17 19:33:03 +00001391 SDOperand Val = Select(N->getOperand(1));
Chris Lattnereb80fe82005-08-30 22:59:48 +00001392 if (N->getOperand(1).getValueType() == MVT::i32) {
Chris Lattnera5a91b12005-08-17 19:33:03 +00001393 Chain = CurDAG->getCopyToReg(Chain, PPC::R3, Val);
Chris Lattnereb80fe82005-08-30 22:59:48 +00001394 } else {
1395 assert(MVT::isFloatingPoint(N->getOperand(1).getValueType()));
1396 Chain = CurDAG->getCopyToReg(Chain, PPC::F1, Val);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001397 }
Chris Lattner7a49fdc2005-08-31 01:34:29 +00001398 } else if (N->getNumOperands() > 1) {
1399 assert(N->getOperand(1).getValueType() == MVT::i32 &&
1400 N->getOperand(2).getValueType() == MVT::i32 &&
1401 N->getNumOperands() == 3 && "Unknown two-register ret value!");
1402 Chain = CurDAG->getCopyToReg(Chain, PPC::R4, Select(N->getOperand(1)));
1403 Chain = CurDAG->getCopyToReg(Chain, PPC::R3, Select(N->getOperand(2)));
Chris Lattnera5a91b12005-08-17 19:33:03 +00001404 }
1405
1406 // Finally, select this to a blr (return) instruction.
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001407 CurDAG->SelectNodeTo(N, PPC::BLR, MVT::Other, Chain);
Chris Lattner25dae722005-09-03 00:53:47 +00001408 return SDOperand(N, 0);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001409 }
Chris Lattner89532c72005-08-25 00:29:58 +00001410 case ISD::BR:
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001411 CurDAG->SelectNodeTo(N, PPC::B, MVT::Other, N->getOperand(1),
Chris Lattner89532c72005-08-25 00:29:58 +00001412 Select(N->getOperand(0)));
Chris Lattner25dae722005-09-03 00:53:47 +00001413 return SDOperand(N, 0);
Chris Lattner2fbb4572005-08-21 18:50:37 +00001414 case ISD::BR_CC:
1415 case ISD::BRTWOWAY_CC: {
1416 SDOperand Chain = Select(N->getOperand(0));
1417 MachineBasicBlock *Dest =
1418 cast<BasicBlockSDNode>(N->getOperand(4))->getBasicBlock();
1419 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(1))->get();
1420 SDOperand CondCode = SelectCC(N->getOperand(2), N->getOperand(3), CC);
Chris Lattner2fbb4572005-08-21 18:50:37 +00001421
1422 // If this is a two way branch, then grab the fallthrough basic block
1423 // argument and build a PowerPC branch pseudo-op, suitable for long branch
1424 // conversion if necessary by the branch selection pass. Otherwise, emit a
1425 // standard conditional branch.
1426 if (N->getOpcode() == ISD::BRTWOWAY_CC) {
Chris Lattnerca0a4772005-10-01 23:06:26 +00001427 SDOperand CondTrueBlock = N->getOperand(4);
1428 SDOperand CondFalseBlock = N->getOperand(5);
1429
1430 // If the false case is the current basic block, then this is a self loop.
1431 // We do not want to emit "Loop: ... brcond Out; br Loop", as it adds an
1432 // extra dispatch group to the loop. Instead, invert the condition and
1433 // emit "Loop: ... br!cond Loop; br Out
1434 if (cast<BasicBlockSDNode>(CondFalseBlock)->getBasicBlock() == BB) {
1435 std::swap(CondTrueBlock, CondFalseBlock);
1436 CC = getSetCCInverse(CC,
1437 MVT::isInteger(N->getOperand(2).getValueType()));
1438 }
1439
1440 unsigned Opc = getBCCForSetCC(CC);
Chris Lattner2fbb4572005-08-21 18:50:37 +00001441 SDOperand CB = CurDAG->getTargetNode(PPC::COND_BRANCH, MVT::Other,
1442 CondCode, getI32Imm(Opc),
Chris Lattnerca0a4772005-10-01 23:06:26 +00001443 CondTrueBlock, CondFalseBlock,
Chris Lattner2fbb4572005-08-21 18:50:37 +00001444 Chain);
Chris Lattnerca0a4772005-10-01 23:06:26 +00001445 CurDAG->SelectNodeTo(N, PPC::B, MVT::Other, CondFalseBlock, CB);
Chris Lattner2fbb4572005-08-21 18:50:37 +00001446 } else {
1447 // Iterate to the next basic block
1448 ilist<MachineBasicBlock>::iterator It = BB;
1449 ++It;
1450
1451 // If the fallthrough path is off the end of the function, which would be
1452 // undefined behavior, set it to be the same as the current block because
1453 // we have nothing better to set it to, and leaving it alone will cause
1454 // the PowerPC Branch Selection pass to crash.
1455 if (It == BB->getParent()->end()) It = Dest;
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001456 CurDAG->SelectNodeTo(N, PPC::COND_BRANCH, MVT::Other, CondCode,
Chris Lattnerca0a4772005-10-01 23:06:26 +00001457 getI32Imm(getBCCForSetCC(CC)), N->getOperand(4),
Chris Lattner2fbb4572005-08-21 18:50:37 +00001458 CurDAG->getBasicBlock(It), Chain);
1459 }
Chris Lattner25dae722005-09-03 00:53:47 +00001460 return SDOperand(N, 0);
Chris Lattner2fbb4572005-08-21 18:50:37 +00001461 }
Chris Lattnera5a91b12005-08-17 19:33:03 +00001462 }
Chris Lattner25dae722005-09-03 00:53:47 +00001463
Chris Lattner19c09072005-09-07 23:45:15 +00001464 return SelectCode(Op);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001465}
1466
1467
1468/// createPPC32ISelDag - This pass converts a legalized DAG into a
1469/// PowerPC-specific DAG, ready for instruction scheduling.
1470///
1471FunctionPass *llvm::createPPC32ISelDag(TargetMachine &TM) {
1472 return new PPC32DAGToDAGISel(TM);
1473}
1474