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-2017 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 && TYPE_VECTOR_SUBPARTS (type) == TYPE_VECTOR_SUBPARTS (TREE_TYPE (@0))
87 && tree_nop_conversion_p (TREE_TYPE (type), TREE_TYPE (TREE_TYPE (@0))))))
88 /* This one has to be last, or it shadows the others. */
89 (match (nop_convert @0)
92 /* Simplifications of operations with one constant operand and
93 simplifications to constants or single values. */
95 (for op (plus pointer_plus minus bit_ior bit_xor)
100 /* 0 +p index -> (type)index */
102 (pointer_plus integer_zerop @1)
103 (non_lvalue (convert @1)))
105 /* ptr - 0 -> (type)ptr */
107 (pointer_diff @0 integer_zerop)
110 /* See if ARG1 is zero and X + ARG1 reduces to X.
111 Likewise if the operands are reversed. */
113 (plus:c @0 real_zerop@1)
114 (if (fold_real_zero_addition_p (type, @1, 0))
117 /* See if ARG1 is zero and X - ARG1 reduces to X. */
119 (minus @0 real_zerop@1)
120 (if (fold_real_zero_addition_p (type, @1, 1))
124 This is unsafe for certain floats even in non-IEEE formats.
125 In IEEE, it is unsafe because it does wrong for NaNs.
126 Also note that operand_equal_p is always false if an operand
130 (if (!FLOAT_TYPE_P (type) || !HONOR_NANS (type))
131 { build_zero_cst (type); }))
133 (pointer_diff @@0 @0)
134 { build_zero_cst (type); })
137 (mult @0 integer_zerop@1)
140 /* Maybe fold x * 0 to 0. The expressions aren't the same
141 when x is NaN, since x * 0 is also NaN. Nor are they the
142 same in modes with signed zeros, since multiplying a
143 negative value by 0 gives -0, not +0. */
145 (mult @0 real_zerop@1)
146 (if (!HONOR_NANS (type) && !HONOR_SIGNED_ZEROS (type))
149 /* In IEEE floating point, x*1 is not equivalent to x for snans.
150 Likewise for complex arithmetic with signed zeros. */
153 (if (!HONOR_SNANS (type)
154 && (!HONOR_SIGNED_ZEROS (type)
155 || !COMPLEX_FLOAT_TYPE_P (type)))
158 /* Transform x * -1.0 into -x. */
160 (mult @0 real_minus_onep)
161 (if (!HONOR_SNANS (type)
162 && (!HONOR_SIGNED_ZEROS (type)
163 || !COMPLEX_FLOAT_TYPE_P (type)))
166 (for cmp (gt ge lt le)
167 outp (convert convert negate negate)
168 outn (negate negate convert convert)
169 /* Transform (X > 0.0 ? 1.0 : -1.0) into copysign(1, X). */
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). */
174 (cond (cmp @0 real_zerop) real_onep@1 real_minus_onep)
175 (if (!HONOR_NANS (type) && !HONOR_SIGNED_ZEROS (type)
176 && types_match (type, TREE_TYPE (@0)))
178 (if (types_match (type, float_type_node))
179 (BUILT_IN_COPYSIGNF @1 (outp @0)))
180 (if (types_match (type, double_type_node))
181 (BUILT_IN_COPYSIGN @1 (outp @0)))
182 (if (types_match (type, long_double_type_node))
183 (BUILT_IN_COPYSIGNL @1 (outp @0))))))
184 /* Transform (X > 0.0 ? -1.0 : 1.0) into copysign(1,-X). */
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). */
189 (cond (cmp @0 real_zerop) real_minus_onep real_onep@1)
190 (if (!HONOR_NANS (type) && !HONOR_SIGNED_ZEROS (type)
191 && types_match (type, TREE_TYPE (@0)))
193 (if (types_match (type, float_type_node))
194 (BUILT_IN_COPYSIGNF @1 (outn @0)))
195 (if (types_match (type, double_type_node))
196 (BUILT_IN_COPYSIGN @1 (outn @0)))
197 (if (types_match (type, long_double_type_node))
198 (BUILT_IN_COPYSIGNL @1 (outn @0)))))))
200 /* Transform X * copysign (1.0, X) into abs(X). */
202 (mult:c @0 (COPYSIGN_ALL real_onep @0))
203 (if (!HONOR_NANS (type) && !HONOR_SIGNED_ZEROS (type))
206 /* Transform X * copysign (1.0, -X) into -abs(X). */
208 (mult:c @0 (COPYSIGN_ALL real_onep (negate @0)))
209 (if (!HONOR_NANS (type) && !HONOR_SIGNED_ZEROS (type))
212 /* Transform copysign (CST, X) into copysign (ABS(CST), X). */
214 (COPYSIGN_ALL REAL_CST@0 @1)
215 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@0)))
216 (COPYSIGN_ALL (negate @0) @1)))
218 /* X * 1, X / 1 -> X. */
219 (for op (mult trunc_div ceil_div floor_div round_div exact_div)
224 /* (A / (1 << B)) -> (A >> B).
225 Only for unsigned A. For signed A, this would not preserve rounding
227 For example: (-1 / ( 1 << B)) != -1 >> B. */
229 (trunc_div @0 (lshift integer_onep@1 @2))
230 (if ((TYPE_UNSIGNED (type) || tree_expr_nonnegative_p (@0))
231 && (!VECTOR_TYPE_P (type)
232 || target_supports_op_p (type, RSHIFT_EXPR, optab_vector)
233 || target_supports_op_p (type, RSHIFT_EXPR, optab_scalar)))
236 /* Preserve explicit divisions by 0: the C++ front-end wants to detect
237 undefined behavior in constexpr evaluation, and assuming that the division
238 traps enables better optimizations than these anyway. */
239 (for div (trunc_div ceil_div floor_div round_div exact_div)
240 /* 0 / X is always zero. */
242 (div integer_zerop@0 @1)
243 /* But not for 0 / 0 so that we can get the proper warnings and errors. */
244 (if (!integer_zerop (@1))
248 (div @0 integer_minus_onep@1)
249 (if (!TYPE_UNSIGNED (type))
254 /* But not for 0 / 0 so that we can get the proper warnings and errors.
255 And not for _Fract types where we can't build 1. */
256 (if (!integer_zerop (@0) && !ALL_FRACT_MODE_P (TYPE_MODE (type)))
257 { build_one_cst (type); }))
258 /* X / abs (X) is X < 0 ? -1 : 1. */
261 (if (INTEGRAL_TYPE_P (type)
262 && TYPE_OVERFLOW_UNDEFINED (type))
263 (cond (lt @0 { build_zero_cst (type); })
264 { build_minus_one_cst (type); } { build_one_cst (type); })))
267 (div:C @0 (negate @0))
268 (if ((INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
269 && TYPE_OVERFLOW_UNDEFINED (type))
270 { build_minus_one_cst (type); })))
272 /* For unsigned integral types, FLOOR_DIV_EXPR is the same as
273 TRUNC_DIV_EXPR. Rewrite into the latter in this case. */
276 (if ((INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
277 && TYPE_UNSIGNED (type))
280 /* Combine two successive divisions. Note that combining ceil_div
281 and floor_div is trickier and combining round_div even more so. */
282 (for div (trunc_div exact_div)
284 (div (div @0 INTEGER_CST@1) INTEGER_CST@2)
287 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@2),
288 TYPE_SIGN (type), &overflow_p);
291 (div @0 { wide_int_to_tree (type, mul); })
292 (if (TYPE_UNSIGNED (type)
293 || mul != wi::min_value (TYPE_PRECISION (type), SIGNED))
294 { build_zero_cst (type); })))))
296 /* Combine successive multiplications. Similar to above, but handling
297 overflow is different. */
299 (mult (mult @0 INTEGER_CST@1) INTEGER_CST@2)
302 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@2),
303 TYPE_SIGN (type), &overflow_p);
305 /* Skip folding on overflow: the only special case is @1 * @2 == -INT_MIN,
306 otherwise undefined overflow implies that @0 must be zero. */
307 (if (!overflow_p || TYPE_OVERFLOW_WRAPS (type))
308 (mult @0 { wide_int_to_tree (type, mul); }))))
310 /* Optimize A / A to 1.0 if we don't care about
311 NaNs or Infinities. */
314 (if (FLOAT_TYPE_P (type)
315 && ! HONOR_NANS (type)
316 && ! HONOR_INFINITIES (type))
317 { build_one_cst (type); }))
319 /* Optimize -A / A to -1.0 if we don't care about
320 NaNs or Infinities. */
322 (rdiv:C @0 (negate @0))
323 (if (FLOAT_TYPE_P (type)
324 && ! HONOR_NANS (type)
325 && ! HONOR_INFINITIES (type))
326 { build_minus_one_cst (type); }))
328 /* PR71078: x / abs(x) -> copysign (1.0, x) */
330 (rdiv:C (convert? @0) (convert? (abs @0)))
331 (if (SCALAR_FLOAT_TYPE_P (type)
332 && ! HONOR_NANS (type)
333 && ! HONOR_INFINITIES (type))
335 (if (types_match (type, float_type_node))
336 (BUILT_IN_COPYSIGNF { build_one_cst (type); } (convert @0)))
337 (if (types_match (type, double_type_node))
338 (BUILT_IN_COPYSIGN { build_one_cst (type); } (convert @0)))
339 (if (types_match (type, long_double_type_node))
340 (BUILT_IN_COPYSIGNL { build_one_cst (type); } (convert @0))))))
342 /* In IEEE floating point, x/1 is not equivalent to x for snans. */
345 (if (!HONOR_SNANS (type))
348 /* In IEEE floating point, x/-1 is not equivalent to -x for snans. */
350 (rdiv @0 real_minus_onep)
351 (if (!HONOR_SNANS (type))
354 (if (flag_reciprocal_math)
355 /* Convert (A/B)/C to A/(B*C). */
357 (rdiv (rdiv:s @0 @1) @2)
358 (rdiv @0 (mult @1 @2)))
360 /* Canonicalize x / (C1 * y) to (x * C2) / y. */
362 (rdiv @0 (mult:s @1 REAL_CST@2))
364 { tree tem = const_binop (RDIV_EXPR, type, build_one_cst (type), @2); }
366 (rdiv (mult @0 { tem; } ) @1))))
368 /* Convert A/(B/C) to (A/B)*C */
370 (rdiv @0 (rdiv:s @1 @2))
371 (mult (rdiv @0 @1) @2)))
373 /* Simplify x / (- y) to -x / y. */
375 (rdiv @0 (negate @1))
376 (rdiv (negate @0) @1))
378 /* Optimize (X & (-A)) / A where A is a power of 2, to X >> log2(A) */
379 (for div (trunc_div ceil_div floor_div round_div exact_div)
381 (div (convert? (bit_and @0 INTEGER_CST@1)) INTEGER_CST@2)
382 (if (integer_pow2p (@2)
383 && tree_int_cst_sgn (@2) > 0
384 && tree_nop_conversion_p (type, TREE_TYPE (@0))
385 && wi::to_wide (@2) + wi::to_wide (@1) == 0)
387 { build_int_cst (integer_type_node,
388 wi::exact_log2 (wi::to_wide (@2))); }))))
390 /* If ARG1 is a constant, we can convert this to a multiply by the
391 reciprocal. This does not have the same rounding properties,
392 so only do this if -freciprocal-math. We can actually
393 always safely do it if ARG1 is a power of two, but it's hard to
394 tell if it is or not in a portable manner. */
395 (for cst (REAL_CST COMPLEX_CST VECTOR_CST)
399 (if (flag_reciprocal_math
402 { tree tem = const_binop (RDIV_EXPR, type, build_one_cst (type), @1); }
404 (mult @0 { tem; } )))
405 (if (cst != COMPLEX_CST)
406 (with { tree inverse = exact_inverse (type, @1); }
408 (mult @0 { inverse; } ))))))))
410 (for mod (ceil_mod floor_mod round_mod trunc_mod)
411 /* 0 % X is always zero. */
413 (mod integer_zerop@0 @1)
414 /* But not for 0 % 0 so that we can get the proper warnings and errors. */
415 (if (!integer_zerop (@1))
417 /* X % 1 is always zero. */
419 (mod @0 integer_onep)
420 { build_zero_cst (type); })
421 /* X % -1 is zero. */
423 (mod @0 integer_minus_onep@1)
424 (if (!TYPE_UNSIGNED (type))
425 { build_zero_cst (type); }))
429 /* But not for 0 % 0 so that we can get the proper warnings and errors. */
430 (if (!integer_zerop (@0))
431 { build_zero_cst (type); }))
432 /* (X % Y) % Y is just X % Y. */
434 (mod (mod@2 @0 @1) @1)
436 /* From extract_muldiv_1: (X * C1) % C2 is zero if C1 is a multiple of C2. */
438 (mod (mult @0 INTEGER_CST@1) INTEGER_CST@2)
439 (if (ANY_INTEGRAL_TYPE_P (type)
440 && TYPE_OVERFLOW_UNDEFINED (type)
441 && wi::multiple_of_p (wi::to_wide (@1), wi::to_wide (@2),
443 { build_zero_cst (type); })))
445 /* X % -C is the same as X % C. */
447 (trunc_mod @0 INTEGER_CST@1)
448 (if (TYPE_SIGN (type) == SIGNED
449 && !TREE_OVERFLOW (@1)
450 && wi::neg_p (wi::to_wide (@1))
451 && !TYPE_OVERFLOW_TRAPS (type)
452 /* Avoid this transformation if C is INT_MIN, i.e. C == -C. */
453 && !sign_bit_p (@1, @1))
454 (trunc_mod @0 (negate @1))))
456 /* X % -Y is the same as X % Y. */
458 (trunc_mod @0 (convert? (negate @1)))
459 (if (INTEGRAL_TYPE_P (type)
460 && !TYPE_UNSIGNED (type)
461 && !TYPE_OVERFLOW_TRAPS (type)
462 && tree_nop_conversion_p (type, TREE_TYPE (@1))
463 /* Avoid this transformation if X might be INT_MIN or
464 Y might be -1, because we would then change valid
465 INT_MIN % -(-1) into invalid INT_MIN % -1. */
466 && (expr_not_equal_to (@0, wi::to_wide (TYPE_MIN_VALUE (type)))
467 || expr_not_equal_to (@1, wi::minus_one (TYPE_PRECISION
469 (trunc_mod @0 (convert @1))))
471 /* X - (X / Y) * Y is the same as X % Y. */
473 (minus (convert1? @0) (convert2? (mult:c (trunc_div @@0 @@1) @1)))
474 (if (INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
475 (convert (trunc_mod @0 @1))))
477 /* Optimize TRUNC_MOD_EXPR by a power of two into a BIT_AND_EXPR,
478 i.e. "X % C" into "X & (C - 1)", if X and C are positive.
479 Also optimize A % (C << N) where C is a power of 2,
480 to A & ((C << N) - 1). */
481 (match (power_of_two_cand @1)
483 (match (power_of_two_cand @1)
484 (lshift INTEGER_CST@1 @2))
485 (for mod (trunc_mod floor_mod)
487 (mod @0 (convert?@3 (power_of_two_cand@1 @2)))
488 (if ((TYPE_UNSIGNED (type)
489 || tree_expr_nonnegative_p (@0))
490 && tree_nop_conversion_p (type, TREE_TYPE (@3))
491 && integer_pow2p (@2) && tree_int_cst_sgn (@2) > 0)
492 (bit_and @0 (convert (minus @1 { build_int_cst (TREE_TYPE (@1), 1); }))))))
494 /* Simplify (unsigned t * 2)/2 -> unsigned t & 0x7FFFFFFF. */
496 (trunc_div (mult @0 integer_pow2p@1) @1)
497 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
498 (bit_and @0 { wide_int_to_tree
499 (type, wi::mask (TYPE_PRECISION (type)
500 - wi::exact_log2 (wi::to_wide (@1)),
501 false, TYPE_PRECISION (type))); })))
503 /* Simplify (unsigned t / 2) * 2 -> unsigned t & ~1. */
505 (mult (trunc_div @0 integer_pow2p@1) @1)
506 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
507 (bit_and @0 (negate @1))))
509 /* Simplify (t * 2) / 2) -> t. */
510 (for div (trunc_div ceil_div floor_div round_div exact_div)
512 (div (mult @0 @1) @1)
513 (if (ANY_INTEGRAL_TYPE_P (type)
514 && TYPE_OVERFLOW_UNDEFINED (type))
518 /* Simplify cos(-x) and cos(|x|) -> cos(x). Similarly for cosh. */
523 /* Simplify pow(-x, y) and pow(|x|,y) -> pow(x,y) if y is an even integer. */
526 (pows (op @0) REAL_CST@1)
527 (with { HOST_WIDE_INT n; }
528 (if (real_isinteger (&TREE_REAL_CST (@1), &n) && (n & 1) == 0)
530 /* Likewise for powi. */
533 (pows (op @0) INTEGER_CST@1)
534 (if ((wi::to_wide (@1) & 1) == 0)
536 /* Strip negate and abs from both operands of hypot. */
544 /* copysign(-x, y) and copysign(abs(x), y) -> copysign(x, y). */
545 (for copysigns (COPYSIGN_ALL)
547 (copysigns (op @0) @1)
550 /* abs(x)*abs(x) -> x*x. Should be valid for all types. */
555 /* cos(copysign(x, y)) -> cos(x). Similarly for cosh. */
559 (coss (copysigns @0 @1))
562 /* pow(copysign(x, y), z) -> pow(x, z) if z is an even integer. */
566 (pows (copysigns @0 @2) REAL_CST@1)
567 (with { HOST_WIDE_INT n; }
568 (if (real_isinteger (&TREE_REAL_CST (@1), &n) && (n & 1) == 0)
570 /* Likewise for powi. */
574 (pows (copysigns @0 @2) INTEGER_CST@1)
575 (if ((wi::to_wide (@1) & 1) == 0)
580 /* hypot(copysign(x, y), z) -> hypot(x, z). */
582 (hypots (copysigns @0 @1) @2)
584 /* hypot(x, copysign(y, z)) -> hypot(x, y). */
586 (hypots @0 (copysigns @1 @2))
589 /* copysign(x, CST) -> [-]abs (x). */
590 (for copysigns (COPYSIGN_ALL)
592 (copysigns @0 REAL_CST@1)
593 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
597 /* copysign(copysign(x, y), z) -> copysign(x, z). */
598 (for copysigns (COPYSIGN_ALL)
600 (copysigns (copysigns @0 @1) @2)
603 /* copysign(x,y)*copysign(x,y) -> x*x. */
604 (for copysigns (COPYSIGN_ALL)
606 (mult (copysigns@2 @0 @1) @2)
609 /* ccos(-x) -> ccos(x). Similarly for ccosh. */
610 (for ccoss (CCOS CCOSH)
615 /* cabs(-x) and cos(conj(x)) -> cabs(x). */
616 (for ops (conj negate)
622 /* Fold (a * (1 << b)) into (a << b) */
624 (mult:c @0 (convert? (lshift integer_onep@1 @2)))
625 (if (! FLOAT_TYPE_P (type)
626 && tree_nop_conversion_p (type, TREE_TYPE (@1)))
629 /* Fold (1 << (C - x)) where C = precision(type) - 1
630 into ((1 << C) >> x). */
632 (lshift integer_onep@0 (minus@1 INTEGER_CST@2 @3))
633 (if (INTEGRAL_TYPE_P (type)
634 && wi::eq_p (wi::to_wide (@2), TYPE_PRECISION (type) - 1)
636 (if (TYPE_UNSIGNED (type))
637 (rshift (lshift @0 @2) @3)
639 { tree utype = unsigned_type_for (type); }
640 (convert (rshift (lshift (convert:utype @0) @2) @3))))))
642 /* Fold (C1/X)*C2 into (C1*C2)/X. */
644 (mult (rdiv@3 REAL_CST@0 @1) REAL_CST@2)
645 (if (flag_associative_math
648 { tree tem = const_binop (MULT_EXPR, type, @0, @2); }
650 (rdiv { tem; } @1)))))
652 /* Simplify ~X & X as zero. */
654 (bit_and:c (convert? @0) (convert? (bit_not @0)))
655 { build_zero_cst (type); })
657 /* PR71636: Transform x & ((1U << b) - 1) -> x & ~(~0U << b); */
659 (bit_and:c @0 (plus:s (lshift:s integer_onep @1) integer_minus_onep))
660 (if (TYPE_UNSIGNED (type))
661 (bit_and @0 (bit_not (lshift { build_all_ones_cst (type); } @1)))))
663 (for bitop (bit_and bit_ior)
665 /* PR35691: Transform
666 (x == 0 & y == 0) -> (x | typeof(x)(y)) == 0.
667 (x != 0 | y != 0) -> (x | typeof(x)(y)) != 0. */
669 (bitop (cmp @0 integer_zerop@2) (cmp @1 integer_zerop))
670 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
671 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
672 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1)))
673 (cmp (bit_ior @0 (convert @1)) @2)))
675 (x == -1 & y == -1) -> (x & typeof(x)(y)) == -1.
676 (x != -1 | y != -1) -> (x & typeof(x)(y)) != -1. */
678 (bitop (cmp @0 integer_all_onesp@2) (cmp @1 integer_all_onesp))
679 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
680 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
681 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1)))
682 (cmp (bit_and @0 (convert @1)) @2))))
684 /* Fold (A & ~B) - (A & B) into (A ^ B) - B. */
686 (minus (bit_and:cs @0 (bit_not @1)) (bit_and:cs @0 @1))
687 (minus (bit_xor @0 @1) @1))
689 (minus (bit_and:s @0 INTEGER_CST@2) (bit_and:s @0 INTEGER_CST@1))
690 (if (~wi::to_wide (@2) == wi::to_wide (@1))
691 (minus (bit_xor @0 @1) @1)))
693 /* Fold (A & B) - (A & ~B) into B - (A ^ B). */
695 (minus (bit_and:cs @0 @1) (bit_and:cs @0 (bit_not @1)))
696 (minus @1 (bit_xor @0 @1)))
698 /* Simplify (X & ~Y) |^+ (~X & Y) -> X ^ Y. */
699 (for op (bit_ior bit_xor plus)
701 (op (bit_and:c @0 (bit_not @1)) (bit_and:c (bit_not @0) @1))
704 (op:c (bit_and @0 INTEGER_CST@2) (bit_and (bit_not @0) INTEGER_CST@1))
705 (if (~wi::to_wide (@2) == wi::to_wide (@1))
708 /* PR53979: Transform ((a ^ b) | a) -> (a | b) */
710 (bit_ior:c (bit_xor:c @0 @1) @0)
713 /* (a & ~b) | (a ^ b) --> a ^ b */
715 (bit_ior:c (bit_and:c @0 (bit_not @1)) (bit_xor:c@2 @0 @1))
718 /* (a & ~b) ^ ~a --> ~(a & b) */
720 (bit_xor:c (bit_and:cs @0 (bit_not @1)) (bit_not @0))
721 (bit_not (bit_and @0 @1)))
723 /* (a | b) & ~(a ^ b) --> a & b */
725 (bit_and:c (bit_ior @0 @1) (bit_not (bit_xor:c @0 @1)))
728 /* a | ~(a ^ b) --> a | ~b */
730 (bit_ior:c @0 (bit_not:s (bit_xor:c @0 @1)))
731 (bit_ior @0 (bit_not @1)))
733 /* (a | b) | (a &^ b) --> a | b */
734 (for op (bit_and bit_xor)
736 (bit_ior:c (bit_ior@2 @0 @1) (op:c @0 @1))
739 /* (a & b) | ~(a ^ b) --> ~(a ^ b) */
741 (bit_ior:c (bit_and:c @0 @1) (bit_not@2 (bit_xor @0 @1)))
744 /* ~(~a & b) --> a | ~b */
746 (bit_not (bit_and:cs (bit_not @0) @1))
747 (bit_ior @0 (bit_not @1)))
749 /* Simplify (~X & Y) to X ^ Y if we know that (X & ~Y) is 0. */
752 (bit_and (bit_not SSA_NAME@0) INTEGER_CST@1)
753 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
754 && wi::bit_and_not (get_nonzero_bits (@0), wi::to_wide (@1)) == 0)
758 /* X % Y is smaller than Y. */
761 (cmp (trunc_mod @0 @1) @1)
762 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
763 { constant_boolean_node (cmp == LT_EXPR, type); })))
766 (cmp @1 (trunc_mod @0 @1))
767 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
768 { constant_boolean_node (cmp == GT_EXPR, type); })))
772 (bit_ior @0 integer_all_onesp@1)
777 (bit_ior @0 integer_zerop)
782 (bit_and @0 integer_zerop@1)
788 (for op (bit_ior bit_xor plus)
790 (op:c (convert? @0) (convert? (bit_not @0)))
791 (convert { build_all_ones_cst (TREE_TYPE (@0)); })))
796 { build_zero_cst (type); })
798 /* Canonicalize X ^ ~0 to ~X. */
800 (bit_xor @0 integer_all_onesp@1)
805 (bit_and @0 integer_all_onesp)
808 /* x & x -> x, x | x -> x */
809 (for bitop (bit_and bit_ior)
814 /* x & C -> x if we know that x & ~C == 0. */
817 (bit_and SSA_NAME@0 INTEGER_CST@1)
818 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
819 && wi::bit_and_not (get_nonzero_bits (@0), wi::to_wide (@1)) == 0)
823 /* x + (x & 1) -> (x + 1) & ~1 */
825 (plus:c @0 (bit_and:s @0 integer_onep@1))
826 (bit_and (plus @0 @1) (bit_not @1)))
828 /* x & ~(x & y) -> x & ~y */
829 /* x | ~(x | y) -> x | ~y */
830 (for bitop (bit_and bit_ior)
832 (bitop:c @0 (bit_not (bitop:cs @0 @1)))
833 (bitop @0 (bit_not @1))))
835 /* (x | y) & ~x -> y & ~x */
836 /* (x & y) | ~x -> y | ~x */
837 (for bitop (bit_and bit_ior)
838 rbitop (bit_ior bit_and)
840 (bitop:c (rbitop:c @0 @1) (bit_not@2 @0))
843 /* (x & y) ^ (x | y) -> x ^ y */
845 (bit_xor:c (bit_and @0 @1) (bit_ior @0 @1))
848 /* (x ^ y) ^ (x | y) -> x & y */
850 (bit_xor:c (bit_xor @0 @1) (bit_ior @0 @1))
853 /* (x & y) + (x ^ y) -> x | y */
854 /* (x & y) | (x ^ y) -> x | y */
855 /* (x & y) ^ (x ^ y) -> x | y */
856 (for op (plus bit_ior bit_xor)
858 (op:c (bit_and @0 @1) (bit_xor @0 @1))
861 /* (x & y) + (x | y) -> x + y */
863 (plus:c (bit_and @0 @1) (bit_ior @0 @1))
866 /* (x + y) - (x | y) -> x & y */
868 (minus (plus @0 @1) (bit_ior @0 @1))
869 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
870 && !TYPE_SATURATING (type))
873 /* (x + y) - (x & y) -> x | y */
875 (minus (plus @0 @1) (bit_and @0 @1))
876 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
877 && !TYPE_SATURATING (type))
880 /* (x | y) - (x ^ y) -> x & y */
882 (minus (bit_ior @0 @1) (bit_xor @0 @1))
885 /* (x | y) - (x & y) -> x ^ y */
887 (minus (bit_ior @0 @1) (bit_and @0 @1))
890 /* (x | y) & ~(x & y) -> x ^ y */
892 (bit_and:c (bit_ior @0 @1) (bit_not (bit_and @0 @1)))
895 /* (x | y) & (~x ^ y) -> x & y */
897 (bit_and:c (bit_ior:c @0 @1) (bit_xor:c @1 (bit_not @0)))
900 /* ~x & ~y -> ~(x | y)
901 ~x | ~y -> ~(x & y) */
902 (for op (bit_and bit_ior)
903 rop (bit_ior bit_and)
905 (op (convert1? (bit_not @0)) (convert2? (bit_not @1)))
906 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
907 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
908 (bit_not (rop (convert @0) (convert @1))))))
910 /* If we are XORing or adding two BIT_AND_EXPR's, both of which are and'ing
911 with a constant, and the two constants have no bits in common,
912 we should treat this as a BIT_IOR_EXPR since this may produce more
914 (for op (bit_xor plus)
916 (op (convert1? (bit_and@4 @0 INTEGER_CST@1))
917 (convert2? (bit_and@5 @2 INTEGER_CST@3)))
918 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
919 && tree_nop_conversion_p (type, TREE_TYPE (@2))
920 && (wi::to_wide (@1) & wi::to_wide (@3)) == 0)
921 (bit_ior (convert @4) (convert @5)))))
923 /* (X | Y) ^ X -> Y & ~ X*/
925 (bit_xor:c (convert1? (bit_ior:c @@0 @1)) (convert2? @0))
926 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
927 (convert (bit_and @1 (bit_not @0)))))
929 /* Convert ~X ^ ~Y to X ^ Y. */
931 (bit_xor (convert1? (bit_not @0)) (convert2? (bit_not @1)))
932 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
933 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
934 (bit_xor (convert @0) (convert @1))))
936 /* Convert ~X ^ C to X ^ ~C. */
938 (bit_xor (convert? (bit_not @0)) INTEGER_CST@1)
939 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
940 (bit_xor (convert @0) (bit_not @1))))
942 /* Fold (X & Y) ^ Y and (X ^ Y) & Y as ~X & Y. */
943 (for opo (bit_and bit_xor)
944 opi (bit_xor bit_and)
946 (opo:c (opi:c @0 @1) @1)
947 (bit_and (bit_not @0) @1)))
949 /* Given a bit-wise operation CODE applied to ARG0 and ARG1, see if both
950 operands are another bit-wise operation with a common input. If so,
951 distribute the bit operations to save an operation and possibly two if
952 constants are involved. For example, convert
953 (A | B) & (A | C) into A | (B & C)
954 Further simplification will occur if B and C are constants. */
955 (for op (bit_and bit_ior bit_xor)
956 rop (bit_ior bit_and bit_and)
958 (op (convert? (rop:c @@0 @1)) (convert? (rop:c @0 @2)))
959 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
960 && tree_nop_conversion_p (type, TREE_TYPE (@2)))
961 (rop (convert @0) (op (convert @1) (convert @2))))))
963 /* Some simple reassociation for bit operations, also handled in reassoc. */
964 /* (X & Y) & Y -> X & Y
965 (X | Y) | Y -> X | Y */
966 (for op (bit_and bit_ior)
968 (op:c (convert1?@2 (op:c @0 @@1)) (convert2? @1))
970 /* (X ^ Y) ^ Y -> X */
972 (bit_xor:c (convert1? (bit_xor:c @0 @@1)) (convert2? @1))
974 /* (X & Y) & (X & Z) -> (X & Y) & Z
975 (X | Y) | (X | Z) -> (X | Y) | Z */
976 (for op (bit_and bit_ior)
978 (op (convert1?@3 (op:c@4 @0 @1)) (convert2?@5 (op:c@6 @0 @2)))
979 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
980 && tree_nop_conversion_p (type, TREE_TYPE (@2)))
981 (if (single_use (@5) && single_use (@6))
983 (if (single_use (@3) && single_use (@4))
984 (op (convert @1) @5))))))
985 /* (X ^ Y) ^ (X ^ Z) -> Y ^ Z */
987 (bit_xor (convert1? (bit_xor:c @0 @1)) (convert2? (bit_xor:c @0 @2)))
988 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
989 && tree_nop_conversion_p (type, TREE_TYPE (@2)))
990 (bit_xor (convert @1) (convert @2))))
999 (abs tree_expr_nonnegative_p@0)
1002 /* A few cases of fold-const.c negate_expr_p predicate. */
1003 (match negate_expr_p
1005 (if ((INTEGRAL_TYPE_P (type)
1006 && TYPE_UNSIGNED (type))
1007 || (!TYPE_OVERFLOW_SANITIZED (type)
1008 && may_negate_without_overflow_p (t)))))
1009 (match negate_expr_p
1011 (match negate_expr_p
1013 (if (!TYPE_OVERFLOW_SANITIZED (type))))
1014 (match negate_expr_p
1016 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (t)))))
1017 /* VECTOR_CST handling of non-wrapping types would recurse in unsupported
1019 (match negate_expr_p
1021 (if (FLOAT_TYPE_P (TREE_TYPE (type)) || TYPE_OVERFLOW_WRAPS (type))))
1022 (match negate_expr_p
1024 (if ((ANY_INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_WRAPS (type))
1025 || (FLOAT_TYPE_P (type)
1026 && !HONOR_SIGN_DEPENDENT_ROUNDING (type)
1027 && !HONOR_SIGNED_ZEROS (type)))))
1029 /* (-A) * (-B) -> A * B */
1031 (mult:c (convert1? (negate @0)) (convert2? negate_expr_p@1))
1032 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
1033 && tree_nop_conversion_p (type, TREE_TYPE (@1)))
1034 (mult (convert @0) (convert (negate @1)))))
1036 /* -(A + B) -> (-B) - A. */
1038 (negate (plus:c @0 negate_expr_p@1))
1039 (if (!HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type))
1040 && !HONOR_SIGNED_ZEROS (element_mode (type)))
1041 (minus (negate @1) @0)))
1043 /* -(A - B) -> B - A. */
1045 (negate (minus @0 @1))
1046 (if ((ANY_INTEGRAL_TYPE_P (type) && !TYPE_OVERFLOW_SANITIZED (type))
1047 || (FLOAT_TYPE_P (type)
1048 && !HONOR_SIGN_DEPENDENT_ROUNDING (type)
1049 && !HONOR_SIGNED_ZEROS (type)))
1052 (negate (pointer_diff @0 @1))
1053 (if (TYPE_OVERFLOW_UNDEFINED (type))
1054 (pointer_diff @1 @0)))
1056 /* A - B -> A + (-B) if B is easily negatable. */
1058 (minus @0 negate_expr_p@1)
1059 (if (!FIXED_POINT_TYPE_P (type))
1060 (plus @0 (negate @1))))
1062 /* Try to fold (type) X op CST -> (type) (X op ((type-x) CST))
1064 For bitwise binary operations apply operand conversions to the
1065 binary operation result instead of to the operands. This allows
1066 to combine successive conversions and bitwise binary operations.
1067 We combine the above two cases by using a conditional convert. */
1068 (for bitop (bit_and bit_ior bit_xor)
1070 (bitop (convert @0) (convert? @1))
1071 (if (((TREE_CODE (@1) == INTEGER_CST
1072 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
1073 && int_fits_type_p (@1, TREE_TYPE (@0)))
1074 || types_match (@0, @1))
1075 /* ??? This transform conflicts with fold-const.c doing
1076 Convert (T)(x & c) into (T)x & (T)c, if c is an integer
1077 constants (if x has signed type, the sign bit cannot be set
1078 in c). This folds extension into the BIT_AND_EXPR.
1079 Restrict it to GIMPLE to avoid endless recursions. */
1080 && (bitop != BIT_AND_EXPR || GIMPLE)
1081 && (/* That's a good idea if the conversion widens the operand, thus
1082 after hoisting the conversion the operation will be narrower. */
1083 TYPE_PRECISION (TREE_TYPE (@0)) < TYPE_PRECISION (type)
1084 /* It's also a good idea if the conversion is to a non-integer
1086 || GET_MODE_CLASS (TYPE_MODE (type)) != MODE_INT
1087 /* Or if the precision of TO is not the same as the precision
1089 || !type_has_mode_precision_p (type)))
1090 (convert (bitop @0 (convert @1))))))
1092 (for bitop (bit_and bit_ior)
1093 rbitop (bit_ior bit_and)
1094 /* (x | y) & x -> x */
1095 /* (x & y) | x -> x */
1097 (bitop:c (rbitop:c @0 @1) @0)
1099 /* (~x | y) & x -> x & y */
1100 /* (~x & y) | x -> x | y */
1102 (bitop:c (rbitop:c (bit_not @0) @1) @0)
1105 /* (x | CST1) & CST2 -> (x & CST2) | (CST1 & CST2) */
1107 (bit_and (bit_ior @0 CONSTANT_CLASS_P@1) CONSTANT_CLASS_P@2)
1108 (bit_ior (bit_and @0 @2) (bit_and @1 @2)))
1110 /* Combine successive equal operations with constants. */
1111 (for bitop (bit_and bit_ior bit_xor)
1113 (bitop (bitop @0 CONSTANT_CLASS_P@1) CONSTANT_CLASS_P@2)
1114 (bitop @0 (bitop @1 @2))))
1116 /* Try simple folding for X op !X, and X op X with the help
1117 of the truth_valued_p and logical_inverted_value predicates. */
1118 (match truth_valued_p
1120 (if (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) == 1)))
1121 (for op (tcc_comparison truth_and truth_andif truth_or truth_orif truth_xor)
1122 (match truth_valued_p
1124 (match truth_valued_p
1127 (match (logical_inverted_value @0)
1129 (match (logical_inverted_value @0)
1130 (bit_not truth_valued_p@0))
1131 (match (logical_inverted_value @0)
1132 (eq @0 integer_zerop))
1133 (match (logical_inverted_value @0)
1134 (ne truth_valued_p@0 integer_truep))
1135 (match (logical_inverted_value @0)
1136 (bit_xor truth_valued_p@0 integer_truep))
1140 (bit_and:c @0 (logical_inverted_value @0))
1141 { build_zero_cst (type); })
1142 /* X | !X and X ^ !X -> 1, , if X is truth-valued. */
1143 (for op (bit_ior bit_xor)
1145 (op:c truth_valued_p@0 (logical_inverted_value @0))
1146 { constant_boolean_node (true, type); }))
1147 /* X ==/!= !X is false/true. */
1150 (op:c truth_valued_p@0 (logical_inverted_value @0))
1151 { constant_boolean_node (op == NE_EXPR ? true : false, type); }))
1155 (bit_not (bit_not @0))
1158 /* Convert ~ (-A) to A - 1. */
1160 (bit_not (convert? (negate @0)))
1161 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
1162 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
1163 (convert (minus @0 { build_each_one_cst (TREE_TYPE (@0)); }))))
1165 /* Convert - (~A) to A + 1. */
1167 (negate (nop_convert (bit_not @0)))
1168 (plus (view_convert @0) { build_each_one_cst (type); }))
1170 /* Convert ~ (A - 1) or ~ (A + -1) to -A. */
1172 (bit_not (convert? (minus @0 integer_each_onep)))
1173 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
1174 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
1175 (convert (negate @0))))
1177 (bit_not (convert? (plus @0 integer_all_onesp)))
1178 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
1179 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
1180 (convert (negate @0))))
1182 /* Part of convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */
1184 (bit_not (convert? (bit_xor @0 INTEGER_CST@1)))
1185 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1186 (convert (bit_xor @0 (bit_not @1)))))
1188 (bit_not (convert? (bit_xor:c (bit_not @0) @1)))
1189 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1190 (convert (bit_xor @0 @1))))
1192 /* Otherwise prefer ~(X ^ Y) to ~X ^ Y as more canonical. */
1194 (bit_xor:c (nop_convert:s (bit_not:s @0)) @1)
1195 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1196 (bit_not (bit_xor (view_convert @0) @1))))
1198 /* (x & ~m) | (y & m) -> ((x ^ y) & m) ^ x */
1200 (bit_ior:c (bit_and:cs @0 (bit_not @2)) (bit_and:cs @1 @2))
1201 (bit_xor (bit_and (bit_xor @0 @1) @2) @0))
1203 /* Fold A - (A & B) into ~B & A. */
1205 (minus (convert1? @0) (convert2?:s (bit_and:cs @@0 @1)))
1206 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
1207 && tree_nop_conversion_p (type, TREE_TYPE (@1)))
1208 (convert (bit_and (bit_not @1) @0))))
1210 /* (m1 CMP m2) * d -> (m1 CMP m2) ? d : 0 */
1211 (for cmp (gt lt ge le)
1213 (mult (convert (cmp @0 @1)) @2)
1214 (cond (cmp @0 @1) @2 { build_zero_cst (type); })))
1216 /* For integral types with undefined overflow and C != 0 fold
1217 x * C EQ/NE y * C into x EQ/NE y. */
1220 (cmp (mult:c @0 @1) (mult:c @2 @1))
1221 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
1222 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
1223 && tree_expr_nonzero_p (@1))
1226 /* For integral types with wrapping overflow and C odd fold
1227 x * C EQ/NE y * C into x EQ/NE y. */
1230 (cmp (mult @0 INTEGER_CST@1) (mult @2 @1))
1231 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
1232 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))
1233 && (TREE_INT_CST_LOW (@1) & 1) != 0)
1236 /* For integral types with undefined overflow and C != 0 fold
1237 x * C RELOP y * C into:
1239 x RELOP y for nonnegative C
1240 y RELOP x for negative C */
1241 (for cmp (lt gt le ge)
1243 (cmp (mult:c @0 @1) (mult:c @2 @1))
1244 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
1245 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
1246 (if (tree_expr_nonnegative_p (@1) && tree_expr_nonzero_p (@1))
1248 (if (TREE_CODE (@1) == INTEGER_CST
1249 && wi::neg_p (wi::to_wide (@1), TYPE_SIGN (TREE_TYPE (@1))))
1252 /* (X - 1U) <= INT_MAX-1U into (int) X > 0. */
1256 (cmp (plus @0 integer_minus_onep@1) INTEGER_CST@2)
1257 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1258 && TYPE_UNSIGNED (TREE_TYPE (@0))
1259 && TYPE_PRECISION (TREE_TYPE (@0)) > 1
1260 && (wi::to_wide (@2)
1261 == wi::max_value (TYPE_PRECISION (TREE_TYPE (@0)), SIGNED) - 1))
1262 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
1263 (icmp (convert:stype @0) { build_int_cst (stype, 0); })))))
1265 /* X / 4 < Y / 4 iff X < Y when the division is known to be exact. */
1266 (for cmp (simple_comparison)
1268 (cmp (exact_div @0 INTEGER_CST@2) (exact_div @1 @2))
1269 (if (wi::gt_p (wi::to_wide (@2), 0, TYPE_SIGN (TREE_TYPE (@2))))
1272 /* X / C1 op C2 into a simple range test. */
1273 (for cmp (simple_comparison)
1275 (cmp (trunc_div:s @0 INTEGER_CST@1) INTEGER_CST@2)
1276 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1277 && integer_nonzerop (@1)
1278 && !TREE_OVERFLOW (@1)
1279 && !TREE_OVERFLOW (@2))
1280 (with { tree lo, hi; bool neg_overflow;
1281 enum tree_code code = fold_div_compare (cmp, @1, @2, &lo, &hi,
1284 (if (code == LT_EXPR || code == GE_EXPR)
1285 (if (TREE_OVERFLOW (lo))
1286 { build_int_cst (type, (code == LT_EXPR) ^ neg_overflow); }
1287 (if (code == LT_EXPR)
1290 (if (code == LE_EXPR || code == GT_EXPR)
1291 (if (TREE_OVERFLOW (hi))
1292 { build_int_cst (type, (code == LE_EXPR) ^ neg_overflow); }
1293 (if (code == LE_EXPR)
1297 { build_int_cst (type, code == NE_EXPR); })
1298 (if (code == EQ_EXPR && !hi)
1300 (if (code == EQ_EXPR && !lo)
1302 (if (code == NE_EXPR && !hi)
1304 (if (code == NE_EXPR && !lo)
1307 { build_range_check (UNKNOWN_LOCATION, type, @0, code == EQ_EXPR,
1311 tree etype = range_check_type (TREE_TYPE (@0));
1314 if (! TYPE_UNSIGNED (etype))
1315 etype = unsigned_type_for (etype);
1316 hi = fold_convert (etype, hi);
1317 lo = fold_convert (etype, lo);
1318 hi = const_binop (MINUS_EXPR, etype, hi, lo);
1321 (if (etype && hi && !TREE_OVERFLOW (hi))
1322 (if (code == EQ_EXPR)
1323 (le (minus (convert:etype @0) { lo; }) { hi; })
1324 (gt (minus (convert:etype @0) { lo; }) { hi; })))))))))
1326 /* X + Z < Y + Z is the same as X < Y when there is no overflow. */
1327 (for op (lt le ge gt)
1329 (op (plus:c @0 @2) (plus:c @1 @2))
1330 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1331 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
1333 /* For equality and subtraction, this is also true with wrapping overflow. */
1334 (for op (eq ne minus)
1336 (op (plus:c @0 @2) (plus:c @1 @2))
1337 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1338 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
1339 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
1342 /* X - Z < Y - Z is the same as X < Y when there is no overflow. */
1343 (for op (lt le ge gt)
1345 (op (minus @0 @2) (minus @1 @2))
1346 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1347 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
1349 /* For equality and subtraction, this is also true with wrapping overflow. */
1350 (for op (eq ne minus)
1352 (op (minus @0 @2) (minus @1 @2))
1353 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1354 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
1355 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
1357 /* And for pointers... */
1358 (for op (simple_comparison)
1360 (op (pointer_diff@3 @0 @2) (pointer_diff @1 @2))
1361 (if (!TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
1364 (minus (pointer_diff@3 @0 @2) (pointer_diff @1 @2))
1365 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@3))
1366 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
1367 (pointer_diff @0 @1)))
1369 /* Z - X < Z - Y is the same as Y < X when there is no overflow. */
1370 (for op (lt le ge gt)
1372 (op (minus @2 @0) (minus @2 @1))
1373 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1374 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
1376 /* For equality and subtraction, this is also true with wrapping overflow. */
1377 (for op (eq ne minus)
1379 (op (minus @2 @0) (minus @2 @1))
1380 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1381 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
1382 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
1384 /* And for pointers... */
1385 (for op (simple_comparison)
1387 (op (pointer_diff@3 @2 @0) (pointer_diff @2 @1))
1388 (if (!TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
1391 (minus (pointer_diff@3 @2 @0) (pointer_diff @2 @1))
1392 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@3))
1393 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
1394 (pointer_diff @1 @0)))
1396 /* X + Y < Y is the same as X < 0 when there is no overflow. */
1397 (for op (lt le gt ge)
1399 (op:c (plus:c@2 @0 @1) @1)
1400 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1401 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
1402 && (CONSTANT_CLASS_P (@0) || single_use (@2)))
1403 (op @0 { build_zero_cst (TREE_TYPE (@0)); }))))
1404 /* For equality, this is also true with wrapping overflow. */
1407 (op:c (nop_convert@3 (plus:c@2 @0 (convert1? @1))) (convert2? @1))
1408 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1409 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
1410 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
1411 && (CONSTANT_CLASS_P (@0) || (single_use (@2) && single_use (@3)))
1412 && tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@2))
1413 && tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@1)))
1414 (op @0 { build_zero_cst (TREE_TYPE (@0)); })))
1416 (op:c (nop_convert@3 (pointer_plus@2 (convert1? @0) @1)) (convert2? @0))
1417 (if (tree_nop_conversion_p (TREE_TYPE (@2), TREE_TYPE (@0))
1418 && tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0))
1419 && (CONSTANT_CLASS_P (@1) || (single_use (@2) && single_use (@3))))
1420 (op @1 { build_zero_cst (TREE_TYPE (@1)); }))))
1422 /* X - Y < X is the same as Y > 0 when there is no overflow.
1423 For equality, this is also true with wrapping overflow. */
1424 (for op (simple_comparison)
1426 (op:c @0 (minus@2 @0 @1))
1427 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1428 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
1429 || ((op == EQ_EXPR || op == NE_EXPR)
1430 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
1431 && (CONSTANT_CLASS_P (@1) || single_use (@2)))
1432 (op @1 { build_zero_cst (TREE_TYPE (@1)); }))))
1435 * (X / Y) == 0 -> X < Y if X, Y are unsigned.
1436 * (X / Y) != 0 -> X >= Y, if X, Y are unsigned.
1441 (cmp (trunc_div @0 @1) integer_zerop)
1442 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
1443 && (VECTOR_TYPE_P (type) || !VECTOR_TYPE_P (TREE_TYPE (@0))))
1446 /* X == C - X can never be true if C is odd. */
1449 (cmp:c (convert? @0) (convert1? (minus INTEGER_CST@1 (convert2? @0))))
1450 (if (TREE_INT_CST_LOW (@1) & 1)
1451 { constant_boolean_node (cmp == NE_EXPR, type); })))
1453 /* Arguments on which one can call get_nonzero_bits to get the bits
1455 (match with_possible_nonzero_bits
1457 (match with_possible_nonzero_bits
1459 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))))
1460 /* Slightly extended version, do not make it recursive to keep it cheap. */
1461 (match (with_possible_nonzero_bits2 @0)
1462 with_possible_nonzero_bits@0)
1463 (match (with_possible_nonzero_bits2 @0)
1464 (bit_and:c with_possible_nonzero_bits@0 @2))
1466 /* Same for bits that are known to be set, but we do not have
1467 an equivalent to get_nonzero_bits yet. */
1468 (match (with_certain_nonzero_bits2 @0)
1470 (match (with_certain_nonzero_bits2 @0)
1471 (bit_ior @1 INTEGER_CST@0))
1473 /* X == C (or X & Z == Y | C) is impossible if ~nonzero(X) & C != 0. */
1476 (cmp:c (with_possible_nonzero_bits2 @0) (with_certain_nonzero_bits2 @1))
1477 (if (wi::bit_and_not (wi::to_wide (@1), get_nonzero_bits (@0)) != 0)
1478 { constant_boolean_node (cmp == NE_EXPR, type); })))
1480 /* ((X inner_op C0) outer_op C1)
1481 With X being a tree where value_range has reasoned certain bits to always be
1482 zero throughout its computed value range,
1483 inner_op = {|,^}, outer_op = {|,^} and inner_op != outer_op
1484 where zero_mask has 1's for all bits that are sure to be 0 in
1486 if (inner_op == '^') C0 &= ~C1;
1487 if ((C0 & ~zero_mask) == 0) then emit (X outer_op (C0 outer_op C1)
1488 if ((C1 & ~zero_mask) == 0) then emit (X inner_op (C0 outer_op C1)
1490 (for inner_op (bit_ior bit_xor)
1491 outer_op (bit_xor bit_ior)
1494 (inner_op:s @2 INTEGER_CST@0) INTEGER_CST@1)
1498 wide_int zero_mask_not;
1502 if (TREE_CODE (@2) == SSA_NAME)
1503 zero_mask_not = get_nonzero_bits (@2);
1507 if (inner_op == BIT_XOR_EXPR)
1509 C0 = wi::bit_and_not (wi::to_wide (@0), wi::to_wide (@1));
1510 cst_emit = C0 | wi::to_wide (@1);
1514 C0 = wi::to_wide (@0);
1515 cst_emit = C0 ^ wi::to_wide (@1);
1518 (if (!fail && (C0 & zero_mask_not) == 0)
1519 (outer_op @2 { wide_int_to_tree (type, cst_emit); })
1520 (if (!fail && (wi::to_wide (@1) & zero_mask_not) == 0)
1521 (inner_op @2 { wide_int_to_tree (type, cst_emit); }))))))
1523 /* Associate (p +p off1) +p off2 as (p +p (off1 + off2)). */
1525 (pointer_plus (pointer_plus:s @0 @1) @3)
1526 (pointer_plus @0 (plus @1 @3)))
1532 tem4 = (unsigned long) tem3;
1537 (pointer_plus @0 (convert?@2 (minus@3 (convert @1) (convert @0))))
1538 /* Conditionally look through a sign-changing conversion. */
1539 (if (TYPE_PRECISION (TREE_TYPE (@2)) == TYPE_PRECISION (TREE_TYPE (@3))
1540 && ((GIMPLE && useless_type_conversion_p (type, TREE_TYPE (@1)))
1541 || (GENERIC && type == TREE_TYPE (@1))))
1544 (pointer_plus @0 (convert?@2 (pointer_diff@3 @1 @@0)))
1545 (if (TYPE_PRECISION (TREE_TYPE (@2)) >= TYPE_PRECISION (TREE_TYPE (@3)))
1549 tem = (sizetype) ptr;
1553 and produce the simpler and easier to analyze with respect to alignment
1554 ... = ptr & ~algn; */
1556 (pointer_plus @0 (negate (bit_and (convert @0) INTEGER_CST@1)))
1557 (with { tree algn = wide_int_to_tree (TREE_TYPE (@0), ~wi::to_wide (@1)); }
1558 (bit_and @0 { algn; })))
1560 /* Try folding difference of addresses. */
1562 (minus (convert ADDR_EXPR@0) (convert @1))
1563 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1564 (with { poly_int64 diff; }
1565 (if (ptr_difference_const (@0, @1, &diff))
1566 { build_int_cst_type (type, diff); }))))
1568 (minus (convert @0) (convert ADDR_EXPR@1))
1569 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1570 (with { poly_int64 diff; }
1571 (if (ptr_difference_const (@0, @1, &diff))
1572 { build_int_cst_type (type, diff); }))))
1574 (pointer_diff (convert?@2 ADDR_EXPR@0) (convert?@3 @1))
1575 (if (tree_nop_conversion_p (TREE_TYPE(@2), TREE_TYPE (@0))
1576 && tree_nop_conversion_p (TREE_TYPE(@3), TREE_TYPE (@1)))
1577 (with { poly_int64 diff; }
1578 (if (ptr_difference_const (@0, @1, &diff))
1579 { build_int_cst_type (type, diff); }))))
1581 (pointer_diff (convert?@2 @0) (convert?@3 ADDR_EXPR@1))
1582 (if (tree_nop_conversion_p (TREE_TYPE(@2), TREE_TYPE (@0))
1583 && tree_nop_conversion_p (TREE_TYPE(@3), TREE_TYPE (@1)))
1584 (with { poly_int64 diff; }
1585 (if (ptr_difference_const (@0, @1, &diff))
1586 { build_int_cst_type (type, diff); }))))
1588 /* If arg0 is derived from the address of an object or function, we may
1589 be able to fold this expression using the object or function's
1592 (bit_and (convert? @0) INTEGER_CST@1)
1593 (if (POINTER_TYPE_P (TREE_TYPE (@0))
1594 && tree_nop_conversion_p (type, TREE_TYPE (@0)))
1598 unsigned HOST_WIDE_INT bitpos;
1599 get_pointer_alignment_1 (@0, &align, &bitpos);
1601 (if (wi::ltu_p (wi::to_wide (@1), align / BITS_PER_UNIT))
1602 { wide_int_to_tree (type, (wi::to_wide (@1)
1603 & (bitpos / BITS_PER_UNIT))); }))))
1606 /* We can't reassociate at all for saturating types. */
1607 (if (!TYPE_SATURATING (type))
1609 /* Contract negates. */
1610 /* A + (-B) -> A - B */
1612 (plus:c @0 (convert? (negate @1)))
1613 /* Apply STRIP_NOPS on the negate. */
1614 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
1615 && !TYPE_OVERFLOW_SANITIZED (type))
1619 if (INTEGRAL_TYPE_P (type)
1620 && TYPE_OVERFLOW_WRAPS (type) != TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
1621 t1 = TYPE_OVERFLOW_WRAPS (type) ? type : TREE_TYPE (@1);
1623 (convert (minus (convert:t1 @0) (convert:t1 @1))))))
1624 /* A - (-B) -> A + B */
1626 (minus @0 (convert? (negate @1)))
1627 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
1628 && !TYPE_OVERFLOW_SANITIZED (type))
1632 if (INTEGRAL_TYPE_P (type)
1633 && TYPE_OVERFLOW_WRAPS (type) != TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
1634 t1 = TYPE_OVERFLOW_WRAPS (type) ? type : TREE_TYPE (@1);
1636 (convert (plus (convert:t1 @0) (convert:t1 @1))))))
1638 Sign-extension is ok except for INT_MIN, which thankfully cannot
1639 happen without overflow. */
1641 (negate (convert (negate @1)))
1642 (if (INTEGRAL_TYPE_P (type)
1643 && (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@1))
1644 || (!TYPE_UNSIGNED (TREE_TYPE (@1))
1645 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))))
1646 && !TYPE_OVERFLOW_SANITIZED (type)
1647 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@1)))
1650 (negate (convert negate_expr_p@1))
1651 (if (SCALAR_FLOAT_TYPE_P (type)
1652 && ((DECIMAL_FLOAT_TYPE_P (type)
1653 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@1))
1654 && TYPE_PRECISION (type) >= TYPE_PRECISION (TREE_TYPE (@1)))
1655 || !HONOR_SIGN_DEPENDENT_ROUNDING (type)))
1656 (convert (negate @1))))
1658 (negate (nop_convert (negate @1)))
1659 (if (!TYPE_OVERFLOW_SANITIZED (type)
1660 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@1)))
1663 /* We can't reassociate floating-point unless -fassociative-math
1664 or fixed-point plus or minus because of saturation to +-Inf. */
1665 (if ((!FLOAT_TYPE_P (type) || flag_associative_math)
1666 && !FIXED_POINT_TYPE_P (type))
1668 /* Match patterns that allow contracting a plus-minus pair
1669 irrespective of overflow issues. */
1670 /* (A +- B) - A -> +- B */
1671 /* (A +- B) -+ B -> A */
1672 /* A - (A +- B) -> -+ B */
1673 /* A +- (B -+ A) -> +- B */
1675 (minus (plus:c @0 @1) @0)
1678 (minus (minus @0 @1) @0)
1681 (plus:c (minus @0 @1) @1)
1684 (minus @0 (plus:c @0 @1))
1687 (minus @0 (minus @0 @1))
1689 /* (A +- B) + (C - A) -> C +- B */
1690 /* (A + B) - (A - C) -> B + C */
1691 /* More cases are handled with comparisons. */
1693 (plus:c (plus:c @0 @1) (minus @2 @0))
1696 (plus:c (minus @0 @1) (minus @2 @0))
1699 (plus:c (pointer_diff @0 @1) (pointer_diff @2 @0))
1700 (if (TYPE_OVERFLOW_UNDEFINED (type)
1701 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0)))
1702 (pointer_diff @2 @1)))
1704 (minus (plus:c @0 @1) (minus @0 @2))
1707 /* (A +- CST1) +- CST2 -> A + CST3
1708 Use view_convert because it is safe for vectors and equivalent for
1710 (for outer_op (plus minus)
1711 (for inner_op (plus minus)
1712 neg_inner_op (minus plus)
1714 (outer_op (nop_convert (inner_op @0 CONSTANT_CLASS_P@1))
1716 /* If one of the types wraps, use that one. */
1717 (if (!ANY_INTEGRAL_TYPE_P (type) || TYPE_OVERFLOW_WRAPS (type))
1718 (if (outer_op == PLUS_EXPR)
1719 (plus (view_convert @0) (inner_op @2 (view_convert @1)))
1720 (minus (view_convert @0) (neg_inner_op @2 (view_convert @1))))
1721 (if (!ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1722 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
1723 (if (outer_op == PLUS_EXPR)
1724 (view_convert (plus @0 (inner_op (view_convert @2) @1)))
1725 (view_convert (minus @0 (neg_inner_op (view_convert @2) @1))))
1726 /* If the constant operation overflows we cannot do the transform
1727 directly as we would introduce undefined overflow, for example
1728 with (a - 1) + INT_MIN. */
1729 (if (types_match (type, @0))
1730 (with { tree cst = const_binop (outer_op == inner_op
1731 ? PLUS_EXPR : MINUS_EXPR,
1733 (if (cst && !TREE_OVERFLOW (cst))
1734 (inner_op @0 { cst; } )
1735 /* X+INT_MAX+1 is X-INT_MIN. */
1736 (if (INTEGRAL_TYPE_P (type) && cst
1737 && wi::to_wide (cst) == wi::min_value (type))
1738 (neg_inner_op @0 { wide_int_to_tree (type, wi::to_wide (cst)); })
1739 /* Last resort, use some unsigned type. */
1740 (with { tree utype = unsigned_type_for (type); }
1741 (view_convert (inner_op
1742 (view_convert:utype @0)
1744 { drop_tree_overflow (cst); })))))))))))))
1746 /* (CST1 - A) +- CST2 -> CST3 - A */
1747 (for outer_op (plus minus)
1749 (outer_op (minus CONSTANT_CLASS_P@1 @0) CONSTANT_CLASS_P@2)
1750 (with { tree cst = const_binop (outer_op, type, @1, @2); }
1751 (if (cst && !TREE_OVERFLOW (cst))
1752 (minus { cst; } @0)))))
1754 /* CST1 - (CST2 - A) -> CST3 + A */
1756 (minus CONSTANT_CLASS_P@1 (minus CONSTANT_CLASS_P@2 @0))
1757 (with { tree cst = const_binop (MINUS_EXPR, type, @1, @2); }
1758 (if (cst && !TREE_OVERFLOW (cst))
1759 (plus { cst; } @0))))
1763 (plus:c (bit_not @0) @0)
1764 (if (!TYPE_OVERFLOW_TRAPS (type))
1765 { build_all_ones_cst (type); }))
1769 (plus (convert? (bit_not @0)) integer_each_onep)
1770 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1771 (negate (convert @0))))
1775 (minus (convert? (negate @0)) integer_each_onep)
1776 (if (!TYPE_OVERFLOW_TRAPS (type)
1777 && tree_nop_conversion_p (type, TREE_TYPE (@0)))
1778 (bit_not (convert @0))))
1782 (minus integer_all_onesp @0)
1785 /* (T)(P + A) - (T)P -> (T) A */
1787 (minus (convert (plus:c @@0 @1))
1789 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
1790 /* For integer types, if A has a smaller type
1791 than T the result depends on the possible
1793 E.g. T=size_t, A=(unsigned)429497295, P>0.
1794 However, if an overflow in P + A would cause
1795 undefined behavior, we can assume that there
1797 || (INTEGRAL_TYPE_P (TREE_TYPE (@1))
1798 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))))
1801 (minus (convert (pointer_plus @@0 @1))
1803 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
1804 /* For pointer types, if the conversion of A to the
1805 final type requires a sign- or zero-extension,
1806 then we have to punt - it is not defined which
1808 || (POINTER_TYPE_P (TREE_TYPE (@0))
1809 && TREE_CODE (@1) == INTEGER_CST
1810 && tree_int_cst_sign_bit (@1) == 0))
1813 (pointer_diff (pointer_plus @@0 @1) @0)
1814 /* The second argument of pointer_plus must be interpreted as signed, and
1815 thus sign-extended if necessary. */
1816 (with { tree stype = signed_type_for (TREE_TYPE (@1)); }
1817 (convert (convert:stype @1))))
1819 /* (T)P - (T)(P + A) -> -(T) A */
1821 (minus (convert? @0)
1822 (convert (plus:c @@0 @1)))
1823 (if (INTEGRAL_TYPE_P (type)
1824 && TYPE_OVERFLOW_UNDEFINED (type)
1825 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
1826 (with { tree utype = unsigned_type_for (type); }
1827 (convert (negate (convert:utype @1))))
1828 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
1829 /* For integer types, if A has a smaller type
1830 than T the result depends on the possible
1832 E.g. T=size_t, A=(unsigned)429497295, P>0.
1833 However, if an overflow in P + A would cause
1834 undefined behavior, we can assume that there
1836 || (INTEGRAL_TYPE_P (TREE_TYPE (@1))
1837 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))))
1838 (negate (convert @1)))))
1841 (convert (pointer_plus @@0 @1)))
1842 (if (INTEGRAL_TYPE_P (type)
1843 && TYPE_OVERFLOW_UNDEFINED (type)
1844 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
1845 (with { tree utype = unsigned_type_for (type); }
1846 (convert (negate (convert:utype @1))))
1847 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
1848 /* For pointer types, if the conversion of A to the
1849 final type requires a sign- or zero-extension,
1850 then we have to punt - it is not defined which
1852 || (POINTER_TYPE_P (TREE_TYPE (@0))
1853 && TREE_CODE (@1) == INTEGER_CST
1854 && tree_int_cst_sign_bit (@1) == 0))
1855 (negate (convert @1)))))
1857 (pointer_diff @0 (pointer_plus @@0 @1))
1858 /* The second argument of pointer_plus must be interpreted as signed, and
1859 thus sign-extended if necessary. */
1860 (with { tree stype = signed_type_for (TREE_TYPE (@1)); }
1861 (negate (convert (convert:stype @1)))))
1863 /* (T)(P + A) - (T)(P + B) -> (T)A - (T)B */
1865 (minus (convert (plus:c @@0 @1))
1866 (convert (plus:c @0 @2)))
1867 (if (INTEGRAL_TYPE_P (type)
1868 && TYPE_OVERFLOW_UNDEFINED (type)
1869 && element_precision (type) <= element_precision (TREE_TYPE (@1))
1870 && element_precision (type) <= element_precision (TREE_TYPE (@2)))
1871 (with { tree utype = unsigned_type_for (type); }
1872 (convert (minus (convert:utype @1) (convert:utype @2))))
1873 (if (((element_precision (type) <= element_precision (TREE_TYPE (@1)))
1874 == (element_precision (type) <= element_precision (TREE_TYPE (@2))))
1875 && (element_precision (type) <= element_precision (TREE_TYPE (@1))
1876 /* For integer types, if A has a smaller type
1877 than T the result depends on the possible
1879 E.g. T=size_t, A=(unsigned)429497295, P>0.
1880 However, if an overflow in P + A would cause
1881 undefined behavior, we can assume that there
1883 || (INTEGRAL_TYPE_P (TREE_TYPE (@1))
1884 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
1885 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))
1886 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@2)))))
1887 (minus (convert @1) (convert @2)))))
1889 (minus (convert (pointer_plus @@0 @1))
1890 (convert (pointer_plus @0 @2)))
1891 (if (INTEGRAL_TYPE_P (type)
1892 && TYPE_OVERFLOW_UNDEFINED (type)
1893 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
1894 (with { tree utype = unsigned_type_for (type); }
1895 (convert (minus (convert:utype @1) (convert:utype @2))))
1896 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
1897 /* For pointer types, if the conversion of A to the
1898 final type requires a sign- or zero-extension,
1899 then we have to punt - it is not defined which
1901 || (POINTER_TYPE_P (TREE_TYPE (@0))
1902 && TREE_CODE (@1) == INTEGER_CST
1903 && tree_int_cst_sign_bit (@1) == 0
1904 && TREE_CODE (@2) == INTEGER_CST
1905 && tree_int_cst_sign_bit (@2) == 0))
1906 (minus (convert @1) (convert @2)))))
1908 (pointer_diff (pointer_plus @@0 @1) (pointer_plus @0 @2))
1909 /* The second argument of pointer_plus must be interpreted as signed, and
1910 thus sign-extended if necessary. */
1911 (with { tree stype = signed_type_for (TREE_TYPE (@1)); }
1912 (minus (convert (convert:stype @1)) (convert (convert:stype @2)))))))
1915 /* Simplifications of MIN_EXPR, MAX_EXPR, fmin() and fmax(). */
1917 (for minmax (min max FMIN_ALL FMAX_ALL)
1921 /* min(max(x,y),y) -> y. */
1923 (min:c (max:c @0 @1) @1)
1925 /* max(min(x,y),y) -> y. */
1927 (max:c (min:c @0 @1) @1)
1929 /* max(a,-a) -> abs(a). */
1931 (max:c @0 (negate @0))
1932 (if (TREE_CODE (type) != COMPLEX_TYPE
1933 && (! ANY_INTEGRAL_TYPE_P (type)
1934 || TYPE_OVERFLOW_UNDEFINED (type)))
1936 /* min(a,-a) -> -abs(a). */
1938 (min:c @0 (negate @0))
1939 (if (TREE_CODE (type) != COMPLEX_TYPE
1940 && (! ANY_INTEGRAL_TYPE_P (type)
1941 || TYPE_OVERFLOW_UNDEFINED (type)))
1946 (if (INTEGRAL_TYPE_P (type)
1947 && TYPE_MIN_VALUE (type)
1948 && operand_equal_p (@1, TYPE_MIN_VALUE (type), OEP_ONLY_CONST))
1950 (if (INTEGRAL_TYPE_P (type)
1951 && TYPE_MAX_VALUE (type)
1952 && operand_equal_p (@1, TYPE_MAX_VALUE (type), OEP_ONLY_CONST))
1957 (if (INTEGRAL_TYPE_P (type)
1958 && TYPE_MAX_VALUE (type)
1959 && operand_equal_p (@1, TYPE_MAX_VALUE (type), OEP_ONLY_CONST))
1961 (if (INTEGRAL_TYPE_P (type)
1962 && TYPE_MIN_VALUE (type)
1963 && operand_equal_p (@1, TYPE_MIN_VALUE (type), OEP_ONLY_CONST))
1966 /* max (a, a + CST) -> a + CST where CST is positive. */
1967 /* max (a, a + CST) -> a where CST is negative. */
1969 (max:c @0 (plus@2 @0 INTEGER_CST@1))
1970 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
1971 (if (tree_int_cst_sgn (@1) > 0)
1975 /* min (a, a + CST) -> a where CST is positive. */
1976 /* min (a, a + CST) -> a + CST where CST is negative. */
1978 (min:c @0 (plus@2 @0 INTEGER_CST@1))
1979 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
1980 (if (tree_int_cst_sgn (@1) > 0)
1984 /* (convert (minmax ((convert (x) c)))) -> minmax (x c) if x is promoted
1985 and the outer convert demotes the expression back to x's type. */
1986 (for minmax (min max)
1988 (convert (minmax@0 (convert @1) INTEGER_CST@2))
1989 (if (INTEGRAL_TYPE_P (type)
1990 && types_match (@1, type) && int_fits_type_p (@2, type)
1991 && TYPE_SIGN (TREE_TYPE (@0)) == TYPE_SIGN (type)
1992 && TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (type))
1993 (minmax @1 (convert @2)))))
1995 (for minmax (FMIN_ALL FMAX_ALL)
1996 /* If either argument is NaN, return the other one. Avoid the
1997 transformation if we get (and honor) a signalling NaN. */
1999 (minmax:c @0 REAL_CST@1)
2000 (if (real_isnan (TREE_REAL_CST_PTR (@1))
2001 && (!HONOR_SNANS (@1) || !TREE_REAL_CST (@1).signalling))
2003 /* Convert fmin/fmax to MIN_EXPR/MAX_EXPR. C99 requires these
2004 functions to return the numeric arg if the other one is NaN.
2005 MIN and MAX don't honor that, so only transform if -ffinite-math-only
2006 is set. C99 doesn't require -0.0 to be handled, so we don't have to
2007 worry about it either. */
2008 (if (flag_finite_math_only)
2015 /* min (-A, -B) -> -max (A, B) */
2016 (for minmax (min max FMIN_ALL FMAX_ALL)
2017 maxmin (max min FMAX_ALL FMIN_ALL)
2019 (minmax (negate:s@2 @0) (negate:s@3 @1))
2020 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
2021 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2022 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))))
2023 (negate (maxmin @0 @1)))))
2024 /* MIN (~X, ~Y) -> ~MAX (X, Y)
2025 MAX (~X, ~Y) -> ~MIN (X, Y) */
2026 (for minmax (min max)
2029 (minmax (bit_not:s@2 @0) (bit_not:s@3 @1))
2030 (bit_not (maxmin @0 @1))))
2032 /* MIN (X, Y) == X -> X <= Y */
2033 (for minmax (min min max max)
2037 (cmp:c (minmax:c @0 @1) @0)
2038 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0)))
2040 /* MIN (X, 5) == 0 -> X == 0
2041 MIN (X, 5) == 7 -> false */
2044 (cmp (min @0 INTEGER_CST@1) INTEGER_CST@2)
2045 (if (wi::lt_p (wi::to_wide (@1), wi::to_wide (@2),
2046 TYPE_SIGN (TREE_TYPE (@0))))
2047 { constant_boolean_node (cmp == NE_EXPR, type); }
2048 (if (wi::gt_p (wi::to_wide (@1), wi::to_wide (@2),
2049 TYPE_SIGN (TREE_TYPE (@0))))
2053 (cmp (max @0 INTEGER_CST@1) INTEGER_CST@2)
2054 (if (wi::gt_p (wi::to_wide (@1), wi::to_wide (@2),
2055 TYPE_SIGN (TREE_TYPE (@0))))
2056 { constant_boolean_node (cmp == NE_EXPR, type); }
2057 (if (wi::lt_p (wi::to_wide (@1), wi::to_wide (@2),
2058 TYPE_SIGN (TREE_TYPE (@0))))
2060 /* MIN (X, C1) < C2 -> X < C2 || C1 < C2 */
2061 (for minmax (min min max max min min max max )
2062 cmp (lt le gt ge gt ge lt le )
2063 comb (bit_ior bit_ior bit_ior bit_ior bit_and bit_and bit_and bit_and)
2065 (cmp (minmax @0 INTEGER_CST@1) INTEGER_CST@2)
2066 (comb (cmp @0 @2) (cmp @1 @2))))
2068 /* Simplifications of shift and rotates. */
2070 (for rotate (lrotate rrotate)
2072 (rotate integer_all_onesp@0 @1)
2075 /* Optimize -1 >> x for arithmetic right shifts. */
2077 (rshift integer_all_onesp@0 @1)
2078 (if (!TYPE_UNSIGNED (type)
2079 && tree_expr_nonnegative_p (@1))
2082 /* Optimize (x >> c) << c into x & (-1<<c). */
2084 (lshift (rshift @0 INTEGER_CST@1) @1)
2085 (if (wi::ltu_p (wi::to_wide (@1), element_precision (type)))
2086 (bit_and @0 (lshift { build_minus_one_cst (type); } @1))))
2088 /* Optimize (x << c) >> c into x & ((unsigned)-1 >> c) for unsigned
2091 (rshift (lshift @0 INTEGER_CST@1) @1)
2092 (if (TYPE_UNSIGNED (type)
2093 && (wi::ltu_p (wi::to_wide (@1), element_precision (type))))
2094 (bit_and @0 (rshift { build_minus_one_cst (type); } @1))))
2096 (for shiftrotate (lrotate rrotate lshift rshift)
2098 (shiftrotate @0 integer_zerop)
2101 (shiftrotate integer_zerop@0 @1)
2103 /* Prefer vector1 << scalar to vector1 << vector2
2104 if vector2 is uniform. */
2105 (for vec (VECTOR_CST CONSTRUCTOR)
2107 (shiftrotate @0 vec@1)
2108 (with { tree tem = uniform_vector_p (@1); }
2110 (shiftrotate @0 { tem; }))))))
2112 /* Simplify X << Y where Y's low width bits are 0 to X, as only valid
2113 Y is 0. Similarly for X >> Y. */
2115 (for shift (lshift rshift)
2117 (shift @0 SSA_NAME@1)
2118 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1)))
2120 int width = ceil_log2 (element_precision (TREE_TYPE (@0)));
2121 int prec = TYPE_PRECISION (TREE_TYPE (@1));
2123 (if ((get_nonzero_bits (@1) & wi::mask (width, false, prec)) == 0)
2127 /* Rewrite an LROTATE_EXPR by a constant into an
2128 RROTATE_EXPR by a new constant. */
2130 (lrotate @0 INTEGER_CST@1)
2131 (rrotate @0 { const_binop (MINUS_EXPR, TREE_TYPE (@1),
2132 build_int_cst (TREE_TYPE (@1),
2133 element_precision (type)), @1); }))
2135 /* Turn (a OP c1) OP c2 into a OP (c1+c2). */
2136 (for op (lrotate rrotate rshift lshift)
2138 (op (op @0 INTEGER_CST@1) INTEGER_CST@2)
2139 (with { unsigned int prec = element_precision (type); }
2140 (if (wi::ge_p (wi::to_wide (@1), 0, TYPE_SIGN (TREE_TYPE (@1)))
2141 && wi::lt_p (wi::to_wide (@1), prec, TYPE_SIGN (TREE_TYPE (@1)))
2142 && wi::ge_p (wi::to_wide (@2), 0, TYPE_SIGN (TREE_TYPE (@2)))
2143 && wi::lt_p (wi::to_wide (@2), prec, TYPE_SIGN (TREE_TYPE (@2))))
2144 (with { unsigned int low = (tree_to_uhwi (@1)
2145 + tree_to_uhwi (@2)); }
2146 /* Deal with a OP (c1 + c2) being undefined but (a OP c1) OP c2
2147 being well defined. */
2149 (if (op == LROTATE_EXPR || op == RROTATE_EXPR)
2150 (op @0 { build_int_cst (TREE_TYPE (@1), low % prec); })
2151 (if (TYPE_UNSIGNED (type) || op == LSHIFT_EXPR)
2152 { build_zero_cst (type); }
2153 (op @0 { build_int_cst (TREE_TYPE (@1), prec - 1); })))
2154 (op @0 { build_int_cst (TREE_TYPE (@1), low); })))))))
2157 /* ((1 << A) & 1) != 0 -> A == 0
2158 ((1 << A) & 1) == 0 -> A != 0 */
2162 (cmp (bit_and (lshift integer_onep @0) integer_onep) integer_zerop)
2163 (icmp @0 { build_zero_cst (TREE_TYPE (@0)); })))
2165 /* (CST1 << A) == CST2 -> A == ctz (CST2) - ctz (CST1)
2166 (CST1 << A) != CST2 -> A != ctz (CST2) - ctz (CST1)
2170 (cmp (lshift INTEGER_CST@0 @1) INTEGER_CST@2)
2171 (with { int cand = wi::ctz (wi::to_wide (@2)) - wi::ctz (wi::to_wide (@0)); }
2173 || (!integer_zerop (@2)
2174 && wi::lshift (wi::to_wide (@0), cand) != wi::to_wide (@2)))
2175 { constant_boolean_node (cmp == NE_EXPR, type); }
2176 (if (!integer_zerop (@2)
2177 && wi::lshift (wi::to_wide (@0), cand) == wi::to_wide (@2))
2178 (cmp @1 { build_int_cst (TREE_TYPE (@1), cand); }))))))
2180 /* Fold (X << C1) & C2 into (X << C1) & (C2 | ((1 << C1) - 1))
2181 (X >> C1) & C2 into (X >> C1) & (C2 | ~((type) -1 >> C1))
2182 if the new mask might be further optimized. */
2183 (for shift (lshift rshift)
2185 (bit_and (convert?:s@4 (shift:s@5 (convert1?@3 @0) INTEGER_CST@1))
2187 (if (tree_nop_conversion_p (TREE_TYPE (@4), TREE_TYPE (@5))
2188 && TYPE_PRECISION (type) <= HOST_BITS_PER_WIDE_INT
2189 && tree_fits_uhwi_p (@1)
2190 && tree_to_uhwi (@1) > 0
2191 && tree_to_uhwi (@1) < TYPE_PRECISION (type))
2194 unsigned int shiftc = tree_to_uhwi (@1);
2195 unsigned HOST_WIDE_INT mask = TREE_INT_CST_LOW (@2);
2196 unsigned HOST_WIDE_INT newmask, zerobits = 0;
2197 tree shift_type = TREE_TYPE (@3);
2200 if (shift == LSHIFT_EXPR)
2201 zerobits = ((HOST_WIDE_INT_1U << shiftc) - 1);
2202 else if (shift == RSHIFT_EXPR
2203 && type_has_mode_precision_p (shift_type))
2205 prec = TYPE_PRECISION (TREE_TYPE (@3));
2207 /* See if more bits can be proven as zero because of
2210 && TYPE_UNSIGNED (TREE_TYPE (@0)))
2212 tree inner_type = TREE_TYPE (@0);
2213 if (type_has_mode_precision_p (inner_type)
2214 && TYPE_PRECISION (inner_type) < prec)
2216 prec = TYPE_PRECISION (inner_type);
2217 /* See if we can shorten the right shift. */
2219 shift_type = inner_type;
2220 /* Otherwise X >> C1 is all zeros, so we'll optimize
2221 it into (X, 0) later on by making sure zerobits
2225 zerobits = HOST_WIDE_INT_M1U;
2228 zerobits >>= HOST_BITS_PER_WIDE_INT - shiftc;
2229 zerobits <<= prec - shiftc;
2231 /* For arithmetic shift if sign bit could be set, zerobits
2232 can contain actually sign bits, so no transformation is
2233 possible, unless MASK masks them all away. In that
2234 case the shift needs to be converted into logical shift. */
2235 if (!TYPE_UNSIGNED (TREE_TYPE (@3))
2236 && prec == TYPE_PRECISION (TREE_TYPE (@3)))
2238 if ((mask & zerobits) == 0)
2239 shift_type = unsigned_type_for (TREE_TYPE (@3));
2245 /* ((X << 16) & 0xff00) is (X, 0). */
2246 (if ((mask & zerobits) == mask)
2247 { build_int_cst (type, 0); }
2248 (with { newmask = mask | zerobits; }
2249 (if (newmask != mask && (newmask & (newmask + 1)) == 0)
2252 /* Only do the transformation if NEWMASK is some integer
2254 for (prec = BITS_PER_UNIT;
2255 prec < HOST_BITS_PER_WIDE_INT; prec <<= 1)
2256 if (newmask == (HOST_WIDE_INT_1U << prec) - 1)
2259 (if (prec < HOST_BITS_PER_WIDE_INT
2260 || newmask == HOST_WIDE_INT_M1U)
2262 { tree newmaskt = build_int_cst_type (TREE_TYPE (@2), newmask); }
2263 (if (!tree_int_cst_equal (newmaskt, @2))
2264 (if (shift_type != TREE_TYPE (@3))
2265 (bit_and (convert (shift:shift_type (convert @3) @1)) { newmaskt; })
2266 (bit_and @4 { newmaskt; })))))))))))))
2268 /* Fold (X {&,^,|} C2) << C1 into (X << C1) {&,^,|} (C2 << C1)
2269 (X {&,^,|} C2) >> C1 into (X >> C1) & (C2 >> C1). */
2270 (for shift (lshift rshift)
2271 (for bit_op (bit_and bit_xor bit_ior)
2273 (shift (convert?:s (bit_op:s @0 INTEGER_CST@2)) INTEGER_CST@1)
2274 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2275 (with { tree mask = int_const_binop (shift, fold_convert (type, @2), @1); }
2276 (bit_op (shift (convert @0) @1) { mask; }))))))
2278 /* ~(~X >> Y) -> X >> Y (for arithmetic shift). */
2280 (bit_not (convert1?:s (rshift:s (convert2?@0 (bit_not @1)) @2)))
2281 (if (!TYPE_UNSIGNED (TREE_TYPE (@0))
2282 && (element_precision (TREE_TYPE (@0))
2283 <= element_precision (TREE_TYPE (@1))
2284 || !TYPE_UNSIGNED (TREE_TYPE (@1))))
2286 { tree shift_type = TREE_TYPE (@0); }
2287 (convert (rshift (convert:shift_type @1) @2)))))
2289 /* ~(~X >>r Y) -> X >>r Y
2290 ~(~X <<r Y) -> X <<r Y */
2291 (for rotate (lrotate rrotate)
2293 (bit_not (convert1?:s (rotate:s (convert2?@0 (bit_not @1)) @2)))
2294 (if ((element_precision (TREE_TYPE (@0))
2295 <= element_precision (TREE_TYPE (@1))
2296 || !TYPE_UNSIGNED (TREE_TYPE (@1)))
2297 && (element_precision (type) <= element_precision (TREE_TYPE (@0))
2298 || !TYPE_UNSIGNED (TREE_TYPE (@0))))
2300 { tree rotate_type = TREE_TYPE (@0); }
2301 (convert (rotate (convert:rotate_type @1) @2))))))
2303 /* Simplifications of conversions. */
2305 /* Basic strip-useless-type-conversions / strip_nops. */
2306 (for cvt (convert view_convert float fix_trunc)
2309 (if ((GIMPLE && useless_type_conversion_p (type, TREE_TYPE (@0)))
2310 || (GENERIC && type == TREE_TYPE (@0)))
2313 /* Contract view-conversions. */
2315 (view_convert (view_convert @0))
2318 /* For integral conversions with the same precision or pointer
2319 conversions use a NOP_EXPR instead. */
2322 (if ((INTEGRAL_TYPE_P (type) || POINTER_TYPE_P (type))
2323 && (INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))
2324 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (@0)))
2327 /* Strip inner integral conversions that do not change precision or size, or
2328 zero-extend while keeping the same size (for bool-to-char). */
2330 (view_convert (convert@0 @1))
2331 (if ((INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))
2332 && (INTEGRAL_TYPE_P (TREE_TYPE (@1)) || POINTER_TYPE_P (TREE_TYPE (@1)))
2333 && TYPE_SIZE (TREE_TYPE (@0)) == TYPE_SIZE (TREE_TYPE (@1))
2334 && (TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1))
2335 || (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (TREE_TYPE (@1))
2336 && TYPE_UNSIGNED (TREE_TYPE (@1)))))
2339 /* Re-association barriers around constants and other re-association
2340 barriers can be removed. */
2342 (paren CONSTANT_CLASS_P@0)
2345 (paren (paren@1 @0))
2348 /* Handle cases of two conversions in a row. */
2349 (for ocvt (convert float fix_trunc)
2350 (for icvt (convert float)
2355 tree inside_type = TREE_TYPE (@0);
2356 tree inter_type = TREE_TYPE (@1);
2357 int inside_int = INTEGRAL_TYPE_P (inside_type);
2358 int inside_ptr = POINTER_TYPE_P (inside_type);
2359 int inside_float = FLOAT_TYPE_P (inside_type);
2360 int inside_vec = VECTOR_TYPE_P (inside_type);
2361 unsigned int inside_prec = TYPE_PRECISION (inside_type);
2362 int inside_unsignedp = TYPE_UNSIGNED (inside_type);
2363 int inter_int = INTEGRAL_TYPE_P (inter_type);
2364 int inter_ptr = POINTER_TYPE_P (inter_type);
2365 int inter_float = FLOAT_TYPE_P (inter_type);
2366 int inter_vec = VECTOR_TYPE_P (inter_type);
2367 unsigned int inter_prec = TYPE_PRECISION (inter_type);
2368 int inter_unsignedp = TYPE_UNSIGNED (inter_type);
2369 int final_int = INTEGRAL_TYPE_P (type);
2370 int final_ptr = POINTER_TYPE_P (type);
2371 int final_float = FLOAT_TYPE_P (type);
2372 int final_vec = VECTOR_TYPE_P (type);
2373 unsigned int final_prec = TYPE_PRECISION (type);
2374 int final_unsignedp = TYPE_UNSIGNED (type);
2377 /* In addition to the cases of two conversions in a row
2378 handled below, if we are converting something to its own
2379 type via an object of identical or wider precision, neither
2380 conversion is needed. */
2381 (if (((GIMPLE && useless_type_conversion_p (type, inside_type))
2383 && TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (inside_type)))
2384 && (((inter_int || inter_ptr) && final_int)
2385 || (inter_float && final_float))
2386 && inter_prec >= final_prec)
2389 /* Likewise, if the intermediate and initial types are either both
2390 float or both integer, we don't need the middle conversion if the
2391 former is wider than the latter and doesn't change the signedness
2392 (for integers). Avoid this if the final type is a pointer since
2393 then we sometimes need the middle conversion. */
2394 (if (((inter_int && inside_int) || (inter_float && inside_float))
2395 && (final_int || final_float)
2396 && inter_prec >= inside_prec
2397 && (inter_float || inter_unsignedp == inside_unsignedp))
2400 /* If we have a sign-extension of a zero-extended value, we can
2401 replace that by a single zero-extension. Likewise if the
2402 final conversion does not change precision we can drop the
2403 intermediate conversion. */
2404 (if (inside_int && inter_int && final_int
2405 && ((inside_prec < inter_prec && inter_prec < final_prec
2406 && inside_unsignedp && !inter_unsignedp)
2407 || final_prec == inter_prec))
2410 /* Two conversions in a row are not needed unless:
2411 - some conversion is floating-point (overstrict for now), or
2412 - some conversion is a vector (overstrict for now), or
2413 - the intermediate type is narrower than both initial and
2415 - the intermediate type and innermost type differ in signedness,
2416 and the outermost type is wider than the intermediate, or
2417 - the initial type is a pointer type and the precisions of the
2418 intermediate and final types differ, or
2419 - the final type is a pointer type and the precisions of the
2420 initial and intermediate types differ. */
2421 (if (! inside_float && ! inter_float && ! final_float
2422 && ! inside_vec && ! inter_vec && ! final_vec
2423 && (inter_prec >= inside_prec || inter_prec >= final_prec)
2424 && ! (inside_int && inter_int
2425 && inter_unsignedp != inside_unsignedp
2426 && inter_prec < final_prec)
2427 && ((inter_unsignedp && inter_prec > inside_prec)
2428 == (final_unsignedp && final_prec > inter_prec))
2429 && ! (inside_ptr && inter_prec != final_prec)
2430 && ! (final_ptr && inside_prec != inter_prec))
2433 /* A truncation to an unsigned type (a zero-extension) should be
2434 canonicalized as bitwise and of a mask. */
2435 (if (GIMPLE /* PR70366: doing this in GENERIC breaks -Wconversion. */
2436 && final_int && inter_int && inside_int
2437 && final_prec == inside_prec
2438 && final_prec > inter_prec
2440 (convert (bit_and @0 { wide_int_to_tree
2442 wi::mask (inter_prec, false,
2443 TYPE_PRECISION (inside_type))); })))
2445 /* If we are converting an integer to a floating-point that can
2446 represent it exactly and back to an integer, we can skip the
2447 floating-point conversion. */
2448 (if (GIMPLE /* PR66211 */
2449 && inside_int && inter_float && final_int &&
2450 (unsigned) significand_size (TYPE_MODE (inter_type))
2451 >= inside_prec - !inside_unsignedp)
2454 /* If we have a narrowing conversion to an integral type that is fed by a
2455 BIT_AND_EXPR, we might be able to remove the BIT_AND_EXPR if it merely
2456 masks off bits outside the final type (and nothing else). */
2458 (convert (bit_and @0 INTEGER_CST@1))
2459 (if (INTEGRAL_TYPE_P (type)
2460 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
2461 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))
2462 && operand_equal_p (@1, build_low_bits_mask (TREE_TYPE (@1),
2463 TYPE_PRECISION (type)), 0))
2467 /* (X /[ex] A) * A -> X. */
2469 (mult (convert1? (exact_div @0 @@1)) (convert2? @1))
2472 /* Canonicalization of binary operations. */
2474 /* Convert X + -C into X - C. */
2476 (plus @0 REAL_CST@1)
2477 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
2478 (with { tree tem = const_unop (NEGATE_EXPR, type, @1); }
2479 (if (!TREE_OVERFLOW (tem) || !flag_trapping_math)
2480 (minus @0 { tem; })))))
2482 /* Convert x+x into x*2. */
2485 (if (SCALAR_FLOAT_TYPE_P (type))
2486 (mult @0 { build_real (type, dconst2); })
2487 (if (INTEGRAL_TYPE_P (type))
2488 (mult @0 { build_int_cst (type, 2); }))))
2492 (minus integer_zerop @1)
2495 (pointer_diff integer_zerop @1)
2496 (negate (convert @1)))
2498 /* (ARG0 - ARG1) is the same as (-ARG1 + ARG0). So check whether
2499 ARG0 is zero and X + ARG0 reduces to X, since that would mean
2500 (-ARG1 + ARG0) reduces to -ARG1. */
2502 (minus real_zerop@0 @1)
2503 (if (fold_real_zero_addition_p (type, @0, 0))
2506 /* Transform x * -1 into -x. */
2508 (mult @0 integer_minus_onep)
2511 /* Reassociate (X * CST) * Y to (X * Y) * CST. This does not introduce
2512 signed overflow for CST != 0 && CST != -1. */
2514 (mult:c (mult:s @0 INTEGER_CST@1) @2)
2515 (if (TREE_CODE (@2) != INTEGER_CST
2516 && !integer_zerop (@1) && !integer_minus_onep (@1))
2517 (mult (mult @0 @2) @1)))
2519 /* True if we can easily extract the real and imaginary parts of a complex
2521 (match compositional_complex
2522 (convert? (complex @0 @1)))
2524 /* COMPLEX_EXPR and REALPART/IMAGPART_EXPR cancellations. */
2526 (complex (realpart @0) (imagpart @0))
2529 (realpart (complex @0 @1))
2532 (imagpart (complex @0 @1))
2535 /* Sometimes we only care about half of a complex expression. */
2537 (realpart (convert?:s (conj:s @0)))
2538 (convert (realpart @0)))
2540 (imagpart (convert?:s (conj:s @0)))
2541 (convert (negate (imagpart @0))))
2542 (for part (realpart imagpart)
2543 (for op (plus minus)
2545 (part (convert?:s@2 (op:s @0 @1)))
2546 (convert (op (part @0) (part @1))))))
2548 (realpart (convert?:s (CEXPI:s @0)))
2551 (imagpart (convert?:s (CEXPI:s @0)))
2554 /* conj(conj(x)) -> x */
2556 (conj (convert? (conj @0)))
2557 (if (tree_nop_conversion_p (TREE_TYPE (@0), type))
2560 /* conj({x,y}) -> {x,-y} */
2562 (conj (convert?:s (complex:s @0 @1)))
2563 (with { tree itype = TREE_TYPE (type); }
2564 (complex (convert:itype @0) (negate (convert:itype @1)))))
2566 /* BSWAP simplifications, transforms checked by gcc.dg/builtin-bswap-8.c. */
2567 (for bswap (BUILT_IN_BSWAP16 BUILT_IN_BSWAP32 BUILT_IN_BSWAP64)
2572 (bswap (bit_not (bswap @0)))
2574 (for bitop (bit_xor bit_ior bit_and)
2576 (bswap (bitop:c (bswap @0) @1))
2577 (bitop @0 (bswap @1)))))
2580 /* Combine COND_EXPRs and VEC_COND_EXPRs. */
2582 /* Simplify constant conditions.
2583 Only optimize constant conditions when the selected branch
2584 has the same type as the COND_EXPR. This avoids optimizing
2585 away "c ? x : throw", where the throw has a void type.
2586 Note that we cannot throw away the fold-const.c variant nor
2587 this one as we depend on doing this transform before possibly
2588 A ? B : B -> B triggers and the fold-const.c one can optimize
2589 0 ? A : B to B even if A has side-effects. Something
2590 genmatch cannot handle. */
2592 (cond INTEGER_CST@0 @1 @2)
2593 (if (integer_zerop (@0))
2594 (if (!VOID_TYPE_P (TREE_TYPE (@2)) || VOID_TYPE_P (type))
2596 (if (!VOID_TYPE_P (TREE_TYPE (@1)) || VOID_TYPE_P (type))
2599 (vec_cond VECTOR_CST@0 @1 @2)
2600 (if (integer_all_onesp (@0))
2602 (if (integer_zerop (@0))
2605 /* Simplification moved from fold_cond_expr_with_comparison. It may also
2607 /* This pattern implements two kinds simplification:
2610 (cond (cmp (convert1? x) c1) (convert2? x) c2) -> (minmax (x c)) if:
2611 1) Conversions are type widening from smaller type.
2612 2) Const c1 equals to c2 after canonicalizing comparison.
2613 3) Comparison has tree code LT, LE, GT or GE.
2614 This specific pattern is needed when (cmp (convert x) c) may not
2615 be simplified by comparison patterns because of multiple uses of
2616 x. It also makes sense here because simplifying across multiple
2617 referred var is always benefitial for complicated cases.
2620 (cond (eq (convert1? x) c1) (convert2? x) c2) -> (cond (eq x c1) c1 c2). */
2621 (for cmp (lt le gt ge eq)
2623 (cond (cmp (convert1? @1) INTEGER_CST@3) (convert2? @1) INTEGER_CST@2)
2626 tree from_type = TREE_TYPE (@1);
2627 tree c1_type = TREE_TYPE (@3), c2_type = TREE_TYPE (@2);
2628 enum tree_code code = ERROR_MARK;
2630 if (INTEGRAL_TYPE_P (from_type)
2631 && int_fits_type_p (@2, from_type)
2632 && (types_match (c1_type, from_type)
2633 || (TYPE_PRECISION (c1_type) > TYPE_PRECISION (from_type)
2634 && (TYPE_UNSIGNED (from_type)
2635 || TYPE_SIGN (c1_type) == TYPE_SIGN (from_type))))
2636 && (types_match (c2_type, from_type)
2637 || (TYPE_PRECISION (c2_type) > TYPE_PRECISION (from_type)
2638 && (TYPE_UNSIGNED (from_type)
2639 || TYPE_SIGN (c2_type) == TYPE_SIGN (from_type)))))
2643 if (wi::to_widest (@3) == (wi::to_widest (@2) - 1))
2645 /* X <= Y - 1 equals to X < Y. */
2648 /* X > Y - 1 equals to X >= Y. */
2652 if (wi::to_widest (@3) == (wi::to_widest (@2) + 1))
2654 /* X < Y + 1 equals to X <= Y. */
2657 /* X >= Y + 1 equals to X > Y. */
2661 if (code != ERROR_MARK
2662 || wi::to_widest (@2) == wi::to_widest (@3))
2664 if (cmp == LT_EXPR || cmp == LE_EXPR)
2666 if (cmp == GT_EXPR || cmp == GE_EXPR)
2670 /* Can do A == C1 ? A : C2 -> A == C1 ? C1 : C2? */
2671 else if (int_fits_type_p (@3, from_type))
2675 (if (code == MAX_EXPR)
2676 (convert (max @1 (convert @2)))
2677 (if (code == MIN_EXPR)
2678 (convert (min @1 (convert @2)))
2679 (if (code == EQ_EXPR)
2680 (convert (cond (eq @1 (convert @3))
2681 (convert:from_type @3) (convert:from_type @2)))))))))
2683 /* (cond (cmp (convert? x) c1) (op x c2) c3) -> (op (minmax x c1) c2) if:
2685 1) OP is PLUS or MINUS.
2686 2) CMP is LT, LE, GT or GE.
2687 3) C3 == (C1 op C2), and computation doesn't have undefined behavior.
2689 This pattern also handles special cases like:
2691 A) Operand x is a unsigned to signed type conversion and c1 is
2692 integer zero. In this case,
2693 (signed type)x < 0 <=> x > MAX_VAL(signed type)
2694 (signed type)x >= 0 <=> x <= MAX_VAL(signed type)
2695 B) Const c1 may not equal to (C3 op' C2). In this case we also
2696 check equality for (c1+1) and (c1-1) by adjusting comparison
2699 TODO: Though signed type is handled by this pattern, it cannot be
2700 simplified at the moment because C standard requires additional
2701 type promotion. In order to match&simplify it here, the IR needs
2702 to be cleaned up by other optimizers, i.e, VRP. */
2703 (for op (plus minus)
2704 (for cmp (lt le gt ge)
2706 (cond (cmp (convert? @X) INTEGER_CST@1) (op @X INTEGER_CST@2) INTEGER_CST@3)
2707 (with { tree from_type = TREE_TYPE (@X), to_type = TREE_TYPE (@1); }
2708 (if (types_match (from_type, to_type)
2709 /* Check if it is special case A). */
2710 || (TYPE_UNSIGNED (from_type)
2711 && !TYPE_UNSIGNED (to_type)
2712 && TYPE_PRECISION (from_type) == TYPE_PRECISION (to_type)
2713 && integer_zerop (@1)
2714 && (cmp == LT_EXPR || cmp == GE_EXPR)))
2717 bool overflow = false;
2718 enum tree_code code, cmp_code = cmp;
2720 wide_int c1 = wi::to_wide (@1);
2721 wide_int c2 = wi::to_wide (@2);
2722 wide_int c3 = wi::to_wide (@3);
2723 signop sgn = TYPE_SIGN (from_type);
2725 /* Handle special case A), given x of unsigned type:
2726 ((signed type)x < 0) <=> (x > MAX_VAL(signed type))
2727 ((signed type)x >= 0) <=> (x <= MAX_VAL(signed type)) */
2728 if (!types_match (from_type, to_type))
2730 if (cmp_code == LT_EXPR)
2732 if (cmp_code == GE_EXPR)
2734 c1 = wi::max_value (to_type);
2736 /* To simplify this pattern, we require c3 = (c1 op c2). Here we
2737 compute (c3 op' c2) and check if it equals to c1 with op' being
2738 the inverted operator of op. Make sure overflow doesn't happen
2739 if it is undefined. */
2740 if (op == PLUS_EXPR)
2741 real_c1 = wi::sub (c3, c2, sgn, &overflow);
2743 real_c1 = wi::add (c3, c2, sgn, &overflow);
2746 if (!overflow || !TYPE_OVERFLOW_UNDEFINED (from_type))
2748 /* Check if c1 equals to real_c1. Boundary condition is handled
2749 by adjusting comparison operation if necessary. */
2750 if (!wi::cmp (wi::sub (real_c1, 1, sgn, &overflow), c1, sgn)
2753 /* X <= Y - 1 equals to X < Y. */
2754 if (cmp_code == LE_EXPR)
2756 /* X > Y - 1 equals to X >= Y. */
2757 if (cmp_code == GT_EXPR)
2760 if (!wi::cmp (wi::add (real_c1, 1, sgn, &overflow), c1, sgn)
2763 /* X < Y + 1 equals to X <= Y. */
2764 if (cmp_code == LT_EXPR)
2766 /* X >= Y + 1 equals to X > Y. */
2767 if (cmp_code == GE_EXPR)
2770 if (code != cmp_code || !wi::cmp (real_c1, c1, sgn))
2772 if (cmp_code == LT_EXPR || cmp_code == LE_EXPR)
2774 if (cmp_code == GT_EXPR || cmp_code == GE_EXPR)
2779 (if (code == MAX_EXPR)
2780 (op (max @X { wide_int_to_tree (from_type, real_c1); })
2781 { wide_int_to_tree (from_type, c2); })
2782 (if (code == MIN_EXPR)
2783 (op (min @X { wide_int_to_tree (from_type, real_c1); })
2784 { wide_int_to_tree (from_type, c2); })))))))))
2786 (for cnd (cond vec_cond)
2787 /* A ? B : (A ? X : C) -> A ? B : C. */
2789 (cnd @0 (cnd @0 @1 @2) @3)
2792 (cnd @0 @1 (cnd @0 @2 @3))
2794 /* A ? B : (!A ? C : X) -> A ? B : C. */
2795 /* ??? This matches embedded conditions open-coded because genmatch
2796 would generate matching code for conditions in separate stmts only.
2797 The following is still important to merge then and else arm cases
2798 from if-conversion. */
2800 (cnd @0 @1 (cnd @2 @3 @4))
2801 (if (COMPARISON_CLASS_P (@0)
2802 && COMPARISON_CLASS_P (@2)
2803 && invert_tree_comparison
2804 (TREE_CODE (@0), HONOR_NANS (TREE_OPERAND (@0, 0))) == TREE_CODE (@2)
2805 && operand_equal_p (TREE_OPERAND (@0, 0), TREE_OPERAND (@2, 0), 0)
2806 && operand_equal_p (TREE_OPERAND (@0, 1), TREE_OPERAND (@2, 1), 0))
2809 (cnd @0 (cnd @1 @2 @3) @4)
2810 (if (COMPARISON_CLASS_P (@0)
2811 && COMPARISON_CLASS_P (@1)
2812 && invert_tree_comparison
2813 (TREE_CODE (@0), HONOR_NANS (TREE_OPERAND (@0, 0))) == TREE_CODE (@1)
2814 && operand_equal_p (TREE_OPERAND (@0, 0), TREE_OPERAND (@1, 0), 0)
2815 && operand_equal_p (TREE_OPERAND (@0, 1), TREE_OPERAND (@1, 1), 0))
2818 /* A ? B : B -> B. */
2823 /* !A ? B : C -> A ? C : B. */
2825 (cnd (logical_inverted_value truth_valued_p@0) @1 @2)
2828 /* A + (B vcmp C ? 1 : 0) -> A - (B vcmp C ? -1 : 0), since vector comparisons
2829 return all -1 or all 0 results. */
2830 /* ??? We could instead convert all instances of the vec_cond to negate,
2831 but that isn't necessarily a win on its own. */
2833 (plus:c @3 (view_convert? (vec_cond:s @0 integer_each_onep@1 integer_zerop@2)))
2834 (if (VECTOR_TYPE_P (type)
2835 && TYPE_VECTOR_SUBPARTS (type) == TYPE_VECTOR_SUBPARTS (TREE_TYPE (@1))
2836 && (TYPE_MODE (TREE_TYPE (type))
2837 == TYPE_MODE (TREE_TYPE (TREE_TYPE (@1)))))
2838 (minus @3 (view_convert (vec_cond @0 (negate @1) @2)))))
2840 /* ... likewise A - (B vcmp C ? 1 : 0) -> A + (B vcmp C ? -1 : 0). */
2842 (minus @3 (view_convert? (vec_cond:s @0 integer_each_onep@1 integer_zerop@2)))
2843 (if (VECTOR_TYPE_P (type)
2844 && TYPE_VECTOR_SUBPARTS (type) == TYPE_VECTOR_SUBPARTS (TREE_TYPE (@1))
2845 && (TYPE_MODE (TREE_TYPE (type))
2846 == TYPE_MODE (TREE_TYPE (TREE_TYPE (@1)))))
2847 (plus @3 (view_convert (vec_cond @0 (negate @1) @2)))))
2850 /* Simplifications of comparisons. */
2852 /* See if we can reduce the magnitude of a constant involved in a
2853 comparison by changing the comparison code. This is a canonicalization
2854 formerly done by maybe_canonicalize_comparison_1. */
2858 (cmp @0 INTEGER_CST@1)
2859 (if (tree_int_cst_sgn (@1) == -1)
2860 (acmp @0 { wide_int_to_tree (TREE_TYPE (@1), wi::to_wide (@1) + 1); }))))
2864 (cmp @0 INTEGER_CST@1)
2865 (if (tree_int_cst_sgn (@1) == 1)
2866 (acmp @0 { wide_int_to_tree (TREE_TYPE (@1), wi::to_wide (@1) - 1); }))))
2869 /* We can simplify a logical negation of a comparison to the
2870 inverted comparison. As we cannot compute an expression
2871 operator using invert_tree_comparison we have to simulate
2872 that with expression code iteration. */
2873 (for cmp (tcc_comparison)
2874 icmp (inverted_tcc_comparison)
2875 ncmp (inverted_tcc_comparison_with_nans)
2876 /* Ideally we'd like to combine the following two patterns
2877 and handle some more cases by using
2878 (logical_inverted_value (cmp @0 @1))
2879 here but for that genmatch would need to "inline" that.
2880 For now implement what forward_propagate_comparison did. */
2882 (bit_not (cmp @0 @1))
2883 (if (VECTOR_TYPE_P (type)
2884 || (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) == 1))
2885 /* Comparison inversion may be impossible for trapping math,
2886 invert_tree_comparison will tell us. But we can't use
2887 a computed operator in the replacement tree thus we have
2888 to play the trick below. */
2889 (with { enum tree_code ic = invert_tree_comparison
2890 (cmp, HONOR_NANS (@0)); }
2896 (bit_xor (cmp @0 @1) integer_truep)
2897 (with { enum tree_code ic = invert_tree_comparison
2898 (cmp, HONOR_NANS (@0)); }
2904 /* Transform comparisons of the form X - Y CMP 0 to X CMP Y.
2905 ??? The transformation is valid for the other operators if overflow
2906 is undefined for the type, but performing it here badly interacts
2907 with the transformation in fold_cond_expr_with_comparison which
2908 attempts to synthetize ABS_EXPR. */
2910 (for sub (minus pointer_diff)
2912 (cmp (sub@2 @0 @1) integer_zerop)
2913 (if (single_use (@2))
2916 /* Transform comparisons of the form X * C1 CMP 0 to X CMP 0 in the
2917 signed arithmetic case. That form is created by the compiler
2918 often enough for folding it to be of value. One example is in
2919 computing loop trip counts after Operator Strength Reduction. */
2920 (for cmp (simple_comparison)
2921 scmp (swapped_simple_comparison)
2923 (cmp (mult@3 @0 INTEGER_CST@1) integer_zerop@2)
2924 /* Handle unfolded multiplication by zero. */
2925 (if (integer_zerop (@1))
2927 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2928 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2930 /* If @1 is negative we swap the sense of the comparison. */
2931 (if (tree_int_cst_sgn (@1) < 0)
2935 /* Simplify comparison of something with itself. For IEEE
2936 floating-point, we can only do some of these simplifications. */
2940 (if (! FLOAT_TYPE_P (TREE_TYPE (@0))
2941 || ! HONOR_NANS (@0))
2942 { constant_boolean_node (true, type); }
2943 (if (cmp != EQ_EXPR)
2949 || ! FLOAT_TYPE_P (TREE_TYPE (@0))
2950 || ! HONOR_NANS (@0))
2951 { constant_boolean_node (false, type); })))
2952 (for cmp (unle unge uneq)
2955 { constant_boolean_node (true, type); }))
2956 (for cmp (unlt ungt)
2962 (if (!flag_trapping_math)
2963 { constant_boolean_node (false, type); }))
2965 /* Fold ~X op ~Y as Y op X. */
2966 (for cmp (simple_comparison)
2968 (cmp (bit_not@2 @0) (bit_not@3 @1))
2969 (if (single_use (@2) && single_use (@3))
2972 /* Fold ~X op C as X op' ~C, where op' is the swapped comparison. */
2973 (for cmp (simple_comparison)
2974 scmp (swapped_simple_comparison)
2976 (cmp (bit_not@2 @0) CONSTANT_CLASS_P@1)
2977 (if (single_use (@2)
2978 && (TREE_CODE (@1) == INTEGER_CST || TREE_CODE (@1) == VECTOR_CST))
2979 (scmp @0 (bit_not @1)))))
2981 (for cmp (simple_comparison)
2982 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
2984 (cmp (convert@2 @0) (convert? @1))
2985 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
2986 && (DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@2))
2987 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0)))
2988 && (DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@2))
2989 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@1))))
2992 tree type1 = TREE_TYPE (@1);
2993 if (TREE_CODE (@1) == REAL_CST && !DECIMAL_FLOAT_TYPE_P (type1))
2995 REAL_VALUE_TYPE orig = TREE_REAL_CST (@1);
2996 if (TYPE_PRECISION (type1) > TYPE_PRECISION (float_type_node)
2997 && exact_real_truncate (TYPE_MODE (float_type_node), &orig))
2998 type1 = float_type_node;
2999 if (TYPE_PRECISION (type1) > TYPE_PRECISION (double_type_node)
3000 && exact_real_truncate (TYPE_MODE (double_type_node), &orig))
3001 type1 = double_type_node;
3004 = (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (type1)
3005 ? TREE_TYPE (@0) : type1);
3007 (if (TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (newtype))
3008 (cmp (convert:newtype @0) (convert:newtype @1))))))
3012 /* IEEE doesn't distinguish +0 and -0 in comparisons. */
3014 /* a CMP (-0) -> a CMP 0 */
3015 (if (REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@1)))
3016 (cmp @0 { build_real (TREE_TYPE (@1), dconst0); }))
3017 /* x != NaN is always true, other ops are always false. */
3018 (if (REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
3019 && ! HONOR_SNANS (@1))
3020 { constant_boolean_node (cmp == NE_EXPR, type); })
3021 /* Fold comparisons against infinity. */
3022 (if (REAL_VALUE_ISINF (TREE_REAL_CST (@1))
3023 && MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (@1))))
3026 REAL_VALUE_TYPE max;
3027 enum tree_code code = cmp;
3028 bool neg = REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1));
3030 code = swap_tree_comparison (code);
3033 /* x > +Inf is always false, if with ignore sNANs. */
3034 (if (code == GT_EXPR
3035 && ! HONOR_SNANS (@0))
3036 { constant_boolean_node (false, type); })
3037 (if (code == LE_EXPR)
3038 /* x <= +Inf is always true, if we don't case about NaNs. */
3039 (if (! HONOR_NANS (@0))
3040 { constant_boolean_node (true, type); }
3041 /* x <= +Inf is the same as x == x, i.e. !isnan(x). */
3043 /* x == +Inf and x >= +Inf are always equal to x > DBL_MAX. */
3044 (if (code == EQ_EXPR || code == GE_EXPR)
3045 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
3047 (lt @0 { build_real (TREE_TYPE (@0), max); })
3048 (gt @0 { build_real (TREE_TYPE (@0), max); }))))
3049 /* x < +Inf is always equal to x <= DBL_MAX. */
3050 (if (code == LT_EXPR)
3051 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
3053 (ge @0 { build_real (TREE_TYPE (@0), max); })
3054 (le @0 { build_real (TREE_TYPE (@0), max); }))))
3055 /* x != +Inf is always equal to !(x > DBL_MAX). */
3056 (if (code == NE_EXPR)
3057 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
3058 (if (! HONOR_NANS (@0))
3060 (ge @0 { build_real (TREE_TYPE (@0), max); })
3061 (le @0 { build_real (TREE_TYPE (@0), max); }))
3063 (bit_xor (lt @0 { build_real (TREE_TYPE (@0), max); })
3064 { build_one_cst (type); })
3065 (bit_xor (gt @0 { build_real (TREE_TYPE (@0), max); })
3066 { build_one_cst (type); }))))))))))
3068 /* If this is a comparison of a real constant with a PLUS_EXPR
3069 or a MINUS_EXPR of a real constant, we can convert it into a
3070 comparison with a revised real constant as long as no overflow
3071 occurs when unsafe_math_optimizations are enabled. */
3072 (if (flag_unsafe_math_optimizations)
3073 (for op (plus minus)
3075 (cmp (op @0 REAL_CST@1) REAL_CST@2)
3078 tree tem = const_binop (op == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR,
3079 TREE_TYPE (@1), @2, @1);
3081 (if (tem && !TREE_OVERFLOW (tem))
3082 (cmp @0 { tem; }))))))
3084 /* Likewise, we can simplify a comparison of a real constant with
3085 a MINUS_EXPR whose first operand is also a real constant, i.e.
3086 (c1 - x) < c2 becomes x > c1-c2. Reordering is allowed on
3087 floating-point types only if -fassociative-math is set. */
3088 (if (flag_associative_math)
3090 (cmp (minus REAL_CST@0 @1) REAL_CST@2)
3091 (with { tree tem = const_binop (MINUS_EXPR, TREE_TYPE (@1), @0, @2); }
3092 (if (tem && !TREE_OVERFLOW (tem))
3093 (cmp { tem; } @1)))))
3095 /* Fold comparisons against built-in math functions. */
3096 (if (flag_unsafe_math_optimizations
3097 && ! flag_errno_math)
3100 (cmp (sq @0) REAL_CST@1)
3102 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
3104 /* sqrt(x) < y is always false, if y is negative. */
3105 (if (cmp == EQ_EXPR || cmp == LT_EXPR || cmp == LE_EXPR)
3106 { constant_boolean_node (false, type); })
3107 /* sqrt(x) > y is always true, if y is negative and we
3108 don't care about NaNs, i.e. negative values of x. */
3109 (if (cmp == NE_EXPR || !HONOR_NANS (@0))
3110 { constant_boolean_node (true, type); })
3111 /* sqrt(x) > y is the same as x >= 0, if y is negative. */
3112 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })))
3113 (if (real_equal (TREE_REAL_CST_PTR (@1), &dconst0))
3115 /* sqrt(x) < 0 is always false. */
3116 (if (cmp == LT_EXPR)
3117 { constant_boolean_node (false, type); })
3118 /* sqrt(x) >= 0 is always true if we don't care about NaNs. */
3119 (if (cmp == GE_EXPR && !HONOR_NANS (@0))
3120 { constant_boolean_node (true, type); })
3121 /* sqrt(x) <= 0 -> x == 0. */
3122 (if (cmp == LE_EXPR)
3124 /* Otherwise sqrt(x) cmp 0 -> x cmp 0. Here cmp can be >=, >,
3125 == or !=. In the last case:
3127 (sqrt(x) != 0) == (NaN != 0) == true == (x != 0)
3129 if x is negative or NaN. Due to -funsafe-math-optimizations,
3130 the results for other x follow from natural arithmetic. */
3132 (if (cmp == GT_EXPR || cmp == GE_EXPR)
3136 real_arithmetic (&c2, MULT_EXPR,
3137 &TREE_REAL_CST (@1), &TREE_REAL_CST (@1));
3138 real_convert (&c2, TYPE_MODE (TREE_TYPE (@0)), &c2);
3140 (if (REAL_VALUE_ISINF (c2))
3141 /* sqrt(x) > y is x == +Inf, when y is very large. */
3142 (if (HONOR_INFINITIES (@0))
3143 (eq @0 { build_real (TREE_TYPE (@0), c2); })
3144 { constant_boolean_node (false, type); })
3145 /* sqrt(x) > c is the same as x > c*c. */
3146 (cmp @0 { build_real (TREE_TYPE (@0), c2); }))))
3147 (if (cmp == LT_EXPR || cmp == LE_EXPR)
3151 real_arithmetic (&c2, MULT_EXPR,
3152 &TREE_REAL_CST (@1), &TREE_REAL_CST (@1));
3153 real_convert (&c2, TYPE_MODE (TREE_TYPE (@0)), &c2);
3155 (if (REAL_VALUE_ISINF (c2))
3157 /* sqrt(x) < y is always true, when y is a very large
3158 value and we don't care about NaNs or Infinities. */
3159 (if (! HONOR_NANS (@0) && ! HONOR_INFINITIES (@0))
3160 { constant_boolean_node (true, type); })
3161 /* sqrt(x) < y is x != +Inf when y is very large and we
3162 don't care about NaNs. */
3163 (if (! HONOR_NANS (@0))
3164 (ne @0 { build_real (TREE_TYPE (@0), c2); }))
3165 /* sqrt(x) < y is x >= 0 when y is very large and we
3166 don't care about Infinities. */
3167 (if (! HONOR_INFINITIES (@0))
3168 (ge @0 { build_real (TREE_TYPE (@0), dconst0); }))
3169 /* sqrt(x) < y is x >= 0 && x != +Inf, when y is large. */
3172 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })
3173 (ne @0 { build_real (TREE_TYPE (@0), c2); }))))
3174 /* sqrt(x) < c is the same as x < c*c, if we ignore NaNs. */
3175 (if (! HONOR_NANS (@0))
3176 (cmp @0 { build_real (TREE_TYPE (@0), c2); })
3177 /* sqrt(x) < c is the same as x >= 0 && x < c*c. */
3180 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })
3181 (cmp @0 { build_real (TREE_TYPE (@0), c2); })))))))))
3182 /* Transform sqrt(x) cmp sqrt(y) -> x cmp y. */
3184 (cmp (sq @0) (sq @1))
3185 (if (! HONOR_NANS (@0))
3188 /* Optimize various special cases of (FTYPE) N CMP CST. */
3189 (for cmp (lt le eq ne ge gt)
3190 icmp (le le eq ne ge ge)
3192 (cmp (float @0) REAL_CST@1)
3193 (if (SCALAR_FLOAT_TYPE_P (TREE_TYPE (@1))
3194 && ! DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@1)))
3197 tree itype = TREE_TYPE (@0);
3198 signop isign = TYPE_SIGN (itype);
3199 format_helper fmt (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (@1))));
3200 const REAL_VALUE_TYPE *cst = TREE_REAL_CST_PTR (@1);
3201 /* Be careful to preserve any potential exceptions due to
3202 NaNs. qNaNs are ok in == or != context.
3203 TODO: relax under -fno-trapping-math or
3204 -fno-signaling-nans. */
3206 = real_isnan (cst) && (cst->signalling
3207 || (cmp != EQ_EXPR && cmp != NE_EXPR));
3208 /* INT?_MIN is power-of-two so it takes
3209 only one mantissa bit. */
3210 bool signed_p = isign == SIGNED;
3211 bool itype_fits_ftype_p
3212 = TYPE_PRECISION (itype) - signed_p <= significand_size (fmt);
3214 /* TODO: allow non-fitting itype and SNaNs when
3215 -fno-trapping-math. */
3216 (if (itype_fits_ftype_p && ! exception_p)
3219 REAL_VALUE_TYPE imin, imax;
3220 real_from_integer (&imin, fmt, wi::min_value (itype), isign);
3221 real_from_integer (&imax, fmt, wi::max_value (itype), isign);
3223 REAL_VALUE_TYPE icst;
3224 if (cmp == GT_EXPR || cmp == GE_EXPR)
3225 real_ceil (&icst, fmt, cst);
3226 else if (cmp == LT_EXPR || cmp == LE_EXPR)
3227 real_floor (&icst, fmt, cst);
3229 real_trunc (&icst, fmt, cst);
3231 bool cst_int_p = !real_isnan (cst) && real_identical (&icst, cst);
3233 bool overflow_p = false;
3235 = real_to_integer (&icst, &overflow_p, TYPE_PRECISION (itype));
3238 /* Optimize cases when CST is outside of ITYPE's range. */
3239 (if (real_compare (LT_EXPR, cst, &imin))
3240 { constant_boolean_node (cmp == GT_EXPR || cmp == GE_EXPR || cmp == NE_EXPR,
3242 (if (real_compare (GT_EXPR, cst, &imax))
3243 { constant_boolean_node (cmp == LT_EXPR || cmp == LE_EXPR || cmp == NE_EXPR,
3245 /* Remove cast if CST is an integer representable by ITYPE. */
3247 (cmp @0 { gcc_assert (!overflow_p);
3248 wide_int_to_tree (itype, icst_val); })
3250 /* When CST is fractional, optimize
3251 (FTYPE) N == CST -> 0
3252 (FTYPE) N != CST -> 1. */
3253 (if (cmp == EQ_EXPR || cmp == NE_EXPR)
3254 { constant_boolean_node (cmp == NE_EXPR, type); })
3255 /* Otherwise replace with sensible integer constant. */
3258 gcc_checking_assert (!overflow_p);
3260 (icmp @0 { wide_int_to_tree (itype, icst_val); })))))))))
3262 /* Fold A /[ex] B CMP C to A CMP B * C. */
3265 (cmp (exact_div @0 @1) INTEGER_CST@2)
3266 (if (!integer_zerop (@1))
3267 (if (wi::to_wide (@2) == 0)
3269 (if (TREE_CODE (@1) == INTEGER_CST)
3273 wide_int prod = wi::mul (wi::to_wide (@2), wi::to_wide (@1),
3274 TYPE_SIGN (TREE_TYPE (@1)), &ovf);
3277 { constant_boolean_node (cmp == NE_EXPR, type); }
3278 (cmp @0 { wide_int_to_tree (TREE_TYPE (@0), prod); }))))))))
3279 (for cmp (lt le gt ge)
3281 (cmp (exact_div @0 INTEGER_CST@1) INTEGER_CST@2)
3282 (if (wi::gt_p (wi::to_wide (@1), 0, TYPE_SIGN (TREE_TYPE (@1))))
3286 wide_int prod = wi::mul (wi::to_wide (@2), wi::to_wide (@1),
3287 TYPE_SIGN (TREE_TYPE (@1)), &ovf);
3290 { constant_boolean_node (wi::lt_p (wi::to_wide (@2), 0,
3291 TYPE_SIGN (TREE_TYPE (@2)))
3292 != (cmp == LT_EXPR || cmp == LE_EXPR), type); }
3293 (cmp @0 { wide_int_to_tree (TREE_TYPE (@0), prod); }))))))
3295 /* Unordered tests if either argument is a NaN. */
3297 (bit_ior (unordered @0 @0) (unordered @1 @1))
3298 (if (types_match (@0, @1))
3301 (bit_and (ordered @0 @0) (ordered @1 @1))
3302 (if (types_match (@0, @1))
3305 (bit_ior:c (unordered @0 @0) (unordered:c@2 @0 @1))
3308 (bit_and:c (ordered @0 @0) (ordered:c@2 @0 @1))
3311 /* Simple range test simplifications. */
3312 /* A < B || A >= B -> true. */
3313 (for test1 (lt le le le ne ge)
3314 test2 (ge gt ge ne eq ne)
3316 (bit_ior:c (test1 @0 @1) (test2 @0 @1))
3317 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
3318 || VECTOR_INTEGER_TYPE_P (TREE_TYPE (@0)))
3319 { constant_boolean_node (true, type); })))
3320 /* A < B && A >= B -> false. */
3321 (for test1 (lt lt lt le ne eq)
3322 test2 (ge gt eq gt eq gt)
3324 (bit_and:c (test1 @0 @1) (test2 @0 @1))
3325 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
3326 || VECTOR_INTEGER_TYPE_P (TREE_TYPE (@0)))
3327 { constant_boolean_node (false, type); })))
3329 /* A & (2**N - 1) <= 2**K - 1 -> A & (2**N - 2**K) == 0
3330 A & (2**N - 1) > 2**K - 1 -> A & (2**N - 2**K) != 0
3332 Note that comparisons
3333 A & (2**N - 1) < 2**K -> A & (2**N - 2**K) == 0
3334 A & (2**N - 1) >= 2**K -> A & (2**N - 2**K) != 0
3335 will be canonicalized to above so there's no need to
3342 (cmp (bit_and@0 @1 INTEGER_CST@2) INTEGER_CST@3)
3343 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)))
3346 tree ty = TREE_TYPE (@0);
3347 unsigned prec = TYPE_PRECISION (ty);
3348 wide_int mask = wi::to_wide (@2, prec);
3349 wide_int rhs = wi::to_wide (@3, prec);
3350 signop sgn = TYPE_SIGN (ty);
3352 (if ((mask & (mask + 1)) == 0 && wi::gt_p (rhs, 0, sgn)
3353 && (rhs & (rhs + 1)) == 0 && wi::ge_p (mask, rhs, sgn))
3354 (eqcmp (bit_and @1 { wide_int_to_tree (ty, mask - rhs); })
3355 { build_zero_cst (ty); }))))))
3357 /* -A CMP -B -> B CMP A. */
3358 (for cmp (tcc_comparison)
3359 scmp (swapped_tcc_comparison)
3361 (cmp (negate @0) (negate @1))
3362 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
3363 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3364 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))))
3367 (cmp (negate @0) CONSTANT_CLASS_P@1)
3368 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
3369 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3370 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))))
3371 (with { tree tem = const_unop (NEGATE_EXPR, TREE_TYPE (@0), @1); }
3372 (if (tem && !TREE_OVERFLOW (tem))
3373 (scmp @0 { tem; }))))))
3375 /* Convert ABS_EXPR<x> == 0 or ABS_EXPR<x> != 0 to x == 0 or x != 0. */
3378 (op (abs @0) zerop@1)
3381 /* From fold_sign_changed_comparison and fold_widened_comparison.
3382 FIXME: the lack of symmetry is disturbing. */
3383 (for cmp (simple_comparison)
3385 (cmp (convert@0 @00) (convert?@1 @10))
3386 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
3387 /* Disable this optimization if we're casting a function pointer
3388 type on targets that require function pointer canonicalization. */
3389 && !(targetm.have_canonicalize_funcptr_for_compare ()
3390 && TREE_CODE (TREE_TYPE (@00)) == POINTER_TYPE
3391 && TREE_CODE (TREE_TYPE (TREE_TYPE (@00))) == FUNCTION_TYPE)
3393 (if (TYPE_PRECISION (TREE_TYPE (@00)) == TYPE_PRECISION (TREE_TYPE (@0))
3394 && (TREE_CODE (@10) == INTEGER_CST
3396 && (TYPE_UNSIGNED (TREE_TYPE (@00)) == TYPE_UNSIGNED (TREE_TYPE (@0))
3399 && !POINTER_TYPE_P (TREE_TYPE (@00)))
3400 /* ??? The special-casing of INTEGER_CST conversion was in the original
3401 code and here to avoid a spurious overflow flag on the resulting
3402 constant which fold_convert produces. */
3403 (if (TREE_CODE (@1) == INTEGER_CST)
3404 (cmp @00 { force_fit_type (TREE_TYPE (@00), wi::to_widest (@1), 0,
3405 TREE_OVERFLOW (@1)); })
3406 (cmp @00 (convert @1)))
3408 (if (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (TREE_TYPE (@00)))
3409 /* If possible, express the comparison in the shorter mode. */
3410 (if ((cmp == EQ_EXPR || cmp == NE_EXPR
3411 || TYPE_UNSIGNED (TREE_TYPE (@0)) == TYPE_UNSIGNED (TREE_TYPE (@00))
3412 || (!TYPE_UNSIGNED (TREE_TYPE (@0))
3413 && TYPE_UNSIGNED (TREE_TYPE (@00))))
3414 && (types_match (TREE_TYPE (@10), TREE_TYPE (@00))
3415 || ((TYPE_PRECISION (TREE_TYPE (@00))
3416 >= TYPE_PRECISION (TREE_TYPE (@10)))
3417 && (TYPE_UNSIGNED (TREE_TYPE (@00))
3418 == TYPE_UNSIGNED (TREE_TYPE (@10))))
3419 || (TREE_CODE (@10) == INTEGER_CST
3420 && INTEGRAL_TYPE_P (TREE_TYPE (@00))
3421 && int_fits_type_p (@10, TREE_TYPE (@00)))))
3422 (cmp @00 (convert @10))
3423 (if (TREE_CODE (@10) == INTEGER_CST
3424 && INTEGRAL_TYPE_P (TREE_TYPE (@00))
3425 && !int_fits_type_p (@10, TREE_TYPE (@00)))
3428 tree min = lower_bound_in_type (TREE_TYPE (@10), TREE_TYPE (@00));
3429 tree max = upper_bound_in_type (TREE_TYPE (@10), TREE_TYPE (@00));
3430 bool above = integer_nonzerop (const_binop (LT_EXPR, type, max, @10));
3431 bool below = integer_nonzerop (const_binop (LT_EXPR, type, @10, min));
3433 (if (above || below)
3434 (if (cmp == EQ_EXPR || cmp == NE_EXPR)
3435 { constant_boolean_node (cmp == EQ_EXPR ? false : true, type); }
3436 (if (cmp == LT_EXPR || cmp == LE_EXPR)
3437 { constant_boolean_node (above ? true : false, type); }
3438 (if (cmp == GT_EXPR || cmp == GE_EXPR)
3439 { constant_boolean_node (above ? false : true, type); }))))))))))))
3442 /* A local variable can never be pointed to by
3443 the default SSA name of an incoming parameter.
3444 SSA names are canonicalized to 2nd place. */
3446 (cmp addr@0 SSA_NAME@1)
3447 (if (SSA_NAME_IS_DEFAULT_DEF (@1)
3448 && TREE_CODE (SSA_NAME_VAR (@1)) == PARM_DECL)
3449 (with { tree base = get_base_address (TREE_OPERAND (@0, 0)); }
3450 (if (TREE_CODE (base) == VAR_DECL
3451 && auto_var_in_fn_p (base, current_function_decl))
3452 (if (cmp == NE_EXPR)
3453 { constant_boolean_node (true, type); }
3454 { constant_boolean_node (false, type); }))))))
3456 /* Equality compare simplifications from fold_binary */
3459 /* If we have (A | C) == D where C & ~D != 0, convert this into 0.
3460 Similarly for NE_EXPR. */
3462 (cmp (convert?@3 (bit_ior @0 INTEGER_CST@1)) INTEGER_CST@2)
3463 (if (tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0))
3464 && wi::bit_and_not (wi::to_wide (@1), wi::to_wide (@2)) != 0)
3465 { constant_boolean_node (cmp == NE_EXPR, type); }))
3467 /* (X ^ Y) == 0 becomes X == Y, and (X ^ Y) != 0 becomes X != Y. */
3469 (cmp (bit_xor @0 @1) integer_zerop)
3472 /* (X ^ Y) == Y becomes X == 0.
3473 Likewise (X ^ Y) == X becomes Y == 0. */
3475 (cmp:c (bit_xor:c @0 @1) @0)
3476 (cmp @1 { build_zero_cst (TREE_TYPE (@1)); }))
3478 /* (X ^ C1) op C2 can be rewritten as X op (C1 ^ C2). */
3480 (cmp (convert?@3 (bit_xor @0 INTEGER_CST@1)) INTEGER_CST@2)
3481 (if (tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0)))
3482 (cmp @0 (bit_xor @1 (convert @2)))))
3485 (cmp (convert? addr@0) integer_zerop)
3486 (if (tree_single_nonzero_warnv_p (@0, NULL))
3487 { constant_boolean_node (cmp == NE_EXPR, type); })))
3489 /* If we have (A & C) == C where C is a power of 2, convert this into
3490 (A & C) != 0. Similarly for NE_EXPR. */
3494 (cmp (bit_and@2 @0 integer_pow2p@1) @1)
3495 (icmp @2 { build_zero_cst (TREE_TYPE (@0)); })))
3497 /* If we have (A & C) != 0 ? D : 0 where C and D are powers of 2,
3498 convert this into a shift followed by ANDing with D. */
3501 (ne (bit_and @0 integer_pow2p@1) integer_zerop)
3502 integer_pow2p@2 integer_zerop)
3504 int shift = (wi::exact_log2 (wi::to_wide (@2))
3505 - wi::exact_log2 (wi::to_wide (@1)));
3509 (lshift (convert @0) { build_int_cst (integer_type_node, shift); }) @2)
3511 (convert (rshift @0 { build_int_cst (integer_type_node, -shift); })) @2))))
3513 /* If we have (A & C) != 0 where C is the sign bit of A, convert
3514 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
3518 (cmp (bit_and (convert?@2 @0) integer_pow2p@1) integer_zerop)
3519 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
3520 && type_has_mode_precision_p (TREE_TYPE (@0))
3521 && element_precision (@2) >= element_precision (@0)
3522 && wi::only_sign_bit_p (wi::to_wide (@1), element_precision (@0)))
3523 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
3524 (ncmp (convert:stype @0) { build_zero_cst (stype); })))))
3526 /* If we have A < 0 ? C : 0 where C is a power of 2, convert
3527 this into a right shift or sign extension followed by ANDing with C. */
3530 (lt @0 integer_zerop)
3531 integer_pow2p@1 integer_zerop)
3532 (if (!TYPE_UNSIGNED (TREE_TYPE (@0)))
3534 int shift = element_precision (@0) - wi::exact_log2 (wi::to_wide (@1)) - 1;
3538 (convert (rshift @0 { build_int_cst (integer_type_node, shift); }))
3540 /* Otherwise ctype must be wider than TREE_TYPE (@0) and pure
3541 sign extension followed by AND with C will achieve the effect. */
3542 (bit_and (convert @0) @1)))))
3544 /* When the addresses are not directly of decls compare base and offset.
3545 This implements some remaining parts of fold_comparison address
3546 comparisons but still no complete part of it. Still it is good
3547 enough to make fold_stmt not regress when not dispatching to fold_binary. */
3548 (for cmp (simple_comparison)
3550 (cmp (convert1?@2 addr@0) (convert2? addr@1))
3553 poly_int64 off0, off1;
3554 tree base0 = get_addr_base_and_unit_offset (TREE_OPERAND (@0, 0), &off0);
3555 tree base1 = get_addr_base_and_unit_offset (TREE_OPERAND (@1, 0), &off1);
3556 if (base0 && TREE_CODE (base0) == MEM_REF)
3558 off0 += mem_ref_offset (base0).force_shwi ();
3559 base0 = TREE_OPERAND (base0, 0);
3561 if (base1 && TREE_CODE (base1) == MEM_REF)
3563 off1 += mem_ref_offset (base1).force_shwi ();
3564 base1 = TREE_OPERAND (base1, 0);
3567 (if (base0 && base1)
3571 /* Punt in GENERIC on variables with value expressions;
3572 the value expressions might point to fields/elements
3573 of other vars etc. */
3575 && ((VAR_P (base0) && DECL_HAS_VALUE_EXPR_P (base0))
3576 || (VAR_P (base1) && DECL_HAS_VALUE_EXPR_P (base1))))
3578 else if (decl_in_symtab_p (base0)
3579 && decl_in_symtab_p (base1))
3580 equal = symtab_node::get_create (base0)
3581 ->equal_address_to (symtab_node::get_create (base1));
3582 else if ((DECL_P (base0)
3583 || TREE_CODE (base0) == SSA_NAME
3584 || TREE_CODE (base0) == STRING_CST)
3586 || TREE_CODE (base1) == SSA_NAME
3587 || TREE_CODE (base1) == STRING_CST))
3588 equal = (base0 == base1);
3592 (if (cmp == EQ_EXPR && (known_eq (off0, off1) || known_ne (off0, off1)))
3593 { constant_boolean_node (known_eq (off0, off1), type); })
3594 (if (cmp == NE_EXPR && (known_eq (off0, off1) || known_ne (off0, off1)))
3595 { constant_boolean_node (known_ne (off0, off1), type); })
3596 (if (cmp == LT_EXPR && (known_lt (off0, off1) || known_ge (off0, off1)))
3597 { constant_boolean_node (known_lt (off0, off1), type); })
3598 (if (cmp == LE_EXPR && (known_le (off0, off1) || known_gt (off0, off1)))
3599 { constant_boolean_node (known_le (off0, off1), type); })
3600 (if (cmp == GE_EXPR && (known_ge (off0, off1) || known_lt (off0, off1)))
3601 { constant_boolean_node (known_ge (off0, off1), type); })
3602 (if (cmp == GT_EXPR && (known_gt (off0, off1) || known_le (off0, off1)))
3603 { constant_boolean_node (known_gt (off0, off1), type); }))
3605 && DECL_P (base0) && DECL_P (base1)
3606 /* If we compare this as integers require equal offset. */
3607 && (!INTEGRAL_TYPE_P (TREE_TYPE (@2))
3608 || known_eq (off0, off1)))
3610 (if (cmp == EQ_EXPR)
3611 { constant_boolean_node (false, type); })
3612 (if (cmp == NE_EXPR)
3613 { constant_boolean_node (true, type); })))))))))
3615 /* Simplify pointer equality compares using PTA. */
3619 (if (POINTER_TYPE_P (TREE_TYPE (@0))
3620 && ptrs_compare_unequal (@0, @1))
3621 { neeq == EQ_EXPR ? boolean_false_node : boolean_true_node; })))
3623 /* PR70920: Transform (intptr_t)x eq/ne CST to x eq/ne (typeof x) CST.
3624 and (typeof ptr_cst) x eq/ne ptr_cst to x eq/ne (typeof x) CST.
3625 Disable the transform if either operand is pointer to function.
3626 This broke pr22051-2.c for arm where function pointer
3627 canonicalizaion is not wanted. */
3631 (cmp (convert @0) INTEGER_CST@1)
3632 (if ((POINTER_TYPE_P (TREE_TYPE (@0)) && !FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@0)))
3633 && INTEGRAL_TYPE_P (TREE_TYPE (@1)))
3634 || (INTEGRAL_TYPE_P (TREE_TYPE (@0)) && POINTER_TYPE_P (TREE_TYPE (@1))
3635 && !FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@1)))))
3636 (cmp @0 (convert @1)))))
3638 /* Non-equality compare simplifications from fold_binary */
3639 (for cmp (lt gt le ge)
3640 /* Comparisons with the highest or lowest possible integer of
3641 the specified precision will have known values. */
3643 (cmp (convert?@2 @0) INTEGER_CST@1)
3644 (if ((INTEGRAL_TYPE_P (TREE_TYPE (@1)) || POINTER_TYPE_P (TREE_TYPE (@1)))
3645 && tree_nop_conversion_p (TREE_TYPE (@2), TREE_TYPE (@0)))
3648 tree arg1_type = TREE_TYPE (@1);
3649 unsigned int prec = TYPE_PRECISION (arg1_type);
3650 wide_int max = wi::max_value (arg1_type);
3651 wide_int signed_max = wi::max_value (prec, SIGNED);
3652 wide_int min = wi::min_value (arg1_type);
3655 (if (wi::to_wide (@1) == max)
3657 (if (cmp == GT_EXPR)
3658 { constant_boolean_node (false, type); })
3659 (if (cmp == GE_EXPR)
3661 (if (cmp == LE_EXPR)
3662 { constant_boolean_node (true, type); })
3663 (if (cmp == LT_EXPR)
3665 (if (wi::to_wide (@1) == min)
3667 (if (cmp == LT_EXPR)
3668 { constant_boolean_node (false, type); })
3669 (if (cmp == LE_EXPR)
3671 (if (cmp == GE_EXPR)
3672 { constant_boolean_node (true, type); })
3673 (if (cmp == GT_EXPR)
3675 (if (wi::to_wide (@1) == max - 1)
3677 (if (cmp == GT_EXPR)
3678 (eq @2 { wide_int_to_tree (TREE_TYPE (@1), wi::to_wide (@1) + 1); }))
3679 (if (cmp == LE_EXPR)
3680 (ne @2 { wide_int_to_tree (TREE_TYPE (@1), wi::to_wide (@1) + 1); }))))
3681 (if (wi::to_wide (@1) == min + 1)
3683 (if (cmp == GE_EXPR)
3684 (ne @2 { wide_int_to_tree (TREE_TYPE (@1), wi::to_wide (@1) - 1); }))
3685 (if (cmp == LT_EXPR)
3686 (eq @2 { wide_int_to_tree (TREE_TYPE (@1), wi::to_wide (@1) - 1); }))))
3687 (if (wi::to_wide (@1) == signed_max
3688 && TYPE_UNSIGNED (arg1_type)
3689 /* We will flip the signedness of the comparison operator
3690 associated with the mode of @1, so the sign bit is
3691 specified by this mode. Check that @1 is the signed
3692 max associated with this sign bit. */
3693 && prec == GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (arg1_type))
3694 /* signed_type does not work on pointer types. */
3695 && INTEGRAL_TYPE_P (arg1_type))
3696 /* The following case also applies to X < signed_max+1
3697 and X >= signed_max+1 because previous transformations. */
3698 (if (cmp == LE_EXPR || cmp == GT_EXPR)
3699 (with { tree st = signed_type_for (arg1_type); }
3700 (if (cmp == LE_EXPR)
3701 (ge (convert:st @0) { build_zero_cst (st); })
3702 (lt (convert:st @0) { build_zero_cst (st); }))))))))))
3704 (for cmp (unordered ordered unlt unle ungt unge uneq ltgt)
3705 /* If the second operand is NaN, the result is constant. */
3708 (if (REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
3709 && (cmp != LTGT_EXPR || ! flag_trapping_math))
3710 { constant_boolean_node (cmp == ORDERED_EXPR || cmp == LTGT_EXPR
3711 ? false : true, type); })))
3713 /* bool_var != 0 becomes bool_var. */
3715 (ne @0 integer_zerop)
3716 (if (TREE_CODE (TREE_TYPE (@0)) == BOOLEAN_TYPE
3717 && types_match (type, TREE_TYPE (@0)))
3719 /* bool_var == 1 becomes bool_var. */
3721 (eq @0 integer_onep)
3722 (if (TREE_CODE (TREE_TYPE (@0)) == BOOLEAN_TYPE
3723 && types_match (type, TREE_TYPE (@0)))
3726 bool_var == 0 becomes !bool_var or
3727 bool_var != 1 becomes !bool_var
3728 here because that only is good in assignment context as long
3729 as we require a tcc_comparison in GIMPLE_CONDs where we'd
3730 replace if (x == 0) with tem = ~x; if (tem != 0) which is
3731 clearly less optimal and which we'll transform again in forwprop. */
3733 /* When one argument is a constant, overflow detection can be simplified.
3734 Currently restricted to single use so as not to interfere too much with
3735 ADD_OVERFLOW detection in tree-ssa-math-opts.c.
3736 A + CST CMP A -> A CMP' CST' */
3737 (for cmp (lt le ge gt)
3740 (cmp:c (plus@2 @0 INTEGER_CST@1) @0)
3741 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
3742 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))
3743 && wi::to_wide (@1) != 0
3745 (with { unsigned int prec = TYPE_PRECISION (TREE_TYPE (@0)); }
3746 (out @0 { wide_int_to_tree (TREE_TYPE (@0),
3747 wi::max_value (prec, UNSIGNED)
3748 - wi::to_wide (@1)); })))))
3750 /* To detect overflow in unsigned A - B, A < B is simpler than A - B > A.
3751 However, the detection logic for SUB_OVERFLOW in tree-ssa-math-opts.c
3752 expects the long form, so we restrict the transformation for now. */
3755 (cmp:c (minus@2 @0 @1) @0)
3756 (if (single_use (@2)
3757 && ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3758 && TYPE_UNSIGNED (TREE_TYPE (@0))
3759 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
3762 /* Testing for overflow is unnecessary if we already know the result. */
3767 (cmp:c (realpart (IFN_SUB_OVERFLOW@2 @0 @1)) @0)
3768 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
3769 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
3770 (out (imagpart @2) { build_zero_cst (TREE_TYPE (@0)); }))))
3775 (cmp:c (realpart (IFN_ADD_OVERFLOW:c@2 @0 @1)) @0)
3776 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
3777 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
3778 (out (imagpart @2) { build_zero_cst (TREE_TYPE (@0)); }))))
3780 /* For unsigned operands, -1 / B < A checks whether A * B would overflow.
3781 Simplify it to __builtin_mul_overflow (A, B, <unused>). */
3785 (cmp:c (trunc_div:s integer_all_onesp @1) @0)
3786 (if (TYPE_UNSIGNED (TREE_TYPE (@0)) && !VECTOR_TYPE_P (TREE_TYPE (@0)))
3787 (with { tree t = TREE_TYPE (@0), cpx = build_complex_type (t); }
3788 (out (imagpart (IFN_MUL_OVERFLOW:cpx @0 @1)) { build_zero_cst (t); })))))
3790 /* Simplification of math builtins. These rules must all be optimizations
3791 as well as IL simplifications. If there is a possibility that the new
3792 form could be a pessimization, the rule should go in the canonicalization
3793 section that follows this one.
3795 Rules can generally go in this section if they satisfy one of
3798 - the rule describes an identity
3800 - the rule replaces calls with something as simple as addition or
3803 - the rule contains unary calls only and simplifies the surrounding
3804 arithmetic. (The idea here is to exclude non-unary calls in which
3805 one operand is constant and in which the call is known to be cheap
3806 when the operand has that value.) */
3808 (if (flag_unsafe_math_optimizations)
3809 /* Simplify sqrt(x) * sqrt(x) -> x. */
3811 (mult (SQRT_ALL@1 @0) @1)
3812 (if (!HONOR_SNANS (type))
3815 (for op (plus minus)
3816 /* Simplify (A / C) +- (B / C) -> (A +- B) / C. */
3820 (rdiv (op @0 @2) @1)))
3822 /* Simplify sqrt(x) * sqrt(y) -> sqrt(x*y). */
3823 (for root (SQRT CBRT)
3825 (mult (root:s @0) (root:s @1))
3826 (root (mult @0 @1))))
3828 /* Simplify expN(x) * expN(y) -> expN(x+y). */
3829 (for exps (EXP EXP2 EXP10 POW10)
3831 (mult (exps:s @0) (exps:s @1))
3832 (exps (plus @0 @1))))
3834 /* Simplify a/root(b/c) into a*root(c/b). */
3835 (for root (SQRT CBRT)
3837 (rdiv @0 (root:s (rdiv:s @1 @2)))
3838 (mult @0 (root (rdiv @2 @1)))))
3840 /* Simplify x/expN(y) into x*expN(-y). */
3841 (for exps (EXP EXP2 EXP10 POW10)
3843 (rdiv @0 (exps:s @1))
3844 (mult @0 (exps (negate @1)))))
3846 (for logs (LOG LOG2 LOG10 LOG10)
3847 exps (EXP EXP2 EXP10 POW10)
3848 /* logN(expN(x)) -> x. */
3852 /* expN(logN(x)) -> x. */
3857 /* Optimize logN(func()) for various exponential functions. We
3858 want to determine the value "x" and the power "exponent" in
3859 order to transform logN(x**exponent) into exponent*logN(x). */
3860 (for logs (LOG LOG LOG LOG2 LOG2 LOG2 LOG10 LOG10)
3861 exps (EXP2 EXP10 POW10 EXP EXP10 POW10 EXP EXP2)
3864 (if (SCALAR_FLOAT_TYPE_P (type))
3870 /* Prepare to do logN(exp(exponent)) -> exponent*logN(e). */
3871 x = build_real_truncate (type, dconst_e ());
3874 /* Prepare to do logN(exp2(exponent)) -> exponent*logN(2). */
3875 x = build_real (type, dconst2);
3879 /* Prepare to do logN(exp10(exponent)) -> exponent*logN(10). */
3881 REAL_VALUE_TYPE dconst10;
3882 real_from_integer (&dconst10, VOIDmode, 10, SIGNED);
3883 x = build_real (type, dconst10);
3890 (mult (logs { x; }) @0)))))
3898 (if (SCALAR_FLOAT_TYPE_P (type))
3904 /* Prepare to do logN(sqrt(x)) -> 0.5*logN(x). */
3905 x = build_real (type, dconsthalf);
3908 /* Prepare to do logN(cbrt(x)) -> (1/3)*logN(x). */
3909 x = build_real_truncate (type, dconst_third ());
3915 (mult { x; } (logs @0))))))
3917 /* logN(pow(x,exponent)) -> exponent*logN(x). */
3918 (for logs (LOG LOG2 LOG10)
3922 (mult @1 (logs @0))))
3924 /* pow(C,x) -> exp(log(C)*x) if C > 0. */
3929 (pows REAL_CST@0 @1)
3930 (if (real_compare (GT_EXPR, TREE_REAL_CST_PTR (@0), &dconst0)
3931 && real_isfinite (TREE_REAL_CST_PTR (@0)))
3932 (exps (mult (logs @0) @1)))))
3937 exps (EXP EXP2 EXP10 POW10)
3938 /* sqrt(expN(x)) -> expN(x*0.5). */
3941 (exps (mult @0 { build_real (type, dconsthalf); })))
3942 /* cbrt(expN(x)) -> expN(x/3). */
3945 (exps (mult @0 { build_real_truncate (type, dconst_third ()); })))
3946 /* pow(expN(x), y) -> expN(x*y). */
3949 (exps (mult @0 @1))))
3951 /* tan(atan(x)) -> x. */
3958 /* cabs(x+0i) or cabs(0+xi) -> abs(x). */
3960 (CABS (complex:C @0 real_zerop@1))
3963 /* trunc(trunc(x)) -> trunc(x), etc. */
3964 (for fns (TRUNC_ALL FLOOR_ALL CEIL_ALL ROUND_ALL NEARBYINT_ALL RINT_ALL)
3968 /* f(x) -> x if x is integer valued and f does nothing for such values. */
3969 (for fns (TRUNC_ALL FLOOR_ALL CEIL_ALL ROUND_ALL NEARBYINT_ALL RINT_ALL)
3971 (fns integer_valued_real_p@0)
3974 /* hypot(x,0) and hypot(0,x) -> abs(x). */
3976 (HYPOT:c @0 real_zerop@1)
3979 /* pow(1,x) -> 1. */
3981 (POW real_onep@0 @1)
3985 /* copysign(x,x) -> x. */
3986 (COPYSIGN_ALL @0 @0)
3990 /* copysign(x,y) -> fabs(x) if y is nonnegative. */
3991 (COPYSIGN_ALL @0 tree_expr_nonnegative_p@1)
3994 (for scale (LDEXP SCALBN SCALBLN)
3995 /* ldexp(0, x) -> 0. */
3997 (scale real_zerop@0 @1)
3999 /* ldexp(x, 0) -> x. */
4001 (scale @0 integer_zerop@1)
4003 /* ldexp(x, y) -> x if x is +-Inf or NaN. */
4005 (scale REAL_CST@0 @1)
4006 (if (!real_isfinite (TREE_REAL_CST_PTR (@0)))
4009 /* Canonicalization of sequences of math builtins. These rules represent
4010 IL simplifications but are not necessarily optimizations.
4012 The sincos pass is responsible for picking "optimal" implementations
4013 of math builtins, which may be more complicated and can sometimes go
4014 the other way, e.g. converting pow into a sequence of sqrts.
4015 We only want to do these canonicalizations before the pass has run. */
4017 (if (flag_unsafe_math_optimizations && canonicalize_math_p ())
4018 /* Simplify tan(x) * cos(x) -> sin(x). */
4020 (mult:c (TAN:s @0) (COS:s @0))
4023 /* Simplify x * pow(x,c) -> pow(x,c+1). */
4025 (mult:c @0 (POW:s @0 REAL_CST@1))
4026 (if (!TREE_OVERFLOW (@1))
4027 (POW @0 (plus @1 { build_one_cst (type); }))))
4029 /* Simplify sin(x) / cos(x) -> tan(x). */
4031 (rdiv (SIN:s @0) (COS:s @0))
4034 /* Simplify cos(x) / sin(x) -> 1 / tan(x). */
4036 (rdiv (COS:s @0) (SIN:s @0))
4037 (rdiv { build_one_cst (type); } (TAN @0)))
4039 /* Simplify sin(x) / tan(x) -> cos(x). */
4041 (rdiv (SIN:s @0) (TAN:s @0))
4042 (if (! HONOR_NANS (@0)
4043 && ! HONOR_INFINITIES (@0))
4046 /* Simplify tan(x) / sin(x) -> 1.0 / cos(x). */
4048 (rdiv (TAN:s @0) (SIN:s @0))
4049 (if (! HONOR_NANS (@0)
4050 && ! HONOR_INFINITIES (@0))
4051 (rdiv { build_one_cst (type); } (COS @0))))
4053 /* Simplify pow(x,y) * pow(x,z) -> pow(x,y+z). */
4055 (mult (POW:s @0 @1) (POW:s @0 @2))
4056 (POW @0 (plus @1 @2)))
4058 /* Simplify pow(x,y) * pow(z,y) -> pow(x*z,y). */
4060 (mult (POW:s @0 @1) (POW:s @2 @1))
4061 (POW (mult @0 @2) @1))
4063 /* Simplify powi(x,y) * powi(z,y) -> powi(x*z,y). */
4065 (mult (POWI:s @0 @1) (POWI:s @2 @1))
4066 (POWI (mult @0 @2) @1))
4068 /* Simplify pow(x,c) / x -> pow(x,c-1). */
4070 (rdiv (POW:s @0 REAL_CST@1) @0)
4071 (if (!TREE_OVERFLOW (@1))
4072 (POW @0 (minus @1 { build_one_cst (type); }))))
4074 /* Simplify x / pow (y,z) -> x * pow(y,-z). */
4076 (rdiv @0 (POW:s @1 @2))
4077 (mult @0 (POW @1 (negate @2))))
4082 /* sqrt(sqrt(x)) -> pow(x,1/4). */
4085 (pows @0 { build_real (type, dconst_quarter ()); }))
4086 /* sqrt(cbrt(x)) -> pow(x,1/6). */
4089 (pows @0 { build_real_truncate (type, dconst_sixth ()); }))
4090 /* cbrt(sqrt(x)) -> pow(x,1/6). */
4093 (pows @0 { build_real_truncate (type, dconst_sixth ()); }))
4094 /* cbrt(cbrt(x)) -> pow(x,1/9), iff x is nonnegative. */
4096 (cbrts (cbrts tree_expr_nonnegative_p@0))
4097 (pows @0 { build_real_truncate (type, dconst_ninth ()); }))
4098 /* sqrt(pow(x,y)) -> pow(|x|,y*0.5). */
4100 (sqrts (pows @0 @1))
4101 (pows (abs @0) (mult @1 { build_real (type, dconsthalf); })))
4102 /* cbrt(pow(x,y)) -> pow(x,y/3), iff x is nonnegative. */
4104 (cbrts (pows tree_expr_nonnegative_p@0 @1))
4105 (pows @0 (mult @1 { build_real_truncate (type, dconst_third ()); })))
4106 /* pow(sqrt(x),y) -> pow(x,y*0.5). */
4108 (pows (sqrts @0) @1)
4109 (pows @0 (mult @1 { build_real (type, dconsthalf); })))
4110 /* pow(cbrt(x),y) -> pow(x,y/3) iff x is nonnegative. */
4112 (pows (cbrts tree_expr_nonnegative_p@0) @1)
4113 (pows @0 (mult @1 { build_real_truncate (type, dconst_third ()); })))
4114 /* pow(pow(x,y),z) -> pow(x,y*z) iff x is nonnegative. */
4116 (pows (pows tree_expr_nonnegative_p@0 @1) @2)
4117 (pows @0 (mult @1 @2))))
4119 /* cabs(x+xi) -> fabs(x)*sqrt(2). */
4121 (CABS (complex @0 @0))
4122 (mult (abs @0) { build_real_truncate (type, dconst_sqrt2 ()); }))
4124 /* hypot(x,x) -> fabs(x)*sqrt(2). */
4127 (mult (abs @0) { build_real_truncate (type, dconst_sqrt2 ()); }))
4129 /* cexp(x+yi) -> exp(x)*cexpi(y). */
4134 (cexps compositional_complex@0)
4135 (if (targetm.libc_has_function (function_c99_math_complex))
4137 (mult (exps@1 (realpart @0)) (realpart (cexpis:type@2 (imagpart @0))))
4138 (mult @1 (imagpart @2)))))))
4140 (if (canonicalize_math_p ())
4141 /* floor(x) -> trunc(x) if x is nonnegative. */
4142 (for floors (FLOOR_ALL)
4145 (floors tree_expr_nonnegative_p@0)
4148 (match double_value_p
4150 (if (TYPE_MAIN_VARIANT (TREE_TYPE (@0)) == double_type_node)))
4151 (for froms (BUILT_IN_TRUNCL
4163 /* truncl(extend(x)) -> extend(trunc(x)), etc., if x is a double. */
4164 (if (optimize && canonicalize_math_p ())
4166 (froms (convert double_value_p@0))
4167 (convert (tos @0)))))
4169 (match float_value_p
4171 (if (TYPE_MAIN_VARIANT (TREE_TYPE (@0)) == float_type_node)))
4172 (for froms (BUILT_IN_TRUNCL BUILT_IN_TRUNC
4173 BUILT_IN_FLOORL BUILT_IN_FLOOR
4174 BUILT_IN_CEILL BUILT_IN_CEIL
4175 BUILT_IN_ROUNDL BUILT_IN_ROUND
4176 BUILT_IN_NEARBYINTL BUILT_IN_NEARBYINT
4177 BUILT_IN_RINTL BUILT_IN_RINT)
4178 tos (BUILT_IN_TRUNCF BUILT_IN_TRUNCF
4179 BUILT_IN_FLOORF BUILT_IN_FLOORF
4180 BUILT_IN_CEILF BUILT_IN_CEILF
4181 BUILT_IN_ROUNDF BUILT_IN_ROUNDF
4182 BUILT_IN_NEARBYINTF BUILT_IN_NEARBYINTF
4183 BUILT_IN_RINTF BUILT_IN_RINTF)
4184 /* truncl(extend(x)) and trunc(extend(x)) -> extend(truncf(x)), etc.,
4186 (if (optimize && canonicalize_math_p ()
4187 && targetm.libc_has_function (function_c99_misc))
4189 (froms (convert float_value_p@0))
4190 (convert (tos @0)))))
4192 (for froms (XFLOORL XCEILL XROUNDL XRINTL)
4193 tos (XFLOOR XCEIL XROUND XRINT)
4194 /* llfloorl(extend(x)) -> llfloor(x), etc., if x is a double. */
4195 (if (optimize && canonicalize_math_p ())
4197 (froms (convert double_value_p@0))
4200 (for froms (XFLOORL XCEILL XROUNDL XRINTL
4201 XFLOOR XCEIL XROUND XRINT)
4202 tos (XFLOORF XCEILF XROUNDF XRINTF)
4203 /* llfloorl(extend(x)) and llfloor(extend(x)) -> llfloorf(x), etc.,
4205 (if (optimize && canonicalize_math_p ())
4207 (froms (convert float_value_p@0))
4210 (if (canonicalize_math_p ())
4211 /* xfloor(x) -> fix_trunc(x) if x is nonnegative. */
4212 (for floors (IFLOOR LFLOOR LLFLOOR)
4214 (floors tree_expr_nonnegative_p@0)
4217 (if (canonicalize_math_p ())
4218 /* xfloor(x) -> fix_trunc(x), etc., if x is integer valued. */
4219 (for fns (IFLOOR LFLOOR LLFLOOR
4221 IROUND LROUND LLROUND)
4223 (fns integer_valued_real_p@0)
4225 (if (!flag_errno_math)
4226 /* xrint(x) -> fix_trunc(x), etc., if x is integer valued. */
4227 (for rints (IRINT LRINT LLRINT)
4229 (rints integer_valued_real_p@0)
4232 (if (canonicalize_math_p ())
4233 (for ifn (IFLOOR ICEIL IROUND IRINT)
4234 lfn (LFLOOR LCEIL LROUND LRINT)
4235 llfn (LLFLOOR LLCEIL LLROUND LLRINT)
4236 /* Canonicalize iround (x) to lround (x) on ILP32 targets where
4237 sizeof (int) == sizeof (long). */
4238 (if (TYPE_PRECISION (integer_type_node)
4239 == TYPE_PRECISION (long_integer_type_node))
4242 (lfn:long_integer_type_node @0)))
4243 /* Canonicalize llround (x) to lround (x) on LP64 targets where
4244 sizeof (long long) == sizeof (long). */
4245 (if (TYPE_PRECISION (long_long_integer_type_node)
4246 == TYPE_PRECISION (long_integer_type_node))
4249 (lfn:long_integer_type_node @0)))))
4251 /* cproj(x) -> x if we're ignoring infinities. */
4254 (if (!HONOR_INFINITIES (type))
4257 /* If the real part is inf and the imag part is known to be
4258 nonnegative, return (inf + 0i). */
4260 (CPROJ (complex REAL_CST@0 tree_expr_nonnegative_p@1))
4261 (if (real_isinf (TREE_REAL_CST_PTR (@0)))
4262 { build_complex_inf (type, false); }))
4264 /* If the imag part is inf, return (inf+I*copysign(0,imag)). */
4266 (CPROJ (complex @0 REAL_CST@1))
4267 (if (real_isinf (TREE_REAL_CST_PTR (@1)))
4268 { build_complex_inf (type, TREE_REAL_CST_PTR (@1)->sign); }))
4274 (pows @0 REAL_CST@1)
4276 const REAL_VALUE_TYPE *value = TREE_REAL_CST_PTR (@1);
4277 REAL_VALUE_TYPE tmp;
4280 /* pow(x,0) -> 1. */
4281 (if (real_equal (value, &dconst0))
4282 { build_real (type, dconst1); })
4283 /* pow(x,1) -> x. */
4284 (if (real_equal (value, &dconst1))
4286 /* pow(x,-1) -> 1/x. */
4287 (if (real_equal (value, &dconstm1))
4288 (rdiv { build_real (type, dconst1); } @0))
4289 /* pow(x,0.5) -> sqrt(x). */
4290 (if (flag_unsafe_math_optimizations
4291 && canonicalize_math_p ()
4292 && real_equal (value, &dconsthalf))
4294 /* pow(x,1/3) -> cbrt(x). */
4295 (if (flag_unsafe_math_optimizations
4296 && canonicalize_math_p ()
4297 && (tmp = real_value_truncate (TYPE_MODE (type), dconst_third ()),
4298 real_equal (value, &tmp)))
4301 /* powi(1,x) -> 1. */
4303 (POWI real_onep@0 @1)
4307 (POWI @0 INTEGER_CST@1)
4309 /* powi(x,0) -> 1. */
4310 (if (wi::to_wide (@1) == 0)
4311 { build_real (type, dconst1); })
4312 /* powi(x,1) -> x. */
4313 (if (wi::to_wide (@1) == 1)
4315 /* powi(x,-1) -> 1/x. */
4316 (if (wi::to_wide (@1) == -1)
4317 (rdiv { build_real (type, dconst1); } @0))))
4319 /* Narrowing of arithmetic and logical operations.
4321 These are conceptually similar to the transformations performed for
4322 the C/C++ front-ends by shorten_binary_op and shorten_compare. Long
4323 term we want to move all that code out of the front-ends into here. */
4325 /* If we have a narrowing conversion of an arithmetic operation where
4326 both operands are widening conversions from the same type as the outer
4327 narrowing conversion. Then convert the innermost operands to a suitable
4328 unsigned type (to avoid introducing undefined behavior), perform the
4329 operation and convert the result to the desired type. */
4330 (for op (plus minus)
4332 (convert (op:s (convert@2 @0) (convert?@3 @1)))
4333 (if (INTEGRAL_TYPE_P (type)
4334 /* We check for type compatibility between @0 and @1 below,
4335 so there's no need to check that @1/@3 are integral types. */
4336 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
4337 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
4338 /* The precision of the type of each operand must match the
4339 precision of the mode of each operand, similarly for the
4341 && type_has_mode_precision_p (TREE_TYPE (@0))
4342 && type_has_mode_precision_p (TREE_TYPE (@1))
4343 && type_has_mode_precision_p (type)
4344 /* The inner conversion must be a widening conversion. */
4345 && TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (TREE_TYPE (@0))
4346 && types_match (@0, type)
4347 && (types_match (@0, @1)
4348 /* Or the second operand is const integer or converted const
4349 integer from valueize. */
4350 || TREE_CODE (@1) == INTEGER_CST))
4351 (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
4352 (op @0 (convert @1))
4353 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
4354 (convert (op (convert:utype @0)
4355 (convert:utype @1))))))))
4357 /* This is another case of narrowing, specifically when there's an outer
4358 BIT_AND_EXPR which masks off bits outside the type of the innermost
4359 operands. Like the previous case we have to convert the operands
4360 to unsigned types to avoid introducing undefined behavior for the
4361 arithmetic operation. */
4362 (for op (minus plus)
4364 (bit_and (op:s (convert@2 @0) (convert@3 @1)) INTEGER_CST@4)
4365 (if (INTEGRAL_TYPE_P (type)
4366 /* We check for type compatibility between @0 and @1 below,
4367 so there's no need to check that @1/@3 are integral types. */
4368 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
4369 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
4370 /* The precision of the type of each operand must match the
4371 precision of the mode of each operand, similarly for the
4373 && type_has_mode_precision_p (TREE_TYPE (@0))
4374 && type_has_mode_precision_p (TREE_TYPE (@1))
4375 && type_has_mode_precision_p (type)
4376 /* The inner conversion must be a widening conversion. */
4377 && TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (TREE_TYPE (@0))
4378 && types_match (@0, @1)
4379 && (tree_int_cst_min_precision (@4, TYPE_SIGN (TREE_TYPE (@0)))
4380 <= TYPE_PRECISION (TREE_TYPE (@0)))
4381 && (wi::to_wide (@4)
4382 & wi::mask (TYPE_PRECISION (TREE_TYPE (@0)),
4383 true, TYPE_PRECISION (type))) == 0)
4384 (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
4385 (with { tree ntype = TREE_TYPE (@0); }
4386 (convert (bit_and (op @0 @1) (convert:ntype @4))))
4387 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
4388 (convert (bit_and (op (convert:utype @0) (convert:utype @1))
4389 (convert:utype @4))))))))
4391 /* Transform (@0 < @1 and @0 < @2) to use min,
4392 (@0 > @1 and @0 > @2) to use max */
4393 (for op (lt le gt ge)
4394 ext (min min max max)
4396 (bit_and (op:cs @0 @1) (op:cs @0 @2))
4397 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
4398 && TREE_CODE (@0) != INTEGER_CST)
4399 (op @0 (ext @1 @2)))))
4402 /* signbit(x) -> 0 if x is nonnegative. */
4403 (SIGNBIT tree_expr_nonnegative_p@0)
4404 { integer_zero_node; })
4407 /* signbit(x) -> x<0 if x doesn't have signed zeros. */
4409 (if (!HONOR_SIGNED_ZEROS (@0))
4410 (convert (lt @0 { build_real (TREE_TYPE (@0), dconst0); }))))
4412 /* Transform comparisons of the form X +- C1 CMP C2 to X CMP C2 -+ C1. */
4414 (for op (plus minus)
4417 (cmp (op@3 @0 INTEGER_CST@1) INTEGER_CST@2)
4418 (if (!TREE_OVERFLOW (@1) && !TREE_OVERFLOW (@2)
4419 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0))
4420 && !TYPE_OVERFLOW_TRAPS (TREE_TYPE (@0))
4421 && !TYPE_SATURATING (TREE_TYPE (@0)))
4422 (with { tree res = int_const_binop (rop, @2, @1); }
4423 (if (TREE_OVERFLOW (res)
4424 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
4425 { constant_boolean_node (cmp == NE_EXPR, type); }
4426 (if (single_use (@3))
4427 (cmp @0 { TREE_OVERFLOW (res)
4428 ? drop_tree_overflow (res) : res; }))))))))
4429 (for cmp (lt le gt ge)
4430 (for op (plus minus)
4433 (cmp (op@3 @0 INTEGER_CST@1) INTEGER_CST@2)
4434 (if (!TREE_OVERFLOW (@1) && !TREE_OVERFLOW (@2)
4435 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
4436 (with { tree res = int_const_binop (rop, @2, @1); }
4437 (if (TREE_OVERFLOW (res))
4439 fold_overflow_warning (("assuming signed overflow does not occur "
4440 "when simplifying conditional to constant"),
4441 WARN_STRICT_OVERFLOW_CONDITIONAL);
4442 bool less = cmp == LE_EXPR || cmp == LT_EXPR;
4443 /* wi::ges_p (@2, 0) should be sufficient for a signed type. */
4444 bool ovf_high = wi::lt_p (wi::to_wide (@1), 0,
4445 TYPE_SIGN (TREE_TYPE (@1)))
4446 != (op == MINUS_EXPR);
4447 constant_boolean_node (less == ovf_high, type);
4449 (if (single_use (@3))
4452 fold_overflow_warning (("assuming signed overflow does not occur "
4453 "when changing X +- C1 cmp C2 to "
4455 WARN_STRICT_OVERFLOW_COMPARISON);
4457 (cmp @0 { res; })))))))))
4459 /* Canonicalizations of BIT_FIELD_REFs. */
4462 (BIT_FIELD_REF @0 @1 @2)
4464 (if (TREE_CODE (TREE_TYPE (@0)) == COMPLEX_TYPE
4465 && tree_int_cst_equal (@1, TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0)))))
4467 (if (integer_zerop (@2))
4468 (view_convert (realpart @0)))
4469 (if (tree_int_cst_equal (@2, TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0)))))
4470 (view_convert (imagpart @0)))))
4471 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
4472 && INTEGRAL_TYPE_P (type)
4473 /* On GIMPLE this should only apply to register arguments. */
4474 && (! GIMPLE || is_gimple_reg (@0))
4475 /* A bit-field-ref that referenced the full argument can be stripped. */
4476 && ((compare_tree_int (@1, TYPE_PRECISION (TREE_TYPE (@0))) == 0
4477 && integer_zerop (@2))
4478 /* Low-parts can be reduced to integral conversions.
4479 ??? The following doesn't work for PDP endian. */
4480 || (BYTES_BIG_ENDIAN == WORDS_BIG_ENDIAN
4481 /* Don't even think about BITS_BIG_ENDIAN. */
4482 && TYPE_PRECISION (TREE_TYPE (@0)) % BITS_PER_UNIT == 0
4483 && TYPE_PRECISION (type) % BITS_PER_UNIT == 0
4484 && compare_tree_int (@2, (BYTES_BIG_ENDIAN
4485 ? (TYPE_PRECISION (TREE_TYPE (@0))
4486 - TYPE_PRECISION (type))
4490 /* Simplify vector extracts. */
4493 (BIT_FIELD_REF CONSTRUCTOR@0 @1 @2)
4494 (if (VECTOR_TYPE_P (TREE_TYPE (@0))
4495 && (types_match (type, TREE_TYPE (TREE_TYPE (@0)))
4496 || (VECTOR_TYPE_P (type)
4497 && types_match (TREE_TYPE (type), TREE_TYPE (TREE_TYPE (@0))))))
4500 tree ctor = (TREE_CODE (@0) == SSA_NAME
4501 ? gimple_assign_rhs1 (SSA_NAME_DEF_STMT (@0)) : @0);
4502 tree eltype = TREE_TYPE (TREE_TYPE (ctor));
4503 unsigned HOST_WIDE_INT width = tree_to_uhwi (TYPE_SIZE (eltype));
4504 unsigned HOST_WIDE_INT n = tree_to_uhwi (@1);
4505 unsigned HOST_WIDE_INT idx = tree_to_uhwi (@2);
4508 && (idx % width) == 0
4510 && ((idx + n) / width) <= TYPE_VECTOR_SUBPARTS (TREE_TYPE (ctor)))
4515 /* Constructor elements can be subvectors. */
4516 unsigned HOST_WIDE_INT k = 1;
4517 if (CONSTRUCTOR_NELTS (ctor) != 0)
4519 tree cons_elem = TREE_TYPE (CONSTRUCTOR_ELT (ctor, 0)->value);
4520 if (TREE_CODE (cons_elem) == VECTOR_TYPE)
4521 k = TYPE_VECTOR_SUBPARTS (cons_elem);
4525 /* We keep an exact subset of the constructor elements. */
4526 (if ((idx % k) == 0 && (n % k) == 0)
4527 (if (CONSTRUCTOR_NELTS (ctor) == 0)
4528 { build_constructor (type, NULL); }
4535 (if (idx < CONSTRUCTOR_NELTS (ctor))
4536 { CONSTRUCTOR_ELT (ctor, idx)->value; }
4537 { build_zero_cst (type); })
4539 vec<constructor_elt, va_gc> *vals;
4540 vec_alloc (vals, n);
4541 for (unsigned i = 0;
4542 i < n && idx + i < CONSTRUCTOR_NELTS (ctor); ++i)
4543 CONSTRUCTOR_APPEND_ELT (vals, NULL_TREE,
4544 CONSTRUCTOR_ELT (ctor, idx + i)->value);
4545 build_constructor (type, vals);
4547 /* The bitfield references a single constructor element. */
4548 (if (idx + n <= (idx / k + 1) * k)
4550 (if (CONSTRUCTOR_NELTS (ctor) <= idx / k)
4551 { build_zero_cst (type); })
4553 { CONSTRUCTOR_ELT (ctor, idx / k)->value; })
4554 (BIT_FIELD_REF { CONSTRUCTOR_ELT (ctor, idx / k)->value; }
4555 @1 { bitsize_int ((idx % k) * width); })))))))))
4557 /* Simplify a bit extraction from a bit insertion for the cases with
4558 the inserted element fully covering the extraction or the insertion
4559 not touching the extraction. */
4561 (BIT_FIELD_REF (bit_insert @0 @1 @ipos) @rsize @rpos)
4564 unsigned HOST_WIDE_INT isize;
4565 if (INTEGRAL_TYPE_P (TREE_TYPE (@1)))
4566 isize = TYPE_PRECISION (TREE_TYPE (@1));
4568 isize = tree_to_uhwi (TYPE_SIZE (TREE_TYPE (@1)));
4571 (if (wi::leu_p (wi::to_wide (@ipos), wi::to_wide (@rpos))
4572 && wi::leu_p (wi::to_wide (@rpos) + wi::to_wide (@rsize),
4573 wi::to_wide (@ipos) + isize))
4574 (BIT_FIELD_REF @1 @rsize { wide_int_to_tree (bitsizetype,
4576 - wi::to_wide (@ipos)); }))
4577 (if (wi::geu_p (wi::to_wide (@ipos),
4578 wi::to_wide (@rpos) + wi::to_wide (@rsize))
4579 || wi::geu_p (wi::to_wide (@rpos),
4580 wi::to_wide (@ipos) + isize))
4581 (BIT_FIELD_REF @0 @rsize @rpos)))))