blob: d216026d2e7eafa6be518f6df3b4b601a734fcf0 [file] [log] [blame]
Nate Begeman6cca84e2005-10-16 05:39:50 +00001//===-- PPCISelDAGToDAG.cpp - PPC --pattern matching inst selector --------===//
Chris Lattner43ff01e2005-08-17 19:33:03 +00002//
3// The LLVM Compiler Infrastructure
4//
Chris Lattnerf3ebc3f2007-12-29 20:36:04 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Chris Lattner43ff01e2005-08-17 19:33:03 +00007//
8//===----------------------------------------------------------------------===//
9//
Nate Begeman6cca84e2005-10-16 05:39:50 +000010// This file defines a pattern matching instruction selector for PowerPC,
Chris Lattner43ff01e2005-08-17 19:33:03 +000011// converting from a legalized dag to a PPC dag.
12//
13//===----------------------------------------------------------------------===//
14
Chris Lattner1ef9cd42006-12-19 22:59:26 +000015#define DEBUG_TYPE "ppc-codegen"
Chris Lattnerbfca1ab2005-10-14 23:51:18 +000016#include "PPC.h"
Evan Cheng11424442011-07-26 00:24:13 +000017#include "MCTargetDesc/PPCPredicates.h"
Chandler Carruthed0881b2012-12-03 16:50:05 +000018#include "PPCTargetMachine.h"
Chris Lattner45640392005-08-19 22:38:53 +000019#include "llvm/CodeGen/MachineFunction.h"
Chandler Carruthed0881b2012-12-03 16:50:05 +000020#include "llvm/CodeGen/MachineInstrBuilder.h"
Chris Lattnera10fff52007-12-31 04:13:23 +000021#include "llvm/CodeGen/MachineRegisterInfo.h"
Chris Lattner43ff01e2005-08-17 19:33:03 +000022#include "llvm/CodeGen/SelectionDAG.h"
23#include "llvm/CodeGen/SelectionDAGISel.h"
Chandler Carruth9fb823b2013-01-02 11:36:10 +000024#include "llvm/IR/Constants.h"
25#include "llvm/IR/Function.h"
Chandler Carruth1fe21fc2013-01-19 08:03:47 +000026#include "llvm/IR/GlobalAlias.h"
Chandler Carruth9fb823b2013-01-02 11:36:10 +000027#include "llvm/IR/GlobalValue.h"
28#include "llvm/IR/GlobalVariable.h"
29#include "llvm/IR/Intrinsics.h"
Hal Finkel940ab932014-02-28 00:27:01 +000030#include "llvm/Support/CommandLine.h"
Chris Lattner43ff01e2005-08-17 19:33:03 +000031#include "llvm/Support/Debug.h"
Torok Edwinfb8d6d52009-07-08 20:53:28 +000032#include "llvm/Support/ErrorHandling.h"
Chandler Carruthed0881b2012-12-03 16:50:05 +000033#include "llvm/Support/MathExtras.h"
Torok Edwinfb8d6d52009-07-08 20:53:28 +000034#include "llvm/Support/raw_ostream.h"
Chandler Carruthed0881b2012-12-03 16:50:05 +000035#include "llvm/Target/TargetOptions.h"
Chris Lattner43ff01e2005-08-17 19:33:03 +000036using namespace llvm;
37
Hal Finkel940ab932014-02-28 00:27:01 +000038// FIXME: Remove this once the bug has been fixed!
39cl::opt<bool> ANDIGlueBug("expose-ppc-andi-glue-bug",
40cl::desc("expose the ANDI glue bug on PPC"), cl::Hidden);
41
Krzysztof Parzyszek2680b532013-02-13 17:40:07 +000042namespace llvm {
43 void initializePPCDAGToDAGISelPass(PassRegistry&);
44}
45
Chris Lattner43ff01e2005-08-17 19:33:03 +000046namespace {
Chris Lattner43ff01e2005-08-17 19:33:03 +000047 //===--------------------------------------------------------------------===//
Nate Begeman0b71e002005-10-18 00:28:58 +000048 /// PPCDAGToDAGISel - PPC specific code to select PPC machine
Chris Lattner43ff01e2005-08-17 19:33:03 +000049 /// instructions for SelectionDAG operations.
50 ///
Nick Lewycky02d5f772009-10-25 06:33:48 +000051 class PPCDAGToDAGISel : public SelectionDAGISel {
Dan Gohman21cea8a2010-04-17 15:26:15 +000052 const PPCTargetMachine &TM;
53 const PPCTargetLowering &PPCLowering;
Evan Chengec271b12007-10-23 06:42:42 +000054 const PPCSubtarget &PPCSubTarget;
Chris Lattner45640392005-08-19 22:38:53 +000055 unsigned GlobalBaseReg;
Chris Lattner43ff01e2005-08-17 19:33:03 +000056 public:
Dan Gohman56e3f632008-07-07 18:00:37 +000057 explicit PPCDAGToDAGISel(PPCTargetMachine &tm)
Dan Gohman619ef482009-01-15 19:20:50 +000058 : SelectionDAGISel(tm), TM(tm),
Evan Chengec271b12007-10-23 06:42:42 +000059 PPCLowering(*TM.getTargetLowering()),
Krzysztof Parzyszek2680b532013-02-13 17:40:07 +000060 PPCSubTarget(*TM.getSubtargetImpl()) {
61 initializePPCDAGToDAGISelPass(*PassRegistry::getPassRegistry());
62 }
Andrew Trickc416ba62010-12-24 04:28:06 +000063
Dan Gohman5ea74d52009-07-31 18:16:33 +000064 virtual bool runOnMachineFunction(MachineFunction &MF) {
Chris Lattner45640392005-08-19 22:38:53 +000065 // Make sure we re-emit a set of the global base reg if necessary
66 GlobalBaseReg = 0;
Dan Gohman5ea74d52009-07-31 18:16:33 +000067 SelectionDAGISel::runOnMachineFunction(MF);
Andrew Trickc416ba62010-12-24 04:28:06 +000068
Bill Schmidt38d94582012-10-10 20:54:15 +000069 if (!PPCSubTarget.isSVR4ABI())
70 InsertVRSaveCode(MF);
71
Chris Lattner1678a6c2006-03-16 18:25:23 +000072 return true;
Chris Lattner45640392005-08-19 22:38:53 +000073 }
Andrew Trickc416ba62010-12-24 04:28:06 +000074
Bill Schmidtf5b474c2013-02-21 00:38:25 +000075 virtual void PostprocessISelDAG();
76
Chris Lattner43ff01e2005-08-17 19:33:03 +000077 /// getI32Imm - Return a target constant with the specified value, of type
78 /// i32.
Dan Gohman2ce6f2a2008-07-27 21:46:04 +000079 inline SDValue getI32Imm(unsigned Imm) {
Owen Anderson9f944592009-08-11 20:47:22 +000080 return CurDAG->getTargetConstant(Imm, MVT::i32);
Chris Lattner43ff01e2005-08-17 19:33:03 +000081 }
Chris Lattner45640392005-08-19 22:38:53 +000082
Chris Lattner97b3da12006-06-27 00:04:13 +000083 /// getI64Imm - Return a target constant with the specified value, of type
84 /// i64.
Dan Gohman2ce6f2a2008-07-27 21:46:04 +000085 inline SDValue getI64Imm(uint64_t Imm) {
Owen Anderson9f944592009-08-11 20:47:22 +000086 return CurDAG->getTargetConstant(Imm, MVT::i64);
Chris Lattner97b3da12006-06-27 00:04:13 +000087 }
Andrew Trickc416ba62010-12-24 04:28:06 +000088
Chris Lattner97b3da12006-06-27 00:04:13 +000089 /// getSmallIPtrImm - Return a target constant of pointer type.
Dan Gohman2ce6f2a2008-07-27 21:46:04 +000090 inline SDValue getSmallIPtrImm(unsigned Imm) {
Chris Lattner97b3da12006-06-27 00:04:13 +000091 return CurDAG->getTargetConstant(Imm, PPCLowering.getPointerTy());
92 }
Andrew Trickc416ba62010-12-24 04:28:06 +000093
Sylvestre Ledru91ce36c2012-09-27 10:14:43 +000094 /// isRunOfOnes - Returns true iff Val consists of one contiguous run of 1s
Nate Begemand31efd12006-09-22 05:01:56 +000095 /// with any number of 0s on either side. The 1s are allowed to wrap from
96 /// LSB to MSB, so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs.
97 /// 0x0F0F0000 is not, since all 1s are not contiguous.
98 static bool isRunOfOnes(unsigned Val, unsigned &MB, unsigned &ME);
99
100
101 /// isRotateAndMask - Returns true if Mask and Shift can be folded into a
102 /// rotate and mask opcode and mask operation.
Dale Johannesen86dcae12009-11-24 01:09:07 +0000103 static bool isRotateAndMask(SDNode *N, unsigned Mask, bool isShiftMask,
Nate Begemand31efd12006-09-22 05:01:56 +0000104 unsigned &SH, unsigned &MB, unsigned &ME);
Andrew Trickc416ba62010-12-24 04:28:06 +0000105
Chris Lattner45640392005-08-19 22:38:53 +0000106 /// getGlobalBaseReg - insert code into the entry mbb to materialize the PIC
107 /// base register. Return the virtual register that holds this value.
Evan Cheng61413a32006-08-26 05:34:46 +0000108 SDNode *getGlobalBaseReg();
Andrew Trickc416ba62010-12-24 04:28:06 +0000109
Chris Lattner43ff01e2005-08-17 19:33:03 +0000110 // Select - Convert the specified operand from a target-independent to a
111 // target-specific node if it hasn't already been changed.
Dan Gohmanea6f91f2010-01-05 01:24:18 +0000112 SDNode *Select(SDNode *N);
Andrew Trickc416ba62010-12-24 04:28:06 +0000113
Nate Begeman93c4bc62005-08-19 00:38:14 +0000114 SDNode *SelectBitfieldInsert(SDNode *N);
115
Chris Lattner2a1823d2005-08-21 18:50:37 +0000116 /// SelectCC - Select a comparison of the specified values with the
117 /// specified condition code, returning the CR# of the expression.
Andrew Trickef9de2a2013-05-25 02:42:55 +0000118 SDValue SelectCC(SDValue LHS, SDValue RHS, ISD::CondCode CC, SDLoc dl);
Chris Lattner2a1823d2005-08-21 18:50:37 +0000119
Nate Begeman8e6a8af2005-12-19 23:25:09 +0000120 /// SelectAddrImm - Returns true if the address N can be represented by
121 /// a base register plus a signed 16-bit displacement [r+imm].
Chris Lattner0e023ea2010-09-21 20:31:19 +0000122 bool SelectAddrImm(SDValue N, SDValue &Disp,
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000123 SDValue &Base) {
Ulrich Weigand9d980cb2013-05-16 17:58:02 +0000124 return PPCLowering.SelectAddressRegImm(N, Disp, Base, *CurDAG, false);
Chris Lattnera801fced2006-11-08 02:15:41 +0000125 }
Andrew Trickc416ba62010-12-24 04:28:06 +0000126
Chris Lattner6f5840c2006-11-16 00:41:37 +0000127 /// SelectAddrImmOffs - Return true if the operand is valid for a preinc
Ulrich Weigandd1b99d32013-03-22 14:58:17 +0000128 /// immediate field. Note that the operand at this point is already the
129 /// result of a prior SelectAddressRegImm call.
Chris Lattner0e023ea2010-09-21 20:31:19 +0000130 bool SelectAddrImmOffs(SDValue N, SDValue &Out) const {
Ulrich Weigandd1b99d32013-03-22 14:58:17 +0000131 if (N.getOpcode() == ISD::TargetConstant ||
Hal Finkela86b0f22012-06-21 20:10:48 +0000132 N.getOpcode() == ISD::TargetGlobalAddress) {
Hal Finkel1cc27e42012-06-19 02:34:32 +0000133 Out = N;
134 return true;
135 }
136
137 return false;
138 }
139
Nate Begeman8e6a8af2005-12-19 23:25:09 +0000140 /// SelectAddrIdx - Given the specified addressed, check to see if it can be
141 /// represented as an indexed [r+r] operation. Returns false if it can
142 /// be represented by [r+imm], which are preferred.
Chris Lattner0e023ea2010-09-21 20:31:19 +0000143 bool SelectAddrIdx(SDValue N, SDValue &Base, SDValue &Index) {
Chris Lattnera801fced2006-11-08 02:15:41 +0000144 return PPCLowering.SelectAddressRegReg(N, Base, Index, *CurDAG);
145 }
Andrew Trickc416ba62010-12-24 04:28:06 +0000146
Nate Begeman8e6a8af2005-12-19 23:25:09 +0000147 /// SelectAddrIdxOnly - Given the specified addressed, force it to be
148 /// represented as an indexed [r+r] operation.
Chris Lattner0e023ea2010-09-21 20:31:19 +0000149 bool SelectAddrIdxOnly(SDValue N, SDValue &Base, SDValue &Index) {
Chris Lattnera801fced2006-11-08 02:15:41 +0000150 return PPCLowering.SelectAddressRegRegOnly(N, Base, Index, *CurDAG);
151 }
Chris Lattnerc5292ec2005-08-21 22:31:09 +0000152
Ulrich Weigand9d980cb2013-05-16 17:58:02 +0000153 /// SelectAddrImmX4 - Returns true if the address N can be represented by
154 /// a base register plus a signed 16-bit displacement that is a multiple of 4.
155 /// Suitable for use by STD and friends.
156 bool SelectAddrImmX4(SDValue N, SDValue &Disp, SDValue &Base) {
157 return PPCLowering.SelectAddressRegImm(N, Disp, Base, *CurDAG, true);
Chris Lattnera801fced2006-11-08 02:15:41 +0000158 }
Andrew Trickc416ba62010-12-24 04:28:06 +0000159
Hal Finkel756810f2013-03-21 21:37:52 +0000160 // Select an address into a single register.
161 bool SelectAddr(SDValue N, SDValue &Base) {
162 Base = N;
163 return true;
164 }
165
Chris Lattnera1ec1dd2006-02-24 02:13:12 +0000166 /// SelectInlineAsmMemoryOperand - Implement addressing mode selection for
Dale Johannesen4a50e682009-08-18 00:18:39 +0000167 /// inline asm expressions. It is always correct to compute the value into
168 /// a register. The case of adding a (possibly relocatable) constant to a
169 /// register can be improved, but it is wrong to substitute Reg+Reg for
170 /// Reg in an asm, because the load or store opcode would have to change.
171 virtual bool SelectInlineAsmMemoryOperand(const SDValue &Op,
Chris Lattnera1ec1dd2006-02-24 02:13:12 +0000172 char ConstraintCode,
Dan Gohmaneb0cee92008-08-23 02:25:05 +0000173 std::vector<SDValue> &OutOps) {
Dale Johannesen4a50e682009-08-18 00:18:39 +0000174 OutOps.push_back(Op);
Chris Lattnera1ec1dd2006-02-24 02:13:12 +0000175 return false;
176 }
Andrew Trickc416ba62010-12-24 04:28:06 +0000177
Dan Gohman5ea74d52009-07-31 18:16:33 +0000178 void InsertVRSaveCode(MachineFunction &MF);
Chris Lattner1678a6c2006-03-16 18:25:23 +0000179
Chris Lattner43ff01e2005-08-17 19:33:03 +0000180 virtual const char *getPassName() const {
181 return "PowerPC DAG->DAG Pattern Instruction Selection";
Andrew Trickc416ba62010-12-24 04:28:06 +0000182 }
183
Chris Lattner03e08ee2005-09-13 22:03:06 +0000184// Include the pieces autogenerated from the target description.
Chris Lattner0921e3b2005-10-14 23:37:35 +0000185#include "PPCGenDAGISel.inc"
Andrew Trickc416ba62010-12-24 04:28:06 +0000186
Chris Lattner259e6c72005-10-06 18:45:51 +0000187private:
Dan Gohmanea6f91f2010-01-05 01:24:18 +0000188 SDNode *SelectSETCC(SDNode *N);
Hal Finkel940ab932014-02-28 00:27:01 +0000189
190 void PeepholePPC64();
191 void PeepholdCROps();
Hal Finkelb9989152014-02-28 06:11:16 +0000192
193 bool AllUsersSelectZero(SDNode *N);
194 void SwapAllSelectUsers(SDNode *N);
Chris Lattner43ff01e2005-08-17 19:33:03 +0000195 };
196}
197
Chris Lattner1678a6c2006-03-16 18:25:23 +0000198/// InsertVRSaveCode - Once the entire function has been instruction selected,
199/// all virtual registers are created and all machine instructions are built,
200/// check to see if we need to save/restore VRSAVE. If so, do it.
Dan Gohman5ea74d52009-07-31 18:16:33 +0000201void PPCDAGToDAGISel::InsertVRSaveCode(MachineFunction &Fn) {
Chris Lattner02e2c182006-03-13 21:52:10 +0000202 // Check to see if this function uses vector registers, which means we have to
Andrew Trickc416ba62010-12-24 04:28:06 +0000203 // save and restore the VRSAVE register and update it with the regs we use.
Chris Lattner02e2c182006-03-13 21:52:10 +0000204 //
Dan Gohman4a618822010-02-10 16:03:48 +0000205 // In this case, there will be virtual registers of vector type created
Chris Lattner02e2c182006-03-13 21:52:10 +0000206 // by the scheduler. Detect them now.
Chris Lattner02e2c182006-03-13 21:52:10 +0000207 bool HasVectorVReg = false;
Jakob Stoklund Olesen4a7b48d2011-01-08 23:11:11 +0000208 for (unsigned i = 0, e = RegInfo->getNumVirtRegs(); i != e; ++i) {
209 unsigned Reg = TargetRegisterInfo::index2VirtReg(i);
210 if (RegInfo->getRegClass(Reg) == &PPC::VRRCRegClass) {
Chris Lattner02e2c182006-03-13 21:52:10 +0000211 HasVectorVReg = true;
212 break;
213 }
Jakob Stoklund Olesen4a7b48d2011-01-08 23:11:11 +0000214 }
Chris Lattner1678a6c2006-03-16 18:25:23 +0000215 if (!HasVectorVReg) return; // nothing to do.
Andrew Trickc416ba62010-12-24 04:28:06 +0000216
Chris Lattner02e2c182006-03-13 21:52:10 +0000217 // If we have a vector register, we want to emit code into the entry and exit
218 // blocks to save and restore the VRSAVE register. We do this here (instead
219 // of marking all vector instructions as clobbering VRSAVE) for two reasons:
220 //
221 // 1. This (trivially) reduces the load on the register allocator, by not
222 // having to represent the live range of the VRSAVE register.
223 // 2. This (more significantly) allows us to create a temporary virtual
224 // register to hold the saved VRSAVE value, allowing this temporary to be
225 // register allocated, instead of forcing it to be spilled to the stack.
Chris Lattner1678a6c2006-03-16 18:25:23 +0000226
227 // Create two vregs - one to hold the VRSAVE register that is live-in to the
228 // function and one for the value after having bits or'd into it.
Chris Lattnera10fff52007-12-31 04:13:23 +0000229 unsigned InVRSAVE = RegInfo->createVirtualRegister(&PPC::GPRCRegClass);
230 unsigned UpdatedVRSAVE = RegInfo->createVirtualRegister(&PPC::GPRCRegClass);
Andrew Trickc416ba62010-12-24 04:28:06 +0000231
Evan Cheng20350c42006-11-27 23:37:22 +0000232 const TargetInstrInfo &TII = *TM.getInstrInfo();
Chris Lattner1678a6c2006-03-16 18:25:23 +0000233 MachineBasicBlock &EntryBB = *Fn.begin();
Chris Lattner6f306d72010-04-02 20:16:16 +0000234 DebugLoc dl;
Chris Lattner1678a6c2006-03-16 18:25:23 +0000235 // Emit the following code into the entry block:
236 // InVRSAVE = MFVRSAVE
237 // UpdatedVRSAVE = UPDATE_VRSAVE InVRSAVE
238 // MTVRSAVE UpdatedVRSAVE
239 MachineBasicBlock::iterator IP = EntryBB.begin(); // Insert Point
Dale Johannesene9f623e2009-02-13 02:27:39 +0000240 BuildMI(EntryBB, IP, dl, TII.get(PPC::MFVRSAVE), InVRSAVE);
241 BuildMI(EntryBB, IP, dl, TII.get(PPC::UPDATE_VRSAVE),
Chris Lattnera98c6792008-01-07 01:56:04 +0000242 UpdatedVRSAVE).addReg(InVRSAVE);
Dale Johannesene9f623e2009-02-13 02:27:39 +0000243 BuildMI(EntryBB, IP, dl, TII.get(PPC::MTVRSAVE)).addReg(UpdatedVRSAVE);
Andrew Trickc416ba62010-12-24 04:28:06 +0000244
Chris Lattner1678a6c2006-03-16 18:25:23 +0000245 // Find all return blocks, outputting a restore in each epilog.
Chris Lattner1678a6c2006-03-16 18:25:23 +0000246 for (MachineFunction::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) {
Evan Cheng7f8e5632011-12-07 07:15:52 +0000247 if (!BB->empty() && BB->back().isReturn()) {
Chris Lattner1678a6c2006-03-16 18:25:23 +0000248 IP = BB->end(); --IP;
Andrew Trickc416ba62010-12-24 04:28:06 +0000249
Chris Lattner1678a6c2006-03-16 18:25:23 +0000250 // Skip over all terminator instructions, which are part of the return
251 // sequence.
252 MachineBasicBlock::iterator I2 = IP;
Evan Cheng7f8e5632011-12-07 07:15:52 +0000253 while (I2 != BB->begin() && (--I2)->isTerminator())
Chris Lattner1678a6c2006-03-16 18:25:23 +0000254 IP = I2;
Andrew Trickc416ba62010-12-24 04:28:06 +0000255
Chris Lattner1678a6c2006-03-16 18:25:23 +0000256 // Emit: MTVRSAVE InVRSave
Dale Johannesene9f623e2009-02-13 02:27:39 +0000257 BuildMI(*BB, IP, dl, TII.get(PPC::MTVRSAVE)).addReg(InVRSAVE);
Andrew Trickc416ba62010-12-24 04:28:06 +0000258 }
Chris Lattner02e2c182006-03-13 21:52:10 +0000259 }
Chris Lattner259e6c72005-10-06 18:45:51 +0000260}
Chris Lattner8ae95252005-09-03 01:17:22 +0000261
Chris Lattner1678a6c2006-03-16 18:25:23 +0000262
Chris Lattner45640392005-08-19 22:38:53 +0000263/// getGlobalBaseReg - Output the instructions required to put the
264/// base address to use for accessing globals into a register.
265///
Evan Cheng61413a32006-08-26 05:34:46 +0000266SDNode *PPCDAGToDAGISel::getGlobalBaseReg() {
Chris Lattner45640392005-08-19 22:38:53 +0000267 if (!GlobalBaseReg) {
Evan Cheng20350c42006-11-27 23:37:22 +0000268 const TargetInstrInfo &TII = *TM.getInstrInfo();
Chris Lattner45640392005-08-19 22:38:53 +0000269 // Insert the set of GlobalBaseReg into the first MBB of the function
Dan Gohmanfca89682009-08-15 02:07:36 +0000270 MachineBasicBlock &FirstMBB = MF->front();
Chris Lattner45640392005-08-19 22:38:53 +0000271 MachineBasicBlock::iterator MBBI = FirstMBB.begin();
Chris Lattner6f306d72010-04-02 20:16:16 +0000272 DebugLoc dl;
Chris Lattner97b3da12006-06-27 00:04:13 +0000273
Owen Anderson9f944592009-08-11 20:47:22 +0000274 if (PPCLowering.getPointerTy() == MVT::i32) {
Hal Finkel6daf2aa2014-03-06 01:28:23 +0000275 GlobalBaseReg = RegInfo->createVirtualRegister(&PPC::GPRC_NOR0RegClass);
Cameron Zwarichdadd7332011-05-19 02:56:28 +0000276 BuildMI(FirstMBB, MBBI, dl, TII.get(PPC::MovePCtoLR));
Dale Johannesene9f623e2009-02-13 02:27:39 +0000277 BuildMI(FirstMBB, MBBI, dl, TII.get(PPC::MFLR), GlobalBaseReg);
Chris Lattnerb5429252006-11-14 18:43:11 +0000278 } else {
Hal Finkel6daf2aa2014-03-06 01:28:23 +0000279 GlobalBaseReg = RegInfo->createVirtualRegister(&PPC::G8RC_NOX0RegClass);
Cameron Zwarichdadd7332011-05-19 02:56:28 +0000280 BuildMI(FirstMBB, MBBI, dl, TII.get(PPC::MovePCtoLR8));
Dale Johannesene9f623e2009-02-13 02:27:39 +0000281 BuildMI(FirstMBB, MBBI, dl, TII.get(PPC::MFLR8), GlobalBaseReg);
Chris Lattnerb5429252006-11-14 18:43:11 +0000282 }
Chris Lattner45640392005-08-19 22:38:53 +0000283 }
Gabor Greif81d6a382008-08-31 15:37:04 +0000284 return CurDAG->getRegister(GlobalBaseReg,
285 PPCLowering.getPointerTy()).getNode();
Chris Lattner97b3da12006-06-27 00:04:13 +0000286}
287
288/// isIntS16Immediate - This method tests to see if the node is either a 32-bit
289/// or 64-bit immediate, and if the value can be accurately represented as a
290/// sign extension from a 16-bit value. If so, this returns true and the
291/// immediate.
292static bool isIntS16Immediate(SDNode *N, short &Imm) {
293 if (N->getOpcode() != ISD::Constant)
294 return false;
295
Dan Gohmaneffb8942008-09-12 16:56:44 +0000296 Imm = (short)cast<ConstantSDNode>(N)->getZExtValue();
Owen Anderson9f944592009-08-11 20:47:22 +0000297 if (N->getValueType(0) == MVT::i32)
Dan Gohmaneffb8942008-09-12 16:56:44 +0000298 return Imm == (int32_t)cast<ConstantSDNode>(N)->getZExtValue();
Chris Lattner97b3da12006-06-27 00:04:13 +0000299 else
Dan Gohmaneffb8942008-09-12 16:56:44 +0000300 return Imm == (int64_t)cast<ConstantSDNode>(N)->getZExtValue();
Chris Lattner97b3da12006-06-27 00:04:13 +0000301}
302
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000303static bool isIntS16Immediate(SDValue Op, short &Imm) {
Gabor Greiff304a7a2008-08-28 21:40:38 +0000304 return isIntS16Immediate(Op.getNode(), Imm);
Chris Lattner45640392005-08-19 22:38:53 +0000305}
306
307
Chris Lattner97b3da12006-06-27 00:04:13 +0000308/// isInt32Immediate - This method tests to see if the node is a 32-bit constant
309/// operand. If so Imm will receive the 32-bit value.
310static bool isInt32Immediate(SDNode *N, unsigned &Imm) {
Owen Anderson9f944592009-08-11 20:47:22 +0000311 if (N->getOpcode() == ISD::Constant && N->getValueType(0) == MVT::i32) {
Dan Gohmaneffb8942008-09-12 16:56:44 +0000312 Imm = cast<ConstantSDNode>(N)->getZExtValue();
Nate Begeman72d6f882005-08-18 05:00:13 +0000313 return true;
314 }
315 return false;
316}
317
Chris Lattner97b3da12006-06-27 00:04:13 +0000318/// isInt64Immediate - This method tests to see if the node is a 64-bit constant
319/// operand. If so Imm will receive the 64-bit value.
320static bool isInt64Immediate(SDNode *N, uint64_t &Imm) {
Owen Anderson9f944592009-08-11 20:47:22 +0000321 if (N->getOpcode() == ISD::Constant && N->getValueType(0) == MVT::i64) {
Dan Gohmaneffb8942008-09-12 16:56:44 +0000322 Imm = cast<ConstantSDNode>(N)->getZExtValue();
Chris Lattner97b3da12006-06-27 00:04:13 +0000323 return true;
324 }
325 return false;
326}
327
328// isInt32Immediate - This method tests to see if a constant operand.
329// If so Imm will receive the 32 bit value.
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000330static bool isInt32Immediate(SDValue N, unsigned &Imm) {
Gabor Greiff304a7a2008-08-28 21:40:38 +0000331 return isInt32Immediate(N.getNode(), Imm);
Chris Lattner97b3da12006-06-27 00:04:13 +0000332}
333
334
335// isOpcWithIntImmediate - This method tests to see if the node is a specific
336// opcode and that it has a immediate integer right operand.
337// If so Imm will receive the 32 bit value.
338static bool isOpcWithIntImmediate(SDNode *N, unsigned Opc, unsigned& Imm) {
Gabor Greif81d6a382008-08-31 15:37:04 +0000339 return N->getOpcode() == Opc
340 && isInt32Immediate(N->getOperand(1).getNode(), Imm);
Chris Lattner97b3da12006-06-27 00:04:13 +0000341}
342
Nate Begemand31efd12006-09-22 05:01:56 +0000343bool PPCDAGToDAGISel::isRunOfOnes(unsigned Val, unsigned &MB, unsigned &ME) {
Hal Finkelff3ea802013-07-11 16:31:51 +0000344 if (!Val)
345 return false;
346
Nate Begemanb3821a32005-08-18 07:30:46 +0000347 if (isShiftedMask_32(Val)) {
348 // look for the first non-zero bit
Michael J. Spencerdf1ecbd72013-05-24 22:23:49 +0000349 MB = countLeadingZeros(Val);
Nate Begemanb3821a32005-08-18 07:30:46 +0000350 // look for the first zero bit after the run of ones
Michael J. Spencerdf1ecbd72013-05-24 22:23:49 +0000351 ME = countLeadingZeros((Val - 1) ^ Val);
Nate Begemanb3821a32005-08-18 07:30:46 +0000352 return true;
Chris Lattner666512c2005-08-25 04:47:18 +0000353 } else {
354 Val = ~Val; // invert mask
355 if (isShiftedMask_32(Val)) {
356 // effectively look for the first zero bit
Michael J. Spencerdf1ecbd72013-05-24 22:23:49 +0000357 ME = countLeadingZeros(Val) - 1;
Chris Lattner666512c2005-08-25 04:47:18 +0000358 // effectively look for the first one bit after the run of zeros
Michael J. Spencerdf1ecbd72013-05-24 22:23:49 +0000359 MB = countLeadingZeros((Val - 1) ^ Val) + 1;
Chris Lattner666512c2005-08-25 04:47:18 +0000360 return true;
361 }
Nate Begemanb3821a32005-08-18 07:30:46 +0000362 }
363 // no run present
364 return false;
365}
366
Andrew Trickc416ba62010-12-24 04:28:06 +0000367bool PPCDAGToDAGISel::isRotateAndMask(SDNode *N, unsigned Mask,
368 bool isShiftMask, unsigned &SH,
Nate Begemand31efd12006-09-22 05:01:56 +0000369 unsigned &MB, unsigned &ME) {
Nate Begeman92e77502005-10-19 00:05:37 +0000370 // Don't even go down this path for i64, since different logic will be
371 // necessary for rldicl/rldicr/rldimi.
Owen Anderson9f944592009-08-11 20:47:22 +0000372 if (N->getValueType(0) != MVT::i32)
Nate Begeman92e77502005-10-19 00:05:37 +0000373 return false;
374
Nate Begemanb3821a32005-08-18 07:30:46 +0000375 unsigned Shift = 32;
376 unsigned Indeterminant = ~0; // bit mask marking indeterminant results
377 unsigned Opcode = N->getOpcode();
Chris Lattnere413b602005-08-30 00:59:16 +0000378 if (N->getNumOperands() != 2 ||
Gabor Greiff304a7a2008-08-28 21:40:38 +0000379 !isInt32Immediate(N->getOperand(1).getNode(), Shift) || (Shift > 31))
Nate Begemanb3821a32005-08-18 07:30:46 +0000380 return false;
Andrew Trickc416ba62010-12-24 04:28:06 +0000381
Nate Begemanb3821a32005-08-18 07:30:46 +0000382 if (Opcode == ISD::SHL) {
383 // apply shift left to mask if it comes first
Dale Johannesen86dcae12009-11-24 01:09:07 +0000384 if (isShiftMask) Mask = Mask << Shift;
Nate Begemanb3821a32005-08-18 07:30:46 +0000385 // determine which bits are made indeterminant by shift
386 Indeterminant = ~(0xFFFFFFFFu << Shift);
Andrew Trickc416ba62010-12-24 04:28:06 +0000387 } else if (Opcode == ISD::SRL) {
Nate Begemanb3821a32005-08-18 07:30:46 +0000388 // apply shift right to mask if it comes first
Dale Johannesen86dcae12009-11-24 01:09:07 +0000389 if (isShiftMask) Mask = Mask >> Shift;
Nate Begemanb3821a32005-08-18 07:30:46 +0000390 // determine which bits are made indeterminant by shift
391 Indeterminant = ~(0xFFFFFFFFu >> Shift);
392 // adjust for the left rotate
393 Shift = 32 - Shift;
Nate Begemand31efd12006-09-22 05:01:56 +0000394 } else if (Opcode == ISD::ROTL) {
395 Indeterminant = 0;
Nate Begemanb3821a32005-08-18 07:30:46 +0000396 } else {
397 return false;
398 }
Andrew Trickc416ba62010-12-24 04:28:06 +0000399
Nate Begemanb3821a32005-08-18 07:30:46 +0000400 // if the mask doesn't intersect any Indeterminant bits
401 if (Mask && !(Mask & Indeterminant)) {
Chris Lattnera2963392006-05-12 16:29:37 +0000402 SH = Shift & 31;
Nate Begemanb3821a32005-08-18 07:30:46 +0000403 // make sure the mask is still a mask (wrap arounds may not be)
404 return isRunOfOnes(Mask, MB, ME);
405 }
406 return false;
407}
408
Nate Begeman93c4bc62005-08-19 00:38:14 +0000409/// SelectBitfieldInsert - turn an or of two masked values into
410/// the rotate left word immediate then mask insert (rlwimi) instruction.
Nate Begeman0b71e002005-10-18 00:28:58 +0000411SDNode *PPCDAGToDAGISel::SelectBitfieldInsert(SDNode *N) {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000412 SDValue Op0 = N->getOperand(0);
413 SDValue Op1 = N->getOperand(1);
Andrew Trickef9de2a2013-05-25 02:42:55 +0000414 SDLoc dl(N);
Andrew Trickc416ba62010-12-24 04:28:06 +0000415
Dan Gohmanf19609a2008-02-27 01:23:58 +0000416 APInt LKZ, LKO, RKZ, RKO;
Rafael Espindolaba0a6ca2012-04-04 12:51:34 +0000417 CurDAG->ComputeMaskedBits(Op0, LKZ, LKO);
418 CurDAG->ComputeMaskedBits(Op1, RKZ, RKO);
Andrew Trickc416ba62010-12-24 04:28:06 +0000419
Dan Gohmanf19609a2008-02-27 01:23:58 +0000420 unsigned TargetMask = LKZ.getZExtValue();
421 unsigned InsertMask = RKZ.getZExtValue();
Andrew Trickc416ba62010-12-24 04:28:06 +0000422
Nate Begeman9b6d4c22006-05-08 17:38:32 +0000423 if ((TargetMask | InsertMask) == 0xFFFFFFFF) {
424 unsigned Op0Opc = Op0.getOpcode();
425 unsigned Op1Opc = Op1.getOpcode();
426 unsigned Value, SH = 0;
427 TargetMask = ~TargetMask;
428 InsertMask = ~InsertMask;
Nate Begeman1333cea2006-05-07 00:23:38 +0000429
Nate Begeman9b6d4c22006-05-08 17:38:32 +0000430 // If the LHS has a foldable shift and the RHS does not, then swap it to the
431 // RHS so that we can fold the shift into the insert.
Nate Begeman1333cea2006-05-07 00:23:38 +0000432 if (Op0Opc == ISD::AND && Op1Opc == ISD::AND) {
433 if (Op0.getOperand(0).getOpcode() == ISD::SHL ||
434 Op0.getOperand(0).getOpcode() == ISD::SRL) {
435 if (Op1.getOperand(0).getOpcode() != ISD::SHL &&
436 Op1.getOperand(0).getOpcode() != ISD::SRL) {
437 std::swap(Op0, Op1);
438 std::swap(Op0Opc, Op1Opc);
Nate Begeman9b6d4c22006-05-08 17:38:32 +0000439 std::swap(TargetMask, InsertMask);
Nate Begeman1333cea2006-05-07 00:23:38 +0000440 }
Nate Begeman93c4bc62005-08-19 00:38:14 +0000441 }
Nate Begeman9b6d4c22006-05-08 17:38:32 +0000442 } else if (Op0Opc == ISD::SHL || Op0Opc == ISD::SRL) {
443 if (Op1Opc == ISD::AND && Op1.getOperand(0).getOpcode() != ISD::SHL &&
444 Op1.getOperand(0).getOpcode() != ISD::SRL) {
445 std::swap(Op0, Op1);
446 std::swap(Op0Opc, Op1Opc);
447 std::swap(TargetMask, InsertMask);
448 }
Nate Begeman93c4bc62005-08-19 00:38:14 +0000449 }
Andrew Trickc416ba62010-12-24 04:28:06 +0000450
Nate Begeman1333cea2006-05-07 00:23:38 +0000451 unsigned MB, ME;
Hal Finkelff3ea802013-07-11 16:31:51 +0000452 if (isRunOfOnes(InsertMask, MB, ME)) {
Dale Johannesen8495a502009-11-20 22:16:40 +0000453 SDValue Tmp1, Tmp2;
Nate Begeman1333cea2006-05-07 00:23:38 +0000454
455 if ((Op1Opc == ISD::SHL || Op1Opc == ISD::SRL) &&
Chris Lattner97b3da12006-06-27 00:04:13 +0000456 isInt32Immediate(Op1.getOperand(1), Value)) {
Nate Begeman1333cea2006-05-07 00:23:38 +0000457 Op1 = Op1.getOperand(0);
458 SH = (Op1Opc == ISD::SHL) ? Value : 32 - Value;
459 }
460 if (Op1Opc == ISD::AND) {
461 unsigned SHOpc = Op1.getOperand(0).getOpcode();
462 if ((SHOpc == ISD::SHL || SHOpc == ISD::SRL) &&
Chris Lattner97b3da12006-06-27 00:04:13 +0000463 isInt32Immediate(Op1.getOperand(0).getOperand(1), Value)) {
Hal Finkel4ca70102013-06-28 20:00:07 +0000464 // Note that Value must be in range here (less than 32) because
465 // otherwise there would not be any bits set in InsertMask.
Nate Begeman1333cea2006-05-07 00:23:38 +0000466 Op1 = Op1.getOperand(0).getOperand(0);
467 SH = (SHOpc == ISD::SHL) ? Value : 32 - Value;
Nate Begeman1333cea2006-05-07 00:23:38 +0000468 }
469 }
Dale Johannesen8495a502009-11-20 22:16:40 +0000470
Chris Lattnera2963392006-05-12 16:29:37 +0000471 SH &= 31;
Dale Johannesen8495a502009-11-20 22:16:40 +0000472 SDValue Ops[] = { Op0, Op1, getI32Imm(SH), getI32Imm(MB),
Evan Chengc3acfc02006-08-27 08:14:06 +0000473 getI32Imm(ME) };
Michael Liaob53d8962013-04-19 22:22:57 +0000474 return CurDAG->getMachineNode(PPC::RLWIMI, dl, MVT::i32, Ops);
Nate Begeman93c4bc62005-08-19 00:38:14 +0000475 }
Nate Begeman93c4bc62005-08-19 00:38:14 +0000476 }
477 return 0;
478}
479
Chris Lattner2a1823d2005-08-21 18:50:37 +0000480/// SelectCC - Select a comparison of the specified values with the specified
481/// condition code, returning the CR# of the expression.
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000482SDValue PPCDAGToDAGISel::SelectCC(SDValue LHS, SDValue RHS,
Andrew Trickef9de2a2013-05-25 02:42:55 +0000483 ISD::CondCode CC, SDLoc dl) {
Chris Lattner2a1823d2005-08-21 18:50:37 +0000484 // Always select the LHS.
Chris Lattner97b3da12006-06-27 00:04:13 +0000485 unsigned Opc;
Andrew Trickc416ba62010-12-24 04:28:06 +0000486
Owen Anderson9f944592009-08-11 20:47:22 +0000487 if (LHS.getValueType() == MVT::i32) {
Chris Lattner9a40cca2006-06-27 00:10:13 +0000488 unsigned Imm;
Chris Lattneraa3926b2006-09-20 04:25:47 +0000489 if (CC == ISD::SETEQ || CC == ISD::SETNE) {
490 if (isInt32Immediate(RHS, Imm)) {
491 // SETEQ/SETNE comparison with 16-bit immediate, fold it.
Benjamin Kramer2788f792010-03-29 21:13:41 +0000492 if (isUInt<16>(Imm))
Dan Gohman32f71d72009-09-25 18:54:59 +0000493 return SDValue(CurDAG->getMachineNode(PPC::CMPLWI, dl, MVT::i32, LHS,
494 getI32Imm(Imm & 0xFFFF)), 0);
Chris Lattneraa3926b2006-09-20 04:25:47 +0000495 // If this is a 16-bit signed immediate, fold it.
Benjamin Kramer2788f792010-03-29 21:13:41 +0000496 if (isInt<16>((int)Imm))
Dan Gohman32f71d72009-09-25 18:54:59 +0000497 return SDValue(CurDAG->getMachineNode(PPC::CMPWI, dl, MVT::i32, LHS,
498 getI32Imm(Imm & 0xFFFF)), 0);
Andrew Trickc416ba62010-12-24 04:28:06 +0000499
Chris Lattneraa3926b2006-09-20 04:25:47 +0000500 // For non-equality comparisons, the default code would materialize the
501 // constant, then compare against it, like this:
502 // lis r2, 4660
Andrew Trickc416ba62010-12-24 04:28:06 +0000503 // ori r2, r2, 22136
Chris Lattneraa3926b2006-09-20 04:25:47 +0000504 // cmpw cr0, r3, r2
505 // Since we are just comparing for equality, we can emit this instead:
506 // xoris r0,r3,0x1234
507 // cmplwi cr0,r0,0x5678
508 // beq cr0,L6
Dan Gohman32f71d72009-09-25 18:54:59 +0000509 SDValue Xor(CurDAG->getMachineNode(PPC::XORIS, dl, MVT::i32, LHS,
510 getI32Imm(Imm >> 16)), 0);
511 return SDValue(CurDAG->getMachineNode(PPC::CMPLWI, dl, MVT::i32, Xor,
512 getI32Imm(Imm & 0xFFFF)), 0);
Chris Lattneraa3926b2006-09-20 04:25:47 +0000513 }
514 Opc = PPC::CMPLW;
515 } else if (ISD::isUnsignedIntSetCC(CC)) {
Benjamin Kramer2788f792010-03-29 21:13:41 +0000516 if (isInt32Immediate(RHS, Imm) && isUInt<16>(Imm))
Dan Gohman32f71d72009-09-25 18:54:59 +0000517 return SDValue(CurDAG->getMachineNode(PPC::CMPLWI, dl, MVT::i32, LHS,
518 getI32Imm(Imm & 0xFFFF)), 0);
Chris Lattner97b3da12006-06-27 00:04:13 +0000519 Opc = PPC::CMPLW;
520 } else {
521 short SImm;
522 if (isIntS16Immediate(RHS, SImm))
Dan Gohman32f71d72009-09-25 18:54:59 +0000523 return SDValue(CurDAG->getMachineNode(PPC::CMPWI, dl, MVT::i32, LHS,
524 getI32Imm((int)SImm & 0xFFFF)),
Chris Lattner97b3da12006-06-27 00:04:13 +0000525 0);
526 Opc = PPC::CMPW;
527 }
Owen Anderson9f944592009-08-11 20:47:22 +0000528 } else if (LHS.getValueType() == MVT::i64) {
Chris Lattner97b3da12006-06-27 00:04:13 +0000529 uint64_t Imm;
Chris Lattnerda9b1a92006-09-20 04:33:27 +0000530 if (CC == ISD::SETEQ || CC == ISD::SETNE) {
Gabor Greiff304a7a2008-08-28 21:40:38 +0000531 if (isInt64Immediate(RHS.getNode(), Imm)) {
Chris Lattnerda9b1a92006-09-20 04:33:27 +0000532 // SETEQ/SETNE comparison with 16-bit immediate, fold it.
Benjamin Kramer2788f792010-03-29 21:13:41 +0000533 if (isUInt<16>(Imm))
Dan Gohman32f71d72009-09-25 18:54:59 +0000534 return SDValue(CurDAG->getMachineNode(PPC::CMPLDI, dl, MVT::i64, LHS,
535 getI32Imm(Imm & 0xFFFF)), 0);
Chris Lattnerda9b1a92006-09-20 04:33:27 +0000536 // If this is a 16-bit signed immediate, fold it.
Benjamin Kramer2788f792010-03-29 21:13:41 +0000537 if (isInt<16>(Imm))
Dan Gohman32f71d72009-09-25 18:54:59 +0000538 return SDValue(CurDAG->getMachineNode(PPC::CMPDI, dl, MVT::i64, LHS,
539 getI32Imm(Imm & 0xFFFF)), 0);
Andrew Trickc416ba62010-12-24 04:28:06 +0000540
Chris Lattnerda9b1a92006-09-20 04:33:27 +0000541 // For non-equality comparisons, the default code would materialize the
542 // constant, then compare against it, like this:
543 // lis r2, 4660
Andrew Trickc416ba62010-12-24 04:28:06 +0000544 // ori r2, r2, 22136
Chris Lattnerda9b1a92006-09-20 04:33:27 +0000545 // cmpd cr0, r3, r2
546 // Since we are just comparing for equality, we can emit this instead:
547 // xoris r0,r3,0x1234
548 // cmpldi cr0,r0,0x5678
549 // beq cr0,L6
Benjamin Kramer2788f792010-03-29 21:13:41 +0000550 if (isUInt<32>(Imm)) {
Dan Gohman32f71d72009-09-25 18:54:59 +0000551 SDValue Xor(CurDAG->getMachineNode(PPC::XORIS8, dl, MVT::i64, LHS,
552 getI64Imm(Imm >> 16)), 0);
553 return SDValue(CurDAG->getMachineNode(PPC::CMPLDI, dl, MVT::i64, Xor,
554 getI64Imm(Imm & 0xFFFF)), 0);
Chris Lattnerda9b1a92006-09-20 04:33:27 +0000555 }
556 }
557 Opc = PPC::CMPLD;
558 } else if (ISD::isUnsignedIntSetCC(CC)) {
Benjamin Kramer2788f792010-03-29 21:13:41 +0000559 if (isInt64Immediate(RHS.getNode(), Imm) && isUInt<16>(Imm))
Dan Gohman32f71d72009-09-25 18:54:59 +0000560 return SDValue(CurDAG->getMachineNode(PPC::CMPLDI, dl, MVT::i64, LHS,
561 getI64Imm(Imm & 0xFFFF)), 0);
Chris Lattner97b3da12006-06-27 00:04:13 +0000562 Opc = PPC::CMPLD;
563 } else {
564 short SImm;
565 if (isIntS16Immediate(RHS, SImm))
Dan Gohman32f71d72009-09-25 18:54:59 +0000566 return SDValue(CurDAG->getMachineNode(PPC::CMPDI, dl, MVT::i64, LHS,
567 getI64Imm(SImm & 0xFFFF)),
Chris Lattner97b3da12006-06-27 00:04:13 +0000568 0);
569 Opc = PPC::CMPD;
570 }
Owen Anderson9f944592009-08-11 20:47:22 +0000571 } else if (LHS.getValueType() == MVT::f32) {
Chris Lattner97b3da12006-06-27 00:04:13 +0000572 Opc = PPC::FCMPUS;
Chris Lattner2a1823d2005-08-21 18:50:37 +0000573 } else {
Owen Anderson9f944592009-08-11 20:47:22 +0000574 assert(LHS.getValueType() == MVT::f64 && "Unknown vt!");
Hal Finkel27774d92014-03-13 07:58:58 +0000575 Opc = PPCSubTarget.hasVSX() ? PPC::XSCMPUDP : PPC::FCMPUD;
Chris Lattner2a1823d2005-08-21 18:50:37 +0000576 }
Dan Gohman32f71d72009-09-25 18:54:59 +0000577 return SDValue(CurDAG->getMachineNode(Opc, dl, MVT::i32, LHS, RHS), 0);
Chris Lattner2a1823d2005-08-21 18:50:37 +0000578}
579
Chris Lattner8c6a41e2006-11-17 22:10:59 +0000580static PPC::Predicate getPredicateForSetCC(ISD::CondCode CC) {
Chris Lattner2a1823d2005-08-21 18:50:37 +0000581 switch (CC) {
Chris Lattner630bbce2006-05-25 16:54:16 +0000582 case ISD::SETUEQ:
Dale Johannesen160be0f2008-11-07 22:54:33 +0000583 case ISD::SETONE:
584 case ISD::SETOLE:
585 case ISD::SETOGE:
Torok Edwinfbcc6632009-07-14 16:55:14 +0000586 llvm_unreachable("Should be lowered by legalize!");
587 default: llvm_unreachable("Unknown condition!");
Dale Johannesen160be0f2008-11-07 22:54:33 +0000588 case ISD::SETOEQ:
Chris Lattner8c6a41e2006-11-17 22:10:59 +0000589 case ISD::SETEQ: return PPC::PRED_EQ;
Chris Lattner630bbce2006-05-25 16:54:16 +0000590 case ISD::SETUNE:
Chris Lattner8c6a41e2006-11-17 22:10:59 +0000591 case ISD::SETNE: return PPC::PRED_NE;
Dale Johannesen160be0f2008-11-07 22:54:33 +0000592 case ISD::SETOLT:
Chris Lattner8c6a41e2006-11-17 22:10:59 +0000593 case ISD::SETLT: return PPC::PRED_LT;
Chris Lattner2a1823d2005-08-21 18:50:37 +0000594 case ISD::SETULE:
Chris Lattner8c6a41e2006-11-17 22:10:59 +0000595 case ISD::SETLE: return PPC::PRED_LE;
Dale Johannesen160be0f2008-11-07 22:54:33 +0000596 case ISD::SETOGT:
Chris Lattner8c6a41e2006-11-17 22:10:59 +0000597 case ISD::SETGT: return PPC::PRED_GT;
Chris Lattner2a1823d2005-08-21 18:50:37 +0000598 case ISD::SETUGE:
Chris Lattner8c6a41e2006-11-17 22:10:59 +0000599 case ISD::SETGE: return PPC::PRED_GE;
Chris Lattner8c6a41e2006-11-17 22:10:59 +0000600 case ISD::SETO: return PPC::PRED_NU;
601 case ISD::SETUO: return PPC::PRED_UN;
Dale Johannesen160be0f2008-11-07 22:54:33 +0000602 // These two are invalid for floating point. Assume we have int.
603 case ISD::SETULT: return PPC::PRED_LT;
604 case ISD::SETUGT: return PPC::PRED_GT;
Chris Lattner2a1823d2005-08-21 18:50:37 +0000605 }
Chris Lattner2a1823d2005-08-21 18:50:37 +0000606}
607
Chris Lattner3dcd75b2005-08-25 20:08:18 +0000608/// getCRIdxForSetCC - Return the index of the condition register field
609/// associated with the SetCC condition, and whether or not the field is
610/// treated as inverted. That is, lt = 0; ge = 0 inverted.
Ulrich Weigand47e93282013-07-03 15:13:30 +0000611static unsigned getCRIdxForSetCC(ISD::CondCode CC, bool &Invert) {
Chris Lattner89f36e62008-01-08 06:46:30 +0000612 Invert = false;
Chris Lattner3dcd75b2005-08-25 20:08:18 +0000613 switch (CC) {
Torok Edwinfbcc6632009-07-14 16:55:14 +0000614 default: llvm_unreachable("Unknown condition!");
Chris Lattner89f36e62008-01-08 06:46:30 +0000615 case ISD::SETOLT:
616 case ISD::SETLT: return 0; // Bit #0 = SETOLT
617 case ISD::SETOGT:
618 case ISD::SETGT: return 1; // Bit #1 = SETOGT
619 case ISD::SETOEQ:
620 case ISD::SETEQ: return 2; // Bit #2 = SETOEQ
621 case ISD::SETUO: return 3; // Bit #3 = SETUO
Chris Lattner3dcd75b2005-08-25 20:08:18 +0000622 case ISD::SETUGE:
Chris Lattner89f36e62008-01-08 06:46:30 +0000623 case ISD::SETGE: Invert = true; return 0; // !Bit #0 = SETUGE
Chris Lattner3dcd75b2005-08-25 20:08:18 +0000624 case ISD::SETULE:
Chris Lattner89f36e62008-01-08 06:46:30 +0000625 case ISD::SETLE: Invert = true; return 1; // !Bit #1 = SETULE
Chris Lattner1fbb0d32006-05-25 18:06:16 +0000626 case ISD::SETUNE:
Chris Lattner89f36e62008-01-08 06:46:30 +0000627 case ISD::SETNE: Invert = true; return 2; // !Bit #2 = SETUNE
628 case ISD::SETO: Invert = true; return 3; // !Bit #3 = SETO
Andrew Trickc416ba62010-12-24 04:28:06 +0000629 case ISD::SETUEQ:
630 case ISD::SETOGE:
631 case ISD::SETOLE:
Dale Johannesen160be0f2008-11-07 22:54:33 +0000632 case ISD::SETONE:
Torok Edwinfbcc6632009-07-14 16:55:14 +0000633 llvm_unreachable("Invalid branch code: should be expanded by legalize");
Dale Johannesen160be0f2008-11-07 22:54:33 +0000634 // These are invalid for floating point. Assume integer.
635 case ISD::SETULT: return 0;
636 case ISD::SETUGT: return 1;
Chris Lattner3dcd75b2005-08-25 20:08:18 +0000637 }
Chris Lattner3dcd75b2005-08-25 20:08:18 +0000638}
Chris Lattnerc5292ec2005-08-21 22:31:09 +0000639
Adhemerval Zanella56775e02012-10-30 13:50:19 +0000640// getVCmpInst: return the vector compare instruction for the specified
641// vector type and condition code. Since this is for altivec specific code,
642// only support the altivec types (v16i8, v8i16, v4i32, and v4f32).
Hal Finkel27774d92014-03-13 07:58:58 +0000643static unsigned int getVCmpInst(MVT::SimpleValueType VecVT, ISD::CondCode CC,
644 bool HasVSX) {
Adhemerval Zanella56775e02012-10-30 13:50:19 +0000645 switch (CC) {
646 case ISD::SETEQ:
647 case ISD::SETUEQ:
648 case ISD::SETNE:
649 case ISD::SETUNE:
650 if (VecVT == MVT::v16i8)
651 return PPC::VCMPEQUB;
652 else if (VecVT == MVT::v8i16)
653 return PPC::VCMPEQUH;
654 else if (VecVT == MVT::v4i32)
655 return PPC::VCMPEQUW;
656 // v4f32 != v4f32 could be translate to unordered not equal
657 else if (VecVT == MVT::v4f32)
Hal Finkel27774d92014-03-13 07:58:58 +0000658 return HasVSX ? PPC::XVCMPEQSP : PPC::VCMPEQFP;
659 else if (VecVT == MVT::v2f64)
660 return PPC::XVCMPEQDP;
Adhemerval Zanella56775e02012-10-30 13:50:19 +0000661 break;
662 case ISD::SETLT:
663 case ISD::SETGT:
664 case ISD::SETLE:
665 case ISD::SETGE:
666 if (VecVT == MVT::v16i8)
667 return PPC::VCMPGTSB;
668 else if (VecVT == MVT::v8i16)
669 return PPC::VCMPGTSH;
670 else if (VecVT == MVT::v4i32)
671 return PPC::VCMPGTSW;
672 else if (VecVT == MVT::v4f32)
Hal Finkel27774d92014-03-13 07:58:58 +0000673 return HasVSX ? PPC::XVCMPGTSP : PPC::VCMPGTFP;
674 else if (VecVT == MVT::v2f64)
675 return PPC::XVCMPGTDP;
Adhemerval Zanella56775e02012-10-30 13:50:19 +0000676 break;
677 case ISD::SETULT:
678 case ISD::SETUGT:
679 case ISD::SETUGE:
680 case ISD::SETULE:
681 if (VecVT == MVT::v16i8)
682 return PPC::VCMPGTUB;
683 else if (VecVT == MVT::v8i16)
684 return PPC::VCMPGTUH;
685 else if (VecVT == MVT::v4i32)
686 return PPC::VCMPGTUW;
687 break;
688 case ISD::SETOEQ:
689 if (VecVT == MVT::v4f32)
Hal Finkel27774d92014-03-13 07:58:58 +0000690 return HasVSX ? PPC::XVCMPEQSP : PPC::VCMPEQFP;
691 else if (VecVT == MVT::v2f64)
692 return PPC::XVCMPEQDP;
Adhemerval Zanella56775e02012-10-30 13:50:19 +0000693 break;
694 case ISD::SETOLT:
695 case ISD::SETOGT:
696 case ISD::SETOLE:
697 if (VecVT == MVT::v4f32)
Hal Finkel27774d92014-03-13 07:58:58 +0000698 return HasVSX ? PPC::XVCMPGTSP : PPC::VCMPGTFP;
699 else if (VecVT == MVT::v2f64)
700 return PPC::XVCMPGTDP;
Adhemerval Zanella56775e02012-10-30 13:50:19 +0000701 break;
702 case ISD::SETOGE:
703 if (VecVT == MVT::v4f32)
Hal Finkel27774d92014-03-13 07:58:58 +0000704 return HasVSX ? PPC::XVCMPGESP : PPC::VCMPGEFP;
705 else if (VecVT == MVT::v2f64)
706 return PPC::XVCMPGEDP;
Adhemerval Zanella56775e02012-10-30 13:50:19 +0000707 break;
708 default:
709 break;
710 }
711 llvm_unreachable("Invalid integer vector compare condition");
712}
713
714// getVCmpEQInst: return the equal compare instruction for the specified vector
715// type. Since this is for altivec specific code, only support the altivec
716// types (v16i8, v8i16, v4i32, and v4f32).
Hal Finkel27774d92014-03-13 07:58:58 +0000717static unsigned int getVCmpEQInst(MVT::SimpleValueType VecVT, bool HasVSX) {
Adhemerval Zanella56775e02012-10-30 13:50:19 +0000718 switch (VecVT) {
719 case MVT::v16i8:
720 return PPC::VCMPEQUB;
721 case MVT::v8i16:
722 return PPC::VCMPEQUH;
723 case MVT::v4i32:
724 return PPC::VCMPEQUW;
725 case MVT::v4f32:
Hal Finkel27774d92014-03-13 07:58:58 +0000726 return HasVSX ? PPC::XVCMPEQSP : PPC::VCMPEQFP;
727 case MVT::v2f64:
728 return PPC::XVCMPEQDP;
Adhemerval Zanella56775e02012-10-30 13:50:19 +0000729 default:
730 llvm_unreachable("Invalid integer vector compare condition");
731 }
732}
733
Dan Gohmanea6f91f2010-01-05 01:24:18 +0000734SDNode *PPCDAGToDAGISel::SelectSETCC(SDNode *N) {
Andrew Trickef9de2a2013-05-25 02:42:55 +0000735 SDLoc dl(N);
Chris Lattner491b8292005-10-06 19:03:35 +0000736 unsigned Imm;
737 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(2))->get();
Roman Divacky254f8212011-06-20 15:28:39 +0000738 EVT PtrVT = CurDAG->getTargetLoweringInfo().getPointerTy();
739 bool isPPC64 = (PtrVT == MVT::i64);
740
Hal Finkel940ab932014-02-28 00:27:01 +0000741 if (!PPCSubTarget.useCRBits() &&
742 isInt32Immediate(N->getOperand(1), Imm)) {
Chris Lattner491b8292005-10-06 19:03:35 +0000743 // We can codegen setcc op, imm very efficiently compared to a brcond.
744 // Check for those cases here.
745 // setcc op, 0
746 if (Imm == 0) {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000747 SDValue Op = N->getOperand(0);
Chris Lattner491b8292005-10-06 19:03:35 +0000748 switch (CC) {
Chris Lattnere2969492005-10-21 21:17:10 +0000749 default: break;
Evan Chengc3acfc02006-08-27 08:14:06 +0000750 case ISD::SETEQ: {
Dan Gohman32f71d72009-09-25 18:54:59 +0000751 Op = SDValue(CurDAG->getMachineNode(PPC::CNTLZW, dl, MVT::i32, Op), 0);
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000752 SDValue Ops[] = { Op, getI32Imm(27), getI32Imm(5), getI32Imm(31) };
Owen Anderson9f944592009-08-11 20:47:22 +0000753 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
Evan Chengc3acfc02006-08-27 08:14:06 +0000754 }
Chris Lattnere2969492005-10-21 21:17:10 +0000755 case ISD::SETNE: {
Roman Divacky254f8212011-06-20 15:28:39 +0000756 if (isPPC64) break;
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000757 SDValue AD =
Chris Lattner3e5fbd72010-12-21 02:38:05 +0000758 SDValue(CurDAG->getMachineNode(PPC::ADDIC, dl, MVT::i32, MVT::Glue,
Dan Gohman32f71d72009-09-25 18:54:59 +0000759 Op, getI32Imm(~0U)), 0);
Andrew Trickc416ba62010-12-24 04:28:06 +0000760 return CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, AD, Op,
Evan Cheng34b70ee2006-08-26 08:00:10 +0000761 AD.getValue(1));
Chris Lattner491b8292005-10-06 19:03:35 +0000762 }
Evan Chengc3acfc02006-08-27 08:14:06 +0000763 case ISD::SETLT: {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000764 SDValue Ops[] = { Op, getI32Imm(1), getI32Imm(31), getI32Imm(31) };
Owen Anderson9f944592009-08-11 20:47:22 +0000765 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
Evan Chengc3acfc02006-08-27 08:14:06 +0000766 }
Chris Lattnere2969492005-10-21 21:17:10 +0000767 case ISD::SETGT: {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000768 SDValue T =
Dan Gohman32f71d72009-09-25 18:54:59 +0000769 SDValue(CurDAG->getMachineNode(PPC::NEG, dl, MVT::i32, Op), 0);
770 T = SDValue(CurDAG->getMachineNode(PPC::ANDC, dl, MVT::i32, T, Op), 0);
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000771 SDValue Ops[] = { T, getI32Imm(1), getI32Imm(31), getI32Imm(31) };
Owen Anderson9f944592009-08-11 20:47:22 +0000772 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
Chris Lattnere2969492005-10-21 21:17:10 +0000773 }
774 }
Chris Lattner491b8292005-10-06 19:03:35 +0000775 } else if (Imm == ~0U) { // setcc op, -1
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000776 SDValue Op = N->getOperand(0);
Chris Lattner491b8292005-10-06 19:03:35 +0000777 switch (CC) {
Chris Lattnere2969492005-10-21 21:17:10 +0000778 default: break;
779 case ISD::SETEQ:
Roman Divacky254f8212011-06-20 15:28:39 +0000780 if (isPPC64) break;
Chris Lattner3e5fbd72010-12-21 02:38:05 +0000781 Op = SDValue(CurDAG->getMachineNode(PPC::ADDIC, dl, MVT::i32, MVT::Glue,
Dan Gohman32f71d72009-09-25 18:54:59 +0000782 Op, getI32Imm(1)), 0);
Andrew Trickc416ba62010-12-24 04:28:06 +0000783 return CurDAG->SelectNodeTo(N, PPC::ADDZE, MVT::i32,
784 SDValue(CurDAG->getMachineNode(PPC::LI, dl,
Dan Gohman32f71d72009-09-25 18:54:59 +0000785 MVT::i32,
786 getI32Imm(0)), 0),
Dale Johannesenf08a47b2009-02-04 23:02:30 +0000787 Op.getValue(1));
Chris Lattnere2969492005-10-21 21:17:10 +0000788 case ISD::SETNE: {
Roman Divacky254f8212011-06-20 15:28:39 +0000789 if (isPPC64) break;
Dan Gohman32f71d72009-09-25 18:54:59 +0000790 Op = SDValue(CurDAG->getMachineNode(PPC::NOR, dl, MVT::i32, Op, Op), 0);
Chris Lattner3e5fbd72010-12-21 02:38:05 +0000791 SDNode *AD = CurDAG->getMachineNode(PPC::ADDIC, dl, MVT::i32, MVT::Glue,
Dan Gohman32f71d72009-09-25 18:54:59 +0000792 Op, getI32Imm(~0U));
Owen Anderson9f944592009-08-11 20:47:22 +0000793 return CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, SDValue(AD, 0),
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000794 Op, SDValue(AD, 1));
Chris Lattner491b8292005-10-06 19:03:35 +0000795 }
Chris Lattnere2969492005-10-21 21:17:10 +0000796 case ISD::SETLT: {
Dan Gohman32f71d72009-09-25 18:54:59 +0000797 SDValue AD = SDValue(CurDAG->getMachineNode(PPC::ADDI, dl, MVT::i32, Op,
798 getI32Imm(1)), 0);
799 SDValue AN = SDValue(CurDAG->getMachineNode(PPC::AND, dl, MVT::i32, AD,
800 Op), 0);
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000801 SDValue Ops[] = { AN, getI32Imm(1), getI32Imm(31), getI32Imm(31) };
Owen Anderson9f944592009-08-11 20:47:22 +0000802 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
Chris Lattnere2969492005-10-21 21:17:10 +0000803 }
Evan Chengc3acfc02006-08-27 08:14:06 +0000804 case ISD::SETGT: {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000805 SDValue Ops[] = { Op, getI32Imm(1), getI32Imm(31), getI32Imm(31) };
Michael Liaob53d8962013-04-19 22:22:57 +0000806 Op = SDValue(CurDAG->getMachineNode(PPC::RLWINM, dl, MVT::i32, Ops),
Dale Johannesenf08a47b2009-02-04 23:02:30 +0000807 0);
Andrew Trickc416ba62010-12-24 04:28:06 +0000808 return CurDAG->SelectNodeTo(N, PPC::XORI, MVT::i32, Op,
Evan Cheng34b70ee2006-08-26 08:00:10 +0000809 getI32Imm(1));
Chris Lattnere2969492005-10-21 21:17:10 +0000810 }
Evan Chengc3acfc02006-08-27 08:14:06 +0000811 }
Chris Lattner491b8292005-10-06 19:03:35 +0000812 }
813 }
Andrew Trickc416ba62010-12-24 04:28:06 +0000814
Adhemerval Zanellafe3f7932012-10-08 18:59:53 +0000815 SDValue LHS = N->getOperand(0);
816 SDValue RHS = N->getOperand(1);
817
Adhemerval Zanella56775e02012-10-30 13:50:19 +0000818 // Altivec Vector compare instructions do not set any CR register by default and
819 // vector compare operations return the same type as the operands.
Adhemerval Zanellafe3f7932012-10-08 18:59:53 +0000820 if (LHS.getValueType().isVector()) {
Adhemerval Zanella56775e02012-10-30 13:50:19 +0000821 EVT VecVT = LHS.getValueType();
822 MVT::SimpleValueType VT = VecVT.getSimpleVT().SimpleTy;
Hal Finkel27774d92014-03-13 07:58:58 +0000823 unsigned int VCmpInst = getVCmpInst(VT, CC, PPCSubTarget.hasVSX());
Adhemerval Zanella56775e02012-10-30 13:50:19 +0000824
825 switch (CC) {
826 case ISD::SETEQ:
827 case ISD::SETOEQ:
828 case ISD::SETUEQ:
829 return CurDAG->SelectNodeTo(N, VCmpInst, VecVT, LHS, RHS);
830 case ISD::SETNE:
831 case ISD::SETONE:
832 case ISD::SETUNE: {
833 SDValue VCmp(CurDAG->getMachineNode(VCmpInst, dl, VecVT, LHS, RHS), 0);
Hal Finkel732f0f72014-03-26 12:49:28 +0000834 return CurDAG->SelectNodeTo(N, PPCSubTarget.hasVSX() ? PPC::XXLNOR :
835 PPC::VNOR,
836 VecVT, VCmp, VCmp);
Adhemerval Zanella56775e02012-10-30 13:50:19 +0000837 }
838 case ISD::SETLT:
839 case ISD::SETOLT:
840 case ISD::SETULT:
841 return CurDAG->SelectNodeTo(N, VCmpInst, VecVT, RHS, LHS);
842 case ISD::SETGT:
843 case ISD::SETOGT:
844 case ISD::SETUGT:
845 return CurDAG->SelectNodeTo(N, VCmpInst, VecVT, LHS, RHS);
846 case ISD::SETGE:
847 case ISD::SETOGE:
848 case ISD::SETUGE: {
849 // Small optimization: Altivec provides a 'Vector Compare Greater Than
850 // or Equal To' instruction (vcmpgefp), so in this case there is no
851 // need for extra logic for the equal compare.
852 if (VecVT.getSimpleVT().isFloatingPoint()) {
853 return CurDAG->SelectNodeTo(N, VCmpInst, VecVT, LHS, RHS);
854 } else {
855 SDValue VCmpGT(CurDAG->getMachineNode(VCmpInst, dl, VecVT, LHS, RHS), 0);
Hal Finkel27774d92014-03-13 07:58:58 +0000856 unsigned int VCmpEQInst = getVCmpEQInst(VT, PPCSubTarget.hasVSX());
Adhemerval Zanella56775e02012-10-30 13:50:19 +0000857 SDValue VCmpEQ(CurDAG->getMachineNode(VCmpEQInst, dl, VecVT, LHS, RHS), 0);
Hal Finkel732f0f72014-03-26 12:49:28 +0000858 return CurDAG->SelectNodeTo(N, PPCSubTarget.hasVSX() ? PPC::XXLOR :
859 PPC::VOR,
860 VecVT, VCmpGT, VCmpEQ);
Adhemerval Zanella56775e02012-10-30 13:50:19 +0000861 }
862 }
863 case ISD::SETLE:
864 case ISD::SETOLE:
865 case ISD::SETULE: {
866 SDValue VCmpLE(CurDAG->getMachineNode(VCmpInst, dl, VecVT, RHS, LHS), 0);
Hal Finkel27774d92014-03-13 07:58:58 +0000867 unsigned int VCmpEQInst = getVCmpEQInst(VT, PPCSubTarget.hasVSX());
Adhemerval Zanella56775e02012-10-30 13:50:19 +0000868 SDValue VCmpEQ(CurDAG->getMachineNode(VCmpEQInst, dl, VecVT, LHS, RHS), 0);
Hal Finkel732f0f72014-03-26 12:49:28 +0000869 return CurDAG->SelectNodeTo(N, PPCSubTarget.hasVSX() ? PPC::XXLOR :
870 PPC::VOR,
871 VecVT, VCmpLE, VCmpEQ);
Adhemerval Zanella56775e02012-10-30 13:50:19 +0000872 }
873 default:
874 llvm_unreachable("Invalid vector compare type: should be expanded by legalize");
875 }
Adhemerval Zanellafe3f7932012-10-08 18:59:53 +0000876 }
877
Hal Finkel940ab932014-02-28 00:27:01 +0000878 if (PPCSubTarget.useCRBits())
879 return 0;
880
Chris Lattner491b8292005-10-06 19:03:35 +0000881 bool Inv;
Ulrich Weigand47e93282013-07-03 15:13:30 +0000882 unsigned Idx = getCRIdxForSetCC(CC, Inv);
Adhemerval Zanellafe3f7932012-10-08 18:59:53 +0000883 SDValue CCReg = SelectCC(LHS, RHS, CC, dl);
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000884 SDValue IntCR;
Andrew Trickc416ba62010-12-24 04:28:06 +0000885
Chris Lattner491b8292005-10-06 19:03:35 +0000886 // Force the ccreg into CR7.
Owen Anderson9f944592009-08-11 20:47:22 +0000887 SDValue CR7Reg = CurDAG->getRegister(PPC::CR7, MVT::i32);
Andrew Trickc416ba62010-12-24 04:28:06 +0000888
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000889 SDValue InFlag(0, 0); // Null incoming flag value.
Andrew Trickc416ba62010-12-24 04:28:06 +0000890 CCReg = CurDAG->getCopyToReg(CurDAG->getEntryNode(), dl, CR7Reg, CCReg,
Chris Lattnerbd099102005-12-01 03:50:19 +0000891 InFlag).getValue(1);
Andrew Trickc416ba62010-12-24 04:28:06 +0000892
Ulrich Weigandd5ebc622013-07-03 17:05:42 +0000893 IntCR = SDValue(CurDAG->getMachineNode(PPC::MFOCRF, dl, MVT::i32, CR7Reg,
894 CCReg), 0);
Andrew Trickc416ba62010-12-24 04:28:06 +0000895
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000896 SDValue Ops[] = { IntCR, getI32Imm((32-(3-Idx)) & 31),
Evan Chengc3acfc02006-08-27 08:14:06 +0000897 getI32Imm(31), getI32Imm(31) };
Ulrich Weigand47e93282013-07-03 15:13:30 +0000898 if (!Inv)
Owen Anderson9f944592009-08-11 20:47:22 +0000899 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
Chris Lattner89f36e62008-01-08 06:46:30 +0000900
901 // Get the specified bit.
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000902 SDValue Tmp =
Michael Liaob53d8962013-04-19 22:22:57 +0000903 SDValue(CurDAG->getMachineNode(PPC::RLWINM, dl, MVT::i32, Ops), 0);
Ulrich Weigand47e93282013-07-03 15:13:30 +0000904 return CurDAG->SelectNodeTo(N, PPC::XORI, MVT::i32, Tmp, getI32Imm(1));
Chris Lattner491b8292005-10-06 19:03:35 +0000905}
Chris Lattner502a3692005-10-06 18:56:10 +0000906
Chris Lattner318622f2005-10-06 19:07:45 +0000907
Chris Lattner43ff01e2005-08-17 19:33:03 +0000908// Select - Convert the specified operand from a target-independent to a
909// target-specific node if it hasn't already been changed.
Dan Gohmanea6f91f2010-01-05 01:24:18 +0000910SDNode *PPCDAGToDAGISel::Select(SDNode *N) {
Andrew Trickef9de2a2013-05-25 02:42:55 +0000911 SDLoc dl(N);
Tim Northover31d093c2013-09-22 08:21:56 +0000912 if (N->isMachineOpcode()) {
913 N->setNodeId(-1);
Evan Chengbd1c5a82006-08-11 09:08:15 +0000914 return NULL; // Already selected.
Tim Northover31d093c2013-09-22 08:21:56 +0000915 }
Chris Lattner08c319f2005-09-29 00:59:32 +0000916
Chris Lattner43ff01e2005-08-17 19:33:03 +0000917 switch (N->getOpcode()) {
Chris Lattner498915d2005-09-07 23:45:15 +0000918 default: break;
Andrew Trickc416ba62010-12-24 04:28:06 +0000919
Jim Laskey095e6f32006-12-12 13:23:43 +0000920 case ISD::Constant: {
Owen Anderson9f944592009-08-11 20:47:22 +0000921 if (N->getValueType(0) == MVT::i64) {
Jim Laskey095e6f32006-12-12 13:23:43 +0000922 // Get 64 bit value.
Dan Gohmaneffb8942008-09-12 16:56:44 +0000923 int64_t Imm = cast<ConstantSDNode>(N)->getZExtValue();
Jim Laskey095e6f32006-12-12 13:23:43 +0000924 // Assume no remaining bits.
925 unsigned Remainder = 0;
926 // Assume no shift required.
927 unsigned Shift = 0;
Andrew Trickc416ba62010-12-24 04:28:06 +0000928
Jim Laskey095e6f32006-12-12 13:23:43 +0000929 // If it can't be represented as a 32 bit value.
Benjamin Kramer2788f792010-03-29 21:13:41 +0000930 if (!isInt<32>(Imm)) {
Michael J. Spencerdf1ecbd72013-05-24 22:23:49 +0000931 Shift = countTrailingZeros<uint64_t>(Imm);
Jim Laskey095e6f32006-12-12 13:23:43 +0000932 int64_t ImmSh = static_cast<uint64_t>(Imm) >> Shift;
Andrew Trickc416ba62010-12-24 04:28:06 +0000933
Jim Laskey095e6f32006-12-12 13:23:43 +0000934 // If the shifted value fits 32 bits.
Benjamin Kramer2788f792010-03-29 21:13:41 +0000935 if (isInt<32>(ImmSh)) {
Jim Laskey095e6f32006-12-12 13:23:43 +0000936 // Go with the shifted value.
937 Imm = ImmSh;
938 } else {
939 // Still stuck with a 64 bit value.
940 Remainder = Imm;
941 Shift = 32;
942 Imm >>= 32;
943 }
944 }
Andrew Trickc416ba62010-12-24 04:28:06 +0000945
Jim Laskey095e6f32006-12-12 13:23:43 +0000946 // Intermediate operand.
947 SDNode *Result;
948
949 // Handle first 32 bits.
950 unsigned Lo = Imm & 0xFFFF;
951 unsigned Hi = (Imm >> 16) & 0xFFFF;
Andrew Trickc416ba62010-12-24 04:28:06 +0000952
Jim Laskey095e6f32006-12-12 13:23:43 +0000953 // Simple value.
Benjamin Kramer2788f792010-03-29 21:13:41 +0000954 if (isInt<16>(Imm)) {
Jim Laskey095e6f32006-12-12 13:23:43 +0000955 // Just the Lo bits.
Dan Gohman32f71d72009-09-25 18:54:59 +0000956 Result = CurDAG->getMachineNode(PPC::LI8, dl, MVT::i64, getI32Imm(Lo));
Jim Laskey095e6f32006-12-12 13:23:43 +0000957 } else if (Lo) {
958 // Handle the Hi bits.
959 unsigned OpC = Hi ? PPC::LIS8 : PPC::LI8;
Dan Gohman32f71d72009-09-25 18:54:59 +0000960 Result = CurDAG->getMachineNode(OpC, dl, MVT::i64, getI32Imm(Hi));
Jim Laskey095e6f32006-12-12 13:23:43 +0000961 // And Lo bits.
Dan Gohman32f71d72009-09-25 18:54:59 +0000962 Result = CurDAG->getMachineNode(PPC::ORI8, dl, MVT::i64,
963 SDValue(Result, 0), getI32Imm(Lo));
Jim Laskey095e6f32006-12-12 13:23:43 +0000964 } else {
965 // Just the Hi bits.
Dan Gohman32f71d72009-09-25 18:54:59 +0000966 Result = CurDAG->getMachineNode(PPC::LIS8, dl, MVT::i64, getI32Imm(Hi));
Jim Laskey095e6f32006-12-12 13:23:43 +0000967 }
Andrew Trickc416ba62010-12-24 04:28:06 +0000968
Jim Laskey095e6f32006-12-12 13:23:43 +0000969 // If no shift, we're done.
970 if (!Shift) return Result;
971
972 // Shift for next step if the upper 32-bits were not zero.
973 if (Imm) {
Dan Gohman32f71d72009-09-25 18:54:59 +0000974 Result = CurDAG->getMachineNode(PPC::RLDICR, dl, MVT::i64,
975 SDValue(Result, 0),
976 getI32Imm(Shift),
977 getI32Imm(63 - Shift));
Jim Laskey095e6f32006-12-12 13:23:43 +0000978 }
979
980 // Add in the last bits as required.
981 if ((Hi = (Remainder >> 16) & 0xFFFF)) {
Dan Gohman32f71d72009-09-25 18:54:59 +0000982 Result = CurDAG->getMachineNode(PPC::ORIS8, dl, MVT::i64,
983 SDValue(Result, 0), getI32Imm(Hi));
Andrew Trickc416ba62010-12-24 04:28:06 +0000984 }
Jim Laskey095e6f32006-12-12 13:23:43 +0000985 if ((Lo = Remainder & 0xFFFF)) {
Dan Gohman32f71d72009-09-25 18:54:59 +0000986 Result = CurDAG->getMachineNode(PPC::ORI8, dl, MVT::i64,
987 SDValue(Result, 0), getI32Imm(Lo));
Jim Laskey095e6f32006-12-12 13:23:43 +0000988 }
Andrew Trickc416ba62010-12-24 04:28:06 +0000989
Jim Laskey095e6f32006-12-12 13:23:43 +0000990 return Result;
991 }
992 break;
993 }
Andrew Trickc416ba62010-12-24 04:28:06 +0000994
Hal Finkel940ab932014-02-28 00:27:01 +0000995 case ISD::SETCC: {
996 SDNode *SN = SelectSETCC(N);
997 if (SN)
998 return SN;
999 break;
1000 }
Evan Cheng6dc90ca2006-02-09 00:37:58 +00001001 case PPCISD::GlobalBaseReg:
Evan Cheng61413a32006-08-26 05:34:46 +00001002 return getGlobalBaseReg();
Andrew Trickc416ba62010-12-24 04:28:06 +00001003
Chris Lattnere4c338d2005-08-25 00:45:43 +00001004 case ISD::FrameIndex: {
1005 int FI = cast<FrameIndexSDNode>(N)->getIndex();
Dan Gohmanea6f91f2010-01-05 01:24:18 +00001006 SDValue TFI = CurDAG->getTargetFrameIndex(FI, N->getValueType(0));
1007 unsigned Opc = N->getValueType(0) == MVT::i32 ? PPC::ADDI : PPC::ADDI8;
Chris Lattnerbc485fd2006-08-15 23:48:22 +00001008 if (N->hasOneUse())
Dan Gohmanea6f91f2010-01-05 01:24:18 +00001009 return CurDAG->SelectNodeTo(N, Opc, N->getValueType(0), TFI,
Evan Cheng34b70ee2006-08-26 08:00:10 +00001010 getSmallIPtrImm(0));
Dan Gohmanea6f91f2010-01-05 01:24:18 +00001011 return CurDAG->getMachineNode(Opc, dl, N->getValueType(0), TFI,
Dan Gohman32f71d72009-09-25 18:54:59 +00001012 getSmallIPtrImm(0));
Chris Lattnere4c338d2005-08-25 00:45:43 +00001013 }
Chris Lattner6961fc72006-03-26 10:06:40 +00001014
Ulrich Weigandd5ebc622013-07-03 17:05:42 +00001015 case PPCISD::MFOCRF: {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001016 SDValue InFlag = N->getOperand(1);
Ulrich Weigandd5ebc622013-07-03 17:05:42 +00001017 return CurDAG->getMachineNode(PPC::MFOCRF, dl, MVT::i32,
1018 N->getOperand(0), InFlag);
Chris Lattner6961fc72006-03-26 10:06:40 +00001019 }
Andrew Trickc416ba62010-12-24 04:28:06 +00001020
Chris Lattner57693112005-09-28 22:50:24 +00001021 case ISD::SDIV: {
Nate Begeman4dd38312005-10-21 00:02:42 +00001022 // FIXME: since this depends on the setting of the carry flag from the srawi
1023 // we should really be making notes about that for the scheduler.
Andrew Trickc416ba62010-12-24 04:28:06 +00001024 // FIXME: It sure would be nice if we could cheaply recognize the
Nate Begeman4dd38312005-10-21 00:02:42 +00001025 // srl/add/sra pattern the dag combiner will generate for this as
1026 // sra/addze rather than having to handle sdiv ourselves. oh well.
Chris Lattnerdc664572005-08-25 17:50:06 +00001027 unsigned Imm;
Chris Lattner97b3da12006-06-27 00:04:13 +00001028 if (isInt32Immediate(N->getOperand(1), Imm)) {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001029 SDValue N0 = N->getOperand(0);
Chris Lattnerdc664572005-08-25 17:50:06 +00001030 if ((signed)Imm > 0 && isPowerOf2_32(Imm)) {
Evan Chengd1b82d82006-02-09 07:17:49 +00001031 SDNode *Op =
Chris Lattner3e5fbd72010-12-21 02:38:05 +00001032 CurDAG->getMachineNode(PPC::SRAWI, dl, MVT::i32, MVT::Glue,
Dan Gohman32f71d72009-09-25 18:54:59 +00001033 N0, getI32Imm(Log2_32(Imm)));
Andrew Trickc416ba62010-12-24 04:28:06 +00001034 return CurDAG->SelectNodeTo(N, PPC::ADDZE, MVT::i32,
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001035 SDValue(Op, 0), SDValue(Op, 1));
Chris Lattnerdc664572005-08-25 17:50:06 +00001036 } else if ((signed)Imm < 0 && isPowerOf2_32(-Imm)) {
Evan Chengd1b82d82006-02-09 07:17:49 +00001037 SDNode *Op =
Chris Lattner3e5fbd72010-12-21 02:38:05 +00001038 CurDAG->getMachineNode(PPC::SRAWI, dl, MVT::i32, MVT::Glue,
Dan Gohman32f71d72009-09-25 18:54:59 +00001039 N0, getI32Imm(Log2_32(-Imm)));
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001040 SDValue PT =
Dan Gohman32f71d72009-09-25 18:54:59 +00001041 SDValue(CurDAG->getMachineNode(PPC::ADDZE, dl, MVT::i32,
1042 SDValue(Op, 0), SDValue(Op, 1)),
Evan Chengd1b82d82006-02-09 07:17:49 +00001043 0);
Owen Anderson9f944592009-08-11 20:47:22 +00001044 return CurDAG->SelectNodeTo(N, PPC::NEG, MVT::i32, PT);
Chris Lattnerdc664572005-08-25 17:50:06 +00001045 }
1046 }
Andrew Trickc416ba62010-12-24 04:28:06 +00001047
Chris Lattner1de57062005-09-29 23:33:31 +00001048 // Other cases are autogenerated.
1049 break;
Chris Lattner6e184f22005-08-25 22:04:30 +00001050 }
Andrew Trickc416ba62010-12-24 04:28:06 +00001051
Chris Lattnerce645542006-11-10 02:08:47 +00001052 case ISD::LOAD: {
1053 // Handle preincrement loads.
Dan Gohmanea6f91f2010-01-05 01:24:18 +00001054 LoadSDNode *LD = cast<LoadSDNode>(N);
Owen Anderson53aa7a92009-08-10 22:56:29 +00001055 EVT LoadedVT = LD->getMemoryVT();
Andrew Trickc416ba62010-12-24 04:28:06 +00001056
Chris Lattnerce645542006-11-10 02:08:47 +00001057 // Normal loads are handled by code generated from the .td file.
1058 if (LD->getAddressingMode() != ISD::PRE_INC)
1059 break;
Andrew Trickc416ba62010-12-24 04:28:06 +00001060
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001061 SDValue Offset = LD->getOffset();
Ulrich Weigandd1b99d32013-03-22 14:58:17 +00001062 if (Offset.getOpcode() == ISD::TargetConstant ||
Chris Lattnerc5102bf2006-11-11 04:53:30 +00001063 Offset.getOpcode() == ISD::TargetGlobalAddress) {
Andrew Trickc416ba62010-12-24 04:28:06 +00001064
Chris Lattner474b5b72006-11-15 19:55:13 +00001065 unsigned Opcode;
1066 bool isSExt = LD->getExtensionType() == ISD::SEXTLOAD;
Owen Anderson9f944592009-08-11 20:47:22 +00001067 if (LD->getValueType(0) != MVT::i64) {
Chris Lattner474b5b72006-11-15 19:55:13 +00001068 // Handle PPC32 integer and normal FP loads.
Owen Anderson9f944592009-08-11 20:47:22 +00001069 assert((!isSExt || LoadedVT == MVT::i16) && "Invalid sext update load");
1070 switch (LoadedVT.getSimpleVT().SimpleTy) {
Torok Edwinfbcc6632009-07-14 16:55:14 +00001071 default: llvm_unreachable("Invalid PPC load type!");
Owen Anderson9f944592009-08-11 20:47:22 +00001072 case MVT::f64: Opcode = PPC::LFDU; break;
1073 case MVT::f32: Opcode = PPC::LFSU; break;
1074 case MVT::i32: Opcode = PPC::LWZU; break;
1075 case MVT::i16: Opcode = isSExt ? PPC::LHAU : PPC::LHZU; break;
1076 case MVT::i1:
1077 case MVT::i8: Opcode = PPC::LBZU; break;
Chris Lattner474b5b72006-11-15 19:55:13 +00001078 }
1079 } else {
Owen Anderson9f944592009-08-11 20:47:22 +00001080 assert(LD->getValueType(0) == MVT::i64 && "Unknown load result type!");
1081 assert((!isSExt || LoadedVT == MVT::i16) && "Invalid sext update load");
1082 switch (LoadedVT.getSimpleVT().SimpleTy) {
Torok Edwinfbcc6632009-07-14 16:55:14 +00001083 default: llvm_unreachable("Invalid PPC load type!");
Owen Anderson9f944592009-08-11 20:47:22 +00001084 case MVT::i64: Opcode = PPC::LDU; break;
1085 case MVT::i32: Opcode = PPC::LWZU8; break;
1086 case MVT::i16: Opcode = isSExt ? PPC::LHAU8 : PPC::LHZU8; break;
1087 case MVT::i1:
1088 case MVT::i8: Opcode = PPC::LBZU8; break;
Chris Lattner474b5b72006-11-15 19:55:13 +00001089 }
1090 }
Andrew Trickc416ba62010-12-24 04:28:06 +00001091
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001092 SDValue Chain = LD->getChain();
1093 SDValue Base = LD->getBasePtr();
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001094 SDValue Ops[] = { Offset, Base, Chain };
Dan Gohman32f71d72009-09-25 18:54:59 +00001095 return CurDAG->getMachineNode(Opcode, dl, LD->getValueType(0),
1096 PPCLowering.getPointerTy(),
Michael Liaob53d8962013-04-19 22:22:57 +00001097 MVT::Other, Ops);
Chris Lattnerce645542006-11-10 02:08:47 +00001098 } else {
Hal Finkelca542be2012-06-20 15:43:03 +00001099 unsigned Opcode;
1100 bool isSExt = LD->getExtensionType() == ISD::SEXTLOAD;
1101 if (LD->getValueType(0) != MVT::i64) {
1102 // Handle PPC32 integer and normal FP loads.
1103 assert((!isSExt || LoadedVT == MVT::i16) && "Invalid sext update load");
1104 switch (LoadedVT.getSimpleVT().SimpleTy) {
1105 default: llvm_unreachable("Invalid PPC load type!");
1106 case MVT::f64: Opcode = PPC::LFDUX; break;
1107 case MVT::f32: Opcode = PPC::LFSUX; break;
1108 case MVT::i32: Opcode = PPC::LWZUX; break;
1109 case MVT::i16: Opcode = isSExt ? PPC::LHAUX : PPC::LHZUX; break;
1110 case MVT::i1:
1111 case MVT::i8: Opcode = PPC::LBZUX; break;
1112 }
1113 } else {
1114 assert(LD->getValueType(0) == MVT::i64 && "Unknown load result type!");
1115 assert((!isSExt || LoadedVT == MVT::i16 || LoadedVT == MVT::i32) &&
1116 "Invalid sext update load");
1117 switch (LoadedVT.getSimpleVT().SimpleTy) {
1118 default: llvm_unreachable("Invalid PPC load type!");
1119 case MVT::i64: Opcode = PPC::LDUX; break;
1120 case MVT::i32: Opcode = isSExt ? PPC::LWAUX : PPC::LWZUX8; break;
1121 case MVT::i16: Opcode = isSExt ? PPC::LHAUX8 : PPC::LHZUX8; break;
1122 case MVT::i1:
1123 case MVT::i8: Opcode = PPC::LBZUX8; break;
1124 }
1125 }
1126
1127 SDValue Chain = LD->getChain();
1128 SDValue Base = LD->getBasePtr();
Ulrich Weigande90b0222013-03-22 14:58:48 +00001129 SDValue Ops[] = { Base, Offset, Chain };
Hal Finkelca542be2012-06-20 15:43:03 +00001130 return CurDAG->getMachineNode(Opcode, dl, LD->getValueType(0),
1131 PPCLowering.getPointerTy(),
Michael Liaob53d8962013-04-19 22:22:57 +00001132 MVT::Other, Ops);
Chris Lattnerce645542006-11-10 02:08:47 +00001133 }
1134 }
Andrew Trickc416ba62010-12-24 04:28:06 +00001135
Nate Begemanb3821a32005-08-18 07:30:46 +00001136 case ISD::AND: {
Nate Begemand31efd12006-09-22 05:01:56 +00001137 unsigned Imm, Imm2, SH, MB, ME;
Hal Finkele39526a2012-08-28 02:10:15 +00001138 uint64_t Imm64;
Nate Begemand31efd12006-09-22 05:01:56 +00001139
Nate Begemanb3821a32005-08-18 07:30:46 +00001140 // If this is an and of a value rotated between 0 and 31 bits and then and'd
1141 // with a mask, emit rlwinm
Chris Lattner97b3da12006-06-27 00:04:13 +00001142 if (isInt32Immediate(N->getOperand(1), Imm) &&
Gabor Greiff304a7a2008-08-28 21:40:38 +00001143 isRotateAndMask(N->getOperand(0).getNode(), Imm, false, SH, MB, ME)) {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001144 SDValue Val = N->getOperand(0).getOperand(0);
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001145 SDValue Ops[] = { Val, getI32Imm(SH), getI32Imm(MB), getI32Imm(ME) };
Owen Anderson9f944592009-08-11 20:47:22 +00001146 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
Nate Begemanb3821a32005-08-18 07:30:46 +00001147 }
Nate Begemand31efd12006-09-22 05:01:56 +00001148 // If this is just a masked value where the input is not handled above, and
1149 // is not a rotate-left (handled by a pattern in the .td file), emit rlwinm
1150 if (isInt32Immediate(N->getOperand(1), Imm) &&
Andrew Trickc416ba62010-12-24 04:28:06 +00001151 isRunOfOnes(Imm, MB, ME) &&
Nate Begemand31efd12006-09-22 05:01:56 +00001152 N->getOperand(0).getOpcode() != ISD::ROTL) {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001153 SDValue Val = N->getOperand(0);
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001154 SDValue Ops[] = { Val, getI32Imm(0), getI32Imm(MB), getI32Imm(ME) };
Owen Anderson9f944592009-08-11 20:47:22 +00001155 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
Nate Begemand31efd12006-09-22 05:01:56 +00001156 }
Hal Finkele39526a2012-08-28 02:10:15 +00001157 // If this is a 64-bit zero-extension mask, emit rldicl.
1158 if (isInt64Immediate(N->getOperand(1).getNode(), Imm64) &&
1159 isMask_64(Imm64)) {
1160 SDValue Val = N->getOperand(0);
1161 MB = 64 - CountTrailingOnes_64(Imm64);
Hal Finkel22498fa2013-11-20 01:10:15 +00001162 SH = 0;
1163
1164 // If the operand is a logical right shift, we can fold it into this
1165 // instruction: rldicl(rldicl(x, 64-n, n), 0, mb) -> rldicl(x, 64-n, mb)
1166 // for n <= mb. The right shift is really a left rotate followed by a
1167 // mask, and this mask is a more-restrictive sub-mask of the mask implied
1168 // by the shift.
1169 if (Val.getOpcode() == ISD::SRL &&
1170 isInt32Immediate(Val.getOperand(1).getNode(), Imm) && Imm <= MB) {
1171 assert(Imm < 64 && "Illegal shift amount");
1172 Val = Val.getOperand(0);
1173 SH = 64 - Imm;
1174 }
1175
1176 SDValue Ops[] = { Val, getI32Imm(SH), getI32Imm(MB) };
Hal Finkele39526a2012-08-28 02:10:15 +00001177 return CurDAG->SelectNodeTo(N, PPC::RLDICL, MVT::i64, Ops, 3);
1178 }
Nate Begemand31efd12006-09-22 05:01:56 +00001179 // AND X, 0 -> 0, not "rlwinm 32".
1180 if (isInt32Immediate(N->getOperand(1), Imm) && (Imm == 0)) {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001181 ReplaceUses(SDValue(N, 0), N->getOperand(1));
Nate Begemand31efd12006-09-22 05:01:56 +00001182 return NULL;
1183 }
Nate Begeman9aea6e42005-12-24 01:00:15 +00001184 // ISD::OR doesn't get all the bitfield insertion fun.
1185 // (and (or x, c1), c2) where isRunOfOnes(~(c1^c2)) is a bitfield insert
Andrew Trickc416ba62010-12-24 04:28:06 +00001186 if (isInt32Immediate(N->getOperand(1), Imm) &&
Nate Begeman9aea6e42005-12-24 01:00:15 +00001187 N->getOperand(0).getOpcode() == ISD::OR &&
Chris Lattner97b3da12006-06-27 00:04:13 +00001188 isInt32Immediate(N->getOperand(0).getOperand(1), Imm2)) {
Chris Lattner20c88df2006-01-05 18:32:49 +00001189 unsigned MB, ME;
Nate Begeman9aea6e42005-12-24 01:00:15 +00001190 Imm = ~(Imm^Imm2);
1191 if (isRunOfOnes(Imm, MB, ME)) {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001192 SDValue Ops[] = { N->getOperand(0).getOperand(0),
Evan Chengc3acfc02006-08-27 08:14:06 +00001193 N->getOperand(0).getOperand(1),
1194 getI32Imm(0), getI32Imm(MB),getI32Imm(ME) };
Michael Liaob53d8962013-04-19 22:22:57 +00001195 return CurDAG->getMachineNode(PPC::RLWIMI, dl, MVT::i32, Ops);
Nate Begeman9aea6e42005-12-24 01:00:15 +00001196 }
1197 }
Andrew Trickc416ba62010-12-24 04:28:06 +00001198
Chris Lattner1de57062005-09-29 23:33:31 +00001199 // Other cases are autogenerated.
1200 break;
Nate Begemanb3821a32005-08-18 07:30:46 +00001201 }
Nate Begeman93c4bc62005-08-19 00:38:14 +00001202 case ISD::OR:
Owen Anderson9f944592009-08-11 20:47:22 +00001203 if (N->getValueType(0) == MVT::i32)
Chris Lattnerbc485fd2006-08-15 23:48:22 +00001204 if (SDNode *I = SelectBitfieldInsert(N))
1205 return I;
Andrew Trickc416ba62010-12-24 04:28:06 +00001206
Chris Lattner1de57062005-09-29 23:33:31 +00001207 // Other cases are autogenerated.
1208 break;
Nate Begeman33acb2c2005-08-18 23:38:00 +00001209 case ISD::SHL: {
1210 unsigned Imm, SH, MB, ME;
Gabor Greiff304a7a2008-08-28 21:40:38 +00001211 if (isOpcWithIntImmediate(N->getOperand(0).getNode(), ISD::AND, Imm) &&
Nate Begeman9f3c26c2005-10-19 18:42:01 +00001212 isRotateAndMask(N, Imm, true, SH, MB, ME)) {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001213 SDValue Ops[] = { N->getOperand(0).getOperand(0),
Evan Chengc3acfc02006-08-27 08:14:06 +00001214 getI32Imm(SH), getI32Imm(MB), getI32Imm(ME) };
Owen Anderson9f944592009-08-11 20:47:22 +00001215 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
Nate Begeman9eaa6ba2005-10-19 01:12:32 +00001216 }
Andrew Trickc416ba62010-12-24 04:28:06 +00001217
Nate Begeman9f3c26c2005-10-19 18:42:01 +00001218 // Other cases are autogenerated.
1219 break;
Nate Begeman33acb2c2005-08-18 23:38:00 +00001220 }
1221 case ISD::SRL: {
1222 unsigned Imm, SH, MB, ME;
Gabor Greiff304a7a2008-08-28 21:40:38 +00001223 if (isOpcWithIntImmediate(N->getOperand(0).getNode(), ISD::AND, Imm) &&
Andrew Trickc416ba62010-12-24 04:28:06 +00001224 isRotateAndMask(N, Imm, true, SH, MB, ME)) {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001225 SDValue Ops[] = { N->getOperand(0).getOperand(0),
Evan Chengc3acfc02006-08-27 08:14:06 +00001226 getI32Imm(SH), getI32Imm(MB), getI32Imm(ME) };
Owen Anderson9f944592009-08-11 20:47:22 +00001227 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
Nate Begeman9eaa6ba2005-10-19 01:12:32 +00001228 }
Andrew Trickc416ba62010-12-24 04:28:06 +00001229
Nate Begeman9f3c26c2005-10-19 18:42:01 +00001230 // Other cases are autogenerated.
1231 break;
Nate Begeman33acb2c2005-08-18 23:38:00 +00001232 }
Hal Finkel940ab932014-02-28 00:27:01 +00001233 // FIXME: Remove this once the ANDI glue bug is fixed:
1234 case PPCISD::ANDIo_1_EQ_BIT:
1235 case PPCISD::ANDIo_1_GT_BIT: {
1236 if (!ANDIGlueBug)
1237 break;
1238
1239 EVT InVT = N->getOperand(0).getValueType();
1240 assert((InVT == MVT::i64 || InVT == MVT::i32) &&
1241 "Invalid input type for ANDIo_1_EQ_BIT");
1242
1243 unsigned Opcode = (InVT == MVT::i64) ? PPC::ANDIo8 : PPC::ANDIo;
1244 SDValue AndI(CurDAG->getMachineNode(Opcode, dl, InVT, MVT::Glue,
1245 N->getOperand(0),
1246 CurDAG->getTargetConstant(1, InVT)), 0);
1247 SDValue CR0Reg = CurDAG->getRegister(PPC::CR0, MVT::i32);
1248 SDValue SRIdxVal =
1249 CurDAG->getTargetConstant(N->getOpcode() == PPCISD::ANDIo_1_EQ_BIT ?
1250 PPC::sub_eq : PPC::sub_gt, MVT::i32);
1251
1252 return CurDAG->SelectNodeTo(N, TargetOpcode::EXTRACT_SUBREG, MVT::i1,
1253 CR0Reg, SRIdxVal,
1254 SDValue(AndI.getNode(), 1) /* glue */);
1255 }
Chris Lattnerbec817c2005-08-26 18:46:49 +00001256 case ISD::SELECT_CC: {
1257 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(4))->get();
Roman Divacky254f8212011-06-20 15:28:39 +00001258 EVT PtrVT = CurDAG->getTargetLoweringInfo().getPointerTy();
1259 bool isPPC64 = (PtrVT == MVT::i64);
Andrew Trickc416ba62010-12-24 04:28:06 +00001260
Hal Finkel940ab932014-02-28 00:27:01 +00001261 // If this is a select of i1 operands, we'll pattern match it.
1262 if (PPCSubTarget.useCRBits() &&
1263 N->getOperand(0).getValueType() == MVT::i1)
1264 break;
1265
Chris Lattner97b3da12006-06-27 00:04:13 +00001266 // Handle the setcc cases here. select_cc lhs, 0, 1, 0, cc
Roman Divacky254f8212011-06-20 15:28:39 +00001267 if (!isPPC64)
1268 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N->getOperand(1)))
1269 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N->getOperand(2)))
1270 if (ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N->getOperand(3)))
1271 if (N1C->isNullValue() && N3C->isNullValue() &&
1272 N2C->getZExtValue() == 1ULL && CC == ISD::SETNE &&
1273 // FIXME: Implement this optzn for PPC64.
1274 N->getValueType(0) == MVT::i32) {
1275 SDNode *Tmp =
1276 CurDAG->getMachineNode(PPC::ADDIC, dl, MVT::i32, MVT::Glue,
1277 N->getOperand(0), getI32Imm(~0U));
1278 return CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32,
1279 SDValue(Tmp, 0), N->getOperand(0),
1280 SDValue(Tmp, 1));
1281 }
Chris Lattner9b577f12005-08-26 21:23:58 +00001282
Dale Johannesenab8e4422009-02-06 19:16:40 +00001283 SDValue CCReg = SelectCC(N->getOperand(0), N->getOperand(1), CC, dl);
Hal Finkel940ab932014-02-28 00:27:01 +00001284
1285 if (N->getValueType(0) == MVT::i1) {
1286 // An i1 select is: (c & t) | (!c & f).
1287 bool Inv;
1288 unsigned Idx = getCRIdxForSetCC(CC, Inv);
1289
1290 unsigned SRI;
1291 switch (Idx) {
1292 default: llvm_unreachable("Invalid CC index");
1293 case 0: SRI = PPC::sub_lt; break;
1294 case 1: SRI = PPC::sub_gt; break;
1295 case 2: SRI = PPC::sub_eq; break;
1296 case 3: SRI = PPC::sub_un; break;
1297 }
1298
1299 SDValue CCBit = CurDAG->getTargetExtractSubreg(SRI, dl, MVT::i1, CCReg);
1300
1301 SDValue NotCCBit(CurDAG->getMachineNode(PPC::CRNOR, dl, MVT::i1,
1302 CCBit, CCBit), 0);
1303 SDValue C = Inv ? NotCCBit : CCBit,
1304 NotC = Inv ? CCBit : NotCCBit;
1305
1306 SDValue CAndT(CurDAG->getMachineNode(PPC::CRAND, dl, MVT::i1,
1307 C, N->getOperand(2)), 0);
1308 SDValue NotCAndF(CurDAG->getMachineNode(PPC::CRAND, dl, MVT::i1,
1309 NotC, N->getOperand(3)), 0);
1310
1311 return CurDAG->SelectNodeTo(N, PPC::CROR, MVT::i1, CAndT, NotCAndF);
1312 }
1313
Chris Lattner8c6a41e2006-11-17 22:10:59 +00001314 unsigned BROpc = getPredicateForSetCC(CC);
Chris Lattner9b577f12005-08-26 21:23:58 +00001315
Chris Lattnerd3eee1a2005-10-01 01:35:02 +00001316 unsigned SelectCCOp;
Owen Anderson9f944592009-08-11 20:47:22 +00001317 if (N->getValueType(0) == MVT::i32)
Chris Lattner97b3da12006-06-27 00:04:13 +00001318 SelectCCOp = PPC::SELECT_CC_I4;
Owen Anderson9f944592009-08-11 20:47:22 +00001319 else if (N->getValueType(0) == MVT::i64)
Chris Lattner97b3da12006-06-27 00:04:13 +00001320 SelectCCOp = PPC::SELECT_CC_I8;
Owen Anderson9f944592009-08-11 20:47:22 +00001321 else if (N->getValueType(0) == MVT::f32)
Chris Lattnerd3eee1a2005-10-01 01:35:02 +00001322 SelectCCOp = PPC::SELECT_CC_F4;
Owen Anderson9f944592009-08-11 20:47:22 +00001323 else if (N->getValueType(0) == MVT::f64)
Chris Lattnerd3eee1a2005-10-01 01:35:02 +00001324 SelectCCOp = PPC::SELECT_CC_F8;
Chris Lattner0a3d1bb2006-04-08 22:45:08 +00001325 else
1326 SelectCCOp = PPC::SELECT_CC_VRRC;
1327
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001328 SDValue Ops[] = { CCReg, N->getOperand(2), N->getOperand(3),
Evan Chengc3acfc02006-08-27 08:14:06 +00001329 getI32Imm(BROpc) };
1330 return CurDAG->SelectNodeTo(N, SelectCCOp, N->getValueType(0), Ops, 4);
Chris Lattnerbec817c2005-08-26 18:46:49 +00001331 }
Hal Finkel732f0f72014-03-26 12:49:28 +00001332 case ISD::VSELECT:
1333 if (PPCSubTarget.hasVSX()) {
1334 SDValue Ops[] = { N->getOperand(2), N->getOperand(1), N->getOperand(0) };
1335 return CurDAG->SelectNodeTo(N, PPC::XXSEL, N->getValueType(0), Ops, 3);
1336 }
1337
1338 break;
Hal Finkeldf3e34d2014-03-26 22:58:37 +00001339 case ISD::VECTOR_SHUFFLE:
1340 if (PPCSubTarget.hasVSX() && (N->getValueType(0) == MVT::v2f64 ||
1341 N->getValueType(0) == MVT::v2i64)) {
1342 ShuffleVectorSDNode *SVN = cast<ShuffleVectorSDNode>(N);
1343
1344 SDValue Op1 = N->getOperand(SVN->getMaskElt(0) < 2 ? 0 : 1),
1345 Op2 = N->getOperand(SVN->getMaskElt(1) < 2 ? 0 : 1);
1346 unsigned DM[2];
1347
1348 for (int i = 0; i < 2; ++i)
1349 if (SVN->getMaskElt(i) <= 0 || SVN->getMaskElt(i) == 2)
1350 DM[i] = 0;
1351 else
1352 DM[i] = 1;
1353
1354 SDValue DMV = CurDAG->getTargetConstant(DM[0] | (DM[1] << 1), MVT::i32);
1355
1356 if (Op1 == Op2 && DM[0] == 0 && DM[1] == 0 &&
1357 Op1.getOpcode() == ISD::SCALAR_TO_VECTOR &&
1358 isa<LoadSDNode>(Op1.getOperand(0))) {
1359 LoadSDNode *LD = cast<LoadSDNode>(Op1.getOperand(0));
1360 SDValue Base, Offset;
1361
1362 if (LD->isUnindexed() &&
1363 SelectAddrIdxOnly(LD->getBasePtr(), Base, Offset)) {
1364 SDValue Chain = LD->getChain();
1365 SDValue Ops[] = { Base, Offset, Chain };
1366 return CurDAG->SelectNodeTo(N, PPC::LXVDSX,
1367 N->getValueType(0), Ops, 3);
1368 }
1369 }
1370
1371 SDValue Ops[] = { Op1, Op2, DMV };
1372 return CurDAG->SelectNodeTo(N, PPC::XXPERMDI, N->getValueType(0), Ops, 3);
1373 }
1374
1375 break;
Hal Finkel25c19922013-05-15 21:37:41 +00001376 case PPCISD::BDNZ:
1377 case PPCISD::BDZ: {
1378 bool IsPPC64 = PPCSubTarget.isPPC64();
1379 SDValue Ops[] = { N->getOperand(1), N->getOperand(0) };
1380 return CurDAG->SelectNodeTo(N, N->getOpcode() == PPCISD::BDNZ ?
1381 (IsPPC64 ? PPC::BDNZ8 : PPC::BDNZ) :
1382 (IsPPC64 ? PPC::BDZ8 : PPC::BDZ),
1383 MVT::Other, Ops, 2);
1384 }
Chris Lattnerbe9377a2006-11-17 22:37:34 +00001385 case PPCISD::COND_BRANCH: {
Dan Gohman7a638a82008-11-05 17:16:24 +00001386 // Op #0 is the Chain.
Chris Lattnerbe9377a2006-11-17 22:37:34 +00001387 // Op #1 is the PPC::PRED_* number.
1388 // Op #2 is the CR#
1389 // Op #3 is the Dest MBB
Dan Gohmanf14b77e2008-11-05 04:14:16 +00001390 // Op #4 is the Flag.
Evan Cheng58d1eac2007-06-29 01:25:06 +00001391 // Prevent PPC::PRED_* from being selected into LI.
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001392 SDValue Pred =
Dan Gohmaneffb8942008-09-12 16:56:44 +00001393 getI32Imm(cast<ConstantSDNode>(N->getOperand(1))->getZExtValue());
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001394 SDValue Ops[] = { Pred, N->getOperand(2), N->getOperand(3),
Chris Lattnerbe9377a2006-11-17 22:37:34 +00001395 N->getOperand(0), N->getOperand(4) };
Owen Anderson9f944592009-08-11 20:47:22 +00001396 return CurDAG->SelectNodeTo(N, PPC::BCC, MVT::Other, Ops, 5);
Chris Lattnerbe9377a2006-11-17 22:37:34 +00001397 }
Nate Begemanbb01d4f2006-03-17 01:40:33 +00001398 case ISD::BR_CC: {
Chris Lattner2a1823d2005-08-21 18:50:37 +00001399 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(1))->get();
Hal Finkel940ab932014-02-28 00:27:01 +00001400 unsigned PCC = getPredicateForSetCC(CC);
1401
1402 if (N->getOperand(2).getValueType() == MVT::i1) {
1403 unsigned Opc;
1404 bool Swap;
1405 switch (PCC) {
1406 default: llvm_unreachable("Unexpected Boolean-operand predicate");
1407 case PPC::PRED_LT: Opc = PPC::CRANDC; Swap = true; break;
1408 case PPC::PRED_LE: Opc = PPC::CRORC; Swap = true; break;
1409 case PPC::PRED_EQ: Opc = PPC::CREQV; Swap = false; break;
1410 case PPC::PRED_GE: Opc = PPC::CRORC; Swap = false; break;
1411 case PPC::PRED_GT: Opc = PPC::CRANDC; Swap = false; break;
1412 case PPC::PRED_NE: Opc = PPC::CRXOR; Swap = false; break;
1413 }
1414
1415 SDValue BitComp(CurDAG->getMachineNode(Opc, dl, MVT::i1,
1416 N->getOperand(Swap ? 3 : 2),
1417 N->getOperand(Swap ? 2 : 3)), 0);
1418 return CurDAG->SelectNodeTo(N, PPC::BC, MVT::Other,
1419 BitComp, N->getOperand(4), N->getOperand(0));
1420 }
1421
Dale Johannesenab8e4422009-02-06 19:16:40 +00001422 SDValue CondCode = SelectCC(N->getOperand(2), N->getOperand(3), CC, dl);
Hal Finkel940ab932014-02-28 00:27:01 +00001423 SDValue Ops[] = { getI32Imm(PCC), CondCode,
Evan Chengc3acfc02006-08-27 08:14:06 +00001424 N->getOperand(4), N->getOperand(0) };
Owen Anderson9f944592009-08-11 20:47:22 +00001425 return CurDAG->SelectNodeTo(N, PPC::BCC, MVT::Other, Ops, 4);
Chris Lattner2a1823d2005-08-21 18:50:37 +00001426 }
Nate Begeman4ca2ea52006-04-22 18:53:45 +00001427 case ISD::BRIND: {
Chris Lattnerb055c872006-06-10 01:15:02 +00001428 // FIXME: Should custom lower this.
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001429 SDValue Chain = N->getOperand(0);
1430 SDValue Target = N->getOperand(1);
Owen Anderson9f944592009-08-11 20:47:22 +00001431 unsigned Opc = Target.getValueType() == MVT::i32 ? PPC::MTCTR : PPC::MTCTR8;
Roman Divackya4a59ae2011-06-03 15:47:49 +00001432 unsigned Reg = Target.getValueType() == MVT::i32 ? PPC::BCTR : PPC::BCTR8;
Hal Finkel528ff4b2011-12-08 04:36:44 +00001433 Chain = SDValue(CurDAG->getMachineNode(Opc, dl, MVT::Glue, Target,
Dan Gohman32f71d72009-09-25 18:54:59 +00001434 Chain), 0);
Roman Divackya4a59ae2011-06-03 15:47:49 +00001435 return CurDAG->SelectNodeTo(N, Reg, MVT::Other, Chain);
Nate Begeman4ca2ea52006-04-22 18:53:45 +00001436 }
Bill Schmidt34627e32012-11-27 17:35:46 +00001437 case PPCISD::TOC_ENTRY: {
1438 assert (PPCSubTarget.isPPC64() && "Only supported for 64-bit ABI");
1439
Bill Schmidt27917782013-02-21 17:12:27 +00001440 // For medium and large code model, we generate two instructions as
1441 // described below. Otherwise we allow SelectCodeCommon to handle this,
1442 // selecting one of LDtoc, LDtocJTI, and LDtocCPT.
1443 CodeModel::Model CModel = TM.getCodeModel();
1444 if (CModel != CodeModel::Medium && CModel != CodeModel::Large)
Bill Schmidt34627e32012-11-27 17:35:46 +00001445 break;
1446
1447 // The first source operand is a TargetGlobalAddress or a
1448 // TargetJumpTable. If it is an externally defined symbol, a symbol
1449 // with common linkage, a function address, or a jump table address,
Bill Schmidt27917782013-02-21 17:12:27 +00001450 // or if we are generating code for large code model, we generate:
Bill Schmidt34627e32012-11-27 17:35:46 +00001451 // LDtocL(<ga:@sym>, ADDIStocHA(%X2, <ga:@sym>))
1452 // Otherwise we generate:
1453 // ADDItocL(ADDIStocHA(%X2, <ga:@sym>), <ga:@sym>)
1454 SDValue GA = N->getOperand(0);
1455 SDValue TOCbase = N->getOperand(1);
1456 SDNode *Tmp = CurDAG->getMachineNode(PPC::ADDIStocHA, dl, MVT::i64,
1457 TOCbase, GA);
1458
Bill Schmidt27917782013-02-21 17:12:27 +00001459 if (isa<JumpTableSDNode>(GA) || CModel == CodeModel::Large)
Bill Schmidt34627e32012-11-27 17:35:46 +00001460 return CurDAG->getMachineNode(PPC::LDtocL, dl, MVT::i64, GA,
1461 SDValue(Tmp, 0));
1462
1463 if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(GA)) {
1464 const GlobalValue *GValue = G->getGlobal();
Bill Schmidt9b1e3e22013-01-07 19:29:18 +00001465 const GlobalAlias *GAlias = dyn_cast<GlobalAlias>(GValue);
Rafael Espindola65481d72014-03-26 06:14:40 +00001466 const GlobalValue *RealGValue = GAlias ?
1467 GAlias->resolveAliasedGlobal(false) : GValue;
Bill Schmidt9b1e3e22013-01-07 19:29:18 +00001468 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(RealGValue);
1469 assert((GVar || isa<Function>(RealGValue)) &&
Bill Schmidt34627e32012-11-27 17:35:46 +00001470 "Unexpected global value subclass!");
1471
1472 // An external variable is one without an initializer. For these,
1473 // for variables with common linkage, and for Functions, generate
1474 // the LDtocL form.
Bill Schmidt9b1e3e22013-01-07 19:29:18 +00001475 if (!GVar || !GVar->hasInitializer() || RealGValue->hasCommonLinkage() ||
1476 RealGValue->hasAvailableExternallyLinkage())
Bill Schmidt34627e32012-11-27 17:35:46 +00001477 return CurDAG->getMachineNode(PPC::LDtocL, dl, MVT::i64, GA,
1478 SDValue(Tmp, 0));
1479 }
1480
1481 return CurDAG->getMachineNode(PPC::ADDItocL, dl, MVT::i64,
1482 SDValue(Tmp, 0), GA);
1483 }
Bill Schmidt51e79512013-02-20 15:50:31 +00001484 case PPCISD::VADD_SPLAT: {
Bill Schmidtc6cbecc2013-02-20 20:41:42 +00001485 // This expands into one of three sequences, depending on whether
1486 // the first operand is odd or even, positive or negative.
Bill Schmidt51e79512013-02-20 15:50:31 +00001487 assert(isa<ConstantSDNode>(N->getOperand(0)) &&
1488 isa<ConstantSDNode>(N->getOperand(1)) &&
1489 "Invalid operand on VADD_SPLAT!");
Bill Schmidtc6cbecc2013-02-20 20:41:42 +00001490
1491 int Elt = N->getConstantOperandVal(0);
Bill Schmidt51e79512013-02-20 15:50:31 +00001492 int EltSize = N->getConstantOperandVal(1);
Bill Schmidtc6cbecc2013-02-20 20:41:42 +00001493 unsigned Opc1, Opc2, Opc3;
Bill Schmidt51e79512013-02-20 15:50:31 +00001494 EVT VT;
Bill Schmidtc6cbecc2013-02-20 20:41:42 +00001495
Bill Schmidt51e79512013-02-20 15:50:31 +00001496 if (EltSize == 1) {
1497 Opc1 = PPC::VSPLTISB;
1498 Opc2 = PPC::VADDUBM;
Bill Schmidtc6cbecc2013-02-20 20:41:42 +00001499 Opc3 = PPC::VSUBUBM;
Bill Schmidt51e79512013-02-20 15:50:31 +00001500 VT = MVT::v16i8;
1501 } else if (EltSize == 2) {
1502 Opc1 = PPC::VSPLTISH;
1503 Opc2 = PPC::VADDUHM;
Bill Schmidtc6cbecc2013-02-20 20:41:42 +00001504 Opc3 = PPC::VSUBUHM;
Bill Schmidt51e79512013-02-20 15:50:31 +00001505 VT = MVT::v8i16;
1506 } else {
1507 assert(EltSize == 4 && "Invalid element size on VADD_SPLAT!");
1508 Opc1 = PPC::VSPLTISW;
1509 Opc2 = PPC::VADDUWM;
Bill Schmidtc6cbecc2013-02-20 20:41:42 +00001510 Opc3 = PPC::VSUBUWM;
Bill Schmidt51e79512013-02-20 15:50:31 +00001511 VT = MVT::v4i32;
1512 }
Bill Schmidtc6cbecc2013-02-20 20:41:42 +00001513
1514 if ((Elt & 1) == 0) {
1515 // Elt is even, in the range [-32,-18] + [16,30].
1516 //
1517 // Convert: VADD_SPLAT elt, size
1518 // Into: tmp = VSPLTIS[BHW] elt
1519 // VADDU[BHW]M tmp, tmp
1520 // Where: [BHW] = B for size = 1, H for size = 2, W for size = 4
1521 SDValue EltVal = getI32Imm(Elt >> 1);
1522 SDNode *Tmp = CurDAG->getMachineNode(Opc1, dl, VT, EltVal);
1523 SDValue TmpVal = SDValue(Tmp, 0);
1524 return CurDAG->getMachineNode(Opc2, dl, VT, TmpVal, TmpVal);
1525
1526 } else if (Elt > 0) {
1527 // Elt is odd and positive, in the range [17,31].
1528 //
1529 // Convert: VADD_SPLAT elt, size
1530 // Into: tmp1 = VSPLTIS[BHW] elt-16
1531 // tmp2 = VSPLTIS[BHW] -16
1532 // VSUBU[BHW]M tmp1, tmp2
1533 SDValue EltVal = getI32Imm(Elt - 16);
1534 SDNode *Tmp1 = CurDAG->getMachineNode(Opc1, dl, VT, EltVal);
1535 EltVal = getI32Imm(-16);
1536 SDNode *Tmp2 = CurDAG->getMachineNode(Opc1, dl, VT, EltVal);
1537 return CurDAG->getMachineNode(Opc3, dl, VT, SDValue(Tmp1, 0),
1538 SDValue(Tmp2, 0));
1539
1540 } else {
1541 // Elt is odd and negative, in the range [-31,-17].
1542 //
1543 // Convert: VADD_SPLAT elt, size
1544 // Into: tmp1 = VSPLTIS[BHW] elt+16
1545 // tmp2 = VSPLTIS[BHW] -16
1546 // VADDU[BHW]M tmp1, tmp2
1547 SDValue EltVal = getI32Imm(Elt + 16);
1548 SDNode *Tmp1 = CurDAG->getMachineNode(Opc1, dl, VT, EltVal);
1549 EltVal = getI32Imm(-16);
1550 SDNode *Tmp2 = CurDAG->getMachineNode(Opc1, dl, VT, EltVal);
1551 return CurDAG->getMachineNode(Opc2, dl, VT, SDValue(Tmp1, 0),
1552 SDValue(Tmp2, 0));
1553 }
Bill Schmidt51e79512013-02-20 15:50:31 +00001554 }
Chris Lattner43ff01e2005-08-17 19:33:03 +00001555 }
Andrew Trickc416ba62010-12-24 04:28:06 +00001556
Dan Gohmanea6f91f2010-01-05 01:24:18 +00001557 return SelectCode(N);
Chris Lattner43ff01e2005-08-17 19:33:03 +00001558}
1559
Hal Finkel860fa902014-01-02 22:09:39 +00001560/// PostprocessISelDAG - Perform some late peephole optimizations
Bill Schmidtf5b474c2013-02-21 00:38:25 +00001561/// on the DAG representation.
1562void PPCDAGToDAGISel::PostprocessISelDAG() {
1563
1564 // Skip peepholes at -O0.
1565 if (TM.getOptLevel() == CodeGenOpt::None)
1566 return;
1567
Hal Finkel940ab932014-02-28 00:27:01 +00001568 PeepholePPC64();
1569 PeepholdCROps();
1570}
1571
Hal Finkelb9989152014-02-28 06:11:16 +00001572// Check if all users of this node will become isel where the second operand
1573// is the constant zero. If this is so, and if we can negate the condition,
1574// then we can flip the true and false operands. This will allow the zero to
1575// be folded with the isel so that we don't need to materialize a register
1576// containing zero.
1577bool PPCDAGToDAGISel::AllUsersSelectZero(SDNode *N) {
1578 // If we're not using isel, then this does not matter.
1579 if (!PPCSubTarget.hasISEL())
1580 return false;
1581
1582 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
1583 UI != UE; ++UI) {
1584 SDNode *User = *UI;
1585 if (!User->isMachineOpcode())
1586 return false;
1587 if (User->getMachineOpcode() != PPC::SELECT_I4 &&
1588 User->getMachineOpcode() != PPC::SELECT_I8)
1589 return false;
1590
1591 SDNode *Op2 = User->getOperand(2).getNode();
1592 if (!Op2->isMachineOpcode())
1593 return false;
1594
1595 if (Op2->getMachineOpcode() != PPC::LI &&
1596 Op2->getMachineOpcode() != PPC::LI8)
1597 return false;
1598
1599 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op2->getOperand(0));
1600 if (!C)
1601 return false;
1602
1603 if (!C->isNullValue())
1604 return false;
1605 }
1606
1607 return true;
1608}
1609
1610void PPCDAGToDAGISel::SwapAllSelectUsers(SDNode *N) {
1611 SmallVector<SDNode *, 4> ToReplace;
1612 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
1613 UI != UE; ++UI) {
1614 SDNode *User = *UI;
1615 assert((User->getMachineOpcode() == PPC::SELECT_I4 ||
1616 User->getMachineOpcode() == PPC::SELECT_I8) &&
1617 "Must have all select users");
1618 ToReplace.push_back(User);
1619 }
1620
1621 for (SmallVector<SDNode *, 4>::iterator UI = ToReplace.begin(),
1622 UE = ToReplace.end(); UI != UE; ++UI) {
1623 SDNode *User = *UI;
1624 SDNode *ResNode =
1625 CurDAG->getMachineNode(User->getMachineOpcode(), SDLoc(User),
1626 User->getValueType(0), User->getOperand(0),
1627 User->getOperand(2),
1628 User->getOperand(1));
1629
1630 DEBUG(dbgs() << "CR Peephole replacing:\nOld: ");
1631 DEBUG(User->dump(CurDAG));
1632 DEBUG(dbgs() << "\nNew: ");
1633 DEBUG(ResNode->dump(CurDAG));
1634 DEBUG(dbgs() << "\n");
1635
1636 ReplaceUses(User, ResNode);
1637 }
1638}
1639
Hal Finkel940ab932014-02-28 00:27:01 +00001640void PPCDAGToDAGISel::PeepholdCROps() {
1641 bool IsModified;
1642 do {
1643 IsModified = false;
1644 for (SelectionDAG::allnodes_iterator I = CurDAG->allnodes_begin(),
1645 E = CurDAG->allnodes_end(); I != E; ++I) {
1646 MachineSDNode *MachineNode = dyn_cast<MachineSDNode>(I);
1647 if (!MachineNode || MachineNode->use_empty())
1648 continue;
1649 SDNode *ResNode = MachineNode;
1650
1651 bool Op1Set = false, Op1Unset = false,
1652 Op1Not = false,
1653 Op2Set = false, Op2Unset = false,
1654 Op2Not = false;
1655
1656 unsigned Opcode = MachineNode->getMachineOpcode();
1657 switch (Opcode) {
1658 default: break;
1659 case PPC::CRAND:
1660 case PPC::CRNAND:
1661 case PPC::CROR:
1662 case PPC::CRXOR:
1663 case PPC::CRNOR:
1664 case PPC::CREQV:
1665 case PPC::CRANDC:
1666 case PPC::CRORC: {
1667 SDValue Op = MachineNode->getOperand(1);
1668 if (Op.isMachineOpcode()) {
1669 if (Op.getMachineOpcode() == PPC::CRSET)
1670 Op2Set = true;
1671 else if (Op.getMachineOpcode() == PPC::CRUNSET)
1672 Op2Unset = true;
1673 else if (Op.getMachineOpcode() == PPC::CRNOR &&
1674 Op.getOperand(0) == Op.getOperand(1))
1675 Op2Not = true;
1676 }
1677 } // fallthrough
1678 case PPC::BC:
1679 case PPC::BCn:
1680 case PPC::SELECT_I4:
1681 case PPC::SELECT_I8:
1682 case PPC::SELECT_F4:
1683 case PPC::SELECT_F8:
1684 case PPC::SELECT_VRRC: {
1685 SDValue Op = MachineNode->getOperand(0);
1686 if (Op.isMachineOpcode()) {
1687 if (Op.getMachineOpcode() == PPC::CRSET)
1688 Op1Set = true;
1689 else if (Op.getMachineOpcode() == PPC::CRUNSET)
1690 Op1Unset = true;
1691 else if (Op.getMachineOpcode() == PPC::CRNOR &&
1692 Op.getOperand(0) == Op.getOperand(1))
1693 Op1Not = true;
1694 }
1695 }
1696 break;
1697 }
1698
Hal Finkelb9989152014-02-28 06:11:16 +00001699 bool SelectSwap = false;
Hal Finkel940ab932014-02-28 00:27:01 +00001700 switch (Opcode) {
1701 default: break;
1702 case PPC::CRAND:
1703 if (MachineNode->getOperand(0) == MachineNode->getOperand(1))
1704 // x & x = x
1705 ResNode = MachineNode->getOperand(0).getNode();
1706 else if (Op1Set)
1707 // 1 & y = y
1708 ResNode = MachineNode->getOperand(1).getNode();
1709 else if (Op2Set)
1710 // x & 1 = x
1711 ResNode = MachineNode->getOperand(0).getNode();
1712 else if (Op1Unset || Op2Unset)
1713 // x & 0 = 0 & y = 0
1714 ResNode = CurDAG->getMachineNode(PPC::CRUNSET, SDLoc(MachineNode),
1715 MVT::i1);
1716 else if (Op1Not)
1717 // ~x & y = andc(y, x)
1718 ResNode = CurDAG->getMachineNode(PPC::CRANDC, SDLoc(MachineNode),
1719 MVT::i1, MachineNode->getOperand(1),
1720 MachineNode->getOperand(0).
1721 getOperand(0));
1722 else if (Op2Not)
1723 // x & ~y = andc(x, y)
1724 ResNode = CurDAG->getMachineNode(PPC::CRANDC, SDLoc(MachineNode),
1725 MVT::i1, MachineNode->getOperand(0),
1726 MachineNode->getOperand(1).
1727 getOperand(0));
Hal Finkelb9989152014-02-28 06:11:16 +00001728 else if (AllUsersSelectZero(MachineNode))
1729 ResNode = CurDAG->getMachineNode(PPC::CRNAND, SDLoc(MachineNode),
1730 MVT::i1, MachineNode->getOperand(0),
1731 MachineNode->getOperand(1)),
1732 SelectSwap = true;
Hal Finkel940ab932014-02-28 00:27:01 +00001733 break;
1734 case PPC::CRNAND:
1735 if (MachineNode->getOperand(0) == MachineNode->getOperand(1))
1736 // nand(x, x) -> nor(x, x)
1737 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1738 MVT::i1, MachineNode->getOperand(0),
1739 MachineNode->getOperand(0));
1740 else if (Op1Set)
1741 // nand(1, y) -> nor(y, y)
1742 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1743 MVT::i1, MachineNode->getOperand(1),
1744 MachineNode->getOperand(1));
1745 else if (Op2Set)
1746 // nand(x, 1) -> nor(x, x)
1747 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1748 MVT::i1, MachineNode->getOperand(0),
1749 MachineNode->getOperand(0));
1750 else if (Op1Unset || Op2Unset)
1751 // nand(x, 0) = nand(0, y) = 1
1752 ResNode = CurDAG->getMachineNode(PPC::CRSET, SDLoc(MachineNode),
1753 MVT::i1);
1754 else if (Op1Not)
1755 // nand(~x, y) = ~(~x & y) = x | ~y = orc(x, y)
1756 ResNode = CurDAG->getMachineNode(PPC::CRORC, SDLoc(MachineNode),
1757 MVT::i1, MachineNode->getOperand(0).
1758 getOperand(0),
1759 MachineNode->getOperand(1));
1760 else if (Op2Not)
1761 // nand(x, ~y) = ~x | y = orc(y, x)
1762 ResNode = CurDAG->getMachineNode(PPC::CRORC, SDLoc(MachineNode),
1763 MVT::i1, MachineNode->getOperand(1).
1764 getOperand(0),
1765 MachineNode->getOperand(0));
Hal Finkelb9989152014-02-28 06:11:16 +00001766 else if (AllUsersSelectZero(MachineNode))
1767 ResNode = CurDAG->getMachineNode(PPC::CRAND, SDLoc(MachineNode),
1768 MVT::i1, MachineNode->getOperand(0),
1769 MachineNode->getOperand(1)),
1770 SelectSwap = true;
Hal Finkel940ab932014-02-28 00:27:01 +00001771 break;
1772 case PPC::CROR:
1773 if (MachineNode->getOperand(0) == MachineNode->getOperand(1))
1774 // x | x = x
1775 ResNode = MachineNode->getOperand(0).getNode();
1776 else if (Op1Set || Op2Set)
1777 // x | 1 = 1 | y = 1
1778 ResNode = CurDAG->getMachineNode(PPC::CRSET, SDLoc(MachineNode),
1779 MVT::i1);
1780 else if (Op1Unset)
1781 // 0 | y = y
1782 ResNode = MachineNode->getOperand(1).getNode();
1783 else if (Op2Unset)
1784 // x | 0 = x
1785 ResNode = MachineNode->getOperand(0).getNode();
1786 else if (Op1Not)
1787 // ~x | y = orc(y, x)
1788 ResNode = CurDAG->getMachineNode(PPC::CRORC, SDLoc(MachineNode),
1789 MVT::i1, MachineNode->getOperand(1),
1790 MachineNode->getOperand(0).
1791 getOperand(0));
1792 else if (Op2Not)
1793 // x | ~y = orc(x, y)
1794 ResNode = CurDAG->getMachineNode(PPC::CRORC, SDLoc(MachineNode),
1795 MVT::i1, MachineNode->getOperand(0),
1796 MachineNode->getOperand(1).
1797 getOperand(0));
Hal Finkelb9989152014-02-28 06:11:16 +00001798 else if (AllUsersSelectZero(MachineNode))
1799 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1800 MVT::i1, MachineNode->getOperand(0),
1801 MachineNode->getOperand(1)),
1802 SelectSwap = true;
Hal Finkel940ab932014-02-28 00:27:01 +00001803 break;
1804 case PPC::CRXOR:
1805 if (MachineNode->getOperand(0) == MachineNode->getOperand(1))
1806 // xor(x, x) = 0
1807 ResNode = CurDAG->getMachineNode(PPC::CRUNSET, SDLoc(MachineNode),
1808 MVT::i1);
1809 else if (Op1Set)
1810 // xor(1, y) -> nor(y, y)
1811 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1812 MVT::i1, MachineNode->getOperand(1),
1813 MachineNode->getOperand(1));
1814 else if (Op2Set)
1815 // xor(x, 1) -> nor(x, x)
1816 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1817 MVT::i1, MachineNode->getOperand(0),
1818 MachineNode->getOperand(0));
1819 else if (Op1Unset)
1820 // xor(0, y) = y
1821 ResNode = MachineNode->getOperand(1).getNode();
1822 else if (Op2Unset)
1823 // xor(x, 0) = x
1824 ResNode = MachineNode->getOperand(0).getNode();
1825 else if (Op1Not)
1826 // xor(~x, y) = eqv(x, y)
1827 ResNode = CurDAG->getMachineNode(PPC::CREQV, SDLoc(MachineNode),
1828 MVT::i1, MachineNode->getOperand(0).
1829 getOperand(0),
1830 MachineNode->getOperand(1));
1831 else if (Op2Not)
1832 // xor(x, ~y) = eqv(x, y)
1833 ResNode = CurDAG->getMachineNode(PPC::CREQV, SDLoc(MachineNode),
1834 MVT::i1, MachineNode->getOperand(0),
1835 MachineNode->getOperand(1).
1836 getOperand(0));
Hal Finkelb9989152014-02-28 06:11:16 +00001837 else if (AllUsersSelectZero(MachineNode))
1838 ResNode = CurDAG->getMachineNode(PPC::CREQV, SDLoc(MachineNode),
1839 MVT::i1, MachineNode->getOperand(0),
1840 MachineNode->getOperand(1)),
1841 SelectSwap = true;
Hal Finkel940ab932014-02-28 00:27:01 +00001842 break;
1843 case PPC::CRNOR:
1844 if (Op1Set || Op2Set)
1845 // nor(1, y) -> 0
1846 ResNode = CurDAG->getMachineNode(PPC::CRUNSET, SDLoc(MachineNode),
1847 MVT::i1);
1848 else if (Op1Unset)
1849 // nor(0, y) = ~y -> nor(y, y)
1850 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1851 MVT::i1, MachineNode->getOperand(1),
1852 MachineNode->getOperand(1));
1853 else if (Op2Unset)
1854 // nor(x, 0) = ~x
1855 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1856 MVT::i1, MachineNode->getOperand(0),
1857 MachineNode->getOperand(0));
1858 else if (Op1Not)
1859 // nor(~x, y) = andc(x, y)
1860 ResNode = CurDAG->getMachineNode(PPC::CRANDC, SDLoc(MachineNode),
1861 MVT::i1, MachineNode->getOperand(0).
1862 getOperand(0),
1863 MachineNode->getOperand(1));
1864 else if (Op2Not)
1865 // nor(x, ~y) = andc(y, x)
1866 ResNode = CurDAG->getMachineNode(PPC::CRANDC, SDLoc(MachineNode),
1867 MVT::i1, MachineNode->getOperand(1).
1868 getOperand(0),
1869 MachineNode->getOperand(0));
Hal Finkelb9989152014-02-28 06:11:16 +00001870 else if (AllUsersSelectZero(MachineNode))
1871 ResNode = CurDAG->getMachineNode(PPC::CROR, SDLoc(MachineNode),
1872 MVT::i1, MachineNode->getOperand(0),
1873 MachineNode->getOperand(1)),
1874 SelectSwap = true;
Hal Finkel940ab932014-02-28 00:27:01 +00001875 break;
1876 case PPC::CREQV:
1877 if (MachineNode->getOperand(0) == MachineNode->getOperand(1))
1878 // eqv(x, x) = 1
1879 ResNode = CurDAG->getMachineNode(PPC::CRSET, SDLoc(MachineNode),
1880 MVT::i1);
1881 else if (Op1Set)
1882 // eqv(1, y) = y
1883 ResNode = MachineNode->getOperand(1).getNode();
1884 else if (Op2Set)
1885 // eqv(x, 1) = x
1886 ResNode = MachineNode->getOperand(0).getNode();
1887 else if (Op1Unset)
1888 // eqv(0, y) = ~y -> nor(y, y)
1889 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1890 MVT::i1, MachineNode->getOperand(1),
1891 MachineNode->getOperand(1));
1892 else if (Op2Unset)
1893 // eqv(x, 0) = ~x
1894 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1895 MVT::i1, MachineNode->getOperand(0),
1896 MachineNode->getOperand(0));
1897 else if (Op1Not)
1898 // eqv(~x, y) = xor(x, y)
1899 ResNode = CurDAG->getMachineNode(PPC::CRXOR, SDLoc(MachineNode),
1900 MVT::i1, MachineNode->getOperand(0).
1901 getOperand(0),
1902 MachineNode->getOperand(1));
1903 else if (Op2Not)
1904 // eqv(x, ~y) = xor(x, y)
1905 ResNode = CurDAG->getMachineNode(PPC::CRXOR, SDLoc(MachineNode),
1906 MVT::i1, MachineNode->getOperand(0),
1907 MachineNode->getOperand(1).
1908 getOperand(0));
Hal Finkelb9989152014-02-28 06:11:16 +00001909 else if (AllUsersSelectZero(MachineNode))
1910 ResNode = CurDAG->getMachineNode(PPC::CRXOR, SDLoc(MachineNode),
1911 MVT::i1, MachineNode->getOperand(0),
1912 MachineNode->getOperand(1)),
1913 SelectSwap = true;
Hal Finkel940ab932014-02-28 00:27:01 +00001914 break;
1915 case PPC::CRANDC:
1916 if (MachineNode->getOperand(0) == MachineNode->getOperand(1))
1917 // andc(x, x) = 0
1918 ResNode = CurDAG->getMachineNode(PPC::CRUNSET, SDLoc(MachineNode),
1919 MVT::i1);
1920 else if (Op1Set)
1921 // andc(1, y) = ~y
1922 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1923 MVT::i1, MachineNode->getOperand(1),
1924 MachineNode->getOperand(1));
1925 else if (Op1Unset || Op2Set)
1926 // andc(0, y) = andc(x, 1) = 0
1927 ResNode = CurDAG->getMachineNode(PPC::CRUNSET, SDLoc(MachineNode),
1928 MVT::i1);
1929 else if (Op2Unset)
1930 // andc(x, 0) = x
1931 ResNode = MachineNode->getOperand(0).getNode();
1932 else if (Op1Not)
1933 // andc(~x, y) = ~(x | y) = nor(x, y)
1934 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1935 MVT::i1, MachineNode->getOperand(0).
1936 getOperand(0),
1937 MachineNode->getOperand(1));
1938 else if (Op2Not)
1939 // andc(x, ~y) = x & y
1940 ResNode = CurDAG->getMachineNode(PPC::CRAND, SDLoc(MachineNode),
1941 MVT::i1, MachineNode->getOperand(0),
1942 MachineNode->getOperand(1).
1943 getOperand(0));
Hal Finkelb9989152014-02-28 06:11:16 +00001944 else if (AllUsersSelectZero(MachineNode))
1945 ResNode = CurDAG->getMachineNode(PPC::CRORC, SDLoc(MachineNode),
1946 MVT::i1, MachineNode->getOperand(1),
1947 MachineNode->getOperand(0)),
1948 SelectSwap = true;
Hal Finkel940ab932014-02-28 00:27:01 +00001949 break;
1950 case PPC::CRORC:
1951 if (MachineNode->getOperand(0) == MachineNode->getOperand(1))
1952 // orc(x, x) = 1
1953 ResNode = CurDAG->getMachineNode(PPC::CRSET, SDLoc(MachineNode),
1954 MVT::i1);
1955 else if (Op1Set || Op2Unset)
1956 // orc(1, y) = orc(x, 0) = 1
1957 ResNode = CurDAG->getMachineNode(PPC::CRSET, SDLoc(MachineNode),
1958 MVT::i1);
1959 else if (Op2Set)
1960 // orc(x, 1) = x
1961 ResNode = MachineNode->getOperand(0).getNode();
1962 else if (Op1Unset)
1963 // orc(0, y) = ~y
1964 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1965 MVT::i1, MachineNode->getOperand(1),
1966 MachineNode->getOperand(1));
1967 else if (Op1Not)
1968 // orc(~x, y) = ~(x & y) = nand(x, y)
1969 ResNode = CurDAG->getMachineNode(PPC::CRNAND, SDLoc(MachineNode),
1970 MVT::i1, MachineNode->getOperand(0).
1971 getOperand(0),
1972 MachineNode->getOperand(1));
1973 else if (Op2Not)
1974 // orc(x, ~y) = x | y
1975 ResNode = CurDAG->getMachineNode(PPC::CROR, SDLoc(MachineNode),
1976 MVT::i1, MachineNode->getOperand(0),
1977 MachineNode->getOperand(1).
1978 getOperand(0));
Hal Finkelb9989152014-02-28 06:11:16 +00001979 else if (AllUsersSelectZero(MachineNode))
1980 ResNode = CurDAG->getMachineNode(PPC::CRANDC, SDLoc(MachineNode),
1981 MVT::i1, MachineNode->getOperand(1),
1982 MachineNode->getOperand(0)),
1983 SelectSwap = true;
Hal Finkel940ab932014-02-28 00:27:01 +00001984 break;
1985 case PPC::SELECT_I4:
1986 case PPC::SELECT_I8:
1987 case PPC::SELECT_F4:
1988 case PPC::SELECT_F8:
1989 case PPC::SELECT_VRRC:
1990 if (Op1Set)
1991 ResNode = MachineNode->getOperand(1).getNode();
1992 else if (Op1Unset)
1993 ResNode = MachineNode->getOperand(2).getNode();
1994 else if (Op1Not)
1995 ResNode = CurDAG->getMachineNode(MachineNode->getMachineOpcode(),
1996 SDLoc(MachineNode),
1997 MachineNode->getValueType(0),
1998 MachineNode->getOperand(0).
1999 getOperand(0),
2000 MachineNode->getOperand(2),
2001 MachineNode->getOperand(1));
2002 break;
2003 case PPC::BC:
2004 case PPC::BCn:
2005 if (Op1Not)
2006 ResNode = CurDAG->getMachineNode(Opcode == PPC::BC ? PPC::BCn :
2007 PPC::BC,
2008 SDLoc(MachineNode),
2009 MVT::Other,
2010 MachineNode->getOperand(0).
2011 getOperand(0),
2012 MachineNode->getOperand(1),
2013 MachineNode->getOperand(2));
2014 // FIXME: Handle Op1Set, Op1Unset here too.
2015 break;
2016 }
2017
Hal Finkelb9989152014-02-28 06:11:16 +00002018 // If we're inverting this node because it is used only by selects that
2019 // we'd like to swap, then swap the selects before the node replacement.
2020 if (SelectSwap)
2021 SwapAllSelectUsers(MachineNode);
2022
Hal Finkel940ab932014-02-28 00:27:01 +00002023 if (ResNode != MachineNode) {
2024 DEBUG(dbgs() << "CR Peephole replacing:\nOld: ");
2025 DEBUG(MachineNode->dump(CurDAG));
2026 DEBUG(dbgs() << "\nNew: ");
2027 DEBUG(ResNode->dump(CurDAG));
2028 DEBUG(dbgs() << "\n");
2029
2030 ReplaceUses(MachineNode, ResNode);
2031 IsModified = true;
2032 }
2033 }
2034 if (IsModified)
2035 CurDAG->RemoveDeadNodes();
2036 } while (IsModified);
2037}
2038
2039void PPCDAGToDAGISel::PeepholePPC64() {
Bill Schmidtf5b474c2013-02-21 00:38:25 +00002040 // These optimizations are currently supported only for 64-bit SVR4.
2041 if (PPCSubTarget.isDarwin() || !PPCSubTarget.isPPC64())
2042 return;
2043
2044 SelectionDAG::allnodes_iterator Position(CurDAG->getRoot().getNode());
2045 ++Position;
2046
2047 while (Position != CurDAG->allnodes_begin()) {
2048 SDNode *N = --Position;
2049 // Skip dead nodes and any non-machine opcodes.
2050 if (N->use_empty() || !N->isMachineOpcode())
2051 continue;
2052
2053 unsigned FirstOp;
2054 unsigned StorageOpcode = N->getMachineOpcode();
2055
2056 switch (StorageOpcode) {
2057 default: continue;
2058
2059 case PPC::LBZ:
2060 case PPC::LBZ8:
2061 case PPC::LD:
2062 case PPC::LFD:
2063 case PPC::LFS:
2064 case PPC::LHA:
2065 case PPC::LHA8:
2066 case PPC::LHZ:
2067 case PPC::LHZ8:
2068 case PPC::LWA:
2069 case PPC::LWZ:
2070 case PPC::LWZ8:
2071 FirstOp = 0;
2072 break;
2073
2074 case PPC::STB:
2075 case PPC::STB8:
2076 case PPC::STD:
2077 case PPC::STFD:
2078 case PPC::STFS:
2079 case PPC::STH:
2080 case PPC::STH8:
2081 case PPC::STW:
2082 case PPC::STW8:
2083 FirstOp = 1;
2084 break;
2085 }
2086
2087 // If this is a load or store with a zero offset, we may be able to
2088 // fold an add-immediate into the memory operation.
2089 if (!isa<ConstantSDNode>(N->getOperand(FirstOp)) ||
2090 N->getConstantOperandVal(FirstOp) != 0)
2091 continue;
2092
2093 SDValue Base = N->getOperand(FirstOp + 1);
2094 if (!Base.isMachineOpcode())
2095 continue;
2096
2097 unsigned Flags = 0;
2098 bool ReplaceFlags = true;
2099
2100 // When the feeding operation is an add-immediate of some sort,
2101 // determine whether we need to add relocation information to the
2102 // target flags on the immediate operand when we fold it into the
2103 // load instruction.
2104 //
2105 // For something like ADDItocL, the relocation information is
2106 // inferred from the opcode; when we process it in the AsmPrinter,
2107 // we add the necessary relocation there. A load, though, can receive
2108 // relocation from various flavors of ADDIxxx, so we need to carry
2109 // the relocation information in the target flags.
2110 switch (Base.getMachineOpcode()) {
2111 default: continue;
2112
2113 case PPC::ADDI8:
Ulrich Weigand35f9fdf2013-03-26 10:55:20 +00002114 case PPC::ADDI:
Bill Schmidtf5b474c2013-02-21 00:38:25 +00002115 // In some cases (such as TLS) the relocation information
2116 // is already in place on the operand, so copying the operand
2117 // is sufficient.
2118 ReplaceFlags = false;
2119 // For these cases, the immediate may not be divisible by 4, in
2120 // which case the fold is illegal for DS-form instructions. (The
2121 // other cases provide aligned addresses and are always safe.)
2122 if ((StorageOpcode == PPC::LWA ||
2123 StorageOpcode == PPC::LD ||
2124 StorageOpcode == PPC::STD) &&
2125 (!isa<ConstantSDNode>(Base.getOperand(1)) ||
2126 Base.getConstantOperandVal(1) % 4 != 0))
2127 continue;
2128 break;
2129 case PPC::ADDIdtprelL:
Ulrich Weigandd51c09f2013-06-21 14:42:20 +00002130 Flags = PPCII::MO_DTPREL_LO;
Bill Schmidtf5b474c2013-02-21 00:38:25 +00002131 break;
2132 case PPC::ADDItlsldL:
Ulrich Weigandd51c09f2013-06-21 14:42:20 +00002133 Flags = PPCII::MO_TLSLD_LO;
Bill Schmidtf5b474c2013-02-21 00:38:25 +00002134 break;
2135 case PPC::ADDItocL:
Ulrich Weigandd51c09f2013-06-21 14:42:20 +00002136 Flags = PPCII::MO_TOC_LO;
Bill Schmidtf5b474c2013-02-21 00:38:25 +00002137 break;
2138 }
2139
2140 // We found an opportunity. Reverse the operands from the add
2141 // immediate and substitute them into the load or store. If
2142 // needed, update the target flags for the immediate operand to
2143 // reflect the necessary relocation information.
2144 DEBUG(dbgs() << "Folding add-immediate into mem-op:\nBase: ");
2145 DEBUG(Base->dump(CurDAG));
2146 DEBUG(dbgs() << "\nN: ");
2147 DEBUG(N->dump(CurDAG));
2148 DEBUG(dbgs() << "\n");
2149
2150 SDValue ImmOpnd = Base.getOperand(1);
2151
2152 // If the relocation information isn't already present on the
2153 // immediate operand, add it now.
2154 if (ReplaceFlags) {
Bill Schmidt49498da2013-02-21 14:35:42 +00002155 if (GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(ImmOpnd)) {
Andrew Trickef9de2a2013-05-25 02:42:55 +00002156 SDLoc dl(GA);
Bill Schmidtf5b474c2013-02-21 00:38:25 +00002157 const GlobalValue *GV = GA->getGlobal();
Bill Schmidt48fc20a2013-07-01 20:52:27 +00002158 // We can't perform this optimization for data whose alignment
2159 // is insufficient for the instruction encoding.
2160 if (GV->getAlignment() < 4 &&
2161 (StorageOpcode == PPC::LD || StorageOpcode == PPC::STD ||
2162 StorageOpcode == PPC::LWA)) {
2163 DEBUG(dbgs() << "Rejected this candidate for alignment.\n\n");
2164 continue;
2165 }
Bill Schmidtf5b474c2013-02-21 00:38:25 +00002166 ImmOpnd = CurDAG->getTargetGlobalAddress(GV, dl, MVT::i64, 0, Flags);
Bill Schmidt836c45b2013-02-21 17:26:05 +00002167 } else if (ConstantPoolSDNode *CP =
2168 dyn_cast<ConstantPoolSDNode>(ImmOpnd)) {
Bill Schmidt49498da2013-02-21 14:35:42 +00002169 const Constant *C = CP->getConstVal();
2170 ImmOpnd = CurDAG->getTargetConstantPool(C, MVT::i64,
2171 CP->getAlignment(),
2172 0, Flags);
Bill Schmidtf5b474c2013-02-21 00:38:25 +00002173 }
2174 }
2175
2176 if (FirstOp == 1) // Store
2177 (void)CurDAG->UpdateNodeOperands(N, N->getOperand(0), ImmOpnd,
2178 Base.getOperand(0), N->getOperand(3));
2179 else // Load
2180 (void)CurDAG->UpdateNodeOperands(N, ImmOpnd, Base.getOperand(0),
2181 N->getOperand(2));
2182
2183 // The add-immediate may now be dead, in which case remove it.
2184 if (Base.getNode()->use_empty())
2185 CurDAG->RemoveDeadNode(Base.getNode());
2186 }
2187}
Chris Lattner43ff01e2005-08-17 19:33:03 +00002188
Chris Lattnerb055c872006-06-10 01:15:02 +00002189
Andrew Trickc416ba62010-12-24 04:28:06 +00002190/// createPPCISelDag - This pass converts a legalized DAG into a
Chris Lattner43ff01e2005-08-17 19:33:03 +00002191/// PowerPC-specific DAG, ready for instruction scheduling.
2192///
Evan Cheng2dd2c652006-03-13 23:20:37 +00002193FunctionPass *llvm::createPPCISelDag(PPCTargetMachine &TM) {
Nate Begeman0b71e002005-10-18 00:28:58 +00002194 return new PPCDAGToDAGISel(TM);
Chris Lattner43ff01e2005-08-17 19:33:03 +00002195}
2196
Krzysztof Parzyszek2680b532013-02-13 17:40:07 +00002197static void initializePassOnce(PassRegistry &Registry) {
2198 const char *Name = "PowerPC DAG->DAG Pattern Instruction Selection";
2199 PassInfo *PI = new PassInfo(Name, "ppc-codegen", &SelectionDAGISel::ID, 0,
2200 false, false);
2201 Registry.registerPass(*PI, true);
2202}
2203
2204void llvm::initializePPCDAGToDAGISelPass(PassRegistry &Registry) {
2205 CALL_ONCE_INITIALIZATION(initializePassOnce);
2206}
2207