1 //===-- TargetLowering.cpp - Implement the TargetLowering class -----------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This implements the TargetLowering class.
12 //===----------------------------------------------------------------------===//
14 #include "llvm/Target/TargetAsmInfo.h"
15 #include "llvm/Target/TargetLowering.h"
16 #include "llvm/Target/TargetSubtarget.h"
17 #include "llvm/Target/TargetData.h"
18 #include "llvm/Target/TargetMachine.h"
19 #include "llvm/Target/TargetRegisterInfo.h"
20 #include "llvm/GlobalVariable.h"
21 #include "llvm/DerivedTypes.h"
22 #include "llvm/CodeGen/MachineFrameInfo.h"
23 #include "llvm/CodeGen/SelectionDAG.h"
24 #include "llvm/ADT/StringExtras.h"
25 #include "llvm/ADT/STLExtras.h"
26 #include "llvm/Support/MathExtras.h"
29 /// InitLibcallNames - Set default libcall names.
31 static void InitLibcallNames(const char **Names) {
32 Names[RTLIB::SHL_I32] = "__ashlsi3";
33 Names[RTLIB::SHL_I64] = "__ashldi3";
34 Names[RTLIB::SHL_I128] = "__ashlti3";
35 Names[RTLIB::SRL_I32] = "__lshrsi3";
36 Names[RTLIB::SRL_I64] = "__lshrdi3";
37 Names[RTLIB::SRL_I128] = "__lshrti3";
38 Names[RTLIB::SRA_I32] = "__ashrsi3";
39 Names[RTLIB::SRA_I64] = "__ashrdi3";
40 Names[RTLIB::SRA_I128] = "__ashrti3";
41 Names[RTLIB::MUL_I32] = "__mulsi3";
42 Names[RTLIB::MUL_I64] = "__muldi3";
43 Names[RTLIB::MUL_I128] = "__multi3";
44 Names[RTLIB::SDIV_I32] = "__divsi3";
45 Names[RTLIB::SDIV_I64] = "__divdi3";
46 Names[RTLIB::SDIV_I128] = "__divti3";
47 Names[RTLIB::UDIV_I32] = "__udivsi3";
48 Names[RTLIB::UDIV_I64] = "__udivdi3";
49 Names[RTLIB::UDIV_I128] = "__udivti3";
50 Names[RTLIB::SREM_I32] = "__modsi3";
51 Names[RTLIB::SREM_I64] = "__moddi3";
52 Names[RTLIB::SREM_I128] = "__modti3";
53 Names[RTLIB::UREM_I32] = "__umodsi3";
54 Names[RTLIB::UREM_I64] = "__umoddi3";
55 Names[RTLIB::UREM_I128] = "__umodti3";
56 Names[RTLIB::NEG_I32] = "__negsi2";
57 Names[RTLIB::NEG_I64] = "__negdi2";
58 Names[RTLIB::ADD_F32] = "__addsf3";
59 Names[RTLIB::ADD_F64] = "__adddf3";
60 Names[RTLIB::ADD_F80] = "__addxf3";
61 Names[RTLIB::ADD_PPCF128] = "__gcc_qadd";
62 Names[RTLIB::SUB_F32] = "__subsf3";
63 Names[RTLIB::SUB_F64] = "__subdf3";
64 Names[RTLIB::SUB_F80] = "__subxf3";
65 Names[RTLIB::SUB_PPCF128] = "__gcc_qsub";
66 Names[RTLIB::MUL_F32] = "__mulsf3";
67 Names[RTLIB::MUL_F64] = "__muldf3";
68 Names[RTLIB::MUL_F80] = "__mulxf3";
69 Names[RTLIB::MUL_PPCF128] = "__gcc_qmul";
70 Names[RTLIB::DIV_F32] = "__divsf3";
71 Names[RTLIB::DIV_F64] = "__divdf3";
72 Names[RTLIB::DIV_F80] = "__divxf3";
73 Names[RTLIB::DIV_PPCF128] = "__gcc_qdiv";
74 Names[RTLIB::REM_F32] = "fmodf";
75 Names[RTLIB::REM_F64] = "fmod";
76 Names[RTLIB::REM_F80] = "fmodl";
77 Names[RTLIB::REM_PPCF128] = "fmodl";
78 Names[RTLIB::POWI_F32] = "__powisf2";
79 Names[RTLIB::POWI_F64] = "__powidf2";
80 Names[RTLIB::POWI_F80] = "__powixf2";
81 Names[RTLIB::POWI_PPCF128] = "__powitf2";
82 Names[RTLIB::SQRT_F32] = "sqrtf";
83 Names[RTLIB::SQRT_F64] = "sqrt";
84 Names[RTLIB::SQRT_F80] = "sqrtl";
85 Names[RTLIB::SQRT_PPCF128] = "sqrtl";
86 Names[RTLIB::LOG_F32] = "logf";
87 Names[RTLIB::LOG_F64] = "log";
88 Names[RTLIB::LOG_F80] = "logl";
89 Names[RTLIB::LOG_PPCF128] = "logl";
90 Names[RTLIB::LOG2_F32] = "log2f";
91 Names[RTLIB::LOG2_F64] = "log2";
92 Names[RTLIB::LOG2_F80] = "log2l";
93 Names[RTLIB::LOG2_PPCF128] = "log2l";
94 Names[RTLIB::LOG10_F32] = "log10f";
95 Names[RTLIB::LOG10_F64] = "log10";
96 Names[RTLIB::LOG10_F80] = "log10l";
97 Names[RTLIB::LOG10_PPCF128] = "log10l";
98 Names[RTLIB::EXP_F32] = "expf";
99 Names[RTLIB::EXP_F64] = "exp";
100 Names[RTLIB::EXP_F80] = "expl";
101 Names[RTLIB::EXP_PPCF128] = "expl";
102 Names[RTLIB::EXP2_F32] = "exp2f";
103 Names[RTLIB::EXP2_F64] = "exp2";
104 Names[RTLIB::EXP2_F80] = "exp2l";
105 Names[RTLIB::EXP2_PPCF128] = "exp2l";
106 Names[RTLIB::SIN_F32] = "sinf";
107 Names[RTLIB::SIN_F64] = "sin";
108 Names[RTLIB::SIN_F80] = "sinl";
109 Names[RTLIB::SIN_PPCF128] = "sinl";
110 Names[RTLIB::COS_F32] = "cosf";
111 Names[RTLIB::COS_F64] = "cos";
112 Names[RTLIB::COS_F80] = "cosl";
113 Names[RTLIB::COS_PPCF128] = "cosl";
114 Names[RTLIB::POW_F32] = "powf";
115 Names[RTLIB::POW_F64] = "pow";
116 Names[RTLIB::POW_F80] = "powl";
117 Names[RTLIB::POW_PPCF128] = "powl";
118 Names[RTLIB::CEIL_F32] = "ceilf";
119 Names[RTLIB::CEIL_F64] = "ceil";
120 Names[RTLIB::CEIL_F80] = "ceill";
121 Names[RTLIB::CEIL_PPCF128] = "ceill";
122 Names[RTLIB::TRUNC_F32] = "truncf";
123 Names[RTLIB::TRUNC_F64] = "trunc";
124 Names[RTLIB::TRUNC_F80] = "truncl";
125 Names[RTLIB::TRUNC_PPCF128] = "truncl";
126 Names[RTLIB::RINT_F32] = "rintf";
127 Names[RTLIB::RINT_F64] = "rint";
128 Names[RTLIB::RINT_F80] = "rintl";
129 Names[RTLIB::RINT_PPCF128] = "rintl";
130 Names[RTLIB::NEARBYINT_F32] = "nearbyintf";
131 Names[RTLIB::NEARBYINT_F64] = "nearbyint";
132 Names[RTLIB::NEARBYINT_F80] = "nearbyintl";
133 Names[RTLIB::NEARBYINT_PPCF128] = "nearbyintl";
134 Names[RTLIB::FLOOR_F32] = "floorf";
135 Names[RTLIB::FLOOR_F64] = "floor";
136 Names[RTLIB::FLOOR_F80] = "floorl";
137 Names[RTLIB::FLOOR_PPCF128] = "floorl";
138 Names[RTLIB::FPEXT_F32_F64] = "__extendsfdf2";
139 Names[RTLIB::FPROUND_F64_F32] = "__truncdfsf2";
140 Names[RTLIB::FPROUND_F80_F32] = "__truncxfsf2";
141 Names[RTLIB::FPROUND_PPCF128_F32] = "__trunctfsf2";
142 Names[RTLIB::FPROUND_F80_F64] = "__truncxfdf2";
143 Names[RTLIB::FPROUND_PPCF128_F64] = "__trunctfdf2";
144 Names[RTLIB::FPTOSINT_F32_I32] = "__fixsfsi";
145 Names[RTLIB::FPTOSINT_F32_I64] = "__fixsfdi";
146 Names[RTLIB::FPTOSINT_F32_I128] = "__fixsfti";
147 Names[RTLIB::FPTOSINT_F64_I32] = "__fixdfsi";
148 Names[RTLIB::FPTOSINT_F64_I64] = "__fixdfdi";
149 Names[RTLIB::FPTOSINT_F64_I128] = "__fixdfti";
150 Names[RTLIB::FPTOSINT_F80_I32] = "__fixxfsi";
151 Names[RTLIB::FPTOSINT_F80_I64] = "__fixxfdi";
152 Names[RTLIB::FPTOSINT_F80_I128] = "__fixxfti";
153 Names[RTLIB::FPTOSINT_PPCF128_I32] = "__fixtfsi";
154 Names[RTLIB::FPTOSINT_PPCF128_I64] = "__fixtfdi";
155 Names[RTLIB::FPTOSINT_PPCF128_I128] = "__fixtfti";
156 Names[RTLIB::FPTOUINT_F32_I32] = "__fixunssfsi";
157 Names[RTLIB::FPTOUINT_F32_I64] = "__fixunssfdi";
158 Names[RTLIB::FPTOUINT_F32_I128] = "__fixunssfti";
159 Names[RTLIB::FPTOUINT_F64_I32] = "__fixunsdfsi";
160 Names[RTLIB::FPTOUINT_F64_I64] = "__fixunsdfdi";
161 Names[RTLIB::FPTOUINT_F64_I128] = "__fixunsdfti";
162 Names[RTLIB::FPTOUINT_F80_I32] = "__fixunsxfsi";
163 Names[RTLIB::FPTOUINT_F80_I64] = "__fixunsxfdi";
164 Names[RTLIB::FPTOUINT_F80_I128] = "__fixunsxfti";
165 Names[RTLIB::FPTOUINT_PPCF128_I32] = "__fixunstfsi";
166 Names[RTLIB::FPTOUINT_PPCF128_I64] = "__fixunstfdi";
167 Names[RTLIB::FPTOUINT_PPCF128_I128] = "__fixunstfti";
168 Names[RTLIB::SINTTOFP_I32_F32] = "__floatsisf";
169 Names[RTLIB::SINTTOFP_I32_F64] = "__floatsidf";
170 Names[RTLIB::SINTTOFP_I32_F80] = "__floatsixf";
171 Names[RTLIB::SINTTOFP_I32_PPCF128] = "__floatsitf";
172 Names[RTLIB::SINTTOFP_I64_F32] = "__floatdisf";
173 Names[RTLIB::SINTTOFP_I64_F64] = "__floatdidf";
174 Names[RTLIB::SINTTOFP_I64_F80] = "__floatdixf";
175 Names[RTLIB::SINTTOFP_I64_PPCF128] = "__floatditf";
176 Names[RTLIB::SINTTOFP_I128_F32] = "__floattisf";
177 Names[RTLIB::SINTTOFP_I128_F64] = "__floattidf";
178 Names[RTLIB::SINTTOFP_I128_F80] = "__floattixf";
179 Names[RTLIB::SINTTOFP_I128_PPCF128] = "__floattitf";
180 Names[RTLIB::UINTTOFP_I32_F32] = "__floatunsisf";
181 Names[RTLIB::UINTTOFP_I32_F64] = "__floatunsidf";
182 Names[RTLIB::UINTTOFP_I32_F80] = "__floatunsixf";
183 Names[RTLIB::UINTTOFP_I32_PPCF128] = "__floatunsitf";
184 Names[RTLIB::UINTTOFP_I64_F32] = "__floatundisf";
185 Names[RTLIB::UINTTOFP_I64_F64] = "__floatundidf";
186 Names[RTLIB::UINTTOFP_I64_F80] = "__floatundixf";
187 Names[RTLIB::UINTTOFP_I64_PPCF128] = "__floatunditf";
188 Names[RTLIB::UINTTOFP_I128_F32] = "__floatuntisf";
189 Names[RTLIB::UINTTOFP_I128_F64] = "__floatuntidf";
190 Names[RTLIB::UINTTOFP_I128_F80] = "__floatuntixf";
191 Names[RTLIB::UINTTOFP_I128_PPCF128] = "__floatuntitf";
192 Names[RTLIB::OEQ_F32] = "__eqsf2";
193 Names[RTLIB::OEQ_F64] = "__eqdf2";
194 Names[RTLIB::UNE_F32] = "__nesf2";
195 Names[RTLIB::UNE_F64] = "__nedf2";
196 Names[RTLIB::OGE_F32] = "__gesf2";
197 Names[RTLIB::OGE_F64] = "__gedf2";
198 Names[RTLIB::OLT_F32] = "__ltsf2";
199 Names[RTLIB::OLT_F64] = "__ltdf2";
200 Names[RTLIB::OLE_F32] = "__lesf2";
201 Names[RTLIB::OLE_F64] = "__ledf2";
202 Names[RTLIB::OGT_F32] = "__gtsf2";
203 Names[RTLIB::OGT_F64] = "__gtdf2";
204 Names[RTLIB::UO_F32] = "__unordsf2";
205 Names[RTLIB::UO_F64] = "__unorddf2";
206 Names[RTLIB::O_F32] = "__unordsf2";
207 Names[RTLIB::O_F64] = "__unorddf2";
210 /// getFPEXT - Return the FPEXT_*_* value for the given types, or
211 /// UNKNOWN_LIBCALL if there is none.
212 RTLIB::Libcall RTLIB::getFPEXT(MVT OpVT, MVT RetVT) {
213 if (OpVT == MVT::f32) {
214 if (RetVT == MVT::f64)
215 return FPEXT_F32_F64;
217 return UNKNOWN_LIBCALL;
220 /// getFPROUND - Return the FPROUND_*_* value for the given types, or
221 /// UNKNOWN_LIBCALL if there is none.
222 RTLIB::Libcall RTLIB::getFPROUND(MVT OpVT, MVT RetVT) {
223 if (RetVT == MVT::f32) {
224 if (OpVT == MVT::f64)
225 return FPROUND_F64_F32;
226 if (OpVT == MVT::f80)
227 return FPROUND_F80_F32;
228 if (OpVT == MVT::ppcf128)
229 return FPROUND_PPCF128_F32;
230 } else if (RetVT == MVT::f64) {
231 if (OpVT == MVT::f80)
232 return FPROUND_F80_F64;
233 if (OpVT == MVT::ppcf128)
234 return FPROUND_PPCF128_F64;
236 return UNKNOWN_LIBCALL;
239 /// getFPTOSINT - Return the FPTOSINT_*_* value for the given types, or
240 /// UNKNOWN_LIBCALL if there is none.
241 RTLIB::Libcall RTLIB::getFPTOSINT(MVT OpVT, MVT RetVT) {
242 if (OpVT == MVT::f32) {
243 if (RetVT == MVT::i32)
244 return FPTOSINT_F32_I32;
245 if (RetVT == MVT::i64)
246 return FPTOSINT_F32_I64;
247 if (RetVT == MVT::i128)
248 return FPTOSINT_F32_I128;
249 } else if (OpVT == MVT::f64) {
250 if (RetVT == MVT::i32)
251 return FPTOSINT_F64_I32;
252 if (RetVT == MVT::i64)
253 return FPTOSINT_F64_I64;
254 if (RetVT == MVT::i128)
255 return FPTOSINT_F64_I128;
256 } else if (OpVT == MVT::f80) {
257 if (RetVT == MVT::i32)
258 return FPTOSINT_F80_I32;
259 if (RetVT == MVT::i64)
260 return FPTOSINT_F80_I64;
261 if (RetVT == MVT::i128)
262 return FPTOSINT_F80_I128;
263 } else if (OpVT == MVT::ppcf128) {
264 if (RetVT == MVT::i32)
265 return FPTOSINT_PPCF128_I32;
266 if (RetVT == MVT::i64)
267 return FPTOSINT_PPCF128_I64;
268 if (RetVT == MVT::i128)
269 return FPTOSINT_PPCF128_I128;
271 return UNKNOWN_LIBCALL;
274 /// getFPTOUINT - Return the FPTOUINT_*_* value for the given types, or
275 /// UNKNOWN_LIBCALL if there is none.
276 RTLIB::Libcall RTLIB::getFPTOUINT(MVT OpVT, MVT RetVT) {
277 if (OpVT == MVT::f32) {
278 if (RetVT == MVT::i32)
279 return FPTOUINT_F32_I32;
280 if (RetVT == MVT::i64)
281 return FPTOUINT_F32_I64;
282 if (RetVT == MVT::i128)
283 return FPTOUINT_F32_I128;
284 } else if (OpVT == MVT::f64) {
285 if (RetVT == MVT::i32)
286 return FPTOUINT_F64_I32;
287 if (RetVT == MVT::i64)
288 return FPTOUINT_F64_I64;
289 if (RetVT == MVT::i128)
290 return FPTOUINT_F64_I128;
291 } else if (OpVT == MVT::f80) {
292 if (RetVT == MVT::i32)
293 return FPTOUINT_F80_I32;
294 if (RetVT == MVT::i64)
295 return FPTOUINT_F80_I64;
296 if (RetVT == MVT::i128)
297 return FPTOUINT_F80_I128;
298 } else if (OpVT == MVT::ppcf128) {
299 if (RetVT == MVT::i32)
300 return FPTOUINT_PPCF128_I32;
301 if (RetVT == MVT::i64)
302 return FPTOUINT_PPCF128_I64;
303 if (RetVT == MVT::i128)
304 return FPTOUINT_PPCF128_I128;
306 return UNKNOWN_LIBCALL;
309 /// getSINTTOFP - Return the SINTTOFP_*_* value for the given types, or
310 /// UNKNOWN_LIBCALL if there is none.
311 RTLIB::Libcall RTLIB::getSINTTOFP(MVT OpVT, MVT RetVT) {
312 if (OpVT == MVT::i32) {
313 if (RetVT == MVT::f32)
314 return SINTTOFP_I32_F32;
315 else if (RetVT == MVT::f64)
316 return SINTTOFP_I32_F64;
317 else if (RetVT == MVT::f80)
318 return SINTTOFP_I32_F80;
319 else if (RetVT == MVT::ppcf128)
320 return SINTTOFP_I32_PPCF128;
321 } else if (OpVT == MVT::i64) {
322 if (RetVT == MVT::f32)
323 return SINTTOFP_I64_F32;
324 else if (RetVT == MVT::f64)
325 return SINTTOFP_I64_F64;
326 else if (RetVT == MVT::f80)
327 return SINTTOFP_I64_F80;
328 else if (RetVT == MVT::ppcf128)
329 return SINTTOFP_I64_PPCF128;
330 } else if (OpVT == MVT::i128) {
331 if (RetVT == MVT::f32)
332 return SINTTOFP_I128_F32;
333 else if (RetVT == MVT::f64)
334 return SINTTOFP_I128_F64;
335 else if (RetVT == MVT::f80)
336 return SINTTOFP_I128_F80;
337 else if (RetVT == MVT::ppcf128)
338 return SINTTOFP_I128_PPCF128;
340 return UNKNOWN_LIBCALL;
343 /// getUINTTOFP - Return the UINTTOFP_*_* value for the given types, or
344 /// UNKNOWN_LIBCALL if there is none.
345 RTLIB::Libcall RTLIB::getUINTTOFP(MVT OpVT, MVT RetVT) {
346 if (OpVT == MVT::i32) {
347 if (RetVT == MVT::f32)
348 return UINTTOFP_I32_F32;
349 else if (RetVT == MVT::f64)
350 return UINTTOFP_I32_F64;
351 else if (RetVT == MVT::f80)
352 return UINTTOFP_I32_F80;
353 else if (RetVT == MVT::ppcf128)
354 return UINTTOFP_I32_PPCF128;
355 } else if (OpVT == MVT::i64) {
356 if (RetVT == MVT::f32)
357 return UINTTOFP_I64_F32;
358 else if (RetVT == MVT::f64)
359 return UINTTOFP_I64_F64;
360 else if (RetVT == MVT::f80)
361 return UINTTOFP_I64_F80;
362 else if (RetVT == MVT::ppcf128)
363 return UINTTOFP_I64_PPCF128;
364 } else if (OpVT == MVT::i128) {
365 if (RetVT == MVT::f32)
366 return UINTTOFP_I128_F32;
367 else if (RetVT == MVT::f64)
368 return UINTTOFP_I128_F64;
369 else if (RetVT == MVT::f80)
370 return UINTTOFP_I128_F80;
371 else if (RetVT == MVT::ppcf128)
372 return UINTTOFP_I128_PPCF128;
374 return UNKNOWN_LIBCALL;
377 /// InitCmpLibcallCCs - Set default comparison libcall CC.
379 static void InitCmpLibcallCCs(ISD::CondCode *CCs) {
380 memset(CCs, ISD::SETCC_INVALID, sizeof(ISD::CondCode)*RTLIB::UNKNOWN_LIBCALL);
381 CCs[RTLIB::OEQ_F32] = ISD::SETEQ;
382 CCs[RTLIB::OEQ_F64] = ISD::SETEQ;
383 CCs[RTLIB::UNE_F32] = ISD::SETNE;
384 CCs[RTLIB::UNE_F64] = ISD::SETNE;
385 CCs[RTLIB::OGE_F32] = ISD::SETGE;
386 CCs[RTLIB::OGE_F64] = ISD::SETGE;
387 CCs[RTLIB::OLT_F32] = ISD::SETLT;
388 CCs[RTLIB::OLT_F64] = ISD::SETLT;
389 CCs[RTLIB::OLE_F32] = ISD::SETLE;
390 CCs[RTLIB::OLE_F64] = ISD::SETLE;
391 CCs[RTLIB::OGT_F32] = ISD::SETGT;
392 CCs[RTLIB::OGT_F64] = ISD::SETGT;
393 CCs[RTLIB::UO_F32] = ISD::SETNE;
394 CCs[RTLIB::UO_F64] = ISD::SETNE;
395 CCs[RTLIB::O_F32] = ISD::SETEQ;
396 CCs[RTLIB::O_F64] = ISD::SETEQ;
399 TargetLowering::TargetLowering(TargetMachine &tm)
400 : TM(tm), TD(TM.getTargetData()) {
401 assert(ISD::BUILTIN_OP_END <= OpActionsCapacity &&
402 "Fixed size array in TargetLowering is not large enough!");
403 // All operations default to being supported.
404 memset(OpActions, 0, sizeof(OpActions));
405 memset(LoadExtActions, 0, sizeof(LoadExtActions));
406 memset(TruncStoreActions, 0, sizeof(TruncStoreActions));
407 memset(IndexedModeActions, 0, sizeof(IndexedModeActions));
408 memset(ConvertActions, 0, sizeof(ConvertActions));
409 memset(CondCodeActions, 0, sizeof(CondCodeActions));
411 // Set default actions for various operations.
412 for (unsigned VT = 0; VT != (unsigned)MVT::LAST_VALUETYPE; ++VT) {
413 // Default all indexed load / store to expand.
414 for (unsigned IM = (unsigned)ISD::PRE_INC;
415 IM != (unsigned)ISD::LAST_INDEXED_MODE; ++IM) {
416 setIndexedLoadAction(IM, (MVT::SimpleValueType)VT, Expand);
417 setIndexedStoreAction(IM, (MVT::SimpleValueType)VT, Expand);
420 // These operations default to expand.
421 setOperationAction(ISD::FGETSIGN, (MVT::SimpleValueType)VT, Expand);
424 // Most targets ignore the @llvm.prefetch intrinsic.
425 setOperationAction(ISD::PREFETCH, MVT::Other, Expand);
427 // ConstantFP nodes default to expand. Targets can either change this to
428 // Legal, in which case all fp constants are legal, or use addLegalFPImmediate
429 // to optimize expansions for certain constants.
430 setOperationAction(ISD::ConstantFP, MVT::f32, Expand);
431 setOperationAction(ISD::ConstantFP, MVT::f64, Expand);
432 setOperationAction(ISD::ConstantFP, MVT::f80, Expand);
434 // These library functions default to expand.
435 setOperationAction(ISD::FLOG , MVT::f64, Expand);
436 setOperationAction(ISD::FLOG2, MVT::f64, Expand);
437 setOperationAction(ISD::FLOG10,MVT::f64, Expand);
438 setOperationAction(ISD::FEXP , MVT::f64, Expand);
439 setOperationAction(ISD::FEXP2, MVT::f64, Expand);
440 setOperationAction(ISD::FLOG , MVT::f32, Expand);
441 setOperationAction(ISD::FLOG2, MVT::f32, Expand);
442 setOperationAction(ISD::FLOG10,MVT::f32, Expand);
443 setOperationAction(ISD::FEXP , MVT::f32, Expand);
444 setOperationAction(ISD::FEXP2, MVT::f32, Expand);
446 // Default ISD::TRAP to expand (which turns it into abort).
447 setOperationAction(ISD::TRAP, MVT::Other, Expand);
449 IsLittleEndian = TD->isLittleEndian();
450 UsesGlobalOffsetTable = false;
451 ShiftAmountTy = PointerTy = getValueType(TD->getIntPtrType());
452 ShiftAmtHandling = Undefined;
453 memset(RegClassForVT, 0,MVT::LAST_VALUETYPE*sizeof(TargetRegisterClass*));
454 memset(TargetDAGCombineArray, 0, array_lengthof(TargetDAGCombineArray));
455 maxStoresPerMemset = maxStoresPerMemcpy = maxStoresPerMemmove = 8;
456 allowUnalignedMemoryAccesses = false;
457 UseUnderscoreSetJmp = false;
458 UseUnderscoreLongJmp = false;
459 SelectIsExpensive = false;
460 IntDivIsCheap = false;
461 Pow2DivIsCheap = false;
462 StackPointerRegisterToSaveRestore = 0;
463 ExceptionPointerRegister = 0;
464 ExceptionSelectorRegister = 0;
465 SetCCResultContents = UndefinedSetCCResult;
466 SchedPreferenceInfo = SchedulingForLatency;
468 JumpBufAlignment = 0;
469 IfCvtBlockSizeLimit = 2;
470 IfCvtDupBlockSizeLimit = 0;
471 PrefLoopAlignment = 0;
473 InitLibcallNames(LibcallRoutineNames);
474 InitCmpLibcallCCs(CmpLibcallCCs);
476 // Tell Legalize whether the assembler supports DEBUG_LOC.
477 const TargetAsmInfo *TASM = TM.getTargetAsmInfo();
478 if (!TASM || !TASM->hasDotLocAndDotFile())
479 setOperationAction(ISD::DEBUG_LOC, MVT::Other, Expand);
482 TargetLowering::~TargetLowering() {}
484 /// computeRegisterProperties - Once all of the register classes are added,
485 /// this allows us to compute derived properties we expose.
486 void TargetLowering::computeRegisterProperties() {
487 assert(MVT::LAST_VALUETYPE <= 32 &&
488 "Too many value types for ValueTypeActions to hold!");
490 // Everything defaults to needing one register.
491 for (unsigned i = 0; i != MVT::LAST_VALUETYPE; ++i) {
492 NumRegistersForVT[i] = 1;
493 RegisterTypeForVT[i] = TransformToType[i] = (MVT::SimpleValueType)i;
495 // ...except isVoid, which doesn't need any registers.
496 NumRegistersForVT[MVT::isVoid] = 0;
498 // Find the largest integer register class.
499 unsigned LargestIntReg = MVT::LAST_INTEGER_VALUETYPE;
500 for (; RegClassForVT[LargestIntReg] == 0; --LargestIntReg)
501 assert(LargestIntReg != MVT::i1 && "No integer registers defined!");
503 // Every integer value type larger than this largest register takes twice as
504 // many registers to represent as the previous ValueType.
505 for (unsigned ExpandedReg = LargestIntReg + 1; ; ++ExpandedReg) {
506 MVT EVT = (MVT::SimpleValueType)ExpandedReg;
507 if (!EVT.isInteger())
509 NumRegistersForVT[ExpandedReg] = 2*NumRegistersForVT[ExpandedReg-1];
510 RegisterTypeForVT[ExpandedReg] = (MVT::SimpleValueType)LargestIntReg;
511 TransformToType[ExpandedReg] = (MVT::SimpleValueType)(ExpandedReg - 1);
512 ValueTypeActions.setTypeAction(EVT, Expand);
515 // Inspect all of the ValueType's smaller than the largest integer
516 // register to see which ones need promotion.
517 unsigned LegalIntReg = LargestIntReg;
518 for (unsigned IntReg = LargestIntReg - 1;
519 IntReg >= (unsigned)MVT::i1; --IntReg) {
520 MVT IVT = (MVT::SimpleValueType)IntReg;
521 if (isTypeLegal(IVT)) {
522 LegalIntReg = IntReg;
524 RegisterTypeForVT[IntReg] = TransformToType[IntReg] =
525 (MVT::SimpleValueType)LegalIntReg;
526 ValueTypeActions.setTypeAction(IVT, Promote);
530 // ppcf128 type is really two f64's.
531 if (!isTypeLegal(MVT::ppcf128)) {
532 NumRegistersForVT[MVT::ppcf128] = 2*NumRegistersForVT[MVT::f64];
533 RegisterTypeForVT[MVT::ppcf128] = MVT::f64;
534 TransformToType[MVT::ppcf128] = MVT::f64;
535 ValueTypeActions.setTypeAction(MVT::ppcf128, Expand);
538 // Decide how to handle f64. If the target does not have native f64 support,
539 // expand it to i64 and we will be generating soft float library calls.
540 if (!isTypeLegal(MVT::f64)) {
541 NumRegistersForVT[MVT::f64] = NumRegistersForVT[MVT::i64];
542 RegisterTypeForVT[MVT::f64] = RegisterTypeForVT[MVT::i64];
543 TransformToType[MVT::f64] = MVT::i64;
544 ValueTypeActions.setTypeAction(MVT::f64, Expand);
547 // Decide how to handle f32. If the target does not have native support for
548 // f32, promote it to f64 if it is legal. Otherwise, expand it to i32.
549 if (!isTypeLegal(MVT::f32)) {
550 if (isTypeLegal(MVT::f64)) {
551 NumRegistersForVT[MVT::f32] = NumRegistersForVT[MVT::f64];
552 RegisterTypeForVT[MVT::f32] = RegisterTypeForVT[MVT::f64];
553 TransformToType[MVT::f32] = MVT::f64;
554 ValueTypeActions.setTypeAction(MVT::f32, Promote);
556 NumRegistersForVT[MVT::f32] = NumRegistersForVT[MVT::i32];
557 RegisterTypeForVT[MVT::f32] = RegisterTypeForVT[MVT::i32];
558 TransformToType[MVT::f32] = MVT::i32;
559 ValueTypeActions.setTypeAction(MVT::f32, Expand);
563 // Loop over all of the vector value types to see which need transformations.
564 for (unsigned i = MVT::FIRST_VECTOR_VALUETYPE;
565 i <= (unsigned)MVT::LAST_VECTOR_VALUETYPE; ++i) {
566 MVT VT = (MVT::SimpleValueType)i;
567 if (!isTypeLegal(VT)) {
568 MVT IntermediateVT, RegisterVT;
569 unsigned NumIntermediates;
570 NumRegistersForVT[i] =
571 getVectorTypeBreakdown(VT,
572 IntermediateVT, NumIntermediates,
574 RegisterTypeForVT[i] = RegisterVT;
575 TransformToType[i] = MVT::Other; // this isn't actually used
576 ValueTypeActions.setTypeAction(VT, Promote);
581 const char *TargetLowering::getTargetNodeName(unsigned Opcode) const {
586 MVT TargetLowering::getSetCCResultType(const SDValue &) const {
587 return getValueType(TD->getIntPtrType());
591 /// getVectorTypeBreakdown - Vector types are broken down into some number of
592 /// legal first class types. For example, MVT::v8f32 maps to 2 MVT::v4f32
593 /// with Altivec or SSE1, or 8 promoted MVT::f64 values with the X86 FP stack.
594 /// Similarly, MVT::v2i64 turns into 4 MVT::i32 values with both PPC and X86.
596 /// This method returns the number of registers needed, and the VT for each
597 /// register. It also returns the VT and quantity of the intermediate values
598 /// before they are promoted/expanded.
600 unsigned TargetLowering::getVectorTypeBreakdown(MVT VT,
602 unsigned &NumIntermediates,
603 MVT &RegisterVT) const {
604 // Figure out the right, legal destination reg to copy into.
605 unsigned NumElts = VT.getVectorNumElements();
606 MVT EltTy = VT.getVectorElementType();
608 unsigned NumVectorRegs = 1;
610 // FIXME: We don't support non-power-of-2-sized vectors for now. Ideally we
611 // could break down into LHS/RHS like LegalizeDAG does.
612 if (!isPowerOf2_32(NumElts)) {
613 NumVectorRegs = NumElts;
617 // Divide the input until we get to a supported size. This will always
618 // end with a scalar if the target doesn't support vectors.
619 while (NumElts > 1 && !isTypeLegal(MVT::getVectorVT(EltTy, NumElts))) {
624 NumIntermediates = NumVectorRegs;
626 MVT NewVT = MVT::getVectorVT(EltTy, NumElts);
627 if (!isTypeLegal(NewVT))
629 IntermediateVT = NewVT;
631 MVT DestVT = getTypeToTransformTo(NewVT);
633 if (DestVT.bitsLT(NewVT)) {
634 // Value is expanded, e.g. i64 -> i16.
635 return NumVectorRegs*(NewVT.getSizeInBits()/DestVT.getSizeInBits());
637 // Otherwise, promotion or legal types use the same number of registers as
638 // the vector decimated to the appropriate level.
639 return NumVectorRegs;
645 /// getWidenVectorType: given a vector type, returns the type to widen to
646 /// (e.g., v7i8 to v8i8). If the vector type is legal, it returns itself.
647 /// If there is no vector type that we want to widen to, returns MVT::Other
648 /// When and where to widen is target dependent based on the cost of
649 /// scalarizing vs using the wider vector type.
650 MVT TargetLowering::getWidenVectorType(MVT VT) {
651 assert(VT.isVector());
655 // Default is not to widen until moved to LegalizeTypes
659 /// getByValTypeAlignment - Return the desired alignment for ByVal aggregate
660 /// function arguments in the caller parameter area. This is the actual
661 /// alignment, not its logarithm.
662 unsigned TargetLowering::getByValTypeAlignment(const Type *Ty) const {
663 return TD->getCallFrameTypeAlignment(Ty);
666 SDValue TargetLowering::getPICJumpTableRelocBase(SDValue Table,
667 SelectionDAG &DAG) const {
668 if (usesGlobalOffsetTable())
669 return DAG.getNode(ISD::GLOBAL_OFFSET_TABLE, getPointerTy());
674 TargetLowering::isOffsetFoldingLegal(const GlobalAddressSDNode *GA) const {
675 // Assume that everything is safe in static mode.
676 if (getTargetMachine().getRelocationModel() == Reloc::Static)
679 // In dynamic-no-pic mode, assume that known defined values are safe.
680 if (getTargetMachine().getRelocationModel() == Reloc::DynamicNoPIC &&
682 !GA->getGlobal()->isDeclaration() &&
683 !GA->getGlobal()->mayBeOverridden())
686 // Otherwise assume nothing is safe.
690 //===----------------------------------------------------------------------===//
691 // Optimization Methods
692 //===----------------------------------------------------------------------===//
694 /// ShrinkDemandedConstant - Check to see if the specified operand of the
695 /// specified instruction is a constant integer. If so, check to see if there
696 /// are any bits set in the constant that are not demanded. If so, shrink the
697 /// constant and return true.
698 bool TargetLowering::TargetLoweringOpt::ShrinkDemandedConstant(SDValue Op,
699 const APInt &Demanded) {
700 // FIXME: ISD::SELECT, ISD::SELECT_CC
701 switch(Op.getOpcode()) {
706 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1)))
707 if (C->getAPIntValue().intersects(~Demanded)) {
708 MVT VT = Op.getValueType();
709 SDValue New = DAG.getNode(Op.getOpcode(), VT, Op.getOperand(0),
710 DAG.getConstant(Demanded &
713 return CombineTo(Op, New);
720 /// SimplifyDemandedBits - Look at Op. At this point, we know that only the
721 /// DemandedMask bits of the result of Op are ever used downstream. If we can
722 /// use this information to simplify Op, create a new simplified DAG node and
723 /// return true, returning the original and new nodes in Old and New. Otherwise,
724 /// analyze the expression and return a mask of KnownOne and KnownZero bits for
725 /// the expression (used to simplify the caller). The KnownZero/One bits may
726 /// only be accurate for those bits in the DemandedMask.
727 bool TargetLowering::SimplifyDemandedBits(SDValue Op,
728 const APInt &DemandedMask,
731 TargetLoweringOpt &TLO,
732 unsigned Depth) const {
733 unsigned BitWidth = DemandedMask.getBitWidth();
734 assert(Op.getValueSizeInBits() == BitWidth &&
735 "Mask size mismatches value type size!");
736 APInt NewMask = DemandedMask;
738 // Don't know anything.
739 KnownZero = KnownOne = APInt(BitWidth, 0);
741 // Other users may use these bits.
742 if (!Op.getNode()->hasOneUse()) {
744 // If not at the root, Just compute the KnownZero/KnownOne bits to
745 // simplify things downstream.
746 TLO.DAG.ComputeMaskedBits(Op, DemandedMask, KnownZero, KnownOne, Depth);
749 // If this is the root being simplified, allow it to have multiple uses,
750 // just set the NewMask to all bits.
751 NewMask = APInt::getAllOnesValue(BitWidth);
752 } else if (DemandedMask == 0) {
753 // Not demanding any bits from Op.
754 if (Op.getOpcode() != ISD::UNDEF)
755 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::UNDEF, Op.getValueType()));
757 } else if (Depth == 6) { // Limit search depth.
761 APInt KnownZero2, KnownOne2, KnownZeroOut, KnownOneOut;
762 switch (Op.getOpcode()) {
764 // We know all of the bits for a constant!
765 KnownOne = cast<ConstantSDNode>(Op)->getAPIntValue() & NewMask;
766 KnownZero = ~KnownOne & NewMask;
767 return false; // Don't fall through, will infinitely loop.
769 // If the RHS is a constant, check to see if the LHS would be zero without
770 // using the bits from the RHS. Below, we use knowledge about the RHS to
771 // simplify the LHS, here we're using information from the LHS to simplify
773 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
774 APInt LHSZero, LHSOne;
775 TLO.DAG.ComputeMaskedBits(Op.getOperand(0), NewMask,
776 LHSZero, LHSOne, Depth+1);
777 // If the LHS already has zeros where RHSC does, this and is dead.
778 if ((LHSZero & NewMask) == (~RHSC->getAPIntValue() & NewMask))
779 return TLO.CombineTo(Op, Op.getOperand(0));
780 // If any of the set bits in the RHS are known zero on the LHS, shrink
782 if (TLO.ShrinkDemandedConstant(Op, ~LHSZero & NewMask))
786 if (SimplifyDemandedBits(Op.getOperand(1), NewMask, KnownZero,
787 KnownOne, TLO, Depth+1))
789 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
790 if (SimplifyDemandedBits(Op.getOperand(0), ~KnownZero & NewMask,
791 KnownZero2, KnownOne2, TLO, Depth+1))
793 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
795 // If all of the demanded bits are known one on one side, return the other.
796 // These bits cannot contribute to the result of the 'and'.
797 if ((NewMask & ~KnownZero2 & KnownOne) == (~KnownZero2 & NewMask))
798 return TLO.CombineTo(Op, Op.getOperand(0));
799 if ((NewMask & ~KnownZero & KnownOne2) == (~KnownZero & NewMask))
800 return TLO.CombineTo(Op, Op.getOperand(1));
801 // If all of the demanded bits in the inputs are known zeros, return zero.
802 if ((NewMask & (KnownZero|KnownZero2)) == NewMask)
803 return TLO.CombineTo(Op, TLO.DAG.getConstant(0, Op.getValueType()));
804 // If the RHS is a constant, see if we can simplify it.
805 if (TLO.ShrinkDemandedConstant(Op, ~KnownZero2 & NewMask))
808 // Output known-1 bits are only known if set in both the LHS & RHS.
809 KnownOne &= KnownOne2;
810 // Output known-0 are known to be clear if zero in either the LHS | RHS.
811 KnownZero |= KnownZero2;
814 if (SimplifyDemandedBits(Op.getOperand(1), NewMask, KnownZero,
815 KnownOne, TLO, Depth+1))
817 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
818 if (SimplifyDemandedBits(Op.getOperand(0), ~KnownOne & NewMask,
819 KnownZero2, KnownOne2, TLO, Depth+1))
821 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
823 // If all of the demanded bits are known zero on one side, return the other.
824 // These bits cannot contribute to the result of the 'or'.
825 if ((NewMask & ~KnownOne2 & KnownZero) == (~KnownOne2 & NewMask))
826 return TLO.CombineTo(Op, Op.getOperand(0));
827 if ((NewMask & ~KnownOne & KnownZero2) == (~KnownOne & NewMask))
828 return TLO.CombineTo(Op, Op.getOperand(1));
829 // If all of the potentially set bits on one side are known to be set on
830 // the other side, just use the 'other' side.
831 if ((NewMask & ~KnownZero & KnownOne2) == (~KnownZero & NewMask))
832 return TLO.CombineTo(Op, Op.getOperand(0));
833 if ((NewMask & ~KnownZero2 & KnownOne) == (~KnownZero2 & NewMask))
834 return TLO.CombineTo(Op, Op.getOperand(1));
835 // If the RHS is a constant, see if we can simplify it.
836 if (TLO.ShrinkDemandedConstant(Op, NewMask))
839 // Output known-0 bits are only known if clear in both the LHS & RHS.
840 KnownZero &= KnownZero2;
841 // Output known-1 are known to be set if set in either the LHS | RHS.
842 KnownOne |= KnownOne2;
845 if (SimplifyDemandedBits(Op.getOperand(1), NewMask, KnownZero,
846 KnownOne, TLO, Depth+1))
848 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
849 if (SimplifyDemandedBits(Op.getOperand(0), NewMask, KnownZero2,
850 KnownOne2, TLO, Depth+1))
852 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
854 // If all of the demanded bits are known zero on one side, return the other.
855 // These bits cannot contribute to the result of the 'xor'.
856 if ((KnownZero & NewMask) == NewMask)
857 return TLO.CombineTo(Op, Op.getOperand(0));
858 if ((KnownZero2 & NewMask) == NewMask)
859 return TLO.CombineTo(Op, Op.getOperand(1));
861 // If all of the unknown bits are known to be zero on one side or the other
862 // (but not both) turn this into an *inclusive* or.
863 // e.g. (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0
864 if ((NewMask & ~KnownZero & ~KnownZero2) == 0)
865 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::OR, Op.getValueType(),
869 // Output known-0 bits are known if clear or set in both the LHS & RHS.
870 KnownZeroOut = (KnownZero & KnownZero2) | (KnownOne & KnownOne2);
871 // Output known-1 are known to be set if set in only one of the LHS, RHS.
872 KnownOneOut = (KnownZero & KnownOne2) | (KnownOne & KnownZero2);
874 // If all of the demanded bits on one side are known, and all of the set
875 // bits on that side are also known to be set on the other side, turn this
876 // into an AND, as we know the bits will be cleared.
877 // e.g. (X | C1) ^ C2 --> (X | C1) & ~C2 iff (C1&C2) == C2
878 if ((NewMask & (KnownZero|KnownOne)) == NewMask) { // all known
879 if ((KnownOne & KnownOne2) == KnownOne) {
880 MVT VT = Op.getValueType();
881 SDValue ANDC = TLO.DAG.getConstant(~KnownOne & NewMask, VT);
882 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::AND, VT, Op.getOperand(0),
887 // If the RHS is a constant, see if we can simplify it.
888 // for XOR, we prefer to force bits to 1 if they will make a -1.
889 // if we can't force bits, try to shrink constant
890 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
891 APInt Expanded = C->getAPIntValue() | (~NewMask);
892 // if we can expand it to have all bits set, do it
893 if (Expanded.isAllOnesValue()) {
894 if (Expanded != C->getAPIntValue()) {
895 MVT VT = Op.getValueType();
896 SDValue New = TLO.DAG.getNode(Op.getOpcode(), VT, Op.getOperand(0),
897 TLO.DAG.getConstant(Expanded, VT));
898 return TLO.CombineTo(Op, New);
900 // if it already has all the bits set, nothing to change
901 // but don't shrink either!
902 } else if (TLO.ShrinkDemandedConstant(Op, NewMask)) {
907 KnownZero = KnownZeroOut;
908 KnownOne = KnownOneOut;
911 if (SimplifyDemandedBits(Op.getOperand(2), NewMask, KnownZero,
912 KnownOne, TLO, Depth+1))
914 if (SimplifyDemandedBits(Op.getOperand(1), NewMask, KnownZero2,
915 KnownOne2, TLO, Depth+1))
917 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
918 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
920 // If the operands are constants, see if we can simplify them.
921 if (TLO.ShrinkDemandedConstant(Op, NewMask))
924 // Only known if known in both the LHS and RHS.
925 KnownOne &= KnownOne2;
926 KnownZero &= KnownZero2;
929 if (SimplifyDemandedBits(Op.getOperand(3), NewMask, KnownZero,
930 KnownOne, TLO, Depth+1))
932 if (SimplifyDemandedBits(Op.getOperand(2), NewMask, KnownZero2,
933 KnownOne2, TLO, Depth+1))
935 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
936 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
938 // If the operands are constants, see if we can simplify them.
939 if (TLO.ShrinkDemandedConstant(Op, NewMask))
942 // Only known if known in both the LHS and RHS.
943 KnownOne &= KnownOne2;
944 KnownZero &= KnownZero2;
947 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
948 unsigned ShAmt = SA->getZExtValue();
949 SDValue InOp = Op.getOperand(0);
951 // If the shift count is an invalid immediate, don't do anything.
952 if (ShAmt >= BitWidth)
955 // If this is ((X >>u C1) << ShAmt), see if we can simplify this into a
956 // single shift. We can do this if the bottom bits (which are shifted
957 // out) are never demanded.
958 if (InOp.getOpcode() == ISD::SRL &&
959 isa<ConstantSDNode>(InOp.getOperand(1))) {
960 if (ShAmt && (NewMask & APInt::getLowBitsSet(BitWidth, ShAmt)) == 0) {
961 unsigned C1= cast<ConstantSDNode>(InOp.getOperand(1))->getZExtValue();
962 unsigned Opc = ISD::SHL;
970 TLO.DAG.getConstant(Diff, Op.getOperand(1).getValueType());
971 MVT VT = Op.getValueType();
972 return TLO.CombineTo(Op, TLO.DAG.getNode(Opc, VT,
973 InOp.getOperand(0), NewSA));
977 if (SimplifyDemandedBits(Op.getOperand(0), NewMask.lshr(ShAmt),
978 KnownZero, KnownOne, TLO, Depth+1))
980 KnownZero <<= SA->getZExtValue();
981 KnownOne <<= SA->getZExtValue();
982 // low bits known zero.
983 KnownZero |= APInt::getLowBitsSet(BitWidth, SA->getZExtValue());
987 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
988 MVT VT = Op.getValueType();
989 unsigned ShAmt = SA->getZExtValue();
990 unsigned VTSize = VT.getSizeInBits();
991 SDValue InOp = Op.getOperand(0);
993 // If the shift count is an invalid immediate, don't do anything.
994 if (ShAmt >= BitWidth)
997 // If this is ((X << C1) >>u ShAmt), see if we can simplify this into a
998 // single shift. We can do this if the top bits (which are shifted out)
999 // are never demanded.
1000 if (InOp.getOpcode() == ISD::SHL &&
1001 isa<ConstantSDNode>(InOp.getOperand(1))) {
1002 if (ShAmt && (NewMask & APInt::getHighBitsSet(VTSize, ShAmt)) == 0) {
1003 unsigned C1= cast<ConstantSDNode>(InOp.getOperand(1))->getZExtValue();
1004 unsigned Opc = ISD::SRL;
1005 int Diff = ShAmt-C1;
1012 TLO.DAG.getConstant(Diff, Op.getOperand(1).getValueType());
1013 return TLO.CombineTo(Op, TLO.DAG.getNode(Opc, VT,
1014 InOp.getOperand(0), NewSA));
1018 // Compute the new bits that are at the top now.
1019 if (SimplifyDemandedBits(InOp, (NewMask << ShAmt),
1020 KnownZero, KnownOne, TLO, Depth+1))
1022 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1023 KnownZero = KnownZero.lshr(ShAmt);
1024 KnownOne = KnownOne.lshr(ShAmt);
1026 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt);
1027 KnownZero |= HighBits; // High bits known zero.
1031 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1032 MVT VT = Op.getValueType();
1033 unsigned ShAmt = SA->getZExtValue();
1035 // If the shift count is an invalid immediate, don't do anything.
1036 if (ShAmt >= BitWidth)
1039 APInt InDemandedMask = (NewMask << ShAmt);
1041 // If any of the demanded bits are produced by the sign extension, we also
1042 // demand the input sign bit.
1043 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt);
1044 if (HighBits.intersects(NewMask))
1045 InDemandedMask |= APInt::getSignBit(VT.getSizeInBits());
1047 if (SimplifyDemandedBits(Op.getOperand(0), InDemandedMask,
1048 KnownZero, KnownOne, TLO, Depth+1))
1050 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1051 KnownZero = KnownZero.lshr(ShAmt);
1052 KnownOne = KnownOne.lshr(ShAmt);
1054 // Handle the sign bit, adjusted to where it is now in the mask.
1055 APInt SignBit = APInt::getSignBit(BitWidth).lshr(ShAmt);
1057 // If the input sign bit is known to be zero, or if none of the top bits
1058 // are demanded, turn this into an unsigned shift right.
1059 if (KnownZero.intersects(SignBit) || (HighBits & ~NewMask) == HighBits) {
1060 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::SRL, VT, Op.getOperand(0),
1062 } else if (KnownOne.intersects(SignBit)) { // New bits are known one.
1063 KnownOne |= HighBits;
1067 case ISD::SIGN_EXTEND_INREG: {
1068 MVT EVT = cast<VTSDNode>(Op.getOperand(1))->getVT();
1070 // Sign extension. Compute the demanded bits in the result that are not
1071 // present in the input.
1072 APInt NewBits = APInt::getHighBitsSet(BitWidth,
1073 BitWidth - EVT.getSizeInBits()) &
1076 // If none of the extended bits are demanded, eliminate the sextinreg.
1078 return TLO.CombineTo(Op, Op.getOperand(0));
1080 APInt InSignBit = APInt::getSignBit(EVT.getSizeInBits());
1081 InSignBit.zext(BitWidth);
1082 APInt InputDemandedBits = APInt::getLowBitsSet(BitWidth,
1083 EVT.getSizeInBits()) &
1086 // Since the sign extended bits are demanded, we know that the sign
1088 InputDemandedBits |= InSignBit;
1090 if (SimplifyDemandedBits(Op.getOperand(0), InputDemandedBits,
1091 KnownZero, KnownOne, TLO, Depth+1))
1093 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1095 // If the sign bit of the input is known set or clear, then we know the
1096 // top bits of the result.
1098 // If the input sign bit is known zero, convert this into a zero extension.
1099 if (KnownZero.intersects(InSignBit))
1100 return TLO.CombineTo(Op,
1101 TLO.DAG.getZeroExtendInReg(Op.getOperand(0), EVT));
1103 if (KnownOne.intersects(InSignBit)) { // Input sign bit known set
1104 KnownOne |= NewBits;
1105 KnownZero &= ~NewBits;
1106 } else { // Input sign bit unknown
1107 KnownZero &= ~NewBits;
1108 KnownOne &= ~NewBits;
1112 case ISD::ZERO_EXTEND: {
1113 unsigned OperandBitWidth = Op.getOperand(0).getValueSizeInBits();
1114 APInt InMask = NewMask;
1115 InMask.trunc(OperandBitWidth);
1117 // If none of the top bits are demanded, convert this into an any_extend.
1119 APInt::getHighBitsSet(BitWidth, BitWidth - OperandBitWidth) & NewMask;
1120 if (!NewBits.intersects(NewMask))
1121 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::ANY_EXTEND,
1125 if (SimplifyDemandedBits(Op.getOperand(0), InMask,
1126 KnownZero, KnownOne, TLO, Depth+1))
1128 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1129 KnownZero.zext(BitWidth);
1130 KnownOne.zext(BitWidth);
1131 KnownZero |= NewBits;
1134 case ISD::SIGN_EXTEND: {
1135 MVT InVT = Op.getOperand(0).getValueType();
1136 unsigned InBits = InVT.getSizeInBits();
1137 APInt InMask = APInt::getLowBitsSet(BitWidth, InBits);
1138 APInt InSignBit = APInt::getBitsSet(BitWidth, InBits - 1, InBits);
1139 APInt NewBits = ~InMask & NewMask;
1141 // If none of the top bits are demanded, convert this into an any_extend.
1143 return TLO.CombineTo(Op,TLO.DAG.getNode(ISD::ANY_EXTEND,Op.getValueType(),
1146 // Since some of the sign extended bits are demanded, we know that the sign
1148 APInt InDemandedBits = InMask & NewMask;
1149 InDemandedBits |= InSignBit;
1150 InDemandedBits.trunc(InBits);
1152 if (SimplifyDemandedBits(Op.getOperand(0), InDemandedBits, KnownZero,
1153 KnownOne, TLO, Depth+1))
1155 KnownZero.zext(BitWidth);
1156 KnownOne.zext(BitWidth);
1158 // If the sign bit is known zero, convert this to a zero extend.
1159 if (KnownZero.intersects(InSignBit))
1160 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::ZERO_EXTEND,
1164 // If the sign bit is known one, the top bits match.
1165 if (KnownOne.intersects(InSignBit)) {
1166 KnownOne |= NewBits;
1167 KnownZero &= ~NewBits;
1168 } else { // Otherwise, top bits aren't known.
1169 KnownOne &= ~NewBits;
1170 KnownZero &= ~NewBits;
1174 case ISD::ANY_EXTEND: {
1175 unsigned OperandBitWidth = Op.getOperand(0).getValueSizeInBits();
1176 APInt InMask = NewMask;
1177 InMask.trunc(OperandBitWidth);
1178 if (SimplifyDemandedBits(Op.getOperand(0), InMask,
1179 KnownZero, KnownOne, TLO, Depth+1))
1181 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1182 KnownZero.zext(BitWidth);
1183 KnownOne.zext(BitWidth);
1186 case ISD::TRUNCATE: {
1187 // Simplify the input, using demanded bit information, and compute the known
1188 // zero/one bits live out.
1189 APInt TruncMask = NewMask;
1190 TruncMask.zext(Op.getOperand(0).getValueSizeInBits());
1191 if (SimplifyDemandedBits(Op.getOperand(0), TruncMask,
1192 KnownZero, KnownOne, TLO, Depth+1))
1194 KnownZero.trunc(BitWidth);
1195 KnownOne.trunc(BitWidth);
1197 // If the input is only used by this truncate, see if we can shrink it based
1198 // on the known demanded bits.
1199 if (Op.getOperand(0).getNode()->hasOneUse()) {
1200 SDValue In = Op.getOperand(0);
1201 unsigned InBitWidth = In.getValueSizeInBits();
1202 switch (In.getOpcode()) {
1205 // Shrink SRL by a constant if none of the high bits shifted in are
1207 if (ConstantSDNode *ShAmt = dyn_cast<ConstantSDNode>(In.getOperand(1))){
1208 APInt HighBits = APInt::getHighBitsSet(InBitWidth,
1209 InBitWidth - BitWidth);
1210 HighBits = HighBits.lshr(ShAmt->getZExtValue());
1211 HighBits.trunc(BitWidth);
1213 if (ShAmt->getZExtValue() < BitWidth && !(HighBits & NewMask)) {
1214 // None of the shifted in bits are needed. Add a truncate of the
1215 // shift input, then shift it.
1216 SDValue NewTrunc = TLO.DAG.getNode(ISD::TRUNCATE,
1219 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::SRL,Op.getValueType(),
1220 NewTrunc, In.getOperand(1)));
1227 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1230 case ISD::AssertZext: {
1231 MVT VT = cast<VTSDNode>(Op.getOperand(1))->getVT();
1232 APInt InMask = APInt::getLowBitsSet(BitWidth,
1233 VT.getSizeInBits());
1234 if (SimplifyDemandedBits(Op.getOperand(0), InMask & NewMask,
1235 KnownZero, KnownOne, TLO, Depth+1))
1237 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1238 KnownZero |= ~InMask & NewMask;
1241 case ISD::BIT_CONVERT:
1243 // If this is an FP->Int bitcast and if the sign bit is the only thing that
1244 // is demanded, turn this into a FGETSIGN.
1245 if (NewMask == MVT::getIntegerVTSignBit(Op.getValueType()) &&
1246 MVT::isFloatingPoint(Op.getOperand(0).getValueType()) &&
1247 !MVT::isVector(Op.getOperand(0).getValueType())) {
1248 // Only do this xform if FGETSIGN is valid or if before legalize.
1249 if (!TLO.AfterLegalize ||
1250 isOperationLegal(ISD::FGETSIGN, Op.getValueType())) {
1251 // Make a FGETSIGN + SHL to move the sign bit into the appropriate
1252 // place. We expect the SHL to be eliminated by other optimizations.
1253 SDValue Sign = TLO.DAG.getNode(ISD::FGETSIGN, Op.getValueType(),
1255 unsigned ShVal = Op.getValueType().getSizeInBits()-1;
1256 SDValue ShAmt = TLO.DAG.getConstant(ShVal, getShiftAmountTy());
1257 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::SHL, Op.getValueType(),
1264 // Just use ComputeMaskedBits to compute output bits.
1265 TLO.DAG.ComputeMaskedBits(Op, NewMask, KnownZero, KnownOne, Depth);
1269 // If we know the value of all of the demanded bits, return this as a
1271 if ((NewMask & (KnownZero|KnownOne)) == NewMask)
1272 return TLO.CombineTo(Op, TLO.DAG.getConstant(KnownOne, Op.getValueType()));
1277 /// computeMaskedBitsForTargetNode - Determine which of the bits specified
1278 /// in Mask are known to be either zero or one and return them in the
1279 /// KnownZero/KnownOne bitsets.
1280 void TargetLowering::computeMaskedBitsForTargetNode(const SDValue Op,
1284 const SelectionDAG &DAG,
1285 unsigned Depth) const {
1286 assert((Op.getOpcode() >= ISD::BUILTIN_OP_END ||
1287 Op.getOpcode() == ISD::INTRINSIC_WO_CHAIN ||
1288 Op.getOpcode() == ISD::INTRINSIC_W_CHAIN ||
1289 Op.getOpcode() == ISD::INTRINSIC_VOID) &&
1290 "Should use MaskedValueIsZero if you don't know whether Op"
1291 " is a target node!");
1292 KnownZero = KnownOne = APInt(Mask.getBitWidth(), 0);
1295 /// ComputeNumSignBitsForTargetNode - This method can be implemented by
1296 /// targets that want to expose additional information about sign bits to the
1298 unsigned TargetLowering::ComputeNumSignBitsForTargetNode(SDValue Op,
1299 unsigned Depth) const {
1300 assert((Op.getOpcode() >= ISD::BUILTIN_OP_END ||
1301 Op.getOpcode() == ISD::INTRINSIC_WO_CHAIN ||
1302 Op.getOpcode() == ISD::INTRINSIC_W_CHAIN ||
1303 Op.getOpcode() == ISD::INTRINSIC_VOID) &&
1304 "Should use ComputeNumSignBits if you don't know whether Op"
1305 " is a target node!");
1310 /// SimplifySetCC - Try to simplify a setcc built with the specified operands
1311 /// and cc. If it is unable to simplify it, return a null SDValue.
1313 TargetLowering::SimplifySetCC(MVT VT, SDValue N0, SDValue N1,
1314 ISD::CondCode Cond, bool foldBooleans,
1315 DAGCombinerInfo &DCI) const {
1316 SelectionDAG &DAG = DCI.DAG;
1318 // These setcc operations always fold.
1322 case ISD::SETFALSE2: return DAG.getConstant(0, VT);
1324 case ISD::SETTRUE2: return DAG.getConstant(1, VT);
1327 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.getNode())) {
1328 const APInt &C1 = N1C->getAPIntValue();
1329 if (isa<ConstantSDNode>(N0.getNode())) {
1330 return DAG.FoldSetCC(VT, N0, N1, Cond);
1332 // If the LHS is '(srl (ctlz x), 5)', the RHS is 0/1, and this is an
1333 // equality comparison, then we're just comparing whether X itself is
1335 if (N0.getOpcode() == ISD::SRL && (C1 == 0 || C1 == 1) &&
1336 N0.getOperand(0).getOpcode() == ISD::CTLZ &&
1337 N0.getOperand(1).getOpcode() == ISD::Constant) {
1338 unsigned ShAmt = cast<ConstantSDNode>(N0.getOperand(1))->getZExtValue();
1339 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) &&
1340 ShAmt == Log2_32(N0.getValueType().getSizeInBits())) {
1341 if ((C1 == 0) == (Cond == ISD::SETEQ)) {
1342 // (srl (ctlz x), 5) == 0 -> X != 0
1343 // (srl (ctlz x), 5) != 1 -> X != 0
1346 // (srl (ctlz x), 5) != 0 -> X == 0
1347 // (srl (ctlz x), 5) == 1 -> X == 0
1350 SDValue Zero = DAG.getConstant(0, N0.getValueType());
1351 return DAG.getSetCC(VT, N0.getOperand(0).getOperand(0),
1357 // If the LHS is '(and load, const)', the RHS is 0,
1358 // the test is for equality or unsigned, and all 1 bits of the const are
1359 // in the same partial word, see if we can shorten the load.
1360 if (DCI.isBeforeLegalize() &&
1361 N0.getOpcode() == ISD::AND && C1 == 0 &&
1362 isa<LoadSDNode>(N0.getOperand(0)) &&
1363 N0.getOperand(0).getNode()->hasOneUse() &&
1364 isa<ConstantSDNode>(N0.getOperand(1))) {
1365 LoadSDNode *Lod = cast<LoadSDNode>(N0.getOperand(0));
1366 uint64_t Mask = cast<ConstantSDNode>(N0.getOperand(1))->getZExtValue();
1367 unsigned bestWidth = 0, bestOffset = 0;
1368 if (!Lod->isVolatile()) {
1369 unsigned origWidth = N0.getValueType().getSizeInBits();
1370 for (unsigned width = origWidth / 2; width>=8; width /= 2) {
1371 uint64_t newMask = (1ULL << width) - 1;
1372 for (unsigned offset=0; offset<origWidth/width; offset++) {
1373 if ((newMask & Mask)==Mask) {
1374 if (!TD->isLittleEndian())
1375 bestOffset = (origWidth/width - offset - 1) * (width/8);
1377 bestOffset = (uint64_t)offset * (width/8);
1381 newMask = newMask << width;
1386 MVT newVT = MVT::getIntegerVT(bestWidth);
1387 if (newVT.isRound()) {
1388 uint64_t bestMask = Mask >> (bestOffset * 8);
1389 MVT PtrType = Lod->getOperand(1).getValueType();
1390 SDValue Ptr = Lod->getBasePtr();
1391 if (bestOffset != 0)
1392 Ptr = DAG.getNode(ISD::ADD, PtrType, Lod->getBasePtr(),
1393 DAG.getConstant(bestOffset, PtrType));
1394 unsigned NewAlign = MinAlign(Lod->getAlignment(), bestOffset);
1395 SDValue NewLoad = DAG.getLoad(newVT, Lod->getChain(), Ptr,
1397 Lod->getSrcValueOffset() + bestOffset,
1399 return DAG.getSetCC(VT, DAG.getNode(ISD::AND, newVT, NewLoad,
1400 DAG.getConstant(bestMask, newVT)),
1401 DAG.getConstant(0LL, newVT), Cond);
1407 // If the LHS is a ZERO_EXTEND, perform the comparison on the input.
1408 if (N0.getOpcode() == ISD::ZERO_EXTEND) {
1409 unsigned InSize = N0.getOperand(0).getValueType().getSizeInBits();
1411 // If the comparison constant has bits in the upper part, the
1412 // zero-extended value could never match.
1413 if (C1.intersects(APInt::getHighBitsSet(C1.getBitWidth(),
1414 C1.getBitWidth() - InSize))) {
1418 case ISD::SETEQ: return DAG.getConstant(0, VT);
1421 case ISD::SETNE: return DAG.getConstant(1, VT);
1424 // True if the sign bit of C1 is set.
1425 return DAG.getConstant(C1.isNegative(), VT);
1428 // True if the sign bit of C1 isn't set.
1429 return DAG.getConstant(C1.isNonNegative(), VT);
1435 // Otherwise, we can perform the comparison with the low bits.
1443 return DAG.getSetCC(VT, N0.getOperand(0),
1444 DAG.getConstant(APInt(C1).trunc(InSize),
1445 N0.getOperand(0).getValueType()),
1448 break; // todo, be more careful with signed comparisons
1450 } else if (N0.getOpcode() == ISD::SIGN_EXTEND_INREG &&
1451 (Cond == ISD::SETEQ || Cond == ISD::SETNE)) {
1452 MVT ExtSrcTy = cast<VTSDNode>(N0.getOperand(1))->getVT();
1453 unsigned ExtSrcTyBits = ExtSrcTy.getSizeInBits();
1454 MVT ExtDstTy = N0.getValueType();
1455 unsigned ExtDstTyBits = ExtDstTy.getSizeInBits();
1457 // If the extended part has any inconsistent bits, it cannot ever
1458 // compare equal. In other words, they have to be all ones or all
1461 APInt::getHighBitsSet(ExtDstTyBits, ExtDstTyBits - ExtSrcTyBits);
1462 if ((C1 & ExtBits) != 0 && (C1 & ExtBits) != ExtBits)
1463 return DAG.getConstant(Cond == ISD::SETNE, VT);
1466 MVT Op0Ty = N0.getOperand(0).getValueType();
1467 if (Op0Ty == ExtSrcTy) {
1468 ZextOp = N0.getOperand(0);
1470 APInt Imm = APInt::getLowBitsSet(ExtDstTyBits, ExtSrcTyBits);
1471 ZextOp = DAG.getNode(ISD::AND, Op0Ty, N0.getOperand(0),
1472 DAG.getConstant(Imm, Op0Ty));
1474 if (!DCI.isCalledByLegalizer())
1475 DCI.AddToWorklist(ZextOp.getNode());
1476 // Otherwise, make this a use of a zext.
1477 return DAG.getSetCC(VT, ZextOp,
1478 DAG.getConstant(C1 & APInt::getLowBitsSet(
1483 } else if ((N1C->isNullValue() || N1C->getAPIntValue() == 1) &&
1484 (Cond == ISD::SETEQ || Cond == ISD::SETNE)) {
1486 // SETCC (SETCC), [0|1], [EQ|NE] -> SETCC
1487 if (N0.getOpcode() == ISD::SETCC) {
1488 bool TrueWhenTrue = (Cond == ISD::SETEQ) ^ (N1C->getZExtValue() != 1);
1492 // Invert the condition.
1493 ISD::CondCode CC = cast<CondCodeSDNode>(N0.getOperand(2))->get();
1494 CC = ISD::getSetCCInverse(CC,
1495 N0.getOperand(0).getValueType().isInteger());
1496 return DAG.getSetCC(VT, N0.getOperand(0), N0.getOperand(1), CC);
1499 if ((N0.getOpcode() == ISD::XOR ||
1500 (N0.getOpcode() == ISD::AND &&
1501 N0.getOperand(0).getOpcode() == ISD::XOR &&
1502 N0.getOperand(1) == N0.getOperand(0).getOperand(1))) &&
1503 isa<ConstantSDNode>(N0.getOperand(1)) &&
1504 cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue() == 1) {
1505 // If this is (X^1) == 0/1, swap the RHS and eliminate the xor. We
1506 // can only do this if the top bits are known zero.
1507 unsigned BitWidth = N0.getValueSizeInBits();
1508 if (DAG.MaskedValueIsZero(N0,
1509 APInt::getHighBitsSet(BitWidth,
1511 // Okay, get the un-inverted input value.
1513 if (N0.getOpcode() == ISD::XOR)
1514 Val = N0.getOperand(0);
1516 assert(N0.getOpcode() == ISD::AND &&
1517 N0.getOperand(0).getOpcode() == ISD::XOR);
1518 // ((X^1)&1)^1 -> X & 1
1519 Val = DAG.getNode(ISD::AND, N0.getValueType(),
1520 N0.getOperand(0).getOperand(0),
1523 return DAG.getSetCC(VT, Val, N1,
1524 Cond == ISD::SETEQ ? ISD::SETNE : ISD::SETEQ);
1529 APInt MinVal, MaxVal;
1530 unsigned OperandBitSize = N1C->getValueType(0).getSizeInBits();
1531 if (ISD::isSignedIntSetCC(Cond)) {
1532 MinVal = APInt::getSignedMinValue(OperandBitSize);
1533 MaxVal = APInt::getSignedMaxValue(OperandBitSize);
1535 MinVal = APInt::getMinValue(OperandBitSize);
1536 MaxVal = APInt::getMaxValue(OperandBitSize);
1539 // Canonicalize GE/LE comparisons to use GT/LT comparisons.
1540 if (Cond == ISD::SETGE || Cond == ISD::SETUGE) {
1541 if (C1 == MinVal) return DAG.getConstant(1, VT); // X >= MIN --> true
1542 // X >= C0 --> X > (C0-1)
1543 return DAG.getSetCC(VT, N0, DAG.getConstant(C1-1, N1.getValueType()),
1544 (Cond == ISD::SETGE) ? ISD::SETGT : ISD::SETUGT);
1547 if (Cond == ISD::SETLE || Cond == ISD::SETULE) {
1548 if (C1 == MaxVal) return DAG.getConstant(1, VT); // X <= MAX --> true
1549 // X <= C0 --> X < (C0+1)
1550 return DAG.getSetCC(VT, N0, DAG.getConstant(C1+1, N1.getValueType()),
1551 (Cond == ISD::SETLE) ? ISD::SETLT : ISD::SETULT);
1554 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C1 == MinVal)
1555 return DAG.getConstant(0, VT); // X < MIN --> false
1556 if ((Cond == ISD::SETGE || Cond == ISD::SETUGE) && C1 == MinVal)
1557 return DAG.getConstant(1, VT); // X >= MIN --> true
1558 if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C1 == MaxVal)
1559 return DAG.getConstant(0, VT); // X > MAX --> false
1560 if ((Cond == ISD::SETLE || Cond == ISD::SETULE) && C1 == MaxVal)
1561 return DAG.getConstant(1, VT); // X <= MAX --> true
1563 // Canonicalize setgt X, Min --> setne X, Min
1564 if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C1 == MinVal)
1565 return DAG.getSetCC(VT, N0, N1, ISD::SETNE);
1566 // Canonicalize setlt X, Max --> setne X, Max
1567 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C1 == MaxVal)
1568 return DAG.getSetCC(VT, N0, N1, ISD::SETNE);
1570 // If we have setult X, 1, turn it into seteq X, 0
1571 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C1 == MinVal+1)
1572 return DAG.getSetCC(VT, N0, DAG.getConstant(MinVal, N0.getValueType()),
1574 // If we have setugt X, Max-1, turn it into seteq X, Max
1575 else if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C1 == MaxVal-1)
1576 return DAG.getSetCC(VT, N0, DAG.getConstant(MaxVal, N0.getValueType()),
1579 // If we have "setcc X, C0", check to see if we can shrink the immediate
1582 // SETUGT X, SINTMAX -> SETLT X, 0
1583 if (Cond == ISD::SETUGT && OperandBitSize != 1 &&
1584 C1 == (~0ULL >> (65-OperandBitSize)))
1585 return DAG.getSetCC(VT, N0, DAG.getConstant(0, N1.getValueType()),
1588 // FIXME: Implement the rest of these.
1590 // Fold bit comparisons when we can.
1591 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) &&
1592 VT == N0.getValueType() && N0.getOpcode() == ISD::AND)
1593 if (ConstantSDNode *AndRHS =
1594 dyn_cast<ConstantSDNode>(N0.getOperand(1))) {
1595 if (Cond == ISD::SETNE && C1 == 0) {// (X & 8) != 0 --> (X & 8) >> 3
1596 // Perform the xform if the AND RHS is a single bit.
1597 if (isPowerOf2_64(AndRHS->getZExtValue())) {
1598 return DAG.getNode(ISD::SRL, VT, N0,
1599 DAG.getConstant(Log2_64(AndRHS->getZExtValue()),
1600 getShiftAmountTy()));
1602 } else if (Cond == ISD::SETEQ && C1 == AndRHS->getZExtValue()) {
1603 // (X & 8) == 8 --> (X & 8) >> 3
1604 // Perform the xform if C1 is a single bit.
1605 if (C1.isPowerOf2()) {
1606 return DAG.getNode(ISD::SRL, VT, N0,
1607 DAG.getConstant(C1.logBase2(), getShiftAmountTy()));
1612 } else if (isa<ConstantSDNode>(N0.getNode())) {
1613 // Ensure that the constant occurs on the RHS.
1614 return DAG.getSetCC(VT, N1, N0, ISD::getSetCCSwappedOperands(Cond));
1617 if (isa<ConstantFPSDNode>(N0.getNode())) {
1618 // Constant fold or commute setcc.
1619 SDValue O = DAG.FoldSetCC(VT, N0, N1, Cond);
1620 if (O.getNode()) return O;
1621 } else if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(N1.getNode())) {
1622 // If the RHS of an FP comparison is a constant, simplify it away in
1624 if (CFP->getValueAPF().isNaN()) {
1625 // If an operand is known to be a nan, we can fold it.
1626 switch (ISD::getUnorderedFlavor(Cond)) {
1627 default: assert(0 && "Unknown flavor!");
1628 case 0: // Known false.
1629 return DAG.getConstant(0, VT);
1630 case 1: // Known true.
1631 return DAG.getConstant(1, VT);
1632 case 2: // Undefined.
1633 return DAG.getNode(ISD::UNDEF, VT);
1637 // Otherwise, we know the RHS is not a NaN. Simplify the node to drop the
1638 // constant if knowing that the operand is non-nan is enough. We prefer to
1639 // have SETO(x,x) instead of SETO(x, 0.0) because this avoids having to
1641 if (Cond == ISD::SETO || Cond == ISD::SETUO)
1642 return DAG.getSetCC(VT, N0, N0, Cond);
1646 // We can always fold X == X for integer setcc's.
1647 if (N0.getValueType().isInteger())
1648 return DAG.getConstant(ISD::isTrueWhenEqual(Cond), VT);
1649 unsigned UOF = ISD::getUnorderedFlavor(Cond);
1650 if (UOF == 2) // FP operators that are undefined on NaNs.
1651 return DAG.getConstant(ISD::isTrueWhenEqual(Cond), VT);
1652 if (UOF == unsigned(ISD::isTrueWhenEqual(Cond)))
1653 return DAG.getConstant(UOF, VT);
1654 // Otherwise, we can't fold it. However, we can simplify it to SETUO/SETO
1655 // if it is not already.
1656 ISD::CondCode NewCond = UOF == 0 ? ISD::SETO : ISD::SETUO;
1657 if (NewCond != Cond)
1658 return DAG.getSetCC(VT, N0, N1, NewCond);
1661 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) &&
1662 N0.getValueType().isInteger()) {
1663 if (N0.getOpcode() == ISD::ADD || N0.getOpcode() == ISD::SUB ||
1664 N0.getOpcode() == ISD::XOR) {
1665 // Simplify (X+Y) == (X+Z) --> Y == Z
1666 if (N0.getOpcode() == N1.getOpcode()) {
1667 if (N0.getOperand(0) == N1.getOperand(0))
1668 return DAG.getSetCC(VT, N0.getOperand(1), N1.getOperand(1), Cond);
1669 if (N0.getOperand(1) == N1.getOperand(1))
1670 return DAG.getSetCC(VT, N0.getOperand(0), N1.getOperand(0), Cond);
1671 if (DAG.isCommutativeBinOp(N0.getOpcode())) {
1672 // If X op Y == Y op X, try other combinations.
1673 if (N0.getOperand(0) == N1.getOperand(1))
1674 return DAG.getSetCC(VT, N0.getOperand(1), N1.getOperand(0), Cond);
1675 if (N0.getOperand(1) == N1.getOperand(0))
1676 return DAG.getSetCC(VT, N0.getOperand(0), N1.getOperand(1), Cond);
1680 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(N1)) {
1681 if (ConstantSDNode *LHSR = dyn_cast<ConstantSDNode>(N0.getOperand(1))) {
1682 // Turn (X+C1) == C2 --> X == C2-C1
1683 if (N0.getOpcode() == ISD::ADD && N0.getNode()->hasOneUse()) {
1684 return DAG.getSetCC(VT, N0.getOperand(0),
1685 DAG.getConstant(RHSC->getAPIntValue()-
1686 LHSR->getAPIntValue(),
1687 N0.getValueType()), Cond);
1690 // Turn (X^C1) == C2 into X == C1^C2 iff X&~C1 = 0.
1691 if (N0.getOpcode() == ISD::XOR)
1692 // If we know that all of the inverted bits are zero, don't bother
1693 // performing the inversion.
1694 if (DAG.MaskedValueIsZero(N0.getOperand(0), ~LHSR->getAPIntValue()))
1696 DAG.getSetCC(VT, N0.getOperand(0),
1697 DAG.getConstant(LHSR->getAPIntValue() ^
1698 RHSC->getAPIntValue(),
1703 // Turn (C1-X) == C2 --> X == C1-C2
1704 if (ConstantSDNode *SUBC = dyn_cast<ConstantSDNode>(N0.getOperand(0))) {
1705 if (N0.getOpcode() == ISD::SUB && N0.getNode()->hasOneUse()) {
1707 DAG.getSetCC(VT, N0.getOperand(1),
1708 DAG.getConstant(SUBC->getAPIntValue() -
1709 RHSC->getAPIntValue(),
1716 // Simplify (X+Z) == X --> Z == 0
1717 if (N0.getOperand(0) == N1)
1718 return DAG.getSetCC(VT, N0.getOperand(1),
1719 DAG.getConstant(0, N0.getValueType()), Cond);
1720 if (N0.getOperand(1) == N1) {
1721 if (DAG.isCommutativeBinOp(N0.getOpcode()))
1722 return DAG.getSetCC(VT, N0.getOperand(0),
1723 DAG.getConstant(0, N0.getValueType()), Cond);
1724 else if (N0.getNode()->hasOneUse()) {
1725 assert(N0.getOpcode() == ISD::SUB && "Unexpected operation!");
1726 // (Z-X) == X --> Z == X<<1
1727 SDValue SH = DAG.getNode(ISD::SHL, N1.getValueType(),
1729 DAG.getConstant(1, getShiftAmountTy()));
1730 if (!DCI.isCalledByLegalizer())
1731 DCI.AddToWorklist(SH.getNode());
1732 return DAG.getSetCC(VT, N0.getOperand(0), SH, Cond);
1737 if (N1.getOpcode() == ISD::ADD || N1.getOpcode() == ISD::SUB ||
1738 N1.getOpcode() == ISD::XOR) {
1739 // Simplify X == (X+Z) --> Z == 0
1740 if (N1.getOperand(0) == N0) {
1741 return DAG.getSetCC(VT, N1.getOperand(1),
1742 DAG.getConstant(0, N1.getValueType()), Cond);
1743 } else if (N1.getOperand(1) == N0) {
1744 if (DAG.isCommutativeBinOp(N1.getOpcode())) {
1745 return DAG.getSetCC(VT, N1.getOperand(0),
1746 DAG.getConstant(0, N1.getValueType()), Cond);
1747 } else if (N1.getNode()->hasOneUse()) {
1748 assert(N1.getOpcode() == ISD::SUB && "Unexpected operation!");
1749 // X == (Z-X) --> X<<1 == Z
1750 SDValue SH = DAG.getNode(ISD::SHL, N1.getValueType(), N0,
1751 DAG.getConstant(1, getShiftAmountTy()));
1752 if (!DCI.isCalledByLegalizer())
1753 DCI.AddToWorklist(SH.getNode());
1754 return DAG.getSetCC(VT, SH, N1.getOperand(0), Cond);
1760 // Fold away ALL boolean setcc's.
1762 if (N0.getValueType() == MVT::i1 && foldBooleans) {
1764 default: assert(0 && "Unknown integer setcc!");
1765 case ISD::SETEQ: // X == Y -> (X^Y)^1
1766 Temp = DAG.getNode(ISD::XOR, MVT::i1, N0, N1);
1767 N0 = DAG.getNode(ISD::XOR, MVT::i1, Temp, DAG.getConstant(1, MVT::i1));
1768 if (!DCI.isCalledByLegalizer())
1769 DCI.AddToWorklist(Temp.getNode());
1771 case ISD::SETNE: // X != Y --> (X^Y)
1772 N0 = DAG.getNode(ISD::XOR, MVT::i1, N0, N1);
1774 case ISD::SETGT: // X >s Y --> X == 0 & Y == 1 --> X^1 & Y
1775 case ISD::SETULT: // X <u Y --> X == 0 & Y == 1 --> X^1 & Y
1776 Temp = DAG.getNode(ISD::XOR, MVT::i1, N0, DAG.getConstant(1, MVT::i1));
1777 N0 = DAG.getNode(ISD::AND, MVT::i1, N1, Temp);
1778 if (!DCI.isCalledByLegalizer())
1779 DCI.AddToWorklist(Temp.getNode());
1781 case ISD::SETLT: // X <s Y --> X == 1 & Y == 0 --> Y^1 & X
1782 case ISD::SETUGT: // X >u Y --> X == 1 & Y == 0 --> Y^1 & X
1783 Temp = DAG.getNode(ISD::XOR, MVT::i1, N1, DAG.getConstant(1, MVT::i1));
1784 N0 = DAG.getNode(ISD::AND, MVT::i1, N0, Temp);
1785 if (!DCI.isCalledByLegalizer())
1786 DCI.AddToWorklist(Temp.getNode());
1788 case ISD::SETULE: // X <=u Y --> X == 0 | Y == 1 --> X^1 | Y
1789 case ISD::SETGE: // X >=s Y --> X == 0 | Y == 1 --> X^1 | Y
1790 Temp = DAG.getNode(ISD::XOR, MVT::i1, N0, DAG.getConstant(1, MVT::i1));
1791 N0 = DAG.getNode(ISD::OR, MVT::i1, N1, Temp);
1792 if (!DCI.isCalledByLegalizer())
1793 DCI.AddToWorklist(Temp.getNode());
1795 case ISD::SETUGE: // X >=u Y --> X == 1 | Y == 0 --> Y^1 | X
1796 case ISD::SETLE: // X <=s Y --> X == 1 | Y == 0 --> Y^1 | X
1797 Temp = DAG.getNode(ISD::XOR, MVT::i1, N1, DAG.getConstant(1, MVT::i1));
1798 N0 = DAG.getNode(ISD::OR, MVT::i1, N0, Temp);
1801 if (VT != MVT::i1) {
1802 if (!DCI.isCalledByLegalizer())
1803 DCI.AddToWorklist(N0.getNode());
1804 // FIXME: If running after legalize, we probably can't do this.
1805 N0 = DAG.getNode(ISD::ZERO_EXTEND, VT, N0);
1810 // Could not fold it.
1814 /// isGAPlusOffset - Returns true (and the GlobalValue and the offset) if the
1815 /// node is a GlobalAddress + offset.
1816 bool TargetLowering::isGAPlusOffset(SDNode *N, GlobalValue* &GA,
1817 int64_t &Offset) const {
1818 if (isa<GlobalAddressSDNode>(N)) {
1819 GlobalAddressSDNode *GASD = cast<GlobalAddressSDNode>(N);
1820 GA = GASD->getGlobal();
1821 Offset += GASD->getOffset();
1825 if (N->getOpcode() == ISD::ADD) {
1826 SDValue N1 = N->getOperand(0);
1827 SDValue N2 = N->getOperand(1);
1828 if (isGAPlusOffset(N1.getNode(), GA, Offset)) {
1829 ConstantSDNode *V = dyn_cast<ConstantSDNode>(N2);
1831 Offset += V->getSExtValue();
1834 } else if (isGAPlusOffset(N2.getNode(), GA, Offset)) {
1835 ConstantSDNode *V = dyn_cast<ConstantSDNode>(N1);
1837 Offset += V->getSExtValue();
1846 /// isConsecutiveLoad - Return true if LD (which must be a LoadSDNode) is
1847 /// loading 'Bytes' bytes from a location that is 'Dist' units away from the
1848 /// location that the 'Base' load is loading from.
1849 bool TargetLowering::isConsecutiveLoad(SDNode *LD, SDNode *Base,
1850 unsigned Bytes, int Dist,
1851 const MachineFrameInfo *MFI) const {
1852 if (LD->getOperand(0).getNode() != Base->getOperand(0).getNode())
1854 MVT VT = LD->getValueType(0);
1855 if (VT.getSizeInBits() / 8 != Bytes)
1858 SDValue Loc = LD->getOperand(1);
1859 SDValue BaseLoc = Base->getOperand(1);
1860 if (Loc.getOpcode() == ISD::FrameIndex) {
1861 if (BaseLoc.getOpcode() != ISD::FrameIndex)
1863 int FI = cast<FrameIndexSDNode>(Loc)->getIndex();
1864 int BFI = cast<FrameIndexSDNode>(BaseLoc)->getIndex();
1865 int FS = MFI->getObjectSize(FI);
1866 int BFS = MFI->getObjectSize(BFI);
1867 if (FS != BFS || FS != (int)Bytes) return false;
1868 return MFI->getObjectOffset(FI) == (MFI->getObjectOffset(BFI) + Dist*Bytes);
1871 GlobalValue *GV1 = NULL;
1872 GlobalValue *GV2 = NULL;
1873 int64_t Offset1 = 0;
1874 int64_t Offset2 = 0;
1875 bool isGA1 = isGAPlusOffset(Loc.getNode(), GV1, Offset1);
1876 bool isGA2 = isGAPlusOffset(BaseLoc.getNode(), GV2, Offset2);
1877 if (isGA1 && isGA2 && GV1 == GV2)
1878 return Offset1 == (Offset2 + Dist*Bytes);
1883 SDValue TargetLowering::
1884 PerformDAGCombine(SDNode *N, DAGCombinerInfo &DCI) const {
1885 // Default implementation: no optimization.
1889 //===----------------------------------------------------------------------===//
1890 // Inline Assembler Implementation Methods
1891 //===----------------------------------------------------------------------===//
1894 TargetLowering::ConstraintType
1895 TargetLowering::getConstraintType(const std::string &Constraint) const {
1896 // FIXME: lots more standard ones to handle.
1897 if (Constraint.size() == 1) {
1898 switch (Constraint[0]) {
1900 case 'r': return C_RegisterClass;
1902 case 'o': // offsetable
1903 case 'V': // not offsetable
1905 case 'i': // Simple Integer or Relocatable Constant
1906 case 'n': // Simple Integer
1907 case 's': // Relocatable Constant
1908 case 'X': // Allow ANY value.
1909 case 'I': // Target registers.
1921 if (Constraint.size() > 1 && Constraint[0] == '{' &&
1922 Constraint[Constraint.size()-1] == '}')
1927 /// LowerXConstraint - try to replace an X constraint, which matches anything,
1928 /// with another that has more specific requirements based on the type of the
1929 /// corresponding operand.
1930 const char *TargetLowering::LowerXConstraint(MVT ConstraintVT) const{
1931 if (ConstraintVT.isInteger())
1933 if (ConstraintVT.isFloatingPoint())
1934 return "f"; // works for many targets
1938 /// LowerAsmOperandForConstraint - Lower the specified operand into the Ops
1939 /// vector. If it is invalid, don't add anything to Ops.
1940 void TargetLowering::LowerAsmOperandForConstraint(SDValue Op,
1941 char ConstraintLetter,
1943 std::vector<SDValue> &Ops,
1944 SelectionDAG &DAG) const {
1945 switch (ConstraintLetter) {
1947 case 'X': // Allows any operand; labels (basic block) use this.
1948 if (Op.getOpcode() == ISD::BasicBlock) {
1953 case 'i': // Simple Integer or Relocatable Constant
1954 case 'n': // Simple Integer
1955 case 's': { // Relocatable Constant
1956 // These operands are interested in values of the form (GV+C), where C may
1957 // be folded in as an offset of GV, or it may be explicitly added. Also, it
1958 // is possible and fine if either GV or C are missing.
1959 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op);
1960 GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(Op);
1962 // If we have "(add GV, C)", pull out GV/C
1963 if (Op.getOpcode() == ISD::ADD) {
1964 C = dyn_cast<ConstantSDNode>(Op.getOperand(1));
1965 GA = dyn_cast<GlobalAddressSDNode>(Op.getOperand(0));
1966 if (C == 0 || GA == 0) {
1967 C = dyn_cast<ConstantSDNode>(Op.getOperand(0));
1968 GA = dyn_cast<GlobalAddressSDNode>(Op.getOperand(1));
1970 if (C == 0 || GA == 0)
1974 // If we find a valid operand, map to the TargetXXX version so that the
1975 // value itself doesn't get selected.
1976 if (GA) { // Either &GV or &GV+C
1977 if (ConstraintLetter != 'n') {
1978 int64_t Offs = GA->getOffset();
1979 if (C) Offs += C->getZExtValue();
1980 Ops.push_back(DAG.getTargetGlobalAddress(GA->getGlobal(),
1981 Op.getValueType(), Offs));
1985 if (C) { // just C, no GV.
1986 // Simple constants are not allowed for 's'.
1987 if (ConstraintLetter != 's') {
1988 Ops.push_back(DAG.getTargetConstant(C->getAPIntValue(),
1989 Op.getValueType()));
1998 std::vector<unsigned> TargetLowering::
1999 getRegClassForInlineAsmConstraint(const std::string &Constraint,
2001 return std::vector<unsigned>();
2005 std::pair<unsigned, const TargetRegisterClass*> TargetLowering::
2006 getRegForInlineAsmConstraint(const std::string &Constraint,
2008 if (Constraint[0] != '{')
2009 return std::pair<unsigned, const TargetRegisterClass*>(0, 0);
2010 assert(*(Constraint.end()-1) == '}' && "Not a brace enclosed constraint?");
2012 // Remove the braces from around the name.
2013 std::string RegName(Constraint.begin()+1, Constraint.end()-1);
2015 // Figure out which register class contains this reg.
2016 const TargetRegisterInfo *RI = TM.getRegisterInfo();
2017 for (TargetRegisterInfo::regclass_iterator RCI = RI->regclass_begin(),
2018 E = RI->regclass_end(); RCI != E; ++RCI) {
2019 const TargetRegisterClass *RC = *RCI;
2021 // If none of the the value types for this register class are valid, we
2022 // can't use it. For example, 64-bit reg classes on 32-bit targets.
2023 bool isLegal = false;
2024 for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end();
2026 if (isTypeLegal(*I)) {
2032 if (!isLegal) continue;
2034 for (TargetRegisterClass::iterator I = RC->begin(), E = RC->end();
2036 if (StringsEqualNoCase(RegName, RI->get(*I).AsmName))
2037 return std::make_pair(*I, RC);
2041 return std::pair<unsigned, const TargetRegisterClass*>(0, 0);
2044 //===----------------------------------------------------------------------===//
2045 // Constraint Selection.
2047 /// isMatchingInputConstraint - Return true of this is an input operand that is
2048 /// a matching constraint like "4".
2049 bool TargetLowering::AsmOperandInfo::isMatchingInputConstraint() const {
2050 assert(!ConstraintCode.empty() && "No known constraint!");
2051 return isdigit(ConstraintCode[0]);
2054 /// getMatchedOperand - If this is an input matching constraint, this method
2055 /// returns the output operand it matches.
2056 unsigned TargetLowering::AsmOperandInfo::getMatchedOperand() const {
2057 assert(!ConstraintCode.empty() && "No known constraint!");
2058 return atoi(ConstraintCode.c_str());
2062 /// getConstraintGenerality - Return an integer indicating how general CT
2064 static unsigned getConstraintGenerality(TargetLowering::ConstraintType CT) {
2066 default: assert(0 && "Unknown constraint type!");
2067 case TargetLowering::C_Other:
2068 case TargetLowering::C_Unknown:
2070 case TargetLowering::C_Register:
2072 case TargetLowering::C_RegisterClass:
2074 case TargetLowering::C_Memory:
2079 /// ChooseConstraint - If there are multiple different constraints that we
2080 /// could pick for this operand (e.g. "imr") try to pick the 'best' one.
2081 /// This is somewhat tricky: constraints fall into four classes:
2082 /// Other -> immediates and magic values
2083 /// Register -> one specific register
2084 /// RegisterClass -> a group of regs
2085 /// Memory -> memory
2086 /// Ideally, we would pick the most specific constraint possible: if we have
2087 /// something that fits into a register, we would pick it. The problem here
2088 /// is that if we have something that could either be in a register or in
2089 /// memory that use of the register could cause selection of *other*
2090 /// operands to fail: they might only succeed if we pick memory. Because of
2091 /// this the heuristic we use is:
2093 /// 1) If there is an 'other' constraint, and if the operand is valid for
2094 /// that constraint, use it. This makes us take advantage of 'i'
2095 /// constraints when available.
2096 /// 2) Otherwise, pick the most general constraint present. This prefers
2097 /// 'm' over 'r', for example.
2099 static void ChooseConstraint(TargetLowering::AsmOperandInfo &OpInfo,
2100 bool hasMemory, const TargetLowering &TLI,
2101 SDValue Op, SelectionDAG *DAG) {
2102 assert(OpInfo.Codes.size() > 1 && "Doesn't have multiple constraint options");
2103 unsigned BestIdx = 0;
2104 TargetLowering::ConstraintType BestType = TargetLowering::C_Unknown;
2105 int BestGenerality = -1;
2107 // Loop over the options, keeping track of the most general one.
2108 for (unsigned i = 0, e = OpInfo.Codes.size(); i != e; ++i) {
2109 TargetLowering::ConstraintType CType =
2110 TLI.getConstraintType(OpInfo.Codes[i]);
2112 // If this is an 'other' constraint, see if the operand is valid for it.
2113 // For example, on X86 we might have an 'rI' constraint. If the operand
2114 // is an integer in the range [0..31] we want to use I (saving a load
2115 // of a register), otherwise we must use 'r'.
2116 if (CType == TargetLowering::C_Other && Op.getNode()) {
2117 assert(OpInfo.Codes[i].size() == 1 &&
2118 "Unhandled multi-letter 'other' constraint");
2119 std::vector<SDValue> ResultOps;
2120 TLI.LowerAsmOperandForConstraint(Op, OpInfo.Codes[i][0], hasMemory,
2122 if (!ResultOps.empty()) {
2129 // This constraint letter is more general than the previous one, use it.
2130 int Generality = getConstraintGenerality(CType);
2131 if (Generality > BestGenerality) {
2134 BestGenerality = Generality;
2138 OpInfo.ConstraintCode = OpInfo.Codes[BestIdx];
2139 OpInfo.ConstraintType = BestType;
2142 /// ComputeConstraintToUse - Determines the constraint code and constraint
2143 /// type to use for the specific AsmOperandInfo, setting
2144 /// OpInfo.ConstraintCode and OpInfo.ConstraintType.
2145 void TargetLowering::ComputeConstraintToUse(AsmOperandInfo &OpInfo,
2148 SelectionDAG *DAG) const {
2149 assert(!OpInfo.Codes.empty() && "Must have at least one constraint");
2151 // Single-letter constraints ('r') are very common.
2152 if (OpInfo.Codes.size() == 1) {
2153 OpInfo.ConstraintCode = OpInfo.Codes[0];
2154 OpInfo.ConstraintType = getConstraintType(OpInfo.ConstraintCode);
2156 ChooseConstraint(OpInfo, hasMemory, *this, Op, DAG);
2159 // 'X' matches anything.
2160 if (OpInfo.ConstraintCode == "X" && OpInfo.CallOperandVal) {
2161 // Labels and constants are handled elsewhere ('X' is the only thing
2162 // that matches labels).
2163 if (isa<BasicBlock>(OpInfo.CallOperandVal) ||
2164 isa<ConstantInt>(OpInfo.CallOperandVal))
2167 // Otherwise, try to resolve it to something we know about by looking at
2168 // the actual operand type.
2169 if (const char *Repl = LowerXConstraint(OpInfo.ConstraintVT)) {
2170 OpInfo.ConstraintCode = Repl;
2171 OpInfo.ConstraintType = getConstraintType(OpInfo.ConstraintCode);
2176 //===----------------------------------------------------------------------===//
2177 // Loop Strength Reduction hooks
2178 //===----------------------------------------------------------------------===//
2180 /// isLegalAddressingMode - Return true if the addressing mode represented
2181 /// by AM is legal for this target, for a load/store of the specified type.
2182 bool TargetLowering::isLegalAddressingMode(const AddrMode &AM,
2183 const Type *Ty) const {
2184 // The default implementation of this implements a conservative RISCy, r+r and
2187 // Allows a sign-extended 16-bit immediate field.
2188 if (AM.BaseOffs <= -(1LL << 16) || AM.BaseOffs >= (1LL << 16)-1)
2191 // No global is ever allowed as a base.
2195 // Only support r+r,
2197 case 0: // "r+i" or just "i", depending on HasBaseReg.
2200 if (AM.HasBaseReg && AM.BaseOffs) // "r+r+i" is not allowed.
2202 // Otherwise we have r+r or r+i.
2205 if (AM.HasBaseReg || AM.BaseOffs) // 2*r+r or 2*r+i is not allowed.
2207 // Allow 2*r as r+r.
2214 // Magic for divide replacement
2217 int64_t m; // magic number
2218 int64_t s; // shift amount
2222 uint64_t m; // magic number
2223 int64_t a; // add indicator
2224 int64_t s; // shift amount
2227 /// magic - calculate the magic numbers required to codegen an integer sdiv as
2228 /// a sequence of multiply and shifts. Requires that the divisor not be 0, 1,
2230 static ms magic32(int32_t d) {
2232 uint32_t ad, anc, delta, q1, r1, q2, r2, t;
2233 const uint32_t two31 = 0x80000000U;
2237 t = two31 + ((uint32_t)d >> 31);
2238 anc = t - 1 - t%ad; // absolute value of nc
2239 p = 31; // initialize p
2240 q1 = two31/anc; // initialize q1 = 2p/abs(nc)
2241 r1 = two31 - q1*anc; // initialize r1 = rem(2p,abs(nc))
2242 q2 = two31/ad; // initialize q2 = 2p/abs(d)
2243 r2 = two31 - q2*ad; // initialize r2 = rem(2p,abs(d))
2246 q1 = 2*q1; // update q1 = 2p/abs(nc)
2247 r1 = 2*r1; // update r1 = rem(2p/abs(nc))
2248 if (r1 >= anc) { // must be unsigned comparison
2252 q2 = 2*q2; // update q2 = 2p/abs(d)
2253 r2 = 2*r2; // update r2 = rem(2p/abs(d))
2254 if (r2 >= ad) { // must be unsigned comparison
2259 } while (q1 < delta || (q1 == delta && r1 == 0));
2261 mag.m = (int32_t)(q2 + 1); // make sure to sign extend
2262 if (d < 0) mag.m = -mag.m; // resulting magic number
2263 mag.s = p - 32; // resulting shift
2267 /// magicu - calculate the magic numbers required to codegen an integer udiv as
2268 /// a sequence of multiply, add and shifts. Requires that the divisor not be 0.
2269 static mu magicu32(uint32_t d) {
2271 uint32_t nc, delta, q1, r1, q2, r2;
2273 magu.a = 0; // initialize "add" indicator
2275 p = 31; // initialize p
2276 q1 = 0x80000000/nc; // initialize q1 = 2p/nc
2277 r1 = 0x80000000 - q1*nc; // initialize r1 = rem(2p,nc)
2278 q2 = 0x7FFFFFFF/d; // initialize q2 = (2p-1)/d
2279 r2 = 0x7FFFFFFF - q2*d; // initialize r2 = rem((2p-1),d)
2282 if (r1 >= nc - r1 ) {
2283 q1 = 2*q1 + 1; // update q1
2284 r1 = 2*r1 - nc; // update r1
2287 q1 = 2*q1; // update q1
2288 r1 = 2*r1; // update r1
2290 if (r2 + 1 >= d - r2) {
2291 if (q2 >= 0x7FFFFFFF) magu.a = 1;
2292 q2 = 2*q2 + 1; // update q2
2293 r2 = 2*r2 + 1 - d; // update r2
2296 if (q2 >= 0x80000000) magu.a = 1;
2297 q2 = 2*q2; // update q2
2298 r2 = 2*r2 + 1; // update r2
2301 } while (p < 64 && (q1 < delta || (q1 == delta && r1 == 0)));
2302 magu.m = q2 + 1; // resulting magic number
2303 magu.s = p - 32; // resulting shift
2307 /// magic - calculate the magic numbers required to codegen an integer sdiv as
2308 /// a sequence of multiply and shifts. Requires that the divisor not be 0, 1,
2310 static ms magic64(int64_t d) {
2312 uint64_t ad, anc, delta, q1, r1, q2, r2, t;
2313 const uint64_t two63 = 9223372036854775808ULL; // 2^63
2316 ad = d >= 0 ? d : -d;
2317 t = two63 + ((uint64_t)d >> 63);
2318 anc = t - 1 - t%ad; // absolute value of nc
2319 p = 63; // initialize p
2320 q1 = two63/anc; // initialize q1 = 2p/abs(nc)
2321 r1 = two63 - q1*anc; // initialize r1 = rem(2p,abs(nc))
2322 q2 = two63/ad; // initialize q2 = 2p/abs(d)
2323 r2 = two63 - q2*ad; // initialize r2 = rem(2p,abs(d))
2326 q1 = 2*q1; // update q1 = 2p/abs(nc)
2327 r1 = 2*r1; // update r1 = rem(2p/abs(nc))
2328 if (r1 >= anc) { // must be unsigned comparison
2332 q2 = 2*q2; // update q2 = 2p/abs(d)
2333 r2 = 2*r2; // update r2 = rem(2p/abs(d))
2334 if (r2 >= ad) { // must be unsigned comparison
2339 } while (q1 < delta || (q1 == delta && r1 == 0));
2342 if (d < 0) mag.m = -mag.m; // resulting magic number
2343 mag.s = p - 64; // resulting shift
2347 /// magicu - calculate the magic numbers required to codegen an integer udiv as
2348 /// a sequence of multiply, add and shifts. Requires that the divisor not be 0.
2349 static mu magicu64(uint64_t d)
2352 uint64_t nc, delta, q1, r1, q2, r2;
2354 magu.a = 0; // initialize "add" indicator
2356 p = 63; // initialize p
2357 q1 = 0x8000000000000000ull/nc; // initialize q1 = 2p/nc
2358 r1 = 0x8000000000000000ull - q1*nc; // initialize r1 = rem(2p,nc)
2359 q2 = 0x7FFFFFFFFFFFFFFFull/d; // initialize q2 = (2p-1)/d
2360 r2 = 0x7FFFFFFFFFFFFFFFull - q2*d; // initialize r2 = rem((2p-1),d)
2363 if (r1 >= nc - r1 ) {
2364 q1 = 2*q1 + 1; // update q1
2365 r1 = 2*r1 - nc; // update r1
2368 q1 = 2*q1; // update q1
2369 r1 = 2*r1; // update r1
2371 if (r2 + 1 >= d - r2) {
2372 if (q2 >= 0x7FFFFFFFFFFFFFFFull) magu.a = 1;
2373 q2 = 2*q2 + 1; // update q2
2374 r2 = 2*r2 + 1 - d; // update r2
2377 if (q2 >= 0x8000000000000000ull) magu.a = 1;
2378 q2 = 2*q2; // update q2
2379 r2 = 2*r2 + 1; // update r2
2382 } while (p < 128 && (q1 < delta || (q1 == delta && r1 == 0)));
2383 magu.m = q2 + 1; // resulting magic number
2384 magu.s = p - 64; // resulting shift
2388 /// BuildSDIVSequence - Given an ISD::SDIV node expressing a divide by constant,
2389 /// return a DAG expression to select that will generate the same value by
2390 /// multiplying by a magic number. See:
2391 /// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
2392 SDValue TargetLowering::BuildSDIV(SDNode *N, SelectionDAG &DAG,
2393 std::vector<SDNode*>* Created) const {
2394 MVT VT = N->getValueType(0);
2396 // Check to see if we can do this.
2397 if (!isTypeLegal(VT) || (VT != MVT::i32 && VT != MVT::i64))
2398 return SDValue(); // BuildSDIV only operates on i32 or i64
2400 int64_t d = cast<ConstantSDNode>(N->getOperand(1))->getSExtValue();
2401 ms magics = (VT == MVT::i32) ? magic32(d) : magic64(d);
2403 // Multiply the numerator (operand 0) by the magic value
2405 if (isOperationLegal(ISD::MULHS, VT))
2406 Q = DAG.getNode(ISD::MULHS, VT, N->getOperand(0),
2407 DAG.getConstant(magics.m, VT));
2408 else if (isOperationLegal(ISD::SMUL_LOHI, VT))
2409 Q = SDValue(DAG.getNode(ISD::SMUL_LOHI, DAG.getVTList(VT, VT),
2411 DAG.getConstant(magics.m, VT)).getNode(), 1);
2413 return SDValue(); // No mulhs or equvialent
2414 // If d > 0 and m < 0, add the numerator
2415 if (d > 0 && magics.m < 0) {
2416 Q = DAG.getNode(ISD::ADD, VT, Q, N->getOperand(0));
2418 Created->push_back(Q.getNode());
2420 // If d < 0 and m > 0, subtract the numerator.
2421 if (d < 0 && magics.m > 0) {
2422 Q = DAG.getNode(ISD::SUB, VT, Q, N->getOperand(0));
2424 Created->push_back(Q.getNode());
2426 // Shift right algebraic if shift value is nonzero
2428 Q = DAG.getNode(ISD::SRA, VT, Q,
2429 DAG.getConstant(magics.s, getShiftAmountTy()));
2431 Created->push_back(Q.getNode());
2433 // Extract the sign bit and add it to the quotient
2435 DAG.getNode(ISD::SRL, VT, Q, DAG.getConstant(VT.getSizeInBits()-1,
2436 getShiftAmountTy()));
2438 Created->push_back(T.getNode());
2439 return DAG.getNode(ISD::ADD, VT, Q, T);
2442 /// BuildUDIVSequence - Given an ISD::UDIV node expressing a divide by constant,
2443 /// return a DAG expression to select that will generate the same value by
2444 /// multiplying by a magic number. See:
2445 /// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
2446 SDValue TargetLowering::BuildUDIV(SDNode *N, SelectionDAG &DAG,
2447 std::vector<SDNode*>* Created) const {
2448 MVT VT = N->getValueType(0);
2450 // Check to see if we can do this.
2451 if (!isTypeLegal(VT) || (VT != MVT::i32 && VT != MVT::i64))
2452 return SDValue(); // BuildUDIV only operates on i32 or i64
2454 uint64_t d = cast<ConstantSDNode>(N->getOperand(1))->getZExtValue();
2455 mu magics = (VT == MVT::i32) ? magicu32(d) : magicu64(d);
2457 // Multiply the numerator (operand 0) by the magic value
2459 if (isOperationLegal(ISD::MULHU, VT))
2460 Q = DAG.getNode(ISD::MULHU, VT, N->getOperand(0),
2461 DAG.getConstant(magics.m, VT));
2462 else if (isOperationLegal(ISD::UMUL_LOHI, VT))
2463 Q = SDValue(DAG.getNode(ISD::UMUL_LOHI, DAG.getVTList(VT, VT),
2465 DAG.getConstant(magics.m, VT)).getNode(), 1);
2467 return SDValue(); // No mulhu or equvialent
2469 Created->push_back(Q.getNode());
2471 if (magics.a == 0) {
2472 return DAG.getNode(ISD::SRL, VT, Q,
2473 DAG.getConstant(magics.s, getShiftAmountTy()));
2475 SDValue NPQ = DAG.getNode(ISD::SUB, VT, N->getOperand(0), Q);
2477 Created->push_back(NPQ.getNode());
2478 NPQ = DAG.getNode(ISD::SRL, VT, NPQ,
2479 DAG.getConstant(1, getShiftAmountTy()));
2481 Created->push_back(NPQ.getNode());
2482 NPQ = DAG.getNode(ISD::ADD, VT, NPQ, Q);
2484 Created->push_back(NPQ.getNode());
2485 return DAG.getNode(ISD::SRL, VT, NPQ,
2486 DAG.getConstant(magics.s-1, getShiftAmountTy()));