]>
Commit | Line | Data |
---|---|---|
3d2cf79f RB |
1 | /* Match-and-simplify patterns for shared GENERIC and GIMPLE folding. |
2 | This file is consumed by genmatch which produces gimple-match.c | |
3 | and generic-match.c from it. | |
4 | ||
5624e564 | 5 | Copyright (C) 2014-2015 Free Software Foundation, Inc. |
3d2cf79f RB |
6 | Contributed by Richard Biener <rguenther@suse.de> |
7 | and Prathamesh Kulkarni <bilbotheelffriend@gmail.com> | |
8 | ||
9 | This file is part of GCC. | |
10 | ||
11 | GCC is free software; you can redistribute it and/or modify it under | |
12 | the terms of the GNU General Public License as published by the Free | |
13 | Software Foundation; either version 3, or (at your option) any later | |
14 | version. | |
15 | ||
16 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
17 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
18 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
19 | for more details. | |
20 | ||
21 | You should have received a copy of the GNU General Public License | |
22 | along with GCC; see the file COPYING3. If not see | |
23 | <http://www.gnu.org/licenses/>. */ | |
24 | ||
25 | ||
26 | /* Generic tree predicates we inherit. */ | |
27 | (define_predicates | |
cc7b5acf | 28 | integer_onep integer_zerop integer_all_onesp integer_minus_onep |
09240451 | 29 | integer_each_onep integer_truep |
cc7b5acf | 30 | real_zerop real_onep real_minus_onep |
f3582e54 | 31 | CONSTANT_CLASS_P |
887ab609 N |
32 | tree_expr_nonnegative_p |
33 | integer_pow2p) | |
e0ee10ed | 34 | |
f84e7fd6 RB |
35 | /* Operator lists. */ |
36 | (define_operator_list tcc_comparison | |
37 | lt le eq ne ge gt unordered ordered unlt unle ungt unge uneq ltgt) | |
38 | (define_operator_list inverted_tcc_comparison | |
39 | ge gt ne eq lt le ordered unordered ge gt le lt ltgt uneq) | |
40 | (define_operator_list inverted_tcc_comparison_with_nans | |
41 | unge ungt ne eq unlt unle ordered unordered ge gt le lt ltgt uneq) | |
534bd33b MG |
42 | (define_operator_list swapped_tcc_comparison |
43 | gt ge eq ne le lt unordered ordered ungt unge unlt unle uneq ltgt) | |
07cdc2b8 RB |
44 | (define_operator_list simple_comparison lt le eq ne ge gt) |
45 | (define_operator_list swapped_simple_comparison gt ge eq ne le lt) | |
46 | ||
47 | (define_operator_list LOG BUILT_IN_LOGF BUILT_IN_LOG BUILT_IN_LOGL) | |
48 | (define_operator_list EXP BUILT_IN_EXPF BUILT_IN_EXP BUILT_IN_EXPL) | |
49 | (define_operator_list LOG2 BUILT_IN_LOG2F BUILT_IN_LOG2 BUILT_IN_LOG2L) | |
50 | (define_operator_list EXP2 BUILT_IN_EXP2F BUILT_IN_EXP2 BUILT_IN_EXP2L) | |
51 | (define_operator_list LOG10 BUILT_IN_LOG10F BUILT_IN_LOG10 BUILT_IN_LOG10L) | |
52 | (define_operator_list EXP10 BUILT_IN_EXP10F BUILT_IN_EXP10 BUILT_IN_EXP10L) | |
53 | (define_operator_list POW BUILT_IN_POWF BUILT_IN_POW BUILT_IN_POWL) | |
54 | (define_operator_list POW10 BUILT_IN_POW10F BUILT_IN_POW10 BUILT_IN_POW10L) | |
55 | (define_operator_list SQRT BUILT_IN_SQRTF BUILT_IN_SQRT BUILT_IN_SQRTL) | |
56 | (define_operator_list CBRT BUILT_IN_CBRTF BUILT_IN_CBRT BUILT_IN_CBRTL) | |
f84e7fd6 | 57 | |
e0ee10ed RB |
58 | |
59 | /* Simplifications of operations with one constant operand and | |
36a60e48 | 60 | simplifications to constants or single values. */ |
e0ee10ed RB |
61 | |
62 | (for op (plus pointer_plus minus bit_ior bit_xor) | |
63 | (simplify | |
64 | (op @0 integer_zerop) | |
65 | (non_lvalue @0))) | |
66 | ||
a499aac5 RB |
67 | /* 0 +p index -> (type)index */ |
68 | (simplify | |
69 | (pointer_plus integer_zerop @1) | |
70 | (non_lvalue (convert @1))) | |
71 | ||
a7f24614 RB |
72 | /* See if ARG1 is zero and X + ARG1 reduces to X. |
73 | Likewise if the operands are reversed. */ | |
74 | (simplify | |
75 | (plus:c @0 real_zerop@1) | |
76 | (if (fold_real_zero_addition_p (type, @1, 0)) | |
77 | (non_lvalue @0))) | |
78 | ||
79 | /* See if ARG1 is zero and X - ARG1 reduces to X. */ | |
80 | (simplify | |
81 | (minus @0 real_zerop@1) | |
82 | (if (fold_real_zero_addition_p (type, @1, 1)) | |
83 | (non_lvalue @0))) | |
84 | ||
e0ee10ed RB |
85 | /* Simplify x - x. |
86 | This is unsafe for certain floats even in non-IEEE formats. | |
87 | In IEEE, it is unsafe because it does wrong for NaNs. | |
88 | Also note that operand_equal_p is always false if an operand | |
89 | is volatile. */ | |
90 | (simplify | |
a7f24614 | 91 | (minus @0 @0) |
1b457aa4 | 92 | (if (!FLOAT_TYPE_P (type) || !HONOR_NANS (type)) |
a7f24614 | 93 | { build_zero_cst (type); })) |
e0ee10ed RB |
94 | |
95 | (simplify | |
a7f24614 RB |
96 | (mult @0 integer_zerop@1) |
97 | @1) | |
98 | ||
99 | /* Maybe fold x * 0 to 0. The expressions aren't the same | |
100 | when x is NaN, since x * 0 is also NaN. Nor are they the | |
101 | same in modes with signed zeros, since multiplying a | |
102 | negative value by 0 gives -0, not +0. */ | |
103 | (simplify | |
104 | (mult @0 real_zerop@1) | |
8b5ee871 | 105 | (if (!HONOR_NANS (type) && !HONOR_SIGNED_ZEROS (type)) |
a7f24614 RB |
106 | @1)) |
107 | ||
108 | /* In IEEE floating point, x*1 is not equivalent to x for snans. | |
109 | Likewise for complex arithmetic with signed zeros. */ | |
110 | (simplify | |
111 | (mult @0 real_onep) | |
8b5ee871 MG |
112 | (if (!HONOR_SNANS (type) |
113 | && (!HONOR_SIGNED_ZEROS (type) | |
a7f24614 RB |
114 | || !COMPLEX_FLOAT_TYPE_P (type))) |
115 | (non_lvalue @0))) | |
116 | ||
117 | /* Transform x * -1.0 into -x. */ | |
118 | (simplify | |
119 | (mult @0 real_minus_onep) | |
8b5ee871 MG |
120 | (if (!HONOR_SNANS (type) |
121 | && (!HONOR_SIGNED_ZEROS (type) | |
a7f24614 RB |
122 | || !COMPLEX_FLOAT_TYPE_P (type))) |
123 | (negate @0))) | |
e0ee10ed RB |
124 | |
125 | /* Make sure to preserve divisions by zero. This is the reason why | |
126 | we don't simplify x / x to 1 or 0 / x to 0. */ | |
127 | (for op (mult trunc_div ceil_div floor_div round_div exact_div) | |
128 | (simplify | |
129 | (op @0 integer_onep) | |
130 | (non_lvalue @0))) | |
131 | ||
a7f24614 RB |
132 | /* X / -1 is -X. */ |
133 | (for div (trunc_div ceil_div floor_div round_div exact_div) | |
134 | (simplify | |
09240451 MG |
135 | (div @0 integer_minus_onep@1) |
136 | (if (!TYPE_UNSIGNED (type)) | |
a7f24614 RB |
137 | (negate @0)))) |
138 | ||
139 | /* For unsigned integral types, FLOOR_DIV_EXPR is the same as | |
140 | TRUNC_DIV_EXPR. Rewrite into the latter in this case. */ | |
141 | (simplify | |
142 | (floor_div @0 @1) | |
09240451 MG |
143 | (if ((INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type)) |
144 | && TYPE_UNSIGNED (type)) | |
a7f24614 RB |
145 | (trunc_div @0 @1))) |
146 | ||
28093105 RB |
147 | /* Combine two successive divisions. Note that combining ceil_div |
148 | and floor_div is trickier and combining round_div even more so. */ | |
149 | (for div (trunc_div exact_div) | |
c306cfaf RB |
150 | (simplify |
151 | (div (div @0 INTEGER_CST@1) INTEGER_CST@2) | |
152 | (with { | |
153 | bool overflow_p; | |
154 | wide_int mul = wi::mul (@1, @2, TYPE_SIGN (type), &overflow_p); | |
155 | } | |
156 | (if (!overflow_p) | |
8fdc6c67 RB |
157 | (div @0 { wide_int_to_tree (type, mul); }) |
158 | (if (TYPE_UNSIGNED (type) | |
159 | || mul != wi::min_value (TYPE_PRECISION (type), SIGNED)) | |
160 | { build_zero_cst (type); }))))) | |
c306cfaf | 161 | |
a7f24614 | 162 | /* Optimize A / A to 1.0 if we don't care about |
09240451 | 163 | NaNs or Infinities. */ |
a7f24614 RB |
164 | (simplify |
165 | (rdiv @0 @0) | |
09240451 | 166 | (if (FLOAT_TYPE_P (type) |
1b457aa4 | 167 | && ! HONOR_NANS (type) |
8b5ee871 | 168 | && ! HONOR_INFINITIES (type)) |
09240451 MG |
169 | { build_one_cst (type); })) |
170 | ||
171 | /* Optimize -A / A to -1.0 if we don't care about | |
172 | NaNs or Infinities. */ | |
173 | (simplify | |
174 | (rdiv:c @0 (negate @0)) | |
175 | (if (FLOAT_TYPE_P (type) | |
1b457aa4 | 176 | && ! HONOR_NANS (type) |
8b5ee871 | 177 | && ! HONOR_INFINITIES (type)) |
09240451 | 178 | { build_minus_one_cst (type); })) |
a7f24614 RB |
179 | |
180 | /* In IEEE floating point, x/1 is not equivalent to x for snans. */ | |
181 | (simplify | |
182 | (rdiv @0 real_onep) | |
8b5ee871 | 183 | (if (!HONOR_SNANS (type)) |
a7f24614 RB |
184 | (non_lvalue @0))) |
185 | ||
186 | /* In IEEE floating point, x/-1 is not equivalent to -x for snans. */ | |
187 | (simplify | |
188 | (rdiv @0 real_minus_onep) | |
8b5ee871 | 189 | (if (!HONOR_SNANS (type)) |
a7f24614 RB |
190 | (negate @0))) |
191 | ||
192 | /* If ARG1 is a constant, we can convert this to a multiply by the | |
193 | reciprocal. This does not have the same rounding properties, | |
194 | so only do this if -freciprocal-math. We can actually | |
195 | always safely do it if ARG1 is a power of two, but it's hard to | |
196 | tell if it is or not in a portable manner. */ | |
197 | (for cst (REAL_CST COMPLEX_CST VECTOR_CST) | |
198 | (simplify | |
199 | (rdiv @0 cst@1) | |
200 | (if (optimize) | |
53bc4b3a RB |
201 | (if (flag_reciprocal_math |
202 | && !real_zerop (@1)) | |
a7f24614 | 203 | (with |
249700b5 | 204 | { tree tem = const_binop (RDIV_EXPR, type, build_one_cst (type), @1); } |
a7f24614 | 205 | (if (tem) |
8fdc6c67 RB |
206 | (mult @0 { tem; } ))) |
207 | (if (cst != COMPLEX_CST) | |
208 | (with { tree inverse = exact_inverse (type, @1); } | |
209 | (if (inverse) | |
210 | (mult @0 { inverse; } )))))))) | |
a7f24614 | 211 | |
e0ee10ed RB |
212 | /* Same applies to modulo operations, but fold is inconsistent here |
213 | and simplifies 0 % x to 0, only preserving literal 0 % 0. */ | |
a7f24614 | 214 | (for mod (ceil_mod floor_mod round_mod trunc_mod) |
e0ee10ed RB |
215 | /* 0 % X is always zero. */ |
216 | (simplify | |
a7f24614 | 217 | (mod integer_zerop@0 @1) |
e0ee10ed RB |
218 | /* But not for 0 % 0 so that we can get the proper warnings and errors. */ |
219 | (if (!integer_zerop (@1)) | |
220 | @0)) | |
221 | /* X % 1 is always zero. */ | |
222 | (simplify | |
a7f24614 RB |
223 | (mod @0 integer_onep) |
224 | { build_zero_cst (type); }) | |
225 | /* X % -1 is zero. */ | |
226 | (simplify | |
09240451 MG |
227 | (mod @0 integer_minus_onep@1) |
228 | (if (!TYPE_UNSIGNED (type)) | |
bc4315fb MG |
229 | { build_zero_cst (type); })) |
230 | /* (X % Y) % Y is just X % Y. */ | |
231 | (simplify | |
232 | (mod (mod@2 @0 @1) @1) | |
98e30e51 RB |
233 | @2) |
234 | /* From extract_muldiv_1: (X * C1) % C2 is zero if C1 is a multiple of C2. */ | |
235 | (simplify | |
236 | (mod (mult @0 INTEGER_CST@1) INTEGER_CST@2) | |
237 | (if (ANY_INTEGRAL_TYPE_P (type) | |
238 | && TYPE_OVERFLOW_UNDEFINED (type) | |
239 | && wi::multiple_of_p (@1, @2, TYPE_SIGN (type))) | |
240 | { build_zero_cst (type); }))) | |
a7f24614 RB |
241 | |
242 | /* X % -C is the same as X % C. */ | |
243 | (simplify | |
244 | (trunc_mod @0 INTEGER_CST@1) | |
245 | (if (TYPE_SIGN (type) == SIGNED | |
246 | && !TREE_OVERFLOW (@1) | |
247 | && wi::neg_p (@1) | |
248 | && !TYPE_OVERFLOW_TRAPS (type) | |
249 | /* Avoid this transformation if C is INT_MIN, i.e. C == -C. */ | |
250 | && !sign_bit_p (@1, @1)) | |
251 | (trunc_mod @0 (negate @1)))) | |
e0ee10ed | 252 | |
8f0c696a RB |
253 | /* X % -Y is the same as X % Y. */ |
254 | (simplify | |
255 | (trunc_mod @0 (convert? (negate @1))) | |
256 | (if (!TYPE_UNSIGNED (type) | |
257 | && !TYPE_OVERFLOW_TRAPS (type) | |
258 | && tree_nop_conversion_p (type, TREE_TYPE (@1))) | |
259 | (trunc_mod @0 (convert @1)))) | |
260 | ||
f461569a MP |
261 | /* X - (X / Y) * Y is the same as X % Y. */ |
262 | (simplify | |
d3bc1d1b | 263 | (minus (convert1? @0) (convert2? (mult (trunc_div @0 @1) @1))) |
f461569a | 264 | (if (INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type)) |
d3bc1d1b | 265 | (trunc_mod (convert @0) (convert @1)))) |
f461569a | 266 | |
8f0c696a RB |
267 | /* Optimize TRUNC_MOD_EXPR by a power of two into a BIT_AND_EXPR, |
268 | i.e. "X % C" into "X & (C - 1)", if X and C are positive. | |
269 | Also optimize A % (C << N) where C is a power of 2, | |
270 | to A & ((C << N) - 1). */ | |
271 | (match (power_of_two_cand @1) | |
272 | INTEGER_CST@1) | |
273 | (match (power_of_two_cand @1) | |
274 | (lshift INTEGER_CST@1 @2)) | |
275 | (for mod (trunc_mod floor_mod) | |
276 | (simplify | |
4ab1e111 | 277 | (mod @0 (convert?@3 (power_of_two_cand@1 @2))) |
8f0c696a RB |
278 | (if ((TYPE_UNSIGNED (type) |
279 | || tree_expr_nonnegative_p (@0)) | |
4ab1e111 | 280 | && tree_nop_conversion_p (type, TREE_TYPE (@3)) |
8f0c696a | 281 | && integer_pow2p (@2) && tree_int_cst_sgn (@2) > 0) |
4ab1e111 | 282 | (bit_and @0 (convert (minus @1 { build_int_cst (TREE_TYPE (@1), 1); })))))) |
8f0c696a | 283 | |
887ab609 N |
284 | /* Simplify (unsigned t * 2)/2 -> unsigned t & 0x7FFFFFFF. */ |
285 | (simplify | |
286 | (trunc_div (mult @0 integer_pow2p@1) @1) | |
287 | (if (TYPE_UNSIGNED (TREE_TYPE (@0))) | |
288 | (bit_and @0 { wide_int_to_tree | |
289 | (type, wi::mask (TYPE_PRECISION (type) - wi::exact_log2 (@1), | |
290 | false, TYPE_PRECISION (type))); }))) | |
291 | ||
5f8d832e N |
292 | /* Simplify (unsigned t / 2) * 2 -> unsigned t & ~1. */ |
293 | (simplify | |
294 | (mult (trunc_div @0 integer_pow2p@1) @1) | |
295 | (if (TYPE_UNSIGNED (TREE_TYPE (@0))) | |
296 | (bit_and @0 (negate @1)))) | |
297 | ||
bc4315fb MG |
298 | /* X % Y is smaller than Y. */ |
299 | (for cmp (lt ge) | |
300 | (simplify | |
301 | (cmp (trunc_mod @0 @1) @1) | |
302 | (if (TYPE_UNSIGNED (TREE_TYPE (@0))) | |
303 | { constant_boolean_node (cmp == LT_EXPR, type); }))) | |
304 | (for cmp (gt le) | |
305 | (simplify | |
306 | (cmp @1 (trunc_mod @0 @1)) | |
307 | (if (TYPE_UNSIGNED (TREE_TYPE (@0))) | |
308 | { constant_boolean_node (cmp == GT_EXPR, type); }))) | |
309 | ||
e0ee10ed RB |
310 | /* x | ~0 -> ~0 */ |
311 | (simplify | |
312 | (bit_ior @0 integer_all_onesp@1) | |
313 | @1) | |
314 | ||
315 | /* x & 0 -> 0 */ | |
316 | (simplify | |
317 | (bit_and @0 integer_zerop@1) | |
318 | @1) | |
319 | ||
a4398a30 | 320 | /* ~x | x -> -1 */ |
8b5ee871 MG |
321 | /* ~x ^ x -> -1 */ |
322 | /* ~x + x -> -1 */ | |
323 | (for op (bit_ior bit_xor plus) | |
324 | (simplify | |
325 | (op:c (convert? @0) (convert? (bit_not @0))) | |
326 | (convert { build_all_ones_cst (TREE_TYPE (@0)); }))) | |
a4398a30 | 327 | |
e0ee10ed RB |
328 | /* x ^ x -> 0 */ |
329 | (simplify | |
330 | (bit_xor @0 @0) | |
331 | { build_zero_cst (type); }) | |
332 | ||
36a60e48 RB |
333 | /* Canonicalize X ^ ~0 to ~X. */ |
334 | (simplify | |
335 | (bit_xor @0 integer_all_onesp@1) | |
336 | (bit_not @0)) | |
337 | ||
338 | /* x & ~0 -> x */ | |
339 | (simplify | |
340 | (bit_and @0 integer_all_onesp) | |
341 | (non_lvalue @0)) | |
342 | ||
343 | /* x & x -> x, x | x -> x */ | |
344 | (for bitop (bit_and bit_ior) | |
345 | (simplify | |
346 | (bitop @0 @0) | |
347 | (non_lvalue @0))) | |
348 | ||
0f770b01 RV |
349 | /* x + (x & 1) -> (x + 1) & ~1 */ |
350 | (simplify | |
44fc0a51 RB |
351 | (plus:c @0 (bit_and:s @0 integer_onep@1)) |
352 | (bit_and (plus @0 @1) (bit_not @1))) | |
0f770b01 RV |
353 | |
354 | /* x & ~(x & y) -> x & ~y */ | |
355 | /* x | ~(x | y) -> x | ~y */ | |
356 | (for bitop (bit_and bit_ior) | |
af563d4b | 357 | (simplify |
44fc0a51 RB |
358 | (bitop:c @0 (bit_not (bitop:cs @0 @1))) |
359 | (bitop @0 (bit_not @1)))) | |
af563d4b MG |
360 | |
361 | /* (x | y) & ~x -> y & ~x */ | |
362 | /* (x & y) | ~x -> y | ~x */ | |
363 | (for bitop (bit_and bit_ior) | |
364 | rbitop (bit_ior bit_and) | |
365 | (simplify | |
366 | (bitop:c (rbitop:c @0 @1) (bit_not@2 @0)) | |
367 | (bitop @1 @2))) | |
0f770b01 | 368 | |
f13c4673 MP |
369 | /* (x & y) ^ (x | y) -> x ^ y */ |
370 | (simplify | |
2d6f2dce MP |
371 | (bit_xor:c (bit_and @0 @1) (bit_ior @0 @1)) |
372 | (bit_xor @0 @1)) | |
f13c4673 | 373 | |
9ea65ca6 MP |
374 | /* (x ^ y) ^ (x | y) -> x & y */ |
375 | (simplify | |
376 | (bit_xor:c (bit_xor @0 @1) (bit_ior @0 @1)) | |
377 | (bit_and @0 @1)) | |
378 | ||
379 | /* (x & y) + (x ^ y) -> x | y */ | |
380 | /* (x & y) | (x ^ y) -> x | y */ | |
381 | /* (x & y) ^ (x ^ y) -> x | y */ | |
382 | (for op (plus bit_ior bit_xor) | |
383 | (simplify | |
384 | (op:c (bit_and @0 @1) (bit_xor @0 @1)) | |
385 | (bit_ior @0 @1))) | |
386 | ||
387 | /* (x & y) + (x | y) -> x + y */ | |
388 | (simplify | |
389 | (plus:c (bit_and @0 @1) (bit_ior @0 @1)) | |
390 | (plus @0 @1)) | |
391 | ||
9737efaf MP |
392 | /* (x + y) - (x | y) -> x & y */ |
393 | (simplify | |
394 | (minus (plus @0 @1) (bit_ior @0 @1)) | |
395 | (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type) | |
396 | && !TYPE_SATURATING (type)) | |
397 | (bit_and @0 @1))) | |
398 | ||
399 | /* (x + y) - (x & y) -> x | y */ | |
400 | (simplify | |
401 | (minus (plus @0 @1) (bit_and @0 @1)) | |
402 | (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type) | |
403 | && !TYPE_SATURATING (type)) | |
404 | (bit_ior @0 @1))) | |
405 | ||
9ea65ca6 MP |
406 | /* (x | y) - (x ^ y) -> x & y */ |
407 | (simplify | |
408 | (minus (bit_ior @0 @1) (bit_xor @0 @1)) | |
409 | (bit_and @0 @1)) | |
410 | ||
411 | /* (x | y) - (x & y) -> x ^ y */ | |
412 | (simplify | |
413 | (minus (bit_ior @0 @1) (bit_and @0 @1)) | |
414 | (bit_xor @0 @1)) | |
415 | ||
66cc6273 MP |
416 | /* (x | y) & ~(x & y) -> x ^ y */ |
417 | (simplify | |
418 | (bit_and:c (bit_ior @0 @1) (bit_not (bit_and @0 @1))) | |
419 | (bit_xor @0 @1)) | |
420 | ||
421 | /* (x | y) & (~x ^ y) -> x & y */ | |
422 | (simplify | |
423 | (bit_and:c (bit_ior:c @0 @1) (bit_xor:c @1 (bit_not @0))) | |
424 | (bit_and @0 @1)) | |
425 | ||
5b00d921 RB |
426 | /* ~x & ~y -> ~(x | y) |
427 | ~x | ~y -> ~(x & y) */ | |
428 | (for op (bit_and bit_ior) | |
429 | rop (bit_ior bit_and) | |
430 | (simplify | |
431 | (op (convert1? (bit_not @0)) (convert2? (bit_not @1))) | |
432 | (if (tree_nop_conversion_p (type, TREE_TYPE (@0)) | |
433 | && tree_nop_conversion_p (type, TREE_TYPE (@1))) | |
434 | (bit_not (rop (convert @0) (convert @1)))))) | |
435 | ||
14ea9f92 | 436 | /* If we are XORing or adding two BIT_AND_EXPR's, both of which are and'ing |
5b00d921 RB |
437 | with a constant, and the two constants have no bits in common, |
438 | we should treat this as a BIT_IOR_EXPR since this may produce more | |
439 | simplifications. */ | |
14ea9f92 RB |
440 | (for op (bit_xor plus) |
441 | (simplify | |
442 | (op (convert1? (bit_and@4 @0 INTEGER_CST@1)) | |
443 | (convert2? (bit_and@5 @2 INTEGER_CST@3))) | |
444 | (if (tree_nop_conversion_p (type, TREE_TYPE (@0)) | |
445 | && tree_nop_conversion_p (type, TREE_TYPE (@2)) | |
446 | && wi::bit_and (@1, @3) == 0) | |
447 | (bit_ior (convert @4) (convert @5))))) | |
5b00d921 RB |
448 | |
449 | /* (X | Y) ^ X -> Y & ~ X*/ | |
450 | (simplify | |
451 | (bit_xor:c (convert? (bit_ior:c @0 @1)) (convert? @0)) | |
452 | (if (tree_nop_conversion_p (type, TREE_TYPE (@0))) | |
453 | (convert (bit_and @1 (bit_not @0))))) | |
454 | ||
455 | /* Convert ~X ^ ~Y to X ^ Y. */ | |
456 | (simplify | |
457 | (bit_xor (convert1? (bit_not @0)) (convert2? (bit_not @1))) | |
458 | (if (tree_nop_conversion_p (type, TREE_TYPE (@0)) | |
459 | && tree_nop_conversion_p (type, TREE_TYPE (@1))) | |
460 | (bit_xor (convert @0) (convert @1)))) | |
461 | ||
462 | /* Convert ~X ^ C to X ^ ~C. */ | |
463 | (simplify | |
464 | (bit_xor (convert? (bit_not @0)) INTEGER_CST@1) | |
c8ba6498 EB |
465 | (if (tree_nop_conversion_p (type, TREE_TYPE (@0))) |
466 | (bit_xor (convert @0) (bit_not @1)))) | |
5b00d921 | 467 | |
97e77391 RB |
468 | /* Fold (X & Y) ^ Y as ~X & Y. */ |
469 | (simplify | |
470 | (bit_xor:c (bit_and:c @0 @1) @1) | |
471 | (bit_and (bit_not @0) @1)) | |
472 | ||
14ea9f92 RB |
473 | /* Given a bit-wise operation CODE applied to ARG0 and ARG1, see if both |
474 | operands are another bit-wise operation with a common input. If so, | |
475 | distribute the bit operations to save an operation and possibly two if | |
476 | constants are involved. For example, convert | |
477 | (A | B) & (A | C) into A | (B & C) | |
478 | Further simplification will occur if B and C are constants. */ | |
479 | (for op (bit_and bit_ior) | |
480 | rop (bit_ior bit_and) | |
481 | (simplify | |
482 | (op (convert? (rop:c @0 @1)) (convert? (rop @0 @2))) | |
483 | (if (tree_nop_conversion_p (type, TREE_TYPE (@0))) | |
484 | (rop (convert @0) (op (convert @1) (convert @2)))))) | |
485 | ||
5b00d921 | 486 | |
b14a9c57 RB |
487 | (simplify |
488 | (abs (abs@1 @0)) | |
489 | @1) | |
f3582e54 RB |
490 | (simplify |
491 | (abs (negate @0)) | |
492 | (abs @0)) | |
493 | (simplify | |
494 | (abs tree_expr_nonnegative_p@0) | |
495 | @0) | |
496 | ||
55cf3946 RB |
497 | /* A few cases of fold-const.c negate_expr_p predicate. */ |
498 | (match negate_expr_p | |
499 | INTEGER_CST | |
b14a9c57 RB |
500 | (if ((INTEGRAL_TYPE_P (type) |
501 | && TYPE_OVERFLOW_WRAPS (type)) | |
502 | || (!TYPE_OVERFLOW_SANITIZED (type) | |
55cf3946 RB |
503 | && may_negate_without_overflow_p (t))))) |
504 | (match negate_expr_p | |
505 | FIXED_CST) | |
506 | (match negate_expr_p | |
507 | (negate @0) | |
508 | (if (!TYPE_OVERFLOW_SANITIZED (type)))) | |
509 | (match negate_expr_p | |
510 | REAL_CST | |
511 | (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (t))))) | |
512 | /* VECTOR_CST handling of non-wrapping types would recurse in unsupported | |
513 | ways. */ | |
514 | (match negate_expr_p | |
515 | VECTOR_CST | |
516 | (if (FLOAT_TYPE_P (TREE_TYPE (type)) || TYPE_OVERFLOW_WRAPS (type)))) | |
517 | ||
518 | /* -(A + B) -> (-B) - A. */ | |
b14a9c57 | 519 | (simplify |
55cf3946 RB |
520 | (negate (plus:c @0 negate_expr_p@1)) |
521 | (if (!HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type)) | |
522 | && !HONOR_SIGNED_ZEROS (element_mode (type))) | |
523 | (minus (negate @1) @0))) | |
524 | ||
525 | /* A - B -> A + (-B) if B is easily negatable. */ | |
b14a9c57 | 526 | (simplify |
55cf3946 | 527 | (minus @0 negate_expr_p@1) |
e4e96a4f KT |
528 | (if (!FIXED_POINT_TYPE_P (type)) |
529 | (plus @0 (negate @1)))) | |
d4573ffe | 530 | |
5609420f RB |
531 | /* Try to fold (type) X op CST -> (type) (X op ((type-x) CST)) |
532 | when profitable. | |
533 | For bitwise binary operations apply operand conversions to the | |
534 | binary operation result instead of to the operands. This allows | |
535 | to combine successive conversions and bitwise binary operations. | |
536 | We combine the above two cases by using a conditional convert. */ | |
537 | (for bitop (bit_and bit_ior bit_xor) | |
538 | (simplify | |
539 | (bitop (convert @0) (convert? @1)) | |
540 | (if (((TREE_CODE (@1) == INTEGER_CST | |
541 | && INTEGRAL_TYPE_P (TREE_TYPE (@0)) | |
ad6f996c | 542 | && int_fits_type_p (@1, TREE_TYPE (@0))) |
aea417d7 | 543 | || types_match (@0, @1)) |
ad6f996c RB |
544 | /* ??? This transform conflicts with fold-const.c doing |
545 | Convert (T)(x & c) into (T)x & (T)c, if c is an integer | |
546 | constants (if x has signed type, the sign bit cannot be set | |
547 | in c). This folds extension into the BIT_AND_EXPR. | |
548 | Restrict it to GIMPLE to avoid endless recursions. */ | |
549 | && (bitop != BIT_AND_EXPR || GIMPLE) | |
5609420f RB |
550 | && (/* That's a good idea if the conversion widens the operand, thus |
551 | after hoisting the conversion the operation will be narrower. */ | |
552 | TYPE_PRECISION (TREE_TYPE (@0)) < TYPE_PRECISION (type) | |
553 | /* It's also a good idea if the conversion is to a non-integer | |
554 | mode. */ | |
555 | || GET_MODE_CLASS (TYPE_MODE (type)) != MODE_INT | |
556 | /* Or if the precision of TO is not the same as the precision | |
557 | of its mode. */ | |
558 | || TYPE_PRECISION (type) != GET_MODE_PRECISION (TYPE_MODE (type)))) | |
559 | (convert (bitop @0 (convert @1)))))) | |
560 | ||
b14a9c57 RB |
561 | (for bitop (bit_and bit_ior) |
562 | rbitop (bit_ior bit_and) | |
563 | /* (x | y) & x -> x */ | |
564 | /* (x & y) | x -> x */ | |
565 | (simplify | |
566 | (bitop:c (rbitop:c @0 @1) @0) | |
567 | @0) | |
568 | /* (~x | y) & x -> x & y */ | |
569 | /* (~x & y) | x -> x | y */ | |
570 | (simplify | |
571 | (bitop:c (rbitop:c (bit_not @0) @1) @0) | |
572 | (bitop @0 @1))) | |
573 | ||
5609420f RB |
574 | /* Simplify (A & B) OP0 (C & B) to (A OP0 C) & B. */ |
575 | (for bitop (bit_and bit_ior bit_xor) | |
576 | (simplify | |
577 | (bitop (bit_and:c @0 @1) (bit_and @2 @1)) | |
578 | (bit_and (bitop @0 @2) @1))) | |
579 | ||
580 | /* (x | CST1) & CST2 -> (x & CST2) | (CST1 & CST2) */ | |
581 | (simplify | |
582 | (bit_and (bit_ior @0 CONSTANT_CLASS_P@1) CONSTANT_CLASS_P@2) | |
583 | (bit_ior (bit_and @0 @2) (bit_and @1 @2))) | |
584 | ||
585 | /* Combine successive equal operations with constants. */ | |
586 | (for bitop (bit_and bit_ior bit_xor) | |
587 | (simplify | |
588 | (bitop (bitop @0 CONSTANT_CLASS_P@1) CONSTANT_CLASS_P@2) | |
589 | (bitop @0 (bitop @1 @2)))) | |
590 | ||
591 | /* Try simple folding for X op !X, and X op X with the help | |
592 | of the truth_valued_p and logical_inverted_value predicates. */ | |
593 | (match truth_valued_p | |
594 | @0 | |
595 | (if (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) == 1))) | |
f84e7fd6 | 596 | (for op (tcc_comparison truth_and truth_andif truth_or truth_orif truth_xor) |
5609420f RB |
597 | (match truth_valued_p |
598 | (op @0 @1))) | |
599 | (match truth_valued_p | |
600 | (truth_not @0)) | |
601 | ||
602 | (match (logical_inverted_value @0) | |
603 | (bit_not truth_valued_p@0)) | |
604 | (match (logical_inverted_value @0) | |
09240451 | 605 | (eq @0 integer_zerop)) |
5609420f | 606 | (match (logical_inverted_value @0) |
09240451 | 607 | (ne truth_valued_p@0 integer_truep)) |
5609420f | 608 | (match (logical_inverted_value @0) |
09240451 | 609 | (bit_xor truth_valued_p@0 integer_truep)) |
5609420f RB |
610 | |
611 | /* X & !X -> 0. */ | |
612 | (simplify | |
613 | (bit_and:c @0 (logical_inverted_value @0)) | |
614 | { build_zero_cst (type); }) | |
615 | /* X | !X and X ^ !X -> 1, , if X is truth-valued. */ | |
616 | (for op (bit_ior bit_xor) | |
617 | (simplify | |
618 | (op:c truth_valued_p@0 (logical_inverted_value @0)) | |
f84e7fd6 | 619 | { constant_boolean_node (true, type); })) |
5609420f | 620 | |
5609420f RB |
621 | /* If arg1 and arg2 are booleans (or any single bit type) |
622 | then try to simplify: | |
623 | ||
624 | (~X & Y) -> X < Y | |
625 | (X & ~Y) -> Y < X | |
626 | (~X | Y) -> X <= Y | |
627 | (X | ~Y) -> Y <= X | |
628 | ||
629 | But only do this if our result feeds into a comparison as | |
630 | this transformation is not always a win, particularly on | |
631 | targets with and-not instructions. | |
632 | -> simplify_bitwise_binary_boolean */ | |
633 | (simplify | |
634 | (ne (bit_and:c (bit_not @0) @1) integer_zerop) | |
635 | (if (INTEGRAL_TYPE_P (TREE_TYPE (@1)) | |
636 | && TYPE_PRECISION (TREE_TYPE (@1)) == 1) | |
637 | (lt @0 @1))) | |
638 | (simplify | |
639 | (ne (bit_ior:c (bit_not @0) @1) integer_zerop) | |
640 | (if (INTEGRAL_TYPE_P (TREE_TYPE (@1)) | |
641 | && TYPE_PRECISION (TREE_TYPE (@1)) == 1) | |
642 | (le @0 @1))) | |
643 | ||
5609420f RB |
644 | /* ~~x -> x */ |
645 | (simplify | |
646 | (bit_not (bit_not @0)) | |
647 | @0) | |
648 | ||
b14a9c57 RB |
649 | /* Convert ~ (-A) to A - 1. */ |
650 | (simplify | |
651 | (bit_not (convert? (negate @0))) | |
652 | (if (tree_nop_conversion_p (type, TREE_TYPE (@0))) | |
8b5ee871 | 653 | (convert (minus @0 { build_each_one_cst (TREE_TYPE (@0)); })))) |
b14a9c57 RB |
654 | |
655 | /* Convert ~ (A - 1) or ~ (A + -1) to -A. */ | |
656 | (simplify | |
8b5ee871 | 657 | (bit_not (convert? (minus @0 integer_each_onep))) |
b14a9c57 RB |
658 | (if (tree_nop_conversion_p (type, TREE_TYPE (@0))) |
659 | (convert (negate @0)))) | |
660 | (simplify | |
661 | (bit_not (convert? (plus @0 integer_all_onesp))) | |
662 | (if (tree_nop_conversion_p (type, TREE_TYPE (@0))) | |
663 | (convert (negate @0)))) | |
664 | ||
665 | /* Part of convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */ | |
666 | (simplify | |
667 | (bit_not (convert? (bit_xor @0 INTEGER_CST@1))) | |
668 | (if (tree_nop_conversion_p (type, TREE_TYPE (@0))) | |
669 | (convert (bit_xor @0 (bit_not @1))))) | |
670 | (simplify | |
671 | (bit_not (convert? (bit_xor:c (bit_not @0) @1))) | |
672 | (if (tree_nop_conversion_p (type, TREE_TYPE (@0))) | |
673 | (convert (bit_xor @0 @1)))) | |
674 | ||
f52baa7b MP |
675 | /* (x & ~m) | (y & m) -> ((x ^ y) & m) ^ x */ |
676 | (simplify | |
44fc0a51 RB |
677 | (bit_ior:c (bit_and:cs @0 (bit_not @2)) (bit_and:cs @1 @2)) |
678 | (bit_xor (bit_and (bit_xor @0 @1) @2) @0)) | |
f52baa7b | 679 | |
f7b7b0aa MP |
680 | /* Fold A - (A & B) into ~B & A. */ |
681 | (simplify | |
682 | (minus (convert? @0) (convert?:s (bit_and:cs @0 @1))) | |
683 | (if (tree_nop_conversion_p (type, TREE_TYPE (@0)) | |
684 | && tree_nop_conversion_p (type, TREE_TYPE (@1))) | |
685 | (convert (bit_and (bit_not @1) @0)))) | |
5609420f | 686 | |
a499aac5 RB |
687 | /* Associate (p +p off1) +p off2 as (p +p (off1 + off2)). */ |
688 | (simplify | |
44fc0a51 RB |
689 | (pointer_plus (pointer_plus:s @0 @1) @3) |
690 | (pointer_plus @0 (plus @1 @3))) | |
a499aac5 RB |
691 | |
692 | /* Pattern match | |
693 | tem1 = (long) ptr1; | |
694 | tem2 = (long) ptr2; | |
695 | tem3 = tem2 - tem1; | |
696 | tem4 = (unsigned long) tem3; | |
697 | tem5 = ptr1 + tem4; | |
698 | and produce | |
699 | tem5 = ptr2; */ | |
700 | (simplify | |
701 | (pointer_plus @0 (convert?@2 (minus@3 (convert @1) (convert @0)))) | |
702 | /* Conditionally look through a sign-changing conversion. */ | |
703 | (if (TYPE_PRECISION (TREE_TYPE (@2)) == TYPE_PRECISION (TREE_TYPE (@3)) | |
704 | && ((GIMPLE && useless_type_conversion_p (type, TREE_TYPE (@1))) | |
705 | || (GENERIC && type == TREE_TYPE (@1)))) | |
706 | @1)) | |
707 | ||
708 | /* Pattern match | |
709 | tem = (sizetype) ptr; | |
710 | tem = tem & algn; | |
711 | tem = -tem; | |
712 | ... = ptr p+ tem; | |
713 | and produce the simpler and easier to analyze with respect to alignment | |
714 | ... = ptr & ~algn; */ | |
715 | (simplify | |
716 | (pointer_plus @0 (negate (bit_and (convert @0) INTEGER_CST@1))) | |
717 | (with { tree algn = wide_int_to_tree (TREE_TYPE (@0), wi::bit_not (@1)); } | |
718 | (bit_and @0 { algn; }))) | |
719 | ||
99e943a2 RB |
720 | /* Try folding difference of addresses. */ |
721 | (simplify | |
722 | (minus (convert ADDR_EXPR@0) (convert @1)) | |
723 | (if (tree_nop_conversion_p (type, TREE_TYPE (@0))) | |
724 | (with { HOST_WIDE_INT diff; } | |
725 | (if (ptr_difference_const (@0, @1, &diff)) | |
726 | { build_int_cst_type (type, diff); })))) | |
727 | (simplify | |
728 | (minus (convert @0) (convert ADDR_EXPR@1)) | |
729 | (if (tree_nop_conversion_p (type, TREE_TYPE (@0))) | |
730 | (with { HOST_WIDE_INT diff; } | |
731 | (if (ptr_difference_const (@0, @1, &diff)) | |
732 | { build_int_cst_type (type, diff); })))) | |
733 | ||
bab73f11 RB |
734 | /* If arg0 is derived from the address of an object or function, we may |
735 | be able to fold this expression using the object or function's | |
736 | alignment. */ | |
737 | (simplify | |
738 | (bit_and (convert? @0) INTEGER_CST@1) | |
739 | (if (POINTER_TYPE_P (TREE_TYPE (@0)) | |
740 | && tree_nop_conversion_p (type, TREE_TYPE (@0))) | |
741 | (with | |
742 | { | |
743 | unsigned int align; | |
744 | unsigned HOST_WIDE_INT bitpos; | |
745 | get_pointer_alignment_1 (@0, &align, &bitpos); | |
746 | } | |
747 | (if (wi::ltu_p (@1, align / BITS_PER_UNIT)) | |
748 | { wide_int_to_tree (type, wi::bit_and (@1, bitpos / BITS_PER_UNIT)); })))) | |
99e943a2 | 749 | |
a499aac5 | 750 | |
cc7b5acf RB |
751 | /* We can't reassociate at all for saturating types. */ |
752 | (if (!TYPE_SATURATING (type)) | |
753 | ||
754 | /* Contract negates. */ | |
755 | /* A + (-B) -> A - B */ | |
756 | (simplify | |
757 | (plus:c (convert1? @0) (convert2? (negate @1))) | |
758 | /* Apply STRIP_NOPS on @0 and the negate. */ | |
759 | (if (tree_nop_conversion_p (type, TREE_TYPE (@0)) | |
760 | && tree_nop_conversion_p (type, TREE_TYPE (@1)) | |
6a4f0678 | 761 | && !TYPE_OVERFLOW_SANITIZED (type)) |
cc7b5acf RB |
762 | (minus (convert @0) (convert @1)))) |
763 | /* A - (-B) -> A + B */ | |
764 | (simplify | |
765 | (minus (convert1? @0) (convert2? (negate @1))) | |
766 | (if (tree_nop_conversion_p (type, TREE_TYPE (@0)) | |
2f68e8bc | 767 | && tree_nop_conversion_p (type, TREE_TYPE (@1)) |
6a4f0678 | 768 | && !TYPE_OVERFLOW_SANITIZED (type)) |
cc7b5acf RB |
769 | (plus (convert @0) (convert @1)))) |
770 | /* -(-A) -> A */ | |
771 | (simplify | |
772 | (negate (convert? (negate @1))) | |
773 | (if (tree_nop_conversion_p (type, TREE_TYPE (@1)) | |
6a4f0678 | 774 | && !TYPE_OVERFLOW_SANITIZED (type)) |
a0f12cf8 | 775 | (convert @1))) |
cc7b5acf | 776 | |
7318e44f RB |
777 | /* We can't reassociate floating-point unless -fassociative-math |
778 | or fixed-point plus or minus because of saturation to +-Inf. */ | |
779 | (if ((!FLOAT_TYPE_P (type) || flag_associative_math) | |
780 | && !FIXED_POINT_TYPE_P (type)) | |
cc7b5acf RB |
781 | |
782 | /* Match patterns that allow contracting a plus-minus pair | |
783 | irrespective of overflow issues. */ | |
784 | /* (A +- B) - A -> +- B */ | |
785 | /* (A +- B) -+ B -> A */ | |
786 | /* A - (A +- B) -> -+ B */ | |
787 | /* A +- (B -+ A) -> +- B */ | |
788 | (simplify | |
789 | (minus (plus:c @0 @1) @0) | |
790 | @1) | |
791 | (simplify | |
792 | (minus (minus @0 @1) @0) | |
793 | (negate @1)) | |
794 | (simplify | |
795 | (plus:c (minus @0 @1) @1) | |
796 | @0) | |
797 | (simplify | |
798 | (minus @0 (plus:c @0 @1)) | |
799 | (negate @1)) | |
800 | (simplify | |
801 | (minus @0 (minus @0 @1)) | |
802 | @1) | |
803 | ||
804 | /* (A +- CST) +- CST -> A + CST */ | |
805 | (for outer_op (plus minus) | |
806 | (for inner_op (plus minus) | |
807 | (simplify | |
808 | (outer_op (inner_op @0 CONSTANT_CLASS_P@1) CONSTANT_CLASS_P@2) | |
809 | /* If the constant operation overflows we cannot do the transform | |
810 | as we would introduce undefined overflow, for example | |
811 | with (a - 1) + INT_MIN. */ | |
812 | (with { tree cst = fold_binary (outer_op == inner_op | |
813 | ? PLUS_EXPR : MINUS_EXPR, type, @1, @2); } | |
814 | (if (cst && !TREE_OVERFLOW (cst)) | |
815 | (inner_op @0 { cst; } )))))) | |
816 | ||
817 | /* (CST - A) +- CST -> CST - A */ | |
818 | (for outer_op (plus minus) | |
819 | (simplify | |
820 | (outer_op (minus CONSTANT_CLASS_P@1 @0) CONSTANT_CLASS_P@2) | |
821 | (with { tree cst = fold_binary (outer_op, type, @1, @2); } | |
822 | (if (cst && !TREE_OVERFLOW (cst)) | |
823 | (minus { cst; } @0))))) | |
824 | ||
825 | /* ~A + A -> -1 */ | |
826 | (simplify | |
827 | (plus:c (bit_not @0) @0) | |
828 | (if (!TYPE_OVERFLOW_TRAPS (type)) | |
829 | { build_all_ones_cst (type); })) | |
830 | ||
831 | /* ~A + 1 -> -A */ | |
832 | (simplify | |
e19740ae RB |
833 | (plus (convert? (bit_not @0)) integer_each_onep) |
834 | (if (tree_nop_conversion_p (type, TREE_TYPE (@0))) | |
835 | (negate (convert @0)))) | |
836 | ||
837 | /* -A - 1 -> ~A */ | |
838 | (simplify | |
839 | (minus (convert? (negate @0)) integer_each_onep) | |
840 | (if (!TYPE_OVERFLOW_TRAPS (type) | |
841 | && tree_nop_conversion_p (type, TREE_TYPE (@0))) | |
842 | (bit_not (convert @0)))) | |
843 | ||
844 | /* -1 - A -> ~A */ | |
845 | (simplify | |
846 | (minus integer_all_onesp @0) | |
bc4315fb | 847 | (bit_not @0)) |
cc7b5acf RB |
848 | |
849 | /* (T)(P + A) - (T)P -> (T) A */ | |
850 | (for add (plus pointer_plus) | |
851 | (simplify | |
852 | (minus (convert (add @0 @1)) | |
853 | (convert @0)) | |
09240451 | 854 | (if (element_precision (type) <= element_precision (TREE_TYPE (@1)) |
cc7b5acf RB |
855 | /* For integer types, if A has a smaller type |
856 | than T the result depends on the possible | |
857 | overflow in P + A. | |
858 | E.g. T=size_t, A=(unsigned)429497295, P>0. | |
859 | However, if an overflow in P + A would cause | |
860 | undefined behavior, we can assume that there | |
861 | is no overflow. */ | |
862 | || (INTEGRAL_TYPE_P (TREE_TYPE (@0)) | |
863 | && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))) | |
864 | /* For pointer types, if the conversion of A to the | |
865 | final type requires a sign- or zero-extension, | |
866 | then we have to punt - it is not defined which | |
867 | one is correct. */ | |
868 | || (POINTER_TYPE_P (TREE_TYPE (@0)) | |
869 | && TREE_CODE (@1) == INTEGER_CST | |
870 | && tree_int_cst_sign_bit (@1) == 0)) | |
871 | (convert @1)))))) | |
872 | ||
873 | ||
a7f24614 RB |
874 | /* Simplifications of MIN_EXPR and MAX_EXPR. */ |
875 | ||
876 | (for minmax (min max) | |
877 | (simplify | |
878 | (minmax @0 @0) | |
879 | @0)) | |
880 | (simplify | |
881 | (min @0 @1) | |
882 | (if (INTEGRAL_TYPE_P (type) | |
883 | && TYPE_MIN_VALUE (type) | |
884 | && operand_equal_p (@1, TYPE_MIN_VALUE (type), OEP_ONLY_CONST)) | |
885 | @1)) | |
886 | (simplify | |
887 | (max @0 @1) | |
888 | (if (INTEGRAL_TYPE_P (type) | |
889 | && TYPE_MAX_VALUE (type) | |
890 | && operand_equal_p (@1, TYPE_MAX_VALUE (type), OEP_ONLY_CONST)) | |
891 | @1)) | |
892 | ||
893 | ||
894 | /* Simplifications of shift and rotates. */ | |
895 | ||
896 | (for rotate (lrotate rrotate) | |
897 | (simplify | |
898 | (rotate integer_all_onesp@0 @1) | |
899 | @0)) | |
900 | ||
901 | /* Optimize -1 >> x for arithmetic right shifts. */ | |
902 | (simplify | |
903 | (rshift integer_all_onesp@0 @1) | |
904 | (if (!TYPE_UNSIGNED (type) | |
905 | && tree_expr_nonnegative_p (@1)) | |
906 | @0)) | |
907 | ||
908 | (for shiftrotate (lrotate rrotate lshift rshift) | |
909 | (simplify | |
910 | (shiftrotate @0 integer_zerop) | |
911 | (non_lvalue @0)) | |
912 | (simplify | |
913 | (shiftrotate integer_zerop@0 @1) | |
914 | @0) | |
915 | /* Prefer vector1 << scalar to vector1 << vector2 | |
916 | if vector2 is uniform. */ | |
917 | (for vec (VECTOR_CST CONSTRUCTOR) | |
918 | (simplify | |
919 | (shiftrotate @0 vec@1) | |
920 | (with { tree tem = uniform_vector_p (@1); } | |
921 | (if (tem) | |
922 | (shiftrotate @0 { tem; })))))) | |
923 | ||
924 | /* Rewrite an LROTATE_EXPR by a constant into an | |
925 | RROTATE_EXPR by a new constant. */ | |
926 | (simplify | |
927 | (lrotate @0 INTEGER_CST@1) | |
928 | (rrotate @0 { fold_binary (MINUS_EXPR, TREE_TYPE (@1), | |
929 | build_int_cst (TREE_TYPE (@1), | |
930 | element_precision (type)), @1); })) | |
931 | ||
14ea9f92 RB |
932 | /* Turn (a OP c1) OP c2 into a OP (c1+c2). */ |
933 | (for op (lrotate rrotate rshift lshift) | |
934 | (simplify | |
935 | (op (op @0 INTEGER_CST@1) INTEGER_CST@2) | |
936 | (with { unsigned int prec = element_precision (type); } | |
937 | (if (wi::ge_p (@1, 0, TYPE_SIGN (TREE_TYPE (@1))) | |
938 | && wi::lt_p (@1, prec, TYPE_SIGN (TREE_TYPE (@1))) | |
939 | && wi::ge_p (@2, 0, TYPE_SIGN (TREE_TYPE (@2))) | |
940 | && wi::lt_p (@2, prec, TYPE_SIGN (TREE_TYPE (@2)))) | |
941 | (with { unsigned int low = wi::add (@1, @2).to_uhwi (); } | |
942 | /* Deal with a OP (c1 + c2) being undefined but (a OP c1) OP c2 | |
943 | being well defined. */ | |
944 | (if (low >= prec) | |
945 | (if (op == LROTATE_EXPR || op == RROTATE_EXPR) | |
8fdc6c67 RB |
946 | (op @0 { build_int_cst (TREE_TYPE (@1), low % prec); }) |
947 | (if (TYPE_UNSIGNED (type) || code == LSHIFT_EXPR) | |
948 | { build_zero_cst (type); } | |
949 | (op @0 { build_int_cst (TREE_TYPE (@1), prec - 1); }))) | |
950 | (op @0 { build_int_cst (TREE_TYPE (@1), low); }))))))) | |
14ea9f92 RB |
951 | |
952 | ||
01ada710 MP |
953 | /* ((1 << A) & 1) != 0 -> A == 0 |
954 | ((1 << A) & 1) == 0 -> A != 0 */ | |
955 | (for cmp (ne eq) | |
956 | icmp (eq ne) | |
957 | (simplify | |
958 | (cmp (bit_and (lshift integer_onep @0) integer_onep) integer_zerop) | |
959 | (icmp @0 { build_zero_cst (TREE_TYPE (@0)); }))) | |
cc7b5acf | 960 | |
f2e609c3 MP |
961 | /* (CST1 << A) == CST2 -> A == ctz (CST2) - ctz (CST1) |
962 | (CST1 << A) != CST2 -> A != ctz (CST2) - ctz (CST1) | |
963 | if CST2 != 0. */ | |
964 | (for cmp (ne eq) | |
965 | (simplify | |
966 | (cmp (lshift INTEGER_CST@0 @1) INTEGER_CST@2) | |
967 | (with { int cand = wi::ctz (@2) - wi::ctz (@0); } | |
968 | (if (cand < 0 | |
969 | || (!integer_zerop (@2) | |
970 | && wi::ne_p (wi::lshift (@0, cand), @2))) | |
8fdc6c67 RB |
971 | { constant_boolean_node (cmp == NE_EXPR, type); } |
972 | (if (!integer_zerop (@2) | |
973 | && wi::eq_p (wi::lshift (@0, cand), @2)) | |
974 | (cmp @1 { build_int_cst (TREE_TYPE (@1), cand); })))))) | |
f2e609c3 | 975 | |
1ffbaa3f RB |
976 | /* Fold (X << C1) & C2 into (X << C1) & (C2 | ((1 << C1) - 1)) |
977 | (X >> C1) & C2 into (X >> C1) & (C2 | ~((type) -1 >> C1)) | |
978 | if the new mask might be further optimized. */ | |
979 | (for shift (lshift rshift) | |
980 | (simplify | |
44fc0a51 RB |
981 | (bit_and (convert?:s@4 (shift:s@5 (convert1?@3 @0) INTEGER_CST@1)) |
982 | INTEGER_CST@2) | |
1ffbaa3f RB |
983 | (if (tree_nop_conversion_p (TREE_TYPE (@4), TREE_TYPE (@5)) |
984 | && TYPE_PRECISION (type) <= HOST_BITS_PER_WIDE_INT | |
985 | && tree_fits_uhwi_p (@1) | |
986 | && tree_to_uhwi (@1) > 0 | |
987 | && tree_to_uhwi (@1) < TYPE_PRECISION (type)) | |
988 | (with | |
989 | { | |
990 | unsigned int shiftc = tree_to_uhwi (@1); | |
991 | unsigned HOST_WIDE_INT mask = TREE_INT_CST_LOW (@2); | |
992 | unsigned HOST_WIDE_INT newmask, zerobits = 0; | |
993 | tree shift_type = TREE_TYPE (@3); | |
994 | unsigned int prec; | |
995 | ||
996 | if (shift == LSHIFT_EXPR) | |
997 | zerobits = ((((unsigned HOST_WIDE_INT) 1) << shiftc) - 1); | |
998 | else if (shift == RSHIFT_EXPR | |
999 | && (TYPE_PRECISION (shift_type) | |
1000 | == GET_MODE_PRECISION (TYPE_MODE (shift_type)))) | |
1001 | { | |
1002 | prec = TYPE_PRECISION (TREE_TYPE (@3)); | |
1003 | tree arg00 = @0; | |
1004 | /* See if more bits can be proven as zero because of | |
1005 | zero extension. */ | |
1006 | if (@3 != @0 | |
1007 | && TYPE_UNSIGNED (TREE_TYPE (@0))) | |
1008 | { | |
1009 | tree inner_type = TREE_TYPE (@0); | |
1010 | if ((TYPE_PRECISION (inner_type) | |
1011 | == GET_MODE_PRECISION (TYPE_MODE (inner_type))) | |
1012 | && TYPE_PRECISION (inner_type) < prec) | |
1013 | { | |
1014 | prec = TYPE_PRECISION (inner_type); | |
1015 | /* See if we can shorten the right shift. */ | |
1016 | if (shiftc < prec) | |
1017 | shift_type = inner_type; | |
1018 | /* Otherwise X >> C1 is all zeros, so we'll optimize | |
1019 | it into (X, 0) later on by making sure zerobits | |
1020 | is all ones. */ | |
1021 | } | |
1022 | } | |
1023 | zerobits = ~(unsigned HOST_WIDE_INT) 0; | |
1024 | if (shiftc < prec) | |
1025 | { | |
1026 | zerobits >>= HOST_BITS_PER_WIDE_INT - shiftc; | |
1027 | zerobits <<= prec - shiftc; | |
1028 | } | |
1029 | /* For arithmetic shift if sign bit could be set, zerobits | |
1030 | can contain actually sign bits, so no transformation is | |
1031 | possible, unless MASK masks them all away. In that | |
1032 | case the shift needs to be converted into logical shift. */ | |
1033 | if (!TYPE_UNSIGNED (TREE_TYPE (@3)) | |
1034 | && prec == TYPE_PRECISION (TREE_TYPE (@3))) | |
1035 | { | |
1036 | if ((mask & zerobits) == 0) | |
1037 | shift_type = unsigned_type_for (TREE_TYPE (@3)); | |
1038 | else | |
1039 | zerobits = 0; | |
1040 | } | |
1041 | } | |
1042 | } | |
1043 | /* ((X << 16) & 0xff00) is (X, 0). */ | |
1044 | (if ((mask & zerobits) == mask) | |
8fdc6c67 RB |
1045 | { build_int_cst (type, 0); } |
1046 | (with { newmask = mask | zerobits; } | |
1047 | (if (newmask != mask && (newmask & (newmask + 1)) == 0) | |
1048 | (with | |
1049 | { | |
1050 | /* Only do the transformation if NEWMASK is some integer | |
1051 | mode's mask. */ | |
1052 | for (prec = BITS_PER_UNIT; | |
1053 | prec < HOST_BITS_PER_WIDE_INT; prec <<= 1) | |
1054 | if (newmask == (((unsigned HOST_WIDE_INT) 1) << prec) - 1) | |
1055 | break; | |
1056 | } | |
1057 | (if (prec < HOST_BITS_PER_WIDE_INT | |
1058 | || newmask == ~(unsigned HOST_WIDE_INT) 0) | |
1059 | (with | |
1060 | { tree newmaskt = build_int_cst_type (TREE_TYPE (@2), newmask); } | |
1061 | (if (!tree_int_cst_equal (newmaskt, @2)) | |
1062 | (if (shift_type != TREE_TYPE (@3)) | |
1063 | (bit_and (convert (shift:shift_type (convert @3) @1)) { newmaskt; }) | |
1064 | (bit_and @4 { newmaskt; }))))))))))))) | |
1ffbaa3f | 1065 | |
98e30e51 RB |
1066 | /* Fold (X & C2) << C1 into (X << C1) & (C2 << C1) |
1067 | (X & C2) >> C1 into (X >> C1) & (C2 >> C1). */ | |
1068 | (for shift (lshift rshift) | |
1069 | (simplify | |
2d799646 | 1070 | (shift (convert?:s (bit_and:s @0 INTEGER_CST@2)) INTEGER_CST@1) |
98e30e51 RB |
1071 | (if (tree_nop_conversion_p (type, TREE_TYPE (@0))) |
1072 | (with { tree mask = int_const_binop (shift, fold_convert (type, @2), @1); } | |
1073 | (bit_and (shift (convert @0) @1) { mask; }))))) | |
1074 | ||
1075 | ||
d4573ffe RB |
1076 | /* Simplifications of conversions. */ |
1077 | ||
1078 | /* Basic strip-useless-type-conversions / strip_nops. */ | |
f3582e54 | 1079 | (for cvt (convert view_convert float fix_trunc) |
d4573ffe RB |
1080 | (simplify |
1081 | (cvt @0) | |
1082 | (if ((GIMPLE && useless_type_conversion_p (type, TREE_TYPE (@0))) | |
1083 | || (GENERIC && type == TREE_TYPE (@0))) | |
1084 | @0))) | |
1085 | ||
1086 | /* Contract view-conversions. */ | |
1087 | (simplify | |
1088 | (view_convert (view_convert @0)) | |
1089 | (view_convert @0)) | |
1090 | ||
1091 | /* For integral conversions with the same precision or pointer | |
1092 | conversions use a NOP_EXPR instead. */ | |
1093 | (simplify | |
1094 | (view_convert @0) | |
1095 | (if ((INTEGRAL_TYPE_P (type) || POINTER_TYPE_P (type)) | |
1096 | && (INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0))) | |
1097 | && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (@0))) | |
1098 | (convert @0))) | |
1099 | ||
1100 | /* Strip inner integral conversions that do not change precision or size. */ | |
1101 | (simplify | |
1102 | (view_convert (convert@0 @1)) | |
1103 | (if ((INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0))) | |
1104 | && (INTEGRAL_TYPE_P (TREE_TYPE (@1)) || POINTER_TYPE_P (TREE_TYPE (@1))) | |
1105 | && (TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1))) | |
1106 | && (TYPE_SIZE (TREE_TYPE (@0)) == TYPE_SIZE (TREE_TYPE (@1)))) | |
1107 | (view_convert @1))) | |
1108 | ||
1109 | /* Re-association barriers around constants and other re-association | |
1110 | barriers can be removed. */ | |
1111 | (simplify | |
1112 | (paren CONSTANT_CLASS_P@0) | |
1113 | @0) | |
1114 | (simplify | |
1115 | (paren (paren@1 @0)) | |
1116 | @1) | |
1e51d0a2 RB |
1117 | |
1118 | /* Handle cases of two conversions in a row. */ | |
1119 | (for ocvt (convert float fix_trunc) | |
1120 | (for icvt (convert float) | |
1121 | (simplify | |
1122 | (ocvt (icvt@1 @0)) | |
1123 | (with | |
1124 | { | |
1125 | tree inside_type = TREE_TYPE (@0); | |
1126 | tree inter_type = TREE_TYPE (@1); | |
1127 | int inside_int = INTEGRAL_TYPE_P (inside_type); | |
1128 | int inside_ptr = POINTER_TYPE_P (inside_type); | |
1129 | int inside_float = FLOAT_TYPE_P (inside_type); | |
09240451 | 1130 | int inside_vec = VECTOR_TYPE_P (inside_type); |
1e51d0a2 RB |
1131 | unsigned int inside_prec = TYPE_PRECISION (inside_type); |
1132 | int inside_unsignedp = TYPE_UNSIGNED (inside_type); | |
1133 | int inter_int = INTEGRAL_TYPE_P (inter_type); | |
1134 | int inter_ptr = POINTER_TYPE_P (inter_type); | |
1135 | int inter_float = FLOAT_TYPE_P (inter_type); | |
09240451 | 1136 | int inter_vec = VECTOR_TYPE_P (inter_type); |
1e51d0a2 RB |
1137 | unsigned int inter_prec = TYPE_PRECISION (inter_type); |
1138 | int inter_unsignedp = TYPE_UNSIGNED (inter_type); | |
1139 | int final_int = INTEGRAL_TYPE_P (type); | |
1140 | int final_ptr = POINTER_TYPE_P (type); | |
1141 | int final_float = FLOAT_TYPE_P (type); | |
09240451 | 1142 | int final_vec = VECTOR_TYPE_P (type); |
1e51d0a2 RB |
1143 | unsigned int final_prec = TYPE_PRECISION (type); |
1144 | int final_unsignedp = TYPE_UNSIGNED (type); | |
1145 | } | |
64d3a1f0 RB |
1146 | (switch |
1147 | /* In addition to the cases of two conversions in a row | |
1148 | handled below, if we are converting something to its own | |
1149 | type via an object of identical or wider precision, neither | |
1150 | conversion is needed. */ | |
1151 | (if (((GIMPLE && useless_type_conversion_p (type, inside_type)) | |
1152 | || (GENERIC | |
1153 | && TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (inside_type))) | |
1154 | && (((inter_int || inter_ptr) && final_int) | |
1155 | || (inter_float && final_float)) | |
1156 | && inter_prec >= final_prec) | |
1157 | (ocvt @0)) | |
1158 | ||
1159 | /* Likewise, if the intermediate and initial types are either both | |
1160 | float or both integer, we don't need the middle conversion if the | |
1161 | former is wider than the latter and doesn't change the signedness | |
1162 | (for integers). Avoid this if the final type is a pointer since | |
1163 | then we sometimes need the middle conversion. Likewise if the | |
1164 | final type has a precision not equal to the size of its mode. */ | |
1165 | (if (((inter_int && inside_int) || (inter_float && inside_float)) | |
1166 | && (final_int || final_float) | |
1167 | && inter_prec >= inside_prec | |
1168 | && (inter_float || inter_unsignedp == inside_unsignedp) | |
1169 | && ! (final_prec != GET_MODE_PRECISION (TYPE_MODE (type)) | |
1170 | && TYPE_MODE (type) == TYPE_MODE (inter_type))) | |
1171 | (ocvt @0)) | |
1172 | ||
1173 | /* If we have a sign-extension of a zero-extended value, we can | |
1174 | replace that by a single zero-extension. Likewise if the | |
1175 | final conversion does not change precision we can drop the | |
1176 | intermediate conversion. */ | |
1177 | (if (inside_int && inter_int && final_int | |
1178 | && ((inside_prec < inter_prec && inter_prec < final_prec | |
1179 | && inside_unsignedp && !inter_unsignedp) | |
1180 | || final_prec == inter_prec)) | |
1181 | (ocvt @0)) | |
1182 | ||
1183 | /* Two conversions in a row are not needed unless: | |
1e51d0a2 RB |
1184 | - some conversion is floating-point (overstrict for now), or |
1185 | - some conversion is a vector (overstrict for now), or | |
1186 | - the intermediate type is narrower than both initial and | |
1187 | final, or | |
1188 | - the intermediate type and innermost type differ in signedness, | |
1189 | and the outermost type is wider than the intermediate, or | |
1190 | - the initial type is a pointer type and the precisions of the | |
1191 | intermediate and final types differ, or | |
1192 | - the final type is a pointer type and the precisions of the | |
1193 | initial and intermediate types differ. */ | |
64d3a1f0 RB |
1194 | (if (! inside_float && ! inter_float && ! final_float |
1195 | && ! inside_vec && ! inter_vec && ! final_vec | |
1196 | && (inter_prec >= inside_prec || inter_prec >= final_prec) | |
1197 | && ! (inside_int && inter_int | |
1198 | && inter_unsignedp != inside_unsignedp | |
1199 | && inter_prec < final_prec) | |
1200 | && ((inter_unsignedp && inter_prec > inside_prec) | |
1201 | == (final_unsignedp && final_prec > inter_prec)) | |
1202 | && ! (inside_ptr && inter_prec != final_prec) | |
1203 | && ! (final_ptr && inside_prec != inter_prec) | |
1204 | && ! (final_prec != GET_MODE_PRECISION (TYPE_MODE (type)) | |
1205 | && TYPE_MODE (type) == TYPE_MODE (inter_type))) | |
1206 | (ocvt @0)) | |
1207 | ||
1208 | /* A truncation to an unsigned type (a zero-extension) should be | |
1209 | canonicalized as bitwise and of a mask. */ | |
1210 | (if (final_int && inter_int && inside_int | |
1211 | && final_prec == inside_prec | |
1212 | && final_prec > inter_prec | |
1213 | && inter_unsignedp) | |
1214 | (convert (bit_and @0 { wide_int_to_tree | |
1215 | (inside_type, | |
1216 | wi::mask (inter_prec, false, | |
1217 | TYPE_PRECISION (inside_type))); }))) | |
1218 | ||
1219 | /* If we are converting an integer to a floating-point that can | |
1220 | represent it exactly and back to an integer, we can skip the | |
1221 | floating-point conversion. */ | |
1222 | (if (GIMPLE /* PR66211 */ | |
1223 | && inside_int && inter_float && final_int && | |
1224 | (unsigned) significand_size (TYPE_MODE (inter_type)) | |
1225 | >= inside_prec - !inside_unsignedp) | |
1226 | (convert @0))))))) | |
ea2042ba RB |
1227 | |
1228 | /* If we have a narrowing conversion to an integral type that is fed by a | |
1229 | BIT_AND_EXPR, we might be able to remove the BIT_AND_EXPR if it merely | |
1230 | masks off bits outside the final type (and nothing else). */ | |
1231 | (simplify | |
1232 | (convert (bit_and @0 INTEGER_CST@1)) | |
1233 | (if (INTEGRAL_TYPE_P (type) | |
1234 | && INTEGRAL_TYPE_P (TREE_TYPE (@0)) | |
1235 | && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0)) | |
1236 | && operand_equal_p (@1, build_low_bits_mask (TREE_TYPE (@1), | |
1237 | TYPE_PRECISION (type)), 0)) | |
1238 | (convert @0))) | |
a25454ea RB |
1239 | |
1240 | ||
1241 | /* (X /[ex] A) * A -> X. */ | |
1242 | (simplify | |
1243 | (mult (convert? (exact_div @0 @1)) @1) | |
1244 | /* Look through a sign-changing conversion. */ | |
257b01ba | 1245 | (convert @0)) |
eaeba53a | 1246 | |
a7f24614 RB |
1247 | /* Canonicalization of binary operations. */ |
1248 | ||
1249 | /* Convert X + -C into X - C. */ | |
1250 | (simplify | |
1251 | (plus @0 REAL_CST@1) | |
1252 | (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1))) | |
1253 | (with { tree tem = fold_unary (NEGATE_EXPR, type, @1); } | |
1254 | (if (!TREE_OVERFLOW (tem) || !flag_trapping_math) | |
1255 | (minus @0 { tem; }))))) | |
1256 | ||
1257 | /* Convert x+x into x*2.0. */ | |
1258 | (simplify | |
1259 | (plus @0 @0) | |
1260 | (if (SCALAR_FLOAT_TYPE_P (type)) | |
1261 | (mult @0 { build_real (type, dconst2); }))) | |
1262 | ||
1263 | (simplify | |
1264 | (minus integer_zerop @1) | |
1265 | (negate @1)) | |
1266 | ||
1267 | /* (ARG0 - ARG1) is the same as (-ARG1 + ARG0). So check whether | |
1268 | ARG0 is zero and X + ARG0 reduces to X, since that would mean | |
1269 | (-ARG1 + ARG0) reduces to -ARG1. */ | |
1270 | (simplify | |
1271 | (minus real_zerop@0 @1) | |
1272 | (if (fold_real_zero_addition_p (type, @0, 0)) | |
1273 | (negate @1))) | |
1274 | ||
1275 | /* Transform x * -1 into -x. */ | |
1276 | (simplify | |
1277 | (mult @0 integer_minus_onep) | |
1278 | (negate @0)) | |
eaeba53a RB |
1279 | |
1280 | /* COMPLEX_EXPR and REALPART/IMAGPART_EXPR cancellations. */ | |
1281 | (simplify | |
1282 | (complex (realpart @0) (imagpart @0)) | |
1283 | @0) | |
1284 | (simplify | |
1285 | (realpart (complex @0 @1)) | |
1286 | @0) | |
1287 | (simplify | |
1288 | (imagpart (complex @0 @1)) | |
1289 | @1) | |
83633539 RB |
1290 | |
1291 | ||
1292 | /* BSWAP simplifications, transforms checked by gcc.dg/builtin-bswap-8.c. */ | |
1293 | (for bswap (BUILT_IN_BSWAP16 BUILT_IN_BSWAP32 BUILT_IN_BSWAP64) | |
1294 | (simplify | |
1295 | (bswap (bswap @0)) | |
1296 | @0) | |
1297 | (simplify | |
1298 | (bswap (bit_not (bswap @0))) | |
1299 | (bit_not @0)) | |
1300 | (for bitop (bit_xor bit_ior bit_and) | |
1301 | (simplify | |
1302 | (bswap (bitop:c (bswap @0) @1)) | |
1303 | (bitop @0 (bswap @1))))) | |
96994de0 RB |
1304 | |
1305 | ||
1306 | /* Combine COND_EXPRs and VEC_COND_EXPRs. */ | |
1307 | ||
1308 | /* Simplify constant conditions. | |
1309 | Only optimize constant conditions when the selected branch | |
1310 | has the same type as the COND_EXPR. This avoids optimizing | |
1311 | away "c ? x : throw", where the throw has a void type. | |
1312 | Note that we cannot throw away the fold-const.c variant nor | |
1313 | this one as we depend on doing this transform before possibly | |
1314 | A ? B : B -> B triggers and the fold-const.c one can optimize | |
1315 | 0 ? A : B to B even if A has side-effects. Something | |
1316 | genmatch cannot handle. */ | |
1317 | (simplify | |
1318 | (cond INTEGER_CST@0 @1 @2) | |
8fdc6c67 RB |
1319 | (if (integer_zerop (@0)) |
1320 | (if (!VOID_TYPE_P (TREE_TYPE (@2)) || VOID_TYPE_P (type)) | |
1321 | @2) | |
1322 | (if (!VOID_TYPE_P (TREE_TYPE (@1)) || VOID_TYPE_P (type)) | |
1323 | @1))) | |
96994de0 RB |
1324 | (simplify |
1325 | (vec_cond VECTOR_CST@0 @1 @2) | |
1326 | (if (integer_all_onesp (@0)) | |
8fdc6c67 RB |
1327 | @1 |
1328 | (if (integer_zerop (@0)) | |
1329 | @2))) | |
96994de0 RB |
1330 | |
1331 | (for cnd (cond vec_cond) | |
1332 | /* A ? B : (A ? X : C) -> A ? B : C. */ | |
1333 | (simplify | |
1334 | (cnd @0 (cnd @0 @1 @2) @3) | |
1335 | (cnd @0 @1 @3)) | |
1336 | (simplify | |
1337 | (cnd @0 @1 (cnd @0 @2 @3)) | |
1338 | (cnd @0 @1 @3)) | |
1339 | ||
1340 | /* A ? B : B -> B. */ | |
1341 | (simplify | |
1342 | (cnd @0 @1 @1) | |
09240451 | 1343 | @1) |
96994de0 | 1344 | |
09240451 MG |
1345 | /* !A ? B : C -> A ? C : B. */ |
1346 | (simplify | |
1347 | (cnd (logical_inverted_value truth_valued_p@0) @1 @2) | |
1348 | (cnd @0 @2 @1))) | |
f84e7fd6 | 1349 | |
f43d102e RS |
1350 | /* A + (B vcmp C ? 1 : 0) -> A - (B vcmp C), since vector comparisons |
1351 | return all-1 or all-0 results. */ | |
1352 | /* ??? We could instead convert all instances of the vec_cond to negate, | |
1353 | but that isn't necessarily a win on its own. */ | |
1354 | (simplify | |
1355 | (plus:c @3 (view_convert? (vec_cond @0 integer_each_onep@1 integer_zerop@2))) | |
1356 | (if (VECTOR_TYPE_P (type) | |
1357 | && TYPE_VECTOR_SUBPARTS (type) == TYPE_VECTOR_SUBPARTS (TREE_TYPE (@0)) | |
1358 | && (TYPE_MODE (TREE_TYPE (type)) | |
1359 | == TYPE_MODE (TREE_TYPE (TREE_TYPE (@0))))) | |
1360 | (minus @3 (view_convert @0)))) | |
1361 | ||
1362 | /* ... likewise A - (B vcmp C ? 1 : 0) -> A + (B vcmp C). */ | |
1363 | (simplify | |
1364 | (minus @3 (view_convert? (vec_cond @0 integer_each_onep@1 integer_zerop@2))) | |
1365 | (if (VECTOR_TYPE_P (type) | |
1366 | && TYPE_VECTOR_SUBPARTS (type) == TYPE_VECTOR_SUBPARTS (TREE_TYPE (@0)) | |
1367 | && (TYPE_MODE (TREE_TYPE (type)) | |
1368 | == TYPE_MODE (TREE_TYPE (TREE_TYPE (@0))))) | |
1369 | (plus @3 (view_convert @0)))) | |
f84e7fd6 | 1370 | |
2ee05f1e | 1371 | |
f84e7fd6 RB |
1372 | /* Simplifications of comparisons. */ |
1373 | ||
1374 | /* We can simplify a logical negation of a comparison to the | |
1375 | inverted comparison. As we cannot compute an expression | |
1376 | operator using invert_tree_comparison we have to simulate | |
1377 | that with expression code iteration. */ | |
1378 | (for cmp (tcc_comparison) | |
1379 | icmp (inverted_tcc_comparison) | |
1380 | ncmp (inverted_tcc_comparison_with_nans) | |
1381 | /* Ideally we'd like to combine the following two patterns | |
1382 | and handle some more cases by using | |
1383 | (logical_inverted_value (cmp @0 @1)) | |
1384 | here but for that genmatch would need to "inline" that. | |
1385 | For now implement what forward_propagate_comparison did. */ | |
1386 | (simplify | |
1387 | (bit_not (cmp @0 @1)) | |
1388 | (if (VECTOR_TYPE_P (type) | |
1389 | || (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) == 1)) | |
1390 | /* Comparison inversion may be impossible for trapping math, | |
1391 | invert_tree_comparison will tell us. But we can't use | |
1392 | a computed operator in the replacement tree thus we have | |
1393 | to play the trick below. */ | |
1394 | (with { enum tree_code ic = invert_tree_comparison | |
1b457aa4 | 1395 | (cmp, HONOR_NANS (@0)); } |
f84e7fd6 | 1396 | (if (ic == icmp) |
8fdc6c67 RB |
1397 | (icmp @0 @1) |
1398 | (if (ic == ncmp) | |
1399 | (ncmp @0 @1)))))) | |
f84e7fd6 | 1400 | (simplify |
09240451 MG |
1401 | (bit_xor (cmp @0 @1) integer_truep) |
1402 | (with { enum tree_code ic = invert_tree_comparison | |
1b457aa4 | 1403 | (cmp, HONOR_NANS (@0)); } |
09240451 | 1404 | (if (ic == icmp) |
8fdc6c67 RB |
1405 | (icmp @0 @1) |
1406 | (if (ic == ncmp) | |
1407 | (ncmp @0 @1)))))) | |
e18c1d66 | 1408 | |
2ee05f1e RB |
1409 | /* Transform comparisons of the form X - Y CMP 0 to X CMP Y. |
1410 | ??? The transformation is valid for the other operators if overflow | |
1411 | is undefined for the type, but performing it here badly interacts | |
1412 | with the transformation in fold_cond_expr_with_comparison which | |
1413 | attempts to synthetize ABS_EXPR. */ | |
1414 | (for cmp (eq ne) | |
1415 | (simplify | |
d9ba1961 RB |
1416 | (cmp (minus@2 @0 @1) integer_zerop) |
1417 | (if (single_use (@2)) | |
1418 | (cmp @0 @1)))) | |
2ee05f1e RB |
1419 | |
1420 | /* Transform comparisons of the form X * C1 CMP 0 to X CMP 0 in the | |
1421 | signed arithmetic case. That form is created by the compiler | |
1422 | often enough for folding it to be of value. One example is in | |
1423 | computing loop trip counts after Operator Strength Reduction. */ | |
07cdc2b8 RB |
1424 | (for cmp (simple_comparison) |
1425 | scmp (swapped_simple_comparison) | |
2ee05f1e RB |
1426 | (simplify |
1427 | (cmp (mult @0 INTEGER_CST@1) integer_zerop@2) | |
1428 | /* Handle unfolded multiplication by zero. */ | |
1429 | (if (integer_zerop (@1)) | |
8fdc6c67 RB |
1430 | (cmp @1 @2) |
1431 | (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0)) | |
1432 | && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))) | |
1433 | /* If @1 is negative we swap the sense of the comparison. */ | |
1434 | (if (tree_int_cst_sgn (@1) < 0) | |
1435 | (scmp @0 @2) | |
1436 | (cmp @0 @2)))))) | |
2ee05f1e RB |
1437 | |
1438 | /* Simplify comparison of something with itself. For IEEE | |
1439 | floating-point, we can only do some of these simplifications. */ | |
1440 | (simplify | |
1441 | (eq @0 @0) | |
1442 | (if (! FLOAT_TYPE_P (TREE_TYPE (@0)) | |
1443 | || ! HONOR_NANS (TYPE_MODE (TREE_TYPE (@0)))) | |
1444 | { constant_boolean_node (true, type); })) | |
1445 | (for cmp (ge le) | |
1446 | (simplify | |
1447 | (cmp @0 @0) | |
1448 | (eq @0 @0))) | |
1449 | (for cmp (ne gt lt) | |
1450 | (simplify | |
1451 | (cmp @0 @0) | |
1452 | (if (cmp != NE_EXPR | |
1453 | || ! FLOAT_TYPE_P (TREE_TYPE (@0)) | |
1454 | || ! HONOR_NANS (TYPE_MODE (TREE_TYPE (@0)))) | |
1455 | { constant_boolean_node (false, type); }))) | |
1456 | ||
1457 | /* Fold ~X op ~Y as Y op X. */ | |
07cdc2b8 | 1458 | (for cmp (simple_comparison) |
2ee05f1e RB |
1459 | (simplify |
1460 | (cmp (bit_not @0) (bit_not @1)) | |
1461 | (cmp @1 @0))) | |
1462 | ||
1463 | /* Fold ~X op C as X op' ~C, where op' is the swapped comparison. */ | |
07cdc2b8 RB |
1464 | (for cmp (simple_comparison) |
1465 | scmp (swapped_simple_comparison) | |
2ee05f1e RB |
1466 | (simplify |
1467 | (cmp (bit_not @0) CONSTANT_CLASS_P@1) | |
1468 | (if (TREE_CODE (@1) == INTEGER_CST || TREE_CODE (@1) == VECTOR_CST) | |
1469 | (scmp @0 (bit_not @1))))) | |
1470 | ||
07cdc2b8 RB |
1471 | (for cmp (simple_comparison) |
1472 | /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */ | |
1473 | (simplify | |
1474 | (cmp (convert@2 @0) (convert? @1)) | |
1475 | (if (FLOAT_TYPE_P (TREE_TYPE (@0)) | |
1476 | && (DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@2)) | |
1477 | == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0))) | |
1478 | && (DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@2)) | |
1479 | == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@1)))) | |
1480 | (with | |
1481 | { | |
1482 | tree type1 = TREE_TYPE (@1); | |
1483 | if (TREE_CODE (@1) == REAL_CST && !DECIMAL_FLOAT_TYPE_P (type1)) | |
1484 | { | |
1485 | REAL_VALUE_TYPE orig = TREE_REAL_CST (@1); | |
1486 | if (TYPE_PRECISION (type1) > TYPE_PRECISION (float_type_node) | |
1487 | && exact_real_truncate (TYPE_MODE (float_type_node), &orig)) | |
1488 | type1 = float_type_node; | |
1489 | if (TYPE_PRECISION (type1) > TYPE_PRECISION (double_type_node) | |
1490 | && exact_real_truncate (TYPE_MODE (double_type_node), &orig)) | |
1491 | type1 = double_type_node; | |
1492 | } | |
1493 | tree newtype | |
1494 | = (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (type1) | |
1495 | ? TREE_TYPE (@0) : type1); | |
1496 | } | |
1497 | (if (TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (newtype)) | |
1498 | (cmp (convert:newtype @0) (convert:newtype @1)))))) | |
1499 | ||
1500 | (simplify | |
1501 | (cmp @0 REAL_CST@1) | |
1502 | /* IEEE doesn't distinguish +0 and -0 in comparisons. */ | |
64d3a1f0 RB |
1503 | (switch |
1504 | /* a CMP (-0) -> a CMP 0 */ | |
1505 | (if (REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@1))) | |
1506 | (cmp @0 { build_real (TREE_TYPE (@1), dconst0); })) | |
1507 | /* x != NaN is always true, other ops are always false. */ | |
1508 | (if (REAL_VALUE_ISNAN (TREE_REAL_CST (@1)) | |
1509 | && ! HONOR_SNANS (@1)) | |
1510 | { constant_boolean_node (cmp == NE_EXPR, type); }) | |
1511 | /* Fold comparisons against infinity. */ | |
1512 | (if (REAL_VALUE_ISINF (TREE_REAL_CST (@1)) | |
1513 | && MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (@1)))) | |
1514 | (with | |
1515 | { | |
1516 | REAL_VALUE_TYPE max; | |
1517 | enum tree_code code = cmp; | |
1518 | bool neg = REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)); | |
1519 | if (neg) | |
1520 | code = swap_tree_comparison (code); | |
1521 | } | |
1522 | (switch | |
1523 | /* x > +Inf is always false, if with ignore sNANs. */ | |
1524 | (if (code == GT_EXPR | |
1525 | && ! HONOR_SNANS (@0)) | |
1526 | { constant_boolean_node (false, type); }) | |
1527 | (if (code == LE_EXPR) | |
1528 | /* x <= +Inf is always true, if we don't case about NaNs. */ | |
1529 | (if (! HONOR_NANS (@0)) | |
1530 | { constant_boolean_node (true, type); } | |
1531 | /* x <= +Inf is the same as x == x, i.e. isfinite(x). */ | |
1532 | (eq @0 @0))) | |
1533 | /* x == +Inf and x >= +Inf are always equal to x > DBL_MAX. */ | |
1534 | (if (code == EQ_EXPR || code == GE_EXPR) | |
1535 | (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); } | |
1536 | (if (neg) | |
1537 | (lt @0 { build_real (TREE_TYPE (@0), max); }) | |
1538 | (gt @0 { build_real (TREE_TYPE (@0), max); })))) | |
1539 | /* x < +Inf is always equal to x <= DBL_MAX. */ | |
1540 | (if (code == LT_EXPR) | |
1541 | (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); } | |
1542 | (if (neg) | |
1543 | (ge @0 { build_real (TREE_TYPE (@0), max); }) | |
1544 | (le @0 { build_real (TREE_TYPE (@0), max); })))) | |
1545 | /* x != +Inf is always equal to !(x > DBL_MAX). */ | |
1546 | (if (code == NE_EXPR) | |
1547 | (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); } | |
1548 | (if (! HONOR_NANS (@0)) | |
1549 | (if (neg) | |
1550 | (ge @0 { build_real (TREE_TYPE (@0), max); }) | |
1551 | (le @0 { build_real (TREE_TYPE (@0), max); })) | |
1552 | (if (neg) | |
1553 | (bit_xor (lt @0 { build_real (TREE_TYPE (@0), max); }) | |
1554 | { build_one_cst (type); }) | |
1555 | (bit_xor (gt @0 { build_real (TREE_TYPE (@0), max); }) | |
1556 | { build_one_cst (type); })))))))))) | |
07cdc2b8 RB |
1557 | |
1558 | /* If this is a comparison of a real constant with a PLUS_EXPR | |
1559 | or a MINUS_EXPR of a real constant, we can convert it into a | |
1560 | comparison with a revised real constant as long as no overflow | |
1561 | occurs when unsafe_math_optimizations are enabled. */ | |
1562 | (if (flag_unsafe_math_optimizations) | |
1563 | (for op (plus minus) | |
1564 | (simplify | |
1565 | (cmp (op @0 REAL_CST@1) REAL_CST@2) | |
1566 | (with | |
1567 | { | |
1568 | tree tem = const_binop (op == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR, | |
1569 | TREE_TYPE (@1), @2, @1); | |
1570 | } | |
1571 | (if (!TREE_OVERFLOW (tem)) | |
1572 | (cmp @0 { tem; })))))) | |
1573 | ||
1574 | /* Likewise, we can simplify a comparison of a real constant with | |
1575 | a MINUS_EXPR whose first operand is also a real constant, i.e. | |
1576 | (c1 - x) < c2 becomes x > c1-c2. Reordering is allowed on | |
1577 | floating-point types only if -fassociative-math is set. */ | |
1578 | (if (flag_associative_math) | |
1579 | (simplify | |
0409237b | 1580 | (cmp (minus REAL_CST@0 @1) REAL_CST@2) |
07cdc2b8 RB |
1581 | (with { tree tem = const_binop (MINUS_EXPR, TREE_TYPE (@1), @0, @2); } |
1582 | (if (!TREE_OVERFLOW (tem)) | |
1583 | (cmp { tem; } @1))))) | |
1584 | ||
1585 | /* Fold comparisons against built-in math functions. */ | |
1586 | (if (flag_unsafe_math_optimizations | |
1587 | && ! flag_errno_math) | |
1588 | (for sq (SQRT) | |
1589 | (simplify | |
1590 | (cmp (sq @0) REAL_CST@1) | |
64d3a1f0 RB |
1591 | (switch |
1592 | (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1))) | |
1593 | (switch | |
1594 | /* sqrt(x) < y is always false, if y is negative. */ | |
1595 | (if (cmp == EQ_EXPR || cmp == LT_EXPR || cmp == LE_EXPR) | |
8fdc6c67 | 1596 | { constant_boolean_node (false, type); }) |
64d3a1f0 RB |
1597 | /* sqrt(x) > y is always true, if y is negative and we |
1598 | don't care about NaNs, i.e. negative values of x. */ | |
1599 | (if (cmp == NE_EXPR || !HONOR_NANS (@0)) | |
1600 | { constant_boolean_node (true, type); }) | |
1601 | /* sqrt(x) > y is the same as x >= 0, if y is negative. */ | |
1602 | (ge @0 { build_real (TREE_TYPE (@0), dconst0); }))) | |
1603 | (if (cmp == GT_EXPR || cmp == GE_EXPR) | |
1604 | (with | |
1605 | { | |
1606 | REAL_VALUE_TYPE c2; | |
1607 | REAL_ARITHMETIC (c2, MULT_EXPR, | |
1608 | TREE_REAL_CST (@1), TREE_REAL_CST (@1)); | |
1609 | real_convert (&c2, TYPE_MODE (TREE_TYPE (@0)), &c2); | |
1610 | } | |
1611 | (if (REAL_VALUE_ISINF (c2)) | |
1612 | /* sqrt(x) > y is x == +Inf, when y is very large. */ | |
1613 | (if (HONOR_INFINITIES (@0)) | |
1614 | (eq @0 { build_real (TREE_TYPE (@0), c2); }) | |
1615 | { constant_boolean_node (false, type); }) | |
1616 | /* sqrt(x) > c is the same as x > c*c. */ | |
1617 | (cmp @0 { build_real (TREE_TYPE (@0), c2); })))) | |
1618 | (if (cmp == LT_EXPR || cmp == LE_EXPR) | |
1619 | (with | |
1620 | { | |
1621 | REAL_VALUE_TYPE c2; | |
1622 | REAL_ARITHMETIC (c2, MULT_EXPR, | |
1623 | TREE_REAL_CST (@1), TREE_REAL_CST (@1)); | |
1624 | real_convert (&c2, TYPE_MODE (TREE_TYPE (@0)), &c2); | |
1625 | } | |
1626 | (if (REAL_VALUE_ISINF (c2)) | |
1627 | (switch | |
1628 | /* sqrt(x) < y is always true, when y is a very large | |
1629 | value and we don't care about NaNs or Infinities. */ | |
1630 | (if (! HONOR_NANS (@0) && ! HONOR_INFINITIES (@0)) | |
1631 | { constant_boolean_node (true, type); }) | |
1632 | /* sqrt(x) < y is x != +Inf when y is very large and we | |
1633 | don't care about NaNs. */ | |
1634 | (if (! HONOR_NANS (@0)) | |
1635 | (ne @0 { build_real (TREE_TYPE (@0), c2); })) | |
1636 | /* sqrt(x) < y is x >= 0 when y is very large and we | |
1637 | don't care about Infinities. */ | |
1638 | (if (! HONOR_INFINITIES (@0)) | |
1639 | (ge @0 { build_real (TREE_TYPE (@0), dconst0); })) | |
1640 | /* sqrt(x) < y is x >= 0 && x != +Inf, when y is large. */ | |
1641 | (if (GENERIC) | |
1642 | (truth_andif | |
1643 | (ge @0 { build_real (TREE_TYPE (@0), dconst0); }) | |
1644 | (ne @0 { build_real (TREE_TYPE (@0), c2); })))) | |
1645 | /* sqrt(x) < c is the same as x < c*c, if we ignore NaNs. */ | |
1646 | (if (! HONOR_NANS (@0)) | |
1647 | (cmp @0 { build_real (TREE_TYPE (@0), c2); }) | |
1648 | /* sqrt(x) < c is the same as x >= 0 && x < c*c. */ | |
1649 | (if (GENERIC) | |
1650 | (truth_andif | |
1651 | (ge @0 { build_real (TREE_TYPE (@0), dconst0); }) | |
1652 | (cmp @0 { build_real (TREE_TYPE (@0), c2); })))))))))))) | |
2ee05f1e | 1653 | |
cfdc4f33 MG |
1654 | /* Unordered tests if either argument is a NaN. */ |
1655 | (simplify | |
1656 | (bit_ior (unordered @0 @0) (unordered @1 @1)) | |
aea417d7 | 1657 | (if (types_match (@0, @1)) |
cfdc4f33 | 1658 | (unordered @0 @1))) |
257b01ba MG |
1659 | (simplify |
1660 | (bit_and (ordered @0 @0) (ordered @1 @1)) | |
1661 | (if (types_match (@0, @1)) | |
1662 | (ordered @0 @1))) | |
cfdc4f33 MG |
1663 | (simplify |
1664 | (bit_ior:c (unordered @0 @0) (unordered:c@2 @0 @1)) | |
1665 | @2) | |
257b01ba MG |
1666 | (simplify |
1667 | (bit_and:c (ordered @0 @0) (ordered:c@2 @0 @1)) | |
1668 | @2) | |
e18c1d66 | 1669 | |
534bd33b MG |
1670 | /* -A CMP -B -> B CMP A. */ |
1671 | (for cmp (tcc_comparison) | |
1672 | scmp (swapped_tcc_comparison) | |
1673 | (simplify | |
1674 | (cmp (negate @0) (negate @1)) | |
1675 | (if (FLOAT_TYPE_P (TREE_TYPE (@0)) | |
1676 | || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0)) | |
1677 | && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))) | |
1678 | (scmp @0 @1))) | |
1679 | (simplify | |
1680 | (cmp (negate @0) CONSTANT_CLASS_P@1) | |
1681 | (if (FLOAT_TYPE_P (TREE_TYPE (@0)) | |
1682 | || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0)) | |
1683 | && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))) | |
1684 | (with { tree tem = fold_unary (NEGATE_EXPR, TREE_TYPE (@0), @1); } | |
1685 | (if (tem && !TREE_OVERFLOW (tem)) | |
1686 | (scmp @0 { tem; })))))) | |
1687 | ||
79d4f7c6 RB |
1688 | /* From fold_sign_changed_comparison and fold_widened_comparison. */ |
1689 | (for cmp (simple_comparison) | |
1690 | (simplify | |
1691 | (cmp (convert@0 @00) (convert?@1 @10)) | |
1692 | (if (TREE_CODE (TREE_TYPE (@0)) == INTEGER_TYPE | |
1693 | /* Disable this optimization if we're casting a function pointer | |
1694 | type on targets that require function pointer canonicalization. */ | |
1695 | && !(targetm.have_canonicalize_funcptr_for_compare () | |
1696 | && TREE_CODE (TREE_TYPE (@00)) == POINTER_TYPE | |
2fde61e3 RB |
1697 | && TREE_CODE (TREE_TYPE (TREE_TYPE (@00))) == FUNCTION_TYPE) |
1698 | && single_use (@0)) | |
79d4f7c6 RB |
1699 | (if (TYPE_PRECISION (TREE_TYPE (@00)) == TYPE_PRECISION (TREE_TYPE (@0)) |
1700 | && (TREE_CODE (@10) == INTEGER_CST | |
1701 | || (@1 != @10 && types_match (TREE_TYPE (@10), TREE_TYPE (@00)))) | |
1702 | && (TYPE_UNSIGNED (TREE_TYPE (@00)) == TYPE_UNSIGNED (TREE_TYPE (@0)) | |
1703 | || cmp == NE_EXPR | |
1704 | || cmp == EQ_EXPR) | |
1705 | && (POINTER_TYPE_P (TREE_TYPE (@00)) == POINTER_TYPE_P (TREE_TYPE (@0)))) | |
1706 | /* ??? The special-casing of INTEGER_CST conversion was in the original | |
1707 | code and here to avoid a spurious overflow flag on the resulting | |
1708 | constant which fold_convert produces. */ | |
1709 | (if (TREE_CODE (@1) == INTEGER_CST) | |
1710 | (cmp @00 { force_fit_type (TREE_TYPE (@00), wi::to_widest (@1), 0, | |
1711 | TREE_OVERFLOW (@1)); }) | |
1712 | (cmp @00 (convert @1))) | |
1713 | ||
1714 | (if (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (TREE_TYPE (@00))) | |
1715 | /* If possible, express the comparison in the shorter mode. */ | |
1716 | (if ((cmp == EQ_EXPR || cmp == NE_EXPR | |
1717 | || TYPE_UNSIGNED (TREE_TYPE (@0)) == TYPE_UNSIGNED (TREE_TYPE (@00))) | |
1718 | && (types_match (TREE_TYPE (@10), TREE_TYPE (@00)) | |
1719 | || ((TYPE_PRECISION (TREE_TYPE (@00)) | |
1720 | >= TYPE_PRECISION (TREE_TYPE (@10))) | |
1721 | && (TYPE_UNSIGNED (TREE_TYPE (@00)) | |
1722 | == TYPE_UNSIGNED (TREE_TYPE (@10)))) | |
1723 | || (TREE_CODE (@10) == INTEGER_CST | |
1724 | && (TREE_CODE (TREE_TYPE (@00)) == INTEGER_TYPE | |
1725 | || TREE_CODE (TREE_TYPE (@00)) == BOOLEAN_TYPE) | |
1726 | && int_fits_type_p (@10, TREE_TYPE (@00))))) | |
1727 | (cmp @00 (convert @10)) | |
1728 | (if (TREE_CODE (@10) == INTEGER_CST | |
1729 | && TREE_CODE (TREE_TYPE (@00)) == INTEGER_TYPE | |
1730 | && !int_fits_type_p (@10, TREE_TYPE (@00))) | |
1731 | (with | |
1732 | { | |
1733 | tree min = lower_bound_in_type (TREE_TYPE (@10), TREE_TYPE (@00)); | |
1734 | tree max = upper_bound_in_type (TREE_TYPE (@10), TREE_TYPE (@00)); | |
1735 | bool above = integer_nonzerop (const_binop (LT_EXPR, type, max, @10)); | |
1736 | bool below = integer_nonzerop (const_binop (LT_EXPR, type, @10, min)); | |
1737 | } | |
1738 | (if (above || below) | |
1739 | (if (cmp == EQ_EXPR || cmp == NE_EXPR) | |
1740 | { constant_boolean_node (cmp == EQ_EXPR ? false : true, type); } | |
1741 | (if (cmp == LT_EXPR || cmp == LE_EXPR) | |
1742 | { constant_boolean_node (above ? true : false, type); } | |
1743 | (if (cmp == GT_EXPR || cmp == GE_EXPR) | |
1744 | { constant_boolean_node (above ? false : true, type); })))))))))))) | |
66e1cacf | 1745 | |
96a111a3 RB |
1746 | (for cmp (eq ne) |
1747 | /* A local variable can never be pointed to by | |
1748 | the default SSA name of an incoming parameter. | |
1749 | SSA names are canonicalized to 2nd place. */ | |
1750 | (simplify | |
1751 | (cmp addr@0 SSA_NAME@1) | |
1752 | (if (SSA_NAME_IS_DEFAULT_DEF (@1) | |
1753 | && TREE_CODE (SSA_NAME_VAR (@1)) == PARM_DECL) | |
1754 | (with { tree base = get_base_address (TREE_OPERAND (@0, 0)); } | |
1755 | (if (TREE_CODE (base) == VAR_DECL | |
1756 | && auto_var_in_fn_p (base, current_function_decl)) | |
1757 | (if (cmp == NE_EXPR) | |
1758 | { constant_boolean_node (true, type); } | |
1759 | { constant_boolean_node (false, type); })))))) | |
1760 | ||
66e1cacf RB |
1761 | /* Equality compare simplifications from fold_binary */ |
1762 | (for cmp (eq ne) | |
1763 | ||
1764 | /* If we have (A | C) == D where C & ~D != 0, convert this into 0. | |
1765 | Similarly for NE_EXPR. */ | |
1766 | (simplify | |
1767 | (cmp (convert?@3 (bit_ior @0 INTEGER_CST@1)) INTEGER_CST@2) | |
1768 | (if (tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0)) | |
1769 | && wi::bit_and_not (@1, @2) != 0) | |
1770 | { constant_boolean_node (cmp == NE_EXPR, type); })) | |
1771 | ||
1772 | /* (X ^ Y) == 0 becomes X == Y, and (X ^ Y) != 0 becomes X != Y. */ | |
1773 | (simplify | |
1774 | (cmp (bit_xor @0 @1) integer_zerop) | |
1775 | (cmp @0 @1)) | |
1776 | ||
1777 | /* (X ^ Y) == Y becomes X == 0. | |
1778 | Likewise (X ^ Y) == X becomes Y == 0. */ | |
1779 | (simplify | |
99e943a2 | 1780 | (cmp:c (bit_xor:c @0 @1) @0) |
66e1cacf RB |
1781 | (cmp @1 { build_zero_cst (TREE_TYPE (@1)); })) |
1782 | ||
1783 | /* (X ^ C1) op C2 can be rewritten as X op (C1 ^ C2). */ | |
1784 | (simplify | |
1785 | (cmp (convert?@3 (bit_xor @0 INTEGER_CST@1)) INTEGER_CST@2) | |
1786 | (if (tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0))) | |
d057c866 RB |
1787 | (cmp @0 (bit_xor @1 (convert @2))))) |
1788 | ||
1789 | /* If this is an equality comparison of the address of two non-weak, | |
1790 | unaliased symbols neither of which are extern (since we do not | |
1791 | have access to attributes for externs), then we know the result. */ | |
1792 | (simplify | |
1793 | (cmp (convert? addr@0) (convert? addr@1)) | |
1794 | (if (decl_in_symtab_p (TREE_OPERAND (@0, 0)) | |
1795 | && decl_in_symtab_p (TREE_OPERAND (@1, 0))) | |
1796 | (with | |
1797 | { | |
1798 | int equal = symtab_node::get_create (TREE_OPERAND (@0, 0)) | |
1799 | ->equal_address_to (symtab_node::get_create (TREE_OPERAND (@1, 0))); | |
1800 | } | |
1801 | (if (equal != 2) | |
1802 | { constant_boolean_node (equal ? cmp == EQ_EXPR : cmp != EQ_EXPR, type); })))) | |
1803 | ||
1804 | (simplify | |
1805 | (cmp (convert? addr@0) integer_zerop) | |
1806 | (if (tree_single_nonzero_warnv_p (@0, NULL)) | |
1807 | { constant_boolean_node (cmp == NE_EXPR, type); }))) | |
1808 | ||
66e1cacf | 1809 | |
55cf3946 RB |
1810 | /* bool_var != 0 becomes bool_var. */ |
1811 | (simplify | |
1812 | (ne @0 integer_zerop@1) | |
1813 | (if (TREE_CODE (TREE_TYPE (@0)) == BOOLEAN_TYPE | |
1814 | && types_match (type, TREE_TYPE (@0))) | |
1815 | (non_lvalue @0))) | |
1816 | /* bool_var == 1 becomes bool_var. */ | |
1817 | (simplify | |
1818 | (eq @0 integer_onep@1) | |
1819 | (if (TREE_CODE (TREE_TYPE (@0)) == BOOLEAN_TYPE | |
1820 | && types_match (type, TREE_TYPE (@0))) | |
1821 | (non_lvalue @0))) | |
1822 | ||
1823 | ||
e18c1d66 RB |
1824 | /* Simplification of math builtins. */ |
1825 | ||
e18c1d66 RB |
1826 | /* fold_builtin_logarithm */ |
1827 | (if (flag_unsafe_math_optimizations) | |
1828 | /* Special case, optimize logN(expN(x)) = x. */ | |
1829 | (for logs (LOG LOG2 LOG10) | |
1830 | exps (EXP EXP2 EXP10) | |
1831 | (simplify | |
1832 | (logs (exps @0)) | |
1833 | @0)) | |
1834 | /* Optimize logN(func()) for various exponential functions. We | |
1835 | want to determine the value "x" and the power "exponent" in | |
1836 | order to transform logN(x**exponent) into exponent*logN(x). */ | |
1837 | (for logs (LOG LOG LOG LOG | |
1838 | LOG2 LOG2 LOG2 LOG2 | |
1839 | LOG10 LOG10 LOG10 LOG10) | |
1840 | exps (EXP EXP2 EXP10 POW10) | |
1841 | (simplify | |
1842 | (logs (exps @0)) | |
1843 | (with { | |
1844 | tree x; | |
1845 | switch (exps) | |
1846 | { | |
1847 | CASE_FLT_FN (BUILT_IN_EXP): | |
1848 | /* Prepare to do logN(exp(exponent) -> exponent*logN(e). */ | |
1849 | x = build_real (type, real_value_truncate (TYPE_MODE (type), | |
1850 | dconst_e ())); | |
1851 | break; | |
1852 | CASE_FLT_FN (BUILT_IN_EXP2): | |
1853 | /* Prepare to do logN(exp2(exponent) -> exponent*logN(2). */ | |
1854 | x = build_real (type, dconst2); | |
1855 | break; | |
1856 | CASE_FLT_FN (BUILT_IN_EXP10): | |
1857 | CASE_FLT_FN (BUILT_IN_POW10): | |
1858 | /* Prepare to do logN(exp10(exponent) -> exponent*logN(10). */ | |
1859 | { | |
1860 | REAL_VALUE_TYPE dconst10; | |
1861 | real_from_integer (&dconst10, VOIDmode, 10, SIGNED); | |
1862 | x = build_real (type, dconst10); | |
1863 | } | |
1864 | break; | |
1865 | } | |
1866 | } | |
1867 | (mult (logs { x; }) @0)))) | |
1868 | (for logs (LOG LOG | |
1869 | LOG2 LOG2 | |
1870 | LOG10 LOG10) | |
1871 | exps (SQRT CBRT) | |
1872 | (simplify | |
1873 | (logs (exps @0)) | |
1874 | (with { | |
1875 | tree x; | |
1876 | switch (exps) | |
1877 | { | |
1878 | CASE_FLT_FN (BUILT_IN_SQRT): | |
1879 | /* Prepare to do logN(sqrt(x) -> 0.5*logN(x). */ | |
1880 | x = build_real (type, dconsthalf); | |
1881 | break; | |
1882 | CASE_FLT_FN (BUILT_IN_CBRT): | |
1883 | /* Prepare to do logN(cbrt(x) -> (1/3)*logN(x). */ | |
1884 | x = build_real (type, real_value_truncate (TYPE_MODE (type), | |
1885 | dconst_third ())); | |
1886 | break; | |
1887 | } | |
1888 | } | |
1889 | (mult { x; } (logs @0))))) | |
1890 | /* logN(pow(x,exponent) -> exponent*logN(x). */ | |
1891 | (for logs (LOG LOG2 LOG10) | |
1892 | pows (POW) | |
1893 | (simplify | |
1894 | (logs (pows @0 @1)) | |
1895 | (mult @1 (logs @0))))) | |
1896 | ||
be144838 JL |
1897 | /* Narrowing of arithmetic and logical operations. |
1898 | ||
1899 | These are conceptually similar to the transformations performed for | |
1900 | the C/C++ front-ends by shorten_binary_op and shorten_compare. Long | |
1901 | term we want to move all that code out of the front-ends into here. */ | |
1902 | ||
1903 | /* If we have a narrowing conversion of an arithmetic operation where | |
1904 | both operands are widening conversions from the same type as the outer | |
1905 | narrowing conversion. Then convert the innermost operands to a suitable | |
1906 | unsigned type (to avoid introducing undefined behaviour), perform the | |
1907 | operation and convert the result to the desired type. */ | |
1908 | (for op (plus minus) | |
1909 | (simplify | |
44fc0a51 | 1910 | (convert (op:s (convert@2 @0) (convert@3 @1))) |
be144838 JL |
1911 | (if (INTEGRAL_TYPE_P (type) |
1912 | /* We check for type compatibility between @0 and @1 below, | |
1913 | so there's no need to check that @1/@3 are integral types. */ | |
1914 | && INTEGRAL_TYPE_P (TREE_TYPE (@0)) | |
1915 | && INTEGRAL_TYPE_P (TREE_TYPE (@2)) | |
1916 | /* The precision of the type of each operand must match the | |
1917 | precision of the mode of each operand, similarly for the | |
1918 | result. */ | |
1919 | && (TYPE_PRECISION (TREE_TYPE (@0)) | |
1920 | == GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (@0)))) | |
1921 | && (TYPE_PRECISION (TREE_TYPE (@1)) | |
1922 | == GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (@1)))) | |
1923 | && TYPE_PRECISION (type) == GET_MODE_PRECISION (TYPE_MODE (type)) | |
1924 | /* The inner conversion must be a widening conversion. */ | |
1925 | && TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (TREE_TYPE (@0)) | |
aea417d7 | 1926 | && types_match (@0, @1) |
44fc0a51 | 1927 | && types_match (@0, type)) |
be144838 | 1928 | (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))) |
8fdc6c67 RB |
1929 | (convert (op @0 @1)) |
1930 | (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); } | |
1931 | (convert (op (convert:utype @0) (convert:utype @1)))))))) | |
48451e8f JL |
1932 | |
1933 | /* This is another case of narrowing, specifically when there's an outer | |
1934 | BIT_AND_EXPR which masks off bits outside the type of the innermost | |
1935 | operands. Like the previous case we have to convert the operands | |
1936 | to unsigned types to avoid introducing undefined behaviour for the | |
1937 | arithmetic operation. */ | |
1938 | (for op (minus plus) | |
8fdc6c67 RB |
1939 | (simplify |
1940 | (bit_and (op:s (convert@2 @0) (convert@3 @1)) INTEGER_CST@4) | |
1941 | (if (INTEGRAL_TYPE_P (type) | |
1942 | /* We check for type compatibility between @0 and @1 below, | |
1943 | so there's no need to check that @1/@3 are integral types. */ | |
1944 | && INTEGRAL_TYPE_P (TREE_TYPE (@0)) | |
1945 | && INTEGRAL_TYPE_P (TREE_TYPE (@2)) | |
1946 | /* The precision of the type of each operand must match the | |
1947 | precision of the mode of each operand, similarly for the | |
1948 | result. */ | |
1949 | && (TYPE_PRECISION (TREE_TYPE (@0)) | |
1950 | == GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (@0)))) | |
1951 | && (TYPE_PRECISION (TREE_TYPE (@1)) | |
1952 | == GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (@1)))) | |
1953 | && TYPE_PRECISION (type) == GET_MODE_PRECISION (TYPE_MODE (type)) | |
1954 | /* The inner conversion must be a widening conversion. */ | |
1955 | && TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (TREE_TYPE (@0)) | |
1956 | && types_match (@0, @1) | |
1957 | && (tree_int_cst_min_precision (@4, TYPE_SIGN (TREE_TYPE (@0))) | |
1958 | <= TYPE_PRECISION (TREE_TYPE (@0))) | |
1959 | && (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)) | |
1960 | || tree_int_cst_sgn (@4) >= 0)) | |
1961 | (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))) | |
1962 | (with { tree ntype = TREE_TYPE (@0); } | |
1963 | (convert (bit_and (op @0 @1) (convert:ntype @4)))) | |
1964 | (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); } | |
1965 | (convert (bit_and (op (convert:utype @0) (convert:utype @1)) | |
1966 | (convert:utype @4)))))))) |