blob: 87e2999eb60676b5dd8cd04dd68a0f72f41feea2 [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 Lattnerc703a8f2006-05-17 19:00:46 +0000279 case PPCISD::MTCTR: return "PPCISD::MTCTR";
280 case PPCISD::BCTRL: return "PPCISD::BCTRL";
Chris Lattnerda6d20f2006-01-09 23:52:17 +0000281 case PPCISD::RET_FLAG: return "PPCISD::RET_FLAG";
Chris Lattner6d92cad2006-03-26 10:06:40 +0000282 case PPCISD::MFCR: return "PPCISD::MFCR";
Chris Lattnera17b1552006-03-31 05:13:27 +0000283 case PPCISD::VCMP: return "PPCISD::VCMP";
Chris Lattner6d92cad2006-03-26 10:06:40 +0000284 case PPCISD::VCMPo: return "PPCISD::VCMPo";
Chris Lattnerf70f8d92006-04-18 18:05:58 +0000285 case PPCISD::COND_BRANCH: return "PPCISD::COND_BRANCH";
Chris Lattnerda6d20f2006-01-09 23:52:17 +0000286 }
287}
288
Chris Lattner1a635d62006-04-14 06:01:58 +0000289//===----------------------------------------------------------------------===//
290// Node matching predicates, for use by the tblgen matching code.
291//===----------------------------------------------------------------------===//
292
Chris Lattner0b1e4e52005-08-26 17:36:52 +0000293/// isFloatingPointZero - Return true if this is 0.0 or -0.0.
294static bool isFloatingPointZero(SDOperand Op) {
295 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(Op))
296 return CFP->isExactlyValue(-0.0) || CFP->isExactlyValue(0.0);
297 else if (Op.getOpcode() == ISD::EXTLOAD || Op.getOpcode() == ISD::LOAD) {
298 // Maybe this has already been legalized into the constant pool?
299 if (ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(Op.getOperand(1)))
300 if (ConstantFP *CFP = dyn_cast<ConstantFP>(CP->get()))
301 return CFP->isExactlyValue(-0.0) || CFP->isExactlyValue(0.0);
302 }
303 return false;
304}
305
Chris Lattnerddb739e2006-04-06 17:23:16 +0000306/// isConstantOrUndef - Op is either an undef node or a ConstantSDNode. Return
307/// true if Op is undef or if it matches the specified value.
308static bool isConstantOrUndef(SDOperand Op, unsigned Val) {
309 return Op.getOpcode() == ISD::UNDEF ||
310 cast<ConstantSDNode>(Op)->getValue() == Val;
311}
312
313/// isVPKUHUMShuffleMask - Return true if this is the shuffle mask for a
314/// VPKUHUM instruction.
Chris Lattnerf24380e2006-04-06 22:28:36 +0000315bool PPC::isVPKUHUMShuffleMask(SDNode *N, bool isUnary) {
316 if (!isUnary) {
317 for (unsigned i = 0; i != 16; ++i)
318 if (!isConstantOrUndef(N->getOperand(i), i*2+1))
319 return false;
320 } else {
321 for (unsigned i = 0; i != 8; ++i)
322 if (!isConstantOrUndef(N->getOperand(i), i*2+1) ||
323 !isConstantOrUndef(N->getOperand(i+8), i*2+1))
324 return false;
325 }
Chris Lattnerd0608e12006-04-06 18:26:28 +0000326 return true;
Chris Lattnerddb739e2006-04-06 17:23:16 +0000327}
328
329/// isVPKUWUMShuffleMask - Return true if this is the shuffle mask for a
330/// VPKUWUM instruction.
Chris Lattnerf24380e2006-04-06 22:28:36 +0000331bool PPC::isVPKUWUMShuffleMask(SDNode *N, bool isUnary) {
332 if (!isUnary) {
333 for (unsigned i = 0; i != 16; i += 2)
334 if (!isConstantOrUndef(N->getOperand(i ), i*2+2) ||
335 !isConstantOrUndef(N->getOperand(i+1), i*2+3))
336 return false;
337 } else {
338 for (unsigned i = 0; i != 8; i += 2)
339 if (!isConstantOrUndef(N->getOperand(i ), i*2+2) ||
340 !isConstantOrUndef(N->getOperand(i+1), i*2+3) ||
341 !isConstantOrUndef(N->getOperand(i+8), i*2+2) ||
342 !isConstantOrUndef(N->getOperand(i+9), i*2+3))
343 return false;
344 }
Chris Lattnerd0608e12006-04-06 18:26:28 +0000345 return true;
Chris Lattnerddb739e2006-04-06 17:23:16 +0000346}
347
Chris Lattnercaad1632006-04-06 22:02:42 +0000348/// isVMerge - Common function, used to match vmrg* shuffles.
349///
350static bool isVMerge(SDNode *N, unsigned UnitSize,
351 unsigned LHSStart, unsigned RHSStart) {
Chris Lattner116cc482006-04-06 21:11:54 +0000352 assert(N->getOpcode() == ISD::BUILD_VECTOR &&
353 N->getNumOperands() == 16 && "PPC only supports shuffles by bytes!");
354 assert((UnitSize == 1 || UnitSize == 2 || UnitSize == 4) &&
355 "Unsupported merge size!");
356
357 for (unsigned i = 0; i != 8/UnitSize; ++i) // Step over units
358 for (unsigned j = 0; j != UnitSize; ++j) { // Step over bytes within unit
359 if (!isConstantOrUndef(N->getOperand(i*UnitSize*2+j),
Chris Lattnercaad1632006-04-06 22:02:42 +0000360 LHSStart+j+i*UnitSize) ||
Chris Lattner116cc482006-04-06 21:11:54 +0000361 !isConstantOrUndef(N->getOperand(i*UnitSize*2+UnitSize+j),
Chris Lattnercaad1632006-04-06 22:02:42 +0000362 RHSStart+j+i*UnitSize))
Chris Lattner116cc482006-04-06 21:11:54 +0000363 return false;
364 }
Chris Lattnercaad1632006-04-06 22:02:42 +0000365 return true;
366}
367
368/// isVMRGLShuffleMask - Return true if this is a shuffle mask suitable for
369/// a VRGL* instruction with the specified unit size (1,2 or 4 bytes).
370bool PPC::isVMRGLShuffleMask(SDNode *N, unsigned UnitSize, bool isUnary) {
371 if (!isUnary)
372 return isVMerge(N, UnitSize, 8, 24);
373 return isVMerge(N, UnitSize, 8, 8);
Chris Lattner116cc482006-04-06 21:11:54 +0000374}
375
376/// isVMRGHShuffleMask - Return true if this is a shuffle mask suitable for
377/// a VRGH* instruction with the specified unit size (1,2 or 4 bytes).
Chris Lattnercaad1632006-04-06 22:02:42 +0000378bool PPC::isVMRGHShuffleMask(SDNode *N, unsigned UnitSize, bool isUnary) {
379 if (!isUnary)
380 return isVMerge(N, UnitSize, 0, 16);
381 return isVMerge(N, UnitSize, 0, 0);
Chris Lattner116cc482006-04-06 21:11:54 +0000382}
383
384
Chris Lattnerd0608e12006-04-06 18:26:28 +0000385/// isVSLDOIShuffleMask - If this is a vsldoi shuffle mask, return the shift
386/// amount, otherwise return -1.
Chris Lattnerf24380e2006-04-06 22:28:36 +0000387int PPC::isVSLDOIShuffleMask(SDNode *N, bool isUnary) {
Chris Lattner116cc482006-04-06 21:11:54 +0000388 assert(N->getOpcode() == ISD::BUILD_VECTOR &&
389 N->getNumOperands() == 16 && "PPC only supports shuffles by bytes!");
Chris Lattnerd0608e12006-04-06 18:26:28 +0000390 // Find the first non-undef value in the shuffle mask.
391 unsigned i;
392 for (i = 0; i != 16 && N->getOperand(i).getOpcode() == ISD::UNDEF; ++i)
393 /*search*/;
394
395 if (i == 16) return -1; // all undef.
396
397 // Otherwise, check to see if the rest of the elements are consequtively
398 // numbered from this value.
399 unsigned ShiftAmt = cast<ConstantSDNode>(N->getOperand(i))->getValue();
400 if (ShiftAmt < i) return -1;
401 ShiftAmt -= i;
Chris Lattnerddb739e2006-04-06 17:23:16 +0000402
Chris Lattnerf24380e2006-04-06 22:28:36 +0000403 if (!isUnary) {
404 // Check the rest of the elements to see if they are consequtive.
405 for (++i; i != 16; ++i)
406 if (!isConstantOrUndef(N->getOperand(i), ShiftAmt+i))
407 return -1;
408 } else {
409 // Check the rest of the elements to see if they are consequtive.
410 for (++i; i != 16; ++i)
411 if (!isConstantOrUndef(N->getOperand(i), (ShiftAmt+i) & 15))
412 return -1;
413 }
Chris Lattnerd0608e12006-04-06 18:26:28 +0000414
415 return ShiftAmt;
416}
Chris Lattneref819f82006-03-20 06:33:01 +0000417
418/// isSplatShuffleMask - Return true if the specified VECTOR_SHUFFLE operand
419/// specifies a splat of a single element that is suitable for input to
420/// VSPLTB/VSPLTH/VSPLTW.
Chris Lattner7ff7e672006-04-04 17:25:31 +0000421bool PPC::isSplatShuffleMask(SDNode *N, unsigned EltSize) {
422 assert(N->getOpcode() == ISD::BUILD_VECTOR &&
423 N->getNumOperands() == 16 &&
424 (EltSize == 1 || EltSize == 2 || EltSize == 4));
Chris Lattnerdd4d2d02006-03-20 06:51:10 +0000425
Chris Lattner88a99ef2006-03-20 06:37:44 +0000426 // This is a splat operation if each element of the permute is the same, and
427 // if the value doesn't reference the second vector.
Chris Lattner7ff7e672006-04-04 17:25:31 +0000428 unsigned ElementBase = 0;
Chris Lattner88a99ef2006-03-20 06:37:44 +0000429 SDOperand Elt = N->getOperand(0);
Chris Lattner7ff7e672006-04-04 17:25:31 +0000430 if (ConstantSDNode *EltV = dyn_cast<ConstantSDNode>(Elt))
431 ElementBase = EltV->getValue();
432 else
433 return false; // FIXME: Handle UNDEF elements too!
434
435 if (cast<ConstantSDNode>(Elt)->getValue() >= 16)
436 return false;
437
438 // Check that they are consequtive.
439 for (unsigned i = 1; i != EltSize; ++i) {
440 if (!isa<ConstantSDNode>(N->getOperand(i)) ||
441 cast<ConstantSDNode>(N->getOperand(i))->getValue() != i+ElementBase)
442 return false;
443 }
444
Chris Lattner88a99ef2006-03-20 06:37:44 +0000445 assert(isa<ConstantSDNode>(Elt) && "Invalid VECTOR_SHUFFLE mask!");
Chris Lattner7ff7e672006-04-04 17:25:31 +0000446 for (unsigned i = EltSize, e = 16; i != e; i += EltSize) {
Chris Lattnerb097aa92006-04-14 23:19:08 +0000447 if (N->getOperand(i).getOpcode() == ISD::UNDEF) continue;
Chris Lattner88a99ef2006-03-20 06:37:44 +0000448 assert(isa<ConstantSDNode>(N->getOperand(i)) &&
449 "Invalid VECTOR_SHUFFLE mask!");
Chris Lattner7ff7e672006-04-04 17:25:31 +0000450 for (unsigned j = 0; j != EltSize; ++j)
451 if (N->getOperand(i+j) != N->getOperand(j))
452 return false;
Chris Lattner88a99ef2006-03-20 06:37:44 +0000453 }
454
Chris Lattner7ff7e672006-04-04 17:25:31 +0000455 return true;
Chris Lattneref819f82006-03-20 06:33:01 +0000456}
457
458/// getVSPLTImmediate - Return the appropriate VSPLT* immediate to splat the
459/// specified isSplatShuffleMask VECTOR_SHUFFLE mask.
Chris Lattner7ff7e672006-04-04 17:25:31 +0000460unsigned PPC::getVSPLTImmediate(SDNode *N, unsigned EltSize) {
461 assert(isSplatShuffleMask(N, EltSize));
462 return cast<ConstantSDNode>(N->getOperand(0))->getValue() / EltSize;
Chris Lattneref819f82006-03-20 06:33:01 +0000463}
464
Chris Lattnere87192a2006-04-12 17:37:20 +0000465/// get_VSPLTI_elt - If this is a build_vector of constants which can be formed
Chris Lattner140a58f2006-04-08 06:46:53 +0000466/// by using a vspltis[bhw] instruction of the specified element size, return
467/// the constant being splatted. The ByteSize field indicates the number of
468/// bytes of each element [124] -> [bhw].
Chris Lattnere87192a2006-04-12 17:37:20 +0000469SDOperand PPC::get_VSPLTI_elt(SDNode *N, unsigned ByteSize, SelectionDAG &DAG) {
Chris Lattner9c61dcf2006-03-25 06:12:06 +0000470 SDOperand OpVal(0, 0);
Chris Lattner79d9a882006-04-08 07:14:26 +0000471
472 // If ByteSize of the splat is bigger than the element size of the
473 // build_vector, then we have a case where we are checking for a splat where
474 // multiple elements of the buildvector are folded together into a single
475 // logical element of the splat (e.g. "vsplish 1" to splat {0,1}*8).
476 unsigned EltSize = 16/N->getNumOperands();
477 if (EltSize < ByteSize) {
478 unsigned Multiple = ByteSize/EltSize; // Number of BV entries per spltval.
479 SDOperand UniquedVals[4];
480 assert(Multiple > 1 && Multiple <= 4 && "How can this happen?");
481
482 // See if all of the elements in the buildvector agree across.
483 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) {
484 if (N->getOperand(i).getOpcode() == ISD::UNDEF) continue;
485 // If the element isn't a constant, bail fully out.
486 if (!isa<ConstantSDNode>(N->getOperand(i))) return SDOperand();
487
488
489 if (UniquedVals[i&(Multiple-1)].Val == 0)
490 UniquedVals[i&(Multiple-1)] = N->getOperand(i);
491 else if (UniquedVals[i&(Multiple-1)] != N->getOperand(i))
492 return SDOperand(); // no match.
493 }
494
495 // Okay, if we reached this point, UniquedVals[0..Multiple-1] contains
496 // either constant or undef values that are identical for each chunk. See
497 // if these chunks can form into a larger vspltis*.
498
499 // Check to see if all of the leading entries are either 0 or -1. If
500 // neither, then this won't fit into the immediate field.
501 bool LeadingZero = true;
502 bool LeadingOnes = true;
503 for (unsigned i = 0; i != Multiple-1; ++i) {
504 if (UniquedVals[i].Val == 0) continue; // Must have been undefs.
505
506 LeadingZero &= cast<ConstantSDNode>(UniquedVals[i])->isNullValue();
507 LeadingOnes &= cast<ConstantSDNode>(UniquedVals[i])->isAllOnesValue();
508 }
509 // Finally, check the least significant entry.
510 if (LeadingZero) {
511 if (UniquedVals[Multiple-1].Val == 0)
512 return DAG.getTargetConstant(0, MVT::i32); // 0,0,0,undef
513 int Val = cast<ConstantSDNode>(UniquedVals[Multiple-1])->getValue();
514 if (Val < 16)
515 return DAG.getTargetConstant(Val, MVT::i32); // 0,0,0,4 -> vspltisw(4)
516 }
517 if (LeadingOnes) {
518 if (UniquedVals[Multiple-1].Val == 0)
519 return DAG.getTargetConstant(~0U, MVT::i32); // -1,-1,-1,undef
520 int Val =cast<ConstantSDNode>(UniquedVals[Multiple-1])->getSignExtended();
521 if (Val >= -16) // -1,-1,-1,-2 -> vspltisw(-2)
522 return DAG.getTargetConstant(Val, MVT::i32);
523 }
524
525 return SDOperand();
526 }
527
Chris Lattner9c61dcf2006-03-25 06:12:06 +0000528 // Check to see if this buildvec has a single non-undef value in its elements.
529 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) {
530 if (N->getOperand(i).getOpcode() == ISD::UNDEF) continue;
531 if (OpVal.Val == 0)
532 OpVal = N->getOperand(i);
533 else if (OpVal != N->getOperand(i))
Chris Lattner140a58f2006-04-08 06:46:53 +0000534 return SDOperand();
Chris Lattner9c61dcf2006-03-25 06:12:06 +0000535 }
536
Chris Lattner140a58f2006-04-08 06:46:53 +0000537 if (OpVal.Val == 0) return SDOperand(); // All UNDEF: use implicit def.
Chris Lattner9c61dcf2006-03-25 06:12:06 +0000538
Nate Begeman98e70cc2006-03-28 04:15:58 +0000539 unsigned ValSizeInBytes = 0;
540 uint64_t Value = 0;
Chris Lattner9c61dcf2006-03-25 06:12:06 +0000541 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(OpVal)) {
542 Value = CN->getValue();
543 ValSizeInBytes = MVT::getSizeInBits(CN->getValueType(0))/8;
544 } else if (ConstantFPSDNode *CN = dyn_cast<ConstantFPSDNode>(OpVal)) {
545 assert(CN->getValueType(0) == MVT::f32 && "Only one legal FP vector type!");
546 Value = FloatToBits(CN->getValue());
547 ValSizeInBytes = 4;
548 }
549
550 // If the splat value is larger than the element value, then we can never do
551 // this splat. The only case that we could fit the replicated bits into our
552 // immediate field for would be zero, and we prefer to use vxor for it.
Chris Lattner140a58f2006-04-08 06:46:53 +0000553 if (ValSizeInBytes < ByteSize) return SDOperand();
Chris Lattner9c61dcf2006-03-25 06:12:06 +0000554
555 // If the element value is larger than the splat value, cut it in half and
556 // check to see if the two halves are equal. Continue doing this until we
557 // get to ByteSize. This allows us to handle 0x01010101 as 0x01.
558 while (ValSizeInBytes > ByteSize) {
559 ValSizeInBytes >>= 1;
560
561 // If the top half equals the bottom half, we're still ok.
Chris Lattner9b42bdd2006-04-05 17:39:25 +0000562 if (((Value >> (ValSizeInBytes*8)) & ((1 << (8*ValSizeInBytes))-1)) !=
563 (Value & ((1 << (8*ValSizeInBytes))-1)))
Chris Lattner140a58f2006-04-08 06:46:53 +0000564 return SDOperand();
Chris Lattner9c61dcf2006-03-25 06:12:06 +0000565 }
566
567 // Properly sign extend the value.
568 int ShAmt = (4-ByteSize)*8;
569 int MaskVal = ((int)Value << ShAmt) >> ShAmt;
570
Evan Cheng5b6a01b2006-03-26 09:52:32 +0000571 // If this is zero, don't match, zero matches ISD::isBuildVectorAllZeros.
Chris Lattner140a58f2006-04-08 06:46:53 +0000572 if (MaskVal == 0) return SDOperand();
Chris Lattner9c61dcf2006-03-25 06:12:06 +0000573
Chris Lattner140a58f2006-04-08 06:46:53 +0000574 // Finally, if this value fits in a 5 bit sext field, return it
575 if (((MaskVal << (32-5)) >> (32-5)) == MaskVal)
576 return DAG.getTargetConstant(MaskVal, MVT::i32);
577 return SDOperand();
Chris Lattner9c61dcf2006-03-25 06:12:06 +0000578}
579
Chris Lattner1a635d62006-04-14 06:01:58 +0000580//===----------------------------------------------------------------------===//
581// LowerOperation implementation
582//===----------------------------------------------------------------------===//
583
584static SDOperand LowerConstantPool(SDOperand Op, SelectionDAG &DAG) {
585 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(Op);
586 Constant *C = CP->get();
587 SDOperand CPI = DAG.getTargetConstantPool(C, MVT::i32, CP->getAlignment());
588 SDOperand Zero = DAG.getConstant(0, MVT::i32);
589
590 const TargetMachine &TM = DAG.getTarget();
591
592 // If this is a non-darwin platform, we don't support non-static relo models
593 // yet.
594 if (TM.getRelocationModel() == Reloc::Static ||
595 !TM.getSubtarget<PPCSubtarget>().isDarwin()) {
596 // Generate non-pic code that has direct accesses to the constant pool.
597 // The address of the global is just (hi(&g)+lo(&g)).
598 SDOperand Hi = DAG.getNode(PPCISD::Hi, MVT::i32, CPI, Zero);
599 SDOperand Lo = DAG.getNode(PPCISD::Lo, MVT::i32, CPI, Zero);
600 return DAG.getNode(ISD::ADD, MVT::i32, Hi, Lo);
601 }
602
603 SDOperand Hi = DAG.getNode(PPCISD::Hi, MVT::i32, CPI, Zero);
604 if (TM.getRelocationModel() == Reloc::PIC) {
605 // With PIC, the first instruction is actually "GR+hi(&G)".
606 Hi = DAG.getNode(ISD::ADD, MVT::i32,
607 DAG.getNode(PPCISD::GlobalBaseReg, MVT::i32), Hi);
608 }
609
610 SDOperand Lo = DAG.getNode(PPCISD::Lo, MVT::i32, CPI, Zero);
611 Lo = DAG.getNode(ISD::ADD, MVT::i32, Hi, Lo);
612 return Lo;
613}
614
Nate Begeman37efe672006-04-22 18:53:45 +0000615static SDOperand LowerJumpTable(SDOperand Op, SelectionDAG &DAG) {
616 JumpTableSDNode *JT = cast<JumpTableSDNode>(Op);
617 SDOperand JTI = DAG.getTargetJumpTable(JT->getIndex(), MVT::i32);
618 SDOperand Zero = DAG.getConstant(0, MVT::i32);
619
620 const TargetMachine &TM = DAG.getTarget();
621
622 // If this is a non-darwin platform, we don't support non-static relo models
623 // yet.
624 if (TM.getRelocationModel() == Reloc::Static ||
625 !TM.getSubtarget<PPCSubtarget>().isDarwin()) {
626 // Generate non-pic code that has direct accesses to the constant pool.
627 // The address of the global is just (hi(&g)+lo(&g)).
628 SDOperand Hi = DAG.getNode(PPCISD::Hi, MVT::i32, JTI, Zero);
629 SDOperand Lo = DAG.getNode(PPCISD::Lo, MVT::i32, JTI, Zero);
630 return DAG.getNode(ISD::ADD, MVT::i32, Hi, Lo);
631 }
632
633 SDOperand Hi = DAG.getNode(PPCISD::Hi, MVT::i32, JTI, Zero);
634 if (TM.getRelocationModel() == Reloc::PIC) {
635 // With PIC, the first instruction is actually "GR+hi(&G)".
636 Hi = DAG.getNode(ISD::ADD, MVT::i32,
637 DAG.getNode(PPCISD::GlobalBaseReg, MVT::i32), Hi);
638 }
639
640 SDOperand Lo = DAG.getNode(PPCISD::Lo, MVT::i32, JTI, Zero);
641 Lo = DAG.getNode(ISD::ADD, MVT::i32, Hi, Lo);
642 return Lo;
643}
644
Chris Lattner1a635d62006-04-14 06:01:58 +0000645static SDOperand LowerGlobalAddress(SDOperand Op, SelectionDAG &DAG) {
646 GlobalAddressSDNode *GSDN = cast<GlobalAddressSDNode>(Op);
647 GlobalValue *GV = GSDN->getGlobal();
648 SDOperand GA = DAG.getTargetGlobalAddress(GV, MVT::i32, GSDN->getOffset());
649 SDOperand Zero = DAG.getConstant(0, MVT::i32);
650
651 const TargetMachine &TM = DAG.getTarget();
652
653 // If this is a non-darwin platform, we don't support non-static relo models
654 // yet.
655 if (TM.getRelocationModel() == Reloc::Static ||
656 !TM.getSubtarget<PPCSubtarget>().isDarwin()) {
657 // Generate non-pic code that has direct accesses to globals.
658 // The address of the global is just (hi(&g)+lo(&g)).
659 SDOperand Hi = DAG.getNode(PPCISD::Hi, MVT::i32, GA, Zero);
660 SDOperand Lo = DAG.getNode(PPCISD::Lo, MVT::i32, GA, Zero);
661 return DAG.getNode(ISD::ADD, MVT::i32, Hi, Lo);
662 }
663
664 SDOperand Hi = DAG.getNode(PPCISD::Hi, MVT::i32, GA, Zero);
665 if (TM.getRelocationModel() == Reloc::PIC) {
666 // With PIC, the first instruction is actually "GR+hi(&G)".
667 Hi = DAG.getNode(ISD::ADD, MVT::i32,
668 DAG.getNode(PPCISD::GlobalBaseReg, MVT::i32), Hi);
669 }
670
671 SDOperand Lo = DAG.getNode(PPCISD::Lo, MVT::i32, GA, Zero);
672 Lo = DAG.getNode(ISD::ADD, MVT::i32, Hi, Lo);
673
674 if (!GV->hasWeakLinkage() && !GV->hasLinkOnceLinkage() &&
675 (!GV->isExternal() || GV->hasNotBeenReadFromBytecode()))
676 return Lo;
677
678 // If the global is weak or external, we have to go through the lazy
679 // resolution stub.
680 return DAG.getLoad(MVT::i32, DAG.getEntryNode(), Lo, DAG.getSrcValue(0));
681}
682
683static SDOperand LowerSETCC(SDOperand Op, SelectionDAG &DAG) {
684 ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(2))->get();
685
686 // If we're comparing for equality to zero, expose the fact that this is
687 // implented as a ctlz/srl pair on ppc, so that the dag combiner can
688 // fold the new nodes.
689 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
690 if (C->isNullValue() && CC == ISD::SETEQ) {
691 MVT::ValueType VT = Op.getOperand(0).getValueType();
692 SDOperand Zext = Op.getOperand(0);
693 if (VT < MVT::i32) {
694 VT = MVT::i32;
695 Zext = DAG.getNode(ISD::ZERO_EXTEND, VT, Op.getOperand(0));
696 }
697 unsigned Log2b = Log2_32(MVT::getSizeInBits(VT));
698 SDOperand Clz = DAG.getNode(ISD::CTLZ, VT, Zext);
699 SDOperand Scc = DAG.getNode(ISD::SRL, VT, Clz,
700 DAG.getConstant(Log2b, MVT::i32));
701 return DAG.getNode(ISD::TRUNCATE, MVT::i32, Scc);
702 }
703 // Leave comparisons against 0 and -1 alone for now, since they're usually
704 // optimized. FIXME: revisit this when we can custom lower all setcc
705 // optimizations.
706 if (C->isAllOnesValue() || C->isNullValue())
707 return SDOperand();
708 }
709
710 // If we have an integer seteq/setne, turn it into a compare against zero
711 // by subtracting the rhs from the lhs, which is faster than setting a
712 // condition register, reading it back out, and masking the correct bit.
713 MVT::ValueType LHSVT = Op.getOperand(0).getValueType();
714 if (MVT::isInteger(LHSVT) && (CC == ISD::SETEQ || CC == ISD::SETNE)) {
715 MVT::ValueType VT = Op.getValueType();
716 SDOperand Sub = DAG.getNode(ISD::SUB, LHSVT, Op.getOperand(0),
717 Op.getOperand(1));
718 return DAG.getSetCC(VT, Sub, DAG.getConstant(0, LHSVT), CC);
719 }
720 return SDOperand();
721}
722
723static SDOperand LowerVASTART(SDOperand Op, SelectionDAG &DAG,
724 unsigned VarArgsFrameIndex) {
725 // vastart just stores the address of the VarArgsFrameIndex slot into the
726 // memory location argument.
727 SDOperand FR = DAG.getFrameIndex(VarArgsFrameIndex, MVT::i32);
728 return DAG.getNode(ISD::STORE, MVT::Other, Op.getOperand(0), FR,
729 Op.getOperand(1), Op.getOperand(2));
730}
731
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000732static SDOperand LowerFORMAL_ARGUMENTS(SDOperand Op, SelectionDAG &DAG,
733 int &VarArgsFrameIndex) {
734 // TODO: add description of PPC stack frame format, or at least some docs.
735 //
736 MachineFunction &MF = DAG.getMachineFunction();
737 MachineFrameInfo *MFI = MF.getFrameInfo();
738 SSARegMap *RegMap = MF.getSSARegMap();
739 std::vector<SDOperand> ArgValues;
740 SDOperand Root = Op.getOperand(0);
741
742 unsigned ArgOffset = 24;
Chris Lattneraf4ec0c2006-05-16 18:58:15 +0000743 const unsigned Num_GPR_Regs = 8;
744 const unsigned Num_FPR_Regs = 13;
745 const unsigned Num_VR_Regs = 12;
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000746 unsigned GPR_idx = 0, FPR_idx = 0, VR_idx = 0;
747 static const unsigned GPR[] = {
748 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
749 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
750 };
751 static const unsigned FPR[] = {
752 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
753 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
754 };
755 static const unsigned VR[] = {
756 PPC::V2, PPC::V3, PPC::V4, PPC::V5, PPC::V6, PPC::V7, PPC::V8,
757 PPC::V9, PPC::V10, PPC::V11, PPC::V12, PPC::V13
758 };
759
760 // Add DAG nodes to load the arguments or copy them out of registers. On
761 // entry to a function on PPC, the arguments start at offset 24, although the
762 // first ones are often in registers.
763 for (unsigned ArgNo = 0, e = Op.Val->getNumValues()-1; ArgNo != e; ++ArgNo) {
764 SDOperand ArgVal;
765 bool needsLoad = false;
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000766 MVT::ValueType ObjectVT = Op.getValue(ArgNo).getValueType();
767 unsigned ObjSize = MVT::getSizeInBits(ObjectVT)/8;
768
Chris Lattnerbe4849a2006-05-16 18:51:52 +0000769 unsigned CurArgOffset = ArgOffset;
770
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000771 switch (ObjectVT) {
772 default: assert(0 && "Unhandled argument type!");
773 case MVT::i32:
Chris Lattnerbe4849a2006-05-16 18:51:52 +0000774 // All int arguments reserve stack space.
775 ArgOffset += 4;
776
Chris Lattneraf4ec0c2006-05-16 18:58:15 +0000777 if (GPR_idx != Num_GPR_Regs) {
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000778 unsigned VReg = RegMap->createVirtualRegister(&PPC::GPRCRegClass);
779 MF.addLiveIn(GPR[GPR_idx], VReg);
780 ArgVal = DAG.getCopyFromReg(Root, VReg, MVT::i32);
Chris Lattnerbe4849a2006-05-16 18:51:52 +0000781 ++GPR_idx;
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000782 } else {
783 needsLoad = true;
784 }
785 break;
786 case MVT::f32:
787 case MVT::f64:
Chris Lattnerbe4849a2006-05-16 18:51:52 +0000788 // All FP arguments reserve stack space.
789 ArgOffset += ObjSize;
790
791 // Every 4 bytes of argument space consumes one of the GPRs available for
792 // argument passing.
Chris Lattneraf4ec0c2006-05-16 18:58:15 +0000793 if (GPR_idx != Num_GPR_Regs) {
794 ++GPR_idx;
795 if (ObjSize == 8 && GPR_idx != Num_GPR_Regs)
796 ++GPR_idx;
Chris Lattnerbe4849a2006-05-16 18:51:52 +0000797 }
Chris Lattneraf4ec0c2006-05-16 18:58:15 +0000798 if (FPR_idx != Num_FPR_Regs) {
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000799 unsigned VReg;
800 if (ObjectVT == MVT::f32)
801 VReg = RegMap->createVirtualRegister(&PPC::F4RCRegClass);
802 else
803 VReg = RegMap->createVirtualRegister(&PPC::F8RCRegClass);
804 MF.addLiveIn(FPR[FPR_idx], VReg);
805 ArgVal = DAG.getCopyFromReg(Root, VReg, ObjectVT);
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000806 ++FPR_idx;
807 } else {
808 needsLoad = true;
809 }
810 break;
811 case MVT::v4f32:
812 case MVT::v4i32:
813 case MVT::v8i16:
814 case MVT::v16i8:
Chris Lattnerbe4849a2006-05-16 18:51:52 +0000815 // Note that vector arguments in registers don't reserve stack space.
Chris Lattneraf4ec0c2006-05-16 18:58:15 +0000816 if (VR_idx != Num_VR_Regs) {
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000817 unsigned VReg = RegMap->createVirtualRegister(&PPC::VRRCRegClass);
818 MF.addLiveIn(VR[VR_idx], VReg);
819 ArgVal = DAG.getCopyFromReg(Root, VReg, ObjectVT);
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000820 ++VR_idx;
821 } else {
822 // This should be simple, but requires getting 16-byte aligned stack
823 // values.
824 assert(0 && "Loading VR argument not implemented yet!");
825 needsLoad = true;
826 }
827 break;
828 }
829
830 // We need to load the argument to a virtual register if we determined above
831 // that we ran out of physical registers of the appropriate type
832 if (needsLoad) {
Chris Lattnerb375b5e2006-05-16 18:54:32 +0000833 // If the argument is actually used, emit a load from the right stack
834 // slot.
835 if (!Op.Val->hasNUsesOfValue(0, ArgNo)) {
836 int FI = MFI->CreateFixedObject(ObjSize, CurArgOffset);
837 SDOperand FIN = DAG.getFrameIndex(FI, MVT::i32);
838 ArgVal = DAG.getLoad(ObjectVT, Root, FIN,
839 DAG.getSrcValue(NULL));
840 } else {
841 // Don't emit a dead load.
842 ArgVal = DAG.getNode(ISD::UNDEF, ObjectVT);
843 }
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000844 }
845
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000846 ArgValues.push_back(ArgVal);
847 }
848
849 // If the function takes variable number of arguments, make a frame index for
850 // the start of the first vararg value... for expansion of llvm.va_start.
851 bool isVarArg = cast<ConstantSDNode>(Op.getOperand(2))->getValue() != 0;
852 if (isVarArg) {
853 VarArgsFrameIndex = MFI->CreateFixedObject(4, ArgOffset);
854 SDOperand FIN = DAG.getFrameIndex(VarArgsFrameIndex, MVT::i32);
855 // If this function is vararg, store any remaining integer argument regs
856 // to their spots on the stack so that they may be loaded by deferencing the
857 // result of va_next.
858 std::vector<SDOperand> MemOps;
Chris Lattneraf4ec0c2006-05-16 18:58:15 +0000859 for (; GPR_idx != Num_GPR_Regs; ++GPR_idx) {
Chris Lattner8ab5fe52006-05-16 18:18:50 +0000860 unsigned VReg = RegMap->createVirtualRegister(&PPC::GPRCRegClass);
861 MF.addLiveIn(GPR[GPR_idx], VReg);
862 SDOperand Val = DAG.getCopyFromReg(Root, VReg, MVT::i32);
863 SDOperand Store = DAG.getNode(ISD::STORE, MVT::Other, Val.getValue(1),
864 Val, FIN, DAG.getSrcValue(NULL));
865 MemOps.push_back(Store);
866 // Increment the address by four for the next argument to store
867 SDOperand PtrOff = DAG.getConstant(4, MVT::i32);
868 FIN = DAG.getNode(ISD::ADD, MVT::i32, FIN, PtrOff);
869 }
870 if (!MemOps.empty())
871 Root = DAG.getNode(ISD::TokenFactor, MVT::Other, MemOps);
872 }
873
874 ArgValues.push_back(Root);
875
876 // Return the new list of results.
877 std::vector<MVT::ValueType> RetVT(Op.Val->value_begin(),
878 Op.Val->value_end());
879 return DAG.getNode(ISD::MERGE_VALUES, RetVT, ArgValues);
880}
881
Chris Lattnerc703a8f2006-05-17 19:00:46 +0000882/// isCallCompatibleAddress - Return the immediate to use if the specified
883/// 32-bit value is representable in the immediate field of a BxA instruction.
884static SDNode *isBLACompatibleAddress(SDOperand Op, SelectionDAG &DAG) {
885 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op);
886 if (!C) return 0;
887
888 int Addr = C->getValue();
889 if ((Addr & 3) != 0 || // Low 2 bits are implicitly zero.
890 (Addr << 6 >> 6) != Addr)
891 return 0; // Top 6 bits have to be sext of immediate.
892
893 return DAG.getConstant((int)C->getValue() >> 2, MVT::i32).Val;
894}
895
896
Chris Lattnerabde4602006-05-16 22:56:08 +0000897static SDOperand LowerCALL(SDOperand Op, SelectionDAG &DAG) {
898 SDOperand Chain = Op.getOperand(0);
899 unsigned CallingConv= cast<ConstantSDNode>(Op.getOperand(1))->getValue();
900 bool isVarArg = cast<ConstantSDNode>(Op.getOperand(2))->getValue() != 0;
901 bool isTailCall = cast<ConstantSDNode>(Op.getOperand(3))->getValue() != 0;
902 SDOperand Callee = Op.getOperand(4);
903
904 // args_to_use will accumulate outgoing args for the PPCISD::CALL case in
905 // SelectExpr to use to put the arguments in the appropriate registers.
906 std::vector<SDOperand> args_to_use;
907
908 // Count how many bytes are to be pushed on the stack, including the linkage
Chris Lattnerc8b682c2006-05-17 00:15:40 +0000909 // area, and parameter passing area. We start with 24 bytes, which is
910 // prereserved space for [SP][CR][LR][3 x unused].
Chris Lattnerabde4602006-05-16 22:56:08 +0000911 unsigned NumBytes = 24;
912
Chris Lattnerc8b682c2006-05-17 00:15:40 +0000913 // Add up all the space actually used.
914 for (unsigned i = 5, e = Op.getNumOperands(); i != e; ++i)
915 NumBytes += MVT::getSizeInBits(Op.getOperand(i).getValueType())/8;
Chris Lattnerc04ba7a2006-05-16 23:54:25 +0000916
Chris Lattnerc8b682c2006-05-17 00:15:40 +0000917 // If we are calling what looks like a varargs function on the caller side,
918 // there are two cases:
919 // 1) The callee uses va_start.
920 // 2) The callee doesn't use va_start.
921 //
922 // In the case of #1, the prolog code will store up to 8 GPR argument
923 // registers to the stack, allowing va_start to index over them in memory.
924 // Because we cannot tell the difference (on the caller side) between #1/#2,
925 // we have to conservatively assume we have #1. As such, make sure we have
926 // at least enough stack space for the caller to store the 8 GPRs.
927 if (isVarArg && Op.getNumOperands() > 5 && NumBytes < 56)
928 NumBytes = 56;
929
930 // Adjust the stack pointer for the new arguments...
931 // These operations are automatically eliminated by the prolog/epilog pass
932 Chain = DAG.getCALLSEQ_START(Chain,
933 DAG.getConstant(NumBytes, MVT::i32));
934
935 // Set up a copy of the stack pointer for use loading and storing any
936 // arguments that may not fit in the registers available for argument
937 // passing.
938 SDOperand StackPtr = DAG.getRegister(PPC::R1, MVT::i32);
939
940 // Figure out which arguments are going to go in registers, and which in
941 // memory. Also, if this is a vararg function, floating point operations
942 // must be stored to our stack, and loaded into integer regs as well, if
943 // any integer regs are available for argument passing.
944 unsigned ArgOffset = 24;
Chris Lattner9a2a4972006-05-17 06:01:33 +0000945 unsigned GPR_idx = 0, FPR_idx = 0, VR_idx = 0;
946 static const unsigned GPR[] = {
947 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
948 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
949 };
950 static const unsigned FPR[] = {
951 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
952 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
953 };
954 static const unsigned VR[] = {
955 PPC::V2, PPC::V3, PPC::V4, PPC::V5, PPC::V6, PPC::V7, PPC::V8,
956 PPC::V9, PPC::V10, PPC::V11, PPC::V12, PPC::V13
957 };
958 const unsigned NumGPRs = sizeof(GPR)/sizeof(GPR[0]);
959 const unsigned NumFPRs = sizeof(FPR)/sizeof(FPR[0]);
960 const unsigned NumVRs = sizeof( VR)/sizeof( VR[0]);
961
962 std::vector<std::pair<unsigned, SDOperand> > RegsToPass;
963 std::vector<SDOperand> MemOpChains;
Chris Lattnerc8b682c2006-05-17 00:15:40 +0000964 for (unsigned i = 5, e = Op.getNumOperands(); i != e; ++i) {
965 SDOperand Arg = Op.getOperand(i);
966
967 // PtrOff will be used to store the current argument to the stack if a
968 // register cannot be found for it.
969 SDOperand PtrOff = DAG.getConstant(ArgOffset, StackPtr.getValueType());
970 PtrOff = DAG.getNode(ISD::ADD, MVT::i32, StackPtr, PtrOff);
971 switch (Arg.getValueType()) {
972 default: assert(0 && "Unexpected ValueType for argument!");
973 case MVT::i32:
Chris Lattner9a2a4972006-05-17 06:01:33 +0000974 if (GPR_idx != NumGPRs) {
975 RegsToPass.push_back(std::make_pair(GPR[GPR_idx++], Arg));
Chris Lattnerc8b682c2006-05-17 00:15:40 +0000976 } else {
Chris Lattner9a2a4972006-05-17 06:01:33 +0000977 MemOpChains.push_back(DAG.getNode(ISD::STORE, MVT::Other, Chain,
978 Arg, PtrOff, DAG.getSrcValue(NULL)));
Chris Lattnerc8b682c2006-05-17 00:15:40 +0000979 }
980 ArgOffset += 4;
981 break;
982 case MVT::f32:
983 case MVT::f64:
Chris Lattner9a2a4972006-05-17 06:01:33 +0000984 if (FPR_idx != NumFPRs) {
985 RegsToPass.push_back(std::make_pair(FPR[FPR_idx++], Arg));
986
Chris Lattnerc8b682c2006-05-17 00:15:40 +0000987 if (isVarArg) {
988 SDOperand Store = DAG.getNode(ISD::STORE, MVT::Other, Chain,
989 Arg, PtrOff,
990 DAG.getSrcValue(NULL));
Chris Lattner9a2a4972006-05-17 06:01:33 +0000991 MemOpChains.push_back(Store);
992
Chris Lattnerc8b682c2006-05-17 00:15:40 +0000993 // Float varargs are always shadowed in available integer registers
Chris Lattner9a2a4972006-05-17 06:01:33 +0000994 if (GPR_idx != NumGPRs) {
Chris Lattnerc8b682c2006-05-17 00:15:40 +0000995 SDOperand Load = DAG.getLoad(MVT::i32, Store, PtrOff,
996 DAG.getSrcValue(NULL));
Chris Lattner9a2a4972006-05-17 06:01:33 +0000997 MemOpChains.push_back(Load.getValue(1));
998 RegsToPass.push_back(std::make_pair(GPR[GPR_idx++], Load));
Chris Lattnerc8b682c2006-05-17 00:15:40 +0000999 }
Chris Lattner9a2a4972006-05-17 06:01:33 +00001000 if (GPR_idx != NumGPRs && Arg.getValueType() == MVT::f64) {
Chris Lattnerc8b682c2006-05-17 00:15:40 +00001001 SDOperand ConstFour = DAG.getConstant(4, PtrOff.getValueType());
1002 PtrOff = DAG.getNode(ISD::ADD, MVT::i32, PtrOff, ConstFour);
1003 SDOperand Load = DAG.getLoad(MVT::i32, Store, PtrOff,
1004 DAG.getSrcValue(NULL));
Chris Lattner9a2a4972006-05-17 06:01:33 +00001005 MemOpChains.push_back(Load.getValue(1));
1006 RegsToPass.push_back(std::make_pair(GPR[GPR_idx++], Load));
Chris Lattnerabde4602006-05-16 22:56:08 +00001007 }
1008 } else {
Chris Lattnerc8b682c2006-05-17 00:15:40 +00001009 // If we have any FPRs remaining, we may also have GPRs remaining.
1010 // Args passed in FPRs consume either 1 (f32) or 2 (f64) available
1011 // GPRs.
Chris Lattner9a2a4972006-05-17 06:01:33 +00001012 if (GPR_idx != NumGPRs)
1013 ++GPR_idx;
1014 if (GPR_idx != NumGPRs && Arg.getValueType() == MVT::f64)
1015 ++GPR_idx;
Chris Lattnerabde4602006-05-16 22:56:08 +00001016 }
Chris Lattnerc8b682c2006-05-17 00:15:40 +00001017 } else {
Chris Lattner9a2a4972006-05-17 06:01:33 +00001018 MemOpChains.push_back(DAG.getNode(ISD::STORE, MVT::Other, Chain,
1019 Arg, PtrOff, DAG.getSrcValue(NULL)));
Chris Lattnerabde4602006-05-16 22:56:08 +00001020 }
Chris Lattnerc8b682c2006-05-17 00:15:40 +00001021 ArgOffset += (Arg.getValueType() == MVT::f32) ? 4 : 8;
1022 break;
1023 case MVT::v4f32:
1024 case MVT::v4i32:
1025 case MVT::v8i16:
1026 case MVT::v16i8:
1027 assert(!isVarArg && "Don't support passing vectors to varargs yet!");
Chris Lattner9a2a4972006-05-17 06:01:33 +00001028 assert(VR_idx != NumVRs &&
Chris Lattnerc8b682c2006-05-17 00:15:40 +00001029 "Don't support passing more than 12 vector args yet!");
Chris Lattner9a2a4972006-05-17 06:01:33 +00001030 RegsToPass.push_back(std::make_pair(VR[VR_idx++], Arg));
Chris Lattnerc8b682c2006-05-17 00:15:40 +00001031 break;
Chris Lattnerabde4602006-05-16 22:56:08 +00001032 }
Chris Lattnerabde4602006-05-16 22:56:08 +00001033 }
Chris Lattner9a2a4972006-05-17 06:01:33 +00001034 if (!MemOpChains.empty())
1035 Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, MemOpChains);
Chris Lattnerabde4602006-05-16 22:56:08 +00001036
Chris Lattner9a2a4972006-05-17 06:01:33 +00001037 // Build a sequence of copy-to-reg nodes chained together with token chain
1038 // and flag operands which copy the outgoing args into the appropriate regs.
1039 SDOperand InFlag;
1040 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
1041 Chain = DAG.getCopyToReg(Chain, RegsToPass[i].first, RegsToPass[i].second,
1042 InFlag);
1043 InFlag = Chain.getValue(1);
1044 }
Chris Lattnerabde4602006-05-16 22:56:08 +00001045
Chris Lattnerc703a8f2006-05-17 19:00:46 +00001046 std::vector<MVT::ValueType> NodeTys;
1047
1048 // If the callee is a GlobalAddress/ExternalSymbol node (quite common, every
1049 // direct call is) turn it into a TargetGlobalAddress/TargetExternalSymbol
1050 // node so that legalize doesn't hack it.
Chris Lattnerabde4602006-05-16 22:56:08 +00001051 if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Callee))
Chris Lattner9a2a4972006-05-17 06:01:33 +00001052 Callee = DAG.getTargetGlobalAddress(G->getGlobal(), Callee.getValueType());
Chris Lattnerc703a8f2006-05-17 19:00:46 +00001053 else if (ExternalSymbolSDNode *S = dyn_cast<ExternalSymbolSDNode>(Callee))
1054 Callee = DAG.getTargetExternalSymbol(S->getSymbol(), Callee.getValueType());
1055 else if (SDNode *Dest = isBLACompatibleAddress(Callee, DAG))
1056 // If this is an absolute destination address, use the munged value.
1057 Callee = SDOperand(Dest, 0);
1058 else {
1059 // Otherwise, this is an indirect call. We have to use a MTCTR/BCTRL pair
1060 // to do the call, we can't use PPCISD::CALL.
1061 std::vector<SDOperand> Ops;
1062 Ops.push_back(Chain);
1063 Ops.push_back(Callee);
1064 NodeTys.push_back(MVT::Other);
1065 NodeTys.push_back(MVT::Flag);
1066
1067 if (InFlag.Val)
1068 Ops.push_back(InFlag);
1069 Chain = DAG.getNode(PPCISD::MTCTR, NodeTys, Ops);
1070 InFlag = Chain.getValue(1);
1071
1072 // Copy the callee address into R12 on darwin.
1073 Chain = DAG.getCopyToReg(Chain, PPC::R12, Callee, InFlag);
1074 InFlag = Chain.getValue(1);
1075
1076 NodeTys.clear();
1077 NodeTys.push_back(MVT::Other);
1078 NodeTys.push_back(MVT::Flag);
1079 Ops.clear();
1080 Ops.push_back(Chain);
1081 Ops.push_back(InFlag);
1082 Chain = DAG.getNode(PPCISD::BCTRL, NodeTys, Ops);
1083 InFlag = Chain.getValue(1);
1084 Callee.Val = 0;
1085 }
Chris Lattner9a2a4972006-05-17 06:01:33 +00001086
1087 // Create the PPCISD::CALL node itself.
Chris Lattnerc703a8f2006-05-17 19:00:46 +00001088 if (Callee.Val) {
1089 NodeTys.push_back(MVT::Other); // Returns a chain
1090 NodeTys.push_back(MVT::Flag); // Returns a flag for retval copy to use.
1091 std::vector<SDOperand> Ops;
1092 Ops.push_back(Chain);
1093 Ops.push_back(Callee);
1094 if (InFlag.Val)
1095 Ops.push_back(InFlag);
1096 Chain = DAG.getNode(PPCISD::CALL, NodeTys, Ops);
1097 InFlag = Chain.getValue(1);
1098 }
Chris Lattnerabde4602006-05-16 22:56:08 +00001099
Chris Lattner9a2a4972006-05-17 06:01:33 +00001100 std::vector<SDOperand> ResultVals;
1101 NodeTys.clear();
1102
1103 // If the call has results, copy the values out of the ret val registers.
1104 switch (Op.Val->getValueType(0)) {
1105 default: assert(0 && "Unexpected ret value!");
1106 case MVT::Other: break;
1107 case MVT::i32:
1108 if (Op.Val->getValueType(1) == MVT::i32) {
1109 Chain = DAG.getCopyFromReg(Chain, PPC::R4, MVT::i32, InFlag).getValue(1);
1110 ResultVals.push_back(Chain.getValue(0));
1111 Chain = DAG.getCopyFromReg(Chain, PPC::R3, MVT::i32,
1112 Chain.getValue(2)).getValue(1);
1113 ResultVals.push_back(Chain.getValue(0));
1114 NodeTys.push_back(MVT::i32);
1115 } else {
1116 Chain = DAG.getCopyFromReg(Chain, PPC::R3, MVT::i32, InFlag).getValue(1);
1117 ResultVals.push_back(Chain.getValue(0));
1118 }
1119 NodeTys.push_back(MVT::i32);
1120 break;
1121 case MVT::f32:
1122 case MVT::f64:
1123 Chain = DAG.getCopyFromReg(Chain, PPC::F1, Op.Val->getValueType(0),
1124 InFlag).getValue(1);
1125 ResultVals.push_back(Chain.getValue(0));
1126 NodeTys.push_back(Op.Val->getValueType(0));
1127 break;
1128 case MVT::v4f32:
1129 case MVT::v4i32:
1130 case MVT::v8i16:
1131 case MVT::v16i8:
1132 Chain = DAG.getCopyFromReg(Chain, PPC::V2, Op.Val->getValueType(0),
1133 InFlag).getValue(1);
1134 ResultVals.push_back(Chain.getValue(0));
1135 NodeTys.push_back(Op.Val->getValueType(0));
1136 break;
1137 }
1138
Chris Lattnerabde4602006-05-16 22:56:08 +00001139 Chain = DAG.getNode(ISD::CALLSEQ_END, MVT::Other, Chain,
1140 DAG.getConstant(NumBytes, MVT::i32));
Chris Lattner9a2a4972006-05-17 06:01:33 +00001141 NodeTys.push_back(MVT::Other);
Chris Lattnerabde4602006-05-16 22:56:08 +00001142
Chris Lattnerc703a8f2006-05-17 19:00:46 +00001143 // If the function returns void, just return the chain.
1144 if (ResultVals.empty())
1145 return Chain;
1146
1147 // Otherwise, merge everything together with a MERGE_VALUES node.
Chris Lattner9a2a4972006-05-17 06:01:33 +00001148 ResultVals.push_back(Chain);
1149 SDOperand Res = DAG.getNode(ISD::MERGE_VALUES, NodeTys, ResultVals);
Chris Lattnerabde4602006-05-16 22:56:08 +00001150 return Res.getValue(Op.ResNo);
1151}
1152
Chris Lattner1a635d62006-04-14 06:01:58 +00001153static SDOperand LowerRET(SDOperand Op, SelectionDAG &DAG) {
1154 SDOperand Copy;
1155 switch(Op.getNumOperands()) {
1156 default:
1157 assert(0 && "Do not know how to return this many arguments!");
1158 abort();
1159 case 1:
1160 return SDOperand(); // ret void is legal
1161 case 2: {
1162 MVT::ValueType ArgVT = Op.getOperand(1).getValueType();
1163 unsigned ArgReg;
1164 if (MVT::isVector(ArgVT))
1165 ArgReg = PPC::V2;
1166 else if (MVT::isInteger(ArgVT))
1167 ArgReg = PPC::R3;
1168 else {
1169 assert(MVT::isFloatingPoint(ArgVT));
1170 ArgReg = PPC::F1;
1171 }
1172
1173 Copy = DAG.getCopyToReg(Op.getOperand(0), ArgReg, Op.getOperand(1),
1174 SDOperand());
1175
1176 // If we haven't noted the R3/F1 are live out, do so now.
1177 if (DAG.getMachineFunction().liveout_empty())
1178 DAG.getMachineFunction().addLiveOut(ArgReg);
1179 break;
1180 }
1181 case 3:
1182 Copy = DAG.getCopyToReg(Op.getOperand(0), PPC::R3, Op.getOperand(2),
1183 SDOperand());
1184 Copy = DAG.getCopyToReg(Copy, PPC::R4, Op.getOperand(1),Copy.getValue(1));
1185 // If we haven't noted the R3+R4 are live out, do so now.
1186 if (DAG.getMachineFunction().liveout_empty()) {
1187 DAG.getMachineFunction().addLiveOut(PPC::R3);
1188 DAG.getMachineFunction().addLiveOut(PPC::R4);
1189 }
1190 break;
1191 }
1192 return DAG.getNode(PPCISD::RET_FLAG, MVT::Other, Copy, Copy.getValue(1));
1193}
1194
1195/// LowerSELECT_CC - Lower floating point select_cc's into fsel instruction when
1196/// possible.
1197static SDOperand LowerSELECT_CC(SDOperand Op, SelectionDAG &DAG) {
1198 // Not FP? Not a fsel.
1199 if (!MVT::isFloatingPoint(Op.getOperand(0).getValueType()) ||
1200 !MVT::isFloatingPoint(Op.getOperand(2).getValueType()))
1201 return SDOperand();
1202
1203 ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(4))->get();
1204
1205 // Cannot handle SETEQ/SETNE.
1206 if (CC == ISD::SETEQ || CC == ISD::SETNE) return SDOperand();
1207
1208 MVT::ValueType ResVT = Op.getValueType();
1209 MVT::ValueType CmpVT = Op.getOperand(0).getValueType();
1210 SDOperand LHS = Op.getOperand(0), RHS = Op.getOperand(1);
1211 SDOperand TV = Op.getOperand(2), FV = Op.getOperand(3);
1212
1213 // If the RHS of the comparison is a 0.0, we don't need to do the
1214 // subtraction at all.
1215 if (isFloatingPointZero(RHS))
1216 switch (CC) {
1217 default: break; // SETUO etc aren't handled by fsel.
1218 case ISD::SETULT:
1219 case ISD::SETLT:
1220 std::swap(TV, FV); // fsel is natively setge, swap operands for setlt
1221 case ISD::SETUGE:
1222 case ISD::SETGE:
1223 if (LHS.getValueType() == MVT::f32) // Comparison is always 64-bits
1224 LHS = DAG.getNode(ISD::FP_EXTEND, MVT::f64, LHS);
1225 return DAG.getNode(PPCISD::FSEL, ResVT, LHS, TV, FV);
1226 case ISD::SETUGT:
1227 case ISD::SETGT:
1228 std::swap(TV, FV); // fsel is natively setge, swap operands for setlt
1229 case ISD::SETULE:
1230 case ISD::SETLE:
1231 if (LHS.getValueType() == MVT::f32) // Comparison is always 64-bits
1232 LHS = DAG.getNode(ISD::FP_EXTEND, MVT::f64, LHS);
1233 return DAG.getNode(PPCISD::FSEL, ResVT,
1234 DAG.getNode(ISD::FNEG, MVT::f64, LHS), TV, FV);
1235 }
1236
1237 SDOperand Cmp;
1238 switch (CC) {
1239 default: break; // SETUO etc aren't handled by fsel.
1240 case ISD::SETULT:
1241 case ISD::SETLT:
1242 Cmp = DAG.getNode(ISD::FSUB, CmpVT, LHS, RHS);
1243 if (Cmp.getValueType() == MVT::f32) // Comparison is always 64-bits
1244 Cmp = DAG.getNode(ISD::FP_EXTEND, MVT::f64, Cmp);
1245 return DAG.getNode(PPCISD::FSEL, ResVT, Cmp, FV, TV);
1246 case ISD::SETUGE:
1247 case ISD::SETGE:
1248 Cmp = DAG.getNode(ISD::FSUB, CmpVT, LHS, RHS);
1249 if (Cmp.getValueType() == MVT::f32) // Comparison is always 64-bits
1250 Cmp = DAG.getNode(ISD::FP_EXTEND, MVT::f64, Cmp);
1251 return DAG.getNode(PPCISD::FSEL, ResVT, Cmp, TV, FV);
1252 case ISD::SETUGT:
1253 case ISD::SETGT:
1254 Cmp = DAG.getNode(ISD::FSUB, CmpVT, RHS, LHS);
1255 if (Cmp.getValueType() == MVT::f32) // Comparison is always 64-bits
1256 Cmp = DAG.getNode(ISD::FP_EXTEND, MVT::f64, Cmp);
1257 return DAG.getNode(PPCISD::FSEL, ResVT, Cmp, FV, TV);
1258 case ISD::SETULE:
1259 case ISD::SETLE:
1260 Cmp = DAG.getNode(ISD::FSUB, CmpVT, RHS, LHS);
1261 if (Cmp.getValueType() == MVT::f32) // Comparison is always 64-bits
1262 Cmp = DAG.getNode(ISD::FP_EXTEND, MVT::f64, Cmp);
1263 return DAG.getNode(PPCISD::FSEL, ResVT, Cmp, TV, FV);
1264 }
1265 return SDOperand();
1266}
1267
1268static SDOperand LowerFP_TO_SINT(SDOperand Op, SelectionDAG &DAG) {
1269 assert(MVT::isFloatingPoint(Op.getOperand(0).getValueType()));
1270 SDOperand Src = Op.getOperand(0);
1271 if (Src.getValueType() == MVT::f32)
1272 Src = DAG.getNode(ISD::FP_EXTEND, MVT::f64, Src);
1273
1274 SDOperand Tmp;
1275 switch (Op.getValueType()) {
1276 default: assert(0 && "Unhandled FP_TO_SINT type in custom expander!");
1277 case MVT::i32:
1278 Tmp = DAG.getNode(PPCISD::FCTIWZ, MVT::f64, Src);
1279 break;
1280 case MVT::i64:
1281 Tmp = DAG.getNode(PPCISD::FCTIDZ, MVT::f64, Src);
1282 break;
1283 }
1284
1285 // Convert the FP value to an int value through memory.
1286 SDOperand Bits = DAG.getNode(ISD::BIT_CONVERT, MVT::i64, Tmp);
1287 if (Op.getValueType() == MVT::i32)
1288 Bits = DAG.getNode(ISD::TRUNCATE, MVT::i32, Bits);
1289 return Bits;
1290}
1291
1292static SDOperand LowerSINT_TO_FP(SDOperand Op, SelectionDAG &DAG) {
1293 if (Op.getOperand(0).getValueType() == MVT::i64) {
1294 SDOperand Bits = DAG.getNode(ISD::BIT_CONVERT, MVT::f64, Op.getOperand(0));
1295 SDOperand FP = DAG.getNode(PPCISD::FCFID, MVT::f64, Bits);
1296 if (Op.getValueType() == MVT::f32)
1297 FP = DAG.getNode(ISD::FP_ROUND, MVT::f32, FP);
1298 return FP;
1299 }
1300
1301 assert(Op.getOperand(0).getValueType() == MVT::i32 &&
1302 "Unhandled SINT_TO_FP type in custom expander!");
1303 // Since we only generate this in 64-bit mode, we can take advantage of
1304 // 64-bit registers. In particular, sign extend the input value into the
1305 // 64-bit register with extsw, store the WHOLE 64-bit value into the stack
1306 // then lfd it and fcfid it.
1307 MachineFrameInfo *FrameInfo = DAG.getMachineFunction().getFrameInfo();
1308 int FrameIdx = FrameInfo->CreateStackObject(8, 8);
1309 SDOperand FIdx = DAG.getFrameIndex(FrameIdx, MVT::i32);
1310
1311 SDOperand Ext64 = DAG.getNode(PPCISD::EXTSW_32, MVT::i32,
1312 Op.getOperand(0));
1313
1314 // STD the extended value into the stack slot.
1315 SDOperand Store = DAG.getNode(PPCISD::STD_32, MVT::Other,
1316 DAG.getEntryNode(), Ext64, FIdx,
1317 DAG.getSrcValue(NULL));
1318 // Load the value as a double.
1319 SDOperand Ld = DAG.getLoad(MVT::f64, Store, FIdx, DAG.getSrcValue(NULL));
1320
1321 // FCFID it and return it.
1322 SDOperand FP = DAG.getNode(PPCISD::FCFID, MVT::f64, Ld);
1323 if (Op.getValueType() == MVT::f32)
1324 FP = DAG.getNode(ISD::FP_ROUND, MVT::f32, FP);
1325 return FP;
1326}
1327
1328static SDOperand LowerSHL(SDOperand Op, SelectionDAG &DAG) {
1329 assert(Op.getValueType() == MVT::i64 &&
1330 Op.getOperand(1).getValueType() == MVT::i32 && "Unexpected SHL!");
1331 // The generic code does a fine job expanding shift by a constant.
1332 if (isa<ConstantSDNode>(Op.getOperand(1))) return SDOperand();
1333
1334 // Otherwise, expand into a bunch of logical ops. Note that these ops
1335 // depend on the PPC behavior for oversized shift amounts.
1336 SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, MVT::i32, Op.getOperand(0),
1337 DAG.getConstant(0, MVT::i32));
1338 SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, MVT::i32, Op.getOperand(0),
1339 DAG.getConstant(1, MVT::i32));
1340 SDOperand Amt = Op.getOperand(1);
1341
1342 SDOperand Tmp1 = DAG.getNode(ISD::SUB, MVT::i32,
1343 DAG.getConstant(32, MVT::i32), Amt);
1344 SDOperand Tmp2 = DAG.getNode(PPCISD::SHL, MVT::i32, Hi, Amt);
1345 SDOperand Tmp3 = DAG.getNode(PPCISD::SRL, MVT::i32, Lo, Tmp1);
1346 SDOperand Tmp4 = DAG.getNode(ISD::OR , MVT::i32, Tmp2, Tmp3);
1347 SDOperand Tmp5 = DAG.getNode(ISD::ADD, MVT::i32, Amt,
1348 DAG.getConstant(-32U, MVT::i32));
1349 SDOperand Tmp6 = DAG.getNode(PPCISD::SHL, MVT::i32, Lo, Tmp5);
1350 SDOperand OutHi = DAG.getNode(ISD::OR, MVT::i32, Tmp4, Tmp6);
1351 SDOperand OutLo = DAG.getNode(PPCISD::SHL, MVT::i32, Lo, Amt);
1352 return DAG.getNode(ISD::BUILD_PAIR, MVT::i64, OutLo, OutHi);
1353}
1354
1355static SDOperand LowerSRL(SDOperand Op, SelectionDAG &DAG) {
1356 assert(Op.getValueType() == MVT::i64 &&
1357 Op.getOperand(1).getValueType() == MVT::i32 && "Unexpected SHL!");
1358 // The generic code does a fine job expanding shift by a constant.
1359 if (isa<ConstantSDNode>(Op.getOperand(1))) return SDOperand();
1360
1361 // Otherwise, expand into a bunch of logical ops. Note that these ops
1362 // depend on the PPC behavior for oversized shift amounts.
1363 SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, MVT::i32, Op.getOperand(0),
1364 DAG.getConstant(0, MVT::i32));
1365 SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, MVT::i32, Op.getOperand(0),
1366 DAG.getConstant(1, MVT::i32));
1367 SDOperand Amt = Op.getOperand(1);
1368
1369 SDOperand Tmp1 = DAG.getNode(ISD::SUB, MVT::i32,
1370 DAG.getConstant(32, MVT::i32), Amt);
1371 SDOperand Tmp2 = DAG.getNode(PPCISD::SRL, MVT::i32, Lo, Amt);
1372 SDOperand Tmp3 = DAG.getNode(PPCISD::SHL, MVT::i32, Hi, Tmp1);
1373 SDOperand Tmp4 = DAG.getNode(ISD::OR , MVT::i32, Tmp2, Tmp3);
1374 SDOperand Tmp5 = DAG.getNode(ISD::ADD, MVT::i32, Amt,
1375 DAG.getConstant(-32U, MVT::i32));
1376 SDOperand Tmp6 = DAG.getNode(PPCISD::SRL, MVT::i32, Hi, Tmp5);
1377 SDOperand OutLo = DAG.getNode(ISD::OR, MVT::i32, Tmp4, Tmp6);
1378 SDOperand OutHi = DAG.getNode(PPCISD::SRL, MVT::i32, Hi, Amt);
1379 return DAG.getNode(ISD::BUILD_PAIR, MVT::i64, OutLo, OutHi);
1380}
1381
1382static SDOperand LowerSRA(SDOperand Op, SelectionDAG &DAG) {
1383 assert(Op.getValueType() == MVT::i64 &&
1384 Op.getOperand(1).getValueType() == MVT::i32 && "Unexpected SRA!");
1385 // The generic code does a fine job expanding shift by a constant.
1386 if (isa<ConstantSDNode>(Op.getOperand(1))) return SDOperand();
1387
1388 // Otherwise, expand into a bunch of logical ops, followed by a select_cc.
1389 SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, MVT::i32, Op.getOperand(0),
1390 DAG.getConstant(0, MVT::i32));
1391 SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, MVT::i32, Op.getOperand(0),
1392 DAG.getConstant(1, MVT::i32));
1393 SDOperand Amt = Op.getOperand(1);
1394
1395 SDOperand Tmp1 = DAG.getNode(ISD::SUB, MVT::i32,
1396 DAG.getConstant(32, MVT::i32), Amt);
1397 SDOperand Tmp2 = DAG.getNode(PPCISD::SRL, MVT::i32, Lo, Amt);
1398 SDOperand Tmp3 = DAG.getNode(PPCISD::SHL, MVT::i32, Hi, Tmp1);
1399 SDOperand Tmp4 = DAG.getNode(ISD::OR , MVT::i32, Tmp2, Tmp3);
1400 SDOperand Tmp5 = DAG.getNode(ISD::ADD, MVT::i32, Amt,
1401 DAG.getConstant(-32U, MVT::i32));
1402 SDOperand Tmp6 = DAG.getNode(PPCISD::SRA, MVT::i32, Hi, Tmp5);
1403 SDOperand OutHi = DAG.getNode(PPCISD::SRA, MVT::i32, Hi, Amt);
1404 SDOperand OutLo = DAG.getSelectCC(Tmp5, DAG.getConstant(0, MVT::i32),
1405 Tmp4, Tmp6, ISD::SETLE);
1406 return DAG.getNode(ISD::BUILD_PAIR, MVT::i64, OutLo, OutHi);
1407}
1408
1409//===----------------------------------------------------------------------===//
1410// Vector related lowering.
1411//
1412
Chris Lattnerac225ca2006-04-12 19:07:14 +00001413// If this is a vector of constants or undefs, get the bits. A bit in
1414// UndefBits is set if the corresponding element of the vector is an
1415// ISD::UNDEF value. For undefs, the corresponding VectorBits values are
1416// zero. Return true if this is not an array of constants, false if it is.
1417//
Chris Lattnerac225ca2006-04-12 19:07:14 +00001418static bool GetConstantBuildVectorBits(SDNode *BV, uint64_t VectorBits[2],
1419 uint64_t UndefBits[2]) {
1420 // Start with zero'd results.
1421 VectorBits[0] = VectorBits[1] = UndefBits[0] = UndefBits[1] = 0;
1422
1423 unsigned EltBitSize = MVT::getSizeInBits(BV->getOperand(0).getValueType());
1424 for (unsigned i = 0, e = BV->getNumOperands(); i != e; ++i) {
1425 SDOperand OpVal = BV->getOperand(i);
1426
1427 unsigned PartNo = i >= e/2; // In the upper 128 bits?
Chris Lattnerb17f1672006-04-16 01:01:29 +00001428 unsigned SlotNo = e/2 - (i & (e/2-1))-1; // Which subpiece of the uint64_t.
Chris Lattnerac225ca2006-04-12 19:07:14 +00001429
1430 uint64_t EltBits = 0;
1431 if (OpVal.getOpcode() == ISD::UNDEF) {
1432 uint64_t EltUndefBits = ~0U >> (32-EltBitSize);
1433 UndefBits[PartNo] |= EltUndefBits << (SlotNo*EltBitSize);
1434 continue;
1435 } else if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(OpVal)) {
1436 EltBits = CN->getValue() & (~0U >> (32-EltBitSize));
1437 } else if (ConstantFPSDNode *CN = dyn_cast<ConstantFPSDNode>(OpVal)) {
1438 assert(CN->getValueType(0) == MVT::f32 &&
1439 "Only one legal FP vector type!");
1440 EltBits = FloatToBits(CN->getValue());
1441 } else {
1442 // Nonconstant element.
1443 return true;
1444 }
1445
1446 VectorBits[PartNo] |= EltBits << (SlotNo*EltBitSize);
1447 }
1448
1449 //printf("%llx %llx %llx %llx\n",
1450 // VectorBits[0], VectorBits[1], UndefBits[0], UndefBits[1]);
1451 return false;
1452}
Chris Lattneref819f82006-03-20 06:33:01 +00001453
Chris Lattnerb17f1672006-04-16 01:01:29 +00001454// If this is a splat (repetition) of a value across the whole vector, return
1455// the smallest size that splats it. For example, "0x01010101010101..." is a
1456// splat of 0x01, 0x0101, and 0x01010101. We return SplatBits = 0x01 and
1457// SplatSize = 1 byte.
1458static bool isConstantSplat(const uint64_t Bits128[2],
1459 const uint64_t Undef128[2],
1460 unsigned &SplatBits, unsigned &SplatUndef,
1461 unsigned &SplatSize) {
1462
1463 // Don't let undefs prevent splats from matching. See if the top 64-bits are
1464 // the same as the lower 64-bits, ignoring undefs.
1465 if ((Bits128[0] & ~Undef128[1]) != (Bits128[1] & ~Undef128[0]))
1466 return false; // Can't be a splat if two pieces don't match.
1467
1468 uint64_t Bits64 = Bits128[0] | Bits128[1];
1469 uint64_t Undef64 = Undef128[0] & Undef128[1];
1470
1471 // Check that the top 32-bits are the same as the lower 32-bits, ignoring
1472 // undefs.
1473 if ((Bits64 & (~Undef64 >> 32)) != ((Bits64 >> 32) & ~Undef64))
1474 return false; // Can't be a splat if two pieces don't match.
1475
1476 uint32_t Bits32 = uint32_t(Bits64) | uint32_t(Bits64 >> 32);
1477 uint32_t Undef32 = uint32_t(Undef64) & uint32_t(Undef64 >> 32);
1478
1479 // If the top 16-bits are different than the lower 16-bits, ignoring
1480 // undefs, we have an i32 splat.
1481 if ((Bits32 & (~Undef32 >> 16)) != ((Bits32 >> 16) & ~Undef32)) {
1482 SplatBits = Bits32;
1483 SplatUndef = Undef32;
1484 SplatSize = 4;
1485 return true;
1486 }
1487
1488 uint16_t Bits16 = uint16_t(Bits32) | uint16_t(Bits32 >> 16);
1489 uint16_t Undef16 = uint16_t(Undef32) & uint16_t(Undef32 >> 16);
1490
1491 // If the top 8-bits are different than the lower 8-bits, ignoring
1492 // undefs, we have an i16 splat.
1493 if ((Bits16 & (uint16_t(~Undef16) >> 8)) != ((Bits16 >> 8) & ~Undef16)) {
1494 SplatBits = Bits16;
1495 SplatUndef = Undef16;
1496 SplatSize = 2;
1497 return true;
1498 }
1499
1500 // Otherwise, we have an 8-bit splat.
1501 SplatBits = uint8_t(Bits16) | uint8_t(Bits16 >> 8);
1502 SplatUndef = uint8_t(Undef16) & uint8_t(Undef16 >> 8);
1503 SplatSize = 1;
1504 return true;
1505}
1506
Chris Lattner4a998b92006-04-17 06:00:21 +00001507/// BuildSplatI - Build a canonical splati of Val with an element size of
1508/// SplatSize. Cast the result to VT.
1509static SDOperand BuildSplatI(int Val, unsigned SplatSize, MVT::ValueType VT,
1510 SelectionDAG &DAG) {
1511 assert(Val >= -16 && Val <= 15 && "vsplti is out of range!");
Chris Lattner6876e662006-04-17 06:58:41 +00001512
1513 // Force vspltis[hw] -1 to vspltisb -1.
1514 if (Val == -1) SplatSize = 1;
1515
Chris Lattner4a998b92006-04-17 06:00:21 +00001516 static const MVT::ValueType VTys[] = { // canonical VT to use for each size.
1517 MVT::v16i8, MVT::v8i16, MVT::Other, MVT::v4i32
1518 };
1519 MVT::ValueType CanonicalVT = VTys[SplatSize-1];
1520
1521 // Build a canonical splat for this value.
1522 SDOperand Elt = DAG.getConstant(Val, MVT::getVectorBaseType(CanonicalVT));
1523 std::vector<SDOperand> Ops(MVT::getVectorNumElements(CanonicalVT), Elt);
1524 SDOperand Res = DAG.getNode(ISD::BUILD_VECTOR, CanonicalVT, Ops);
1525 return DAG.getNode(ISD::BIT_CONVERT, VT, Res);
1526}
1527
Chris Lattnere7c768e2006-04-18 03:24:30 +00001528/// BuildIntrinsicOp - Return a binary operator intrinsic node with the
Chris Lattner6876e662006-04-17 06:58:41 +00001529/// specified intrinsic ID.
Chris Lattnere7c768e2006-04-18 03:24:30 +00001530static SDOperand BuildIntrinsicOp(unsigned IID, SDOperand LHS, SDOperand RHS,
1531 SelectionDAG &DAG,
1532 MVT::ValueType DestVT = MVT::Other) {
1533 if (DestVT == MVT::Other) DestVT = LHS.getValueType();
1534 return DAG.getNode(ISD::INTRINSIC_WO_CHAIN, DestVT,
Chris Lattner6876e662006-04-17 06:58:41 +00001535 DAG.getConstant(IID, MVT::i32), LHS, RHS);
1536}
1537
Chris Lattnere7c768e2006-04-18 03:24:30 +00001538/// BuildIntrinsicOp - Return a ternary operator intrinsic node with the
1539/// specified intrinsic ID.
1540static SDOperand BuildIntrinsicOp(unsigned IID, SDOperand Op0, SDOperand Op1,
1541 SDOperand Op2, SelectionDAG &DAG,
1542 MVT::ValueType DestVT = MVT::Other) {
1543 if (DestVT == MVT::Other) DestVT = Op0.getValueType();
1544 return DAG.getNode(ISD::INTRINSIC_WO_CHAIN, DestVT,
1545 DAG.getConstant(IID, MVT::i32), Op0, Op1, Op2);
1546}
1547
1548
Chris Lattnerbdd558c2006-04-17 17:55:10 +00001549/// BuildVSLDOI - Return a VECTOR_SHUFFLE that is a vsldoi of the specified
1550/// amount. The result has the specified value type.
1551static SDOperand BuildVSLDOI(SDOperand LHS, SDOperand RHS, unsigned Amt,
1552 MVT::ValueType VT, SelectionDAG &DAG) {
1553 // Force LHS/RHS to be the right type.
1554 LHS = DAG.getNode(ISD::BIT_CONVERT, MVT::v16i8, LHS);
1555 RHS = DAG.getNode(ISD::BIT_CONVERT, MVT::v16i8, RHS);
1556
1557 std::vector<SDOperand> Ops;
1558 for (unsigned i = 0; i != 16; ++i)
1559 Ops.push_back(DAG.getConstant(i+Amt, MVT::i32));
1560 SDOperand T = DAG.getNode(ISD::VECTOR_SHUFFLE, MVT::v16i8, LHS, RHS,
1561 DAG.getNode(ISD::BUILD_VECTOR, MVT::v16i8, Ops));
1562 return DAG.getNode(ISD::BIT_CONVERT, VT, T);
1563}
1564
Chris Lattnerf1b47082006-04-14 05:19:18 +00001565// If this is a case we can't handle, return null and let the default
1566// expansion code take care of it. If we CAN select this case, and if it
1567// selects to a single instruction, return Op. Otherwise, if we can codegen
1568// this case more efficiently than a constant pool load, lower it to the
1569// sequence of ops that should be used.
1570static SDOperand LowerBUILD_VECTOR(SDOperand Op, SelectionDAG &DAG) {
1571 // If this is a vector of constants or undefs, get the bits. A bit in
1572 // UndefBits is set if the corresponding element of the vector is an
1573 // ISD::UNDEF value. For undefs, the corresponding VectorBits values are
1574 // zero.
1575 uint64_t VectorBits[2];
1576 uint64_t UndefBits[2];
1577 if (GetConstantBuildVectorBits(Op.Val, VectorBits, UndefBits))
1578 return SDOperand(); // Not a constant vector.
1579
Chris Lattnerb17f1672006-04-16 01:01:29 +00001580 // If this is a splat (repetition) of a value across the whole vector, return
1581 // the smallest size that splats it. For example, "0x01010101010101..." is a
1582 // splat of 0x01, 0x0101, and 0x01010101. We return SplatBits = 0x01 and
1583 // SplatSize = 1 byte.
1584 unsigned SplatBits, SplatUndef, SplatSize;
1585 if (isConstantSplat(VectorBits, UndefBits, SplatBits, SplatUndef, SplatSize)){
1586 bool HasAnyUndefs = (UndefBits[0] | UndefBits[1]) != 0;
1587
1588 // First, handle single instruction cases.
1589
1590 // All zeros?
1591 if (SplatBits == 0) {
1592 // Canonicalize all zero vectors to be v4i32.
1593 if (Op.getValueType() != MVT::v4i32 || HasAnyUndefs) {
1594 SDOperand Z = DAG.getConstant(0, MVT::i32);
1595 Z = DAG.getNode(ISD::BUILD_VECTOR, MVT::v4i32, Z, Z, Z, Z);
1596 Op = DAG.getNode(ISD::BIT_CONVERT, Op.getValueType(), Z);
1597 }
1598 return Op;
Chris Lattnerf1b47082006-04-14 05:19:18 +00001599 }
Chris Lattnerb17f1672006-04-16 01:01:29 +00001600
1601 // If the sign extended value is in the range [-16,15], use VSPLTI[bhw].
1602 int32_t SextVal= int32_t(SplatBits << (32-8*SplatSize)) >> (32-8*SplatSize);
Chris Lattner4a998b92006-04-17 06:00:21 +00001603 if (SextVal >= -16 && SextVal <= 15)
1604 return BuildSplatI(SextVal, SplatSize, Op.getValueType(), DAG);
Chris Lattnerb17f1672006-04-16 01:01:29 +00001605
Chris Lattnerdbce85d2006-04-17 18:09:22 +00001606
1607 // Two instruction sequences.
1608
Chris Lattner4a998b92006-04-17 06:00:21 +00001609 // If this value is in the range [-32,30] and is even, use:
1610 // tmp = VSPLTI[bhw], result = add tmp, tmp
1611 if (SextVal >= -32 && SextVal <= 30 && (SextVal & 1) == 0) {
1612 Op = BuildSplatI(SextVal >> 1, SplatSize, Op.getValueType(), DAG);
1613 return DAG.getNode(ISD::ADD, Op.getValueType(), Op, Op);
1614 }
Chris Lattner6876e662006-04-17 06:58:41 +00001615
1616 // If this is 0x8000_0000 x 4, turn into vspltisw + vslw. If it is
1617 // 0x7FFF_FFFF x 4, turn it into not(0x8000_0000). This is important
1618 // for fneg/fabs.
1619 if (SplatSize == 4 && SplatBits == (0x7FFFFFFF&~SplatUndef)) {
1620 // Make -1 and vspltisw -1:
1621 SDOperand OnesV = BuildSplatI(-1, 4, MVT::v4i32, DAG);
1622
1623 // Make the VSLW intrinsic, computing 0x8000_0000.
Chris Lattnere7c768e2006-04-18 03:24:30 +00001624 SDOperand Res = BuildIntrinsicOp(Intrinsic::ppc_altivec_vslw, OnesV,
1625 OnesV, DAG);
Chris Lattner6876e662006-04-17 06:58:41 +00001626
1627 // xor by OnesV to invert it.
1628 Res = DAG.getNode(ISD::XOR, MVT::v4i32, Res, OnesV);
1629 return DAG.getNode(ISD::BIT_CONVERT, Op.getValueType(), Res);
1630 }
1631
1632 // Check to see if this is a wide variety of vsplti*, binop self cases.
1633 unsigned SplatBitSize = SplatSize*8;
1634 static const char SplatCsts[] = {
1635 -1, 1, -2, 2, -3, 3, -4, 4, -5, 5, -6, 6, -7, 7,
Chris Lattnerdbce85d2006-04-17 18:09:22 +00001636 -8, 8, -9, 9, -10, 10, -11, 11, -12, 12, -13, 13, 14, -14, 15, -15, -16
Chris Lattner6876e662006-04-17 06:58:41 +00001637 };
1638 for (unsigned idx = 0; idx < sizeof(SplatCsts)/sizeof(SplatCsts[0]); ++idx){
1639 // Indirect through the SplatCsts array so that we favor 'vsplti -1' for
1640 // cases which are ambiguous (e.g. formation of 0x8000_0000). 'vsplti -1'
1641 int i = SplatCsts[idx];
1642
1643 // Figure out what shift amount will be used by altivec if shifted by i in
1644 // this splat size.
1645 unsigned TypeShiftAmt = i & (SplatBitSize-1);
1646
1647 // vsplti + shl self.
1648 if (SextVal == (i << (int)TypeShiftAmt)) {
1649 Op = BuildSplatI(i, SplatSize, Op.getValueType(), DAG);
1650 static const unsigned IIDs[] = { // Intrinsic to use for each size.
1651 Intrinsic::ppc_altivec_vslb, Intrinsic::ppc_altivec_vslh, 0,
1652 Intrinsic::ppc_altivec_vslw
1653 };
Chris Lattnere7c768e2006-04-18 03:24:30 +00001654 return BuildIntrinsicOp(IIDs[SplatSize-1], Op, Op, DAG);
Chris Lattner6876e662006-04-17 06:58:41 +00001655 }
1656
1657 // vsplti + srl self.
1658 if (SextVal == (int)((unsigned)i >> TypeShiftAmt)) {
1659 Op = BuildSplatI(i, SplatSize, Op.getValueType(), DAG);
1660 static const unsigned IIDs[] = { // Intrinsic to use for each size.
1661 Intrinsic::ppc_altivec_vsrb, Intrinsic::ppc_altivec_vsrh, 0,
1662 Intrinsic::ppc_altivec_vsrw
1663 };
Chris Lattnere7c768e2006-04-18 03:24:30 +00001664 return BuildIntrinsicOp(IIDs[SplatSize-1], Op, Op, DAG);
Chris Lattner6876e662006-04-17 06:58:41 +00001665 }
1666
1667 // vsplti + sra self.
1668 if (SextVal == (int)((unsigned)i >> TypeShiftAmt)) {
1669 Op = BuildSplatI(i, SplatSize, Op.getValueType(), DAG);
1670 static const unsigned IIDs[] = { // Intrinsic to use for each size.
1671 Intrinsic::ppc_altivec_vsrab, Intrinsic::ppc_altivec_vsrah, 0,
1672 Intrinsic::ppc_altivec_vsraw
1673 };
Chris Lattnere7c768e2006-04-18 03:24:30 +00001674 return BuildIntrinsicOp(IIDs[SplatSize-1], Op, Op, DAG);
Chris Lattner6876e662006-04-17 06:58:41 +00001675 }
1676
Chris Lattnerbdd558c2006-04-17 17:55:10 +00001677 // vsplti + rol self.
1678 if (SextVal == (int)(((unsigned)i << TypeShiftAmt) |
1679 ((unsigned)i >> (SplatBitSize-TypeShiftAmt)))) {
1680 Op = BuildSplatI(i, SplatSize, Op.getValueType(), DAG);
1681 static const unsigned IIDs[] = { // Intrinsic to use for each size.
1682 Intrinsic::ppc_altivec_vrlb, Intrinsic::ppc_altivec_vrlh, 0,
1683 Intrinsic::ppc_altivec_vrlw
1684 };
Chris Lattnere7c768e2006-04-18 03:24:30 +00001685 return BuildIntrinsicOp(IIDs[SplatSize-1], Op, Op, DAG);
Chris Lattnerbdd558c2006-04-17 17:55:10 +00001686 }
1687
1688 // t = vsplti c, result = vsldoi t, t, 1
1689 if (SextVal == ((i << 8) | (i >> (TypeShiftAmt-8)))) {
1690 SDOperand T = BuildSplatI(i, SplatSize, MVT::v16i8, DAG);
1691 return BuildVSLDOI(T, T, 1, Op.getValueType(), DAG);
1692 }
1693 // t = vsplti c, result = vsldoi t, t, 2
1694 if (SextVal == ((i << 16) | (i >> (TypeShiftAmt-16)))) {
1695 SDOperand T = BuildSplatI(i, SplatSize, MVT::v16i8, DAG);
1696 return BuildVSLDOI(T, T, 2, Op.getValueType(), DAG);
1697 }
1698 // t = vsplti c, result = vsldoi t, t, 3
1699 if (SextVal == ((i << 24) | (i >> (TypeShiftAmt-24)))) {
1700 SDOperand T = BuildSplatI(i, SplatSize, MVT::v16i8, DAG);
1701 return BuildVSLDOI(T, T, 3, Op.getValueType(), DAG);
1702 }
Chris Lattner6876e662006-04-17 06:58:41 +00001703 }
1704
Chris Lattner6876e662006-04-17 06:58:41 +00001705 // Three instruction sequences.
1706
Chris Lattnerdbce85d2006-04-17 18:09:22 +00001707 // Odd, in range [17,31]: (vsplti C)-(vsplti -16).
1708 if (SextVal >= 0 && SextVal <= 31) {
1709 SDOperand LHS = BuildSplatI(SextVal-16, SplatSize, Op.getValueType(),DAG);
1710 SDOperand RHS = BuildSplatI(-16, SplatSize, Op.getValueType(), DAG);
1711 return DAG.getNode(ISD::SUB, Op.getValueType(), LHS, RHS);
1712 }
1713 // Odd, in range [-31,-17]: (vsplti C)+(vsplti -16).
1714 if (SextVal >= -31 && SextVal <= 0) {
1715 SDOperand LHS = BuildSplatI(SextVal+16, SplatSize, Op.getValueType(),DAG);
1716 SDOperand RHS = BuildSplatI(-16, SplatSize, Op.getValueType(), DAG);
Chris Lattnerc4083822006-04-17 06:07:44 +00001717 return DAG.getNode(ISD::ADD, Op.getValueType(), LHS, RHS);
Chris Lattnerf1b47082006-04-14 05:19:18 +00001718 }
1719 }
Chris Lattnerb17f1672006-04-16 01:01:29 +00001720
Chris Lattnerf1b47082006-04-14 05:19:18 +00001721 return SDOperand();
1722}
1723
Chris Lattner59138102006-04-17 05:28:54 +00001724/// GeneratePerfectShuffle - Given an entry in the perfect-shuffle table, emit
1725/// the specified operations to build the shuffle.
1726static SDOperand GeneratePerfectShuffle(unsigned PFEntry, SDOperand LHS,
1727 SDOperand RHS, SelectionDAG &DAG) {
1728 unsigned OpNum = (PFEntry >> 26) & 0x0F;
1729 unsigned LHSID = (PFEntry >> 13) & ((1 << 13)-1);
1730 unsigned RHSID = (PFEntry >> 0) & ((1 << 13)-1);
1731
1732 enum {
Chris Lattner00402c72006-05-16 04:20:24 +00001733 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 +00001734 OP_VMRGHW,
1735 OP_VMRGLW,
1736 OP_VSPLTISW0,
1737 OP_VSPLTISW1,
1738 OP_VSPLTISW2,
1739 OP_VSPLTISW3,
1740 OP_VSLDOI4,
1741 OP_VSLDOI8,
1742 OP_VSLDOI12,
1743 };
1744
1745 if (OpNum == OP_COPY) {
1746 if (LHSID == (1*9+2)*9+3) return LHS;
1747 assert(LHSID == ((4*9+5)*9+6)*9+7 && "Illegal OP_COPY!");
1748 return RHS;
1749 }
1750
Chris Lattnerbdd558c2006-04-17 17:55:10 +00001751 SDOperand OpLHS, OpRHS;
1752 OpLHS = GeneratePerfectShuffle(PerfectShuffleTable[LHSID], LHS, RHS, DAG);
1753 OpRHS = GeneratePerfectShuffle(PerfectShuffleTable[RHSID], LHS, RHS, DAG);
1754
Chris Lattner59138102006-04-17 05:28:54 +00001755 unsigned ShufIdxs[16];
1756 switch (OpNum) {
1757 default: assert(0 && "Unknown i32 permute!");
1758 case OP_VMRGHW:
1759 ShufIdxs[ 0] = 0; ShufIdxs[ 1] = 1; ShufIdxs[ 2] = 2; ShufIdxs[ 3] = 3;
1760 ShufIdxs[ 4] = 16; ShufIdxs[ 5] = 17; ShufIdxs[ 6] = 18; ShufIdxs[ 7] = 19;
1761 ShufIdxs[ 8] = 4; ShufIdxs[ 9] = 5; ShufIdxs[10] = 6; ShufIdxs[11] = 7;
1762 ShufIdxs[12] = 20; ShufIdxs[13] = 21; ShufIdxs[14] = 22; ShufIdxs[15] = 23;
1763 break;
1764 case OP_VMRGLW:
1765 ShufIdxs[ 0] = 8; ShufIdxs[ 1] = 9; ShufIdxs[ 2] = 10; ShufIdxs[ 3] = 11;
1766 ShufIdxs[ 4] = 24; ShufIdxs[ 5] = 25; ShufIdxs[ 6] = 26; ShufIdxs[ 7] = 27;
1767 ShufIdxs[ 8] = 12; ShufIdxs[ 9] = 13; ShufIdxs[10] = 14; ShufIdxs[11] = 15;
1768 ShufIdxs[12] = 28; ShufIdxs[13] = 29; ShufIdxs[14] = 30; ShufIdxs[15] = 31;
1769 break;
1770 case OP_VSPLTISW0:
1771 for (unsigned i = 0; i != 16; ++i)
1772 ShufIdxs[i] = (i&3)+0;
1773 break;
1774 case OP_VSPLTISW1:
1775 for (unsigned i = 0; i != 16; ++i)
1776 ShufIdxs[i] = (i&3)+4;
1777 break;
1778 case OP_VSPLTISW2:
1779 for (unsigned i = 0; i != 16; ++i)
1780 ShufIdxs[i] = (i&3)+8;
1781 break;
1782 case OP_VSPLTISW3:
1783 for (unsigned i = 0; i != 16; ++i)
1784 ShufIdxs[i] = (i&3)+12;
1785 break;
1786 case OP_VSLDOI4:
Chris Lattnerbdd558c2006-04-17 17:55:10 +00001787 return BuildVSLDOI(OpLHS, OpRHS, 4, OpLHS.getValueType(), DAG);
Chris Lattner59138102006-04-17 05:28:54 +00001788 case OP_VSLDOI8:
Chris Lattnerbdd558c2006-04-17 17:55:10 +00001789 return BuildVSLDOI(OpLHS, OpRHS, 8, OpLHS.getValueType(), DAG);
Chris Lattner59138102006-04-17 05:28:54 +00001790 case OP_VSLDOI12:
Chris Lattnerbdd558c2006-04-17 17:55:10 +00001791 return BuildVSLDOI(OpLHS, OpRHS, 12, OpLHS.getValueType(), DAG);
Chris Lattner59138102006-04-17 05:28:54 +00001792 }
1793 std::vector<SDOperand> Ops;
1794 for (unsigned i = 0; i != 16; ++i)
1795 Ops.push_back(DAG.getConstant(ShufIdxs[i], MVT::i32));
Chris Lattner59138102006-04-17 05:28:54 +00001796
1797 return DAG.getNode(ISD::VECTOR_SHUFFLE, OpLHS.getValueType(), OpLHS, OpRHS,
1798 DAG.getNode(ISD::BUILD_VECTOR, MVT::v16i8, Ops));
1799}
1800
Chris Lattnerf1b47082006-04-14 05:19:18 +00001801/// LowerVECTOR_SHUFFLE - Return the code we lower for VECTOR_SHUFFLE. If this
1802/// is a shuffle we can handle in a single instruction, return it. Otherwise,
1803/// return the code it can be lowered into. Worst case, it can always be
1804/// lowered into a vperm.
1805static SDOperand LowerVECTOR_SHUFFLE(SDOperand Op, SelectionDAG &DAG) {
1806 SDOperand V1 = Op.getOperand(0);
1807 SDOperand V2 = Op.getOperand(1);
1808 SDOperand PermMask = Op.getOperand(2);
1809
1810 // Cases that are handled by instructions that take permute immediates
1811 // (such as vsplt*) should be left as VECTOR_SHUFFLE nodes so they can be
1812 // selected by the instruction selector.
1813 if (V2.getOpcode() == ISD::UNDEF) {
1814 if (PPC::isSplatShuffleMask(PermMask.Val, 1) ||
1815 PPC::isSplatShuffleMask(PermMask.Val, 2) ||
1816 PPC::isSplatShuffleMask(PermMask.Val, 4) ||
1817 PPC::isVPKUWUMShuffleMask(PermMask.Val, true) ||
1818 PPC::isVPKUHUMShuffleMask(PermMask.Val, true) ||
1819 PPC::isVSLDOIShuffleMask(PermMask.Val, true) != -1 ||
1820 PPC::isVMRGLShuffleMask(PermMask.Val, 1, true) ||
1821 PPC::isVMRGLShuffleMask(PermMask.Val, 2, true) ||
1822 PPC::isVMRGLShuffleMask(PermMask.Val, 4, true) ||
1823 PPC::isVMRGHShuffleMask(PermMask.Val, 1, true) ||
1824 PPC::isVMRGHShuffleMask(PermMask.Val, 2, true) ||
1825 PPC::isVMRGHShuffleMask(PermMask.Val, 4, true)) {
1826 return Op;
1827 }
1828 }
1829
1830 // Altivec has a variety of "shuffle immediates" that take two vector inputs
1831 // and produce a fixed permutation. If any of these match, do not lower to
1832 // VPERM.
1833 if (PPC::isVPKUWUMShuffleMask(PermMask.Val, false) ||
1834 PPC::isVPKUHUMShuffleMask(PermMask.Val, false) ||
1835 PPC::isVSLDOIShuffleMask(PermMask.Val, false) != -1 ||
1836 PPC::isVMRGLShuffleMask(PermMask.Val, 1, false) ||
1837 PPC::isVMRGLShuffleMask(PermMask.Val, 2, false) ||
1838 PPC::isVMRGLShuffleMask(PermMask.Val, 4, false) ||
1839 PPC::isVMRGHShuffleMask(PermMask.Val, 1, false) ||
1840 PPC::isVMRGHShuffleMask(PermMask.Val, 2, false) ||
1841 PPC::isVMRGHShuffleMask(PermMask.Val, 4, false))
1842 return Op;
1843
Chris Lattner59138102006-04-17 05:28:54 +00001844 // Check to see if this is a shuffle of 4-byte values. If so, we can use our
1845 // perfect shuffle table to emit an optimal matching sequence.
1846 unsigned PFIndexes[4];
1847 bool isFourElementShuffle = true;
1848 for (unsigned i = 0; i != 4 && isFourElementShuffle; ++i) { // Element number
1849 unsigned EltNo = 8; // Start out undef.
1850 for (unsigned j = 0; j != 4; ++j) { // Intra-element byte.
1851 if (PermMask.getOperand(i*4+j).getOpcode() == ISD::UNDEF)
1852 continue; // Undef, ignore it.
1853
1854 unsigned ByteSource =
1855 cast<ConstantSDNode>(PermMask.getOperand(i*4+j))->getValue();
1856 if ((ByteSource & 3) != j) {
1857 isFourElementShuffle = false;
1858 break;
1859 }
1860
1861 if (EltNo == 8) {
1862 EltNo = ByteSource/4;
1863 } else if (EltNo != ByteSource/4) {
1864 isFourElementShuffle = false;
1865 break;
1866 }
1867 }
1868 PFIndexes[i] = EltNo;
1869 }
1870
1871 // If this shuffle can be expressed as a shuffle of 4-byte elements, use the
1872 // perfect shuffle vector to determine if it is cost effective to do this as
1873 // discrete instructions, or whether we should use a vperm.
1874 if (isFourElementShuffle) {
1875 // Compute the index in the perfect shuffle table.
1876 unsigned PFTableIndex =
1877 PFIndexes[0]*9*9*9+PFIndexes[1]*9*9+PFIndexes[2]*9+PFIndexes[3];
1878
1879 unsigned PFEntry = PerfectShuffleTable[PFTableIndex];
1880 unsigned Cost = (PFEntry >> 30);
1881
1882 // Determining when to avoid vperm is tricky. Many things affect the cost
1883 // of vperm, particularly how many times the perm mask needs to be computed.
1884 // For example, if the perm mask can be hoisted out of a loop or is already
1885 // used (perhaps because there are multiple permutes with the same shuffle
1886 // mask?) the vperm has a cost of 1. OTOH, hoisting the permute mask out of
1887 // the loop requires an extra register.
1888 //
1889 // As a compromise, we only emit discrete instructions if the shuffle can be
1890 // generated in 3 or fewer operations. When we have loop information
1891 // available, if this block is within a loop, we should avoid using vperm
1892 // for 3-operation perms and use a constant pool load instead.
1893 if (Cost < 3)
1894 return GeneratePerfectShuffle(PFEntry, V1, V2, DAG);
1895 }
Chris Lattnerf1b47082006-04-14 05:19:18 +00001896
1897 // Lower this to a VPERM(V1, V2, V3) expression, where V3 is a constant
1898 // vector that will get spilled to the constant pool.
1899 if (V2.getOpcode() == ISD::UNDEF) V2 = V1;
1900
1901 // The SHUFFLE_VECTOR mask is almost exactly what we want for vperm, except
1902 // that it is in input element units, not in bytes. Convert now.
1903 MVT::ValueType EltVT = MVT::getVectorBaseType(V1.getValueType());
1904 unsigned BytesPerElement = MVT::getSizeInBits(EltVT)/8;
1905
1906 std::vector<SDOperand> ResultMask;
1907 for (unsigned i = 0, e = PermMask.getNumOperands(); i != e; ++i) {
Chris Lattner730b4562006-04-15 23:48:05 +00001908 unsigned SrcElt;
1909 if (PermMask.getOperand(i).getOpcode() == ISD::UNDEF)
1910 SrcElt = 0;
1911 else
1912 SrcElt = cast<ConstantSDNode>(PermMask.getOperand(i))->getValue();
Chris Lattnerf1b47082006-04-14 05:19:18 +00001913
1914 for (unsigned j = 0; j != BytesPerElement; ++j)
1915 ResultMask.push_back(DAG.getConstant(SrcElt*BytesPerElement+j,
1916 MVT::i8));
1917 }
1918
1919 SDOperand VPermMask = DAG.getNode(ISD::BUILD_VECTOR, MVT::v16i8, ResultMask);
1920 return DAG.getNode(PPCISD::VPERM, V1.getValueType(), V1, V2, VPermMask);
1921}
1922
Chris Lattner90564f22006-04-18 17:59:36 +00001923/// getAltivecCompareInfo - Given an intrinsic, return false if it is not an
1924/// altivec comparison. If it is, return true and fill in Opc/isDot with
1925/// information about the intrinsic.
1926static bool getAltivecCompareInfo(SDOperand Intrin, int &CompareOpc,
1927 bool &isDot) {
1928 unsigned IntrinsicID = cast<ConstantSDNode>(Intrin.getOperand(0))->getValue();
1929 CompareOpc = -1;
1930 isDot = false;
1931 switch (IntrinsicID) {
1932 default: return false;
1933 // Comparison predicates.
Chris Lattner1a635d62006-04-14 06:01:58 +00001934 case Intrinsic::ppc_altivec_vcmpbfp_p: CompareOpc = 966; isDot = 1; break;
1935 case Intrinsic::ppc_altivec_vcmpeqfp_p: CompareOpc = 198; isDot = 1; break;
1936 case Intrinsic::ppc_altivec_vcmpequb_p: CompareOpc = 6; isDot = 1; break;
1937 case Intrinsic::ppc_altivec_vcmpequh_p: CompareOpc = 70; isDot = 1; break;
1938 case Intrinsic::ppc_altivec_vcmpequw_p: CompareOpc = 134; isDot = 1; break;
1939 case Intrinsic::ppc_altivec_vcmpgefp_p: CompareOpc = 454; isDot = 1; break;
1940 case Intrinsic::ppc_altivec_vcmpgtfp_p: CompareOpc = 710; isDot = 1; break;
1941 case Intrinsic::ppc_altivec_vcmpgtsb_p: CompareOpc = 774; isDot = 1; break;
1942 case Intrinsic::ppc_altivec_vcmpgtsh_p: CompareOpc = 838; isDot = 1; break;
1943 case Intrinsic::ppc_altivec_vcmpgtsw_p: CompareOpc = 902; isDot = 1; break;
1944 case Intrinsic::ppc_altivec_vcmpgtub_p: CompareOpc = 518; isDot = 1; break;
1945 case Intrinsic::ppc_altivec_vcmpgtuh_p: CompareOpc = 582; isDot = 1; break;
1946 case Intrinsic::ppc_altivec_vcmpgtuw_p: CompareOpc = 646; isDot = 1; break;
1947
1948 // Normal Comparisons.
1949 case Intrinsic::ppc_altivec_vcmpbfp: CompareOpc = 966; isDot = 0; break;
1950 case Intrinsic::ppc_altivec_vcmpeqfp: CompareOpc = 198; isDot = 0; break;
1951 case Intrinsic::ppc_altivec_vcmpequb: CompareOpc = 6; isDot = 0; break;
1952 case Intrinsic::ppc_altivec_vcmpequh: CompareOpc = 70; isDot = 0; break;
1953 case Intrinsic::ppc_altivec_vcmpequw: CompareOpc = 134; isDot = 0; break;
1954 case Intrinsic::ppc_altivec_vcmpgefp: CompareOpc = 454; isDot = 0; break;
1955 case Intrinsic::ppc_altivec_vcmpgtfp: CompareOpc = 710; isDot = 0; break;
1956 case Intrinsic::ppc_altivec_vcmpgtsb: CompareOpc = 774; isDot = 0; break;
1957 case Intrinsic::ppc_altivec_vcmpgtsh: CompareOpc = 838; isDot = 0; break;
1958 case Intrinsic::ppc_altivec_vcmpgtsw: CompareOpc = 902; isDot = 0; break;
1959 case Intrinsic::ppc_altivec_vcmpgtub: CompareOpc = 518; isDot = 0; break;
1960 case Intrinsic::ppc_altivec_vcmpgtuh: CompareOpc = 582; isDot = 0; break;
1961 case Intrinsic::ppc_altivec_vcmpgtuw: CompareOpc = 646; isDot = 0; break;
1962 }
Chris Lattner90564f22006-04-18 17:59:36 +00001963 return true;
1964}
1965
1966/// LowerINTRINSIC_WO_CHAIN - If this is an intrinsic that we want to custom
1967/// lower, do it, otherwise return null.
1968static SDOperand LowerINTRINSIC_WO_CHAIN(SDOperand Op, SelectionDAG &DAG) {
1969 // If this is a lowered altivec predicate compare, CompareOpc is set to the
1970 // opcode number of the comparison.
1971 int CompareOpc;
1972 bool isDot;
1973 if (!getAltivecCompareInfo(Op, CompareOpc, isDot))
1974 return SDOperand(); // Don't custom lower most intrinsics.
Chris Lattner1a635d62006-04-14 06:01:58 +00001975
Chris Lattner90564f22006-04-18 17:59:36 +00001976 // If this is a non-dot comparison, make the VCMP node and we are done.
Chris Lattner1a635d62006-04-14 06:01:58 +00001977 if (!isDot) {
1978 SDOperand Tmp = DAG.getNode(PPCISD::VCMP, Op.getOperand(2).getValueType(),
1979 Op.getOperand(1), Op.getOperand(2),
1980 DAG.getConstant(CompareOpc, MVT::i32));
1981 return DAG.getNode(ISD::BIT_CONVERT, Op.getValueType(), Tmp);
1982 }
1983
1984 // Create the PPCISD altivec 'dot' comparison node.
1985 std::vector<SDOperand> Ops;
1986 std::vector<MVT::ValueType> VTs;
1987 Ops.push_back(Op.getOperand(2)); // LHS
1988 Ops.push_back(Op.getOperand(3)); // RHS
1989 Ops.push_back(DAG.getConstant(CompareOpc, MVT::i32));
1990 VTs.push_back(Op.getOperand(2).getValueType());
1991 VTs.push_back(MVT::Flag);
1992 SDOperand CompNode = DAG.getNode(PPCISD::VCMPo, VTs, Ops);
1993
1994 // Now that we have the comparison, emit a copy from the CR to a GPR.
1995 // This is flagged to the above dot comparison.
1996 SDOperand Flags = DAG.getNode(PPCISD::MFCR, MVT::i32,
1997 DAG.getRegister(PPC::CR6, MVT::i32),
1998 CompNode.getValue(1));
1999
2000 // Unpack the result based on how the target uses it.
2001 unsigned BitNo; // Bit # of CR6.
2002 bool InvertBit; // Invert result?
2003 switch (cast<ConstantSDNode>(Op.getOperand(1))->getValue()) {
2004 default: // Can't happen, don't crash on invalid number though.
2005 case 0: // Return the value of the EQ bit of CR6.
2006 BitNo = 0; InvertBit = false;
2007 break;
2008 case 1: // Return the inverted value of the EQ bit of CR6.
2009 BitNo = 0; InvertBit = true;
2010 break;
2011 case 2: // Return the value of the LT bit of CR6.
2012 BitNo = 2; InvertBit = false;
2013 break;
2014 case 3: // Return the inverted value of the LT bit of CR6.
2015 BitNo = 2; InvertBit = true;
2016 break;
2017 }
2018
2019 // Shift the bit into the low position.
2020 Flags = DAG.getNode(ISD::SRL, MVT::i32, Flags,
2021 DAG.getConstant(8-(3-BitNo), MVT::i32));
2022 // Isolate the bit.
2023 Flags = DAG.getNode(ISD::AND, MVT::i32, Flags,
2024 DAG.getConstant(1, MVT::i32));
2025
2026 // If we are supposed to, toggle the bit.
2027 if (InvertBit)
2028 Flags = DAG.getNode(ISD::XOR, MVT::i32, Flags,
2029 DAG.getConstant(1, MVT::i32));
2030 return Flags;
2031}
2032
2033static SDOperand LowerSCALAR_TO_VECTOR(SDOperand Op, SelectionDAG &DAG) {
2034 // Create a stack slot that is 16-byte aligned.
2035 MachineFrameInfo *FrameInfo = DAG.getMachineFunction().getFrameInfo();
2036 int FrameIdx = FrameInfo->CreateStackObject(16, 16);
2037 SDOperand FIdx = DAG.getFrameIndex(FrameIdx, MVT::i32);
2038
2039 // Store the input value into Value#0 of the stack slot.
2040 SDOperand Store = DAG.getNode(ISD::STORE, MVT::Other, DAG.getEntryNode(),
2041 Op.getOperand(0), FIdx,DAG.getSrcValue(NULL));
2042 // Load it out.
2043 return DAG.getLoad(Op.getValueType(), Store, FIdx, DAG.getSrcValue(NULL));
2044}
2045
Chris Lattnere7c768e2006-04-18 03:24:30 +00002046static SDOperand LowerMUL(SDOperand Op, SelectionDAG &DAG) {
Chris Lattner72dd9bd2006-04-18 03:43:48 +00002047 if (Op.getValueType() == MVT::v4i32) {
2048 SDOperand LHS = Op.getOperand(0), RHS = Op.getOperand(1);
2049
2050 SDOperand Zero = BuildSplatI( 0, 1, MVT::v4i32, DAG);
2051 SDOperand Neg16 = BuildSplatI(-16, 4, MVT::v4i32, DAG); // +16 as shift amt.
2052
2053 SDOperand RHSSwap = // = vrlw RHS, 16
2054 BuildIntrinsicOp(Intrinsic::ppc_altivec_vrlw, RHS, Neg16, DAG);
2055
2056 // Shrinkify inputs to v8i16.
2057 LHS = DAG.getNode(ISD::BIT_CONVERT, MVT::v8i16, LHS);
2058 RHS = DAG.getNode(ISD::BIT_CONVERT, MVT::v8i16, RHS);
2059 RHSSwap = DAG.getNode(ISD::BIT_CONVERT, MVT::v8i16, RHSSwap);
2060
2061 // Low parts multiplied together, generating 32-bit results (we ignore the
2062 // top parts).
2063 SDOperand LoProd = BuildIntrinsicOp(Intrinsic::ppc_altivec_vmulouh,
2064 LHS, RHS, DAG, MVT::v4i32);
2065
2066 SDOperand HiProd = BuildIntrinsicOp(Intrinsic::ppc_altivec_vmsumuhm,
2067 LHS, RHSSwap, Zero, DAG, MVT::v4i32);
2068 // Shift the high parts up 16 bits.
2069 HiProd = BuildIntrinsicOp(Intrinsic::ppc_altivec_vslw, HiProd, Neg16, DAG);
2070 return DAG.getNode(ISD::ADD, MVT::v4i32, LoProd, HiProd);
2071 } else if (Op.getValueType() == MVT::v8i16) {
2072 SDOperand LHS = Op.getOperand(0), RHS = Op.getOperand(1);
2073
Chris Lattnercea2aa72006-04-18 04:28:57 +00002074 SDOperand Zero = BuildSplatI(0, 1, MVT::v8i16, DAG);
Chris Lattner72dd9bd2006-04-18 03:43:48 +00002075
Chris Lattnercea2aa72006-04-18 04:28:57 +00002076 return BuildIntrinsicOp(Intrinsic::ppc_altivec_vmladduhm,
2077 LHS, RHS, Zero, DAG);
Chris Lattner19a81522006-04-18 03:57:35 +00002078 } else if (Op.getValueType() == MVT::v16i8) {
2079 SDOperand LHS = Op.getOperand(0), RHS = Op.getOperand(1);
2080
2081 // Multiply the even 8-bit parts, producing 16-bit sums.
2082 SDOperand EvenParts = BuildIntrinsicOp(Intrinsic::ppc_altivec_vmuleub,
2083 LHS, RHS, DAG, MVT::v8i16);
2084 EvenParts = DAG.getNode(ISD::BIT_CONVERT, MVT::v16i8, EvenParts);
2085
2086 // Multiply the odd 8-bit parts, producing 16-bit sums.
2087 SDOperand OddParts = BuildIntrinsicOp(Intrinsic::ppc_altivec_vmuloub,
2088 LHS, RHS, DAG, MVT::v8i16);
2089 OddParts = DAG.getNode(ISD::BIT_CONVERT, MVT::v16i8, OddParts);
2090
2091 // Merge the results together.
2092 std::vector<SDOperand> Ops;
2093 for (unsigned i = 0; i != 8; ++i) {
2094 Ops.push_back(DAG.getConstant(2*i+1, MVT::i8));
2095 Ops.push_back(DAG.getConstant(2*i+1+16, MVT::i8));
2096 }
2097
2098 return DAG.getNode(ISD::VECTOR_SHUFFLE, MVT::v16i8, EvenParts, OddParts,
2099 DAG.getNode(ISD::BUILD_VECTOR, MVT::v16i8, Ops));
Chris Lattner72dd9bd2006-04-18 03:43:48 +00002100 } else {
2101 assert(0 && "Unknown mul to lower!");
2102 abort();
2103 }
Chris Lattnere7c768e2006-04-18 03:24:30 +00002104}
2105
Chris Lattnere4bc9ea2005-08-26 00:52:45 +00002106/// LowerOperation - Provide custom lowering hooks for some operations.
2107///
Nate Begeman21e463b2005-10-16 05:39:50 +00002108SDOperand PPCTargetLowering::LowerOperation(SDOperand Op, SelectionDAG &DAG) {
Chris Lattnere4bc9ea2005-08-26 00:52:45 +00002109 switch (Op.getOpcode()) {
2110 default: assert(0 && "Wasn't expecting to be able to lower this!");
Chris Lattner1a635d62006-04-14 06:01:58 +00002111 case ISD::ConstantPool: return LowerConstantPool(Op, DAG);
2112 case ISD::GlobalAddress: return LowerGlobalAddress(Op, DAG);
Nate Begeman37efe672006-04-22 18:53:45 +00002113 case ISD::JumpTable: return LowerJumpTable(Op, DAG);
Chris Lattner1a635d62006-04-14 06:01:58 +00002114 case ISD::SETCC: return LowerSETCC(Op, DAG);
2115 case ISD::VASTART: return LowerVASTART(Op, DAG, VarArgsFrameIndex);
Chris Lattner8ab5fe52006-05-16 18:18:50 +00002116 case ISD::FORMAL_ARGUMENTS: return LowerFORMAL_ARGUMENTS(Op, DAG,
2117 VarArgsFrameIndex);
Chris Lattnerabde4602006-05-16 22:56:08 +00002118 case ISD::CALL: return LowerCALL(Op, DAG);
Chris Lattner1a635d62006-04-14 06:01:58 +00002119 case ISD::RET: return LowerRET(Op, DAG);
Chris Lattner7c0d6642005-10-02 06:37:13 +00002120
Chris Lattner1a635d62006-04-14 06:01:58 +00002121 case ISD::SELECT_CC: return LowerSELECT_CC(Op, DAG);
2122 case ISD::FP_TO_SINT: return LowerFP_TO_SINT(Op, DAG);
2123 case ISD::SINT_TO_FP: return LowerSINT_TO_FP(Op, DAG);
Chris Lattnerecfe55e2006-03-22 05:30:33 +00002124
Chris Lattner1a635d62006-04-14 06:01:58 +00002125 // Lower 64-bit shifts.
2126 case ISD::SHL: return LowerSHL(Op, DAG);
2127 case ISD::SRL: return LowerSRL(Op, DAG);
2128 case ISD::SRA: return LowerSRA(Op, DAG);
Chris Lattnerecfe55e2006-03-22 05:30:33 +00002129
Chris Lattner1a635d62006-04-14 06:01:58 +00002130 // Vector-related lowering.
2131 case ISD::BUILD_VECTOR: return LowerBUILD_VECTOR(Op, DAG);
2132 case ISD::VECTOR_SHUFFLE: return LowerVECTOR_SHUFFLE(Op, DAG);
2133 case ISD::INTRINSIC_WO_CHAIN: return LowerINTRINSIC_WO_CHAIN(Op, DAG);
2134 case ISD::SCALAR_TO_VECTOR: return LowerSCALAR_TO_VECTOR(Op, DAG);
Chris Lattnere7c768e2006-04-18 03:24:30 +00002135 case ISD::MUL: return LowerMUL(Op, DAG);
Chris Lattnerbc11c342005-08-31 20:23:54 +00002136 }
Chris Lattnere4bc9ea2005-08-26 00:52:45 +00002137 return SDOperand();
2138}
2139
Chris Lattner1a635d62006-04-14 06:01:58 +00002140//===----------------------------------------------------------------------===//
2141// Other Lowering Code
2142//===----------------------------------------------------------------------===//
2143
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00002144MachineBasicBlock *
Nate Begeman21e463b2005-10-16 05:39:50 +00002145PPCTargetLowering::InsertAtEndOfBasicBlock(MachineInstr *MI,
2146 MachineBasicBlock *BB) {
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00002147 assert((MI->getOpcode() == PPC::SELECT_CC_Int ||
Chris Lattner919c0322005-10-01 01:35:02 +00002148 MI->getOpcode() == PPC::SELECT_CC_F4 ||
Chris Lattner710ff322006-04-08 22:45:08 +00002149 MI->getOpcode() == PPC::SELECT_CC_F8 ||
2150 MI->getOpcode() == PPC::SELECT_CC_VRRC) &&
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00002151 "Unexpected instr type to insert");
2152
2153 // To "insert" a SELECT_CC instruction, we actually have to insert the diamond
2154 // control-flow pattern. The incoming instruction knows the destination vreg
2155 // to set, the condition code register to branch on, the true/false values to
2156 // select between, and a branch opcode to use.
2157 const BasicBlock *LLVM_BB = BB->getBasicBlock();
2158 ilist<MachineBasicBlock>::iterator It = BB;
2159 ++It;
2160
2161 // thisMBB:
2162 // ...
2163 // TrueVal = ...
2164 // cmpTY ccX, r1, r2
2165 // bCC copy1MBB
2166 // fallthrough --> copy0MBB
2167 MachineBasicBlock *thisMBB = BB;
2168 MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB);
2169 MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB);
2170 BuildMI(BB, MI->getOperand(4).getImmedValue(), 2)
2171 .addReg(MI->getOperand(1).getReg()).addMBB(sinkMBB);
2172 MachineFunction *F = BB->getParent();
2173 F->getBasicBlockList().insert(It, copy0MBB);
2174 F->getBasicBlockList().insert(It, sinkMBB);
Nate Begemanf15485a2006-03-27 01:32:24 +00002175 // Update machine-CFG edges by first adding all successors of the current
2176 // block to the new block which will contain the Phi node for the select.
2177 for(MachineBasicBlock::succ_iterator i = BB->succ_begin(),
2178 e = BB->succ_end(); i != e; ++i)
2179 sinkMBB->addSuccessor(*i);
2180 // Next, remove all successors of the current block, and add the true
2181 // and fallthrough blocks as its successors.
2182 while(!BB->succ_empty())
2183 BB->removeSuccessor(BB->succ_begin());
Chris Lattner8a2d3ca2005-08-26 21:23:58 +00002184 BB->addSuccessor(copy0MBB);
2185 BB->addSuccessor(sinkMBB);
2186
2187 // copy0MBB:
2188 // %FalseValue = ...
2189 // # fallthrough to sinkMBB
2190 BB = copy0MBB;
2191
2192 // Update machine-CFG edges
2193 BB->addSuccessor(sinkMBB);
2194
2195 // sinkMBB:
2196 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
2197 // ...
2198 BB = sinkMBB;
2199 BuildMI(BB, PPC::PHI, 4, MI->getOperand(0).getReg())
2200 .addReg(MI->getOperand(3).getReg()).addMBB(copy0MBB)
2201 .addReg(MI->getOperand(2).getReg()).addMBB(thisMBB);
2202
2203 delete MI; // The pseudo instruction is gone now.
2204 return BB;
2205}
2206
Chris Lattner1a635d62006-04-14 06:01:58 +00002207//===----------------------------------------------------------------------===//
2208// Target Optimization Hooks
2209//===----------------------------------------------------------------------===//
2210
Chris Lattner8c13d0a2006-03-01 04:57:39 +00002211SDOperand PPCTargetLowering::PerformDAGCombine(SDNode *N,
2212 DAGCombinerInfo &DCI) const {
2213 TargetMachine &TM = getTargetMachine();
2214 SelectionDAG &DAG = DCI.DAG;
2215 switch (N->getOpcode()) {
2216 default: break;
2217 case ISD::SINT_TO_FP:
2218 if (TM.getSubtarget<PPCSubtarget>().is64Bit()) {
Chris Lattnerecfe55e2006-03-22 05:30:33 +00002219 if (N->getOperand(0).getOpcode() == ISD::FP_TO_SINT) {
2220 // Turn (sint_to_fp (fp_to_sint X)) -> fctidz/fcfid without load/stores.
2221 // We allow the src/dst to be either f32/f64, but the intermediate
2222 // type must be i64.
2223 if (N->getOperand(0).getValueType() == MVT::i64) {
2224 SDOperand Val = N->getOperand(0).getOperand(0);
2225 if (Val.getValueType() == MVT::f32) {
2226 Val = DAG.getNode(ISD::FP_EXTEND, MVT::f64, Val);
2227 DCI.AddToWorklist(Val.Val);
2228 }
2229
2230 Val = DAG.getNode(PPCISD::FCTIDZ, MVT::f64, Val);
Chris Lattner8c13d0a2006-03-01 04:57:39 +00002231 DCI.AddToWorklist(Val.Val);
Chris Lattnerecfe55e2006-03-22 05:30:33 +00002232 Val = DAG.getNode(PPCISD::FCFID, MVT::f64, Val);
Chris Lattner8c13d0a2006-03-01 04:57:39 +00002233 DCI.AddToWorklist(Val.Val);
Chris Lattnerecfe55e2006-03-22 05:30:33 +00002234 if (N->getValueType(0) == MVT::f32) {
2235 Val = DAG.getNode(ISD::FP_ROUND, MVT::f32, Val);
2236 DCI.AddToWorklist(Val.Val);
2237 }
2238 return Val;
2239 } else if (N->getOperand(0).getValueType() == MVT::i32) {
2240 // If the intermediate type is i32, we can avoid the load/store here
2241 // too.
Chris Lattner8c13d0a2006-03-01 04:57:39 +00002242 }
Chris Lattner8c13d0a2006-03-01 04:57:39 +00002243 }
2244 }
2245 break;
Chris Lattner51269842006-03-01 05:50:56 +00002246 case ISD::STORE:
2247 // Turn STORE (FP_TO_SINT F) -> STFIWX(FCTIWZ(F)).
2248 if (TM.getSubtarget<PPCSubtarget>().hasSTFIWX() &&
2249 N->getOperand(1).getOpcode() == ISD::FP_TO_SINT &&
2250 N->getOperand(1).getValueType() == MVT::i32) {
2251 SDOperand Val = N->getOperand(1).getOperand(0);
2252 if (Val.getValueType() == MVT::f32) {
2253 Val = DAG.getNode(ISD::FP_EXTEND, MVT::f64, Val);
2254 DCI.AddToWorklist(Val.Val);
2255 }
2256 Val = DAG.getNode(PPCISD::FCTIWZ, MVT::f64, Val);
2257 DCI.AddToWorklist(Val.Val);
2258
2259 Val = DAG.getNode(PPCISD::STFIWX, MVT::Other, N->getOperand(0), Val,
2260 N->getOperand(2), N->getOperand(3));
2261 DCI.AddToWorklist(Val.Val);
2262 return Val;
2263 }
2264 break;
Chris Lattner4468c222006-03-31 06:02:07 +00002265 case PPCISD::VCMP: {
2266 // If a VCMPo node already exists with exactly the same operands as this
2267 // node, use its result instead of this node (VCMPo computes both a CR6 and
2268 // a normal output).
2269 //
2270 if (!N->getOperand(0).hasOneUse() &&
2271 !N->getOperand(1).hasOneUse() &&
2272 !N->getOperand(2).hasOneUse()) {
2273
2274 // Scan all of the users of the LHS, looking for VCMPo's that match.
2275 SDNode *VCMPoNode = 0;
2276
2277 SDNode *LHSN = N->getOperand(0).Val;
2278 for (SDNode::use_iterator UI = LHSN->use_begin(), E = LHSN->use_end();
2279 UI != E; ++UI)
2280 if ((*UI)->getOpcode() == PPCISD::VCMPo &&
2281 (*UI)->getOperand(1) == N->getOperand(1) &&
2282 (*UI)->getOperand(2) == N->getOperand(2) &&
2283 (*UI)->getOperand(0) == N->getOperand(0)) {
2284 VCMPoNode = *UI;
2285 break;
2286 }
2287
Chris Lattner00901202006-04-18 18:28:22 +00002288 // If there is no VCMPo node, or if the flag value has a single use, don't
2289 // transform this.
2290 if (!VCMPoNode || VCMPoNode->hasNUsesOfValue(0, 1))
2291 break;
2292
2293 // Look at the (necessarily single) use of the flag value. If it has a
2294 // chain, this transformation is more complex. Note that multiple things
2295 // could use the value result, which we should ignore.
2296 SDNode *FlagUser = 0;
2297 for (SDNode::use_iterator UI = VCMPoNode->use_begin();
2298 FlagUser == 0; ++UI) {
2299 assert(UI != VCMPoNode->use_end() && "Didn't find user!");
2300 SDNode *User = *UI;
2301 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i) {
2302 if (User->getOperand(i) == SDOperand(VCMPoNode, 1)) {
2303 FlagUser = User;
2304 break;
2305 }
2306 }
2307 }
2308
2309 // If the user is a MFCR instruction, we know this is safe. Otherwise we
2310 // give up for right now.
2311 if (FlagUser->getOpcode() == PPCISD::MFCR)
Chris Lattner4468c222006-03-31 06:02:07 +00002312 return SDOperand(VCMPoNode, 0);
2313 }
2314 break;
2315 }
Chris Lattner90564f22006-04-18 17:59:36 +00002316 case ISD::BR_CC: {
2317 // If this is a branch on an altivec predicate comparison, lower this so
2318 // that we don't have to do a MFCR: instead, branch directly on CR6. This
2319 // lowering is done pre-legalize, because the legalizer lowers the predicate
2320 // compare down to code that is difficult to reassemble.
2321 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(1))->get();
2322 SDOperand LHS = N->getOperand(2), RHS = N->getOperand(3);
2323 int CompareOpc;
2324 bool isDot;
2325
2326 if (LHS.getOpcode() == ISD::INTRINSIC_WO_CHAIN &&
2327 isa<ConstantSDNode>(RHS) && (CC == ISD::SETEQ || CC == ISD::SETNE) &&
2328 getAltivecCompareInfo(LHS, CompareOpc, isDot)) {
2329 assert(isDot && "Can't compare against a vector result!");
2330
2331 // If this is a comparison against something other than 0/1, then we know
2332 // that the condition is never/always true.
2333 unsigned Val = cast<ConstantSDNode>(RHS)->getValue();
2334 if (Val != 0 && Val != 1) {
2335 if (CC == ISD::SETEQ) // Cond never true, remove branch.
2336 return N->getOperand(0);
2337 // Always !=, turn it into an unconditional branch.
2338 return DAG.getNode(ISD::BR, MVT::Other,
2339 N->getOperand(0), N->getOperand(4));
2340 }
2341
2342 bool BranchOnWhenPredTrue = (CC == ISD::SETEQ) ^ (Val == 0);
2343
2344 // Create the PPCISD altivec 'dot' comparison node.
2345 std::vector<SDOperand> Ops;
2346 std::vector<MVT::ValueType> VTs;
2347 Ops.push_back(LHS.getOperand(2)); // LHS of compare
2348 Ops.push_back(LHS.getOperand(3)); // RHS of compare
2349 Ops.push_back(DAG.getConstant(CompareOpc, MVT::i32));
2350 VTs.push_back(LHS.getOperand(2).getValueType());
2351 VTs.push_back(MVT::Flag);
2352 SDOperand CompNode = DAG.getNode(PPCISD::VCMPo, VTs, Ops);
2353
2354 // Unpack the result based on how the target uses it.
2355 unsigned CompOpc;
2356 switch (cast<ConstantSDNode>(LHS.getOperand(1))->getValue()) {
2357 default: // Can't happen, don't crash on invalid number though.
2358 case 0: // Branch on the value of the EQ bit of CR6.
2359 CompOpc = BranchOnWhenPredTrue ? PPC::BEQ : PPC::BNE;
2360 break;
2361 case 1: // Branch on the inverted value of the EQ bit of CR6.
2362 CompOpc = BranchOnWhenPredTrue ? PPC::BNE : PPC::BEQ;
2363 break;
2364 case 2: // Branch on the value of the LT bit of CR6.
2365 CompOpc = BranchOnWhenPredTrue ? PPC::BLT : PPC::BGE;
2366 break;
2367 case 3: // Branch on the inverted value of the LT bit of CR6.
2368 CompOpc = BranchOnWhenPredTrue ? PPC::BGE : PPC::BLT;
2369 break;
2370 }
2371
2372 return DAG.getNode(PPCISD::COND_BRANCH, MVT::Other, N->getOperand(0),
2373 DAG.getRegister(PPC::CR6, MVT::i32),
2374 DAG.getConstant(CompOpc, MVT::i32),
2375 N->getOperand(4), CompNode.getValue(1));
2376 }
2377 break;
2378 }
Chris Lattner8c13d0a2006-03-01 04:57:39 +00002379 }
2380
2381 return SDOperand();
2382}
2383
Chris Lattner1a635d62006-04-14 06:01:58 +00002384//===----------------------------------------------------------------------===//
2385// Inline Assembly Support
2386//===----------------------------------------------------------------------===//
2387
Chris Lattnerbbe77de2006-04-02 06:26:07 +00002388void PPCTargetLowering::computeMaskedBitsForTargetNode(const SDOperand Op,
2389 uint64_t Mask,
2390 uint64_t &KnownZero,
2391 uint64_t &KnownOne,
2392 unsigned Depth) const {
2393 KnownZero = 0;
2394 KnownOne = 0;
2395 switch (Op.getOpcode()) {
2396 default: break;
2397 case ISD::INTRINSIC_WO_CHAIN: {
2398 switch (cast<ConstantSDNode>(Op.getOperand(0))->getValue()) {
2399 default: break;
2400 case Intrinsic::ppc_altivec_vcmpbfp_p:
2401 case Intrinsic::ppc_altivec_vcmpeqfp_p:
2402 case Intrinsic::ppc_altivec_vcmpequb_p:
2403 case Intrinsic::ppc_altivec_vcmpequh_p:
2404 case Intrinsic::ppc_altivec_vcmpequw_p:
2405 case Intrinsic::ppc_altivec_vcmpgefp_p:
2406 case Intrinsic::ppc_altivec_vcmpgtfp_p:
2407 case Intrinsic::ppc_altivec_vcmpgtsb_p:
2408 case Intrinsic::ppc_altivec_vcmpgtsh_p:
2409 case Intrinsic::ppc_altivec_vcmpgtsw_p:
2410 case Intrinsic::ppc_altivec_vcmpgtub_p:
2411 case Intrinsic::ppc_altivec_vcmpgtuh_p:
2412 case Intrinsic::ppc_altivec_vcmpgtuw_p:
2413 KnownZero = ~1U; // All bits but the low one are known to be zero.
2414 break;
2415 }
2416 }
2417 }
2418}
2419
2420
Chris Lattnerad3bc8d2006-02-07 20:16:30 +00002421/// getConstraintType - Given a constraint letter, return the type of
2422/// constraint it is for this target.
2423PPCTargetLowering::ConstraintType
2424PPCTargetLowering::getConstraintType(char ConstraintLetter) const {
2425 switch (ConstraintLetter) {
2426 default: break;
2427 case 'b':
2428 case 'r':
2429 case 'f':
2430 case 'v':
2431 case 'y':
2432 return C_RegisterClass;
2433 }
2434 return TargetLowering::getConstraintType(ConstraintLetter);
2435}
2436
2437
Chris Lattnerddc787d2006-01-31 19:20:21 +00002438std::vector<unsigned> PPCTargetLowering::
Chris Lattner1efa40f2006-02-22 00:56:39 +00002439getRegClassForInlineAsmConstraint(const std::string &Constraint,
2440 MVT::ValueType VT) const {
Chris Lattnerddc787d2006-01-31 19:20:21 +00002441 if (Constraint.size() == 1) {
2442 switch (Constraint[0]) { // GCC RS6000 Constraint Letters
2443 default: break; // Unknown constriant letter
2444 case 'b':
2445 return make_vector<unsigned>(/*no R0*/ PPC::R1 , PPC::R2 , PPC::R3 ,
2446 PPC::R4 , PPC::R5 , PPC::R6 , PPC::R7 ,
2447 PPC::R8 , PPC::R9 , PPC::R10, PPC::R11,
2448 PPC::R12, PPC::R13, PPC::R14, PPC::R15,
2449 PPC::R16, PPC::R17, PPC::R18, PPC::R19,
2450 PPC::R20, PPC::R21, PPC::R22, PPC::R23,
2451 PPC::R24, PPC::R25, PPC::R26, PPC::R27,
2452 PPC::R28, PPC::R29, PPC::R30, PPC::R31,
2453 0);
2454 case 'r':
2455 return make_vector<unsigned>(PPC::R0 , PPC::R1 , PPC::R2 , PPC::R3 ,
2456 PPC::R4 , PPC::R5 , PPC::R6 , PPC::R7 ,
2457 PPC::R8 , PPC::R9 , PPC::R10, PPC::R11,
2458 PPC::R12, PPC::R13, PPC::R14, PPC::R15,
2459 PPC::R16, PPC::R17, PPC::R18, PPC::R19,
2460 PPC::R20, PPC::R21, PPC::R22, PPC::R23,
2461 PPC::R24, PPC::R25, PPC::R26, PPC::R27,
2462 PPC::R28, PPC::R29, PPC::R30, PPC::R31,
2463 0);
2464 case 'f':
2465 return make_vector<unsigned>(PPC::F0 , PPC::F1 , PPC::F2 , PPC::F3 ,
2466 PPC::F4 , PPC::F5 , PPC::F6 , PPC::F7 ,
2467 PPC::F8 , PPC::F9 , PPC::F10, PPC::F11,
2468 PPC::F12, PPC::F13, PPC::F14, PPC::F15,
2469 PPC::F16, PPC::F17, PPC::F18, PPC::F19,
2470 PPC::F20, PPC::F21, PPC::F22, PPC::F23,
2471 PPC::F24, PPC::F25, PPC::F26, PPC::F27,
2472 PPC::F28, PPC::F29, PPC::F30, PPC::F31,
2473 0);
2474 case 'v':
2475 return make_vector<unsigned>(PPC::V0 , PPC::V1 , PPC::V2 , PPC::V3 ,
2476 PPC::V4 , PPC::V5 , PPC::V6 , PPC::V7 ,
2477 PPC::V8 , PPC::V9 , PPC::V10, PPC::V11,
2478 PPC::V12, PPC::V13, PPC::V14, PPC::V15,
2479 PPC::V16, PPC::V17, PPC::V18, PPC::V19,
2480 PPC::V20, PPC::V21, PPC::V22, PPC::V23,
2481 PPC::V24, PPC::V25, PPC::V26, PPC::V27,
2482 PPC::V28, PPC::V29, PPC::V30, PPC::V31,
2483 0);
2484 case 'y':
2485 return make_vector<unsigned>(PPC::CR0, PPC::CR1, PPC::CR2, PPC::CR3,
2486 PPC::CR4, PPC::CR5, PPC::CR6, PPC::CR7,
2487 0);
2488 }
2489 }
2490
Chris Lattner1efa40f2006-02-22 00:56:39 +00002491 return std::vector<unsigned>();
Chris Lattnerddc787d2006-01-31 19:20:21 +00002492}
Chris Lattner763317d2006-02-07 00:47:13 +00002493
2494// isOperandValidForConstraint
2495bool PPCTargetLowering::
2496isOperandValidForConstraint(SDOperand Op, char Letter) {
2497 switch (Letter) {
2498 default: break;
2499 case 'I':
2500 case 'J':
2501 case 'K':
2502 case 'L':
2503 case 'M':
2504 case 'N':
2505 case 'O':
2506 case 'P': {
2507 if (!isa<ConstantSDNode>(Op)) return false; // Must be an immediate.
2508 unsigned Value = cast<ConstantSDNode>(Op)->getValue();
2509 switch (Letter) {
2510 default: assert(0 && "Unknown constraint letter!");
2511 case 'I': // "I" is a signed 16-bit constant.
2512 return (short)Value == (int)Value;
2513 case 'J': // "J" is a constant with only the high-order 16 bits nonzero.
2514 case 'L': // "L" is a signed 16-bit constant shifted left 16 bits.
2515 return (short)Value == 0;
2516 case 'K': // "K" is a constant with only the low-order 16 bits nonzero.
2517 return (Value >> 16) == 0;
2518 case 'M': // "M" is a constant that is greater than 31.
2519 return Value > 31;
2520 case 'N': // "N" is a positive constant that is an exact power of two.
2521 return (int)Value > 0 && isPowerOf2_32(Value);
2522 case 'O': // "O" is the constant zero.
2523 return Value == 0;
2524 case 'P': // "P" is a constant whose negation is a signed 16-bit constant.
2525 return (short)-Value == (int)-Value;
2526 }
2527 break;
2528 }
2529 }
2530
2531 // Handle standard constraint letters.
2532 return TargetLowering::isOperandValidForConstraint(Op, Letter);
2533}
Evan Chengc4c62572006-03-13 23:20:37 +00002534
2535/// isLegalAddressImmediate - Return true if the integer value can be used
2536/// as the offset of the target addressing mode.
2537bool PPCTargetLowering::isLegalAddressImmediate(int64_t V) const {
2538 // PPC allows a sign-extended 16-bit immediate field.
2539 return (V > -(1 << 16) && V < (1 << 16)-1);
2540}