blob: c55bd30a2dd18469a113d6f0b2c49875708e677c [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) {
222 unsigned Shift = 32;
223 unsigned Indeterminant = ~0; // bit mask marking indeterminant results
224 unsigned Opcode = N->getOpcode();
Chris Lattner15055732005-08-30 00:59:16 +0000225 if (N->getNumOperands() != 2 ||
226 !isIntImmediate(N->getOperand(1).Val, Shift) || (Shift > 31))
Nate Begemancffc32b2005-08-18 07:30:46 +0000227 return false;
228
229 if (Opcode == ISD::SHL) {
230 // apply shift left to mask if it comes first
231 if (IsShiftMask) Mask = Mask << Shift;
232 // determine which bits are made indeterminant by shift
233 Indeterminant = ~(0xFFFFFFFFu << Shift);
Chris Lattner651dea72005-10-15 21:40:12 +0000234 } else if (Opcode == ISD::SRL) {
Nate Begemancffc32b2005-08-18 07:30:46 +0000235 // apply shift right 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);
239 // adjust for the left rotate
240 Shift = 32 - Shift;
241 } else {
242 return false;
243 }
244
245 // if the mask doesn't intersect any Indeterminant bits
246 if (Mask && !(Mask & Indeterminant)) {
247 SH = Shift;
248 // make sure the mask is still a mask (wrap arounds may not be)
249 return isRunOfOnes(Mask, MB, ME);
250 }
251 return false;
252}
253
Nate Begeman0f3257a2005-08-18 05:00:13 +0000254// isOpcWithIntImmediate - This method tests to see if the node is a specific
255// opcode and that it has a immediate integer right operand.
256// If so Imm will receive the 32 bit value.
257static bool isOpcWithIntImmediate(SDNode *N, unsigned Opc, unsigned& Imm) {
258 return N->getOpcode() == Opc && isIntImmediate(N->getOperand(1).Val, Imm);
259}
260
261// isOprNot - Returns true if the specified operand is an xor with immediate -1.
262static bool isOprNot(SDNode *N) {
263 unsigned Imm;
264 return isOpcWithIntImmediate(N, ISD::XOR, Imm) && (signed)Imm == -1;
265}
266
Chris Lattnera5a91b12005-08-17 19:33:03 +0000267// Immediate constant composers.
268// Lo16 - grabs the lo 16 bits from a 32 bit constant.
269// Hi16 - grabs the hi 16 bits from a 32 bit constant.
270// HA16 - computes the hi bits required if the lo bits are add/subtracted in
271// arithmethically.
272static unsigned Lo16(unsigned x) { return x & 0x0000FFFF; }
273static unsigned Hi16(unsigned x) { return Lo16(x >> 16); }
274static unsigned HA16(unsigned x) { return Hi16((signed)x - (signed short)x); }
275
276// isIntImmediate - This method tests to see if a constant operand.
277// If so Imm will receive the 32 bit value.
278static bool isIntImmediate(SDOperand N, unsigned& Imm) {
279 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N)) {
280 Imm = (unsigned)CN->getSignExtended();
281 return true;
282 }
283 return false;
284}
285
Nate Begeman02b88a42005-08-19 00:38:14 +0000286/// SelectBitfieldInsert - turn an or of two masked values into
287/// the rotate left word immediate then mask insert (rlwimi) instruction.
288/// Returns true on success, false if the caller still needs to select OR.
289///
290/// Patterns matched:
291/// 1. or shl, and 5. or and, and
292/// 2. or and, shl 6. or shl, shr
293/// 3. or shr, and 7. or shr, shl
294/// 4. or and, shr
Nate Begeman1d9d7422005-10-18 00:28:58 +0000295SDNode *PPCDAGToDAGISel::SelectBitfieldInsert(SDNode *N) {
Nate Begeman02b88a42005-08-19 00:38:14 +0000296 bool IsRotate = false;
297 unsigned TgtMask = 0xFFFFFFFF, InsMask = 0xFFFFFFFF, SH = 0;
298 unsigned Value;
299
300 SDOperand Op0 = N->getOperand(0);
301 SDOperand Op1 = N->getOperand(1);
302
303 unsigned Op0Opc = Op0.getOpcode();
304 unsigned Op1Opc = Op1.getOpcode();
305
306 // Verify that we have the correct opcodes
307 if (ISD::SHL != Op0Opc && ISD::SRL != Op0Opc && ISD::AND != Op0Opc)
308 return false;
309 if (ISD::SHL != Op1Opc && ISD::SRL != Op1Opc && ISD::AND != Op1Opc)
310 return false;
311
312 // Generate Mask value for Target
313 if (isIntImmediate(Op0.getOperand(1), Value)) {
314 switch(Op0Opc) {
Chris Lattner13687212005-08-30 18:37:48 +0000315 case ISD::SHL: TgtMask <<= Value; break;
316 case ISD::SRL: TgtMask >>= Value; break;
317 case ISD::AND: TgtMask &= Value; break;
Nate Begeman02b88a42005-08-19 00:38:14 +0000318 }
319 } else {
320 return 0;
321 }
322
323 // Generate Mask value for Insert
Chris Lattner13687212005-08-30 18:37:48 +0000324 if (!isIntImmediate(Op1.getOperand(1), Value))
Nate Begeman02b88a42005-08-19 00:38:14 +0000325 return 0;
Chris Lattner13687212005-08-30 18:37:48 +0000326
327 switch(Op1Opc) {
328 case ISD::SHL:
329 SH = Value;
330 InsMask <<= SH;
331 if (Op0Opc == ISD::SRL) IsRotate = true;
332 break;
333 case ISD::SRL:
334 SH = Value;
335 InsMask >>= SH;
336 SH = 32-SH;
337 if (Op0Opc == ISD::SHL) IsRotate = true;
338 break;
339 case ISD::AND:
340 InsMask &= Value;
341 break;
Nate Begeman02b88a42005-08-19 00:38:14 +0000342 }
343
344 // If both of the inputs are ANDs and one of them has a logical shift by
345 // constant as its input, make that AND the inserted value so that we can
346 // combine the shift into the rotate part of the rlwimi instruction
347 bool IsAndWithShiftOp = false;
348 if (Op0Opc == ISD::AND && Op1Opc == ISD::AND) {
349 if (Op1.getOperand(0).getOpcode() == ISD::SHL ||
350 Op1.getOperand(0).getOpcode() == ISD::SRL) {
351 if (isIntImmediate(Op1.getOperand(0).getOperand(1), Value)) {
352 SH = Op1.getOperand(0).getOpcode() == ISD::SHL ? Value : 32 - Value;
353 IsAndWithShiftOp = true;
354 }
355 } else if (Op0.getOperand(0).getOpcode() == ISD::SHL ||
356 Op0.getOperand(0).getOpcode() == ISD::SRL) {
357 if (isIntImmediate(Op0.getOperand(0).getOperand(1), Value)) {
358 std::swap(Op0, Op1);
359 std::swap(TgtMask, InsMask);
360 SH = Op1.getOperand(0).getOpcode() == ISD::SHL ? Value : 32 - Value;
361 IsAndWithShiftOp = true;
362 }
363 }
364 }
365
366 // Verify that the Target mask and Insert mask together form a full word mask
367 // and that the Insert mask is a run of set bits (which implies both are runs
368 // of set bits). Given that, Select the arguments and generate the rlwimi
369 // instruction.
370 unsigned MB, ME;
371 if (((TgtMask & InsMask) == 0) && isRunOfOnes(InsMask, MB, ME)) {
372 bool fullMask = (TgtMask ^ InsMask) == 0xFFFFFFFF;
373 bool Op0IsAND = Op0Opc == ISD::AND;
374 // Check for rotlwi / rotrwi here, a special case of bitfield insert
375 // where both bitfield halves are sourced from the same value.
376 if (IsRotate && fullMask &&
377 N->getOperand(0).getOperand(0) == N->getOperand(1).getOperand(0)) {
378 Op0 = CurDAG->getTargetNode(PPC::RLWINM, MVT::i32,
379 Select(N->getOperand(0).getOperand(0)),
380 getI32Imm(SH), getI32Imm(0), getI32Imm(31));
381 return Op0.Val;
382 }
383 SDOperand Tmp1 = (Op0IsAND && fullMask) ? Select(Op0.getOperand(0))
384 : Select(Op0);
385 SDOperand Tmp2 = IsAndWithShiftOp ? Select(Op1.getOperand(0).getOperand(0))
386 : Select(Op1.getOperand(0));
387 Op0 = CurDAG->getTargetNode(PPC::RLWIMI, MVT::i32, Tmp1, Tmp2,
388 getI32Imm(SH), getI32Imm(MB), getI32Imm(ME));
389 return Op0.Val;
390 }
391 return 0;
392}
393
Chris Lattner9944b762005-08-21 22:31:09 +0000394/// SelectAddr - Given the specified address, return the two operands for a
395/// load/store instruction, and return true if it should be an indexed [r+r]
396/// operation.
Nate Begeman1d9d7422005-10-18 00:28:58 +0000397bool PPCDAGToDAGISel::SelectAddr(SDOperand Addr, SDOperand &Op1,
398 SDOperand &Op2) {
Chris Lattner9944b762005-08-21 22:31:09 +0000399 unsigned imm = 0;
400 if (Addr.getOpcode() == ISD::ADD) {
401 if (isIntImmediate(Addr.getOperand(1), imm) && isInt16(imm)) {
402 Op1 = getI32Imm(Lo16(imm));
Chris Lattnere28e40a2005-08-25 00:45:43 +0000403 if (FrameIndexSDNode *FI =
404 dyn_cast<FrameIndexSDNode>(Addr.getOperand(0))) {
Chris Lattner9944b762005-08-21 22:31:09 +0000405 ++FrameOff;
Chris Lattnere28e40a2005-08-25 00:45:43 +0000406 Op2 = CurDAG->getTargetFrameIndex(FI->getIndex(), MVT::i32);
Chris Lattner9944b762005-08-21 22:31:09 +0000407 } else {
408 Op2 = Select(Addr.getOperand(0));
409 }
410 return false;
411 } else {
412 Op1 = Select(Addr.getOperand(0));
413 Op2 = Select(Addr.getOperand(1));
414 return true; // [r+r]
415 }
416 }
417
418 // Now check if we're dealing with a global, and whether or not we should emit
419 // an optimized load or store for statics.
420 if (GlobalAddressSDNode *GN = dyn_cast<GlobalAddressSDNode>(Addr)) {
421 GlobalValue *GV = GN->getGlobal();
422 if (!GV->hasWeakLinkage() && !GV->isExternal()) {
423 Op1 = CurDAG->getTargetGlobalAddress(GV, MVT::i32);
424 if (PICEnabled)
425 Op2 = CurDAG->getTargetNode(PPC::ADDIS, MVT::i32, getGlobalBaseReg(),
426 Op1);
427 else
428 Op2 = CurDAG->getTargetNode(PPC::LIS, MVT::i32, Op1);
429 return false;
430 }
Chris Lattnere28e40a2005-08-25 00:45:43 +0000431 } else if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(Addr)) {
Chris Lattner9944b762005-08-21 22:31:09 +0000432 Op1 = getI32Imm(0);
Chris Lattnere28e40a2005-08-25 00:45:43 +0000433 Op2 = CurDAG->getTargetFrameIndex(FI->getIndex(), MVT::i32);
Chris Lattner9944b762005-08-21 22:31:09 +0000434 return false;
435 } else if (ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(Addr)) {
436 Op1 = Addr;
437 if (PICEnabled)
438 Op2 = CurDAG->getTargetNode(PPC::ADDIS, MVT::i32, getGlobalBaseReg(),Op1);
439 else
440 Op2 = CurDAG->getTargetNode(PPC::LIS, MVT::i32, Op1);
441 return false;
442 }
443 Op1 = getI32Imm(0);
444 Op2 = Select(Addr);
445 return false;
446}
Chris Lattnera5a91b12005-08-17 19:33:03 +0000447
Chris Lattner2fbb4572005-08-21 18:50:37 +0000448/// SelectCC - Select a comparison of the specified values with the specified
449/// condition code, returning the CR# of the expression.
Nate Begeman1d9d7422005-10-18 00:28:58 +0000450SDOperand PPCDAGToDAGISel::SelectCC(SDOperand LHS, SDOperand RHS,
451 ISD::CondCode CC) {
Chris Lattner2fbb4572005-08-21 18:50:37 +0000452 // Always select the LHS.
453 LHS = Select(LHS);
454
455 // Use U to determine whether the SETCC immediate range is signed or not.
456 if (MVT::isInteger(LHS.getValueType())) {
457 bool U = ISD::isUnsignedIntSetCC(CC);
458 unsigned Imm;
459 if (isIntImmediate(RHS, Imm) &&
460 ((U && isUInt16(Imm)) || (!U && isInt16(Imm))))
461 return CurDAG->getTargetNode(U ? PPC::CMPLWI : PPC::CMPWI, MVT::i32,
462 LHS, getI32Imm(Lo16(Imm)));
463 return CurDAG->getTargetNode(U ? PPC::CMPLW : PPC::CMPW, MVT::i32,
464 LHS, Select(RHS));
Chris Lattner919c0322005-10-01 01:35:02 +0000465 } else if (LHS.getValueType() == MVT::f32) {
466 return CurDAG->getTargetNode(PPC::FCMPUS, MVT::i32, LHS, Select(RHS));
Chris Lattner2fbb4572005-08-21 18:50:37 +0000467 } else {
Chris Lattner919c0322005-10-01 01:35:02 +0000468 return CurDAG->getTargetNode(PPC::FCMPUD, MVT::i32, LHS, Select(RHS));
Chris Lattner2fbb4572005-08-21 18:50:37 +0000469 }
470}
471
472/// getBCCForSetCC - Returns the PowerPC condition branch mnemonic corresponding
473/// to Condition.
474static unsigned getBCCForSetCC(ISD::CondCode CC) {
475 switch (CC) {
476 default: assert(0 && "Unknown condition!"); abort();
477 case ISD::SETEQ: return PPC::BEQ;
478 case ISD::SETNE: return PPC::BNE;
479 case ISD::SETULT:
480 case ISD::SETLT: return PPC::BLT;
481 case ISD::SETULE:
482 case ISD::SETLE: return PPC::BLE;
483 case ISD::SETUGT:
484 case ISD::SETGT: return PPC::BGT;
485 case ISD::SETUGE:
486 case ISD::SETGE: return PPC::BGE;
487 }
488 return 0;
489}
490
Chris Lattner64906a02005-08-25 20:08:18 +0000491/// getCRIdxForSetCC - Return the index of the condition register field
492/// associated with the SetCC condition, and whether or not the field is
493/// treated as inverted. That is, lt = 0; ge = 0 inverted.
494static unsigned getCRIdxForSetCC(ISD::CondCode CC, bool& Inv) {
495 switch (CC) {
496 default: assert(0 && "Unknown condition!"); abort();
497 case ISD::SETULT:
498 case ISD::SETLT: Inv = false; return 0;
499 case ISD::SETUGE:
500 case ISD::SETGE: Inv = true; return 0;
501 case ISD::SETUGT:
502 case ISD::SETGT: Inv = false; return 1;
503 case ISD::SETULE:
504 case ISD::SETLE: Inv = true; return 1;
505 case ISD::SETEQ: Inv = false; return 2;
506 case ISD::SETNE: Inv = true; return 2;
507 }
508 return 0;
509}
Chris Lattner9944b762005-08-21 22:31:09 +0000510
Chris Lattner047b9522005-08-25 22:04:30 +0000511// Structure used to return the necessary information to codegen an SDIV as
512// a multiply.
513struct ms {
514 int m; // magic number
515 int s; // shift amount
516};
517
518struct mu {
519 unsigned int m; // magic number
520 int a; // add indicator
521 int s; // shift amount
522};
523
524/// magic - calculate the magic numbers required to codegen an integer sdiv as
525/// a sequence of multiply and shifts. Requires that the divisor not be 0, 1,
526/// or -1.
527static struct ms magic(int d) {
528 int p;
529 unsigned int ad, anc, delta, q1, r1, q2, r2, t;
530 const unsigned int two31 = 0x80000000U;
531 struct ms mag;
532
533 ad = abs(d);
534 t = two31 + ((unsigned int)d >> 31);
535 anc = t - 1 - t%ad; // absolute value of nc
536 p = 31; // initialize p
537 q1 = two31/anc; // initialize q1 = 2p/abs(nc)
538 r1 = two31 - q1*anc; // initialize r1 = rem(2p,abs(nc))
539 q2 = two31/ad; // initialize q2 = 2p/abs(d)
540 r2 = two31 - q2*ad; // initialize r2 = rem(2p,abs(d))
541 do {
542 p = p + 1;
543 q1 = 2*q1; // update q1 = 2p/abs(nc)
544 r1 = 2*r1; // update r1 = rem(2p/abs(nc))
545 if (r1 >= anc) { // must be unsigned comparison
546 q1 = q1 + 1;
547 r1 = r1 - anc;
548 }
549 q2 = 2*q2; // update q2 = 2p/abs(d)
550 r2 = 2*r2; // update r2 = rem(2p/abs(d))
551 if (r2 >= ad) { // must be unsigned comparison
552 q2 = q2 + 1;
553 r2 = r2 - ad;
554 }
555 delta = ad - r2;
556 } while (q1 < delta || (q1 == delta && r1 == 0));
557
558 mag.m = q2 + 1;
559 if (d < 0) mag.m = -mag.m; // resulting magic number
560 mag.s = p - 32; // resulting shift
561 return mag;
562}
563
564/// magicu - calculate the magic numbers required to codegen an integer udiv as
565/// a sequence of multiply, add and shifts. Requires that the divisor not be 0.
566static struct mu magicu(unsigned d)
567{
568 int p;
569 unsigned int nc, delta, q1, r1, q2, r2;
570 struct mu magu;
571 magu.a = 0; // initialize "add" indicator
572 nc = - 1 - (-d)%d;
573 p = 31; // initialize p
574 q1 = 0x80000000/nc; // initialize q1 = 2p/nc
575 r1 = 0x80000000 - q1*nc; // initialize r1 = rem(2p,nc)
576 q2 = 0x7FFFFFFF/d; // initialize q2 = (2p-1)/d
577 r2 = 0x7FFFFFFF - q2*d; // initialize r2 = rem((2p-1),d)
578 do {
579 p = p + 1;
580 if (r1 >= nc - r1 ) {
581 q1 = 2*q1 + 1; // update q1
582 r1 = 2*r1 - nc; // update r1
583 }
584 else {
585 q1 = 2*q1; // update q1
586 r1 = 2*r1; // update r1
587 }
588 if (r2 + 1 >= d - r2) {
589 if (q2 >= 0x7FFFFFFF) magu.a = 1;
590 q2 = 2*q2 + 1; // update q2
591 r2 = 2*r2 + 1 - d; // update r2
592 }
593 else {
594 if (q2 >= 0x80000000) magu.a = 1;
595 q2 = 2*q2; // update q2
596 r2 = 2*r2 + 1; // update r2
597 }
598 delta = d - 1 - r2;
599 } while (p < 64 && (q1 < delta || (q1 == delta && r1 == 0)));
600 magu.m = q2 + 1; // resulting magic number
601 magu.s = p - 32; // resulting shift
602 return magu;
603}
604
605/// BuildSDIVSequence - Given an ISD::SDIV node expressing a divide by constant,
606/// return a DAG expression to select that will generate the same value by
607/// multiplying by a magic number. See:
608/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
Nate Begeman1d9d7422005-10-18 00:28:58 +0000609SDOperand PPCDAGToDAGISel::BuildSDIVSequence(SDNode *N) {
Chris Lattner047b9522005-08-25 22:04:30 +0000610 int d = (int)cast<ConstantSDNode>(N->getOperand(1))->getValue();
611 ms magics = magic(d);
612 // Multiply the numerator (operand 0) by the magic value
613 SDOperand Q = CurDAG->getNode(ISD::MULHS, MVT::i32, N->getOperand(0),
614 CurDAG->getConstant(magics.m, MVT::i32));
615 // If d > 0 and m < 0, add the numerator
616 if (d > 0 && magics.m < 0)
617 Q = CurDAG->getNode(ISD::ADD, MVT::i32, Q, N->getOperand(0));
618 // If d < 0 and m > 0, subtract the numerator.
619 if (d < 0 && magics.m > 0)
620 Q = CurDAG->getNode(ISD::SUB, MVT::i32, Q, N->getOperand(0));
621 // Shift right algebraic if shift value is nonzero
622 if (magics.s > 0)
623 Q = CurDAG->getNode(ISD::SRA, MVT::i32, Q,
624 CurDAG->getConstant(magics.s, MVT::i32));
625 // Extract the sign bit and add it to the quotient
626 SDOperand T =
627 CurDAG->getNode(ISD::SRL, MVT::i32, Q, CurDAG->getConstant(31, MVT::i32));
628 return CurDAG->getNode(ISD::ADD, MVT::i32, Q, T);
629}
630
631/// BuildUDIVSequence - Given an ISD::UDIV node expressing a divide by constant,
632/// return a DAG expression to select that will generate the same value by
633/// multiplying by a magic number. See:
634/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
Nate Begeman1d9d7422005-10-18 00:28:58 +0000635SDOperand PPCDAGToDAGISel::BuildUDIVSequence(SDNode *N) {
Chris Lattner047b9522005-08-25 22:04:30 +0000636 unsigned d = (unsigned)cast<ConstantSDNode>(N->getOperand(1))->getValue();
637 mu magics = magicu(d);
638 // Multiply the numerator (operand 0) by the magic value
639 SDOperand Q = CurDAG->getNode(ISD::MULHU, MVT::i32, N->getOperand(0),
640 CurDAG->getConstant(magics.m, MVT::i32));
641 if (magics.a == 0) {
642 return CurDAG->getNode(ISD::SRL, MVT::i32, Q,
643 CurDAG->getConstant(magics.s, MVT::i32));
644 } else {
645 SDOperand NPQ = CurDAG->getNode(ISD::SUB, MVT::i32, N->getOperand(0), Q);
646 NPQ = CurDAG->getNode(ISD::SRL, MVT::i32, NPQ,
647 CurDAG->getConstant(1, MVT::i32));
648 NPQ = CurDAG->getNode(ISD::ADD, MVT::i32, NPQ, Q);
649 return CurDAG->getNode(ISD::SRL, MVT::i32, NPQ,
650 CurDAG->getConstant(magics.s-1, MVT::i32));
651 }
652}
653
Nate Begeman1d9d7422005-10-18 00:28:58 +0000654SDOperand PPCDAGToDAGISel::SelectDYNAMIC_STACKALLOC(SDOperand Op) {
Chris Lattnerbd937b92005-10-06 18:45:51 +0000655 SDNode *N = Op.Val;
656
657 // FIXME: We are currently ignoring the requested alignment for handling
658 // greater than the stack alignment. This will need to be revisited at some
659 // point. Align = N.getOperand(2);
660 if (!isa<ConstantSDNode>(N->getOperand(2)) ||
661 cast<ConstantSDNode>(N->getOperand(2))->getValue() != 0) {
662 std::cerr << "Cannot allocate stack object with greater alignment than"
663 << " the stack alignment yet!";
664 abort();
665 }
666 SDOperand Chain = Select(N->getOperand(0));
667 SDOperand Amt = Select(N->getOperand(1));
668
669 SDOperand R1Reg = CurDAG->getRegister(PPC::R1, MVT::i32);
670
671 SDOperand R1Val = CurDAG->getCopyFromReg(Chain, PPC::R1, MVT::i32);
672 Chain = R1Val.getValue(1);
673
674 // Subtract the amount (guaranteed to be a multiple of the stack alignment)
675 // from the stack pointer, giving us the result pointer.
676 SDOperand Result = CurDAG->getTargetNode(PPC::SUBF, MVT::i32, Amt, R1Val);
677
678 // Copy this result back into R1.
679 Chain = CurDAG->getNode(ISD::CopyToReg, MVT::Other, Chain, R1Reg, Result);
680
681 // Copy this result back out of R1 to make sure we're not using the stack
682 // space without decrementing the stack pointer.
683 Result = CurDAG->getCopyFromReg(Chain, PPC::R1, MVT::i32);
684
685 // Finally, replace the DYNAMIC_STACKALLOC with the copyfromreg.
686 CodeGenMap[Op.getValue(0)] = Result;
687 CodeGenMap[Op.getValue(1)] = Result.getValue(1);
688 return SDOperand(Result.Val, Op.ResNo);
689}
690
Nate Begeman1d9d7422005-10-18 00:28:58 +0000691SDOperand PPCDAGToDAGISel::SelectADD_PARTS(SDOperand Op) {
Chris Lattner2b63e4c2005-10-06 18:56:10 +0000692 SDNode *N = Op.Val;
693 SDOperand LHSL = Select(N->getOperand(0));
694 SDOperand LHSH = Select(N->getOperand(1));
695
696 unsigned Imm;
697 bool ME = false, ZE = false;
698 if (isIntImmediate(N->getOperand(3), Imm)) {
699 ME = (signed)Imm == -1;
700 ZE = Imm == 0;
701 }
702
703 std::vector<SDOperand> Result;
704 SDOperand CarryFromLo;
705 if (isIntImmediate(N->getOperand(2), Imm) &&
706 ((signed)Imm >= -32768 || (signed)Imm < 32768)) {
707 // Codegen the low 32 bits of the add. Interestingly, there is no
708 // shifted form of add immediate carrying.
709 CarryFromLo = CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
710 LHSL, getI32Imm(Imm));
711 } else {
712 CarryFromLo = CurDAG->getTargetNode(PPC::ADDC, MVT::i32, MVT::Flag,
713 LHSL, Select(N->getOperand(2)));
714 }
715 CarryFromLo = CarryFromLo.getValue(1);
716
717 // Codegen the high 32 bits, adding zero, minus one, or the full value
718 // along with the carry flag produced by addc/addic.
719 SDOperand ResultHi;
720 if (ZE)
721 ResultHi = CurDAG->getTargetNode(PPC::ADDZE, MVT::i32, LHSH, CarryFromLo);
722 else if (ME)
723 ResultHi = CurDAG->getTargetNode(PPC::ADDME, MVT::i32, LHSH, CarryFromLo);
724 else
725 ResultHi = CurDAG->getTargetNode(PPC::ADDE, MVT::i32, LHSH,
726 Select(N->getOperand(3)), CarryFromLo);
727 Result.push_back(CarryFromLo.getValue(0));
728 Result.push_back(ResultHi);
729
730 CodeGenMap[Op.getValue(0)] = Result[0];
731 CodeGenMap[Op.getValue(1)] = Result[1];
732 return Result[Op.ResNo];
733}
Nate Begeman1d9d7422005-10-18 00:28:58 +0000734SDOperand PPCDAGToDAGISel::SelectSUB_PARTS(SDOperand Op) {
Chris Lattner2b63e4c2005-10-06 18:56:10 +0000735 SDNode *N = Op.Val;
736 SDOperand LHSL = Select(N->getOperand(0));
737 SDOperand LHSH = Select(N->getOperand(1));
738 SDOperand RHSL = Select(N->getOperand(2));
739 SDOperand RHSH = Select(N->getOperand(3));
740
741 std::vector<SDOperand> Result;
742 Result.push_back(CurDAG->getTargetNode(PPC::SUBFC, MVT::i32, MVT::Flag,
743 RHSL, LHSL));
744 Result.push_back(CurDAG->getTargetNode(PPC::SUBFE, MVT::i32, RHSH, LHSH,
745 Result[0].getValue(1)));
746 CodeGenMap[Op.getValue(0)] = Result[0];
747 CodeGenMap[Op.getValue(1)] = Result[1];
748 return Result[Op.ResNo];
749}
750
Nate Begeman1d9d7422005-10-18 00:28:58 +0000751SDOperand PPCDAGToDAGISel::SelectSETCC(SDOperand Op) {
Chris Lattner222adac2005-10-06 19:03:35 +0000752 SDNode *N = Op.Val;
753 unsigned Imm;
754 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(2))->get();
755 if (isIntImmediate(N->getOperand(1), Imm)) {
756 // We can codegen setcc op, imm very efficiently compared to a brcond.
757 // Check for those cases here.
758 // setcc op, 0
759 if (Imm == 0) {
760 SDOperand Op = Select(N->getOperand(0));
761 switch (CC) {
762 default: assert(0 && "Unhandled SetCC condition"); abort();
763 case ISD::SETEQ:
764 Op = CurDAG->getTargetNode(PPC::CNTLZW, MVT::i32, Op);
765 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Op, getI32Imm(27),
766 getI32Imm(5), getI32Imm(31));
767 break;
768 case ISD::SETNE: {
769 SDOperand AD = CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
770 Op, getI32Imm(~0U));
771 CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, AD, Op, AD.getValue(1));
772 break;
773 }
774 case ISD::SETLT:
775 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Op, getI32Imm(1),
776 getI32Imm(31), getI32Imm(31));
777 break;
778 case ISD::SETGT: {
779 SDOperand T = CurDAG->getTargetNode(PPC::NEG, MVT::i32, Op);
780 T = CurDAG->getTargetNode(PPC::ANDC, MVT::i32, T, Op);;
781 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, T, getI32Imm(1),
782 getI32Imm(31), getI32Imm(31));
783 break;
784 }
785 }
786 return SDOperand(N, 0);
787 } else if (Imm == ~0U) { // setcc op, -1
788 SDOperand Op = Select(N->getOperand(0));
789 switch (CC) {
790 default: assert(0 && "Unhandled SetCC condition"); abort();
791 case ISD::SETEQ:
792 Op = CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
793 Op, getI32Imm(1));
794 CurDAG->SelectNodeTo(N, PPC::ADDZE, MVT::i32,
795 CurDAG->getTargetNode(PPC::LI, MVT::i32,
796 getI32Imm(0)),
797 Op.getValue(1));
798 break;
799 case ISD::SETNE: {
800 Op = CurDAG->getTargetNode(PPC::NOR, MVT::i32, Op, Op);
801 SDOperand AD = CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
802 Op, getI32Imm(~0U));
803 CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, AD, Op, AD.getValue(1));
804 break;
805 }
806 case ISD::SETLT: {
807 SDOperand AD = CurDAG->getTargetNode(PPC::ADDI, MVT::i32, Op,
808 getI32Imm(1));
809 SDOperand AN = CurDAG->getTargetNode(PPC::AND, MVT::i32, AD, Op);
810 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, AN, getI32Imm(1),
811 getI32Imm(31), getI32Imm(31));
812 break;
813 }
814 case ISD::SETGT:
815 Op = CurDAG->getTargetNode(PPC::RLWINM, MVT::i32, Op, getI32Imm(1),
816 getI32Imm(31), getI32Imm(31));
817 CurDAG->SelectNodeTo(N, PPC::XORI, MVT::i32, Op, getI32Imm(1));
818 break;
819 }
820 return SDOperand(N, 0);
821 }
822 }
823
824 bool Inv;
825 unsigned Idx = getCRIdxForSetCC(CC, Inv);
826 SDOperand CCReg = SelectCC(N->getOperand(0), N->getOperand(1), CC);
827 SDOperand IntCR;
828
829 // Force the ccreg into CR7.
830 SDOperand CR7Reg = CurDAG->getRegister(PPC::CR7, MVT::i32);
831
832 std::vector<MVT::ValueType> VTs;
833 VTs.push_back(MVT::Other);
834 VTs.push_back(MVT::Flag); // NONSTANDARD CopyToReg node: defines a flag
835 std::vector<SDOperand> Ops;
836 Ops.push_back(CurDAG->getEntryNode());
837 Ops.push_back(CR7Reg);
838 Ops.push_back(CCReg);
839 CCReg = CurDAG->getNode(ISD::CopyToReg, VTs, Ops).getValue(1);
840
841 if (TLI.getTargetMachine().getSubtarget<PPCSubtarget>().isGigaProcessor())
842 IntCR = CurDAG->getTargetNode(PPC::MFOCRF, MVT::i32, CR7Reg, CCReg);
843 else
844 IntCR = CurDAG->getTargetNode(PPC::MFCR, MVT::i32, CCReg);
845
846 if (!Inv) {
847 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, IntCR,
848 getI32Imm(32-(3-Idx)), getI32Imm(31), getI32Imm(31));
849 } else {
850 SDOperand Tmp =
851 CurDAG->getTargetNode(PPC::RLWINM, MVT::i32, IntCR,
852 getI32Imm(32-(3-Idx)), getI32Imm(31),getI32Imm(31));
853 CurDAG->SelectNodeTo(N, PPC::XORI, MVT::i32, Tmp, getI32Imm(1));
854 }
855
856 return SDOperand(N, 0);
857}
Chris Lattner2b63e4c2005-10-06 18:56:10 +0000858
Nate Begeman1d9d7422005-10-18 00:28:58 +0000859SDOperand PPCDAGToDAGISel::SelectCALL(SDOperand Op) {
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000860 SDNode *N = Op.Val;
861 SDOperand Chain = Select(N->getOperand(0));
862
863 unsigned CallOpcode;
864 std::vector<SDOperand> CallOperands;
865
866 if (GlobalAddressSDNode *GASD =
867 dyn_cast<GlobalAddressSDNode>(N->getOperand(1))) {
868 CallOpcode = PPC::CALLpcrel;
869 CallOperands.push_back(CurDAG->getTargetGlobalAddress(GASD->getGlobal(),
870 MVT::i32));
871 } else if (ExternalSymbolSDNode *ESSDN =
872 dyn_cast<ExternalSymbolSDNode>(N->getOperand(1))) {
873 CallOpcode = PPC::CALLpcrel;
874 CallOperands.push_back(N->getOperand(1));
875 } else {
876 // Copy the callee address into the CTR register.
877 SDOperand Callee = Select(N->getOperand(1));
878 Chain = CurDAG->getTargetNode(PPC::MTCTR, MVT::Other, Callee, Chain);
879
880 // Copy the callee address into R12 on darwin.
881 SDOperand R12 = CurDAG->getRegister(PPC::R12, MVT::i32);
882 Chain = CurDAG->getNode(ISD::CopyToReg, MVT::Other, Chain, R12, Callee);
883
884 CallOperands.push_back(getI32Imm(20)); // Information to encode indcall
885 CallOperands.push_back(getI32Imm(0)); // Information to encode indcall
886 CallOperands.push_back(R12);
887 CallOpcode = PPC::CALLindirect;
888 }
889
890 unsigned GPR_idx = 0, FPR_idx = 0;
891 static const unsigned GPR[] = {
892 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
893 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
894 };
895 static const unsigned FPR[] = {
896 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
897 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
898 };
899
900 SDOperand InFlag; // Null incoming flag value.
901
902 for (unsigned i = 2, e = N->getNumOperands(); i != e; ++i) {
903 unsigned DestReg = 0;
904 MVT::ValueType RegTy = N->getOperand(i).getValueType();
905 if (RegTy == MVT::i32) {
906 assert(GPR_idx < 8 && "Too many int args");
907 DestReg = GPR[GPR_idx++];
908 } else {
909 assert(MVT::isFloatingPoint(N->getOperand(i).getValueType()) &&
910 "Unpromoted integer arg?");
911 assert(FPR_idx < 13 && "Too many fp args");
912 DestReg = FPR[FPR_idx++];
913 }
914
915 if (N->getOperand(i).getOpcode() != ISD::UNDEF) {
916 SDOperand Val = Select(N->getOperand(i));
917 Chain = CurDAG->getCopyToReg(Chain, DestReg, Val, InFlag);
918 InFlag = Chain.getValue(1);
919 CallOperands.push_back(CurDAG->getRegister(DestReg, RegTy));
920 }
921 }
922
923 // Finally, once everything is in registers to pass to the call, emit the
924 // call itself.
925 if (InFlag.Val)
926 CallOperands.push_back(InFlag); // Strong dep on register copies.
927 else
928 CallOperands.push_back(Chain); // Weak dep on whatever occurs before
929 Chain = CurDAG->getTargetNode(CallOpcode, MVT::Other, MVT::Flag,
930 CallOperands);
931
932 std::vector<SDOperand> CallResults;
933
934 // If the call has results, copy the values out of the ret val registers.
935 switch (N->getValueType(0)) {
936 default: assert(0 && "Unexpected ret value!");
937 case MVT::Other: break;
938 case MVT::i32:
939 if (N->getValueType(1) == MVT::i32) {
940 Chain = CurDAG->getCopyFromReg(Chain, PPC::R4, MVT::i32,
941 Chain.getValue(1)).getValue(1);
942 CallResults.push_back(Chain.getValue(0));
943 Chain = CurDAG->getCopyFromReg(Chain, PPC::R3, MVT::i32,
944 Chain.getValue(2)).getValue(1);
945 CallResults.push_back(Chain.getValue(0));
946 } else {
947 Chain = CurDAG->getCopyFromReg(Chain, PPC::R3, MVT::i32,
948 Chain.getValue(1)).getValue(1);
949 CallResults.push_back(Chain.getValue(0));
950 }
951 break;
952 case MVT::f32:
953 case MVT::f64:
954 Chain = CurDAG->getCopyFromReg(Chain, PPC::F1, N->getValueType(0),
955 Chain.getValue(1)).getValue(1);
956 CallResults.push_back(Chain.getValue(0));
957 break;
958 }
959
960 CallResults.push_back(Chain);
961 for (unsigned i = 0, e = CallResults.size(); i != e; ++i)
962 CodeGenMap[Op.getValue(i)] = CallResults[i];
963 return CallResults[Op.ResNo];
964}
965
Chris Lattnera5a91b12005-08-17 19:33:03 +0000966// Select - Convert the specified operand from a target-independent to a
967// target-specific node if it hasn't already been changed.
Nate Begeman1d9d7422005-10-18 00:28:58 +0000968SDOperand PPCDAGToDAGISel::Select(SDOperand Op) {
Chris Lattnera5a91b12005-08-17 19:33:03 +0000969 SDNode *N = Op.Val;
Chris Lattner0bbea952005-08-26 20:25:03 +0000970 if (N->getOpcode() >= ISD::BUILTIN_OP_END &&
971 N->getOpcode() < PPCISD::FIRST_NUMBER)
Chris Lattnera5a91b12005-08-17 19:33:03 +0000972 return Op; // Already selected.
Chris Lattnerd3d2cf52005-09-29 00:59:32 +0000973
974 // If this has already been converted, use it.
975 std::map<SDOperand, SDOperand>::iterator CGMI = CodeGenMap.find(Op);
976 if (CGMI != CodeGenMap.end()) return CGMI->second;
Chris Lattnera5a91b12005-08-17 19:33:03 +0000977
978 switch (N->getOpcode()) {
Chris Lattner19c09072005-09-07 23:45:15 +0000979 default: break;
Chris Lattner222adac2005-10-06 19:03:35 +0000980 case ISD::DYNAMIC_STACKALLOC: return SelectDYNAMIC_STACKALLOC(Op);
981 case ISD::ADD_PARTS: return SelectADD_PARTS(Op);
982 case ISD::SUB_PARTS: return SelectSUB_PARTS(Op);
983 case ISD::SETCC: return SelectSETCC(Op);
Chris Lattner6a16f6a2005-10-06 19:07:45 +0000984 case ISD::CALL: return SelectCALL(Op);
985 case ISD::TAILCALL: return SelectCALL(Op);
986
Chris Lattnera5a91b12005-08-17 19:33:03 +0000987 case ISD::TokenFactor: {
988 SDOperand New;
989 if (N->getNumOperands() == 2) {
990 SDOperand Op0 = Select(N->getOperand(0));
991 SDOperand Op1 = Select(N->getOperand(1));
992 New = CurDAG->getNode(ISD::TokenFactor, MVT::Other, Op0, Op1);
993 } else {
994 std::vector<SDOperand> Ops;
995 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
Chris Lattner7e659972005-08-19 21:33:02 +0000996 Ops.push_back(Select(N->getOperand(i)));
Chris Lattnera5a91b12005-08-17 19:33:03 +0000997 New = CurDAG->getNode(ISD::TokenFactor, MVT::Other, Ops);
998 }
999
Chris Lattnercf01a702005-10-07 22:10:27 +00001000 CodeGenMap[Op] = New;
Chris Lattnerd3d2cf52005-09-29 00:59:32 +00001001 return New;
Chris Lattnera5a91b12005-08-17 19:33:03 +00001002 }
1003 case ISD::CopyFromReg: {
1004 SDOperand Chain = Select(N->getOperand(0));
1005 if (Chain == N->getOperand(0)) return Op; // No change
1006 SDOperand New = CurDAG->getCopyFromReg(Chain,
1007 cast<RegisterSDNode>(N->getOperand(1))->getReg(), N->getValueType(0));
1008 return New.getValue(Op.ResNo);
1009 }
1010 case ISD::CopyToReg: {
1011 SDOperand Chain = Select(N->getOperand(0));
1012 SDOperand Reg = N->getOperand(1);
1013 SDOperand Val = Select(N->getOperand(2));
Chris Lattnerd3d2cf52005-09-29 00:59:32 +00001014 SDOperand New = CurDAG->getNode(ISD::CopyToReg, MVT::Other,
1015 Chain, Reg, Val);
Chris Lattnercf01a702005-10-07 22:10:27 +00001016 CodeGenMap[Op] = New;
Chris Lattnerd3d2cf52005-09-29 00:59:32 +00001017 return New;
Chris Lattnera5a91b12005-08-17 19:33:03 +00001018 }
Chris Lattner2b544002005-08-24 23:08:16 +00001019 case ISD::UNDEF:
1020 if (N->getValueType(0) == MVT::i32)
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001021 CurDAG->SelectNodeTo(N, PPC::IMPLICIT_DEF_GPR, MVT::i32);
Chris Lattner919c0322005-10-01 01:35:02 +00001022 else if (N->getValueType(0) == MVT::f32)
1023 CurDAG->SelectNodeTo(N, PPC::IMPLICIT_DEF_F4, MVT::f32);
1024 else
1025 CurDAG->SelectNodeTo(N, PPC::IMPLICIT_DEF_F8, MVT::f64);
Chris Lattner25dae722005-09-03 00:53:47 +00001026 return SDOperand(N, 0);
Chris Lattnere28e40a2005-08-25 00:45:43 +00001027 case ISD::FrameIndex: {
1028 int FI = cast<FrameIndexSDNode>(N)->getIndex();
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001029 CurDAG->SelectNodeTo(N, PPC::ADDI, MVT::i32,
Chris Lattnere28e40a2005-08-25 00:45:43 +00001030 CurDAG->getTargetFrameIndex(FI, MVT::i32),
1031 getI32Imm(0));
Chris Lattner25dae722005-09-03 00:53:47 +00001032 return SDOperand(N, 0);
Chris Lattnere28e40a2005-08-25 00:45:43 +00001033 }
Chris Lattner34e17052005-08-25 05:04:11 +00001034 case ISD::ConstantPool: {
Chris Lattner5839bf22005-08-26 17:15:30 +00001035 Constant *C = cast<ConstantPoolSDNode>(N)->get();
1036 SDOperand Tmp, CPI = CurDAG->getTargetConstantPool(C, MVT::i32);
Chris Lattner34e17052005-08-25 05:04:11 +00001037 if (PICEnabled)
1038 Tmp = CurDAG->getTargetNode(PPC::ADDIS, MVT::i32, getGlobalBaseReg(),CPI);
1039 else
1040 Tmp = CurDAG->getTargetNode(PPC::LIS, MVT::i32, CPI);
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001041 CurDAG->SelectNodeTo(N, PPC::LA, MVT::i32, Tmp, CPI);
Chris Lattner25dae722005-09-03 00:53:47 +00001042 return SDOperand(N, 0);
Chris Lattner34e17052005-08-25 05:04:11 +00001043 }
Chris Lattner4416f1a2005-08-19 22:38:53 +00001044 case ISD::GlobalAddress: {
1045 GlobalValue *GV = cast<GlobalAddressSDNode>(N)->getGlobal();
1046 SDOperand Tmp;
1047 SDOperand GA = CurDAG->getTargetGlobalAddress(GV, MVT::i32);
Chris Lattner9944b762005-08-21 22:31:09 +00001048 if (PICEnabled)
1049 Tmp = CurDAG->getTargetNode(PPC::ADDIS, MVT::i32, getGlobalBaseReg(), GA);
1050 else
Chris Lattner4416f1a2005-08-19 22:38:53 +00001051 Tmp = CurDAG->getTargetNode(PPC::LIS, MVT::i32, GA);
Chris Lattner9944b762005-08-21 22:31:09 +00001052
Chris Lattner4416f1a2005-08-19 22:38:53 +00001053 if (GV->hasWeakLinkage() || GV->isExternal())
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001054 CurDAG->SelectNodeTo(N, PPC::LWZ, MVT::i32, GA, Tmp);
Chris Lattner4416f1a2005-08-19 22:38:53 +00001055 else
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001056 CurDAG->SelectNodeTo(N, PPC::LA, MVT::i32, Tmp, GA);
Chris Lattner25dae722005-09-03 00:53:47 +00001057 return SDOperand(N, 0);
Chris Lattner4416f1a2005-08-19 22:38:53 +00001058 }
Chris Lattner222adac2005-10-06 19:03:35 +00001059
Chris Lattner867940d2005-10-02 06:58:23 +00001060 case PPCISD::FSEL: {
Chris Lattner43f07a42005-10-02 07:07:49 +00001061 SDOperand Comparison = Select(N->getOperand(0));
1062 // Extend the comparison to 64-bits.
1063 if (Comparison.getValueType() == MVT::f32)
1064 Comparison = CurDAG->getTargetNode(PPC::FMRSD, MVT::f64, Comparison);
1065
1066 unsigned Opc = N->getValueType(0) == MVT::f32 ? PPC::FSELS : PPC::FSELD;
1067 CurDAG->SelectNodeTo(N, Opc, N->getValueType(0), Comparison,
1068 Select(N->getOperand(1)), Select(N->getOperand(2)));
Chris Lattner25dae722005-09-03 00:53:47 +00001069 return SDOperand(N, 0);
Chris Lattner867940d2005-10-02 06:58:23 +00001070 }
Nate Begemanc09eeec2005-09-06 22:03:27 +00001071 case PPCISD::FCFID:
1072 CurDAG->SelectNodeTo(N, PPC::FCFID, N->getValueType(0),
1073 Select(N->getOperand(0)));
1074 return SDOperand(N, 0);
1075 case PPCISD::FCTIDZ:
1076 CurDAG->SelectNodeTo(N, PPC::FCTIDZ, N->getValueType(0),
1077 Select(N->getOperand(0)));
1078 return SDOperand(N, 0);
Chris Lattnerf7605322005-08-31 21:09:52 +00001079 case PPCISD::FCTIWZ:
1080 CurDAG->SelectNodeTo(N, PPC::FCTIWZ, N->getValueType(0),
1081 Select(N->getOperand(0)));
Chris Lattner25dae722005-09-03 00:53:47 +00001082 return SDOperand(N, 0);
Chris Lattner615c2d02005-09-28 22:29:58 +00001083 case ISD::FADD: {
1084 MVT::ValueType Ty = N->getValueType(0);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001085 if (!NoExcessFPPrecision) { // Match FMA ops
Chris Lattner615c2d02005-09-28 22:29:58 +00001086 if (N->getOperand(0).getOpcode() == ISD::FMUL &&
Chris Lattnera5a91b12005-08-17 19:33:03 +00001087 N->getOperand(0).Val->hasOneUse()) {
1088 ++FusedFP; // Statistic
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001089 CurDAG->SelectNodeTo(N, Ty == MVT::f64 ? PPC::FMADD : PPC::FMADDS, Ty,
Chris Lattnera5a91b12005-08-17 19:33:03 +00001090 Select(N->getOperand(0).getOperand(0)),
1091 Select(N->getOperand(0).getOperand(1)),
1092 Select(N->getOperand(1)));
Chris Lattner25dae722005-09-03 00:53:47 +00001093 return SDOperand(N, 0);
Chris Lattner615c2d02005-09-28 22:29:58 +00001094 } else if (N->getOperand(1).getOpcode() == ISD::FMUL &&
Chris Lattnera5a91b12005-08-17 19:33:03 +00001095 N->getOperand(1).hasOneUse()) {
1096 ++FusedFP; // Statistic
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001097 CurDAG->SelectNodeTo(N, Ty == MVT::f64 ? PPC::FMADD : PPC::FMADDS, Ty,
Chris Lattnera5a91b12005-08-17 19:33:03 +00001098 Select(N->getOperand(1).getOperand(0)),
1099 Select(N->getOperand(1).getOperand(1)),
1100 Select(N->getOperand(0)));
Chris Lattner25dae722005-09-03 00:53:47 +00001101 return SDOperand(N, 0);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001102 }
1103 }
1104
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001105 CurDAG->SelectNodeTo(N, Ty == MVT::f64 ? PPC::FADD : PPC::FADDS, Ty,
Chris Lattnera5a91b12005-08-17 19:33:03 +00001106 Select(N->getOperand(0)), Select(N->getOperand(1)));
Chris Lattner25dae722005-09-03 00:53:47 +00001107 return SDOperand(N, 0);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001108 }
Chris Lattner615c2d02005-09-28 22:29:58 +00001109 case ISD::FSUB: {
1110 MVT::ValueType Ty = N->getValueType(0);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001111
1112 if (!NoExcessFPPrecision) { // Match FMA ops
Chris Lattner615c2d02005-09-28 22:29:58 +00001113 if (N->getOperand(0).getOpcode() == ISD::FMUL &&
Chris Lattnera5a91b12005-08-17 19:33:03 +00001114 N->getOperand(0).Val->hasOneUse()) {
1115 ++FusedFP; // Statistic
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001116 CurDAG->SelectNodeTo(N, Ty == MVT::f64 ? PPC::FMSUB : PPC::FMSUBS, Ty,
Chris Lattnera5a91b12005-08-17 19:33:03 +00001117 Select(N->getOperand(0).getOperand(0)),
1118 Select(N->getOperand(0).getOperand(1)),
1119 Select(N->getOperand(1)));
Chris Lattner25dae722005-09-03 00:53:47 +00001120 return SDOperand(N, 0);
Chris Lattner615c2d02005-09-28 22:29:58 +00001121 } else if (N->getOperand(1).getOpcode() == ISD::FMUL &&
Chris Lattnera5a91b12005-08-17 19:33:03 +00001122 N->getOperand(1).Val->hasOneUse()) {
1123 ++FusedFP; // Statistic
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001124 CurDAG->SelectNodeTo(N, Ty == MVT::f64 ? PPC::FNMSUB : PPC::FNMSUBS, Ty,
Chris Lattnera5a91b12005-08-17 19:33:03 +00001125 Select(N->getOperand(1).getOperand(0)),
1126 Select(N->getOperand(1).getOperand(1)),
1127 Select(N->getOperand(0)));
Chris Lattner25dae722005-09-03 00:53:47 +00001128 return SDOperand(N, 0);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001129 }
1130 }
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001131 CurDAG->SelectNodeTo(N, Ty == MVT::f64 ? PPC::FSUB : PPC::FSUBS, Ty,
Chris Lattnera5a91b12005-08-17 19:33:03 +00001132 Select(N->getOperand(0)),
1133 Select(N->getOperand(1)));
Chris Lattner25dae722005-09-03 00:53:47 +00001134 return SDOperand(N, 0);
Nate Begeman26653502005-08-17 23:46:35 +00001135 }
Chris Lattner88add102005-09-28 22:50:24 +00001136 case ISD::SDIV: {
Chris Lattner8784a232005-08-25 17:50:06 +00001137 unsigned Imm;
1138 if (isIntImmediate(N->getOperand(1), Imm)) {
1139 if ((signed)Imm > 0 && isPowerOf2_32(Imm)) {
1140 SDOperand Op =
1141 CurDAG->getTargetNode(PPC::SRAWI, MVT::i32, MVT::Flag,
1142 Select(N->getOperand(0)),
1143 getI32Imm(Log2_32(Imm)));
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001144 CurDAG->SelectNodeTo(N, PPC::ADDZE, MVT::i32,
Chris Lattner8784a232005-08-25 17:50:06 +00001145 Op.getValue(0), Op.getValue(1));
Chris Lattner25dae722005-09-03 00:53:47 +00001146 return SDOperand(N, 0);
Chris Lattner8784a232005-08-25 17:50:06 +00001147 } else if ((signed)Imm < 0 && isPowerOf2_32(-Imm)) {
1148 SDOperand Op =
Chris Lattner2501d5e2005-08-30 17:13:58 +00001149 CurDAG->getTargetNode(PPC::SRAWI, MVT::i32, MVT::Flag,
Chris Lattner8784a232005-08-25 17:50:06 +00001150 Select(N->getOperand(0)),
1151 getI32Imm(Log2_32(-Imm)));
1152 SDOperand PT =
Chris Lattner2501d5e2005-08-30 17:13:58 +00001153 CurDAG->getTargetNode(PPC::ADDZE, MVT::i32, Op.getValue(0),
1154 Op.getValue(1));
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001155 CurDAG->SelectNodeTo(N, PPC::NEG, MVT::i32, PT);
Chris Lattner25dae722005-09-03 00:53:47 +00001156 return SDOperand(N, 0);
Chris Lattner047b9522005-08-25 22:04:30 +00001157 } else if (Imm) {
1158 SDOperand Result = Select(BuildSDIVSequence(N));
Chris Lattnerd3d2cf52005-09-29 00:59:32 +00001159 CodeGenMap[Op] = Result;
1160 return Result;
Chris Lattner8784a232005-08-25 17:50:06 +00001161 }
1162 }
Chris Lattner047b9522005-08-25 22:04:30 +00001163
Chris Lattner237733e2005-09-29 23:33:31 +00001164 // Other cases are autogenerated.
1165 break;
Chris Lattner047b9522005-08-25 22:04:30 +00001166 }
1167 case ISD::UDIV: {
1168 // If this is a divide by constant, we can emit code using some magic
1169 // constants to implement it as a multiply instead.
1170 unsigned Imm;
Chris Lattnera9317ed2005-08-25 23:21:06 +00001171 if (isIntImmediate(N->getOperand(1), Imm) && Imm) {
Chris Lattner047b9522005-08-25 22:04:30 +00001172 SDOperand Result = Select(BuildUDIVSequence(N));
Chris Lattnerd3d2cf52005-09-29 00:59:32 +00001173 CodeGenMap[Op] = Result;
1174 return Result;
Chris Lattner047b9522005-08-25 22:04:30 +00001175 }
1176
Chris Lattner237733e2005-09-29 23:33:31 +00001177 // Other cases are autogenerated.
1178 break;
Chris Lattner047b9522005-08-25 22:04:30 +00001179 }
Nate Begemancffc32b2005-08-18 07:30:46 +00001180 case ISD::AND: {
Nate Begemana6940472005-08-18 18:01:39 +00001181 unsigned Imm;
Nate Begemancffc32b2005-08-18 07:30:46 +00001182 // If this is an and of a value rotated between 0 and 31 bits and then and'd
1183 // with a mask, emit rlwinm
1184 if (isIntImmediate(N->getOperand(1), Imm) && (isShiftedMask_32(Imm) ||
1185 isShiftedMask_32(~Imm))) {
1186 SDOperand Val;
Nate Begemana6940472005-08-18 18:01:39 +00001187 unsigned SH, MB, ME;
Nate Begemancffc32b2005-08-18 07:30:46 +00001188 if (isRotateAndMask(N->getOperand(0).Val, Imm, false, SH, MB, ME)) {
1189 Val = Select(N->getOperand(0).getOperand(0));
1190 } else {
1191 Val = Select(N->getOperand(0));
1192 isRunOfOnes(Imm, MB, ME);
1193 SH = 0;
1194 }
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001195 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Val, getI32Imm(SH),
Nate Begemancffc32b2005-08-18 07:30:46 +00001196 getI32Imm(MB), getI32Imm(ME));
Chris Lattner25dae722005-09-03 00:53:47 +00001197 return SDOperand(N, 0);
Nate Begemancffc32b2005-08-18 07:30:46 +00001198 }
Chris Lattner237733e2005-09-29 23:33:31 +00001199
1200 // Other cases are autogenerated.
1201 break;
Nate Begemancffc32b2005-08-18 07:30:46 +00001202 }
Nate Begeman02b88a42005-08-19 00:38:14 +00001203 case ISD::OR:
Chris Lattnerd3d2cf52005-09-29 00:59:32 +00001204 if (SDNode *I = SelectBitfieldInsert(N))
1205 return CodeGenMap[Op] = SDOperand(I, 0);
Chris Lattnerd3d2cf52005-09-29 00:59:32 +00001206
Chris Lattner237733e2005-09-29 23:33:31 +00001207 // Other cases are autogenerated.
1208 break;
Nate Begemanc15ed442005-08-18 23:38:00 +00001209 case ISD::SHL: {
1210 unsigned Imm, SH, MB, ME;
1211 if (isOpcWithIntImmediate(N->getOperand(0).Val, ISD::AND, Imm) &&
1212 isRotateAndMask(N, Imm, true, SH, MB, ME))
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001213 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32,
Nate Begemanc15ed442005-08-18 23:38:00 +00001214 Select(N->getOperand(0).getOperand(0)),
1215 getI32Imm(SH), getI32Imm(MB), getI32Imm(ME));
1216 else if (isIntImmediate(N->getOperand(1), Imm))
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001217 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Select(N->getOperand(0)),
Nate Begemanc15ed442005-08-18 23:38:00 +00001218 getI32Imm(Imm), getI32Imm(0), getI32Imm(31-Imm));
1219 else
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001220 CurDAG->SelectNodeTo(N, PPC::SLW, MVT::i32, Select(N->getOperand(0)),
Nate Begemanc15ed442005-08-18 23:38:00 +00001221 Select(N->getOperand(1)));
Chris Lattner25dae722005-09-03 00:53:47 +00001222 return SDOperand(N, 0);
Nate Begemanc15ed442005-08-18 23:38:00 +00001223 }
1224 case ISD::SRL: {
1225 unsigned Imm, SH, MB, ME;
1226 if (isOpcWithIntImmediate(N->getOperand(0).Val, ISD::AND, Imm) &&
1227 isRotateAndMask(N, Imm, true, SH, MB, ME))
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001228 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32,
Nate Begemanc15ed442005-08-18 23:38:00 +00001229 Select(N->getOperand(0).getOperand(0)),
Nate Begemanc09eeec2005-09-06 22:03:27 +00001230 getI32Imm(SH & 0x1F), getI32Imm(MB), getI32Imm(ME));
Nate Begemanc15ed442005-08-18 23:38:00 +00001231 else if (isIntImmediate(N->getOperand(1), Imm))
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001232 CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Select(N->getOperand(0)),
Nate Begemanc09eeec2005-09-06 22:03:27 +00001233 getI32Imm((32-Imm) & 0x1F), getI32Imm(Imm),
1234 getI32Imm(31));
Nate Begemanc15ed442005-08-18 23:38:00 +00001235 else
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001236 CurDAG->SelectNodeTo(N, PPC::SRW, MVT::i32, Select(N->getOperand(0)),
Nate Begemanc15ed442005-08-18 23:38:00 +00001237 Select(N->getOperand(1)));
Chris Lattner25dae722005-09-03 00:53:47 +00001238 return SDOperand(N, 0);
Nate Begemanc15ed442005-08-18 23:38:00 +00001239 }
Nate Begeman26653502005-08-17 23:46:35 +00001240 case ISD::FNEG: {
1241 SDOperand Val = Select(N->getOperand(0));
1242 MVT::ValueType Ty = N->getValueType(0);
Chris Lattner4cb5a1b2005-10-15 22:06:18 +00001243 if (N->getOperand(0).Val->hasOneUse()) {
Nate Begeman26653502005-08-17 23:46:35 +00001244 unsigned Opc;
Chris Lattner528f58e2005-08-28 23:39:22 +00001245 switch (Val.isTargetOpcode() ? Val.getTargetOpcode() : 0) {
Nate Begeman26653502005-08-17 23:46:35 +00001246 default: Opc = 0; break;
Chris Lattner919c0322005-10-01 01:35:02 +00001247 case PPC::FABSS: Opc = PPC::FNABSS; break;
1248 case PPC::FABSD: Opc = PPC::FNABSD; break;
Nate Begeman26653502005-08-17 23:46:35 +00001249 case PPC::FMADD: Opc = PPC::FNMADD; break;
1250 case PPC::FMADDS: Opc = PPC::FNMADDS; break;
1251 case PPC::FMSUB: Opc = PPC::FNMSUB; break;
1252 case PPC::FMSUBS: Opc = PPC::FNMSUBS; break;
1253 }
1254 // If we inverted the opcode, then emit the new instruction with the
1255 // inverted opcode and the original instruction's operands. Otherwise,
1256 // fall through and generate a fneg instruction.
1257 if (Opc) {
Chris Lattner919c0322005-10-01 01:35:02 +00001258 if (Opc == PPC::FNABSS || Opc == PPC::FNABSD)
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001259 CurDAG->SelectNodeTo(N, Opc, Ty, Val.getOperand(0));
Nate Begeman26653502005-08-17 23:46:35 +00001260 else
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001261 CurDAG->SelectNodeTo(N, Opc, Ty, Val.getOperand(0),
Nate Begeman26653502005-08-17 23:46:35 +00001262 Val.getOperand(1), Val.getOperand(2));
Chris Lattner25dae722005-09-03 00:53:47 +00001263 return SDOperand(N, 0);
Nate Begeman26653502005-08-17 23:46:35 +00001264 }
1265 }
Chris Lattner919c0322005-10-01 01:35:02 +00001266 if (Ty == MVT::f32)
1267 CurDAG->SelectNodeTo(N, PPC::FNEGS, MVT::f32, Val);
1268 else
Chris Lattner2c1760f2005-10-01 02:51:36 +00001269 CurDAG->SelectNodeTo(N, PPC::FNEGD, MVT::f64, Val);
Chris Lattner25dae722005-09-03 00:53:47 +00001270 return SDOperand(N, 0);
Nate Begeman26653502005-08-17 23:46:35 +00001271 }
Chris Lattner9944b762005-08-21 22:31:09 +00001272 case ISD::LOAD:
1273 case ISD::EXTLOAD:
1274 case ISD::ZEXTLOAD:
1275 case ISD::SEXTLOAD: {
1276 SDOperand Op1, Op2;
1277 bool isIdx = SelectAddr(N->getOperand(1), Op1, Op2);
1278
1279 MVT::ValueType TypeBeingLoaded = (N->getOpcode() == ISD::LOAD) ?
1280 N->getValueType(0) : cast<VTSDNode>(N->getOperand(3))->getVT();
1281 unsigned Opc;
1282 switch (TypeBeingLoaded) {
1283 default: N->dump(); assert(0 && "Cannot load this type!");
1284 case MVT::i1:
1285 case MVT::i8: Opc = isIdx ? PPC::LBZX : PPC::LBZ; break;
1286 case MVT::i16:
1287 if (N->getOpcode() == ISD::SEXTLOAD) { // SEXT load?
1288 Opc = isIdx ? PPC::LHAX : PPC::LHA;
1289 } else {
1290 Opc = isIdx ? PPC::LHZX : PPC::LHZ;
1291 }
1292 break;
1293 case MVT::i32: Opc = isIdx ? PPC::LWZX : PPC::LWZ; break;
1294 case MVT::f32: Opc = isIdx ? PPC::LFSX : PPC::LFS; break;
1295 case MVT::f64: Opc = isIdx ? PPC::LFDX : PPC::LFD; break;
1296 }
1297
Chris Lattner919c0322005-10-01 01:35:02 +00001298 // If this is an f32 -> f64 load, emit the f32 load, then use an 'extending
1299 // copy'.
1300 if (TypeBeingLoaded != MVT::f32 || N->getOpcode() == ISD::LOAD) {
1301 CurDAG->SelectNodeTo(N, Opc, N->getValueType(0), MVT::Other,
1302 Op1, Op2, Select(N->getOperand(0)));
1303 return SDOperand(N, Op.ResNo);
1304 } else {
1305 std::vector<SDOperand> Ops;
1306 Ops.push_back(Op1);
1307 Ops.push_back(Op2);
1308 Ops.push_back(Select(N->getOperand(0)));
1309 SDOperand Res = CurDAG->getTargetNode(Opc, MVT::f32, MVT::Other, Ops);
1310 SDOperand Ext = CurDAG->getTargetNode(PPC::FMRSD, MVT::f64, Res);
1311 CodeGenMap[Op.getValue(0)] = Ext;
1312 CodeGenMap[Op.getValue(1)] = Res.getValue(1);
1313 if (Op.ResNo)
1314 return Res.getValue(1);
1315 else
1316 return Ext;
1317 }
Chris Lattner9944b762005-08-21 22:31:09 +00001318 }
Chris Lattnerf7f22552005-08-22 01:27:59 +00001319 case ISD::TRUNCSTORE:
1320 case ISD::STORE: {
1321 SDOperand AddrOp1, AddrOp2;
1322 bool isIdx = SelectAddr(N->getOperand(2), AddrOp1, AddrOp2);
1323
1324 unsigned Opc;
1325 if (N->getOpcode() == ISD::STORE) {
1326 switch (N->getOperand(1).getValueType()) {
1327 default: assert(0 && "unknown Type in store");
1328 case MVT::i32: Opc = isIdx ? PPC::STWX : PPC::STW; break;
1329 case MVT::f64: Opc = isIdx ? PPC::STFDX : PPC::STFD; break;
1330 case MVT::f32: Opc = isIdx ? PPC::STFSX : PPC::STFS; break;
1331 }
1332 } else { //ISD::TRUNCSTORE
1333 switch(cast<VTSDNode>(N->getOperand(4))->getVT()) {
1334 default: assert(0 && "unknown Type in store");
Chris Lattnerf7f22552005-08-22 01:27:59 +00001335 case MVT::i8: Opc = isIdx ? PPC::STBX : PPC::STB; break;
1336 case MVT::i16: Opc = isIdx ? PPC::STHX : PPC::STH; break;
1337 }
1338 }
Chris Lattnerfb0c9642005-08-24 22:45:17 +00001339
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001340 CurDAG->SelectNodeTo(N, Opc, MVT::Other, Select(N->getOperand(1)),
Chris Lattnerf7f22552005-08-22 01:27:59 +00001341 AddrOp1, AddrOp2, Select(N->getOperand(0)));
Chris Lattner25dae722005-09-03 00:53:47 +00001342 return SDOperand(N, 0);
Chris Lattnerf7f22552005-08-22 01:27:59 +00001343 }
Chris Lattner64906a02005-08-25 20:08:18 +00001344
Chris Lattner13794f52005-08-26 18:46:49 +00001345 case ISD::SELECT_CC: {
1346 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(4))->get();
1347
1348 // handle the setcc cases here. select_cc lhs, 0, 1, 0, cc
1349 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N->getOperand(1)))
1350 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N->getOperand(2)))
1351 if (ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N->getOperand(3)))
1352 if (N1C->isNullValue() && N3C->isNullValue() &&
1353 N2C->getValue() == 1ULL && CC == ISD::SETNE) {
1354 SDOperand LHS = Select(N->getOperand(0));
1355 SDOperand Tmp =
1356 CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag,
1357 LHS, getI32Imm(~0U));
1358 CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, Tmp, LHS,
1359 Tmp.getValue(1));
Chris Lattner25dae722005-09-03 00:53:47 +00001360 return SDOperand(N, 0);
Chris Lattner13794f52005-08-26 18:46:49 +00001361 }
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00001362
Chris Lattner50ff55c2005-09-01 19:20:44 +00001363 SDOperand CCReg = SelectCC(N->getOperand(0), N->getOperand(1), CC);
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00001364 unsigned BROpc = getBCCForSetCC(CC);
1365
1366 bool isFP = MVT::isFloatingPoint(N->getValueType(0));
Chris Lattner919c0322005-10-01 01:35:02 +00001367 unsigned SelectCCOp;
1368 if (MVT::isInteger(N->getValueType(0)))
1369 SelectCCOp = PPC::SELECT_CC_Int;
1370 else if (N->getValueType(0) == MVT::f32)
1371 SelectCCOp = PPC::SELECT_CC_F4;
1372 else
1373 SelectCCOp = PPC::SELECT_CC_F8;
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00001374 CurDAG->SelectNodeTo(N, SelectCCOp, N->getValueType(0), CCReg,
1375 Select(N->getOperand(2)), Select(N->getOperand(3)),
1376 getI32Imm(BROpc));
Chris Lattner25dae722005-09-03 00:53:47 +00001377 return SDOperand(N, 0);
Chris Lattner13794f52005-08-26 18:46:49 +00001378 }
1379
Chris Lattnera2590c52005-08-24 00:47:15 +00001380 case ISD::CALLSEQ_START:
1381 case ISD::CALLSEQ_END: {
1382 unsigned Amt = cast<ConstantSDNode>(N->getOperand(1))->getValue();
1383 unsigned Opc = N->getOpcode() == ISD::CALLSEQ_START ?
1384 PPC::ADJCALLSTACKDOWN : PPC::ADJCALLSTACKUP;
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001385 CurDAG->SelectNodeTo(N, Opc, MVT::Other,
Chris Lattnerfb0c9642005-08-24 22:45:17 +00001386 getI32Imm(Amt), Select(N->getOperand(0)));
Chris Lattner25dae722005-09-03 00:53:47 +00001387 return SDOperand(N, 0);
Chris Lattnera2590c52005-08-24 00:47:15 +00001388 }
Chris Lattnera5a91b12005-08-17 19:33:03 +00001389 case ISD::RET: {
1390 SDOperand Chain = Select(N->getOperand(0)); // Token chain.
1391
Chris Lattner7a49fdc2005-08-31 01:34:29 +00001392 if (N->getNumOperands() == 2) {
Chris Lattnera5a91b12005-08-17 19:33:03 +00001393 SDOperand Val = Select(N->getOperand(1));
Chris Lattnereb80fe82005-08-30 22:59:48 +00001394 if (N->getOperand(1).getValueType() == MVT::i32) {
Chris Lattnera5a91b12005-08-17 19:33:03 +00001395 Chain = CurDAG->getCopyToReg(Chain, PPC::R3, Val);
Nate Begeman1d9d7422005-10-18 00:28:58 +00001396 } else if (N->getOperand(1).getValueType() == MVT::i64) {
1397 SDOperand Srl = CurDAG->getTargetNode(PPC::RLDICL, MVT::i64, Val,
1398 getI32Imm(32), getI32Imm(32));
1399 Chain = CurDAG->getCopyToReg(Chain, PPC::R4, Val);
1400 Chain = CurDAG->getCopyToReg(Chain, PPC::R3, Srl);
Chris Lattnereb80fe82005-08-30 22:59:48 +00001401 } else {
1402 assert(MVT::isFloatingPoint(N->getOperand(1).getValueType()));
1403 Chain = CurDAG->getCopyToReg(Chain, PPC::F1, Val);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001404 }
Chris Lattner7a49fdc2005-08-31 01:34:29 +00001405 } else if (N->getNumOperands() > 1) {
1406 assert(N->getOperand(1).getValueType() == MVT::i32 &&
1407 N->getOperand(2).getValueType() == MVT::i32 &&
1408 N->getNumOperands() == 3 && "Unknown two-register ret value!");
1409 Chain = CurDAG->getCopyToReg(Chain, PPC::R4, Select(N->getOperand(1)));
1410 Chain = CurDAG->getCopyToReg(Chain, PPC::R3, Select(N->getOperand(2)));
Chris Lattnera5a91b12005-08-17 19:33:03 +00001411 }
1412
1413 // Finally, select this to a blr (return) instruction.
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001414 CurDAG->SelectNodeTo(N, PPC::BLR, MVT::Other, Chain);
Chris Lattner25dae722005-09-03 00:53:47 +00001415 return SDOperand(N, 0);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001416 }
Chris Lattner89532c72005-08-25 00:29:58 +00001417 case ISD::BR:
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001418 CurDAG->SelectNodeTo(N, PPC::B, MVT::Other, N->getOperand(1),
Chris Lattner89532c72005-08-25 00:29:58 +00001419 Select(N->getOperand(0)));
Chris Lattner25dae722005-09-03 00:53:47 +00001420 return SDOperand(N, 0);
Chris Lattner2fbb4572005-08-21 18:50:37 +00001421 case ISD::BR_CC:
1422 case ISD::BRTWOWAY_CC: {
1423 SDOperand Chain = Select(N->getOperand(0));
1424 MachineBasicBlock *Dest =
1425 cast<BasicBlockSDNode>(N->getOperand(4))->getBasicBlock();
1426 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(1))->get();
1427 SDOperand CondCode = SelectCC(N->getOperand(2), N->getOperand(3), CC);
Chris Lattner2fbb4572005-08-21 18:50:37 +00001428
1429 // If this is a two way branch, then grab the fallthrough basic block
1430 // argument and build a PowerPC branch pseudo-op, suitable for long branch
1431 // conversion if necessary by the branch selection pass. Otherwise, emit a
1432 // standard conditional branch.
1433 if (N->getOpcode() == ISD::BRTWOWAY_CC) {
Chris Lattnerca0a4772005-10-01 23:06:26 +00001434 SDOperand CondTrueBlock = N->getOperand(4);
1435 SDOperand CondFalseBlock = N->getOperand(5);
1436
1437 // If the false case is the current basic block, then this is a self loop.
1438 // We do not want to emit "Loop: ... brcond Out; br Loop", as it adds an
1439 // extra dispatch group to the loop. Instead, invert the condition and
1440 // emit "Loop: ... br!cond Loop; br Out
1441 if (cast<BasicBlockSDNode>(CondFalseBlock)->getBasicBlock() == BB) {
1442 std::swap(CondTrueBlock, CondFalseBlock);
1443 CC = getSetCCInverse(CC,
1444 MVT::isInteger(N->getOperand(2).getValueType()));
1445 }
1446
1447 unsigned Opc = getBCCForSetCC(CC);
Chris Lattner2fbb4572005-08-21 18:50:37 +00001448 SDOperand CB = CurDAG->getTargetNode(PPC::COND_BRANCH, MVT::Other,
1449 CondCode, getI32Imm(Opc),
Chris Lattnerca0a4772005-10-01 23:06:26 +00001450 CondTrueBlock, CondFalseBlock,
Chris Lattner2fbb4572005-08-21 18:50:37 +00001451 Chain);
Chris Lattnerca0a4772005-10-01 23:06:26 +00001452 CurDAG->SelectNodeTo(N, PPC::B, MVT::Other, CondFalseBlock, CB);
Chris Lattner2fbb4572005-08-21 18:50:37 +00001453 } else {
1454 // Iterate to the next basic block
1455 ilist<MachineBasicBlock>::iterator It = BB;
1456 ++It;
1457
1458 // If the fallthrough path is off the end of the function, which would be
1459 // undefined behavior, set it to be the same as the current block because
1460 // we have nothing better to set it to, and leaving it alone will cause
1461 // the PowerPC Branch Selection pass to crash.
1462 if (It == BB->getParent()->end()) It = Dest;
Chris Lattner2bb06cd2005-08-26 16:36:26 +00001463 CurDAG->SelectNodeTo(N, PPC::COND_BRANCH, MVT::Other, CondCode,
Chris Lattnerca0a4772005-10-01 23:06:26 +00001464 getI32Imm(getBCCForSetCC(CC)), N->getOperand(4),
Chris Lattner2fbb4572005-08-21 18:50:37 +00001465 CurDAG->getBasicBlock(It), Chain);
1466 }
Chris Lattner25dae722005-09-03 00:53:47 +00001467 return SDOperand(N, 0);
Chris Lattner2fbb4572005-08-21 18:50:37 +00001468 }
Chris Lattnera5a91b12005-08-17 19:33:03 +00001469 }
Chris Lattner25dae722005-09-03 00:53:47 +00001470
Chris Lattner19c09072005-09-07 23:45:15 +00001471 return SelectCode(Op);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001472}
1473
1474
Nate Begeman1d9d7422005-10-18 00:28:58 +00001475/// createPPCISelDag - This pass converts a legalized DAG into a
Chris Lattnera5a91b12005-08-17 19:33:03 +00001476/// PowerPC-specific DAG, ready for instruction scheduling.
1477///
Nate Begeman1d9d7422005-10-18 00:28:58 +00001478FunctionPass *llvm::createPPCISelDag(TargetMachine &TM) {
1479 return new PPCDAGToDAGISel(TM);
Chris Lattnera5a91b12005-08-17 19:33:03 +00001480}
1481