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.
5 Copyright (C) 2014-2018 Free Software Foundation, Inc.
6 Contributed by Richard Biener <rguenther@suse.de>
7 and Prathamesh Kulkarni <bilbotheelffriend@gmail.com>
9 This file is part of GCC.
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
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
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/>. */
26 /* Generic tree predicates we inherit. */
28 integer_onep integer_zerop integer_all_onesp integer_minus_onep
29 integer_each_onep integer_truep integer_nonzerop
30 real_zerop real_onep real_minus_onep
33 tree_expr_nonnegative_p
40 (define_operator_list tcc_comparison
41 lt le eq ne ge gt unordered ordered unlt unle ungt unge uneq ltgt)
42 (define_operator_list inverted_tcc_comparison
43 ge gt ne eq lt le ordered unordered ge gt le lt ltgt uneq)
44 (define_operator_list inverted_tcc_comparison_with_nans
45 unge ungt ne eq unlt unle ordered unordered ge gt le lt ltgt uneq)
46 (define_operator_list swapped_tcc_comparison
47 gt ge eq ne le lt unordered ordered ungt unge unlt unle uneq ltgt)
48 (define_operator_list simple_comparison lt le eq ne ge gt)
49 (define_operator_list swapped_simple_comparison gt ge eq ne le lt)
51 #include "cfn-operators.pd"
53 /* Define operand lists for math rounding functions {,i,l,ll}FN,
54 where the versions prefixed with "i" return an int, those prefixed with
55 "l" return a long and those prefixed with "ll" return a long long.
57 Also define operand lists:
59 X<FN>F for all float functions, in the order i, l, ll
60 X<FN> for all double functions, in the same order
61 X<FN>L for all long double functions, in the same order. */
62 #define DEFINE_INT_AND_FLOAT_ROUND_FN(FN) \
63 (define_operator_list X##FN##F BUILT_IN_I##FN##F \
66 (define_operator_list X##FN BUILT_IN_I##FN \
69 (define_operator_list X##FN##L BUILT_IN_I##FN##L \
73 DEFINE_INT_AND_FLOAT_ROUND_FN (FLOOR)
74 DEFINE_INT_AND_FLOAT_ROUND_FN (CEIL)
75 DEFINE_INT_AND_FLOAT_ROUND_FN (ROUND)
76 DEFINE_INT_AND_FLOAT_ROUND_FN (RINT)
78 /* As opposed to convert?, this still creates a single pattern, so
79 it is not a suitable replacement for convert? in all cases. */
80 (match (nop_convert @0)
82 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))))
83 (match (nop_convert @0)
85 (if (VECTOR_TYPE_P (type) && VECTOR_TYPE_P (TREE_TYPE (@0))
86 && known_eq (TYPE_VECTOR_SUBPARTS (type),
87 TYPE_VECTOR_SUBPARTS (TREE_TYPE (@0)))
88 && tree_nop_conversion_p (TREE_TYPE (type), TREE_TYPE (TREE_TYPE (@0))))))
89 /* This one has to be last, or it shadows the others. */
90 (match (nop_convert @0)
93 /* Simplifications of operations with one constant operand and
94 simplifications to constants or single values. */
96 (for op (plus pointer_plus minus bit_ior bit_xor)
101 /* 0 +p index -> (type)index */
103 (pointer_plus integer_zerop @1)
104 (non_lvalue (convert @1)))
106 /* ptr - 0 -> (type)ptr */
108 (pointer_diff @0 integer_zerop)
111 /* See if ARG1 is zero and X + ARG1 reduces to X.
112 Likewise if the operands are reversed. */
114 (plus:c @0 real_zerop@1)
115 (if (fold_real_zero_addition_p (type, @1, 0))
118 /* See if ARG1 is zero and X - ARG1 reduces to X. */
120 (minus @0 real_zerop@1)
121 (if (fold_real_zero_addition_p (type, @1, 1))
125 This is unsafe for certain floats even in non-IEEE formats.
126 In IEEE, it is unsafe because it does wrong for NaNs.
127 Also note that operand_equal_p is always false if an operand
131 (if (!FLOAT_TYPE_P (type) || !HONOR_NANS (type))
132 { build_zero_cst (type); }))
134 (pointer_diff @@0 @0)
135 { build_zero_cst (type); })
138 (mult @0 integer_zerop@1)
141 /* Maybe fold x * 0 to 0. The expressions aren't the same
142 when x is NaN, since x * 0 is also NaN. Nor are they the
143 same in modes with signed zeros, since multiplying a
144 negative value by 0 gives -0, not +0. */
146 (mult @0 real_zerop@1)
147 (if (!HONOR_NANS (type) && !HONOR_SIGNED_ZEROS (type))
150 /* In IEEE floating point, x*1 is not equivalent to x for snans.
151 Likewise for complex arithmetic with signed zeros. */
154 (if (!HONOR_SNANS (type)
155 && (!HONOR_SIGNED_ZEROS (type)
156 || !COMPLEX_FLOAT_TYPE_P (type)))
159 /* Transform x * -1.0 into -x. */
161 (mult @0 real_minus_onep)
162 (if (!HONOR_SNANS (type)
163 && (!HONOR_SIGNED_ZEROS (type)
164 || !COMPLEX_FLOAT_TYPE_P (type)))
167 (for cmp (gt ge lt le)
168 outp (convert convert negate negate)
169 outn (negate negate convert convert)
170 /* Transform (X > 0.0 ? 1.0 : -1.0) into copysign(1, X). */
171 /* Transform (X >= 0.0 ? 1.0 : -1.0) into copysign(1, X). */
172 /* Transform (X < 0.0 ? 1.0 : -1.0) into copysign(1,-X). */
173 /* Transform (X <= 0.0 ? 1.0 : -1.0) into copysign(1,-X). */
175 (cond (cmp @0 real_zerop) real_onep@1 real_minus_onep)
176 (if (!HONOR_NANS (type) && !HONOR_SIGNED_ZEROS (type)
177 && types_match (type, TREE_TYPE (@0)))
179 (if (types_match (type, float_type_node))
180 (BUILT_IN_COPYSIGNF @1 (outp @0)))
181 (if (types_match (type, double_type_node))
182 (BUILT_IN_COPYSIGN @1 (outp @0)))
183 (if (types_match (type, long_double_type_node))
184 (BUILT_IN_COPYSIGNL @1 (outp @0))))))
185 /* Transform (X > 0.0 ? -1.0 : 1.0) into copysign(1,-X). */
186 /* Transform (X >= 0.0 ? -1.0 : 1.0) into copysign(1,-X). */
187 /* Transform (X < 0.0 ? -1.0 : 1.0) into copysign(1,X). */
188 /* Transform (X <= 0.0 ? -1.0 : 1.0) into copysign(1,X). */
190 (cond (cmp @0 real_zerop) real_minus_onep real_onep@1)
191 (if (!HONOR_NANS (type) && !HONOR_SIGNED_ZEROS (type)
192 && types_match (type, TREE_TYPE (@0)))
194 (if (types_match (type, float_type_node))
195 (BUILT_IN_COPYSIGNF @1 (outn @0)))
196 (if (types_match (type, double_type_node))
197 (BUILT_IN_COPYSIGN @1 (outn @0)))
198 (if (types_match (type, long_double_type_node))
199 (BUILT_IN_COPYSIGNL @1 (outn @0)))))))
201 /* Transform X * copysign (1.0, X) into abs(X). */
203 (mult:c @0 (COPYSIGN_ALL real_onep @0))
204 (if (!HONOR_NANS (type) && !HONOR_SIGNED_ZEROS (type))
207 /* Transform X * copysign (1.0, -X) into -abs(X). */
209 (mult:c @0 (COPYSIGN_ALL real_onep (negate @0)))
210 (if (!HONOR_NANS (type) && !HONOR_SIGNED_ZEROS (type))
213 /* Transform copysign (CST, X) into copysign (ABS(CST), X). */
215 (COPYSIGN_ALL REAL_CST@0 @1)
216 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@0)))
217 (COPYSIGN_ALL (negate @0) @1)))
219 /* X * 1, X / 1 -> X. */
220 (for op (mult trunc_div ceil_div floor_div round_div exact_div)
225 /* (A / (1 << B)) -> (A >> B).
226 Only for unsigned A. For signed A, this would not preserve rounding
228 For example: (-1 / ( 1 << B)) != -1 >> B. */
230 (trunc_div @0 (lshift integer_onep@1 @2))
231 (if ((TYPE_UNSIGNED (type) || tree_expr_nonnegative_p (@0))
232 && (!VECTOR_TYPE_P (type)
233 || target_supports_op_p (type, RSHIFT_EXPR, optab_vector)
234 || target_supports_op_p (type, RSHIFT_EXPR, optab_scalar)))
237 /* Preserve explicit divisions by 0: the C++ front-end wants to detect
238 undefined behavior in constexpr evaluation, and assuming that the division
239 traps enables better optimizations than these anyway. */
240 (for div (trunc_div ceil_div floor_div round_div exact_div)
241 /* 0 / X is always zero. */
243 (div integer_zerop@0 @1)
244 /* But not for 0 / 0 so that we can get the proper warnings and errors. */
245 (if (!integer_zerop (@1))
249 (div @0 integer_minus_onep@1)
250 (if (!TYPE_UNSIGNED (type))
255 /* But not for 0 / 0 so that we can get the proper warnings and errors.
256 And not for _Fract types where we can't build 1. */
257 (if (!integer_zerop (@0) && !ALL_FRACT_MODE_P (TYPE_MODE (type)))
258 { build_one_cst (type); }))
259 /* X / abs (X) is X < 0 ? -1 : 1. */
262 (if (INTEGRAL_TYPE_P (type)
263 && TYPE_OVERFLOW_UNDEFINED (type))
264 (cond (lt @0 { build_zero_cst (type); })
265 { build_minus_one_cst (type); } { build_one_cst (type); })))
268 (div:C @0 (negate @0))
269 (if ((INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
270 && TYPE_OVERFLOW_UNDEFINED (type))
271 { build_minus_one_cst (type); })))
273 /* For unsigned integral types, FLOOR_DIV_EXPR is the same as
274 TRUNC_DIV_EXPR. Rewrite into the latter in this case. */
277 (if ((INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
278 && TYPE_UNSIGNED (type))
281 /* Combine two successive divisions. Note that combining ceil_div
282 and floor_div is trickier and combining round_div even more so. */
283 (for div (trunc_div exact_div)
285 (div (div @0 INTEGER_CST@1) INTEGER_CST@2)
288 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@2),
289 TYPE_SIGN (type), &overflow_p);
292 (div @0 { wide_int_to_tree (type, mul); })
293 (if (TYPE_UNSIGNED (type)
294 || mul != wi::min_value (TYPE_PRECISION (type), SIGNED))
295 { build_zero_cst (type); })))))
297 /* Combine successive multiplications. Similar to above, but handling
298 overflow is different. */
300 (mult (mult @0 INTEGER_CST@1) INTEGER_CST@2)
303 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@2),
304 TYPE_SIGN (type), &overflow_p);
306 /* Skip folding on overflow: the only special case is @1 * @2 == -INT_MIN,
307 otherwise undefined overflow implies that @0 must be zero. */
308 (if (!overflow_p || TYPE_OVERFLOW_WRAPS (type))
309 (mult @0 { wide_int_to_tree (type, mul); }))))
311 /* Optimize A / A to 1.0 if we don't care about
312 NaNs or Infinities. */
315 (if (FLOAT_TYPE_P (type)
316 && ! HONOR_NANS (type)
317 && ! HONOR_INFINITIES (type))
318 { build_one_cst (type); }))
320 /* Optimize -A / A to -1.0 if we don't care about
321 NaNs or Infinities. */
323 (rdiv:C @0 (negate @0))
324 (if (FLOAT_TYPE_P (type)
325 && ! HONOR_NANS (type)
326 && ! HONOR_INFINITIES (type))
327 { build_minus_one_cst (type); }))
329 /* PR71078: x / abs(x) -> copysign (1.0, x) */
331 (rdiv:C (convert? @0) (convert? (abs @0)))
332 (if (SCALAR_FLOAT_TYPE_P (type)
333 && ! HONOR_NANS (type)
334 && ! HONOR_INFINITIES (type))
336 (if (types_match (type, float_type_node))
337 (BUILT_IN_COPYSIGNF { build_one_cst (type); } (convert @0)))
338 (if (types_match (type, double_type_node))
339 (BUILT_IN_COPYSIGN { build_one_cst (type); } (convert @0)))
340 (if (types_match (type, long_double_type_node))
341 (BUILT_IN_COPYSIGNL { build_one_cst (type); } (convert @0))))))
343 /* In IEEE floating point, x/1 is not equivalent to x for snans. */
346 (if (!HONOR_SNANS (type))
349 /* In IEEE floating point, x/-1 is not equivalent to -x for snans. */
351 (rdiv @0 real_minus_onep)
352 (if (!HONOR_SNANS (type))
355 (if (flag_reciprocal_math)
356 /* Convert (A/B)/C to A/(B*C). */
358 (rdiv (rdiv:s @0 @1) @2)
359 (rdiv @0 (mult @1 @2)))
361 /* Canonicalize x / (C1 * y) to (x * C2) / y. */
363 (rdiv @0 (mult:s @1 REAL_CST@2))
365 { tree tem = const_binop (RDIV_EXPR, type, build_one_cst (type), @2); }
367 (rdiv (mult @0 { tem; } ) @1))))
369 /* Convert A/(B/C) to (A/B)*C */
371 (rdiv @0 (rdiv:s @1 @2))
372 (mult (rdiv @0 @1) @2)))
374 /* Simplify x / (- y) to -x / y. */
376 (rdiv @0 (negate @1))
377 (rdiv (negate @0) @1))
379 /* Optimize (X & (-A)) / A where A is a power of 2, to X >> log2(A) */
380 (for div (trunc_div ceil_div floor_div round_div exact_div)
382 (div (convert? (bit_and @0 INTEGER_CST@1)) INTEGER_CST@2)
383 (if (integer_pow2p (@2)
384 && tree_int_cst_sgn (@2) > 0
385 && tree_nop_conversion_p (type, TREE_TYPE (@0))
386 && wi::to_wide (@2) + wi::to_wide (@1) == 0)
388 { build_int_cst (integer_type_node,
389 wi::exact_log2 (wi::to_wide (@2))); }))))
391 /* If ARG1 is a constant, we can convert this to a multiply by the
392 reciprocal. This does not have the same rounding properties,
393 so only do this if -freciprocal-math. We can actually
394 always safely do it if ARG1 is a power of two, but it's hard to
395 tell if it is or not in a portable manner. */
396 (for cst (REAL_CST COMPLEX_CST VECTOR_CST)
400 (if (flag_reciprocal_math
403 { tree tem = const_binop (RDIV_EXPR, type, build_one_cst (type), @1); }
405 (mult @0 { tem; } )))
406 (if (cst != COMPLEX_CST)
407 (with { tree inverse = exact_inverse (type, @1); }
409 (mult @0 { inverse; } ))))))))
411 (for mod (ceil_mod floor_mod round_mod trunc_mod)
412 /* 0 % X is always zero. */
414 (mod integer_zerop@0 @1)
415 /* But not for 0 % 0 so that we can get the proper warnings and errors. */
416 (if (!integer_zerop (@1))
418 /* X % 1 is always zero. */
420 (mod @0 integer_onep)
421 { build_zero_cst (type); })
422 /* X % -1 is zero. */
424 (mod @0 integer_minus_onep@1)
425 (if (!TYPE_UNSIGNED (type))
426 { build_zero_cst (type); }))
430 /* But not for 0 % 0 so that we can get the proper warnings and errors. */
431 (if (!integer_zerop (@0))
432 { build_zero_cst (type); }))
433 /* (X % Y) % Y is just X % Y. */
435 (mod (mod@2 @0 @1) @1)
437 /* From extract_muldiv_1: (X * C1) % C2 is zero if C1 is a multiple of C2. */
439 (mod (mult @0 INTEGER_CST@1) INTEGER_CST@2)
440 (if (ANY_INTEGRAL_TYPE_P (type)
441 && TYPE_OVERFLOW_UNDEFINED (type)
442 && wi::multiple_of_p (wi::to_wide (@1), wi::to_wide (@2),
444 { build_zero_cst (type); })))
446 /* X % -C is the same as X % C. */
448 (trunc_mod @0 INTEGER_CST@1)
449 (if (TYPE_SIGN (type) == SIGNED
450 && !TREE_OVERFLOW (@1)
451 && wi::neg_p (wi::to_wide (@1))
452 && !TYPE_OVERFLOW_TRAPS (type)
453 /* Avoid this transformation if C is INT_MIN, i.e. C == -C. */
454 && !sign_bit_p (@1, @1))
455 (trunc_mod @0 (negate @1))))
457 /* X % -Y is the same as X % Y. */
459 (trunc_mod @0 (convert? (negate @1)))
460 (if (INTEGRAL_TYPE_P (type)
461 && !TYPE_UNSIGNED (type)
462 && !TYPE_OVERFLOW_TRAPS (type)
463 && tree_nop_conversion_p (type, TREE_TYPE (@1))
464 /* Avoid this transformation if X might be INT_MIN or
465 Y might be -1, because we would then change valid
466 INT_MIN % -(-1) into invalid INT_MIN % -1. */
467 && (expr_not_equal_to (@0, wi::to_wide (TYPE_MIN_VALUE (type)))
468 || expr_not_equal_to (@1, wi::minus_one (TYPE_PRECISION
470 (trunc_mod @0 (convert @1))))
472 /* X - (X / Y) * Y is the same as X % Y. */
474 (minus (convert1? @0) (convert2? (mult:c (trunc_div @@0 @@1) @1)))
475 (if (INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
476 (convert (trunc_mod @0 @1))))
478 /* Optimize TRUNC_MOD_EXPR by a power of two into a BIT_AND_EXPR,
479 i.e. "X % C" into "X & (C - 1)", if X and C are positive.
480 Also optimize A % (C << N) where C is a power of 2,
481 to A & ((C << N) - 1). */
482 (match (power_of_two_cand @1)
484 (match (power_of_two_cand @1)
485 (lshift INTEGER_CST@1 @2))
486 (for mod (trunc_mod floor_mod)
488 (mod @0 (convert?@3 (power_of_two_cand@1 @2)))
489 (if ((TYPE_UNSIGNED (type)
490 || tree_expr_nonnegative_p (@0))
491 && tree_nop_conversion_p (type, TREE_TYPE (@3))
492 && integer_pow2p (@2) && tree_int_cst_sgn (@2) > 0)
493 (bit_and @0 (convert (minus @1 { build_int_cst (TREE_TYPE (@1), 1); }))))))
495 /* Simplify (unsigned t * 2)/2 -> unsigned t & 0x7FFFFFFF. */
497 (trunc_div (mult @0 integer_pow2p@1) @1)
498 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
499 (bit_and @0 { wide_int_to_tree
500 (type, wi::mask (TYPE_PRECISION (type)
501 - wi::exact_log2 (wi::to_wide (@1)),
502 false, TYPE_PRECISION (type))); })))
504 /* Simplify (unsigned t / 2) * 2 -> unsigned t & ~1. */
506 (mult (trunc_div @0 integer_pow2p@1) @1)
507 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
508 (bit_and @0 (negate @1))))
510 /* Simplify (t * 2) / 2) -> t. */
511 (for div (trunc_div ceil_div floor_div round_div exact_div)
513 (div (mult:c @0 @1) @1)
514 (if (ANY_INTEGRAL_TYPE_P (type)
515 && TYPE_OVERFLOW_UNDEFINED (type))
519 /* Simplify cos(-x) and cos(|x|) -> cos(x). Similarly for cosh. */
524 /* Simplify pow(-x, y) and pow(|x|,y) -> pow(x,y) if y is an even integer. */
527 (pows (op @0) REAL_CST@1)
528 (with { HOST_WIDE_INT n; }
529 (if (real_isinteger (&TREE_REAL_CST (@1), &n) && (n & 1) == 0)
531 /* Likewise for powi. */
534 (pows (op @0) INTEGER_CST@1)
535 (if ((wi::to_wide (@1) & 1) == 0)
537 /* Strip negate and abs from both operands of hypot. */
545 /* copysign(-x, y) and copysign(abs(x), y) -> copysign(x, y). */
546 (for copysigns (COPYSIGN_ALL)
548 (copysigns (op @0) @1)
551 /* abs(x)*abs(x) -> x*x. Should be valid for all types. */
556 /* cos(copysign(x, y)) -> cos(x). Similarly for cosh. */
560 (coss (copysigns @0 @1))
563 /* pow(copysign(x, y), z) -> pow(x, z) if z is an even integer. */
567 (pows (copysigns @0 @2) REAL_CST@1)
568 (with { HOST_WIDE_INT n; }
569 (if (real_isinteger (&TREE_REAL_CST (@1), &n) && (n & 1) == 0)
571 /* Likewise for powi. */
575 (pows (copysigns @0 @2) INTEGER_CST@1)
576 (if ((wi::to_wide (@1) & 1) == 0)
581 /* hypot(copysign(x, y), z) -> hypot(x, z). */
583 (hypots (copysigns @0 @1) @2)
585 /* hypot(x, copysign(y, z)) -> hypot(x, y). */
587 (hypots @0 (copysigns @1 @2))
590 /* copysign(x, CST) -> [-]abs (x). */
591 (for copysigns (COPYSIGN_ALL)
593 (copysigns @0 REAL_CST@1)
594 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
598 /* copysign(copysign(x, y), z) -> copysign(x, z). */
599 (for copysigns (COPYSIGN_ALL)
601 (copysigns (copysigns @0 @1) @2)
604 /* copysign(x,y)*copysign(x,y) -> x*x. */
605 (for copysigns (COPYSIGN_ALL)
607 (mult (copysigns@2 @0 @1) @2)
610 /* ccos(-x) -> ccos(x). Similarly for ccosh. */
611 (for ccoss (CCOS CCOSH)
616 /* cabs(-x) and cos(conj(x)) -> cabs(x). */
617 (for ops (conj negate)
623 /* Fold (a * (1 << b)) into (a << b) */
625 (mult:c @0 (convert? (lshift integer_onep@1 @2)))
626 (if (! FLOAT_TYPE_P (type)
627 && tree_nop_conversion_p (type, TREE_TYPE (@1)))
630 /* Fold (1 << (C - x)) where C = precision(type) - 1
631 into ((1 << C) >> x). */
633 (lshift integer_onep@0 (minus@1 INTEGER_CST@2 @3))
634 (if (INTEGRAL_TYPE_P (type)
635 && wi::eq_p (wi::to_wide (@2), TYPE_PRECISION (type) - 1)
637 (if (TYPE_UNSIGNED (type))
638 (rshift (lshift @0 @2) @3)
640 { tree utype = unsigned_type_for (type); }
641 (convert (rshift (lshift (convert:utype @0) @2) @3))))))
643 /* Fold (C1/X)*C2 into (C1*C2)/X. */
645 (mult (rdiv@3 REAL_CST@0 @1) REAL_CST@2)
646 (if (flag_associative_math
649 { tree tem = const_binop (MULT_EXPR, type, @0, @2); }
651 (rdiv { tem; } @1)))))
653 /* Simplify ~X & X as zero. */
655 (bit_and:c (convert? @0) (convert? (bit_not @0)))
656 { build_zero_cst (type); })
658 /* PR71636: Transform x & ((1U << b) - 1) -> x & ~(~0U << b); */
660 (bit_and:c @0 (plus:s (lshift:s integer_onep @1) integer_minus_onep))
661 (if (TYPE_UNSIGNED (type))
662 (bit_and @0 (bit_not (lshift { build_all_ones_cst (type); } @1)))))
664 (for bitop (bit_and bit_ior)
666 /* PR35691: Transform
667 (x == 0 & y == 0) -> (x | typeof(x)(y)) == 0.
668 (x != 0 | y != 0) -> (x | typeof(x)(y)) != 0. */
670 (bitop (cmp @0 integer_zerop@2) (cmp @1 integer_zerop))
671 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
672 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
673 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1)))
674 (cmp (bit_ior @0 (convert @1)) @2)))
676 (x == -1 & y == -1) -> (x & typeof(x)(y)) == -1.
677 (x != -1 | y != -1) -> (x & typeof(x)(y)) != -1. */
679 (bitop (cmp @0 integer_all_onesp@2) (cmp @1 integer_all_onesp))
680 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
681 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
682 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1)))
683 (cmp (bit_and @0 (convert @1)) @2))))
685 /* Fold (A & ~B) - (A & B) into (A ^ B) - B. */
687 (minus (bit_and:cs @0 (bit_not @1)) (bit_and:cs @0 @1))
688 (minus (bit_xor @0 @1) @1))
690 (minus (bit_and:s @0 INTEGER_CST@2) (bit_and:s @0 INTEGER_CST@1))
691 (if (~wi::to_wide (@2) == wi::to_wide (@1))
692 (minus (bit_xor @0 @1) @1)))
694 /* Fold (A & B) - (A & ~B) into B - (A ^ B). */
696 (minus (bit_and:cs @0 @1) (bit_and:cs @0 (bit_not @1)))
697 (minus @1 (bit_xor @0 @1)))
699 /* Simplify (X & ~Y) |^+ (~X & Y) -> X ^ Y. */
700 (for op (bit_ior bit_xor plus)
702 (op (bit_and:c @0 (bit_not @1)) (bit_and:c (bit_not @0) @1))
705 (op:c (bit_and @0 INTEGER_CST@2) (bit_and (bit_not @0) INTEGER_CST@1))
706 (if (~wi::to_wide (@2) == wi::to_wide (@1))
709 /* PR53979: Transform ((a ^ b) | a) -> (a | b) */
711 (bit_ior:c (bit_xor:c @0 @1) @0)
714 /* (a & ~b) | (a ^ b) --> a ^ b */
716 (bit_ior:c (bit_and:c @0 (bit_not @1)) (bit_xor:c@2 @0 @1))
719 /* (a & ~b) ^ ~a --> ~(a & b) */
721 (bit_xor:c (bit_and:cs @0 (bit_not @1)) (bit_not @0))
722 (bit_not (bit_and @0 @1)))
724 /* (a | b) & ~(a ^ b) --> a & b */
726 (bit_and:c (bit_ior @0 @1) (bit_not (bit_xor:c @0 @1)))
729 /* a | ~(a ^ b) --> a | ~b */
731 (bit_ior:c @0 (bit_not:s (bit_xor:c @0 @1)))
732 (bit_ior @0 (bit_not @1)))
734 /* (a | b) | (a &^ b) --> a | b */
735 (for op (bit_and bit_xor)
737 (bit_ior:c (bit_ior@2 @0 @1) (op:c @0 @1))
740 /* (a & b) | ~(a ^ b) --> ~(a ^ b) */
742 (bit_ior:c (bit_and:c @0 @1) (bit_not@2 (bit_xor @0 @1)))
745 /* ~(~a & b) --> a | ~b */
747 (bit_not (bit_and:cs (bit_not @0) @1))
748 (bit_ior @0 (bit_not @1)))
750 /* Simplify (~X & Y) to X ^ Y if we know that (X & ~Y) is 0. */
753 (bit_and (bit_not SSA_NAME@0) INTEGER_CST@1)
754 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
755 && wi::bit_and_not (get_nonzero_bits (@0), wi::to_wide (@1)) == 0)
759 /* X % Y is smaller than Y. */
762 (cmp (trunc_mod @0 @1) @1)
763 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
764 { constant_boolean_node (cmp == LT_EXPR, type); })))
767 (cmp @1 (trunc_mod @0 @1))
768 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
769 { constant_boolean_node (cmp == GT_EXPR, type); })))
773 (bit_ior @0 integer_all_onesp@1)
778 (bit_ior @0 integer_zerop)
783 (bit_and @0 integer_zerop@1)
789 (for op (bit_ior bit_xor plus)
791 (op:c (convert? @0) (convert? (bit_not @0)))
792 (convert { build_all_ones_cst (TREE_TYPE (@0)); })))
797 { build_zero_cst (type); })
799 /* Canonicalize X ^ ~0 to ~X. */
801 (bit_xor @0 integer_all_onesp@1)
806 (bit_and @0 integer_all_onesp)
809 /* x & x -> x, x | x -> x */
810 (for bitop (bit_and bit_ior)
815 /* x & C -> x if we know that x & ~C == 0. */
818 (bit_and SSA_NAME@0 INTEGER_CST@1)
819 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
820 && wi::bit_and_not (get_nonzero_bits (@0), wi::to_wide (@1)) == 0)
824 /* x + (x & 1) -> (x + 1) & ~1 */
826 (plus:c @0 (bit_and:s @0 integer_onep@1))
827 (bit_and (plus @0 @1) (bit_not @1)))
829 /* x & ~(x & y) -> x & ~y */
830 /* x | ~(x | y) -> x | ~y */
831 (for bitop (bit_and bit_ior)
833 (bitop:c @0 (bit_not (bitop:cs @0 @1)))
834 (bitop @0 (bit_not @1))))
836 /* (x | y) & ~x -> y & ~x */
837 /* (x & y) | ~x -> y | ~x */
838 (for bitop (bit_and bit_ior)
839 rbitop (bit_ior bit_and)
841 (bitop:c (rbitop:c @0 @1) (bit_not@2 @0))
844 /* (x & y) ^ (x | y) -> x ^ y */
846 (bit_xor:c (bit_and @0 @1) (bit_ior @0 @1))
849 /* (x ^ y) ^ (x | y) -> x & y */
851 (bit_xor:c (bit_xor @0 @1) (bit_ior @0 @1))
854 /* (x & y) + (x ^ y) -> x | y */
855 /* (x & y) | (x ^ y) -> x | y */
856 /* (x & y) ^ (x ^ y) -> x | y */
857 (for op (plus bit_ior bit_xor)
859 (op:c (bit_and @0 @1) (bit_xor @0 @1))
862 /* (x & y) + (x | y) -> x + y */
864 (plus:c (bit_and @0 @1) (bit_ior @0 @1))
867 /* (x + y) - (x | y) -> x & y */
869 (minus (plus @0 @1) (bit_ior @0 @1))
870 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
871 && !TYPE_SATURATING (type))
874 /* (x + y) - (x & y) -> x | y */
876 (minus (plus @0 @1) (bit_and @0 @1))
877 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
878 && !TYPE_SATURATING (type))
881 /* (x | y) - (x ^ y) -> x & y */
883 (minus (bit_ior @0 @1) (bit_xor @0 @1))
886 /* (x | y) - (x & y) -> x ^ y */
888 (minus (bit_ior @0 @1) (bit_and @0 @1))
891 /* (x | y) & ~(x & y) -> x ^ y */
893 (bit_and:c (bit_ior @0 @1) (bit_not (bit_and @0 @1)))
896 /* (x | y) & (~x ^ y) -> x & y */
898 (bit_and:c (bit_ior:c @0 @1) (bit_xor:c @1 (bit_not @0)))
901 /* ~x & ~y -> ~(x | y)
902 ~x | ~y -> ~(x & y) */
903 (for op (bit_and bit_ior)
904 rop (bit_ior bit_and)
906 (op (convert1? (bit_not @0)) (convert2? (bit_not @1)))
907 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
908 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
909 (bit_not (rop (convert @0) (convert @1))))))
911 /* If we are XORing or adding two BIT_AND_EXPR's, both of which are and'ing
912 with a constant, and the two constants have no bits in common,
913 we should treat this as a BIT_IOR_EXPR since this may produce more
915 (for op (bit_xor plus)
917 (op (convert1? (bit_and@4 @0 INTEGER_CST@1))
918 (convert2? (bit_and@5 @2 INTEGER_CST@3)))
919 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
920 && tree_nop_conversion_p (type, TREE_TYPE (@2))
921 && (wi::to_wide (@1) & wi::to_wide (@3)) == 0)
922 (bit_ior (convert @4) (convert @5)))))
924 /* (X | Y) ^ X -> Y & ~ X*/
926 (bit_xor:c (convert1? (bit_ior:c @@0 @1)) (convert2? @0))
927 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
928 (convert (bit_and @1 (bit_not @0)))))
930 /* Convert ~X ^ ~Y to X ^ Y. */
932 (bit_xor (convert1? (bit_not @0)) (convert2? (bit_not @1)))
933 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
934 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
935 (bit_xor (convert @0) (convert @1))))
937 /* Convert ~X ^ C to X ^ ~C. */
939 (bit_xor (convert? (bit_not @0)) INTEGER_CST@1)
940 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
941 (bit_xor (convert @0) (bit_not @1))))
943 /* Fold (X & Y) ^ Y and (X ^ Y) & Y as ~X & Y. */
944 (for opo (bit_and bit_xor)
945 opi (bit_xor bit_and)
947 (opo:c (opi:c @0 @1) @1)
948 (bit_and (bit_not @0) @1)))
950 /* Given a bit-wise operation CODE applied to ARG0 and ARG1, see if both
951 operands are another bit-wise operation with a common input. If so,
952 distribute the bit operations to save an operation and possibly two if
953 constants are involved. For example, convert
954 (A | B) & (A | C) into A | (B & C)
955 Further simplification will occur if B and C are constants. */
956 (for op (bit_and bit_ior bit_xor)
957 rop (bit_ior bit_and bit_and)
959 (op (convert? (rop:c @@0 @1)) (convert? (rop:c @0 @2)))
960 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
961 && tree_nop_conversion_p (type, TREE_TYPE (@2)))
962 (rop (convert @0) (op (convert @1) (convert @2))))))
964 /* Some simple reassociation for bit operations, also handled in reassoc. */
965 /* (X & Y) & Y -> X & Y
966 (X | Y) | Y -> X | Y */
967 (for op (bit_and bit_ior)
969 (op:c (convert1?@2 (op:c @0 @@1)) (convert2? @1))
971 /* (X ^ Y) ^ Y -> X */
973 (bit_xor:c (convert1? (bit_xor:c @0 @@1)) (convert2? @1))
975 /* (X & Y) & (X & Z) -> (X & Y) & Z
976 (X | Y) | (X | Z) -> (X | Y) | Z */
977 (for op (bit_and bit_ior)
979 (op (convert1?@3 (op:c@4 @0 @1)) (convert2?@5 (op:c@6 @0 @2)))
980 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
981 && tree_nop_conversion_p (type, TREE_TYPE (@2)))
982 (if (single_use (@5) && single_use (@6))
984 (if (single_use (@3) && single_use (@4))
985 (op (convert @1) @5))))))
986 /* (X ^ Y) ^ (X ^ Z) -> Y ^ Z */
988 (bit_xor (convert1? (bit_xor:c @0 @1)) (convert2? (bit_xor:c @0 @2)))
989 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
990 && tree_nop_conversion_p (type, TREE_TYPE (@2)))
991 (bit_xor (convert @1) (convert @2))))
1000 (abs tree_expr_nonnegative_p@0)
1003 /* A few cases of fold-const.c negate_expr_p predicate. */
1004 (match negate_expr_p
1006 (if ((INTEGRAL_TYPE_P (type)
1007 && TYPE_UNSIGNED (type))
1008 || (!TYPE_OVERFLOW_SANITIZED (type)
1009 && may_negate_without_overflow_p (t)))))
1010 (match negate_expr_p
1012 (match negate_expr_p
1014 (if (!TYPE_OVERFLOW_SANITIZED (type))))
1015 (match negate_expr_p
1017 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (t)))))
1018 /* VECTOR_CST handling of non-wrapping types would recurse in unsupported
1020 (match negate_expr_p
1022 (if (FLOAT_TYPE_P (TREE_TYPE (type)) || TYPE_OVERFLOW_WRAPS (type))))
1023 (match negate_expr_p
1025 (if ((ANY_INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_WRAPS (type))
1026 || (FLOAT_TYPE_P (type)
1027 && !HONOR_SIGN_DEPENDENT_ROUNDING (type)
1028 && !HONOR_SIGNED_ZEROS (type)))))
1030 /* (-A) * (-B) -> A * B */
1032 (mult:c (convert1? (negate @0)) (convert2? negate_expr_p@1))
1033 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
1034 && tree_nop_conversion_p (type, TREE_TYPE (@1)))
1035 (mult (convert @0) (convert (negate @1)))))
1037 /* -(A + B) -> (-B) - A. */
1039 (negate (plus:c @0 negate_expr_p@1))
1040 (if (!HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type))
1041 && !HONOR_SIGNED_ZEROS (element_mode (type)))
1042 (minus (negate @1) @0)))
1044 /* -(A - B) -> B - A. */
1046 (negate (minus @0 @1))
1047 (if ((ANY_INTEGRAL_TYPE_P (type) && !TYPE_OVERFLOW_SANITIZED (type))
1048 || (FLOAT_TYPE_P (type)
1049 && !HONOR_SIGN_DEPENDENT_ROUNDING (type)
1050 && !HONOR_SIGNED_ZEROS (type)))
1053 (negate (pointer_diff @0 @1))
1054 (if (TYPE_OVERFLOW_UNDEFINED (type))
1055 (pointer_diff @1 @0)))
1057 /* A - B -> A + (-B) if B is easily negatable. */
1059 (minus @0 negate_expr_p@1)
1060 (if (!FIXED_POINT_TYPE_P (type))
1061 (plus @0 (negate @1))))
1063 /* Try to fold (type) X op CST -> (type) (X op ((type-x) CST))
1065 For bitwise binary operations apply operand conversions to the
1066 binary operation result instead of to the operands. This allows
1067 to combine successive conversions and bitwise binary operations.
1068 We combine the above two cases by using a conditional convert. */
1069 (for bitop (bit_and bit_ior bit_xor)
1071 (bitop (convert @0) (convert? @1))
1072 (if (((TREE_CODE (@1) == INTEGER_CST
1073 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
1074 && int_fits_type_p (@1, TREE_TYPE (@0)))
1075 || types_match (@0, @1))
1076 /* ??? This transform conflicts with fold-const.c doing
1077 Convert (T)(x & c) into (T)x & (T)c, if c is an integer
1078 constants (if x has signed type, the sign bit cannot be set
1079 in c). This folds extension into the BIT_AND_EXPR.
1080 Restrict it to GIMPLE to avoid endless recursions. */
1081 && (bitop != BIT_AND_EXPR || GIMPLE)
1082 && (/* That's a good idea if the conversion widens the operand, thus
1083 after hoisting the conversion the operation will be narrower. */
1084 TYPE_PRECISION (TREE_TYPE (@0)) < TYPE_PRECISION (type)
1085 /* It's also a good idea if the conversion is to a non-integer
1087 || GET_MODE_CLASS (TYPE_MODE (type)) != MODE_INT
1088 /* Or if the precision of TO is not the same as the precision
1090 || !type_has_mode_precision_p (type)))
1091 (convert (bitop @0 (convert @1))))))
1093 (for bitop (bit_and bit_ior)
1094 rbitop (bit_ior bit_and)
1095 /* (x | y) & x -> x */
1096 /* (x & y) | x -> x */
1098 (bitop:c (rbitop:c @0 @1) @0)
1100 /* (~x | y) & x -> x & y */
1101 /* (~x & y) | x -> x | y */
1103 (bitop:c (rbitop:c (bit_not @0) @1) @0)
1106 /* (x | CST1) & CST2 -> (x & CST2) | (CST1 & CST2) */
1108 (bit_and (bit_ior @0 CONSTANT_CLASS_P@1) CONSTANT_CLASS_P@2)
1109 (bit_ior (bit_and @0 @2) (bit_and @1 @2)))
1111 /* Combine successive equal operations with constants. */
1112 (for bitop (bit_and bit_ior bit_xor)
1114 (bitop (bitop @0 CONSTANT_CLASS_P@1) CONSTANT_CLASS_P@2)
1115 (if (!CONSTANT_CLASS_P (@0))
1116 /* This is the canonical form regardless of whether (bitop @1 @2) can be
1117 folded to a constant. */
1118 (bitop @0 (bitop @1 @2))
1119 /* In this case we have three constants and (bitop @0 @1) doesn't fold
1120 to a constant. This can happen if @0 or @1 is a POLY_INT_CST and if
1121 the values involved are such that the operation can't be decided at
1122 compile time. Try folding one of @0 or @1 with @2 to see whether
1123 that combination can be decided at compile time.
1125 Keep the existing form if both folds fail, to avoid endless
1127 (with { tree cst1 = const_binop (bitop, type, @0, @2); }
1129 (bitop @1 { cst1; })
1130 (with { tree cst2 = const_binop (bitop, type, @1, @2); }
1132 (bitop @0 { cst2; }))))))))
1134 /* Try simple folding for X op !X, and X op X with the help
1135 of the truth_valued_p and logical_inverted_value predicates. */
1136 (match truth_valued_p
1138 (if (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) == 1)))
1139 (for op (tcc_comparison truth_and truth_andif truth_or truth_orif truth_xor)
1140 (match truth_valued_p
1142 (match truth_valued_p
1145 (match (logical_inverted_value @0)
1147 (match (logical_inverted_value @0)
1148 (bit_not truth_valued_p@0))
1149 (match (logical_inverted_value @0)
1150 (eq @0 integer_zerop))
1151 (match (logical_inverted_value @0)
1152 (ne truth_valued_p@0 integer_truep))
1153 (match (logical_inverted_value @0)
1154 (bit_xor truth_valued_p@0 integer_truep))
1158 (bit_and:c @0 (logical_inverted_value @0))
1159 { build_zero_cst (type); })
1160 /* X | !X and X ^ !X -> 1, , if X is truth-valued. */
1161 (for op (bit_ior bit_xor)
1163 (op:c truth_valued_p@0 (logical_inverted_value @0))
1164 { constant_boolean_node (true, type); }))
1165 /* X ==/!= !X is false/true. */
1168 (op:c truth_valued_p@0 (logical_inverted_value @0))
1169 { constant_boolean_node (op == NE_EXPR ? true : false, type); }))
1173 (bit_not (bit_not @0))
1176 /* Convert ~ (-A) to A - 1. */
1178 (bit_not (convert? (negate @0)))
1179 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
1180 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
1181 (convert (minus @0 { build_each_one_cst (TREE_TYPE (@0)); }))))
1183 /* Convert - (~A) to A + 1. */
1185 (negate (nop_convert (bit_not @0)))
1186 (plus (view_convert @0) { build_each_one_cst (type); }))
1188 /* Convert ~ (A - 1) or ~ (A + -1) to -A. */
1190 (bit_not (convert? (minus @0 integer_each_onep)))
1191 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
1192 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
1193 (convert (negate @0))))
1195 (bit_not (convert? (plus @0 integer_all_onesp)))
1196 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
1197 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
1198 (convert (negate @0))))
1200 /* Part of convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */
1202 (bit_not (convert? (bit_xor @0 INTEGER_CST@1)))
1203 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1204 (convert (bit_xor @0 (bit_not @1)))))
1206 (bit_not (convert? (bit_xor:c (bit_not @0) @1)))
1207 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1208 (convert (bit_xor @0 @1))))
1210 /* Otherwise prefer ~(X ^ Y) to ~X ^ Y as more canonical. */
1212 (bit_xor:c (nop_convert:s (bit_not:s @0)) @1)
1213 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1214 (bit_not (bit_xor (view_convert @0) @1))))
1216 /* (x & ~m) | (y & m) -> ((x ^ y) & m) ^ x */
1218 (bit_ior:c (bit_and:cs @0 (bit_not @2)) (bit_and:cs @1 @2))
1219 (bit_xor (bit_and (bit_xor @0 @1) @2) @0))
1221 /* Fold A - (A & B) into ~B & A. */
1223 (minus (convert1? @0) (convert2?:s (bit_and:cs @@0 @1)))
1224 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
1225 && tree_nop_conversion_p (type, TREE_TYPE (@1)))
1226 (convert (bit_and (bit_not @1) @0))))
1228 /* (m1 CMP m2) * d -> (m1 CMP m2) ? d : 0 */
1229 (for cmp (gt lt ge le)
1231 (mult (convert (cmp @0 @1)) @2)
1232 (cond (cmp @0 @1) @2 { build_zero_cst (type); })))
1234 /* For integral types with undefined overflow and C != 0 fold
1235 x * C EQ/NE y * C into x EQ/NE y. */
1238 (cmp (mult:c @0 @1) (mult:c @2 @1))
1239 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
1240 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
1241 && tree_expr_nonzero_p (@1))
1244 /* For integral types with wrapping overflow and C odd fold
1245 x * C EQ/NE y * C into x EQ/NE y. */
1248 (cmp (mult @0 INTEGER_CST@1) (mult @2 @1))
1249 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
1250 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))
1251 && (TREE_INT_CST_LOW (@1) & 1) != 0)
1254 /* For integral types with undefined overflow and C != 0 fold
1255 x * C RELOP y * C into:
1257 x RELOP y for nonnegative C
1258 y RELOP x for negative C */
1259 (for cmp (lt gt le ge)
1261 (cmp (mult:c @0 @1) (mult:c @2 @1))
1262 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
1263 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
1264 (if (tree_expr_nonnegative_p (@1) && tree_expr_nonzero_p (@1))
1266 (if (TREE_CODE (@1) == INTEGER_CST
1267 && wi::neg_p (wi::to_wide (@1), TYPE_SIGN (TREE_TYPE (@1))))
1270 /* (X - 1U) <= INT_MAX-1U into (int) X > 0. */
1274 (cmp (plus @0 integer_minus_onep@1) INTEGER_CST@2)
1275 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1276 && TYPE_UNSIGNED (TREE_TYPE (@0))
1277 && TYPE_PRECISION (TREE_TYPE (@0)) > 1
1278 && (wi::to_wide (@2)
1279 == wi::max_value (TYPE_PRECISION (TREE_TYPE (@0)), SIGNED) - 1))
1280 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
1281 (icmp (convert:stype @0) { build_int_cst (stype, 0); })))))
1283 /* X / 4 < Y / 4 iff X < Y when the division is known to be exact. */
1284 (for cmp (simple_comparison)
1286 (cmp (exact_div @0 INTEGER_CST@2) (exact_div @1 @2))
1287 (if (wi::gt_p (wi::to_wide (@2), 0, TYPE_SIGN (TREE_TYPE (@2))))
1290 /* X / C1 op C2 into a simple range test. */
1291 (for cmp (simple_comparison)
1293 (cmp (trunc_div:s @0 INTEGER_CST@1) INTEGER_CST@2)
1294 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1295 && integer_nonzerop (@1)
1296 && !TREE_OVERFLOW (@1)
1297 && !TREE_OVERFLOW (@2))
1298 (with { tree lo, hi; bool neg_overflow;
1299 enum tree_code code = fold_div_compare (cmp, @1, @2, &lo, &hi,
1302 (if (code == LT_EXPR || code == GE_EXPR)
1303 (if (TREE_OVERFLOW (lo))
1304 { build_int_cst (type, (code == LT_EXPR) ^ neg_overflow); }
1305 (if (code == LT_EXPR)
1308 (if (code == LE_EXPR || code == GT_EXPR)
1309 (if (TREE_OVERFLOW (hi))
1310 { build_int_cst (type, (code == LE_EXPR) ^ neg_overflow); }
1311 (if (code == LE_EXPR)
1315 { build_int_cst (type, code == NE_EXPR); })
1316 (if (code == EQ_EXPR && !hi)
1318 (if (code == EQ_EXPR && !lo)
1320 (if (code == NE_EXPR && !hi)
1322 (if (code == NE_EXPR && !lo)
1325 { build_range_check (UNKNOWN_LOCATION, type, @0, code == EQ_EXPR,
1329 tree etype = range_check_type (TREE_TYPE (@0));
1332 if (! TYPE_UNSIGNED (etype))
1333 etype = unsigned_type_for (etype);
1334 hi = fold_convert (etype, hi);
1335 lo = fold_convert (etype, lo);
1336 hi = const_binop (MINUS_EXPR, etype, hi, lo);
1339 (if (etype && hi && !TREE_OVERFLOW (hi))
1340 (if (code == EQ_EXPR)
1341 (le (minus (convert:etype @0) { lo; }) { hi; })
1342 (gt (minus (convert:etype @0) { lo; }) { hi; })))))))))
1344 /* X + Z < Y + Z is the same as X < Y when there is no overflow. */
1345 (for op (lt le ge gt)
1347 (op (plus:c @0 @2) (plus:c @1 @2))
1348 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1349 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
1351 /* For equality and subtraction, this is also true with wrapping overflow. */
1352 (for op (eq ne minus)
1354 (op (plus:c @0 @2) (plus:c @1 @2))
1355 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1356 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
1357 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
1360 /* X - Z < Y - Z is the same as X < Y when there is no overflow. */
1361 (for op (lt le ge gt)
1363 (op (minus @0 @2) (minus @1 @2))
1364 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1365 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
1367 /* For equality and subtraction, this is also true with wrapping overflow. */
1368 (for op (eq ne minus)
1370 (op (minus @0 @2) (minus @1 @2))
1371 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1372 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
1373 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
1375 /* And for pointers... */
1376 (for op (simple_comparison)
1378 (op (pointer_diff@3 @0 @2) (pointer_diff @1 @2))
1379 (if (!TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
1382 (minus (pointer_diff@3 @0 @2) (pointer_diff @1 @2))
1383 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@3))
1384 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
1385 (pointer_diff @0 @1)))
1387 /* Z - X < Z - Y is the same as Y < X when there is no overflow. */
1388 (for op (lt le ge gt)
1390 (op (minus @2 @0) (minus @2 @1))
1391 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1392 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
1394 /* For equality and subtraction, this is also true with wrapping overflow. */
1395 (for op (eq ne minus)
1397 (op (minus @2 @0) (minus @2 @1))
1398 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1399 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
1400 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
1402 /* And for pointers... */
1403 (for op (simple_comparison)
1405 (op (pointer_diff@3 @2 @0) (pointer_diff @2 @1))
1406 (if (!TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
1409 (minus (pointer_diff@3 @2 @0) (pointer_diff @2 @1))
1410 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@3))
1411 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
1412 (pointer_diff @1 @0)))
1414 /* X + Y < Y is the same as X < 0 when there is no overflow. */
1415 (for op (lt le gt ge)
1417 (op:c (plus:c@2 @0 @1) @1)
1418 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1419 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
1420 && (CONSTANT_CLASS_P (@0) || single_use (@2)))
1421 (op @0 { build_zero_cst (TREE_TYPE (@0)); }))))
1422 /* For equality, this is also true with wrapping overflow. */
1425 (op:c (nop_convert@3 (plus:c@2 @0 (convert1? @1))) (convert2? @1))
1426 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1427 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
1428 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
1429 && (CONSTANT_CLASS_P (@0) || (single_use (@2) && single_use (@3)))
1430 && tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@2))
1431 && tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@1)))
1432 (op @0 { build_zero_cst (TREE_TYPE (@0)); })))
1434 (op:c (nop_convert@3 (pointer_plus@2 (convert1? @0) @1)) (convert2? @0))
1435 (if (tree_nop_conversion_p (TREE_TYPE (@2), TREE_TYPE (@0))
1436 && tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0))
1437 && (CONSTANT_CLASS_P (@1) || (single_use (@2) && single_use (@3))))
1438 (op @1 { build_zero_cst (TREE_TYPE (@1)); }))))
1440 /* X - Y < X is the same as Y > 0 when there is no overflow.
1441 For equality, this is also true with wrapping overflow. */
1442 (for op (simple_comparison)
1444 (op:c @0 (minus@2 @0 @1))
1445 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1446 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
1447 || ((op == EQ_EXPR || op == NE_EXPR)
1448 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
1449 && (CONSTANT_CLASS_P (@1) || single_use (@2)))
1450 (op @1 { build_zero_cst (TREE_TYPE (@1)); }))))
1453 * (X / Y) == 0 -> X < Y if X, Y are unsigned.
1454 * (X / Y) != 0 -> X >= Y, if X, Y are unsigned.
1459 (cmp (trunc_div @0 @1) integer_zerop)
1460 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
1461 && (VECTOR_TYPE_P (type) || !VECTOR_TYPE_P (TREE_TYPE (@0))))
1464 /* X == C - X can never be true if C is odd. */
1467 (cmp:c (convert? @0) (convert1? (minus INTEGER_CST@1 (convert2? @0))))
1468 (if (TREE_INT_CST_LOW (@1) & 1)
1469 { constant_boolean_node (cmp == NE_EXPR, type); })))
1471 /* Arguments on which one can call get_nonzero_bits to get the bits
1473 (match with_possible_nonzero_bits
1475 (match with_possible_nonzero_bits
1477 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))))
1478 /* Slightly extended version, do not make it recursive to keep it cheap. */
1479 (match (with_possible_nonzero_bits2 @0)
1480 with_possible_nonzero_bits@0)
1481 (match (with_possible_nonzero_bits2 @0)
1482 (bit_and:c with_possible_nonzero_bits@0 @2))
1484 /* Same for bits that are known to be set, but we do not have
1485 an equivalent to get_nonzero_bits yet. */
1486 (match (with_certain_nonzero_bits2 @0)
1488 (match (with_certain_nonzero_bits2 @0)
1489 (bit_ior @1 INTEGER_CST@0))
1491 /* X == C (or X & Z == Y | C) is impossible if ~nonzero(X) & C != 0. */
1494 (cmp:c (with_possible_nonzero_bits2 @0) (with_certain_nonzero_bits2 @1))
1495 (if (wi::bit_and_not (wi::to_wide (@1), get_nonzero_bits (@0)) != 0)
1496 { constant_boolean_node (cmp == NE_EXPR, type); })))
1498 /* ((X inner_op C0) outer_op C1)
1499 With X being a tree where value_range has reasoned certain bits to always be
1500 zero throughout its computed value range,
1501 inner_op = {|,^}, outer_op = {|,^} and inner_op != outer_op
1502 where zero_mask has 1's for all bits that are sure to be 0 in
1504 if (inner_op == '^') C0 &= ~C1;
1505 if ((C0 & ~zero_mask) == 0) then emit (X outer_op (C0 outer_op C1)
1506 if ((C1 & ~zero_mask) == 0) then emit (X inner_op (C0 outer_op C1)
1508 (for inner_op (bit_ior bit_xor)
1509 outer_op (bit_xor bit_ior)
1512 (inner_op:s @2 INTEGER_CST@0) INTEGER_CST@1)
1516 wide_int zero_mask_not;
1520 if (TREE_CODE (@2) == SSA_NAME)
1521 zero_mask_not = get_nonzero_bits (@2);
1525 if (inner_op == BIT_XOR_EXPR)
1527 C0 = wi::bit_and_not (wi::to_wide (@0), wi::to_wide (@1));
1528 cst_emit = C0 | wi::to_wide (@1);
1532 C0 = wi::to_wide (@0);
1533 cst_emit = C0 ^ wi::to_wide (@1);
1536 (if (!fail && (C0 & zero_mask_not) == 0)
1537 (outer_op @2 { wide_int_to_tree (type, cst_emit); })
1538 (if (!fail && (wi::to_wide (@1) & zero_mask_not) == 0)
1539 (inner_op @2 { wide_int_to_tree (type, cst_emit); }))))))
1541 /* Associate (p +p off1) +p off2 as (p +p (off1 + off2)). */
1543 (pointer_plus (pointer_plus:s @0 @1) @3)
1544 (pointer_plus @0 (plus @1 @3)))
1550 tem4 = (unsigned long) tem3;
1555 (pointer_plus @0 (convert?@2 (minus@3 (convert @1) (convert @0))))
1556 /* Conditionally look through a sign-changing conversion. */
1557 (if (TYPE_PRECISION (TREE_TYPE (@2)) == TYPE_PRECISION (TREE_TYPE (@3))
1558 && ((GIMPLE && useless_type_conversion_p (type, TREE_TYPE (@1)))
1559 || (GENERIC && type == TREE_TYPE (@1))))
1562 (pointer_plus @0 (convert?@2 (pointer_diff@3 @1 @@0)))
1563 (if (TYPE_PRECISION (TREE_TYPE (@2)) >= TYPE_PRECISION (TREE_TYPE (@3)))
1567 tem = (sizetype) ptr;
1571 and produce the simpler and easier to analyze with respect to alignment
1572 ... = ptr & ~algn; */
1574 (pointer_plus @0 (negate (bit_and (convert @0) INTEGER_CST@1)))
1575 (with { tree algn = wide_int_to_tree (TREE_TYPE (@0), ~wi::to_wide (@1)); }
1576 (bit_and @0 { algn; })))
1578 /* Try folding difference of addresses. */
1580 (minus (convert ADDR_EXPR@0) (convert @1))
1581 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1582 (with { poly_int64 diff; }
1583 (if (ptr_difference_const (@0, @1, &diff))
1584 { build_int_cst_type (type, diff); }))))
1586 (minus (convert @0) (convert ADDR_EXPR@1))
1587 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1588 (with { poly_int64 diff; }
1589 (if (ptr_difference_const (@0, @1, &diff))
1590 { build_int_cst_type (type, diff); }))))
1592 (pointer_diff (convert?@2 ADDR_EXPR@0) (convert?@3 @1))
1593 (if (tree_nop_conversion_p (TREE_TYPE(@2), TREE_TYPE (@0))
1594 && tree_nop_conversion_p (TREE_TYPE(@3), TREE_TYPE (@1)))
1595 (with { poly_int64 diff; }
1596 (if (ptr_difference_const (@0, @1, &diff))
1597 { build_int_cst_type (type, diff); }))))
1599 (pointer_diff (convert?@2 @0) (convert?@3 ADDR_EXPR@1))
1600 (if (tree_nop_conversion_p (TREE_TYPE(@2), TREE_TYPE (@0))
1601 && tree_nop_conversion_p (TREE_TYPE(@3), TREE_TYPE (@1)))
1602 (with { poly_int64 diff; }
1603 (if (ptr_difference_const (@0, @1, &diff))
1604 { build_int_cst_type (type, diff); }))))
1606 /* If arg0 is derived from the address of an object or function, we may
1607 be able to fold this expression using the object or function's
1610 (bit_and (convert? @0) INTEGER_CST@1)
1611 (if (POINTER_TYPE_P (TREE_TYPE (@0))
1612 && tree_nop_conversion_p (type, TREE_TYPE (@0)))
1616 unsigned HOST_WIDE_INT bitpos;
1617 get_pointer_alignment_1 (@0, &align, &bitpos);
1619 (if (wi::ltu_p (wi::to_wide (@1), align / BITS_PER_UNIT))
1620 { wide_int_to_tree (type, (wi::to_wide (@1)
1621 & (bitpos / BITS_PER_UNIT))); }))))
1624 /* We can't reassociate at all for saturating types. */
1625 (if (!TYPE_SATURATING (type))
1627 /* Contract negates. */
1628 /* A + (-B) -> A - B */
1630 (plus:c @0 (convert? (negate @1)))
1631 /* Apply STRIP_NOPS on the negate. */
1632 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
1633 && !TYPE_OVERFLOW_SANITIZED (type))
1637 if (INTEGRAL_TYPE_P (type)
1638 && TYPE_OVERFLOW_WRAPS (type) != TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
1639 t1 = TYPE_OVERFLOW_WRAPS (type) ? type : TREE_TYPE (@1);
1641 (convert (minus (convert:t1 @0) (convert:t1 @1))))))
1642 /* A - (-B) -> A + B */
1644 (minus @0 (convert? (negate @1)))
1645 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
1646 && !TYPE_OVERFLOW_SANITIZED (type))
1650 if (INTEGRAL_TYPE_P (type)
1651 && TYPE_OVERFLOW_WRAPS (type) != TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
1652 t1 = TYPE_OVERFLOW_WRAPS (type) ? type : TREE_TYPE (@1);
1654 (convert (plus (convert:t1 @0) (convert:t1 @1))))))
1656 Sign-extension is ok except for INT_MIN, which thankfully cannot
1657 happen without overflow. */
1659 (negate (convert (negate @1)))
1660 (if (INTEGRAL_TYPE_P (type)
1661 && (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@1))
1662 || (!TYPE_UNSIGNED (TREE_TYPE (@1))
1663 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))))
1664 && !TYPE_OVERFLOW_SANITIZED (type)
1665 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@1)))
1668 (negate (convert negate_expr_p@1))
1669 (if (SCALAR_FLOAT_TYPE_P (type)
1670 && ((DECIMAL_FLOAT_TYPE_P (type)
1671 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@1))
1672 && TYPE_PRECISION (type) >= TYPE_PRECISION (TREE_TYPE (@1)))
1673 || !HONOR_SIGN_DEPENDENT_ROUNDING (type)))
1674 (convert (negate @1))))
1676 (negate (nop_convert (negate @1)))
1677 (if (!TYPE_OVERFLOW_SANITIZED (type)
1678 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@1)))
1681 /* We can't reassociate floating-point unless -fassociative-math
1682 or fixed-point plus or minus because of saturation to +-Inf. */
1683 (if ((!FLOAT_TYPE_P (type) || flag_associative_math)
1684 && !FIXED_POINT_TYPE_P (type))
1686 /* Match patterns that allow contracting a plus-minus pair
1687 irrespective of overflow issues. */
1688 /* (A +- B) - A -> +- B */
1689 /* (A +- B) -+ B -> A */
1690 /* A - (A +- B) -> -+ B */
1691 /* A +- (B -+ A) -> +- B */
1693 (minus (plus:c @0 @1) @0)
1696 (minus (minus @0 @1) @0)
1699 (plus:c (minus @0 @1) @1)
1702 (minus @0 (plus:c @0 @1))
1705 (minus @0 (minus @0 @1))
1707 /* (A +- B) + (C - A) -> C +- B */
1708 /* (A + B) - (A - C) -> B + C */
1709 /* More cases are handled with comparisons. */
1711 (plus:c (plus:c @0 @1) (minus @2 @0))
1714 (plus:c (minus @0 @1) (minus @2 @0))
1717 (plus:c (pointer_diff @0 @1) (pointer_diff @2 @0))
1718 (if (TYPE_OVERFLOW_UNDEFINED (type)
1719 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0)))
1720 (pointer_diff @2 @1)))
1722 (minus (plus:c @0 @1) (minus @0 @2))
1725 /* (A +- CST1) +- CST2 -> A + CST3
1726 Use view_convert because it is safe for vectors and equivalent for
1728 (for outer_op (plus minus)
1729 (for inner_op (plus minus)
1730 neg_inner_op (minus plus)
1732 (outer_op (nop_convert (inner_op @0 CONSTANT_CLASS_P@1))
1734 /* If one of the types wraps, use that one. */
1735 (if (!ANY_INTEGRAL_TYPE_P (type) || TYPE_OVERFLOW_WRAPS (type))
1736 (if (outer_op == PLUS_EXPR)
1737 (plus (view_convert @0) (inner_op @2 (view_convert @1)))
1738 (minus (view_convert @0) (neg_inner_op @2 (view_convert @1))))
1739 (if (!ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1740 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
1741 (if (outer_op == PLUS_EXPR)
1742 (view_convert (plus @0 (inner_op (view_convert @2) @1)))
1743 (view_convert (minus @0 (neg_inner_op (view_convert @2) @1))))
1744 /* If the constant operation overflows we cannot do the transform
1745 directly as we would introduce undefined overflow, for example
1746 with (a - 1) + INT_MIN. */
1747 (if (types_match (type, @0))
1748 (with { tree cst = const_binop (outer_op == inner_op
1749 ? PLUS_EXPR : MINUS_EXPR,
1751 (if (cst && !TREE_OVERFLOW (cst))
1752 (inner_op @0 { cst; } )
1753 /* X+INT_MAX+1 is X-INT_MIN. */
1754 (if (INTEGRAL_TYPE_P (type) && cst
1755 && wi::to_wide (cst) == wi::min_value (type))
1756 (neg_inner_op @0 { wide_int_to_tree (type, wi::to_wide (cst)); })
1757 /* Last resort, use some unsigned type. */
1758 (with { tree utype = unsigned_type_for (type); }
1759 (view_convert (inner_op
1760 (view_convert:utype @0)
1762 { drop_tree_overflow (cst); })))))))))))))
1764 /* (CST1 - A) +- CST2 -> CST3 - A */
1765 (for outer_op (plus minus)
1767 (outer_op (minus CONSTANT_CLASS_P@1 @0) CONSTANT_CLASS_P@2)
1768 (with { tree cst = const_binop (outer_op, type, @1, @2); }
1769 (if (cst && !TREE_OVERFLOW (cst))
1770 (minus { cst; } @0)))))
1772 /* CST1 - (CST2 - A) -> CST3 + A */
1774 (minus CONSTANT_CLASS_P@1 (minus CONSTANT_CLASS_P@2 @0))
1775 (with { tree cst = const_binop (MINUS_EXPR, type, @1, @2); }
1776 (if (cst && !TREE_OVERFLOW (cst))
1777 (plus { cst; } @0))))
1781 (plus:c (bit_not @0) @0)
1782 (if (!TYPE_OVERFLOW_TRAPS (type))
1783 { build_all_ones_cst (type); }))
1787 (plus (convert? (bit_not @0)) integer_each_onep)
1788 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1789 (negate (convert @0))))
1793 (minus (convert? (negate @0)) integer_each_onep)
1794 (if (!TYPE_OVERFLOW_TRAPS (type)
1795 && tree_nop_conversion_p (type, TREE_TYPE (@0)))
1796 (bit_not (convert @0))))
1800 (minus integer_all_onesp @0)
1803 /* (T)(P + A) - (T)P -> (T) A */
1805 (minus (convert (plus:c @@0 @1))
1807 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
1808 /* For integer types, if A has a smaller type
1809 than T the result depends on the possible
1811 E.g. T=size_t, A=(unsigned)429497295, P>0.
1812 However, if an overflow in P + A would cause
1813 undefined behavior, we can assume that there
1815 || (INTEGRAL_TYPE_P (TREE_TYPE (@1))
1816 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))))
1819 (minus (convert (pointer_plus @@0 @1))
1821 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
1822 /* For pointer types, if the conversion of A to the
1823 final type requires a sign- or zero-extension,
1824 then we have to punt - it is not defined which
1826 || (POINTER_TYPE_P (TREE_TYPE (@0))
1827 && TREE_CODE (@1) == INTEGER_CST
1828 && tree_int_cst_sign_bit (@1) == 0))
1831 (pointer_diff (pointer_plus @@0 @1) @0)
1832 /* The second argument of pointer_plus must be interpreted as signed, and
1833 thus sign-extended if necessary. */
1834 (with { tree stype = signed_type_for (TREE_TYPE (@1)); }
1835 (convert (convert:stype @1))))
1837 /* (T)P - (T)(P + A) -> -(T) A */
1839 (minus (convert? @0)
1840 (convert (plus:c @@0 @1)))
1841 (if (INTEGRAL_TYPE_P (type)
1842 && TYPE_OVERFLOW_UNDEFINED (type)
1843 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
1844 (with { tree utype = unsigned_type_for (type); }
1845 (convert (negate (convert:utype @1))))
1846 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
1847 /* For integer types, if A has a smaller type
1848 than T the result depends on the possible
1850 E.g. T=size_t, A=(unsigned)429497295, P>0.
1851 However, if an overflow in P + A would cause
1852 undefined behavior, we can assume that there
1854 || (INTEGRAL_TYPE_P (TREE_TYPE (@1))
1855 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))))
1856 (negate (convert @1)))))
1859 (convert (pointer_plus @@0 @1)))
1860 (if (INTEGRAL_TYPE_P (type)
1861 && TYPE_OVERFLOW_UNDEFINED (type)
1862 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
1863 (with { tree utype = unsigned_type_for (type); }
1864 (convert (negate (convert:utype @1))))
1865 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
1866 /* For pointer types, if the conversion of A to the
1867 final type requires a sign- or zero-extension,
1868 then we have to punt - it is not defined which
1870 || (POINTER_TYPE_P (TREE_TYPE (@0))
1871 && TREE_CODE (@1) == INTEGER_CST
1872 && tree_int_cst_sign_bit (@1) == 0))
1873 (negate (convert @1)))))
1875 (pointer_diff @0 (pointer_plus @@0 @1))
1876 /* The second argument of pointer_plus must be interpreted as signed, and
1877 thus sign-extended if necessary. */
1878 (with { tree stype = signed_type_for (TREE_TYPE (@1)); }
1879 (negate (convert (convert:stype @1)))))
1881 /* (T)(P + A) - (T)(P + B) -> (T)A - (T)B */
1883 (minus (convert (plus:c @@0 @1))
1884 (convert (plus:c @0 @2)))
1885 (if (INTEGRAL_TYPE_P (type)
1886 && TYPE_OVERFLOW_UNDEFINED (type)
1887 && element_precision (type) <= element_precision (TREE_TYPE (@1))
1888 && element_precision (type) <= element_precision (TREE_TYPE (@2)))
1889 (with { tree utype = unsigned_type_for (type); }
1890 (convert (minus (convert:utype @1) (convert:utype @2))))
1891 (if (((element_precision (type) <= element_precision (TREE_TYPE (@1)))
1892 == (element_precision (type) <= element_precision (TREE_TYPE (@2))))
1893 && (element_precision (type) <= element_precision (TREE_TYPE (@1))
1894 /* For integer types, if A has a smaller type
1895 than T the result depends on the possible
1897 E.g. T=size_t, A=(unsigned)429497295, P>0.
1898 However, if an overflow in P + A would cause
1899 undefined behavior, we can assume that there
1901 || (INTEGRAL_TYPE_P (TREE_TYPE (@1))
1902 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
1903 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))
1904 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@2)))))
1905 (minus (convert @1) (convert @2)))))
1907 (minus (convert (pointer_plus @@0 @1))
1908 (convert (pointer_plus @0 @2)))
1909 (if (INTEGRAL_TYPE_P (type)
1910 && TYPE_OVERFLOW_UNDEFINED (type)
1911 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
1912 (with { tree utype = unsigned_type_for (type); }
1913 (convert (minus (convert:utype @1) (convert:utype @2))))
1914 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
1915 /* For pointer types, if the conversion of A to the
1916 final type requires a sign- or zero-extension,
1917 then we have to punt - it is not defined which
1919 || (POINTER_TYPE_P (TREE_TYPE (@0))
1920 && TREE_CODE (@1) == INTEGER_CST
1921 && tree_int_cst_sign_bit (@1) == 0
1922 && TREE_CODE (@2) == INTEGER_CST
1923 && tree_int_cst_sign_bit (@2) == 0))
1924 (minus (convert @1) (convert @2)))))
1926 (pointer_diff (pointer_plus @@0 @1) (pointer_plus @0 @2))
1927 /* The second argument of pointer_plus must be interpreted as signed, and
1928 thus sign-extended if necessary. */
1929 (with { tree stype = signed_type_for (TREE_TYPE (@1)); }
1930 (minus (convert (convert:stype @1)) (convert (convert:stype @2)))))))
1933 /* Simplifications of MIN_EXPR, MAX_EXPR, fmin() and fmax(). */
1935 (for minmax (min max FMIN_ALL FMAX_ALL)
1939 /* min(max(x,y),y) -> y. */
1941 (min:c (max:c @0 @1) @1)
1943 /* max(min(x,y),y) -> y. */
1945 (max:c (min:c @0 @1) @1)
1947 /* max(a,-a) -> abs(a). */
1949 (max:c @0 (negate @0))
1950 (if (TREE_CODE (type) != COMPLEX_TYPE
1951 && (! ANY_INTEGRAL_TYPE_P (type)
1952 || TYPE_OVERFLOW_UNDEFINED (type)))
1954 /* min(a,-a) -> -abs(a). */
1956 (min:c @0 (negate @0))
1957 (if (TREE_CODE (type) != COMPLEX_TYPE
1958 && (! ANY_INTEGRAL_TYPE_P (type)
1959 || TYPE_OVERFLOW_UNDEFINED (type)))
1964 (if (INTEGRAL_TYPE_P (type)
1965 && TYPE_MIN_VALUE (type)
1966 && operand_equal_p (@1, TYPE_MIN_VALUE (type), OEP_ONLY_CONST))
1968 (if (INTEGRAL_TYPE_P (type)
1969 && TYPE_MAX_VALUE (type)
1970 && operand_equal_p (@1, TYPE_MAX_VALUE (type), OEP_ONLY_CONST))
1975 (if (INTEGRAL_TYPE_P (type)
1976 && TYPE_MAX_VALUE (type)
1977 && operand_equal_p (@1, TYPE_MAX_VALUE (type), OEP_ONLY_CONST))
1979 (if (INTEGRAL_TYPE_P (type)
1980 && TYPE_MIN_VALUE (type)
1981 && operand_equal_p (@1, TYPE_MIN_VALUE (type), OEP_ONLY_CONST))
1984 /* max (a, a + CST) -> a + CST where CST is positive. */
1985 /* max (a, a + CST) -> a where CST is negative. */
1987 (max:c @0 (plus@2 @0 INTEGER_CST@1))
1988 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
1989 (if (tree_int_cst_sgn (@1) > 0)
1993 /* min (a, a + CST) -> a where CST is positive. */
1994 /* min (a, a + CST) -> a + CST where CST is negative. */
1996 (min:c @0 (plus@2 @0 INTEGER_CST@1))
1997 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
1998 (if (tree_int_cst_sgn (@1) > 0)
2002 /* (convert (minmax ((convert (x) c)))) -> minmax (x c) if x is promoted
2003 and the outer convert demotes the expression back to x's type. */
2004 (for minmax (min max)
2006 (convert (minmax@0 (convert @1) INTEGER_CST@2))
2007 (if (INTEGRAL_TYPE_P (type)
2008 && types_match (@1, type) && int_fits_type_p (@2, type)
2009 && TYPE_SIGN (TREE_TYPE (@0)) == TYPE_SIGN (type)
2010 && TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (type))
2011 (minmax @1 (convert @2)))))
2013 (for minmax (FMIN_ALL FMAX_ALL)
2014 /* If either argument is NaN, return the other one. Avoid the
2015 transformation if we get (and honor) a signalling NaN. */
2017 (minmax:c @0 REAL_CST@1)
2018 (if (real_isnan (TREE_REAL_CST_PTR (@1))
2019 && (!HONOR_SNANS (@1) || !TREE_REAL_CST (@1).signalling))
2021 /* Convert fmin/fmax to MIN_EXPR/MAX_EXPR. C99 requires these
2022 functions to return the numeric arg if the other one is NaN.
2023 MIN and MAX don't honor that, so only transform if -ffinite-math-only
2024 is set. C99 doesn't require -0.0 to be handled, so we don't have to
2025 worry about it either. */
2026 (if (flag_finite_math_only)
2033 /* min (-A, -B) -> -max (A, B) */
2034 (for minmax (min max FMIN_ALL FMAX_ALL)
2035 maxmin (max min FMAX_ALL FMIN_ALL)
2037 (minmax (negate:s@2 @0) (negate:s@3 @1))
2038 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
2039 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2040 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))))
2041 (negate (maxmin @0 @1)))))
2042 /* MIN (~X, ~Y) -> ~MAX (X, Y)
2043 MAX (~X, ~Y) -> ~MIN (X, Y) */
2044 (for minmax (min max)
2047 (minmax (bit_not:s@2 @0) (bit_not:s@3 @1))
2048 (bit_not (maxmin @0 @1))))
2050 /* MIN (X, Y) == X -> X <= Y */
2051 (for minmax (min min max max)
2055 (cmp:c (minmax:c @0 @1) @0)
2056 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0)))
2058 /* MIN (X, 5) == 0 -> X == 0
2059 MIN (X, 5) == 7 -> false */
2062 (cmp (min @0 INTEGER_CST@1) INTEGER_CST@2)
2063 (if (wi::lt_p (wi::to_wide (@1), wi::to_wide (@2),
2064 TYPE_SIGN (TREE_TYPE (@0))))
2065 { constant_boolean_node (cmp == NE_EXPR, type); }
2066 (if (wi::gt_p (wi::to_wide (@1), wi::to_wide (@2),
2067 TYPE_SIGN (TREE_TYPE (@0))))
2071 (cmp (max @0 INTEGER_CST@1) INTEGER_CST@2)
2072 (if (wi::gt_p (wi::to_wide (@1), wi::to_wide (@2),
2073 TYPE_SIGN (TREE_TYPE (@0))))
2074 { constant_boolean_node (cmp == NE_EXPR, type); }
2075 (if (wi::lt_p (wi::to_wide (@1), wi::to_wide (@2),
2076 TYPE_SIGN (TREE_TYPE (@0))))
2078 /* MIN (X, C1) < C2 -> X < C2 || C1 < C2 */
2079 (for minmax (min min max max min min max max )
2080 cmp (lt le gt ge gt ge lt le )
2081 comb (bit_ior bit_ior bit_ior bit_ior bit_and bit_and bit_and bit_and)
2083 (cmp (minmax @0 INTEGER_CST@1) INTEGER_CST@2)
2084 (comb (cmp @0 @2) (cmp @1 @2))))
2086 /* Simplifications of shift and rotates. */
2088 (for rotate (lrotate rrotate)
2090 (rotate integer_all_onesp@0 @1)
2093 /* Optimize -1 >> x for arithmetic right shifts. */
2095 (rshift integer_all_onesp@0 @1)
2096 (if (!TYPE_UNSIGNED (type)
2097 && tree_expr_nonnegative_p (@1))
2100 /* Optimize (x >> c) << c into x & (-1<<c). */
2102 (lshift (rshift @0 INTEGER_CST@1) @1)
2103 (if (wi::ltu_p (wi::to_wide (@1), element_precision (type)))
2104 (bit_and @0 (lshift { build_minus_one_cst (type); } @1))))
2106 /* Optimize (x << c) >> c into x & ((unsigned)-1 >> c) for unsigned
2109 (rshift (lshift @0 INTEGER_CST@1) @1)
2110 (if (TYPE_UNSIGNED (type)
2111 && (wi::ltu_p (wi::to_wide (@1), element_precision (type))))
2112 (bit_and @0 (rshift { build_minus_one_cst (type); } @1))))
2114 (for shiftrotate (lrotate rrotate lshift rshift)
2116 (shiftrotate @0 integer_zerop)
2119 (shiftrotate integer_zerop@0 @1)
2121 /* Prefer vector1 << scalar to vector1 << vector2
2122 if vector2 is uniform. */
2123 (for vec (VECTOR_CST CONSTRUCTOR)
2125 (shiftrotate @0 vec@1)
2126 (with { tree tem = uniform_vector_p (@1); }
2128 (shiftrotate @0 { tem; }))))))
2130 /* Simplify X << Y where Y's low width bits are 0 to X, as only valid
2131 Y is 0. Similarly for X >> Y. */
2133 (for shift (lshift rshift)
2135 (shift @0 SSA_NAME@1)
2136 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1)))
2138 int width = ceil_log2 (element_precision (TREE_TYPE (@0)));
2139 int prec = TYPE_PRECISION (TREE_TYPE (@1));
2141 (if ((get_nonzero_bits (@1) & wi::mask (width, false, prec)) == 0)
2145 /* Rewrite an LROTATE_EXPR by a constant into an
2146 RROTATE_EXPR by a new constant. */
2148 (lrotate @0 INTEGER_CST@1)
2149 (rrotate @0 { const_binop (MINUS_EXPR, TREE_TYPE (@1),
2150 build_int_cst (TREE_TYPE (@1),
2151 element_precision (type)), @1); }))
2153 /* Turn (a OP c1) OP c2 into a OP (c1+c2). */
2154 (for op (lrotate rrotate rshift lshift)
2156 (op (op @0 INTEGER_CST@1) INTEGER_CST@2)
2157 (with { unsigned int prec = element_precision (type); }
2158 (if (wi::ge_p (wi::to_wide (@1), 0, TYPE_SIGN (TREE_TYPE (@1)))
2159 && wi::lt_p (wi::to_wide (@1), prec, TYPE_SIGN (TREE_TYPE (@1)))
2160 && wi::ge_p (wi::to_wide (@2), 0, TYPE_SIGN (TREE_TYPE (@2)))
2161 && wi::lt_p (wi::to_wide (@2), prec, TYPE_SIGN (TREE_TYPE (@2))))
2162 (with { unsigned int low = (tree_to_uhwi (@1)
2163 + tree_to_uhwi (@2)); }
2164 /* Deal with a OP (c1 + c2) being undefined but (a OP c1) OP c2
2165 being well defined. */
2167 (if (op == LROTATE_EXPR || op == RROTATE_EXPR)
2168 (op @0 { build_int_cst (TREE_TYPE (@1), low % prec); })
2169 (if (TYPE_UNSIGNED (type) || op == LSHIFT_EXPR)
2170 { build_zero_cst (type); }
2171 (op @0 { build_int_cst (TREE_TYPE (@1), prec - 1); })))
2172 (op @0 { build_int_cst (TREE_TYPE (@1), low); })))))))
2175 /* ((1 << A) & 1) != 0 -> A == 0
2176 ((1 << A) & 1) == 0 -> A != 0 */
2180 (cmp (bit_and (lshift integer_onep @0) integer_onep) integer_zerop)
2181 (icmp @0 { build_zero_cst (TREE_TYPE (@0)); })))
2183 /* (CST1 << A) == CST2 -> A == ctz (CST2) - ctz (CST1)
2184 (CST1 << A) != CST2 -> A != ctz (CST2) - ctz (CST1)
2188 (cmp (lshift INTEGER_CST@0 @1) INTEGER_CST@2)
2189 (with { int cand = wi::ctz (wi::to_wide (@2)) - wi::ctz (wi::to_wide (@0)); }
2191 || (!integer_zerop (@2)
2192 && wi::lshift (wi::to_wide (@0), cand) != wi::to_wide (@2)))
2193 { constant_boolean_node (cmp == NE_EXPR, type); }
2194 (if (!integer_zerop (@2)
2195 && wi::lshift (wi::to_wide (@0), cand) == wi::to_wide (@2))
2196 (cmp @1 { build_int_cst (TREE_TYPE (@1), cand); }))))))
2198 /* Fold (X << C1) & C2 into (X << C1) & (C2 | ((1 << C1) - 1))
2199 (X >> C1) & C2 into (X >> C1) & (C2 | ~((type) -1 >> C1))
2200 if the new mask might be further optimized. */
2201 (for shift (lshift rshift)
2203 (bit_and (convert?:s@4 (shift:s@5 (convert1?@3 @0) INTEGER_CST@1))
2205 (if (tree_nop_conversion_p (TREE_TYPE (@4), TREE_TYPE (@5))
2206 && TYPE_PRECISION (type) <= HOST_BITS_PER_WIDE_INT
2207 && tree_fits_uhwi_p (@1)
2208 && tree_to_uhwi (@1) > 0
2209 && tree_to_uhwi (@1) < TYPE_PRECISION (type))
2212 unsigned int shiftc = tree_to_uhwi (@1);
2213 unsigned HOST_WIDE_INT mask = TREE_INT_CST_LOW (@2);
2214 unsigned HOST_WIDE_INT newmask, zerobits = 0;
2215 tree shift_type = TREE_TYPE (@3);
2218 if (shift == LSHIFT_EXPR)
2219 zerobits = ((HOST_WIDE_INT_1U << shiftc) - 1);
2220 else if (shift == RSHIFT_EXPR
2221 && type_has_mode_precision_p (shift_type))
2223 prec = TYPE_PRECISION (TREE_TYPE (@3));
2225 /* See if more bits can be proven as zero because of
2228 && TYPE_UNSIGNED (TREE_TYPE (@0)))
2230 tree inner_type = TREE_TYPE (@0);
2231 if (type_has_mode_precision_p (inner_type)
2232 && TYPE_PRECISION (inner_type) < prec)
2234 prec = TYPE_PRECISION (inner_type);
2235 /* See if we can shorten the right shift. */
2237 shift_type = inner_type;
2238 /* Otherwise X >> C1 is all zeros, so we'll optimize
2239 it into (X, 0) later on by making sure zerobits
2243 zerobits = HOST_WIDE_INT_M1U;
2246 zerobits >>= HOST_BITS_PER_WIDE_INT - shiftc;
2247 zerobits <<= prec - shiftc;
2249 /* For arithmetic shift if sign bit could be set, zerobits
2250 can contain actually sign bits, so no transformation is
2251 possible, unless MASK masks them all away. In that
2252 case the shift needs to be converted into logical shift. */
2253 if (!TYPE_UNSIGNED (TREE_TYPE (@3))
2254 && prec == TYPE_PRECISION (TREE_TYPE (@3)))
2256 if ((mask & zerobits) == 0)
2257 shift_type = unsigned_type_for (TREE_TYPE (@3));
2263 /* ((X << 16) & 0xff00) is (X, 0). */
2264 (if ((mask & zerobits) == mask)
2265 { build_int_cst (type, 0); }
2266 (with { newmask = mask | zerobits; }
2267 (if (newmask != mask && (newmask & (newmask + 1)) == 0)
2270 /* Only do the transformation if NEWMASK is some integer
2272 for (prec = BITS_PER_UNIT;
2273 prec < HOST_BITS_PER_WIDE_INT; prec <<= 1)
2274 if (newmask == (HOST_WIDE_INT_1U << prec) - 1)
2277 (if (prec < HOST_BITS_PER_WIDE_INT
2278 || newmask == HOST_WIDE_INT_M1U)
2280 { tree newmaskt = build_int_cst_type (TREE_TYPE (@2), newmask); }
2281 (if (!tree_int_cst_equal (newmaskt, @2))
2282 (if (shift_type != TREE_TYPE (@3))
2283 (bit_and (convert (shift:shift_type (convert @3) @1)) { newmaskt; })
2284 (bit_and @4 { newmaskt; })))))))))))))
2286 /* Fold (X {&,^,|} C2) << C1 into (X << C1) {&,^,|} (C2 << C1)
2287 (X {&,^,|} C2) >> C1 into (X >> C1) & (C2 >> C1). */
2288 (for shift (lshift rshift)
2289 (for bit_op (bit_and bit_xor bit_ior)
2291 (shift (convert?:s (bit_op:s @0 INTEGER_CST@2)) INTEGER_CST@1)
2292 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2293 (with { tree mask = int_const_binop (shift, fold_convert (type, @2), @1); }
2294 (bit_op (shift (convert @0) @1) { mask; }))))))
2296 /* ~(~X >> Y) -> X >> Y (for arithmetic shift). */
2298 (bit_not (convert1?:s (rshift:s (convert2?@0 (bit_not @1)) @2)))
2299 (if (!TYPE_UNSIGNED (TREE_TYPE (@0))
2300 && (element_precision (TREE_TYPE (@0))
2301 <= element_precision (TREE_TYPE (@1))
2302 || !TYPE_UNSIGNED (TREE_TYPE (@1))))
2304 { tree shift_type = TREE_TYPE (@0); }
2305 (convert (rshift (convert:shift_type @1) @2)))))
2307 /* ~(~X >>r Y) -> X >>r Y
2308 ~(~X <<r Y) -> X <<r Y */
2309 (for rotate (lrotate rrotate)
2311 (bit_not (convert1?:s (rotate:s (convert2?@0 (bit_not @1)) @2)))
2312 (if ((element_precision (TREE_TYPE (@0))
2313 <= element_precision (TREE_TYPE (@1))
2314 || !TYPE_UNSIGNED (TREE_TYPE (@1)))
2315 && (element_precision (type) <= element_precision (TREE_TYPE (@0))
2316 || !TYPE_UNSIGNED (TREE_TYPE (@0))))
2318 { tree rotate_type = TREE_TYPE (@0); }
2319 (convert (rotate (convert:rotate_type @1) @2))))))
2321 /* Simplifications of conversions. */
2323 /* Basic strip-useless-type-conversions / strip_nops. */
2324 (for cvt (convert view_convert float fix_trunc)
2327 (if ((GIMPLE && useless_type_conversion_p (type, TREE_TYPE (@0)))
2328 || (GENERIC && type == TREE_TYPE (@0)))
2331 /* Contract view-conversions. */
2333 (view_convert (view_convert @0))
2336 /* For integral conversions with the same precision or pointer
2337 conversions use a NOP_EXPR instead. */
2340 (if ((INTEGRAL_TYPE_P (type) || POINTER_TYPE_P (type))
2341 && (INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))
2342 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (@0)))
2345 /* Strip inner integral conversions that do not change precision or size, or
2346 zero-extend while keeping the same size (for bool-to-char). */
2348 (view_convert (convert@0 @1))
2349 (if ((INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))
2350 && (INTEGRAL_TYPE_P (TREE_TYPE (@1)) || POINTER_TYPE_P (TREE_TYPE (@1)))
2351 && TYPE_SIZE (TREE_TYPE (@0)) == TYPE_SIZE (TREE_TYPE (@1))
2352 && (TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1))
2353 || (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (TREE_TYPE (@1))
2354 && TYPE_UNSIGNED (TREE_TYPE (@1)))))
2357 /* Re-association barriers around constants and other re-association
2358 barriers can be removed. */
2360 (paren CONSTANT_CLASS_P@0)
2363 (paren (paren@1 @0))
2366 /* Handle cases of two conversions in a row. */
2367 (for ocvt (convert float fix_trunc)
2368 (for icvt (convert float)
2373 tree inside_type = TREE_TYPE (@0);
2374 tree inter_type = TREE_TYPE (@1);
2375 int inside_int = INTEGRAL_TYPE_P (inside_type);
2376 int inside_ptr = POINTER_TYPE_P (inside_type);
2377 int inside_float = FLOAT_TYPE_P (inside_type);
2378 int inside_vec = VECTOR_TYPE_P (inside_type);
2379 unsigned int inside_prec = TYPE_PRECISION (inside_type);
2380 int inside_unsignedp = TYPE_UNSIGNED (inside_type);
2381 int inter_int = INTEGRAL_TYPE_P (inter_type);
2382 int inter_ptr = POINTER_TYPE_P (inter_type);
2383 int inter_float = FLOAT_TYPE_P (inter_type);
2384 int inter_vec = VECTOR_TYPE_P (inter_type);
2385 unsigned int inter_prec = TYPE_PRECISION (inter_type);
2386 int inter_unsignedp = TYPE_UNSIGNED (inter_type);
2387 int final_int = INTEGRAL_TYPE_P (type);
2388 int final_ptr = POINTER_TYPE_P (type);
2389 int final_float = FLOAT_TYPE_P (type);
2390 int final_vec = VECTOR_TYPE_P (type);
2391 unsigned int final_prec = TYPE_PRECISION (type);
2392 int final_unsignedp = TYPE_UNSIGNED (type);
2395 /* In addition to the cases of two conversions in a row
2396 handled below, if we are converting something to its own
2397 type via an object of identical or wider precision, neither
2398 conversion is needed. */
2399 (if (((GIMPLE && useless_type_conversion_p (type, inside_type))
2401 && TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (inside_type)))
2402 && (((inter_int || inter_ptr) && final_int)
2403 || (inter_float && final_float))
2404 && inter_prec >= final_prec)
2407 /* Likewise, if the intermediate and initial types are either both
2408 float or both integer, we don't need the middle conversion if the
2409 former is wider than the latter and doesn't change the signedness
2410 (for integers). Avoid this if the final type is a pointer since
2411 then we sometimes need the middle conversion. */
2412 (if (((inter_int && inside_int) || (inter_float && inside_float))
2413 && (final_int || final_float)
2414 && inter_prec >= inside_prec
2415 && (inter_float || inter_unsignedp == inside_unsignedp))
2418 /* If we have a sign-extension of a zero-extended value, we can
2419 replace that by a single zero-extension. Likewise if the
2420 final conversion does not change precision we can drop the
2421 intermediate conversion. */
2422 (if (inside_int && inter_int && final_int
2423 && ((inside_prec < inter_prec && inter_prec < final_prec
2424 && inside_unsignedp && !inter_unsignedp)
2425 || final_prec == inter_prec))
2428 /* Two conversions in a row are not needed unless:
2429 - some conversion is floating-point (overstrict for now), or
2430 - some conversion is a vector (overstrict for now), or
2431 - the intermediate type is narrower than both initial and
2433 - the intermediate type and innermost type differ in signedness,
2434 and the outermost type is wider than the intermediate, or
2435 - the initial type is a pointer type and the precisions of the
2436 intermediate and final types differ, or
2437 - the final type is a pointer type and the precisions of the
2438 initial and intermediate types differ. */
2439 (if (! inside_float && ! inter_float && ! final_float
2440 && ! inside_vec && ! inter_vec && ! final_vec
2441 && (inter_prec >= inside_prec || inter_prec >= final_prec)
2442 && ! (inside_int && inter_int
2443 && inter_unsignedp != inside_unsignedp
2444 && inter_prec < final_prec)
2445 && ((inter_unsignedp && inter_prec > inside_prec)
2446 == (final_unsignedp && final_prec > inter_prec))
2447 && ! (inside_ptr && inter_prec != final_prec)
2448 && ! (final_ptr && inside_prec != inter_prec))
2451 /* A truncation to an unsigned type (a zero-extension) should be
2452 canonicalized as bitwise and of a mask. */
2453 (if (GIMPLE /* PR70366: doing this in GENERIC breaks -Wconversion. */
2454 && final_int && inter_int && inside_int
2455 && final_prec == inside_prec
2456 && final_prec > inter_prec
2458 (convert (bit_and @0 { wide_int_to_tree
2460 wi::mask (inter_prec, false,
2461 TYPE_PRECISION (inside_type))); })))
2463 /* If we are converting an integer to a floating-point that can
2464 represent it exactly and back to an integer, we can skip the
2465 floating-point conversion. */
2466 (if (GIMPLE /* PR66211 */
2467 && inside_int && inter_float && final_int &&
2468 (unsigned) significand_size (TYPE_MODE (inter_type))
2469 >= inside_prec - !inside_unsignedp)
2472 /* If we have a narrowing conversion to an integral type that is fed by a
2473 BIT_AND_EXPR, we might be able to remove the BIT_AND_EXPR if it merely
2474 masks off bits outside the final type (and nothing else). */
2476 (convert (bit_and @0 INTEGER_CST@1))
2477 (if (INTEGRAL_TYPE_P (type)
2478 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
2479 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))
2480 && operand_equal_p (@1, build_low_bits_mask (TREE_TYPE (@1),
2481 TYPE_PRECISION (type)), 0))
2485 /* (X /[ex] A) * A -> X. */
2487 (mult (convert1? (exact_div @0 @@1)) (convert2? @1))
2490 /* Canonicalization of binary operations. */
2492 /* Convert X + -C into X - C. */
2494 (plus @0 REAL_CST@1)
2495 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
2496 (with { tree tem = const_unop (NEGATE_EXPR, type, @1); }
2497 (if (!TREE_OVERFLOW (tem) || !flag_trapping_math)
2498 (minus @0 { tem; })))))
2500 /* Convert x+x into x*2. */
2503 (if (SCALAR_FLOAT_TYPE_P (type))
2504 (mult @0 { build_real (type, dconst2); })
2505 (if (INTEGRAL_TYPE_P (type))
2506 (mult @0 { build_int_cst (type, 2); }))))
2510 (minus integer_zerop @1)
2513 (pointer_diff integer_zerop @1)
2514 (negate (convert @1)))
2516 /* (ARG0 - ARG1) is the same as (-ARG1 + ARG0). So check whether
2517 ARG0 is zero and X + ARG0 reduces to X, since that would mean
2518 (-ARG1 + ARG0) reduces to -ARG1. */
2520 (minus real_zerop@0 @1)
2521 (if (fold_real_zero_addition_p (type, @0, 0))
2524 /* Transform x * -1 into -x. */
2526 (mult @0 integer_minus_onep)
2529 /* Reassociate (X * CST) * Y to (X * Y) * CST. This does not introduce
2530 signed overflow for CST != 0 && CST != -1. */
2532 (mult:c (mult:s @0 INTEGER_CST@1) @2)
2533 (if (TREE_CODE (@2) != INTEGER_CST
2534 && !integer_zerop (@1) && !integer_minus_onep (@1))
2535 (mult (mult @0 @2) @1)))
2537 /* True if we can easily extract the real and imaginary parts of a complex
2539 (match compositional_complex
2540 (convert? (complex @0 @1)))
2542 /* COMPLEX_EXPR and REALPART/IMAGPART_EXPR cancellations. */
2544 (complex (realpart @0) (imagpart @0))
2547 (realpart (complex @0 @1))
2550 (imagpart (complex @0 @1))
2553 /* Sometimes we only care about half of a complex expression. */
2555 (realpart (convert?:s (conj:s @0)))
2556 (convert (realpart @0)))
2558 (imagpart (convert?:s (conj:s @0)))
2559 (convert (negate (imagpart @0))))
2560 (for part (realpart imagpart)
2561 (for op (plus minus)
2563 (part (convert?:s@2 (op:s @0 @1)))
2564 (convert (op (part @0) (part @1))))))
2566 (realpart (convert?:s (CEXPI:s @0)))
2569 (imagpart (convert?:s (CEXPI:s @0)))
2572 /* conj(conj(x)) -> x */
2574 (conj (convert? (conj @0)))
2575 (if (tree_nop_conversion_p (TREE_TYPE (@0), type))
2578 /* conj({x,y}) -> {x,-y} */
2580 (conj (convert?:s (complex:s @0 @1)))
2581 (with { tree itype = TREE_TYPE (type); }
2582 (complex (convert:itype @0) (negate (convert:itype @1)))))
2584 /* BSWAP simplifications, transforms checked by gcc.dg/builtin-bswap-8.c. */
2585 (for bswap (BUILT_IN_BSWAP16 BUILT_IN_BSWAP32 BUILT_IN_BSWAP64)
2590 (bswap (bit_not (bswap @0)))
2592 (for bitop (bit_xor bit_ior bit_and)
2594 (bswap (bitop:c (bswap @0) @1))
2595 (bitop @0 (bswap @1)))))
2598 /* Combine COND_EXPRs and VEC_COND_EXPRs. */
2600 /* Simplify constant conditions.
2601 Only optimize constant conditions when the selected branch
2602 has the same type as the COND_EXPR. This avoids optimizing
2603 away "c ? x : throw", where the throw has a void type.
2604 Note that we cannot throw away the fold-const.c variant nor
2605 this one as we depend on doing this transform before possibly
2606 A ? B : B -> B triggers and the fold-const.c one can optimize
2607 0 ? A : B to B even if A has side-effects. Something
2608 genmatch cannot handle. */
2610 (cond INTEGER_CST@0 @1 @2)
2611 (if (integer_zerop (@0))
2612 (if (!VOID_TYPE_P (TREE_TYPE (@2)) || VOID_TYPE_P (type))
2614 (if (!VOID_TYPE_P (TREE_TYPE (@1)) || VOID_TYPE_P (type))
2617 (vec_cond VECTOR_CST@0 @1 @2)
2618 (if (integer_all_onesp (@0))
2620 (if (integer_zerop (@0))
2623 /* Simplification moved from fold_cond_expr_with_comparison. It may also
2625 /* This pattern implements two kinds simplification:
2628 (cond (cmp (convert1? x) c1) (convert2? x) c2) -> (minmax (x c)) if:
2629 1) Conversions are type widening from smaller type.
2630 2) Const c1 equals to c2 after canonicalizing comparison.
2631 3) Comparison has tree code LT, LE, GT or GE.
2632 This specific pattern is needed when (cmp (convert x) c) may not
2633 be simplified by comparison patterns because of multiple uses of
2634 x. It also makes sense here because simplifying across multiple
2635 referred var is always benefitial for complicated cases.
2638 (cond (eq (convert1? x) c1) (convert2? x) c2) -> (cond (eq x c1) c1 c2). */
2639 (for cmp (lt le gt ge eq)
2641 (cond (cmp (convert1? @1) INTEGER_CST@3) (convert2? @1) INTEGER_CST@2)
2644 tree from_type = TREE_TYPE (@1);
2645 tree c1_type = TREE_TYPE (@3), c2_type = TREE_TYPE (@2);
2646 enum tree_code code = ERROR_MARK;
2648 if (INTEGRAL_TYPE_P (from_type)
2649 && int_fits_type_p (@2, from_type)
2650 && (types_match (c1_type, from_type)
2651 || (TYPE_PRECISION (c1_type) > TYPE_PRECISION (from_type)
2652 && (TYPE_UNSIGNED (from_type)
2653 || TYPE_SIGN (c1_type) == TYPE_SIGN (from_type))))
2654 && (types_match (c2_type, from_type)
2655 || (TYPE_PRECISION (c2_type) > TYPE_PRECISION (from_type)
2656 && (TYPE_UNSIGNED (from_type)
2657 || TYPE_SIGN (c2_type) == TYPE_SIGN (from_type)))))
2661 if (wi::to_widest (@3) == (wi::to_widest (@2) - 1))
2663 /* X <= Y - 1 equals to X < Y. */
2666 /* X > Y - 1 equals to X >= Y. */
2670 if (wi::to_widest (@3) == (wi::to_widest (@2) + 1))
2672 /* X < Y + 1 equals to X <= Y. */
2675 /* X >= Y + 1 equals to X > Y. */
2679 if (code != ERROR_MARK
2680 || wi::to_widest (@2) == wi::to_widest (@3))
2682 if (cmp == LT_EXPR || cmp == LE_EXPR)
2684 if (cmp == GT_EXPR || cmp == GE_EXPR)
2688 /* Can do A == C1 ? A : C2 -> A == C1 ? C1 : C2? */
2689 else if (int_fits_type_p (@3, from_type))
2693 (if (code == MAX_EXPR)
2694 (convert (max @1 (convert @2)))
2695 (if (code == MIN_EXPR)
2696 (convert (min @1 (convert @2)))
2697 (if (code == EQ_EXPR)
2698 (convert (cond (eq @1 (convert @3))
2699 (convert:from_type @3) (convert:from_type @2)))))))))
2701 /* (cond (cmp (convert? x) c1) (op x c2) c3) -> (op (minmax x c1) c2) if:
2703 1) OP is PLUS or MINUS.
2704 2) CMP is LT, LE, GT or GE.
2705 3) C3 == (C1 op C2), and computation doesn't have undefined behavior.
2707 This pattern also handles special cases like:
2709 A) Operand x is a unsigned to signed type conversion and c1 is
2710 integer zero. In this case,
2711 (signed type)x < 0 <=> x > MAX_VAL(signed type)
2712 (signed type)x >= 0 <=> x <= MAX_VAL(signed type)
2713 B) Const c1 may not equal to (C3 op' C2). In this case we also
2714 check equality for (c1+1) and (c1-1) by adjusting comparison
2717 TODO: Though signed type is handled by this pattern, it cannot be
2718 simplified at the moment because C standard requires additional
2719 type promotion. In order to match&simplify it here, the IR needs
2720 to be cleaned up by other optimizers, i.e, VRP. */
2721 (for op (plus minus)
2722 (for cmp (lt le gt ge)
2724 (cond (cmp (convert? @X) INTEGER_CST@1) (op @X INTEGER_CST@2) INTEGER_CST@3)
2725 (with { tree from_type = TREE_TYPE (@X), to_type = TREE_TYPE (@1); }
2726 (if (types_match (from_type, to_type)
2727 /* Check if it is special case A). */
2728 || (TYPE_UNSIGNED (from_type)
2729 && !TYPE_UNSIGNED (to_type)
2730 && TYPE_PRECISION (from_type) == TYPE_PRECISION (to_type)
2731 && integer_zerop (@1)
2732 && (cmp == LT_EXPR || cmp == GE_EXPR)))
2735 bool overflow = false;
2736 enum tree_code code, cmp_code = cmp;
2738 wide_int c1 = wi::to_wide (@1);
2739 wide_int c2 = wi::to_wide (@2);
2740 wide_int c3 = wi::to_wide (@3);
2741 signop sgn = TYPE_SIGN (from_type);
2743 /* Handle special case A), given x of unsigned type:
2744 ((signed type)x < 0) <=> (x > MAX_VAL(signed type))
2745 ((signed type)x >= 0) <=> (x <= MAX_VAL(signed type)) */
2746 if (!types_match (from_type, to_type))
2748 if (cmp_code == LT_EXPR)
2750 if (cmp_code == GE_EXPR)
2752 c1 = wi::max_value (to_type);
2754 /* To simplify this pattern, we require c3 = (c1 op c2). Here we
2755 compute (c3 op' c2) and check if it equals to c1 with op' being
2756 the inverted operator of op. Make sure overflow doesn't happen
2757 if it is undefined. */
2758 if (op == PLUS_EXPR)
2759 real_c1 = wi::sub (c3, c2, sgn, &overflow);
2761 real_c1 = wi::add (c3, c2, sgn, &overflow);
2764 if (!overflow || !TYPE_OVERFLOW_UNDEFINED (from_type))
2766 /* Check if c1 equals to real_c1. Boundary condition is handled
2767 by adjusting comparison operation if necessary. */
2768 if (!wi::cmp (wi::sub (real_c1, 1, sgn, &overflow), c1, sgn)
2771 /* X <= Y - 1 equals to X < Y. */
2772 if (cmp_code == LE_EXPR)
2774 /* X > Y - 1 equals to X >= Y. */
2775 if (cmp_code == GT_EXPR)
2778 if (!wi::cmp (wi::add (real_c1, 1, sgn, &overflow), c1, sgn)
2781 /* X < Y + 1 equals to X <= Y. */
2782 if (cmp_code == LT_EXPR)
2784 /* X >= Y + 1 equals to X > Y. */
2785 if (cmp_code == GE_EXPR)
2788 if (code != cmp_code || !wi::cmp (real_c1, c1, sgn))
2790 if (cmp_code == LT_EXPR || cmp_code == LE_EXPR)
2792 if (cmp_code == GT_EXPR || cmp_code == GE_EXPR)
2797 (if (code == MAX_EXPR)
2798 (op (max @X { wide_int_to_tree (from_type, real_c1); })
2799 { wide_int_to_tree (from_type, c2); })
2800 (if (code == MIN_EXPR)
2801 (op (min @X { wide_int_to_tree (from_type, real_c1); })
2802 { wide_int_to_tree (from_type, c2); })))))))))
2804 (for cnd (cond vec_cond)
2805 /* A ? B : (A ? X : C) -> A ? B : C. */
2807 (cnd @0 (cnd @0 @1 @2) @3)
2810 (cnd @0 @1 (cnd @0 @2 @3))
2812 /* A ? B : (!A ? C : X) -> A ? B : C. */
2813 /* ??? This matches embedded conditions open-coded because genmatch
2814 would generate matching code for conditions in separate stmts only.
2815 The following is still important to merge then and else arm cases
2816 from if-conversion. */
2818 (cnd @0 @1 (cnd @2 @3 @4))
2819 (if (COMPARISON_CLASS_P (@0)
2820 && COMPARISON_CLASS_P (@2)
2821 && invert_tree_comparison
2822 (TREE_CODE (@0), HONOR_NANS (TREE_OPERAND (@0, 0))) == TREE_CODE (@2)
2823 && operand_equal_p (TREE_OPERAND (@0, 0), TREE_OPERAND (@2, 0), 0)
2824 && operand_equal_p (TREE_OPERAND (@0, 1), TREE_OPERAND (@2, 1), 0))
2827 (cnd @0 (cnd @1 @2 @3) @4)
2828 (if (COMPARISON_CLASS_P (@0)
2829 && COMPARISON_CLASS_P (@1)
2830 && invert_tree_comparison
2831 (TREE_CODE (@0), HONOR_NANS (TREE_OPERAND (@0, 0))) == TREE_CODE (@1)
2832 && operand_equal_p (TREE_OPERAND (@0, 0), TREE_OPERAND (@1, 0), 0)
2833 && operand_equal_p (TREE_OPERAND (@0, 1), TREE_OPERAND (@1, 1), 0))
2836 /* A ? B : B -> B. */
2841 /* !A ? B : C -> A ? C : B. */
2843 (cnd (logical_inverted_value truth_valued_p@0) @1 @2)
2846 /* A + (B vcmp C ? 1 : 0) -> A - (B vcmp C ? -1 : 0), since vector comparisons
2847 return all -1 or all 0 results. */
2848 /* ??? We could instead convert all instances of the vec_cond to negate,
2849 but that isn't necessarily a win on its own. */
2851 (plus:c @3 (view_convert? (vec_cond:s @0 integer_each_onep@1 integer_zerop@2)))
2852 (if (VECTOR_TYPE_P (type)
2853 && known_eq (TYPE_VECTOR_SUBPARTS (type),
2854 TYPE_VECTOR_SUBPARTS (TREE_TYPE (@1)))
2855 && (TYPE_MODE (TREE_TYPE (type))
2856 == TYPE_MODE (TREE_TYPE (TREE_TYPE (@1)))))
2857 (minus @3 (view_convert (vec_cond @0 (negate @1) @2)))))
2859 /* ... likewise A - (B vcmp C ? 1 : 0) -> A + (B vcmp C ? -1 : 0). */
2861 (minus @3 (view_convert? (vec_cond:s @0 integer_each_onep@1 integer_zerop@2)))
2862 (if (VECTOR_TYPE_P (type)
2863 && known_eq (TYPE_VECTOR_SUBPARTS (type),
2864 TYPE_VECTOR_SUBPARTS (TREE_TYPE (@1)))
2865 && (TYPE_MODE (TREE_TYPE (type))
2866 == TYPE_MODE (TREE_TYPE (TREE_TYPE (@1)))))
2867 (plus @3 (view_convert (vec_cond @0 (negate @1) @2)))))
2870 /* Simplifications of comparisons. */
2872 /* See if we can reduce the magnitude of a constant involved in a
2873 comparison by changing the comparison code. This is a canonicalization
2874 formerly done by maybe_canonicalize_comparison_1. */
2878 (cmp @0 INTEGER_CST@1)
2879 (if (tree_int_cst_sgn (@1) == -1)
2880 (acmp @0 { wide_int_to_tree (TREE_TYPE (@1), wi::to_wide (@1) + 1); }))))
2884 (cmp @0 INTEGER_CST@1)
2885 (if (tree_int_cst_sgn (@1) == 1)
2886 (acmp @0 { wide_int_to_tree (TREE_TYPE (@1), wi::to_wide (@1) - 1); }))))
2889 /* We can simplify a logical negation of a comparison to the
2890 inverted comparison. As we cannot compute an expression
2891 operator using invert_tree_comparison we have to simulate
2892 that with expression code iteration. */
2893 (for cmp (tcc_comparison)
2894 icmp (inverted_tcc_comparison)
2895 ncmp (inverted_tcc_comparison_with_nans)
2896 /* Ideally we'd like to combine the following two patterns
2897 and handle some more cases by using
2898 (logical_inverted_value (cmp @0 @1))
2899 here but for that genmatch would need to "inline" that.
2900 For now implement what forward_propagate_comparison did. */
2902 (bit_not (cmp @0 @1))
2903 (if (VECTOR_TYPE_P (type)
2904 || (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) == 1))
2905 /* Comparison inversion may be impossible for trapping math,
2906 invert_tree_comparison will tell us. But we can't use
2907 a computed operator in the replacement tree thus we have
2908 to play the trick below. */
2909 (with { enum tree_code ic = invert_tree_comparison
2910 (cmp, HONOR_NANS (@0)); }
2916 (bit_xor (cmp @0 @1) integer_truep)
2917 (with { enum tree_code ic = invert_tree_comparison
2918 (cmp, HONOR_NANS (@0)); }
2924 /* Transform comparisons of the form X - Y CMP 0 to X CMP Y.
2925 ??? The transformation is valid for the other operators if overflow
2926 is undefined for the type, but performing it here badly interacts
2927 with the transformation in fold_cond_expr_with_comparison which
2928 attempts to synthetize ABS_EXPR. */
2930 (for sub (minus pointer_diff)
2932 (cmp (sub@2 @0 @1) integer_zerop)
2933 (if (single_use (@2))
2936 /* Transform comparisons of the form X * C1 CMP 0 to X CMP 0 in the
2937 signed arithmetic case. That form is created by the compiler
2938 often enough for folding it to be of value. One example is in
2939 computing loop trip counts after Operator Strength Reduction. */
2940 (for cmp (simple_comparison)
2941 scmp (swapped_simple_comparison)
2943 (cmp (mult@3 @0 INTEGER_CST@1) integer_zerop@2)
2944 /* Handle unfolded multiplication by zero. */
2945 (if (integer_zerop (@1))
2947 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2948 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2950 /* If @1 is negative we swap the sense of the comparison. */
2951 (if (tree_int_cst_sgn (@1) < 0)
2955 /* Simplify comparison of something with itself. For IEEE
2956 floating-point, we can only do some of these simplifications. */
2960 (if (! FLOAT_TYPE_P (TREE_TYPE (@0))
2961 || ! HONOR_NANS (@0))
2962 { constant_boolean_node (true, type); }
2963 (if (cmp != EQ_EXPR)
2969 || ! FLOAT_TYPE_P (TREE_TYPE (@0))
2970 || ! HONOR_NANS (@0))
2971 { constant_boolean_node (false, type); })))
2972 (for cmp (unle unge uneq)
2975 { constant_boolean_node (true, type); }))
2976 (for cmp (unlt ungt)
2982 (if (!flag_trapping_math)
2983 { constant_boolean_node (false, type); }))
2985 /* Fold ~X op ~Y as Y op X. */
2986 (for cmp (simple_comparison)
2988 (cmp (bit_not@2 @0) (bit_not@3 @1))
2989 (if (single_use (@2) && single_use (@3))
2992 /* Fold ~X op C as X op' ~C, where op' is the swapped comparison. */
2993 (for cmp (simple_comparison)
2994 scmp (swapped_simple_comparison)
2996 (cmp (bit_not@2 @0) CONSTANT_CLASS_P@1)
2997 (if (single_use (@2)
2998 && (TREE_CODE (@1) == INTEGER_CST || TREE_CODE (@1) == VECTOR_CST))
2999 (scmp @0 (bit_not @1)))))
3001 (for cmp (simple_comparison)
3002 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
3004 (cmp (convert@2 @0) (convert? @1))
3005 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
3006 && (DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@2))
3007 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0)))
3008 && (DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@2))
3009 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@1))))
3012 tree type1 = TREE_TYPE (@1);
3013 if (TREE_CODE (@1) == REAL_CST && !DECIMAL_FLOAT_TYPE_P (type1))
3015 REAL_VALUE_TYPE orig = TREE_REAL_CST (@1);
3016 if (TYPE_PRECISION (type1) > TYPE_PRECISION (float_type_node)
3017 && exact_real_truncate (TYPE_MODE (float_type_node), &orig))
3018 type1 = float_type_node;
3019 if (TYPE_PRECISION (type1) > TYPE_PRECISION (double_type_node)
3020 && exact_real_truncate (TYPE_MODE (double_type_node), &orig))
3021 type1 = double_type_node;
3024 = (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (type1)
3025 ? TREE_TYPE (@0) : type1);
3027 (if (TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (newtype))
3028 (cmp (convert:newtype @0) (convert:newtype @1))))))
3032 /* IEEE doesn't distinguish +0 and -0 in comparisons. */
3034 /* a CMP (-0) -> a CMP 0 */
3035 (if (REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@1)))
3036 (cmp @0 { build_real (TREE_TYPE (@1), dconst0); }))
3037 /* x != NaN is always true, other ops are always false. */
3038 (if (REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
3039 && ! HONOR_SNANS (@1))
3040 { constant_boolean_node (cmp == NE_EXPR, type); })
3041 /* Fold comparisons against infinity. */
3042 (if (REAL_VALUE_ISINF (TREE_REAL_CST (@1))
3043 && MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (@1))))
3046 REAL_VALUE_TYPE max;
3047 enum tree_code code = cmp;
3048 bool neg = REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1));
3050 code = swap_tree_comparison (code);
3053 /* x > +Inf is always false, if we ignore NaNs or exceptions. */
3054 (if (code == GT_EXPR
3055 && !(HONOR_NANS (@0) && flag_trapping_math))
3056 { constant_boolean_node (false, type); })
3057 (if (code == LE_EXPR)
3058 /* x <= +Inf is always true, if we don't care about NaNs. */
3059 (if (! HONOR_NANS (@0))
3060 { constant_boolean_node (true, type); }
3061 /* x <= +Inf is the same as x == x, i.e. !isnan(x), but this loses
3062 an "invalid" exception. */
3063 (if (!flag_trapping_math)
3065 /* x == +Inf and x >= +Inf are always equal to x > DBL_MAX, but
3066 for == this introduces an exception for x a NaN. */
3067 (if ((code == EQ_EXPR && !(HONOR_NANS (@0) && flag_trapping_math))
3069 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
3071 (lt @0 { build_real (TREE_TYPE (@0), max); })
3072 (gt @0 { build_real (TREE_TYPE (@0), max); }))))
3073 /* x < +Inf is always equal to x <= DBL_MAX. */
3074 (if (code == LT_EXPR)
3075 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
3077 (ge @0 { build_real (TREE_TYPE (@0), max); })
3078 (le @0 { build_real (TREE_TYPE (@0), max); }))))
3079 /* x != +Inf is always equal to !(x > DBL_MAX), but this introduces
3080 an exception for x a NaN so use an unordered comparison. */
3081 (if (code == NE_EXPR)
3082 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
3083 (if (! HONOR_NANS (@0))
3085 (ge @0 { build_real (TREE_TYPE (@0), max); })
3086 (le @0 { build_real (TREE_TYPE (@0), max); }))
3088 (unge @0 { build_real (TREE_TYPE (@0), max); })
3089 (unle @0 { build_real (TREE_TYPE (@0), max); }))))))))))
3091 /* If this is a comparison of a real constant with a PLUS_EXPR
3092 or a MINUS_EXPR of a real constant, we can convert it into a
3093 comparison with a revised real constant as long as no overflow
3094 occurs when unsafe_math_optimizations are enabled. */
3095 (if (flag_unsafe_math_optimizations)
3096 (for op (plus minus)
3098 (cmp (op @0 REAL_CST@1) REAL_CST@2)
3101 tree tem = const_binop (op == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR,
3102 TREE_TYPE (@1), @2, @1);
3104 (if (tem && !TREE_OVERFLOW (tem))
3105 (cmp @0 { tem; }))))))
3107 /* Likewise, we can simplify a comparison of a real constant with
3108 a MINUS_EXPR whose first operand is also a real constant, i.e.
3109 (c1 - x) < c2 becomes x > c1-c2. Reordering is allowed on
3110 floating-point types only if -fassociative-math is set. */
3111 (if (flag_associative_math)
3113 (cmp (minus REAL_CST@0 @1) REAL_CST@2)
3114 (with { tree tem = const_binop (MINUS_EXPR, TREE_TYPE (@1), @0, @2); }
3115 (if (tem && !TREE_OVERFLOW (tem))
3116 (cmp { tem; } @1)))))
3118 /* Fold comparisons against built-in math functions. */
3119 (if (flag_unsafe_math_optimizations
3120 && ! flag_errno_math)
3123 (cmp (sq @0) REAL_CST@1)
3125 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
3127 /* sqrt(x) < y is always false, if y is negative. */
3128 (if (cmp == EQ_EXPR || cmp == LT_EXPR || cmp == LE_EXPR)
3129 { constant_boolean_node (false, type); })
3130 /* sqrt(x) > y is always true, if y is negative and we
3131 don't care about NaNs, i.e. negative values of x. */
3132 (if (cmp == NE_EXPR || !HONOR_NANS (@0))
3133 { constant_boolean_node (true, type); })
3134 /* sqrt(x) > y is the same as x >= 0, if y is negative. */
3135 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })))
3136 (if (real_equal (TREE_REAL_CST_PTR (@1), &dconst0))
3138 /* sqrt(x) < 0 is always false. */
3139 (if (cmp == LT_EXPR)
3140 { constant_boolean_node (false, type); })
3141 /* sqrt(x) >= 0 is always true if we don't care about NaNs. */
3142 (if (cmp == GE_EXPR && !HONOR_NANS (@0))
3143 { constant_boolean_node (true, type); })
3144 /* sqrt(x) <= 0 -> x == 0. */
3145 (if (cmp == LE_EXPR)
3147 /* Otherwise sqrt(x) cmp 0 -> x cmp 0. Here cmp can be >=, >,
3148 == or !=. In the last case:
3150 (sqrt(x) != 0) == (NaN != 0) == true == (x != 0)
3152 if x is negative or NaN. Due to -funsafe-math-optimizations,
3153 the results for other x follow from natural arithmetic. */
3155 (if (cmp == GT_EXPR || cmp == GE_EXPR)
3159 real_arithmetic (&c2, MULT_EXPR,
3160 &TREE_REAL_CST (@1), &TREE_REAL_CST (@1));
3161 real_convert (&c2, TYPE_MODE (TREE_TYPE (@0)), &c2);
3163 (if (REAL_VALUE_ISINF (c2))
3164 /* sqrt(x) > y is x == +Inf, when y is very large. */
3165 (if (HONOR_INFINITIES (@0))
3166 (eq @0 { build_real (TREE_TYPE (@0), c2); })
3167 { constant_boolean_node (false, type); })
3168 /* sqrt(x) > c is the same as x > c*c. */
3169 (cmp @0 { build_real (TREE_TYPE (@0), c2); }))))
3170 (if (cmp == LT_EXPR || cmp == LE_EXPR)
3174 real_arithmetic (&c2, MULT_EXPR,
3175 &TREE_REAL_CST (@1), &TREE_REAL_CST (@1));
3176 real_convert (&c2, TYPE_MODE (TREE_TYPE (@0)), &c2);
3178 (if (REAL_VALUE_ISINF (c2))
3180 /* sqrt(x) < y is always true, when y is a very large
3181 value and we don't care about NaNs or Infinities. */
3182 (if (! HONOR_NANS (@0) && ! HONOR_INFINITIES (@0))
3183 { constant_boolean_node (true, type); })
3184 /* sqrt(x) < y is x != +Inf when y is very large and we
3185 don't care about NaNs. */
3186 (if (! HONOR_NANS (@0))
3187 (ne @0 { build_real (TREE_TYPE (@0), c2); }))
3188 /* sqrt(x) < y is x >= 0 when y is very large and we
3189 don't care about Infinities. */
3190 (if (! HONOR_INFINITIES (@0))
3191 (ge @0 { build_real (TREE_TYPE (@0), dconst0); }))
3192 /* sqrt(x) < y is x >= 0 && x != +Inf, when y is large. */
3195 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })
3196 (ne @0 { build_real (TREE_TYPE (@0), c2); }))))
3197 /* sqrt(x) < c is the same as x < c*c, if we ignore NaNs. */
3198 (if (! HONOR_NANS (@0))
3199 (cmp @0 { build_real (TREE_TYPE (@0), c2); })
3200 /* sqrt(x) < c is the same as x >= 0 && x < c*c. */
3203 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })
3204 (cmp @0 { build_real (TREE_TYPE (@0), c2); })))))))))
3205 /* Transform sqrt(x) cmp sqrt(y) -> x cmp y. */
3207 (cmp (sq @0) (sq @1))
3208 (if (! HONOR_NANS (@0))
3211 /* Optimize various special cases of (FTYPE) N CMP CST. */
3212 (for cmp (lt le eq ne ge gt)
3213 icmp (le le eq ne ge ge)
3215 (cmp (float @0) REAL_CST@1)
3216 (if (SCALAR_FLOAT_TYPE_P (TREE_TYPE (@1))
3217 && ! DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@1)))
3220 tree itype = TREE_TYPE (@0);
3221 signop isign = TYPE_SIGN (itype);
3222 format_helper fmt (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (@1))));
3223 const REAL_VALUE_TYPE *cst = TREE_REAL_CST_PTR (@1);
3224 /* Be careful to preserve any potential exceptions due to
3225 NaNs. qNaNs are ok in == or != context.
3226 TODO: relax under -fno-trapping-math or
3227 -fno-signaling-nans. */
3229 = real_isnan (cst) && (cst->signalling
3230 || (cmp != EQ_EXPR && cmp != NE_EXPR));
3231 /* INT?_MIN is power-of-two so it takes
3232 only one mantissa bit. */
3233 bool signed_p = isign == SIGNED;
3234 bool itype_fits_ftype_p
3235 = TYPE_PRECISION (itype) - signed_p <= significand_size (fmt);
3237 /* TODO: allow non-fitting itype and SNaNs when
3238 -fno-trapping-math. */
3239 (if (itype_fits_ftype_p && ! exception_p)
3242 REAL_VALUE_TYPE imin, imax;
3243 real_from_integer (&imin, fmt, wi::min_value (itype), isign);
3244 real_from_integer (&imax, fmt, wi::max_value (itype), isign);
3246 REAL_VALUE_TYPE icst;
3247 if (cmp == GT_EXPR || cmp == GE_EXPR)
3248 real_ceil (&icst, fmt, cst);
3249 else if (cmp == LT_EXPR || cmp == LE_EXPR)
3250 real_floor (&icst, fmt, cst);
3252 real_trunc (&icst, fmt, cst);
3254 bool cst_int_p = !real_isnan (cst) && real_identical (&icst, cst);
3256 bool overflow_p = false;
3258 = real_to_integer (&icst, &overflow_p, TYPE_PRECISION (itype));
3261 /* Optimize cases when CST is outside of ITYPE's range. */
3262 (if (real_compare (LT_EXPR, cst, &imin))
3263 { constant_boolean_node (cmp == GT_EXPR || cmp == GE_EXPR || cmp == NE_EXPR,
3265 (if (real_compare (GT_EXPR, cst, &imax))
3266 { constant_boolean_node (cmp == LT_EXPR || cmp == LE_EXPR || cmp == NE_EXPR,
3268 /* Remove cast if CST is an integer representable by ITYPE. */
3270 (cmp @0 { gcc_assert (!overflow_p);
3271 wide_int_to_tree (itype, icst_val); })
3273 /* When CST is fractional, optimize
3274 (FTYPE) N == CST -> 0
3275 (FTYPE) N != CST -> 1. */
3276 (if (cmp == EQ_EXPR || cmp == NE_EXPR)
3277 { constant_boolean_node (cmp == NE_EXPR, type); })
3278 /* Otherwise replace with sensible integer constant. */
3281 gcc_checking_assert (!overflow_p);
3283 (icmp @0 { wide_int_to_tree (itype, icst_val); })))))))))
3285 /* Fold A /[ex] B CMP C to A CMP B * C. */
3288 (cmp (exact_div @0 @1) INTEGER_CST@2)
3289 (if (!integer_zerop (@1))
3290 (if (wi::to_wide (@2) == 0)
3292 (if (TREE_CODE (@1) == INTEGER_CST)
3296 wide_int prod = wi::mul (wi::to_wide (@2), wi::to_wide (@1),
3297 TYPE_SIGN (TREE_TYPE (@1)), &ovf);
3300 { constant_boolean_node (cmp == NE_EXPR, type); }
3301 (cmp @0 { wide_int_to_tree (TREE_TYPE (@0), prod); }))))))))
3302 (for cmp (lt le gt ge)
3304 (cmp (exact_div @0 INTEGER_CST@1) INTEGER_CST@2)
3305 (if (wi::gt_p (wi::to_wide (@1), 0, TYPE_SIGN (TREE_TYPE (@1))))
3309 wide_int prod = wi::mul (wi::to_wide (@2), wi::to_wide (@1),
3310 TYPE_SIGN (TREE_TYPE (@1)), &ovf);
3313 { constant_boolean_node (wi::lt_p (wi::to_wide (@2), 0,
3314 TYPE_SIGN (TREE_TYPE (@2)))
3315 != (cmp == LT_EXPR || cmp == LE_EXPR), type); }
3316 (cmp @0 { wide_int_to_tree (TREE_TYPE (@0), prod); }))))))
3318 /* Unordered tests if either argument is a NaN. */
3320 (bit_ior (unordered @0 @0) (unordered @1 @1))
3321 (if (types_match (@0, @1))
3324 (bit_and (ordered @0 @0) (ordered @1 @1))
3325 (if (types_match (@0, @1))
3328 (bit_ior:c (unordered @0 @0) (unordered:c@2 @0 @1))
3331 (bit_and:c (ordered @0 @0) (ordered:c@2 @0 @1))
3334 /* Simple range test simplifications. */
3335 /* A < B || A >= B -> true. */
3336 (for test1 (lt le le le ne ge)
3337 test2 (ge gt ge ne eq ne)
3339 (bit_ior:c (test1 @0 @1) (test2 @0 @1))
3340 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
3341 || VECTOR_INTEGER_TYPE_P (TREE_TYPE (@0)))
3342 { constant_boolean_node (true, type); })))
3343 /* A < B && A >= B -> false. */
3344 (for test1 (lt lt lt le ne eq)
3345 test2 (ge gt eq gt eq gt)
3347 (bit_and:c (test1 @0 @1) (test2 @0 @1))
3348 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
3349 || VECTOR_INTEGER_TYPE_P (TREE_TYPE (@0)))
3350 { constant_boolean_node (false, type); })))
3352 /* A & (2**N - 1) <= 2**K - 1 -> A & (2**N - 2**K) == 0
3353 A & (2**N - 1) > 2**K - 1 -> A & (2**N - 2**K) != 0
3355 Note that comparisons
3356 A & (2**N - 1) < 2**K -> A & (2**N - 2**K) == 0
3357 A & (2**N - 1) >= 2**K -> A & (2**N - 2**K) != 0
3358 will be canonicalized to above so there's no need to
3365 (cmp (bit_and@0 @1 INTEGER_CST@2) INTEGER_CST@3)
3366 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)))
3369 tree ty = TREE_TYPE (@0);
3370 unsigned prec = TYPE_PRECISION (ty);
3371 wide_int mask = wi::to_wide (@2, prec);
3372 wide_int rhs = wi::to_wide (@3, prec);
3373 signop sgn = TYPE_SIGN (ty);
3375 (if ((mask & (mask + 1)) == 0 && wi::gt_p (rhs, 0, sgn)
3376 && (rhs & (rhs + 1)) == 0 && wi::ge_p (mask, rhs, sgn))
3377 (eqcmp (bit_and @1 { wide_int_to_tree (ty, mask - rhs); })
3378 { build_zero_cst (ty); }))))))
3380 /* -A CMP -B -> B CMP A. */
3381 (for cmp (tcc_comparison)
3382 scmp (swapped_tcc_comparison)
3384 (cmp (negate @0) (negate @1))
3385 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
3386 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3387 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))))
3390 (cmp (negate @0) CONSTANT_CLASS_P@1)
3391 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
3392 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3393 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))))
3394 (with { tree tem = const_unop (NEGATE_EXPR, TREE_TYPE (@0), @1); }
3395 (if (tem && !TREE_OVERFLOW (tem))
3396 (scmp @0 { tem; }))))))
3398 /* Convert ABS_EXPR<x> == 0 or ABS_EXPR<x> != 0 to x == 0 or x != 0. */
3401 (op (abs @0) zerop@1)
3404 /* From fold_sign_changed_comparison and fold_widened_comparison.
3405 FIXME: the lack of symmetry is disturbing. */
3406 (for cmp (simple_comparison)
3408 (cmp (convert@0 @00) (convert?@1 @10))
3409 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
3410 /* Disable this optimization if we're casting a function pointer
3411 type on targets that require function pointer canonicalization. */
3412 && !(targetm.have_canonicalize_funcptr_for_compare ()
3413 && TREE_CODE (TREE_TYPE (@00)) == POINTER_TYPE
3414 && TREE_CODE (TREE_TYPE (TREE_TYPE (@00))) == FUNCTION_TYPE)
3416 (if (TYPE_PRECISION (TREE_TYPE (@00)) == TYPE_PRECISION (TREE_TYPE (@0))
3417 && (TREE_CODE (@10) == INTEGER_CST
3419 && (TYPE_UNSIGNED (TREE_TYPE (@00)) == TYPE_UNSIGNED (TREE_TYPE (@0))
3422 && !POINTER_TYPE_P (TREE_TYPE (@00)))
3423 /* ??? The special-casing of INTEGER_CST conversion was in the original
3424 code and here to avoid a spurious overflow flag on the resulting
3425 constant which fold_convert produces. */
3426 (if (TREE_CODE (@1) == INTEGER_CST)
3427 (cmp @00 { force_fit_type (TREE_TYPE (@00), wi::to_widest (@1), 0,
3428 TREE_OVERFLOW (@1)); })
3429 (cmp @00 (convert @1)))
3431 (if (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (TREE_TYPE (@00)))
3432 /* If possible, express the comparison in the shorter mode. */
3433 (if ((cmp == EQ_EXPR || cmp == NE_EXPR
3434 || TYPE_UNSIGNED (TREE_TYPE (@0)) == TYPE_UNSIGNED (TREE_TYPE (@00))
3435 || (!TYPE_UNSIGNED (TREE_TYPE (@0))
3436 && TYPE_UNSIGNED (TREE_TYPE (@00))))
3437 && (types_match (TREE_TYPE (@10), TREE_TYPE (@00))
3438 || ((TYPE_PRECISION (TREE_TYPE (@00))
3439 >= TYPE_PRECISION (TREE_TYPE (@10)))
3440 && (TYPE_UNSIGNED (TREE_TYPE (@00))
3441 == TYPE_UNSIGNED (TREE_TYPE (@10))))
3442 || (TREE_CODE (@10) == INTEGER_CST
3443 && INTEGRAL_TYPE_P (TREE_TYPE (@00))
3444 && int_fits_type_p (@10, TREE_TYPE (@00)))))
3445 (cmp @00 (convert @10))
3446 (if (TREE_CODE (@10) == INTEGER_CST
3447 && INTEGRAL_TYPE_P (TREE_TYPE (@00))
3448 && !int_fits_type_p (@10, TREE_TYPE (@00)))
3451 tree min = lower_bound_in_type (TREE_TYPE (@10), TREE_TYPE (@00));
3452 tree max = upper_bound_in_type (TREE_TYPE (@10), TREE_TYPE (@00));
3453 bool above = integer_nonzerop (const_binop (LT_EXPR, type, max, @10));
3454 bool below = integer_nonzerop (const_binop (LT_EXPR, type, @10, min));
3456 (if (above || below)
3457 (if (cmp == EQ_EXPR || cmp == NE_EXPR)
3458 { constant_boolean_node (cmp == EQ_EXPR ? false : true, type); }
3459 (if (cmp == LT_EXPR || cmp == LE_EXPR)
3460 { constant_boolean_node (above ? true : false, type); }
3461 (if (cmp == GT_EXPR || cmp == GE_EXPR)
3462 { constant_boolean_node (above ? false : true, type); }))))))))))))
3465 /* A local variable can never be pointed to by
3466 the default SSA name of an incoming parameter.
3467 SSA names are canonicalized to 2nd place. */
3469 (cmp addr@0 SSA_NAME@1)
3470 (if (SSA_NAME_IS_DEFAULT_DEF (@1)
3471 && TREE_CODE (SSA_NAME_VAR (@1)) == PARM_DECL)
3472 (with { tree base = get_base_address (TREE_OPERAND (@0, 0)); }
3473 (if (TREE_CODE (base) == VAR_DECL
3474 && auto_var_in_fn_p (base, current_function_decl))
3475 (if (cmp == NE_EXPR)
3476 { constant_boolean_node (true, type); }
3477 { constant_boolean_node (false, type); }))))))
3479 /* Equality compare simplifications from fold_binary */
3482 /* If we have (A | C) == D where C & ~D != 0, convert this into 0.
3483 Similarly for NE_EXPR. */
3485 (cmp (convert?@3 (bit_ior @0 INTEGER_CST@1)) INTEGER_CST@2)
3486 (if (tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0))
3487 && wi::bit_and_not (wi::to_wide (@1), wi::to_wide (@2)) != 0)
3488 { constant_boolean_node (cmp == NE_EXPR, type); }))
3490 /* (X ^ Y) == 0 becomes X == Y, and (X ^ Y) != 0 becomes X != Y. */
3492 (cmp (bit_xor @0 @1) integer_zerop)
3495 /* (X ^ Y) == Y becomes X == 0.
3496 Likewise (X ^ Y) == X becomes Y == 0. */
3498 (cmp:c (bit_xor:c @0 @1) @0)
3499 (cmp @1 { build_zero_cst (TREE_TYPE (@1)); }))
3501 /* (X ^ C1) op C2 can be rewritten as X op (C1 ^ C2). */
3503 (cmp (convert?@3 (bit_xor @0 INTEGER_CST@1)) INTEGER_CST@2)
3504 (if (tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0)))
3505 (cmp @0 (bit_xor @1 (convert @2)))))
3508 (cmp (convert? addr@0) integer_zerop)
3509 (if (tree_single_nonzero_warnv_p (@0, NULL))
3510 { constant_boolean_node (cmp == NE_EXPR, type); })))
3512 /* If we have (A & C) == C where C is a power of 2, convert this into
3513 (A & C) != 0. Similarly for NE_EXPR. */
3517 (cmp (bit_and@2 @0 integer_pow2p@1) @1)
3518 (icmp @2 { build_zero_cst (TREE_TYPE (@0)); })))
3520 /* If we have (A & C) != 0 ? D : 0 where C and D are powers of 2,
3521 convert this into a shift followed by ANDing with D. */
3524 (ne (bit_and @0 integer_pow2p@1) integer_zerop)
3525 integer_pow2p@2 integer_zerop)
3527 int shift = (wi::exact_log2 (wi::to_wide (@2))
3528 - wi::exact_log2 (wi::to_wide (@1)));
3532 (lshift (convert @0) { build_int_cst (integer_type_node, shift); }) @2)
3534 (convert (rshift @0 { build_int_cst (integer_type_node, -shift); })) @2))))
3536 /* If we have (A & C) != 0 where C is the sign bit of A, convert
3537 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
3541 (cmp (bit_and (convert?@2 @0) integer_pow2p@1) integer_zerop)
3542 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
3543 && type_has_mode_precision_p (TREE_TYPE (@0))
3544 && element_precision (@2) >= element_precision (@0)
3545 && wi::only_sign_bit_p (wi::to_wide (@1), element_precision (@0)))
3546 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
3547 (ncmp (convert:stype @0) { build_zero_cst (stype); })))))
3549 /* If we have A < 0 ? C : 0 where C is a power of 2, convert
3550 this into a right shift or sign extension followed by ANDing with C. */
3553 (lt @0 integer_zerop)
3554 integer_pow2p@1 integer_zerop)
3555 (if (!TYPE_UNSIGNED (TREE_TYPE (@0)))
3557 int shift = element_precision (@0) - wi::exact_log2 (wi::to_wide (@1)) - 1;
3561 (convert (rshift @0 { build_int_cst (integer_type_node, shift); }))
3563 /* Otherwise ctype must be wider than TREE_TYPE (@0) and pure
3564 sign extension followed by AND with C will achieve the effect. */
3565 (bit_and (convert @0) @1)))))
3567 /* When the addresses are not directly of decls compare base and offset.
3568 This implements some remaining parts of fold_comparison address
3569 comparisons but still no complete part of it. Still it is good
3570 enough to make fold_stmt not regress when not dispatching to fold_binary. */
3571 (for cmp (simple_comparison)
3573 (cmp (convert1?@2 addr@0) (convert2? addr@1))
3576 poly_int64 off0, off1;
3577 tree base0 = get_addr_base_and_unit_offset (TREE_OPERAND (@0, 0), &off0);
3578 tree base1 = get_addr_base_and_unit_offset (TREE_OPERAND (@1, 0), &off1);
3579 if (base0 && TREE_CODE (base0) == MEM_REF)
3581 off0 += mem_ref_offset (base0).force_shwi ();
3582 base0 = TREE_OPERAND (base0, 0);
3584 if (base1 && TREE_CODE (base1) == MEM_REF)
3586 off1 += mem_ref_offset (base1).force_shwi ();
3587 base1 = TREE_OPERAND (base1, 0);
3590 (if (base0 && base1)
3594 /* Punt in GENERIC on variables with value expressions;
3595 the value expressions might point to fields/elements
3596 of other vars etc. */
3598 && ((VAR_P (base0) && DECL_HAS_VALUE_EXPR_P (base0))
3599 || (VAR_P (base1) && DECL_HAS_VALUE_EXPR_P (base1))))
3601 else if (decl_in_symtab_p (base0)
3602 && decl_in_symtab_p (base1))
3603 equal = symtab_node::get_create (base0)
3604 ->equal_address_to (symtab_node::get_create (base1));
3605 else if ((DECL_P (base0)
3606 || TREE_CODE (base0) == SSA_NAME
3607 || TREE_CODE (base0) == STRING_CST)
3609 || TREE_CODE (base1) == SSA_NAME
3610 || TREE_CODE (base1) == STRING_CST))
3611 equal = (base0 == base1);
3614 && (cmp == EQ_EXPR || cmp == NE_EXPR
3615 /* If the offsets are equal we can ignore overflow. */
3616 || known_eq (off0, off1)
3617 || TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
3618 /* Or if we compare using pointers to decls or strings. */
3619 || (POINTER_TYPE_P (TREE_TYPE (@2))
3620 && (DECL_P (base0) || TREE_CODE (base0) == STRING_CST))))
3622 (if (cmp == EQ_EXPR && (known_eq (off0, off1) || known_ne (off0, off1)))
3623 { constant_boolean_node (known_eq (off0, off1), type); })
3624 (if (cmp == NE_EXPR && (known_eq (off0, off1) || known_ne (off0, off1)))
3625 { constant_boolean_node (known_ne (off0, off1), type); })
3626 (if (cmp == LT_EXPR && (known_lt (off0, off1) || known_ge (off0, off1)))
3627 { constant_boolean_node (known_lt (off0, off1), type); })
3628 (if (cmp == LE_EXPR && (known_le (off0, off1) || known_gt (off0, off1)))
3629 { constant_boolean_node (known_le (off0, off1), type); })
3630 (if (cmp == GE_EXPR && (known_ge (off0, off1) || known_lt (off0, off1)))
3631 { constant_boolean_node (known_ge (off0, off1), type); })
3632 (if (cmp == GT_EXPR && (known_gt (off0, off1) || known_le (off0, off1)))
3633 { constant_boolean_node (known_gt (off0, off1), type); }))
3635 && DECL_P (base0) && DECL_P (base1)
3636 /* If we compare this as integers require equal offset. */
3637 && (!INTEGRAL_TYPE_P (TREE_TYPE (@2))
3638 || known_eq (off0, off1)))
3640 (if (cmp == EQ_EXPR)
3641 { constant_boolean_node (false, type); })
3642 (if (cmp == NE_EXPR)
3643 { constant_boolean_node (true, type); })))))))))
3645 /* Simplify pointer equality compares using PTA. */
3649 (if (POINTER_TYPE_P (TREE_TYPE (@0))
3650 && ptrs_compare_unequal (@0, @1))
3651 { neeq == EQ_EXPR ? boolean_false_node : boolean_true_node; })))
3653 /* PR70920: Transform (intptr_t)x eq/ne CST to x eq/ne (typeof x) CST.
3654 and (typeof ptr_cst) x eq/ne ptr_cst to x eq/ne (typeof x) CST.
3655 Disable the transform if either operand is pointer to function.
3656 This broke pr22051-2.c for arm where function pointer
3657 canonicalizaion is not wanted. */
3661 (cmp (convert @0) INTEGER_CST@1)
3662 (if ((POINTER_TYPE_P (TREE_TYPE (@0)) && !FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@0)))
3663 && INTEGRAL_TYPE_P (TREE_TYPE (@1)))
3664 || (INTEGRAL_TYPE_P (TREE_TYPE (@0)) && POINTER_TYPE_P (TREE_TYPE (@1))
3665 && !FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@1)))))
3666 (cmp @0 (convert @1)))))
3668 /* Non-equality compare simplifications from fold_binary */
3669 (for cmp (lt gt le ge)
3670 /* Comparisons with the highest or lowest possible integer of
3671 the specified precision will have known values. */
3673 (cmp (convert?@2 @0) INTEGER_CST@1)
3674 (if ((INTEGRAL_TYPE_P (TREE_TYPE (@1)) || POINTER_TYPE_P (TREE_TYPE (@1)))
3675 && tree_nop_conversion_p (TREE_TYPE (@2), TREE_TYPE (@0)))
3678 tree arg1_type = TREE_TYPE (@1);
3679 unsigned int prec = TYPE_PRECISION (arg1_type);
3680 wide_int max = wi::max_value (arg1_type);
3681 wide_int signed_max = wi::max_value (prec, SIGNED);
3682 wide_int min = wi::min_value (arg1_type);
3685 (if (wi::to_wide (@1) == max)
3687 (if (cmp == GT_EXPR)
3688 { constant_boolean_node (false, type); })
3689 (if (cmp == GE_EXPR)
3691 (if (cmp == LE_EXPR)
3692 { constant_boolean_node (true, type); })
3693 (if (cmp == LT_EXPR)
3695 (if (wi::to_wide (@1) == min)
3697 (if (cmp == LT_EXPR)
3698 { constant_boolean_node (false, type); })
3699 (if (cmp == LE_EXPR)
3701 (if (cmp == GE_EXPR)
3702 { constant_boolean_node (true, type); })
3703 (if (cmp == GT_EXPR)
3705 (if (wi::to_wide (@1) == max - 1)
3707 (if (cmp == GT_EXPR)
3708 (eq @2 { wide_int_to_tree (TREE_TYPE (@1), wi::to_wide (@1) + 1); }))
3709 (if (cmp == LE_EXPR)
3710 (ne @2 { wide_int_to_tree (TREE_TYPE (@1), wi::to_wide (@1) + 1); }))))
3711 (if (wi::to_wide (@1) == min + 1)
3713 (if (cmp == GE_EXPR)
3714 (ne @2 { wide_int_to_tree (TREE_TYPE (@1), wi::to_wide (@1) - 1); }))
3715 (if (cmp == LT_EXPR)
3716 (eq @2 { wide_int_to_tree (TREE_TYPE (@1), wi::to_wide (@1) - 1); }))))
3717 (if (wi::to_wide (@1) == signed_max
3718 && TYPE_UNSIGNED (arg1_type)
3719 /* We will flip the signedness of the comparison operator
3720 associated with the mode of @1, so the sign bit is
3721 specified by this mode. Check that @1 is the signed
3722 max associated with this sign bit. */
3723 && prec == GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (arg1_type))
3724 /* signed_type does not work on pointer types. */
3725 && INTEGRAL_TYPE_P (arg1_type))
3726 /* The following case also applies to X < signed_max+1
3727 and X >= signed_max+1 because previous transformations. */
3728 (if (cmp == LE_EXPR || cmp == GT_EXPR)
3729 (with { tree st = signed_type_for (arg1_type); }
3730 (if (cmp == LE_EXPR)
3731 (ge (convert:st @0) { build_zero_cst (st); })
3732 (lt (convert:st @0) { build_zero_cst (st); }))))))))))
3734 (for cmp (unordered ordered unlt unle ungt unge uneq ltgt)
3735 /* If the second operand is NaN, the result is constant. */
3738 (if (REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
3739 && (cmp != LTGT_EXPR || ! flag_trapping_math))
3740 { constant_boolean_node (cmp == ORDERED_EXPR || cmp == LTGT_EXPR
3741 ? false : true, type); })))
3743 /* bool_var != 0 becomes bool_var. */
3745 (ne @0 integer_zerop)
3746 (if (TREE_CODE (TREE_TYPE (@0)) == BOOLEAN_TYPE
3747 && types_match (type, TREE_TYPE (@0)))
3749 /* bool_var == 1 becomes bool_var. */
3751 (eq @0 integer_onep)
3752 (if (TREE_CODE (TREE_TYPE (@0)) == BOOLEAN_TYPE
3753 && types_match (type, TREE_TYPE (@0)))
3756 bool_var == 0 becomes !bool_var or
3757 bool_var != 1 becomes !bool_var
3758 here because that only is good in assignment context as long
3759 as we require a tcc_comparison in GIMPLE_CONDs where we'd
3760 replace if (x == 0) with tem = ~x; if (tem != 0) which is
3761 clearly less optimal and which we'll transform again in forwprop. */
3763 /* When one argument is a constant, overflow detection can be simplified.
3764 Currently restricted to single use so as not to interfere too much with
3765 ADD_OVERFLOW detection in tree-ssa-math-opts.c.
3766 A + CST CMP A -> A CMP' CST' */
3767 (for cmp (lt le ge gt)
3770 (cmp:c (plus@2 @0 INTEGER_CST@1) @0)
3771 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
3772 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))
3773 && wi::to_wide (@1) != 0
3775 (with { unsigned int prec = TYPE_PRECISION (TREE_TYPE (@0)); }
3776 (out @0 { wide_int_to_tree (TREE_TYPE (@0),
3777 wi::max_value (prec, UNSIGNED)
3778 - wi::to_wide (@1)); })))))
3780 /* To detect overflow in unsigned A - B, A < B is simpler than A - B > A.
3781 However, the detection logic for SUB_OVERFLOW in tree-ssa-math-opts.c
3782 expects the long form, so we restrict the transformation for now. */
3785 (cmp:c (minus@2 @0 @1) @0)
3786 (if (single_use (@2)
3787 && ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3788 && TYPE_UNSIGNED (TREE_TYPE (@0))
3789 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
3792 /* Testing for overflow is unnecessary if we already know the result. */
3797 (cmp:c (realpart (IFN_SUB_OVERFLOW@2 @0 @1)) @0)
3798 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
3799 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
3800 (out (imagpart @2) { build_zero_cst (TREE_TYPE (@0)); }))))
3805 (cmp:c (realpart (IFN_ADD_OVERFLOW:c@2 @0 @1)) @0)
3806 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
3807 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
3808 (out (imagpart @2) { build_zero_cst (TREE_TYPE (@0)); }))))
3810 /* For unsigned operands, -1 / B < A checks whether A * B would overflow.
3811 Simplify it to __builtin_mul_overflow (A, B, <unused>). */
3815 (cmp:c (trunc_div:s integer_all_onesp @1) @0)
3816 (if (TYPE_UNSIGNED (TREE_TYPE (@0)) && !VECTOR_TYPE_P (TREE_TYPE (@0)))
3817 (with { tree t = TREE_TYPE (@0), cpx = build_complex_type (t); }
3818 (out (imagpart (IFN_MUL_OVERFLOW:cpx @0 @1)) { build_zero_cst (t); })))))
3820 /* Simplification of math builtins. These rules must all be optimizations
3821 as well as IL simplifications. If there is a possibility that the new
3822 form could be a pessimization, the rule should go in the canonicalization
3823 section that follows this one.
3825 Rules can generally go in this section if they satisfy one of
3828 - the rule describes an identity
3830 - the rule replaces calls with something as simple as addition or
3833 - the rule contains unary calls only and simplifies the surrounding
3834 arithmetic. (The idea here is to exclude non-unary calls in which
3835 one operand is constant and in which the call is known to be cheap
3836 when the operand has that value.) */
3838 (if (flag_unsafe_math_optimizations)
3839 /* Simplify sqrt(x) * sqrt(x) -> x. */
3841 (mult (SQRT_ALL@1 @0) @1)
3842 (if (!HONOR_SNANS (type))
3845 (for op (plus minus)
3846 /* Simplify (A / C) +- (B / C) -> (A +- B) / C. */
3850 (rdiv (op @0 @2) @1)))
3852 /* Simplify sqrt(x) * sqrt(y) -> sqrt(x*y). */
3853 (for root (SQRT CBRT)
3855 (mult (root:s @0) (root:s @1))
3856 (root (mult @0 @1))))
3858 /* Simplify expN(x) * expN(y) -> expN(x+y). */
3859 (for exps (EXP EXP2 EXP10 POW10)
3861 (mult (exps:s @0) (exps:s @1))
3862 (exps (plus @0 @1))))
3864 /* Simplify a/root(b/c) into a*root(c/b). */
3865 (for root (SQRT CBRT)
3867 (rdiv @0 (root:s (rdiv:s @1 @2)))
3868 (mult @0 (root (rdiv @2 @1)))))
3870 /* Simplify x/expN(y) into x*expN(-y). */
3871 (for exps (EXP EXP2 EXP10 POW10)
3873 (rdiv @0 (exps:s @1))
3874 (mult @0 (exps (negate @1)))))
3876 (for logs (LOG LOG2 LOG10 LOG10)
3877 exps (EXP EXP2 EXP10 POW10)
3878 /* logN(expN(x)) -> x. */
3882 /* expN(logN(x)) -> x. */
3887 /* Optimize logN(func()) for various exponential functions. We
3888 want to determine the value "x" and the power "exponent" in
3889 order to transform logN(x**exponent) into exponent*logN(x). */
3890 (for logs (LOG LOG LOG LOG2 LOG2 LOG2 LOG10 LOG10)
3891 exps (EXP2 EXP10 POW10 EXP EXP10 POW10 EXP EXP2)
3894 (if (SCALAR_FLOAT_TYPE_P (type))
3900 /* Prepare to do logN(exp(exponent)) -> exponent*logN(e). */
3901 x = build_real_truncate (type, dconst_e ());
3904 /* Prepare to do logN(exp2(exponent)) -> exponent*logN(2). */
3905 x = build_real (type, dconst2);
3909 /* Prepare to do logN(exp10(exponent)) -> exponent*logN(10). */
3911 REAL_VALUE_TYPE dconst10;
3912 real_from_integer (&dconst10, VOIDmode, 10, SIGNED);
3913 x = build_real (type, dconst10);
3920 (mult (logs { x; }) @0)))))
3928 (if (SCALAR_FLOAT_TYPE_P (type))
3934 /* Prepare to do logN(sqrt(x)) -> 0.5*logN(x). */
3935 x = build_real (type, dconsthalf);
3938 /* Prepare to do logN(cbrt(x)) -> (1/3)*logN(x). */
3939 x = build_real_truncate (type, dconst_third ());
3945 (mult { x; } (logs @0))))))
3947 /* logN(pow(x,exponent)) -> exponent*logN(x). */
3948 (for logs (LOG LOG2 LOG10)
3952 (mult @1 (logs @0))))
3954 /* pow(C,x) -> exp(log(C)*x) if C > 0. */
3959 (pows REAL_CST@0 @1)
3960 (if (real_compare (GT_EXPR, TREE_REAL_CST_PTR (@0), &dconst0)
3961 && real_isfinite (TREE_REAL_CST_PTR (@0)))
3962 (exps (mult (logs @0) @1)))))
3967 exps (EXP EXP2 EXP10 POW10)
3968 /* sqrt(expN(x)) -> expN(x*0.5). */
3971 (exps (mult @0 { build_real (type, dconsthalf); })))
3972 /* cbrt(expN(x)) -> expN(x/3). */
3975 (exps (mult @0 { build_real_truncate (type, dconst_third ()); })))
3976 /* pow(expN(x), y) -> expN(x*y). */
3979 (exps (mult @0 @1))))
3981 /* tan(atan(x)) -> x. */
3988 /* cabs(x+0i) or cabs(0+xi) -> abs(x). */
3990 (CABS (complex:C @0 real_zerop@1))
3993 /* trunc(trunc(x)) -> trunc(x), etc. */
3994 (for fns (TRUNC_ALL FLOOR_ALL CEIL_ALL ROUND_ALL NEARBYINT_ALL RINT_ALL)
3998 /* f(x) -> x if x is integer valued and f does nothing for such values. */
3999 (for fns (TRUNC_ALL FLOOR_ALL CEIL_ALL ROUND_ALL NEARBYINT_ALL RINT_ALL)
4001 (fns integer_valued_real_p@0)
4004 /* hypot(x,0) and hypot(0,x) -> abs(x). */
4006 (HYPOT:c @0 real_zerop@1)
4009 /* pow(1,x) -> 1. */
4011 (POW real_onep@0 @1)
4015 /* copysign(x,x) -> x. */
4016 (COPYSIGN_ALL @0 @0)
4020 /* copysign(x,y) -> fabs(x) if y is nonnegative. */
4021 (COPYSIGN_ALL @0 tree_expr_nonnegative_p@1)
4024 (for scale (LDEXP SCALBN SCALBLN)
4025 /* ldexp(0, x) -> 0. */
4027 (scale real_zerop@0 @1)
4029 /* ldexp(x, 0) -> x. */
4031 (scale @0 integer_zerop@1)
4033 /* ldexp(x, y) -> x if x is +-Inf or NaN. */
4035 (scale REAL_CST@0 @1)
4036 (if (!real_isfinite (TREE_REAL_CST_PTR (@0)))
4039 /* Canonicalization of sequences of math builtins. These rules represent
4040 IL simplifications but are not necessarily optimizations.
4042 The sincos pass is responsible for picking "optimal" implementations
4043 of math builtins, which may be more complicated and can sometimes go
4044 the other way, e.g. converting pow into a sequence of sqrts.
4045 We only want to do these canonicalizations before the pass has run. */
4047 (if (flag_unsafe_math_optimizations && canonicalize_math_p ())
4048 /* Simplify tan(x) * cos(x) -> sin(x). */
4050 (mult:c (TAN:s @0) (COS:s @0))
4053 /* Simplify x * pow(x,c) -> pow(x,c+1). */
4055 (mult:c @0 (POW:s @0 REAL_CST@1))
4056 (if (!TREE_OVERFLOW (@1))
4057 (POW @0 (plus @1 { build_one_cst (type); }))))
4059 /* Simplify sin(x) / cos(x) -> tan(x). */
4061 (rdiv (SIN:s @0) (COS:s @0))
4064 /* Simplify cos(x) / sin(x) -> 1 / tan(x). */
4066 (rdiv (COS:s @0) (SIN:s @0))
4067 (rdiv { build_one_cst (type); } (TAN @0)))
4069 /* Simplify sin(x) / tan(x) -> cos(x). */
4071 (rdiv (SIN:s @0) (TAN:s @0))
4072 (if (! HONOR_NANS (@0)
4073 && ! HONOR_INFINITIES (@0))
4076 /* Simplify tan(x) / sin(x) -> 1.0 / cos(x). */
4078 (rdiv (TAN:s @0) (SIN:s @0))
4079 (if (! HONOR_NANS (@0)
4080 && ! HONOR_INFINITIES (@0))
4081 (rdiv { build_one_cst (type); } (COS @0))))
4083 /* Simplify pow(x,y) * pow(x,z) -> pow(x,y+z). */
4085 (mult (POW:s @0 @1) (POW:s @0 @2))
4086 (POW @0 (plus @1 @2)))
4088 /* Simplify pow(x,y) * pow(z,y) -> pow(x*z,y). */
4090 (mult (POW:s @0 @1) (POW:s @2 @1))
4091 (POW (mult @0 @2) @1))
4093 /* Simplify powi(x,y) * powi(z,y) -> powi(x*z,y). */
4095 (mult (POWI:s @0 @1) (POWI:s @2 @1))
4096 (POWI (mult @0 @2) @1))
4098 /* Simplify pow(x,c) / x -> pow(x,c-1). */
4100 (rdiv (POW:s @0 REAL_CST@1) @0)
4101 (if (!TREE_OVERFLOW (@1))
4102 (POW @0 (minus @1 { build_one_cst (type); }))))
4104 /* Simplify x / pow (y,z) -> x * pow(y,-z). */
4106 (rdiv @0 (POW:s @1 @2))
4107 (mult @0 (POW @1 (negate @2))))
4112 /* sqrt(sqrt(x)) -> pow(x,1/4). */
4115 (pows @0 { build_real (type, dconst_quarter ()); }))
4116 /* sqrt(cbrt(x)) -> pow(x,1/6). */
4119 (pows @0 { build_real_truncate (type, dconst_sixth ()); }))
4120 /* cbrt(sqrt(x)) -> pow(x,1/6). */
4123 (pows @0 { build_real_truncate (type, dconst_sixth ()); }))
4124 /* cbrt(cbrt(x)) -> pow(x,1/9), iff x is nonnegative. */
4126 (cbrts (cbrts tree_expr_nonnegative_p@0))
4127 (pows @0 { build_real_truncate (type, dconst_ninth ()); }))
4128 /* sqrt(pow(x,y)) -> pow(|x|,y*0.5). */
4130 (sqrts (pows @0 @1))
4131 (pows (abs @0) (mult @1 { build_real (type, dconsthalf); })))
4132 /* cbrt(pow(x,y)) -> pow(x,y/3), iff x is nonnegative. */
4134 (cbrts (pows tree_expr_nonnegative_p@0 @1))
4135 (pows @0 (mult @1 { build_real_truncate (type, dconst_third ()); })))
4136 /* pow(sqrt(x),y) -> pow(x,y*0.5). */
4138 (pows (sqrts @0) @1)
4139 (pows @0 (mult @1 { build_real (type, dconsthalf); })))
4140 /* pow(cbrt(x),y) -> pow(x,y/3) iff x is nonnegative. */
4142 (pows (cbrts tree_expr_nonnegative_p@0) @1)
4143 (pows @0 (mult @1 { build_real_truncate (type, dconst_third ()); })))
4144 /* pow(pow(x,y),z) -> pow(x,y*z) iff x is nonnegative. */
4146 (pows (pows tree_expr_nonnegative_p@0 @1) @2)
4147 (pows @0 (mult @1 @2))))
4149 /* cabs(x+xi) -> fabs(x)*sqrt(2). */
4151 (CABS (complex @0 @0))
4152 (mult (abs @0) { build_real_truncate (type, dconst_sqrt2 ()); }))
4154 /* hypot(x,x) -> fabs(x)*sqrt(2). */
4157 (mult (abs @0) { build_real_truncate (type, dconst_sqrt2 ()); }))
4159 /* cexp(x+yi) -> exp(x)*cexpi(y). */
4164 (cexps compositional_complex@0)
4165 (if (targetm.libc_has_function (function_c99_math_complex))
4167 (mult (exps@1 (realpart @0)) (realpart (cexpis:type@2 (imagpart @0))))
4168 (mult @1 (imagpart @2)))))))
4170 (if (canonicalize_math_p ())
4171 /* floor(x) -> trunc(x) if x is nonnegative. */
4172 (for floors (FLOOR_ALL)
4175 (floors tree_expr_nonnegative_p@0)
4178 (match double_value_p
4180 (if (TYPE_MAIN_VARIANT (TREE_TYPE (@0)) == double_type_node)))
4181 (for froms (BUILT_IN_TRUNCL
4193 /* truncl(extend(x)) -> extend(trunc(x)), etc., if x is a double. */
4194 (if (optimize && canonicalize_math_p ())
4196 (froms (convert double_value_p@0))
4197 (convert (tos @0)))))
4199 (match float_value_p
4201 (if (TYPE_MAIN_VARIANT (TREE_TYPE (@0)) == float_type_node)))
4202 (for froms (BUILT_IN_TRUNCL BUILT_IN_TRUNC
4203 BUILT_IN_FLOORL BUILT_IN_FLOOR
4204 BUILT_IN_CEILL BUILT_IN_CEIL
4205 BUILT_IN_ROUNDL BUILT_IN_ROUND
4206 BUILT_IN_NEARBYINTL BUILT_IN_NEARBYINT
4207 BUILT_IN_RINTL BUILT_IN_RINT)
4208 tos (BUILT_IN_TRUNCF BUILT_IN_TRUNCF
4209 BUILT_IN_FLOORF BUILT_IN_FLOORF
4210 BUILT_IN_CEILF BUILT_IN_CEILF
4211 BUILT_IN_ROUNDF BUILT_IN_ROUNDF
4212 BUILT_IN_NEARBYINTF BUILT_IN_NEARBYINTF
4213 BUILT_IN_RINTF BUILT_IN_RINTF)
4214 /* truncl(extend(x)) and trunc(extend(x)) -> extend(truncf(x)), etc.,
4216 (if (optimize && canonicalize_math_p ()
4217 && targetm.libc_has_function (function_c99_misc))
4219 (froms (convert float_value_p@0))
4220 (convert (tos @0)))))
4222 (for froms (XFLOORL XCEILL XROUNDL XRINTL)
4223 tos (XFLOOR XCEIL XROUND XRINT)
4224 /* llfloorl(extend(x)) -> llfloor(x), etc., if x is a double. */
4225 (if (optimize && canonicalize_math_p ())
4227 (froms (convert double_value_p@0))
4230 (for froms (XFLOORL XCEILL XROUNDL XRINTL
4231 XFLOOR XCEIL XROUND XRINT)
4232 tos (XFLOORF XCEILF XROUNDF XRINTF)
4233 /* llfloorl(extend(x)) and llfloor(extend(x)) -> llfloorf(x), etc.,
4235 (if (optimize && canonicalize_math_p ())
4237 (froms (convert float_value_p@0))
4240 (if (canonicalize_math_p ())
4241 /* xfloor(x) -> fix_trunc(x) if x is nonnegative. */
4242 (for floors (IFLOOR LFLOOR LLFLOOR)
4244 (floors tree_expr_nonnegative_p@0)
4247 (if (canonicalize_math_p ())
4248 /* xfloor(x) -> fix_trunc(x), etc., if x is integer valued. */
4249 (for fns (IFLOOR LFLOOR LLFLOOR
4251 IROUND LROUND LLROUND)
4253 (fns integer_valued_real_p@0)
4255 (if (!flag_errno_math)
4256 /* xrint(x) -> fix_trunc(x), etc., if x is integer valued. */
4257 (for rints (IRINT LRINT LLRINT)
4259 (rints integer_valued_real_p@0)
4262 (if (canonicalize_math_p ())
4263 (for ifn (IFLOOR ICEIL IROUND IRINT)
4264 lfn (LFLOOR LCEIL LROUND LRINT)
4265 llfn (LLFLOOR LLCEIL LLROUND LLRINT)
4266 /* Canonicalize iround (x) to lround (x) on ILP32 targets where
4267 sizeof (int) == sizeof (long). */
4268 (if (TYPE_PRECISION (integer_type_node)
4269 == TYPE_PRECISION (long_integer_type_node))
4272 (lfn:long_integer_type_node @0)))
4273 /* Canonicalize llround (x) to lround (x) on LP64 targets where
4274 sizeof (long long) == sizeof (long). */
4275 (if (TYPE_PRECISION (long_long_integer_type_node)
4276 == TYPE_PRECISION (long_integer_type_node))
4279 (lfn:long_integer_type_node @0)))))
4281 /* cproj(x) -> x if we're ignoring infinities. */
4284 (if (!HONOR_INFINITIES (type))
4287 /* If the real part is inf and the imag part is known to be
4288 nonnegative, return (inf + 0i). */
4290 (CPROJ (complex REAL_CST@0 tree_expr_nonnegative_p@1))
4291 (if (real_isinf (TREE_REAL_CST_PTR (@0)))
4292 { build_complex_inf (type, false); }))
4294 /* If the imag part is inf, return (inf+I*copysign(0,imag)). */
4296 (CPROJ (complex @0 REAL_CST@1))
4297 (if (real_isinf (TREE_REAL_CST_PTR (@1)))
4298 { build_complex_inf (type, TREE_REAL_CST_PTR (@1)->sign); }))
4304 (pows @0 REAL_CST@1)
4306 const REAL_VALUE_TYPE *value = TREE_REAL_CST_PTR (@1);
4307 REAL_VALUE_TYPE tmp;
4310 /* pow(x,0) -> 1. */
4311 (if (real_equal (value, &dconst0))
4312 { build_real (type, dconst1); })
4313 /* pow(x,1) -> x. */
4314 (if (real_equal (value, &dconst1))
4316 /* pow(x,-1) -> 1/x. */
4317 (if (real_equal (value, &dconstm1))
4318 (rdiv { build_real (type, dconst1); } @0))
4319 /* pow(x,0.5) -> sqrt(x). */
4320 (if (flag_unsafe_math_optimizations
4321 && canonicalize_math_p ()
4322 && real_equal (value, &dconsthalf))
4324 /* pow(x,1/3) -> cbrt(x). */
4325 (if (flag_unsafe_math_optimizations
4326 && canonicalize_math_p ()
4327 && (tmp = real_value_truncate (TYPE_MODE (type), dconst_third ()),
4328 real_equal (value, &tmp)))
4331 /* powi(1,x) -> 1. */
4333 (POWI real_onep@0 @1)
4337 (POWI @0 INTEGER_CST@1)
4339 /* powi(x,0) -> 1. */
4340 (if (wi::to_wide (@1) == 0)
4341 { build_real (type, dconst1); })
4342 /* powi(x,1) -> x. */
4343 (if (wi::to_wide (@1) == 1)
4345 /* powi(x,-1) -> 1/x. */
4346 (if (wi::to_wide (@1) == -1)
4347 (rdiv { build_real (type, dconst1); } @0))))
4349 /* Narrowing of arithmetic and logical operations.
4351 These are conceptually similar to the transformations performed for
4352 the C/C++ front-ends by shorten_binary_op and shorten_compare. Long
4353 term we want to move all that code out of the front-ends into here. */
4355 /* If we have a narrowing conversion of an arithmetic operation where
4356 both operands are widening conversions from the same type as the outer
4357 narrowing conversion. Then convert the innermost operands to a suitable
4358 unsigned type (to avoid introducing undefined behavior), perform the
4359 operation and convert the result to the desired type. */
4360 (for op (plus minus)
4362 (convert (op:s (convert@2 @0) (convert?@3 @1)))
4363 (if (INTEGRAL_TYPE_P (type)
4364 /* We check for type compatibility between @0 and @1 below,
4365 so there's no need to check that @1/@3 are integral types. */
4366 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
4367 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
4368 /* The precision of the type of each operand must match the
4369 precision of the mode of each operand, similarly for the
4371 && type_has_mode_precision_p (TREE_TYPE (@0))
4372 && type_has_mode_precision_p (TREE_TYPE (@1))
4373 && type_has_mode_precision_p (type)
4374 /* The inner conversion must be a widening conversion. */
4375 && TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (TREE_TYPE (@0))
4376 && types_match (@0, type)
4377 && (types_match (@0, @1)
4378 /* Or the second operand is const integer or converted const
4379 integer from valueize. */
4380 || TREE_CODE (@1) == INTEGER_CST))
4381 (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
4382 (op @0 (convert @1))
4383 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
4384 (convert (op (convert:utype @0)
4385 (convert:utype @1))))))))
4387 /* This is another case of narrowing, specifically when there's an outer
4388 BIT_AND_EXPR which masks off bits outside the type of the innermost
4389 operands. Like the previous case we have to convert the operands
4390 to unsigned types to avoid introducing undefined behavior for the
4391 arithmetic operation. */
4392 (for op (minus plus)
4394 (bit_and (op:s (convert@2 @0) (convert@3 @1)) INTEGER_CST@4)
4395 (if (INTEGRAL_TYPE_P (type)
4396 /* We check for type compatibility between @0 and @1 below,
4397 so there's no need to check that @1/@3 are integral types. */
4398 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
4399 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
4400 /* The precision of the type of each operand must match the
4401 precision of the mode of each operand, similarly for the
4403 && type_has_mode_precision_p (TREE_TYPE (@0))
4404 && type_has_mode_precision_p (TREE_TYPE (@1))
4405 && type_has_mode_precision_p (type)
4406 /* The inner conversion must be a widening conversion. */
4407 && TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (TREE_TYPE (@0))
4408 && types_match (@0, @1)
4409 && (tree_int_cst_min_precision (@4, TYPE_SIGN (TREE_TYPE (@0)))
4410 <= TYPE_PRECISION (TREE_TYPE (@0)))
4411 && (wi::to_wide (@4)
4412 & wi::mask (TYPE_PRECISION (TREE_TYPE (@0)),
4413 true, TYPE_PRECISION (type))) == 0)
4414 (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
4415 (with { tree ntype = TREE_TYPE (@0); }
4416 (convert (bit_and (op @0 @1) (convert:ntype @4))))
4417 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
4418 (convert (bit_and (op (convert:utype @0) (convert:utype @1))
4419 (convert:utype @4))))))))
4421 /* Transform (@0 < @1 and @0 < @2) to use min,
4422 (@0 > @1 and @0 > @2) to use max */
4423 (for op (lt le gt ge)
4424 ext (min min max max)
4426 (bit_and (op:cs @0 @1) (op:cs @0 @2))
4427 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
4428 && TREE_CODE (@0) != INTEGER_CST)
4429 (op @0 (ext @1 @2)))))
4432 /* signbit(x) -> 0 if x is nonnegative. */
4433 (SIGNBIT tree_expr_nonnegative_p@0)
4434 { integer_zero_node; })
4437 /* signbit(x) -> x<0 if x doesn't have signed zeros. */
4439 (if (!HONOR_SIGNED_ZEROS (@0))
4440 (convert (lt @0 { build_real (TREE_TYPE (@0), dconst0); }))))
4442 /* Transform comparisons of the form X +- C1 CMP C2 to X CMP C2 -+ C1. */
4444 (for op (plus minus)
4447 (cmp (op@3 @0 INTEGER_CST@1) INTEGER_CST@2)
4448 (if (!TREE_OVERFLOW (@1) && !TREE_OVERFLOW (@2)
4449 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0))
4450 && !TYPE_OVERFLOW_TRAPS (TREE_TYPE (@0))
4451 && !TYPE_SATURATING (TREE_TYPE (@0)))
4452 (with { tree res = int_const_binop (rop, @2, @1); }
4453 (if (TREE_OVERFLOW (res)
4454 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
4455 { constant_boolean_node (cmp == NE_EXPR, type); }
4456 (if (single_use (@3))
4457 (cmp @0 { TREE_OVERFLOW (res)
4458 ? drop_tree_overflow (res) : res; }))))))))
4459 (for cmp (lt le gt ge)
4460 (for op (plus minus)
4463 (cmp (op@3 @0 INTEGER_CST@1) INTEGER_CST@2)
4464 (if (!TREE_OVERFLOW (@1) && !TREE_OVERFLOW (@2)
4465 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
4466 (with { tree res = int_const_binop (rop, @2, @1); }
4467 (if (TREE_OVERFLOW (res))
4469 fold_overflow_warning (("assuming signed overflow does not occur "
4470 "when simplifying conditional to constant"),
4471 WARN_STRICT_OVERFLOW_CONDITIONAL);
4472 bool less = cmp == LE_EXPR || cmp == LT_EXPR;
4473 /* wi::ges_p (@2, 0) should be sufficient for a signed type. */
4474 bool ovf_high = wi::lt_p (wi::to_wide (@1), 0,
4475 TYPE_SIGN (TREE_TYPE (@1)))
4476 != (op == MINUS_EXPR);
4477 constant_boolean_node (less == ovf_high, type);
4479 (if (single_use (@3))
4482 fold_overflow_warning (("assuming signed overflow does not occur "
4483 "when changing X +- C1 cmp C2 to "
4485 WARN_STRICT_OVERFLOW_COMPARISON);
4487 (cmp @0 { res; })))))))))
4489 /* Canonicalizations of BIT_FIELD_REFs. */
4492 (BIT_FIELD_REF @0 @1 @2)
4494 (if (TREE_CODE (TREE_TYPE (@0)) == COMPLEX_TYPE
4495 && tree_int_cst_equal (@1, TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0)))))
4497 (if (integer_zerop (@2))
4498 (view_convert (realpart @0)))
4499 (if (tree_int_cst_equal (@2, TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0)))))
4500 (view_convert (imagpart @0)))))
4501 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
4502 && INTEGRAL_TYPE_P (type)
4503 /* On GIMPLE this should only apply to register arguments. */
4504 && (! GIMPLE || is_gimple_reg (@0))
4505 /* A bit-field-ref that referenced the full argument can be stripped. */
4506 && ((compare_tree_int (@1, TYPE_PRECISION (TREE_TYPE (@0))) == 0
4507 && integer_zerop (@2))
4508 /* Low-parts can be reduced to integral conversions.
4509 ??? The following doesn't work for PDP endian. */
4510 || (BYTES_BIG_ENDIAN == WORDS_BIG_ENDIAN
4511 /* Don't even think about BITS_BIG_ENDIAN. */
4512 && TYPE_PRECISION (TREE_TYPE (@0)) % BITS_PER_UNIT == 0
4513 && TYPE_PRECISION (type) % BITS_PER_UNIT == 0
4514 && compare_tree_int (@2, (BYTES_BIG_ENDIAN
4515 ? (TYPE_PRECISION (TREE_TYPE (@0))
4516 - TYPE_PRECISION (type))
4520 /* Simplify vector extracts. */
4523 (BIT_FIELD_REF CONSTRUCTOR@0 @1 @2)
4524 (if (VECTOR_TYPE_P (TREE_TYPE (@0))
4525 && (types_match (type, TREE_TYPE (TREE_TYPE (@0)))
4526 || (VECTOR_TYPE_P (type)
4527 && types_match (TREE_TYPE (type), TREE_TYPE (TREE_TYPE (@0))))))
4530 tree ctor = (TREE_CODE (@0) == SSA_NAME
4531 ? gimple_assign_rhs1 (SSA_NAME_DEF_STMT (@0)) : @0);
4532 tree eltype = TREE_TYPE (TREE_TYPE (ctor));
4533 unsigned HOST_WIDE_INT width = tree_to_uhwi (TYPE_SIZE (eltype));
4534 unsigned HOST_WIDE_INT n = tree_to_uhwi (@1);
4535 unsigned HOST_WIDE_INT idx = tree_to_uhwi (@2);
4538 && (idx % width) == 0
4540 && known_le ((idx + n) / width,
4541 TYPE_VECTOR_SUBPARTS (TREE_TYPE (ctor))))
4546 /* Constructor elements can be subvectors. */
4548 if (CONSTRUCTOR_NELTS (ctor) != 0)
4550 tree cons_elem = TREE_TYPE (CONSTRUCTOR_ELT (ctor, 0)->value);
4551 if (TREE_CODE (cons_elem) == VECTOR_TYPE)
4552 k = TYPE_VECTOR_SUBPARTS (cons_elem);
4554 unsigned HOST_WIDE_INT elt, count, const_k;
4557 /* We keep an exact subset of the constructor elements. */
4558 (if (multiple_p (idx, k, &elt) && multiple_p (n, k, &count))
4559 (if (CONSTRUCTOR_NELTS (ctor) == 0)
4560 { build_constructor (type, NULL); }
4562 (if (elt < CONSTRUCTOR_NELTS (ctor))
4563 { CONSTRUCTOR_ELT (ctor, elt)->value; }
4564 { build_zero_cst (type); })
4566 vec<constructor_elt, va_gc> *vals;
4567 vec_alloc (vals, count);
4568 for (unsigned i = 0;
4569 i < count && elt + i < CONSTRUCTOR_NELTS (ctor); ++i)
4570 CONSTRUCTOR_APPEND_ELT (vals, NULL_TREE,
4571 CONSTRUCTOR_ELT (ctor, elt + i)->value);
4572 build_constructor (type, vals);
4574 /* The bitfield references a single constructor element. */
4575 (if (k.is_constant (&const_k)
4576 && idx + n <= (idx / const_k + 1) * const_k)
4578 (if (CONSTRUCTOR_NELTS (ctor) <= idx / const_k)
4579 { build_zero_cst (type); })
4581 { CONSTRUCTOR_ELT (ctor, idx / const_k)->value; })
4582 (BIT_FIELD_REF { CONSTRUCTOR_ELT (ctor, idx / const_k)->value; }
4583 @1 { bitsize_int ((idx % const_k) * width); })))))))))
4585 /* Simplify a bit extraction from a bit insertion for the cases with
4586 the inserted element fully covering the extraction or the insertion
4587 not touching the extraction. */
4589 (BIT_FIELD_REF (bit_insert @0 @1 @ipos) @rsize @rpos)
4592 unsigned HOST_WIDE_INT isize;
4593 if (INTEGRAL_TYPE_P (TREE_TYPE (@1)))
4594 isize = TYPE_PRECISION (TREE_TYPE (@1));
4596 isize = tree_to_uhwi (TYPE_SIZE (TREE_TYPE (@1)));
4599 (if (wi::leu_p (wi::to_wide (@ipos), wi::to_wide (@rpos))
4600 && wi::leu_p (wi::to_wide (@rpos) + wi::to_wide (@rsize),
4601 wi::to_wide (@ipos) + isize))
4602 (BIT_FIELD_REF @1 @rsize { wide_int_to_tree (bitsizetype,
4604 - wi::to_wide (@ipos)); }))
4605 (if (wi::geu_p (wi::to_wide (@ipos),
4606 wi::to_wide (@rpos) + wi::to_wide (@rsize))
4607 || wi::geu_p (wi::to_wide (@rpos),
4608 wi::to_wide (@ipos) + isize))
4609 (BIT_FIELD_REF @0 @rsize @rpos)))))