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-2016 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 /* Simplifications of operations with one constant operand and
79 simplifications to constants or single values. */
81 (for op (plus pointer_plus minus bit_ior bit_xor)
86 /* 0 +p index -> (type)index */
88 (pointer_plus integer_zerop @1)
89 (non_lvalue (convert @1)))
91 /* See if ARG1 is zero and X + ARG1 reduces to X.
92 Likewise if the operands are reversed. */
94 (plus:c @0 real_zerop@1)
95 (if (fold_real_zero_addition_p (type, @1, 0))
98 /* See if ARG1 is zero and X - ARG1 reduces to X. */
100 (minus @0 real_zerop@1)
101 (if (fold_real_zero_addition_p (type, @1, 1))
105 This is unsafe for certain floats even in non-IEEE formats.
106 In IEEE, it is unsafe because it does wrong for NaNs.
107 Also note that operand_equal_p is always false if an operand
111 (if (!FLOAT_TYPE_P (type) || !HONOR_NANS (type))
112 { build_zero_cst (type); }))
115 (mult @0 integer_zerop@1)
118 /* Maybe fold x * 0 to 0. The expressions aren't the same
119 when x is NaN, since x * 0 is also NaN. Nor are they the
120 same in modes with signed zeros, since multiplying a
121 negative value by 0 gives -0, not +0. */
123 (mult @0 real_zerop@1)
124 (if (!HONOR_NANS (type) && !HONOR_SIGNED_ZEROS (type))
127 /* In IEEE floating point, x*1 is not equivalent to x for snans.
128 Likewise for complex arithmetic with signed zeros. */
131 (if (!HONOR_SNANS (type)
132 && (!HONOR_SIGNED_ZEROS (type)
133 || !COMPLEX_FLOAT_TYPE_P (type)))
136 /* Transform x * -1.0 into -x. */
138 (mult @0 real_minus_onep)
139 (if (!HONOR_SNANS (type)
140 && (!HONOR_SIGNED_ZEROS (type)
141 || !COMPLEX_FLOAT_TYPE_P (type)))
144 /* X * 1, X / 1 -> X. */
145 (for op (mult trunc_div ceil_div floor_div round_div exact_div)
150 /* Preserve explicit divisions by 0: the C++ front-end wants to detect
151 undefined behavior in constexpr evaluation, and assuming that the division
152 traps enables better optimizations than these anyway. */
153 (for div (trunc_div ceil_div floor_div round_div exact_div)
154 /* 0 / X is always zero. */
156 (div integer_zerop@0 @1)
157 /* But not for 0 / 0 so that we can get the proper warnings and errors. */
158 (if (!integer_zerop (@1))
162 (div @0 integer_minus_onep@1)
163 (if (!TYPE_UNSIGNED (type))
168 /* But not for 0 / 0 so that we can get the proper warnings and errors. */
169 (if (!integer_zerop (@0))
170 { build_one_cst (type); }))
171 /* X / abs (X) is X < 0 ? -1 : 1. */
174 (if (INTEGRAL_TYPE_P (type)
175 && TYPE_OVERFLOW_UNDEFINED (type))
176 (cond (lt @0 { build_zero_cst (type); })
177 { build_minus_one_cst (type); } { build_one_cst (type); })))
180 (div:C @0 (negate @0))
181 (if ((INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
182 && TYPE_OVERFLOW_UNDEFINED (type))
183 { build_minus_one_cst (type); })))
185 /* For unsigned integral types, FLOOR_DIV_EXPR is the same as
186 TRUNC_DIV_EXPR. Rewrite into the latter in this case. */
189 (if ((INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
190 && TYPE_UNSIGNED (type))
193 /* Combine two successive divisions. Note that combining ceil_div
194 and floor_div is trickier and combining round_div even more so. */
195 (for div (trunc_div exact_div)
197 (div (div @0 INTEGER_CST@1) INTEGER_CST@2)
200 wide_int mul = wi::mul (@1, @2, TYPE_SIGN (type), &overflow_p);
203 (div @0 { wide_int_to_tree (type, mul); })
204 (if (TYPE_UNSIGNED (type)
205 || mul != wi::min_value (TYPE_PRECISION (type), SIGNED))
206 { build_zero_cst (type); })))))
208 /* Optimize A / A to 1.0 if we don't care about
209 NaNs or Infinities. */
212 (if (FLOAT_TYPE_P (type)
213 && ! HONOR_NANS (type)
214 && ! HONOR_INFINITIES (type))
215 { build_one_cst (type); }))
217 /* Optimize -A / A to -1.0 if we don't care about
218 NaNs or Infinities. */
220 (rdiv:C @0 (negate @0))
221 (if (FLOAT_TYPE_P (type)
222 && ! HONOR_NANS (type)
223 && ! HONOR_INFINITIES (type))
224 { build_minus_one_cst (type); }))
226 /* PR71078: x / abs(x) -> copysign (1.0, x) */
228 (rdiv:C (convert? @0) (convert? (abs @0)))
229 (if (SCALAR_FLOAT_TYPE_P (type)
230 && ! HONOR_NANS (type)
231 && ! HONOR_INFINITIES (type))
233 (if (types_match (type, float_type_node))
234 (BUILT_IN_COPYSIGNF { build_one_cst (type); } (convert @0)))
235 (if (types_match (type, double_type_node))
236 (BUILT_IN_COPYSIGN { build_one_cst (type); } (convert @0)))
237 (if (types_match (type, long_double_type_node))
238 (BUILT_IN_COPYSIGNL { build_one_cst (type); } (convert @0))))))
240 /* In IEEE floating point, x/1 is not equivalent to x for snans. */
243 (if (!HONOR_SNANS (type))
246 /* In IEEE floating point, x/-1 is not equivalent to -x for snans. */
248 (rdiv @0 real_minus_onep)
249 (if (!HONOR_SNANS (type))
252 (if (flag_reciprocal_math)
253 /* Convert (A/B)/C to A/(B*C) */
255 (rdiv (rdiv:s @0 @1) @2)
256 (rdiv @0 (mult @1 @2)))
258 /* Convert A/(B/C) to (A/B)*C */
260 (rdiv @0 (rdiv:s @1 @2))
261 (mult (rdiv @0 @1) @2)))
263 /* Optimize (X & (-A)) / A where A is a power of 2, to X >> log2(A) */
264 (for div (trunc_div ceil_div floor_div round_div exact_div)
266 (div (convert? (bit_and @0 INTEGER_CST@1)) INTEGER_CST@2)
267 (if (integer_pow2p (@2)
268 && tree_int_cst_sgn (@2) > 0
269 && wi::add (@2, @1) == 0
270 && tree_nop_conversion_p (type, TREE_TYPE (@0)))
271 (rshift (convert @0) { build_int_cst (integer_type_node,
272 wi::exact_log2 (@2)); }))))
274 /* If ARG1 is a constant, we can convert this to a multiply by the
275 reciprocal. This does not have the same rounding properties,
276 so only do this if -freciprocal-math. We can actually
277 always safely do it if ARG1 is a power of two, but it's hard to
278 tell if it is or not in a portable manner. */
279 (for cst (REAL_CST COMPLEX_CST VECTOR_CST)
283 (if (flag_reciprocal_math
286 { tree tem = const_binop (RDIV_EXPR, type, build_one_cst (type), @1); }
288 (mult @0 { tem; } )))
289 (if (cst != COMPLEX_CST)
290 (with { tree inverse = exact_inverse (type, @1); }
292 (mult @0 { inverse; } ))))))))
294 (for mod (ceil_mod floor_mod round_mod trunc_mod)
295 /* 0 % X is always zero. */
297 (mod integer_zerop@0 @1)
298 /* But not for 0 % 0 so that we can get the proper warnings and errors. */
299 (if (!integer_zerop (@1))
301 /* X % 1 is always zero. */
303 (mod @0 integer_onep)
304 { build_zero_cst (type); })
305 /* X % -1 is zero. */
307 (mod @0 integer_minus_onep@1)
308 (if (!TYPE_UNSIGNED (type))
309 { build_zero_cst (type); }))
313 /* But not for 0 % 0 so that we can get the proper warnings and errors. */
314 (if (!integer_zerop (@0))
315 { build_zero_cst (type); }))
316 /* (X % Y) % Y is just X % Y. */
318 (mod (mod@2 @0 @1) @1)
320 /* From extract_muldiv_1: (X * C1) % C2 is zero if C1 is a multiple of C2. */
322 (mod (mult @0 INTEGER_CST@1) INTEGER_CST@2)
323 (if (ANY_INTEGRAL_TYPE_P (type)
324 && TYPE_OVERFLOW_UNDEFINED (type)
325 && wi::multiple_of_p (@1, @2, TYPE_SIGN (type)))
326 { build_zero_cst (type); })))
328 /* X % -C is the same as X % C. */
330 (trunc_mod @0 INTEGER_CST@1)
331 (if (TYPE_SIGN (type) == SIGNED
332 && !TREE_OVERFLOW (@1)
334 && !TYPE_OVERFLOW_TRAPS (type)
335 /* Avoid this transformation if C is INT_MIN, i.e. C == -C. */
336 && !sign_bit_p (@1, @1))
337 (trunc_mod @0 (negate @1))))
339 /* X % -Y is the same as X % Y. */
341 (trunc_mod @0 (convert? (negate @1)))
342 (if (INTEGRAL_TYPE_P (type)
343 && !TYPE_UNSIGNED (type)
344 && !TYPE_OVERFLOW_TRAPS (type)
345 && tree_nop_conversion_p (type, TREE_TYPE (@1))
346 /* Avoid this transformation if X might be INT_MIN or
347 Y might be -1, because we would then change valid
348 INT_MIN % -(-1) into invalid INT_MIN % -1. */
349 && (expr_not_equal_to (@0, TYPE_MIN_VALUE (type))
350 || expr_not_equal_to (@1, wi::minus_one (TYPE_PRECISION
352 (trunc_mod @0 (convert @1))))
354 /* X - (X / Y) * Y is the same as X % Y. */
356 (minus (convert1? @0) (convert2? (mult:c (trunc_div @@0 @@1) @1)))
357 (if (INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
358 (convert (trunc_mod @0 @1))))
360 /* Optimize TRUNC_MOD_EXPR by a power of two into a BIT_AND_EXPR,
361 i.e. "X % C" into "X & (C - 1)", if X and C are positive.
362 Also optimize A % (C << N) where C is a power of 2,
363 to A & ((C << N) - 1). */
364 (match (power_of_two_cand @1)
366 (match (power_of_two_cand @1)
367 (lshift INTEGER_CST@1 @2))
368 (for mod (trunc_mod floor_mod)
370 (mod @0 (convert?@3 (power_of_two_cand@1 @2)))
371 (if ((TYPE_UNSIGNED (type)
372 || tree_expr_nonnegative_p (@0))
373 && tree_nop_conversion_p (type, TREE_TYPE (@3))
374 && integer_pow2p (@2) && tree_int_cst_sgn (@2) > 0)
375 (bit_and @0 (convert (minus @1 { build_int_cst (TREE_TYPE (@1), 1); }))))))
377 /* Simplify (unsigned t * 2)/2 -> unsigned t & 0x7FFFFFFF. */
379 (trunc_div (mult @0 integer_pow2p@1) @1)
380 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
381 (bit_and @0 { wide_int_to_tree
382 (type, wi::mask (TYPE_PRECISION (type) - wi::exact_log2 (@1),
383 false, TYPE_PRECISION (type))); })))
385 /* Simplify (unsigned t / 2) * 2 -> unsigned t & ~1. */
387 (mult (trunc_div @0 integer_pow2p@1) @1)
388 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
389 (bit_and @0 (negate @1))))
391 /* Simplify (t * 2) / 2) -> t. */
392 (for div (trunc_div ceil_div floor_div round_div exact_div)
394 (div (mult @0 @1) @1)
395 (if (ANY_INTEGRAL_TYPE_P (type)
396 && TYPE_OVERFLOW_UNDEFINED (type))
400 /* Simplify cos(-x) and cos(|x|) -> cos(x). Similarly for cosh. */
405 /* Simplify pow(-x, y) and pow(|x|,y) -> pow(x,y) if y is an even integer. */
408 (pows (op @0) REAL_CST@1)
409 (with { HOST_WIDE_INT n; }
410 (if (real_isinteger (&TREE_REAL_CST (@1), &n) && (n & 1) == 0)
412 /* Likewise for powi. */
415 (pows (op @0) INTEGER_CST@1)
416 (if (wi::bit_and (@1, 1) == 0)
418 /* Strip negate and abs from both operands of hypot. */
426 /* copysign(-x, y) and copysign(abs(x), y) -> copysign(x, y). */
427 (for copysigns (COPYSIGN)
429 (copysigns (op @0) @1)
432 /* abs(x)*abs(x) -> x*x. Should be valid for all types. */
437 /* cos(copysign(x, y)) -> cos(x). Similarly for cosh. */
441 (coss (copysigns @0 @1))
444 /* pow(copysign(x, y), z) -> pow(x, z) if z is an even integer. */
448 (pows (copysigns @0 @2) REAL_CST@1)
449 (with { HOST_WIDE_INT n; }
450 (if (real_isinteger (&TREE_REAL_CST (@1), &n) && (n & 1) == 0)
452 /* Likewise for powi. */
456 (pows (copysigns @0 @2) INTEGER_CST@1)
457 (if (wi::bit_and (@1, 1) == 0)
462 /* hypot(copysign(x, y), z) -> hypot(x, z). */
464 (hypots (copysigns @0 @1) @2)
466 /* hypot(x, copysign(y, z)) -> hypot(x, y). */
468 (hypots @0 (copysigns @1 @2))
471 /* copysign(x, CST) -> [-]abs (x). */
472 (for copysigns (COPYSIGN)
474 (copysigns @0 REAL_CST@1)
475 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
479 /* copysign(copysign(x, y), z) -> copysign(x, z). */
480 (for copysigns (COPYSIGN)
482 (copysigns (copysigns @0 @1) @2)
485 /* copysign(x,y)*copysign(x,y) -> x*x. */
486 (for copysigns (COPYSIGN)
488 (mult (copysigns@2 @0 @1) @2)
491 /* ccos(-x) -> ccos(x). Similarly for ccosh. */
492 (for ccoss (CCOS CCOSH)
497 /* cabs(-x) and cos(conj(x)) -> cabs(x). */
498 (for ops (conj negate)
504 /* Fold (a * (1 << b)) into (a << b) */
506 (mult:c @0 (convert? (lshift integer_onep@1 @2)))
507 (if (! FLOAT_TYPE_P (type)
508 && tree_nop_conversion_p (type, TREE_TYPE (@1)))
511 /* Fold (C1/X)*C2 into (C1*C2)/X. */
513 (mult (rdiv@3 REAL_CST@0 @1) REAL_CST@2)
514 (if (flag_associative_math
517 { tree tem = const_binop (MULT_EXPR, type, @0, @2); }
519 (rdiv { tem; } @1)))))
521 /* Convert C1/(X*C2) into (C1/C2)/X */
523 (rdiv REAL_CST@0 (mult @1 REAL_CST@2))
524 (if (flag_reciprocal_math)
526 { tree tem = const_binop (RDIV_EXPR, type, @0, @2); }
528 (rdiv { tem; } @1)))))
530 /* Simplify ~X & X as zero. */
532 (bit_and:c (convert? @0) (convert? (bit_not @0)))
533 { build_zero_cst (type); })
535 /* PR71636: Transform x & ((1U << b) - 1) -> x & ~(~0U << b); */
537 (bit_and:c @0 (plus:s (lshift:s integer_onep @1) integer_minus_onep))
538 (if (TYPE_UNSIGNED (type))
539 (bit_and @0 (bit_not (lshift { build_all_ones_cst (type); } @1)))))
541 /* PR35691: Transform
542 (x == 0 & y == 0) -> (x | typeof(x)(y)) == 0.
543 (x != 0 | y != 0) -> (x | typeof(x)(y)) != 0. */
544 (for bitop (bit_and bit_ior)
547 (bitop (cmp @0 integer_zerop@2) (cmp @1 integer_zerop))
548 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
549 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
550 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1)))
551 (cmp (bit_ior @0 (convert @1)) @2))))
553 /* Fold (A & ~B) - (A & B) into (A ^ B) - B. */
555 (minus (bit_and:cs @0 (bit_not @1)) (bit_and:cs @0 @1))
556 (minus (bit_xor @0 @1) @1))
558 (minus (bit_and:s @0 INTEGER_CST@2) (bit_and:s @0 INTEGER_CST@1))
559 (if (wi::bit_not (@2) == @1)
560 (minus (bit_xor @0 @1) @1)))
562 /* Fold (A & B) - (A & ~B) into B - (A ^ B). */
564 (minus (bit_and:cs @0 @1) (bit_and:cs @0 (bit_not @1)))
565 (minus @1 (bit_xor @0 @1)))
567 /* Simplify (X & ~Y) | (~X & Y) -> X ^ Y. */
569 (bit_ior (bit_and:c @0 (bit_not @1)) (bit_and:c (bit_not @0) @1))
572 (bit_ior:c (bit_and @0 INTEGER_CST@2) (bit_and (bit_not @0) INTEGER_CST@1))
573 (if (wi::bit_not (@2) == @1)
576 /* PR53979: Transform ((a ^ b) | a) -> (a | b) */
578 (bit_ior:c (bit_xor:c @0 @1) @0)
581 /* Simplify (~X & Y) to X ^ Y if we know that (X & ~Y) is 0. */
584 (bit_and (bit_not SSA_NAME@0) INTEGER_CST@1)
585 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
586 && (get_nonzero_bits (@0) & wi::bit_not (@1)) == 0)
590 /* X % Y is smaller than Y. */
593 (cmp (trunc_mod @0 @1) @1)
594 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
595 { constant_boolean_node (cmp == LT_EXPR, type); })))
598 (cmp @1 (trunc_mod @0 @1))
599 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
600 { constant_boolean_node (cmp == GT_EXPR, type); })))
604 (bit_ior @0 integer_all_onesp@1)
609 (bit_ior @0 integer_zerop)
614 (bit_and @0 integer_zerop@1)
620 (for op (bit_ior bit_xor plus)
622 (op:c (convert? @0) (convert? (bit_not @0)))
623 (convert { build_all_ones_cst (TREE_TYPE (@0)); })))
628 { build_zero_cst (type); })
630 /* Canonicalize X ^ ~0 to ~X. */
632 (bit_xor @0 integer_all_onesp@1)
637 (bit_and @0 integer_all_onesp)
640 /* x & x -> x, x | x -> x */
641 (for bitop (bit_and bit_ior)
646 /* x & C -> x if we know that x & ~C == 0. */
649 (bit_and SSA_NAME@0 INTEGER_CST@1)
650 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
651 && (get_nonzero_bits (@0) & wi::bit_not (@1)) == 0)
655 /* x + (x & 1) -> (x + 1) & ~1 */
657 (plus:c @0 (bit_and:s @0 integer_onep@1))
658 (bit_and (plus @0 @1) (bit_not @1)))
660 /* x & ~(x & y) -> x & ~y */
661 /* x | ~(x | y) -> x | ~y */
662 (for bitop (bit_and bit_ior)
664 (bitop:c @0 (bit_not (bitop:cs @0 @1)))
665 (bitop @0 (bit_not @1))))
667 /* (x | y) & ~x -> y & ~x */
668 /* (x & y) | ~x -> y | ~x */
669 (for bitop (bit_and bit_ior)
670 rbitop (bit_ior bit_and)
672 (bitop:c (rbitop:c @0 @1) (bit_not@2 @0))
675 /* (x & y) ^ (x | y) -> x ^ y */
677 (bit_xor:c (bit_and @0 @1) (bit_ior @0 @1))
680 /* (x ^ y) ^ (x | y) -> x & y */
682 (bit_xor:c (bit_xor @0 @1) (bit_ior @0 @1))
685 /* (x & y) + (x ^ y) -> x | y */
686 /* (x & y) | (x ^ y) -> x | y */
687 /* (x & y) ^ (x ^ y) -> x | y */
688 (for op (plus bit_ior bit_xor)
690 (op:c (bit_and @0 @1) (bit_xor @0 @1))
693 /* (x & y) + (x | y) -> x + y */
695 (plus:c (bit_and @0 @1) (bit_ior @0 @1))
698 /* (x + y) - (x | y) -> x & y */
700 (minus (plus @0 @1) (bit_ior @0 @1))
701 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
702 && !TYPE_SATURATING (type))
705 /* (x + y) - (x & y) -> x | y */
707 (minus (plus @0 @1) (bit_and @0 @1))
708 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
709 && !TYPE_SATURATING (type))
712 /* (x | y) - (x ^ y) -> x & y */
714 (minus (bit_ior @0 @1) (bit_xor @0 @1))
717 /* (x | y) - (x & y) -> x ^ y */
719 (minus (bit_ior @0 @1) (bit_and @0 @1))
722 /* (x | y) & ~(x & y) -> x ^ y */
724 (bit_and:c (bit_ior @0 @1) (bit_not (bit_and @0 @1)))
727 /* (x | y) & (~x ^ y) -> x & y */
729 (bit_and:c (bit_ior:c @0 @1) (bit_xor:c @1 (bit_not @0)))
732 /* ~x & ~y -> ~(x | y)
733 ~x | ~y -> ~(x & y) */
734 (for op (bit_and bit_ior)
735 rop (bit_ior bit_and)
737 (op (convert1? (bit_not @0)) (convert2? (bit_not @1)))
738 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
739 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
740 (bit_not (rop (convert @0) (convert @1))))))
742 /* If we are XORing or adding two BIT_AND_EXPR's, both of which are and'ing
743 with a constant, and the two constants have no bits in common,
744 we should treat this as a BIT_IOR_EXPR since this may produce more
746 (for op (bit_xor plus)
748 (op (convert1? (bit_and@4 @0 INTEGER_CST@1))
749 (convert2? (bit_and@5 @2 INTEGER_CST@3)))
750 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
751 && tree_nop_conversion_p (type, TREE_TYPE (@2))
752 && wi::bit_and (@1, @3) == 0)
753 (bit_ior (convert @4) (convert @5)))))
755 /* (X | Y) ^ X -> Y & ~ X*/
757 (bit_xor:c (convert1? (bit_ior:c @@0 @1)) (convert2? @0))
758 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
759 (convert (bit_and @1 (bit_not @0)))))
761 /* Convert ~X ^ ~Y to X ^ Y. */
763 (bit_xor (convert1? (bit_not @0)) (convert2? (bit_not @1)))
764 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
765 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
766 (bit_xor (convert @0) (convert @1))))
768 /* Convert ~X ^ C to X ^ ~C. */
770 (bit_xor (convert? (bit_not @0)) INTEGER_CST@1)
771 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
772 (bit_xor (convert @0) (bit_not @1))))
774 /* Fold (X & Y) ^ Y and (X ^ Y) & Y as ~X & Y. */
775 (for opo (bit_and bit_xor)
776 opi (bit_xor bit_and)
778 (opo:c (opi:c @0 @1) @1)
779 (bit_and (bit_not @0) @1)))
781 /* Given a bit-wise operation CODE applied to ARG0 and ARG1, see if both
782 operands are another bit-wise operation with a common input. If so,
783 distribute the bit operations to save an operation and possibly two if
784 constants are involved. For example, convert
785 (A | B) & (A | C) into A | (B & C)
786 Further simplification will occur if B and C are constants. */
787 (for op (bit_and bit_ior bit_xor)
788 rop (bit_ior bit_and bit_and)
790 (op (convert? (rop:c @@0 @1)) (convert? (rop:c @0 @2)))
791 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
792 && tree_nop_conversion_p (type, TREE_TYPE (@2)))
793 (rop (convert @0) (op (convert @1) (convert @2))))))
795 /* Some simple reassociation for bit operations, also handled in reassoc. */
796 /* (X & Y) & Y -> X & Y
797 (X | Y) | Y -> X | Y */
798 (for op (bit_and bit_ior)
800 (op:c (convert1?@2 (op:c @0 @@1)) (convert2? @1))
802 /* (X ^ Y) ^ Y -> X */
804 (bit_xor:c (convert1? (bit_xor:c @0 @@1)) (convert2? @1))
806 /* (X & Y) & (X & Z) -> (X & Y) & Z
807 (X | Y) | (X | Z) -> (X | Y) | Z */
808 (for op (bit_and bit_ior)
810 (op:c (convert1?@3 (op:c@4 @0 @1)) (convert2?@5 (op:c@6 @0 @2)))
811 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
812 && tree_nop_conversion_p (type, TREE_TYPE (@2)))
813 (if (single_use (@5) && single_use (@6))
815 (if (single_use (@3) && single_use (@4))
816 (op (convert @1) @5))))))
817 /* (X ^ Y) ^ (X ^ Z) -> Y ^ Z */
819 (bit_xor (convert1? (bit_xor:c @0 @1)) (convert2? (bit_xor:c @0 @2)))
820 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
821 && tree_nop_conversion_p (type, TREE_TYPE (@2)))
822 (bit_xor (convert @1) (convert @2))))
831 (abs tree_expr_nonnegative_p@0)
834 /* A few cases of fold-const.c negate_expr_p predicate. */
837 (if ((INTEGRAL_TYPE_P (type)
838 && TYPE_OVERFLOW_WRAPS (type))
839 || (!TYPE_OVERFLOW_SANITIZED (type)
840 && may_negate_without_overflow_p (t)))))
845 (if (!TYPE_OVERFLOW_SANITIZED (type))))
848 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (t)))))
849 /* VECTOR_CST handling of non-wrapping types would recurse in unsupported
853 (if (FLOAT_TYPE_P (TREE_TYPE (type)) || TYPE_OVERFLOW_WRAPS (type))))
855 /* (-A) * (-B) -> A * B */
857 (mult:c (convert1? (negate @0)) (convert2? negate_expr_p@1))
858 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
859 && tree_nop_conversion_p (type, TREE_TYPE (@1)))
860 (mult (convert @0) (convert (negate @1)))))
862 /* -(A + B) -> (-B) - A. */
864 (negate (plus:c @0 negate_expr_p@1))
865 (if (!HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type))
866 && !HONOR_SIGNED_ZEROS (element_mode (type)))
867 (minus (negate @1) @0)))
869 /* A - B -> A + (-B) if B is easily negatable. */
871 (minus @0 negate_expr_p@1)
872 (if (!FIXED_POINT_TYPE_P (type))
873 (plus @0 (negate @1))))
875 /* Try to fold (type) X op CST -> (type) (X op ((type-x) CST))
877 For bitwise binary operations apply operand conversions to the
878 binary operation result instead of to the operands. This allows
879 to combine successive conversions and bitwise binary operations.
880 We combine the above two cases by using a conditional convert. */
881 (for bitop (bit_and bit_ior bit_xor)
883 (bitop (convert @0) (convert? @1))
884 (if (((TREE_CODE (@1) == INTEGER_CST
885 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
886 && int_fits_type_p (@1, TREE_TYPE (@0)))
887 || types_match (@0, @1))
888 /* ??? This transform conflicts with fold-const.c doing
889 Convert (T)(x & c) into (T)x & (T)c, if c is an integer
890 constants (if x has signed type, the sign bit cannot be set
891 in c). This folds extension into the BIT_AND_EXPR.
892 Restrict it to GIMPLE to avoid endless recursions. */
893 && (bitop != BIT_AND_EXPR || GIMPLE)
894 && (/* That's a good idea if the conversion widens the operand, thus
895 after hoisting the conversion the operation will be narrower. */
896 TYPE_PRECISION (TREE_TYPE (@0)) < TYPE_PRECISION (type)
897 /* It's also a good idea if the conversion is to a non-integer
899 || GET_MODE_CLASS (TYPE_MODE (type)) != MODE_INT
900 /* Or if the precision of TO is not the same as the precision
902 || TYPE_PRECISION (type) != GET_MODE_PRECISION (TYPE_MODE (type))))
903 (convert (bitop @0 (convert @1))))))
905 (for bitop (bit_and bit_ior)
906 rbitop (bit_ior bit_and)
907 /* (x | y) & x -> x */
908 /* (x & y) | x -> x */
910 (bitop:c (rbitop:c @0 @1) @0)
912 /* (~x | y) & x -> x & y */
913 /* (~x & y) | x -> x | y */
915 (bitop:c (rbitop:c (bit_not @0) @1) @0)
918 /* (x | CST1) & CST2 -> (x & CST2) | (CST1 & CST2) */
920 (bit_and (bit_ior @0 CONSTANT_CLASS_P@1) CONSTANT_CLASS_P@2)
921 (bit_ior (bit_and @0 @2) (bit_and @1 @2)))
923 /* Combine successive equal operations with constants. */
924 (for bitop (bit_and bit_ior bit_xor)
926 (bitop (bitop @0 CONSTANT_CLASS_P@1) CONSTANT_CLASS_P@2)
927 (bitop @0 (bitop @1 @2))))
929 /* Try simple folding for X op !X, and X op X with the help
930 of the truth_valued_p and logical_inverted_value predicates. */
931 (match truth_valued_p
933 (if (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) == 1)))
934 (for op (tcc_comparison truth_and truth_andif truth_or truth_orif truth_xor)
935 (match truth_valued_p
937 (match truth_valued_p
940 (match (logical_inverted_value @0)
942 (match (logical_inverted_value @0)
943 (bit_not truth_valued_p@0))
944 (match (logical_inverted_value @0)
945 (eq @0 integer_zerop))
946 (match (logical_inverted_value @0)
947 (ne truth_valued_p@0 integer_truep))
948 (match (logical_inverted_value @0)
949 (bit_xor truth_valued_p@0 integer_truep))
953 (bit_and:c @0 (logical_inverted_value @0))
954 { build_zero_cst (type); })
955 /* X | !X and X ^ !X -> 1, , if X is truth-valued. */
956 (for op (bit_ior bit_xor)
958 (op:c truth_valued_p@0 (logical_inverted_value @0))
959 { constant_boolean_node (true, type); }))
960 /* X ==/!= !X is false/true. */
963 (op:c truth_valued_p@0 (logical_inverted_value @0))
964 { constant_boolean_node (op == NE_EXPR ? true : false, type); }))
968 (bit_not (bit_not @0))
971 /* Convert ~ (-A) to A - 1. */
973 (bit_not (convert? (negate @0)))
974 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
975 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
976 (convert (minus @0 { build_each_one_cst (TREE_TYPE (@0)); }))))
978 /* Convert ~ (A - 1) or ~ (A + -1) to -A. */
980 (bit_not (convert? (minus @0 integer_each_onep)))
981 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
982 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
983 (convert (negate @0))))
985 (bit_not (convert? (plus @0 integer_all_onesp)))
986 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
987 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
988 (convert (negate @0))))
990 /* Part of convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */
992 (bit_not (convert? (bit_xor @0 INTEGER_CST@1)))
993 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
994 (convert (bit_xor @0 (bit_not @1)))))
996 (bit_not (convert? (bit_xor:c (bit_not @0) @1)))
997 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
998 (convert (bit_xor @0 @1))))
1000 /* (x & ~m) | (y & m) -> ((x ^ y) & m) ^ x */
1002 (bit_ior:c (bit_and:cs @0 (bit_not @2)) (bit_and:cs @1 @2))
1003 (bit_xor (bit_and (bit_xor @0 @1) @2) @0))
1005 /* Fold A - (A & B) into ~B & A. */
1007 (minus (convert1? @0) (convert2?:s (bit_and:cs @@0 @1)))
1008 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
1009 && tree_nop_conversion_p (type, TREE_TYPE (@1)))
1010 (convert (bit_and (bit_not @1) @0))))
1012 /* For integral types with undefined overflow and C != 0 fold
1013 x * C EQ/NE y * C into x EQ/NE y. */
1016 (cmp (mult:c @0 @1) (mult:c @2 @1))
1017 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
1018 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
1019 && tree_expr_nonzero_p (@1))
1022 /* For integral types with undefined overflow and C != 0 fold
1023 x * C RELOP y * C into:
1025 x RELOP y for nonnegative C
1026 y RELOP x for negative C */
1027 (for cmp (lt gt le ge)
1029 (cmp (mult:c @0 @1) (mult:c @2 @1))
1030 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
1031 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
1032 (if (tree_expr_nonnegative_p (@1) && tree_expr_nonzero_p (@1))
1034 (if (TREE_CODE (@1) == INTEGER_CST
1035 && wi::neg_p (@1, TYPE_SIGN (TREE_TYPE (@1))))
1038 /* ((X inner_op C0) outer_op C1)
1039 With X being a tree where value_range has reasoned certain bits to always be
1040 zero throughout its computed value range,
1041 inner_op = {|,^}, outer_op = {|,^} and inner_op != outer_op
1042 where zero_mask has 1's for all bits that are sure to be 0 in
1044 if (inner_op == '^') C0 &= ~C1;
1045 if ((C0 & ~zero_mask) == 0) then emit (X outer_op (C0 outer_op C1)
1046 if ((C1 & ~zero_mask) == 0) then emit (X inner_op (C0 outer_op C1)
1048 (for inner_op (bit_ior bit_xor)
1049 outer_op (bit_xor bit_ior)
1052 (inner_op:s @2 INTEGER_CST@0) INTEGER_CST@1)
1056 wide_int zero_mask_not;
1060 if (TREE_CODE (@2) == SSA_NAME)
1061 zero_mask_not = get_nonzero_bits (@2);
1065 if (inner_op == BIT_XOR_EXPR)
1067 C0 = wi::bit_and_not (@0, @1);
1068 cst_emit = wi::bit_or (C0, @1);
1073 cst_emit = wi::bit_xor (@0, @1);
1076 (if (!fail && wi::bit_and (C0, zero_mask_not) == 0)
1077 (outer_op @2 { wide_int_to_tree (type, cst_emit); })
1078 (if (!fail && wi::bit_and (@1, zero_mask_not) == 0)
1079 (inner_op @2 { wide_int_to_tree (type, cst_emit); }))))))
1081 /* Associate (p +p off1) +p off2 as (p +p (off1 + off2)). */
1083 (pointer_plus (pointer_plus:s @0 @1) @3)
1084 (pointer_plus @0 (plus @1 @3)))
1090 tem4 = (unsigned long) tem3;
1095 (pointer_plus @0 (convert?@2 (minus@3 (convert @1) (convert @0))))
1096 /* Conditionally look through a sign-changing conversion. */
1097 (if (TYPE_PRECISION (TREE_TYPE (@2)) == TYPE_PRECISION (TREE_TYPE (@3))
1098 && ((GIMPLE && useless_type_conversion_p (type, TREE_TYPE (@1)))
1099 || (GENERIC && type == TREE_TYPE (@1))))
1103 tem = (sizetype) ptr;
1107 and produce the simpler and easier to analyze with respect to alignment
1108 ... = ptr & ~algn; */
1110 (pointer_plus @0 (negate (bit_and (convert @0) INTEGER_CST@1)))
1111 (with { tree algn = wide_int_to_tree (TREE_TYPE (@0), wi::bit_not (@1)); }
1112 (bit_and @0 { algn; })))
1114 /* Try folding difference of addresses. */
1116 (minus (convert ADDR_EXPR@0) (convert @1))
1117 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1118 (with { HOST_WIDE_INT diff; }
1119 (if (ptr_difference_const (@0, @1, &diff))
1120 { build_int_cst_type (type, diff); }))))
1122 (minus (convert @0) (convert ADDR_EXPR@1))
1123 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1124 (with { HOST_WIDE_INT diff; }
1125 (if (ptr_difference_const (@0, @1, &diff))
1126 { build_int_cst_type (type, diff); }))))
1128 /* If arg0 is derived from the address of an object or function, we may
1129 be able to fold this expression using the object or function's
1132 (bit_and (convert? @0) INTEGER_CST@1)
1133 (if (POINTER_TYPE_P (TREE_TYPE (@0))
1134 && tree_nop_conversion_p (type, TREE_TYPE (@0)))
1138 unsigned HOST_WIDE_INT bitpos;
1139 get_pointer_alignment_1 (@0, &align, &bitpos);
1141 (if (wi::ltu_p (@1, align / BITS_PER_UNIT))
1142 { wide_int_to_tree (type, wi::bit_and (@1, bitpos / BITS_PER_UNIT)); }))))
1145 /* We can't reassociate at all for saturating types. */
1146 (if (!TYPE_SATURATING (type))
1148 /* Contract negates. */
1149 /* A + (-B) -> A - B */
1151 (plus:c (convert1? @0) (convert2? (negate @1)))
1152 /* Apply STRIP_NOPS on @0 and the negate. */
1153 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
1154 && tree_nop_conversion_p (type, TREE_TYPE (@1))
1155 && !TYPE_OVERFLOW_SANITIZED (type))
1156 (minus (convert @0) (convert @1))))
1157 /* A - (-B) -> A + B */
1159 (minus (convert1? @0) (convert2? (negate @1)))
1160 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
1161 && tree_nop_conversion_p (type, TREE_TYPE (@1))
1162 && !TYPE_OVERFLOW_SANITIZED (type))
1163 (plus (convert @0) (convert @1))))
1166 (negate (convert? (negate @1)))
1167 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
1168 && !TYPE_OVERFLOW_SANITIZED (type))
1171 /* We can't reassociate floating-point unless -fassociative-math
1172 or fixed-point plus or minus because of saturation to +-Inf. */
1173 (if ((!FLOAT_TYPE_P (type) || flag_associative_math)
1174 && !FIXED_POINT_TYPE_P (type))
1176 /* Match patterns that allow contracting a plus-minus pair
1177 irrespective of overflow issues. */
1178 /* (A +- B) - A -> +- B */
1179 /* (A +- B) -+ B -> A */
1180 /* A - (A +- B) -> -+ B */
1181 /* A +- (B -+ A) -> +- B */
1183 (minus (plus:c @0 @1) @0)
1186 (minus (minus @0 @1) @0)
1189 (plus:c (minus @0 @1) @1)
1192 (minus @0 (plus:c @0 @1))
1195 (minus @0 (minus @0 @1))
1198 /* (A +- CST) +- CST -> A + CST */
1199 (for outer_op (plus minus)
1200 (for inner_op (plus minus)
1202 (outer_op (inner_op @0 CONSTANT_CLASS_P@1) CONSTANT_CLASS_P@2)
1203 /* If the constant operation overflows we cannot do the transform
1204 as we would introduce undefined overflow, for example
1205 with (a - 1) + INT_MIN. */
1206 (with { tree cst = const_binop (outer_op == inner_op
1207 ? PLUS_EXPR : MINUS_EXPR, type, @1, @2); }
1208 (if (cst && !TREE_OVERFLOW (cst))
1209 (inner_op @0 { cst; } ))))))
1211 /* (CST - A) +- CST -> CST - A */
1212 (for outer_op (plus minus)
1214 (outer_op (minus CONSTANT_CLASS_P@1 @0) CONSTANT_CLASS_P@2)
1215 (with { tree cst = const_binop (outer_op, type, @1, @2); }
1216 (if (cst && !TREE_OVERFLOW (cst))
1217 (minus { cst; } @0)))))
1221 (plus:c (bit_not @0) @0)
1222 (if (!TYPE_OVERFLOW_TRAPS (type))
1223 { build_all_ones_cst (type); }))
1227 (plus (convert? (bit_not @0)) integer_each_onep)
1228 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1229 (negate (convert @0))))
1233 (minus (convert? (negate @0)) integer_each_onep)
1234 (if (!TYPE_OVERFLOW_TRAPS (type)
1235 && tree_nop_conversion_p (type, TREE_TYPE (@0)))
1236 (bit_not (convert @0))))
1240 (minus integer_all_onesp @0)
1243 /* (T)(P + A) - (T)P -> (T) A */
1244 (for add (plus pointer_plus)
1246 (minus (convert (add @@0 @1))
1248 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
1249 /* For integer types, if A has a smaller type
1250 than T the result depends on the possible
1252 E.g. T=size_t, A=(unsigned)429497295, P>0.
1253 However, if an overflow in P + A would cause
1254 undefined behavior, we can assume that there
1256 || (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1257 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
1258 /* For pointer types, if the conversion of A to the
1259 final type requires a sign- or zero-extension,
1260 then we have to punt - it is not defined which
1262 || (POINTER_TYPE_P (TREE_TYPE (@0))
1263 && TREE_CODE (@1) == INTEGER_CST
1264 && tree_int_cst_sign_bit (@1) == 0))
1267 /* (T)P - (T)(P + A) -> -(T) A */
1268 (for add (plus pointer_plus)
1271 (convert (add @@0 @1)))
1272 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
1273 /* For integer types, if A has a smaller type
1274 than T the result depends on the possible
1276 E.g. T=size_t, A=(unsigned)429497295, P>0.
1277 However, if an overflow in P + A would cause
1278 undefined behavior, we can assume that there
1280 || (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1281 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
1282 /* For pointer types, if the conversion of A to the
1283 final type requires a sign- or zero-extension,
1284 then we have to punt - it is not defined which
1286 || (POINTER_TYPE_P (TREE_TYPE (@0))
1287 && TREE_CODE (@1) == INTEGER_CST
1288 && tree_int_cst_sign_bit (@1) == 0))
1289 (negate (convert @1)))))
1291 /* (T)(P + A) - (T)(P + B) -> (T)A - (T)B */
1292 (for add (plus pointer_plus)
1294 (minus (convert (add @@0 @1))
1295 (convert (add @0 @2)))
1296 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
1297 /* For integer types, if A has a smaller type
1298 than T the result depends on the possible
1300 E.g. T=size_t, A=(unsigned)429497295, P>0.
1301 However, if an overflow in P + A would cause
1302 undefined behavior, we can assume that there
1304 || (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1305 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
1306 /* For pointer types, if the conversion of A to the
1307 final type requires a sign- or zero-extension,
1308 then we have to punt - it is not defined which
1310 || (POINTER_TYPE_P (TREE_TYPE (@0))
1311 && TREE_CODE (@1) == INTEGER_CST
1312 && tree_int_cst_sign_bit (@1) == 0
1313 && TREE_CODE (@2) == INTEGER_CST
1314 && tree_int_cst_sign_bit (@2) == 0))
1315 (minus (convert @1) (convert @2)))))))
1318 /* Simplifications of MIN_EXPR, MAX_EXPR, fmin() and fmax(). */
1320 (for minmax (min max FMIN FMAX)
1324 /* min(max(x,y),y) -> y. */
1326 (min:c (max:c @0 @1) @1)
1328 /* max(min(x,y),y) -> y. */
1330 (max:c (min:c @0 @1) @1)
1332 /* max(a,-a) -> abs(a). */
1334 (max:c @0 (negate @0))
1335 (if (TREE_CODE (type) != COMPLEX_TYPE
1336 && (! ANY_INTEGRAL_TYPE_P (type)
1337 || TYPE_OVERFLOW_UNDEFINED (type)))
1339 /* min(a,-a) -> -abs(a). */
1341 (min:c @0 (negate @0))
1342 (if (TREE_CODE (type) != COMPLEX_TYPE
1343 && (! ANY_INTEGRAL_TYPE_P (type)
1344 || TYPE_OVERFLOW_UNDEFINED (type)))
1349 (if (INTEGRAL_TYPE_P (type)
1350 && TYPE_MIN_VALUE (type)
1351 && operand_equal_p (@1, TYPE_MIN_VALUE (type), OEP_ONLY_CONST))
1353 (if (INTEGRAL_TYPE_P (type)
1354 && TYPE_MAX_VALUE (type)
1355 && operand_equal_p (@1, TYPE_MAX_VALUE (type), OEP_ONLY_CONST))
1360 (if (INTEGRAL_TYPE_P (type)
1361 && TYPE_MAX_VALUE (type)
1362 && operand_equal_p (@1, TYPE_MAX_VALUE (type), OEP_ONLY_CONST))
1364 (if (INTEGRAL_TYPE_P (type)
1365 && TYPE_MIN_VALUE (type)
1366 && operand_equal_p (@1, TYPE_MIN_VALUE (type), OEP_ONLY_CONST))
1369 /* (convert (minmax ((convert (x) c)))) -> minmax (x c) if x is promoted
1370 and the outer convert demotes the expression back to x's type. */
1371 (for minmax (min max)
1373 (convert (minmax@0 (convert @1) INTEGER_CST@2))
1374 (if (types_match (@1, type) && int_fits_type_p (@2, type)
1375 && TYPE_SIGN (TREE_TYPE (@0)) == TYPE_SIGN (type)
1376 && TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (type))
1377 (minmax @1 (convert @2)))))
1379 (for minmax (FMIN FMAX)
1380 /* If either argument is NaN, return the other one. Avoid the
1381 transformation if we get (and honor) a signalling NaN. */
1383 (minmax:c @0 REAL_CST@1)
1384 (if (real_isnan (TREE_REAL_CST_PTR (@1))
1385 && (!HONOR_SNANS (@1) || !TREE_REAL_CST (@1).signalling))
1387 /* Convert fmin/fmax to MIN_EXPR/MAX_EXPR. C99 requires these
1388 functions to return the numeric arg if the other one is NaN.
1389 MIN and MAX don't honor that, so only transform if -ffinite-math-only
1390 is set. C99 doesn't require -0.0 to be handled, so we don't have to
1391 worry about it either. */
1392 (if (flag_finite_math_only)
1399 /* min (-A, -B) -> -max (A, B) */
1400 (for minmax (min max FMIN FMAX)
1401 maxmin (max min FMAX FMIN)
1403 (minmax (negate:s@2 @0) (negate:s@3 @1))
1404 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
1405 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1406 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))))
1407 (negate (maxmin @0 @1)))))
1408 /* MIN (~X, ~Y) -> ~MAX (X, Y)
1409 MAX (~X, ~Y) -> ~MIN (X, Y) */
1410 (for minmax (min max)
1413 (minmax (bit_not:s@2 @0) (bit_not:s@3 @1))
1414 (bit_not (maxmin @0 @1))))
1416 /* MIN (X, Y) == X -> X <= Y */
1417 (for minmax (min min max max)
1421 (cmp:c (minmax:c @0 @1) @0)
1422 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0)))
1424 /* MIN (X, 5) == 0 -> X == 0
1425 MIN (X, 5) == 7 -> false */
1428 (cmp (min @0 INTEGER_CST@1) INTEGER_CST@2)
1429 (if (wi::lt_p (@1, @2, TYPE_SIGN (TREE_TYPE (@0))))
1430 { constant_boolean_node (cmp == NE_EXPR, type); }
1431 (if (wi::gt_p (@1, @2, TYPE_SIGN (TREE_TYPE (@0))))
1435 (cmp (max @0 INTEGER_CST@1) INTEGER_CST@2)
1436 (if (wi::gt_p (@1, @2, TYPE_SIGN (TREE_TYPE (@0))))
1437 { constant_boolean_node (cmp == NE_EXPR, type); }
1438 (if (wi::lt_p (@1, @2, TYPE_SIGN (TREE_TYPE (@0))))
1440 /* MIN (X, C1) < C2 -> X < C2 || C1 < C2 */
1441 (for minmax (min min max max min min max max )
1442 cmp (lt le gt ge gt ge lt le )
1443 comb (bit_ior bit_ior bit_ior bit_ior bit_and bit_and bit_and bit_and)
1445 (cmp (minmax @0 INTEGER_CST@1) INTEGER_CST@2)
1446 (comb (cmp @0 @2) (cmp @1 @2))))
1448 /* Simplifications of shift and rotates. */
1450 (for rotate (lrotate rrotate)
1452 (rotate integer_all_onesp@0 @1)
1455 /* Optimize -1 >> x for arithmetic right shifts. */
1457 (rshift integer_all_onesp@0 @1)
1458 (if (!TYPE_UNSIGNED (type)
1459 && tree_expr_nonnegative_p (@1))
1462 /* Optimize (x >> c) << c into x & (-1<<c). */
1464 (lshift (rshift @0 INTEGER_CST@1) @1)
1465 (if (wi::ltu_p (@1, element_precision (type)))
1466 (bit_and @0 (lshift { build_minus_one_cst (type); } @1))))
1468 /* Optimize (x << c) >> c into x & ((unsigned)-1 >> c) for unsigned
1471 (rshift (lshift @0 INTEGER_CST@1) @1)
1472 (if (TYPE_UNSIGNED (type)
1473 && (wi::ltu_p (@1, element_precision (type))))
1474 (bit_and @0 (rshift { build_minus_one_cst (type); } @1))))
1476 (for shiftrotate (lrotate rrotate lshift rshift)
1478 (shiftrotate @0 integer_zerop)
1481 (shiftrotate integer_zerop@0 @1)
1483 /* Prefer vector1 << scalar to vector1 << vector2
1484 if vector2 is uniform. */
1485 (for vec (VECTOR_CST CONSTRUCTOR)
1487 (shiftrotate @0 vec@1)
1488 (with { tree tem = uniform_vector_p (@1); }
1490 (shiftrotate @0 { tem; }))))))
1492 /* Rewrite an LROTATE_EXPR by a constant into an
1493 RROTATE_EXPR by a new constant. */
1495 (lrotate @0 INTEGER_CST@1)
1496 (rrotate @0 { const_binop (MINUS_EXPR, TREE_TYPE (@1),
1497 build_int_cst (TREE_TYPE (@1),
1498 element_precision (type)), @1); }))
1500 /* Turn (a OP c1) OP c2 into a OP (c1+c2). */
1501 (for op (lrotate rrotate rshift lshift)
1503 (op (op @0 INTEGER_CST@1) INTEGER_CST@2)
1504 (with { unsigned int prec = element_precision (type); }
1505 (if (wi::ge_p (@1, 0, TYPE_SIGN (TREE_TYPE (@1)))
1506 && wi::lt_p (@1, prec, TYPE_SIGN (TREE_TYPE (@1)))
1507 && wi::ge_p (@2, 0, TYPE_SIGN (TREE_TYPE (@2)))
1508 && wi::lt_p (@2, prec, TYPE_SIGN (TREE_TYPE (@2))))
1509 (with { unsigned int low = wi::add (@1, @2).to_uhwi (); }
1510 /* Deal with a OP (c1 + c2) being undefined but (a OP c1) OP c2
1511 being well defined. */
1513 (if (op == LROTATE_EXPR || op == RROTATE_EXPR)
1514 (op @0 { build_int_cst (TREE_TYPE (@1), low % prec); })
1515 (if (TYPE_UNSIGNED (type) || op == LSHIFT_EXPR)
1516 { build_zero_cst (type); }
1517 (op @0 { build_int_cst (TREE_TYPE (@1), prec - 1); })))
1518 (op @0 { build_int_cst (TREE_TYPE (@1), low); })))))))
1521 /* ((1 << A) & 1) != 0 -> A == 0
1522 ((1 << A) & 1) == 0 -> A != 0 */
1526 (cmp (bit_and (lshift integer_onep @0) integer_onep) integer_zerop)
1527 (icmp @0 { build_zero_cst (TREE_TYPE (@0)); })))
1529 /* (CST1 << A) == CST2 -> A == ctz (CST2) - ctz (CST1)
1530 (CST1 << A) != CST2 -> A != ctz (CST2) - ctz (CST1)
1534 (cmp (lshift INTEGER_CST@0 @1) INTEGER_CST@2)
1535 (with { int cand = wi::ctz (@2) - wi::ctz (@0); }
1537 || (!integer_zerop (@2)
1538 && wi::ne_p (wi::lshift (@0, cand), @2)))
1539 { constant_boolean_node (cmp == NE_EXPR, type); }
1540 (if (!integer_zerop (@2)
1541 && wi::eq_p (wi::lshift (@0, cand), @2))
1542 (cmp @1 { build_int_cst (TREE_TYPE (@1), cand); }))))))
1544 /* Fold (X << C1) & C2 into (X << C1) & (C2 | ((1 << C1) - 1))
1545 (X >> C1) & C2 into (X >> C1) & (C2 | ~((type) -1 >> C1))
1546 if the new mask might be further optimized. */
1547 (for shift (lshift rshift)
1549 (bit_and (convert?:s@4 (shift:s@5 (convert1?@3 @0) INTEGER_CST@1))
1551 (if (tree_nop_conversion_p (TREE_TYPE (@4), TREE_TYPE (@5))
1552 && TYPE_PRECISION (type) <= HOST_BITS_PER_WIDE_INT
1553 && tree_fits_uhwi_p (@1)
1554 && tree_to_uhwi (@1) > 0
1555 && tree_to_uhwi (@1) < TYPE_PRECISION (type))
1558 unsigned int shiftc = tree_to_uhwi (@1);
1559 unsigned HOST_WIDE_INT mask = TREE_INT_CST_LOW (@2);
1560 unsigned HOST_WIDE_INT newmask, zerobits = 0;
1561 tree shift_type = TREE_TYPE (@3);
1564 if (shift == LSHIFT_EXPR)
1565 zerobits = ((HOST_WIDE_INT_1U << shiftc) - 1);
1566 else if (shift == RSHIFT_EXPR
1567 && (TYPE_PRECISION (shift_type)
1568 == GET_MODE_PRECISION (TYPE_MODE (shift_type))))
1570 prec = TYPE_PRECISION (TREE_TYPE (@3));
1572 /* See if more bits can be proven as zero because of
1575 && TYPE_UNSIGNED (TREE_TYPE (@0)))
1577 tree inner_type = TREE_TYPE (@0);
1578 if ((TYPE_PRECISION (inner_type)
1579 == GET_MODE_PRECISION (TYPE_MODE (inner_type)))
1580 && TYPE_PRECISION (inner_type) < prec)
1582 prec = TYPE_PRECISION (inner_type);
1583 /* See if we can shorten the right shift. */
1585 shift_type = inner_type;
1586 /* Otherwise X >> C1 is all zeros, so we'll optimize
1587 it into (X, 0) later on by making sure zerobits
1591 zerobits = HOST_WIDE_INT_M1U;
1594 zerobits >>= HOST_BITS_PER_WIDE_INT - shiftc;
1595 zerobits <<= prec - shiftc;
1597 /* For arithmetic shift if sign bit could be set, zerobits
1598 can contain actually sign bits, so no transformation is
1599 possible, unless MASK masks them all away. In that
1600 case the shift needs to be converted into logical shift. */
1601 if (!TYPE_UNSIGNED (TREE_TYPE (@3))
1602 && prec == TYPE_PRECISION (TREE_TYPE (@3)))
1604 if ((mask & zerobits) == 0)
1605 shift_type = unsigned_type_for (TREE_TYPE (@3));
1611 /* ((X << 16) & 0xff00) is (X, 0). */
1612 (if ((mask & zerobits) == mask)
1613 { build_int_cst (type, 0); }
1614 (with { newmask = mask | zerobits; }
1615 (if (newmask != mask && (newmask & (newmask + 1)) == 0)
1618 /* Only do the transformation if NEWMASK is some integer
1620 for (prec = BITS_PER_UNIT;
1621 prec < HOST_BITS_PER_WIDE_INT; prec <<= 1)
1622 if (newmask == (HOST_WIDE_INT_1U << prec) - 1)
1625 (if (prec < HOST_BITS_PER_WIDE_INT
1626 || newmask == HOST_WIDE_INT_M1U)
1628 { tree newmaskt = build_int_cst_type (TREE_TYPE (@2), newmask); }
1629 (if (!tree_int_cst_equal (newmaskt, @2))
1630 (if (shift_type != TREE_TYPE (@3))
1631 (bit_and (convert (shift:shift_type (convert @3) @1)) { newmaskt; })
1632 (bit_and @4 { newmaskt; })))))))))))))
1634 /* Fold (X {&,^,|} C2) << C1 into (X << C1) {&,^,|} (C2 << C1)
1635 (X {&,^,|} C2) >> C1 into (X >> C1) & (C2 >> C1). */
1636 (for shift (lshift rshift)
1637 (for bit_op (bit_and bit_xor bit_ior)
1639 (shift (convert?:s (bit_op:s @0 INTEGER_CST@2)) INTEGER_CST@1)
1640 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1641 (with { tree mask = int_const_binop (shift, fold_convert (type, @2), @1); }
1642 (bit_op (shift (convert @0) @1) { mask; }))))))
1644 /* ~(~X >> Y) -> X >> Y (for arithmetic shift). */
1646 (bit_not (convert1?:s (rshift:s (convert2?@0 (bit_not @1)) @2)))
1647 (if (!TYPE_UNSIGNED (TREE_TYPE (@0))
1648 && (element_precision (TREE_TYPE (@0))
1649 <= element_precision (TREE_TYPE (@1))
1650 || !TYPE_UNSIGNED (TREE_TYPE (@1))))
1652 { tree shift_type = TREE_TYPE (@0); }
1653 (convert (rshift (convert:shift_type @1) @2)))))
1655 /* ~(~X >>r Y) -> X >>r Y
1656 ~(~X <<r Y) -> X <<r Y */
1657 (for rotate (lrotate rrotate)
1659 (bit_not (convert1?:s (rotate:s (convert2?@0 (bit_not @1)) @2)))
1660 (if ((element_precision (TREE_TYPE (@0))
1661 <= element_precision (TREE_TYPE (@1))
1662 || !TYPE_UNSIGNED (TREE_TYPE (@1)))
1663 && (element_precision (type) <= element_precision (TREE_TYPE (@0))
1664 || !TYPE_UNSIGNED (TREE_TYPE (@0))))
1666 { tree rotate_type = TREE_TYPE (@0); }
1667 (convert (rotate (convert:rotate_type @1) @2))))))
1669 /* Simplifications of conversions. */
1671 /* Basic strip-useless-type-conversions / strip_nops. */
1672 (for cvt (convert view_convert float fix_trunc)
1675 (if ((GIMPLE && useless_type_conversion_p (type, TREE_TYPE (@0)))
1676 || (GENERIC && type == TREE_TYPE (@0)))
1679 /* Contract view-conversions. */
1681 (view_convert (view_convert @0))
1684 /* For integral conversions with the same precision or pointer
1685 conversions use a NOP_EXPR instead. */
1688 (if ((INTEGRAL_TYPE_P (type) || POINTER_TYPE_P (type))
1689 && (INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))
1690 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (@0)))
1693 /* Strip inner integral conversions that do not change precision or size. */
1695 (view_convert (convert@0 @1))
1696 (if ((INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))
1697 && (INTEGRAL_TYPE_P (TREE_TYPE (@1)) || POINTER_TYPE_P (TREE_TYPE (@1)))
1698 && (TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1)))
1699 && (TYPE_SIZE (TREE_TYPE (@0)) == TYPE_SIZE (TREE_TYPE (@1))))
1702 /* Re-association barriers around constants and other re-association
1703 barriers can be removed. */
1705 (paren CONSTANT_CLASS_P@0)
1708 (paren (paren@1 @0))
1711 /* Handle cases of two conversions in a row. */
1712 (for ocvt (convert float fix_trunc)
1713 (for icvt (convert float)
1718 tree inside_type = TREE_TYPE (@0);
1719 tree inter_type = TREE_TYPE (@1);
1720 int inside_int = INTEGRAL_TYPE_P (inside_type);
1721 int inside_ptr = POINTER_TYPE_P (inside_type);
1722 int inside_float = FLOAT_TYPE_P (inside_type);
1723 int inside_vec = VECTOR_TYPE_P (inside_type);
1724 unsigned int inside_prec = TYPE_PRECISION (inside_type);
1725 int inside_unsignedp = TYPE_UNSIGNED (inside_type);
1726 int inter_int = INTEGRAL_TYPE_P (inter_type);
1727 int inter_ptr = POINTER_TYPE_P (inter_type);
1728 int inter_float = FLOAT_TYPE_P (inter_type);
1729 int inter_vec = VECTOR_TYPE_P (inter_type);
1730 unsigned int inter_prec = TYPE_PRECISION (inter_type);
1731 int inter_unsignedp = TYPE_UNSIGNED (inter_type);
1732 int final_int = INTEGRAL_TYPE_P (type);
1733 int final_ptr = POINTER_TYPE_P (type);
1734 int final_float = FLOAT_TYPE_P (type);
1735 int final_vec = VECTOR_TYPE_P (type);
1736 unsigned int final_prec = TYPE_PRECISION (type);
1737 int final_unsignedp = TYPE_UNSIGNED (type);
1740 /* In addition to the cases of two conversions in a row
1741 handled below, if we are converting something to its own
1742 type via an object of identical or wider precision, neither
1743 conversion is needed. */
1744 (if (((GIMPLE && useless_type_conversion_p (type, inside_type))
1746 && TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (inside_type)))
1747 && (((inter_int || inter_ptr) && final_int)
1748 || (inter_float && final_float))
1749 && inter_prec >= final_prec)
1752 /* Likewise, if the intermediate and initial types are either both
1753 float or both integer, we don't need the middle conversion if the
1754 former is wider than the latter and doesn't change the signedness
1755 (for integers). Avoid this if the final type is a pointer since
1756 then we sometimes need the middle conversion. */
1757 (if (((inter_int && inside_int) || (inter_float && inside_float))
1758 && (final_int || final_float)
1759 && inter_prec >= inside_prec
1760 && (inter_float || inter_unsignedp == inside_unsignedp))
1763 /* If we have a sign-extension of a zero-extended value, we can
1764 replace that by a single zero-extension. Likewise if the
1765 final conversion does not change precision we can drop the
1766 intermediate conversion. */
1767 (if (inside_int && inter_int && final_int
1768 && ((inside_prec < inter_prec && inter_prec < final_prec
1769 && inside_unsignedp && !inter_unsignedp)
1770 || final_prec == inter_prec))
1773 /* Two conversions in a row are not needed unless:
1774 - some conversion is floating-point (overstrict for now), or
1775 - some conversion is a vector (overstrict for now), or
1776 - the intermediate type is narrower than both initial and
1778 - the intermediate type and innermost type differ in signedness,
1779 and the outermost type is wider than the intermediate, or
1780 - the initial type is a pointer type and the precisions of the
1781 intermediate and final types differ, or
1782 - the final type is a pointer type and the precisions of the
1783 initial and intermediate types differ. */
1784 (if (! inside_float && ! inter_float && ! final_float
1785 && ! inside_vec && ! inter_vec && ! final_vec
1786 && (inter_prec >= inside_prec || inter_prec >= final_prec)
1787 && ! (inside_int && inter_int
1788 && inter_unsignedp != inside_unsignedp
1789 && inter_prec < final_prec)
1790 && ((inter_unsignedp && inter_prec > inside_prec)
1791 == (final_unsignedp && final_prec > inter_prec))
1792 && ! (inside_ptr && inter_prec != final_prec)
1793 && ! (final_ptr && inside_prec != inter_prec))
1796 /* A truncation to an unsigned type (a zero-extension) should be
1797 canonicalized as bitwise and of a mask. */
1798 (if (GIMPLE /* PR70366: doing this in GENERIC breaks -Wconversion. */
1799 && final_int && inter_int && inside_int
1800 && final_prec == inside_prec
1801 && final_prec > inter_prec
1803 (convert (bit_and @0 { wide_int_to_tree
1805 wi::mask (inter_prec, false,
1806 TYPE_PRECISION (inside_type))); })))
1808 /* If we are converting an integer to a floating-point that can
1809 represent it exactly and back to an integer, we can skip the
1810 floating-point conversion. */
1811 (if (GIMPLE /* PR66211 */
1812 && inside_int && inter_float && final_int &&
1813 (unsigned) significand_size (TYPE_MODE (inter_type))
1814 >= inside_prec - !inside_unsignedp)
1817 /* If we have a narrowing conversion to an integral type that is fed by a
1818 BIT_AND_EXPR, we might be able to remove the BIT_AND_EXPR if it merely
1819 masks off bits outside the final type (and nothing else). */
1821 (convert (bit_and @0 INTEGER_CST@1))
1822 (if (INTEGRAL_TYPE_P (type)
1823 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
1824 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))
1825 && operand_equal_p (@1, build_low_bits_mask (TREE_TYPE (@1),
1826 TYPE_PRECISION (type)), 0))
1830 /* (X /[ex] A) * A -> X. */
1832 (mult (convert1? (exact_div @0 @@1)) (convert2? @1))
1835 /* Canonicalization of binary operations. */
1837 /* Convert X + -C into X - C. */
1839 (plus @0 REAL_CST@1)
1840 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
1841 (with { tree tem = const_unop (NEGATE_EXPR, type, @1); }
1842 (if (!TREE_OVERFLOW (tem) || !flag_trapping_math)
1843 (minus @0 { tem; })))))
1845 /* Convert x+x into x*2. */
1848 (if (SCALAR_FLOAT_TYPE_P (type))
1849 (mult @0 { build_real (type, dconst2); })
1850 (if (INTEGRAL_TYPE_P (type))
1851 (mult @0 { build_int_cst (type, 2); }))))
1854 (minus integer_zerop @1)
1857 /* (ARG0 - ARG1) is the same as (-ARG1 + ARG0). So check whether
1858 ARG0 is zero and X + ARG0 reduces to X, since that would mean
1859 (-ARG1 + ARG0) reduces to -ARG1. */
1861 (minus real_zerop@0 @1)
1862 (if (fold_real_zero_addition_p (type, @0, 0))
1865 /* Transform x * -1 into -x. */
1867 (mult @0 integer_minus_onep)
1870 /* True if we can easily extract the real and imaginary parts of a complex
1872 (match compositional_complex
1873 (convert? (complex @0 @1)))
1875 /* COMPLEX_EXPR and REALPART/IMAGPART_EXPR cancellations. */
1877 (complex (realpart @0) (imagpart @0))
1880 (realpart (complex @0 @1))
1883 (imagpart (complex @0 @1))
1886 /* Sometimes we only care about half of a complex expression. */
1888 (realpart (convert?:s (conj:s @0)))
1889 (convert (realpart @0)))
1891 (imagpart (convert?:s (conj:s @0)))
1892 (convert (negate (imagpart @0))))
1893 (for part (realpart imagpart)
1894 (for op (plus minus)
1896 (part (convert?:s@2 (op:s @0 @1)))
1897 (convert (op (part @0) (part @1))))))
1899 (realpart (convert?:s (CEXPI:s @0)))
1902 (imagpart (convert?:s (CEXPI:s @0)))
1905 /* conj(conj(x)) -> x */
1907 (conj (convert? (conj @0)))
1908 (if (tree_nop_conversion_p (TREE_TYPE (@0), type))
1911 /* conj({x,y}) -> {x,-y} */
1913 (conj (convert?:s (complex:s @0 @1)))
1914 (with { tree itype = TREE_TYPE (type); }
1915 (complex (convert:itype @0) (negate (convert:itype @1)))))
1917 /* BSWAP simplifications, transforms checked by gcc.dg/builtin-bswap-8.c. */
1918 (for bswap (BUILT_IN_BSWAP16 BUILT_IN_BSWAP32 BUILT_IN_BSWAP64)
1923 (bswap (bit_not (bswap @0)))
1925 (for bitop (bit_xor bit_ior bit_and)
1927 (bswap (bitop:c (bswap @0) @1))
1928 (bitop @0 (bswap @1)))))
1931 /* Combine COND_EXPRs and VEC_COND_EXPRs. */
1933 /* Simplify constant conditions.
1934 Only optimize constant conditions when the selected branch
1935 has the same type as the COND_EXPR. This avoids optimizing
1936 away "c ? x : throw", where the throw has a void type.
1937 Note that we cannot throw away the fold-const.c variant nor
1938 this one as we depend on doing this transform before possibly
1939 A ? B : B -> B triggers and the fold-const.c one can optimize
1940 0 ? A : B to B even if A has side-effects. Something
1941 genmatch cannot handle. */
1943 (cond INTEGER_CST@0 @1 @2)
1944 (if (integer_zerop (@0))
1945 (if (!VOID_TYPE_P (TREE_TYPE (@2)) || VOID_TYPE_P (type))
1947 (if (!VOID_TYPE_P (TREE_TYPE (@1)) || VOID_TYPE_P (type))
1950 (vec_cond VECTOR_CST@0 @1 @2)
1951 (if (integer_all_onesp (@0))
1953 (if (integer_zerop (@0))
1956 (for cnd (cond vec_cond)
1957 /* A ? B : (A ? X : C) -> A ? B : C. */
1959 (cnd @0 (cnd @0 @1 @2) @3)
1962 (cnd @0 @1 (cnd @0 @2 @3))
1964 /* A ? B : (!A ? C : X) -> A ? B : C. */
1965 /* ??? This matches embedded conditions open-coded because genmatch
1966 would generate matching code for conditions in separate stmts only.
1967 The following is still important to merge then and else arm cases
1968 from if-conversion. */
1970 (cnd @0 @1 (cnd @2 @3 @4))
1971 (if (COMPARISON_CLASS_P (@0)
1972 && COMPARISON_CLASS_P (@2)
1973 && invert_tree_comparison
1974 (TREE_CODE (@0), HONOR_NANS (TREE_OPERAND (@0, 0))) == TREE_CODE (@2)
1975 && operand_equal_p (TREE_OPERAND (@0, 0), TREE_OPERAND (@2, 0), 0)
1976 && operand_equal_p (TREE_OPERAND (@0, 1), TREE_OPERAND (@2, 1), 0))
1979 (cnd @0 (cnd @1 @2 @3) @4)
1980 (if (COMPARISON_CLASS_P (@0)
1981 && COMPARISON_CLASS_P (@1)
1982 && invert_tree_comparison
1983 (TREE_CODE (@0), HONOR_NANS (TREE_OPERAND (@0, 0))) == TREE_CODE (@1)
1984 && operand_equal_p (TREE_OPERAND (@0, 0), TREE_OPERAND (@1, 0), 0)
1985 && operand_equal_p (TREE_OPERAND (@0, 1), TREE_OPERAND (@1, 1), 0))
1988 /* A ? B : B -> B. */
1993 /* !A ? B : C -> A ? C : B. */
1995 (cnd (logical_inverted_value truth_valued_p@0) @1 @2)
1998 /* A + (B vcmp C ? 1 : 0) -> A - (B vcmp C ? -1 : 0), since vector comparisons
1999 return all -1 or all 0 results. */
2000 /* ??? We could instead convert all instances of the vec_cond to negate,
2001 but that isn't necessarily a win on its own. */
2003 (plus:c @3 (view_convert? (vec_cond:s @0 integer_each_onep@1 integer_zerop@2)))
2004 (if (VECTOR_TYPE_P (type)
2005 && TYPE_VECTOR_SUBPARTS (type) == TYPE_VECTOR_SUBPARTS (TREE_TYPE (@1))
2006 && (TYPE_MODE (TREE_TYPE (type))
2007 == TYPE_MODE (TREE_TYPE (TREE_TYPE (@1)))))
2008 (minus @3 (view_convert (vec_cond @0 (negate @1) @2)))))
2010 /* ... likewise A - (B vcmp C ? 1 : 0) -> A + (B vcmp C ? -1 : 0). */
2012 (minus @3 (view_convert? (vec_cond:s @0 integer_each_onep@1 integer_zerop@2)))
2013 (if (VECTOR_TYPE_P (type)
2014 && TYPE_VECTOR_SUBPARTS (type) == TYPE_VECTOR_SUBPARTS (TREE_TYPE (@1))
2015 && (TYPE_MODE (TREE_TYPE (type))
2016 == TYPE_MODE (TREE_TYPE (TREE_TYPE (@1)))))
2017 (plus @3 (view_convert (vec_cond @0 (negate @1) @2)))))
2020 /* Simplifications of comparisons. */
2022 /* See if we can reduce the magnitude of a constant involved in a
2023 comparison by changing the comparison code. This is a canonicalization
2024 formerly done by maybe_canonicalize_comparison_1. */
2028 (cmp @0 INTEGER_CST@1)
2029 (if (tree_int_cst_sgn (@1) == -1)
2030 (acmp @0 { wide_int_to_tree (TREE_TYPE (@1), wi::add (@1, 1)); }))))
2034 (cmp @0 INTEGER_CST@1)
2035 (if (tree_int_cst_sgn (@1) == 1)
2036 (acmp @0 { wide_int_to_tree (TREE_TYPE (@1), wi::sub (@1, 1)); }))))
2039 /* We can simplify a logical negation of a comparison to the
2040 inverted comparison. As we cannot compute an expression
2041 operator using invert_tree_comparison we have to simulate
2042 that with expression code iteration. */
2043 (for cmp (tcc_comparison)
2044 icmp (inverted_tcc_comparison)
2045 ncmp (inverted_tcc_comparison_with_nans)
2046 /* Ideally we'd like to combine the following two patterns
2047 and handle some more cases by using
2048 (logical_inverted_value (cmp @0 @1))
2049 here but for that genmatch would need to "inline" that.
2050 For now implement what forward_propagate_comparison did. */
2052 (bit_not (cmp @0 @1))
2053 (if (VECTOR_TYPE_P (type)
2054 || (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) == 1))
2055 /* Comparison inversion may be impossible for trapping math,
2056 invert_tree_comparison will tell us. But we can't use
2057 a computed operator in the replacement tree thus we have
2058 to play the trick below. */
2059 (with { enum tree_code ic = invert_tree_comparison
2060 (cmp, HONOR_NANS (@0)); }
2066 (bit_xor (cmp @0 @1) integer_truep)
2067 (with { enum tree_code ic = invert_tree_comparison
2068 (cmp, HONOR_NANS (@0)); }
2074 /* Transform comparisons of the form X - Y CMP 0 to X CMP Y.
2075 ??? The transformation is valid for the other operators if overflow
2076 is undefined for the type, but performing it here badly interacts
2077 with the transformation in fold_cond_expr_with_comparison which
2078 attempts to synthetize ABS_EXPR. */
2081 (cmp (minus@2 @0 @1) integer_zerop)
2082 (if (single_use (@2))
2085 /* Transform comparisons of the form X * C1 CMP 0 to X CMP 0 in the
2086 signed arithmetic case. That form is created by the compiler
2087 often enough for folding it to be of value. One example is in
2088 computing loop trip counts after Operator Strength Reduction. */
2089 (for cmp (simple_comparison)
2090 scmp (swapped_simple_comparison)
2092 (cmp (mult@3 @0 INTEGER_CST@1) integer_zerop@2)
2093 /* Handle unfolded multiplication by zero. */
2094 (if (integer_zerop (@1))
2096 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2097 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2099 /* If @1 is negative we swap the sense of the comparison. */
2100 (if (tree_int_cst_sgn (@1) < 0)
2104 /* Simplify comparison of something with itself. For IEEE
2105 floating-point, we can only do some of these simplifications. */
2109 (if (! FLOAT_TYPE_P (TREE_TYPE (@0))
2110 || ! HONOR_NANS (@0))
2111 { constant_boolean_node (true, type); }
2112 (if (cmp != EQ_EXPR)
2118 || ! FLOAT_TYPE_P (TREE_TYPE (@0))
2119 || ! HONOR_NANS (@0))
2120 { constant_boolean_node (false, type); })))
2121 (for cmp (unle unge uneq)
2124 { constant_boolean_node (true, type); }))
2125 (for cmp (unlt ungt)
2131 (if (!flag_trapping_math)
2132 { constant_boolean_node (false, type); }))
2134 /* Fold ~X op ~Y as Y op X. */
2135 (for cmp (simple_comparison)
2137 (cmp (bit_not@2 @0) (bit_not@3 @1))
2138 (if (single_use (@2) && single_use (@3))
2141 /* Fold ~X op C as X op' ~C, where op' is the swapped comparison. */
2142 (for cmp (simple_comparison)
2143 scmp (swapped_simple_comparison)
2145 (cmp (bit_not@2 @0) CONSTANT_CLASS_P@1)
2146 (if (single_use (@2)
2147 && (TREE_CODE (@1) == INTEGER_CST || TREE_CODE (@1) == VECTOR_CST))
2148 (scmp @0 (bit_not @1)))))
2150 (for cmp (simple_comparison)
2151 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
2153 (cmp (convert@2 @0) (convert? @1))
2154 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
2155 && (DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@2))
2156 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0)))
2157 && (DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@2))
2158 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@1))))
2161 tree type1 = TREE_TYPE (@1);
2162 if (TREE_CODE (@1) == REAL_CST && !DECIMAL_FLOAT_TYPE_P (type1))
2164 REAL_VALUE_TYPE orig = TREE_REAL_CST (@1);
2165 if (TYPE_PRECISION (type1) > TYPE_PRECISION (float_type_node)
2166 && exact_real_truncate (TYPE_MODE (float_type_node), &orig))
2167 type1 = float_type_node;
2168 if (TYPE_PRECISION (type1) > TYPE_PRECISION (double_type_node)
2169 && exact_real_truncate (TYPE_MODE (double_type_node), &orig))
2170 type1 = double_type_node;
2173 = (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (type1)
2174 ? TREE_TYPE (@0) : type1);
2176 (if (TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (newtype))
2177 (cmp (convert:newtype @0) (convert:newtype @1))))))
2181 /* IEEE doesn't distinguish +0 and -0 in comparisons. */
2183 /* a CMP (-0) -> a CMP 0 */
2184 (if (REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@1)))
2185 (cmp @0 { build_real (TREE_TYPE (@1), dconst0); }))
2186 /* x != NaN is always true, other ops are always false. */
2187 (if (REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
2188 && ! HONOR_SNANS (@1))
2189 { constant_boolean_node (cmp == NE_EXPR, type); })
2190 /* Fold comparisons against infinity. */
2191 (if (REAL_VALUE_ISINF (TREE_REAL_CST (@1))
2192 && MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (@1))))
2195 REAL_VALUE_TYPE max;
2196 enum tree_code code = cmp;
2197 bool neg = REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1));
2199 code = swap_tree_comparison (code);
2202 /* x > +Inf is always false, if with ignore sNANs. */
2203 (if (code == GT_EXPR
2204 && ! HONOR_SNANS (@0))
2205 { constant_boolean_node (false, type); })
2206 (if (code == LE_EXPR)
2207 /* x <= +Inf is always true, if we don't case about NaNs. */
2208 (if (! HONOR_NANS (@0))
2209 { constant_boolean_node (true, type); }
2210 /* x <= +Inf is the same as x == x, i.e. !isnan(x). */
2212 /* x == +Inf and x >= +Inf are always equal to x > DBL_MAX. */
2213 (if (code == EQ_EXPR || code == GE_EXPR)
2214 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
2216 (lt @0 { build_real (TREE_TYPE (@0), max); })
2217 (gt @0 { build_real (TREE_TYPE (@0), max); }))))
2218 /* x < +Inf is always equal to x <= DBL_MAX. */
2219 (if (code == LT_EXPR)
2220 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
2222 (ge @0 { build_real (TREE_TYPE (@0), max); })
2223 (le @0 { build_real (TREE_TYPE (@0), max); }))))
2224 /* x != +Inf is always equal to !(x > DBL_MAX). */
2225 (if (code == NE_EXPR)
2226 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
2227 (if (! HONOR_NANS (@0))
2229 (ge @0 { build_real (TREE_TYPE (@0), max); })
2230 (le @0 { build_real (TREE_TYPE (@0), max); }))
2232 (bit_xor (lt @0 { build_real (TREE_TYPE (@0), max); })
2233 { build_one_cst (type); })
2234 (bit_xor (gt @0 { build_real (TREE_TYPE (@0), max); })
2235 { build_one_cst (type); }))))))))))
2237 /* If this is a comparison of a real constant with a PLUS_EXPR
2238 or a MINUS_EXPR of a real constant, we can convert it into a
2239 comparison with a revised real constant as long as no overflow
2240 occurs when unsafe_math_optimizations are enabled. */
2241 (if (flag_unsafe_math_optimizations)
2242 (for op (plus minus)
2244 (cmp (op @0 REAL_CST@1) REAL_CST@2)
2247 tree tem = const_binop (op == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR,
2248 TREE_TYPE (@1), @2, @1);
2250 (if (tem && !TREE_OVERFLOW (tem))
2251 (cmp @0 { tem; }))))))
2253 /* Likewise, we can simplify a comparison of a real constant with
2254 a MINUS_EXPR whose first operand is also a real constant, i.e.
2255 (c1 - x) < c2 becomes x > c1-c2. Reordering is allowed on
2256 floating-point types only if -fassociative-math is set. */
2257 (if (flag_associative_math)
2259 (cmp (minus REAL_CST@0 @1) REAL_CST@2)
2260 (with { tree tem = const_binop (MINUS_EXPR, TREE_TYPE (@1), @0, @2); }
2261 (if (tem && !TREE_OVERFLOW (tem))
2262 (cmp { tem; } @1)))))
2264 /* Fold comparisons against built-in math functions. */
2265 (if (flag_unsafe_math_optimizations
2266 && ! flag_errno_math)
2269 (cmp (sq @0) REAL_CST@1)
2271 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
2273 /* sqrt(x) < y is always false, if y is negative. */
2274 (if (cmp == EQ_EXPR || cmp == LT_EXPR || cmp == LE_EXPR)
2275 { constant_boolean_node (false, type); })
2276 /* sqrt(x) > y is always true, if y is negative and we
2277 don't care about NaNs, i.e. negative values of x. */
2278 (if (cmp == NE_EXPR || !HONOR_NANS (@0))
2279 { constant_boolean_node (true, type); })
2280 /* sqrt(x) > y is the same as x >= 0, if y is negative. */
2281 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })))
2282 (if (real_equal (TREE_REAL_CST_PTR (@1), &dconst0))
2284 /* sqrt(x) < 0 is always false. */
2285 (if (cmp == LT_EXPR)
2286 { constant_boolean_node (false, type); })
2287 /* sqrt(x) >= 0 is always true if we don't care about NaNs. */
2288 (if (cmp == GE_EXPR && !HONOR_NANS (@0))
2289 { constant_boolean_node (true, type); })
2290 /* sqrt(x) <= 0 -> x == 0. */
2291 (if (cmp == LE_EXPR)
2293 /* Otherwise sqrt(x) cmp 0 -> x cmp 0. Here cmp can be >=, >,
2294 == or !=. In the last case:
2296 (sqrt(x) != 0) == (NaN != 0) == true == (x != 0)
2298 if x is negative or NaN. Due to -funsafe-math-optimizations,
2299 the results for other x follow from natural arithmetic. */
2301 (if (cmp == GT_EXPR || cmp == GE_EXPR)
2305 real_arithmetic (&c2, MULT_EXPR,
2306 &TREE_REAL_CST (@1), &TREE_REAL_CST (@1));
2307 real_convert (&c2, TYPE_MODE (TREE_TYPE (@0)), &c2);
2309 (if (REAL_VALUE_ISINF (c2))
2310 /* sqrt(x) > y is x == +Inf, when y is very large. */
2311 (if (HONOR_INFINITIES (@0))
2312 (eq @0 { build_real (TREE_TYPE (@0), c2); })
2313 { constant_boolean_node (false, type); })
2314 /* sqrt(x) > c is the same as x > c*c. */
2315 (cmp @0 { build_real (TREE_TYPE (@0), c2); }))))
2316 (if (cmp == LT_EXPR || cmp == LE_EXPR)
2320 real_arithmetic (&c2, MULT_EXPR,
2321 &TREE_REAL_CST (@1), &TREE_REAL_CST (@1));
2322 real_convert (&c2, TYPE_MODE (TREE_TYPE (@0)), &c2);
2324 (if (REAL_VALUE_ISINF (c2))
2326 /* sqrt(x) < y is always true, when y is a very large
2327 value and we don't care about NaNs or Infinities. */
2328 (if (! HONOR_NANS (@0) && ! HONOR_INFINITIES (@0))
2329 { constant_boolean_node (true, type); })
2330 /* sqrt(x) < y is x != +Inf when y is very large and we
2331 don't care about NaNs. */
2332 (if (! HONOR_NANS (@0))
2333 (ne @0 { build_real (TREE_TYPE (@0), c2); }))
2334 /* sqrt(x) < y is x >= 0 when y is very large and we
2335 don't care about Infinities. */
2336 (if (! HONOR_INFINITIES (@0))
2337 (ge @0 { build_real (TREE_TYPE (@0), dconst0); }))
2338 /* sqrt(x) < y is x >= 0 && x != +Inf, when y is large. */
2341 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })
2342 (ne @0 { build_real (TREE_TYPE (@0), c2); }))))
2343 /* sqrt(x) < c is the same as x < c*c, if we ignore NaNs. */
2344 (if (! HONOR_NANS (@0))
2345 (cmp @0 { build_real (TREE_TYPE (@0), c2); })
2346 /* sqrt(x) < c is the same as x >= 0 && x < c*c. */
2349 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })
2350 (cmp @0 { build_real (TREE_TYPE (@0), c2); }))))))))))))
2352 /* Fold A /[ex] B CMP C to A CMP B * C. */
2355 (cmp (exact_div @0 @1) INTEGER_CST@2)
2356 (if (!integer_zerop (@1))
2357 (if (wi::eq_p (@2, 0))
2359 (if (TREE_CODE (@1) == INTEGER_CST)
2363 wide_int prod = wi::mul (@2, @1, TYPE_SIGN (TREE_TYPE (@1)), &ovf);
2366 { constant_boolean_node (cmp == NE_EXPR, type); }
2367 (cmp @0 { wide_int_to_tree (TREE_TYPE (@0), prod); }))))))))
2368 (for cmp (lt le gt ge)
2370 (cmp (exact_div @0 INTEGER_CST@1) INTEGER_CST@2)
2371 (if (wi::gt_p (@1, 0, TYPE_SIGN (TREE_TYPE (@1))))
2375 wide_int prod = wi::mul (@2, @1, TYPE_SIGN (TREE_TYPE (@1)), &ovf);
2378 { constant_boolean_node (wi::lt_p (@2, 0, TYPE_SIGN (TREE_TYPE (@2)))
2379 != (cmp == LT_EXPR || cmp == LE_EXPR), type); }
2380 (cmp @0 { wide_int_to_tree (TREE_TYPE (@0), prod); }))))))
2382 /* Unordered tests if either argument is a NaN. */
2384 (bit_ior (unordered @0 @0) (unordered @1 @1))
2385 (if (types_match (@0, @1))
2388 (bit_and (ordered @0 @0) (ordered @1 @1))
2389 (if (types_match (@0, @1))
2392 (bit_ior:c (unordered @0 @0) (unordered:c@2 @0 @1))
2395 (bit_and:c (ordered @0 @0) (ordered:c@2 @0 @1))
2398 /* Simple range test simplifications. */
2399 /* A < B || A >= B -> true. */
2400 (for test1 (lt le le le ne ge)
2401 test2 (ge gt ge ne eq ne)
2403 (bit_ior:c (test1 @0 @1) (test2 @0 @1))
2404 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2405 || VECTOR_INTEGER_TYPE_P (TREE_TYPE (@0)))
2406 { constant_boolean_node (true, type); })))
2407 /* A < B && A >= B -> false. */
2408 (for test1 (lt lt lt le ne eq)
2409 test2 (ge gt eq gt eq gt)
2411 (bit_and:c (test1 @0 @1) (test2 @0 @1))
2412 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2413 || VECTOR_INTEGER_TYPE_P (TREE_TYPE (@0)))
2414 { constant_boolean_node (false, type); })))
2416 /* -A CMP -B -> B CMP A. */
2417 (for cmp (tcc_comparison)
2418 scmp (swapped_tcc_comparison)
2420 (cmp (negate @0) (negate @1))
2421 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
2422 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2423 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))))
2426 (cmp (negate @0) CONSTANT_CLASS_P@1)
2427 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
2428 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2429 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))))
2430 (with { tree tem = const_unop (NEGATE_EXPR, TREE_TYPE (@0), @1); }
2431 (if (tem && !TREE_OVERFLOW (tem))
2432 (scmp @0 { tem; }))))))
2434 /* Convert ABS_EXPR<x> == 0 or ABS_EXPR<x> != 0 to x == 0 or x != 0. */
2437 (op (abs @0) zerop@1)
2440 /* From fold_sign_changed_comparison and fold_widened_comparison. */
2441 (for cmp (simple_comparison)
2443 (cmp (convert@0 @00) (convert?@1 @10))
2444 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2445 /* Disable this optimization if we're casting a function pointer
2446 type on targets that require function pointer canonicalization. */
2447 && !(targetm.have_canonicalize_funcptr_for_compare ()
2448 && TREE_CODE (TREE_TYPE (@00)) == POINTER_TYPE
2449 && TREE_CODE (TREE_TYPE (TREE_TYPE (@00))) == FUNCTION_TYPE)
2451 (if (TYPE_PRECISION (TREE_TYPE (@00)) == TYPE_PRECISION (TREE_TYPE (@0))
2452 && (TREE_CODE (@10) == INTEGER_CST
2453 || (@1 != @10 && types_match (TREE_TYPE (@10), TREE_TYPE (@00))))
2454 && (TYPE_UNSIGNED (TREE_TYPE (@00)) == TYPE_UNSIGNED (TREE_TYPE (@0))
2457 && (POINTER_TYPE_P (TREE_TYPE (@00)) == POINTER_TYPE_P (TREE_TYPE (@0))))
2458 /* ??? The special-casing of INTEGER_CST conversion was in the original
2459 code and here to avoid a spurious overflow flag on the resulting
2460 constant which fold_convert produces. */
2461 (if (TREE_CODE (@1) == INTEGER_CST)
2462 (cmp @00 { force_fit_type (TREE_TYPE (@00), wi::to_widest (@1), 0,
2463 TREE_OVERFLOW (@1)); })
2464 (cmp @00 (convert @1)))
2466 (if (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (TREE_TYPE (@00)))
2467 /* If possible, express the comparison in the shorter mode. */
2468 (if ((cmp == EQ_EXPR || cmp == NE_EXPR
2469 || TYPE_UNSIGNED (TREE_TYPE (@0)) == TYPE_UNSIGNED (TREE_TYPE (@00))
2470 || (!TYPE_UNSIGNED (TREE_TYPE (@0))
2471 && TYPE_UNSIGNED (TREE_TYPE (@00))))
2472 && (types_match (TREE_TYPE (@10), TREE_TYPE (@00))
2473 || ((TYPE_PRECISION (TREE_TYPE (@00))
2474 >= TYPE_PRECISION (TREE_TYPE (@10)))
2475 && (TYPE_UNSIGNED (TREE_TYPE (@00))
2476 == TYPE_UNSIGNED (TREE_TYPE (@10))))
2477 || (TREE_CODE (@10) == INTEGER_CST
2478 && INTEGRAL_TYPE_P (TREE_TYPE (@00))
2479 && int_fits_type_p (@10, TREE_TYPE (@00)))))
2480 (cmp @00 (convert @10))
2481 (if (TREE_CODE (@10) == INTEGER_CST
2482 && INTEGRAL_TYPE_P (TREE_TYPE (@00))
2483 && !int_fits_type_p (@10, TREE_TYPE (@00)))
2486 tree min = lower_bound_in_type (TREE_TYPE (@10), TREE_TYPE (@00));
2487 tree max = upper_bound_in_type (TREE_TYPE (@10), TREE_TYPE (@00));
2488 bool above = integer_nonzerop (const_binop (LT_EXPR, type, max, @10));
2489 bool below = integer_nonzerop (const_binop (LT_EXPR, type, @10, min));
2491 (if (above || below)
2492 (if (cmp == EQ_EXPR || cmp == NE_EXPR)
2493 { constant_boolean_node (cmp == EQ_EXPR ? false : true, type); }
2494 (if (cmp == LT_EXPR || cmp == LE_EXPR)
2495 { constant_boolean_node (above ? true : false, type); }
2496 (if (cmp == GT_EXPR || cmp == GE_EXPR)
2497 { constant_boolean_node (above ? false : true, type); }))))))))))))
2500 /* A local variable can never be pointed to by
2501 the default SSA name of an incoming parameter.
2502 SSA names are canonicalized to 2nd place. */
2504 (cmp addr@0 SSA_NAME@1)
2505 (if (SSA_NAME_IS_DEFAULT_DEF (@1)
2506 && TREE_CODE (SSA_NAME_VAR (@1)) == PARM_DECL)
2507 (with { tree base = get_base_address (TREE_OPERAND (@0, 0)); }
2508 (if (TREE_CODE (base) == VAR_DECL
2509 && auto_var_in_fn_p (base, current_function_decl))
2510 (if (cmp == NE_EXPR)
2511 { constant_boolean_node (true, type); }
2512 { constant_boolean_node (false, type); }))))))
2514 /* Equality compare simplifications from fold_binary */
2517 /* If we have (A | C) == D where C & ~D != 0, convert this into 0.
2518 Similarly for NE_EXPR. */
2520 (cmp (convert?@3 (bit_ior @0 INTEGER_CST@1)) INTEGER_CST@2)
2521 (if (tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0))
2522 && wi::bit_and_not (@1, @2) != 0)
2523 { constant_boolean_node (cmp == NE_EXPR, type); }))
2525 /* (X ^ Y) == 0 becomes X == Y, and (X ^ Y) != 0 becomes X != Y. */
2527 (cmp (bit_xor @0 @1) integer_zerop)
2530 /* (X ^ Y) == Y becomes X == 0.
2531 Likewise (X ^ Y) == X becomes Y == 0. */
2533 (cmp:c (bit_xor:c @0 @1) @0)
2534 (cmp @1 { build_zero_cst (TREE_TYPE (@1)); }))
2536 /* (X ^ C1) op C2 can be rewritten as X op (C1 ^ C2). */
2538 (cmp (convert?@3 (bit_xor @0 INTEGER_CST@1)) INTEGER_CST@2)
2539 (if (tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0)))
2540 (cmp @0 (bit_xor @1 (convert @2)))))
2543 (cmp (convert? addr@0) integer_zerop)
2544 (if (tree_single_nonzero_warnv_p (@0, NULL))
2545 { constant_boolean_node (cmp == NE_EXPR, type); })))
2547 /* If we have (A & C) == C where C is a power of 2, convert this into
2548 (A & C) != 0. Similarly for NE_EXPR. */
2552 (cmp (bit_and@2 @0 integer_pow2p@1) @1)
2553 (icmp @2 { build_zero_cst (TREE_TYPE (@0)); })))
2555 /* If we have (A & C) != 0 where C is the sign bit of A, convert
2556 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
2560 (cmp (bit_and (convert?@2 @0) integer_pow2p@1) integer_zerop)
2561 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2562 && (TYPE_PRECISION (TREE_TYPE (@0))
2563 == GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (@0))))
2564 && element_precision (@2) >= element_precision (@0)
2565 && wi::only_sign_bit_p (@1, element_precision (@0)))
2566 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
2567 (ncmp (convert:stype @0) { build_zero_cst (stype); })))))
2569 /* When the addresses are not directly of decls compare base and offset.
2570 This implements some remaining parts of fold_comparison address
2571 comparisons but still no complete part of it. Still it is good
2572 enough to make fold_stmt not regress when not dispatching to fold_binary. */
2573 (for cmp (simple_comparison)
2575 (cmp (convert1?@2 addr@0) (convert2? addr@1))
2578 HOST_WIDE_INT off0, off1;
2579 tree base0 = get_addr_base_and_unit_offset (TREE_OPERAND (@0, 0), &off0);
2580 tree base1 = get_addr_base_and_unit_offset (TREE_OPERAND (@1, 0), &off1);
2581 if (base0 && TREE_CODE (base0) == MEM_REF)
2583 off0 += mem_ref_offset (base0).to_short_addr ();
2584 base0 = TREE_OPERAND (base0, 0);
2586 if (base1 && TREE_CODE (base1) == MEM_REF)
2588 off1 += mem_ref_offset (base1).to_short_addr ();
2589 base1 = TREE_OPERAND (base1, 0);
2592 (if (base0 && base1)
2596 /* Punt in GENERIC on variables with value expressions;
2597 the value expressions might point to fields/elements
2598 of other vars etc. */
2600 && ((VAR_P (base0) && DECL_HAS_VALUE_EXPR_P (base0))
2601 || (VAR_P (base1) && DECL_HAS_VALUE_EXPR_P (base1))))
2603 else if (decl_in_symtab_p (base0)
2604 && decl_in_symtab_p (base1))
2605 equal = symtab_node::get_create (base0)
2606 ->equal_address_to (symtab_node::get_create (base1));
2607 else if ((DECL_P (base0)
2608 || TREE_CODE (base0) == SSA_NAME
2609 || TREE_CODE (base0) == STRING_CST)
2611 || TREE_CODE (base1) == SSA_NAME
2612 || TREE_CODE (base1) == STRING_CST))
2613 equal = (base0 == base1);
2616 && (cmp == EQ_EXPR || cmp == NE_EXPR
2617 /* If the offsets are equal we can ignore overflow. */
2619 || POINTER_TYPE_OVERFLOW_UNDEFINED
2620 /* Or if we compare using pointers to decls or strings. */
2621 || (POINTER_TYPE_P (TREE_TYPE (@2))
2622 && (DECL_P (base0) || TREE_CODE (base0) == STRING_CST))))
2624 (if (cmp == EQ_EXPR)
2625 { constant_boolean_node (off0 == off1, type); })
2626 (if (cmp == NE_EXPR)
2627 { constant_boolean_node (off0 != off1, type); })
2628 (if (cmp == LT_EXPR)
2629 { constant_boolean_node (off0 < off1, type); })
2630 (if (cmp == LE_EXPR)
2631 { constant_boolean_node (off0 <= off1, type); })
2632 (if (cmp == GE_EXPR)
2633 { constant_boolean_node (off0 >= off1, type); })
2634 (if (cmp == GT_EXPR)
2635 { constant_boolean_node (off0 > off1, type); }))
2637 && DECL_P (base0) && DECL_P (base1)
2638 /* If we compare this as integers require equal offset. */
2639 && (!INTEGRAL_TYPE_P (TREE_TYPE (@2))
2642 (if (cmp == EQ_EXPR)
2643 { constant_boolean_node (false, type); })
2644 (if (cmp == NE_EXPR)
2645 { constant_boolean_node (true, type); })))))))))
2647 /* Simplify pointer equality compares using PTA. */
2651 (if (POINTER_TYPE_P (TREE_TYPE (@0))
2652 && ptrs_compare_unequal (@0, @1))
2653 { neeq == EQ_EXPR ? boolean_false_node : boolean_true_node; })))
2655 /* PR70920: Transform (intptr_t)x eq/ne CST to x eq/ne (typeof x) CST.
2656 and (typeof ptr_cst) x eq/ne ptr_cst to x eq/ne (typeof x) CST.
2657 Disable the transform if either operand is pointer to function.
2658 This broke pr22051-2.c for arm where function pointer
2659 canonicalizaion is not wanted. */
2663 (cmp (convert @0) INTEGER_CST@1)
2664 (if ((POINTER_TYPE_P (TREE_TYPE (@0)) && !FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@0)))
2665 && INTEGRAL_TYPE_P (TREE_TYPE (@1)))
2666 || (INTEGRAL_TYPE_P (TREE_TYPE (@0)) && POINTER_TYPE_P (TREE_TYPE (@1))
2667 && !FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@1)))))
2668 (cmp @0 (convert @1)))))
2670 /* Non-equality compare simplifications from fold_binary */
2671 (for cmp (lt gt le ge)
2672 /* Comparisons with the highest or lowest possible integer of
2673 the specified precision will have known values. */
2675 (cmp (convert?@2 @0) INTEGER_CST@1)
2676 (if ((INTEGRAL_TYPE_P (TREE_TYPE (@1)) || POINTER_TYPE_P (TREE_TYPE (@1)))
2677 && tree_nop_conversion_p (TREE_TYPE (@2), TREE_TYPE (@0)))
2680 tree arg1_type = TREE_TYPE (@1);
2681 unsigned int prec = TYPE_PRECISION (arg1_type);
2682 wide_int max = wi::max_value (arg1_type);
2683 wide_int signed_max = wi::max_value (prec, SIGNED);
2684 wide_int min = wi::min_value (arg1_type);
2687 (if (wi::eq_p (@1, max))
2689 (if (cmp == GT_EXPR)
2690 { constant_boolean_node (false, type); })
2691 (if (cmp == GE_EXPR)
2693 (if (cmp == LE_EXPR)
2694 { constant_boolean_node (true, type); })
2695 (if (cmp == LT_EXPR)
2697 (if (wi::eq_p (@1, min))
2699 (if (cmp == LT_EXPR)
2700 { constant_boolean_node (false, type); })
2701 (if (cmp == LE_EXPR)
2703 (if (cmp == GE_EXPR)
2704 { constant_boolean_node (true, type); })
2705 (if (cmp == GT_EXPR)
2707 (if (wi::eq_p (@1, max - 1))
2709 (if (cmp == GT_EXPR)
2710 (eq @2 { wide_int_to_tree (TREE_TYPE (@1), wi::add (@1, 1)); }))
2711 (if (cmp == LE_EXPR)
2712 (ne @2 { wide_int_to_tree (TREE_TYPE (@1), wi::add (@1, 1)); }))))
2713 (if (wi::eq_p (@1, min + 1))
2715 (if (cmp == GE_EXPR)
2716 (ne @2 { wide_int_to_tree (TREE_TYPE (@1), wi::sub (@1, 1)); }))
2717 (if (cmp == LT_EXPR)
2718 (eq @2 { wide_int_to_tree (TREE_TYPE (@1), wi::sub (@1, 1)); }))))
2719 (if (wi::eq_p (@1, signed_max)
2720 && TYPE_UNSIGNED (arg1_type)
2721 /* We will flip the signedness of the comparison operator
2722 associated with the mode of @1, so the sign bit is
2723 specified by this mode. Check that @1 is the signed
2724 max associated with this sign bit. */
2725 && prec == GET_MODE_PRECISION (TYPE_MODE (arg1_type))
2726 /* signed_type does not work on pointer types. */
2727 && INTEGRAL_TYPE_P (arg1_type))
2728 /* The following case also applies to X < signed_max+1
2729 and X >= signed_max+1 because previous transformations. */
2730 (if (cmp == LE_EXPR || cmp == GT_EXPR)
2731 (with { tree st = signed_type_for (arg1_type); }
2732 (if (cmp == LE_EXPR)
2733 (ge (convert:st @0) { build_zero_cst (st); })
2734 (lt (convert:st @0) { build_zero_cst (st); }))))))))))
2736 (for cmp (unordered ordered unlt unle ungt unge uneq ltgt)
2737 /* If the second operand is NaN, the result is constant. */
2740 (if (REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
2741 && (cmp != LTGT_EXPR || ! flag_trapping_math))
2742 { constant_boolean_node (cmp == ORDERED_EXPR || cmp == LTGT_EXPR
2743 ? false : true, type); })))
2745 /* bool_var != 0 becomes bool_var. */
2747 (ne @0 integer_zerop)
2748 (if (TREE_CODE (TREE_TYPE (@0)) == BOOLEAN_TYPE
2749 && types_match (type, TREE_TYPE (@0)))
2751 /* bool_var == 1 becomes bool_var. */
2753 (eq @0 integer_onep)
2754 (if (TREE_CODE (TREE_TYPE (@0)) == BOOLEAN_TYPE
2755 && types_match (type, TREE_TYPE (@0)))
2758 bool_var == 0 becomes !bool_var or
2759 bool_var != 1 becomes !bool_var
2760 here because that only is good in assignment context as long
2761 as we require a tcc_comparison in GIMPLE_CONDs where we'd
2762 replace if (x == 0) with tem = ~x; if (tem != 0) which is
2763 clearly less optimal and which we'll transform again in forwprop. */
2765 /* When one argument is a constant, overflow detection can be simplified.
2766 Currently restricted to single use so as not to interfere too much with
2767 ADD_OVERFLOW detection in tree-ssa-math-opts.c.
2768 A + CST CMP A -> A CMP' CST' */
2769 (for cmp (lt le ge gt)
2772 (cmp:c (plus@2 @0 INTEGER_CST@1) @0)
2773 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
2774 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))
2777 (out @0 { wide_int_to_tree (TREE_TYPE (@0), wi::max_value
2778 (TYPE_PRECISION (TREE_TYPE (@0)), UNSIGNED) - @1); }))))
2780 /* To detect overflow in unsigned A - B, A < B is simpler than A - B > A.
2781 However, the detection logic for SUB_OVERFLOW in tree-ssa-math-opts.c
2782 expects the long form, so we restrict the transformation for now. */
2785 (cmp:c (minus@2 @0 @1) @0)
2786 (if (single_use (@2)
2787 && ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2788 && TYPE_UNSIGNED (TREE_TYPE (@0))
2789 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
2792 /* Testing for overflow is unnecessary if we already know the result. */
2797 (cmp:c (realpart (IFN_SUB_OVERFLOW@2 @0 @1)) @0)
2798 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
2799 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
2800 (out (imagpart @2) { build_zero_cst (TREE_TYPE (@0)); }))))
2805 (cmp:c (realpart (IFN_ADD_OVERFLOW:c@2 @0 @1)) @0)
2806 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
2807 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
2808 (out (imagpart @2) { build_zero_cst (TREE_TYPE (@0)); }))))
2810 /* For unsigned operands, -1 / B < A checks whether A * B would overflow.
2811 Simplify it to __builtin_mul_overflow (A, B, <unused>). */
2815 (cmp:c (trunc_div:s integer_all_onesp @1) @0)
2816 (if (TYPE_UNSIGNED (TREE_TYPE (@0)) && !VECTOR_TYPE_P (TREE_TYPE (@0)))
2817 (with { tree t = TREE_TYPE (@0), cpx = build_complex_type (t); }
2818 (out (imagpart (IFN_MUL_OVERFLOW:cpx @0 @1)) { build_zero_cst (t); })))))
2820 /* Simplification of math builtins. These rules must all be optimizations
2821 as well as IL simplifications. If there is a possibility that the new
2822 form could be a pessimization, the rule should go in the canonicalization
2823 section that follows this one.
2825 Rules can generally go in this section if they satisfy one of
2828 - the rule describes an identity
2830 - the rule replaces calls with something as simple as addition or
2833 - the rule contains unary calls only and simplifies the surrounding
2834 arithmetic. (The idea here is to exclude non-unary calls in which
2835 one operand is constant and in which the call is known to be cheap
2836 when the operand has that value.) */
2838 (if (flag_unsafe_math_optimizations)
2839 /* Simplify sqrt(x) * sqrt(x) -> x. */
2841 (mult (SQRT@1 @0) @1)
2842 (if (!HONOR_SNANS (type))
2845 /* Simplify sqrt(x) * sqrt(y) -> sqrt(x*y). */
2846 (for root (SQRT CBRT)
2848 (mult (root:s @0) (root:s @1))
2849 (root (mult @0 @1))))
2851 /* Simplify expN(x) * expN(y) -> expN(x+y). */
2852 (for exps (EXP EXP2 EXP10 POW10)
2854 (mult (exps:s @0) (exps:s @1))
2855 (exps (plus @0 @1))))
2857 /* Simplify a/root(b/c) into a*root(c/b). */
2858 (for root (SQRT CBRT)
2860 (rdiv @0 (root:s (rdiv:s @1 @2)))
2861 (mult @0 (root (rdiv @2 @1)))))
2863 /* Simplify x/expN(y) into x*expN(-y). */
2864 (for exps (EXP EXP2 EXP10 POW10)
2866 (rdiv @0 (exps:s @1))
2867 (mult @0 (exps (negate @1)))))
2869 (for logs (LOG LOG2 LOG10 LOG10)
2870 exps (EXP EXP2 EXP10 POW10)
2871 /* logN(expN(x)) -> x. */
2875 /* expN(logN(x)) -> x. */
2880 /* Optimize logN(func()) for various exponential functions. We
2881 want to determine the value "x" and the power "exponent" in
2882 order to transform logN(x**exponent) into exponent*logN(x). */
2883 (for logs (LOG LOG LOG LOG2 LOG2 LOG2 LOG10 LOG10)
2884 exps (EXP2 EXP10 POW10 EXP EXP10 POW10 EXP EXP2)
2887 (if (SCALAR_FLOAT_TYPE_P (type))
2893 /* Prepare to do logN(exp(exponent)) -> exponent*logN(e). */
2894 x = build_real_truncate (type, dconst_e ());
2897 /* Prepare to do logN(exp2(exponent)) -> exponent*logN(2). */
2898 x = build_real (type, dconst2);
2902 /* Prepare to do logN(exp10(exponent)) -> exponent*logN(10). */
2904 REAL_VALUE_TYPE dconst10;
2905 real_from_integer (&dconst10, VOIDmode, 10, SIGNED);
2906 x = build_real (type, dconst10);
2913 (mult (logs { x; }) @0)))))
2921 (if (SCALAR_FLOAT_TYPE_P (type))
2927 /* Prepare to do logN(sqrt(x)) -> 0.5*logN(x). */
2928 x = build_real (type, dconsthalf);
2931 /* Prepare to do logN(cbrt(x)) -> (1/3)*logN(x). */
2932 x = build_real_truncate (type, dconst_third ());
2938 (mult { x; } (logs @0))))))
2940 /* logN(pow(x,exponent)) -> exponent*logN(x). */
2941 (for logs (LOG LOG2 LOG10)
2945 (mult @1 (logs @0))))
2950 exps (EXP EXP2 EXP10 POW10)
2951 /* sqrt(expN(x)) -> expN(x*0.5). */
2954 (exps (mult @0 { build_real (type, dconsthalf); })))
2955 /* cbrt(expN(x)) -> expN(x/3). */
2958 (exps (mult @0 { build_real_truncate (type, dconst_third ()); })))
2959 /* pow(expN(x), y) -> expN(x*y). */
2962 (exps (mult @0 @1))))
2964 /* tan(atan(x)) -> x. */
2971 /* cabs(x+0i) or cabs(0+xi) -> abs(x). */
2973 (CABS (complex:C @0 real_zerop@1))
2976 /* trunc(trunc(x)) -> trunc(x), etc. */
2977 (for fns (TRUNC FLOOR CEIL ROUND NEARBYINT RINT)
2981 /* f(x) -> x if x is integer valued and f does nothing for such values. */
2982 (for fns (TRUNC FLOOR CEIL ROUND NEARBYINT RINT)
2984 (fns integer_valued_real_p@0)
2987 /* hypot(x,0) and hypot(0,x) -> abs(x). */
2989 (HYPOT:c @0 real_zerop@1)
2992 /* pow(1,x) -> 1. */
2994 (POW real_onep@0 @1)
2998 /* copysign(x,x) -> x. */
3003 /* copysign(x,y) -> fabs(x) if y is nonnegative. */
3004 (COPYSIGN @0 tree_expr_nonnegative_p@1)
3007 (for scale (LDEXP SCALBN SCALBLN)
3008 /* ldexp(0, x) -> 0. */
3010 (scale real_zerop@0 @1)
3012 /* ldexp(x, 0) -> x. */
3014 (scale @0 integer_zerop@1)
3016 /* ldexp(x, y) -> x if x is +-Inf or NaN. */
3018 (scale REAL_CST@0 @1)
3019 (if (!real_isfinite (TREE_REAL_CST_PTR (@0)))
3022 /* Canonicalization of sequences of math builtins. These rules represent
3023 IL simplifications but are not necessarily optimizations.
3025 The sincos pass is responsible for picking "optimal" implementations
3026 of math builtins, which may be more complicated and can sometimes go
3027 the other way, e.g. converting pow into a sequence of sqrts.
3028 We only want to do these canonicalizations before the pass has run. */
3030 (if (flag_unsafe_math_optimizations && canonicalize_math_p ())
3031 /* Simplify tan(x) * cos(x) -> sin(x). */
3033 (mult:c (TAN:s @0) (COS:s @0))
3036 /* Simplify x * pow(x,c) -> pow(x,c+1). */
3038 (mult:c @0 (POW:s @0 REAL_CST@1))
3039 (if (!TREE_OVERFLOW (@1))
3040 (POW @0 (plus @1 { build_one_cst (type); }))))
3042 /* Simplify sin(x) / cos(x) -> tan(x). */
3044 (rdiv (SIN:s @0) (COS:s @0))
3047 /* Simplify cos(x) / sin(x) -> 1 / tan(x). */
3049 (rdiv (COS:s @0) (SIN:s @0))
3050 (rdiv { build_one_cst (type); } (TAN @0)))
3052 /* Simplify sin(x) / tan(x) -> cos(x). */
3054 (rdiv (SIN:s @0) (TAN:s @0))
3055 (if (! HONOR_NANS (@0)
3056 && ! HONOR_INFINITIES (@0))
3059 /* Simplify tan(x) / sin(x) -> 1.0 / cos(x). */
3061 (rdiv (TAN:s @0) (SIN:s @0))
3062 (if (! HONOR_NANS (@0)
3063 && ! HONOR_INFINITIES (@0))
3064 (rdiv { build_one_cst (type); } (COS @0))))
3066 /* Simplify pow(x,y) * pow(x,z) -> pow(x,y+z). */
3068 (mult (POW:s @0 @1) (POW:s @0 @2))
3069 (POW @0 (plus @1 @2)))
3071 /* Simplify pow(x,y) * pow(z,y) -> pow(x*z,y). */
3073 (mult (POW:s @0 @1) (POW:s @2 @1))
3074 (POW (mult @0 @2) @1))
3076 /* Simplify powi(x,y) * powi(z,y) -> powi(x*z,y). */
3078 (mult (POWI:s @0 @1) (POWI:s @2 @1))
3079 (POWI (mult @0 @2) @1))
3081 /* Simplify pow(x,c) / x -> pow(x,c-1). */
3083 (rdiv (POW:s @0 REAL_CST@1) @0)
3084 (if (!TREE_OVERFLOW (@1))
3085 (POW @0 (minus @1 { build_one_cst (type); }))))
3087 /* Simplify x / pow (y,z) -> x * pow(y,-z). */
3089 (rdiv @0 (POW:s @1 @2))
3090 (mult @0 (POW @1 (negate @2))))
3095 /* sqrt(sqrt(x)) -> pow(x,1/4). */
3098 (pows @0 { build_real (type, dconst_quarter ()); }))
3099 /* sqrt(cbrt(x)) -> pow(x,1/6). */
3102 (pows @0 { build_real_truncate (type, dconst_sixth ()); }))
3103 /* cbrt(sqrt(x)) -> pow(x,1/6). */
3106 (pows @0 { build_real_truncate (type, dconst_sixth ()); }))
3107 /* cbrt(cbrt(x)) -> pow(x,1/9), iff x is nonnegative. */
3109 (cbrts (cbrts tree_expr_nonnegative_p@0))
3110 (pows @0 { build_real_truncate (type, dconst_ninth ()); }))
3111 /* sqrt(pow(x,y)) -> pow(|x|,y*0.5). */
3113 (sqrts (pows @0 @1))
3114 (pows (abs @0) (mult @1 { build_real (type, dconsthalf); })))
3115 /* cbrt(pow(x,y)) -> pow(x,y/3), iff x is nonnegative. */
3117 (cbrts (pows tree_expr_nonnegative_p@0 @1))
3118 (pows @0 (mult @1 { build_real_truncate (type, dconst_third ()); })))
3119 /* pow(sqrt(x),y) -> pow(x,y*0.5). */
3121 (pows (sqrts @0) @1)
3122 (pows @0 (mult @1 { build_real (type, dconsthalf); })))
3123 /* pow(cbrt(x),y) -> pow(x,y/3) iff x is nonnegative. */
3125 (pows (cbrts tree_expr_nonnegative_p@0) @1)
3126 (pows @0 (mult @1 { build_real_truncate (type, dconst_third ()); })))
3127 /* pow(pow(x,y),z) -> pow(x,y*z) iff x is nonnegative. */
3129 (pows (pows tree_expr_nonnegative_p@0 @1) @2)
3130 (pows @0 (mult @1 @2))))
3132 /* cabs(x+xi) -> fabs(x)*sqrt(2). */
3134 (CABS (complex @0 @0))
3135 (mult (abs @0) { build_real_truncate (type, dconst_sqrt2 ()); }))
3137 /* hypot(x,x) -> fabs(x)*sqrt(2). */
3140 (mult (abs @0) { build_real_truncate (type, dconst_sqrt2 ()); }))
3142 /* cexp(x+yi) -> exp(x)*cexpi(y). */
3147 (cexps compositional_complex@0)
3148 (if (targetm.libc_has_function (function_c99_math_complex))
3150 (mult (exps@1 (realpart @0)) (realpart (cexpis:type@2 (imagpart @0))))
3151 (mult @1 (imagpart @2)))))))
3153 (if (canonicalize_math_p ())
3154 /* floor(x) -> trunc(x) if x is nonnegative. */
3158 (floors tree_expr_nonnegative_p@0)
3161 (match double_value_p
3163 (if (TYPE_MAIN_VARIANT (TREE_TYPE (@0)) == double_type_node)))
3164 (for froms (BUILT_IN_TRUNCL
3176 /* truncl(extend(x)) -> extend(trunc(x)), etc., if x is a double. */
3177 (if (optimize && canonicalize_math_p ())
3179 (froms (convert double_value_p@0))
3180 (convert (tos @0)))))
3182 (match float_value_p
3184 (if (TYPE_MAIN_VARIANT (TREE_TYPE (@0)) == float_type_node)))
3185 (for froms (BUILT_IN_TRUNCL BUILT_IN_TRUNC
3186 BUILT_IN_FLOORL BUILT_IN_FLOOR
3187 BUILT_IN_CEILL BUILT_IN_CEIL
3188 BUILT_IN_ROUNDL BUILT_IN_ROUND
3189 BUILT_IN_NEARBYINTL BUILT_IN_NEARBYINT
3190 BUILT_IN_RINTL BUILT_IN_RINT)
3191 tos (BUILT_IN_TRUNCF BUILT_IN_TRUNCF
3192 BUILT_IN_FLOORF BUILT_IN_FLOORF
3193 BUILT_IN_CEILF BUILT_IN_CEILF
3194 BUILT_IN_ROUNDF BUILT_IN_ROUNDF
3195 BUILT_IN_NEARBYINTF BUILT_IN_NEARBYINTF
3196 BUILT_IN_RINTF BUILT_IN_RINTF)
3197 /* truncl(extend(x)) and trunc(extend(x)) -> extend(truncf(x)), etc.,
3199 (if (optimize && canonicalize_math_p ()
3200 && targetm.libc_has_function (function_c99_misc))
3202 (froms (convert float_value_p@0))
3203 (convert (tos @0)))))
3205 (for froms (XFLOORL XCEILL XROUNDL XRINTL)
3206 tos (XFLOOR XCEIL XROUND XRINT)
3207 /* llfloorl(extend(x)) -> llfloor(x), etc., if x is a double. */
3208 (if (optimize && canonicalize_math_p ())
3210 (froms (convert double_value_p@0))
3213 (for froms (XFLOORL XCEILL XROUNDL XRINTL
3214 XFLOOR XCEIL XROUND XRINT)
3215 tos (XFLOORF XCEILF XROUNDF XRINTF)
3216 /* llfloorl(extend(x)) and llfloor(extend(x)) -> llfloorf(x), etc.,
3218 (if (optimize && canonicalize_math_p ())
3220 (froms (convert float_value_p@0))
3223 (if (canonicalize_math_p ())
3224 /* xfloor(x) -> fix_trunc(x) if x is nonnegative. */
3225 (for floors (IFLOOR LFLOOR LLFLOOR)
3227 (floors tree_expr_nonnegative_p@0)
3230 (if (canonicalize_math_p ())
3231 /* xfloor(x) -> fix_trunc(x), etc., if x is integer valued. */
3232 (for fns (IFLOOR LFLOOR LLFLOOR
3234 IROUND LROUND LLROUND)
3236 (fns integer_valued_real_p@0)
3238 (if (!flag_errno_math)
3239 /* xrint(x) -> fix_trunc(x), etc., if x is integer valued. */
3240 (for rints (IRINT LRINT LLRINT)
3242 (rints integer_valued_real_p@0)
3245 (if (canonicalize_math_p ())
3246 (for ifn (IFLOOR ICEIL IROUND IRINT)
3247 lfn (LFLOOR LCEIL LROUND LRINT)
3248 llfn (LLFLOOR LLCEIL LLROUND LLRINT)
3249 /* Canonicalize iround (x) to lround (x) on ILP32 targets where
3250 sizeof (int) == sizeof (long). */
3251 (if (TYPE_PRECISION (integer_type_node)
3252 == TYPE_PRECISION (long_integer_type_node))
3255 (lfn:long_integer_type_node @0)))
3256 /* Canonicalize llround (x) to lround (x) on LP64 targets where
3257 sizeof (long long) == sizeof (long). */
3258 (if (TYPE_PRECISION (long_long_integer_type_node)
3259 == TYPE_PRECISION (long_integer_type_node))
3262 (lfn:long_integer_type_node @0)))))
3264 /* cproj(x) -> x if we're ignoring infinities. */
3267 (if (!HONOR_INFINITIES (type))
3270 /* If the real part is inf and the imag part is known to be
3271 nonnegative, return (inf + 0i). */
3273 (CPROJ (complex REAL_CST@0 tree_expr_nonnegative_p@1))
3274 (if (real_isinf (TREE_REAL_CST_PTR (@0)))
3275 { build_complex_inf (type, false); }))
3277 /* If the imag part is inf, return (inf+I*copysign(0,imag)). */
3279 (CPROJ (complex @0 REAL_CST@1))
3280 (if (real_isinf (TREE_REAL_CST_PTR (@1)))
3281 { build_complex_inf (type, TREE_REAL_CST_PTR (@1)->sign); }))
3287 (pows @0 REAL_CST@1)
3289 const REAL_VALUE_TYPE *value = TREE_REAL_CST_PTR (@1);
3290 REAL_VALUE_TYPE tmp;
3293 /* pow(x,0) -> 1. */
3294 (if (real_equal (value, &dconst0))
3295 { build_real (type, dconst1); })
3296 /* pow(x,1) -> x. */
3297 (if (real_equal (value, &dconst1))
3299 /* pow(x,-1) -> 1/x. */
3300 (if (real_equal (value, &dconstm1))
3301 (rdiv { build_real (type, dconst1); } @0))
3302 /* pow(x,0.5) -> sqrt(x). */
3303 (if (flag_unsafe_math_optimizations
3304 && canonicalize_math_p ()
3305 && real_equal (value, &dconsthalf))
3307 /* pow(x,1/3) -> cbrt(x). */
3308 (if (flag_unsafe_math_optimizations
3309 && canonicalize_math_p ()
3310 && (tmp = real_value_truncate (TYPE_MODE (type), dconst_third ()),
3311 real_equal (value, &tmp)))
3314 /* powi(1,x) -> 1. */
3316 (POWI real_onep@0 @1)
3320 (POWI @0 INTEGER_CST@1)
3322 /* powi(x,0) -> 1. */
3323 (if (wi::eq_p (@1, 0))
3324 { build_real (type, dconst1); })
3325 /* powi(x,1) -> x. */
3326 (if (wi::eq_p (@1, 1))
3328 /* powi(x,-1) -> 1/x. */
3329 (if (wi::eq_p (@1, -1))
3330 (rdiv { build_real (type, dconst1); } @0))))
3332 /* Narrowing of arithmetic and logical operations.
3334 These are conceptually similar to the transformations performed for
3335 the C/C++ front-ends by shorten_binary_op and shorten_compare. Long
3336 term we want to move all that code out of the front-ends into here. */
3338 /* If we have a narrowing conversion of an arithmetic operation where
3339 both operands are widening conversions from the same type as the outer
3340 narrowing conversion. Then convert the innermost operands to a suitable
3341 unsigned type (to avoid introducing undefined behavior), perform the
3342 operation and convert the result to the desired type. */
3343 (for op (plus minus)
3345 (convert (op:s (convert@2 @0) (convert?@3 @1)))
3346 (if (INTEGRAL_TYPE_P (type)
3347 /* We check for type compatibility between @0 and @1 below,
3348 so there's no need to check that @1/@3 are integral types. */
3349 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
3350 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
3351 /* The precision of the type of each operand must match the
3352 precision of the mode of each operand, similarly for the
3354 && (TYPE_PRECISION (TREE_TYPE (@0))
3355 == GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (@0))))
3356 && (TYPE_PRECISION (TREE_TYPE (@1))
3357 == GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (@1))))
3358 && TYPE_PRECISION (type) == GET_MODE_PRECISION (TYPE_MODE (type))
3359 /* The inner conversion must be a widening conversion. */
3360 && TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (TREE_TYPE (@0))
3361 && types_match (@0, type)
3362 && (types_match (@0, @1)
3363 /* Or the second operand is const integer or converted const
3364 integer from valueize. */
3365 || TREE_CODE (@1) == INTEGER_CST))
3366 (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
3367 (op @0 (convert @1))
3368 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
3369 (convert (op (convert:utype @0)
3370 (convert:utype @1))))))))
3372 /* This is another case of narrowing, specifically when there's an outer
3373 BIT_AND_EXPR which masks off bits outside the type of the innermost
3374 operands. Like the previous case we have to convert the operands
3375 to unsigned types to avoid introducing undefined behavior for the
3376 arithmetic operation. */
3377 (for op (minus plus)
3379 (bit_and (op:s (convert@2 @0) (convert@3 @1)) INTEGER_CST@4)
3380 (if (INTEGRAL_TYPE_P (type)
3381 /* We check for type compatibility between @0 and @1 below,
3382 so there's no need to check that @1/@3 are integral types. */
3383 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
3384 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
3385 /* The precision of the type of each operand must match the
3386 precision of the mode of each operand, similarly for the
3388 && (TYPE_PRECISION (TREE_TYPE (@0))
3389 == GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (@0))))
3390 && (TYPE_PRECISION (TREE_TYPE (@1))
3391 == GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (@1))))
3392 && TYPE_PRECISION (type) == GET_MODE_PRECISION (TYPE_MODE (type))
3393 /* The inner conversion must be a widening conversion. */
3394 && TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (TREE_TYPE (@0))
3395 && types_match (@0, @1)
3396 && (tree_int_cst_min_precision (@4, TYPE_SIGN (TREE_TYPE (@0)))
3397 <= TYPE_PRECISION (TREE_TYPE (@0)))
3398 && (wi::bit_and (@4, wi::mask (TYPE_PRECISION (TREE_TYPE (@0)),
3399 true, TYPE_PRECISION (type))) == 0))
3400 (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
3401 (with { tree ntype = TREE_TYPE (@0); }
3402 (convert (bit_and (op @0 @1) (convert:ntype @4))))
3403 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
3404 (convert (bit_and (op (convert:utype @0) (convert:utype @1))
3405 (convert:utype @4))))))))
3407 /* Transform (@0 < @1 and @0 < @2) to use min,
3408 (@0 > @1 and @0 > @2) to use max */
3409 (for op (lt le gt ge)
3410 ext (min min max max)
3412 (bit_and (op:cs @0 @1) (op:cs @0 @2))
3413 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
3414 && TREE_CODE (@0) != INTEGER_CST)
3415 (op @0 (ext @1 @2)))))
3418 /* signbit(x) -> 0 if x is nonnegative. */
3419 (SIGNBIT tree_expr_nonnegative_p@0)
3420 { integer_zero_node; })
3423 /* signbit(x) -> x<0 if x doesn't have signed zeros. */
3425 (if (!HONOR_SIGNED_ZEROS (@0))
3426 (convert (lt @0 { build_real (TREE_TYPE (@0), dconst0); }))))
3428 /* Transform comparisons of the form X +- C1 CMP C2 to X CMP C2 -+ C1. */
3430 (for op (plus minus)
3433 (cmp (op@3 @0 INTEGER_CST@1) INTEGER_CST@2)
3434 (if (!TREE_OVERFLOW (@1) && !TREE_OVERFLOW (@2)
3435 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0))
3436 && !TYPE_OVERFLOW_TRAPS (TREE_TYPE (@0))
3437 && !TYPE_SATURATING (TREE_TYPE (@0)))
3438 (with { tree res = int_const_binop (rop, @2, @1); }
3439 (if (TREE_OVERFLOW (res))
3440 { constant_boolean_node (cmp == NE_EXPR, type); }
3441 (if (single_use (@3))
3442 (cmp @0 { res; }))))))))
3443 (for cmp (lt le gt ge)
3444 (for op (plus minus)
3447 (cmp (op@3 @0 INTEGER_CST@1) INTEGER_CST@2)
3448 (if (!TREE_OVERFLOW (@1) && !TREE_OVERFLOW (@2)
3449 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
3450 (with { tree res = int_const_binop (rop, @2, @1); }
3451 (if (TREE_OVERFLOW (res))
3453 fold_overflow_warning (("assuming signed overflow does not occur "
3454 "when simplifying conditional to constant"),
3455 WARN_STRICT_OVERFLOW_CONDITIONAL);
3456 bool less = cmp == LE_EXPR || cmp == LT_EXPR;
3457 /* wi::ges_p (@2, 0) should be sufficient for a signed type. */
3458 bool ovf_high = wi::lt_p (@1, 0, TYPE_SIGN (TREE_TYPE (@1)))
3459 != (op == MINUS_EXPR);
3460 constant_boolean_node (less == ovf_high, type);
3462 (if (single_use (@3))
3465 fold_overflow_warning (("assuming signed overflow does not occur "
3466 "when changing X +- C1 cmp C2 to "
3468 WARN_STRICT_OVERFLOW_COMPARISON);
3470 (cmp @0 { res; })))))))))
3472 /* Canonicalizations of BIT_FIELD_REFs. */
3475 (BIT_FIELD_REF @0 @1 @2)
3477 (if (TREE_CODE (TREE_TYPE (@0)) == COMPLEX_TYPE
3478 && tree_int_cst_equal (@1, TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0)))))
3480 (if (integer_zerop (@2))
3481 (view_convert (realpart @0)))
3482 (if (tree_int_cst_equal (@2, TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0)))))
3483 (view_convert (imagpart @0)))))
3484 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
3485 && INTEGRAL_TYPE_P (type)
3486 /* On GIMPLE this should only apply to register arguments. */
3487 && (! GIMPLE || is_gimple_reg (@0))
3488 /* A bit-field-ref that referenced the full argument can be stripped. */
3489 && ((compare_tree_int (@1, TYPE_PRECISION (TREE_TYPE (@0))) == 0
3490 && integer_zerop (@2))
3491 /* Low-parts can be reduced to integral conversions.
3492 ??? The following doesn't work for PDP endian. */
3493 || (BYTES_BIG_ENDIAN == WORDS_BIG_ENDIAN
3494 /* Don't even think about BITS_BIG_ENDIAN. */
3495 && TYPE_PRECISION (TREE_TYPE (@0)) % BITS_PER_UNIT == 0
3496 && TYPE_PRECISION (type) % BITS_PER_UNIT == 0
3497 && compare_tree_int (@2, (BYTES_BIG_ENDIAN
3498 ? (TYPE_PRECISION (TREE_TYPE (@0))
3499 - TYPE_PRECISION (type))
3503 /* Simplify vector extracts. */
3506 (BIT_FIELD_REF CONSTRUCTOR@0 @1 @2)
3507 (if (VECTOR_TYPE_P (TREE_TYPE (@0))
3508 && (types_match (type, TREE_TYPE (TREE_TYPE (@0)))
3509 || (VECTOR_TYPE_P (type)
3510 && types_match (TREE_TYPE (type), TREE_TYPE (TREE_TYPE (@0))))))
3513 tree ctor = (TREE_CODE (@0) == SSA_NAME
3514 ? gimple_assign_rhs1 (SSA_NAME_DEF_STMT (@0)) : @0);
3515 tree eltype = TREE_TYPE (TREE_TYPE (ctor));
3516 unsigned HOST_WIDE_INT width = tree_to_uhwi (TYPE_SIZE (eltype));
3517 unsigned HOST_WIDE_INT n = tree_to_uhwi (@1);
3518 unsigned HOST_WIDE_INT idx = tree_to_uhwi (@2);
3521 && (idx % width) == 0
3523 && ((idx + n) / width) <= TYPE_VECTOR_SUBPARTS (TREE_TYPE (ctor)))
3528 /* Constructor elements can be subvectors. */
3529 unsigned HOST_WIDE_INT k = 1;
3530 if (CONSTRUCTOR_NELTS (ctor) != 0)
3532 tree cons_elem = TREE_TYPE (CONSTRUCTOR_ELT (ctor, 0)->value);
3533 if (TREE_CODE (cons_elem) == VECTOR_TYPE)
3534 k = TYPE_VECTOR_SUBPARTS (cons_elem);
3538 /* We keep an exact subset of the constructor elements. */
3539 (if ((idx % k) == 0 && (n % k) == 0)
3540 (if (CONSTRUCTOR_NELTS (ctor) == 0)
3541 { build_constructor (type, NULL); }
3548 (if (idx < CONSTRUCTOR_NELTS (ctor))
3549 { CONSTRUCTOR_ELT (ctor, idx)->value; }
3550 { build_zero_cst (type); })
3552 vec<constructor_elt, va_gc> *vals;
3553 vec_alloc (vals, n);
3554 for (unsigned i = 0;
3555 i < n && idx + i < CONSTRUCTOR_NELTS (ctor); ++i)
3556 CONSTRUCTOR_APPEND_ELT (vals, NULL_TREE,
3557 CONSTRUCTOR_ELT (ctor, idx + i)->value);
3558 build_constructor (type, vals);
3560 /* The bitfield references a single constructor element. */
3561 (if (idx + n <= (idx / k + 1) * k)
3563 (if (CONSTRUCTOR_NELTS (ctor) <= idx / k)
3564 { build_zero_cst (type); })
3566 { CONSTRUCTOR_ELT (ctor, idx / k)->value; })
3567 (BIT_FIELD_REF { CONSTRUCTOR_ELT (ctor, idx / k)->value; }
3568 @1 { bitsize_int ((idx % k) * width); })))))))))