blob: afb36175d12fa14d6ee95046f1343a6f8a2ae039 [file] [log] [blame]
Nate Begeman1d9d7422005-10-18 00:28:58 +00001//===-- PPCISelLowering.cpp - PPC DAG Lowering Implementation -------------===//
Chris Lattner7c5a3d32005-08-16 17:14:42 +00002//
3// The LLVM Compiler Infrastructure
4//
5// This file was developed by Chris Lattner and is distributed under
6// the University of Illinois Open Source License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
Nate Begeman21e463b2005-10-16 05:39:50 +000010// This file implements the PPCISelLowering class.
Chris Lattner7c5a3d32005-08-16 17:14:42 +000011//
12//===----------------------------------------------------------------------===//
13
Chris Lattner16e71f22005-10-14 23:59:06 +000014#include "PPCISelLowering.h"
15#include "PPCTargetMachine.h"
Chris Lattner59138102006-04-17 05:28:54 +000016#include "PPCPerfectShuffle.h"
Nate Begeman750ac1b2006-02-01 07:19:44 +000017#include "llvm/ADT/VectorExtras.h"
Evan Chengc4c62572006-03-13 23:20:37 +000018#include "llvm/Analysis/ScalarEvolutionExpressions.h"
Chris Lattner7c5a3d32005-08-16 17:14:42 +000019#include "llvm/CodeGen/MachineFrameInfo.h"
20#include "llvm/CodeGen/MachineFunction.h"
Chris Lattner8a2d3ca2005-08-26 21:23:58 +000021#include "llvm/CodeGen/MachineInstrBuilder.h"
Chris Lattner7c5a3d32005-08-16 17:14:42 +000022#include "llvm/CodeGen/SelectionDAG.h"
Chris Lattner7b738342005-09-13 19:33:40 +000023#include "llvm/CodeGen/SSARegMap.h"
Chris Lattner0b1e4e52005-08-26 17:36:52 +000024#include "llvm/Constants.h"
Chris Lattner7c5a3d32005-08-16 17:14:42 +000025#include "llvm/Function.h"
Chris Lattner6d92cad2006-03-26 10:06:40 +000026#include "llvm/Intrinsics.h"
Nate Begeman750ac1b2006-02-01 07:19:44 +000027#include "llvm/Support/MathExtras.h"
Evan Chengd2ee2182006-02-18 00:08:58 +000028#include "llvm/Target/TargetOptions.h"
Chris Lattner7c5a3d32005-08-16 17:14:42 +000029using namespace llvm;
30
Nate Begeman21e463b2005-10-16 05:39:50 +000031PPCTargetLowering::PPCTargetLowering(TargetMachine &TM)
Chris Lattner7c5a3d32005-08-16 17:14:42 +000032 : TargetLowering(TM) {
33
34 // Fold away setcc operations if possible.
35 setSetCCIsExpensive();
Nate Begeman405e3ec2005-10-21 00:02:42 +000036 setPow2DivIsCheap();
Chris Lattner7c5a3d32005-08-16 17:14:42 +000037
Chris Lattnerd145a612005-09-27 22:18:25 +000038 // Use _setjmp/_longjmp instead of setjmp/longjmp.
39 setUseUnderscoreSetJmpLongJmp(true);
40
Chris Lattner7c5a3d32005-08-16 17:14:42 +000041 // Set up the register classes.
Nate Begeman1d9d7422005-10-18 00:28:58 +000042 addRegisterClass(MVT::i32, PPC::GPRCRegisterClass);
43 addRegisterClass(MVT::f32, PPC::F4RCRegisterClass);
44 addRegisterClass(MVT::f64, PPC::F8RCRegisterClass);
Chris Lattner7c5a3d32005-08-16 17:14:42 +000045
Chris Lattnera54aa942006-01-29 06:26:08 +000046 setOperationAction(ISD::ConstantFP, MVT::f64, Expand);
47 setOperationAction(ISD::ConstantFP, MVT::f32, Expand);
48
Chris Lattner7c5a3d32005-08-16 17:14:42 +000049 // PowerPC has no intrinsics for these particular operations
50 setOperationAction(ISD::MEMMOVE, MVT::Other, Expand);
51 setOperationAction(ISD::MEMSET, MVT::Other, Expand);
52 setOperationAction(ISD::MEMCPY, MVT::Other, Expand);
53
54 // PowerPC has an i16 but no i8 (or i1) SEXTLOAD
55 setOperationAction(ISD::SEXTLOAD, MVT::i1, Expand);
56 setOperationAction(ISD::SEXTLOAD, MVT::i8, Expand);
57
58 // PowerPC has no SREM/UREM instructions
59 setOperationAction(ISD::SREM, MVT::i32, Expand);
60 setOperationAction(ISD::UREM, MVT::i32, Expand);
61
62 // We don't support sin/cos/sqrt/fmod
63 setOperationAction(ISD::FSIN , MVT::f64, Expand);
64 setOperationAction(ISD::FCOS , MVT::f64, Expand);
Chris Lattner615c2d02005-09-28 22:29:58 +000065 setOperationAction(ISD::FREM , MVT::f64, Expand);
Chris Lattner7c5a3d32005-08-16 17:14:42 +000066 setOperationAction(ISD::FSIN , MVT::f32, Expand);
67 setOperationAction(ISD::FCOS , MVT::f32, Expand);
Chris Lattner615c2d02005-09-28 22:29:58 +000068 setOperationAction(ISD::FREM , MVT::f32, Expand);
Chris Lattner7c5a3d32005-08-16 17:14:42 +000069
70 // If we're enabling GP optimizations, use hardware square root
Chris Lattner1e9de3e2005-09-02 18:33:05 +000071 if (!TM.getSubtarget<PPCSubtarget>().hasFSQRT()) {
Chris Lattner7c5a3d32005-08-16 17:14:42 +000072 setOperationAction(ISD::FSQRT, MVT::f64, Expand);
73 setOperationAction(ISD::FSQRT, MVT::f32, Expand);
74 }
75
Chris Lattner9601a862006-03-05 05:08:37 +000076 setOperationAction(ISD::FCOPYSIGN, MVT::f64, Expand);
77 setOperationAction(ISD::FCOPYSIGN, MVT::f32, Expand);
78
Nate Begemand88fc032006-01-14 03:14:10 +000079 // PowerPC does not have BSWAP, CTPOP or CTTZ
80 setOperationAction(ISD::BSWAP, MVT::i32 , Expand);
Chris Lattner7c5a3d32005-08-16 17:14:42 +000081 setOperationAction(ISD::CTPOP, MVT::i32 , Expand);
82 setOperationAction(ISD::CTTZ , MVT::i32 , Expand);
83
Nate Begeman35ef9132006-01-11 21:21:00 +000084 // PowerPC does not have ROTR
85 setOperationAction(ISD::ROTR, MVT::i32 , Expand);
86
Chris Lattner7c5a3d32005-08-16 17:14:42 +000087 // PowerPC does not have Select
88 setOperationAction(ISD::SELECT, MVT::i32, Expand);
89 setOperationAction(ISD::SELECT, MVT::f32, Expand);
90 setOperationAction(ISD::SELECT, MVT::f64, Expand);
Chris Lattnere4bc9ea2005-08-26 00:52:45 +000091
Chris Lattner0b1e4e52005-08-26 17:36:52 +000092 // PowerPC wants to turn select_cc of FP into fsel when possible.
93 setOperationAction(ISD::SELECT_CC, MVT::f32, Custom);
94 setOperationAction(ISD::SELECT_CC, MVT::f64, Custom);
Nate Begeman44775902006-01-31 08:17:29 +000095
Nate Begeman750ac1b2006-02-01 07:19:44 +000096 // PowerPC wants to optimize integer setcc a bit
Nate Begeman44775902006-01-31 08:17:29 +000097 setOperationAction(ISD::SETCC, MVT::i32, Custom);
Chris Lattnereb9b62e2005-08-31 19:09:57 +000098
Nate Begeman81e80972006-03-17 01:40:33 +000099 // PowerPC does not have BRCOND which requires SetCC
100 setOperationAction(ISD::BRCOND, MVT::Other, Expand);
Chris Lattner7c5a3d32005-08-16 17:14:42 +0000101
Chris Lattnerf7605322005-08-31 21:09:52 +0000102 // PowerPC turns FP_TO_SINT into FCTIWZ and some load/stores.
103 setOperationAction(ISD::FP_TO_SINT, MVT::i32, Custom);
Nate Begemanc09eeec2005-09-06 22:03:27 +0000104
Jim Laskeyad23c9d2005-08-17 00:40:22 +0000105 // PowerPC does not have [U|S]INT_TO_FP
106 setOperationAction(ISD::SINT_TO_FP, MVT::i32, Expand);
107 setOperationAction(ISD::UINT_TO_FP, MVT::i32, Expand);
108
Chris Lattner53e88452005-12-23 05:13:35 +0000109 setOperationAction(ISD::BIT_CONVERT, MVT::f32, Expand);
110 setOperationAction(ISD::BIT_CONVERT, MVT::i32, Expand);
111
Chris Lattnere6ec9f22005-09-10 00:21:06 +0000112 // PowerPC does not have truncstore for i1.
113 setOperationAction(ISD::TRUNCSTORE, MVT::i1, Promote);
Chris Lattnerf73bae12005-11-29 06:16:21 +0000114
Chris Lattner25b8b8c2006-04-28 21:56:10 +0000115 // We cannot sextinreg(i1). Expand to shifts.
116 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i1, Expand);
117
118
Jim Laskeyabf6d172006-01-05 01:25:28 +0000119 // Support label based line numbers.
Chris Lattnerf73bae12005-11-29 06:16:21 +0000120 setOperationAction(ISD::LOCATION, MVT::Other, Expand);
Jim Laskeye0bce712006-01-05 01:47:43 +0000121 setOperationAction(ISD::DEBUG_LOC, MVT::Other, Expand);
Jim Laskeyabf6d172006-01-05 01:25:28 +0000122 // FIXME - use subtarget debug flags
Jim Laskeye0bce712006-01-05 01:47:43 +0000123 if (!TM.getSubtarget<PPCSubtarget>().isDarwin())
Jim Laskeyabf6d172006-01-05 01:25:28 +0000124 setOperationAction(ISD::DEBUG_LABEL, MVT::Other, Expand);
Chris Lattnere6ec9f22005-09-10 00:21:06 +0000125
Nate Begeman28a6b022005-12-10 02:36:00 +0000126 // We want to legalize GlobalAddress and ConstantPool nodes into the
127 // appropriate instructions to materialize the address.
Chris Lattner3eef4e32005-11-17 18:26:56 +0000128 setOperationAction(ISD::GlobalAddress, MVT::i32, Custom);
Nate Begeman28a6b022005-12-10 02:36:00 +0000129 setOperationAction(ISD::ConstantPool, MVT::i32, Custom);
Nate Begeman37efe672006-04-22 18:53:45 +0000130 setOperationAction(ISD::JumpTable, MVT::i32, Custom);
Chris Lattnerb99329e2006-01-13 02:42:53 +0000131
Nate Begemanee625572006-01-27 21:09:22 +0000132 // RET must be custom lowered, to meet ABI requirements
133 setOperationAction(ISD::RET , MVT::Other, Custom);
134
Nate Begemanacc398c2006-01-25 18:21:52 +0000135 // VASTART needs to be custom lowered to use the VarArgsFrameIndex
136 setOperationAction(ISD::VASTART , MVT::Other, Custom);
137
Chris Lattnerb22c08b2006-01-15 09:02:48 +0000138 // Use the default implementation.
Nate Begemanacc398c2006-01-25 18:21:52 +0000139 setOperationAction(ISD::VAARG , MVT::Other, Expand);
140 setOperationAction(ISD::VACOPY , MVT::Other, Expand);
141 setOperationAction(ISD::VAEND , MVT::Other, Expand);
Chris Lattnerb22c08b2006-01-15 09:02:48 +0000142 setOperationAction(ISD::STACKSAVE , MVT::Other, Expand);
143 setOperationAction(ISD::STACKRESTORE , MVT::Other, Expand);
144 setOperationAction(ISD::DYNAMIC_STACKALLOC, MVT::i32 , Expand);
Chris Lattner860e8862005-11-17 07:30:41 +0000145
Chris Lattner6d92cad2006-03-26 10:06:40 +0000146 // We want to custom lower some of our intrinsics.
Chris Lattner48b61a72006-03-28 00:40:33 +0000147 setOperationAction(ISD::INTRINSIC_WO_CHAIN, MVT::Other, Custom);
Chris Lattner6d92cad2006-03-26 10:06:40 +0000148
Nate Begemanc09eeec2005-09-06 22:03:27 +0000149 if (TM.getSubtarget<PPCSubtarget>().is64Bit()) {
Nate Begeman1d9d7422005-10-18 00:28:58 +0000150 // They also have instructions for converting between i64 and fp.
Nate Begemanc09eeec2005-09-06 22:03:27 +0000151 setOperationAction(ISD::FP_TO_SINT, MVT::i64, Custom);
152 setOperationAction(ISD::SINT_TO_FP, MVT::i64, Custom);
Chris Lattner7fbcef72006-03-24 07:53:47 +0000153
154 // FIXME: disable this lowered code. This generates 64-bit register values,
155 // and we don't model the fact that the top part is clobbered by calls. We
156 // need to flag these together so that the value isn't live across a call.
157 //setOperationAction(ISD::SINT_TO_FP, MVT::i32, Custom);
158
Nate Begemanae749a92005-10-25 23:48:36 +0000159 // To take advantage of the above i64 FP_TO_SINT, promote i32 FP_TO_UINT
160 setOperationAction(ISD::FP_TO_UINT, MVT::i32, Promote);
161 } else {
Chris Lattner860e8862005-11-17 07:30:41 +0000162 // PowerPC does not have FP_TO_UINT on 32-bit implementations.
Nate Begemanae749a92005-10-25 23:48:36 +0000163 setOperationAction(ISD::FP_TO_UINT, MVT::i32, Expand);
Nate Begeman9d2b8172005-10-18 00:56:42 +0000164 }
165
166 if (TM.getSubtarget<PPCSubtarget>().has64BitRegs()) {
167 // 64 bit PowerPC implementations can support i64 types directly
168 addRegisterClass(MVT::i64, PPC::G8RCRegisterClass);
Nate Begeman1d9d7422005-10-18 00:28:58 +0000169 // BUILD_PAIR can't be handled natively, and should be expanded to shl/or
170 setOperationAction(ISD::BUILD_PAIR, MVT::i64, Expand);
Nate Begeman1d9d7422005-10-18 00:28:58 +0000171 } else {
172 // 32 bit PowerPC wants to expand i64 shifts itself.
173 setOperationAction(ISD::SHL, MVT::i64, Custom);
174 setOperationAction(ISD::SRL, MVT::i64, Custom);
175 setOperationAction(ISD::SRA, MVT::i64, Custom);
Nate Begemanc09eeec2005-09-06 22:03:27 +0000176 }
Evan Chengd30bf012006-03-01 01:11:20 +0000177
Nate Begeman425a9692005-11-29 08:17:20 +0000178 if (TM.getSubtarget<PPCSubtarget>().hasAltivec()) {
Chris Lattnere3fea5a2006-03-31 19:52:36 +0000179 // First set operation action for all vector types to expand. Then we
180 // will selectively turn on ones that can be effectively codegen'd.
181 for (unsigned VT = (unsigned)MVT::FIRST_VECTOR_VALUETYPE;
182 VT != (unsigned)MVT::LAST_VECTOR_VALUETYPE; ++VT) {
Chris Lattnerf3f69de2006-04-16 01:37:57 +0000183 // add/sub are legal for all supported vector VT's.
Chris Lattnere3fea5a2006-03-31 19:52:36 +0000184 setOperationAction(ISD::ADD , (MVT::ValueType)VT, Legal);
185 setOperationAction(ISD::SUB , (MVT::ValueType)VT, Legal);
Chris Lattnere3fea5a2006-03-31 19:52:36 +0000186
Chris Lattner7ff7e672006-04-04 17:25:31 +0000187 // We promote all shuffles to v16i8.
188 setOperationAction(ISD::VECTOR_SHUFFLE, (MVT::ValueType)VT, Promote);
Chris Lattnerf3f69de2006-04-16 01:37:57 +0000189 AddPromotedToType (ISD::VECTOR_SHUFFLE, (MVT::ValueType)VT, MVT::v16i8);
190
191 // We promote all non-typed operations to v4i32.
192 setOperationAction(ISD::AND , (MVT::ValueType)VT, Promote);
193 AddPromotedToType (ISD::AND , (MVT::ValueType)VT, MVT::v4i32);
194 setOperationAction(ISD::OR , (MVT::ValueType)VT, Promote);
195 AddPromotedToType (ISD::OR , (MVT::ValueType)VT, MVT::v4i32);
196 setOperationAction(ISD::XOR , (MVT::ValueType)VT, Promote);
197 AddPromotedToType (ISD::XOR , (MVT::ValueType)VT, MVT::v4i32);
198 setOperationAction(ISD::LOAD , (MVT::ValueType)VT, Promote);
199 AddPromotedToType (ISD::LOAD , (MVT::ValueType)VT, MVT::v4i32);
200 setOperationAction(ISD::SELECT, (MVT::ValueType)VT, Promote);
201 AddPromotedToType (ISD::SELECT, (MVT::ValueType)VT, MVT::v4i32);
202 setOperationAction(ISD::STORE, (MVT::ValueType)VT, Promote);
203 AddPromotedToType (ISD::STORE, (MVT::ValueType)VT, MVT::v4i32);
Chris Lattnere3fea5a2006-03-31 19:52:36 +0000204
Chris Lattnerf3f69de2006-04-16 01:37:57 +0000205 // No other operations are legal.
Chris Lattnere3fea5a2006-03-31 19:52:36 +0000206 setOperationAction(ISD::MUL , (MVT::ValueType)VT, Expand);
207 setOperationAction(ISD::SDIV, (MVT::ValueType)VT, Expand);
208 setOperationAction(ISD::SREM, (MVT::ValueType)VT, Expand);
209 setOperationAction(ISD::UDIV, (MVT::ValueType)VT, Expand);
210 setOperationAction(ISD::UREM, (MVT::ValueType)VT, Expand);
211 setOperationAction(ISD::EXTRACT_VECTOR_ELT, (MVT::ValueType)VT, Expand);
212 setOperationAction(ISD::INSERT_VECTOR_ELT, (MVT::ValueType)VT, Expand);
213 setOperationAction(ISD::BUILD_VECTOR, (MVT::ValueType)VT, Expand);
Chris Lattner01cae072006-04-03 23:55:43 +0000214
215 setOperationAction(ISD::SCALAR_TO_VECTOR, (MVT::ValueType)VT, Expand);
Chris Lattnere3fea5a2006-03-31 19:52:36 +0000216 }
217
Chris Lattner7ff7e672006-04-04 17:25:31 +0000218 // We can custom expand all VECTOR_SHUFFLEs to VPERM, others we can handle
219 // with merges, splats, etc.
220 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v16i8, Custom);
221
Chris Lattnerf3f69de2006-04-16 01:37:57 +0000222 setOperationAction(ISD::AND , MVT::v4i32, Legal);
223 setOperationAction(ISD::OR , MVT::v4i32, Legal);
224 setOperationAction(ISD::XOR , MVT::v4i32, Legal);
225 setOperationAction(ISD::LOAD , MVT::v4i32, Legal);
226 setOperationAction(ISD::SELECT, MVT::v4i32, Expand);
227 setOperationAction(ISD::STORE , MVT::v4i32, Legal);
228
Nate Begeman425a9692005-11-29 08:17:20 +0000229 addRegisterClass(MVT::v4f32, PPC::VRRCRegisterClass);
Nate Begeman7fd1edd2005-12-19 23:25:09 +0000230 addRegisterClass(MVT::v4i32, PPC::VRRCRegisterClass);
Chris Lattner8d052bc2006-03-25 07:39:07 +0000231 addRegisterClass(MVT::v8i16, PPC::VRRCRegisterClass);
232 addRegisterClass(MVT::v16i8, PPC::VRRCRegisterClass);
Chris Lattnerec4a0c72006-01-29 06:32:58 +0000233
Chris Lattnere3fea5a2006-03-31 19:52:36 +0000234 setOperationAction(ISD::MUL, MVT::v4f32, Legal);
Chris Lattnere7c768e2006-04-18 03:24:30 +0000235 setOperationAction(ISD::MUL, MVT::v4i32, Custom);
Chris Lattner72dd9bd2006-04-18 03:43:48 +0000236 setOperationAction(ISD::MUL, MVT::v8i16, Custom);
Chris Lattner19a81522006-04-18 03:57:35 +0000237 setOperationAction(ISD::MUL, MVT::v16i8, Custom);
Chris Lattnerf1d0b2b2006-03-20 01:53:53 +0000238
Chris Lattnerb2177b92006-03-19 06:55:52 +0000239 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v4f32, Custom);
240 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v4i32, Custom);
Chris Lattner64b3a082006-03-24 07:48:08 +0000241
Chris Lattner541f91b2006-04-02 00:43:36 +0000242 setOperationAction(ISD::BUILD_VECTOR, MVT::v16i8, Custom);
243 setOperationAction(ISD::BUILD_VECTOR, MVT::v8i16, Custom);
Chris Lattner64b3a082006-03-24 07:48:08 +0000244 setOperationAction(ISD::BUILD_VECTOR, MVT::v4i32, Custom);
245 setOperationAction(ISD::BUILD_VECTOR, MVT::v4f32, Custom);
Nate Begeman425a9692005-11-29 08:17:20 +0000246 }
247
Chris Lattner7c5a3d32005-08-16 17:14:42 +0000248 setSetCCResultContents(ZeroOrOneSetCCResult);
Chris Lattnercadd7422006-01-13 17:52:03 +0000249 setStackPointerRegisterToSaveRestore(PPC::R1);
Chris Lattner7c5a3d32005-08-16 17:14:42 +0000250
Chris Lattner8c13d0a2006-03-01 04:57:39 +0000251 // We have target-specific dag combine patterns for the following nodes:
252 setTargetDAGCombine(ISD::SINT_TO_FP);
Chris Lattner51269842006-03-01 05:50:56 +0000253 setTargetDAGCombine(ISD::STORE);
Chris Lattner90564f22006-04-18 17:59:36 +0000254 setTargetDAGCombine(ISD::BR_CC);
Chris Lattner8c13d0a2006-03-01 04:57:39 +0000255
Chris Lattner7c5a3d32005-08-16 17:14:42 +0000256 computeRegisterProperties();
257}
258
Chris Lattnerda6d20f2006-01-09 23:52:17 +0000259const char *PPCTargetLowering::getTargetNodeName(unsigned Opcode) const {
260 switch (Opcode) {
261 default: return 0;
262 case PPCISD::FSEL: return "PPCISD::FSEL";
263 case PPCISD::FCFID: return "PPCISD::FCFID";
264 case PPCISD::FCTIDZ: return "PPCISD::FCTIDZ";
265 case PPCISD::FCTIWZ: return "PPCISD::FCTIWZ";
Chris Lattner51269842006-03-01 05:50:56 +0000266 case PPCISD::STFIWX: return "PPCISD::STFIWX";
Chris Lattnerda6d20f2006-01-09 23:52:17 +0000267 case PPCISD::VMADDFP: return "PPCISD::VMADDFP";
268 case PPCISD::VNMSUBFP: return "PPCISD::VNMSUBFP";
Chris Lattnerf1d0b2b2006-03-20 01:53:53 +0000269 case PPCISD::VPERM: return "PPCISD::VPERM";
Chris Lattnerda6d20f2006-01-09 23:52:17 +0000270 case PPCISD::Hi: return "PPCISD::Hi";
271 case PPCISD::Lo: return "PPCISD::Lo";
272 case PPCISD::GlobalBaseReg: return "PPCISD::GlobalBaseReg";
273 case PPCISD::SRL: return "PPCISD::SRL";
274 case PPCISD::SRA: return "PPCISD::SRA";
275 case PPCISD::SHL: return "PPCISD::SHL";
Chris Lattnerecfe55e2006-03-22 05:30:33 +0000276 case PPCISD::EXTSW_32: return "PPCISD::EXTSW_32";
277 case PPCISD::STD_32: return "PPCISD::STD_32";
Chris Lattnere00ebf02006-01-28 07:33:03 +0000278 case PPCISD::CALL: return "PPCISD::CALL";
Chris Lattnerda6d20f2006-01-09 23:52:17 +0000279 case PPCISD::RET_FLAG: return "PPCISD::RET_FLAG";
Chris Lattner6d92cad2006-03-26 10:06:40 +0000280 case PPCISD::MFCR: return "PPCISD::MFCR";
Chris Lattnera17b1552006-03-31 05:13:27 +0000281 case PPCISD::VCMP: return "PPCISD::VCMP";
Chris Lattner6d92cad2006-03-26 10:06:40 +0000282 case PPCISD::VCMPo: return "PPCISD::VCMPo";
Chris Lattnerf70f8d92006-04-18 18:05:58 +0000283 case PPCISD::COND_BRANCH: return "PPCISD::COND_BRANCH";
Chris Lattnerda6d20f2006-01-09 23:52:17 +0000284 }
285}
286
Chris Lattner1a635d62006-04-14 06:01:58 +0000287//===----------------------------------------------------------------------===//
288// Node matching predicates, for use by the tblgen matching code.
289//===----------------------------------------------------------------------===//
290
Chris Lattner0b1e4e52005-08-26 17:36:52 +0000291/// isFloatingPointZero - Return true if this is 0.0 or -0.0.
292static bool isFloatingPointZero(SDOperand Op) {
293 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(Op))
294 return CFP->isExactlyValue(-0.0) || CFP->isExactlyValue(0.0);
295 else if (Op.getOpcode() == ISD::EXTLOAD || Op.getOpcode() == ISD::LOAD) {
296 // Maybe this has already been legalized into the constant pool?
297 if (ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(Op.getOperand(1)))
298 if (ConstantFP *CFP = dyn_cast<ConstantFP>(CP->get()))
299 return CFP->isExactlyValue(-0.0) || CFP->isExactlyValue(0.0);
300 }
301 return false;
302}
303
Chris Lattnerddb739e2006-04-06 17:23:16 +0000304/// isConstantOrUndef - Op is either an undef node or a ConstantSDNode. Return
305/// true if Op is undef or if it matches the specified value.
306static bool isConstantOrUndef(SDOperand Op, unsigned Val) {
307 return Op.getOpcode() == ISD::UNDEF ||
308 cast<ConstantSDNode>(Op)->getValue() == Val;
309}
310
311/// isVPKUHUMShuffleMask - Return true if this is the shuffle mask for a
312/// VPKUHUM instruction.
Chris Lattnerf24380e2006-04-06 22:28:36 +0000313bool PPC::isVPKUHUMShuffleMask(SDNode *N, bool isUnary) {
314 if (!isUnary) {
315 for (unsigned i = 0; i != 16; ++i)
316 if (!isConstantOrUndef(N->getOperand(i), i*2+1))
317 return false;
318 } else {
319 for (unsigned i = 0; i != 8; ++i)
320 if (!isConstantOrUndef(N->getOperand(i), i*2+1) ||
321 !isConstantOrUndef(N->getOperand(i+8), i*2+1))
322 return false;
323 }
Chris Lattnerd0608e12006-04-06 18:26:28 +0000324 return true;
Chris Lattnerddb739e2006-04-06 17:23:16 +0000325}
326
327/// isVPKUWUMShuffleMask - Return true if this is the shuffle mask for a
328/// VPKUWUM instruction.
Chris Lattnerf24380e2006-04-06 22:28:36 +0000329bool PPC::isVPKUWUMShuffleMask(SDNode *N, bool isUnary) {
330 if (!isUnary) {
331 for (unsigned i = 0; i != 16; i += 2)
332 if (!isConstantOrUndef(N->getOperand(i ), i*2+2) ||
333 !isConstantOrUndef(N->getOperand(i+1), i*2+3))
334 return false;
335 } else {
336 for (unsigned i = 0; i != 8; i += 2)
337 if (!isConstantOrUndef(N->getOperand(i ), i*2+2) ||
338 !isConstantOrUndef(N->getOperand(i+1), i*2+3) ||
339 !isConstantOrUndef(N->getOperand(i+8), i*2+2) ||
340 !isConstantOrUndef(N->getOperand(i+9), i*2+3))
341 return false;
342 }
Chris Lattnerd0608e12006-04-06 18:26:28 +0000343 return true;
Chris Lattnerddb739e2006-04-06 17:23:16 +0000344}
345
Chris Lattnercaad1632006-04-06 22:02:42 +0000346/// isVMerge - Common function, used to match vmrg* shuffles.
347///
348static bool isVMerge(SDNode *N, unsigned UnitSize,
349 unsigned LHSStart, unsigned RHSStart) {
Chris Lattner116cc482006-04-06 21:11:54 +0000350 assert(N->getOpcode() == ISD::BUILD_VECTOR &&
351 N->getNumOperands() == 16 && "PPC only supports shuffles by bytes!");
352 assert((UnitSize == 1 || UnitSize == 2 || UnitSize == 4) &&
353 "Unsupported merge size!");
354
355 for (unsigned i = 0; i != 8/UnitSize; ++i) // Step over units
356 for (unsigned j = 0; j != UnitSize; ++j) { // Step over bytes within unit
357 if (!isConstantOrUndef(N->getOperand(i*UnitSize*2+j),
Chris Lattnercaad1632006-04-06 22:02:42 +0000358 LHSStart+j+i*UnitSize) ||
Chris Lattner116cc482006-04-06 21:11:54 +0000359 !isConstantOrUndef(N->getOperand(i*UnitSize*2+UnitSize+j),
Chris Lattnercaad1632006-04-06 22:02:42 +0000360 RHSStart+j+i*UnitSize))
Chris Lattner116cc482006-04-06 21:11:54 +0000361 return false;
362 }
Chris Lattnercaad1632006-04-06 22:02:42 +0000363 return true;
364}
365
366/// isVMRGLShuffleMask - Return true if this is a shuffle mask suitable for
367/// a VRGL* instruction with the specified unit size (1,2 or 4 bytes).
368bool PPC::isVMRGLShuffleMask(SDNode *N, unsigned UnitSize, bool isUnary) {
369 if (!isUnary)
370 return isVMerge(N, UnitSize, 8, 24);
371 return isVMerge(N, UnitSize, 8, 8);
Chris Lattner116cc482006-04-06 21:11:54 +0000372}
373
374/// isVMRGHShuffleMask - Return true if this is a shuffle mask suitable for
375/// a VRGH* instruction with the specified unit size (1,2 or 4 bytes).
Chris Lattnercaad1632006-04-06 22:02:42 +0000376bool PPC::isVMRGHShuffleMask(SDNode *N, unsigned UnitSize, bool isUnary) {
377 if (!isUnary)
378 return isVMerge(N, UnitSize, 0, 16);
379 return isVMerge(N, UnitSize, 0, 0);
Chris Lattner116cc482006-04-06 21:11:54 +0000380}
381
382
Chris Lattnerd0608e12006-04-06 18:26:28 +0000383/// isVSLDOIShuffleMask - If this is a vsldoi shuffle mask, return the shift
384/// amount, otherwise return -1.
Chris Lattnerf24380e2006-04-06 22:28:36 +0000385int PPC::isVSLDOIShuffleMask(SDNode *N, bool isUnary) {
Chris Lattner116cc482006-04-06 21:11:54 +0000386 assert(N->getOpcode() == ISD::BUILD_VECTOR &&
387 N->getNumOperands() == 16 && "PPC only supports shuffles by bytes!");
Chris Lattnerd0608e12006-04-06 18:26:28 +0000388 // Find the first non-undef value in the shuffle mask.
389 unsigned i;
390 for (i = 0; i != 16 && N->getOperand(i).getOpcode() == ISD::UNDEF; ++i)
391 /*search*/;
392
393 if (i == 16) return -1; // all undef.
394
395 // Otherwise, check to see if the rest of the elements are consequtively
396 // numbered from this value.
397 unsigned ShiftAmt = cast<ConstantSDNode>(N->getOperand(i))->getValue();
398 if (ShiftAmt < i) return -1;
399 ShiftAmt -= i;
Chris Lattnerddb739e2006-04-06 17:23:16 +0000400
Chris Lattnerf24380e2006-04-06 22:28:36 +0000401 if (!isUnary) {
402 // Check the rest of the elements to see if they are consequtive.
403 for (++i; i != 16; ++i)
404 if (!isConstantOrUndef(N->getOperand(i), ShiftAmt+i))
405 return -1;
406 } else {
407 // Check the rest of the elements to see if they are consequtive.
408 for (++i; i != 16; ++i)
409 if (!isConstantOrUndef(N->getOperand(i), (ShiftAmt+i) & 15))
410 return -1;
411 }
Chris Lattnerd0608e12006-04-06 18:26:28 +0000412
413 return ShiftAmt;
414}
Chris Lattneref819f82006-03-20 06:33:01 +0000415
416/// isSplatShuffleMask - Return true if the specified VECTOR_SHUFFLE operand
417/// specifies a splat of a single element that is suitable for input to
418/// VSPLTB/VSPLTH/VSPLTW.
Chris Lattner7ff7e672006-04-04 17:25:31 +0000419bool PPC::isSplatShuffleMask(SDNode *N, unsigned EltSize) {
420 assert(N->getOpcode() == ISD::BUILD_VECTOR &&
421 N->getNumOperands() == 16 &&
422 (EltSize == 1 || EltSize == 2 || EltSize == 4));
Chris Lattnerdd4d2d02006-03-20 06:51:10 +0000423
Chris Lattner88a99ef2006-03-20 06:37:44 +0000424 // This is a splat operation if each element of the permute is the same, and
425 // if the value doesn't reference the second vector.
Chris Lattner7ff7e672006-04-04 17:25:31 +0000426 unsigned ElementBase = 0;
Chris Lattner88a99ef2006-03-20 06:37:44 +0000427 SDOperand Elt = N->getOperand(0);
Chris Lattner7ff7e672006-04-04 17:25:31 +0000428 if (ConstantSDNode *EltV = dyn_cast<ConstantSDNode>(Elt))
429 ElementBase = EltV->getValue();
430 else
431 return false; // FIXME: Handle UNDEF elements too!
432
433 if (cast<ConstantSDNode>(Elt)->getValue() >= 16)
434 return false;
435
436 // Check that they are consequtive.
437 for (unsigned i = 1; i != EltSize; ++i) {
438 if (!isa<ConstantSDNode>(N->getOperand(i)) ||
439 cast<ConstantSDNode>(N->getOperand(i))->getValue() != i+ElementBase)
440 return false;
441 }
442
Chris Lattner88a99ef2006-03-20 06:37:44 +0000443 assert(isa<ConstantSDNode>(Elt) && "Invalid VECTOR_SHUFFLE mask!");
Chris Lattner7ff7e672006-04-04 17:25:31 +0000444 for (unsigned i = EltSize, e = 16; i != e; i += EltSize) {
Chris Lattnerb097aa92006-04-14 23:19:08 +0000445 if (N->getOperand(i).getOpcode() == ISD::UNDEF) continue;
Chris Lattner88a99ef2006-03-20 06:37:44 +0000446 assert(isa<ConstantSDNode>(N->getOperand(i)) &&
447 "Invalid VECTOR_SHUFFLE mask!");
Chris Lattner7ff7e672006-04-04 17:25:31 +0000448 for (unsigned j = 0; j != EltSize; ++j)
449 if (N->getOperand(i+j) != N->getOperand(j))
450 return false;
Chris Lattner88a99ef2006-03-20 06:37:44 +0000451 }
452
Chris Lattner7ff7e672006-04-04 17:25:31 +0000453 return true;
Chris Lattneref819f82006-03-20 06:33:01 +0000454}
455
456/// getVSPLTImmediate - Return the appropriate VSPLT* immediate to splat the
457/// specified isSplatShuffleMask VECTOR_SHUFFLE mask.
Chris Lattner7ff7e672006-04-04 17:25:31 +0000458unsigned PPC::getVSPLTImmediate(SDNode *N, unsigned EltSize) {
459 assert(isSplatShuffleMask(N, EltSize));
460 return cast<ConstantSDNode>(N->getOperand(0))->getValue() / EltSize;
Chris Lattneref819f82006-03-20 06:33:01 +0000461}
462
Chris Lattnere87192a2006-04-12 17:37:20 +0000463/// get_VSPLTI_elt - If this is a build_vector of constants which can be formed
Chris Lattner140a58f2006-04-08 06:46:53 +0000464/// by using a vspltis[bhw] instruction of the specified element size, return
465/// the constant being splatted. The ByteSize field indicates the number of
466/// bytes of each element [124] -> [bhw].
Chris Lattnere87192a2006-04-12 17:37:20 +0000467SDOperand PPC::get_VSPLTI_elt(SDNode *N, unsigned ByteSize, SelectionDAG &DAG) {
Chris Lattner9c61dcf2006-03-25 06:12:06 +0000468 SDOperand OpVal(0, 0);
Chris Lattner79d9a882006-04-08 07:14:26 +0000469
470 // If ByteSize of the splat is bigger than the element size of the
471 // build_vector, then we have a case where we are checking for a splat where
472 // multiple elements of the buildvector are folded together into a single
473 // logical element of the splat (e.g. "vsplish 1" to splat {0,1}*8).
474 unsigned EltSize = 16/N->getNumOperands();
475 if (EltSize < ByteSize) {
476 unsigned Multiple = ByteSize/EltSize; // Number of BV entries per spltval.
477 SDOperand UniquedVals[4];
478 assert(Multiple > 1 && Multiple <= 4 && "How can this happen?");
479
480 // See if all of the elements in the buildvector agree across.
481 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) {
482 if (N->getOperand(i).getOpcode() == ISD::UNDEF) continue;
483 // If the element isn't a constant, bail fully out.
484 if (!isa<ConstantSDNode>(N->getOperand(i))) return SDOperand();
485
486
487 if (UniquedVals[i&(Multiple-1)].Val == 0)
488 UniquedVals[i&(Multiple-1)] = N->getOperand(i);
489 else if (UniquedVals[i&(Multiple-1)] != N->getOperand(i))
490 return SDOperand(); // no match.
491 }
492
493 // Okay, if we reached this point, UniquedVals[0..Multiple-1] contains
494 // either constant or undef values that are identical for each chunk. See
495 // if these chunks can form into a larger vspltis*.
496
497 // Check to see if all of the leading entries are either 0 or -1. If
498 // neither, then this won't fit into the immediate field.
499 bool LeadingZero = true;
500 bool LeadingOnes = true;
501 for (unsigned i = 0; i != Multiple-1; ++i) {
502 if (UniquedVals[i].Val == 0) continue; // Must have been undefs.
503
504 LeadingZero &= cast<ConstantSDNode>(UniquedVals[i])->isNullValue();
505 LeadingOnes &= cast<ConstantSDNode>(UniquedVals[i])->isAllOnesValue();
506 }
507 // Finally, check the least significant entry.
508 if (LeadingZero) {
509 if (UniquedVals[Multiple-1].Val == 0)
510 return DAG.getTargetConstant(0, MVT::i32); // 0,0,0,undef
511 int Val = cast<ConstantSDNode>(UniquedVals[Multiple-1])->getValue();
512 if (Val < 16)
513 return DAG.getTargetConstant(Val, MVT::i32); // 0,0,0,4 -> vspltisw(4)
514 }
515 if (LeadingOnes) {
516 if (UniquedVals[Multiple-1].Val == 0)
517 return DAG.getTargetConstant(~0U, MVT::i32); // -1,-1,-1,undef
518 int Val =cast<ConstantSDNode>(UniquedVals[Multiple-1])->getSignExtended();
519 if (Val >= -16) // -1,-1,-1,-2 -> vspltisw(-2)
520 return DAG.getTargetConstant(Val, MVT::i32);
521 }
522
523 return SDOperand();
524 }
525
Chris Lattner9c61dcf2006-03-25 06:12:06 +0000526 // Check to see if this buildvec has a single non-undef value in its elements.
527 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) {
528 if (N->getOperand(i).getOpcode() == ISD::UNDEF) continue;
529 if (OpVal.Val == 0)
530 OpVal = N->getOperand(i);
531 else if (OpVal != N->getOperand(i))
Chris Lattner140a58f2006-04-08 06:46:53 +0000532 return SDOperand();
Chris Lattner9c61dcf2006-03-25 06:12:06 +0000533 }
534
Chris Lattner140a58f2006-04-08 06:46:53 +0000535 if (OpVal.Val == 0) return SDOperand(); // All UNDEF: use implicit def.
Chris Lattner9c61dcf2006-03-25 06:12:06 +0000536
Nate Begeman98e70cc2006-03-28 04:15:58 +0000537 unsigned ValSizeInBytes = 0;
538 uint64_t Value = 0;
Chris Lattner9c61dcf2006-03-25 06:12:06 +0000539 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(OpVal)) {
540 Value = CN->getValue();
541 ValSizeInBytes = MVT::getSizeInBits(CN->getValueType(0))/8;
542 } else if (ConstantFPSDNode *CN = dyn_cast<ConstantFPSDNode>(OpVal)) {
543 assert(CN->getValueType(0) == MVT::f32 && "Only one legal FP vector type!");
544 Value = FloatToBits(CN->getValue());
545 ValSizeInBytes = 4;
546 }
547
548 // If the splat value is larger than the element value, then we can never do
549 // this splat. The only case that we could fit the replicated bits into our
550 // immediate field for would be zero, and we prefer to use vxor for it.
Chris Lattner140a58f2006-04-08 06:46:53 +0000551 if (ValSizeInBytes < ByteSize) return SDOperand();
Chris Lattner9c61dcf2006-03-25 06:12:06 +0000552
553 // If the element value is larger than the splat value, cut it in half and
554 // check to see if the two halves are equal. Continue doing this until we
555 // get to ByteSize. This allows us to handle 0x01010101 as 0x01.
556 while (ValSizeInBytes > ByteSize) {
557 ValSizeInBytes >>= 1;
558
559 // If the top half equals the bottom half, we're still ok.
Chris Lattner9b42bdd2006-04-05 17:39:25 +0000560 if (((Value >> (ValSizeInBytes*8)) & ((1 << (8*ValSizeInBytes))-1)) !=
561 (Value & ((1 << (8*ValSizeInBytes))-1)))
Chris Lattner140a58f2006-04-08 06:46:53 +0000562 return SDOperand();
Chris Lattner9c61dcf2006-03-25 06:12:06 +0000563 }
564
565 // Properly sign extend the value.
566 int ShAmt = (4-ByteSize)*8;
567 int MaskVal = ((int)Value << ShAmt) >> ShAmt;
568
Evan Cheng5b6a01b2006-03-26 09:52:32 +0000569 // If this is zero, don't match, zero matches ISD::isBuildVectorAllZeros.
Chris Lattner140a58f2006-04-08 06:46:53 +0000570 if (MaskVal == 0) return SDOperand();
Chris Lattner9c61dcf2006-03-25 06:12:06 +0000571
Chris Lattner140a58f2006-04-08 06:46:53 +0000572 // Finally, if this value fits in a 5 bit sext field, return it
573 if (((MaskVal << (32-5)) >> (32-5)) == MaskVal)
574 return DAG.getTargetConstant(MaskVal, MVT::i32);
575 return SDOperand();
Chris Lattner9c61dcf2006-03-25 06:12:06 +0000576}
577
Chris Lattner1a635d62006-04-14 06:01:58 +0000578//===----------------------------------------------------------------------===//
579// LowerOperation implementation
580//===----------------------------------------------------------------------===//
581
582static SDOperand LowerConstantPool(SDOperand Op, SelectionDAG &DAG) {
583 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(Op);
584 Constant *C = CP->get();
585 SDOperand CPI = DAG.getTargetConstantPool(C, MVT::i32, CP->getAlignment());
586 SDOperand Zero = DAG.getConstant(0, MVT::i32);
587
588 const TargetMachine &TM = DAG.getTarget();
589
590 // If this is a non-darwin platform, we don't support non-static relo models
591 // yet.
592 if (TM.getRelocationModel() == Reloc::Static ||
593 !TM.getSubtarget<PPCSubtarget>().isDarwin()) {
594 // Generate non-pic code that has direct accesses to the constant pool.
595 // The address of the global is just (hi(&g)+lo(&g)).
596 SDOperand Hi = DAG.getNode(PPCISD::Hi, MVT::i32, CPI, Zero);
597 SDOperand Lo = DAG.getNode(PPCISD::Lo, MVT::i32, CPI, Zero);
598 return DAG.getNode(ISD::ADD, MVT::i32, Hi, Lo);
599 }
600
601 SDOperand Hi = DAG.getNode(PPCISD::Hi, MVT::i32, CPI, Zero);
602 if (TM.getRelocationModel() == Reloc::PIC) {
603 // With PIC, the first instruction is actually "GR+hi(&G)".
604 Hi = DAG.getNode(ISD::ADD, MVT::i32,
605 DAG.getNode(PPCISD::GlobalBaseReg, MVT::i32), Hi);
606 }
607
608 SDOperand Lo = DAG.getNode(PPCISD::Lo, MVT::i32, CPI, Zero);
609 Lo = DAG.getNode(ISD::ADD, MVT::i32, Hi, Lo);
610 return Lo;
611}
612
Nate Begeman37efe672006-04-22 18:53:45 +0000613static SDOperand LowerJumpTable(SDOperand Op, SelectionDAG &DAG) {
614 JumpTableSDNode *JT = cast<JumpTableSDNode>(Op);
615 SDOperand JTI = DAG.getTargetJumpTable(JT->getIndex(), MVT::i32);
616 SDOperand Zero = DAG.getConstant(0, MVT::i32);
617
618 const TargetMachine &TM = DAG.getTarget();
619
620 // If this is a non-darwin platform, we don't support non-static relo models
621 // yet.
622 if (TM.getRelocationModel() == Reloc::Static ||
623 !TM.getSubtarget<PPCSubtarget>().isDarwin()) {
624 // Generate non-pic code that has direct accesses to the constant pool.
625 // The address of the global is just (hi(&g)+lo(&g)).
626 SDOperand Hi = DAG.getNode(PPCISD::Hi, MVT::i32, JTI, Zero);
627 SDOperand Lo = DAG.getNode(PPCISD::Lo, MVT::i32, JTI, Zero);
628 return DAG.getNode(ISD::ADD, MVT::i32, Hi, Lo);
629 }
630
631 SDOperand Hi = DAG.getNode(PPCISD::Hi, MVT::i32, JTI, Zero);
632 if (TM.getRelocationModel() == Reloc::PIC) {
633 // With PIC, the first instruction is actually "GR+hi(&G)".
634 Hi = DAG.getNode(ISD::ADD, MVT::i32,
635 DAG.getNode(PPCISD::GlobalBaseReg, MVT::i32), Hi);
636 }
637
638 SDOperand Lo = DAG.getNode(PPCISD::Lo, MVT::i32, JTI, Zero);
639 Lo = DAG.getNode(ISD::ADD, MVT::i32, Hi, Lo);
640 return Lo;
641}
642
Chris Lattner1a635d62006-04-14 06:01:58 +0000643static SDOperand LowerGlobalAddress(SDOperand Op, SelectionDAG &DAG) {
644 GlobalAddressSDNode *GSDN = cast<GlobalAddressSDNode>(Op);
645 GlobalValue *GV = GSDN->getGlobal();
646 SDOperand GA = DAG.getTargetGlobalAddress(GV, MVT::i32, GSDN->getOffset());
647 SDOperand Zero = DAG.getConstant(0, MVT::i32);
648
649 const TargetMachine &TM = DAG.getTarget();
650
651 // If this is a non-darwin platform, we don't support non-static relo models
652 // yet.
653 if (TM.getRelocationModel() == Reloc::Static ||
654 !TM.getSubtarget<PPCSubtarget>().isDarwin()) {
655 // Generate non-pic code that has direct accesses to globals.
656 // The address of the global is just (hi(&g)+lo(&g)).
657 SDOperand Hi = DAG.getNode(PPCISD::Hi, MVT::i32, GA, Zero);
658 SDOperand Lo = DAG.getNode(PPCISD::Lo, MVT::i32, GA, Zero);
659 return DAG.getNode(ISD::ADD, MVT::i32, Hi, Lo);
660 }
661
662 SDOperand Hi = DAG.getNode(PPCISD::Hi, MVT::i32, GA, Zero);
663 if (TM.getRelocationModel() == Reloc::PIC) {
664 // With PIC, the first instruction is actually "GR+hi(&G)".
665 Hi = DAG.getNode(ISD::ADD, MVT::i32,
666 DAG.getNode(PPCISD::GlobalBaseReg, MVT::i32), Hi);
667 }
668
669 SDOperand Lo = DAG.getNode(PPCISD::Lo, MVT::i32, GA, Zero);
670 Lo = DAG.getNode(ISD::ADD, MVT::i32, Hi, Lo);
671
672 if (!GV->hasWeakLinkage() && !GV->hasLinkOnceLinkage() &&
673 (!GV->isExternal() || GV->hasNotBeenReadFromBytecode()))
674 return Lo;
675
676 // If the global is weak or external, we have to go through the lazy
677 // resolution stub.
678 return DAG.getLoad(MVT::i32, DAG.getEntryNode(), Lo, DAG.getSrcValue(0));
679}
680
681static SDOperand LowerSETCC(SDOperand Op, SelectionDAG &DAG) {
682 ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(2))->get();
683
684 // If we're comparing for equality to zero, expose the fact that this is
685 // implented as a ctlz/srl pair on ppc, so that the dag combiner can
686 // fold the new nodes.
687 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
688 if (C->isNullValue() && CC == ISD::SETEQ) {
689 MVT::ValueType VT = Op.getOperand(0).getValueType();
690 SDOperand Zext = Op.getOperand(0);
691 if (VT < MVT::i32) {
692 VT = MVT::i32;
693 Zext = DAG.getNode(ISD::ZERO_EXTEND, VT, Op.getOperand(0));
694 }
695 unsigned Log2b = Log2_32(MVT::getSizeInBits(VT));
696 SDOperand Clz = DAG.getNode(ISD::CTLZ, VT, Zext);
697 SDOperand Scc = DAG.getNode(ISD::SRL, VT, Clz,
698 DAG.getConstant(Log2b, MVT::i32));
699 return DAG.getNode(ISD::TRUNCATE, MVT::i32, Scc);
700 }
701 // Leave comparisons against 0 and -1 alone for now, since they're usually
702 // optimized. FIXME: revisit this when we can custom lower all setcc
703 // optimizations.
704 if (C->isAllOnesValue() || C->isNullValue())
705 return SDOperand();
706 }
707
708 // If we have an integer seteq/setne, turn it into a compare against zero
709 // by subtracting the rhs from the lhs, which is faster than setting a
710 // condition register, reading it back out, and masking the correct bit.
711 MVT::ValueType LHSVT = Op.getOperand(0).getValueType();
712 if (MVT::isInteger(LHSVT) && (CC == ISD::SETEQ || CC == ISD::SETNE)) {
713 MVT::ValueType VT = Op.getValueType();
714 SDOperand Sub = DAG.getNode(ISD::SUB, LHSVT, Op.getOperand(0),
715 Op.getOperand(1));
716 return DAG.getSetCC(VT, Sub, DAG.getConstant(0, LHSVT), CC);
717 }
718 return SDOperand();
719}
720
721static SDOperand LowerVASTART(SDOperand Op, SelectionDAG &DAG,
722 unsigned VarArgsFrameIndex) {
723 // vastart just stores the address of the VarArgsFrameIndex slot into the
724 // memory location argument.
725 SDOperand FR = DAG.getFrameIndex(VarArgsFrameIndex, MVT::i32);
726 return DAG.getNode(ISD::STORE, MVT::Other, Op.getOperand(0), FR,
727 Op.getOperand(1), Op.getOperand(2));
728}
729
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000730static SDOperand LowerFORMAL_ARGUMENTS(SDOperand Op, SelectionDAG &DAG,
731 int &VarArgsFrameIndex) {
732 // TODO: add description of PPC stack frame format, or at least some docs.
733 //
734 MachineFunction &MF = DAG.getMachineFunction();
735 MachineFrameInfo *MFI = MF.getFrameInfo();
736 SSARegMap *RegMap = MF.getSSARegMap();
737 std::vector<SDOperand> ArgValues;
738 SDOperand Root = Op.getOperand(0);
739
740 unsigned ArgOffset = 24;
Chris Lattneraf4ec0c2006-05-16 18:58:15 +0000741 const unsigned Num_GPR_Regs = 8;
742 const unsigned Num_FPR_Regs = 13;
743 const unsigned Num_VR_Regs = 12;
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000744 unsigned GPR_idx = 0, FPR_idx = 0, VR_idx = 0;
745 static const unsigned GPR[] = {
746 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
747 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
748 };
749 static const unsigned FPR[] = {
750 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
751 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
752 };
753 static const unsigned VR[] = {
754 PPC::V2, PPC::V3, PPC::V4, PPC::V5, PPC::V6, PPC::V7, PPC::V8,
755 PPC::V9, PPC::V10, PPC::V11, PPC::V12, PPC::V13
756 };
757
758 // Add DAG nodes to load the arguments or copy them out of registers. On
759 // entry to a function on PPC, the arguments start at offset 24, although the
760 // first ones are often in registers.
761 for (unsigned ArgNo = 0, e = Op.Val->getNumValues()-1; ArgNo != e; ++ArgNo) {
762 SDOperand ArgVal;
763 bool needsLoad = false;
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000764 MVT::ValueType ObjectVT = Op.getValue(ArgNo).getValueType();
765 unsigned ObjSize = MVT::getSizeInBits(ObjectVT)/8;
766
Chris Lattnerbe4849a2006-05-16 18:51:52 +0000767 unsigned CurArgOffset = ArgOffset;
768
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000769 switch (ObjectVT) {
770 default: assert(0 && "Unhandled argument type!");
771 case MVT::i32:
Chris Lattnerbe4849a2006-05-16 18:51:52 +0000772 // All int arguments reserve stack space.
773 ArgOffset += 4;
774
Chris Lattneraf4ec0c2006-05-16 18:58:15 +0000775 if (GPR_idx != Num_GPR_Regs) {
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000776 unsigned VReg = RegMap->createVirtualRegister(&PPC::GPRCRegClass);
777 MF.addLiveIn(GPR[GPR_idx], VReg);
778 ArgVal = DAG.getCopyFromReg(Root, VReg, MVT::i32);
Chris Lattnerbe4849a2006-05-16 18:51:52 +0000779 ++GPR_idx;
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000780 } else {
781 needsLoad = true;
782 }
783 break;
784 case MVT::f32:
785 case MVT::f64:
Chris Lattnerbe4849a2006-05-16 18:51:52 +0000786 // All FP arguments reserve stack space.
787 ArgOffset += ObjSize;
788
789 // Every 4 bytes of argument space consumes one of the GPRs available for
790 // argument passing.
Chris Lattneraf4ec0c2006-05-16 18:58:15 +0000791 if (GPR_idx != Num_GPR_Regs) {
792 ++GPR_idx;
793 if (ObjSize == 8 && GPR_idx != Num_GPR_Regs)
794 ++GPR_idx;
Chris Lattnerbe4849a2006-05-16 18:51:52 +0000795 }
Chris Lattneraf4ec0c2006-05-16 18:58:15 +0000796 if (FPR_idx != Num_FPR_Regs) {
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000797 unsigned VReg;
798 if (ObjectVT == MVT::f32)
799 VReg = RegMap->createVirtualRegister(&PPC::F4RCRegClass);
800 else
801 VReg = RegMap->createVirtualRegister(&PPC::F8RCRegClass);
802 MF.addLiveIn(FPR[FPR_idx], VReg);
803 ArgVal = DAG.getCopyFromReg(Root, VReg, ObjectVT);
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000804 ++FPR_idx;
805 } else {
806 needsLoad = true;
807 }
808 break;
809 case MVT::v4f32:
810 case MVT::v4i32:
811 case MVT::v8i16:
812 case MVT::v16i8:
Chris Lattnerbe4849a2006-05-16 18:51:52 +0000813 // Note that vector arguments in registers don't reserve stack space.
Chris Lattneraf4ec0c2006-05-16 18:58:15 +0000814 if (VR_idx != Num_VR_Regs) {
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000815 unsigned VReg = RegMap->createVirtualRegister(&PPC::VRRCRegClass);
816 MF.addLiveIn(VR[VR_idx], VReg);
817 ArgVal = DAG.getCopyFromReg(Root, VReg, ObjectVT);
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000818 ++VR_idx;
819 } else {
820 // This should be simple, but requires getting 16-byte aligned stack
821 // values.
822 assert(0 && "Loading VR argument not implemented yet!");
823 needsLoad = true;
824 }
825 break;
826 }
827
828 // We need to load the argument to a virtual register if we determined above
829 // that we ran out of physical registers of the appropriate type
830 if (needsLoad) {
Chris Lattnerb375b5e2006-05-16 18:54:32 +0000831 // If the argument is actually used, emit a load from the right stack
832 // slot.
833 if (!Op.Val->hasNUsesOfValue(0, ArgNo)) {
834 int FI = MFI->CreateFixedObject(ObjSize, CurArgOffset);
835 SDOperand FIN = DAG.getFrameIndex(FI, MVT::i32);
836 ArgVal = DAG.getLoad(ObjectVT, Root, FIN,
837 DAG.getSrcValue(NULL));
838 } else {
839 // Don't emit a dead load.
840 ArgVal = DAG.getNode(ISD::UNDEF, ObjectVT);
841 }
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000842 }
843
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000844 ArgValues.push_back(ArgVal);
845 }
846
847 // If the function takes variable number of arguments, make a frame index for
848 // the start of the first vararg value... for expansion of llvm.va_start.
849 bool isVarArg = cast<ConstantSDNode>(Op.getOperand(2))->getValue() != 0;
850 if (isVarArg) {
851 VarArgsFrameIndex = MFI->CreateFixedObject(4, ArgOffset);
852 SDOperand FIN = DAG.getFrameIndex(VarArgsFrameIndex, MVT::i32);
853 // If this function is vararg, store any remaining integer argument regs
854 // to their spots on the stack so that they may be loaded by deferencing the
855 // result of va_next.
856 std::vector<SDOperand> MemOps;
Chris Lattneraf4ec0c2006-05-16 18:58:15 +0000857 for (; GPR_idx != Num_GPR_Regs; ++GPR_idx) {
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000858 unsigned VReg = RegMap->createVirtualRegister(&PPC::GPRCRegClass);
859 MF.addLiveIn(GPR[GPR_idx], VReg);
860 SDOperand Val = DAG.getCopyFromReg(Root, VReg, MVT::i32);
861 SDOperand Store = DAG.getNode(ISD::STORE, MVT::Other, Val.getValue(1),
862 Val, FIN, DAG.getSrcValue(NULL));
863 MemOps.push_back(Store);
864 // Increment the address by four for the next argument to store
865 SDOperand PtrOff = DAG.getConstant(4, MVT::i32);
866 FIN = DAG.getNode(ISD::ADD, MVT::i32, FIN, PtrOff);
867 }
868 if (!MemOps.empty())
869 Root = DAG.getNode(ISD::TokenFactor, MVT::Other, MemOps);
870 }
871
872 ArgValues.push_back(Root);
873
874 // Return the new list of results.
875 std::vector<MVT::ValueType> RetVT(Op.Val->value_begin(),
876 Op.Val->value_end());
877 return DAG.getNode(ISD::MERGE_VALUES, RetVT, ArgValues);
878}
879
Chris Lattnerabde4602006-05-16 22:56:08 +0000880static SDOperand LowerCALL(SDOperand Op, SelectionDAG &DAG) {
881 SDOperand Chain = Op.getOperand(0);
882 unsigned CallingConv= cast<ConstantSDNode>(Op.getOperand(1))->getValue();
883 bool isVarArg = cast<ConstantSDNode>(Op.getOperand(2))->getValue() != 0;
884 bool isTailCall = cast<ConstantSDNode>(Op.getOperand(3))->getValue() != 0;
885 SDOperand Callee = Op.getOperand(4);
886
887 // args_to_use will accumulate outgoing args for the PPCISD::CALL case in
888 // SelectExpr to use to put the arguments in the appropriate registers.
889 std::vector<SDOperand> args_to_use;
890
891 // Count how many bytes are to be pushed on the stack, including the linkage
Chris Lattnerc8b682c2006-05-17 00:15:40 +0000892 // area, and parameter passing area. We start with 24 bytes, which is
893 // prereserved space for [SP][CR][LR][3 x unused].
Chris Lattnerabde4602006-05-16 22:56:08 +0000894 unsigned NumBytes = 24;
895
Chris Lattnerc8b682c2006-05-17 00:15:40 +0000896 // Add up all the space actually used.
897 for (unsigned i = 5, e = Op.getNumOperands(); i != e; ++i)
898 NumBytes += MVT::getSizeInBits(Op.getOperand(i).getValueType())/8;
Chris Lattnerc04ba7a2006-05-16 23:54:25 +0000899
Chris Lattnerc8b682c2006-05-17 00:15:40 +0000900 // If we are calling what looks like a varargs function on the caller side,
901 // there are two cases:
902 // 1) The callee uses va_start.
903 // 2) The callee doesn't use va_start.
904 //
905 // In the case of #1, the prolog code will store up to 8 GPR argument
906 // registers to the stack, allowing va_start to index over them in memory.
907 // Because we cannot tell the difference (on the caller side) between #1/#2,
908 // we have to conservatively assume we have #1. As such, make sure we have
909 // at least enough stack space for the caller to store the 8 GPRs.
910 if (isVarArg && Op.getNumOperands() > 5 && NumBytes < 56)
911 NumBytes = 56;
912
913 // Adjust the stack pointer for the new arguments...
914 // These operations are automatically eliminated by the prolog/epilog pass
915 Chain = DAG.getCALLSEQ_START(Chain,
916 DAG.getConstant(NumBytes, MVT::i32));
917
918 // Set up a copy of the stack pointer for use loading and storing any
919 // arguments that may not fit in the registers available for argument
920 // passing.
921 SDOperand StackPtr = DAG.getRegister(PPC::R1, MVT::i32);
922
923 // Figure out which arguments are going to go in registers, and which in
924 // memory. Also, if this is a vararg function, floating point operations
925 // must be stored to our stack, and loaded into integer regs as well, if
926 // any integer regs are available for argument passing.
927 unsigned ArgOffset = 24;
928 unsigned GPR_remaining = 8;
929 unsigned FPR_remaining = 13;
930 unsigned VR_remaining = 12;
931
932 std::vector<SDOperand> MemOps;
933 for (unsigned i = 5, e = Op.getNumOperands(); i != e; ++i) {
934 SDOperand Arg = Op.getOperand(i);
935
936 // PtrOff will be used to store the current argument to the stack if a
937 // register cannot be found for it.
938 SDOperand PtrOff = DAG.getConstant(ArgOffset, StackPtr.getValueType());
939 PtrOff = DAG.getNode(ISD::ADD, MVT::i32, StackPtr, PtrOff);
940 switch (Arg.getValueType()) {
941 default: assert(0 && "Unexpected ValueType for argument!");
942 case MVT::i32:
943 if (GPR_remaining > 0) {
944 args_to_use.push_back(Arg);
945 --GPR_remaining;
946 } else {
947 MemOps.push_back(DAG.getNode(ISD::STORE, MVT::Other, Chain,
948 Arg, PtrOff, DAG.getSrcValue(NULL)));
949 }
950 ArgOffset += 4;
951 break;
952 case MVT::f32:
953 case MVT::f64:
954 if (FPR_remaining > 0) {
955 args_to_use.push_back(Arg);
956 --FPR_remaining;
957 if (isVarArg) {
958 SDOperand Store = DAG.getNode(ISD::STORE, MVT::Other, Chain,
959 Arg, PtrOff,
960 DAG.getSrcValue(NULL));
961 MemOps.push_back(Store);
962 // Float varargs are always shadowed in available integer registers
963 if (GPR_remaining > 0) {
964 SDOperand Load = DAG.getLoad(MVT::i32, Store, PtrOff,
965 DAG.getSrcValue(NULL));
966 MemOps.push_back(Load.getValue(1));
967 args_to_use.push_back(Load);
968 --GPR_remaining;
969 }
970 if (GPR_remaining > 0 && Arg.getValueType() == MVT::f64) {
971 SDOperand ConstFour = DAG.getConstant(4, PtrOff.getValueType());
972 PtrOff = DAG.getNode(ISD::ADD, MVT::i32, PtrOff, ConstFour);
973 SDOperand Load = DAG.getLoad(MVT::i32, Store, PtrOff,
974 DAG.getSrcValue(NULL));
975 MemOps.push_back(Load.getValue(1));
976 args_to_use.push_back(Load);
977 --GPR_remaining;
Chris Lattnerabde4602006-05-16 22:56:08 +0000978 }
979 } else {
Chris Lattnerc8b682c2006-05-17 00:15:40 +0000980 // If we have any FPRs remaining, we may also have GPRs remaining.
981 // Args passed in FPRs consume either 1 (f32) or 2 (f64) available
982 // GPRs.
983 if (GPR_remaining > 0) {
984 args_to_use.push_back(DAG.getNode(ISD::UNDEF, MVT::i32));
985 --GPR_remaining;
986 }
987 if (GPR_remaining > 0 && Arg.getValueType() == MVT::f64) {
988 args_to_use.push_back(DAG.getNode(ISD::UNDEF, MVT::i32));
989 --GPR_remaining;
990 }
Chris Lattnerabde4602006-05-16 22:56:08 +0000991 }
Chris Lattnerc8b682c2006-05-17 00:15:40 +0000992 } else {
993 MemOps.push_back(DAG.getNode(ISD::STORE, MVT::Other, Chain,
994 Arg, PtrOff, DAG.getSrcValue(NULL)));
Chris Lattnerabde4602006-05-16 22:56:08 +0000995 }
Chris Lattnerc8b682c2006-05-17 00:15:40 +0000996 ArgOffset += (Arg.getValueType() == MVT::f32) ? 4 : 8;
997 break;
998 case MVT::v4f32:
999 case MVT::v4i32:
1000 case MVT::v8i16:
1001 case MVT::v16i8:
1002 assert(!isVarArg && "Don't support passing vectors to varargs yet!");
1003 assert(VR_remaining &&
1004 "Don't support passing more than 12 vector args yet!");
1005 args_to_use.push_back(Arg);
1006 --VR_remaining;
1007 break;
Chris Lattnerabde4602006-05-16 22:56:08 +00001008 }
Chris Lattnerabde4602006-05-16 22:56:08 +00001009 }
Chris Lattnerc8b682c2006-05-17 00:15:40 +00001010 if (!MemOps.empty())
1011 Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, MemOps);
Chris Lattnerabde4602006-05-16 22:56:08 +00001012
1013 std::vector<MVT::ValueType> RetVals(Op.Val->value_begin(),
1014 Op.Val->value_end());
1015
1016 // If the callee is a GlobalAddress node (quite common, every direct call is)
1017 // turn it into a TargetGlobalAddress node so that legalize doesn't hack it.
1018 if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Callee))
1019 Callee = DAG.getTargetGlobalAddress(G->getGlobal(), MVT::i32);
1020
1021 std::vector<SDOperand> Ops;
1022 Ops.push_back(Chain);
1023 Ops.push_back(Callee);
1024 Ops.insert(Ops.end(), args_to_use.begin(), args_to_use.end());
1025 SDOperand TheCall = DAG.getNode(PPCISD::CALL, RetVals, Ops);
1026
1027 Chain = TheCall.getValue(TheCall.Val->getNumValues()-1);
1028 Chain = DAG.getNode(ISD::CALLSEQ_END, MVT::Other, Chain,
1029 DAG.getConstant(NumBytes, MVT::i32));
1030
1031 std::vector<MVT::ValueType> RetVT(Op.Val->value_begin(),
1032 Op.Val->value_end());
1033 Ops.clear();
1034
1035 for (unsigned i = 0, e = TheCall.Val->getNumValues()-1; i != e; ++i)
1036 Ops.push_back(SDOperand(TheCall.Val, i));
1037 Ops.push_back(Chain);
1038 SDOperand Res = DAG.getNode(ISD::MERGE_VALUES, RetVT, Ops);
1039
1040 return Res.getValue(Op.ResNo);
1041}
1042
Chris Lattner1a635d62006-04-14 06:01:58 +00001043static SDOperand LowerRET(SDOperand Op, SelectionDAG &DAG) {
1044 SDOperand Copy;
1045 switch(Op.getNumOperands()) {
1046 default:
1047 assert(0 && "Do not know how to return this many arguments!");
1048 abort();
1049 case 1:
1050 return SDOperand(); // ret void is legal
1051 case 2: {
1052 MVT::ValueType ArgVT = Op.getOperand(1).getValueType();
1053 unsigned ArgReg;
1054 if (MVT::isVector(ArgVT))
1055 ArgReg = PPC::V2;
1056 else if (MVT::isInteger(ArgVT))
1057 ArgReg = PPC::R3;
1058 else {
1059 assert(MVT::isFloatingPoint(ArgVT));
1060 ArgReg = PPC::F1;
1061 }
1062
1063 Copy = DAG.getCopyToReg(Op.getOperand(0), ArgReg, Op.getOperand(1),
1064 SDOperand());
1065
1066 // If we haven't noted the R3/F1 are live out, do so now.
1067 if (DAG.getMachineFunction().liveout_empty())
1068 DAG.getMachineFunction().addLiveOut(ArgReg);
1069 break;
1070 }
1071 case 3:
1072 Copy = DAG.getCopyToReg(Op.getOperand(0), PPC::R3, Op.getOperand(2),
1073 SDOperand());
1074 Copy = DAG.getCopyToReg(Copy, PPC::R4, Op.getOperand(1),Copy.getValue(1));
1075 // If we haven't noted the R3+R4 are live out, do so now.
1076 if (DAG.getMachineFunction().liveout_empty()) {
1077 DAG.getMachineFunction().addLiveOut(PPC::R3);
1078 DAG.getMachineFunction().addLiveOut(PPC::R4);
1079 }
1080 break;
1081 }
1082 return DAG.getNode(PPCISD::RET_FLAG, MVT::Other, Copy, Copy.getValue(1));
1083}
1084
1085/// LowerSELECT_CC - Lower floating point select_cc's into fsel instruction when
1086/// possible.
1087static SDOperand LowerSELECT_CC(SDOperand Op, SelectionDAG &DAG) {
1088 // Not FP? Not a fsel.
1089 if (!MVT::isFloatingPoint(Op.getOperand(0).getValueType()) ||
1090 !MVT::isFloatingPoint(Op.getOperand(2).getValueType()))
1091 return SDOperand();
1092
1093 ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(4))->get();
1094
1095 // Cannot handle SETEQ/SETNE.
1096 if (CC == ISD::SETEQ || CC == ISD::SETNE) return SDOperand();
1097
1098 MVT::ValueType ResVT = Op.getValueType();
1099 MVT::ValueType CmpVT = Op.getOperand(0).getValueType();
1100 SDOperand LHS = Op.getOperand(0), RHS = Op.getOperand(1);
1101 SDOperand TV = Op.getOperand(2), FV = Op.getOperand(3);
1102
1103 // If the RHS of the comparison is a 0.0, we don't need to do the
1104 // subtraction at all.
1105 if (isFloatingPointZero(RHS))
1106 switch (CC) {
1107 default: break; // SETUO etc aren't handled by fsel.
1108 case ISD::SETULT:
1109 case ISD::SETLT:
1110 std::swap(TV, FV); // fsel is natively setge, swap operands for setlt
1111 case ISD::SETUGE:
1112 case ISD::SETGE:
1113 if (LHS.getValueType() == MVT::f32) // Comparison is always 64-bits
1114 LHS = DAG.getNode(ISD::FP_EXTEND, MVT::f64, LHS);
1115 return DAG.getNode(PPCISD::FSEL, ResVT, LHS, TV, FV);
1116 case ISD::SETUGT:
1117 case ISD::SETGT:
1118 std::swap(TV, FV); // fsel is natively setge, swap operands for setlt
1119 case ISD::SETULE:
1120 case ISD::SETLE:
1121 if (LHS.getValueType() == MVT::f32) // Comparison is always 64-bits
1122 LHS = DAG.getNode(ISD::FP_EXTEND, MVT::f64, LHS);
1123 return DAG.getNode(PPCISD::FSEL, ResVT,
1124 DAG.getNode(ISD::FNEG, MVT::f64, LHS), TV, FV);
1125 }
1126
1127 SDOperand Cmp;
1128 switch (CC) {
1129 default: break; // SETUO etc aren't handled by fsel.
1130 case ISD::SETULT:
1131 case ISD::SETLT:
1132 Cmp = DAG.getNode(ISD::FSUB, CmpVT, LHS, RHS);
1133 if (Cmp.getValueType() == MVT::f32) // Comparison is always 64-bits
1134 Cmp = DAG.getNode(ISD::FP_EXTEND, MVT::f64, Cmp);
1135 return DAG.getNode(PPCISD::FSEL, ResVT, Cmp, FV, TV);
1136 case ISD::SETUGE:
1137 case ISD::SETGE:
1138 Cmp = DAG.getNode(ISD::FSUB, CmpVT, LHS, RHS);
1139 if (Cmp.getValueType() == MVT::f32) // Comparison is always 64-bits
1140 Cmp = DAG.getNode(ISD::FP_EXTEND, MVT::f64, Cmp);
1141 return DAG.getNode(PPCISD::FSEL, ResVT, Cmp, TV, FV);
1142 case ISD::SETUGT:
1143 case ISD::SETGT:
1144 Cmp = DAG.getNode(ISD::FSUB, CmpVT, RHS, LHS);
1145 if (Cmp.getValueType() == MVT::f32) // Comparison is always 64-bits
1146 Cmp = DAG.getNode(ISD::FP_EXTEND, MVT::f64, Cmp);
1147 return DAG.getNode(PPCISD::FSEL, ResVT, Cmp, FV, TV);
1148 case ISD::SETULE:
1149 case ISD::SETLE:
1150 Cmp = DAG.getNode(ISD::FSUB, CmpVT, RHS, LHS);
1151 if (Cmp.getValueType() == MVT::f32) // Comparison is always 64-bits
1152 Cmp = DAG.getNode(ISD::FP_EXTEND, MVT::f64, Cmp);
1153 return DAG.getNode(PPCISD::FSEL, ResVT, Cmp, TV, FV);
1154 }
1155 return SDOperand();
1156}
1157
1158static SDOperand LowerFP_TO_SINT(SDOperand Op, SelectionDAG &DAG) {
1159 assert(MVT::isFloatingPoint(Op.getOperand(0).getValueType()));
1160 SDOperand Src = Op.getOperand(0);
1161 if (Src.getValueType() == MVT::f32)
1162 Src = DAG.getNode(ISD::FP_EXTEND, MVT::f64, Src);
1163
1164 SDOperand Tmp;
1165 switch (Op.getValueType()) {
1166 default: assert(0 && "Unhandled FP_TO_SINT type in custom expander!");
1167 case MVT::i32:
1168 Tmp = DAG.getNode(PPCISD::FCTIWZ, MVT::f64, Src);
1169 break;
1170 case MVT::i64:
1171 Tmp = DAG.getNode(PPCISD::FCTIDZ, MVT::f64, Src);
1172 break;
1173 }
1174
1175 // Convert the FP value to an int value through memory.
1176 SDOperand Bits = DAG.getNode(ISD::BIT_CONVERT, MVT::i64, Tmp);
1177 if (Op.getValueType() == MVT::i32)
1178 Bits = DAG.getNode(ISD::TRUNCATE, MVT::i32, Bits);
1179 return Bits;
1180}
1181
1182static SDOperand LowerSINT_TO_FP(SDOperand Op, SelectionDAG &DAG) {
1183 if (Op.getOperand(0).getValueType() == MVT::i64) {
1184 SDOperand Bits = DAG.getNode(ISD::BIT_CONVERT, MVT::f64, Op.getOperand(0));
1185 SDOperand FP = DAG.getNode(PPCISD::FCFID, MVT::f64, Bits);
1186 if (Op.getValueType() == MVT::f32)
1187 FP = DAG.getNode(ISD::FP_ROUND, MVT::f32, FP);
1188 return FP;
1189 }
1190
1191 assert(Op.getOperand(0).getValueType() == MVT::i32 &&
1192 "Unhandled SINT_TO_FP type in custom expander!");
1193 // Since we only generate this in 64-bit mode, we can take advantage of
1194 // 64-bit registers. In particular, sign extend the input value into the
1195 // 64-bit register with extsw, store the WHOLE 64-bit value into the stack
1196 // then lfd it and fcfid it.
1197 MachineFrameInfo *FrameInfo = DAG.getMachineFunction().getFrameInfo();
1198 int FrameIdx = FrameInfo->CreateStackObject(8, 8);
1199 SDOperand FIdx = DAG.getFrameIndex(FrameIdx, MVT::i32);
1200
1201 SDOperand Ext64 = DAG.getNode(PPCISD::EXTSW_32, MVT::i32,
1202 Op.getOperand(0));
1203
1204 // STD the extended value into the stack slot.
1205 SDOperand Store = DAG.getNode(PPCISD::STD_32, MVT::Other,
1206 DAG.getEntryNode(), Ext64, FIdx,
1207 DAG.getSrcValue(NULL));
1208 // Load the value as a double.
1209 SDOperand Ld = DAG.getLoad(MVT::f64, Store, FIdx, DAG.getSrcValue(NULL));
1210
1211 // FCFID it and return it.
1212 SDOperand FP = DAG.getNode(PPCISD::FCFID, MVT::f64, Ld);
1213 if (Op.getValueType() == MVT::f32)
1214 FP = DAG.getNode(ISD::FP_ROUND, MVT::f32, FP);
1215 return FP;
1216}
1217
1218static SDOperand LowerSHL(SDOperand Op, SelectionDAG &DAG) {
1219 assert(Op.getValueType() == MVT::i64 &&
1220 Op.getOperand(1).getValueType() == MVT::i32 && "Unexpected SHL!");
1221 // The generic code does a fine job expanding shift by a constant.
1222 if (isa<ConstantSDNode>(Op.getOperand(1))) return SDOperand();
1223
1224 // Otherwise, expand into a bunch of logical ops. Note that these ops
1225 // depend on the PPC behavior for oversized shift amounts.
1226 SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, MVT::i32, Op.getOperand(0),
1227 DAG.getConstant(0, MVT::i32));
1228 SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, MVT::i32, Op.getOperand(0),
1229 DAG.getConstant(1, MVT::i32));
1230 SDOperand Amt = Op.getOperand(1);
1231
1232 SDOperand Tmp1 = DAG.getNode(ISD::SUB, MVT::i32,
1233 DAG.getConstant(32, MVT::i32), Amt);
1234 SDOperand Tmp2 = DAG.getNode(PPCISD::SHL, MVT::i32, Hi, Amt);
1235 SDOperand Tmp3 = DAG.getNode(PPCISD::SRL, MVT::i32, Lo, Tmp1);
1236 SDOperand Tmp4 = DAG.getNode(ISD::OR , MVT::i32, Tmp2, Tmp3);
1237 SDOperand Tmp5 = DAG.getNode(ISD::ADD, MVT::i32, Amt,
1238 DAG.getConstant(-32U, MVT::i32));
1239 SDOperand Tmp6 = DAG.getNode(PPCISD::SHL, MVT::i32, Lo, Tmp5);
1240 SDOperand OutHi = DAG.getNode(ISD::OR, MVT::i32, Tmp4, Tmp6);
1241 SDOperand OutLo = DAG.getNode(PPCISD::SHL, MVT::i32, Lo, Amt);
1242 return DAG.getNode(ISD::BUILD_PAIR, MVT::i64, OutLo, OutHi);
1243}
1244
1245static SDOperand LowerSRL(SDOperand Op, SelectionDAG &DAG) {
1246 assert(Op.getValueType() == MVT::i64 &&
1247 Op.getOperand(1).getValueType() == MVT::i32 && "Unexpected SHL!");
1248 // The generic code does a fine job expanding shift by a constant.
1249 if (isa<ConstantSDNode>(Op.getOperand(1))) return SDOperand();
1250
1251 // Otherwise, expand into a bunch of logical ops. Note that these ops
1252 // depend on the PPC behavior for oversized shift amounts.
1253 SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, MVT::i32, Op.getOperand(0),
1254 DAG.getConstant(0, MVT::i32));
1255 SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, MVT::i32, Op.getOperand(0),
1256 DAG.getConstant(1, MVT::i32));
1257 SDOperand Amt = Op.getOperand(1);
1258
1259 SDOperand Tmp1 = DAG.getNode(ISD::SUB, MVT::i32,
1260 DAG.getConstant(32, MVT::i32), Amt);
1261 SDOperand Tmp2 = DAG.getNode(PPCISD::SRL, MVT::i32, Lo, Amt);
1262 SDOperand Tmp3 = DAG.getNode(PPCISD::SHL, MVT::i32, Hi, Tmp1);
1263 SDOperand Tmp4 = DAG.getNode(ISD::OR , MVT::i32, Tmp2, Tmp3);
1264 SDOperand Tmp5 = DAG.getNode(ISD::ADD, MVT::i32, Amt,
1265 DAG.getConstant(-32U, MVT::i32));
1266 SDOperand Tmp6 = DAG.getNode(PPCISD::SRL, MVT::i32, Hi, Tmp5);
1267 SDOperand OutLo = DAG.getNode(ISD::OR, MVT::i32, Tmp4, Tmp6);
1268 SDOperand OutHi = DAG.getNode(PPCISD::SRL, MVT::i32, Hi, Amt);
1269 return DAG.getNode(ISD::BUILD_PAIR, MVT::i64, OutLo, OutHi);
1270}
1271
1272static SDOperand LowerSRA(SDOperand Op, SelectionDAG &DAG) {
1273 assert(Op.getValueType() == MVT::i64 &&
1274 Op.getOperand(1).getValueType() == MVT::i32 && "Unexpected SRA!");
1275 // The generic code does a fine job expanding shift by a constant.
1276 if (isa<ConstantSDNode>(Op.getOperand(1))) return SDOperand();
1277
1278 // Otherwise, expand into a bunch of logical ops, followed by a select_cc.
1279 SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, MVT::i32, Op.getOperand(0),
1280 DAG.getConstant(0, MVT::i32));
1281 SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, MVT::i32, Op.getOperand(0),
1282 DAG.getConstant(1, MVT::i32));
1283 SDOperand Amt = Op.getOperand(1);
1284
1285 SDOperand Tmp1 = DAG.getNode(ISD::SUB, MVT::i32,
1286 DAG.getConstant(32, MVT::i32), Amt);
1287 SDOperand Tmp2 = DAG.getNode(PPCISD::SRL, MVT::i32, Lo, Amt);
1288 SDOperand Tmp3 = DAG.getNode(PPCISD::SHL, MVT::i32, Hi, Tmp1);
1289 SDOperand Tmp4 = DAG.getNode(ISD::OR , MVT::i32, Tmp2, Tmp3);
1290 SDOperand Tmp5 = DAG.getNode(ISD::ADD, MVT::i32, Amt,
1291 DAG.getConstant(-32U, MVT::i32));
1292 SDOperand Tmp6 = DAG.getNode(PPCISD::SRA, MVT::i32, Hi, Tmp5);
1293 SDOperand OutHi = DAG.getNode(PPCISD::SRA, MVT::i32, Hi, Amt);
1294 SDOperand OutLo = DAG.getSelectCC(Tmp5, DAG.getConstant(0, MVT::i32),
1295 Tmp4, Tmp6, ISD::SETLE);
1296 return DAG.getNode(ISD::BUILD_PAIR, MVT::i64, OutLo, OutHi);
1297}
1298
1299//===----------------------------------------------------------------------===//
1300// Vector related lowering.
1301//
1302
Chris Lattnerac225ca2006-04-12 19:07:14 +00001303// If this is a vector of constants or undefs, get the bits. A bit in
1304// UndefBits is set if the corresponding element of the vector is an
1305// ISD::UNDEF value. For undefs, the corresponding VectorBits values are
1306// zero. Return true if this is not an array of constants, false if it is.
1307//
Chris Lattnerac225ca2006-04-12 19:07:14 +00001308static bool GetConstantBuildVectorBits(SDNode *BV, uint64_t VectorBits[2],
1309 uint64_t UndefBits[2]) {
1310 // Start with zero'd results.
1311 VectorBits[0] = VectorBits[1] = UndefBits[0] = UndefBits[1] = 0;
1312
1313 unsigned EltBitSize = MVT::getSizeInBits(BV->getOperand(0).getValueType());
1314 for (unsigned i = 0, e = BV->getNumOperands(); i != e; ++i) {
1315 SDOperand OpVal = BV->getOperand(i);
1316
1317 unsigned PartNo = i >= e/2; // In the upper 128 bits?
Chris Lattnerb17f1672006-04-16 01:01:29 +00001318 unsigned SlotNo = e/2 - (i & (e/2-1))-1; // Which subpiece of the uint64_t.
Chris Lattnerac225ca2006-04-12 19:07:14 +00001319
1320 uint64_t EltBits = 0;
1321 if (OpVal.getOpcode() == ISD::UNDEF) {
1322 uint64_t EltUndefBits = ~0U >> (32-EltBitSize);
1323 UndefBits[PartNo] |= EltUndefBits << (SlotNo*EltBitSize);
1324 continue;
1325 } else if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(OpVal)) {
1326 EltBits = CN->getValue() & (~0U >> (32-EltBitSize));
1327 } else if (ConstantFPSDNode *CN = dyn_cast<ConstantFPSDNode>(OpVal)) {
1328 assert(CN->getValueType(0) == MVT::f32 &&
1329 "Only one legal FP vector type!");
1330 EltBits = FloatToBits(CN->getValue());
1331 } else {
1332 // Nonconstant element.
1333 return true;
1334 }
1335
1336 VectorBits[PartNo] |= EltBits << (SlotNo*EltBitSize);
1337 }
1338
1339 //printf("%llx %llx %llx %llx\n",
1340 // VectorBits[0], VectorBits[1], UndefBits[0], UndefBits[1]);
1341 return false;
1342}
Chris Lattneref819f82006-03-20 06:33:01 +00001343
Chris Lattnerb17f1672006-04-16 01:01:29 +00001344// If this is a splat (repetition) of a value across the whole vector, return
1345// the smallest size that splats it. For example, "0x01010101010101..." is a
1346// splat of 0x01, 0x0101, and 0x01010101. We return SplatBits = 0x01 and
1347// SplatSize = 1 byte.
1348static bool isConstantSplat(const uint64_t Bits128[2],
1349 const uint64_t Undef128[2],
1350 unsigned &SplatBits, unsigned &SplatUndef,
1351 unsigned &SplatSize) {
1352
1353 // Don't let undefs prevent splats from matching. See if the top 64-bits are
1354 // the same as the lower 64-bits, ignoring undefs.
1355 if ((Bits128[0] & ~Undef128[1]) != (Bits128[1] & ~Undef128[0]))
1356 return false; // Can't be a splat if two pieces don't match.
1357
1358 uint64_t Bits64 = Bits128[0] | Bits128[1];
1359 uint64_t Undef64 = Undef128[0] & Undef128[1];
1360
1361 // Check that the top 32-bits are the same as the lower 32-bits, ignoring
1362 // undefs.
1363 if ((Bits64 & (~Undef64 >> 32)) != ((Bits64 >> 32) & ~Undef64))
1364 return false; // Can't be a splat if two pieces don't match.
1365
1366 uint32_t Bits32 = uint32_t(Bits64) | uint32_t(Bits64 >> 32);
1367 uint32_t Undef32 = uint32_t(Undef64) & uint32_t(Undef64 >> 32);
1368
1369 // If the top 16-bits are different than the lower 16-bits, ignoring
1370 // undefs, we have an i32 splat.
1371 if ((Bits32 & (~Undef32 >> 16)) != ((Bits32 >> 16) & ~Undef32)) {
1372 SplatBits = Bits32;
1373 SplatUndef = Undef32;
1374 SplatSize = 4;
1375 return true;
1376 }
1377
1378 uint16_t Bits16 = uint16_t(Bits32) | uint16_t(Bits32 >> 16);
1379 uint16_t Undef16 = uint16_t(Undef32) & uint16_t(Undef32 >> 16);
1380
1381 // If the top 8-bits are different than the lower 8-bits, ignoring
1382 // undefs, we have an i16 splat.
1383 if ((Bits16 & (uint16_t(~Undef16) >> 8)) != ((Bits16 >> 8) & ~Undef16)) {
1384 SplatBits = Bits16;
1385 SplatUndef = Undef16;
1386 SplatSize = 2;
1387 return true;
1388 }
1389
1390 // Otherwise, we have an 8-bit splat.
1391 SplatBits = uint8_t(Bits16) | uint8_t(Bits16 >> 8);
1392 SplatUndef = uint8_t(Undef16) & uint8_t(Undef16 >> 8);
1393 SplatSize = 1;
1394 return true;
1395}
1396
Chris Lattner4a998b92006-04-17 06:00:21 +00001397/// BuildSplatI - Build a canonical splati of Val with an element size of
1398/// SplatSize. Cast the result to VT.
1399static SDOperand BuildSplatI(int Val, unsigned SplatSize, MVT::ValueType VT,
1400 SelectionDAG &DAG) {
1401 assert(Val >= -16 && Val <= 15 && "vsplti is out of range!");
Chris Lattner6876e662006-04-17 06:58:41 +00001402
1403 // Force vspltis[hw] -1 to vspltisb -1.
1404 if (Val == -1) SplatSize = 1;
1405
Chris Lattner4a998b92006-04-17 06:00:21 +00001406 static const MVT::ValueType VTys[] = { // canonical VT to use for each size.
1407 MVT::v16i8, MVT::v8i16, MVT::Other, MVT::v4i32
1408 };
1409 MVT::ValueType CanonicalVT = VTys[SplatSize-1];
1410
1411 // Build a canonical splat for this value.
1412 SDOperand Elt = DAG.getConstant(Val, MVT::getVectorBaseType(CanonicalVT));
1413 std::vector<SDOperand> Ops(MVT::getVectorNumElements(CanonicalVT), Elt);
1414 SDOperand Res = DAG.getNode(ISD::BUILD_VECTOR, CanonicalVT, Ops);
1415 return DAG.getNode(ISD::BIT_CONVERT, VT, Res);
1416}
1417
Chris Lattnere7c768e2006-04-18 03:24:30 +00001418/// BuildIntrinsicOp - Return a binary operator intrinsic node with the
Chris Lattner6876e662006-04-17 06:58:41 +00001419/// specified intrinsic ID.
Chris Lattnere7c768e2006-04-18 03:24:30 +00001420static SDOperand BuildIntrinsicOp(unsigned IID, SDOperand LHS, SDOperand RHS,
1421 SelectionDAG &DAG,
1422 MVT::ValueType DestVT = MVT::Other) {
1423 if (DestVT == MVT::Other) DestVT = LHS.getValueType();
1424 return DAG.getNode(ISD::INTRINSIC_WO_CHAIN, DestVT,
Chris Lattner6876e662006-04-17 06:58:41 +00001425 DAG.getConstant(IID, MVT::i32), LHS, RHS);
1426}
1427
Chris Lattnere7c768e2006-04-18 03:24:30 +00001428/// BuildIntrinsicOp - Return a ternary operator intrinsic node with the
1429/// specified intrinsic ID.
1430static SDOperand BuildIntrinsicOp(unsigned IID, SDOperand Op0, SDOperand Op1,
1431 SDOperand Op2, SelectionDAG &DAG,
1432 MVT::ValueType DestVT = MVT::Other) {
1433 if (DestVT == MVT::Other) DestVT = Op0.getValueType();
1434 return DAG.getNode(ISD::INTRINSIC_WO_CHAIN, DestVT,
1435 DAG.getConstant(IID, MVT::i32), Op0, Op1, Op2);
1436}
1437
1438
Chris Lattnerbdd558c2006-04-17 17:55:10 +00001439/// BuildVSLDOI - Return a VECTOR_SHUFFLE that is a vsldoi of the specified
1440/// amount. The result has the specified value type.
1441static SDOperand BuildVSLDOI(SDOperand LHS, SDOperand RHS, unsigned Amt,
1442 MVT::ValueType VT, SelectionDAG &DAG) {
1443 // Force LHS/RHS to be the right type.
1444 LHS = DAG.getNode(ISD::BIT_CONVERT, MVT::v16i8, LHS);
1445 RHS = DAG.getNode(ISD::BIT_CONVERT, MVT::v16i8, RHS);
1446
1447 std::vector<SDOperand> Ops;
1448 for (unsigned i = 0; i != 16; ++i)
1449 Ops.push_back(DAG.getConstant(i+Amt, MVT::i32));
1450 SDOperand T = DAG.getNode(ISD::VECTOR_SHUFFLE, MVT::v16i8, LHS, RHS,
1451 DAG.getNode(ISD::BUILD_VECTOR, MVT::v16i8, Ops));
1452 return DAG.getNode(ISD::BIT_CONVERT, VT, T);
1453}
1454
Chris Lattnerf1b47082006-04-14 05:19:18 +00001455// If this is a case we can't handle, return null and let the default
1456// expansion code take care of it. If we CAN select this case, and if it
1457// selects to a single instruction, return Op. Otherwise, if we can codegen
1458// this case more efficiently than a constant pool load, lower it to the
1459// sequence of ops that should be used.
1460static SDOperand LowerBUILD_VECTOR(SDOperand Op, SelectionDAG &DAG) {
1461 // If this is a vector of constants or undefs, get the bits. A bit in
1462 // UndefBits is set if the corresponding element of the vector is an
1463 // ISD::UNDEF value. For undefs, the corresponding VectorBits values are
1464 // zero.
1465 uint64_t VectorBits[2];
1466 uint64_t UndefBits[2];
1467 if (GetConstantBuildVectorBits(Op.Val, VectorBits, UndefBits))
1468 return SDOperand(); // Not a constant vector.
1469
Chris Lattnerb17f1672006-04-16 01:01:29 +00001470 // If this is a splat (repetition) of a value across the whole vector, return
1471 // the smallest size that splats it. For example, "0x01010101010101..." is a
1472 // splat of 0x01, 0x0101, and 0x01010101. We return SplatBits = 0x01 and
1473 // SplatSize = 1 byte.
1474 unsigned SplatBits, SplatUndef, SplatSize;
1475 if (isConstantSplat(VectorBits, UndefBits, SplatBits, SplatUndef, SplatSize)){
1476 bool HasAnyUndefs = (UndefBits[0] | UndefBits[1]) != 0;
1477
1478 // First, handle single instruction cases.
1479
1480 // All zeros?
1481 if (SplatBits == 0) {
1482 // Canonicalize all zero vectors to be v4i32.
1483 if (Op.getValueType() != MVT::v4i32 || HasAnyUndefs) {
1484 SDOperand Z = DAG.getConstant(0, MVT::i32);
1485 Z = DAG.getNode(ISD::BUILD_VECTOR, MVT::v4i32, Z, Z, Z, Z);
1486 Op = DAG.getNode(ISD::BIT_CONVERT, Op.getValueType(), Z);
1487 }
1488 return Op;
Chris Lattnerf1b47082006-04-14 05:19:18 +00001489 }
Chris Lattnerb17f1672006-04-16 01:01:29 +00001490
1491 // If the sign extended value is in the range [-16,15], use VSPLTI[bhw].
1492 int32_t SextVal= int32_t(SplatBits << (32-8*SplatSize)) >> (32-8*SplatSize);
Chris Lattner4a998b92006-04-17 06:00:21 +00001493 if (SextVal >= -16 && SextVal <= 15)
1494 return BuildSplatI(SextVal, SplatSize, Op.getValueType(), DAG);
Chris Lattnerb17f1672006-04-16 01:01:29 +00001495
Chris Lattnerdbce85d2006-04-17 18:09:22 +00001496
1497 // Two instruction sequences.
1498
Chris Lattner4a998b92006-04-17 06:00:21 +00001499 // If this value is in the range [-32,30] and is even, use:
1500 // tmp = VSPLTI[bhw], result = add tmp, tmp
1501 if (SextVal >= -32 && SextVal <= 30 && (SextVal & 1) == 0) {
1502 Op = BuildSplatI(SextVal >> 1, SplatSize, Op.getValueType(), DAG);
1503 return DAG.getNode(ISD::ADD, Op.getValueType(), Op, Op);
1504 }
Chris Lattner6876e662006-04-17 06:58:41 +00001505
1506 // If this is 0x8000_0000 x 4, turn into vspltisw + vslw. If it is
1507 // 0x7FFF_FFFF x 4, turn it into not(0x8000_0000). This is important
1508 // for fneg/fabs.
1509 if (SplatSize == 4 && SplatBits == (0x7FFFFFFF&~SplatUndef)) {
1510 // Make -1 and vspltisw -1:
1511 SDOperand OnesV = BuildSplatI(-1, 4, MVT::v4i32, DAG);
1512
1513 // Make the VSLW intrinsic, computing 0x8000_0000.
Chris Lattnere7c768e2006-04-18 03:24:30 +00001514 SDOperand Res = BuildIntrinsicOp(Intrinsic::ppc_altivec_vslw, OnesV,
1515 OnesV, DAG);
Chris Lattner6876e662006-04-17 06:58:41 +00001516
1517 // xor by OnesV to invert it.
1518 Res = DAG.getNode(ISD::XOR, MVT::v4i32, Res, OnesV);
1519 return DAG.getNode(ISD::BIT_CONVERT, Op.getValueType(), Res);
1520 }
1521
1522 // Check to see if this is a wide variety of vsplti*, binop self cases.
1523 unsigned SplatBitSize = SplatSize*8;
1524 static const char SplatCsts[] = {
1525 -1, 1, -2, 2, -3, 3, -4, 4, -5, 5, -6, 6, -7, 7,
Chris Lattnerdbce85d2006-04-17 18:09:22 +00001526 -8, 8, -9, 9, -10, 10, -11, 11, -12, 12, -13, 13, 14, -14, 15, -15, -16
Chris Lattner6876e662006-04-17 06:58:41 +00001527 };
1528 for (unsigned idx = 0; idx < sizeof(SplatCsts)/sizeof(SplatCsts[0]); ++idx){
1529 // Indirect through the SplatCsts array so that we favor 'vsplti -1' for
1530 // cases which are ambiguous (e.g. formation of 0x8000_0000). 'vsplti -1'
1531 int i = SplatCsts[idx];
1532
1533 // Figure out what shift amount will be used by altivec if shifted by i in
1534 // this splat size.
1535 unsigned TypeShiftAmt = i & (SplatBitSize-1);
1536
1537 // vsplti + shl self.
1538 if (SextVal == (i << (int)TypeShiftAmt)) {
1539 Op = BuildSplatI(i, SplatSize, Op.getValueType(), DAG);
1540 static const unsigned IIDs[] = { // Intrinsic to use for each size.
1541 Intrinsic::ppc_altivec_vslb, Intrinsic::ppc_altivec_vslh, 0,
1542 Intrinsic::ppc_altivec_vslw
1543 };
Chris Lattnere7c768e2006-04-18 03:24:30 +00001544 return BuildIntrinsicOp(IIDs[SplatSize-1], Op, Op, DAG);
Chris Lattner6876e662006-04-17 06:58:41 +00001545 }
1546
1547 // vsplti + srl self.
1548 if (SextVal == (int)((unsigned)i >> TypeShiftAmt)) {
1549 Op = BuildSplatI(i, SplatSize, Op.getValueType(), DAG);
1550 static const unsigned IIDs[] = { // Intrinsic to use for each size.
1551 Intrinsic::ppc_altivec_vsrb, Intrinsic::ppc_altivec_vsrh, 0,
1552 Intrinsic::ppc_altivec_vsrw
1553 };
Chris Lattnere7c768e2006-04-18 03:24:30 +00001554 return BuildIntrinsicOp(IIDs[SplatSize-1], Op, Op, DAG);
Chris Lattner6876e662006-04-17 06:58:41 +00001555 }
1556
1557 // vsplti + sra self.
1558 if (SextVal == (int)((unsigned)i >> TypeShiftAmt)) {
1559 Op = BuildSplatI(i, SplatSize, Op.getValueType(), DAG);
1560 static const unsigned IIDs[] = { // Intrinsic to use for each size.
1561 Intrinsic::ppc_altivec_vsrab, Intrinsic::ppc_altivec_vsrah, 0,
1562 Intrinsic::ppc_altivec_vsraw
1563 };
Chris Lattnere7c768e2006-04-18 03:24:30 +00001564 return BuildIntrinsicOp(IIDs[SplatSize-1], Op, Op, DAG);
Chris Lattner6876e662006-04-17 06:58:41 +00001565 }
1566
Chris Lattnerbdd558c2006-04-17 17:55:10 +00001567 // vsplti + rol self.
1568 if (SextVal == (int)(((unsigned)i << TypeShiftAmt) |
1569 ((unsigned)i >> (SplatBitSize-TypeShiftAmt)))) {
1570 Op = BuildSplatI(i, SplatSize, Op.getValueType(), DAG);
1571 static const unsigned IIDs[] = { // Intrinsic to use for each size.
1572 Intrinsic::ppc_altivec_vrlb, Intrinsic::ppc_altivec_vrlh, 0,
1573 Intrinsic::ppc_altivec_vrlw
1574 };
Chris Lattnere7c768e2006-04-18 03:24:30 +00001575 return BuildIntrinsicOp(IIDs[SplatSize-1], Op, Op, DAG);
Chris Lattnerbdd558c2006-04-17 17:55:10 +00001576 }
1577
1578 // t = vsplti c, result = vsldoi t, t, 1
1579 if (SextVal == ((i << 8) | (i >> (TypeShiftAmt-8)))) {
1580 SDOperand T = BuildSplatI(i, SplatSize, MVT::v16i8, DAG);
1581 return BuildVSLDOI(T, T, 1, Op.getValueType(), DAG);
1582 }
1583 // t = vsplti c, result = vsldoi t, t, 2
1584 if (SextVal == ((i << 16) | (i >> (TypeShiftAmt-16)))) {
1585 SDOperand T = BuildSplatI(i, SplatSize, MVT::v16i8, DAG);
1586 return BuildVSLDOI(T, T, 2, Op.getValueType(), DAG);
1587 }
1588 // t = vsplti c, result = vsldoi t, t, 3
1589 if (SextVal == ((i << 24) | (i >> (TypeShiftAmt-24)))) {
1590 SDOperand T = BuildSplatI(i, SplatSize, MVT::v16i8, DAG);
1591 return BuildVSLDOI(T, T, 3, Op.getValueType(), DAG);
1592 }
Chris Lattner6876e662006-04-17 06:58:41 +00001593 }
1594
Chris Lattner6876e662006-04-17 06:58:41 +00001595 // Three instruction sequences.
1596
Chris Lattnerdbce85d2006-04-17 18:09:22 +00001597 // Odd, in range [17,31]: (vsplti C)-(vsplti -16).
1598 if (SextVal >= 0 && SextVal <= 31) {
1599 SDOperand LHS = BuildSplatI(SextVal-16, SplatSize, Op.getValueType(),DAG);
1600 SDOperand RHS = BuildSplatI(-16, SplatSize, Op.getValueType(), DAG);
1601 return DAG.getNode(ISD::SUB, Op.getValueType(), LHS, RHS);
1602 }
1603 // Odd, in range [-31,-17]: (vsplti C)+(vsplti -16).
1604 if (SextVal >= -31 && SextVal <= 0) {
1605 SDOperand LHS = BuildSplatI(SextVal+16, SplatSize, Op.getValueType(),DAG);
1606 SDOperand RHS = BuildSplatI(-16, SplatSize, Op.getValueType(), DAG);
Chris Lattnerc4083822006-04-17 06:07:44 +00001607 return DAG.getNode(ISD::ADD, Op.getValueType(), LHS, RHS);
Chris Lattnerf1b47082006-04-14 05:19:18 +00001608 }
1609 }
Chris Lattnerb17f1672006-04-16 01:01:29 +00001610
Chris Lattnerf1b47082006-04-14 05:19:18 +00001611 return SDOperand();
1612}
1613
Chris Lattner59138102006-04-17 05:28:54 +00001614/// GeneratePerfectShuffle - Given an entry in the perfect-shuffle table, emit
1615/// the specified operations to build the shuffle.
1616static SDOperand GeneratePerfectShuffle(unsigned PFEntry, SDOperand LHS,
1617 SDOperand RHS, SelectionDAG &DAG) {
1618 unsigned OpNum = (PFEntry >> 26) & 0x0F;
1619 unsigned LHSID = (PFEntry >> 13) & ((1 << 13)-1);
1620 unsigned RHSID = (PFEntry >> 0) & ((1 << 13)-1);
1621
1622 enum {
Chris Lattner00402c72006-05-16 04:20:24 +00001623 OP_COPY = 0, // Copy, used for things like <u,u,u,3> to say it is <0,1,2,3>
Chris Lattner59138102006-04-17 05:28:54 +00001624 OP_VMRGHW,
1625 OP_VMRGLW,
1626 OP_VSPLTISW0,
1627 OP_VSPLTISW1,
1628 OP_VSPLTISW2,
1629 OP_VSPLTISW3,
1630 OP_VSLDOI4,
1631 OP_VSLDOI8,
1632 OP_VSLDOI12,
1633 };
1634
1635 if (OpNum == OP_COPY) {
1636 if (LHSID == (1*9+2)*9+3) return LHS;
1637 assert(LHSID == ((4*9+5)*9+6)*9+7 && "Illegal OP_COPY!");
1638 return RHS;
1639 }
1640
Chris Lattnerbdd558c2006-04-17 17:55:10 +00001641 SDOperand OpLHS, OpRHS;
1642 OpLHS = GeneratePerfectShuffle(PerfectShuffleTable[LHSID], LHS, RHS, DAG);
1643 OpRHS = GeneratePerfectShuffle(PerfectShuffleTable[RHSID], LHS, RHS, DAG);
1644
Chris Lattner59138102006-04-17 05:28:54 +00001645 unsigned ShufIdxs[16];
1646 switch (OpNum) {
1647 default: assert(0 && "Unknown i32 permute!");
1648 case OP_VMRGHW:
1649 ShufIdxs[ 0] = 0; ShufIdxs[ 1] = 1; ShufIdxs[ 2] = 2; ShufIdxs[ 3] = 3;
1650 ShufIdxs[ 4] = 16; ShufIdxs[ 5] = 17; ShufIdxs[ 6] = 18; ShufIdxs[ 7] = 19;
1651 ShufIdxs[ 8] = 4; ShufIdxs[ 9] = 5; ShufIdxs[10] = 6; ShufIdxs[11] = 7;
1652 ShufIdxs[12] = 20; ShufIdxs[13] = 21; ShufIdxs[14] = 22; ShufIdxs[15] = 23;
1653 break;
1654 case OP_VMRGLW:
1655 ShufIdxs[ 0] = 8; ShufIdxs[ 1] = 9; ShufIdxs[ 2] = 10; ShufIdxs[ 3] = 11;
1656 ShufIdxs[ 4] = 24; ShufIdxs[ 5] = 25; ShufIdxs[ 6] = 26; ShufIdxs[ 7] = 27;
1657 ShufIdxs[ 8] = 12; ShufIdxs[ 9] = 13; ShufIdxs[10] = 14; ShufIdxs[11] = 15;
1658 ShufIdxs[12] = 28; ShufIdxs[13] = 29; ShufIdxs[14] = 30; ShufIdxs[15] = 31;
1659 break;
1660 case OP_VSPLTISW0:
1661 for (unsigned i = 0; i != 16; ++i)
1662 ShufIdxs[i] = (i&3)+0;
1663 break;
1664 case OP_VSPLTISW1:
1665 for (unsigned i = 0; i != 16; ++i)
1666 ShufIdxs[i] = (i&3)+4;
1667 break;
1668 case OP_VSPLTISW2:
1669 for (unsigned i = 0; i != 16; ++i)
1670 ShufIdxs[i] = (i&3)+8;
1671 break;
1672 case OP_VSPLTISW3:
1673 for (unsigned i = 0; i != 16; ++i)
1674 ShufIdxs[i] = (i&3)+12;
1675 break;
1676 case OP_VSLDOI4:
Chris Lattnerbdd558c2006-04-17 17:55:10 +00001677 return BuildVSLDOI(OpLHS, OpRHS, 4, OpLHS.getValueType(), DAG);
Chris Lattner59138102006-04-17 05:28:54 +00001678 case OP_VSLDOI8:
Chris Lattnerbdd558c2006-04-17 17:55:10 +00001679 return BuildVSLDOI(OpLHS, OpRHS, 8, OpLHS.getValueType(), DAG);
Chris Lattner59138102006-04-17 05:28:54 +00001680 case OP_VSLDOI12:
Chris Lattnerbdd558c2006-04-17 17:55:10 +00001681 return BuildVSLDOI(OpLHS, OpRHS, 12, OpLHS.getValueType(), DAG);
Chris Lattner59138102006-04-17 05:28:54 +00001682 }
1683 std::vector<SDOperand> Ops;
1684 for (unsigned i = 0; i != 16; ++i)
1685 Ops.push_back(DAG.getConstant(ShufIdxs[i], MVT::i32));
Chris Lattner59138102006-04-17 05:28:54 +00001686
1687 return DAG.getNode(ISD::VECTOR_SHUFFLE, OpLHS.getValueType(), OpLHS, OpRHS,
1688 DAG.getNode(ISD::BUILD_VECTOR, MVT::v16i8, Ops));
1689}
1690
Chris Lattnerf1b47082006-04-14 05:19:18 +00001691/// LowerVECTOR_SHUFFLE - Return the code we lower for VECTOR_SHUFFLE. If this
1692/// is a shuffle we can handle in a single instruction, return it. Otherwise,
1693/// return the code it can be lowered into. Worst case, it can always be
1694/// lowered into a vperm.
1695static SDOperand LowerVECTOR_SHUFFLE(SDOperand Op, SelectionDAG &DAG) {
1696 SDOperand V1 = Op.getOperand(0);
1697 SDOperand V2 = Op.getOperand(1);
1698 SDOperand PermMask = Op.getOperand(2);
1699
1700 // Cases that are handled by instructions that take permute immediates
1701 // (such as vsplt*) should be left as VECTOR_SHUFFLE nodes so they can be
1702 // selected by the instruction selector.
1703 if (V2.getOpcode() == ISD::UNDEF) {
1704 if (PPC::isSplatShuffleMask(PermMask.Val, 1) ||
1705 PPC::isSplatShuffleMask(PermMask.Val, 2) ||
1706 PPC::isSplatShuffleMask(PermMask.Val, 4) ||
1707 PPC::isVPKUWUMShuffleMask(PermMask.Val, true) ||
1708 PPC::isVPKUHUMShuffleMask(PermMask.Val, true) ||
1709 PPC::isVSLDOIShuffleMask(PermMask.Val, true) != -1 ||
1710 PPC::isVMRGLShuffleMask(PermMask.Val, 1, true) ||
1711 PPC::isVMRGLShuffleMask(PermMask.Val, 2, true) ||
1712 PPC::isVMRGLShuffleMask(PermMask.Val, 4, true) ||
1713 PPC::isVMRGHShuffleMask(PermMask.Val, 1, true) ||
1714 PPC::isVMRGHShuffleMask(PermMask.Val, 2, true) ||
1715 PPC::isVMRGHShuffleMask(PermMask.Val, 4, true)) {
1716 return Op;
1717 }
1718 }
1719
1720 // Altivec has a variety of "shuffle immediates" that take two vector inputs
1721 // and produce a fixed permutation. If any of these match, do not lower to
1722 // VPERM.
1723 if (PPC::isVPKUWUMShuffleMask(PermMask.Val, false) ||
1724 PPC::isVPKUHUMShuffleMask(PermMask.Val, false) ||
1725 PPC::isVSLDOIShuffleMask(PermMask.Val, false) != -1 ||
1726 PPC::isVMRGLShuffleMask(PermMask.Val, 1, false) ||
1727 PPC::isVMRGLShuffleMask(PermMask.Val, 2, false) ||
1728 PPC::isVMRGLShuffleMask(PermMask.Val, 4, false) ||
1729 PPC::isVMRGHShuffleMask(PermMask.Val, 1, false) ||
1730 PPC::isVMRGHShuffleMask(PermMask.Val, 2, false) ||
1731 PPC::isVMRGHShuffleMask(PermMask.Val, 4, false))
1732 return Op;
1733
Chris Lattner59138102006-04-17 05:28:54 +00001734 // Check to see if this is a shuffle of 4-byte values. If so, we can use our
1735 // perfect shuffle table to emit an optimal matching sequence.
1736 unsigned PFIndexes[4];
1737 bool isFourElementShuffle = true;
1738 for (unsigned i = 0; i != 4 && isFourElementShuffle; ++i) { // Element number
1739 unsigned EltNo = 8; // Start out undef.
1740 for (unsigned j = 0; j != 4; ++j) { // Intra-element byte.
1741 if (PermMask.getOperand(i*4+j).getOpcode() == ISD::UNDEF)
1742 continue; // Undef, ignore it.
1743
1744 unsigned ByteSource =
1745 cast<ConstantSDNode>(PermMask.getOperand(i*4+j))->getValue();
1746 if ((ByteSource & 3) != j) {
1747 isFourElementShuffle = false;
1748 break;
1749 }
1750
1751 if (EltNo == 8) {
1752 EltNo = ByteSource/4;
1753 } else if (EltNo != ByteSource/4) {
1754 isFourElementShuffle = false;
1755 break;
1756 }
1757 }
1758 PFIndexes[i] = EltNo;
1759 }
1760
1761 // If this shuffle can be expressed as a shuffle of 4-byte elements, use the
1762 // perfect shuffle vector to determine if it is cost effective to do this as
1763 // discrete instructions, or whether we should use a vperm.
1764 if (isFourElementShuffle) {
1765 // Compute the index in the perfect shuffle table.
1766 unsigned PFTableIndex =
1767 PFIndexes[0]*9*9*9+PFIndexes[1]*9*9+PFIndexes[2]*9+PFIndexes[3];
1768
1769 unsigned PFEntry = PerfectShuffleTable[PFTableIndex];
1770 unsigned Cost = (PFEntry >> 30);
1771
1772 // Determining when to avoid vperm is tricky. Many things affect the cost
1773 // of vperm, particularly how many times the perm mask needs to be computed.
1774 // For example, if the perm mask can be hoisted out of a loop or is already
1775 // used (perhaps because there are multiple permutes with the same shuffle
1776 // mask?) the vperm has a cost of 1. OTOH, hoisting the permute mask out of
1777 // the loop requires an extra register.
1778 //
1779 // As a compromise, we only emit discrete instructions if the shuffle can be
1780 // generated in 3 or fewer operations. When we have loop information
1781 // available, if this block is within a loop, we should avoid using vperm
1782 // for 3-operation perms and use a constant pool load instead.
1783 if (Cost < 3)
1784 return GeneratePerfectShuffle(PFEntry, V1, V2, DAG);
1785 }
Chris Lattnerf1b47082006-04-14 05:19:18 +00001786
1787 // Lower this to a VPERM(V1, V2, V3) expression, where V3 is a constant
1788 // vector that will get spilled to the constant pool.
1789 if (V2.getOpcode() == ISD::UNDEF) V2 = V1;
1790
1791 // The SHUFFLE_VECTOR mask is almost exactly what we want for vperm, except
1792 // that it is in input element units, not in bytes. Convert now.
1793 MVT::ValueType EltVT = MVT::getVectorBaseType(V1.getValueType());
1794 unsigned BytesPerElement = MVT::getSizeInBits(EltVT)/8;
1795
1796 std::vector<SDOperand> ResultMask;
1797 for (unsigned i = 0, e = PermMask.getNumOperands(); i != e; ++i) {
Chris Lattner730b4562006-04-15 23:48:05 +00001798 unsigned SrcElt;
1799 if (PermMask.getOperand(i).getOpcode() == ISD::UNDEF)
1800 SrcElt = 0;
1801 else
1802 SrcElt = cast<ConstantSDNode>(PermMask.getOperand(i))->getValue();
Chris Lattnerf1b47082006-04-14 05:19:18 +00001803
1804 for (unsigned j = 0; j != BytesPerElement; ++j)
1805 ResultMask.push_back(DAG.getConstant(SrcElt*BytesPerElement+j,
1806 MVT::i8));
1807 }
1808
1809 SDOperand VPermMask = DAG.getNode(ISD::BUILD_VECTOR, MVT::v16i8, ResultMask);
1810 return DAG.getNode(PPCISD::VPERM, V1.getValueType(), V1, V2, VPermMask);
1811}
1812
Chris Lattner90564f22006-04-18 17:59:36 +00001813/// getAltivecCompareInfo - Given an intrinsic, return false if it is not an
1814/// altivec comparison. If it is, return true and fill in Opc/isDot with
1815/// information about the intrinsic.
1816static bool getAltivecCompareInfo(SDOperand Intrin, int &CompareOpc,
1817 bool &isDot) {
1818 unsigned IntrinsicID = cast<ConstantSDNode>(Intrin.getOperand(0))->getValue();
1819 CompareOpc = -1;
1820 isDot = false;
1821 switch (IntrinsicID) {
1822 default: return false;
1823 // Comparison predicates.
Chris Lattner1a635d62006-04-14 06:01:58 +00001824 case Intrinsic::ppc_altivec_vcmpbfp_p: CompareOpc = 966; isDot = 1; break;
1825 case Intrinsic::ppc_altivec_vcmpeqfp_p: CompareOpc = 198; isDot = 1; break;
1826 case Intrinsic::ppc_altivec_vcmpequb_p: CompareOpc = 6; isDot = 1; break;
1827 case Intrinsic::ppc_altivec_vcmpequh_p: CompareOpc = 70; isDot = 1; break;
1828 case Intrinsic::ppc_altivec_vcmpequw_p: CompareOpc = 134; isDot = 1; break;
1829 case Intrinsic::ppc_altivec_vcmpgefp_p: CompareOpc = 454; isDot = 1; break;
1830 case Intrinsic::ppc_altivec_vcmpgtfp_p: CompareOpc = 710; isDot = 1; break;
1831 case Intrinsic::ppc_altivec_vcmpgtsb_p: CompareOpc = 774; isDot = 1; break;
1832 case Intrinsic::ppc_altivec_vcmpgtsh_p: CompareOpc = 838; isDot = 1; break;
1833 case Intrinsic::ppc_altivec_vcmpgtsw_p: CompareOpc = 902; isDot = 1; break;
1834 case Intrinsic::ppc_altivec_vcmpgtub_p: CompareOpc = 518; isDot = 1; break;
1835 case Intrinsic::ppc_altivec_vcmpgtuh_p: CompareOpc = 582; isDot = 1; break;
1836 case Intrinsic::ppc_altivec_vcmpgtuw_p: CompareOpc = 646; isDot = 1; break;
1837
1838 // Normal Comparisons.
1839 case Intrinsic::ppc_altivec_vcmpbfp: CompareOpc = 966; isDot = 0; break;
1840 case Intrinsic::ppc_altivec_vcmpeqfp: CompareOpc = 198; isDot = 0; break;
1841 case Intrinsic::ppc_altivec_vcmpequb: CompareOpc = 6; isDot = 0; break;
1842 case Intrinsic::ppc_altivec_vcmpequh: CompareOpc = 70; isDot = 0; break;
1843 case Intrinsic::ppc_altivec_vcmpequw: CompareOpc = 134; isDot = 0; break;
1844 case Intrinsic::ppc_altivec_vcmpgefp: CompareOpc = 454; isDot = 0; break;
1845 case Intrinsic::ppc_altivec_vcmpgtfp: CompareOpc = 710; isDot = 0; break;
1846 case Intrinsic::ppc_altivec_vcmpgtsb: CompareOpc = 774; isDot = 0; break;
1847 case Intrinsic::ppc_altivec_vcmpgtsh: CompareOpc = 838; isDot = 0; break;
1848 case Intrinsic::ppc_altivec_vcmpgtsw: CompareOpc = 902; isDot = 0; break;
1849 case Intrinsic::ppc_altivec_vcmpgtub: CompareOpc = 518; isDot = 0; break;
1850 case Intrinsic::ppc_altivec_vcmpgtuh: CompareOpc = 582; isDot = 0; break;
1851 case Intrinsic::ppc_altivec_vcmpgtuw: CompareOpc = 646; isDot = 0; break;
1852 }
Chris Lattner90564f22006-04-18 17:59:36 +00001853 return true;
1854}
1855
1856/// LowerINTRINSIC_WO_CHAIN - If this is an intrinsic that we want to custom
1857/// lower, do it, otherwise return null.
1858static SDOperand LowerINTRINSIC_WO_CHAIN(SDOperand Op, SelectionDAG &DAG) {
1859 // If this is a lowered altivec predicate compare, CompareOpc is set to the
1860 // opcode number of the comparison.
1861 int CompareOpc;
1862 bool isDot;
1863 if (!getAltivecCompareInfo(Op, CompareOpc, isDot))
1864 return SDOperand(); // Don't custom lower most intrinsics.
Chris Lattner1a635d62006-04-14 06:01:58 +00001865
Chris Lattner90564f22006-04-18 17:59:36 +00001866 // If this is a non-dot comparison, make the VCMP node and we are done.
Chris Lattner1a635d62006-04-14 06:01:58 +00001867 if (!isDot) {
1868 SDOperand Tmp = DAG.getNode(PPCISD::VCMP, Op.getOperand(2).getValueType(),
1869 Op.getOperand(1), Op.getOperand(2),
1870 DAG.getConstant(CompareOpc, MVT::i32));
1871 return DAG.getNode(ISD::BIT_CONVERT, Op.getValueType(), Tmp);
1872 }
1873
1874 // Create the PPCISD altivec 'dot' comparison node.
1875 std::vector<SDOperand> Ops;
1876 std::vector<MVT::ValueType> VTs;
1877 Ops.push_back(Op.getOperand(2)); // LHS
1878 Ops.push_back(Op.getOperand(3)); // RHS
1879 Ops.push_back(DAG.getConstant(CompareOpc, MVT::i32));
1880 VTs.push_back(Op.getOperand(2).getValueType());
1881 VTs.push_back(MVT::Flag);
1882 SDOperand CompNode = DAG.getNode(PPCISD::VCMPo, VTs, Ops);
1883
1884 // Now that we have the comparison, emit a copy from the CR to a GPR.
1885 // This is flagged to the above dot comparison.
1886 SDOperand Flags = DAG.getNode(PPCISD::MFCR, MVT::i32,
1887 DAG.getRegister(PPC::CR6, MVT::i32),
1888 CompNode.getValue(1));
1889
1890 // Unpack the result based on how the target uses it.
1891 unsigned BitNo; // Bit # of CR6.
1892 bool InvertBit; // Invert result?
1893 switch (cast<ConstantSDNode>(Op.getOperand(1))->getValue()) {
1894 default: // Can't happen, don't crash on invalid number though.
1895 case 0: // Return the value of the EQ bit of CR6.
1896 BitNo = 0; InvertBit = false;
1897 break;
1898 case 1: // Return the inverted value of the EQ bit of CR6.
1899 BitNo = 0; InvertBit = true;
1900 break;
1901 case 2: // Return the value of the LT bit of CR6.
1902 BitNo = 2; InvertBit = false;
1903 break;
1904 case 3: // Return the inverted value of the LT bit of CR6.
1905 BitNo = 2; InvertBit = true;
1906 break;
1907 }
1908
1909 // Shift the bit into the low position.
1910 Flags = DAG.getNode(ISD::SRL, MVT::i32, Flags,
1911 DAG.getConstant(8-(3-BitNo), MVT::i32));
1912 // Isolate the bit.
1913 Flags = DAG.getNode(ISD::AND, MVT::i32, Flags,
1914 DAG.getConstant(1, MVT::i32));
1915
1916 // If we are supposed to, toggle the bit.
1917 if (InvertBit)
1918 Flags = DAG.getNode(ISD::XOR, MVT::i32, Flags,
1919 DAG.getConstant(1, MVT::i32));
1920 return Flags;
1921}
1922
1923static SDOperand LowerSCALAR_TO_VECTOR(SDOperand Op, SelectionDAG &DAG) {
1924 // Create a stack slot that is 16-byte aligned.
1925 MachineFrameInfo *FrameInfo = DAG.getMachineFunction().getFrameInfo();
1926 int FrameIdx = FrameInfo->CreateStackObject(16, 16);
1927 SDOperand FIdx = DAG.getFrameIndex(FrameIdx, MVT::i32);
1928
1929 // Store the input value into Value#0 of the stack slot.
1930 SDOperand Store = DAG.getNode(ISD::STORE, MVT::Other, DAG.getEntryNode(),
1931 Op.getOperand(0), FIdx,DAG.getSrcValue(NULL));
1932 // Load it out.
1933 return DAG.getLoad(Op.getValueType(), Store, FIdx, DAG.getSrcValue(NULL));
1934}
1935
Chris Lattnere7c768e2006-04-18 03:24:30 +00001936static SDOperand LowerMUL(SDOperand Op, SelectionDAG &DAG) {
Chris Lattner72dd9bd2006-04-18 03:43:48 +00001937 if (Op.getValueType() == MVT::v4i32) {
1938 SDOperand LHS = Op.getOperand(0), RHS = Op.getOperand(1);
1939
1940 SDOperand Zero = BuildSplatI( 0, 1, MVT::v4i32, DAG);
1941 SDOperand Neg16 = BuildSplatI(-16, 4, MVT::v4i32, DAG); // +16 as shift amt.
1942
1943 SDOperand RHSSwap = // = vrlw RHS, 16
1944 BuildIntrinsicOp(Intrinsic::ppc_altivec_vrlw, RHS, Neg16, DAG);
1945
1946 // Shrinkify inputs to v8i16.
1947 LHS = DAG.getNode(ISD::BIT_CONVERT, MVT::v8i16, LHS);
1948 RHS = DAG.getNode(ISD::BIT_CONVERT, MVT::v8i16, RHS);
1949 RHSSwap = DAG.getNode(ISD::BIT_CONVERT, MVT::v8i16, RHSSwap);
1950
1951 // Low parts multiplied together, generating 32-bit results (we ignore the
1952 // top parts).
1953 SDOperand LoProd = BuildIntrinsicOp(Intrinsic::ppc_altivec_vmulouh,
1954 LHS, RHS, DAG, MVT::v4i32);
1955
1956 SDOperand HiProd = BuildIntrinsicOp(Intrinsic::ppc_altivec_vmsumuhm,
1957 LHS, RHSSwap, Zero, DAG, MVT::v4i32);
1958 // Shift the high parts up 16 bits.
1959 HiProd = BuildIntrinsicOp(Intrinsic::ppc_altivec_vslw, HiProd, Neg16, DAG);
1960 return DAG.getNode(ISD::ADD, MVT::v4i32, LoProd, HiProd);
1961 } else if (Op.getValueType() == MVT::v8i16) {
1962 SDOperand LHS = Op.getOperand(0), RHS = Op.getOperand(1);
1963
Chris Lattnercea2aa72006-04-18 04:28:57 +00001964 SDOperand Zero = BuildSplatI(0, 1, MVT::v8i16, DAG);
Chris Lattner72dd9bd2006-04-18 03:43:48 +00001965
Chris Lattnercea2aa72006-04-18 04:28:57 +00001966 return BuildIntrinsicOp(Intrinsic::ppc_altivec_vmladduhm,
1967 LHS, RHS, Zero, DAG);
Chris Lattner19a81522006-04-18 03:57:35 +00001968 } else if (Op.getValueType() == MVT::v16i8) {
1969 SDOperand LHS = Op.getOperand(0), RHS = Op.getOperand(1);
1970
1971 // Multiply the even 8-bit parts, producing 16-bit sums.
1972 SDOperand EvenParts = BuildIntrinsicOp(Intrinsic::ppc_altivec_vmuleub,
1973 LHS, RHS, DAG, MVT::v8i16);
1974 EvenParts = DAG.getNode(ISD::BIT_CONVERT, MVT::v16i8, EvenParts);
1975
1976 // Multiply the odd 8-bit parts, producing 16-bit sums.
1977 SDOperand OddParts = BuildIntrinsicOp(Intrinsic::ppc_altivec_vmuloub,
1978 LHS, RHS, DAG, MVT::v8i16);
1979 OddParts = DAG.getNode(ISD::BIT_CONVERT, MVT::v16i8, OddParts);
1980
1981 // Merge the results together.
1982 std::vector<SDOperand> Ops;
1983 for (unsigned i = 0; i != 8; ++i) {
1984 Ops.push_back(DAG.getConstant(2*i+1, MVT::i8));
1985 Ops.push_back(DAG.getConstant(2*i+1+16, MVT::i8));
1986 }
1987
1988 return DAG.getNode(ISD::VECTOR_SHUFFLE, MVT::v16i8, EvenParts, OddParts,
1989 DAG.getNode(ISD::BUILD_VECTOR, MVT::v16i8, Ops));
Chris Lattner72dd9bd2006-04-18 03:43:48 +00001990 } else {
1991 assert(0 && "Unknown mul to lower!");
1992 abort();
1993 }
Chris Lattnere7c768e2006-04-18 03:24:30 +00001994}
1995
Chris Lattnere4bc9ea2005-08-26 00:52:45 +00001996/// LowerOperation - Provide custom lowering hooks for some operations.
1997///
Nate Begeman21e463b2005-10-16 05:39:50 +00001998SDOperand PPCTargetLowering::LowerOperation(SDOperand Op, SelectionDAG &DAG) {
Chris Lattnere4bc9ea2005-08-26 00:52:45 +00001999 switch (Op.getOpcode()) {
2000 default: assert(0 && "Wasn't expecting to be able to lower this!");
Chris Lattner1a635d62006-04-14 06:01:58 +00002001 case ISD::ConstantPool: return LowerConstantPool(Op, DAG);
2002 case ISD::GlobalAddress: return LowerGlobalAddress(Op, DAG);
Nate Begeman37efe672006-04-22 18:53:45 +00002003 case ISD::JumpTable: return LowerJumpTable(Op, DAG);
Chris Lattner1a635d62006-04-14 06:01:58 +00002004 case ISD::SETCC: return LowerSETCC(Op, DAG);
2005 case ISD::VASTART: return LowerVASTART(Op, DAG, VarArgsFrameIndex);
Chris Lattner8ab5fe52006-05-16 18:18:50 +00002006 case ISD::FORMAL_ARGUMENTS: return LowerFORMAL_ARGUMENTS(Op, DAG,
2007 VarArgsFrameIndex);
Chris Lattnerabde4602006-05-16 22:56:08 +00002008 case ISD::CALL: return LowerCALL(Op, DAG);
Chris Lattner1a635d62006-04-14 06:01:58 +00002009 case ISD::RET: return LowerRET(Op, DAG);
Chris Lattner7c0d6642005-10-02 06:37:13 +00002010
Chris Lattner1a635d62006-04-14 06:01:58 +00002011 case ISD::SELECT_CC: return LowerSELECT_CC(Op, DAG);
2012 case ISD::FP_TO_SINT: return LowerFP_TO_SINT(Op, DAG);
2013 case ISD::SINT_TO_FP: return LowerSINT_TO_FP(Op, DAG);
Chris Lattnerecfe55e2006-03-22 05:30:33 +00002014
Chris Lattner1a635d62006-04-14 06:01:58 +00002015 // Lower 64-bit shifts.
2016 case ISD::SHL: return LowerSHL(Op, DAG);
2017 case ISD::SRL: return LowerSRL(Op, DAG);
2018 case ISD::SRA: return LowerSRA(Op, DAG);
Chris Lattnerecfe55e2006-03-22 05:30:33 +00002019
Chris Lattner1a635d62006-04-14 06:01:58 +00002020 // Vector-related lowering.
2021 case ISD::BUILD_VECTOR: return LowerBUILD_VECTOR(Op, DAG);
2022 case ISD::VECTOR_SHUFFLE: return LowerVECTOR_SHUFFLE(Op, DAG);
2023 case ISD::INTRINSIC_WO_CHAIN: return LowerINTRINSIC_WO_CHAIN(Op, DAG);
2024 case ISD::SCALAR_TO_VECTOR: return LowerSCALAR_TO_VECTOR(Op, DAG);
Chris Lattnere7c768e2006-04-18 03:24:30 +00002025 case ISD::MUL: return LowerMUL(Op, DAG);
Chris Lattnerbc11c342005-08-31 20:23:54 +00002026 }
Chris Lattnere4bc9ea2005-08-26 00:52:45 +00002027 return SDOperand();
2028}
2029
Chris Lattner1a635d62006-04-14 06:01:58 +00002030//===----------------------------------------------------------------------===//
2031// Other Lowering Code
2032//===----------------------------------------------------------------------===//
2033
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00002034MachineBasicBlock *
Nate Begeman21e463b2005-10-16 05:39:50 +00002035PPCTargetLowering::InsertAtEndOfBasicBlock(MachineInstr *MI,
2036 MachineBasicBlock *BB) {
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00002037 assert((MI->getOpcode() == PPC::SELECT_CC_Int ||
Chris Lattner919c0322005-10-01 01:35:02 +00002038 MI->getOpcode() == PPC::SELECT_CC_F4 ||
Chris Lattner710ff322006-04-08 22:45:08 +00002039 MI->getOpcode() == PPC::SELECT_CC_F8 ||
2040 MI->getOpcode() == PPC::SELECT_CC_VRRC) &&
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00002041 "Unexpected instr type to insert");
2042
2043 // To "insert" a SELECT_CC instruction, we actually have to insert the diamond
2044 // control-flow pattern. The incoming instruction knows the destination vreg
2045 // to set, the condition code register to branch on, the true/false values to
2046 // select between, and a branch opcode to use.
2047 const BasicBlock *LLVM_BB = BB->getBasicBlock();
2048 ilist<MachineBasicBlock>::iterator It = BB;
2049 ++It;
2050
2051 // thisMBB:
2052 // ...
2053 // TrueVal = ...
2054 // cmpTY ccX, r1, r2
2055 // bCC copy1MBB
2056 // fallthrough --> copy0MBB
2057 MachineBasicBlock *thisMBB = BB;
2058 MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB);
2059 MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB);
2060 BuildMI(BB, MI->getOperand(4).getImmedValue(), 2)
2061 .addReg(MI->getOperand(1).getReg()).addMBB(sinkMBB);
2062 MachineFunction *F = BB->getParent();
2063 F->getBasicBlockList().insert(It, copy0MBB);
2064 F->getBasicBlockList().insert(It, sinkMBB);
Nate Begemanf15485a2006-03-27 01:32:24 +00002065 // Update machine-CFG edges by first adding all successors of the current
2066 // block to the new block which will contain the Phi node for the select.
2067 for(MachineBasicBlock::succ_iterator i = BB->succ_begin(),
2068 e = BB->succ_end(); i != e; ++i)
2069 sinkMBB->addSuccessor(*i);
2070 // Next, remove all successors of the current block, and add the true
2071 // and fallthrough blocks as its successors.
2072 while(!BB->succ_empty())
2073 BB->removeSuccessor(BB->succ_begin());
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00002074 BB->addSuccessor(copy0MBB);
2075 BB->addSuccessor(sinkMBB);
2076
2077 // copy0MBB:
2078 // %FalseValue = ...
2079 // # fallthrough to sinkMBB
2080 BB = copy0MBB;
2081
2082 // Update machine-CFG edges
2083 BB->addSuccessor(sinkMBB);
2084
2085 // sinkMBB:
2086 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
2087 // ...
2088 BB = sinkMBB;
2089 BuildMI(BB, PPC::PHI, 4, MI->getOperand(0).getReg())
2090 .addReg(MI->getOperand(3).getReg()).addMBB(copy0MBB)
2091 .addReg(MI->getOperand(2).getReg()).addMBB(thisMBB);
2092
2093 delete MI; // The pseudo instruction is gone now.
2094 return BB;
2095}
2096
Chris Lattner1a635d62006-04-14 06:01:58 +00002097//===----------------------------------------------------------------------===//
2098// Target Optimization Hooks
2099//===----------------------------------------------------------------------===//
2100
Chris Lattner8c13d0a2006-03-01 04:57:39 +00002101SDOperand PPCTargetLowering::PerformDAGCombine(SDNode *N,
2102 DAGCombinerInfo &DCI) const {
2103 TargetMachine &TM = getTargetMachine();
2104 SelectionDAG &DAG = DCI.DAG;
2105 switch (N->getOpcode()) {
2106 default: break;
2107 case ISD::SINT_TO_FP:
2108 if (TM.getSubtarget<PPCSubtarget>().is64Bit()) {
Chris Lattnerecfe55e2006-03-22 05:30:33 +00002109 if (N->getOperand(0).getOpcode() == ISD::FP_TO_SINT) {
2110 // Turn (sint_to_fp (fp_to_sint X)) -> fctidz/fcfid without load/stores.
2111 // We allow the src/dst to be either f32/f64, but the intermediate
2112 // type must be i64.
2113 if (N->getOperand(0).getValueType() == MVT::i64) {
2114 SDOperand Val = N->getOperand(0).getOperand(0);
2115 if (Val.getValueType() == MVT::f32) {
2116 Val = DAG.getNode(ISD::FP_EXTEND, MVT::f64, Val);
2117 DCI.AddToWorklist(Val.Val);
2118 }
2119
2120 Val = DAG.getNode(PPCISD::FCTIDZ, MVT::f64, Val);
Chris Lattner8c13d0a2006-03-01 04:57:39 +00002121 DCI.AddToWorklist(Val.Val);
Chris Lattnerecfe55e2006-03-22 05:30:33 +00002122 Val = DAG.getNode(PPCISD::FCFID, MVT::f64, Val);
Chris Lattner8c13d0a2006-03-01 04:57:39 +00002123 DCI.AddToWorklist(Val.Val);
Chris Lattnerecfe55e2006-03-22 05:30:33 +00002124 if (N->getValueType(0) == MVT::f32) {
2125 Val = DAG.getNode(ISD::FP_ROUND, MVT::f32, Val);
2126 DCI.AddToWorklist(Val.Val);
2127 }
2128 return Val;
2129 } else if (N->getOperand(0).getValueType() == MVT::i32) {
2130 // If the intermediate type is i32, we can avoid the load/store here
2131 // too.
Chris Lattner8c13d0a2006-03-01 04:57:39 +00002132 }
Chris Lattner8c13d0a2006-03-01 04:57:39 +00002133 }
2134 }
2135 break;
Chris Lattner51269842006-03-01 05:50:56 +00002136 case ISD::STORE:
2137 // Turn STORE (FP_TO_SINT F) -> STFIWX(FCTIWZ(F)).
2138 if (TM.getSubtarget<PPCSubtarget>().hasSTFIWX() &&
2139 N->getOperand(1).getOpcode() == ISD::FP_TO_SINT &&
2140 N->getOperand(1).getValueType() == MVT::i32) {
2141 SDOperand Val = N->getOperand(1).getOperand(0);
2142 if (Val.getValueType() == MVT::f32) {
2143 Val = DAG.getNode(ISD::FP_EXTEND, MVT::f64, Val);
2144 DCI.AddToWorklist(Val.Val);
2145 }
2146 Val = DAG.getNode(PPCISD::FCTIWZ, MVT::f64, Val);
2147 DCI.AddToWorklist(Val.Val);
2148
2149 Val = DAG.getNode(PPCISD::STFIWX, MVT::Other, N->getOperand(0), Val,
2150 N->getOperand(2), N->getOperand(3));
2151 DCI.AddToWorklist(Val.Val);
2152 return Val;
2153 }
2154 break;
Chris Lattner4468c222006-03-31 06:02:07 +00002155 case PPCISD::VCMP: {
2156 // If a VCMPo node already exists with exactly the same operands as this
2157 // node, use its result instead of this node (VCMPo computes both a CR6 and
2158 // a normal output).
2159 //
2160 if (!N->getOperand(0).hasOneUse() &&
2161 !N->getOperand(1).hasOneUse() &&
2162 !N->getOperand(2).hasOneUse()) {
2163
2164 // Scan all of the users of the LHS, looking for VCMPo's that match.
2165 SDNode *VCMPoNode = 0;
2166
2167 SDNode *LHSN = N->getOperand(0).Val;
2168 for (SDNode::use_iterator UI = LHSN->use_begin(), E = LHSN->use_end();
2169 UI != E; ++UI)
2170 if ((*UI)->getOpcode() == PPCISD::VCMPo &&
2171 (*UI)->getOperand(1) == N->getOperand(1) &&
2172 (*UI)->getOperand(2) == N->getOperand(2) &&
2173 (*UI)->getOperand(0) == N->getOperand(0)) {
2174 VCMPoNode = *UI;
2175 break;
2176 }
2177
Chris Lattner00901202006-04-18 18:28:22 +00002178 // If there is no VCMPo node, or if the flag value has a single use, don't
2179 // transform this.
2180 if (!VCMPoNode || VCMPoNode->hasNUsesOfValue(0, 1))
2181 break;
2182
2183 // Look at the (necessarily single) use of the flag value. If it has a
2184 // chain, this transformation is more complex. Note that multiple things
2185 // could use the value result, which we should ignore.
2186 SDNode *FlagUser = 0;
2187 for (SDNode::use_iterator UI = VCMPoNode->use_begin();
2188 FlagUser == 0; ++UI) {
2189 assert(UI != VCMPoNode->use_end() && "Didn't find user!");
2190 SDNode *User = *UI;
2191 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i) {
2192 if (User->getOperand(i) == SDOperand(VCMPoNode, 1)) {
2193 FlagUser = User;
2194 break;
2195 }
2196 }
2197 }
2198
2199 // If the user is a MFCR instruction, we know this is safe. Otherwise we
2200 // give up for right now.
2201 if (FlagUser->getOpcode() == PPCISD::MFCR)
Chris Lattner4468c222006-03-31 06:02:07 +00002202 return SDOperand(VCMPoNode, 0);
2203 }
2204 break;
2205 }
Chris Lattner90564f22006-04-18 17:59:36 +00002206 case ISD::BR_CC: {
2207 // If this is a branch on an altivec predicate comparison, lower this so
2208 // that we don't have to do a MFCR: instead, branch directly on CR6. This
2209 // lowering is done pre-legalize, because the legalizer lowers the predicate
2210 // compare down to code that is difficult to reassemble.
2211 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(1))->get();
2212 SDOperand LHS = N->getOperand(2), RHS = N->getOperand(3);
2213 int CompareOpc;
2214 bool isDot;
2215
2216 if (LHS.getOpcode() == ISD::INTRINSIC_WO_CHAIN &&
2217 isa<ConstantSDNode>(RHS) && (CC == ISD::SETEQ || CC == ISD::SETNE) &&
2218 getAltivecCompareInfo(LHS, CompareOpc, isDot)) {
2219 assert(isDot && "Can't compare against a vector result!");
2220
2221 // If this is a comparison against something other than 0/1, then we know
2222 // that the condition is never/always true.
2223 unsigned Val = cast<ConstantSDNode>(RHS)->getValue();
2224 if (Val != 0 && Val != 1) {
2225 if (CC == ISD::SETEQ) // Cond never true, remove branch.
2226 return N->getOperand(0);
2227 // Always !=, turn it into an unconditional branch.
2228 return DAG.getNode(ISD::BR, MVT::Other,
2229 N->getOperand(0), N->getOperand(4));
2230 }
2231
2232 bool BranchOnWhenPredTrue = (CC == ISD::SETEQ) ^ (Val == 0);
2233
2234 // Create the PPCISD altivec 'dot' comparison node.
2235 std::vector<SDOperand> Ops;
2236 std::vector<MVT::ValueType> VTs;
2237 Ops.push_back(LHS.getOperand(2)); // LHS of compare
2238 Ops.push_back(LHS.getOperand(3)); // RHS of compare
2239 Ops.push_back(DAG.getConstant(CompareOpc, MVT::i32));
2240 VTs.push_back(LHS.getOperand(2).getValueType());
2241 VTs.push_back(MVT::Flag);
2242 SDOperand CompNode = DAG.getNode(PPCISD::VCMPo, VTs, Ops);
2243
2244 // Unpack the result based on how the target uses it.
2245 unsigned CompOpc;
2246 switch (cast<ConstantSDNode>(LHS.getOperand(1))->getValue()) {
2247 default: // Can't happen, don't crash on invalid number though.
2248 case 0: // Branch on the value of the EQ bit of CR6.
2249 CompOpc = BranchOnWhenPredTrue ? PPC::BEQ : PPC::BNE;
2250 break;
2251 case 1: // Branch on the inverted value of the EQ bit of CR6.
2252 CompOpc = BranchOnWhenPredTrue ? PPC::BNE : PPC::BEQ;
2253 break;
2254 case 2: // Branch on the value of the LT bit of CR6.
2255 CompOpc = BranchOnWhenPredTrue ? PPC::BLT : PPC::BGE;
2256 break;
2257 case 3: // Branch on the inverted value of the LT bit of CR6.
2258 CompOpc = BranchOnWhenPredTrue ? PPC::BGE : PPC::BLT;
2259 break;
2260 }
2261
2262 return DAG.getNode(PPCISD::COND_BRANCH, MVT::Other, N->getOperand(0),
2263 DAG.getRegister(PPC::CR6, MVT::i32),
2264 DAG.getConstant(CompOpc, MVT::i32),
2265 N->getOperand(4), CompNode.getValue(1));
2266 }
2267 break;
2268 }
Chris Lattner8c13d0a2006-03-01 04:57:39 +00002269 }
2270
2271 return SDOperand();
2272}
2273
Chris Lattner1a635d62006-04-14 06:01:58 +00002274//===----------------------------------------------------------------------===//
2275// Inline Assembly Support
2276//===----------------------------------------------------------------------===//
2277
Chris Lattnerbbe77de2006-04-02 06:26:07 +00002278void PPCTargetLowering::computeMaskedBitsForTargetNode(const SDOperand Op,
2279 uint64_t Mask,
2280 uint64_t &KnownZero,
2281 uint64_t &KnownOne,
2282 unsigned Depth) const {
2283 KnownZero = 0;
2284 KnownOne = 0;
2285 switch (Op.getOpcode()) {
2286 default: break;
2287 case ISD::INTRINSIC_WO_CHAIN: {
2288 switch (cast<ConstantSDNode>(Op.getOperand(0))->getValue()) {
2289 default: break;
2290 case Intrinsic::ppc_altivec_vcmpbfp_p:
2291 case Intrinsic::ppc_altivec_vcmpeqfp_p:
2292 case Intrinsic::ppc_altivec_vcmpequb_p:
2293 case Intrinsic::ppc_altivec_vcmpequh_p:
2294 case Intrinsic::ppc_altivec_vcmpequw_p:
2295 case Intrinsic::ppc_altivec_vcmpgefp_p:
2296 case Intrinsic::ppc_altivec_vcmpgtfp_p:
2297 case Intrinsic::ppc_altivec_vcmpgtsb_p:
2298 case Intrinsic::ppc_altivec_vcmpgtsh_p:
2299 case Intrinsic::ppc_altivec_vcmpgtsw_p:
2300 case Intrinsic::ppc_altivec_vcmpgtub_p:
2301 case Intrinsic::ppc_altivec_vcmpgtuh_p:
2302 case Intrinsic::ppc_altivec_vcmpgtuw_p:
2303 KnownZero = ~1U; // All bits but the low one are known to be zero.
2304 break;
2305 }
2306 }
2307 }
2308}
2309
2310
Chris Lattnerad3bc8d2006-02-07 20:16:30 +00002311/// getConstraintType - Given a constraint letter, return the type of
2312/// constraint it is for this target.
2313PPCTargetLowering::ConstraintType
2314PPCTargetLowering::getConstraintType(char ConstraintLetter) const {
2315 switch (ConstraintLetter) {
2316 default: break;
2317 case 'b':
2318 case 'r':
2319 case 'f':
2320 case 'v':
2321 case 'y':
2322 return C_RegisterClass;
2323 }
2324 return TargetLowering::getConstraintType(ConstraintLetter);
2325}
2326
2327
Chris Lattnerddc787d2006-01-31 19:20:21 +00002328std::vector<unsigned> PPCTargetLowering::
Chris Lattner1efa40f2006-02-22 00:56:39 +00002329getRegClassForInlineAsmConstraint(const std::string &Constraint,
2330 MVT::ValueType VT) const {
Chris Lattnerddc787d2006-01-31 19:20:21 +00002331 if (Constraint.size() == 1) {
2332 switch (Constraint[0]) { // GCC RS6000 Constraint Letters
2333 default: break; // Unknown constriant letter
2334 case 'b':
2335 return make_vector<unsigned>(/*no R0*/ PPC::R1 , PPC::R2 , PPC::R3 ,
2336 PPC::R4 , PPC::R5 , PPC::R6 , PPC::R7 ,
2337 PPC::R8 , PPC::R9 , PPC::R10, PPC::R11,
2338 PPC::R12, PPC::R13, PPC::R14, PPC::R15,
2339 PPC::R16, PPC::R17, PPC::R18, PPC::R19,
2340 PPC::R20, PPC::R21, PPC::R22, PPC::R23,
2341 PPC::R24, PPC::R25, PPC::R26, PPC::R27,
2342 PPC::R28, PPC::R29, PPC::R30, PPC::R31,
2343 0);
2344 case 'r':
2345 return make_vector<unsigned>(PPC::R0 , PPC::R1 , PPC::R2 , PPC::R3 ,
2346 PPC::R4 , PPC::R5 , PPC::R6 , PPC::R7 ,
2347 PPC::R8 , PPC::R9 , PPC::R10, PPC::R11,
2348 PPC::R12, PPC::R13, PPC::R14, PPC::R15,
2349 PPC::R16, PPC::R17, PPC::R18, PPC::R19,
2350 PPC::R20, PPC::R21, PPC::R22, PPC::R23,
2351 PPC::R24, PPC::R25, PPC::R26, PPC::R27,
2352 PPC::R28, PPC::R29, PPC::R30, PPC::R31,
2353 0);
2354 case 'f':
2355 return make_vector<unsigned>(PPC::F0 , PPC::F1 , PPC::F2 , PPC::F3 ,
2356 PPC::F4 , PPC::F5 , PPC::F6 , PPC::F7 ,
2357 PPC::F8 , PPC::F9 , PPC::F10, PPC::F11,
2358 PPC::F12, PPC::F13, PPC::F14, PPC::F15,
2359 PPC::F16, PPC::F17, PPC::F18, PPC::F19,
2360 PPC::F20, PPC::F21, PPC::F22, PPC::F23,
2361 PPC::F24, PPC::F25, PPC::F26, PPC::F27,
2362 PPC::F28, PPC::F29, PPC::F30, PPC::F31,
2363 0);
2364 case 'v':
2365 return make_vector<unsigned>(PPC::V0 , PPC::V1 , PPC::V2 , PPC::V3 ,
2366 PPC::V4 , PPC::V5 , PPC::V6 , PPC::V7 ,
2367 PPC::V8 , PPC::V9 , PPC::V10, PPC::V11,
2368 PPC::V12, PPC::V13, PPC::V14, PPC::V15,
2369 PPC::V16, PPC::V17, PPC::V18, PPC::V19,
2370 PPC::V20, PPC::V21, PPC::V22, PPC::V23,
2371 PPC::V24, PPC::V25, PPC::V26, PPC::V27,
2372 PPC::V28, PPC::V29, PPC::V30, PPC::V31,
2373 0);
2374 case 'y':
2375 return make_vector<unsigned>(PPC::CR0, PPC::CR1, PPC::CR2, PPC::CR3,
2376 PPC::CR4, PPC::CR5, PPC::CR6, PPC::CR7,
2377 0);
2378 }
2379 }
2380
Chris Lattner1efa40f2006-02-22 00:56:39 +00002381 return std::vector<unsigned>();
Chris Lattnerddc787d2006-01-31 19:20:21 +00002382}
Chris Lattner763317d2006-02-07 00:47:13 +00002383
2384// isOperandValidForConstraint
2385bool PPCTargetLowering::
2386isOperandValidForConstraint(SDOperand Op, char Letter) {
2387 switch (Letter) {
2388 default: break;
2389 case 'I':
2390 case 'J':
2391 case 'K':
2392 case 'L':
2393 case 'M':
2394 case 'N':
2395 case 'O':
2396 case 'P': {
2397 if (!isa<ConstantSDNode>(Op)) return false; // Must be an immediate.
2398 unsigned Value = cast<ConstantSDNode>(Op)->getValue();
2399 switch (Letter) {
2400 default: assert(0 && "Unknown constraint letter!");
2401 case 'I': // "I" is a signed 16-bit constant.
2402 return (short)Value == (int)Value;
2403 case 'J': // "J" is a constant with only the high-order 16 bits nonzero.
2404 case 'L': // "L" is a signed 16-bit constant shifted left 16 bits.
2405 return (short)Value == 0;
2406 case 'K': // "K" is a constant with only the low-order 16 bits nonzero.
2407 return (Value >> 16) == 0;
2408 case 'M': // "M" is a constant that is greater than 31.
2409 return Value > 31;
2410 case 'N': // "N" is a positive constant that is an exact power of two.
2411 return (int)Value > 0 && isPowerOf2_32(Value);
2412 case 'O': // "O" is the constant zero.
2413 return Value == 0;
2414 case 'P': // "P" is a constant whose negation is a signed 16-bit constant.
2415 return (short)-Value == (int)-Value;
2416 }
2417 break;
2418 }
2419 }
2420
2421 // Handle standard constraint letters.
2422 return TargetLowering::isOperandValidForConstraint(Op, Letter);
2423}
Evan Chengc4c62572006-03-13 23:20:37 +00002424
2425/// isLegalAddressImmediate - Return true if the integer value can be used
2426/// as the offset of the target addressing mode.
2427bool PPCTargetLowering::isLegalAddressImmediate(int64_t V) const {
2428 // PPC allows a sign-extended 16-bit immediate field.
2429 return (V > -(1 << 16) && V < (1 << 16)-1);
2430}