Rafael Espindola | 6ee1e08 | 2012-11-21 16:56:33 +0000 | [diff] [blame] | 1 | //===- HexagonOperands.td - Hexagon immediate processing -*- tablegen -*-===// |
Tony Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 2 | // |
| 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 Verma | 81081b1 | 2012-11-21 19:53:42 +0000 | [diff] [blame] | 10 | // Immediate operands. |
| 11 | |
| 12 | let 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 Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 59 | } |
| 60 | |
Jyotsna Verma | 81081b1 | 2012-11-21 19:53:42 +0000 | [diff] [blame] | 61 | let PrintMethod = "printNOneImmOperand" in |
| 62 | def nOneImm : Operand<i32>; |
Sirish Pande | ab7955b | 2012-02-15 18:52:27 +0000 | [diff] [blame] | 63 | |
Tony Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 64 | // |
| 65 | // Immediate predicates |
| 66 | // |
| 67 | def s32ImmPred : PatLeaf<(i32 imm), [{ |
Jyotsna Verma | 5c1f3d1 | 2012-11-26 21:56:51 +0000 | [diff] [blame] | 68 | // s32ImmPred predicate - True if the immediate fits in a 32-bit sign extended |
Tony Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 69 | // field. |
| 70 | int64_t v = (int64_t)N->getSExtValue(); |
| 71 | return isInt<32>(v); |
| 72 | }]>; |
| 73 | |
| 74 | def 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 | |
| 81 | def 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 Verma | b546d5a | 2012-11-21 20:05:09 +0000 | [diff] [blame] | 88 | def s26_6ImmPred : PatLeaf<(i32 imm), [{ |
Jyotsna Verma | 5c1f3d1 | 2012-11-26 21:56:51 +0000 | [diff] [blame] | 89 | // s26_6ImmPred predicate - True if the immediate fits in a 32-bit |
| 90 | // sign extended field. |
Jyotsna Verma | b546d5a | 2012-11-21 20:05:09 +0000 | [diff] [blame] | 91 | int64_t v = (int64_t)N->getSExtValue(); |
| 92 | return isShiftedInt<26,6>(v); |
| 93 | }]>; |
| 94 | |
| 95 | |
Tony Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 96 | def s16ImmPred : PatLeaf<(i32 imm), [{ |
Jyotsna Verma | 5c1f3d1 | 2012-11-26 21:56:51 +0000 | [diff] [blame] | 97 | // s16ImmPred predicate - True if the immediate fits in a 16-bit sign extended |
Tony Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 98 | // field. |
| 99 | int64_t v = (int64_t)N->getSExtValue(); |
| 100 | return isInt<16>(v); |
| 101 | }]>; |
| 102 | |
| 103 | |
| 104 | def s13ImmPred : PatLeaf<(i32 imm), [{ |
Jyotsna Verma | 5c1f3d1 | 2012-11-26 21:56:51 +0000 | [diff] [blame] | 105 | // s13ImmPred predicate - True if the immediate fits in a 13-bit sign extended |
Tony Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 106 | // field. |
| 107 | int64_t v = (int64_t)N->getSExtValue(); |
| 108 | return isInt<13>(v); |
| 109 | }]>; |
| 110 | |
| 111 | |
| 112 | def s12ImmPred : PatLeaf<(i32 imm), [{ |
Jyotsna Verma | 5c1f3d1 | 2012-11-26 21:56:51 +0000 | [diff] [blame] | 113 | // s12ImmPred predicate - True if the immediate fits in a 12-bit |
| 114 | // sign extended field. |
Tony Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 115 | int64_t v = (int64_t)N->getSExtValue(); |
| 116 | return isInt<12>(v); |
| 117 | }]>; |
| 118 | |
| 119 | def s11_0ImmPred : PatLeaf<(i32 imm), [{ |
Jyotsna Verma | 5c1f3d1 | 2012-11-26 21:56:51 +0000 | [diff] [blame] | 120 | // s11_0ImmPred predicate - True if the immediate fits in a 11-bit |
| 121 | // sign extended field. |
Tony Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 122 | int64_t v = (int64_t)N->getSExtValue(); |
| 123 | return isInt<11>(v); |
| 124 | }]>; |
| 125 | |
| 126 | |
| 127 | def s11_1ImmPred : PatLeaf<(i32 imm), [{ |
Jyotsna Verma | 5c1f3d1 | 2012-11-26 21:56:51 +0000 | [diff] [blame] | 128 | // s11_1ImmPred predicate - True if the immediate fits in a 12-bit |
| 129 | // sign extended field and is a multiple of 2. |
Tony Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 130 | int64_t v = (int64_t)N->getSExtValue(); |
| 131 | return isShiftedInt<11,1>(v); |
| 132 | }]>; |
| 133 | |
| 134 | |
| 135 | def s11_2ImmPred : PatLeaf<(i32 imm), [{ |
Jyotsna Verma | 5c1f3d1 | 2012-11-26 21:56:51 +0000 | [diff] [blame] | 136 | // s11_2ImmPred predicate - True if the immediate fits in a 13-bit |
| 137 | // sign extended field and is a multiple of 4. |
Tony Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 138 | int64_t v = (int64_t)N->getSExtValue(); |
| 139 | return isShiftedInt<11,2>(v); |
| 140 | }]>; |
| 141 | |
| 142 | |
| 143 | def s11_3ImmPred : PatLeaf<(i32 imm), [{ |
Jyotsna Verma | 5c1f3d1 | 2012-11-26 21:56:51 +0000 | [diff] [blame] | 144 | // s11_3ImmPred predicate - True if the immediate fits in a 14-bit |
| 145 | // sign extended field and is a multiple of 8. |
Tony Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 146 | int64_t v = (int64_t)N->getSExtValue(); |
| 147 | return isShiftedInt<11,3>(v); |
| 148 | }]>; |
| 149 | |
| 150 | |
| 151 | def 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 | |
| 159 | def 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 Verma | b546d5a | 2012-11-21 20:05:09 +0000 | [diff] [blame] | 166 | def 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 Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 172 | |
| 173 | def 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 | |
| 181 | def 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 | |
| 189 | def 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 | |
| 197 | def 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 | |
| 205 | def 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 | |
| 213 | def 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 | |
| 221 | def 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 | |
| 229 | def u64ImmPred : PatLeaf<(i64 imm), [{ |
Benjamin Kramer | d9b0b02 | 2012-06-02 10:20:22 +0000 | [diff] [blame] | 230 | // Adding "N ||" to suppress gcc unused warning. |
Tony Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 231 | return (N || true); |
| 232 | }]>; |
| 233 | |
| 234 | def u32ImmPred : PatLeaf<(i32 imm), [{ |
Jyotsna Verma | 5c1f3d1 | 2012-11-26 21:56:51 +0000 | [diff] [blame] | 235 | // u32ImmPred predicate - True if the immediate fits in a 32-bit field. |
Tony Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 236 | int64_t v = (int64_t)N->getSExtValue(); |
| 237 | return isUInt<32>(v); |
| 238 | }]>; |
| 239 | |
Jyotsna Verma | b546d5a | 2012-11-21 20:05:09 +0000 | [diff] [blame] | 240 | def u26_6ImmPred : PatLeaf<(i32 imm), [{ |
Jyotsna Verma | 5c1f3d1 | 2012-11-26 21:56:51 +0000 | [diff] [blame] | 241 | // u26_6ImmPred - True if the immediate fits in a 32-bit field and |
| 242 | // is a multiple of 64. |
Jyotsna Verma | b546d5a | 2012-11-21 20:05:09 +0000 | [diff] [blame] | 243 | int64_t v = (int64_t)N->getSExtValue(); |
| 244 | return isShiftedUInt<26,6>(v); |
| 245 | }]>; |
| 246 | |
Tony Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 247 | def 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 | |
| 254 | def 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 | |
| 261 | def 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 | |
| 269 | def 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 Verma | b546d5a | 2012-11-21 20:05:09 +0000 | [diff] [blame] | 276 | def 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 Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 282 | def u7ImmPred : PatLeaf<(i32 imm), [{ |
Jyotsna Verma | 5c1f3d1 | 2012-11-26 21:56:51 +0000 | [diff] [blame] | 283 | // u7ImmPred predicate - True if the immediate fits in a 7-bit unsigned |
Tony Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 284 | // field. |
| 285 | int64_t v = (int64_t)N->getSExtValue(); |
| 286 | return isUInt<7>(v); |
| 287 | }]>; |
| 288 | |
| 289 | |
| 290 | def 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 | |
| 297 | def 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 | |
| 304 | def u6_1ImmPred : PatLeaf<(i32 imm), [{ |
Jyotsna Verma | 5c1f3d1 | 2012-11-26 21:56:51 +0000 | [diff] [blame] | 305 | // u6_1ImmPred predicate - True if the immediate fits in a 7-bit unsigned |
Tony Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 306 | // 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 | |
| 311 | def u6_2ImmPred : PatLeaf<(i32 imm), [{ |
Jyotsna Verma | 5c1f3d1 | 2012-11-26 21:56:51 +0000 | [diff] [blame] | 312 | // u6_2ImmPred predicate - True if the immediate fits in a 8-bit unsigned |
Tony Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 313 | // 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 | |
| 318 | def u6_3ImmPred : PatLeaf<(i32 imm), [{ |
Jyotsna Verma | 5c1f3d1 | 2012-11-26 21:56:51 +0000 | [diff] [blame] | 319 | // u6_3ImmPred predicate - True if the immediate fits in a 9-bit unsigned |
Tony Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 320 | // 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 | |
| 325 | def 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 | |
| 333 | def 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 | |
| 341 | def 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 | |
| 349 | def 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 Verma | b546d5a | 2012-11-21 20:05:09 +0000 | [diff] [blame] | 356 | def 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 | |
| 364 | def 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 | |
| 372 | def 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 Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 375 | int64_t v = (int64_t)N->getSExtValue(); |
Jyotsna Verma | b546d5a | 2012-11-21 20:05:09 +0000 | [diff] [blame] | 376 | return (-31 <= v && v <= -1); |
Tony Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 377 | }]>; |
| 378 | |
| 379 | //InN means negative integers in [-(2^N - 1), 0] |
| 380 | def n8ImmPred : PatLeaf<(i32 imm), [{ |
Evandro Menezes | e5041e6 | 2012-04-12 17:55:53 +0000 | [diff] [blame] | 381 | // n8ImmPred predicate - True if the immediate fits in a 8-bit signed |
Tony Linthicum | b4b5415 | 2011-12-12 21:14:40 +0000 | [diff] [blame] | 382 | // field. |
| 383 | int64_t v = (int64_t)N->getSExtValue(); |
| 384 | return (-255 <= v && v <= 0); |
| 385 | }]>; |
Sirish Pande | ab7955b | 2012-02-15 18:52:27 +0000 | [diff] [blame] | 386 | |
| 387 | def 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 Verma | b546d5a | 2012-11-21 20:05:09 +0000 | [diff] [blame] | 393 | def 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 | |
| 402 | def 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 | |
| 413 | def SetClr5ImmPred : PatLeaf<(i32 imm), [{ |
Jyotsna Verma | 5c1f3d1 | 2012-11-26 21:56:51 +0000 | [diff] [blame] | 414 | // SetClr5ImmPred predicate - True if the immediate is in range 0..31. |
Jyotsna Verma | b546d5a | 2012-11-21 20:05:09 +0000 | [diff] [blame] | 415 | int32_t v = (int32_t)N->getSExtValue(); |
| 416 | return (v >= 0 && v <= 31); |
| 417 | }]>; |
| 418 | |
| 419 | def 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 | |
| 428 | def 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 | |
| 438 | def SetClr4ImmPred : PatLeaf<(i32 imm), [{ |
Jyotsna Verma | 5c1f3d1 | 2012-11-26 21:56:51 +0000 | [diff] [blame] | 439 | // SetClr4ImmPred predicate - True if the immediate is in the range 0..15. |
Jyotsna Verma | b546d5a | 2012-11-21 20:05:09 +0000 | [diff] [blame] | 440 | int16_t v = (int16_t)N->getSExtValue(); |
| 441 | return (v >= 0 && v <= 15); |
| 442 | }]>; |
| 443 | |
| 444 | def Set3ImmPred : PatLeaf<(i32 imm), [{ |
Jyotsna Verma | 5c1f3d1 | 2012-11-26 21:56:51 +0000 | [diff] [blame] | 445 | // Set3ImmPred predicate - True if the number is in the series of values: |
Jyotsna Verma | b546d5a | 2012-11-21 20:05:09 +0000 | [diff] [blame] | 446 | // [ 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 | |
| 453 | def Clr3ImmPred : PatLeaf<(i32 imm), [{ |
Jyotsna Verma | 5c1f3d1 | 2012-11-26 21:56:51 +0000 | [diff] [blame] | 454 | // Clr3ImmPred predicate - True if the number is in the series of |
Jyotsna Verma | b546d5a | 2012-11-21 20:05:09 +0000 | [diff] [blame] | 455 | // 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 | |
| 463 | def SetClr3ImmPred : PatLeaf<(i32 imm), [{ |
Jyotsna Verma | 5c1f3d1 | 2012-11-26 21:56:51 +0000 | [diff] [blame] | 464 | // SetClr3ImmPred predicate - True if the immediate is in the range 0..7. |
Jyotsna Verma | b546d5a | 2012-11-21 20:05:09 +0000 | [diff] [blame] | 465 | int8_t v = (int8_t)N->getSExtValue(); |
| 466 | return (v >= 0 && v <= 7); |
| 467 | }]>; |
Jyotsna Verma | 61c654c | 2012-11-28 20:58:14 +0000 | [diff] [blame] | 468 | |
| 469 | |
| 470 | // Extendable immediate operands. |
| 471 | |
| 472 | let 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 | |
| 485 | let PrintMethod = "printImmOperand" in |
| 486 | def u0AlwaysExt : Operand<i32>; |
| 487 | |
| 488 | // Predicates for constant extendable operands |
| 489 | def 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. |
| 500 | if (isConstExtProfitable(Node) && isInt<32>(v)) |
| 501 | return true; |
| 502 | else |
| 503 | return false; |
| 504 | } |
| 505 | }]>; |
| 506 | |
| 507 | def s10ExtPred : PatLeaf<(i32 imm), [{ |
| 508 | int64_t v = (int64_t)N->getSExtValue(); |
| 509 | if (!Subtarget.hasV4TOps()) |
| 510 | // Return true if the immediate can fit in a 10-bit sign extended field. |
| 511 | return isInt<10>(v); |
| 512 | else { |
| 513 | if (isInt<10>(v)) |
| 514 | return true; |
| 515 | |
| 516 | // Return true if extending this immediate is profitable and the value |
| 517 | // can fit in a 32-bit signed field. |
| 518 | if (isConstExtProfitable(Node) && isInt<32>(v)) |
| 519 | return true; |
| 520 | else |
| 521 | return false; |
| 522 | } |
| 523 | }]>; |
| 524 | |
| 525 | def s9ExtPred : PatLeaf<(i32 imm), [{ |
| 526 | int64_t v = (int64_t)N->getSExtValue(); |
| 527 | if (!Subtarget.hasV4TOps()) |
| 528 | // Return true if the immediate can fit in a 9-bit sign extended field. |
| 529 | return isInt<9>(v); |
| 530 | else { |
| 531 | if (isInt<9>(v)) |
| 532 | return true; |
| 533 | |
| 534 | // Return true if extending this immediate is profitable and the value |
| 535 | // can fit in a 32-bit unsigned field. |
| 536 | if (isConstExtProfitable(Node) && isInt<32>(v)) |
| 537 | return true; |
| 538 | else |
| 539 | return false; |
| 540 | } |
| 541 | }]>; |
| 542 | |
| 543 | def s8ExtPred : PatLeaf<(i32 imm), [{ |
| 544 | int64_t v = (int64_t)N->getSExtValue(); |
| 545 | if (!Subtarget.hasV4TOps()) |
| 546 | // Return true if the immediate can fit in a 8-bit sign extended field. |
| 547 | return isInt<8>(v); |
| 548 | else { |
| 549 | if (isInt<8>(v)) |
| 550 | return true; |
| 551 | |
| 552 | // Return true if extending this immediate is profitable and the value |
| 553 | // can fit in a 32-bit signed field. |
| 554 | if (isConstExtProfitable(Node) && isInt<32>(v)) |
| 555 | return true; |
| 556 | else |
| 557 | return false; |
| 558 | } |
| 559 | }]>; |
| 560 | |
| 561 | def s8_16ExtPred : PatLeaf<(i32 imm), [{ |
| 562 | int64_t v = (int64_t)N->getSExtValue(); |
| 563 | if (!Subtarget.hasV4TOps()) |
| 564 | // Return true if the immediate fits in a 8-bit sign extended field. |
| 565 | return isInt<8>(v); |
| 566 | else { |
| 567 | if (isInt<8>(v)) |
| 568 | return true; |
| 569 | |
| 570 | // Return true if extending this immediate is profitable and the value |
| 571 | // can't fit in a 16-bit signed field. This is required to avoid |
| 572 | // unnecessary constant extenders. |
| 573 | if (isConstExtProfitable(Node) && !isInt<16>(v)) |
| 574 | return true; |
| 575 | else |
| 576 | return false; |
| 577 | } |
| 578 | }]>; |
Jyotsna Verma | c65317b | 2012-12-03 06:54:50 +0000 | [diff] [blame^] | 579 | |
| 580 | def s6ExtPred : PatLeaf<(i32 imm), [{ |
| 581 | int64_t v = (int64_t)N->getSExtValue(); |
| 582 | if (!Subtarget.hasV4TOps()) |
| 583 | // Return true if the immediate can fit 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 fit in a 32-bit unsigned field. |
| 591 | if (isConstExtProfitable(Node) && isInt<32>(v)) |
| 592 | return true; |
| 593 | else |
| 594 | return false; |
| 595 | } |
| 596 | }]>; |
| 597 | |
| 598 | def s6_16ExtPred : PatLeaf<(i32 imm), [{ |
| 599 | int64_t v = (int64_t)N->getSExtValue(); |
| 600 | if (!Subtarget.hasV4TOps()) |
| 601 | // Return true if the immediate fits in a 6-bit sign extended field. |
| 602 | return isInt<6>(v); |
| 603 | else { |
| 604 | if (isInt<6>(v)) |
| 605 | return true; |
| 606 | |
| 607 | // Return true if extending this immediate is profitable and the value |
| 608 | // can't fit in a 16-bit signed field. This is required to avoid |
| 609 | // unnecessary constant extenders. |
| 610 | if (isConstExtProfitable(Node) && !isInt<16>(v)) |
| 611 | return true; |
| 612 | else |
| 613 | return false; |
| 614 | } |
| 615 | }]>; |
| 616 | |
| 617 | def s6_10ExtPred : PatLeaf<(i32 imm), [{ |
| 618 | int64_t v = (int64_t)N->getSExtValue(); |
| 619 | if (!Subtarget.hasV4TOps()) |
| 620 | // Return true if the immediate can fit in a 6-bit sign extended field. |
| 621 | return isInt<6>(v); |
| 622 | else { |
| 623 | if (isInt<6>(v)) |
| 624 | return true; |
| 625 | |
| 626 | // Return true if extending this immediate is profitable and the value |
| 627 | // can't fit in a 10-bit signed field. This is required to avoid |
| 628 | // unnecessary constant extenders. |
| 629 | if (isConstExtProfitable(Node) && !isInt<10>(v)) |
| 630 | return true; |
| 631 | else |
| 632 | return false; |
| 633 | } |
| 634 | }]>; |
| 635 | |
| 636 | def s11_0ExtPred : PatLeaf<(i32 imm), [{ |
| 637 | int64_t v = (int64_t)N->getSExtValue(); |
| 638 | if (!Subtarget.hasV4TOps()) |
| 639 | // Return true if the immediate can fit in a 11-bit sign extended field. |
| 640 | return isShiftedInt<11,0>(v); |
| 641 | else { |
| 642 | if (isInt<11>(v)) |
| 643 | return true; |
| 644 | |
| 645 | // Return true if extending this immediate is profitable and the value |
| 646 | // can fit in a 32-bit signed field. |
| 647 | if (isConstExtProfitable(Node) && isInt<32>(v)) |
| 648 | return true; |
| 649 | else |
| 650 | return false; |
| 651 | } |
| 652 | }]>; |
| 653 | |
| 654 | def s11_1ExtPred : PatLeaf<(i32 imm), [{ |
| 655 | int64_t v = (int64_t)N->getSExtValue(); |
| 656 | if (!Subtarget.hasV4TOps()) |
| 657 | // Return true if the immediate can fit in a 12-bit sign extended field and |
| 658 | // is 2 byte aligned. |
| 659 | return isShiftedInt<11,1>(v); |
| 660 | else { |
| 661 | if (isInt<12>(v)) |
| 662 | return isShiftedInt<11,1>(v); |
| 663 | |
| 664 | // Return true if extending this immediate is profitable and the low 1 bit |
| 665 | // is zero (2-byte aligned). |
| 666 | if (isConstExtProfitable(Node) && isInt<32>(v) && ((v % 2) == 0)) |
| 667 | return true; |
| 668 | else |
| 669 | return false; |
| 670 | } |
| 671 | }]>; |
| 672 | |
| 673 | def s11_2ExtPred : PatLeaf<(i32 imm), [{ |
| 674 | int64_t v = (int64_t)N->getSExtValue(); |
| 675 | if (!Subtarget.hasV4TOps()) |
| 676 | // Return true if the immediate can fit in a 13-bit sign extended field and |
| 677 | // is 4-byte aligned. |
| 678 | return isShiftedInt<11,2>(v); |
| 679 | else { |
| 680 | if (isInt<13>(v)) |
| 681 | return isShiftedInt<11,2>(v); |
| 682 | |
| 683 | // Return true if extending this immediate is profitable and the low 2-bits |
| 684 | // are zero (4-byte aligned). |
| 685 | if (isConstExtProfitable(Node) && isInt<32>(v) && ((v % 4) == 0)) |
| 686 | return true; |
| 687 | else |
| 688 | return false; |
| 689 | } |
| 690 | }]>; |
| 691 | |
| 692 | def s11_3ExtPred : PatLeaf<(i32 imm), [{ |
| 693 | int64_t v = (int64_t)N->getSExtValue(); |
| 694 | if (!Subtarget.hasV4TOps()) |
| 695 | // Return true if the immediate can fit in a 14-bit sign extended field and |
| 696 | // is 8-byte aligned. |
| 697 | return isShiftedInt<11,3>(v); |
| 698 | else { |
| 699 | if (isInt<14>(v)) |
| 700 | return isShiftedInt<11,3>(v); |
| 701 | |
| 702 | // Return true if extending this immediate is profitable and the low 3-bits |
| 703 | // are zero (8-byte aligned). |
| 704 | if (isConstExtProfitable(Node) && isInt<32>(v) && ((v % 8) == 0)) |
| 705 | return true; |
| 706 | else |
| 707 | return false; |
| 708 | } |
| 709 | }]>; |