blob: e40520d1548545242f99ccd92b0ef8eba22c885f [file] [log] [blame]
Rafael Espindolab90c5f12012-11-21 16:56:33 +00001//===- HexagonOperands.td - Hexagon immediate processing -*- tablegen -*-===//
Tony Linthicum1213a7a2011-12-12 21:14:40 +00002//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illnois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
Jyotsna Verma3ec3a492012-11-21 19:53:42 +000010// Immediate operands.
11
12let PrintMethod = "printImmOperand" in {
13 // f32Ext type is used to identify constant extended floating point immediates.
14 def f32Ext : Operand<f32>;
15 def s32Imm : Operand<i32>;
16 def s26_6Imm : Operand<i32>;
17 def s16Imm : Operand<i32>;
18 def s12Imm : Operand<i32>;
19 def s11Imm : Operand<i32>;
20 def s11_0Imm : Operand<i32>;
21 def s11_1Imm : Operand<i32>;
22 def s11_2Imm : Operand<i32>;
23 def s11_3Imm : Operand<i32>;
24 def s10Imm : Operand<i32>;
25 def s9Imm : Operand<i32>;
26 def m9Imm : Operand<i32>;
27 def s8Imm : Operand<i32>;
28 def s8Imm64 : Operand<i64>;
29 def s6Imm : Operand<i32>;
30 def s4Imm : Operand<i32>;
31 def s4_0Imm : Operand<i32>;
32 def s4_1Imm : Operand<i32>;
33 def s4_2Imm : Operand<i32>;
34 def s4_3Imm : Operand<i32>;
35 def u64Imm : Operand<i64>;
36 def u32Imm : Operand<i32>;
37 def u26_6Imm : Operand<i32>;
38 def u16Imm : Operand<i32>;
39 def u16_0Imm : Operand<i32>;
40 def u16_1Imm : Operand<i32>;
41 def u16_2Imm : Operand<i32>;
42 def u11_3Imm : Operand<i32>;
43 def u10Imm : Operand<i32>;
44 def u9Imm : Operand<i32>;
45 def u8Imm : Operand<i32>;
46 def u7Imm : Operand<i32>;
47 def u6Imm : Operand<i32>;
48 def u6_0Imm : Operand<i32>;
49 def u6_1Imm : Operand<i32>;
50 def u6_2Imm : Operand<i32>;
51 def u6_3Imm : Operand<i32>;
52 def u5Imm : Operand<i32>;
53 def u4Imm : Operand<i32>;
54 def u3Imm : Operand<i32>;
55 def u2Imm : Operand<i32>;
56 def u1Imm : Operand<i32>;
57 def n8Imm : Operand<i32>;
58 def m6Imm : Operand<i32>;
Tony Linthicum1213a7a2011-12-12 21:14:40 +000059}
60
Jyotsna Verma3ec3a492012-11-21 19:53:42 +000061let PrintMethod = "printNOneImmOperand" in
62def nOneImm : Operand<i32>;
Sirish Pande30804c22012-02-15 18:52:27 +000063
Tony Linthicum1213a7a2011-12-12 21:14:40 +000064//
65// Immediate predicates
66//
67def s32ImmPred : PatLeaf<(i32 imm), [{
Jyotsna Vermab5bb6592012-11-26 21:56:51 +000068 // s32ImmPred predicate - True if the immediate fits in a 32-bit sign extended
Tony Linthicum1213a7a2011-12-12 21:14:40 +000069 // field.
70 int64_t v = (int64_t)N->getSExtValue();
71 return isInt<32>(v);
72}]>;
73
74def s32_24ImmPred : PatLeaf<(i32 imm), [{
75 // s32_24ImmPred predicate - True if the immediate fits in a 32-bit sign
76 // extended field that is a multiple of 0x1000000.
77 int64_t v = (int64_t)N->getSExtValue();
78 return isShiftedInt<32,24>(v);
79}]>;
80
81def s32_16s8ImmPred : PatLeaf<(i32 imm), [{
82 // s32_16s8ImmPred predicate - True if the immediate fits in a 32-bit sign
83 // extended field that is a multiple of 0x10000.
84 int64_t v = (int64_t)N->getSExtValue();
85 return isShiftedInt<24,16>(v);
86}]>;
87
Jyotsna Verma0df99bd2012-11-21 20:05:09 +000088def s26_6ImmPred : PatLeaf<(i32 imm), [{
Jyotsna Vermab5bb6592012-11-26 21:56:51 +000089 // s26_6ImmPred predicate - True if the immediate fits in a 32-bit
90 // sign extended field.
Jyotsna Verma0df99bd2012-11-21 20:05:09 +000091 int64_t v = (int64_t)N->getSExtValue();
92 return isShiftedInt<26,6>(v);
93}]>;
94
95
Tony Linthicum1213a7a2011-12-12 21:14:40 +000096def s16ImmPred : PatLeaf<(i32 imm), [{
Jyotsna Vermab5bb6592012-11-26 21:56:51 +000097 // s16ImmPred predicate - True if the immediate fits in a 16-bit sign extended
Tony Linthicum1213a7a2011-12-12 21:14:40 +000098 // field.
99 int64_t v = (int64_t)N->getSExtValue();
100 return isInt<16>(v);
101}]>;
102
103
104def s13ImmPred : PatLeaf<(i32 imm), [{
Jyotsna Vermab5bb6592012-11-26 21:56:51 +0000105 // s13ImmPred predicate - True if the immediate fits in a 13-bit sign extended
Tony Linthicum1213a7a2011-12-12 21:14:40 +0000106 // field.
107 int64_t v = (int64_t)N->getSExtValue();
108 return isInt<13>(v);
109}]>;
110
111
112def s12ImmPred : PatLeaf<(i32 imm), [{
Jyotsna Vermab5bb6592012-11-26 21:56:51 +0000113 // s12ImmPred predicate - True if the immediate fits in a 12-bit
114 // sign extended field.
Tony Linthicum1213a7a2011-12-12 21:14:40 +0000115 int64_t v = (int64_t)N->getSExtValue();
116 return isInt<12>(v);
117}]>;
118
119def s11_0ImmPred : PatLeaf<(i32 imm), [{
Jyotsna Vermab5bb6592012-11-26 21:56:51 +0000120 // s11_0ImmPred predicate - True if the immediate fits in a 11-bit
121 // sign extended field.
Tony Linthicum1213a7a2011-12-12 21:14:40 +0000122 int64_t v = (int64_t)N->getSExtValue();
123 return isInt<11>(v);
124}]>;
125
126
127def s11_1ImmPred : PatLeaf<(i32 imm), [{
Jyotsna Vermab5bb6592012-11-26 21:56:51 +0000128 // s11_1ImmPred predicate - True if the immediate fits in a 12-bit
129 // sign extended field and is a multiple of 2.
Tony Linthicum1213a7a2011-12-12 21:14:40 +0000130 int64_t v = (int64_t)N->getSExtValue();
131 return isShiftedInt<11,1>(v);
132}]>;
133
134
135def s11_2ImmPred : PatLeaf<(i32 imm), [{
Jyotsna Vermab5bb6592012-11-26 21:56:51 +0000136 // s11_2ImmPred predicate - True if the immediate fits in a 13-bit
137 // sign extended field and is a multiple of 4.
Tony Linthicum1213a7a2011-12-12 21:14:40 +0000138 int64_t v = (int64_t)N->getSExtValue();
139 return isShiftedInt<11,2>(v);
140}]>;
141
142
143def s11_3ImmPred : PatLeaf<(i32 imm), [{
Jyotsna Vermab5bb6592012-11-26 21:56:51 +0000144 // s11_3ImmPred predicate - True if the immediate fits in a 14-bit
145 // sign extended field and is a multiple of 8.
Tony Linthicum1213a7a2011-12-12 21:14:40 +0000146 int64_t v = (int64_t)N->getSExtValue();
147 return isShiftedInt<11,3>(v);
148}]>;
149
150
151def s10ImmPred : PatLeaf<(i32 imm), [{
152 // s10ImmPred predicate - True if the immediate fits in a 10-bit sign extended
153 // field.
154 int64_t v = (int64_t)N->getSExtValue();
155 return isInt<10>(v);
156}]>;
157
158
159def s9ImmPred : PatLeaf<(i32 imm), [{
160 // s9ImmPred predicate - True if the immediate fits in a 9-bit sign extended
161 // field.
162 int64_t v = (int64_t)N->getSExtValue();
163 return isInt<9>(v);
164}]>;
165
Jyotsna Verma0df99bd2012-11-21 20:05:09 +0000166def m9ImmPred : PatLeaf<(i32 imm), [{
167 // m9ImmPred predicate - True if the immediate fits in a 9-bit magnitude
168 // field. The range of m9 is -255 to 255.
169 int64_t v = (int64_t)N->getSExtValue();
170 return isInt<9>(v) && (v != -256);
171}]>;
Tony Linthicum1213a7a2011-12-12 21:14:40 +0000172
173def s8ImmPred : PatLeaf<(i32 imm), [{
174 // s8ImmPred predicate - True if the immediate fits in a 8-bit sign extended
175 // field.
176 int64_t v = (int64_t)N->getSExtValue();
177 return isInt<8>(v);
178}]>;
179
180
181def s8Imm64Pred : PatLeaf<(i64 imm), [{
182 // s8ImmPred predicate - True if the immediate fits in a 8-bit sign extended
183 // field.
184 int64_t v = (int64_t)N->getSExtValue();
185 return isInt<8>(v);
186}]>;
187
188
189def s6ImmPred : PatLeaf<(i32 imm), [{
190 // s6ImmPred predicate - True if the immediate fits in a 6-bit sign extended
191 // field.
192 int64_t v = (int64_t)N->getSExtValue();
193 return isInt<6>(v);
194}]>;
195
196
197def s4_0ImmPred : PatLeaf<(i32 imm), [{
198 // s4_0ImmPred predicate - True if the immediate fits in a 4-bit sign extended
199 // field.
200 int64_t v = (int64_t)N->getSExtValue();
201 return isInt<4>(v);
202}]>;
203
204
205def s4_1ImmPred : PatLeaf<(i32 imm), [{
206 // s4_1ImmPred predicate - True if the immediate fits in a 4-bit sign extended
207 // field of 2.
208 int64_t v = (int64_t)N->getSExtValue();
209 return isShiftedInt<4,1>(v);
210}]>;
211
212
213def s4_2ImmPred : PatLeaf<(i32 imm), [{
214 // s4_2ImmPred predicate - True if the immediate fits in a 4-bit sign extended
215 // field that is a multiple of 4.
216 int64_t v = (int64_t)N->getSExtValue();
217 return isShiftedInt<4,2>(v);
218}]>;
219
220
221def s4_3ImmPred : PatLeaf<(i32 imm), [{
222 // s4_3ImmPred predicate - True if the immediate fits in a 4-bit sign extended
223 // field that is a multiple of 8.
224 int64_t v = (int64_t)N->getSExtValue();
225 return isShiftedInt<4,3>(v);
226}]>;
227
228
229def u64ImmPred : PatLeaf<(i64 imm), [{
Benjamin Kramerbde91762012-06-02 10:20:22 +0000230 // Adding "N ||" to suppress gcc unused warning.
Tony Linthicum1213a7a2011-12-12 21:14:40 +0000231 return (N || true);
232}]>;
233
234def u32ImmPred : PatLeaf<(i32 imm), [{
Jyotsna Vermab5bb6592012-11-26 21:56:51 +0000235 // u32ImmPred predicate - True if the immediate fits in a 32-bit field.
Tony Linthicum1213a7a2011-12-12 21:14:40 +0000236 int64_t v = (int64_t)N->getSExtValue();
237 return isUInt<32>(v);
238}]>;
239
Jyotsna Verma0df99bd2012-11-21 20:05:09 +0000240def u26_6ImmPred : PatLeaf<(i32 imm), [{
Jyotsna Vermab5bb6592012-11-26 21:56:51 +0000241 // u26_6ImmPred - True if the immediate fits in a 32-bit field and
242 // is a multiple of 64.
Jyotsna Verma0df99bd2012-11-21 20:05:09 +0000243 int64_t v = (int64_t)N->getSExtValue();
244 return isShiftedUInt<26,6>(v);
245}]>;
246
Tony Linthicum1213a7a2011-12-12 21:14:40 +0000247def u16ImmPred : PatLeaf<(i32 imm), [{
248 // u16ImmPred predicate - True if the immediate fits in a 16-bit unsigned
249 // field.
250 int64_t v = (int64_t)N->getSExtValue();
251 return isUInt<16>(v);
252}]>;
253
254def u16_s8ImmPred : PatLeaf<(i32 imm), [{
255 // u16_s8ImmPred predicate - True if the immediate fits in a 16-bit sign
256 // extended s8 field.
257 int64_t v = (int64_t)N->getSExtValue();
258 return isShiftedUInt<16,8>(v);
259}]>;
260
261def u9ImmPred : PatLeaf<(i32 imm), [{
262 // u9ImmPred predicate - True if the immediate fits in a 9-bit unsigned
263 // field.
264 int64_t v = (int64_t)N->getSExtValue();
265 return isUInt<9>(v);
266}]>;
267
268
269def u8ImmPred : PatLeaf<(i32 imm), [{
270 // u8ImmPred predicate - True if the immediate fits in a 8-bit unsigned
271 // field.
272 int64_t v = (int64_t)N->getSExtValue();
273 return isUInt<8>(v);
274}]>;
275
Jyotsna Verma0df99bd2012-11-21 20:05:09 +0000276def u7StrictPosImmPred : ImmLeaf<i32, [{
277 // u7StrictPosImmPred predicate - True if the immediate fits in an 7-bit
278 // unsigned field and is strictly greater than 0.
279 return isUInt<7>(Imm) && Imm > 0;
280}]>;
281
Tony Linthicum1213a7a2011-12-12 21:14:40 +0000282def u7ImmPred : PatLeaf<(i32 imm), [{
Jyotsna Vermab5bb6592012-11-26 21:56:51 +0000283 // u7ImmPred predicate - True if the immediate fits in a 7-bit unsigned
Tony Linthicum1213a7a2011-12-12 21:14:40 +0000284 // field.
285 int64_t v = (int64_t)N->getSExtValue();
286 return isUInt<7>(v);
287}]>;
288
289
290def u6ImmPred : PatLeaf<(i32 imm), [{
291 // u6ImmPred predicate - True if the immediate fits in a 6-bit unsigned
292 // field.
293 int64_t v = (int64_t)N->getSExtValue();
294 return isUInt<6>(v);
295}]>;
296
297def u6_0ImmPred : PatLeaf<(i32 imm), [{
298 // u6_0ImmPred predicate - True if the immediate fits in a 6-bit unsigned
299 // field. Same as u6ImmPred.
300 int64_t v = (int64_t)N->getSExtValue();
301 return isUInt<6>(v);
302}]>;
303
304def u6_1ImmPred : PatLeaf<(i32 imm), [{
Jyotsna Vermab5bb6592012-11-26 21:56:51 +0000305 // u6_1ImmPred predicate - True if the immediate fits in a 7-bit unsigned
Tony Linthicum1213a7a2011-12-12 21:14:40 +0000306 // field that is 1 bit alinged - multiple of 2.
307 int64_t v = (int64_t)N->getSExtValue();
308 return isShiftedUInt<6,1>(v);
309}]>;
310
311def u6_2ImmPred : PatLeaf<(i32 imm), [{
Jyotsna Vermab5bb6592012-11-26 21:56:51 +0000312 // u6_2ImmPred predicate - True if the immediate fits in a 8-bit unsigned
Tony Linthicum1213a7a2011-12-12 21:14:40 +0000313 // field that is 2 bits alinged - multiple of 4.
314 int64_t v = (int64_t)N->getSExtValue();
315 return isShiftedUInt<6,2>(v);
316}]>;
317
318def u6_3ImmPred : PatLeaf<(i32 imm), [{
Jyotsna Vermab5bb6592012-11-26 21:56:51 +0000319 // u6_3ImmPred predicate - True if the immediate fits in a 9-bit unsigned
Tony Linthicum1213a7a2011-12-12 21:14:40 +0000320 // field that is 3 bits alinged - multiple of 8.
321 int64_t v = (int64_t)N->getSExtValue();
322 return isShiftedUInt<6,3>(v);
323}]>;
324
325def u5ImmPred : PatLeaf<(i32 imm), [{
326 // u5ImmPred predicate - True if the immediate fits in a 5-bit unsigned
327 // field.
328 int64_t v = (int64_t)N->getSExtValue();
329 return isUInt<5>(v);
330}]>;
331
332
333def u3ImmPred : PatLeaf<(i32 imm), [{
334 // u3ImmPred predicate - True if the immediate fits in a 3-bit unsigned
335 // field.
336 int64_t v = (int64_t)N->getSExtValue();
337 return isUInt<3>(v);
338}]>;
339
340
341def u2ImmPred : PatLeaf<(i32 imm), [{
342 // u2ImmPred predicate - True if the immediate fits in a 2-bit unsigned
343 // field.
344 int64_t v = (int64_t)N->getSExtValue();
345 return isUInt<2>(v);
346}]>;
347
348
349def u1ImmPred : PatLeaf<(i1 imm), [{
350 // u1ImmPred predicate - True if the immediate fits in a 1-bit unsigned
351 // field.
352 int64_t v = (int64_t)N->getSExtValue();
353 return isUInt<1>(v);
354}]>;
355
Jyotsna Verma0df99bd2012-11-21 20:05:09 +0000356def m5BImmPred : PatLeaf<(i32 imm), [{
357 // m5BImmPred predicate - True if the (char) number is in range -1 .. -31
358 // and will fit in a 5 bit field when made positive, for use in memops.
359 // this is specific to the zero extending of a negative by CombineInstr
360 int8_t v = (int8_t)N->getSExtValue();
361 return (-31 <= v && v <= -1);
362}]>;
363
364def m5HImmPred : PatLeaf<(i32 imm), [{
365 // m5HImmPred predicate - True if the (short) number is in range -1 .. -31
366 // and will fit in a 5 bit field when made positive, for use in memops.
367 // this is specific to the zero extending of a negative by CombineInstr
368 int16_t v = (int16_t)N->getSExtValue();
369 return (-31 <= v && v <= -1);
370}]>;
371
372def m5ImmPred : PatLeaf<(i32 imm), [{
373 // m5ImmPred predicate - True if the number is in range -1 .. -31
374 // and will fit in a 5 bit field when made positive, for use in memops.
Tony Linthicum1213a7a2011-12-12 21:14:40 +0000375 int64_t v = (int64_t)N->getSExtValue();
Jyotsna Verma0df99bd2012-11-21 20:05:09 +0000376 return (-31 <= v && v <= -1);
Tony Linthicum1213a7a2011-12-12 21:14:40 +0000377}]>;
378
379//InN means negative integers in [-(2^N - 1), 0]
380def n8ImmPred : PatLeaf<(i32 imm), [{
Evandro Menezes5cee6212012-04-12 17:55:53 +0000381 // n8ImmPred predicate - True if the immediate fits in a 8-bit signed
Tony Linthicum1213a7a2011-12-12 21:14:40 +0000382 // field.
383 int64_t v = (int64_t)N->getSExtValue();
384 return (-255 <= v && v <= 0);
385}]>;
Sirish Pande30804c22012-02-15 18:52:27 +0000386
387def nOneImmPred : PatLeaf<(i32 imm), [{
388 // nOneImmPred predicate - True if the immediate is -1.
389 int64_t v = (int64_t)N->getSExtValue();
390 return (-1 == v);
391}]>;
392
Jyotsna Verma0df99bd2012-11-21 20:05:09 +0000393def Set5ImmPred : PatLeaf<(i32 imm), [{
394 // Set5ImmPred predicate - True if the number is in the series of values.
395 // [ 2^0, 2^1, ... 2^31 ]
396 // For use in setbit immediate.
397 uint32_t v = (int32_t)N->getSExtValue();
398 // Constrain to 32 bits, and then check for single bit.
399 return ImmIsSingleBit(v);
400}]>;
401
402def Clr5ImmPred : PatLeaf<(i32 imm), [{
403 // Clr5ImmPred predicate - True if the number is in the series of
404 // bit negated values.
405 // [ 2^0, 2^1, ... 2^31 ]
406 // For use in clrbit immediate.
407 // Note: we are bit NOTing the value.
408 uint32_t v = ~ (int32_t)N->getSExtValue();
409 // Constrain to 32 bits, and then check for single bit.
410 return ImmIsSingleBit(v);
411}]>;
412
413def SetClr5ImmPred : PatLeaf<(i32 imm), [{
Jyotsna Vermab5bb6592012-11-26 21:56:51 +0000414 // SetClr5ImmPred predicate - True if the immediate is in range 0..31.
Jyotsna Verma0df99bd2012-11-21 20:05:09 +0000415 int32_t v = (int32_t)N->getSExtValue();
416 return (v >= 0 && v <= 31);
417}]>;
418
419def Set4ImmPred : PatLeaf<(i32 imm), [{
420 // Set4ImmPred predicate - True if the number is in the series of values:
421 // [ 2^0, 2^1, ... 2^15 ].
422 // For use in setbit immediate.
423 uint16_t v = (int16_t)N->getSExtValue();
424 // Constrain to 16 bits, and then check for single bit.
425 return ImmIsSingleBit(v);
426}]>;
427
428def Clr4ImmPred : PatLeaf<(i32 imm), [{
429 // Clr4ImmPred predicate - True if the number is in the series of
430 // bit negated values:
431 // [ 2^0, 2^1, ... 2^15 ].
432 // For use in setbit and clrbit immediate.
433 uint16_t v = ~ (int16_t)N->getSExtValue();
434 // Constrain to 16 bits, and then check for single bit.
435 return ImmIsSingleBit(v);
436}]>;
437
438def SetClr4ImmPred : PatLeaf<(i32 imm), [{
Jyotsna Vermab5bb6592012-11-26 21:56:51 +0000439 // SetClr4ImmPred predicate - True if the immediate is in the range 0..15.
Jyotsna Verma0df99bd2012-11-21 20:05:09 +0000440 int16_t v = (int16_t)N->getSExtValue();
441 return (v >= 0 && v <= 15);
442}]>;
443
444def Set3ImmPred : PatLeaf<(i32 imm), [{
Jyotsna Vermab5bb6592012-11-26 21:56:51 +0000445 // Set3ImmPred predicate - True if the number is in the series of values:
Jyotsna Verma0df99bd2012-11-21 20:05:09 +0000446 // [ 2^0, 2^1, ... 2^7 ].
447 // For use in setbit immediate.
448 uint8_t v = (int8_t)N->getSExtValue();
449 // Constrain to 8 bits, and then check for single bit.
450 return ImmIsSingleBit(v);
451}]>;
452
453def Clr3ImmPred : PatLeaf<(i32 imm), [{
Jyotsna Vermab5bb6592012-11-26 21:56:51 +0000454 // Clr3ImmPred predicate - True if the number is in the series of
Jyotsna Verma0df99bd2012-11-21 20:05:09 +0000455 // bit negated values:
456 // [ 2^0, 2^1, ... 2^7 ].
457 // For use in setbit and clrbit immediate.
458 uint8_t v = ~ (int8_t)N->getSExtValue();
459 // Constrain to 8 bits, and then check for single bit.
460 return ImmIsSingleBit(v);
461}]>;
462
463def SetClr3ImmPred : PatLeaf<(i32 imm), [{
Jyotsna Vermab5bb6592012-11-26 21:56:51 +0000464 // SetClr3ImmPred predicate - True if the immediate is in the range 0..7.
Jyotsna Verma0df99bd2012-11-21 20:05:09 +0000465 int8_t v = (int8_t)N->getSExtValue();
466 return (v >= 0 && v <= 7);
467}]>;
Jyotsna Verma519b3852012-11-28 20:58:14 +0000468
469
470// Extendable immediate operands.
471
472let PrintMethod = "printExtOperand" in {
473 def s16Ext : Operand<i32>;
474 def s12Ext : Operand<i32>;
475 def s10Ext : Operand<i32>;
476 def s9Ext : Operand<i32>;
477 def s8Ext : Operand<i32>;
478 def s6Ext : Operand<i32>;
479 def s11_0Ext : Operand<i32>;
480 def s11_1Ext : Operand<i32>;
481 def s11_2Ext : Operand<i32>;
482 def s11_3Ext : Operand<i32>;
483}
484
485let PrintMethod = "printImmOperand" in
486def u0AlwaysExt : Operand<i32>;
487
488// Predicates for constant extendable operands
489def s16ExtPred : PatLeaf<(i32 imm), [{
490 int64_t v = (int64_t)N->getSExtValue();
491 if (!Subtarget.hasV4TOps())
492 // Return true if the immediate can fit in a 16-bit sign extended field.
493 return isInt<16>(v);
494 else {
495 if (isInt<16>(v))
496 return true;
497
498 // Return true if extending this immediate is profitable and the value
499 // can fit in a 32-bit signed field.
Jyotsna Verma6aba56e2012-12-03 20:14:38 +0000500 return isConstExtProfitable(Node) && isInt<32>(v);
Jyotsna Verma519b3852012-11-28 20:58:14 +0000501 }
502}]>;
503
504def s10ExtPred : PatLeaf<(i32 imm), [{
505 int64_t v = (int64_t)N->getSExtValue();
506 if (!Subtarget.hasV4TOps())
507 // Return true if the immediate can fit in a 10-bit sign extended field.
508 return isInt<10>(v);
509 else {
510 if (isInt<10>(v))
511 return true;
512
513 // Return true if extending this immediate is profitable and the value
514 // can fit in a 32-bit signed field.
Jyotsna Verma6aba56e2012-12-03 20:14:38 +0000515 return isConstExtProfitable(Node) && isInt<32>(v);
Jyotsna Verma519b3852012-11-28 20:58:14 +0000516 }
517}]>;
518
519def s9ExtPred : PatLeaf<(i32 imm), [{
520 int64_t v = (int64_t)N->getSExtValue();
521 if (!Subtarget.hasV4TOps())
522 // Return true if the immediate can fit in a 9-bit sign extended field.
523 return isInt<9>(v);
524 else {
525 if (isInt<9>(v))
526 return true;
527
528 // Return true if extending this immediate is profitable and the value
529 // can fit in a 32-bit unsigned field.
Jyotsna Verma6aba56e2012-12-03 20:14:38 +0000530 return isConstExtProfitable(Node) && isInt<32>(v);
Jyotsna Verma519b3852012-11-28 20:58:14 +0000531 }
532}]>;
533
534def s8ExtPred : PatLeaf<(i32 imm), [{
535 int64_t v = (int64_t)N->getSExtValue();
536 if (!Subtarget.hasV4TOps())
537 // Return true if the immediate can fit in a 8-bit sign extended field.
538 return isInt<8>(v);
539 else {
540 if (isInt<8>(v))
541 return true;
542
543 // Return true if extending this immediate is profitable and the value
544 // can fit in a 32-bit signed field.
Jyotsna Verma6aba56e2012-12-03 20:14:38 +0000545 return isConstExtProfitable(Node) && isInt<32>(v);
Jyotsna Verma519b3852012-11-28 20:58:14 +0000546 }
547}]>;
548
549def s8_16ExtPred : PatLeaf<(i32 imm), [{
550 int64_t v = (int64_t)N->getSExtValue();
551 if (!Subtarget.hasV4TOps())
552 // Return true if the immediate fits in a 8-bit sign extended field.
553 return isInt<8>(v);
554 else {
555 if (isInt<8>(v))
556 return true;
557
558 // Return true if extending this immediate is profitable and the value
559 // can't fit in a 16-bit signed field. This is required to avoid
560 // unnecessary constant extenders.
Jyotsna Verma6aba56e2012-12-03 20:14:38 +0000561 return isConstExtProfitable(Node) && !isInt<16>(v);
Jyotsna Verma519b3852012-11-28 20:58:14 +0000562 }
563}]>;
Jyotsna Verma014dfe42012-12-03 06:54:50 +0000564
565def s6ExtPred : PatLeaf<(i32 imm), [{
566 int64_t v = (int64_t)N->getSExtValue();
567 if (!Subtarget.hasV4TOps())
568 // Return true if the immediate can fit in a 6-bit sign extended field.
569 return isInt<6>(v);
570 else {
571 if (isInt<6>(v))
572 return true;
573
574 // Return true if extending this immediate is profitable and the value
575 // can fit in a 32-bit unsigned field.
Jyotsna Verma6aba56e2012-12-03 20:14:38 +0000576 return isConstExtProfitable(Node) && isInt<32>(v);
Jyotsna Verma014dfe42012-12-03 06:54:50 +0000577 }
578}]>;
579
580def s6_16ExtPred : PatLeaf<(i32 imm), [{
581 int64_t v = (int64_t)N->getSExtValue();
582 if (!Subtarget.hasV4TOps())
583 // Return true if the immediate fits in a 6-bit sign extended field.
584 return isInt<6>(v);
585 else {
586 if (isInt<6>(v))
587 return true;
588
589 // Return true if extending this immediate is profitable and the value
590 // can't fit in a 16-bit signed field. This is required to avoid
591 // unnecessary constant extenders.
Jyotsna Verma6aba56e2012-12-03 20:14:38 +0000592 return isConstExtProfitable(Node) && !isInt<16>(v);
Jyotsna Verma014dfe42012-12-03 06:54:50 +0000593 }
594}]>;
595
596def s6_10ExtPred : PatLeaf<(i32 imm), [{
597 int64_t v = (int64_t)N->getSExtValue();
598 if (!Subtarget.hasV4TOps())
599 // Return true if the immediate can fit in a 6-bit sign extended field.
600 return isInt<6>(v);
601 else {
602 if (isInt<6>(v))
603 return true;
604
605 // Return true if extending this immediate is profitable and the value
606 // can't fit in a 10-bit signed field. This is required to avoid
607 // unnecessary constant extenders.
Jyotsna Verma6aba56e2012-12-03 20:14:38 +0000608 return isConstExtProfitable(Node) && !isInt<10>(v);
Jyotsna Verma014dfe42012-12-03 06:54:50 +0000609 }
610}]>;
611
612def s11_0ExtPred : PatLeaf<(i32 imm), [{
613 int64_t v = (int64_t)N->getSExtValue();
614 if (!Subtarget.hasV4TOps())
615 // Return true if the immediate can fit in a 11-bit sign extended field.
616 return isShiftedInt<11,0>(v);
617 else {
618 if (isInt<11>(v))
619 return true;
620
621 // Return true if extending this immediate is profitable and the value
622 // can fit in a 32-bit signed field.
Jyotsna Verma6aba56e2012-12-03 20:14:38 +0000623 return isConstExtProfitable(Node) && isInt<32>(v);
Jyotsna Verma014dfe42012-12-03 06:54:50 +0000624 }
625}]>;
626
627def s11_1ExtPred : PatLeaf<(i32 imm), [{
628 int64_t v = (int64_t)N->getSExtValue();
629 if (!Subtarget.hasV4TOps())
630 // Return true if the immediate can fit in a 12-bit sign extended field and
631 // is 2 byte aligned.
632 return isShiftedInt<11,1>(v);
633 else {
634 if (isInt<12>(v))
635 return isShiftedInt<11,1>(v);
636
637 // Return true if extending this immediate is profitable and the low 1 bit
638 // is zero (2-byte aligned).
Jyotsna Verma6aba56e2012-12-03 20:14:38 +0000639 return isConstExtProfitable(Node) && isInt<32>(v) && ((v % 2) == 0);
Jyotsna Verma014dfe42012-12-03 06:54:50 +0000640 }
641}]>;
642
643def s11_2ExtPred : PatLeaf<(i32 imm), [{
644 int64_t v = (int64_t)N->getSExtValue();
645 if (!Subtarget.hasV4TOps())
646 // Return true if the immediate can fit in a 13-bit sign extended field and
647 // is 4-byte aligned.
648 return isShiftedInt<11,2>(v);
649 else {
650 if (isInt<13>(v))
651 return isShiftedInt<11,2>(v);
652
653 // Return true if extending this immediate is profitable and the low 2-bits
654 // are zero (4-byte aligned).
Jyotsna Verma6aba56e2012-12-03 20:14:38 +0000655 return isConstExtProfitable(Node) && isInt<32>(v) && ((v % 4) == 0);
Jyotsna Verma014dfe42012-12-03 06:54:50 +0000656 }
657}]>;
658
659def s11_3ExtPred : PatLeaf<(i32 imm), [{
660 int64_t v = (int64_t)N->getSExtValue();
661 if (!Subtarget.hasV4TOps())
662 // Return true if the immediate can fit in a 14-bit sign extended field and
663 // is 8-byte aligned.
664 return isShiftedInt<11,3>(v);
665 else {
666 if (isInt<14>(v))
667 return isShiftedInt<11,3>(v);
668
669 // Return true if extending this immediate is profitable and the low 3-bits
670 // are zero (8-byte aligned).
Jyotsna Verma6aba56e2012-12-03 20:14:38 +0000671 return isConstExtProfitable(Node) && isInt<32>(v) && ((v % 8) == 0);
Jyotsna Verma014dfe42012-12-03 06:54:50 +0000672 }
673}]>;