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/TargetLowering.h"
15 #include "llvm/MC/MCAsmInfo.h"
16 #include "llvm/MC/MCExpr.h"
17 #include "llvm/Target/TargetData.h"
18 #include "llvm/Target/TargetLoweringObjectFile.h"
19 #include "llvm/Target/TargetMachine.h"
20 #include "llvm/Target/TargetRegisterInfo.h"
21 #include "llvm/Target/TargetSubtarget.h"
22 #include "llvm/GlobalVariable.h"
23 #include "llvm/DerivedTypes.h"
24 #include "llvm/CodeGen/MachineFrameInfo.h"
25 #include "llvm/CodeGen/MachineJumpTableInfo.h"
26 #include "llvm/CodeGen/MachineFunction.h"
27 #include "llvm/CodeGen/SelectionDAG.h"
28 #include "llvm/ADT/STLExtras.h"
29 #include "llvm/Support/ErrorHandling.h"
30 #include "llvm/Support/MathExtras.h"
34 TLSModel::Model getTLSModel(const GlobalValue *GV, Reloc::Model reloc) {
35 bool isLocal = GV->hasLocalLinkage();
36 bool isDeclaration = GV->isDeclaration();
37 // FIXME: what should we do for protected and internal visibility?
38 // For variables, is internal different from hidden?
39 bool isHidden = GV->hasHiddenVisibility();
41 if (reloc == Reloc::PIC_) {
42 if (isLocal || isHidden)
43 return TLSModel::LocalDynamic;
45 return TLSModel::GeneralDynamic;
47 if (!isDeclaration || isHidden)
48 return TLSModel::LocalExec;
50 return TLSModel::InitialExec;
55 /// InitLibcallNames - Set default libcall names.
57 static void InitLibcallNames(const char **Names) {
58 Names[RTLIB::SHL_I16] = "__ashlhi3";
59 Names[RTLIB::SHL_I32] = "__ashlsi3";
60 Names[RTLIB::SHL_I64] = "__ashldi3";
61 Names[RTLIB::SHL_I128] = "__ashlti3";
62 Names[RTLIB::SRL_I16] = "__lshrhi3";
63 Names[RTLIB::SRL_I32] = "__lshrsi3";
64 Names[RTLIB::SRL_I64] = "__lshrdi3";
65 Names[RTLIB::SRL_I128] = "__lshrti3";
66 Names[RTLIB::SRA_I16] = "__ashrhi3";
67 Names[RTLIB::SRA_I32] = "__ashrsi3";
68 Names[RTLIB::SRA_I64] = "__ashrdi3";
69 Names[RTLIB::SRA_I128] = "__ashrti3";
70 Names[RTLIB::MUL_I8] = "__mulqi3";
71 Names[RTLIB::MUL_I16] = "__mulhi3";
72 Names[RTLIB::MUL_I32] = "__mulsi3";
73 Names[RTLIB::MUL_I64] = "__muldi3";
74 Names[RTLIB::MUL_I128] = "__multi3";
75 Names[RTLIB::SDIV_I8] = "__divqi3";
76 Names[RTLIB::SDIV_I16] = "__divhi3";
77 Names[RTLIB::SDIV_I32] = "__divsi3";
78 Names[RTLIB::SDIV_I64] = "__divdi3";
79 Names[RTLIB::SDIV_I128] = "__divti3";
80 Names[RTLIB::UDIV_I8] = "__udivqi3";
81 Names[RTLIB::UDIV_I16] = "__udivhi3";
82 Names[RTLIB::UDIV_I32] = "__udivsi3";
83 Names[RTLIB::UDIV_I64] = "__udivdi3";
84 Names[RTLIB::UDIV_I128] = "__udivti3";
85 Names[RTLIB::SREM_I8] = "__modqi3";
86 Names[RTLIB::SREM_I16] = "__modhi3";
87 Names[RTLIB::SREM_I32] = "__modsi3";
88 Names[RTLIB::SREM_I64] = "__moddi3";
89 Names[RTLIB::SREM_I128] = "__modti3";
90 Names[RTLIB::UREM_I8] = "__umodqi3";
91 Names[RTLIB::UREM_I16] = "__umodhi3";
92 Names[RTLIB::UREM_I32] = "__umodsi3";
93 Names[RTLIB::UREM_I64] = "__umoddi3";
94 Names[RTLIB::UREM_I128] = "__umodti3";
95 Names[RTLIB::NEG_I32] = "__negsi2";
96 Names[RTLIB::NEG_I64] = "__negdi2";
97 Names[RTLIB::ADD_F32] = "__addsf3";
98 Names[RTLIB::ADD_F64] = "__adddf3";
99 Names[RTLIB::ADD_F80] = "__addxf3";
100 Names[RTLIB::ADD_PPCF128] = "__gcc_qadd";
101 Names[RTLIB::SUB_F32] = "__subsf3";
102 Names[RTLIB::SUB_F64] = "__subdf3";
103 Names[RTLIB::SUB_F80] = "__subxf3";
104 Names[RTLIB::SUB_PPCF128] = "__gcc_qsub";
105 Names[RTLIB::MUL_F32] = "__mulsf3";
106 Names[RTLIB::MUL_F64] = "__muldf3";
107 Names[RTLIB::MUL_F80] = "__mulxf3";
108 Names[RTLIB::MUL_PPCF128] = "__gcc_qmul";
109 Names[RTLIB::DIV_F32] = "__divsf3";
110 Names[RTLIB::DIV_F64] = "__divdf3";
111 Names[RTLIB::DIV_F80] = "__divxf3";
112 Names[RTLIB::DIV_PPCF128] = "__gcc_qdiv";
113 Names[RTLIB::REM_F32] = "fmodf";
114 Names[RTLIB::REM_F64] = "fmod";
115 Names[RTLIB::REM_F80] = "fmodl";
116 Names[RTLIB::REM_PPCF128] = "fmodl";
117 Names[RTLIB::POWI_F32] = "__powisf2";
118 Names[RTLIB::POWI_F64] = "__powidf2";
119 Names[RTLIB::POWI_F80] = "__powixf2";
120 Names[RTLIB::POWI_PPCF128] = "__powitf2";
121 Names[RTLIB::SQRT_F32] = "sqrtf";
122 Names[RTLIB::SQRT_F64] = "sqrt";
123 Names[RTLIB::SQRT_F80] = "sqrtl";
124 Names[RTLIB::SQRT_PPCF128] = "sqrtl";
125 Names[RTLIB::LOG_F32] = "logf";
126 Names[RTLIB::LOG_F64] = "log";
127 Names[RTLIB::LOG_F80] = "logl";
128 Names[RTLIB::LOG_PPCF128] = "logl";
129 Names[RTLIB::LOG2_F32] = "log2f";
130 Names[RTLIB::LOG2_F64] = "log2";
131 Names[RTLIB::LOG2_F80] = "log2l";
132 Names[RTLIB::LOG2_PPCF128] = "log2l";
133 Names[RTLIB::LOG10_F32] = "log10f";
134 Names[RTLIB::LOG10_F64] = "log10";
135 Names[RTLIB::LOG10_F80] = "log10l";
136 Names[RTLIB::LOG10_PPCF128] = "log10l";
137 Names[RTLIB::EXP_F32] = "expf";
138 Names[RTLIB::EXP_F64] = "exp";
139 Names[RTLIB::EXP_F80] = "expl";
140 Names[RTLIB::EXP_PPCF128] = "expl";
141 Names[RTLIB::EXP2_F32] = "exp2f";
142 Names[RTLIB::EXP2_F64] = "exp2";
143 Names[RTLIB::EXP2_F80] = "exp2l";
144 Names[RTLIB::EXP2_PPCF128] = "exp2l";
145 Names[RTLIB::SIN_F32] = "sinf";
146 Names[RTLIB::SIN_F64] = "sin";
147 Names[RTLIB::SIN_F80] = "sinl";
148 Names[RTLIB::SIN_PPCF128] = "sinl";
149 Names[RTLIB::COS_F32] = "cosf";
150 Names[RTLIB::COS_F64] = "cos";
151 Names[RTLIB::COS_F80] = "cosl";
152 Names[RTLIB::COS_PPCF128] = "cosl";
153 Names[RTLIB::POW_F32] = "powf";
154 Names[RTLIB::POW_F64] = "pow";
155 Names[RTLIB::POW_F80] = "powl";
156 Names[RTLIB::POW_PPCF128] = "powl";
157 Names[RTLIB::CEIL_F32] = "ceilf";
158 Names[RTLIB::CEIL_F64] = "ceil";
159 Names[RTLIB::CEIL_F80] = "ceill";
160 Names[RTLIB::CEIL_PPCF128] = "ceill";
161 Names[RTLIB::TRUNC_F32] = "truncf";
162 Names[RTLIB::TRUNC_F64] = "trunc";
163 Names[RTLIB::TRUNC_F80] = "truncl";
164 Names[RTLIB::TRUNC_PPCF128] = "truncl";
165 Names[RTLIB::RINT_F32] = "rintf";
166 Names[RTLIB::RINT_F64] = "rint";
167 Names[RTLIB::RINT_F80] = "rintl";
168 Names[RTLIB::RINT_PPCF128] = "rintl";
169 Names[RTLIB::NEARBYINT_F32] = "nearbyintf";
170 Names[RTLIB::NEARBYINT_F64] = "nearbyint";
171 Names[RTLIB::NEARBYINT_F80] = "nearbyintl";
172 Names[RTLIB::NEARBYINT_PPCF128] = "nearbyintl";
173 Names[RTLIB::FLOOR_F32] = "floorf";
174 Names[RTLIB::FLOOR_F64] = "floor";
175 Names[RTLIB::FLOOR_F80] = "floorl";
176 Names[RTLIB::FLOOR_PPCF128] = "floorl";
177 Names[RTLIB::COPYSIGN_F32] = "copysignf";
178 Names[RTLIB::COPYSIGN_F64] = "copysign";
179 Names[RTLIB::COPYSIGN_F80] = "copysignl";
180 Names[RTLIB::COPYSIGN_PPCF128] = "copysignl";
181 Names[RTLIB::FPEXT_F32_F64] = "__extendsfdf2";
182 Names[RTLIB::FPEXT_F16_F32] = "__gnu_h2f_ieee";
183 Names[RTLIB::FPROUND_F32_F16] = "__gnu_f2h_ieee";
184 Names[RTLIB::FPROUND_F64_F32] = "__truncdfsf2";
185 Names[RTLIB::FPROUND_F80_F32] = "__truncxfsf2";
186 Names[RTLIB::FPROUND_PPCF128_F32] = "__trunctfsf2";
187 Names[RTLIB::FPROUND_F80_F64] = "__truncxfdf2";
188 Names[RTLIB::FPROUND_PPCF128_F64] = "__trunctfdf2";
189 Names[RTLIB::FPTOSINT_F32_I8] = "__fixsfqi";
190 Names[RTLIB::FPTOSINT_F32_I16] = "__fixsfhi";
191 Names[RTLIB::FPTOSINT_F32_I32] = "__fixsfsi";
192 Names[RTLIB::FPTOSINT_F32_I64] = "__fixsfdi";
193 Names[RTLIB::FPTOSINT_F32_I128] = "__fixsfti";
194 Names[RTLIB::FPTOSINT_F64_I8] = "__fixdfqi";
195 Names[RTLIB::FPTOSINT_F64_I16] = "__fixdfhi";
196 Names[RTLIB::FPTOSINT_F64_I32] = "__fixdfsi";
197 Names[RTLIB::FPTOSINT_F64_I64] = "__fixdfdi";
198 Names[RTLIB::FPTOSINT_F64_I128] = "__fixdfti";
199 Names[RTLIB::FPTOSINT_F80_I32] = "__fixxfsi";
200 Names[RTLIB::FPTOSINT_F80_I64] = "__fixxfdi";
201 Names[RTLIB::FPTOSINT_F80_I128] = "__fixxfti";
202 Names[RTLIB::FPTOSINT_PPCF128_I32] = "__fixtfsi";
203 Names[RTLIB::FPTOSINT_PPCF128_I64] = "__fixtfdi";
204 Names[RTLIB::FPTOSINT_PPCF128_I128] = "__fixtfti";
205 Names[RTLIB::FPTOUINT_F32_I8] = "__fixunssfqi";
206 Names[RTLIB::FPTOUINT_F32_I16] = "__fixunssfhi";
207 Names[RTLIB::FPTOUINT_F32_I32] = "__fixunssfsi";
208 Names[RTLIB::FPTOUINT_F32_I64] = "__fixunssfdi";
209 Names[RTLIB::FPTOUINT_F32_I128] = "__fixunssfti";
210 Names[RTLIB::FPTOUINT_F64_I8] = "__fixunsdfqi";
211 Names[RTLIB::FPTOUINT_F64_I16] = "__fixunsdfhi";
212 Names[RTLIB::FPTOUINT_F64_I32] = "__fixunsdfsi";
213 Names[RTLIB::FPTOUINT_F64_I64] = "__fixunsdfdi";
214 Names[RTLIB::FPTOUINT_F64_I128] = "__fixunsdfti";
215 Names[RTLIB::FPTOUINT_F80_I32] = "__fixunsxfsi";
216 Names[RTLIB::FPTOUINT_F80_I64] = "__fixunsxfdi";
217 Names[RTLIB::FPTOUINT_F80_I128] = "__fixunsxfti";
218 Names[RTLIB::FPTOUINT_PPCF128_I32] = "__fixunstfsi";
219 Names[RTLIB::FPTOUINT_PPCF128_I64] = "__fixunstfdi";
220 Names[RTLIB::FPTOUINT_PPCF128_I128] = "__fixunstfti";
221 Names[RTLIB::SINTTOFP_I32_F32] = "__floatsisf";
222 Names[RTLIB::SINTTOFP_I32_F64] = "__floatsidf";
223 Names[RTLIB::SINTTOFP_I32_F80] = "__floatsixf";
224 Names[RTLIB::SINTTOFP_I32_PPCF128] = "__floatsitf";
225 Names[RTLIB::SINTTOFP_I64_F32] = "__floatdisf";
226 Names[RTLIB::SINTTOFP_I64_F64] = "__floatdidf";
227 Names[RTLIB::SINTTOFP_I64_F80] = "__floatdixf";
228 Names[RTLIB::SINTTOFP_I64_PPCF128] = "__floatditf";
229 Names[RTLIB::SINTTOFP_I128_F32] = "__floattisf";
230 Names[RTLIB::SINTTOFP_I128_F64] = "__floattidf";
231 Names[RTLIB::SINTTOFP_I128_F80] = "__floattixf";
232 Names[RTLIB::SINTTOFP_I128_PPCF128] = "__floattitf";
233 Names[RTLIB::UINTTOFP_I32_F32] = "__floatunsisf";
234 Names[RTLIB::UINTTOFP_I32_F64] = "__floatunsidf";
235 Names[RTLIB::UINTTOFP_I32_F80] = "__floatunsixf";
236 Names[RTLIB::UINTTOFP_I32_PPCF128] = "__floatunsitf";
237 Names[RTLIB::UINTTOFP_I64_F32] = "__floatundisf";
238 Names[RTLIB::UINTTOFP_I64_F64] = "__floatundidf";
239 Names[RTLIB::UINTTOFP_I64_F80] = "__floatundixf";
240 Names[RTLIB::UINTTOFP_I64_PPCF128] = "__floatunditf";
241 Names[RTLIB::UINTTOFP_I128_F32] = "__floatuntisf";
242 Names[RTLIB::UINTTOFP_I128_F64] = "__floatuntidf";
243 Names[RTLIB::UINTTOFP_I128_F80] = "__floatuntixf";
244 Names[RTLIB::UINTTOFP_I128_PPCF128] = "__floatuntitf";
245 Names[RTLIB::OEQ_F32] = "__eqsf2";
246 Names[RTLIB::OEQ_F64] = "__eqdf2";
247 Names[RTLIB::UNE_F32] = "__nesf2";
248 Names[RTLIB::UNE_F64] = "__nedf2";
249 Names[RTLIB::OGE_F32] = "__gesf2";
250 Names[RTLIB::OGE_F64] = "__gedf2";
251 Names[RTLIB::OLT_F32] = "__ltsf2";
252 Names[RTLIB::OLT_F64] = "__ltdf2";
253 Names[RTLIB::OLE_F32] = "__lesf2";
254 Names[RTLIB::OLE_F64] = "__ledf2";
255 Names[RTLIB::OGT_F32] = "__gtsf2";
256 Names[RTLIB::OGT_F64] = "__gtdf2";
257 Names[RTLIB::UO_F32] = "__unordsf2";
258 Names[RTLIB::UO_F64] = "__unorddf2";
259 Names[RTLIB::O_F32] = "__unordsf2";
260 Names[RTLIB::O_F64] = "__unorddf2";
261 Names[RTLIB::MEMCPY] = "memcpy";
262 Names[RTLIB::MEMMOVE] = "memmove";
263 Names[RTLIB::MEMSET] = "memset";
264 Names[RTLIB::UNWIND_RESUME] = "_Unwind_Resume";
267 /// InitLibcallCallingConvs - Set default libcall CallingConvs.
269 static void InitLibcallCallingConvs(CallingConv::ID *CCs) {
270 for (int i = 0; i < RTLIB::UNKNOWN_LIBCALL; ++i) {
271 CCs[i] = CallingConv::C;
275 /// getFPEXT - Return the FPEXT_*_* value for the given types, or
276 /// UNKNOWN_LIBCALL if there is none.
277 RTLIB::Libcall RTLIB::getFPEXT(EVT OpVT, EVT RetVT) {
278 if (OpVT == MVT::f32) {
279 if (RetVT == MVT::f64)
280 return FPEXT_F32_F64;
283 return UNKNOWN_LIBCALL;
286 /// getFPROUND - Return the FPROUND_*_* value for the given types, or
287 /// UNKNOWN_LIBCALL if there is none.
288 RTLIB::Libcall RTLIB::getFPROUND(EVT OpVT, EVT RetVT) {
289 if (RetVT == MVT::f32) {
290 if (OpVT == MVT::f64)
291 return FPROUND_F64_F32;
292 if (OpVT == MVT::f80)
293 return FPROUND_F80_F32;
294 if (OpVT == MVT::ppcf128)
295 return FPROUND_PPCF128_F32;
296 } else if (RetVT == MVT::f64) {
297 if (OpVT == MVT::f80)
298 return FPROUND_F80_F64;
299 if (OpVT == MVT::ppcf128)
300 return FPROUND_PPCF128_F64;
303 return UNKNOWN_LIBCALL;
306 /// getFPTOSINT - Return the FPTOSINT_*_* value for the given types, or
307 /// UNKNOWN_LIBCALL if there is none.
308 RTLIB::Libcall RTLIB::getFPTOSINT(EVT OpVT, EVT RetVT) {
309 if (OpVT == MVT::f32) {
310 if (RetVT == MVT::i8)
311 return FPTOSINT_F32_I8;
312 if (RetVT == MVT::i16)
313 return FPTOSINT_F32_I16;
314 if (RetVT == MVT::i32)
315 return FPTOSINT_F32_I32;
316 if (RetVT == MVT::i64)
317 return FPTOSINT_F32_I64;
318 if (RetVT == MVT::i128)
319 return FPTOSINT_F32_I128;
320 } else if (OpVT == MVT::f64) {
321 if (RetVT == MVT::i8)
322 return FPTOSINT_F64_I8;
323 if (RetVT == MVT::i16)
324 return FPTOSINT_F64_I16;
325 if (RetVT == MVT::i32)
326 return FPTOSINT_F64_I32;
327 if (RetVT == MVT::i64)
328 return FPTOSINT_F64_I64;
329 if (RetVT == MVT::i128)
330 return FPTOSINT_F64_I128;
331 } else if (OpVT == MVT::f80) {
332 if (RetVT == MVT::i32)
333 return FPTOSINT_F80_I32;
334 if (RetVT == MVT::i64)
335 return FPTOSINT_F80_I64;
336 if (RetVT == MVT::i128)
337 return FPTOSINT_F80_I128;
338 } else if (OpVT == MVT::ppcf128) {
339 if (RetVT == MVT::i32)
340 return FPTOSINT_PPCF128_I32;
341 if (RetVT == MVT::i64)
342 return FPTOSINT_PPCF128_I64;
343 if (RetVT == MVT::i128)
344 return FPTOSINT_PPCF128_I128;
346 return UNKNOWN_LIBCALL;
349 /// getFPTOUINT - Return the FPTOUINT_*_* value for the given types, or
350 /// UNKNOWN_LIBCALL if there is none.
351 RTLIB::Libcall RTLIB::getFPTOUINT(EVT OpVT, EVT RetVT) {
352 if (OpVT == MVT::f32) {
353 if (RetVT == MVT::i8)
354 return FPTOUINT_F32_I8;
355 if (RetVT == MVT::i16)
356 return FPTOUINT_F32_I16;
357 if (RetVT == MVT::i32)
358 return FPTOUINT_F32_I32;
359 if (RetVT == MVT::i64)
360 return FPTOUINT_F32_I64;
361 if (RetVT == MVT::i128)
362 return FPTOUINT_F32_I128;
363 } else if (OpVT == MVT::f64) {
364 if (RetVT == MVT::i8)
365 return FPTOUINT_F64_I8;
366 if (RetVT == MVT::i16)
367 return FPTOUINT_F64_I16;
368 if (RetVT == MVT::i32)
369 return FPTOUINT_F64_I32;
370 if (RetVT == MVT::i64)
371 return FPTOUINT_F64_I64;
372 if (RetVT == MVT::i128)
373 return FPTOUINT_F64_I128;
374 } else if (OpVT == MVT::f80) {
375 if (RetVT == MVT::i32)
376 return FPTOUINT_F80_I32;
377 if (RetVT == MVT::i64)
378 return FPTOUINT_F80_I64;
379 if (RetVT == MVT::i128)
380 return FPTOUINT_F80_I128;
381 } else if (OpVT == MVT::ppcf128) {
382 if (RetVT == MVT::i32)
383 return FPTOUINT_PPCF128_I32;
384 if (RetVT == MVT::i64)
385 return FPTOUINT_PPCF128_I64;
386 if (RetVT == MVT::i128)
387 return FPTOUINT_PPCF128_I128;
389 return UNKNOWN_LIBCALL;
392 /// getSINTTOFP - Return the SINTTOFP_*_* value for the given types, or
393 /// UNKNOWN_LIBCALL if there is none.
394 RTLIB::Libcall RTLIB::getSINTTOFP(EVT OpVT, EVT RetVT) {
395 if (OpVT == MVT::i32) {
396 if (RetVT == MVT::f32)
397 return SINTTOFP_I32_F32;
398 else if (RetVT == MVT::f64)
399 return SINTTOFP_I32_F64;
400 else if (RetVT == MVT::f80)
401 return SINTTOFP_I32_F80;
402 else if (RetVT == MVT::ppcf128)
403 return SINTTOFP_I32_PPCF128;
404 } else if (OpVT == MVT::i64) {
405 if (RetVT == MVT::f32)
406 return SINTTOFP_I64_F32;
407 else if (RetVT == MVT::f64)
408 return SINTTOFP_I64_F64;
409 else if (RetVT == MVT::f80)
410 return SINTTOFP_I64_F80;
411 else if (RetVT == MVT::ppcf128)
412 return SINTTOFP_I64_PPCF128;
413 } else if (OpVT == MVT::i128) {
414 if (RetVT == MVT::f32)
415 return SINTTOFP_I128_F32;
416 else if (RetVT == MVT::f64)
417 return SINTTOFP_I128_F64;
418 else if (RetVT == MVT::f80)
419 return SINTTOFP_I128_F80;
420 else if (RetVT == MVT::ppcf128)
421 return SINTTOFP_I128_PPCF128;
423 return UNKNOWN_LIBCALL;
426 /// getUINTTOFP - Return the UINTTOFP_*_* value for the given types, or
427 /// UNKNOWN_LIBCALL if there is none.
428 RTLIB::Libcall RTLIB::getUINTTOFP(EVT OpVT, EVT RetVT) {
429 if (OpVT == MVT::i32) {
430 if (RetVT == MVT::f32)
431 return UINTTOFP_I32_F32;
432 else if (RetVT == MVT::f64)
433 return UINTTOFP_I32_F64;
434 else if (RetVT == MVT::f80)
435 return UINTTOFP_I32_F80;
436 else if (RetVT == MVT::ppcf128)
437 return UINTTOFP_I32_PPCF128;
438 } else if (OpVT == MVT::i64) {
439 if (RetVT == MVT::f32)
440 return UINTTOFP_I64_F32;
441 else if (RetVT == MVT::f64)
442 return UINTTOFP_I64_F64;
443 else if (RetVT == MVT::f80)
444 return UINTTOFP_I64_F80;
445 else if (RetVT == MVT::ppcf128)
446 return UINTTOFP_I64_PPCF128;
447 } else if (OpVT == MVT::i128) {
448 if (RetVT == MVT::f32)
449 return UINTTOFP_I128_F32;
450 else if (RetVT == MVT::f64)
451 return UINTTOFP_I128_F64;
452 else if (RetVT == MVT::f80)
453 return UINTTOFP_I128_F80;
454 else if (RetVT == MVT::ppcf128)
455 return UINTTOFP_I128_PPCF128;
457 return UNKNOWN_LIBCALL;
460 /// InitCmpLibcallCCs - Set default comparison libcall CC.
462 static void InitCmpLibcallCCs(ISD::CondCode *CCs) {
463 memset(CCs, ISD::SETCC_INVALID, sizeof(ISD::CondCode)*RTLIB::UNKNOWN_LIBCALL);
464 CCs[RTLIB::OEQ_F32] = ISD::SETEQ;
465 CCs[RTLIB::OEQ_F64] = ISD::SETEQ;
466 CCs[RTLIB::UNE_F32] = ISD::SETNE;
467 CCs[RTLIB::UNE_F64] = ISD::SETNE;
468 CCs[RTLIB::OGE_F32] = ISD::SETGE;
469 CCs[RTLIB::OGE_F64] = ISD::SETGE;
470 CCs[RTLIB::OLT_F32] = ISD::SETLT;
471 CCs[RTLIB::OLT_F64] = ISD::SETLT;
472 CCs[RTLIB::OLE_F32] = ISD::SETLE;
473 CCs[RTLIB::OLE_F64] = ISD::SETLE;
474 CCs[RTLIB::OGT_F32] = ISD::SETGT;
475 CCs[RTLIB::OGT_F64] = ISD::SETGT;
476 CCs[RTLIB::UO_F32] = ISD::SETNE;
477 CCs[RTLIB::UO_F64] = ISD::SETNE;
478 CCs[RTLIB::O_F32] = ISD::SETEQ;
479 CCs[RTLIB::O_F64] = ISD::SETEQ;
482 /// NOTE: The constructor takes ownership of TLOF.
483 TargetLowering::TargetLowering(TargetMachine &tm,TargetLoweringObjectFile *tlof)
484 : TM(tm), TD(TM.getTargetData()), TLOF(*tlof) {
485 // All operations default to being supported.
486 memset(OpActions, 0, sizeof(OpActions));
487 memset(LoadExtActions, 0, sizeof(LoadExtActions));
488 memset(TruncStoreActions, 0, sizeof(TruncStoreActions));
489 memset(IndexedModeActions, 0, sizeof(IndexedModeActions));
490 memset(CondCodeActions, 0, sizeof(CondCodeActions));
492 // Set default actions for various operations.
493 for (unsigned VT = 0; VT != (unsigned)MVT::LAST_VALUETYPE; ++VT) {
494 // Default all indexed load / store to expand.
495 for (unsigned IM = (unsigned)ISD::PRE_INC;
496 IM != (unsigned)ISD::LAST_INDEXED_MODE; ++IM) {
497 setIndexedLoadAction(IM, (MVT::SimpleValueType)VT, Expand);
498 setIndexedStoreAction(IM, (MVT::SimpleValueType)VT, Expand);
501 // These operations default to expand.
502 setOperationAction(ISD::FGETSIGN, (MVT::SimpleValueType)VT, Expand);
503 setOperationAction(ISD::CONCAT_VECTORS, (MVT::SimpleValueType)VT, Expand);
506 // Most targets ignore the @llvm.prefetch intrinsic.
507 setOperationAction(ISD::PREFETCH, MVT::Other, Expand);
509 // ConstantFP nodes default to expand. Targets can either change this to
510 // Legal, in which case all fp constants are legal, or use isFPImmLegal()
511 // to optimize expansions for certain constants.
512 setOperationAction(ISD::ConstantFP, MVT::f32, Expand);
513 setOperationAction(ISD::ConstantFP, MVT::f64, Expand);
514 setOperationAction(ISD::ConstantFP, MVT::f80, Expand);
516 // These library functions default to expand.
517 setOperationAction(ISD::FLOG , MVT::f64, Expand);
518 setOperationAction(ISD::FLOG2, MVT::f64, Expand);
519 setOperationAction(ISD::FLOG10,MVT::f64, Expand);
520 setOperationAction(ISD::FEXP , MVT::f64, Expand);
521 setOperationAction(ISD::FEXP2, MVT::f64, Expand);
522 setOperationAction(ISD::FLOG , MVT::f32, Expand);
523 setOperationAction(ISD::FLOG2, MVT::f32, Expand);
524 setOperationAction(ISD::FLOG10,MVT::f32, Expand);
525 setOperationAction(ISD::FEXP , MVT::f32, Expand);
526 setOperationAction(ISD::FEXP2, MVT::f32, Expand);
528 // Default ISD::TRAP to expand (which turns it into abort).
529 setOperationAction(ISD::TRAP, MVT::Other, Expand);
531 IsLittleEndian = TD->isLittleEndian();
532 ShiftAmountTy = PointerTy = MVT::getIntegerVT(8*TD->getPointerSize());
533 memset(RegClassForVT, 0,MVT::LAST_VALUETYPE*sizeof(TargetRegisterClass*));
534 memset(TargetDAGCombineArray, 0, array_lengthof(TargetDAGCombineArray));
535 maxStoresPerMemset = maxStoresPerMemcpy = maxStoresPerMemmove = 8;
536 benefitFromCodePlacementOpt = false;
537 UseUnderscoreSetJmp = false;
538 UseUnderscoreLongJmp = false;
539 SelectIsExpensive = false;
540 IntDivIsCheap = false;
541 Pow2DivIsCheap = false;
542 StackPointerRegisterToSaveRestore = 0;
543 ExceptionPointerRegister = 0;
544 ExceptionSelectorRegister = 0;
545 BooleanContents = UndefinedBooleanContent;
546 SchedPreferenceInfo = SchedulingForLatency;
548 JumpBufAlignment = 0;
549 IfCvtBlockSizeLimit = 2;
550 IfCvtDupBlockSizeLimit = 0;
551 PrefLoopAlignment = 0;
553 InitLibcallNames(LibcallRoutineNames);
554 InitCmpLibcallCCs(CmpLibcallCCs);
555 InitLibcallCallingConvs(LibcallCallingConvs);
558 TargetLowering::~TargetLowering() {
562 /// canOpTrap - Returns true if the operation can trap for the value type.
563 /// VT must be a legal type.
564 bool TargetLowering::canOpTrap(unsigned Op, EVT VT) const {
565 assert(isTypeLegal(VT));
580 static unsigned getVectorTypeBreakdownMVT(MVT VT, MVT &IntermediateVT,
581 unsigned &NumIntermediates,
583 TargetLowering* TLI) {
584 // Figure out the right, legal destination reg to copy into.
585 unsigned NumElts = VT.getVectorNumElements();
586 MVT EltTy = VT.getVectorElementType();
588 unsigned NumVectorRegs = 1;
590 // FIXME: We don't support non-power-of-2-sized vectors for now. Ideally we
591 // could break down into LHS/RHS like LegalizeDAG does.
592 if (!isPowerOf2_32(NumElts)) {
593 NumVectorRegs = NumElts;
597 // Divide the input until we get to a supported size. This will always
598 // end with a scalar if the target doesn't support vectors.
599 while (NumElts > 1 && !TLI->isTypeLegal(MVT::getVectorVT(EltTy, NumElts))) {
604 NumIntermediates = NumVectorRegs;
606 MVT NewVT = MVT::getVectorVT(EltTy, NumElts);
607 if (!TLI->isTypeLegal(NewVT))
609 IntermediateVT = NewVT;
611 EVT DestVT = TLI->getRegisterType(NewVT);
613 if (EVT(DestVT).bitsLT(NewVT)) {
614 // Value is expanded, e.g. i64 -> i16.
615 return NumVectorRegs*(NewVT.getSizeInBits()/DestVT.getSizeInBits());
617 // Otherwise, promotion or legal types use the same number of registers as
618 // the vector decimated to the appropriate level.
619 return NumVectorRegs;
625 /// computeRegisterProperties - Once all of the register classes are added,
626 /// this allows us to compute derived properties we expose.
627 void TargetLowering::computeRegisterProperties() {
628 assert(MVT::LAST_VALUETYPE <= MVT::MAX_ALLOWED_VALUETYPE &&
629 "Too many value types for ValueTypeActions to hold!");
631 // Everything defaults to needing one register.
632 for (unsigned i = 0; i != MVT::LAST_VALUETYPE; ++i) {
633 NumRegistersForVT[i] = 1;
634 RegisterTypeForVT[i] = TransformToType[i] = (MVT::SimpleValueType)i;
636 // ...except isVoid, which doesn't need any registers.
637 NumRegistersForVT[MVT::isVoid] = 0;
639 // Find the largest integer register class.
640 unsigned LargestIntReg = MVT::LAST_INTEGER_VALUETYPE;
641 for (; RegClassForVT[LargestIntReg] == 0; --LargestIntReg)
642 assert(LargestIntReg != MVT::i1 && "No integer registers defined!");
644 // Every integer value type larger than this largest register takes twice as
645 // many registers to represent as the previous ValueType.
646 for (unsigned ExpandedReg = LargestIntReg + 1; ; ++ExpandedReg) {
647 EVT ExpandedVT = (MVT::SimpleValueType)ExpandedReg;
648 if (!ExpandedVT.isInteger())
650 NumRegistersForVT[ExpandedReg] = 2*NumRegistersForVT[ExpandedReg-1];
651 RegisterTypeForVT[ExpandedReg] = (MVT::SimpleValueType)LargestIntReg;
652 TransformToType[ExpandedReg] = (MVT::SimpleValueType)(ExpandedReg - 1);
653 ValueTypeActions.setTypeAction(ExpandedVT, Expand);
656 // Inspect all of the ValueType's smaller than the largest integer
657 // register to see which ones need promotion.
658 unsigned LegalIntReg = LargestIntReg;
659 for (unsigned IntReg = LargestIntReg - 1;
660 IntReg >= (unsigned)MVT::i1; --IntReg) {
661 EVT IVT = (MVT::SimpleValueType)IntReg;
662 if (isTypeLegal(IVT)) {
663 LegalIntReg = IntReg;
665 RegisterTypeForVT[IntReg] = TransformToType[IntReg] =
666 (MVT::SimpleValueType)LegalIntReg;
667 ValueTypeActions.setTypeAction(IVT, Promote);
671 // ppcf128 type is really two f64's.
672 if (!isTypeLegal(MVT::ppcf128)) {
673 NumRegistersForVT[MVT::ppcf128] = 2*NumRegistersForVT[MVT::f64];
674 RegisterTypeForVT[MVT::ppcf128] = MVT::f64;
675 TransformToType[MVT::ppcf128] = MVT::f64;
676 ValueTypeActions.setTypeAction(MVT::ppcf128, Expand);
679 // Decide how to handle f64. If the target does not have native f64 support,
680 // expand it to i64 and we will be generating soft float library calls.
681 if (!isTypeLegal(MVT::f64)) {
682 NumRegistersForVT[MVT::f64] = NumRegistersForVT[MVT::i64];
683 RegisterTypeForVT[MVT::f64] = RegisterTypeForVT[MVT::i64];
684 TransformToType[MVT::f64] = MVT::i64;
685 ValueTypeActions.setTypeAction(MVT::f64, Expand);
688 // Decide how to handle f32. If the target does not have native support for
689 // f32, promote it to f64 if it is legal. Otherwise, expand it to i32.
690 if (!isTypeLegal(MVT::f32)) {
691 if (isTypeLegal(MVT::f64)) {
692 NumRegistersForVT[MVT::f32] = NumRegistersForVT[MVT::f64];
693 RegisterTypeForVT[MVT::f32] = RegisterTypeForVT[MVT::f64];
694 TransformToType[MVT::f32] = MVT::f64;
695 ValueTypeActions.setTypeAction(MVT::f32, Promote);
697 NumRegistersForVT[MVT::f32] = NumRegistersForVT[MVT::i32];
698 RegisterTypeForVT[MVT::f32] = RegisterTypeForVT[MVT::i32];
699 TransformToType[MVT::f32] = MVT::i32;
700 ValueTypeActions.setTypeAction(MVT::f32, Expand);
704 // Loop over all of the vector value types to see which need transformations.
705 for (unsigned i = MVT::FIRST_VECTOR_VALUETYPE;
706 i <= (unsigned)MVT::LAST_VECTOR_VALUETYPE; ++i) {
707 MVT VT = (MVT::SimpleValueType)i;
708 if (!isTypeLegal(VT)) {
711 unsigned NumIntermediates;
712 NumRegistersForVT[i] =
713 getVectorTypeBreakdownMVT(VT, IntermediateVT, NumIntermediates,
715 RegisterTypeForVT[i] = RegisterVT;
717 // Determine if there is a legal wider type.
718 bool IsLegalWiderType = false;
719 EVT EltVT = VT.getVectorElementType();
720 unsigned NElts = VT.getVectorNumElements();
721 for (unsigned nVT = i+1; nVT <= MVT::LAST_VECTOR_VALUETYPE; ++nVT) {
722 EVT SVT = (MVT::SimpleValueType)nVT;
723 if (isTypeLegal(SVT) && SVT.getVectorElementType() == EltVT &&
724 SVT.getVectorNumElements() > NElts && NElts != 1) {
725 TransformToType[i] = SVT;
726 ValueTypeActions.setTypeAction(VT, Promote);
727 IsLegalWiderType = true;
731 if (!IsLegalWiderType) {
732 EVT NVT = VT.getPow2VectorType();
734 // Type is already a power of 2. The default action is to split.
735 TransformToType[i] = MVT::Other;
736 ValueTypeActions.setTypeAction(VT, Expand);
738 TransformToType[i] = NVT;
739 ValueTypeActions.setTypeAction(VT, Promote);
746 const char *TargetLowering::getTargetNodeName(unsigned Opcode) const {
751 MVT::SimpleValueType TargetLowering::getSetCCResultType(EVT VT) const {
752 return PointerTy.SimpleTy;
755 MVT::SimpleValueType TargetLowering::getCmpLibcallReturnType() const {
756 return MVT::i32; // return the default value
759 /// getVectorTypeBreakdown - Vector types are broken down into some number of
760 /// legal first class types. For example, MVT::v8f32 maps to 2 MVT::v4f32
761 /// with Altivec or SSE1, or 8 promoted MVT::f64 values with the X86 FP stack.
762 /// Similarly, MVT::v2i64 turns into 4 MVT::i32 values with both PPC and X86.
764 /// This method returns the number of registers needed, and the VT for each
765 /// register. It also returns the VT and quantity of the intermediate values
766 /// before they are promoted/expanded.
768 unsigned TargetLowering::getVectorTypeBreakdown(LLVMContext &Context, EVT VT,
770 unsigned &NumIntermediates,
771 EVT &RegisterVT) const {
772 // Figure out the right, legal destination reg to copy into.
773 unsigned NumElts = VT.getVectorNumElements();
774 EVT EltTy = VT.getVectorElementType();
776 unsigned NumVectorRegs = 1;
778 // FIXME: We don't support non-power-of-2-sized vectors for now. Ideally we
779 // could break down into LHS/RHS like LegalizeDAG does.
780 if (!isPowerOf2_32(NumElts)) {
781 NumVectorRegs = NumElts;
785 // Divide the input until we get to a supported size. This will always
786 // end with a scalar if the target doesn't support vectors.
787 while (NumElts > 1 && !isTypeLegal(
788 EVT::getVectorVT(Context, EltTy, NumElts))) {
793 NumIntermediates = NumVectorRegs;
795 EVT NewVT = EVT::getVectorVT(Context, EltTy, NumElts);
796 if (!isTypeLegal(NewVT))
798 IntermediateVT = NewVT;
800 EVT DestVT = getRegisterType(Context, NewVT);
802 if (DestVT.bitsLT(NewVT)) {
803 // Value is expanded, e.g. i64 -> i16.
804 return NumVectorRegs*(NewVT.getSizeInBits()/DestVT.getSizeInBits());
806 // Otherwise, promotion or legal types use the same number of registers as
807 // the vector decimated to the appropriate level.
808 return NumVectorRegs;
814 /// getByValTypeAlignment - Return the desired alignment for ByVal aggregate
815 /// function arguments in the caller parameter area. This is the actual
816 /// alignment, not its logarithm.
817 unsigned TargetLowering::getByValTypeAlignment(const Type *Ty) const {
818 return TD->getCallFrameTypeAlignment(Ty);
821 /// getJumpTableEncoding - Return the entry encoding for a jump table in the
822 /// current function. The returned value is a member of the
823 /// MachineJumpTableInfo::JTEntryKind enum.
824 unsigned TargetLowering::getJumpTableEncoding() const {
825 // In non-pic modes, just use the address of a block.
826 if (getTargetMachine().getRelocationModel() != Reloc::PIC_)
827 return MachineJumpTableInfo::EK_BlockAddress;
829 // In PIC mode, if the target supports a GPRel32 directive, use it.
830 if (getTargetMachine().getMCAsmInfo()->getGPRel32Directive() != 0)
831 return MachineJumpTableInfo::EK_GPRel32BlockAddress;
833 // Otherwise, use a label difference.
834 return MachineJumpTableInfo::EK_LabelDifference32;
837 SDValue TargetLowering::getPICJumpTableRelocBase(SDValue Table,
838 SelectionDAG &DAG) const {
839 // If our PIC model is GP relative, use the global offset table as the base.
840 if (getJumpTableEncoding() == MachineJumpTableInfo::EK_GPRel32BlockAddress)
841 return DAG.getGLOBAL_OFFSET_TABLE(getPointerTy());
845 /// getPICJumpTableRelocBaseExpr - This returns the relocation base for the
846 /// given PIC jumptable, the same as getPICJumpTableRelocBase, but as an
849 TargetLowering::getPICJumpTableRelocBaseExpr(const MachineFunction *MF,
850 unsigned JTI,MCContext &Ctx) const{
851 // The normal PIC reloc base is the label at the start of the jump table.
852 return MCSymbolRefExpr::Create(MF->getJTISymbol(JTI, Ctx), Ctx);
856 TargetLowering::isOffsetFoldingLegal(const GlobalAddressSDNode *GA) const {
857 // Assume that everything is safe in static mode.
858 if (getTargetMachine().getRelocationModel() == Reloc::Static)
861 // In dynamic-no-pic mode, assume that known defined values are safe.
862 if (getTargetMachine().getRelocationModel() == Reloc::DynamicNoPIC &&
864 !GA->getGlobal()->isDeclaration() &&
865 !GA->getGlobal()->isWeakForLinker())
868 // Otherwise assume nothing is safe.
872 //===----------------------------------------------------------------------===//
873 // Optimization Methods
874 //===----------------------------------------------------------------------===//
876 /// ShrinkDemandedConstant - Check to see if the specified operand of the
877 /// specified instruction is a constant integer. If so, check to see if there
878 /// are any bits set in the constant that are not demanded. If so, shrink the
879 /// constant and return true.
880 bool TargetLowering::TargetLoweringOpt::ShrinkDemandedConstant(SDValue Op,
881 const APInt &Demanded) {
882 DebugLoc dl = Op.getDebugLoc();
884 // FIXME: ISD::SELECT, ISD::SELECT_CC
885 switch (Op.getOpcode()) {
890 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1));
891 if (!C) return false;
893 if (Op.getOpcode() == ISD::XOR &&
894 (C->getAPIntValue() | (~Demanded)).isAllOnesValue())
897 // if we can expand it to have all bits set, do it
898 if (C->getAPIntValue().intersects(~Demanded)) {
899 EVT VT = Op.getValueType();
900 SDValue New = DAG.getNode(Op.getOpcode(), dl, VT, Op.getOperand(0),
901 DAG.getConstant(Demanded &
904 return CombineTo(Op, New);
914 /// ShrinkDemandedOp - Convert x+y to (VT)((SmallVT)x+(SmallVT)y) if the
915 /// casts are free. This uses isZExtFree and ZERO_EXTEND for the widening
916 /// cast, but it could be generalized for targets with other types of
917 /// implicit widening casts.
919 TargetLowering::TargetLoweringOpt::ShrinkDemandedOp(SDValue Op,
921 const APInt &Demanded,
923 assert(Op.getNumOperands() == 2 &&
924 "ShrinkDemandedOp only supports binary operators!");
925 assert(Op.getNode()->getNumValues() == 1 &&
926 "ShrinkDemandedOp only supports nodes with one result!");
928 // Don't do this if the node has another user, which may require the
930 if (!Op.getNode()->hasOneUse())
933 // Search for the smallest integer type with free casts to and from
934 // Op's type. For expedience, just check power-of-2 integer types.
935 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
936 unsigned SmallVTBits = BitWidth - Demanded.countLeadingZeros();
937 if (!isPowerOf2_32(SmallVTBits))
938 SmallVTBits = NextPowerOf2(SmallVTBits);
939 for (; SmallVTBits < BitWidth; SmallVTBits = NextPowerOf2(SmallVTBits)) {
940 EVT SmallVT = EVT::getIntegerVT(*DAG.getContext(), SmallVTBits);
941 if (TLI.isTruncateFree(Op.getValueType(), SmallVT) &&
942 TLI.isZExtFree(SmallVT, Op.getValueType())) {
943 // We found a type with free casts.
944 SDValue X = DAG.getNode(Op.getOpcode(), dl, SmallVT,
945 DAG.getNode(ISD::TRUNCATE, dl, SmallVT,
946 Op.getNode()->getOperand(0)),
947 DAG.getNode(ISD::TRUNCATE, dl, SmallVT,
948 Op.getNode()->getOperand(1)));
949 SDValue Z = DAG.getNode(ISD::ZERO_EXTEND, dl, Op.getValueType(), X);
950 return CombineTo(Op, Z);
956 /// SimplifyDemandedBits - Look at Op. At this point, we know that only the
957 /// DemandedMask bits of the result of Op are ever used downstream. If we can
958 /// use this information to simplify Op, create a new simplified DAG node and
959 /// return true, returning the original and new nodes in Old and New. Otherwise,
960 /// analyze the expression and return a mask of KnownOne and KnownZero bits for
961 /// the expression (used to simplify the caller). The KnownZero/One bits may
962 /// only be accurate for those bits in the DemandedMask.
963 bool TargetLowering::SimplifyDemandedBits(SDValue Op,
964 const APInt &DemandedMask,
967 TargetLoweringOpt &TLO,
968 unsigned Depth) const {
969 unsigned BitWidth = DemandedMask.getBitWidth();
970 assert(Op.getValueType().getScalarType().getSizeInBits() == BitWidth &&
971 "Mask size mismatches value type size!");
972 APInt NewMask = DemandedMask;
973 DebugLoc dl = Op.getDebugLoc();
975 // Don't know anything.
976 KnownZero = KnownOne = APInt(BitWidth, 0);
978 // Other users may use these bits.
979 if (!Op.getNode()->hasOneUse()) {
981 // If not at the root, Just compute the KnownZero/KnownOne bits to
982 // simplify things downstream.
983 TLO.DAG.ComputeMaskedBits(Op, DemandedMask, KnownZero, KnownOne, Depth);
986 // If this is the root being simplified, allow it to have multiple uses,
987 // just set the NewMask to all bits.
988 NewMask = APInt::getAllOnesValue(BitWidth);
989 } else if (DemandedMask == 0) {
990 // Not demanding any bits from Op.
991 if (Op.getOpcode() != ISD::UNDEF)
992 return TLO.CombineTo(Op, TLO.DAG.getUNDEF(Op.getValueType()));
994 } else if (Depth == 6) { // Limit search depth.
998 APInt KnownZero2, KnownOne2, KnownZeroOut, KnownOneOut;
999 switch (Op.getOpcode()) {
1001 // We know all of the bits for a constant!
1002 KnownOne = cast<ConstantSDNode>(Op)->getAPIntValue() & NewMask;
1003 KnownZero = ~KnownOne & NewMask;
1004 return false; // Don't fall through, will infinitely loop.
1006 // If the RHS is a constant, check to see if the LHS would be zero without
1007 // using the bits from the RHS. Below, we use knowledge about the RHS to
1008 // simplify the LHS, here we're using information from the LHS to simplify
1010 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1011 APInt LHSZero, LHSOne;
1012 TLO.DAG.ComputeMaskedBits(Op.getOperand(0), NewMask,
1013 LHSZero, LHSOne, Depth+1);
1014 // If the LHS already has zeros where RHSC does, this and is dead.
1015 if ((LHSZero & NewMask) == (~RHSC->getAPIntValue() & NewMask))
1016 return TLO.CombineTo(Op, Op.getOperand(0));
1017 // If any of the set bits in the RHS are known zero on the LHS, shrink
1019 if (TLO.ShrinkDemandedConstant(Op, ~LHSZero & NewMask))
1023 if (SimplifyDemandedBits(Op.getOperand(1), NewMask, KnownZero,
1024 KnownOne, TLO, Depth+1))
1026 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1027 if (SimplifyDemandedBits(Op.getOperand(0), ~KnownZero & NewMask,
1028 KnownZero2, KnownOne2, TLO, Depth+1))
1030 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1032 // If all of the demanded bits are known one on one side, return the other.
1033 // These bits cannot contribute to the result of the 'and'.
1034 if ((NewMask & ~KnownZero2 & KnownOne) == (~KnownZero2 & NewMask))
1035 return TLO.CombineTo(Op, Op.getOperand(0));
1036 if ((NewMask & ~KnownZero & KnownOne2) == (~KnownZero & NewMask))
1037 return TLO.CombineTo(Op, Op.getOperand(1));
1038 // If all of the demanded bits in the inputs are known zeros, return zero.
1039 if ((NewMask & (KnownZero|KnownZero2)) == NewMask)
1040 return TLO.CombineTo(Op, TLO.DAG.getConstant(0, Op.getValueType()));
1041 // If the RHS is a constant, see if we can simplify it.
1042 if (TLO.ShrinkDemandedConstant(Op, ~KnownZero2 & NewMask))
1044 // If the operation can be done in a smaller type, do so.
1045 if (TLO.ShrinkOps && TLO.ShrinkDemandedOp(Op, BitWidth, NewMask, dl))
1048 // Output known-1 bits are only known if set in both the LHS & RHS.
1049 KnownOne &= KnownOne2;
1050 // Output known-0 are known to be clear if zero in either the LHS | RHS.
1051 KnownZero |= KnownZero2;
1054 if (SimplifyDemandedBits(Op.getOperand(1), NewMask, KnownZero,
1055 KnownOne, TLO, Depth+1))
1057 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1058 if (SimplifyDemandedBits(Op.getOperand(0), ~KnownOne & NewMask,
1059 KnownZero2, KnownOne2, TLO, Depth+1))
1061 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1063 // If all of the demanded bits are known zero on one side, return the other.
1064 // These bits cannot contribute to the result of the 'or'.
1065 if ((NewMask & ~KnownOne2 & KnownZero) == (~KnownOne2 & NewMask))
1066 return TLO.CombineTo(Op, Op.getOperand(0));
1067 if ((NewMask & ~KnownOne & KnownZero2) == (~KnownOne & NewMask))
1068 return TLO.CombineTo(Op, Op.getOperand(1));
1069 // If all of the potentially set bits on one side are known to be set on
1070 // the other side, just use the 'other' side.
1071 if ((NewMask & ~KnownZero & KnownOne2) == (~KnownZero & NewMask))
1072 return TLO.CombineTo(Op, Op.getOperand(0));
1073 if ((NewMask & ~KnownZero2 & KnownOne) == (~KnownZero2 & NewMask))
1074 return TLO.CombineTo(Op, Op.getOperand(1));
1075 // If the RHS is a constant, see if we can simplify it.
1076 if (TLO.ShrinkDemandedConstant(Op, NewMask))
1078 // If the operation can be done in a smaller type, do so.
1079 if (TLO.ShrinkOps && TLO.ShrinkDemandedOp(Op, BitWidth, NewMask, dl))
1082 // Output known-0 bits are only known if clear in both the LHS & RHS.
1083 KnownZero &= KnownZero2;
1084 // Output known-1 are known to be set if set in either the LHS | RHS.
1085 KnownOne |= KnownOne2;
1088 if (SimplifyDemandedBits(Op.getOperand(1), NewMask, KnownZero,
1089 KnownOne, TLO, Depth+1))
1091 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1092 if (SimplifyDemandedBits(Op.getOperand(0), NewMask, KnownZero2,
1093 KnownOne2, TLO, Depth+1))
1095 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1097 // If all of the demanded bits are known zero on one side, return the other.
1098 // These bits cannot contribute to the result of the 'xor'.
1099 if ((KnownZero & NewMask) == NewMask)
1100 return TLO.CombineTo(Op, Op.getOperand(0));
1101 if ((KnownZero2 & NewMask) == NewMask)
1102 return TLO.CombineTo(Op, Op.getOperand(1));
1103 // If the operation can be done in a smaller type, do so.
1104 if (TLO.ShrinkOps && TLO.ShrinkDemandedOp(Op, BitWidth, NewMask, dl))
1107 // If all of the unknown bits are known to be zero on one side or the other
1108 // (but not both) turn this into an *inclusive* or.
1109 // e.g. (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0
1110 if ((NewMask & ~KnownZero & ~KnownZero2) == 0)
1111 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::OR, dl, Op.getValueType(),
1115 // Output known-0 bits are known if clear or set in both the LHS & RHS.
1116 KnownZeroOut = (KnownZero & KnownZero2) | (KnownOne & KnownOne2);
1117 // Output known-1 are known to be set if set in only one of the LHS, RHS.
1118 KnownOneOut = (KnownZero & KnownOne2) | (KnownOne & KnownZero2);
1120 // If all of the demanded bits on one side are known, and all of the set
1121 // bits on that side are also known to be set on the other side, turn this
1122 // into an AND, as we know the bits will be cleared.
1123 // e.g. (X | C1) ^ C2 --> (X | C1) & ~C2 iff (C1&C2) == C2
1124 if ((NewMask & (KnownZero|KnownOne)) == NewMask) { // all known
1125 if ((KnownOne & KnownOne2) == KnownOne) {
1126 EVT VT = Op.getValueType();
1127 SDValue ANDC = TLO.DAG.getConstant(~KnownOne & NewMask, VT);
1128 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::AND, dl, VT,
1129 Op.getOperand(0), ANDC));
1133 // If the RHS is a constant, see if we can simplify it.
1134 // for XOR, we prefer to force bits to 1 if they will make a -1.
1135 // if we can't force bits, try to shrink constant
1136 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1137 APInt Expanded = C->getAPIntValue() | (~NewMask);
1138 // if we can expand it to have all bits set, do it
1139 if (Expanded.isAllOnesValue()) {
1140 if (Expanded != C->getAPIntValue()) {
1141 EVT VT = Op.getValueType();
1142 SDValue New = TLO.DAG.getNode(Op.getOpcode(), dl,VT, Op.getOperand(0),
1143 TLO.DAG.getConstant(Expanded, VT));
1144 return TLO.CombineTo(Op, New);
1146 // if it already has all the bits set, nothing to change
1147 // but don't shrink either!
1148 } else if (TLO.ShrinkDemandedConstant(Op, NewMask)) {
1153 KnownZero = KnownZeroOut;
1154 KnownOne = KnownOneOut;
1157 if (SimplifyDemandedBits(Op.getOperand(2), NewMask, KnownZero,
1158 KnownOne, TLO, Depth+1))
1160 if (SimplifyDemandedBits(Op.getOperand(1), NewMask, KnownZero2,
1161 KnownOne2, TLO, Depth+1))
1163 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1164 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1166 // If the operands are constants, see if we can simplify them.
1167 if (TLO.ShrinkDemandedConstant(Op, NewMask))
1170 // Only known if known in both the LHS and RHS.
1171 KnownOne &= KnownOne2;
1172 KnownZero &= KnownZero2;
1174 case ISD::SELECT_CC:
1175 if (SimplifyDemandedBits(Op.getOperand(3), NewMask, KnownZero,
1176 KnownOne, TLO, Depth+1))
1178 if (SimplifyDemandedBits(Op.getOperand(2), NewMask, KnownZero2,
1179 KnownOne2, TLO, Depth+1))
1181 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1182 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1184 // If the operands are constants, see if we can simplify them.
1185 if (TLO.ShrinkDemandedConstant(Op, NewMask))
1188 // Only known if known in both the LHS and RHS.
1189 KnownOne &= KnownOne2;
1190 KnownZero &= KnownZero2;
1193 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1194 unsigned ShAmt = SA->getZExtValue();
1195 SDValue InOp = Op.getOperand(0);
1197 // If the shift count is an invalid immediate, don't do anything.
1198 if (ShAmt >= BitWidth)
1201 // If this is ((X >>u C1) << ShAmt), see if we can simplify this into a
1202 // single shift. We can do this if the bottom bits (which are shifted
1203 // out) are never demanded.
1204 if (InOp.getOpcode() == ISD::SRL &&
1205 isa<ConstantSDNode>(InOp.getOperand(1))) {
1206 if (ShAmt && (NewMask & APInt::getLowBitsSet(BitWidth, ShAmt)) == 0) {
1207 unsigned C1= cast<ConstantSDNode>(InOp.getOperand(1))->getZExtValue();
1208 unsigned Opc = ISD::SHL;
1209 int Diff = ShAmt-C1;
1216 TLO.DAG.getConstant(Diff, Op.getOperand(1).getValueType());
1217 EVT VT = Op.getValueType();
1218 return TLO.CombineTo(Op, TLO.DAG.getNode(Opc, dl, VT,
1219 InOp.getOperand(0), NewSA));
1223 if (SimplifyDemandedBits(Op.getOperand(0), NewMask.lshr(ShAmt),
1224 KnownZero, KnownOne, TLO, Depth+1))
1226 KnownZero <<= SA->getZExtValue();
1227 KnownOne <<= SA->getZExtValue();
1228 // low bits known zero.
1229 KnownZero |= APInt::getLowBitsSet(BitWidth, SA->getZExtValue());
1233 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1234 EVT VT = Op.getValueType();
1235 unsigned ShAmt = SA->getZExtValue();
1236 unsigned VTSize = VT.getSizeInBits();
1237 SDValue InOp = Op.getOperand(0);
1239 // If the shift count is an invalid immediate, don't do anything.
1240 if (ShAmt >= BitWidth)
1243 // If this is ((X << C1) >>u ShAmt), see if we can simplify this into a
1244 // single shift. We can do this if the top bits (which are shifted out)
1245 // are never demanded.
1246 if (InOp.getOpcode() == ISD::SHL &&
1247 isa<ConstantSDNode>(InOp.getOperand(1))) {
1248 if (ShAmt && (NewMask & APInt::getHighBitsSet(VTSize, ShAmt)) == 0) {
1249 unsigned C1= cast<ConstantSDNode>(InOp.getOperand(1))->getZExtValue();
1250 unsigned Opc = ISD::SRL;
1251 int Diff = ShAmt-C1;
1258 TLO.DAG.getConstant(Diff, Op.getOperand(1).getValueType());
1259 return TLO.CombineTo(Op, TLO.DAG.getNode(Opc, dl, VT,
1260 InOp.getOperand(0), NewSA));
1264 // Compute the new bits that are at the top now.
1265 if (SimplifyDemandedBits(InOp, (NewMask << ShAmt),
1266 KnownZero, KnownOne, TLO, Depth+1))
1268 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1269 KnownZero = KnownZero.lshr(ShAmt);
1270 KnownOne = KnownOne.lshr(ShAmt);
1272 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt);
1273 KnownZero |= HighBits; // High bits known zero.
1277 // If this is an arithmetic shift right and only the low-bit is set, we can
1278 // always convert this into a logical shr, even if the shift amount is
1279 // variable. The low bit of the shift cannot be an input sign bit unless
1280 // the shift amount is >= the size of the datatype, which is undefined.
1281 if (DemandedMask == 1)
1282 return TLO.CombineTo(Op,
1283 TLO.DAG.getNode(ISD::SRL, dl, Op.getValueType(),
1284 Op.getOperand(0), Op.getOperand(1)));
1286 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1287 EVT VT = Op.getValueType();
1288 unsigned ShAmt = SA->getZExtValue();
1290 // If the shift count is an invalid immediate, don't do anything.
1291 if (ShAmt >= BitWidth)
1294 APInt InDemandedMask = (NewMask << ShAmt);
1296 // If any of the demanded bits are produced by the sign extension, we also
1297 // demand the input sign bit.
1298 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt);
1299 if (HighBits.intersects(NewMask))
1300 InDemandedMask |= APInt::getSignBit(VT.getScalarType().getSizeInBits());
1302 if (SimplifyDemandedBits(Op.getOperand(0), InDemandedMask,
1303 KnownZero, KnownOne, TLO, Depth+1))
1305 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1306 KnownZero = KnownZero.lshr(ShAmt);
1307 KnownOne = KnownOne.lshr(ShAmt);
1309 // Handle the sign bit, adjusted to where it is now in the mask.
1310 APInt SignBit = APInt::getSignBit(BitWidth).lshr(ShAmt);
1312 // If the input sign bit is known to be zero, or if none of the top bits
1313 // are demanded, turn this into an unsigned shift right.
1314 if (KnownZero.intersects(SignBit) || (HighBits & ~NewMask) == HighBits) {
1315 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::SRL, dl, VT,
1318 } else if (KnownOne.intersects(SignBit)) { // New bits are known one.
1319 KnownOne |= HighBits;
1323 case ISD::SIGN_EXTEND_INREG: {
1324 EVT EVT = cast<VTSDNode>(Op.getOperand(1))->getVT();
1326 // Sign extension. Compute the demanded bits in the result that are not
1327 // present in the input.
1329 APInt::getHighBitsSet(BitWidth,
1330 BitWidth - EVT.getScalarType().getSizeInBits()) &
1333 // If none of the extended bits are demanded, eliminate the sextinreg.
1335 return TLO.CombineTo(Op, Op.getOperand(0));
1337 APInt InSignBit = APInt::getSignBit(EVT.getScalarType().getSizeInBits());
1338 InSignBit.zext(BitWidth);
1339 APInt InputDemandedBits =
1340 APInt::getLowBitsSet(BitWidth,
1341 EVT.getScalarType().getSizeInBits()) &
1344 // Since the sign extended bits are demanded, we know that the sign
1346 InputDemandedBits |= InSignBit;
1348 if (SimplifyDemandedBits(Op.getOperand(0), InputDemandedBits,
1349 KnownZero, KnownOne, TLO, Depth+1))
1351 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1353 // If the sign bit of the input is known set or clear, then we know the
1354 // top bits of the result.
1356 // If the input sign bit is known zero, convert this into a zero extension.
1357 if (KnownZero.intersects(InSignBit))
1358 return TLO.CombineTo(Op,
1359 TLO.DAG.getZeroExtendInReg(Op.getOperand(0),dl,EVT));
1361 if (KnownOne.intersects(InSignBit)) { // Input sign bit known set
1362 KnownOne |= NewBits;
1363 KnownZero &= ~NewBits;
1364 } else { // Input sign bit unknown
1365 KnownZero &= ~NewBits;
1366 KnownOne &= ~NewBits;
1370 case ISD::ZERO_EXTEND: {
1371 unsigned OperandBitWidth =
1372 Op.getOperand(0).getValueType().getScalarType().getSizeInBits();
1373 APInt InMask = NewMask;
1374 InMask.trunc(OperandBitWidth);
1376 // If none of the top bits are demanded, convert this into an any_extend.
1378 APInt::getHighBitsSet(BitWidth, BitWidth - OperandBitWidth) & NewMask;
1379 if (!NewBits.intersects(NewMask))
1380 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::ANY_EXTEND, dl,
1384 if (SimplifyDemandedBits(Op.getOperand(0), InMask,
1385 KnownZero, KnownOne, TLO, Depth+1))
1387 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1388 KnownZero.zext(BitWidth);
1389 KnownOne.zext(BitWidth);
1390 KnownZero |= NewBits;
1393 case ISD::SIGN_EXTEND: {
1394 EVT InVT = Op.getOperand(0).getValueType();
1395 unsigned InBits = InVT.getScalarType().getSizeInBits();
1396 APInt InMask = APInt::getLowBitsSet(BitWidth, InBits);
1397 APInt InSignBit = APInt::getBitsSet(BitWidth, InBits - 1, InBits);
1398 APInt NewBits = ~InMask & NewMask;
1400 // If none of the top bits are demanded, convert this into an any_extend.
1402 return TLO.CombineTo(Op,TLO.DAG.getNode(ISD::ANY_EXTEND, dl,
1406 // Since some of the sign extended bits are demanded, we know that the sign
1408 APInt InDemandedBits = InMask & NewMask;
1409 InDemandedBits |= InSignBit;
1410 InDemandedBits.trunc(InBits);
1412 if (SimplifyDemandedBits(Op.getOperand(0), InDemandedBits, KnownZero,
1413 KnownOne, TLO, Depth+1))
1415 KnownZero.zext(BitWidth);
1416 KnownOne.zext(BitWidth);
1418 // If the sign bit is known zero, convert this to a zero extend.
1419 if (KnownZero.intersects(InSignBit))
1420 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::ZERO_EXTEND, dl,
1424 // If the sign bit is known one, the top bits match.
1425 if (KnownOne.intersects(InSignBit)) {
1426 KnownOne |= NewBits;
1427 KnownZero &= ~NewBits;
1428 } else { // Otherwise, top bits aren't known.
1429 KnownOne &= ~NewBits;
1430 KnownZero &= ~NewBits;
1434 case ISD::ANY_EXTEND: {
1435 unsigned OperandBitWidth =
1436 Op.getOperand(0).getValueType().getScalarType().getSizeInBits();
1437 APInt InMask = NewMask;
1438 InMask.trunc(OperandBitWidth);
1439 if (SimplifyDemandedBits(Op.getOperand(0), InMask,
1440 KnownZero, KnownOne, TLO, Depth+1))
1442 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1443 KnownZero.zext(BitWidth);
1444 KnownOne.zext(BitWidth);
1447 case ISD::TRUNCATE: {
1448 // Simplify the input, using demanded bit information, and compute the known
1449 // zero/one bits live out.
1450 unsigned OperandBitWidth =
1451 Op.getOperand(0).getValueType().getScalarType().getSizeInBits();
1452 APInt TruncMask = NewMask;
1453 TruncMask.zext(OperandBitWidth);
1454 if (SimplifyDemandedBits(Op.getOperand(0), TruncMask,
1455 KnownZero, KnownOne, TLO, Depth+1))
1457 KnownZero.trunc(BitWidth);
1458 KnownOne.trunc(BitWidth);
1460 // If the input is only used by this truncate, see if we can shrink it based
1461 // on the known demanded bits.
1462 if (Op.getOperand(0).getNode()->hasOneUse()) {
1463 SDValue In = Op.getOperand(0);
1464 switch (In.getOpcode()) {
1467 // Shrink SRL by a constant if none of the high bits shifted in are
1469 if (TLO.LegalTypes() &&
1470 !isTypeDesirableForOp(ISD::SRL, Op.getValueType()))
1471 // Do not turn (vt1 truncate (vt2 srl)) into (vt1 srl) if vt1 is
1474 ConstantSDNode *ShAmt = dyn_cast<ConstantSDNode>(In.getOperand(1));
1477 APInt HighBits = APInt::getHighBitsSet(OperandBitWidth,
1478 OperandBitWidth - BitWidth);
1479 HighBits = HighBits.lshr(ShAmt->getZExtValue());
1480 HighBits.trunc(BitWidth);
1482 if (ShAmt->getZExtValue() < BitWidth && !(HighBits & NewMask)) {
1483 // None of the shifted in bits are needed. Add a truncate of the
1484 // shift input, then shift it.
1485 SDValue NewTrunc = TLO.DAG.getNode(ISD::TRUNCATE, dl,
1488 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::SRL, dl,
1497 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1500 case ISD::AssertZext: {
1501 EVT VT = cast<VTSDNode>(Op.getOperand(1))->getVT();
1502 APInt InMask = APInt::getLowBitsSet(BitWidth,
1503 VT.getSizeInBits());
1504 if (SimplifyDemandedBits(Op.getOperand(0), InMask & NewMask,
1505 KnownZero, KnownOne, TLO, Depth+1))
1507 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1508 KnownZero |= ~InMask & NewMask;
1511 case ISD::BIT_CONVERT:
1513 // If this is an FP->Int bitcast and if the sign bit is the only thing that
1514 // is demanded, turn this into a FGETSIGN.
1515 if (NewMask == EVT::getIntegerVTSignBit(Op.getValueType()) &&
1516 MVT::isFloatingPoint(Op.getOperand(0).getValueType()) &&
1517 !MVT::isVector(Op.getOperand(0).getValueType())) {
1518 // Only do this xform if FGETSIGN is valid or if before legalize.
1519 if (!TLO.AfterLegalize ||
1520 isOperationLegal(ISD::FGETSIGN, Op.getValueType())) {
1521 // Make a FGETSIGN + SHL to move the sign bit into the appropriate
1522 // place. We expect the SHL to be eliminated by other optimizations.
1523 SDValue Sign = TLO.DAG.getNode(ISD::FGETSIGN, Op.getValueType(),
1525 unsigned ShVal = Op.getValueType().getSizeInBits()-1;
1526 SDValue ShAmt = TLO.DAG.getConstant(ShVal, getShiftAmountTy());
1527 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::SHL, Op.getValueType(),
1536 // Add, Sub, and Mul don't demand any bits in positions beyond that
1537 // of the highest bit demanded of them.
1538 APInt LoMask = APInt::getLowBitsSet(BitWidth,
1539 BitWidth - NewMask.countLeadingZeros());
1540 if (SimplifyDemandedBits(Op.getOperand(0), LoMask, KnownZero2,
1541 KnownOne2, TLO, Depth+1))
1543 if (SimplifyDemandedBits(Op.getOperand(1), LoMask, KnownZero2,
1544 KnownOne2, TLO, Depth+1))
1546 // See if the operation should be performed at a smaller bit width.
1547 if (TLO.ShrinkOps && TLO.ShrinkDemandedOp(Op, BitWidth, NewMask, dl))
1552 // Just use ComputeMaskedBits to compute output bits.
1553 TLO.DAG.ComputeMaskedBits(Op, NewMask, KnownZero, KnownOne, Depth);
1557 // If we know the value of all of the demanded bits, return this as a
1559 if ((NewMask & (KnownZero|KnownOne)) == NewMask)
1560 return TLO.CombineTo(Op, TLO.DAG.getConstant(KnownOne, Op.getValueType()));
1565 /// computeMaskedBitsForTargetNode - Determine which of the bits specified
1566 /// in Mask are known to be either zero or one and return them in the
1567 /// KnownZero/KnownOne bitsets.
1568 void TargetLowering::computeMaskedBitsForTargetNode(const SDValue Op,
1572 const SelectionDAG &DAG,
1573 unsigned Depth) const {
1574 assert((Op.getOpcode() >= ISD::BUILTIN_OP_END ||
1575 Op.getOpcode() == ISD::INTRINSIC_WO_CHAIN ||
1576 Op.getOpcode() == ISD::INTRINSIC_W_CHAIN ||
1577 Op.getOpcode() == ISD::INTRINSIC_VOID) &&
1578 "Should use MaskedValueIsZero if you don't know whether Op"
1579 " is a target node!");
1580 KnownZero = KnownOne = APInt(Mask.getBitWidth(), 0);
1583 /// ComputeNumSignBitsForTargetNode - This method can be implemented by
1584 /// targets that want to expose additional information about sign bits to the
1586 unsigned TargetLowering::ComputeNumSignBitsForTargetNode(SDValue Op,
1587 unsigned Depth) const {
1588 assert((Op.getOpcode() >= ISD::BUILTIN_OP_END ||
1589 Op.getOpcode() == ISD::INTRINSIC_WO_CHAIN ||
1590 Op.getOpcode() == ISD::INTRINSIC_W_CHAIN ||
1591 Op.getOpcode() == ISD::INTRINSIC_VOID) &&
1592 "Should use ComputeNumSignBits if you don't know whether Op"
1593 " is a target node!");
1597 /// ValueHasExactlyOneBitSet - Test if the given value is known to have exactly
1598 /// one bit set. This differs from ComputeMaskedBits in that it doesn't need to
1599 /// determine which bit is set.
1601 static bool ValueHasExactlyOneBitSet(SDValue Val, const SelectionDAG &DAG) {
1602 // A left-shift of a constant one will have exactly one bit set, because
1603 // shifting the bit off the end is undefined.
1604 if (Val.getOpcode() == ISD::SHL)
1605 if (ConstantSDNode *C =
1606 dyn_cast<ConstantSDNode>(Val.getNode()->getOperand(0)))
1607 if (C->getAPIntValue() == 1)
1610 // Similarly, a right-shift of a constant sign-bit will have exactly
1612 if (Val.getOpcode() == ISD::SRL)
1613 if (ConstantSDNode *C =
1614 dyn_cast<ConstantSDNode>(Val.getNode()->getOperand(0)))
1615 if (C->getAPIntValue().isSignBit())
1618 // More could be done here, though the above checks are enough
1619 // to handle some common cases.
1621 // Fall back to ComputeMaskedBits to catch other known cases.
1622 EVT OpVT = Val.getValueType();
1623 unsigned BitWidth = OpVT.getScalarType().getSizeInBits();
1624 APInt Mask = APInt::getAllOnesValue(BitWidth);
1625 APInt KnownZero, KnownOne;
1626 DAG.ComputeMaskedBits(Val, Mask, KnownZero, KnownOne);
1627 return (KnownZero.countPopulation() == BitWidth - 1) &&
1628 (KnownOne.countPopulation() == 1);
1631 /// SimplifySetCC - Try to simplify a setcc built with the specified operands
1632 /// and cc. If it is unable to simplify it, return a null SDValue.
1634 TargetLowering::SimplifySetCC(EVT VT, SDValue N0, SDValue N1,
1635 ISD::CondCode Cond, bool foldBooleans,
1636 DAGCombinerInfo &DCI, DebugLoc dl) const {
1637 SelectionDAG &DAG = DCI.DAG;
1638 LLVMContext &Context = *DAG.getContext();
1640 // These setcc operations always fold.
1644 case ISD::SETFALSE2: return DAG.getConstant(0, VT);
1646 case ISD::SETTRUE2: return DAG.getConstant(1, VT);
1649 if (isa<ConstantSDNode>(N0.getNode())) {
1650 // Ensure that the constant occurs on the RHS, and fold constant
1652 return DAG.getSetCC(dl, VT, N1, N0, ISD::getSetCCSwappedOperands(Cond));
1655 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.getNode())) {
1656 const APInt &C1 = N1C->getAPIntValue();
1658 // If the LHS is '(srl (ctlz x), 5)', the RHS is 0/1, and this is an
1659 // equality comparison, then we're just comparing whether X itself is
1661 if (N0.getOpcode() == ISD::SRL && (C1 == 0 || C1 == 1) &&
1662 N0.getOperand(0).getOpcode() == ISD::CTLZ &&
1663 N0.getOperand(1).getOpcode() == ISD::Constant) {
1665 = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
1666 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) &&
1667 ShAmt == Log2_32(N0.getValueType().getSizeInBits())) {
1668 if ((C1 == 0) == (Cond == ISD::SETEQ)) {
1669 // (srl (ctlz x), 5) == 0 -> X != 0
1670 // (srl (ctlz x), 5) != 1 -> X != 0
1673 // (srl (ctlz x), 5) != 0 -> X == 0
1674 // (srl (ctlz x), 5) == 1 -> X == 0
1677 SDValue Zero = DAG.getConstant(0, N0.getValueType());
1678 return DAG.getSetCC(dl, VT, N0.getOperand(0).getOperand(0),
1683 // If the LHS is '(and load, const)', the RHS is 0,
1684 // the test is for equality or unsigned, and all 1 bits of the const are
1685 // in the same partial word, see if we can shorten the load.
1686 if (DCI.isBeforeLegalize() &&
1687 N0.getOpcode() == ISD::AND && C1 == 0 &&
1688 N0.getNode()->hasOneUse() &&
1689 isa<LoadSDNode>(N0.getOperand(0)) &&
1690 N0.getOperand(0).getNode()->hasOneUse() &&
1691 isa<ConstantSDNode>(N0.getOperand(1))) {
1692 LoadSDNode *Lod = cast<LoadSDNode>(N0.getOperand(0));
1694 unsigned bestWidth = 0, bestOffset = 0;
1695 if (!Lod->isVolatile() && Lod->isUnindexed()) {
1696 unsigned origWidth = N0.getValueType().getSizeInBits();
1697 unsigned maskWidth = origWidth;
1698 // We can narrow (e.g.) 16-bit extending loads on 32-bit target to
1699 // 8 bits, but have to be careful...
1700 if (Lod->getExtensionType() != ISD::NON_EXTLOAD)
1701 origWidth = Lod->getMemoryVT().getSizeInBits();
1703 cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
1704 for (unsigned width = origWidth / 2; width>=8; width /= 2) {
1705 APInt newMask = APInt::getLowBitsSet(maskWidth, width);
1706 for (unsigned offset=0; offset<origWidth/width; offset++) {
1707 if ((newMask & Mask) == Mask) {
1708 if (!TD->isLittleEndian())
1709 bestOffset = (origWidth/width - offset - 1) * (width/8);
1711 bestOffset = (uint64_t)offset * (width/8);
1712 bestMask = Mask.lshr(offset * (width/8) * 8);
1716 newMask = newMask << width;
1721 EVT newVT = EVT::getIntegerVT(Context, bestWidth);
1722 if (newVT.isRound()) {
1723 EVT PtrType = Lod->getOperand(1).getValueType();
1724 SDValue Ptr = Lod->getBasePtr();
1725 if (bestOffset != 0)
1726 Ptr = DAG.getNode(ISD::ADD, dl, PtrType, Lod->getBasePtr(),
1727 DAG.getConstant(bestOffset, PtrType));
1728 unsigned NewAlign = MinAlign(Lod->getAlignment(), bestOffset);
1729 SDValue NewLoad = DAG.getLoad(newVT, dl, Lod->getChain(), Ptr,
1731 Lod->getSrcValueOffset() + bestOffset,
1732 false, false, NewAlign);
1733 return DAG.getSetCC(dl, VT,
1734 DAG.getNode(ISD::AND, dl, newVT, NewLoad,
1735 DAG.getConstant(bestMask.trunc(bestWidth),
1737 DAG.getConstant(0LL, newVT), Cond);
1742 // If the LHS is a ZERO_EXTEND, perform the comparison on the input.
1743 if (N0.getOpcode() == ISD::ZERO_EXTEND) {
1744 unsigned InSize = N0.getOperand(0).getValueType().getSizeInBits();
1746 // If the comparison constant has bits in the upper part, the
1747 // zero-extended value could never match.
1748 if (C1.intersects(APInt::getHighBitsSet(C1.getBitWidth(),
1749 C1.getBitWidth() - InSize))) {
1753 case ISD::SETEQ: return DAG.getConstant(0, VT);
1756 case ISD::SETNE: return DAG.getConstant(1, VT);
1759 // True if the sign bit of C1 is set.
1760 return DAG.getConstant(C1.isNegative(), VT);
1763 // True if the sign bit of C1 isn't set.
1764 return DAG.getConstant(C1.isNonNegative(), VT);
1770 // Otherwise, we can perform the comparison with the low bits.
1778 EVT newVT = N0.getOperand(0).getValueType();
1779 if (DCI.isBeforeLegalizeOps() ||
1780 (isOperationLegal(ISD::SETCC, newVT) &&
1781 getCondCodeAction(Cond, newVT)==Legal))
1782 return DAG.getSetCC(dl, VT, N0.getOperand(0),
1783 DAG.getConstant(APInt(C1).trunc(InSize), newVT),
1788 break; // todo, be more careful with signed comparisons
1790 } else if (N0.getOpcode() == ISD::SIGN_EXTEND_INREG &&
1791 (Cond == ISD::SETEQ || Cond == ISD::SETNE)) {
1792 EVT ExtSrcTy = cast<VTSDNode>(N0.getOperand(1))->getVT();
1793 unsigned ExtSrcTyBits = ExtSrcTy.getSizeInBits();
1794 EVT ExtDstTy = N0.getValueType();
1795 unsigned ExtDstTyBits = ExtDstTy.getSizeInBits();
1797 // If the extended part has any inconsistent bits, it cannot ever
1798 // compare equal. In other words, they have to be all ones or all
1801 APInt::getHighBitsSet(ExtDstTyBits, ExtDstTyBits - ExtSrcTyBits);
1802 if ((C1 & ExtBits) != 0 && (C1 & ExtBits) != ExtBits)
1803 return DAG.getConstant(Cond == ISD::SETNE, VT);
1806 EVT Op0Ty = N0.getOperand(0).getValueType();
1807 if (Op0Ty == ExtSrcTy) {
1808 ZextOp = N0.getOperand(0);
1810 APInt Imm = APInt::getLowBitsSet(ExtDstTyBits, ExtSrcTyBits);
1811 ZextOp = DAG.getNode(ISD::AND, dl, Op0Ty, N0.getOperand(0),
1812 DAG.getConstant(Imm, Op0Ty));
1814 if (!DCI.isCalledByLegalizer())
1815 DCI.AddToWorklist(ZextOp.getNode());
1816 // Otherwise, make this a use of a zext.
1817 return DAG.getSetCC(dl, VT, ZextOp,
1818 DAG.getConstant(C1 & APInt::getLowBitsSet(
1823 } else if ((N1C->isNullValue() || N1C->getAPIntValue() == 1) &&
1824 (Cond == ISD::SETEQ || Cond == ISD::SETNE)) {
1825 // SETCC (SETCC), [0|1], [EQ|NE] -> SETCC
1826 if (N0.getOpcode() == ISD::SETCC &&
1827 isTypeLegal(VT) && VT.bitsLE(N0.getValueType())) {
1828 bool TrueWhenTrue = (Cond == ISD::SETEQ) ^ (N1C->getAPIntValue() != 1);
1830 return DAG.getNode(ISD::TRUNCATE, dl, VT, N0);
1831 // Invert the condition.
1832 ISD::CondCode CC = cast<CondCodeSDNode>(N0.getOperand(2))->get();
1833 CC = ISD::getSetCCInverse(CC,
1834 N0.getOperand(0).getValueType().isInteger());
1835 return DAG.getSetCC(dl, VT, N0.getOperand(0), N0.getOperand(1), CC);
1838 if ((N0.getOpcode() == ISD::XOR ||
1839 (N0.getOpcode() == ISD::AND &&
1840 N0.getOperand(0).getOpcode() == ISD::XOR &&
1841 N0.getOperand(1) == N0.getOperand(0).getOperand(1))) &&
1842 isa<ConstantSDNode>(N0.getOperand(1)) &&
1843 cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue() == 1) {
1844 // If this is (X^1) == 0/1, swap the RHS and eliminate the xor. We
1845 // can only do this if the top bits are known zero.
1846 unsigned BitWidth = N0.getValueSizeInBits();
1847 if (DAG.MaskedValueIsZero(N0,
1848 APInt::getHighBitsSet(BitWidth,
1850 // Okay, get the un-inverted input value.
1852 if (N0.getOpcode() == ISD::XOR)
1853 Val = N0.getOperand(0);
1855 assert(N0.getOpcode() == ISD::AND &&
1856 N0.getOperand(0).getOpcode() == ISD::XOR);
1857 // ((X^1)&1)^1 -> X & 1
1858 Val = DAG.getNode(ISD::AND, dl, N0.getValueType(),
1859 N0.getOperand(0).getOperand(0),
1863 return DAG.getSetCC(dl, VT, Val, N1,
1864 Cond == ISD::SETEQ ? ISD::SETNE : ISD::SETEQ);
1866 } else if (N1C->getAPIntValue() == 1 &&
1868 getBooleanContents() == ZeroOrOneBooleanContent)) {
1870 if (Op0.getOpcode() == ISD::TRUNCATE)
1871 Op0 = Op0.getOperand(0);
1873 if ((Op0.getOpcode() == ISD::XOR) &&
1874 Op0.getOperand(0).getOpcode() == ISD::SETCC &&
1875 Op0.getOperand(1).getOpcode() == ISD::SETCC) {
1876 // (xor (setcc), (setcc)) == / != 1 -> (setcc) != / == (setcc)
1877 Cond = (Cond == ISD::SETEQ) ? ISD::SETNE : ISD::SETEQ;
1878 return DAG.getSetCC(dl, VT, Op0.getOperand(0), Op0.getOperand(1),
1880 } else if (Op0.getOpcode() == ISD::AND &&
1881 isa<ConstantSDNode>(Op0.getOperand(1)) &&
1882 cast<ConstantSDNode>(Op0.getOperand(1))->getAPIntValue() == 1) {
1883 // If this is (X&1) == / != 1, normalize it to (X&1) != / == 0.
1884 if (Op0.getValueType() != VT)
1885 Op0 = DAG.getNode(ISD::AND, dl, VT,
1886 DAG.getNode(ISD::TRUNCATE, dl, VT, Op0.getOperand(0)),
1887 DAG.getConstant(1, VT));
1888 return DAG.getSetCC(dl, VT, Op0,
1889 DAG.getConstant(0, Op0.getValueType()),
1890 Cond == ISD::SETEQ ? ISD::SETNE : ISD::SETEQ);
1895 APInt MinVal, MaxVal;
1896 unsigned OperandBitSize = N1C->getValueType(0).getSizeInBits();
1897 if (ISD::isSignedIntSetCC(Cond)) {
1898 MinVal = APInt::getSignedMinValue(OperandBitSize);
1899 MaxVal = APInt::getSignedMaxValue(OperandBitSize);
1901 MinVal = APInt::getMinValue(OperandBitSize);
1902 MaxVal = APInt::getMaxValue(OperandBitSize);
1905 // Canonicalize GE/LE comparisons to use GT/LT comparisons.
1906 if (Cond == ISD::SETGE || Cond == ISD::SETUGE) {
1907 if (C1 == MinVal) return DAG.getConstant(1, VT); // X >= MIN --> true
1908 // X >= C0 --> X > (C0-1)
1909 return DAG.getSetCC(dl, VT, N0,
1910 DAG.getConstant(C1-1, N1.getValueType()),
1911 (Cond == ISD::SETGE) ? ISD::SETGT : ISD::SETUGT);
1914 if (Cond == ISD::SETLE || Cond == ISD::SETULE) {
1915 if (C1 == MaxVal) return DAG.getConstant(1, VT); // X <= MAX --> true
1916 // X <= C0 --> X < (C0+1)
1917 return DAG.getSetCC(dl, VT, N0,
1918 DAG.getConstant(C1+1, N1.getValueType()),
1919 (Cond == ISD::SETLE) ? ISD::SETLT : ISD::SETULT);
1922 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C1 == MinVal)
1923 return DAG.getConstant(0, VT); // X < MIN --> false
1924 if ((Cond == ISD::SETGE || Cond == ISD::SETUGE) && C1 == MinVal)
1925 return DAG.getConstant(1, VT); // X >= MIN --> true
1926 if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C1 == MaxVal)
1927 return DAG.getConstant(0, VT); // X > MAX --> false
1928 if ((Cond == ISD::SETLE || Cond == ISD::SETULE) && C1 == MaxVal)
1929 return DAG.getConstant(1, VT); // X <= MAX --> true
1931 // Canonicalize setgt X, Min --> setne X, Min
1932 if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C1 == MinVal)
1933 return DAG.getSetCC(dl, VT, N0, N1, ISD::SETNE);
1934 // Canonicalize setlt X, Max --> setne X, Max
1935 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C1 == MaxVal)
1936 return DAG.getSetCC(dl, VT, N0, N1, ISD::SETNE);
1938 // If we have setult X, 1, turn it into seteq X, 0
1939 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C1 == MinVal+1)
1940 return DAG.getSetCC(dl, VT, N0,
1941 DAG.getConstant(MinVal, N0.getValueType()),
1943 // If we have setugt X, Max-1, turn it into seteq X, Max
1944 else if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C1 == MaxVal-1)
1945 return DAG.getSetCC(dl, VT, N0,
1946 DAG.getConstant(MaxVal, N0.getValueType()),
1949 // If we have "setcc X, C0", check to see if we can shrink the immediate
1952 // SETUGT X, SINTMAX -> SETLT X, 0
1953 if (Cond == ISD::SETUGT &&
1954 C1 == APInt::getSignedMaxValue(OperandBitSize))
1955 return DAG.getSetCC(dl, VT, N0,
1956 DAG.getConstant(0, N1.getValueType()),
1959 // SETULT X, SINTMIN -> SETGT X, -1
1960 if (Cond == ISD::SETULT &&
1961 C1 == APInt::getSignedMinValue(OperandBitSize)) {
1962 SDValue ConstMinusOne =
1963 DAG.getConstant(APInt::getAllOnesValue(OperandBitSize),
1965 return DAG.getSetCC(dl, VT, N0, ConstMinusOne, ISD::SETGT);
1968 // Fold bit comparisons when we can.
1969 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) &&
1970 (VT == N0.getValueType() ||
1971 (isTypeLegal(VT) && VT.bitsLE(N0.getValueType()))) &&
1972 N0.getOpcode() == ISD::AND)
1973 if (ConstantSDNode *AndRHS =
1974 dyn_cast<ConstantSDNode>(N0.getOperand(1))) {
1975 EVT ShiftTy = DCI.isBeforeLegalize() ?
1976 getPointerTy() : getShiftAmountTy();
1977 if (Cond == ISD::SETNE && C1 == 0) {// (X & 8) != 0 --> (X & 8) >> 3
1978 // Perform the xform if the AND RHS is a single bit.
1979 if (AndRHS->getAPIntValue().isPowerOf2()) {
1980 return DAG.getNode(ISD::TRUNCATE, dl, VT,
1981 DAG.getNode(ISD::SRL, dl, N0.getValueType(), N0,
1982 DAG.getConstant(AndRHS->getAPIntValue().logBase2(), ShiftTy)));
1984 } else if (Cond == ISD::SETEQ && C1 == AndRHS->getAPIntValue()) {
1985 // (X & 8) == 8 --> (X & 8) >> 3
1986 // Perform the xform if C1 is a single bit.
1987 if (C1.isPowerOf2()) {
1988 return DAG.getNode(ISD::TRUNCATE, dl, VT,
1989 DAG.getNode(ISD::SRL, dl, N0.getValueType(), N0,
1990 DAG.getConstant(C1.logBase2(), ShiftTy)));
1996 if (isa<ConstantFPSDNode>(N0.getNode())) {
1997 // Constant fold or commute setcc.
1998 SDValue O = DAG.FoldSetCC(VT, N0, N1, Cond, dl);
1999 if (O.getNode()) return O;
2000 } else if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(N1.getNode())) {
2001 // If the RHS of an FP comparison is a constant, simplify it away in
2003 if (CFP->getValueAPF().isNaN()) {
2004 // If an operand is known to be a nan, we can fold it.
2005 switch (ISD::getUnorderedFlavor(Cond)) {
2006 default: llvm_unreachable("Unknown flavor!");
2007 case 0: // Known false.
2008 return DAG.getConstant(0, VT);
2009 case 1: // Known true.
2010 return DAG.getConstant(1, VT);
2011 case 2: // Undefined.
2012 return DAG.getUNDEF(VT);
2016 // Otherwise, we know the RHS is not a NaN. Simplify the node to drop the
2017 // constant if knowing that the operand is non-nan is enough. We prefer to
2018 // have SETO(x,x) instead of SETO(x, 0.0) because this avoids having to
2020 if (Cond == ISD::SETO || Cond == ISD::SETUO)
2021 return DAG.getSetCC(dl, VT, N0, N0, Cond);
2023 // If the condition is not legal, see if we can find an equivalent one
2025 if (!isCondCodeLegal(Cond, N0.getValueType())) {
2026 // If the comparison was an awkward floating-point == or != and one of
2027 // the comparison operands is infinity or negative infinity, convert the
2028 // condition to a less-awkward <= or >=.
2029 if (CFP->getValueAPF().isInfinity()) {
2030 if (CFP->getValueAPF().isNegative()) {
2031 if (Cond == ISD::SETOEQ &&
2032 isCondCodeLegal(ISD::SETOLE, N0.getValueType()))
2033 return DAG.getSetCC(dl, VT, N0, N1, ISD::SETOLE);
2034 if (Cond == ISD::SETUEQ &&
2035 isCondCodeLegal(ISD::SETOLE, N0.getValueType()))
2036 return DAG.getSetCC(dl, VT, N0, N1, ISD::SETULE);
2037 if (Cond == ISD::SETUNE &&
2038 isCondCodeLegal(ISD::SETUGT, N0.getValueType()))
2039 return DAG.getSetCC(dl, VT, N0, N1, ISD::SETUGT);
2040 if (Cond == ISD::SETONE &&
2041 isCondCodeLegal(ISD::SETUGT, N0.getValueType()))
2042 return DAG.getSetCC(dl, VT, N0, N1, ISD::SETOGT);
2044 if (Cond == ISD::SETOEQ &&
2045 isCondCodeLegal(ISD::SETOGE, N0.getValueType()))
2046 return DAG.getSetCC(dl, VT, N0, N1, ISD::SETOGE);
2047 if (Cond == ISD::SETUEQ &&
2048 isCondCodeLegal(ISD::SETOGE, N0.getValueType()))
2049 return DAG.getSetCC(dl, VT, N0, N1, ISD::SETUGE);
2050 if (Cond == ISD::SETUNE &&
2051 isCondCodeLegal(ISD::SETULT, N0.getValueType()))
2052 return DAG.getSetCC(dl, VT, N0, N1, ISD::SETULT);
2053 if (Cond == ISD::SETONE &&
2054 isCondCodeLegal(ISD::SETULT, N0.getValueType()))
2055 return DAG.getSetCC(dl, VT, N0, N1, ISD::SETOLT);
2062 // We can always fold X == X for integer setcc's.
2063 if (N0.getValueType().isInteger())
2064 return DAG.getConstant(ISD::isTrueWhenEqual(Cond), VT);
2065 unsigned UOF = ISD::getUnorderedFlavor(Cond);
2066 if (UOF == 2) // FP operators that are undefined on NaNs.
2067 return DAG.getConstant(ISD::isTrueWhenEqual(Cond), VT);
2068 if (UOF == unsigned(ISD::isTrueWhenEqual(Cond)))
2069 return DAG.getConstant(UOF, VT);
2070 // Otherwise, we can't fold it. However, we can simplify it to SETUO/SETO
2071 // if it is not already.
2072 ISD::CondCode NewCond = UOF == 0 ? ISD::SETO : ISD::SETUO;
2073 if (NewCond != Cond)
2074 return DAG.getSetCC(dl, VT, N0, N1, NewCond);
2077 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) &&
2078 N0.getValueType().isInteger()) {
2079 if (N0.getOpcode() == ISD::ADD || N0.getOpcode() == ISD::SUB ||
2080 N0.getOpcode() == ISD::XOR) {
2081 // Simplify (X+Y) == (X+Z) --> Y == Z
2082 if (N0.getOpcode() == N1.getOpcode()) {
2083 if (N0.getOperand(0) == N1.getOperand(0))
2084 return DAG.getSetCC(dl, VT, N0.getOperand(1), N1.getOperand(1), Cond);
2085 if (N0.getOperand(1) == N1.getOperand(1))
2086 return DAG.getSetCC(dl, VT, N0.getOperand(0), N1.getOperand(0), Cond);
2087 if (DAG.isCommutativeBinOp(N0.getOpcode())) {
2088 // If X op Y == Y op X, try other combinations.
2089 if (N0.getOperand(0) == N1.getOperand(1))
2090 return DAG.getSetCC(dl, VT, N0.getOperand(1), N1.getOperand(0),
2092 if (N0.getOperand(1) == N1.getOperand(0))
2093 return DAG.getSetCC(dl, VT, N0.getOperand(0), N1.getOperand(1),
2098 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(N1)) {
2099 if (ConstantSDNode *LHSR = dyn_cast<ConstantSDNode>(N0.getOperand(1))) {
2100 // Turn (X+C1) == C2 --> X == C2-C1
2101 if (N0.getOpcode() == ISD::ADD && N0.getNode()->hasOneUse()) {
2102 return DAG.getSetCC(dl, VT, N0.getOperand(0),
2103 DAG.getConstant(RHSC->getAPIntValue()-
2104 LHSR->getAPIntValue(),
2105 N0.getValueType()), Cond);
2108 // Turn (X^C1) == C2 into X == C1^C2 iff X&~C1 = 0.
2109 if (N0.getOpcode() == ISD::XOR)
2110 // If we know that all of the inverted bits are zero, don't bother
2111 // performing the inversion.
2112 if (DAG.MaskedValueIsZero(N0.getOperand(0), ~LHSR->getAPIntValue()))
2114 DAG.getSetCC(dl, VT, N0.getOperand(0),
2115 DAG.getConstant(LHSR->getAPIntValue() ^
2116 RHSC->getAPIntValue(),
2121 // Turn (C1-X) == C2 --> X == C1-C2
2122 if (ConstantSDNode *SUBC = dyn_cast<ConstantSDNode>(N0.getOperand(0))) {
2123 if (N0.getOpcode() == ISD::SUB && N0.getNode()->hasOneUse()) {
2125 DAG.getSetCC(dl, VT, N0.getOperand(1),
2126 DAG.getConstant(SUBC->getAPIntValue() -
2127 RHSC->getAPIntValue(),
2134 // Simplify (X+Z) == X --> Z == 0
2135 if (N0.getOperand(0) == N1)
2136 return DAG.getSetCC(dl, VT, N0.getOperand(1),
2137 DAG.getConstant(0, N0.getValueType()), Cond);
2138 if (N0.getOperand(1) == N1) {
2139 if (DAG.isCommutativeBinOp(N0.getOpcode()))
2140 return DAG.getSetCC(dl, VT, N0.getOperand(0),
2141 DAG.getConstant(0, N0.getValueType()), Cond);
2142 else if (N0.getNode()->hasOneUse()) {
2143 assert(N0.getOpcode() == ISD::SUB && "Unexpected operation!");
2144 // (Z-X) == X --> Z == X<<1
2145 SDValue SH = DAG.getNode(ISD::SHL, dl, N1.getValueType(),
2147 DAG.getConstant(1, getShiftAmountTy()));
2148 if (!DCI.isCalledByLegalizer())
2149 DCI.AddToWorklist(SH.getNode());
2150 return DAG.getSetCC(dl, VT, N0.getOperand(0), SH, Cond);
2155 if (N1.getOpcode() == ISD::ADD || N1.getOpcode() == ISD::SUB ||
2156 N1.getOpcode() == ISD::XOR) {
2157 // Simplify X == (X+Z) --> Z == 0
2158 if (N1.getOperand(0) == N0) {
2159 return DAG.getSetCC(dl, VT, N1.getOperand(1),
2160 DAG.getConstant(0, N1.getValueType()), Cond);
2161 } else if (N1.getOperand(1) == N0) {
2162 if (DAG.isCommutativeBinOp(N1.getOpcode())) {
2163 return DAG.getSetCC(dl, VT, N1.getOperand(0),
2164 DAG.getConstant(0, N1.getValueType()), Cond);
2165 } else if (N1.getNode()->hasOneUse()) {
2166 assert(N1.getOpcode() == ISD::SUB && "Unexpected operation!");
2167 // X == (Z-X) --> X<<1 == Z
2168 SDValue SH = DAG.getNode(ISD::SHL, dl, N1.getValueType(), N0,
2169 DAG.getConstant(1, getShiftAmountTy()));
2170 if (!DCI.isCalledByLegalizer())
2171 DCI.AddToWorklist(SH.getNode());
2172 return DAG.getSetCC(dl, VT, SH, N1.getOperand(0), Cond);
2177 // Simplify x&y == y to x&y != 0 if y has exactly one bit set.
2178 // Note that where y is variable and is known to have at most
2179 // one bit set (for example, if it is z&1) we cannot do this;
2180 // the expressions are not equivalent when y==0.
2181 if (N0.getOpcode() == ISD::AND)
2182 if (N0.getOperand(0) == N1 || N0.getOperand(1) == N1) {
2183 if (ValueHasExactlyOneBitSet(N1, DAG)) {
2184 Cond = ISD::getSetCCInverse(Cond, /*isInteger=*/true);
2185 SDValue Zero = DAG.getConstant(0, N1.getValueType());
2186 return DAG.getSetCC(dl, VT, N0, Zero, Cond);
2189 if (N1.getOpcode() == ISD::AND)
2190 if (N1.getOperand(0) == N0 || N1.getOperand(1) == N0) {
2191 if (ValueHasExactlyOneBitSet(N0, DAG)) {
2192 Cond = ISD::getSetCCInverse(Cond, /*isInteger=*/true);
2193 SDValue Zero = DAG.getConstant(0, N0.getValueType());
2194 return DAG.getSetCC(dl, VT, N1, Zero, Cond);
2199 // Fold away ALL boolean setcc's.
2201 if (N0.getValueType() == MVT::i1 && foldBooleans) {
2203 default: llvm_unreachable("Unknown integer setcc!");
2204 case ISD::SETEQ: // X == Y -> ~(X^Y)
2205 Temp = DAG.getNode(ISD::XOR, dl, MVT::i1, N0, N1);
2206 N0 = DAG.getNOT(dl, Temp, MVT::i1);
2207 if (!DCI.isCalledByLegalizer())
2208 DCI.AddToWorklist(Temp.getNode());
2210 case ISD::SETNE: // X != Y --> (X^Y)
2211 N0 = DAG.getNode(ISD::XOR, dl, MVT::i1, N0, N1);
2213 case ISD::SETGT: // X >s Y --> X == 0 & Y == 1 --> ~X & Y
2214 case ISD::SETULT: // X <u Y --> X == 0 & Y == 1 --> ~X & Y
2215 Temp = DAG.getNOT(dl, N0, MVT::i1);
2216 N0 = DAG.getNode(ISD::AND, dl, MVT::i1, N1, Temp);
2217 if (!DCI.isCalledByLegalizer())
2218 DCI.AddToWorklist(Temp.getNode());
2220 case ISD::SETLT: // X <s Y --> X == 1 & Y == 0 --> ~Y & X
2221 case ISD::SETUGT: // X >u Y --> X == 1 & Y == 0 --> ~Y & X
2222 Temp = DAG.getNOT(dl, N1, MVT::i1);
2223 N0 = DAG.getNode(ISD::AND, dl, MVT::i1, N0, Temp);
2224 if (!DCI.isCalledByLegalizer())
2225 DCI.AddToWorklist(Temp.getNode());
2227 case ISD::SETULE: // X <=u Y --> X == 0 | Y == 1 --> ~X | Y
2228 case ISD::SETGE: // X >=s Y --> X == 0 | Y == 1 --> ~X | Y
2229 Temp = DAG.getNOT(dl, N0, MVT::i1);
2230 N0 = DAG.getNode(ISD::OR, dl, MVT::i1, N1, Temp);
2231 if (!DCI.isCalledByLegalizer())
2232 DCI.AddToWorklist(Temp.getNode());
2234 case ISD::SETUGE: // X >=u Y --> X == 1 | Y == 0 --> ~Y | X
2235 case ISD::SETLE: // X <=s Y --> X == 1 | Y == 0 --> ~Y | X
2236 Temp = DAG.getNOT(dl, N1, MVT::i1);
2237 N0 = DAG.getNode(ISD::OR, dl, MVT::i1, N0, Temp);
2240 if (VT != MVT::i1) {
2241 if (!DCI.isCalledByLegalizer())
2242 DCI.AddToWorklist(N0.getNode());
2243 // FIXME: If running after legalize, we probably can't do this.
2244 N0 = DAG.getNode(ISD::ZERO_EXTEND, dl, VT, N0);
2249 // Could not fold it.
2253 /// isGAPlusOffset - Returns true (and the GlobalValue and the offset) if the
2254 /// node is a GlobalAddress + offset.
2255 bool TargetLowering::isGAPlusOffset(SDNode *N, const GlobalValue* &GA,
2256 int64_t &Offset) const {
2257 if (isa<GlobalAddressSDNode>(N)) {
2258 GlobalAddressSDNode *GASD = cast<GlobalAddressSDNode>(N);
2259 GA = GASD->getGlobal();
2260 Offset += GASD->getOffset();
2264 if (N->getOpcode() == ISD::ADD) {
2265 SDValue N1 = N->getOperand(0);
2266 SDValue N2 = N->getOperand(1);
2267 if (isGAPlusOffset(N1.getNode(), GA, Offset)) {
2268 ConstantSDNode *V = dyn_cast<ConstantSDNode>(N2);
2270 Offset += V->getSExtValue();
2273 } else if (isGAPlusOffset(N2.getNode(), GA, Offset)) {
2274 ConstantSDNode *V = dyn_cast<ConstantSDNode>(N1);
2276 Offset += V->getSExtValue();
2285 SDValue TargetLowering::
2286 PerformDAGCombine(SDNode *N, DAGCombinerInfo &DCI) const {
2287 // Default implementation: no optimization.
2291 //===----------------------------------------------------------------------===//
2292 // Inline Assembler Implementation Methods
2293 //===----------------------------------------------------------------------===//
2296 TargetLowering::ConstraintType
2297 TargetLowering::getConstraintType(const std::string &Constraint) const {
2298 // FIXME: lots more standard ones to handle.
2299 if (Constraint.size() == 1) {
2300 switch (Constraint[0]) {
2302 case 'r': return C_RegisterClass;
2304 case 'o': // offsetable
2305 case 'V': // not offsetable
2307 case 'i': // Simple Integer or Relocatable Constant
2308 case 'n': // Simple Integer
2309 case 's': // Relocatable Constant
2310 case 'X': // Allow ANY value.
2311 case 'I': // Target registers.
2323 if (Constraint.size() > 1 && Constraint[0] == '{' &&
2324 Constraint[Constraint.size()-1] == '}')
2329 /// LowerXConstraint - try to replace an X constraint, which matches anything,
2330 /// with another that has more specific requirements based on the type of the
2331 /// corresponding operand.
2332 const char *TargetLowering::LowerXConstraint(EVT ConstraintVT) const{
2333 if (ConstraintVT.isInteger())
2335 if (ConstraintVT.isFloatingPoint())
2336 return "f"; // works for many targets
2340 /// LowerAsmOperandForConstraint - Lower the specified operand into the Ops
2341 /// vector. If it is invalid, don't add anything to Ops.
2342 void TargetLowering::LowerAsmOperandForConstraint(SDValue Op,
2343 char ConstraintLetter,
2345 std::vector<SDValue> &Ops,
2346 SelectionDAG &DAG) const {
2347 switch (ConstraintLetter) {
2349 case 'X': // Allows any operand; labels (basic block) use this.
2350 if (Op.getOpcode() == ISD::BasicBlock) {
2355 case 'i': // Simple Integer or Relocatable Constant
2356 case 'n': // Simple Integer
2357 case 's': { // Relocatable Constant
2358 // These operands are interested in values of the form (GV+C), where C may
2359 // be folded in as an offset of GV, or it may be explicitly added. Also, it
2360 // is possible and fine if either GV or C are missing.
2361 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op);
2362 GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(Op);
2364 // If we have "(add GV, C)", pull out GV/C
2365 if (Op.getOpcode() == ISD::ADD) {
2366 C = dyn_cast<ConstantSDNode>(Op.getOperand(1));
2367 GA = dyn_cast<GlobalAddressSDNode>(Op.getOperand(0));
2368 if (C == 0 || GA == 0) {
2369 C = dyn_cast<ConstantSDNode>(Op.getOperand(0));
2370 GA = dyn_cast<GlobalAddressSDNode>(Op.getOperand(1));
2372 if (C == 0 || GA == 0)
2376 // If we find a valid operand, map to the TargetXXX version so that the
2377 // value itself doesn't get selected.
2378 if (GA) { // Either &GV or &GV+C
2379 if (ConstraintLetter != 'n') {
2380 int64_t Offs = GA->getOffset();
2381 if (C) Offs += C->getZExtValue();
2382 Ops.push_back(DAG.getTargetGlobalAddress(GA->getGlobal(),
2383 Op.getValueType(), Offs));
2387 if (C) { // just C, no GV.
2388 // Simple constants are not allowed for 's'.
2389 if (ConstraintLetter != 's') {
2390 // gcc prints these as sign extended. Sign extend value to 64 bits
2391 // now; without this it would get ZExt'd later in
2392 // ScheduleDAGSDNodes::EmitNode, which is very generic.
2393 Ops.push_back(DAG.getTargetConstant(C->getAPIntValue().getSExtValue(),
2403 std::vector<unsigned> TargetLowering::
2404 getRegClassForInlineAsmConstraint(const std::string &Constraint,
2406 return std::vector<unsigned>();
2410 std::pair<unsigned, const TargetRegisterClass*> TargetLowering::
2411 getRegForInlineAsmConstraint(const std::string &Constraint,
2413 if (Constraint[0] != '{')
2414 return std::pair<unsigned, const TargetRegisterClass*>(0, 0);
2415 assert(*(Constraint.end()-1) == '}' && "Not a brace enclosed constraint?");
2417 // Remove the braces from around the name.
2418 StringRef RegName(Constraint.data()+1, Constraint.size()-2);
2420 // Figure out which register class contains this reg.
2421 const TargetRegisterInfo *RI = TM.getRegisterInfo();
2422 for (TargetRegisterInfo::regclass_iterator RCI = RI->regclass_begin(),
2423 E = RI->regclass_end(); RCI != E; ++RCI) {
2424 const TargetRegisterClass *RC = *RCI;
2426 // If none of the value types for this register class are valid, we
2427 // can't use it. For example, 64-bit reg classes on 32-bit targets.
2428 bool isLegal = false;
2429 for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end();
2431 if (isTypeLegal(*I)) {
2437 if (!isLegal) continue;
2439 for (TargetRegisterClass::iterator I = RC->begin(), E = RC->end();
2441 if (RegName.equals_lower(RI->getName(*I)))
2442 return std::make_pair(*I, RC);
2446 return std::pair<unsigned, const TargetRegisterClass*>(0, 0);
2449 //===----------------------------------------------------------------------===//
2450 // Constraint Selection.
2452 /// isMatchingInputConstraint - Return true of this is an input operand that is
2453 /// a matching constraint like "4".
2454 bool TargetLowering::AsmOperandInfo::isMatchingInputConstraint() const {
2455 assert(!ConstraintCode.empty() && "No known constraint!");
2456 return isdigit(ConstraintCode[0]);
2459 /// getMatchedOperand - If this is an input matching constraint, this method
2460 /// returns the output operand it matches.
2461 unsigned TargetLowering::AsmOperandInfo::getMatchedOperand() const {
2462 assert(!ConstraintCode.empty() && "No known constraint!");
2463 return atoi(ConstraintCode.c_str());
2467 /// getConstraintGenerality - Return an integer indicating how general CT
2469 static unsigned getConstraintGenerality(TargetLowering::ConstraintType CT) {
2471 default: llvm_unreachable("Unknown constraint type!");
2472 case TargetLowering::C_Other:
2473 case TargetLowering::C_Unknown:
2475 case TargetLowering::C_Register:
2477 case TargetLowering::C_RegisterClass:
2479 case TargetLowering::C_Memory:
2484 /// ChooseConstraint - If there are multiple different constraints that we
2485 /// could pick for this operand (e.g. "imr") try to pick the 'best' one.
2486 /// This is somewhat tricky: constraints fall into four classes:
2487 /// Other -> immediates and magic values
2488 /// Register -> one specific register
2489 /// RegisterClass -> a group of regs
2490 /// Memory -> memory
2491 /// Ideally, we would pick the most specific constraint possible: if we have
2492 /// something that fits into a register, we would pick it. The problem here
2493 /// is that if we have something that could either be in a register or in
2494 /// memory that use of the register could cause selection of *other*
2495 /// operands to fail: they might only succeed if we pick memory. Because of
2496 /// this the heuristic we use is:
2498 /// 1) If there is an 'other' constraint, and if the operand is valid for
2499 /// that constraint, use it. This makes us take advantage of 'i'
2500 /// constraints when available.
2501 /// 2) Otherwise, pick the most general constraint present. This prefers
2502 /// 'm' over 'r', for example.
2504 static void ChooseConstraint(TargetLowering::AsmOperandInfo &OpInfo,
2505 bool hasMemory, const TargetLowering &TLI,
2506 SDValue Op, SelectionDAG *DAG) {
2507 assert(OpInfo.Codes.size() > 1 && "Doesn't have multiple constraint options");
2508 unsigned BestIdx = 0;
2509 TargetLowering::ConstraintType BestType = TargetLowering::C_Unknown;
2510 int BestGenerality = -1;
2512 // Loop over the options, keeping track of the most general one.
2513 for (unsigned i = 0, e = OpInfo.Codes.size(); i != e; ++i) {
2514 TargetLowering::ConstraintType CType =
2515 TLI.getConstraintType(OpInfo.Codes[i]);
2517 // If this is an 'other' constraint, see if the operand is valid for it.
2518 // For example, on X86 we might have an 'rI' constraint. If the operand
2519 // is an integer in the range [0..31] we want to use I (saving a load
2520 // of a register), otherwise we must use 'r'.
2521 if (CType == TargetLowering::C_Other && Op.getNode()) {
2522 assert(OpInfo.Codes[i].size() == 1 &&
2523 "Unhandled multi-letter 'other' constraint");
2524 std::vector<SDValue> ResultOps;
2525 TLI.LowerAsmOperandForConstraint(Op, OpInfo.Codes[i][0], hasMemory,
2527 if (!ResultOps.empty()) {
2534 // This constraint letter is more general than the previous one, use it.
2535 int Generality = getConstraintGenerality(CType);
2536 if (Generality > BestGenerality) {
2539 BestGenerality = Generality;
2543 OpInfo.ConstraintCode = OpInfo.Codes[BestIdx];
2544 OpInfo.ConstraintType = BestType;
2547 /// ComputeConstraintToUse - Determines the constraint code and constraint
2548 /// type to use for the specific AsmOperandInfo, setting
2549 /// OpInfo.ConstraintCode and OpInfo.ConstraintType.
2550 void TargetLowering::ComputeConstraintToUse(AsmOperandInfo &OpInfo,
2553 SelectionDAG *DAG) const {
2554 assert(!OpInfo.Codes.empty() && "Must have at least one constraint");
2556 // Single-letter constraints ('r') are very common.
2557 if (OpInfo.Codes.size() == 1) {
2558 OpInfo.ConstraintCode = OpInfo.Codes[0];
2559 OpInfo.ConstraintType = getConstraintType(OpInfo.ConstraintCode);
2561 ChooseConstraint(OpInfo, hasMemory, *this, Op, DAG);
2564 // 'X' matches anything.
2565 if (OpInfo.ConstraintCode == "X" && OpInfo.CallOperandVal) {
2566 // Labels and constants are handled elsewhere ('X' is the only thing
2567 // that matches labels). For Functions, the type here is the type of
2568 // the result, which is not what we want to look at; leave them alone.
2569 Value *v = OpInfo.CallOperandVal;
2570 if (isa<BasicBlock>(v) || isa<ConstantInt>(v) || isa<Function>(v)) {
2571 OpInfo.CallOperandVal = v;
2575 // Otherwise, try to resolve it to something we know about by looking at
2576 // the actual operand type.
2577 if (const char *Repl = LowerXConstraint(OpInfo.ConstraintVT)) {
2578 OpInfo.ConstraintCode = Repl;
2579 OpInfo.ConstraintType = getConstraintType(OpInfo.ConstraintCode);
2584 //===----------------------------------------------------------------------===//
2585 // Loop Strength Reduction hooks
2586 //===----------------------------------------------------------------------===//
2588 /// isLegalAddressingMode - Return true if the addressing mode represented
2589 /// by AM is legal for this target, for a load/store of the specified type.
2590 bool TargetLowering::isLegalAddressingMode(const AddrMode &AM,
2591 const Type *Ty) const {
2592 // The default implementation of this implements a conservative RISCy, r+r and
2595 // Allows a sign-extended 16-bit immediate field.
2596 if (AM.BaseOffs <= -(1LL << 16) || AM.BaseOffs >= (1LL << 16)-1)
2599 // No global is ever allowed as a base.
2603 // Only support r+r,
2605 case 0: // "r+i" or just "i", depending on HasBaseReg.
2608 if (AM.HasBaseReg && AM.BaseOffs) // "r+r+i" is not allowed.
2610 // Otherwise we have r+r or r+i.
2613 if (AM.HasBaseReg || AM.BaseOffs) // 2*r+r or 2*r+i is not allowed.
2615 // Allow 2*r as r+r.
2622 /// BuildSDIVSequence - Given an ISD::SDIV node expressing a divide by constant,
2623 /// return a DAG expression to select that will generate the same value by
2624 /// multiplying by a magic number. See:
2625 /// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
2626 SDValue TargetLowering::BuildSDIV(SDNode *N, SelectionDAG &DAG,
2627 std::vector<SDNode*>* Created) const {
2628 EVT VT = N->getValueType(0);
2629 DebugLoc dl= N->getDebugLoc();
2631 // Check to see if we can do this.
2632 // FIXME: We should be more aggressive here.
2633 if (!isTypeLegal(VT))
2636 APInt d = cast<ConstantSDNode>(N->getOperand(1))->getAPIntValue();
2637 APInt::ms magics = d.magic();
2639 // Multiply the numerator (operand 0) by the magic value
2640 // FIXME: We should support doing a MUL in a wider type
2642 if (isOperationLegalOrCustom(ISD::MULHS, VT))
2643 Q = DAG.getNode(ISD::MULHS, dl, VT, N->getOperand(0),
2644 DAG.getConstant(magics.m, VT));
2645 else if (isOperationLegalOrCustom(ISD::SMUL_LOHI, VT))
2646 Q = SDValue(DAG.getNode(ISD::SMUL_LOHI, dl, DAG.getVTList(VT, VT),
2648 DAG.getConstant(magics.m, VT)).getNode(), 1);
2650 return SDValue(); // No mulhs or equvialent
2651 // If d > 0 and m < 0, add the numerator
2652 if (d.isStrictlyPositive() && magics.m.isNegative()) {
2653 Q = DAG.getNode(ISD::ADD, dl, VT, Q, N->getOperand(0));
2655 Created->push_back(Q.getNode());
2657 // If d < 0 and m > 0, subtract the numerator.
2658 if (d.isNegative() && magics.m.isStrictlyPositive()) {
2659 Q = DAG.getNode(ISD::SUB, dl, VT, Q, N->getOperand(0));
2661 Created->push_back(Q.getNode());
2663 // Shift right algebraic if shift value is nonzero
2665 Q = DAG.getNode(ISD::SRA, dl, VT, Q,
2666 DAG.getConstant(magics.s, getShiftAmountTy()));
2668 Created->push_back(Q.getNode());
2670 // Extract the sign bit and add it to the quotient
2672 DAG.getNode(ISD::SRL, dl, VT, Q, DAG.getConstant(VT.getSizeInBits()-1,
2673 getShiftAmountTy()));
2675 Created->push_back(T.getNode());
2676 return DAG.getNode(ISD::ADD, dl, VT, Q, T);
2679 /// BuildUDIVSequence - Given an ISD::UDIV node expressing a divide by constant,
2680 /// return a DAG expression to select that will generate the same value by
2681 /// multiplying by a magic number. See:
2682 /// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
2683 SDValue TargetLowering::BuildUDIV(SDNode *N, SelectionDAG &DAG,
2684 std::vector<SDNode*>* Created) const {
2685 EVT VT = N->getValueType(0);
2686 DebugLoc dl = N->getDebugLoc();
2688 // Check to see if we can do this.
2689 // FIXME: We should be more aggressive here.
2690 if (!isTypeLegal(VT))
2693 // FIXME: We should use a narrower constant when the upper
2694 // bits are known to be zero.
2695 ConstantSDNode *N1C = cast<ConstantSDNode>(N->getOperand(1));
2696 APInt::mu magics = N1C->getAPIntValue().magicu();
2698 // Multiply the numerator (operand 0) by the magic value
2699 // FIXME: We should support doing a MUL in a wider type
2701 if (isOperationLegalOrCustom(ISD::MULHU, VT))
2702 Q = DAG.getNode(ISD::MULHU, dl, VT, N->getOperand(0),
2703 DAG.getConstant(magics.m, VT));
2704 else if (isOperationLegalOrCustom(ISD::UMUL_LOHI, VT))
2705 Q = SDValue(DAG.getNode(ISD::UMUL_LOHI, dl, DAG.getVTList(VT, VT),
2707 DAG.getConstant(magics.m, VT)).getNode(), 1);
2709 return SDValue(); // No mulhu or equvialent
2711 Created->push_back(Q.getNode());
2713 if (magics.a == 0) {
2714 assert(magics.s < N1C->getAPIntValue().getBitWidth() &&
2715 "We shouldn't generate an undefined shift!");
2716 return DAG.getNode(ISD::SRL, dl, VT, Q,
2717 DAG.getConstant(magics.s, getShiftAmountTy()));
2719 SDValue NPQ = DAG.getNode(ISD::SUB, dl, VT, N->getOperand(0), Q);
2721 Created->push_back(NPQ.getNode());
2722 NPQ = DAG.getNode(ISD::SRL, dl, VT, NPQ,
2723 DAG.getConstant(1, getShiftAmountTy()));
2725 Created->push_back(NPQ.getNode());
2726 NPQ = DAG.getNode(ISD::ADD, dl, VT, NPQ, Q);
2728 Created->push_back(NPQ.getNode());
2729 return DAG.getNode(ISD::SRL, dl, VT, NPQ,
2730 DAG.getConstant(magics.s-1, getShiftAmountTy()));