blob: 44821d31b5194a9fc69171fe679dd5409eff5784 [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) {
Craig Topperabadc662012-04-20 06:31:50 +0000275 GlobalBaseReg = RegInfo->createVirtualRegister(&PPC::GPRCRegClass);
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 {
Craig Topperabadc662012-04-20 06:31:50 +0000279 GlobalBaseReg = RegInfo->createVirtualRegister(&PPC::G8RCRegClass);
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!");
Chris Lattner97b3da12006-06-27 00:04:13 +0000575 Opc = 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).
643static unsigned int getVCmpInst(MVT::SimpleValueType VecVT, ISD::CondCode CC) {
644 switch (CC) {
645 case ISD::SETEQ:
646 case ISD::SETUEQ:
647 case ISD::SETNE:
648 case ISD::SETUNE:
649 if (VecVT == MVT::v16i8)
650 return PPC::VCMPEQUB;
651 else if (VecVT == MVT::v8i16)
652 return PPC::VCMPEQUH;
653 else if (VecVT == MVT::v4i32)
654 return PPC::VCMPEQUW;
655 // v4f32 != v4f32 could be translate to unordered not equal
656 else if (VecVT == MVT::v4f32)
657 return PPC::VCMPEQFP;
658 break;
659 case ISD::SETLT:
660 case ISD::SETGT:
661 case ISD::SETLE:
662 case ISD::SETGE:
663 if (VecVT == MVT::v16i8)
664 return PPC::VCMPGTSB;
665 else if (VecVT == MVT::v8i16)
666 return PPC::VCMPGTSH;
667 else if (VecVT == MVT::v4i32)
668 return PPC::VCMPGTSW;
669 else if (VecVT == MVT::v4f32)
670 return PPC::VCMPGTFP;
671 break;
672 case ISD::SETULT:
673 case ISD::SETUGT:
674 case ISD::SETUGE:
675 case ISD::SETULE:
676 if (VecVT == MVT::v16i8)
677 return PPC::VCMPGTUB;
678 else if (VecVT == MVT::v8i16)
679 return PPC::VCMPGTUH;
680 else if (VecVT == MVT::v4i32)
681 return PPC::VCMPGTUW;
682 break;
683 case ISD::SETOEQ:
684 if (VecVT == MVT::v4f32)
685 return PPC::VCMPEQFP;
686 break;
687 case ISD::SETOLT:
688 case ISD::SETOGT:
689 case ISD::SETOLE:
690 if (VecVT == MVT::v4f32)
691 return PPC::VCMPGTFP;
692 break;
693 case ISD::SETOGE:
694 if (VecVT == MVT::v4f32)
695 return PPC::VCMPGEFP;
696 break;
697 default:
698 break;
699 }
700 llvm_unreachable("Invalid integer vector compare condition");
701}
702
703// getVCmpEQInst: return the equal compare instruction for the specified vector
704// type. Since this is for altivec specific code, only support the altivec
705// types (v16i8, v8i16, v4i32, and v4f32).
706static unsigned int getVCmpEQInst(MVT::SimpleValueType VecVT) {
707 switch (VecVT) {
708 case MVT::v16i8:
709 return PPC::VCMPEQUB;
710 case MVT::v8i16:
711 return PPC::VCMPEQUH;
712 case MVT::v4i32:
713 return PPC::VCMPEQUW;
714 case MVT::v4f32:
715 return PPC::VCMPEQFP;
716 default:
717 llvm_unreachable("Invalid integer vector compare condition");
718 }
719}
720
721
Dan Gohmanea6f91f2010-01-05 01:24:18 +0000722SDNode *PPCDAGToDAGISel::SelectSETCC(SDNode *N) {
Andrew Trickef9de2a2013-05-25 02:42:55 +0000723 SDLoc dl(N);
Chris Lattner491b8292005-10-06 19:03:35 +0000724 unsigned Imm;
725 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(2))->get();
Roman Divacky254f8212011-06-20 15:28:39 +0000726 EVT PtrVT = CurDAG->getTargetLoweringInfo().getPointerTy();
727 bool isPPC64 = (PtrVT == MVT::i64);
728
Hal Finkel940ab932014-02-28 00:27:01 +0000729 if (!PPCSubTarget.useCRBits() &&
730 isInt32Immediate(N->getOperand(1), Imm)) {
Chris Lattner491b8292005-10-06 19:03:35 +0000731 // We can codegen setcc op, imm very efficiently compared to a brcond.
732 // Check for those cases here.
733 // setcc op, 0
734 if (Imm == 0) {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000735 SDValue Op = N->getOperand(0);
Chris Lattner491b8292005-10-06 19:03:35 +0000736 switch (CC) {
Chris Lattnere2969492005-10-21 21:17:10 +0000737 default: break;
Evan Chengc3acfc02006-08-27 08:14:06 +0000738 case ISD::SETEQ: {
Dan Gohman32f71d72009-09-25 18:54:59 +0000739 Op = SDValue(CurDAG->getMachineNode(PPC::CNTLZW, dl, MVT::i32, Op), 0);
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000740 SDValue Ops[] = { Op, getI32Imm(27), getI32Imm(5), getI32Imm(31) };
Owen Anderson9f944592009-08-11 20:47:22 +0000741 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
Evan Chengc3acfc02006-08-27 08:14:06 +0000742 }
Chris Lattnere2969492005-10-21 21:17:10 +0000743 case ISD::SETNE: {
Roman Divacky254f8212011-06-20 15:28:39 +0000744 if (isPPC64) break;
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000745 SDValue AD =
Chris Lattner3e5fbd72010-12-21 02:38:05 +0000746 SDValue(CurDAG->getMachineNode(PPC::ADDIC, dl, MVT::i32, MVT::Glue,
Dan Gohman32f71d72009-09-25 18:54:59 +0000747 Op, getI32Imm(~0U)), 0);
Andrew Trickc416ba62010-12-24 04:28:06 +0000748 return CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, AD, Op,
Evan Cheng34b70ee2006-08-26 08:00:10 +0000749 AD.getValue(1));
Chris Lattner491b8292005-10-06 19:03:35 +0000750 }
Evan Chengc3acfc02006-08-27 08:14:06 +0000751 case ISD::SETLT: {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000752 SDValue Ops[] = { Op, getI32Imm(1), getI32Imm(31), 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::SETGT: {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000756 SDValue T =
Dan Gohman32f71d72009-09-25 18:54:59 +0000757 SDValue(CurDAG->getMachineNode(PPC::NEG, dl, MVT::i32, Op), 0);
758 T = SDValue(CurDAG->getMachineNode(PPC::ANDC, dl, MVT::i32, T, Op), 0);
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000759 SDValue Ops[] = { T, getI32Imm(1), getI32Imm(31), getI32Imm(31) };
Owen Anderson9f944592009-08-11 20:47:22 +0000760 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
Chris Lattnere2969492005-10-21 21:17:10 +0000761 }
762 }
Chris Lattner491b8292005-10-06 19:03:35 +0000763 } else if (Imm == ~0U) { // setcc op, -1
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000764 SDValue Op = N->getOperand(0);
Chris Lattner491b8292005-10-06 19:03:35 +0000765 switch (CC) {
Chris Lattnere2969492005-10-21 21:17:10 +0000766 default: break;
767 case ISD::SETEQ:
Roman Divacky254f8212011-06-20 15:28:39 +0000768 if (isPPC64) break;
Chris Lattner3e5fbd72010-12-21 02:38:05 +0000769 Op = SDValue(CurDAG->getMachineNode(PPC::ADDIC, dl, MVT::i32, MVT::Glue,
Dan Gohman32f71d72009-09-25 18:54:59 +0000770 Op, getI32Imm(1)), 0);
Andrew Trickc416ba62010-12-24 04:28:06 +0000771 return CurDAG->SelectNodeTo(N, PPC::ADDZE, MVT::i32,
772 SDValue(CurDAG->getMachineNode(PPC::LI, dl,
Dan Gohman32f71d72009-09-25 18:54:59 +0000773 MVT::i32,
774 getI32Imm(0)), 0),
Dale Johannesenf08a47b2009-02-04 23:02:30 +0000775 Op.getValue(1));
Chris Lattnere2969492005-10-21 21:17:10 +0000776 case ISD::SETNE: {
Roman Divacky254f8212011-06-20 15:28:39 +0000777 if (isPPC64) break;
Dan Gohman32f71d72009-09-25 18:54:59 +0000778 Op = SDValue(CurDAG->getMachineNode(PPC::NOR, dl, MVT::i32, Op, Op), 0);
Chris Lattner3e5fbd72010-12-21 02:38:05 +0000779 SDNode *AD = CurDAG->getMachineNode(PPC::ADDIC, dl, MVT::i32, MVT::Glue,
Dan Gohman32f71d72009-09-25 18:54:59 +0000780 Op, getI32Imm(~0U));
Owen Anderson9f944592009-08-11 20:47:22 +0000781 return CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, SDValue(AD, 0),
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000782 Op, SDValue(AD, 1));
Chris Lattner491b8292005-10-06 19:03:35 +0000783 }
Chris Lattnere2969492005-10-21 21:17:10 +0000784 case ISD::SETLT: {
Dan Gohman32f71d72009-09-25 18:54:59 +0000785 SDValue AD = SDValue(CurDAG->getMachineNode(PPC::ADDI, dl, MVT::i32, Op,
786 getI32Imm(1)), 0);
787 SDValue AN = SDValue(CurDAG->getMachineNode(PPC::AND, dl, MVT::i32, AD,
788 Op), 0);
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000789 SDValue Ops[] = { AN, getI32Imm(1), getI32Imm(31), getI32Imm(31) };
Owen Anderson9f944592009-08-11 20:47:22 +0000790 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
Chris Lattnere2969492005-10-21 21:17:10 +0000791 }
Evan Chengc3acfc02006-08-27 08:14:06 +0000792 case ISD::SETGT: {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000793 SDValue Ops[] = { Op, getI32Imm(1), getI32Imm(31), getI32Imm(31) };
Michael Liaob53d8962013-04-19 22:22:57 +0000794 Op = SDValue(CurDAG->getMachineNode(PPC::RLWINM, dl, MVT::i32, Ops),
Dale Johannesenf08a47b2009-02-04 23:02:30 +0000795 0);
Andrew Trickc416ba62010-12-24 04:28:06 +0000796 return CurDAG->SelectNodeTo(N, PPC::XORI, MVT::i32, Op,
Evan Cheng34b70ee2006-08-26 08:00:10 +0000797 getI32Imm(1));
Chris Lattnere2969492005-10-21 21:17:10 +0000798 }
Evan Chengc3acfc02006-08-27 08:14:06 +0000799 }
Chris Lattner491b8292005-10-06 19:03:35 +0000800 }
801 }
Andrew Trickc416ba62010-12-24 04:28:06 +0000802
Adhemerval Zanellafe3f7932012-10-08 18:59:53 +0000803 SDValue LHS = N->getOperand(0);
804 SDValue RHS = N->getOperand(1);
805
Adhemerval Zanella56775e02012-10-30 13:50:19 +0000806 // Altivec Vector compare instructions do not set any CR register by default and
807 // vector compare operations return the same type as the operands.
Adhemerval Zanellafe3f7932012-10-08 18:59:53 +0000808 if (LHS.getValueType().isVector()) {
Adhemerval Zanella56775e02012-10-30 13:50:19 +0000809 EVT VecVT = LHS.getValueType();
810 MVT::SimpleValueType VT = VecVT.getSimpleVT().SimpleTy;
811 unsigned int VCmpInst = getVCmpInst(VT, CC);
812
813 switch (CC) {
814 case ISD::SETEQ:
815 case ISD::SETOEQ:
816 case ISD::SETUEQ:
817 return CurDAG->SelectNodeTo(N, VCmpInst, VecVT, LHS, RHS);
818 case ISD::SETNE:
819 case ISD::SETONE:
820 case ISD::SETUNE: {
821 SDValue VCmp(CurDAG->getMachineNode(VCmpInst, dl, VecVT, LHS, RHS), 0);
822 return CurDAG->SelectNodeTo(N, PPC::VNOR, VecVT, VCmp, VCmp);
823 }
824 case ISD::SETLT:
825 case ISD::SETOLT:
826 case ISD::SETULT:
827 return CurDAG->SelectNodeTo(N, VCmpInst, VecVT, RHS, LHS);
828 case ISD::SETGT:
829 case ISD::SETOGT:
830 case ISD::SETUGT:
831 return CurDAG->SelectNodeTo(N, VCmpInst, VecVT, LHS, RHS);
832 case ISD::SETGE:
833 case ISD::SETOGE:
834 case ISD::SETUGE: {
835 // Small optimization: Altivec provides a 'Vector Compare Greater Than
836 // or Equal To' instruction (vcmpgefp), so in this case there is no
837 // need for extra logic for the equal compare.
838 if (VecVT.getSimpleVT().isFloatingPoint()) {
839 return CurDAG->SelectNodeTo(N, VCmpInst, VecVT, LHS, RHS);
840 } else {
841 SDValue VCmpGT(CurDAG->getMachineNode(VCmpInst, dl, VecVT, LHS, RHS), 0);
842 unsigned int VCmpEQInst = getVCmpEQInst(VT);
843 SDValue VCmpEQ(CurDAG->getMachineNode(VCmpEQInst, dl, VecVT, LHS, RHS), 0);
844 return CurDAG->SelectNodeTo(N, PPC::VOR, VecVT, VCmpGT, VCmpEQ);
845 }
846 }
847 case ISD::SETLE:
848 case ISD::SETOLE:
849 case ISD::SETULE: {
850 SDValue VCmpLE(CurDAG->getMachineNode(VCmpInst, dl, VecVT, RHS, LHS), 0);
851 unsigned int VCmpEQInst = getVCmpEQInst(VT);
852 SDValue VCmpEQ(CurDAG->getMachineNode(VCmpEQInst, dl, VecVT, LHS, RHS), 0);
853 return CurDAG->SelectNodeTo(N, PPC::VOR, VecVT, VCmpLE, VCmpEQ);
854 }
855 default:
856 llvm_unreachable("Invalid vector compare type: should be expanded by legalize");
857 }
Adhemerval Zanellafe3f7932012-10-08 18:59:53 +0000858 }
859
Hal Finkel940ab932014-02-28 00:27:01 +0000860 if (PPCSubTarget.useCRBits())
861 return 0;
862
Chris Lattner491b8292005-10-06 19:03:35 +0000863 bool Inv;
Ulrich Weigand47e93282013-07-03 15:13:30 +0000864 unsigned Idx = getCRIdxForSetCC(CC, Inv);
Adhemerval Zanellafe3f7932012-10-08 18:59:53 +0000865 SDValue CCReg = SelectCC(LHS, RHS, CC, dl);
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000866 SDValue IntCR;
Andrew Trickc416ba62010-12-24 04:28:06 +0000867
Chris Lattner491b8292005-10-06 19:03:35 +0000868 // Force the ccreg into CR7.
Owen Anderson9f944592009-08-11 20:47:22 +0000869 SDValue CR7Reg = CurDAG->getRegister(PPC::CR7, MVT::i32);
Andrew Trickc416ba62010-12-24 04:28:06 +0000870
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000871 SDValue InFlag(0, 0); // Null incoming flag value.
Andrew Trickc416ba62010-12-24 04:28:06 +0000872 CCReg = CurDAG->getCopyToReg(CurDAG->getEntryNode(), dl, CR7Reg, CCReg,
Chris Lattnerbd099102005-12-01 03:50:19 +0000873 InFlag).getValue(1);
Andrew Trickc416ba62010-12-24 04:28:06 +0000874
Ulrich Weigandd5ebc622013-07-03 17:05:42 +0000875 IntCR = SDValue(CurDAG->getMachineNode(PPC::MFOCRF, dl, MVT::i32, CR7Reg,
876 CCReg), 0);
Andrew Trickc416ba62010-12-24 04:28:06 +0000877
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000878 SDValue Ops[] = { IntCR, getI32Imm((32-(3-Idx)) & 31),
Evan Chengc3acfc02006-08-27 08:14:06 +0000879 getI32Imm(31), getI32Imm(31) };
Ulrich Weigand47e93282013-07-03 15:13:30 +0000880 if (!Inv)
Owen Anderson9f944592009-08-11 20:47:22 +0000881 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
Chris Lattner89f36e62008-01-08 06:46:30 +0000882
883 // Get the specified bit.
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000884 SDValue Tmp =
Michael Liaob53d8962013-04-19 22:22:57 +0000885 SDValue(CurDAG->getMachineNode(PPC::RLWINM, dl, MVT::i32, Ops), 0);
Ulrich Weigand47e93282013-07-03 15:13:30 +0000886 return CurDAG->SelectNodeTo(N, PPC::XORI, MVT::i32, Tmp, getI32Imm(1));
Chris Lattner491b8292005-10-06 19:03:35 +0000887}
Chris Lattner502a3692005-10-06 18:56:10 +0000888
Chris Lattner318622f2005-10-06 19:07:45 +0000889
Chris Lattner43ff01e2005-08-17 19:33:03 +0000890// Select - Convert the specified operand from a target-independent to a
891// target-specific node if it hasn't already been changed.
Dan Gohmanea6f91f2010-01-05 01:24:18 +0000892SDNode *PPCDAGToDAGISel::Select(SDNode *N) {
Andrew Trickef9de2a2013-05-25 02:42:55 +0000893 SDLoc dl(N);
Tim Northover31d093c2013-09-22 08:21:56 +0000894 if (N->isMachineOpcode()) {
895 N->setNodeId(-1);
Evan Chengbd1c5a82006-08-11 09:08:15 +0000896 return NULL; // Already selected.
Tim Northover31d093c2013-09-22 08:21:56 +0000897 }
Chris Lattner08c319f2005-09-29 00:59:32 +0000898
Chris Lattner43ff01e2005-08-17 19:33:03 +0000899 switch (N->getOpcode()) {
Chris Lattner498915d2005-09-07 23:45:15 +0000900 default: break;
Andrew Trickc416ba62010-12-24 04:28:06 +0000901
Jim Laskey095e6f32006-12-12 13:23:43 +0000902 case ISD::Constant: {
Owen Anderson9f944592009-08-11 20:47:22 +0000903 if (N->getValueType(0) == MVT::i64) {
Jim Laskey095e6f32006-12-12 13:23:43 +0000904 // Get 64 bit value.
Dan Gohmaneffb8942008-09-12 16:56:44 +0000905 int64_t Imm = cast<ConstantSDNode>(N)->getZExtValue();
Jim Laskey095e6f32006-12-12 13:23:43 +0000906 // Assume no remaining bits.
907 unsigned Remainder = 0;
908 // Assume no shift required.
909 unsigned Shift = 0;
Andrew Trickc416ba62010-12-24 04:28:06 +0000910
Jim Laskey095e6f32006-12-12 13:23:43 +0000911 // If it can't be represented as a 32 bit value.
Benjamin Kramer2788f792010-03-29 21:13:41 +0000912 if (!isInt<32>(Imm)) {
Michael J. Spencerdf1ecbd72013-05-24 22:23:49 +0000913 Shift = countTrailingZeros<uint64_t>(Imm);
Jim Laskey095e6f32006-12-12 13:23:43 +0000914 int64_t ImmSh = static_cast<uint64_t>(Imm) >> Shift;
Andrew Trickc416ba62010-12-24 04:28:06 +0000915
Jim Laskey095e6f32006-12-12 13:23:43 +0000916 // If the shifted value fits 32 bits.
Benjamin Kramer2788f792010-03-29 21:13:41 +0000917 if (isInt<32>(ImmSh)) {
Jim Laskey095e6f32006-12-12 13:23:43 +0000918 // Go with the shifted value.
919 Imm = ImmSh;
920 } else {
921 // Still stuck with a 64 bit value.
922 Remainder = Imm;
923 Shift = 32;
924 Imm >>= 32;
925 }
926 }
Andrew Trickc416ba62010-12-24 04:28:06 +0000927
Jim Laskey095e6f32006-12-12 13:23:43 +0000928 // Intermediate operand.
929 SDNode *Result;
930
931 // Handle first 32 bits.
932 unsigned Lo = Imm & 0xFFFF;
933 unsigned Hi = (Imm >> 16) & 0xFFFF;
Andrew Trickc416ba62010-12-24 04:28:06 +0000934
Jim Laskey095e6f32006-12-12 13:23:43 +0000935 // Simple value.
Benjamin Kramer2788f792010-03-29 21:13:41 +0000936 if (isInt<16>(Imm)) {
Jim Laskey095e6f32006-12-12 13:23:43 +0000937 // Just the Lo bits.
Dan Gohman32f71d72009-09-25 18:54:59 +0000938 Result = CurDAG->getMachineNode(PPC::LI8, dl, MVT::i64, getI32Imm(Lo));
Jim Laskey095e6f32006-12-12 13:23:43 +0000939 } else if (Lo) {
940 // Handle the Hi bits.
941 unsigned OpC = Hi ? PPC::LIS8 : PPC::LI8;
Dan Gohman32f71d72009-09-25 18:54:59 +0000942 Result = CurDAG->getMachineNode(OpC, dl, MVT::i64, getI32Imm(Hi));
Jim Laskey095e6f32006-12-12 13:23:43 +0000943 // And Lo bits.
Dan Gohman32f71d72009-09-25 18:54:59 +0000944 Result = CurDAG->getMachineNode(PPC::ORI8, dl, MVT::i64,
945 SDValue(Result, 0), getI32Imm(Lo));
Jim Laskey095e6f32006-12-12 13:23:43 +0000946 } else {
947 // Just the Hi bits.
Dan Gohman32f71d72009-09-25 18:54:59 +0000948 Result = CurDAG->getMachineNode(PPC::LIS8, dl, MVT::i64, getI32Imm(Hi));
Jim Laskey095e6f32006-12-12 13:23:43 +0000949 }
Andrew Trickc416ba62010-12-24 04:28:06 +0000950
Jim Laskey095e6f32006-12-12 13:23:43 +0000951 // If no shift, we're done.
952 if (!Shift) return Result;
953
954 // Shift for next step if the upper 32-bits were not zero.
955 if (Imm) {
Dan Gohman32f71d72009-09-25 18:54:59 +0000956 Result = CurDAG->getMachineNode(PPC::RLDICR, dl, MVT::i64,
957 SDValue(Result, 0),
958 getI32Imm(Shift),
959 getI32Imm(63 - Shift));
Jim Laskey095e6f32006-12-12 13:23:43 +0000960 }
961
962 // Add in the last bits as required.
963 if ((Hi = (Remainder >> 16) & 0xFFFF)) {
Dan Gohman32f71d72009-09-25 18:54:59 +0000964 Result = CurDAG->getMachineNode(PPC::ORIS8, dl, MVT::i64,
965 SDValue(Result, 0), getI32Imm(Hi));
Andrew Trickc416ba62010-12-24 04:28:06 +0000966 }
Jim Laskey095e6f32006-12-12 13:23:43 +0000967 if ((Lo = Remainder & 0xFFFF)) {
Dan Gohman32f71d72009-09-25 18:54:59 +0000968 Result = CurDAG->getMachineNode(PPC::ORI8, dl, MVT::i64,
969 SDValue(Result, 0), getI32Imm(Lo));
Jim Laskey095e6f32006-12-12 13:23:43 +0000970 }
Andrew Trickc416ba62010-12-24 04:28:06 +0000971
Jim Laskey095e6f32006-12-12 13:23:43 +0000972 return Result;
973 }
974 break;
975 }
Andrew Trickc416ba62010-12-24 04:28:06 +0000976
Hal Finkel940ab932014-02-28 00:27:01 +0000977 case ISD::SETCC: {
978 SDNode *SN = SelectSETCC(N);
979 if (SN)
980 return SN;
981 break;
982 }
Evan Cheng6dc90ca2006-02-09 00:37:58 +0000983 case PPCISD::GlobalBaseReg:
Evan Cheng61413a32006-08-26 05:34:46 +0000984 return getGlobalBaseReg();
Andrew Trickc416ba62010-12-24 04:28:06 +0000985
Chris Lattnere4c338d2005-08-25 00:45:43 +0000986 case ISD::FrameIndex: {
987 int FI = cast<FrameIndexSDNode>(N)->getIndex();
Dan Gohmanea6f91f2010-01-05 01:24:18 +0000988 SDValue TFI = CurDAG->getTargetFrameIndex(FI, N->getValueType(0));
989 unsigned Opc = N->getValueType(0) == MVT::i32 ? PPC::ADDI : PPC::ADDI8;
Chris Lattnerbc485fd2006-08-15 23:48:22 +0000990 if (N->hasOneUse())
Dan Gohmanea6f91f2010-01-05 01:24:18 +0000991 return CurDAG->SelectNodeTo(N, Opc, N->getValueType(0), TFI,
Evan Cheng34b70ee2006-08-26 08:00:10 +0000992 getSmallIPtrImm(0));
Dan Gohmanea6f91f2010-01-05 01:24:18 +0000993 return CurDAG->getMachineNode(Opc, dl, N->getValueType(0), TFI,
Dan Gohman32f71d72009-09-25 18:54:59 +0000994 getSmallIPtrImm(0));
Chris Lattnere4c338d2005-08-25 00:45:43 +0000995 }
Chris Lattner6961fc72006-03-26 10:06:40 +0000996
Ulrich Weigandd5ebc622013-07-03 17:05:42 +0000997 case PPCISD::MFOCRF: {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +0000998 SDValue InFlag = N->getOperand(1);
Ulrich Weigandd5ebc622013-07-03 17:05:42 +0000999 return CurDAG->getMachineNode(PPC::MFOCRF, dl, MVT::i32,
1000 N->getOperand(0), InFlag);
Chris Lattner6961fc72006-03-26 10:06:40 +00001001 }
Andrew Trickc416ba62010-12-24 04:28:06 +00001002
Chris Lattner57693112005-09-28 22:50:24 +00001003 case ISD::SDIV: {
Nate Begeman4dd38312005-10-21 00:02:42 +00001004 // FIXME: since this depends on the setting of the carry flag from the srawi
1005 // we should really be making notes about that for the scheduler.
Andrew Trickc416ba62010-12-24 04:28:06 +00001006 // FIXME: It sure would be nice if we could cheaply recognize the
Nate Begeman4dd38312005-10-21 00:02:42 +00001007 // srl/add/sra pattern the dag combiner will generate for this as
1008 // sra/addze rather than having to handle sdiv ourselves. oh well.
Chris Lattnerdc664572005-08-25 17:50:06 +00001009 unsigned Imm;
Chris Lattner97b3da12006-06-27 00:04:13 +00001010 if (isInt32Immediate(N->getOperand(1), Imm)) {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001011 SDValue N0 = N->getOperand(0);
Chris Lattnerdc664572005-08-25 17:50:06 +00001012 if ((signed)Imm > 0 && isPowerOf2_32(Imm)) {
Evan Chengd1b82d82006-02-09 07:17:49 +00001013 SDNode *Op =
Chris Lattner3e5fbd72010-12-21 02:38:05 +00001014 CurDAG->getMachineNode(PPC::SRAWI, dl, MVT::i32, MVT::Glue,
Dan Gohman32f71d72009-09-25 18:54:59 +00001015 N0, getI32Imm(Log2_32(Imm)));
Andrew Trickc416ba62010-12-24 04:28:06 +00001016 return CurDAG->SelectNodeTo(N, PPC::ADDZE, MVT::i32,
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001017 SDValue(Op, 0), SDValue(Op, 1));
Chris Lattnerdc664572005-08-25 17:50:06 +00001018 } else if ((signed)Imm < 0 && isPowerOf2_32(-Imm)) {
Evan Chengd1b82d82006-02-09 07:17:49 +00001019 SDNode *Op =
Chris Lattner3e5fbd72010-12-21 02:38:05 +00001020 CurDAG->getMachineNode(PPC::SRAWI, dl, MVT::i32, MVT::Glue,
Dan Gohman32f71d72009-09-25 18:54:59 +00001021 N0, getI32Imm(Log2_32(-Imm)));
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001022 SDValue PT =
Dan Gohman32f71d72009-09-25 18:54:59 +00001023 SDValue(CurDAG->getMachineNode(PPC::ADDZE, dl, MVT::i32,
1024 SDValue(Op, 0), SDValue(Op, 1)),
Evan Chengd1b82d82006-02-09 07:17:49 +00001025 0);
Owen Anderson9f944592009-08-11 20:47:22 +00001026 return CurDAG->SelectNodeTo(N, PPC::NEG, MVT::i32, PT);
Chris Lattnerdc664572005-08-25 17:50:06 +00001027 }
1028 }
Andrew Trickc416ba62010-12-24 04:28:06 +00001029
Chris Lattner1de57062005-09-29 23:33:31 +00001030 // Other cases are autogenerated.
1031 break;
Chris Lattner6e184f22005-08-25 22:04:30 +00001032 }
Andrew Trickc416ba62010-12-24 04:28:06 +00001033
Chris Lattnerce645542006-11-10 02:08:47 +00001034 case ISD::LOAD: {
1035 // Handle preincrement loads.
Dan Gohmanea6f91f2010-01-05 01:24:18 +00001036 LoadSDNode *LD = cast<LoadSDNode>(N);
Owen Anderson53aa7a92009-08-10 22:56:29 +00001037 EVT LoadedVT = LD->getMemoryVT();
Andrew Trickc416ba62010-12-24 04:28:06 +00001038
Chris Lattnerce645542006-11-10 02:08:47 +00001039 // Normal loads are handled by code generated from the .td file.
1040 if (LD->getAddressingMode() != ISD::PRE_INC)
1041 break;
Andrew Trickc416ba62010-12-24 04:28:06 +00001042
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001043 SDValue Offset = LD->getOffset();
Ulrich Weigandd1b99d32013-03-22 14:58:17 +00001044 if (Offset.getOpcode() == ISD::TargetConstant ||
Chris Lattnerc5102bf2006-11-11 04:53:30 +00001045 Offset.getOpcode() == ISD::TargetGlobalAddress) {
Andrew Trickc416ba62010-12-24 04:28:06 +00001046
Chris Lattner474b5b72006-11-15 19:55:13 +00001047 unsigned Opcode;
1048 bool isSExt = LD->getExtensionType() == ISD::SEXTLOAD;
Owen Anderson9f944592009-08-11 20:47:22 +00001049 if (LD->getValueType(0) != MVT::i64) {
Chris Lattner474b5b72006-11-15 19:55:13 +00001050 // Handle PPC32 integer and normal FP loads.
Owen Anderson9f944592009-08-11 20:47:22 +00001051 assert((!isSExt || LoadedVT == MVT::i16) && "Invalid sext update load");
1052 switch (LoadedVT.getSimpleVT().SimpleTy) {
Torok Edwinfbcc6632009-07-14 16:55:14 +00001053 default: llvm_unreachable("Invalid PPC load type!");
Owen Anderson9f944592009-08-11 20:47:22 +00001054 case MVT::f64: Opcode = PPC::LFDU; break;
1055 case MVT::f32: Opcode = PPC::LFSU; break;
1056 case MVT::i32: Opcode = PPC::LWZU; break;
1057 case MVT::i16: Opcode = isSExt ? PPC::LHAU : PPC::LHZU; break;
1058 case MVT::i1:
1059 case MVT::i8: Opcode = PPC::LBZU; break;
Chris Lattner474b5b72006-11-15 19:55:13 +00001060 }
1061 } else {
Owen Anderson9f944592009-08-11 20:47:22 +00001062 assert(LD->getValueType(0) == MVT::i64 && "Unknown load result type!");
1063 assert((!isSExt || LoadedVT == MVT::i16) && "Invalid sext update load");
1064 switch (LoadedVT.getSimpleVT().SimpleTy) {
Torok Edwinfbcc6632009-07-14 16:55:14 +00001065 default: llvm_unreachable("Invalid PPC load type!");
Owen Anderson9f944592009-08-11 20:47:22 +00001066 case MVT::i64: Opcode = PPC::LDU; break;
1067 case MVT::i32: Opcode = PPC::LWZU8; break;
1068 case MVT::i16: Opcode = isSExt ? PPC::LHAU8 : PPC::LHZU8; break;
1069 case MVT::i1:
1070 case MVT::i8: Opcode = PPC::LBZU8; break;
Chris Lattner474b5b72006-11-15 19:55:13 +00001071 }
1072 }
Andrew Trickc416ba62010-12-24 04:28:06 +00001073
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001074 SDValue Chain = LD->getChain();
1075 SDValue Base = LD->getBasePtr();
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001076 SDValue Ops[] = { Offset, Base, Chain };
Dan Gohman32f71d72009-09-25 18:54:59 +00001077 return CurDAG->getMachineNode(Opcode, dl, LD->getValueType(0),
1078 PPCLowering.getPointerTy(),
Michael Liaob53d8962013-04-19 22:22:57 +00001079 MVT::Other, Ops);
Chris Lattnerce645542006-11-10 02:08:47 +00001080 } else {
Hal Finkelca542be2012-06-20 15:43:03 +00001081 unsigned Opcode;
1082 bool isSExt = LD->getExtensionType() == ISD::SEXTLOAD;
1083 if (LD->getValueType(0) != MVT::i64) {
1084 // Handle PPC32 integer and normal FP loads.
1085 assert((!isSExt || LoadedVT == MVT::i16) && "Invalid sext update load");
1086 switch (LoadedVT.getSimpleVT().SimpleTy) {
1087 default: llvm_unreachable("Invalid PPC load type!");
1088 case MVT::f64: Opcode = PPC::LFDUX; break;
1089 case MVT::f32: Opcode = PPC::LFSUX; break;
1090 case MVT::i32: Opcode = PPC::LWZUX; break;
1091 case MVT::i16: Opcode = isSExt ? PPC::LHAUX : PPC::LHZUX; break;
1092 case MVT::i1:
1093 case MVT::i8: Opcode = PPC::LBZUX; break;
1094 }
1095 } else {
1096 assert(LD->getValueType(0) == MVT::i64 && "Unknown load result type!");
1097 assert((!isSExt || LoadedVT == MVT::i16 || LoadedVT == MVT::i32) &&
1098 "Invalid sext update load");
1099 switch (LoadedVT.getSimpleVT().SimpleTy) {
1100 default: llvm_unreachable("Invalid PPC load type!");
1101 case MVT::i64: Opcode = PPC::LDUX; break;
1102 case MVT::i32: Opcode = isSExt ? PPC::LWAUX : PPC::LWZUX8; break;
1103 case MVT::i16: Opcode = isSExt ? PPC::LHAUX8 : PPC::LHZUX8; break;
1104 case MVT::i1:
1105 case MVT::i8: Opcode = PPC::LBZUX8; break;
1106 }
1107 }
1108
1109 SDValue Chain = LD->getChain();
1110 SDValue Base = LD->getBasePtr();
Ulrich Weigande90b0222013-03-22 14:58:48 +00001111 SDValue Ops[] = { Base, Offset, Chain };
Hal Finkelca542be2012-06-20 15:43:03 +00001112 return CurDAG->getMachineNode(Opcode, dl, LD->getValueType(0),
1113 PPCLowering.getPointerTy(),
Michael Liaob53d8962013-04-19 22:22:57 +00001114 MVT::Other, Ops);
Chris Lattnerce645542006-11-10 02:08:47 +00001115 }
1116 }
Andrew Trickc416ba62010-12-24 04:28:06 +00001117
Nate Begemanb3821a32005-08-18 07:30:46 +00001118 case ISD::AND: {
Nate Begemand31efd12006-09-22 05:01:56 +00001119 unsigned Imm, Imm2, SH, MB, ME;
Hal Finkele39526a2012-08-28 02:10:15 +00001120 uint64_t Imm64;
Nate Begemand31efd12006-09-22 05:01:56 +00001121
Nate Begemanb3821a32005-08-18 07:30:46 +00001122 // If this is an and of a value rotated between 0 and 31 bits and then and'd
1123 // with a mask, emit rlwinm
Chris Lattner97b3da12006-06-27 00:04:13 +00001124 if (isInt32Immediate(N->getOperand(1), Imm) &&
Gabor Greiff304a7a2008-08-28 21:40:38 +00001125 isRotateAndMask(N->getOperand(0).getNode(), Imm, false, SH, MB, ME)) {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001126 SDValue Val = N->getOperand(0).getOperand(0);
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001127 SDValue Ops[] = { Val, getI32Imm(SH), getI32Imm(MB), getI32Imm(ME) };
Owen Anderson9f944592009-08-11 20:47:22 +00001128 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
Nate Begemanb3821a32005-08-18 07:30:46 +00001129 }
Nate Begemand31efd12006-09-22 05:01:56 +00001130 // If this is just a masked value where the input is not handled above, and
1131 // is not a rotate-left (handled by a pattern in the .td file), emit rlwinm
1132 if (isInt32Immediate(N->getOperand(1), Imm) &&
Andrew Trickc416ba62010-12-24 04:28:06 +00001133 isRunOfOnes(Imm, MB, ME) &&
Nate Begemand31efd12006-09-22 05:01:56 +00001134 N->getOperand(0).getOpcode() != ISD::ROTL) {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001135 SDValue Val = N->getOperand(0);
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001136 SDValue Ops[] = { Val, getI32Imm(0), getI32Imm(MB), getI32Imm(ME) };
Owen Anderson9f944592009-08-11 20:47:22 +00001137 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
Nate Begemand31efd12006-09-22 05:01:56 +00001138 }
Hal Finkele39526a2012-08-28 02:10:15 +00001139 // If this is a 64-bit zero-extension mask, emit rldicl.
1140 if (isInt64Immediate(N->getOperand(1).getNode(), Imm64) &&
1141 isMask_64(Imm64)) {
1142 SDValue Val = N->getOperand(0);
1143 MB = 64 - CountTrailingOnes_64(Imm64);
Hal Finkel22498fa2013-11-20 01:10:15 +00001144 SH = 0;
1145
1146 // If the operand is a logical right shift, we can fold it into this
1147 // instruction: rldicl(rldicl(x, 64-n, n), 0, mb) -> rldicl(x, 64-n, mb)
1148 // for n <= mb. The right shift is really a left rotate followed by a
1149 // mask, and this mask is a more-restrictive sub-mask of the mask implied
1150 // by the shift.
1151 if (Val.getOpcode() == ISD::SRL &&
1152 isInt32Immediate(Val.getOperand(1).getNode(), Imm) && Imm <= MB) {
1153 assert(Imm < 64 && "Illegal shift amount");
1154 Val = Val.getOperand(0);
1155 SH = 64 - Imm;
1156 }
1157
1158 SDValue Ops[] = { Val, getI32Imm(SH), getI32Imm(MB) };
Hal Finkele39526a2012-08-28 02:10:15 +00001159 return CurDAG->SelectNodeTo(N, PPC::RLDICL, MVT::i64, Ops, 3);
1160 }
Nate Begemand31efd12006-09-22 05:01:56 +00001161 // AND X, 0 -> 0, not "rlwinm 32".
1162 if (isInt32Immediate(N->getOperand(1), Imm) && (Imm == 0)) {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001163 ReplaceUses(SDValue(N, 0), N->getOperand(1));
Nate Begemand31efd12006-09-22 05:01:56 +00001164 return NULL;
1165 }
Nate Begeman9aea6e42005-12-24 01:00:15 +00001166 // ISD::OR doesn't get all the bitfield insertion fun.
1167 // (and (or x, c1), c2) where isRunOfOnes(~(c1^c2)) is a bitfield insert
Andrew Trickc416ba62010-12-24 04:28:06 +00001168 if (isInt32Immediate(N->getOperand(1), Imm) &&
Nate Begeman9aea6e42005-12-24 01:00:15 +00001169 N->getOperand(0).getOpcode() == ISD::OR &&
Chris Lattner97b3da12006-06-27 00:04:13 +00001170 isInt32Immediate(N->getOperand(0).getOperand(1), Imm2)) {
Chris Lattner20c88df2006-01-05 18:32:49 +00001171 unsigned MB, ME;
Nate Begeman9aea6e42005-12-24 01:00:15 +00001172 Imm = ~(Imm^Imm2);
1173 if (isRunOfOnes(Imm, MB, ME)) {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001174 SDValue Ops[] = { N->getOperand(0).getOperand(0),
Evan Chengc3acfc02006-08-27 08:14:06 +00001175 N->getOperand(0).getOperand(1),
1176 getI32Imm(0), getI32Imm(MB),getI32Imm(ME) };
Michael Liaob53d8962013-04-19 22:22:57 +00001177 return CurDAG->getMachineNode(PPC::RLWIMI, dl, MVT::i32, Ops);
Nate Begeman9aea6e42005-12-24 01:00:15 +00001178 }
1179 }
Andrew Trickc416ba62010-12-24 04:28:06 +00001180
Chris Lattner1de57062005-09-29 23:33:31 +00001181 // Other cases are autogenerated.
1182 break;
Nate Begemanb3821a32005-08-18 07:30:46 +00001183 }
Nate Begeman93c4bc62005-08-19 00:38:14 +00001184 case ISD::OR:
Owen Anderson9f944592009-08-11 20:47:22 +00001185 if (N->getValueType(0) == MVT::i32)
Chris Lattnerbc485fd2006-08-15 23:48:22 +00001186 if (SDNode *I = SelectBitfieldInsert(N))
1187 return I;
Andrew Trickc416ba62010-12-24 04:28:06 +00001188
Chris Lattner1de57062005-09-29 23:33:31 +00001189 // Other cases are autogenerated.
1190 break;
Nate Begeman33acb2c2005-08-18 23:38:00 +00001191 case ISD::SHL: {
1192 unsigned Imm, SH, MB, ME;
Gabor Greiff304a7a2008-08-28 21:40:38 +00001193 if (isOpcWithIntImmediate(N->getOperand(0).getNode(), ISD::AND, Imm) &&
Nate Begeman9f3c26c2005-10-19 18:42:01 +00001194 isRotateAndMask(N, Imm, true, SH, MB, ME)) {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001195 SDValue Ops[] = { N->getOperand(0).getOperand(0),
Evan Chengc3acfc02006-08-27 08:14:06 +00001196 getI32Imm(SH), getI32Imm(MB), getI32Imm(ME) };
Owen Anderson9f944592009-08-11 20:47:22 +00001197 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
Nate Begeman9eaa6ba2005-10-19 01:12:32 +00001198 }
Andrew Trickc416ba62010-12-24 04:28:06 +00001199
Nate Begeman9f3c26c2005-10-19 18:42:01 +00001200 // Other cases are autogenerated.
1201 break;
Nate Begeman33acb2c2005-08-18 23:38:00 +00001202 }
1203 case ISD::SRL: {
1204 unsigned Imm, SH, MB, ME;
Gabor Greiff304a7a2008-08-28 21:40:38 +00001205 if (isOpcWithIntImmediate(N->getOperand(0).getNode(), ISD::AND, Imm) &&
Andrew Trickc416ba62010-12-24 04:28:06 +00001206 isRotateAndMask(N, Imm, true, SH, MB, ME)) {
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001207 SDValue Ops[] = { N->getOperand(0).getOperand(0),
Evan Chengc3acfc02006-08-27 08:14:06 +00001208 getI32Imm(SH), getI32Imm(MB), getI32Imm(ME) };
Owen Anderson9f944592009-08-11 20:47:22 +00001209 return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Ops, 4);
Nate Begeman9eaa6ba2005-10-19 01:12:32 +00001210 }
Andrew Trickc416ba62010-12-24 04:28:06 +00001211
Nate Begeman9f3c26c2005-10-19 18:42:01 +00001212 // Other cases are autogenerated.
1213 break;
Nate Begeman33acb2c2005-08-18 23:38:00 +00001214 }
Hal Finkel940ab932014-02-28 00:27:01 +00001215 // FIXME: Remove this once the ANDI glue bug is fixed:
1216 case PPCISD::ANDIo_1_EQ_BIT:
1217 case PPCISD::ANDIo_1_GT_BIT: {
1218 if (!ANDIGlueBug)
1219 break;
1220
1221 EVT InVT = N->getOperand(0).getValueType();
1222 assert((InVT == MVT::i64 || InVT == MVT::i32) &&
1223 "Invalid input type for ANDIo_1_EQ_BIT");
1224
1225 unsigned Opcode = (InVT == MVT::i64) ? PPC::ANDIo8 : PPC::ANDIo;
1226 SDValue AndI(CurDAG->getMachineNode(Opcode, dl, InVT, MVT::Glue,
1227 N->getOperand(0),
1228 CurDAG->getTargetConstant(1, InVT)), 0);
1229 SDValue CR0Reg = CurDAG->getRegister(PPC::CR0, MVT::i32);
1230 SDValue SRIdxVal =
1231 CurDAG->getTargetConstant(N->getOpcode() == PPCISD::ANDIo_1_EQ_BIT ?
1232 PPC::sub_eq : PPC::sub_gt, MVT::i32);
1233
1234 return CurDAG->SelectNodeTo(N, TargetOpcode::EXTRACT_SUBREG, MVT::i1,
1235 CR0Reg, SRIdxVal,
1236 SDValue(AndI.getNode(), 1) /* glue */);
1237 }
Chris Lattnerbec817c2005-08-26 18:46:49 +00001238 case ISD::SELECT_CC: {
1239 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(4))->get();
Roman Divacky254f8212011-06-20 15:28:39 +00001240 EVT PtrVT = CurDAG->getTargetLoweringInfo().getPointerTy();
1241 bool isPPC64 = (PtrVT == MVT::i64);
Andrew Trickc416ba62010-12-24 04:28:06 +00001242
Hal Finkel940ab932014-02-28 00:27:01 +00001243 // If this is a select of i1 operands, we'll pattern match it.
1244 if (PPCSubTarget.useCRBits() &&
1245 N->getOperand(0).getValueType() == MVT::i1)
1246 break;
1247
Chris Lattner97b3da12006-06-27 00:04:13 +00001248 // Handle the setcc cases here. select_cc lhs, 0, 1, 0, cc
Roman Divacky254f8212011-06-20 15:28:39 +00001249 if (!isPPC64)
1250 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N->getOperand(1)))
1251 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N->getOperand(2)))
1252 if (ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N->getOperand(3)))
1253 if (N1C->isNullValue() && N3C->isNullValue() &&
1254 N2C->getZExtValue() == 1ULL && CC == ISD::SETNE &&
1255 // FIXME: Implement this optzn for PPC64.
1256 N->getValueType(0) == MVT::i32) {
1257 SDNode *Tmp =
1258 CurDAG->getMachineNode(PPC::ADDIC, dl, MVT::i32, MVT::Glue,
1259 N->getOperand(0), getI32Imm(~0U));
1260 return CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32,
1261 SDValue(Tmp, 0), N->getOperand(0),
1262 SDValue(Tmp, 1));
1263 }
Chris Lattner9b577f12005-08-26 21:23:58 +00001264
Dale Johannesenab8e4422009-02-06 19:16:40 +00001265 SDValue CCReg = SelectCC(N->getOperand(0), N->getOperand(1), CC, dl);
Hal Finkel940ab932014-02-28 00:27:01 +00001266
1267 if (N->getValueType(0) == MVT::i1) {
1268 // An i1 select is: (c & t) | (!c & f).
1269 bool Inv;
1270 unsigned Idx = getCRIdxForSetCC(CC, Inv);
1271
1272 unsigned SRI;
1273 switch (Idx) {
1274 default: llvm_unreachable("Invalid CC index");
1275 case 0: SRI = PPC::sub_lt; break;
1276 case 1: SRI = PPC::sub_gt; break;
1277 case 2: SRI = PPC::sub_eq; break;
1278 case 3: SRI = PPC::sub_un; break;
1279 }
1280
1281 SDValue CCBit = CurDAG->getTargetExtractSubreg(SRI, dl, MVT::i1, CCReg);
1282
1283 SDValue NotCCBit(CurDAG->getMachineNode(PPC::CRNOR, dl, MVT::i1,
1284 CCBit, CCBit), 0);
1285 SDValue C = Inv ? NotCCBit : CCBit,
1286 NotC = Inv ? CCBit : NotCCBit;
1287
1288 SDValue CAndT(CurDAG->getMachineNode(PPC::CRAND, dl, MVT::i1,
1289 C, N->getOperand(2)), 0);
1290 SDValue NotCAndF(CurDAG->getMachineNode(PPC::CRAND, dl, MVT::i1,
1291 NotC, N->getOperand(3)), 0);
1292
1293 return CurDAG->SelectNodeTo(N, PPC::CROR, MVT::i1, CAndT, NotCAndF);
1294 }
1295
Chris Lattner8c6a41e2006-11-17 22:10:59 +00001296 unsigned BROpc = getPredicateForSetCC(CC);
Chris Lattner9b577f12005-08-26 21:23:58 +00001297
Chris Lattnerd3eee1a2005-10-01 01:35:02 +00001298 unsigned SelectCCOp;
Owen Anderson9f944592009-08-11 20:47:22 +00001299 if (N->getValueType(0) == MVT::i32)
Chris Lattner97b3da12006-06-27 00:04:13 +00001300 SelectCCOp = PPC::SELECT_CC_I4;
Owen Anderson9f944592009-08-11 20:47:22 +00001301 else if (N->getValueType(0) == MVT::i64)
Chris Lattner97b3da12006-06-27 00:04:13 +00001302 SelectCCOp = PPC::SELECT_CC_I8;
Owen Anderson9f944592009-08-11 20:47:22 +00001303 else if (N->getValueType(0) == MVT::f32)
Chris Lattnerd3eee1a2005-10-01 01:35:02 +00001304 SelectCCOp = PPC::SELECT_CC_F4;
Owen Anderson9f944592009-08-11 20:47:22 +00001305 else if (N->getValueType(0) == MVT::f64)
Chris Lattnerd3eee1a2005-10-01 01:35:02 +00001306 SelectCCOp = PPC::SELECT_CC_F8;
Chris Lattner0a3d1bb2006-04-08 22:45:08 +00001307 else
1308 SelectCCOp = PPC::SELECT_CC_VRRC;
1309
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001310 SDValue Ops[] = { CCReg, N->getOperand(2), N->getOperand(3),
Evan Chengc3acfc02006-08-27 08:14:06 +00001311 getI32Imm(BROpc) };
1312 return CurDAG->SelectNodeTo(N, SelectCCOp, N->getValueType(0), Ops, 4);
Chris Lattnerbec817c2005-08-26 18:46:49 +00001313 }
Hal Finkel25c19922013-05-15 21:37:41 +00001314 case PPCISD::BDNZ:
1315 case PPCISD::BDZ: {
1316 bool IsPPC64 = PPCSubTarget.isPPC64();
1317 SDValue Ops[] = { N->getOperand(1), N->getOperand(0) };
1318 return CurDAG->SelectNodeTo(N, N->getOpcode() == PPCISD::BDNZ ?
1319 (IsPPC64 ? PPC::BDNZ8 : PPC::BDNZ) :
1320 (IsPPC64 ? PPC::BDZ8 : PPC::BDZ),
1321 MVT::Other, Ops, 2);
1322 }
Chris Lattnerbe9377a2006-11-17 22:37:34 +00001323 case PPCISD::COND_BRANCH: {
Dan Gohman7a638a82008-11-05 17:16:24 +00001324 // Op #0 is the Chain.
Chris Lattnerbe9377a2006-11-17 22:37:34 +00001325 // Op #1 is the PPC::PRED_* number.
1326 // Op #2 is the CR#
1327 // Op #3 is the Dest MBB
Dan Gohmanf14b77e2008-11-05 04:14:16 +00001328 // Op #4 is the Flag.
Evan Cheng58d1eac2007-06-29 01:25:06 +00001329 // Prevent PPC::PRED_* from being selected into LI.
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001330 SDValue Pred =
Dan Gohmaneffb8942008-09-12 16:56:44 +00001331 getI32Imm(cast<ConstantSDNode>(N->getOperand(1))->getZExtValue());
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001332 SDValue Ops[] = { Pred, N->getOperand(2), N->getOperand(3),
Chris Lattnerbe9377a2006-11-17 22:37:34 +00001333 N->getOperand(0), N->getOperand(4) };
Owen Anderson9f944592009-08-11 20:47:22 +00001334 return CurDAG->SelectNodeTo(N, PPC::BCC, MVT::Other, Ops, 5);
Chris Lattnerbe9377a2006-11-17 22:37:34 +00001335 }
Nate Begemanbb01d4f2006-03-17 01:40:33 +00001336 case ISD::BR_CC: {
Chris Lattner2a1823d2005-08-21 18:50:37 +00001337 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(1))->get();
Hal Finkel940ab932014-02-28 00:27:01 +00001338 unsigned PCC = getPredicateForSetCC(CC);
1339
1340 if (N->getOperand(2).getValueType() == MVT::i1) {
1341 unsigned Opc;
1342 bool Swap;
1343 switch (PCC) {
1344 default: llvm_unreachable("Unexpected Boolean-operand predicate");
1345 case PPC::PRED_LT: Opc = PPC::CRANDC; Swap = true; break;
1346 case PPC::PRED_LE: Opc = PPC::CRORC; Swap = true; break;
1347 case PPC::PRED_EQ: Opc = PPC::CREQV; Swap = false; break;
1348 case PPC::PRED_GE: Opc = PPC::CRORC; Swap = false; break;
1349 case PPC::PRED_GT: Opc = PPC::CRANDC; Swap = false; break;
1350 case PPC::PRED_NE: Opc = PPC::CRXOR; Swap = false; break;
1351 }
1352
1353 SDValue BitComp(CurDAG->getMachineNode(Opc, dl, MVT::i1,
1354 N->getOperand(Swap ? 3 : 2),
1355 N->getOperand(Swap ? 2 : 3)), 0);
1356 return CurDAG->SelectNodeTo(N, PPC::BC, MVT::Other,
1357 BitComp, N->getOperand(4), N->getOperand(0));
1358 }
1359
Dale Johannesenab8e4422009-02-06 19:16:40 +00001360 SDValue CondCode = SelectCC(N->getOperand(2), N->getOperand(3), CC, dl);
Hal Finkel940ab932014-02-28 00:27:01 +00001361 SDValue Ops[] = { getI32Imm(PCC), CondCode,
Evan Chengc3acfc02006-08-27 08:14:06 +00001362 N->getOperand(4), N->getOperand(0) };
Owen Anderson9f944592009-08-11 20:47:22 +00001363 return CurDAG->SelectNodeTo(N, PPC::BCC, MVT::Other, Ops, 4);
Chris Lattner2a1823d2005-08-21 18:50:37 +00001364 }
Nate Begeman4ca2ea52006-04-22 18:53:45 +00001365 case ISD::BRIND: {
Chris Lattnerb055c872006-06-10 01:15:02 +00001366 // FIXME: Should custom lower this.
Dan Gohman2ce6f2a2008-07-27 21:46:04 +00001367 SDValue Chain = N->getOperand(0);
1368 SDValue Target = N->getOperand(1);
Owen Anderson9f944592009-08-11 20:47:22 +00001369 unsigned Opc = Target.getValueType() == MVT::i32 ? PPC::MTCTR : PPC::MTCTR8;
Roman Divackya4a59ae2011-06-03 15:47:49 +00001370 unsigned Reg = Target.getValueType() == MVT::i32 ? PPC::BCTR : PPC::BCTR8;
Hal Finkel528ff4b2011-12-08 04:36:44 +00001371 Chain = SDValue(CurDAG->getMachineNode(Opc, dl, MVT::Glue, Target,
Dan Gohman32f71d72009-09-25 18:54:59 +00001372 Chain), 0);
Roman Divackya4a59ae2011-06-03 15:47:49 +00001373 return CurDAG->SelectNodeTo(N, Reg, MVT::Other, Chain);
Nate Begeman4ca2ea52006-04-22 18:53:45 +00001374 }
Bill Schmidt34627e32012-11-27 17:35:46 +00001375 case PPCISD::TOC_ENTRY: {
1376 assert (PPCSubTarget.isPPC64() && "Only supported for 64-bit ABI");
1377
Bill Schmidt27917782013-02-21 17:12:27 +00001378 // For medium and large code model, we generate two instructions as
1379 // described below. Otherwise we allow SelectCodeCommon to handle this,
1380 // selecting one of LDtoc, LDtocJTI, and LDtocCPT.
1381 CodeModel::Model CModel = TM.getCodeModel();
1382 if (CModel != CodeModel::Medium && CModel != CodeModel::Large)
Bill Schmidt34627e32012-11-27 17:35:46 +00001383 break;
1384
1385 // The first source operand is a TargetGlobalAddress or a
1386 // TargetJumpTable. If it is an externally defined symbol, a symbol
1387 // with common linkage, a function address, or a jump table address,
Bill Schmidt27917782013-02-21 17:12:27 +00001388 // or if we are generating code for large code model, we generate:
Bill Schmidt34627e32012-11-27 17:35:46 +00001389 // LDtocL(<ga:@sym>, ADDIStocHA(%X2, <ga:@sym>))
1390 // Otherwise we generate:
1391 // ADDItocL(ADDIStocHA(%X2, <ga:@sym>), <ga:@sym>)
1392 SDValue GA = N->getOperand(0);
1393 SDValue TOCbase = N->getOperand(1);
1394 SDNode *Tmp = CurDAG->getMachineNode(PPC::ADDIStocHA, dl, MVT::i64,
1395 TOCbase, GA);
1396
Bill Schmidt27917782013-02-21 17:12:27 +00001397 if (isa<JumpTableSDNode>(GA) || CModel == CodeModel::Large)
Bill Schmidt34627e32012-11-27 17:35:46 +00001398 return CurDAG->getMachineNode(PPC::LDtocL, dl, MVT::i64, GA,
1399 SDValue(Tmp, 0));
1400
1401 if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(GA)) {
1402 const GlobalValue *GValue = G->getGlobal();
Bill Schmidt9b1e3e22013-01-07 19:29:18 +00001403 const GlobalAlias *GAlias = dyn_cast<GlobalAlias>(GValue);
1404 const GlobalValue *RealGValue = GAlias ?
1405 GAlias->resolveAliasedGlobal(false) : GValue;
1406 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(RealGValue);
1407 assert((GVar || isa<Function>(RealGValue)) &&
Bill Schmidt34627e32012-11-27 17:35:46 +00001408 "Unexpected global value subclass!");
1409
1410 // An external variable is one without an initializer. For these,
1411 // for variables with common linkage, and for Functions, generate
1412 // the LDtocL form.
Bill Schmidt9b1e3e22013-01-07 19:29:18 +00001413 if (!GVar || !GVar->hasInitializer() || RealGValue->hasCommonLinkage() ||
1414 RealGValue->hasAvailableExternallyLinkage())
Bill Schmidt34627e32012-11-27 17:35:46 +00001415 return CurDAG->getMachineNode(PPC::LDtocL, dl, MVT::i64, GA,
1416 SDValue(Tmp, 0));
1417 }
1418
1419 return CurDAG->getMachineNode(PPC::ADDItocL, dl, MVT::i64,
1420 SDValue(Tmp, 0), GA);
1421 }
Bill Schmidt51e79512013-02-20 15:50:31 +00001422 case PPCISD::VADD_SPLAT: {
Bill Schmidtc6cbecc2013-02-20 20:41:42 +00001423 // This expands into one of three sequences, depending on whether
1424 // the first operand is odd or even, positive or negative.
Bill Schmidt51e79512013-02-20 15:50:31 +00001425 assert(isa<ConstantSDNode>(N->getOperand(0)) &&
1426 isa<ConstantSDNode>(N->getOperand(1)) &&
1427 "Invalid operand on VADD_SPLAT!");
Bill Schmidtc6cbecc2013-02-20 20:41:42 +00001428
1429 int Elt = N->getConstantOperandVal(0);
Bill Schmidt51e79512013-02-20 15:50:31 +00001430 int EltSize = N->getConstantOperandVal(1);
Bill Schmidtc6cbecc2013-02-20 20:41:42 +00001431 unsigned Opc1, Opc2, Opc3;
Bill Schmidt51e79512013-02-20 15:50:31 +00001432 EVT VT;
Bill Schmidtc6cbecc2013-02-20 20:41:42 +00001433
Bill Schmidt51e79512013-02-20 15:50:31 +00001434 if (EltSize == 1) {
1435 Opc1 = PPC::VSPLTISB;
1436 Opc2 = PPC::VADDUBM;
Bill Schmidtc6cbecc2013-02-20 20:41:42 +00001437 Opc3 = PPC::VSUBUBM;
Bill Schmidt51e79512013-02-20 15:50:31 +00001438 VT = MVT::v16i8;
1439 } else if (EltSize == 2) {
1440 Opc1 = PPC::VSPLTISH;
1441 Opc2 = PPC::VADDUHM;
Bill Schmidtc6cbecc2013-02-20 20:41:42 +00001442 Opc3 = PPC::VSUBUHM;
Bill Schmidt51e79512013-02-20 15:50:31 +00001443 VT = MVT::v8i16;
1444 } else {
1445 assert(EltSize == 4 && "Invalid element size on VADD_SPLAT!");
1446 Opc1 = PPC::VSPLTISW;
1447 Opc2 = PPC::VADDUWM;
Bill Schmidtc6cbecc2013-02-20 20:41:42 +00001448 Opc3 = PPC::VSUBUWM;
Bill Schmidt51e79512013-02-20 15:50:31 +00001449 VT = MVT::v4i32;
1450 }
Bill Schmidtc6cbecc2013-02-20 20:41:42 +00001451
1452 if ((Elt & 1) == 0) {
1453 // Elt is even, in the range [-32,-18] + [16,30].
1454 //
1455 // Convert: VADD_SPLAT elt, size
1456 // Into: tmp = VSPLTIS[BHW] elt
1457 // VADDU[BHW]M tmp, tmp
1458 // Where: [BHW] = B for size = 1, H for size = 2, W for size = 4
1459 SDValue EltVal = getI32Imm(Elt >> 1);
1460 SDNode *Tmp = CurDAG->getMachineNode(Opc1, dl, VT, EltVal);
1461 SDValue TmpVal = SDValue(Tmp, 0);
1462 return CurDAG->getMachineNode(Opc2, dl, VT, TmpVal, TmpVal);
1463
1464 } else if (Elt > 0) {
1465 // Elt is odd and positive, in the range [17,31].
1466 //
1467 // Convert: VADD_SPLAT elt, size
1468 // Into: tmp1 = VSPLTIS[BHW] elt-16
1469 // tmp2 = VSPLTIS[BHW] -16
1470 // VSUBU[BHW]M tmp1, tmp2
1471 SDValue EltVal = getI32Imm(Elt - 16);
1472 SDNode *Tmp1 = CurDAG->getMachineNode(Opc1, dl, VT, EltVal);
1473 EltVal = getI32Imm(-16);
1474 SDNode *Tmp2 = CurDAG->getMachineNode(Opc1, dl, VT, EltVal);
1475 return CurDAG->getMachineNode(Opc3, dl, VT, SDValue(Tmp1, 0),
1476 SDValue(Tmp2, 0));
1477
1478 } else {
1479 // Elt is odd and negative, in the range [-31,-17].
1480 //
1481 // Convert: VADD_SPLAT elt, size
1482 // Into: tmp1 = VSPLTIS[BHW] elt+16
1483 // tmp2 = VSPLTIS[BHW] -16
1484 // VADDU[BHW]M tmp1, tmp2
1485 SDValue EltVal = getI32Imm(Elt + 16);
1486 SDNode *Tmp1 = CurDAG->getMachineNode(Opc1, dl, VT, EltVal);
1487 EltVal = getI32Imm(-16);
1488 SDNode *Tmp2 = CurDAG->getMachineNode(Opc1, dl, VT, EltVal);
1489 return CurDAG->getMachineNode(Opc2, dl, VT, SDValue(Tmp1, 0),
1490 SDValue(Tmp2, 0));
1491 }
Bill Schmidt51e79512013-02-20 15:50:31 +00001492 }
Chris Lattner43ff01e2005-08-17 19:33:03 +00001493 }
Andrew Trickc416ba62010-12-24 04:28:06 +00001494
Dan Gohmanea6f91f2010-01-05 01:24:18 +00001495 return SelectCode(N);
Chris Lattner43ff01e2005-08-17 19:33:03 +00001496}
1497
Hal Finkel860fa902014-01-02 22:09:39 +00001498/// PostprocessISelDAG - Perform some late peephole optimizations
Bill Schmidtf5b474c2013-02-21 00:38:25 +00001499/// on the DAG representation.
1500void PPCDAGToDAGISel::PostprocessISelDAG() {
1501
1502 // Skip peepholes at -O0.
1503 if (TM.getOptLevel() == CodeGenOpt::None)
1504 return;
1505
Hal Finkel940ab932014-02-28 00:27:01 +00001506 PeepholePPC64();
1507 PeepholdCROps();
1508}
1509
Hal Finkelb9989152014-02-28 06:11:16 +00001510// Check if all users of this node will become isel where the second operand
1511// is the constant zero. If this is so, and if we can negate the condition,
1512// then we can flip the true and false operands. This will allow the zero to
1513// be folded with the isel so that we don't need to materialize a register
1514// containing zero.
1515bool PPCDAGToDAGISel::AllUsersSelectZero(SDNode *N) {
1516 // If we're not using isel, then this does not matter.
1517 if (!PPCSubTarget.hasISEL())
1518 return false;
1519
1520 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
1521 UI != UE; ++UI) {
1522 SDNode *User = *UI;
1523 if (!User->isMachineOpcode())
1524 return false;
1525 if (User->getMachineOpcode() != PPC::SELECT_I4 &&
1526 User->getMachineOpcode() != PPC::SELECT_I8)
1527 return false;
1528
1529 SDNode *Op2 = User->getOperand(2).getNode();
1530 if (!Op2->isMachineOpcode())
1531 return false;
1532
1533 if (Op2->getMachineOpcode() != PPC::LI &&
1534 Op2->getMachineOpcode() != PPC::LI8)
1535 return false;
1536
1537 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op2->getOperand(0));
1538 if (!C)
1539 return false;
1540
1541 if (!C->isNullValue())
1542 return false;
1543 }
1544
1545 return true;
1546}
1547
1548void PPCDAGToDAGISel::SwapAllSelectUsers(SDNode *N) {
1549 SmallVector<SDNode *, 4> ToReplace;
1550 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
1551 UI != UE; ++UI) {
1552 SDNode *User = *UI;
1553 assert((User->getMachineOpcode() == PPC::SELECT_I4 ||
1554 User->getMachineOpcode() == PPC::SELECT_I8) &&
1555 "Must have all select users");
1556 ToReplace.push_back(User);
1557 }
1558
1559 for (SmallVector<SDNode *, 4>::iterator UI = ToReplace.begin(),
1560 UE = ToReplace.end(); UI != UE; ++UI) {
1561 SDNode *User = *UI;
1562 SDNode *ResNode =
1563 CurDAG->getMachineNode(User->getMachineOpcode(), SDLoc(User),
1564 User->getValueType(0), User->getOperand(0),
1565 User->getOperand(2),
1566 User->getOperand(1));
1567
1568 DEBUG(dbgs() << "CR Peephole replacing:\nOld: ");
1569 DEBUG(User->dump(CurDAG));
1570 DEBUG(dbgs() << "\nNew: ");
1571 DEBUG(ResNode->dump(CurDAG));
1572 DEBUG(dbgs() << "\n");
1573
1574 ReplaceUses(User, ResNode);
1575 }
1576}
1577
Hal Finkel940ab932014-02-28 00:27:01 +00001578void PPCDAGToDAGISel::PeepholdCROps() {
1579 bool IsModified;
1580 do {
1581 IsModified = false;
1582 for (SelectionDAG::allnodes_iterator I = CurDAG->allnodes_begin(),
1583 E = CurDAG->allnodes_end(); I != E; ++I) {
1584 MachineSDNode *MachineNode = dyn_cast<MachineSDNode>(I);
1585 if (!MachineNode || MachineNode->use_empty())
1586 continue;
1587 SDNode *ResNode = MachineNode;
1588
1589 bool Op1Set = false, Op1Unset = false,
1590 Op1Not = false,
1591 Op2Set = false, Op2Unset = false,
1592 Op2Not = false;
1593
1594 unsigned Opcode = MachineNode->getMachineOpcode();
1595 switch (Opcode) {
1596 default: break;
1597 case PPC::CRAND:
1598 case PPC::CRNAND:
1599 case PPC::CROR:
1600 case PPC::CRXOR:
1601 case PPC::CRNOR:
1602 case PPC::CREQV:
1603 case PPC::CRANDC:
1604 case PPC::CRORC: {
1605 SDValue Op = MachineNode->getOperand(1);
1606 if (Op.isMachineOpcode()) {
1607 if (Op.getMachineOpcode() == PPC::CRSET)
1608 Op2Set = true;
1609 else if (Op.getMachineOpcode() == PPC::CRUNSET)
1610 Op2Unset = true;
1611 else if (Op.getMachineOpcode() == PPC::CRNOR &&
1612 Op.getOperand(0) == Op.getOperand(1))
1613 Op2Not = true;
1614 }
1615 } // fallthrough
1616 case PPC::BC:
1617 case PPC::BCn:
1618 case PPC::SELECT_I4:
1619 case PPC::SELECT_I8:
1620 case PPC::SELECT_F4:
1621 case PPC::SELECT_F8:
1622 case PPC::SELECT_VRRC: {
1623 SDValue Op = MachineNode->getOperand(0);
1624 if (Op.isMachineOpcode()) {
1625 if (Op.getMachineOpcode() == PPC::CRSET)
1626 Op1Set = true;
1627 else if (Op.getMachineOpcode() == PPC::CRUNSET)
1628 Op1Unset = true;
1629 else if (Op.getMachineOpcode() == PPC::CRNOR &&
1630 Op.getOperand(0) == Op.getOperand(1))
1631 Op1Not = true;
1632 }
1633 }
1634 break;
1635 }
1636
Hal Finkelb9989152014-02-28 06:11:16 +00001637 bool SelectSwap = false;
Hal Finkel940ab932014-02-28 00:27:01 +00001638 switch (Opcode) {
1639 default: break;
1640 case PPC::CRAND:
1641 if (MachineNode->getOperand(0) == MachineNode->getOperand(1))
1642 // x & x = x
1643 ResNode = MachineNode->getOperand(0).getNode();
1644 else if (Op1Set)
1645 // 1 & y = y
1646 ResNode = MachineNode->getOperand(1).getNode();
1647 else if (Op2Set)
1648 // x & 1 = x
1649 ResNode = MachineNode->getOperand(0).getNode();
1650 else if (Op1Unset || Op2Unset)
1651 // x & 0 = 0 & y = 0
1652 ResNode = CurDAG->getMachineNode(PPC::CRUNSET, SDLoc(MachineNode),
1653 MVT::i1);
1654 else if (Op1Not)
1655 // ~x & y = andc(y, x)
1656 ResNode = CurDAG->getMachineNode(PPC::CRANDC, SDLoc(MachineNode),
1657 MVT::i1, MachineNode->getOperand(1),
1658 MachineNode->getOperand(0).
1659 getOperand(0));
1660 else if (Op2Not)
1661 // x & ~y = andc(x, y)
1662 ResNode = CurDAG->getMachineNode(PPC::CRANDC, SDLoc(MachineNode),
1663 MVT::i1, MachineNode->getOperand(0),
1664 MachineNode->getOperand(1).
1665 getOperand(0));
Hal Finkelb9989152014-02-28 06:11:16 +00001666 else if (AllUsersSelectZero(MachineNode))
1667 ResNode = CurDAG->getMachineNode(PPC::CRNAND, SDLoc(MachineNode),
1668 MVT::i1, MachineNode->getOperand(0),
1669 MachineNode->getOperand(1)),
1670 SelectSwap = true;
Hal Finkel940ab932014-02-28 00:27:01 +00001671 break;
1672 case PPC::CRNAND:
1673 if (MachineNode->getOperand(0) == MachineNode->getOperand(1))
1674 // nand(x, x) -> nor(x, x)
1675 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1676 MVT::i1, MachineNode->getOperand(0),
1677 MachineNode->getOperand(0));
1678 else if (Op1Set)
1679 // nand(1, y) -> nor(y, y)
1680 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1681 MVT::i1, MachineNode->getOperand(1),
1682 MachineNode->getOperand(1));
1683 else if (Op2Set)
1684 // nand(x, 1) -> nor(x, x)
1685 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1686 MVT::i1, MachineNode->getOperand(0),
1687 MachineNode->getOperand(0));
1688 else if (Op1Unset || Op2Unset)
1689 // nand(x, 0) = nand(0, y) = 1
1690 ResNode = CurDAG->getMachineNode(PPC::CRSET, SDLoc(MachineNode),
1691 MVT::i1);
1692 else if (Op1Not)
1693 // nand(~x, y) = ~(~x & y) = x | ~y = orc(x, y)
1694 ResNode = CurDAG->getMachineNode(PPC::CRORC, SDLoc(MachineNode),
1695 MVT::i1, MachineNode->getOperand(0).
1696 getOperand(0),
1697 MachineNode->getOperand(1));
1698 else if (Op2Not)
1699 // nand(x, ~y) = ~x | y = orc(y, x)
1700 ResNode = CurDAG->getMachineNode(PPC::CRORC, SDLoc(MachineNode),
1701 MVT::i1, MachineNode->getOperand(1).
1702 getOperand(0),
1703 MachineNode->getOperand(0));
Hal Finkelb9989152014-02-28 06:11:16 +00001704 else if (AllUsersSelectZero(MachineNode))
1705 ResNode = CurDAG->getMachineNode(PPC::CRAND, SDLoc(MachineNode),
1706 MVT::i1, MachineNode->getOperand(0),
1707 MachineNode->getOperand(1)),
1708 SelectSwap = true;
Hal Finkel940ab932014-02-28 00:27:01 +00001709 break;
1710 case PPC::CROR:
1711 if (MachineNode->getOperand(0) == MachineNode->getOperand(1))
1712 // x | x = x
1713 ResNode = MachineNode->getOperand(0).getNode();
1714 else if (Op1Set || Op2Set)
1715 // x | 1 = 1 | y = 1
1716 ResNode = CurDAG->getMachineNode(PPC::CRSET, SDLoc(MachineNode),
1717 MVT::i1);
1718 else if (Op1Unset)
1719 // 0 | y = y
1720 ResNode = MachineNode->getOperand(1).getNode();
1721 else if (Op2Unset)
1722 // x | 0 = x
1723 ResNode = MachineNode->getOperand(0).getNode();
1724 else if (Op1Not)
1725 // ~x | y = orc(y, x)
1726 ResNode = CurDAG->getMachineNode(PPC::CRORC, SDLoc(MachineNode),
1727 MVT::i1, MachineNode->getOperand(1),
1728 MachineNode->getOperand(0).
1729 getOperand(0));
1730 else if (Op2Not)
1731 // x | ~y = orc(x, y)
1732 ResNode = CurDAG->getMachineNode(PPC::CRORC, SDLoc(MachineNode),
1733 MVT::i1, MachineNode->getOperand(0),
1734 MachineNode->getOperand(1).
1735 getOperand(0));
Hal Finkelb9989152014-02-28 06:11:16 +00001736 else if (AllUsersSelectZero(MachineNode))
1737 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1738 MVT::i1, MachineNode->getOperand(0),
1739 MachineNode->getOperand(1)),
1740 SelectSwap = true;
Hal Finkel940ab932014-02-28 00:27:01 +00001741 break;
1742 case PPC::CRXOR:
1743 if (MachineNode->getOperand(0) == MachineNode->getOperand(1))
1744 // xor(x, x) = 0
1745 ResNode = CurDAG->getMachineNode(PPC::CRUNSET, SDLoc(MachineNode),
1746 MVT::i1);
1747 else if (Op1Set)
1748 // xor(1, y) -> nor(y, y)
1749 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1750 MVT::i1, MachineNode->getOperand(1),
1751 MachineNode->getOperand(1));
1752 else if (Op2Set)
1753 // xor(x, 1) -> nor(x, x)
1754 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1755 MVT::i1, MachineNode->getOperand(0),
1756 MachineNode->getOperand(0));
1757 else if (Op1Unset)
1758 // xor(0, y) = y
1759 ResNode = MachineNode->getOperand(1).getNode();
1760 else if (Op2Unset)
1761 // xor(x, 0) = x
1762 ResNode = MachineNode->getOperand(0).getNode();
1763 else if (Op1Not)
1764 // xor(~x, y) = eqv(x, y)
1765 ResNode = CurDAG->getMachineNode(PPC::CREQV, SDLoc(MachineNode),
1766 MVT::i1, MachineNode->getOperand(0).
1767 getOperand(0),
1768 MachineNode->getOperand(1));
1769 else if (Op2Not)
1770 // xor(x, ~y) = eqv(x, y)
1771 ResNode = CurDAG->getMachineNode(PPC::CREQV, SDLoc(MachineNode),
1772 MVT::i1, MachineNode->getOperand(0),
1773 MachineNode->getOperand(1).
1774 getOperand(0));
Hal Finkelb9989152014-02-28 06:11:16 +00001775 else if (AllUsersSelectZero(MachineNode))
1776 ResNode = CurDAG->getMachineNode(PPC::CREQV, SDLoc(MachineNode),
1777 MVT::i1, MachineNode->getOperand(0),
1778 MachineNode->getOperand(1)),
1779 SelectSwap = true;
Hal Finkel940ab932014-02-28 00:27:01 +00001780 break;
1781 case PPC::CRNOR:
1782 if (Op1Set || Op2Set)
1783 // nor(1, y) -> 0
1784 ResNode = CurDAG->getMachineNode(PPC::CRUNSET, SDLoc(MachineNode),
1785 MVT::i1);
1786 else if (Op1Unset)
1787 // nor(0, y) = ~y -> nor(y, y)
1788 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1789 MVT::i1, MachineNode->getOperand(1),
1790 MachineNode->getOperand(1));
1791 else if (Op2Unset)
1792 // nor(x, 0) = ~x
1793 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1794 MVT::i1, MachineNode->getOperand(0),
1795 MachineNode->getOperand(0));
1796 else if (Op1Not)
1797 // nor(~x, y) = andc(x, y)
1798 ResNode = CurDAG->getMachineNode(PPC::CRANDC, SDLoc(MachineNode),
1799 MVT::i1, MachineNode->getOperand(0).
1800 getOperand(0),
1801 MachineNode->getOperand(1));
1802 else if (Op2Not)
1803 // nor(x, ~y) = andc(y, x)
1804 ResNode = CurDAG->getMachineNode(PPC::CRANDC, SDLoc(MachineNode),
1805 MVT::i1, MachineNode->getOperand(1).
1806 getOperand(0),
1807 MachineNode->getOperand(0));
Hal Finkelb9989152014-02-28 06:11:16 +00001808 else if (AllUsersSelectZero(MachineNode))
1809 ResNode = CurDAG->getMachineNode(PPC::CROR, SDLoc(MachineNode),
1810 MVT::i1, MachineNode->getOperand(0),
1811 MachineNode->getOperand(1)),
1812 SelectSwap = true;
Hal Finkel940ab932014-02-28 00:27:01 +00001813 break;
1814 case PPC::CREQV:
1815 if (MachineNode->getOperand(0) == MachineNode->getOperand(1))
1816 // eqv(x, x) = 1
1817 ResNode = CurDAG->getMachineNode(PPC::CRSET, SDLoc(MachineNode),
1818 MVT::i1);
1819 else if (Op1Set)
1820 // eqv(1, y) = y
1821 ResNode = MachineNode->getOperand(1).getNode();
1822 else if (Op2Set)
1823 // eqv(x, 1) = x
1824 ResNode = MachineNode->getOperand(0).getNode();
1825 else if (Op1Unset)
1826 // eqv(0, y) = ~y -> nor(y, y)
1827 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1828 MVT::i1, MachineNode->getOperand(1),
1829 MachineNode->getOperand(1));
1830 else if (Op2Unset)
1831 // eqv(x, 0) = ~x
1832 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1833 MVT::i1, MachineNode->getOperand(0),
1834 MachineNode->getOperand(0));
1835 else if (Op1Not)
1836 // eqv(~x, y) = xor(x, y)
1837 ResNode = CurDAG->getMachineNode(PPC::CRXOR, SDLoc(MachineNode),
1838 MVT::i1, MachineNode->getOperand(0).
1839 getOperand(0),
1840 MachineNode->getOperand(1));
1841 else if (Op2Not)
1842 // eqv(x, ~y) = xor(x, y)
1843 ResNode = CurDAG->getMachineNode(PPC::CRXOR, SDLoc(MachineNode),
1844 MVT::i1, MachineNode->getOperand(0),
1845 MachineNode->getOperand(1).
1846 getOperand(0));
Hal Finkelb9989152014-02-28 06:11:16 +00001847 else if (AllUsersSelectZero(MachineNode))
1848 ResNode = CurDAG->getMachineNode(PPC::CRXOR, SDLoc(MachineNode),
1849 MVT::i1, MachineNode->getOperand(0),
1850 MachineNode->getOperand(1)),
1851 SelectSwap = true;
Hal Finkel940ab932014-02-28 00:27:01 +00001852 break;
1853 case PPC::CRANDC:
1854 if (MachineNode->getOperand(0) == MachineNode->getOperand(1))
1855 // andc(x, x) = 0
1856 ResNode = CurDAG->getMachineNode(PPC::CRUNSET, SDLoc(MachineNode),
1857 MVT::i1);
1858 else if (Op1Set)
1859 // andc(1, y) = ~y
1860 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1861 MVT::i1, MachineNode->getOperand(1),
1862 MachineNode->getOperand(1));
1863 else if (Op1Unset || Op2Set)
1864 // andc(0, y) = andc(x, 1) = 0
1865 ResNode = CurDAG->getMachineNode(PPC::CRUNSET, SDLoc(MachineNode),
1866 MVT::i1);
1867 else if (Op2Unset)
1868 // andc(x, 0) = x
1869 ResNode = MachineNode->getOperand(0).getNode();
1870 else if (Op1Not)
1871 // andc(~x, y) = ~(x | y) = nor(x, y)
1872 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1873 MVT::i1, MachineNode->getOperand(0).
1874 getOperand(0),
1875 MachineNode->getOperand(1));
1876 else if (Op2Not)
1877 // andc(x, ~y) = x & y
1878 ResNode = CurDAG->getMachineNode(PPC::CRAND, SDLoc(MachineNode),
1879 MVT::i1, MachineNode->getOperand(0),
1880 MachineNode->getOperand(1).
1881 getOperand(0));
Hal Finkelb9989152014-02-28 06:11:16 +00001882 else if (AllUsersSelectZero(MachineNode))
1883 ResNode = CurDAG->getMachineNode(PPC::CRORC, SDLoc(MachineNode),
1884 MVT::i1, MachineNode->getOperand(1),
1885 MachineNode->getOperand(0)),
1886 SelectSwap = true;
Hal Finkel940ab932014-02-28 00:27:01 +00001887 break;
1888 case PPC::CRORC:
1889 if (MachineNode->getOperand(0) == MachineNode->getOperand(1))
1890 // orc(x, x) = 1
1891 ResNode = CurDAG->getMachineNode(PPC::CRSET, SDLoc(MachineNode),
1892 MVT::i1);
1893 else if (Op1Set || Op2Unset)
1894 // orc(1, y) = orc(x, 0) = 1
1895 ResNode = CurDAG->getMachineNode(PPC::CRSET, SDLoc(MachineNode),
1896 MVT::i1);
1897 else if (Op2Set)
1898 // orc(x, 1) = x
1899 ResNode = MachineNode->getOperand(0).getNode();
1900 else if (Op1Unset)
1901 // orc(0, y) = ~y
1902 ResNode = CurDAG->getMachineNode(PPC::CRNOR, SDLoc(MachineNode),
1903 MVT::i1, MachineNode->getOperand(1),
1904 MachineNode->getOperand(1));
1905 else if (Op1Not)
1906 // orc(~x, y) = ~(x & y) = nand(x, y)
1907 ResNode = CurDAG->getMachineNode(PPC::CRNAND, SDLoc(MachineNode),
1908 MVT::i1, MachineNode->getOperand(0).
1909 getOperand(0),
1910 MachineNode->getOperand(1));
1911 else if (Op2Not)
1912 // orc(x, ~y) = x | y
1913 ResNode = CurDAG->getMachineNode(PPC::CROR, SDLoc(MachineNode),
1914 MVT::i1, MachineNode->getOperand(0),
1915 MachineNode->getOperand(1).
1916 getOperand(0));
Hal Finkelb9989152014-02-28 06:11:16 +00001917 else if (AllUsersSelectZero(MachineNode))
1918 ResNode = CurDAG->getMachineNode(PPC::CRANDC, SDLoc(MachineNode),
1919 MVT::i1, MachineNode->getOperand(1),
1920 MachineNode->getOperand(0)),
1921 SelectSwap = true;
Hal Finkel940ab932014-02-28 00:27:01 +00001922 break;
1923 case PPC::SELECT_I4:
1924 case PPC::SELECT_I8:
1925 case PPC::SELECT_F4:
1926 case PPC::SELECT_F8:
1927 case PPC::SELECT_VRRC:
1928 if (Op1Set)
1929 ResNode = MachineNode->getOperand(1).getNode();
1930 else if (Op1Unset)
1931 ResNode = MachineNode->getOperand(2).getNode();
1932 else if (Op1Not)
1933 ResNode = CurDAG->getMachineNode(MachineNode->getMachineOpcode(),
1934 SDLoc(MachineNode),
1935 MachineNode->getValueType(0),
1936 MachineNode->getOperand(0).
1937 getOperand(0),
1938 MachineNode->getOperand(2),
1939 MachineNode->getOperand(1));
1940 break;
1941 case PPC::BC:
1942 case PPC::BCn:
1943 if (Op1Not)
1944 ResNode = CurDAG->getMachineNode(Opcode == PPC::BC ? PPC::BCn :
1945 PPC::BC,
1946 SDLoc(MachineNode),
1947 MVT::Other,
1948 MachineNode->getOperand(0).
1949 getOperand(0),
1950 MachineNode->getOperand(1),
1951 MachineNode->getOperand(2));
1952 // FIXME: Handle Op1Set, Op1Unset here too.
1953 break;
1954 }
1955
Hal Finkelb9989152014-02-28 06:11:16 +00001956 // If we're inverting this node because it is used only by selects that
1957 // we'd like to swap, then swap the selects before the node replacement.
1958 if (SelectSwap)
1959 SwapAllSelectUsers(MachineNode);
1960
Hal Finkel940ab932014-02-28 00:27:01 +00001961 if (ResNode != MachineNode) {
1962 DEBUG(dbgs() << "CR Peephole replacing:\nOld: ");
1963 DEBUG(MachineNode->dump(CurDAG));
1964 DEBUG(dbgs() << "\nNew: ");
1965 DEBUG(ResNode->dump(CurDAG));
1966 DEBUG(dbgs() << "\n");
1967
1968 ReplaceUses(MachineNode, ResNode);
1969 IsModified = true;
1970 }
1971 }
1972 if (IsModified)
1973 CurDAG->RemoveDeadNodes();
1974 } while (IsModified);
1975}
1976
1977void PPCDAGToDAGISel::PeepholePPC64() {
Bill Schmidtf5b474c2013-02-21 00:38:25 +00001978 // These optimizations are currently supported only for 64-bit SVR4.
1979 if (PPCSubTarget.isDarwin() || !PPCSubTarget.isPPC64())
1980 return;
1981
1982 SelectionDAG::allnodes_iterator Position(CurDAG->getRoot().getNode());
1983 ++Position;
1984
1985 while (Position != CurDAG->allnodes_begin()) {
1986 SDNode *N = --Position;
1987 // Skip dead nodes and any non-machine opcodes.
1988 if (N->use_empty() || !N->isMachineOpcode())
1989 continue;
1990
1991 unsigned FirstOp;
1992 unsigned StorageOpcode = N->getMachineOpcode();
1993
1994 switch (StorageOpcode) {
1995 default: continue;
1996
1997 case PPC::LBZ:
1998 case PPC::LBZ8:
1999 case PPC::LD:
2000 case PPC::LFD:
2001 case PPC::LFS:
2002 case PPC::LHA:
2003 case PPC::LHA8:
2004 case PPC::LHZ:
2005 case PPC::LHZ8:
2006 case PPC::LWA:
2007 case PPC::LWZ:
2008 case PPC::LWZ8:
2009 FirstOp = 0;
2010 break;
2011
2012 case PPC::STB:
2013 case PPC::STB8:
2014 case PPC::STD:
2015 case PPC::STFD:
2016 case PPC::STFS:
2017 case PPC::STH:
2018 case PPC::STH8:
2019 case PPC::STW:
2020 case PPC::STW8:
2021 FirstOp = 1;
2022 break;
2023 }
2024
2025 // If this is a load or store with a zero offset, we may be able to
2026 // fold an add-immediate into the memory operation.
2027 if (!isa<ConstantSDNode>(N->getOperand(FirstOp)) ||
2028 N->getConstantOperandVal(FirstOp) != 0)
2029 continue;
2030
2031 SDValue Base = N->getOperand(FirstOp + 1);
2032 if (!Base.isMachineOpcode())
2033 continue;
2034
2035 unsigned Flags = 0;
2036 bool ReplaceFlags = true;
2037
2038 // When the feeding operation is an add-immediate of some sort,
2039 // determine whether we need to add relocation information to the
2040 // target flags on the immediate operand when we fold it into the
2041 // load instruction.
2042 //
2043 // For something like ADDItocL, the relocation information is
2044 // inferred from the opcode; when we process it in the AsmPrinter,
2045 // we add the necessary relocation there. A load, though, can receive
2046 // relocation from various flavors of ADDIxxx, so we need to carry
2047 // the relocation information in the target flags.
2048 switch (Base.getMachineOpcode()) {
2049 default: continue;
2050
2051 case PPC::ADDI8:
Ulrich Weigand35f9fdf2013-03-26 10:55:20 +00002052 case PPC::ADDI:
Bill Schmidtf5b474c2013-02-21 00:38:25 +00002053 // In some cases (such as TLS) the relocation information
2054 // is already in place on the operand, so copying the operand
2055 // is sufficient.
2056 ReplaceFlags = false;
2057 // For these cases, the immediate may not be divisible by 4, in
2058 // which case the fold is illegal for DS-form instructions. (The
2059 // other cases provide aligned addresses and are always safe.)
2060 if ((StorageOpcode == PPC::LWA ||
2061 StorageOpcode == PPC::LD ||
2062 StorageOpcode == PPC::STD) &&
2063 (!isa<ConstantSDNode>(Base.getOperand(1)) ||
2064 Base.getConstantOperandVal(1) % 4 != 0))
2065 continue;
2066 break;
2067 case PPC::ADDIdtprelL:
Ulrich Weigandd51c09f2013-06-21 14:42:20 +00002068 Flags = PPCII::MO_DTPREL_LO;
Bill Schmidtf5b474c2013-02-21 00:38:25 +00002069 break;
2070 case PPC::ADDItlsldL:
Ulrich Weigandd51c09f2013-06-21 14:42:20 +00002071 Flags = PPCII::MO_TLSLD_LO;
Bill Schmidtf5b474c2013-02-21 00:38:25 +00002072 break;
2073 case PPC::ADDItocL:
Ulrich Weigandd51c09f2013-06-21 14:42:20 +00002074 Flags = PPCII::MO_TOC_LO;
Bill Schmidtf5b474c2013-02-21 00:38:25 +00002075 break;
2076 }
2077
2078 // We found an opportunity. Reverse the operands from the add
2079 // immediate and substitute them into the load or store. If
2080 // needed, update the target flags for the immediate operand to
2081 // reflect the necessary relocation information.
2082 DEBUG(dbgs() << "Folding add-immediate into mem-op:\nBase: ");
2083 DEBUG(Base->dump(CurDAG));
2084 DEBUG(dbgs() << "\nN: ");
2085 DEBUG(N->dump(CurDAG));
2086 DEBUG(dbgs() << "\n");
2087
2088 SDValue ImmOpnd = Base.getOperand(1);
2089
2090 // If the relocation information isn't already present on the
2091 // immediate operand, add it now.
2092 if (ReplaceFlags) {
Bill Schmidt49498da2013-02-21 14:35:42 +00002093 if (GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(ImmOpnd)) {
Andrew Trickef9de2a2013-05-25 02:42:55 +00002094 SDLoc dl(GA);
Bill Schmidtf5b474c2013-02-21 00:38:25 +00002095 const GlobalValue *GV = GA->getGlobal();
Bill Schmidt48fc20a2013-07-01 20:52:27 +00002096 // We can't perform this optimization for data whose alignment
2097 // is insufficient for the instruction encoding.
2098 if (GV->getAlignment() < 4 &&
2099 (StorageOpcode == PPC::LD || StorageOpcode == PPC::STD ||
2100 StorageOpcode == PPC::LWA)) {
2101 DEBUG(dbgs() << "Rejected this candidate for alignment.\n\n");
2102 continue;
2103 }
Bill Schmidtf5b474c2013-02-21 00:38:25 +00002104 ImmOpnd = CurDAG->getTargetGlobalAddress(GV, dl, MVT::i64, 0, Flags);
Bill Schmidt836c45b2013-02-21 17:26:05 +00002105 } else if (ConstantPoolSDNode *CP =
2106 dyn_cast<ConstantPoolSDNode>(ImmOpnd)) {
Bill Schmidt49498da2013-02-21 14:35:42 +00002107 const Constant *C = CP->getConstVal();
2108 ImmOpnd = CurDAG->getTargetConstantPool(C, MVT::i64,
2109 CP->getAlignment(),
2110 0, Flags);
Bill Schmidtf5b474c2013-02-21 00:38:25 +00002111 }
2112 }
2113
2114 if (FirstOp == 1) // Store
2115 (void)CurDAG->UpdateNodeOperands(N, N->getOperand(0), ImmOpnd,
2116 Base.getOperand(0), N->getOperand(3));
2117 else // Load
2118 (void)CurDAG->UpdateNodeOperands(N, ImmOpnd, Base.getOperand(0),
2119 N->getOperand(2));
2120
2121 // The add-immediate may now be dead, in which case remove it.
2122 if (Base.getNode()->use_empty())
2123 CurDAG->RemoveDeadNode(Base.getNode());
2124 }
2125}
Chris Lattner43ff01e2005-08-17 19:33:03 +00002126
Chris Lattnerb055c872006-06-10 01:15:02 +00002127
Andrew Trickc416ba62010-12-24 04:28:06 +00002128/// createPPCISelDag - This pass converts a legalized DAG into a
Chris Lattner43ff01e2005-08-17 19:33:03 +00002129/// PowerPC-specific DAG, ready for instruction scheduling.
2130///
Evan Cheng2dd2c652006-03-13 23:20:37 +00002131FunctionPass *llvm::createPPCISelDag(PPCTargetMachine &TM) {
Nate Begeman0b71e002005-10-18 00:28:58 +00002132 return new PPCDAGToDAGISel(TM);
Chris Lattner43ff01e2005-08-17 19:33:03 +00002133}
2134
Krzysztof Parzyszek2680b532013-02-13 17:40:07 +00002135static void initializePassOnce(PassRegistry &Registry) {
2136 const char *Name = "PowerPC DAG->DAG Pattern Instruction Selection";
2137 PassInfo *PI = new PassInfo(Name, "ppc-codegen", &SelectionDAGISel::ID, 0,
2138 false, false);
2139 Registry.registerPass(*PI, true);
2140}
2141
2142void llvm::initializePPCDAGToDAGISelPass(PassRegistry &Registry) {
2143 CALL_ONCE_INITIALIZATION(initializePassOnce);
2144}
2145