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-2021 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
32 initializer_each_zero_or_onep
34 tree_expr_nonnegative_p
43 (define_operator_list tcc_comparison
44 lt le eq ne ge gt unordered ordered unlt unle ungt unge uneq ltgt)
45 (define_operator_list inverted_tcc_comparison
46 ge gt ne eq lt le ordered unordered ge gt le lt ltgt uneq)
47 (define_operator_list inverted_tcc_comparison_with_nans
48 unge ungt ne eq unlt unle ordered unordered ge gt le lt ltgt uneq)
49 (define_operator_list swapped_tcc_comparison
50 gt ge eq ne le lt unordered ordered ungt unge unlt unle uneq ltgt)
51 (define_operator_list simple_comparison lt le eq ne ge gt)
52 (define_operator_list swapped_simple_comparison gt ge eq ne le lt)
54 #include "cfn-operators.pd"
56 /* Define operand lists for math rounding functions {,i,l,ll}FN,
57 where the versions prefixed with "i" return an int, those prefixed with
58 "l" return a long and those prefixed with "ll" return a long long.
60 Also define operand lists:
62 X<FN>F for all float functions, in the order i, l, ll
63 X<FN> for all double functions, in the same order
64 X<FN>L for all long double functions, in the same order. */
65 #define DEFINE_INT_AND_FLOAT_ROUND_FN(FN) \
66 (define_operator_list X##FN##F BUILT_IN_I##FN##F \
69 (define_operator_list X##FN BUILT_IN_I##FN \
72 (define_operator_list X##FN##L BUILT_IN_I##FN##L \
76 DEFINE_INT_AND_FLOAT_ROUND_FN (FLOOR)
77 DEFINE_INT_AND_FLOAT_ROUND_FN (CEIL)
78 DEFINE_INT_AND_FLOAT_ROUND_FN (ROUND)
79 DEFINE_INT_AND_FLOAT_ROUND_FN (RINT)
81 /* Binary operations and their associated IFN_COND_* function. */
82 (define_operator_list UNCOND_BINARY
84 mult trunc_div trunc_mod rdiv
86 bit_and bit_ior bit_xor
88 (define_operator_list COND_BINARY
89 IFN_COND_ADD IFN_COND_SUB
90 IFN_COND_MUL IFN_COND_DIV IFN_COND_MOD IFN_COND_RDIV
91 IFN_COND_MIN IFN_COND_MAX
92 IFN_COND_AND IFN_COND_IOR IFN_COND_XOR
93 IFN_COND_SHL IFN_COND_SHR)
95 /* Same for ternary operations. */
96 (define_operator_list UNCOND_TERNARY
97 IFN_FMA IFN_FMS IFN_FNMA IFN_FNMS)
98 (define_operator_list COND_TERNARY
99 IFN_COND_FMA IFN_COND_FMS IFN_COND_FNMA IFN_COND_FNMS)
101 /* With nop_convert? combine convert? and view_convert? in one pattern
102 plus conditionalize on tree_nop_conversion_p conversions. */
103 (match (nop_convert @0)
105 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))))
106 (match (nop_convert @0)
108 (if (VECTOR_TYPE_P (type) && VECTOR_TYPE_P (TREE_TYPE (@0))
109 && known_eq (TYPE_VECTOR_SUBPARTS (type),
110 TYPE_VECTOR_SUBPARTS (TREE_TYPE (@0)))
111 && tree_nop_conversion_p (TREE_TYPE (type), TREE_TYPE (TREE_TYPE (@0))))))
113 /* Transform likes of (char) ABS_EXPR <(int) x> into (char) ABSU_EXPR <x>
114 ABSU_EXPR returns unsigned absolute value of the operand and the operand
115 of the ABSU_EXPR will have the corresponding signed type. */
116 (simplify (abs (convert @0))
117 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
118 && !TYPE_UNSIGNED (TREE_TYPE (@0))
119 && element_precision (type) > element_precision (TREE_TYPE (@0)))
120 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
121 (convert (absu:utype @0)))))
124 /* Optimize (X + (X >> (prec - 1))) ^ (X >> (prec - 1)) into abs (X). */
126 (bit_xor:c (plus:c @0 (rshift@2 @0 INTEGER_CST@1)) @2)
127 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
128 && !TYPE_UNSIGNED (TREE_TYPE (@0))
129 && wi::to_widest (@1) == element_precision (TREE_TYPE (@0)) - 1)
133 /* Simplifications of operations with one constant operand and
134 simplifications to constants or single values. */
136 (for op (plus pointer_plus minus bit_ior bit_xor)
138 (op @0 integer_zerop)
141 /* 0 +p index -> (type)index */
143 (pointer_plus integer_zerop @1)
144 (non_lvalue (convert @1)))
146 /* ptr - 0 -> (type)ptr */
148 (pointer_diff @0 integer_zerop)
151 /* See if ARG1 is zero and X + ARG1 reduces to X.
152 Likewise if the operands are reversed. */
154 (plus:c @0 real_zerop@1)
155 (if (fold_real_zero_addition_p (type, @0, @1, 0))
158 /* See if ARG1 is zero and X - ARG1 reduces to X. */
160 (minus @0 real_zerop@1)
161 (if (fold_real_zero_addition_p (type, @0, @1, 1))
164 /* Even if the fold_real_zero_addition_p can't simplify X + 0.0
165 into X, we can optimize (X + 0.0) + 0.0 or (X + 0.0) - 0.0
166 or (X - 0.0) + 0.0 into X + 0.0 and (X - 0.0) - 0.0 into X - 0.0
167 if not -frounding-math. For sNaNs the first operation would raise
168 exceptions but turn the result into qNan, so the second operation
169 would not raise it. */
170 (for inner_op (plus minus)
171 (for outer_op (plus minus)
173 (outer_op (inner_op@3 @0 REAL_CST@1) REAL_CST@2)
176 && !HONOR_SIGN_DEPENDENT_ROUNDING (type))
177 (with { bool inner_plus = ((inner_op == PLUS_EXPR)
178 ^ REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@1)));
180 = ((outer_op == PLUS_EXPR)
181 ^ REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@2))); }
182 (if (outer_plus && !inner_plus)
187 This is unsafe for certain floats even in non-IEEE formats.
188 In IEEE, it is unsafe because it does wrong for NaNs.
189 Also note that operand_equal_p is always false if an operand
193 (if (!FLOAT_TYPE_P (type) || !tree_expr_maybe_nan_p (@0))
194 { build_zero_cst (type); }))
196 (pointer_diff @@0 @0)
197 { build_zero_cst (type); })
200 (mult @0 integer_zerop@1)
203 /* Maybe fold x * 0 to 0. The expressions aren't the same
204 when x is NaN, since x * 0 is also NaN. Nor are they the
205 same in modes with signed zeros, since multiplying a
206 negative value by 0 gives -0, not +0. */
208 (mult @0 real_zerop@1)
209 (if (!tree_expr_maybe_nan_p (@0)
210 && !tree_expr_maybe_real_minus_zero_p (@0)
211 && !tree_expr_maybe_real_minus_zero_p (@1))
214 /* In IEEE floating point, x*1 is not equivalent to x for snans.
215 Likewise for complex arithmetic with signed zeros. */
218 (if (!tree_expr_maybe_signaling_nan_p (@0)
219 && (!HONOR_SIGNED_ZEROS (type)
220 || !COMPLEX_FLOAT_TYPE_P (type)))
223 /* Transform x * -1.0 into -x. */
225 (mult @0 real_minus_onep)
226 (if (!tree_expr_maybe_signaling_nan_p (@0)
227 && (!HONOR_SIGNED_ZEROS (type)
228 || !COMPLEX_FLOAT_TYPE_P (type)))
231 /* Transform { 0 or 1 } * { 0 or 1 } into { 0 or 1 } & { 0 or 1 } */
233 (mult SSA_NAME@1 SSA_NAME@2)
234 (if (INTEGRAL_TYPE_P (type)
235 && get_nonzero_bits (@1) == 1
236 && get_nonzero_bits (@2) == 1)
239 /* Transform x * { 0 or 1, 0 or 1, ... } into x & { 0 or -1, 0 or -1, ...},
240 unless the target has native support for the former but not the latter. */
242 (mult @0 VECTOR_CST@1)
243 (if (initializer_each_zero_or_onep (@1)
244 && !HONOR_SNANS (type)
245 && !HONOR_SIGNED_ZEROS (type))
246 (with { tree itype = FLOAT_TYPE_P (type) ? unsigned_type_for (type) : type; }
248 && (!VECTOR_MODE_P (TYPE_MODE (type))
249 || (VECTOR_MODE_P (TYPE_MODE (itype))
250 && optab_handler (and_optab,
251 TYPE_MODE (itype)) != CODE_FOR_nothing)))
252 (view_convert (bit_and:itype (view_convert @0)
253 (ne @1 { build_zero_cst (type); })))))))
255 (for cmp (gt ge lt le)
256 outp (convert convert negate negate)
257 outn (negate negate convert convert)
258 /* Transform X * (X > 0.0 ? 1.0 : -1.0) into abs(X). */
259 /* Transform X * (X >= 0.0 ? 1.0 : -1.0) into abs(X). */
260 /* Transform X * (X < 0.0 ? 1.0 : -1.0) into -abs(X). */
261 /* Transform X * (X <= 0.0 ? 1.0 : -1.0) into -abs(X). */
263 (mult:c @0 (cond (cmp @0 real_zerop) real_onep@1 real_minus_onep))
264 (if (!tree_expr_maybe_nan_p (@0) && !HONOR_SIGNED_ZEROS (type))
266 /* Transform X * (X > 0.0 ? -1.0 : 1.0) into -abs(X). */
267 /* Transform X * (X >= 0.0 ? -1.0 : 1.0) into -abs(X). */
268 /* Transform X * (X < 0.0 ? -1.0 : 1.0) into abs(X). */
269 /* Transform X * (X <= 0.0 ? -1.0 : 1.0) into abs(X). */
271 (mult:c @0 (cond (cmp @0 real_zerop) real_minus_onep real_onep@1))
272 (if (!tree_expr_maybe_nan_p (@0) && !HONOR_SIGNED_ZEROS (type))
275 /* Transform X * copysign (1.0, X) into abs(X). */
277 (mult:c @0 (COPYSIGN_ALL real_onep @0))
278 (if (!tree_expr_maybe_nan_p (@0) && !HONOR_SIGNED_ZEROS (type))
281 /* Transform X * copysign (1.0, -X) into -abs(X). */
283 (mult:c @0 (COPYSIGN_ALL real_onep (negate @0)))
284 (if (!tree_expr_maybe_nan_p (@0) && !HONOR_SIGNED_ZEROS (type))
287 /* Transform copysign (CST, X) into copysign (ABS(CST), X). */
289 (COPYSIGN_ALL REAL_CST@0 @1)
290 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@0)))
291 (COPYSIGN_ALL (negate @0) @1)))
293 /* X * 1, X / 1 -> X. */
294 (for op (mult trunc_div ceil_div floor_div round_div exact_div)
299 /* (A / (1 << B)) -> (A >> B).
300 Only for unsigned A. For signed A, this would not preserve rounding
302 For example: (-1 / ( 1 << B)) != -1 >> B.
303 Also also widening conversions, like:
304 (A / (unsigned long long) (1U << B)) -> (A >> B)
306 (A / (unsigned long long) (1 << B)) -> (A >> B).
307 If the left shift is signed, it can be done only if the upper bits
308 of A starting from shift's type sign bit are zero, as
309 (unsigned long long) (1 << 31) is -2147483648ULL, not 2147483648ULL,
310 so it is valid only if A >> 31 is zero. */
312 (trunc_div (convert?@0 @3) (convert2? (lshift integer_onep@1 @2)))
313 (if ((TYPE_UNSIGNED (type) || tree_expr_nonnegative_p (@0))
314 && (!VECTOR_TYPE_P (type)
315 || target_supports_op_p (type, RSHIFT_EXPR, optab_vector)
316 || target_supports_op_p (type, RSHIFT_EXPR, optab_scalar))
317 && (useless_type_conversion_p (type, TREE_TYPE (@1))
318 || (element_precision (type) >= element_precision (TREE_TYPE (@1))
319 && (TYPE_UNSIGNED (TREE_TYPE (@1))
320 || (element_precision (type)
321 == element_precision (TREE_TYPE (@1)))
322 || (INTEGRAL_TYPE_P (type)
323 && (tree_nonzero_bits (@0)
324 & wi::mask (element_precision (TREE_TYPE (@1)) - 1,
326 element_precision (type))) == 0)))))
327 (if (!VECTOR_TYPE_P (type)
328 && useless_type_conversion_p (TREE_TYPE (@3), TREE_TYPE (@1))
329 && element_precision (TREE_TYPE (@3)) < element_precision (type))
330 (convert (rshift @3 @2))
333 /* Preserve explicit divisions by 0: the C++ front-end wants to detect
334 undefined behavior in constexpr evaluation, and assuming that the division
335 traps enables better optimizations than these anyway. */
336 (for div (trunc_div ceil_div floor_div round_div exact_div)
337 /* 0 / X is always zero. */
339 (div integer_zerop@0 @1)
340 /* But not for 0 / 0 so that we can get the proper warnings and errors. */
341 (if (!integer_zerop (@1))
345 (div @0 integer_minus_onep@1)
346 (if (!TYPE_UNSIGNED (type))
348 /* X / bool_range_Y is X. */
351 (if (INTEGRAL_TYPE_P (type) && ssa_name_has_boolean_range (@1))
356 /* But not for 0 / 0 so that we can get the proper warnings and errors.
357 And not for _Fract types where we can't build 1. */
358 (if (!integer_zerop (@0) && !ALL_FRACT_MODE_P (TYPE_MODE (type)))
359 { build_one_cst (type); }))
360 /* X / abs (X) is X < 0 ? -1 : 1. */
363 (if (INTEGRAL_TYPE_P (type)
364 && TYPE_OVERFLOW_UNDEFINED (type))
365 (cond (lt @0 { build_zero_cst (type); })
366 { build_minus_one_cst (type); } { build_one_cst (type); })))
369 (div:C @0 (negate @0))
370 (if ((INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
371 && TYPE_OVERFLOW_UNDEFINED (type))
372 { build_minus_one_cst (type); })))
374 /* For unsigned integral types, FLOOR_DIV_EXPR is the same as
375 TRUNC_DIV_EXPR. Rewrite into the latter in this case. */
378 (if ((INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
379 && TYPE_UNSIGNED (type))
382 /* Combine two successive divisions. Note that combining ceil_div
383 and floor_div is trickier and combining round_div even more so. */
384 (for div (trunc_div exact_div)
386 (div (div@3 @0 INTEGER_CST@1) INTEGER_CST@2)
388 wi::overflow_type overflow;
389 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@2),
390 TYPE_SIGN (type), &overflow);
392 (if (div == EXACT_DIV_EXPR
393 || optimize_successive_divisions_p (@2, @3))
395 (div @0 { wide_int_to_tree (type, mul); })
396 (if (TYPE_UNSIGNED (type)
397 || mul != wi::min_value (TYPE_PRECISION (type), SIGNED))
398 { build_zero_cst (type); }))))))
400 /* Combine successive multiplications. Similar to above, but handling
401 overflow is different. */
403 (mult (mult @0 INTEGER_CST@1) INTEGER_CST@2)
405 wi::overflow_type overflow;
406 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@2),
407 TYPE_SIGN (type), &overflow);
409 /* Skip folding on overflow: the only special case is @1 * @2 == -INT_MIN,
410 otherwise undefined overflow implies that @0 must be zero. */
411 (if (!overflow || TYPE_OVERFLOW_WRAPS (type))
412 (mult @0 { wide_int_to_tree (type, mul); }))))
414 /* Optimize A / A to 1.0 if we don't care about
415 NaNs or Infinities. */
418 (if (FLOAT_TYPE_P (type)
419 && ! HONOR_NANS (type)
420 && ! HONOR_INFINITIES (type))
421 { build_one_cst (type); }))
423 /* Optimize -A / A to -1.0 if we don't care about
424 NaNs or Infinities. */
426 (rdiv:C @0 (negate @0))
427 (if (FLOAT_TYPE_P (type)
428 && ! HONOR_NANS (type)
429 && ! HONOR_INFINITIES (type))
430 { build_minus_one_cst (type); }))
432 /* PR71078: x / abs(x) -> copysign (1.0, x) */
434 (rdiv:C (convert? @0) (convert? (abs @0)))
435 (if (SCALAR_FLOAT_TYPE_P (type)
436 && ! HONOR_NANS (type)
437 && ! HONOR_INFINITIES (type))
439 (if (types_match (type, float_type_node))
440 (BUILT_IN_COPYSIGNF { build_one_cst (type); } (convert @0)))
441 (if (types_match (type, double_type_node))
442 (BUILT_IN_COPYSIGN { build_one_cst (type); } (convert @0)))
443 (if (types_match (type, long_double_type_node))
444 (BUILT_IN_COPYSIGNL { build_one_cst (type); } (convert @0))))))
446 /* In IEEE floating point, x/1 is not equivalent to x for snans. */
449 (if (!tree_expr_maybe_signaling_nan_p (@0))
452 /* In IEEE floating point, x/-1 is not equivalent to -x for snans. */
454 (rdiv @0 real_minus_onep)
455 (if (!tree_expr_maybe_signaling_nan_p (@0))
458 (if (flag_reciprocal_math)
459 /* Convert (A/B)/C to A/(B*C). */
461 (rdiv (rdiv:s @0 @1) @2)
462 (rdiv @0 (mult @1 @2)))
464 /* Canonicalize x / (C1 * y) to (x * C2) / y. */
466 (rdiv @0 (mult:s @1 REAL_CST@2))
468 { tree tem = const_binop (RDIV_EXPR, type, build_one_cst (type), @2); }
470 (rdiv (mult @0 { tem; } ) @1))))
472 /* Convert A/(B/C) to (A/B)*C */
474 (rdiv @0 (rdiv:s @1 @2))
475 (mult (rdiv @0 @1) @2)))
477 /* Simplify x / (- y) to -x / y. */
479 (rdiv @0 (negate @1))
480 (rdiv (negate @0) @1))
482 (if (flag_unsafe_math_optimizations)
483 /* Simplify (C / x op 0.0) to x op 0.0 for C != 0, C != Inf/Nan.
484 Since C / x may underflow to zero, do this only for unsafe math. */
485 (for op (lt le gt ge)
488 (op (rdiv REAL_CST@0 @1) real_zerop@2)
489 (if (!HONOR_SIGNED_ZEROS (@1) && !HONOR_INFINITIES (@1))
491 (if (real_less (&dconst0, TREE_REAL_CST_PTR (@0)))
493 /* For C < 0, use the inverted operator. */
494 (if (real_less (TREE_REAL_CST_PTR (@0), &dconst0))
497 /* Optimize (X & (-A)) / A where A is a power of 2, to X >> log2(A) */
498 (for div (trunc_div ceil_div floor_div round_div exact_div)
500 (div (convert? (bit_and @0 INTEGER_CST@1)) INTEGER_CST@2)
501 (if (integer_pow2p (@2)
502 && tree_int_cst_sgn (@2) > 0
503 && tree_nop_conversion_p (type, TREE_TYPE (@0))
504 && wi::to_wide (@2) + wi::to_wide (@1) == 0)
506 { build_int_cst (integer_type_node,
507 wi::exact_log2 (wi::to_wide (@2))); }))))
509 /* If ARG1 is a constant, we can convert this to a multiply by the
510 reciprocal. This does not have the same rounding properties,
511 so only do this if -freciprocal-math. We can actually
512 always safely do it if ARG1 is a power of two, but it's hard to
513 tell if it is or not in a portable manner. */
514 (for cst (REAL_CST COMPLEX_CST VECTOR_CST)
518 (if (flag_reciprocal_math
521 { tree tem = const_binop (RDIV_EXPR, type, build_one_cst (type), @1); }
523 (mult @0 { tem; } )))
524 (if (cst != COMPLEX_CST)
525 (with { tree inverse = exact_inverse (type, @1); }
527 (mult @0 { inverse; } ))))))))
529 (for mod (ceil_mod floor_mod round_mod trunc_mod)
530 /* 0 % X is always zero. */
532 (mod integer_zerop@0 @1)
533 /* But not for 0 % 0 so that we can get the proper warnings and errors. */
534 (if (!integer_zerop (@1))
536 /* X % 1 is always zero. */
538 (mod @0 integer_onep)
539 { build_zero_cst (type); })
540 /* X % -1 is zero. */
542 (mod @0 integer_minus_onep@1)
543 (if (!TYPE_UNSIGNED (type))
544 { build_zero_cst (type); }))
548 /* But not for 0 % 0 so that we can get the proper warnings and errors. */
549 (if (!integer_zerop (@0))
550 { build_zero_cst (type); }))
551 /* (X % Y) % Y is just X % Y. */
553 (mod (mod@2 @0 @1) @1)
555 /* From extract_muldiv_1: (X * C1) % C2 is zero if C1 is a multiple of C2. */
557 (mod (mult @0 INTEGER_CST@1) INTEGER_CST@2)
558 (if (ANY_INTEGRAL_TYPE_P (type)
559 && TYPE_OVERFLOW_UNDEFINED (type)
560 && wi::multiple_of_p (wi::to_wide (@1), wi::to_wide (@2),
562 { build_zero_cst (type); }))
563 /* For (X % C) == 0, if X is signed and C is power of 2, use unsigned
564 modulo and comparison, since it is simpler and equivalent. */
567 (cmp (mod @0 integer_pow2p@2) integer_zerop@1)
568 (if (!TYPE_UNSIGNED (TREE_TYPE (@0)))
569 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
570 (cmp (mod (convert:utype @0) (convert:utype @2)) (convert:utype @1)))))))
572 /* X % -C is the same as X % C. */
574 (trunc_mod @0 INTEGER_CST@1)
575 (if (TYPE_SIGN (type) == SIGNED
576 && !TREE_OVERFLOW (@1)
577 && wi::neg_p (wi::to_wide (@1))
578 && !TYPE_OVERFLOW_TRAPS (type)
579 /* Avoid this transformation if C is INT_MIN, i.e. C == -C. */
580 && !sign_bit_p (@1, @1))
581 (trunc_mod @0 (negate @1))))
583 /* X % -Y is the same as X % Y. */
585 (trunc_mod @0 (convert? (negate @1)))
586 (if (INTEGRAL_TYPE_P (type)
587 && !TYPE_UNSIGNED (type)
588 && !TYPE_OVERFLOW_TRAPS (type)
589 && tree_nop_conversion_p (type, TREE_TYPE (@1))
590 /* Avoid this transformation if X might be INT_MIN or
591 Y might be -1, because we would then change valid
592 INT_MIN % -(-1) into invalid INT_MIN % -1. */
593 && (expr_not_equal_to (@0, wi::to_wide (TYPE_MIN_VALUE (type)))
594 || expr_not_equal_to (@1, wi::minus_one (TYPE_PRECISION
596 (trunc_mod @0 (convert @1))))
598 /* X - (X / Y) * Y is the same as X % Y. */
600 (minus (convert1? @0) (convert2? (mult:c (trunc_div @@0 @@1) @1)))
601 (if (INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
602 (convert (trunc_mod @0 @1))))
604 /* Optimize TRUNC_MOD_EXPR by a power of two into a BIT_AND_EXPR,
605 i.e. "X % C" into "X & (C - 1)", if X and C are positive.
606 Also optimize A % (C << N) where C is a power of 2,
607 to A & ((C << N) - 1).
608 Also optimize "A shift (B % C)", if C is a power of 2, to
609 "A shift (B & (C - 1))". SHIFT operation include "<<" and ">>"
610 and assume (B % C) is nonnegative as shifts negative values would
612 (match (power_of_two_cand @1)
614 (match (power_of_two_cand @1)
615 (lshift INTEGER_CST@1 @2))
616 (for mod (trunc_mod floor_mod)
617 (for shift (lshift rshift)
619 (shift @0 (mod @1 (power_of_two_cand@2 @3)))
620 (if (integer_pow2p (@3) && tree_int_cst_sgn (@3) > 0)
621 (shift @0 (bit_and @1 (minus @2 { build_int_cst (TREE_TYPE (@2),
624 (mod @0 (convert? (power_of_two_cand@1 @2)))
625 (if ((TYPE_UNSIGNED (type) || tree_expr_nonnegative_p (@0))
626 /* Allow any integral conversions of the divisor, except
627 conversion from narrower signed to wider unsigned type
628 where if @1 would be negative power of two, the divisor
629 would not be a power of two. */
630 && INTEGRAL_TYPE_P (type)
631 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
632 && (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@1))
633 || TYPE_UNSIGNED (TREE_TYPE (@1))
634 || !TYPE_UNSIGNED (type))
635 && integer_pow2p (@2) && tree_int_cst_sgn (@2) > 0)
636 (with { tree utype = TREE_TYPE (@1);
637 if (!TYPE_OVERFLOW_WRAPS (utype))
638 utype = unsigned_type_for (utype); }
639 (bit_and @0 (convert (minus (convert:utype @1)
640 { build_one_cst (utype); })))))))
642 /* Simplify (unsigned t * 2)/2 -> unsigned t & 0x7FFFFFFF. */
644 (trunc_div (mult @0 integer_pow2p@1) @1)
645 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
646 (bit_and @0 { wide_int_to_tree
647 (type, wi::mask (TYPE_PRECISION (type)
648 - wi::exact_log2 (wi::to_wide (@1)),
649 false, TYPE_PRECISION (type))); })))
651 /* Simplify (unsigned t / 2) * 2 -> unsigned t & ~1. */
653 (mult (trunc_div @0 integer_pow2p@1) @1)
654 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
655 (bit_and @0 (negate @1))))
657 /* Simplify (t * 2) / 2) -> t. */
658 (for div (trunc_div ceil_div floor_div round_div exact_div)
660 (div (mult:c @0 @1) @1)
661 (if (ANY_INTEGRAL_TYPE_P (type))
662 (if (TYPE_OVERFLOW_UNDEFINED (type))
667 bool overflowed = true;
668 value_range vr0, vr1;
669 if (INTEGRAL_TYPE_P (type)
670 && get_global_range_query ()->range_of_expr (vr0, @0)
671 && get_global_range_query ()->range_of_expr (vr1, @1)
672 && vr0.kind () == VR_RANGE
673 && vr1.kind () == VR_RANGE)
675 wide_int wmin0 = vr0.lower_bound ();
676 wide_int wmax0 = vr0.upper_bound ();
677 wide_int wmin1 = vr1.lower_bound ();
678 wide_int wmax1 = vr1.upper_bound ();
679 /* If the multiplication can't overflow/wrap around, then
680 it can be optimized too. */
681 wi::overflow_type min_ovf, max_ovf;
682 wi::mul (wmin0, wmin1, TYPE_SIGN (type), &min_ovf);
683 wi::mul (wmax0, wmax1, TYPE_SIGN (type), &max_ovf);
684 if (min_ovf == wi::OVF_NONE && max_ovf == wi::OVF_NONE)
686 wi::mul (wmin0, wmax1, TYPE_SIGN (type), &min_ovf);
687 wi::mul (wmax0, wmin1, TYPE_SIGN (type), &max_ovf);
688 if (min_ovf == wi::OVF_NONE && max_ovf == wi::OVF_NONE)
699 /* Simplify cos(-x) and cos(|x|) -> cos(x). Similarly for cosh. */
704 /* Simplify pow(-x, y) and pow(|x|,y) -> pow(x,y) if y is an even integer. */
707 (pows (op @0) REAL_CST@1)
708 (with { HOST_WIDE_INT n; }
709 (if (real_isinteger (&TREE_REAL_CST (@1), &n) && (n & 1) == 0)
711 /* Likewise for powi. */
714 (pows (op @0) INTEGER_CST@1)
715 (if ((wi::to_wide (@1) & 1) == 0)
717 /* Strip negate and abs from both operands of hypot. */
725 /* copysign(-x, y) and copysign(abs(x), y) -> copysign(x, y). */
726 (for copysigns (COPYSIGN_ALL)
728 (copysigns (op @0) @1)
731 /* abs(x)*abs(x) -> x*x. Should be valid for all types. */
736 /* Convert absu(x)*absu(x) -> x*x. */
738 (mult (absu@1 @0) @1)
739 (mult (convert@2 @0) @2))
741 /* cos(copysign(x, y)) -> cos(x). Similarly for cosh. */
745 (coss (copysigns @0 @1))
748 /* pow(copysign(x, y), z) -> pow(x, z) if z is an even integer. */
752 (pows (copysigns @0 @2) REAL_CST@1)
753 (with { HOST_WIDE_INT n; }
754 (if (real_isinteger (&TREE_REAL_CST (@1), &n) && (n & 1) == 0)
756 /* Likewise for powi. */
760 (pows (copysigns @0 @2) INTEGER_CST@1)
761 (if ((wi::to_wide (@1) & 1) == 0)
766 /* hypot(copysign(x, y), z) -> hypot(x, z). */
768 (hypots (copysigns @0 @1) @2)
770 /* hypot(x, copysign(y, z)) -> hypot(x, y). */
772 (hypots @0 (copysigns @1 @2))
775 /* copysign(x, CST) -> [-]abs (x). */
776 (for copysigns (COPYSIGN_ALL)
778 (copysigns @0 REAL_CST@1)
779 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
783 /* copysign(copysign(x, y), z) -> copysign(x, z). */
784 (for copysigns (COPYSIGN_ALL)
786 (copysigns (copysigns @0 @1) @2)
789 /* copysign(x,y)*copysign(x,y) -> x*x. */
790 (for copysigns (COPYSIGN_ALL)
792 (mult (copysigns@2 @0 @1) @2)
795 /* ccos(-x) -> ccos(x). Similarly for ccosh. */
796 (for ccoss (CCOS CCOSH)
801 /* cabs(-x) and cos(conj(x)) -> cabs(x). */
802 (for ops (conj negate)
808 /* Fold (a * (1 << b)) into (a << b) */
810 (mult:c @0 (convert? (lshift integer_onep@1 @2)))
811 (if (! FLOAT_TYPE_P (type)
812 && tree_nop_conversion_p (type, TREE_TYPE (@1)))
815 /* Fold (1 << (C - x)) where C = precision(type) - 1
816 into ((1 << C) >> x). */
818 (lshift integer_onep@0 (minus@1 INTEGER_CST@2 @3))
819 (if (INTEGRAL_TYPE_P (type)
820 && wi::eq_p (wi::to_wide (@2), TYPE_PRECISION (type) - 1)
822 (if (TYPE_UNSIGNED (type))
823 (rshift (lshift @0 @2) @3)
825 { tree utype = unsigned_type_for (type); }
826 (convert (rshift (lshift (convert:utype @0) @2) @3))))))
828 /* Fold (C1/X)*C2 into (C1*C2)/X. */
830 (mult (rdiv@3 REAL_CST@0 @1) REAL_CST@2)
831 (if (flag_associative_math
834 { tree tem = const_binop (MULT_EXPR, type, @0, @2); }
836 (rdiv { tem; } @1)))))
838 /* Simplify ~X & X as zero. */
840 (bit_and:c (convert? @0) (convert? (bit_not @0)))
841 { build_zero_cst (type); })
843 /* PR71636: Transform x & ((1U << b) - 1) -> x & ~(~0U << b); */
845 (bit_and:c @0 (plus:s (lshift:s integer_onep @1) integer_minus_onep))
846 (if (TYPE_UNSIGNED (type))
847 (bit_and @0 (bit_not (lshift { build_all_ones_cst (type); } @1)))))
849 (for bitop (bit_and bit_ior)
851 /* PR35691: Transform
852 (x == 0 & y == 0) -> (x | typeof(x)(y)) == 0.
853 (x != 0 | y != 0) -> (x | typeof(x)(y)) != 0. */
855 (bitop (cmp @0 integer_zerop@2) (cmp @1 integer_zerop))
856 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
857 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
858 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1)))
859 (cmp (bit_ior @0 (convert @1)) @2)))
861 (x == -1 & y == -1) -> (x & typeof(x)(y)) == -1.
862 (x != -1 | y != -1) -> (x & typeof(x)(y)) != -1. */
864 (bitop (cmp @0 integer_all_onesp@2) (cmp @1 integer_all_onesp))
865 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
866 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
867 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1)))
868 (cmp (bit_and @0 (convert @1)) @2))))
870 /* Fold (A & ~B) - (A & B) into (A ^ B) - B. */
872 (minus (bit_and:cs @0 (bit_not @1)) (bit_and:cs @0 @1))
873 (minus (bit_xor @0 @1) @1))
875 (minus (bit_and:s @0 INTEGER_CST@2) (bit_and:s @0 INTEGER_CST@1))
876 (if (~wi::to_wide (@2) == wi::to_wide (@1))
877 (minus (bit_xor @0 @1) @1)))
879 /* Fold (A & B) - (A & ~B) into B - (A ^ B). */
881 (minus (bit_and:cs @0 @1) (bit_and:cs @0 (bit_not @1)))
882 (minus @1 (bit_xor @0 @1)))
884 /* Simplify (X & ~Y) |^+ (~X & Y) -> X ^ Y. */
885 (for op (bit_ior bit_xor plus)
887 (op (bit_and:c @0 (bit_not @1)) (bit_and:c (bit_not @0) @1))
890 (op:c (bit_and @0 INTEGER_CST@2) (bit_and (bit_not @0) INTEGER_CST@1))
891 (if (~wi::to_wide (@2) == wi::to_wide (@1))
894 /* PR53979: Transform ((a ^ b) | a) -> (a | b) */
896 (bit_ior:c (bit_xor:c @0 @1) @0)
899 /* (a & ~b) | (a ^ b) --> a ^ b */
901 (bit_ior:c (bit_and:c @0 (bit_not @1)) (bit_xor:c@2 @0 @1))
904 /* (a & ~b) ^ ~a --> ~(a & b) */
906 (bit_xor:c (bit_and:cs @0 (bit_not @1)) (bit_not @0))
907 (bit_not (bit_and @0 @1)))
909 /* (~a & b) ^ a --> (a | b) */
911 (bit_xor:c (bit_and:cs (bit_not @0) @1) @0)
914 /* (a | b) & ~(a ^ b) --> a & b */
916 (bit_and:c (bit_ior @0 @1) (bit_not (bit_xor:c @0 @1)))
919 /* a | ~(a ^ b) --> a | ~b */
921 (bit_ior:c @0 (bit_not:s (bit_xor:c @0 @1)))
922 (bit_ior @0 (bit_not @1)))
924 /* (a | b) | (a &^ b) --> a | b */
925 (for op (bit_and bit_xor)
927 (bit_ior:c (bit_ior@2 @0 @1) (op:c @0 @1))
930 /* (a & b) | ~(a ^ b) --> ~(a ^ b) */
932 (bit_ior:c (bit_and:c @0 @1) (bit_not@2 (bit_xor @0 @1)))
935 /* ~(~a & b) --> a | ~b */
937 (bit_not (bit_and:cs (bit_not @0) @1))
938 (bit_ior @0 (bit_not @1)))
940 /* ~(~a | b) --> a & ~b */
942 (bit_not (bit_ior:cs (bit_not @0) @1))
943 (bit_and @0 (bit_not @1)))
945 /* (a ^ b) & ((b ^ c) ^ a) --> (a ^ b) & ~c */
947 (bit_and:c (bit_xor:c@3 @0 @1) (bit_xor:cs (bit_xor:cs @1 @2) @0))
948 (bit_and @3 (bit_not @2)))
950 /* (a ^ b) | ((b ^ c) ^ a) --> (a ^ b) | c */
952 (bit_ior:c (bit_xor:c@3 @0 @1) (bit_xor:c (bit_xor:c @1 @2) @0))
956 /* (~X | C) ^ D -> (X | C) ^ (~D ^ C) if (~D ^ C) can be simplified. */
958 (bit_xor:c (bit_ior:cs (bit_not:s @0) @1) @2)
959 (bit_xor (bit_ior @0 @1) (bit_xor! (bit_not! @2) @1)))
961 /* (~X & C) ^ D -> (X & C) ^ (D ^ C) if (D ^ C) can be simplified. */
963 (bit_xor:c (bit_and:cs (bit_not:s @0) @1) @2)
964 (bit_xor (bit_and @0 @1) (bit_xor! @2 @1)))
966 /* Simplify (~X & Y) to X ^ Y if we know that (X & ~Y) is 0. */
968 (bit_and (bit_not SSA_NAME@0) INTEGER_CST@1)
969 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
970 && wi::bit_and_not (get_nonzero_bits (@0), wi::to_wide (@1)) == 0)
974 /* For constants M and N, if M == (1LL << cst) - 1 && (N & M) == M,
975 ((A & N) + B) & M -> (A + B) & M
976 Similarly if (N & M) == 0,
977 ((A | N) + B) & M -> (A + B) & M
978 and for - instead of + (or unary - instead of +)
979 and/or ^ instead of |.
980 If B is constant and (B & M) == 0, fold into A & M. */
982 (for bitop (bit_and bit_ior bit_xor)
984 (bit_and (op:s (bitop:s@0 @3 INTEGER_CST@4) @1) INTEGER_CST@2)
987 tree utype = fold_bit_and_mask (TREE_TYPE (@0), @2, op, @0, bitop,
988 @3, @4, @1, ERROR_MARK, NULL_TREE,
991 (convert (bit_and (op (convert:utype { pmop[0]; })
992 (convert:utype { pmop[1]; }))
993 (convert:utype @2))))))
995 (bit_and (op:s @0 (bitop:s@1 @3 INTEGER_CST@4)) INTEGER_CST@2)
998 tree utype = fold_bit_and_mask (TREE_TYPE (@0), @2, op, @0, ERROR_MARK,
999 NULL_TREE, NULL_TREE, @1, bitop, @3,
1002 (convert (bit_and (op (convert:utype { pmop[0]; })
1003 (convert:utype { pmop[1]; }))
1004 (convert:utype @2)))))))
1006 (bit_and (op:s @0 @1) INTEGER_CST@2)
1009 tree utype = fold_bit_and_mask (TREE_TYPE (@0), @2, op, @0, ERROR_MARK,
1010 NULL_TREE, NULL_TREE, @1, ERROR_MARK,
1011 NULL_TREE, NULL_TREE, pmop); }
1013 (convert (bit_and (op (convert:utype { pmop[0]; })
1014 (convert:utype { pmop[1]; }))
1015 (convert:utype @2)))))))
1016 (for bitop (bit_and bit_ior bit_xor)
1018 (bit_and (negate:s (bitop:s@0 @2 INTEGER_CST@3)) INTEGER_CST@1)
1021 tree utype = fold_bit_and_mask (TREE_TYPE (@0), @1, NEGATE_EXPR, @0,
1022 bitop, @2, @3, NULL_TREE, ERROR_MARK,
1023 NULL_TREE, NULL_TREE, pmop); }
1025 (convert (bit_and (negate (convert:utype { pmop[0]; }))
1026 (convert:utype @1)))))))
1028 /* X % Y is smaller than Y. */
1031 (cmp (trunc_mod @0 @1) @1)
1032 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
1033 { constant_boolean_node (cmp == LT_EXPR, type); })))
1036 (cmp @1 (trunc_mod @0 @1))
1037 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
1038 { constant_boolean_node (cmp == GT_EXPR, type); })))
1042 (bit_ior @0 integer_all_onesp@1)
1047 (bit_ior @0 integer_zerop)
1052 (bit_and @0 integer_zerop@1)
1058 (for op (bit_ior bit_xor plus)
1060 (op:c (convert? @0) (convert? (bit_not @0)))
1061 (convert { build_all_ones_cst (TREE_TYPE (@0)); })))
1066 { build_zero_cst (type); })
1068 /* Canonicalize X ^ ~0 to ~X. */
1070 (bit_xor @0 integer_all_onesp@1)
1075 (bit_and @0 integer_all_onesp)
1078 /* x & x -> x, x | x -> x */
1079 (for bitop (bit_and bit_ior)
1084 /* x & C -> x if we know that x & ~C == 0. */
1087 (bit_and SSA_NAME@0 INTEGER_CST@1)
1088 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1089 && wi::bit_and_not (get_nonzero_bits (@0), wi::to_wide (@1)) == 0)
1093 /* ~(~X - Y) -> X + Y and ~(~X + Y) -> X - Y. */
1095 (bit_not (minus (bit_not @0) @1))
1098 (bit_not (plus:c (bit_not @0) @1))
1101 /* ~(X - Y) -> ~X + Y. */
1103 (bit_not (minus:s @0 @1))
1104 (plus (bit_not @0) @1))
1106 (bit_not (plus:s @0 INTEGER_CST@1))
1107 (if ((INTEGRAL_TYPE_P (type)
1108 && TYPE_UNSIGNED (type))
1109 || (!TYPE_OVERFLOW_SANITIZED (type)
1110 && may_negate_without_overflow_p (@1)))
1111 (plus (bit_not @0) { const_unop (NEGATE_EXPR, type, @1); })))
1114 /* ~X + Y -> (Y - X) - 1. */
1116 (plus:c (bit_not @0) @1)
1117 (if (ANY_INTEGRAL_TYPE_P (type)
1118 && TYPE_OVERFLOW_WRAPS (type)
1119 /* -1 - X is folded to ~X, so we'd recurse endlessly. */
1120 && !integer_all_onesp (@1))
1121 (plus (minus @1 @0) { build_minus_one_cst (type); })
1122 (if (INTEGRAL_TYPE_P (type)
1123 && TREE_CODE (@1) == INTEGER_CST
1124 && wi::to_wide (@1) != wi::min_value (TYPE_PRECISION (type),
1126 (minus (plus @1 { build_minus_one_cst (type); }) @0))))
1128 /* ~(X >> Y) -> ~X >> Y if ~X can be simplified. */
1130 (bit_not (rshift:s @0 @1))
1131 (if (!TYPE_UNSIGNED (TREE_TYPE (@0)))
1132 (rshift (bit_not! @0) @1)
1133 /* For logical right shifts, this is possible only if @0 doesn't
1134 have MSB set and the logical right shift is changed into
1135 arithmetic shift. */
1136 (if (!wi::neg_p (tree_nonzero_bits (@0)))
1137 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
1138 (convert (rshift (bit_not! (convert:stype @0)) @1))))))
1141 /* x + (x & 1) -> (x + 1) & ~1 */
1143 (plus:c @0 (bit_and:s @0 integer_onep@1))
1144 (bit_and (plus @0 @1) (bit_not @1)))
1146 /* x & ~(x & y) -> x & ~y */
1147 /* x | ~(x | y) -> x | ~y */
1148 (for bitop (bit_and bit_ior)
1150 (bitop:c @0 (bit_not (bitop:cs @0 @1)))
1151 (bitop @0 (bit_not @1))))
1153 /* (~x & y) | ~(x | y) -> ~x */
1155 (bit_ior:c (bit_and:c (bit_not@2 @0) @1) (bit_not (bit_ior:c @0 @1)))
1158 /* (x | y) ^ (x | ~y) -> ~x */
1160 (bit_xor:c (bit_ior:c @0 @1) (bit_ior:c @0 (bit_not @1)))
1163 /* (x & y) | ~(x | y) -> ~(x ^ y) */
1165 (bit_ior:c (bit_and:s @0 @1) (bit_not:s (bit_ior:s @0 @1)))
1166 (bit_not (bit_xor @0 @1)))
1168 /* (~x | y) ^ (x ^ y) -> x | ~y */
1170 (bit_xor:c (bit_ior:cs (bit_not @0) @1) (bit_xor:s @0 @1))
1171 (bit_ior @0 (bit_not @1)))
1173 /* (x ^ y) | ~(x | y) -> ~(x & y) */
1175 (bit_ior:c (bit_xor:s @0 @1) (bit_not:s (bit_ior:s @0 @1)))
1176 (bit_not (bit_and @0 @1)))
1178 /* (x | y) & ~x -> y & ~x */
1179 /* (x & y) | ~x -> y | ~x */
1180 (for bitop (bit_and bit_ior)
1181 rbitop (bit_ior bit_and)
1183 (bitop:c (rbitop:c @0 @1) (bit_not@2 @0))
1186 /* (x & y) ^ (x | y) -> x ^ y */
1188 (bit_xor:c (bit_and @0 @1) (bit_ior @0 @1))
1191 /* (x ^ y) ^ (x | y) -> x & y */
1193 (bit_xor:c (bit_xor @0 @1) (bit_ior @0 @1))
1196 /* (x & y) + (x ^ y) -> x | y */
1197 /* (x & y) | (x ^ y) -> x | y */
1198 /* (x & y) ^ (x ^ y) -> x | y */
1199 (for op (plus bit_ior bit_xor)
1201 (op:c (bit_and @0 @1) (bit_xor @0 @1))
1204 /* (x & y) + (x | y) -> x + y */
1206 (plus:c (bit_and @0 @1) (bit_ior @0 @1))
1209 /* (x + y) - (x | y) -> x & y */
1211 (minus (plus @0 @1) (bit_ior @0 @1))
1212 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
1213 && !TYPE_SATURATING (type))
1216 /* (x + y) - (x & y) -> x | y */
1218 (minus (plus @0 @1) (bit_and @0 @1))
1219 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
1220 && !TYPE_SATURATING (type))
1223 /* (x | y) - y -> (x & ~y) */
1225 (minus (bit_ior:cs @0 @1) @1)
1226 (bit_and @0 (bit_not @1)))
1228 /* (x | y) - (x ^ y) -> x & y */
1230 (minus (bit_ior @0 @1) (bit_xor @0 @1))
1233 /* (x | y) - (x & y) -> x ^ y */
1235 (minus (bit_ior @0 @1) (bit_and @0 @1))
1238 /* (x | y) & ~(x & y) -> x ^ y */
1240 (bit_and:c (bit_ior @0 @1) (bit_not (bit_and @0 @1)))
1243 /* (x | y) & (~x ^ y) -> x & y */
1245 (bit_and:c (bit_ior:c @0 @1) (bit_xor:c @1 (bit_not @0)))
1248 /* (~x | y) & (x | ~y) -> ~(x ^ y) */
1250 (bit_and (bit_ior:cs (bit_not @0) @1) (bit_ior:cs @0 (bit_not @1)))
1251 (bit_not (bit_xor @0 @1)))
1253 /* (~x | y) ^ (x | ~y) -> x ^ y */
1255 (bit_xor (bit_ior:c (bit_not @0) @1) (bit_ior:c @0 (bit_not @1)))
1258 /* ((x & y) - (x | y)) - 1 -> ~(x ^ y) */
1260 (plus (nop_convert1? (minus@2 (nop_convert2? (bit_and:c @0 @1))
1261 (nop_convert2? (bit_ior @0 @1))))
1263 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
1264 && !TYPE_SATURATING (type) && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2))
1265 && !TYPE_OVERFLOW_TRAPS (TREE_TYPE (@2))
1266 && !TYPE_SATURATING (TREE_TYPE (@2)))
1267 (bit_not (convert (bit_xor @0 @1)))))
1269 (minus (nop_convert1? (plus@2 (nop_convert2? (bit_and:c @0 @1))
1271 (nop_convert3? (bit_ior @0 @1)))
1272 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
1273 && !TYPE_SATURATING (type) && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2))
1274 && !TYPE_OVERFLOW_TRAPS (TREE_TYPE (@2))
1275 && !TYPE_SATURATING (TREE_TYPE (@2)))
1276 (bit_not (convert (bit_xor @0 @1)))))
1278 (minus (nop_convert1? (bit_and @0 @1))
1279 (nop_convert2? (plus@2 (nop_convert3? (bit_ior:c @0 @1))
1281 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
1282 && !TYPE_SATURATING (type) && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2))
1283 && !TYPE_OVERFLOW_TRAPS (TREE_TYPE (@2))
1284 && !TYPE_SATURATING (TREE_TYPE (@2)))
1285 (bit_not (convert (bit_xor @0 @1)))))
1287 /* ~x & ~y -> ~(x | y)
1288 ~x | ~y -> ~(x & y) */
1289 (for op (bit_and bit_ior)
1290 rop (bit_ior bit_and)
1292 (op (convert1? (bit_not @0)) (convert2? (bit_not @1)))
1293 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
1294 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
1295 (bit_not (rop (convert @0) (convert @1))))))
1297 /* If we are XORing or adding two BIT_AND_EXPR's, both of which are and'ing
1298 with a constant, and the two constants have no bits in common,
1299 we should treat this as a BIT_IOR_EXPR since this may produce more
1301 (for op (bit_xor plus)
1303 (op (convert1? (bit_and@4 @0 INTEGER_CST@1))
1304 (convert2? (bit_and@5 @2 INTEGER_CST@3)))
1305 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
1306 && tree_nop_conversion_p (type, TREE_TYPE (@2))
1307 && (wi::to_wide (@1) & wi::to_wide (@3)) == 0)
1308 (bit_ior (convert @4) (convert @5)))))
1310 /* (X | Y) ^ X -> Y & ~ X*/
1312 (bit_xor:c (convert1? (bit_ior:c @@0 @1)) (convert2? @0))
1313 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1314 (convert (bit_and @1 (bit_not @0)))))
1316 /* Convert ~X ^ ~Y to X ^ Y. */
1318 (bit_xor (convert1? (bit_not @0)) (convert2? (bit_not @1)))
1319 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
1320 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
1321 (bit_xor (convert @0) (convert @1))))
1323 /* Convert ~X ^ C to X ^ ~C. */
1325 (bit_xor (convert? (bit_not @0)) INTEGER_CST@1)
1326 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1327 (bit_xor (convert @0) (bit_not @1))))
1329 /* Fold (X & Y) ^ Y and (X ^ Y) & Y as ~X & Y. */
1330 (for opo (bit_and bit_xor)
1331 opi (bit_xor bit_and)
1333 (opo:c (opi:cs @0 @1) @1)
1334 (bit_and (bit_not @0) @1)))
1336 /* Given a bit-wise operation CODE applied to ARG0 and ARG1, see if both
1337 operands are another bit-wise operation with a common input. If so,
1338 distribute the bit operations to save an operation and possibly two if
1339 constants are involved. For example, convert
1340 (A | B) & (A | C) into A | (B & C)
1341 Further simplification will occur if B and C are constants. */
1342 (for op (bit_and bit_ior bit_xor)
1343 rop (bit_ior bit_and bit_and)
1345 (op (convert? (rop:c @@0 @1)) (convert? (rop:c @0 @2)))
1346 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
1347 && tree_nop_conversion_p (type, TREE_TYPE (@2)))
1348 (rop (convert @0) (op (convert @1) (convert @2))))))
1350 /* Some simple reassociation for bit operations, also handled in reassoc. */
1351 /* (X & Y) & Y -> X & Y
1352 (X | Y) | Y -> X | Y */
1353 (for op (bit_and bit_ior)
1355 (op:c (convert1?@2 (op:c @0 @@1)) (convert2? @1))
1357 /* (X ^ Y) ^ Y -> X */
1359 (bit_xor:c (convert1? (bit_xor:c @0 @@1)) (convert2? @1))
1361 /* (X & Y) & (X & Z) -> (X & Y) & Z
1362 (X | Y) | (X | Z) -> (X | Y) | Z */
1363 (for op (bit_and bit_ior)
1365 (op (convert1?@3 (op:c@4 @0 @1)) (convert2?@5 (op:c@6 @0 @2)))
1366 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
1367 && tree_nop_conversion_p (type, TREE_TYPE (@2)))
1368 (if (single_use (@5) && single_use (@6))
1369 (op @3 (convert @2))
1370 (if (single_use (@3) && single_use (@4))
1371 (op (convert @1) @5))))))
1372 /* (X ^ Y) ^ (X ^ Z) -> Y ^ Z */
1374 (bit_xor (convert1? (bit_xor:c @0 @1)) (convert2? (bit_xor:c @0 @2)))
1375 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
1376 && tree_nop_conversion_p (type, TREE_TYPE (@2)))
1377 (bit_xor (convert @1) (convert @2))))
1379 /* Convert abs (abs (X)) into abs (X).
1380 also absu (absu (X)) into absu (X). */
1386 (absu (convert@2 (absu@1 @0)))
1387 (if (tree_nop_conversion_p (TREE_TYPE (@2), TREE_TYPE (@1)))
1390 /* Convert abs[u] (-X) -> abs[u] (X). */
1399 /* Convert abs[u] (X) where X is nonnegative -> (X). */
1401 (abs tree_expr_nonnegative_p@0)
1405 (absu tree_expr_nonnegative_p@0)
1408 /* Simplify (-(X < 0) | 1) * X into abs (X). */
1410 (mult:c (bit_ior (negate (convert? (lt @0 integer_zerop))) integer_onep) @0)
1411 (if (INTEGRAL_TYPE_P (type) && !TYPE_UNSIGNED (type))
1414 /* Similarly (-(X < 0) | 1U) * X into absu (X). */
1416 (mult:c (bit_ior (nop_convert (negate (convert? (lt @0 integer_zerop))))
1417 integer_onep) (nop_convert @0))
1418 (if (INTEGRAL_TYPE_P (type)
1419 && TYPE_UNSIGNED (type)
1420 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
1421 && !TYPE_UNSIGNED (TREE_TYPE (@0)))
1424 /* A few cases of fold-const.c negate_expr_p predicate. */
1425 (match negate_expr_p
1427 (if ((INTEGRAL_TYPE_P (type)
1428 && TYPE_UNSIGNED (type))
1429 || (!TYPE_OVERFLOW_SANITIZED (type)
1430 && may_negate_without_overflow_p (t)))))
1431 (match negate_expr_p
1433 (match negate_expr_p
1435 (if (!TYPE_OVERFLOW_SANITIZED (type))))
1436 (match negate_expr_p
1438 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (t)))))
1439 /* VECTOR_CST handling of non-wrapping types would recurse in unsupported
1441 (match negate_expr_p
1443 (if (FLOAT_TYPE_P (TREE_TYPE (type)) || TYPE_OVERFLOW_WRAPS (type))))
1444 (match negate_expr_p
1446 (if ((ANY_INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_WRAPS (type))
1447 || (FLOAT_TYPE_P (type)
1448 && !HONOR_SIGN_DEPENDENT_ROUNDING (type)
1449 && !HONOR_SIGNED_ZEROS (type)))))
1451 /* (-A) * (-B) -> A * B */
1453 (mult:c (convert1? (negate @0)) (convert2? negate_expr_p@1))
1454 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
1455 && tree_nop_conversion_p (type, TREE_TYPE (@1)))
1456 (mult (convert @0) (convert (negate @1)))))
1458 /* -(A + B) -> (-B) - A. */
1460 (negate (plus:c @0 negate_expr_p@1))
1461 (if (!HONOR_SIGN_DEPENDENT_ROUNDING (type)
1462 && !HONOR_SIGNED_ZEROS (type))
1463 (minus (negate @1) @0)))
1465 /* -(A - B) -> B - A. */
1467 (negate (minus @0 @1))
1468 (if ((ANY_INTEGRAL_TYPE_P (type) && !TYPE_OVERFLOW_SANITIZED (type))
1469 || (FLOAT_TYPE_P (type)
1470 && !HONOR_SIGN_DEPENDENT_ROUNDING (type)
1471 && !HONOR_SIGNED_ZEROS (type)))
1474 (negate (pointer_diff @0 @1))
1475 (if (TYPE_OVERFLOW_UNDEFINED (type))
1476 (pointer_diff @1 @0)))
1478 /* A - B -> A + (-B) if B is easily negatable. */
1480 (minus @0 negate_expr_p@1)
1481 (if (!FIXED_POINT_TYPE_P (type))
1482 (plus @0 (negate @1))))
1484 /* Try to fold (type) X op CST -> (type) (X op ((type-x) CST))
1486 For bitwise binary operations apply operand conversions to the
1487 binary operation result instead of to the operands. This allows
1488 to combine successive conversions and bitwise binary operations.
1489 We combine the above two cases by using a conditional convert. */
1490 (for bitop (bit_and bit_ior bit_xor)
1492 (bitop (convert@2 @0) (convert?@3 @1))
1493 (if (((TREE_CODE (@1) == INTEGER_CST
1494 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
1495 && int_fits_type_p (@1, TREE_TYPE (@0)))
1496 || types_match (@0, @1))
1497 /* ??? This transform conflicts with fold-const.c doing
1498 Convert (T)(x & c) into (T)x & (T)c, if c is an integer
1499 constants (if x has signed type, the sign bit cannot be set
1500 in c). This folds extension into the BIT_AND_EXPR.
1501 Restrict it to GIMPLE to avoid endless recursions. */
1502 && (bitop != BIT_AND_EXPR || GIMPLE)
1503 && (/* That's a good idea if the conversion widens the operand, thus
1504 after hoisting the conversion the operation will be narrower. */
1505 TYPE_PRECISION (TREE_TYPE (@0)) < TYPE_PRECISION (type)
1506 /* It's also a good idea if the conversion is to a non-integer
1508 || GET_MODE_CLASS (TYPE_MODE (type)) != MODE_INT
1509 /* Or if the precision of TO is not the same as the precision
1511 || !type_has_mode_precision_p (type)
1512 /* In GIMPLE, getting rid of 2 conversions for one new results
1515 && TREE_CODE (@1) != INTEGER_CST
1516 && tree_nop_conversion_p (type, TREE_TYPE (@0))
1518 && single_use (@3))))
1519 (convert (bitop @0 (convert @1)))))
1520 /* In GIMPLE, getting rid of 2 conversions for one new results
1523 (convert (bitop:cs@2 (nop_convert:s @0) @1))
1525 && TREE_CODE (@1) != INTEGER_CST
1526 && tree_nop_conversion_p (type, TREE_TYPE (@2))
1527 && types_match (type, @0))
1528 (bitop @0 (convert @1)))))
1530 (for bitop (bit_and bit_ior)
1531 rbitop (bit_ior bit_and)
1532 /* (x | y) & x -> x */
1533 /* (x & y) | x -> x */
1535 (bitop:c (rbitop:c @0 @1) @0)
1537 /* (~x | y) & x -> x & y */
1538 /* (~x & y) | x -> x | y */
1540 (bitop:c (rbitop:c (bit_not @0) @1) @0)
1543 /* ((x | y) & z) | x -> (z & y) | x */
1545 (bit_ior:c (bit_and:cs (bit_ior:cs @0 @1) @2) @0)
1546 (bit_ior (bit_and @2 @1) @0))
1548 /* (x | CST1) & CST2 -> (x & CST2) | (CST1 & CST2) */
1550 (bit_and (bit_ior @0 CONSTANT_CLASS_P@1) CONSTANT_CLASS_P@2)
1551 (bit_ior (bit_and @0 @2) (bit_and @1 @2)))
1553 /* Combine successive equal operations with constants. */
1554 (for bitop (bit_and bit_ior bit_xor)
1556 (bitop (bitop @0 CONSTANT_CLASS_P@1) CONSTANT_CLASS_P@2)
1557 (if (!CONSTANT_CLASS_P (@0))
1558 /* This is the canonical form regardless of whether (bitop @1 @2) can be
1559 folded to a constant. */
1560 (bitop @0 (bitop @1 @2))
1561 /* In this case we have three constants and (bitop @0 @1) doesn't fold
1562 to a constant. This can happen if @0 or @1 is a POLY_INT_CST and if
1563 the values involved are such that the operation can't be decided at
1564 compile time. Try folding one of @0 or @1 with @2 to see whether
1565 that combination can be decided at compile time.
1567 Keep the existing form if both folds fail, to avoid endless
1569 (with { tree cst1 = const_binop (bitop, type, @0, @2); }
1571 (bitop @1 { cst1; })
1572 (with { tree cst2 = const_binop (bitop, type, @1, @2); }
1574 (bitop @0 { cst2; }))))))))
1576 /* Try simple folding for X op !X, and X op X with the help
1577 of the truth_valued_p and logical_inverted_value predicates. */
1578 (match truth_valued_p
1580 (if (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) == 1)))
1581 (for op (tcc_comparison truth_and truth_andif truth_or truth_orif truth_xor)
1582 (match truth_valued_p
1584 (match truth_valued_p
1587 (match (logical_inverted_value @0)
1589 (match (logical_inverted_value @0)
1590 (bit_not truth_valued_p@0))
1591 (match (logical_inverted_value @0)
1592 (eq @0 integer_zerop))
1593 (match (logical_inverted_value @0)
1594 (ne truth_valued_p@0 integer_truep))
1595 (match (logical_inverted_value @0)
1596 (bit_xor truth_valued_p@0 integer_truep))
1600 (bit_and:c @0 (logical_inverted_value @0))
1601 { build_zero_cst (type); })
1602 /* X | !X and X ^ !X -> 1, , if X is truth-valued. */
1603 (for op (bit_ior bit_xor)
1605 (op:c truth_valued_p@0 (logical_inverted_value @0))
1606 { constant_boolean_node (true, type); }))
1607 /* X ==/!= !X is false/true. */
1610 (op:c truth_valued_p@0 (logical_inverted_value @0))
1611 { constant_boolean_node (op == NE_EXPR ? true : false, type); }))
1615 (bit_not (bit_not @0))
1618 /* Convert ~ (-A) to A - 1. */
1620 (bit_not (convert? (negate @0)))
1621 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
1622 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
1623 (convert (minus @0 { build_each_one_cst (TREE_TYPE (@0)); }))))
1625 /* Convert - (~A) to A + 1. */
1627 (negate (nop_convert? (bit_not @0)))
1628 (plus (view_convert @0) { build_each_one_cst (type); }))
1630 /* Convert ~ (A - 1) or ~ (A + -1) to -A. */
1632 (bit_not (convert? (minus @0 integer_each_onep)))
1633 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
1634 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
1635 (convert (negate @0))))
1637 (bit_not (convert? (plus @0 integer_all_onesp)))
1638 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
1639 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
1640 (convert (negate @0))))
1642 /* Part of convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */
1644 (bit_not (convert? (bit_xor @0 INTEGER_CST@1)))
1645 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1646 (convert (bit_xor @0 (bit_not @1)))))
1648 (bit_not (convert? (bit_xor:c (bit_not @0) @1)))
1649 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1650 (convert (bit_xor @0 @1))))
1652 /* Otherwise prefer ~(X ^ Y) to ~X ^ Y as more canonical. */
1654 (bit_xor:c (nop_convert?:s (bit_not:s @0)) @1)
1655 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1656 (bit_not (bit_xor (view_convert @0) @1))))
1658 /* (x & ~m) | (y & m) -> ((x ^ y) & m) ^ x */
1660 (bit_ior:c (bit_and:cs @0 (bit_not @2)) (bit_and:cs @1 @2))
1661 (bit_xor (bit_and (bit_xor @0 @1) @2) @0))
1663 /* Fold A - (A & B) into ~B & A. */
1665 (minus (convert1? @0) (convert2?:s (bit_and:cs @@0 @1)))
1666 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
1667 && tree_nop_conversion_p (type, TREE_TYPE (@1)))
1668 (convert (bit_and (bit_not @1) @0))))
1670 /* (m1 CMP m2) * d -> (m1 CMP m2) ? d : 0 */
1671 (for cmp (gt lt ge le)
1673 (mult (convert (cmp @0 @1)) @2)
1674 (if (GIMPLE || !TREE_SIDE_EFFECTS (@2))
1675 (cond (cmp @0 @1) @2 { build_zero_cst (type); }))))
1677 /* For integral types with undefined overflow and C != 0 fold
1678 x * C EQ/NE y * C into x EQ/NE y. */
1681 (cmp (mult:c @0 @1) (mult:c @2 @1))
1682 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
1683 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
1684 && tree_expr_nonzero_p (@1))
1687 /* For integral types with wrapping overflow and C odd fold
1688 x * C EQ/NE y * C into x EQ/NE y. */
1691 (cmp (mult @0 INTEGER_CST@1) (mult @2 @1))
1692 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
1693 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))
1694 && (TREE_INT_CST_LOW (@1) & 1) != 0)
1697 /* For integral types with undefined overflow and C != 0 fold
1698 x * C RELOP y * C into:
1700 x RELOP y for nonnegative C
1701 y RELOP x for negative C */
1702 (for cmp (lt gt le ge)
1704 (cmp (mult:c @0 @1) (mult:c @2 @1))
1705 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
1706 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
1707 (if (tree_expr_nonnegative_p (@1) && tree_expr_nonzero_p (@1))
1709 (if (TREE_CODE (@1) == INTEGER_CST
1710 && wi::neg_p (wi::to_wide (@1), TYPE_SIGN (TREE_TYPE (@1))))
1713 /* (X - 1U) <= INT_MAX-1U into (int) X > 0. */
1717 (cmp (plus @0 integer_minus_onep@1) INTEGER_CST@2)
1718 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1719 && TYPE_UNSIGNED (TREE_TYPE (@0))
1720 && TYPE_PRECISION (TREE_TYPE (@0)) > 1
1721 && (wi::to_wide (@2)
1722 == wi::max_value (TYPE_PRECISION (TREE_TYPE (@0)), SIGNED) - 1))
1723 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
1724 (icmp (convert:stype @0) { build_int_cst (stype, 0); })))))
1726 /* X / 4 < Y / 4 iff X < Y when the division is known to be exact. */
1727 (for cmp (simple_comparison)
1729 (cmp (convert?@3 (exact_div @0 INTEGER_CST@2)) (convert? (exact_div @1 @2)))
1730 (if (element_precision (@3) >= element_precision (@0)
1731 && types_match (@0, @1))
1732 (if (wi::lt_p (wi::to_wide (@2), 0, TYPE_SIGN (TREE_TYPE (@2))))
1733 (if (!TYPE_UNSIGNED (TREE_TYPE (@3)))
1735 (if (tree_expr_nonzero_p (@0) && tree_expr_nonzero_p (@1))
1738 tree utype = unsigned_type_for (TREE_TYPE (@0));
1740 (cmp (convert:utype @1) (convert:utype @0)))))
1741 (if (wi::gt_p (wi::to_wide (@2), 1, TYPE_SIGN (TREE_TYPE (@2))))
1742 (if (TYPE_UNSIGNED (TREE_TYPE (@0)) || !TYPE_UNSIGNED (TREE_TYPE (@3)))
1746 tree utype = unsigned_type_for (TREE_TYPE (@0));
1748 (cmp (convert:utype @0) (convert:utype @1)))))))))
1750 /* X / C1 op C2 into a simple range test. */
1751 (for cmp (simple_comparison)
1753 (cmp (trunc_div:s @0 INTEGER_CST@1) INTEGER_CST@2)
1754 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1755 && integer_nonzerop (@1)
1756 && !TREE_OVERFLOW (@1)
1757 && !TREE_OVERFLOW (@2))
1758 (with { tree lo, hi; bool neg_overflow;
1759 enum tree_code code = fold_div_compare (cmp, @1, @2, &lo, &hi,
1762 (if (code == LT_EXPR || code == GE_EXPR)
1763 (if (TREE_OVERFLOW (lo))
1764 { build_int_cst (type, (code == LT_EXPR) ^ neg_overflow); }
1765 (if (code == LT_EXPR)
1768 (if (code == LE_EXPR || code == GT_EXPR)
1769 (if (TREE_OVERFLOW (hi))
1770 { build_int_cst (type, (code == LE_EXPR) ^ neg_overflow); }
1771 (if (code == LE_EXPR)
1775 { build_int_cst (type, code == NE_EXPR); })
1776 (if (code == EQ_EXPR && !hi)
1778 (if (code == EQ_EXPR && !lo)
1780 (if (code == NE_EXPR && !hi)
1782 (if (code == NE_EXPR && !lo)
1785 { build_range_check (UNKNOWN_LOCATION, type, @0, code == EQ_EXPR,
1789 tree etype = range_check_type (TREE_TYPE (@0));
1792 hi = fold_convert (etype, hi);
1793 lo = fold_convert (etype, lo);
1794 hi = const_binop (MINUS_EXPR, etype, hi, lo);
1797 (if (etype && hi && !TREE_OVERFLOW (hi))
1798 (if (code == EQ_EXPR)
1799 (le (minus (convert:etype @0) { lo; }) { hi; })
1800 (gt (minus (convert:etype @0) { lo; }) { hi; })))))))))
1802 /* X + Z < Y + Z is the same as X < Y when there is no overflow. */
1803 (for op (lt le ge gt)
1805 (op (plus:c @0 @2) (plus:c @1 @2))
1806 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1807 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
1809 /* For equality and subtraction, this is also true with wrapping overflow. */
1810 (for op (eq ne minus)
1812 (op (plus:c @0 @2) (plus:c @1 @2))
1813 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1814 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
1815 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
1818 /* X - Z < Y - Z is the same as X < Y when there is no overflow. */
1819 (for op (lt le ge gt)
1821 (op (minus @0 @2) (minus @1 @2))
1822 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1823 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
1825 /* For equality and subtraction, this is also true with wrapping overflow. */
1826 (for op (eq ne minus)
1828 (op (minus @0 @2) (minus @1 @2))
1829 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1830 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
1831 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
1833 /* And for pointers... */
1834 (for op (simple_comparison)
1836 (op (pointer_diff@3 @0 @2) (pointer_diff @1 @2))
1837 (if (!TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
1840 (minus (pointer_diff@3 @0 @2) (pointer_diff @1 @2))
1841 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@3))
1842 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
1843 (pointer_diff @0 @1)))
1845 /* Z - X < Z - Y is the same as Y < X when there is no overflow. */
1846 (for op (lt le ge gt)
1848 (op (minus @2 @0) (minus @2 @1))
1849 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1850 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
1852 /* For equality and subtraction, this is also true with wrapping overflow. */
1853 (for op (eq ne minus)
1855 (op (minus @2 @0) (minus @2 @1))
1856 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1857 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
1858 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
1860 /* And for pointers... */
1861 (for op (simple_comparison)
1863 (op (pointer_diff@3 @2 @0) (pointer_diff @2 @1))
1864 (if (!TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
1867 (minus (pointer_diff@3 @2 @0) (pointer_diff @2 @1))
1868 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@3))
1869 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
1870 (pointer_diff @1 @0)))
1872 /* X + Y < Y is the same as X < 0 when there is no overflow. */
1873 (for op (lt le gt ge)
1875 (op:c (plus:c@2 @0 @1) @1)
1876 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1877 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
1878 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0))
1879 && (CONSTANT_CLASS_P (@0) || single_use (@2)))
1880 (op @0 { build_zero_cst (TREE_TYPE (@0)); }))))
1881 /* For equality, this is also true with wrapping overflow. */
1884 (op:c (nop_convert?@3 (plus:c@2 @0 (convert1? @1))) (convert2? @1))
1885 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1886 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
1887 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
1888 && (CONSTANT_CLASS_P (@0) || (single_use (@2) && single_use (@3)))
1889 && tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@2))
1890 && tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@1)))
1891 (op @0 { build_zero_cst (TREE_TYPE (@0)); })))
1893 (op:c (nop_convert?@3 (pointer_plus@2 (convert1? @0) @1)) (convert2? @0))
1894 (if (tree_nop_conversion_p (TREE_TYPE (@2), TREE_TYPE (@0))
1895 && tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0))
1896 && (CONSTANT_CLASS_P (@1) || (single_use (@2) && single_use (@3))))
1897 (op @1 { build_zero_cst (TREE_TYPE (@1)); }))))
1899 /* X - Y < X is the same as Y > 0 when there is no overflow.
1900 For equality, this is also true with wrapping overflow. */
1901 (for op (simple_comparison)
1903 (op:c @0 (minus@2 @0 @1))
1904 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
1905 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
1906 || ((op == EQ_EXPR || op == NE_EXPR)
1907 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
1908 && (CONSTANT_CLASS_P (@1) || single_use (@2)))
1909 (op @1 { build_zero_cst (TREE_TYPE (@1)); }))))
1912 (X / Y) == 0 -> X < Y if X, Y are unsigned.
1913 (X / Y) != 0 -> X >= Y, if X, Y are unsigned. */
1917 (cmp (trunc_div @0 @1) integer_zerop)
1918 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
1919 /* Complex ==/!= is allowed, but not </>=. */
1920 && TREE_CODE (TREE_TYPE (@0)) != COMPLEX_TYPE
1921 && (VECTOR_TYPE_P (type) || !VECTOR_TYPE_P (TREE_TYPE (@0))))
1924 /* X == C - X can never be true if C is odd. */
1927 (cmp:c (convert? @0) (convert1? (minus INTEGER_CST@1 (convert2? @0))))
1928 (if (TREE_INT_CST_LOW (@1) & 1)
1929 { constant_boolean_node (cmp == NE_EXPR, type); })))
1931 /* Arguments on which one can call get_nonzero_bits to get the bits
1933 (match with_possible_nonzero_bits
1935 (match with_possible_nonzero_bits
1937 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))))
1938 /* Slightly extended version, do not make it recursive to keep it cheap. */
1939 (match (with_possible_nonzero_bits2 @0)
1940 with_possible_nonzero_bits@0)
1941 (match (with_possible_nonzero_bits2 @0)
1942 (bit_and:c with_possible_nonzero_bits@0 @2))
1944 /* Same for bits that are known to be set, but we do not have
1945 an equivalent to get_nonzero_bits yet. */
1946 (match (with_certain_nonzero_bits2 @0)
1948 (match (with_certain_nonzero_bits2 @0)
1949 (bit_ior @1 INTEGER_CST@0))
1951 /* X == C (or X & Z == Y | C) is impossible if ~nonzero(X) & C != 0. */
1954 (cmp:c (with_possible_nonzero_bits2 @0) (with_certain_nonzero_bits2 @1))
1955 (if (wi::bit_and_not (wi::to_wide (@1), get_nonzero_bits (@0)) != 0)
1956 { constant_boolean_node (cmp == NE_EXPR, type); })))
1958 /* ((X inner_op C0) outer_op C1)
1959 With X being a tree where value_range has reasoned certain bits to always be
1960 zero throughout its computed value range,
1961 inner_op = {|,^}, outer_op = {|,^} and inner_op != outer_op
1962 where zero_mask has 1's for all bits that are sure to be 0 in
1964 if (inner_op == '^') C0 &= ~C1;
1965 if ((C0 & ~zero_mask) == 0) then emit (X outer_op (C0 outer_op C1)
1966 if ((C1 & ~zero_mask) == 0) then emit (X inner_op (C0 outer_op C1)
1968 (for inner_op (bit_ior bit_xor)
1969 outer_op (bit_xor bit_ior)
1972 (inner_op:s @2 INTEGER_CST@0) INTEGER_CST@1)
1976 wide_int zero_mask_not;
1980 if (TREE_CODE (@2) == SSA_NAME)
1981 zero_mask_not = get_nonzero_bits (@2);
1985 if (inner_op == BIT_XOR_EXPR)
1987 C0 = wi::bit_and_not (wi::to_wide (@0), wi::to_wide (@1));
1988 cst_emit = C0 | wi::to_wide (@1);
1992 C0 = wi::to_wide (@0);
1993 cst_emit = C0 ^ wi::to_wide (@1);
1996 (if (!fail && (C0 & zero_mask_not) == 0)
1997 (outer_op @2 { wide_int_to_tree (type, cst_emit); })
1998 (if (!fail && (wi::to_wide (@1) & zero_mask_not) == 0)
1999 (inner_op @2 { wide_int_to_tree (type, cst_emit); }))))))
2001 /* Associate (p +p off1) +p off2 as (p +p (off1 + off2)). */
2003 (pointer_plus (pointer_plus:s @0 @1) @3)
2004 (pointer_plus @0 (plus @1 @3)))
2010 tem4 = (unsigned long) tem3;
2015 (pointer_plus @0 (convert?@2 (minus@3 (convert @1) (convert @0))))
2016 /* Conditionally look through a sign-changing conversion. */
2017 (if (TYPE_PRECISION (TREE_TYPE (@2)) == TYPE_PRECISION (TREE_TYPE (@3))
2018 && ((GIMPLE && useless_type_conversion_p (type, TREE_TYPE (@1)))
2019 || (GENERIC && type == TREE_TYPE (@1))))
2022 (pointer_plus @0 (convert?@2 (pointer_diff@3 @1 @@0)))
2023 (if (TYPE_PRECISION (TREE_TYPE (@2)) >= TYPE_PRECISION (TREE_TYPE (@3)))
2027 tem = (sizetype) ptr;
2031 and produce the simpler and easier to analyze with respect to alignment
2032 ... = ptr & ~algn; */
2034 (pointer_plus @0 (negate (bit_and (convert @0) INTEGER_CST@1)))
2035 (with { tree algn = wide_int_to_tree (TREE_TYPE (@0), ~wi::to_wide (@1)); }
2036 (bit_and @0 { algn; })))
2038 /* Try folding difference of addresses. */
2040 (minus (convert ADDR_EXPR@0) (convert @1))
2041 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2042 (with { poly_int64 diff; }
2043 (if (ptr_difference_const (@0, @1, &diff))
2044 { build_int_cst_type (type, diff); }))))
2046 (minus (convert @0) (convert ADDR_EXPR@1))
2047 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2048 (with { poly_int64 diff; }
2049 (if (ptr_difference_const (@0, @1, &diff))
2050 { build_int_cst_type (type, diff); }))))
2052 (pointer_diff (convert?@2 ADDR_EXPR@0) (convert1?@3 @1))
2053 (if (tree_nop_conversion_p (TREE_TYPE(@2), TREE_TYPE (@0))
2054 && tree_nop_conversion_p (TREE_TYPE(@3), TREE_TYPE (@1)))
2055 (with { poly_int64 diff; }
2056 (if (ptr_difference_const (@0, @1, &diff))
2057 { build_int_cst_type (type, diff); }))))
2059 (pointer_diff (convert?@2 @0) (convert1?@3 ADDR_EXPR@1))
2060 (if (tree_nop_conversion_p (TREE_TYPE(@2), TREE_TYPE (@0))
2061 && tree_nop_conversion_p (TREE_TYPE(@3), TREE_TYPE (@1)))
2062 (with { poly_int64 diff; }
2063 (if (ptr_difference_const (@0, @1, &diff))
2064 { build_int_cst_type (type, diff); }))))
2066 /* Canonicalize (T *)(ptr - ptr-cst) to &MEM[ptr + -ptr-cst]. */
2068 (convert (pointer_diff @0 INTEGER_CST@1))
2069 (if (POINTER_TYPE_P (type))
2070 { build_fold_addr_expr_with_type
2071 (build2 (MEM_REF, char_type_node, @0,
2072 wide_int_to_tree (ptr_type_node, wi::neg (wi::to_wide (@1)))),
2075 /* If arg0 is derived from the address of an object or function, we may
2076 be able to fold this expression using the object or function's
2079 (bit_and (convert? @0) INTEGER_CST@1)
2080 (if (POINTER_TYPE_P (TREE_TYPE (@0))
2081 && tree_nop_conversion_p (type, TREE_TYPE (@0)))
2085 unsigned HOST_WIDE_INT bitpos;
2086 get_pointer_alignment_1 (@0, &align, &bitpos);
2088 (if (wi::ltu_p (wi::to_wide (@1), align / BITS_PER_UNIT))
2089 { wide_int_to_tree (type, (wi::to_wide (@1)
2090 & (bitpos / BITS_PER_UNIT))); }))))
2094 (if (INTEGRAL_TYPE_P (type)
2095 && wi::eq_p (wi::to_wide (t), wi::min_value (type)))))
2099 (if (INTEGRAL_TYPE_P (type)
2100 && wi::eq_p (wi::to_wide (t), wi::max_value (type)))))
2102 /* x > y && x != XXX_MIN --> x > y
2103 x > y && x == XXX_MIN --> false . */
2106 (bit_and:c (gt:c@2 @0 @1) (eqne @0 min_value))
2108 (if (eqne == EQ_EXPR)
2109 { constant_boolean_node (false, type); })
2110 (if (eqne == NE_EXPR)
2114 /* x < y && x != XXX_MAX --> x < y
2115 x < y && x == XXX_MAX --> false. */
2118 (bit_and:c (lt:c@2 @0 @1) (eqne @0 max_value))
2120 (if (eqne == EQ_EXPR)
2121 { constant_boolean_node (false, type); })
2122 (if (eqne == NE_EXPR)
2126 /* x <= y && x == XXX_MIN --> x == XXX_MIN. */
2128 (bit_and:c (le:c @0 @1) (eq@2 @0 min_value))
2131 /* x >= y && x == XXX_MAX --> x == XXX_MAX. */
2133 (bit_and:c (ge:c @0 @1) (eq@2 @0 max_value))
2136 /* x > y || x != XXX_MIN --> x != XXX_MIN. */
2138 (bit_ior:c (gt:c @0 @1) (ne@2 @0 min_value))
2141 /* x <= y || x != XXX_MIN --> true. */
2143 (bit_ior:c (le:c @0 @1) (ne @0 min_value))
2144 { constant_boolean_node (true, type); })
2146 /* x <= y || x == XXX_MIN --> x <= y. */
2148 (bit_ior:c (le:c@2 @0 @1) (eq @0 min_value))
2151 /* x < y || x != XXX_MAX --> x != XXX_MAX. */
2153 (bit_ior:c (lt:c @0 @1) (ne@2 @0 max_value))
2156 /* x >= y || x != XXX_MAX --> true
2157 x >= y || x == XXX_MAX --> x >= y. */
2160 (bit_ior:c (ge:c@2 @0 @1) (eqne @0 max_value))
2162 (if (eqne == EQ_EXPR)
2164 (if (eqne == NE_EXPR)
2165 { constant_boolean_node (true, type); }))))
2167 /* y == XXX_MIN || x < y --> x <= y - 1 */
2169 (bit_ior:c (eq:s @1 min_value) (lt:s @0 @1))
2170 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2171 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
2172 (le @0 (minus @1 { build_int_cst (TREE_TYPE (@1), 1); }))))
2174 /* y != XXX_MIN && x >= y --> x > y - 1 */
2176 (bit_and:c (ne:s @1 min_value) (ge:s @0 @1))
2177 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2178 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
2179 (gt @0 (minus @1 { build_int_cst (TREE_TYPE (@1), 1); }))))
2181 /* Convert (X == CST1) && (X OP2 CST2) to a known value
2182 based on CST1 OP2 CST2. Similarly for (X != CST1). */
2185 (for code2 (eq ne lt gt le ge)
2187 (bit_and:c (code1@3 @0 INTEGER_CST@1) (code2@4 @0 INTEGER_CST@2))
2190 int cmp = tree_int_cst_compare (@1, @2);
2194 case EQ_EXPR: val = (cmp == 0); break;
2195 case NE_EXPR: val = (cmp != 0); break;
2196 case LT_EXPR: val = (cmp < 0); break;
2197 case GT_EXPR: val = (cmp > 0); break;
2198 case LE_EXPR: val = (cmp <= 0); break;
2199 case GE_EXPR: val = (cmp >= 0); break;
2200 default: gcc_unreachable ();
2204 (if (code1 == EQ_EXPR && val) @3)
2205 (if (code1 == EQ_EXPR && !val) { constant_boolean_node (false, type); })
2206 (if (code1 == NE_EXPR && !val) @4))))))
2208 /* Convert (X OP1 CST1) && (X OP2 CST2). */
2210 (for code1 (lt le gt ge)
2211 (for code2 (lt le gt ge)
2213 (bit_and (code1:c@3 @0 INTEGER_CST@1) (code2:c@4 @0 INTEGER_CST@2))
2216 int cmp = tree_int_cst_compare (@1, @2);
2219 /* Choose the more restrictive of two < or <= comparisons. */
2220 (if ((code1 == LT_EXPR || code1 == LE_EXPR)
2221 && (code2 == LT_EXPR || code2 == LE_EXPR))
2222 (if ((cmp < 0) || (cmp == 0 && code1 == LT_EXPR))
2225 /* Likewise chose the more restrictive of two > or >= comparisons. */
2226 (if ((code1 == GT_EXPR || code1 == GE_EXPR)
2227 && (code2 == GT_EXPR || code2 == GE_EXPR))
2228 (if ((cmp > 0) || (cmp == 0 && code1 == GT_EXPR))
2231 /* Check for singleton ranges. */
2233 && ((code1 == LE_EXPR && code2 == GE_EXPR)
2234 || (code1 == GE_EXPR && code2 == LE_EXPR)))
2236 /* Check for disjoint ranges. */
2238 && (code1 == LT_EXPR || code1 == LE_EXPR)
2239 && (code2 == GT_EXPR || code2 == GE_EXPR))
2240 { constant_boolean_node (false, type); })
2242 && (code1 == GT_EXPR || code1 == GE_EXPR)
2243 && (code2 == LT_EXPR || code2 == LE_EXPR))
2244 { constant_boolean_node (false, type); })
2247 /* Convert (X == CST1) || (X OP2 CST2) to a known value
2248 based on CST1 OP2 CST2. Similarly for (X != CST1). */
2251 (for code2 (eq ne lt gt le ge)
2253 (bit_ior:c (code1@3 @0 INTEGER_CST@1) (code2@4 @0 INTEGER_CST@2))
2256 int cmp = tree_int_cst_compare (@1, @2);
2260 case EQ_EXPR: val = (cmp == 0); break;
2261 case NE_EXPR: val = (cmp != 0); break;
2262 case LT_EXPR: val = (cmp < 0); break;
2263 case GT_EXPR: val = (cmp > 0); break;
2264 case LE_EXPR: val = (cmp <= 0); break;
2265 case GE_EXPR: val = (cmp >= 0); break;
2266 default: gcc_unreachable ();
2270 (if (code1 == EQ_EXPR && val) @4)
2271 (if (code1 == NE_EXPR && val) { constant_boolean_node (true, type); })
2272 (if (code1 == NE_EXPR && !val) @3))))))
2274 /* Convert (X OP1 CST1) || (X OP2 CST2). */
2276 (for code1 (lt le gt ge)
2277 (for code2 (lt le gt ge)
2279 (bit_ior (code1@3 @0 INTEGER_CST@1) (code2@4 @0 INTEGER_CST@2))
2282 int cmp = tree_int_cst_compare (@1, @2);
2285 /* Choose the more restrictive of two < or <= comparisons. */
2286 (if ((code1 == LT_EXPR || code1 == LE_EXPR)
2287 && (code2 == LT_EXPR || code2 == LE_EXPR))
2288 (if ((cmp < 0) || (cmp == 0 && code1 == LT_EXPR))
2291 /* Likewise chose the more restrictive of two > or >= comparisons. */
2292 (if ((code1 == GT_EXPR || code1 == GE_EXPR)
2293 && (code2 == GT_EXPR || code2 == GE_EXPR))
2294 (if ((cmp > 0) || (cmp == 0 && code1 == GT_EXPR))
2297 /* Check for singleton ranges. */
2299 && ((code1 == LT_EXPR && code2 == GT_EXPR)
2300 || (code1 == GT_EXPR && code2 == LT_EXPR)))
2302 /* Check for disjoint ranges. */
2304 && (code1 == LT_EXPR || code1 == LE_EXPR)
2305 && (code2 == GT_EXPR || code2 == GE_EXPR))
2306 { constant_boolean_node (true, type); })
2308 && (code1 == GT_EXPR || code1 == GE_EXPR)
2309 && (code2 == LT_EXPR || code2 == LE_EXPR))
2310 { constant_boolean_node (true, type); })
2313 /* We can't reassociate at all for saturating types. */
2314 (if (!TYPE_SATURATING (type))
2316 /* Contract negates. */
2317 /* A + (-B) -> A - B */
2319 (plus:c @0 (convert? (negate @1)))
2320 /* Apply STRIP_NOPS on the negate. */
2321 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
2322 && !TYPE_OVERFLOW_SANITIZED (type))
2326 if (INTEGRAL_TYPE_P (type)
2327 && TYPE_OVERFLOW_WRAPS (type) != TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
2328 t1 = TYPE_OVERFLOW_WRAPS (type) ? type : TREE_TYPE (@1);
2330 (convert (minus (convert:t1 @0) (convert:t1 @1))))))
2331 /* A - (-B) -> A + B */
2333 (minus @0 (convert? (negate @1)))
2334 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
2335 && !TYPE_OVERFLOW_SANITIZED (type))
2339 if (INTEGRAL_TYPE_P (type)
2340 && TYPE_OVERFLOW_WRAPS (type) != TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
2341 t1 = TYPE_OVERFLOW_WRAPS (type) ? type : TREE_TYPE (@1);
2343 (convert (plus (convert:t1 @0) (convert:t1 @1))))))
2345 Sign-extension is ok except for INT_MIN, which thankfully cannot
2346 happen without overflow. */
2348 (negate (convert (negate @1)))
2349 (if (INTEGRAL_TYPE_P (type)
2350 && (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@1))
2351 || (!TYPE_UNSIGNED (TREE_TYPE (@1))
2352 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))))
2353 && !TYPE_OVERFLOW_SANITIZED (type)
2354 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@1)))
2357 (negate (convert negate_expr_p@1))
2358 (if (SCALAR_FLOAT_TYPE_P (type)
2359 && ((DECIMAL_FLOAT_TYPE_P (type)
2360 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@1))
2361 && TYPE_PRECISION (type) >= TYPE_PRECISION (TREE_TYPE (@1)))
2362 || !HONOR_SIGN_DEPENDENT_ROUNDING (type)))
2363 (convert (negate @1))))
2365 (negate (nop_convert? (negate @1)))
2366 (if (!TYPE_OVERFLOW_SANITIZED (type)
2367 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@1)))
2370 /* We can't reassociate floating-point unless -fassociative-math
2371 or fixed-point plus or minus because of saturation to +-Inf. */
2372 (if ((!FLOAT_TYPE_P (type) || flag_associative_math)
2373 && !FIXED_POINT_TYPE_P (type))
2375 /* Match patterns that allow contracting a plus-minus pair
2376 irrespective of overflow issues. */
2377 /* (A +- B) - A -> +- B */
2378 /* (A +- B) -+ B -> A */
2379 /* A - (A +- B) -> -+ B */
2380 /* A +- (B -+ A) -> +- B */
2382 (minus (nop_convert1? (plus:c (nop_convert2? @0) @1)) @0)
2385 (minus (nop_convert1? (minus (nop_convert2? @0) @1)) @0)
2386 (if (!ANY_INTEGRAL_TYPE_P (type)
2387 || TYPE_OVERFLOW_WRAPS (type))
2388 (negate (view_convert @1))
2389 (view_convert (negate @1))))
2391 (plus:c (nop_convert1? (minus @0 (nop_convert2? @1))) @1)
2394 (minus @0 (nop_convert1? (plus:c (nop_convert2? @0) @1)))
2395 (if (!ANY_INTEGRAL_TYPE_P (type)
2396 || TYPE_OVERFLOW_WRAPS (type))
2397 (negate (view_convert @1))
2398 (view_convert (negate @1))))
2400 (minus @0 (nop_convert1? (minus (nop_convert2? @0) @1)))
2402 /* (A +- B) + (C - A) -> C +- B */
2403 /* (A + B) - (A - C) -> B + C */
2404 /* More cases are handled with comparisons. */
2406 (plus:c (plus:c @0 @1) (minus @2 @0))
2409 (plus:c (minus @0 @1) (minus @2 @0))
2412 (plus:c (pointer_diff @0 @1) (pointer_diff @2 @0))
2413 (if (TYPE_OVERFLOW_UNDEFINED (type)
2414 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0)))
2415 (pointer_diff @2 @1)))
2417 (minus (plus:c @0 @1) (minus @0 @2))
2420 /* (A +- CST1) +- CST2 -> A + CST3
2421 Use view_convert because it is safe for vectors and equivalent for
2423 (for outer_op (plus minus)
2424 (for inner_op (plus minus)
2425 neg_inner_op (minus plus)
2427 (outer_op (nop_convert? (inner_op @0 CONSTANT_CLASS_P@1))
2429 /* If one of the types wraps, use that one. */
2430 (if (!ANY_INTEGRAL_TYPE_P (type) || TYPE_OVERFLOW_WRAPS (type))
2431 /* If all 3 captures are CONSTANT_CLASS_P, punt, as we might recurse
2432 forever if something doesn't simplify into a constant. */
2433 (if (!CONSTANT_CLASS_P (@0))
2434 (if (outer_op == PLUS_EXPR)
2435 (plus (view_convert @0) (inner_op @2 (view_convert @1)))
2436 (minus (view_convert @0) (neg_inner_op @2 (view_convert @1)))))
2437 (if (!ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2438 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
2439 (if (outer_op == PLUS_EXPR)
2440 (view_convert (plus @0 (inner_op (view_convert @2) @1)))
2441 (view_convert (minus @0 (neg_inner_op (view_convert @2) @1))))
2442 /* If the constant operation overflows we cannot do the transform
2443 directly as we would introduce undefined overflow, for example
2444 with (a - 1) + INT_MIN. */
2445 (if (types_match (type, @0))
2446 (with { tree cst = const_binop (outer_op == inner_op
2447 ? PLUS_EXPR : MINUS_EXPR,
2449 (if (cst && !TREE_OVERFLOW (cst))
2450 (inner_op @0 { cst; } )
2451 /* X+INT_MAX+1 is X-INT_MIN. */
2452 (if (INTEGRAL_TYPE_P (type) && cst
2453 && wi::to_wide (cst) == wi::min_value (type))
2454 (neg_inner_op @0 { wide_int_to_tree (type, wi::to_wide (cst)); })
2455 /* Last resort, use some unsigned type. */
2456 (with { tree utype = unsigned_type_for (type); }
2458 (view_convert (inner_op
2459 (view_convert:utype @0)
2461 { drop_tree_overflow (cst); }))))))))))))))
2463 /* (CST1 - A) +- CST2 -> CST3 - A */
2464 (for outer_op (plus minus)
2466 (outer_op (nop_convert? (minus CONSTANT_CLASS_P@1 @0)) CONSTANT_CLASS_P@2)
2467 /* If one of the types wraps, use that one. */
2468 (if (!ANY_INTEGRAL_TYPE_P (type) || TYPE_OVERFLOW_WRAPS (type))
2469 /* If all 3 captures are CONSTANT_CLASS_P, punt, as we might recurse
2470 forever if something doesn't simplify into a constant. */
2471 (if (!CONSTANT_CLASS_P (@0))
2472 (minus (outer_op (view_convert @1) @2) (view_convert @0)))
2473 (if (!ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2474 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
2475 (view_convert (minus (outer_op @1 (view_convert @2)) @0))
2476 (if (types_match (type, @0))
2477 (with { tree cst = const_binop (outer_op, type, @1, @2); }
2478 (if (cst && !TREE_OVERFLOW (cst))
2479 (minus { cst; } @0))))))))
2481 /* CST1 - (CST2 - A) -> CST3 + A
2482 Use view_convert because it is safe for vectors and equivalent for
2485 (minus CONSTANT_CLASS_P@1 (nop_convert? (minus CONSTANT_CLASS_P@2 @0)))
2486 /* If one of the types wraps, use that one. */
2487 (if (!ANY_INTEGRAL_TYPE_P (type) || TYPE_OVERFLOW_WRAPS (type))
2488 /* If all 3 captures are CONSTANT_CLASS_P, punt, as we might recurse
2489 forever if something doesn't simplify into a constant. */
2490 (if (!CONSTANT_CLASS_P (@0))
2491 (plus (view_convert @0) (minus @1 (view_convert @2))))
2492 (if (!ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2493 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
2494 (view_convert (plus @0 (minus (view_convert @1) @2)))
2495 (if (types_match (type, @0))
2496 (with { tree cst = const_binop (MINUS_EXPR, type, @1, @2); }
2497 (if (cst && !TREE_OVERFLOW (cst))
2498 (plus { cst; } @0)))))))
2500 /* ((T)(A)) + CST -> (T)(A + CST) */
2503 (plus (convert:s SSA_NAME@0) INTEGER_CST@1)
2504 (if (TREE_CODE (TREE_TYPE (@0)) == INTEGER_TYPE
2505 && TREE_CODE (type) == INTEGER_TYPE
2506 && TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (@0))
2507 && int_fits_type_p (@1, TREE_TYPE (@0)))
2508 /* Perform binary operation inside the cast if the constant fits
2509 and (A + CST)'s range does not overflow. */
2512 wi::overflow_type min_ovf = wi::OVF_OVERFLOW,
2513 max_ovf = wi::OVF_OVERFLOW;
2514 tree inner_type = TREE_TYPE (@0);
2517 = wide_int::from (wi::to_wide (@1), TYPE_PRECISION (inner_type),
2518 TYPE_SIGN (inner_type));
2521 if (get_global_range_query ()->range_of_expr (vr, @0)
2522 && vr.kind () == VR_RANGE)
2524 wide_int wmin0 = vr.lower_bound ();
2525 wide_int wmax0 = vr.upper_bound ();
2526 wi::add (wmin0, w1, TYPE_SIGN (inner_type), &min_ovf);
2527 wi::add (wmax0, w1, TYPE_SIGN (inner_type), &max_ovf);
2530 (if (min_ovf == wi::OVF_NONE && max_ovf == wi::OVF_NONE)
2531 (convert (plus @0 { wide_int_to_tree (TREE_TYPE (@0), w1); } )))
2535 /* ((T)(A + CST1)) + CST2 -> (T)(A) + (T)CST1 + CST2 */
2537 (for op (plus minus)
2539 (plus (convert:s (op:s @0 INTEGER_CST@1)) INTEGER_CST@2)
2540 (if (TREE_CODE (TREE_TYPE (@0)) == INTEGER_TYPE
2541 && TREE_CODE (type) == INTEGER_TYPE
2542 && TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (@0))
2543 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2544 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0))
2545 && TYPE_OVERFLOW_WRAPS (type))
2546 (plus (convert @0) (op @2 (convert @1))))))
2549 /* (T)(A) +- (T)(B) -> (T)(A +- B) only when (A +- B) could be simplified
2550 to a simple value. */
2552 (for op (plus minus)
2554 (op (convert @0) (convert @1))
2555 (if (INTEGRAL_TYPE_P (type)
2556 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
2557 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))
2558 && types_match (TREE_TYPE (@0), TREE_TYPE (@1))
2559 && !TYPE_OVERFLOW_TRAPS (type)
2560 && !TYPE_OVERFLOW_SANITIZED (type))
2561 (convert (op! @0 @1)))))
2566 (plus:c (bit_not @0) @0)
2567 (if (!TYPE_OVERFLOW_TRAPS (type))
2568 { build_all_ones_cst (type); }))
2572 (plus (convert? (bit_not @0)) integer_each_onep)
2573 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2574 (negate (convert @0))))
2578 (minus (convert? (negate @0)) integer_each_onep)
2579 (if (!TYPE_OVERFLOW_TRAPS (type)
2580 && tree_nop_conversion_p (type, TREE_TYPE (@0)))
2581 (bit_not (convert @0))))
2585 (minus integer_all_onesp @0)
2588 /* (T)(P + A) - (T)P -> (T) A */
2590 (minus (convert (plus:c @@0 @1))
2592 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
2593 /* For integer types, if A has a smaller type
2594 than T the result depends on the possible
2596 E.g. T=size_t, A=(unsigned)429497295, P>0.
2597 However, if an overflow in P + A would cause
2598 undefined behavior, we can assume that there
2600 || (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2601 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))))
2604 (minus (convert (pointer_plus @@0 @1))
2606 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
2607 /* For pointer types, if the conversion of A to the
2608 final type requires a sign- or zero-extension,
2609 then we have to punt - it is not defined which
2611 || (POINTER_TYPE_P (TREE_TYPE (@0))
2612 && TREE_CODE (@1) == INTEGER_CST
2613 && tree_int_cst_sign_bit (@1) == 0))
2616 (pointer_diff (pointer_plus @@0 @1) @0)
2617 /* The second argument of pointer_plus must be interpreted as signed, and
2618 thus sign-extended if necessary. */
2619 (with { tree stype = signed_type_for (TREE_TYPE (@1)); }
2620 /* Use view_convert instead of convert here, as POINTER_PLUS_EXPR
2621 second arg is unsigned even when we need to consider it as signed,
2622 we don't want to diagnose overflow here. */
2623 (convert (view_convert:stype @1))))
2625 /* (T)P - (T)(P + A) -> -(T) A */
2627 (minus (convert? @0)
2628 (convert (plus:c @@0 @1)))
2629 (if (INTEGRAL_TYPE_P (type)
2630 && TYPE_OVERFLOW_UNDEFINED (type)
2631 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
2632 (with { tree utype = unsigned_type_for (type); }
2633 (convert (negate (convert:utype @1))))
2634 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
2635 /* For integer types, if A has a smaller type
2636 than T the result depends on the possible
2638 E.g. T=size_t, A=(unsigned)429497295, P>0.
2639 However, if an overflow in P + A would cause
2640 undefined behavior, we can assume that there
2642 || (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2643 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))))
2644 (negate (convert @1)))))
2647 (convert (pointer_plus @@0 @1)))
2648 (if (INTEGRAL_TYPE_P (type)
2649 && TYPE_OVERFLOW_UNDEFINED (type)
2650 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
2651 (with { tree utype = unsigned_type_for (type); }
2652 (convert (negate (convert:utype @1))))
2653 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
2654 /* For pointer types, if the conversion of A to the
2655 final type requires a sign- or zero-extension,
2656 then we have to punt - it is not defined which
2658 || (POINTER_TYPE_P (TREE_TYPE (@0))
2659 && TREE_CODE (@1) == INTEGER_CST
2660 && tree_int_cst_sign_bit (@1) == 0))
2661 (negate (convert @1)))))
2663 (pointer_diff @0 (pointer_plus @@0 @1))
2664 /* The second argument of pointer_plus must be interpreted as signed, and
2665 thus sign-extended if necessary. */
2666 (with { tree stype = signed_type_for (TREE_TYPE (@1)); }
2667 /* Use view_convert instead of convert here, as POINTER_PLUS_EXPR
2668 second arg is unsigned even when we need to consider it as signed,
2669 we don't want to diagnose overflow here. */
2670 (negate (convert (view_convert:stype @1)))))
2672 /* (T)(P + A) - (T)(P + B) -> (T)A - (T)B */
2674 (minus (convert (plus:c @@0 @1))
2675 (convert (plus:c @0 @2)))
2676 (if (INTEGRAL_TYPE_P (type)
2677 && TYPE_OVERFLOW_UNDEFINED (type)
2678 && element_precision (type) <= element_precision (TREE_TYPE (@1))
2679 && element_precision (type) <= element_precision (TREE_TYPE (@2)))
2680 (with { tree utype = unsigned_type_for (type); }
2681 (convert (minus (convert:utype @1) (convert:utype @2))))
2682 (if (((element_precision (type) <= element_precision (TREE_TYPE (@1)))
2683 == (element_precision (type) <= element_precision (TREE_TYPE (@2))))
2684 && (element_precision (type) <= element_precision (TREE_TYPE (@1))
2685 /* For integer types, if A has a smaller type
2686 than T the result depends on the possible
2688 E.g. T=size_t, A=(unsigned)429497295, P>0.
2689 However, if an overflow in P + A would cause
2690 undefined behavior, we can assume that there
2692 || (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2693 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
2694 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))
2695 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@2)))))
2696 (minus (convert @1) (convert @2)))))
2698 (minus (convert (pointer_plus @@0 @1))
2699 (convert (pointer_plus @0 @2)))
2700 (if (INTEGRAL_TYPE_P (type)
2701 && TYPE_OVERFLOW_UNDEFINED (type)
2702 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
2703 (with { tree utype = unsigned_type_for (type); }
2704 (convert (minus (convert:utype @1) (convert:utype @2))))
2705 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
2706 /* For pointer types, if the conversion of A to the
2707 final type requires a sign- or zero-extension,
2708 then we have to punt - it is not defined which
2710 || (POINTER_TYPE_P (TREE_TYPE (@0))
2711 && TREE_CODE (@1) == INTEGER_CST
2712 && tree_int_cst_sign_bit (@1) == 0
2713 && TREE_CODE (@2) == INTEGER_CST
2714 && tree_int_cst_sign_bit (@2) == 0))
2715 (minus (convert @1) (convert @2)))))
2717 (pointer_diff (pointer_plus @0 @2) (pointer_plus @1 @2))
2718 (pointer_diff @0 @1))
2720 (pointer_diff (pointer_plus @@0 @1) (pointer_plus @0 @2))
2721 /* The second argument of pointer_plus must be interpreted as signed, and
2722 thus sign-extended if necessary. */
2723 (with { tree stype = signed_type_for (TREE_TYPE (@1)); }
2724 /* Use view_convert instead of convert here, as POINTER_PLUS_EXPR
2725 second arg is unsigned even when we need to consider it as signed,
2726 we don't want to diagnose overflow here. */
2727 (minus (convert (view_convert:stype @1))
2728 (convert (view_convert:stype @2)))))))
2730 /* (A * C) +- (B * C) -> (A+-B) * C and (A * C) +- A -> A * (C+-1).
2731 Modeled after fold_plusminus_mult_expr. */
2732 (if (!TYPE_SATURATING (type)
2733 && (!FLOAT_TYPE_P (type) || flag_associative_math))
2734 (for plusminus (plus minus)
2736 (plusminus (mult:cs@3 @0 @1) (mult:cs@4 @0 @2))
2737 (if (!ANY_INTEGRAL_TYPE_P (type)
2738 || TYPE_OVERFLOW_WRAPS (type)
2739 || (INTEGRAL_TYPE_P (type)
2740 && tree_expr_nonzero_p (@0)
2741 && expr_not_equal_to (@0, wi::minus_one (TYPE_PRECISION (type)))))
2742 (if (single_use (@3) || single_use (@4))
2743 /* If @1 +- @2 is constant require a hard single-use on either
2744 original operand (but not on both). */
2745 (mult (plusminus @1 @2) @0)
2747 (mult! (plusminus @1 @2) @0)
2750 /* We cannot generate constant 1 for fract. */
2751 (if (!ALL_FRACT_MODE_P (TYPE_MODE (type)))
2753 (plusminus @0 (mult:c@3 @0 @2))
2754 (if ((!ANY_INTEGRAL_TYPE_P (type)
2755 || TYPE_OVERFLOW_WRAPS (type)
2756 /* For @0 + @0*@2 this transformation would introduce UB
2757 (where there was none before) for @0 in [-1,0] and @2 max.
2758 For @0 - @0*@2 this transformation would introduce UB
2759 for @0 0 and @2 in [min,min+1] or @0 -1 and @2 min+1. */
2760 || (INTEGRAL_TYPE_P (type)
2761 && ((tree_expr_nonzero_p (@0)
2762 && expr_not_equal_to (@0,
2763 wi::minus_one (TYPE_PRECISION (type))))
2764 || (plusminus == PLUS_EXPR
2765 ? expr_not_equal_to (@2,
2766 wi::max_value (TYPE_PRECISION (type), SIGNED))
2767 /* Let's ignore the @0 -1 and @2 min case. */
2768 : (expr_not_equal_to (@2,
2769 wi::min_value (TYPE_PRECISION (type), SIGNED))
2770 && expr_not_equal_to (@2,
2771 wi::min_value (TYPE_PRECISION (type), SIGNED)
2774 (mult (plusminus { build_one_cst (type); } @2) @0)))
2776 (plusminus (mult:c@3 @0 @2) @0)
2777 (if ((!ANY_INTEGRAL_TYPE_P (type)
2778 || TYPE_OVERFLOW_WRAPS (type)
2779 /* For @0*@2 + @0 this transformation would introduce UB
2780 (where there was none before) for @0 in [-1,0] and @2 max.
2781 For @0*@2 - @0 this transformation would introduce UB
2782 for @0 0 and @2 min. */
2783 || (INTEGRAL_TYPE_P (type)
2784 && ((tree_expr_nonzero_p (@0)
2785 && (plusminus == MINUS_EXPR
2786 || expr_not_equal_to (@0,
2787 wi::minus_one (TYPE_PRECISION (type)))))
2788 || expr_not_equal_to (@2,
2789 (plusminus == PLUS_EXPR
2790 ? wi::max_value (TYPE_PRECISION (type), SIGNED)
2791 : wi::min_value (TYPE_PRECISION (type), SIGNED))))))
2793 (mult (plusminus @2 { build_one_cst (type); }) @0))))))
2796 /* Canonicalize X + (X << C) into X * (1 + (1 << C)) and
2797 (X << C1) + (X << C2) into X * ((1 << C1) + (1 << C2)). */
2799 (plus:c @0 (lshift:s @0 INTEGER_CST@1))
2800 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2801 && tree_fits_uhwi_p (@1)
2802 && tree_to_uhwi (@1) < element_precision (type)
2803 && (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2804 || optab_handler (smul_optab,
2805 TYPE_MODE (type)) != CODE_FOR_nothing))
2806 (with { tree t = type;
2807 if (!TYPE_OVERFLOW_WRAPS (t)) t = unsigned_type_for (t);
2808 wide_int w = wi::set_bit_in_zero (tree_to_uhwi (@1),
2809 element_precision (type));
2811 tree cst = wide_int_to_tree (VECTOR_TYPE_P (t) ? TREE_TYPE (t)
2813 cst = build_uniform_cst (t, cst); }
2814 (convert (mult (convert:t @0) { cst; })))))
2816 (plus (lshift:s @0 INTEGER_CST@1) (lshift:s @0 INTEGER_CST@2))
2817 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2818 && tree_fits_uhwi_p (@1)
2819 && tree_to_uhwi (@1) < element_precision (type)
2820 && tree_fits_uhwi_p (@2)
2821 && tree_to_uhwi (@2) < element_precision (type)
2822 && (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2823 || optab_handler (smul_optab,
2824 TYPE_MODE (type)) != CODE_FOR_nothing))
2825 (with { tree t = type;
2826 if (!TYPE_OVERFLOW_WRAPS (t)) t = unsigned_type_for (t);
2827 unsigned int prec = element_precision (type);
2828 wide_int w = wi::set_bit_in_zero (tree_to_uhwi (@1), prec);
2829 w += wi::set_bit_in_zero (tree_to_uhwi (@2), prec);
2830 tree cst = wide_int_to_tree (VECTOR_TYPE_P (t) ? TREE_TYPE (t)
2832 cst = build_uniform_cst (t, cst); }
2833 (convert (mult (convert:t @0) { cst; })))))
2836 /* Canonicalize (X*C1)|(X*C2) and (X*C1)^(X*C2) to (C1+C2)*X when
2837 tree_nonzero_bits allows IOR and XOR to be treated like PLUS.
2838 Likewise, handle (X<<C3) and X as legitimate variants of X*C. */
2839 (for op (bit_ior bit_xor)
2841 (op (mult:s@0 @1 INTEGER_CST@2)
2842 (mult:s@3 @1 INTEGER_CST@4))
2843 (if (INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_WRAPS (type)
2844 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@3)) == 0)
2846 { wide_int_to_tree (type, wi::to_wide (@2) + wi::to_wide (@4)); })))
2848 (op:c (mult:s@0 @1 INTEGER_CST@2)
2849 (lshift:s@3 @1 INTEGER_CST@4))
2850 (if (INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_WRAPS (type)
2851 && tree_int_cst_sgn (@4) > 0
2852 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@3)) == 0)
2853 (with { wide_int wone = wi::one (TYPE_PRECISION (type));
2854 wide_int c = wi::add (wi::to_wide (@2),
2855 wi::lshift (wone, wi::to_wide (@4))); }
2856 (mult @1 { wide_int_to_tree (type, c); }))))
2858 (op:c (mult:s@0 @1 INTEGER_CST@2)
2860 (if (INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_WRAPS (type)
2861 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@1)) == 0)
2863 { wide_int_to_tree (type,
2864 wi::add (wi::to_wide (@2), 1)); })))
2866 (op (lshift:s@0 @1 INTEGER_CST@2)
2867 (lshift:s@3 @1 INTEGER_CST@4))
2868 (if (INTEGRAL_TYPE_P (type)
2869 && tree_int_cst_sgn (@2) > 0
2870 && tree_int_cst_sgn (@4) > 0
2871 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@3)) == 0)
2872 (with { tree t = type;
2873 if (!TYPE_OVERFLOW_WRAPS (t))
2874 t = unsigned_type_for (t);
2875 wide_int wone = wi::one (TYPE_PRECISION (t));
2876 wide_int c = wi::add (wi::lshift (wone, wi::to_wide (@2)),
2877 wi::lshift (wone, wi::to_wide (@4))); }
2878 (convert (mult:t (convert:t @1) { wide_int_to_tree (t,c); })))))
2880 (op:c (lshift:s@0 @1 INTEGER_CST@2)
2882 (if (INTEGRAL_TYPE_P (type)
2883 && tree_int_cst_sgn (@2) > 0
2884 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@1)) == 0)
2885 (with { tree t = type;
2886 if (!TYPE_OVERFLOW_WRAPS (t))
2887 t = unsigned_type_for (t);
2888 wide_int wone = wi::one (TYPE_PRECISION (t));
2889 wide_int c = wi::add (wi::lshift (wone, wi::to_wide (@2)), wone); }
2890 (convert (mult:t (convert:t @1) { wide_int_to_tree (t, c); }))))))
2892 /* Simplifications of MIN_EXPR, MAX_EXPR, fmin() and fmax(). */
2894 (for minmax (min max FMIN_ALL FMAX_ALL)
2898 /* min(max(x,y),y) -> y. */
2900 (min:c (max:c @0 @1) @1)
2902 /* max(min(x,y),y) -> y. */
2904 (max:c (min:c @0 @1) @1)
2906 /* max(a,-a) -> abs(a). */
2908 (max:c @0 (negate @0))
2909 (if (TREE_CODE (type) != COMPLEX_TYPE
2910 && (! ANY_INTEGRAL_TYPE_P (type)
2911 || TYPE_OVERFLOW_UNDEFINED (type)))
2913 /* min(a,-a) -> -abs(a). */
2915 (min:c @0 (negate @0))
2916 (if (TREE_CODE (type) != COMPLEX_TYPE
2917 && (! ANY_INTEGRAL_TYPE_P (type)
2918 || TYPE_OVERFLOW_UNDEFINED (type)))
2923 (if (INTEGRAL_TYPE_P (type)
2924 && TYPE_MIN_VALUE (type)
2925 && operand_equal_p (@1, TYPE_MIN_VALUE (type), OEP_ONLY_CONST))
2927 (if (INTEGRAL_TYPE_P (type)
2928 && TYPE_MAX_VALUE (type)
2929 && operand_equal_p (@1, TYPE_MAX_VALUE (type), OEP_ONLY_CONST))
2934 (if (INTEGRAL_TYPE_P (type)
2935 && TYPE_MAX_VALUE (type)
2936 && operand_equal_p (@1, TYPE_MAX_VALUE (type), OEP_ONLY_CONST))
2938 (if (INTEGRAL_TYPE_P (type)
2939 && TYPE_MIN_VALUE (type)
2940 && operand_equal_p (@1, TYPE_MIN_VALUE (type), OEP_ONLY_CONST))
2943 /* max (a, a + CST) -> a + CST where CST is positive. */
2944 /* max (a, a + CST) -> a where CST is negative. */
2946 (max:c @0 (plus@2 @0 INTEGER_CST@1))
2947 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
2948 (if (tree_int_cst_sgn (@1) > 0)
2952 /* min (a, a + CST) -> a where CST is positive. */
2953 /* min (a, a + CST) -> a + CST where CST is negative. */
2955 (min:c @0 (plus@2 @0 INTEGER_CST@1))
2956 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
2957 (if (tree_int_cst_sgn (@1) > 0)
2961 /* (convert (minmax ((convert (x) c)))) -> minmax (x c) if x is promoted
2962 and the outer convert demotes the expression back to x's type. */
2963 (for minmax (min max)
2965 (convert (minmax@0 (convert @1) INTEGER_CST@2))
2966 (if (INTEGRAL_TYPE_P (type)
2967 && types_match (@1, type) && int_fits_type_p (@2, type)
2968 && TYPE_SIGN (TREE_TYPE (@0)) == TYPE_SIGN (type)
2969 && TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (type))
2970 (minmax @1 (convert @2)))))
2972 (for minmax (FMIN_ALL FMAX_ALL)
2973 /* If either argument is NaN, return the other one. Avoid the
2974 transformation if we get (and honor) a signalling NaN. */
2976 (minmax:c @0 REAL_CST@1)
2977 (if (real_isnan (TREE_REAL_CST_PTR (@1))
2978 && (!HONOR_SNANS (@1) || !TREE_REAL_CST (@1).signalling))
2980 /* Convert fmin/fmax to MIN_EXPR/MAX_EXPR. C99 requires these
2981 functions to return the numeric arg if the other one is NaN.
2982 MIN and MAX don't honor that, so only transform if -ffinite-math-only
2983 is set. C99 doesn't require -0.0 to be handled, so we don't have to
2984 worry about it either. */
2985 (if (flag_finite_math_only)
2992 /* min (-A, -B) -> -max (A, B) */
2993 (for minmax (min max FMIN_ALL FMAX_ALL)
2994 maxmin (max min FMAX_ALL FMIN_ALL)
2996 (minmax (negate:s@2 @0) (negate:s@3 @1))
2997 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
2998 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2999 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))))
3000 (negate (maxmin @0 @1)))))
3001 /* MIN (~X, ~Y) -> ~MAX (X, Y)
3002 MAX (~X, ~Y) -> ~MIN (X, Y) */
3003 (for minmax (min max)
3006 (minmax (bit_not:s@2 @0) (bit_not:s@3 @1))
3007 (bit_not (maxmin @0 @1))))
3009 /* MIN (X, Y) == X -> X <= Y */
3010 (for minmax (min min max max)
3014 (cmp:c (minmax:c @0 @1) @0)
3015 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0)))
3017 /* MIN (X, 5) == 0 -> X == 0
3018 MIN (X, 5) == 7 -> false */
3021 (cmp (min @0 INTEGER_CST@1) INTEGER_CST@2)
3022 (if (wi::lt_p (wi::to_wide (@1), wi::to_wide (@2),
3023 TYPE_SIGN (TREE_TYPE (@0))))
3024 { constant_boolean_node (cmp == NE_EXPR, type); }
3025 (if (wi::gt_p (wi::to_wide (@1), wi::to_wide (@2),
3026 TYPE_SIGN (TREE_TYPE (@0))))
3030 (cmp (max @0 INTEGER_CST@1) INTEGER_CST@2)
3031 (if (wi::gt_p (wi::to_wide (@1), wi::to_wide (@2),
3032 TYPE_SIGN (TREE_TYPE (@0))))
3033 { constant_boolean_node (cmp == NE_EXPR, type); }
3034 (if (wi::lt_p (wi::to_wide (@1), wi::to_wide (@2),
3035 TYPE_SIGN (TREE_TYPE (@0))))
3037 /* MIN (X, C1) < C2 -> X < C2 || C1 < C2 */
3038 (for minmax (min min max max min min max max )
3039 cmp (lt le gt ge gt ge lt le )
3040 comb (bit_ior bit_ior bit_ior bit_ior bit_and bit_and bit_and bit_and)
3042 (cmp (minmax @0 INTEGER_CST@1) INTEGER_CST@2)
3043 (comb (cmp @0 @2) (cmp @1 @2))))
3045 /* X <= MAX(X, Y) -> true
3046 X > MAX(X, Y) -> false
3047 X >= MIN(X, Y) -> true
3048 X < MIN(X, Y) -> false */
3049 (for minmax (min min max max )
3052 (cmp @0 (minmax:c @0 @1))
3053 { constant_boolean_node (cmp == GE_EXPR || cmp == LE_EXPR, type); } ))
3055 /* Undo fancy way of writing max/min or other ?: expressions,
3056 like a - ((a - b) & -(a < b)), in this case into (a < b) ? b : a.
3057 People normally use ?: and that is what we actually try to optimize. */
3058 (for cmp (simple_comparison)
3060 (minus @0 (bit_and:c (minus @0 @1)
3061 (convert? (negate@4 (convert? (cmp@5 @2 @3))))))
3062 (if (INTEGRAL_TYPE_P (type)
3063 && INTEGRAL_TYPE_P (TREE_TYPE (@4))
3064 && TREE_CODE (TREE_TYPE (@4)) != BOOLEAN_TYPE
3065 && INTEGRAL_TYPE_P (TREE_TYPE (@5))
3066 && (TYPE_PRECISION (TREE_TYPE (@4)) >= TYPE_PRECISION (type)
3067 || !TYPE_UNSIGNED (TREE_TYPE (@4)))
3068 && (GIMPLE || !TREE_SIDE_EFFECTS (@1)))
3069 (cond (cmp @2 @3) @1 @0)))
3071 (plus:c @0 (bit_and:c (minus @1 @0)
3072 (convert? (negate@4 (convert? (cmp@5 @2 @3))))))
3073 (if (INTEGRAL_TYPE_P (type)
3074 && INTEGRAL_TYPE_P (TREE_TYPE (@4))
3075 && TREE_CODE (TREE_TYPE (@4)) != BOOLEAN_TYPE
3076 && INTEGRAL_TYPE_P (TREE_TYPE (@5))
3077 && (TYPE_PRECISION (TREE_TYPE (@4)) >= TYPE_PRECISION (type)
3078 || !TYPE_UNSIGNED (TREE_TYPE (@4)))
3079 && (GIMPLE || !TREE_SIDE_EFFECTS (@1)))
3080 (cond (cmp @2 @3) @1 @0)))
3081 /* Similarly with ^ instead of - though in that case with :c. */
3083 (bit_xor:c @0 (bit_and:c (bit_xor:c @0 @1)
3084 (convert? (negate@4 (convert? (cmp@5 @2 @3))))))
3085 (if (INTEGRAL_TYPE_P (type)
3086 && INTEGRAL_TYPE_P (TREE_TYPE (@4))
3087 && TREE_CODE (TREE_TYPE (@4)) != BOOLEAN_TYPE
3088 && INTEGRAL_TYPE_P (TREE_TYPE (@5))
3089 && (TYPE_PRECISION (TREE_TYPE (@4)) >= TYPE_PRECISION (type)
3090 || !TYPE_UNSIGNED (TREE_TYPE (@4)))
3091 && (GIMPLE || !TREE_SIDE_EFFECTS (@1)))
3092 (cond (cmp @2 @3) @1 @0))))
3094 /* Simplifications of shift and rotates. */
3096 (for rotate (lrotate rrotate)
3098 (rotate integer_all_onesp@0 @1)
3101 /* Optimize -1 >> x for arithmetic right shifts. */
3103 (rshift integer_all_onesp@0 @1)
3104 (if (!TYPE_UNSIGNED (type))
3107 /* Optimize (x >> c) << c into x & (-1<<c). */
3109 (lshift (nop_convert? (rshift @0 INTEGER_CST@1)) @1)
3110 (if (wi::ltu_p (wi::to_wide (@1), element_precision (type)))
3111 /* It doesn't matter if the right shift is arithmetic or logical. */
3112 (bit_and (view_convert @0) (lshift { build_minus_one_cst (type); } @1))))
3115 (lshift (convert (convert@2 (rshift @0 INTEGER_CST@1))) @1)
3116 (if (wi::ltu_p (wi::to_wide (@1), element_precision (type))
3117 /* Allow intermediate conversion to integral type with whatever sign, as
3118 long as the low TYPE_PRECISION (type)
3119 - TYPE_PRECISION (TREE_TYPE (@2)) bits are preserved. */
3120 && INTEGRAL_TYPE_P (type)
3121 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
3122 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
3123 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (@0))
3124 && (TYPE_PRECISION (TREE_TYPE (@2)) >= TYPE_PRECISION (type)
3125 || wi::geu_p (wi::to_wide (@1),
3126 TYPE_PRECISION (type)
3127 - TYPE_PRECISION (TREE_TYPE (@2)))))
3128 (bit_and (convert @0) (lshift { build_minus_one_cst (type); } @1))))
3130 /* Optimize (x << c) >> c into x & ((unsigned)-1 >> c) for unsigned
3133 (rshift (lshift @0 INTEGER_CST@1) @1)
3134 (if (TYPE_UNSIGNED (type)
3135 && (wi::ltu_p (wi::to_wide (@1), element_precision (type))))
3136 (bit_and @0 (rshift { build_minus_one_cst (type); } @1))))
3138 /* Optimize x >> x into 0 */
3141 { build_zero_cst (type); })
3143 (for shiftrotate (lrotate rrotate lshift rshift)
3145 (shiftrotate @0 integer_zerop)
3148 (shiftrotate integer_zerop@0 @1)
3150 /* Prefer vector1 << scalar to vector1 << vector2
3151 if vector2 is uniform. */
3152 (for vec (VECTOR_CST CONSTRUCTOR)
3154 (shiftrotate @0 vec@1)
3155 (with { tree tem = uniform_vector_p (@1); }
3157 (shiftrotate @0 { tem; }))))))
3159 /* Simplify X << Y where Y's low width bits are 0 to X, as only valid
3160 Y is 0. Similarly for X >> Y. */
3162 (for shift (lshift rshift)
3164 (shift @0 SSA_NAME@1)
3165 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1)))
3167 int width = ceil_log2 (element_precision (TREE_TYPE (@0)));
3168 int prec = TYPE_PRECISION (TREE_TYPE (@1));
3170 (if ((get_nonzero_bits (@1) & wi::mask (width, false, prec)) == 0)
3174 /* Rewrite an LROTATE_EXPR by a constant into an
3175 RROTATE_EXPR by a new constant. */
3177 (lrotate @0 INTEGER_CST@1)
3178 (rrotate @0 { const_binop (MINUS_EXPR, TREE_TYPE (@1),
3179 build_int_cst (TREE_TYPE (@1),
3180 element_precision (type)), @1); }))
3182 /* Turn (a OP c1) OP c2 into a OP (c1+c2). */
3183 (for op (lrotate rrotate rshift lshift)
3185 (op (op @0 INTEGER_CST@1) INTEGER_CST@2)
3186 (with { unsigned int prec = element_precision (type); }
3187 (if (wi::ge_p (wi::to_wide (@1), 0, TYPE_SIGN (TREE_TYPE (@1)))
3188 && wi::lt_p (wi::to_wide (@1), prec, TYPE_SIGN (TREE_TYPE (@1)))
3189 && wi::ge_p (wi::to_wide (@2), 0, TYPE_SIGN (TREE_TYPE (@2)))
3190 && wi::lt_p (wi::to_wide (@2), prec, TYPE_SIGN (TREE_TYPE (@2))))
3191 (with { unsigned int low = (tree_to_uhwi (@1)
3192 + tree_to_uhwi (@2)); }
3193 /* Deal with a OP (c1 + c2) being undefined but (a OP c1) OP c2
3194 being well defined. */
3196 (if (op == LROTATE_EXPR || op == RROTATE_EXPR)
3197 (op @0 { build_int_cst (TREE_TYPE (@1), low % prec); })
3198 (if (TYPE_UNSIGNED (type) || op == LSHIFT_EXPR)
3199 { build_zero_cst (type); }
3200 (op @0 { build_int_cst (TREE_TYPE (@1), prec - 1); })))
3201 (op @0 { build_int_cst (TREE_TYPE (@1), low); })))))))
3204 /* Simplify (CST << x) & 1 to 0 if CST is even or to x == 0 if it is odd. */
3206 (bit_and (lshift INTEGER_CST@1 @0) integer_onep)
3207 (if ((wi::to_wide (@1) & 1) != 0)
3208 (convert (eq:boolean_type_node @0 { build_zero_cst (TREE_TYPE (@0)); }))
3209 { build_zero_cst (type); }))
3211 /* Simplify ((C << x) & D) != 0 where C and D are power of two constants,
3212 either to false if D is smaller (unsigned comparison) than C, or to
3213 x == log2 (D) - log2 (C). Similarly for right shifts. */
3217 (cmp (bit_and (lshift integer_pow2p@1 @0) integer_pow2p@2) integer_zerop)
3218 (with { int c1 = wi::clz (wi::to_wide (@1));
3219 int c2 = wi::clz (wi::to_wide (@2)); }
3221 { constant_boolean_node (cmp == NE_EXPR ? false : true, type); }
3222 (icmp @0 { build_int_cst (TREE_TYPE (@0), c1 - c2); }))))
3224 (cmp (bit_and (rshift integer_pow2p@1 @0) integer_pow2p@2) integer_zerop)
3225 (if (tree_int_cst_sgn (@1) > 0)
3226 (with { int c1 = wi::clz (wi::to_wide (@1));
3227 int c2 = wi::clz (wi::to_wide (@2)); }
3229 { constant_boolean_node (cmp == NE_EXPR ? false : true, type); }
3230 (icmp @0 { build_int_cst (TREE_TYPE (@0), c2 - c1); }))))))
3232 /* (CST1 << A) == CST2 -> A == ctz (CST2) - ctz (CST1)
3233 (CST1 << A) != CST2 -> A != ctz (CST2) - ctz (CST1)
3237 (cmp (lshift INTEGER_CST@0 @1) INTEGER_CST@2)
3238 (with { int cand = wi::ctz (wi::to_wide (@2)) - wi::ctz (wi::to_wide (@0)); }
3240 || (!integer_zerop (@2)
3241 && wi::lshift (wi::to_wide (@0), cand) != wi::to_wide (@2)))
3242 { constant_boolean_node (cmp == NE_EXPR, type); }
3243 (if (!integer_zerop (@2)
3244 && wi::lshift (wi::to_wide (@0), cand) == wi::to_wide (@2))
3245 (cmp @1 { build_int_cst (TREE_TYPE (@1), cand); }))))))
3247 /* Fold (X << C1) & C2 into (X << C1) & (C2 | ((1 << C1) - 1))
3248 (X >> C1) & C2 into (X >> C1) & (C2 | ~((type) -1 >> C1))
3249 if the new mask might be further optimized. */
3250 (for shift (lshift rshift)
3252 (bit_and (convert?:s@4 (shift:s@5 (convert1?@3 @0) INTEGER_CST@1))
3254 (if (tree_nop_conversion_p (TREE_TYPE (@4), TREE_TYPE (@5))
3255 && TYPE_PRECISION (type) <= HOST_BITS_PER_WIDE_INT
3256 && tree_fits_uhwi_p (@1)
3257 && tree_to_uhwi (@1) > 0
3258 && tree_to_uhwi (@1) < TYPE_PRECISION (type))
3261 unsigned int shiftc = tree_to_uhwi (@1);
3262 unsigned HOST_WIDE_INT mask = TREE_INT_CST_LOW (@2);
3263 unsigned HOST_WIDE_INT newmask, zerobits = 0;
3264 tree shift_type = TREE_TYPE (@3);
3267 if (shift == LSHIFT_EXPR)
3268 zerobits = ((HOST_WIDE_INT_1U << shiftc) - 1);
3269 else if (shift == RSHIFT_EXPR
3270 && type_has_mode_precision_p (shift_type))
3272 prec = TYPE_PRECISION (TREE_TYPE (@3));
3274 /* See if more bits can be proven as zero because of
3277 && TYPE_UNSIGNED (TREE_TYPE (@0)))
3279 tree inner_type = TREE_TYPE (@0);
3280 if (type_has_mode_precision_p (inner_type)
3281 && TYPE_PRECISION (inner_type) < prec)
3283 prec = TYPE_PRECISION (inner_type);
3284 /* See if we can shorten the right shift. */
3286 shift_type = inner_type;
3287 /* Otherwise X >> C1 is all zeros, so we'll optimize
3288 it into (X, 0) later on by making sure zerobits
3292 zerobits = HOST_WIDE_INT_M1U;
3295 zerobits >>= HOST_BITS_PER_WIDE_INT - shiftc;
3296 zerobits <<= prec - shiftc;
3298 /* For arithmetic shift if sign bit could be set, zerobits
3299 can contain actually sign bits, so no transformation is
3300 possible, unless MASK masks them all away. In that
3301 case the shift needs to be converted into logical shift. */
3302 if (!TYPE_UNSIGNED (TREE_TYPE (@3))
3303 && prec == TYPE_PRECISION (TREE_TYPE (@3)))
3305 if ((mask & zerobits) == 0)
3306 shift_type = unsigned_type_for (TREE_TYPE (@3));
3312 /* ((X << 16) & 0xff00) is (X, 0). */
3313 (if ((mask & zerobits) == mask)
3314 { build_int_cst (type, 0); }
3315 (with { newmask = mask | zerobits; }
3316 (if (newmask != mask && (newmask & (newmask + 1)) == 0)
3319 /* Only do the transformation if NEWMASK is some integer
3321 for (prec = BITS_PER_UNIT;
3322 prec < HOST_BITS_PER_WIDE_INT; prec <<= 1)
3323 if (newmask == (HOST_WIDE_INT_1U << prec) - 1)
3326 (if (prec < HOST_BITS_PER_WIDE_INT
3327 || newmask == HOST_WIDE_INT_M1U)
3329 { tree newmaskt = build_int_cst_type (TREE_TYPE (@2), newmask); }
3330 (if (!tree_int_cst_equal (newmaskt, @2))
3331 (if (shift_type != TREE_TYPE (@3))
3332 (bit_and (convert (shift:shift_type (convert @3) @1)) { newmaskt; })
3333 (bit_and @4 { newmaskt; })))))))))))))
3335 /* Fold (X {&,^,|} C2) << C1 into (X << C1) {&,^,|} (C2 << C1)
3336 (X {&,^,|} C2) >> C1 into (X >> C1) & (C2 >> C1). */
3337 (for shift (lshift rshift)
3338 (for bit_op (bit_and bit_xor bit_ior)
3340 (shift (convert?:s (bit_op:s @0 INTEGER_CST@2)) INTEGER_CST@1)
3341 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
3342 (with { tree mask = int_const_binop (shift, fold_convert (type, @2), @1); }
3344 (bit_op (shift (convert @0) @1) { mask; })))))))
3346 /* ~(~X >> Y) -> X >> Y (for arithmetic shift). */
3348 (bit_not (convert1?:s (rshift:s (convert2?@0 (bit_not @1)) @2)))
3349 (if (!TYPE_UNSIGNED (TREE_TYPE (@0))
3350 && (element_precision (TREE_TYPE (@0))
3351 <= element_precision (TREE_TYPE (@1))
3352 || !TYPE_UNSIGNED (TREE_TYPE (@1))))
3354 { tree shift_type = TREE_TYPE (@0); }
3355 (convert (rshift (convert:shift_type @1) @2)))))
3357 /* ~(~X >>r Y) -> X >>r Y
3358 ~(~X <<r Y) -> X <<r Y */
3359 (for rotate (lrotate rrotate)
3361 (bit_not (convert1?:s (rotate:s (convert2?@0 (bit_not @1)) @2)))
3362 (if ((element_precision (TREE_TYPE (@0))
3363 <= element_precision (TREE_TYPE (@1))
3364 || !TYPE_UNSIGNED (TREE_TYPE (@1)))
3365 && (element_precision (type) <= element_precision (TREE_TYPE (@0))
3366 || !TYPE_UNSIGNED (TREE_TYPE (@0))))
3368 { tree rotate_type = TREE_TYPE (@0); }
3369 (convert (rotate (convert:rotate_type @1) @2))))))
3372 (for rotate (lrotate rrotate)
3373 invrot (rrotate lrotate)
3374 /* (X >>r Y) cmp (Z >>r Y) may simplify to X cmp Y. */
3376 (cmp (rotate @1 @0) (rotate @2 @0))
3378 /* (X >>r C1) cmp C2 may simplify to X cmp C3. */
3380 (cmp (rotate @0 INTEGER_CST@1) INTEGER_CST@2)
3381 (cmp @0 { const_binop (invrot, TREE_TYPE (@0), @2, @1); }))
3382 /* (X >>r Y) cmp C where C is 0 or ~0, may simplify to X cmp C. */
3384 (cmp (rotate @0 @1) INTEGER_CST@2)
3385 (if (integer_zerop (@2) || integer_all_onesp (@2))
3388 /* Simplifications of conversions. */
3390 /* Basic strip-useless-type-conversions / strip_nops. */
3391 (for cvt (convert view_convert float fix_trunc)
3394 (if ((GIMPLE && useless_type_conversion_p (type, TREE_TYPE (@0)))
3395 || (GENERIC && type == TREE_TYPE (@0)))
3398 /* Contract view-conversions. */
3400 (view_convert (view_convert @0))
3403 /* For integral conversions with the same precision or pointer
3404 conversions use a NOP_EXPR instead. */
3407 (if ((INTEGRAL_TYPE_P (type) || POINTER_TYPE_P (type))
3408 && (INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))
3409 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (@0)))
3412 /* Strip inner integral conversions that do not change precision or size, or
3413 zero-extend while keeping the same size (for bool-to-char). */
3415 (view_convert (convert@0 @1))
3416 (if ((INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))
3417 && (INTEGRAL_TYPE_P (TREE_TYPE (@1)) || POINTER_TYPE_P (TREE_TYPE (@1)))
3418 && TYPE_SIZE (TREE_TYPE (@0)) == TYPE_SIZE (TREE_TYPE (@1))
3419 && (TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1))
3420 || (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (TREE_TYPE (@1))
3421 && TYPE_UNSIGNED (TREE_TYPE (@1)))))
3424 /* Simplify a view-converted empty constructor. */
3426 (view_convert CONSTRUCTOR@0)
3427 (if (TREE_CODE (@0) != SSA_NAME
3428 && CONSTRUCTOR_NELTS (@0) == 0)
3429 { build_zero_cst (type); }))
3431 /* Re-association barriers around constants and other re-association
3432 barriers can be removed. */
3434 (paren CONSTANT_CLASS_P@0)
3437 (paren (paren@1 @0))
3440 /* Handle cases of two conversions in a row. */
3441 (for ocvt (convert float fix_trunc)
3442 (for icvt (convert float)
3447 tree inside_type = TREE_TYPE (@0);
3448 tree inter_type = TREE_TYPE (@1);
3449 int inside_int = INTEGRAL_TYPE_P (inside_type);
3450 int inside_ptr = POINTER_TYPE_P (inside_type);
3451 int inside_float = FLOAT_TYPE_P (inside_type);
3452 int inside_vec = VECTOR_TYPE_P (inside_type);
3453 unsigned int inside_prec = TYPE_PRECISION (inside_type);
3454 int inside_unsignedp = TYPE_UNSIGNED (inside_type);
3455 int inter_int = INTEGRAL_TYPE_P (inter_type);
3456 int inter_ptr = POINTER_TYPE_P (inter_type);
3457 int inter_float = FLOAT_TYPE_P (inter_type);
3458 int inter_vec = VECTOR_TYPE_P (inter_type);
3459 unsigned int inter_prec = TYPE_PRECISION (inter_type);
3460 int inter_unsignedp = TYPE_UNSIGNED (inter_type);
3461 int final_int = INTEGRAL_TYPE_P (type);
3462 int final_ptr = POINTER_TYPE_P (type);
3463 int final_float = FLOAT_TYPE_P (type);
3464 int final_vec = VECTOR_TYPE_P (type);
3465 unsigned int final_prec = TYPE_PRECISION (type);
3466 int final_unsignedp = TYPE_UNSIGNED (type);
3469 /* In addition to the cases of two conversions in a row
3470 handled below, if we are converting something to its own
3471 type via an object of identical or wider precision, neither
3472 conversion is needed. */
3473 (if (((GIMPLE && useless_type_conversion_p (type, inside_type))
3475 && TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (inside_type)))
3476 && (((inter_int || inter_ptr) && final_int)
3477 || (inter_float && final_float))
3478 && inter_prec >= final_prec)
3481 /* Likewise, if the intermediate and initial types are either both
3482 float or both integer, we don't need the middle conversion if the
3483 former is wider than the latter and doesn't change the signedness
3484 (for integers). Avoid this if the final type is a pointer since
3485 then we sometimes need the middle conversion. */
3486 (if (((inter_int && inside_int) || (inter_float && inside_float))
3487 && (final_int || final_float)
3488 && inter_prec >= inside_prec
3489 && (inter_float || inter_unsignedp == inside_unsignedp))
3492 /* If we have a sign-extension of a zero-extended value, we can
3493 replace that by a single zero-extension. Likewise if the
3494 final conversion does not change precision we can drop the
3495 intermediate conversion. */
3496 (if (inside_int && inter_int && final_int
3497 && ((inside_prec < inter_prec && inter_prec < final_prec
3498 && inside_unsignedp && !inter_unsignedp)
3499 || final_prec == inter_prec))
3502 /* Two conversions in a row are not needed unless:
3503 - some conversion is floating-point (overstrict for now), or
3504 - some conversion is a vector (overstrict for now), or
3505 - the intermediate type is narrower than both initial and
3507 - the intermediate type and innermost type differ in signedness,
3508 and the outermost type is wider than the intermediate, or
3509 - the initial type is a pointer type and the precisions of the
3510 intermediate and final types differ, or
3511 - the final type is a pointer type and the precisions of the
3512 initial and intermediate types differ. */
3513 (if (! inside_float && ! inter_float && ! final_float
3514 && ! inside_vec && ! inter_vec && ! final_vec
3515 && (inter_prec >= inside_prec || inter_prec >= final_prec)
3516 && ! (inside_int && inter_int
3517 && inter_unsignedp != inside_unsignedp
3518 && inter_prec < final_prec)
3519 && ((inter_unsignedp && inter_prec > inside_prec)
3520 == (final_unsignedp && final_prec > inter_prec))
3521 && ! (inside_ptr && inter_prec != final_prec)
3522 && ! (final_ptr && inside_prec != inter_prec))
3525 /* A truncation to an unsigned type (a zero-extension) should be
3526 canonicalized as bitwise and of a mask. */
3527 (if (GIMPLE /* PR70366: doing this in GENERIC breaks -Wconversion. */
3528 && final_int && inter_int && inside_int
3529 && final_prec == inside_prec
3530 && final_prec > inter_prec
3532 (convert (bit_and @0 { wide_int_to_tree
3534 wi::mask (inter_prec, false,
3535 TYPE_PRECISION (inside_type))); })))
3537 /* If we are converting an integer to a floating-point that can
3538 represent it exactly and back to an integer, we can skip the
3539 floating-point conversion. */
3540 (if (GIMPLE /* PR66211 */
3541 && inside_int && inter_float && final_int &&
3542 (unsigned) significand_size (TYPE_MODE (inter_type))
3543 >= inside_prec - !inside_unsignedp)
3546 /* If we have a narrowing conversion to an integral type that is fed by a
3547 BIT_AND_EXPR, we might be able to remove the BIT_AND_EXPR if it merely
3548 masks off bits outside the final type (and nothing else). */
3550 (convert (bit_and @0 INTEGER_CST@1))
3551 (if (INTEGRAL_TYPE_P (type)
3552 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
3553 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))
3554 && operand_equal_p (@1, build_low_bits_mask (TREE_TYPE (@1),
3555 TYPE_PRECISION (type)), 0))
3559 /* (X /[ex] A) * A -> X. */
3561 (mult (convert1? (exact_div @0 @@1)) (convert2? @1))
3564 /* Simplify (A / B) * B + (A % B) -> A. */
3565 (for div (trunc_div ceil_div floor_div round_div)
3566 mod (trunc_mod ceil_mod floor_mod round_mod)
3568 (plus:c (mult:c (div @0 @1) @1) (mod @0 @1))
3571 /* ((X /[ex] A) +- B) * A --> X +- A * B. */
3572 (for op (plus minus)
3574 (mult (convert1? (op (convert2? (exact_div @0 INTEGER_CST@@1)) INTEGER_CST@2)) @1)
3575 (if (tree_nop_conversion_p (type, TREE_TYPE (@2))
3576 && tree_nop_conversion_p (TREE_TYPE (@0), TREE_TYPE (@2)))
3579 wi::overflow_type overflow;
3580 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@2),
3581 TYPE_SIGN (type), &overflow);
3583 (if (types_match (type, TREE_TYPE (@2))
3584 && types_match (TREE_TYPE (@0), TREE_TYPE (@2)) && !overflow)
3585 (op @0 { wide_int_to_tree (type, mul); })
3586 (with { tree utype = unsigned_type_for (type); }
3587 (convert (op (convert:utype @0)
3588 (mult (convert:utype @1) (convert:utype @2))))))))))
3590 /* Canonicalization of binary operations. */
3592 /* Convert X + -C into X - C. */
3594 (plus @0 REAL_CST@1)
3595 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
3596 (with { tree tem = const_unop (NEGATE_EXPR, type, @1); }
3597 (if (!TREE_OVERFLOW (tem) || !flag_trapping_math)
3598 (minus @0 { tem; })))))
3600 /* Convert x+x into x*2. */
3603 (if (SCALAR_FLOAT_TYPE_P (type))
3604 (mult @0 { build_real (type, dconst2); })
3605 (if (INTEGRAL_TYPE_P (type))
3606 (mult @0 { build_int_cst (type, 2); }))))
3610 (minus integer_zerop @1)
3613 (pointer_diff integer_zerop @1)
3614 (negate (convert @1)))
3616 /* (ARG0 - ARG1) is the same as (-ARG1 + ARG0). So check whether
3617 ARG0 is zero and X + ARG0 reduces to X, since that would mean
3618 (-ARG1 + ARG0) reduces to -ARG1. */
3620 (minus real_zerop@0 @1)
3621 (if (fold_real_zero_addition_p (type, @1, @0, 0))
3624 /* Transform x * -1 into -x. */
3626 (mult @0 integer_minus_onep)
3629 /* Reassociate (X * CST) * Y to (X * Y) * CST. This does not introduce
3630 signed overflow for CST != 0 && CST != -1. */
3632 (mult:c (mult:s@3 @0 INTEGER_CST@1) @2)
3633 (if (TREE_CODE (@2) != INTEGER_CST
3635 && !integer_zerop (@1) && !integer_minus_onep (@1))
3636 (mult (mult @0 @2) @1)))
3638 /* True if we can easily extract the real and imaginary parts of a complex
3640 (match compositional_complex
3641 (convert? (complex @0 @1)))
3643 /* COMPLEX_EXPR and REALPART/IMAGPART_EXPR cancellations. */
3645 (complex (realpart @0) (imagpart @0))
3648 (realpart (complex @0 @1))
3651 (imagpart (complex @0 @1))
3654 /* Sometimes we only care about half of a complex expression. */
3656 (realpart (convert?:s (conj:s @0)))
3657 (convert (realpart @0)))
3659 (imagpart (convert?:s (conj:s @0)))
3660 (convert (negate (imagpart @0))))
3661 (for part (realpart imagpart)
3662 (for op (plus minus)
3664 (part (convert?:s@2 (op:s @0 @1)))
3665 (convert (op (part @0) (part @1))))))
3667 (realpart (convert?:s (CEXPI:s @0)))
3670 (imagpart (convert?:s (CEXPI:s @0)))
3673 /* conj(conj(x)) -> x */
3675 (conj (convert? (conj @0)))
3676 (if (tree_nop_conversion_p (TREE_TYPE (@0), type))
3679 /* conj({x,y}) -> {x,-y} */
3681 (conj (convert?:s (complex:s @0 @1)))
3682 (with { tree itype = TREE_TYPE (type); }
3683 (complex (convert:itype @0) (negate (convert:itype @1)))))
3685 /* BSWAP simplifications, transforms checked by gcc.dg/builtin-bswap-8.c. */
3686 (for bswap (BUILT_IN_BSWAP16 BUILT_IN_BSWAP32
3687 BUILT_IN_BSWAP64 BUILT_IN_BSWAP128)
3692 (bswap (bit_not (bswap @0)))
3694 (for bitop (bit_xor bit_ior bit_and)
3696 (bswap (bitop:c (bswap @0) @1))
3697 (bitop @0 (bswap @1))))
3700 (cmp (bswap@2 @0) (bswap @1))
3701 (with { tree ctype = TREE_TYPE (@2); }
3702 (cmp (convert:ctype @0) (convert:ctype @1))))
3704 (cmp (bswap @0) INTEGER_CST@1)
3705 (with { tree ctype = TREE_TYPE (@1); }
3706 (cmp (convert:ctype @0) (bswap @1)))))
3707 /* (bswap(x) >> C1) & C2 can sometimes be simplified to (x >> C3) & C2. */
3709 (bit_and (convert1? (rshift@0 (convert2? (bswap@4 @1)) INTEGER_CST@2))
3711 (if (BITS_PER_UNIT == 8
3712 && tree_fits_uhwi_p (@2)
3713 && tree_fits_uhwi_p (@3))
3716 unsigned HOST_WIDE_INT prec = TYPE_PRECISION (TREE_TYPE (@4));
3717 unsigned HOST_WIDE_INT bits = tree_to_uhwi (@2);
3718 unsigned HOST_WIDE_INT mask = tree_to_uhwi (@3);
3719 unsigned HOST_WIDE_INT lo = bits & 7;
3720 unsigned HOST_WIDE_INT hi = bits - lo;
3723 && mask < (256u>>lo)
3724 && bits < TYPE_PRECISION (TREE_TYPE(@0)))
3725 (with { unsigned HOST_WIDE_INT ns = (prec - (hi + 8)) + lo; }
3727 (bit_and (convert @1) @3)
3730 tree utype = unsigned_type_for (TREE_TYPE (@1));
3731 tree nst = build_int_cst (integer_type_node, ns);
3733 (bit_and (convert (rshift:utype (convert:utype @1) {nst;})) @3))))))))
3734 /* bswap(x) >> C1 can sometimes be simplified to (T)x >> C2. */
3736 (rshift (convert? (bswap@2 @0)) INTEGER_CST@1)
3737 (if (BITS_PER_UNIT == 8
3738 && CHAR_TYPE_SIZE == 8
3739 && tree_fits_uhwi_p (@1))
3742 unsigned HOST_WIDE_INT prec = TYPE_PRECISION (TREE_TYPE (@2));
3743 unsigned HOST_WIDE_INT bits = tree_to_uhwi (@1);
3744 /* If the bswap was extended before the original shift, this
3745 byte (shift) has the sign of the extension, not the sign of
3746 the original shift. */
3747 tree st = TYPE_PRECISION (type) > prec ? TREE_TYPE (@2) : type;
3749 /* Special case: logical right shift of sign-extended bswap.
3750 (unsigned)(short)bswap16(x)>>12 is (unsigned)((short)x<<8)>>12. */
3751 (if (TYPE_PRECISION (type) > prec
3752 && !TYPE_UNSIGNED (TREE_TYPE (@2))
3753 && TYPE_UNSIGNED (type)
3754 && bits < prec && bits + 8 >= prec)
3755 (with { tree nst = build_int_cst (integer_type_node, prec - 8); }
3756 (rshift (convert (lshift:st (convert:st @0) {nst;})) @1))
3757 (if (bits + 8 == prec)
3758 (if (TYPE_UNSIGNED (st))
3759 (convert (convert:unsigned_char_type_node @0))
3760 (convert (convert:signed_char_type_node @0)))
3761 (if (bits < prec && bits + 8 > prec)
3764 tree nst = build_int_cst (integer_type_node, bits & 7);
3765 tree bt = TYPE_UNSIGNED (st) ? unsigned_char_type_node
3766 : signed_char_type_node;
3768 (convert (rshift:bt (convert:bt @0) {nst;})))))))))
3769 /* bswap(x) & C1 can sometimes be simplified to (x >> C2) & C1. */
3771 (bit_and (convert? (bswap@2 @0)) INTEGER_CST@1)
3772 (if (BITS_PER_UNIT == 8
3773 && tree_fits_uhwi_p (@1)
3774 && tree_to_uhwi (@1) < 256)
3777 unsigned HOST_WIDE_INT prec = TYPE_PRECISION (TREE_TYPE (@2));
3778 tree utype = unsigned_type_for (TREE_TYPE (@0));
3779 tree nst = build_int_cst (integer_type_node, prec - 8);
3781 (bit_and (convert (rshift:utype (convert:utype @0) {nst;})) @1)))))
3784 /* Combine COND_EXPRs and VEC_COND_EXPRs. */
3786 /* Simplify constant conditions.
3787 Only optimize constant conditions when the selected branch
3788 has the same type as the COND_EXPR. This avoids optimizing
3789 away "c ? x : throw", where the throw has a void type.
3790 Note that we cannot throw away the fold-const.c variant nor
3791 this one as we depend on doing this transform before possibly
3792 A ? B : B -> B triggers and the fold-const.c one can optimize
3793 0 ? A : B to B even if A has side-effects. Something
3794 genmatch cannot handle. */
3796 (cond INTEGER_CST@0 @1 @2)
3797 (if (integer_zerop (@0))
3798 (if (!VOID_TYPE_P (TREE_TYPE (@2)) || VOID_TYPE_P (type))
3800 (if (!VOID_TYPE_P (TREE_TYPE (@1)) || VOID_TYPE_P (type))
3803 (vec_cond VECTOR_CST@0 @1 @2)
3804 (if (integer_all_onesp (@0))
3806 (if (integer_zerop (@0))
3810 /* Sink unary operations to branches, but only if we do fold both. */
3811 (for op (negate bit_not abs absu)
3813 (op (vec_cond:s @0 @1 @2))
3814 (vec_cond @0 (op! @1) (op! @2))))
3816 /* Sink binary operation to branches, but only if we can fold it. */
3817 (for op (tcc_comparison plus minus mult bit_and bit_ior bit_xor
3818 lshift rshift rdiv trunc_div ceil_div floor_div round_div
3819 trunc_mod ceil_mod floor_mod round_mod min max)
3820 /* (c ? a : b) op (c ? d : e) --> c ? (a op d) : (b op e) */
3822 (op (vec_cond:s @0 @1 @2) (vec_cond:s @0 @3 @4))
3823 (vec_cond @0 (op! @1 @3) (op! @2 @4)))
3825 /* (c ? a : b) op d --> c ? (a op d) : (b op d) */
3827 (op (vec_cond:s @0 @1 @2) @3)
3828 (vec_cond @0 (op! @1 @3) (op! @2 @3)))
3830 (op @3 (vec_cond:s @0 @1 @2))
3831 (vec_cond @0 (op! @3 @1) (op! @3 @2))))
3834 /* (v ? w : 0) ? a : b is just (v & w) ? a : b
3835 Currently disabled after pass lvec because ARM understands
3836 VEC_COND_EXPR<v==w,-1,0> but not a plain v==w fed to BIT_IOR_EXPR. */
3838 (vec_cond (vec_cond:s @0 @3 integer_zerop) @1 @2)
3839 (if (optimize_vectors_before_lowering_p () && types_match (@0, @3))
3840 (vec_cond (bit_and @0 @3) @1 @2)))
3842 (vec_cond (vec_cond:s @0 integer_all_onesp @3) @1 @2)
3843 (if (optimize_vectors_before_lowering_p () && types_match (@0, @3))
3844 (vec_cond (bit_ior @0 @3) @1 @2)))
3846 (vec_cond (vec_cond:s @0 integer_zerop @3) @1 @2)
3847 (if (optimize_vectors_before_lowering_p () && types_match (@0, @3))
3848 (vec_cond (bit_ior @0 (bit_not @3)) @2 @1)))
3850 (vec_cond (vec_cond:s @0 @3 integer_all_onesp) @1 @2)
3851 (if (optimize_vectors_before_lowering_p () && types_match (@0, @3))
3852 (vec_cond (bit_and @0 (bit_not @3)) @2 @1)))
3854 /* c1 ? c2 ? a : b : b --> (c1 & c2) ? a : b */
3856 (vec_cond @0 (vec_cond:s @1 @2 @3) @3)
3857 (if (optimize_vectors_before_lowering_p () && types_match (@0, @1))
3858 (vec_cond (bit_and @0 @1) @2 @3)))
3860 (vec_cond @0 @2 (vec_cond:s @1 @2 @3))
3861 (if (optimize_vectors_before_lowering_p () && types_match (@0, @1))
3862 (vec_cond (bit_ior @0 @1) @2 @3)))
3864 (vec_cond @0 (vec_cond:s @1 @2 @3) @2)
3865 (if (optimize_vectors_before_lowering_p () && types_match (@0, @1))
3866 (vec_cond (bit_ior (bit_not @0) @1) @2 @3)))
3868 (vec_cond @0 @3 (vec_cond:s @1 @2 @3))
3869 (if (optimize_vectors_before_lowering_p () && types_match (@0, @1))
3870 (vec_cond (bit_and (bit_not @0) @1) @2 @3)))
3872 /* Canonicalize mask ? { 0, ... } : { -1, ...} to ~mask if the mask
3873 types are compatible. */
3875 (vec_cond @0 VECTOR_CST@1 VECTOR_CST@2)
3876 (if (VECTOR_BOOLEAN_TYPE_P (type)
3877 && types_match (type, TREE_TYPE (@0)))
3878 (if (integer_zerop (@1) && integer_all_onesp (@2))
3880 (if (integer_all_onesp (@1) && integer_zerop (@2))
3883 /* A few simplifications of "a ? CST1 : CST2". */
3884 /* NOTE: Only do this on gimple as the if-chain-to-switch
3885 optimization depends on the gimple to have if statements in it. */
3888 (cond @0 INTEGER_CST@1 INTEGER_CST@2)
3890 (if (integer_zerop (@2))
3892 /* a ? 1 : 0 -> a if 0 and 1 are integral types. */
3893 (if (integer_onep (@1))
3894 (convert (convert:boolean_type_node @0)))
3895 /* a ? -1 : 0 -> -a. */
3896 (if (INTEGRAL_TYPE_P (type) && integer_all_onesp (@1))
3897 (negate (convert (convert:boolean_type_node @0))))
3898 /* a ? powerof2cst : 0 -> a << (log2(powerof2cst)) */
3899 (if (INTEGRAL_TYPE_P (type) && integer_pow2p (@1))
3901 tree shift = build_int_cst (integer_type_node, tree_log2 (@1));
3903 (lshift (convert (convert:boolean_type_node @0)) { shift; })))))
3904 (if (integer_zerop (@1))
3906 tree booltrue = constant_boolean_node (true, boolean_type_node);
3909 /* a ? 0 : 1 -> !a. */
3910 (if (integer_onep (@2))
3911 (convert (bit_xor (convert:boolean_type_node @0) { booltrue; } )))
3912 /* a ? -1 : 0 -> -(!a). */
3913 (if (INTEGRAL_TYPE_P (type) && integer_all_onesp (@2))
3914 (negate (convert (bit_xor (convert:boolean_type_node @0) { booltrue; } ))))
3915 /* a ? powerof2cst : 0 -> (!a) << (log2(powerof2cst)) */
3916 (if (INTEGRAL_TYPE_P (type) && integer_pow2p (@2))
3918 tree shift = build_int_cst (integer_type_node, tree_log2 (@2));
3920 (lshift (convert (bit_xor (convert:boolean_type_node @0) { booltrue; } ))
3924 /* Simplification moved from fold_cond_expr_with_comparison. It may also
3926 /* This pattern implements two kinds simplification:
3929 (cond (cmp (convert1? x) c1) (convert2? x) c2) -> (minmax (x c)) if:
3930 1) Conversions are type widening from smaller type.
3931 2) Const c1 equals to c2 after canonicalizing comparison.
3932 3) Comparison has tree code LT, LE, GT or GE.
3933 This specific pattern is needed when (cmp (convert x) c) may not
3934 be simplified by comparison patterns because of multiple uses of
3935 x. It also makes sense here because simplifying across multiple
3936 referred var is always benefitial for complicated cases.
3939 (cond (eq (convert1? x) c1) (convert2? x) c2) -> (cond (eq x c1) c1 c2). */
3940 (for cmp (lt le gt ge eq)
3942 (cond (cmp (convert1? @1) INTEGER_CST@3) (convert2? @1) INTEGER_CST@2)
3945 tree from_type = TREE_TYPE (@1);
3946 tree c1_type = TREE_TYPE (@3), c2_type = TREE_TYPE (@2);
3947 enum tree_code code = ERROR_MARK;
3949 if (INTEGRAL_TYPE_P (from_type)
3950 && int_fits_type_p (@2, from_type)
3951 && (types_match (c1_type, from_type)
3952 || (TYPE_PRECISION (c1_type) > TYPE_PRECISION (from_type)
3953 && (TYPE_UNSIGNED (from_type)
3954 || TYPE_SIGN (c1_type) == TYPE_SIGN (from_type))))
3955 && (types_match (c2_type, from_type)
3956 || (TYPE_PRECISION (c2_type) > TYPE_PRECISION (from_type)
3957 && (TYPE_UNSIGNED (from_type)
3958 || TYPE_SIGN (c2_type) == TYPE_SIGN (from_type)))))
3962 if (wi::to_widest (@3) == (wi::to_widest (@2) - 1))
3964 /* X <= Y - 1 equals to X < Y. */
3967 /* X > Y - 1 equals to X >= Y. */
3971 if (wi::to_widest (@3) == (wi::to_widest (@2) + 1))
3973 /* X < Y + 1 equals to X <= Y. */
3976 /* X >= Y + 1 equals to X > Y. */
3980 if (code != ERROR_MARK
3981 || wi::to_widest (@2) == wi::to_widest (@3))
3983 if (cmp == LT_EXPR || cmp == LE_EXPR)
3985 if (cmp == GT_EXPR || cmp == GE_EXPR)
3989 /* Can do A == C1 ? A : C2 -> A == C1 ? C1 : C2? */
3990 else if (int_fits_type_p (@3, from_type))
3994 (if (code == MAX_EXPR)
3995 (convert (max @1 (convert @2)))
3996 (if (code == MIN_EXPR)
3997 (convert (min @1 (convert @2)))
3998 (if (code == EQ_EXPR)
3999 (convert (cond (eq @1 (convert @3))
4000 (convert:from_type @3) (convert:from_type @2)))))))))
4002 /* (cond (cmp (convert? x) c1) (op x c2) c3) -> (op (minmax x c1) c2) if:
4004 1) OP is PLUS or MINUS.
4005 2) CMP is LT, LE, GT or GE.
4006 3) C3 == (C1 op C2), and computation doesn't have undefined behavior.
4008 This pattern also handles special cases like:
4010 A) Operand x is a unsigned to signed type conversion and c1 is
4011 integer zero. In this case,
4012 (signed type)x < 0 <=> x > MAX_VAL(signed type)
4013 (signed type)x >= 0 <=> x <= MAX_VAL(signed type)
4014 B) Const c1 may not equal to (C3 op' C2). In this case we also
4015 check equality for (c1+1) and (c1-1) by adjusting comparison
4018 TODO: Though signed type is handled by this pattern, it cannot be
4019 simplified at the moment because C standard requires additional
4020 type promotion. In order to match&simplify it here, the IR needs
4021 to be cleaned up by other optimizers, i.e, VRP. */
4022 (for op (plus minus)
4023 (for cmp (lt le gt ge)
4025 (cond (cmp (convert? @X) INTEGER_CST@1) (op @X INTEGER_CST@2) INTEGER_CST@3)
4026 (with { tree from_type = TREE_TYPE (@X), to_type = TREE_TYPE (@1); }
4027 (if (types_match (from_type, to_type)
4028 /* Check if it is special case A). */
4029 || (TYPE_UNSIGNED (from_type)
4030 && !TYPE_UNSIGNED (to_type)
4031 && TYPE_PRECISION (from_type) == TYPE_PRECISION (to_type)
4032 && integer_zerop (@1)
4033 && (cmp == LT_EXPR || cmp == GE_EXPR)))
4036 wi::overflow_type overflow = wi::OVF_NONE;
4037 enum tree_code code, cmp_code = cmp;
4039 wide_int c1 = wi::to_wide (@1);
4040 wide_int c2 = wi::to_wide (@2);
4041 wide_int c3 = wi::to_wide (@3);
4042 signop sgn = TYPE_SIGN (from_type);
4044 /* Handle special case A), given x of unsigned type:
4045 ((signed type)x < 0) <=> (x > MAX_VAL(signed type))
4046 ((signed type)x >= 0) <=> (x <= MAX_VAL(signed type)) */
4047 if (!types_match (from_type, to_type))
4049 if (cmp_code == LT_EXPR)
4051 if (cmp_code == GE_EXPR)
4053 c1 = wi::max_value (to_type);
4055 /* To simplify this pattern, we require c3 = (c1 op c2). Here we
4056 compute (c3 op' c2) and check if it equals to c1 with op' being
4057 the inverted operator of op. Make sure overflow doesn't happen
4058 if it is undefined. */
4059 if (op == PLUS_EXPR)
4060 real_c1 = wi::sub (c3, c2, sgn, &overflow);
4062 real_c1 = wi::add (c3, c2, sgn, &overflow);
4065 if (!overflow || !TYPE_OVERFLOW_UNDEFINED (from_type))
4067 /* Check if c1 equals to real_c1. Boundary condition is handled
4068 by adjusting comparison operation if necessary. */
4069 if (!wi::cmp (wi::sub (real_c1, 1, sgn, &overflow), c1, sgn)
4072 /* X <= Y - 1 equals to X < Y. */
4073 if (cmp_code == LE_EXPR)
4075 /* X > Y - 1 equals to X >= Y. */
4076 if (cmp_code == GT_EXPR)
4079 if (!wi::cmp (wi::add (real_c1, 1, sgn, &overflow), c1, sgn)
4082 /* X < Y + 1 equals to X <= Y. */
4083 if (cmp_code == LT_EXPR)
4085 /* X >= Y + 1 equals to X > Y. */
4086 if (cmp_code == GE_EXPR)
4089 if (code != cmp_code || !wi::cmp (real_c1, c1, sgn))
4091 if (cmp_code == LT_EXPR || cmp_code == LE_EXPR)
4093 if (cmp_code == GT_EXPR || cmp_code == GE_EXPR)
4098 (if (code == MAX_EXPR)
4099 (op (max @X { wide_int_to_tree (from_type, real_c1); })
4100 { wide_int_to_tree (from_type, c2); })
4101 (if (code == MIN_EXPR)
4102 (op (min @X { wide_int_to_tree (from_type, real_c1); })
4103 { wide_int_to_tree (from_type, c2); })))))))))
4105 (for cnd (cond vec_cond)
4106 /* A ? B : (A ? X : C) -> A ? B : C. */
4108 (cnd @0 (cnd @0 @1 @2) @3)
4111 (cnd @0 @1 (cnd @0 @2 @3))
4113 /* A ? B : (!A ? C : X) -> A ? B : C. */
4114 /* ??? This matches embedded conditions open-coded because genmatch
4115 would generate matching code for conditions in separate stmts only.
4116 The following is still important to merge then and else arm cases
4117 from if-conversion. */
4119 (cnd @0 @1 (cnd @2 @3 @4))
4120 (if (inverse_conditions_p (@0, @2))
4123 (cnd @0 (cnd @1 @2 @3) @4)
4124 (if (inverse_conditions_p (@0, @1))
4127 /* A ? B : B -> B. */
4132 /* !A ? B : C -> A ? C : B. */
4134 (cnd (logical_inverted_value truth_valued_p@0) @1 @2)
4137 /* abs/negative simplifications moved from fold_cond_expr_with_comparison,
4138 Need to handle (A - B) case as fold_cond_expr_with_comparison does.
4139 Need to handle UN* comparisons.
4141 None of these transformations work for modes with signed
4142 zeros. If A is +/-0, the first two transformations will
4143 change the sign of the result (from +0 to -0, or vice
4144 versa). The last four will fix the sign of the result,
4145 even though the original expressions could be positive or
4146 negative, depending on the sign of A.
4148 Note that all these transformations are correct if A is
4149 NaN, since the two alternatives (A and -A) are also NaNs. */
4151 (for cnd (cond vec_cond)
4152 /* A == 0 ? A : -A same as -A */
4155 (cnd (cmp @0 zerop) @0 (negate@1 @0))
4156 (if (!HONOR_SIGNED_ZEROS (type))
4159 (cnd (cmp @0 zerop) integer_zerop (negate@1 @0))
4160 (if (!HONOR_SIGNED_ZEROS (type))
4163 /* A != 0 ? A : -A same as A */
4166 (cnd (cmp @0 zerop) @0 (negate @0))
4167 (if (!HONOR_SIGNED_ZEROS (type))
4170 (cnd (cmp @0 zerop) @0 integer_zerop)
4171 (if (!HONOR_SIGNED_ZEROS (type))
4174 /* A >=/> 0 ? A : -A same as abs (A) */
4177 (cnd (cmp @0 zerop) @0 (negate @0))
4178 (if (!HONOR_SIGNED_ZEROS (type)
4179 && !TYPE_UNSIGNED (type))
4181 /* A <=/< 0 ? A : -A same as -abs (A) */
4184 (cnd (cmp @0 zerop) @0 (negate @0))
4185 (if (!HONOR_SIGNED_ZEROS (type)
4186 && !TYPE_UNSIGNED (type))
4187 (if (ANY_INTEGRAL_TYPE_P (type)
4188 && !TYPE_OVERFLOW_WRAPS (type))
4190 tree utype = unsigned_type_for (type);
4192 (convert (negate (absu:utype @0))))
4193 (negate (abs @0)))))
4197 /* -(type)!A -> (type)A - 1. */
4199 (negate (convert?:s (logical_inverted_value:s @0)))
4200 (if (INTEGRAL_TYPE_P (type)
4201 && TREE_CODE (type) != BOOLEAN_TYPE
4202 && TYPE_PRECISION (type) > 1
4203 && TREE_CODE (@0) == SSA_NAME
4204 && ssa_name_has_boolean_range (@0))
4205 (plus (convert:type @0) { build_all_ones_cst (type); })))
4207 /* A + (B vcmp C ? 1 : 0) -> A - (B vcmp C ? -1 : 0), since vector comparisons
4208 return all -1 or all 0 results. */
4209 /* ??? We could instead convert all instances of the vec_cond to negate,
4210 but that isn't necessarily a win on its own. */
4212 (plus:c @3 (view_convert? (vec_cond:s @0 integer_each_onep@1 integer_zerop@2)))
4213 (if (VECTOR_TYPE_P (type)
4214 && known_eq (TYPE_VECTOR_SUBPARTS (type),
4215 TYPE_VECTOR_SUBPARTS (TREE_TYPE (@1)))
4216 && (TYPE_MODE (TREE_TYPE (type))
4217 == TYPE_MODE (TREE_TYPE (TREE_TYPE (@1)))))
4218 (minus @3 (view_convert (vec_cond @0 (negate @1) @2)))))
4220 /* ... likewise A - (B vcmp C ? 1 : 0) -> A + (B vcmp C ? -1 : 0). */
4222 (minus @3 (view_convert? (vec_cond:s @0 integer_each_onep@1 integer_zerop@2)))
4223 (if (VECTOR_TYPE_P (type)
4224 && known_eq (TYPE_VECTOR_SUBPARTS (type),
4225 TYPE_VECTOR_SUBPARTS (TREE_TYPE (@1)))
4226 && (TYPE_MODE (TREE_TYPE (type))
4227 == TYPE_MODE (TREE_TYPE (TREE_TYPE (@1)))))
4228 (plus @3 (view_convert (vec_cond @0 (negate @1) @2)))))
4231 /* Simplifications of comparisons. */
4233 /* See if we can reduce the magnitude of a constant involved in a
4234 comparison by changing the comparison code. This is a canonicalization
4235 formerly done by maybe_canonicalize_comparison_1. */
4239 (cmp @0 uniform_integer_cst_p@1)
4240 (with { tree cst = uniform_integer_cst_p (@1); }
4241 (if (tree_int_cst_sgn (cst) == -1)
4242 (acmp @0 { build_uniform_cst (TREE_TYPE (@1),
4243 wide_int_to_tree (TREE_TYPE (cst),
4249 (cmp @0 uniform_integer_cst_p@1)
4250 (with { tree cst = uniform_integer_cst_p (@1); }
4251 (if (tree_int_cst_sgn (cst) == 1)
4252 (acmp @0 { build_uniform_cst (TREE_TYPE (@1),
4253 wide_int_to_tree (TREE_TYPE (cst),
4254 wi::to_wide (cst) - 1)); })))))
4256 /* We can simplify a logical negation of a comparison to the
4257 inverted comparison. As we cannot compute an expression
4258 operator using invert_tree_comparison we have to simulate
4259 that with expression code iteration. */
4260 (for cmp (tcc_comparison)
4261 icmp (inverted_tcc_comparison)
4262 ncmp (inverted_tcc_comparison_with_nans)
4263 /* Ideally we'd like to combine the following two patterns
4264 and handle some more cases by using
4265 (logical_inverted_value (cmp @0 @1))
4266 here but for that genmatch would need to "inline" that.
4267 For now implement what forward_propagate_comparison did. */
4269 (bit_not (cmp @0 @1))
4270 (if (VECTOR_TYPE_P (type)
4271 || (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) == 1))
4272 /* Comparison inversion may be impossible for trapping math,
4273 invert_tree_comparison will tell us. But we can't use
4274 a computed operator in the replacement tree thus we have
4275 to play the trick below. */
4276 (with { enum tree_code ic = invert_tree_comparison
4277 (cmp, HONOR_NANS (@0)); }
4283 (bit_xor (cmp @0 @1) integer_truep)
4284 (with { enum tree_code ic = invert_tree_comparison
4285 (cmp, HONOR_NANS (@0)); }
4291 /* Transform comparisons of the form X - Y CMP 0 to X CMP Y.
4292 ??? The transformation is valid for the other operators if overflow
4293 is undefined for the type, but performing it here badly interacts
4294 with the transformation in fold_cond_expr_with_comparison which
4295 attempts to synthetize ABS_EXPR. */
4297 (for sub (minus pointer_diff)
4299 (cmp (sub@2 @0 @1) integer_zerop)
4300 (if (single_use (@2))
4303 /* Simplify (x < 0) ^ (y < 0) to (x ^ y) < 0 and
4304 (x >= 0) ^ (y >= 0) to (x ^ y) < 0. */
4307 (bit_xor (cmp:s @0 integer_zerop) (cmp:s @1 integer_zerop))
4308 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
4309 && !TYPE_UNSIGNED (TREE_TYPE (@0))
4310 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
4311 (lt (bit_xor @0 @1) { build_zero_cst (TREE_TYPE (@0)); }))))
4312 /* Simplify (x < 0) ^ (y >= 0) to (x ^ y) >= 0 and
4313 (x >= 0) ^ (y < 0) to (x ^ y) >= 0. */
4315 (bit_xor:c (lt:s @0 integer_zerop) (ge:s @1 integer_zerop))
4316 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
4317 && !TYPE_UNSIGNED (TREE_TYPE (@0))
4318 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
4319 (ge (bit_xor @0 @1) { build_zero_cst (TREE_TYPE (@0)); })))
4321 /* Transform comparisons of the form X * C1 CMP 0 to X CMP 0 in the
4322 signed arithmetic case. That form is created by the compiler
4323 often enough for folding it to be of value. One example is in
4324 computing loop trip counts after Operator Strength Reduction. */
4325 (for cmp (simple_comparison)
4326 scmp (swapped_simple_comparison)
4328 (cmp (mult@3 @0 INTEGER_CST@1) integer_zerop@2)
4329 /* Handle unfolded multiplication by zero. */
4330 (if (integer_zerop (@1))
4332 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
4333 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
4335 /* If @1 is negative we swap the sense of the comparison. */
4336 (if (tree_int_cst_sgn (@1) < 0)
4340 /* For integral types with undefined overflow fold
4341 x * C1 == C2 into x == C2 / C1 or false.
4342 If overflow wraps and C1 is odd, simplify to x == C2 / C1 in the ring
4346 (cmp (mult @0 INTEGER_CST@1) INTEGER_CST@2)
4347 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
4348 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
4349 && wi::to_wide (@1) != 0)
4350 (with { widest_int quot; }
4351 (if (wi::multiple_of_p (wi::to_widest (@2), wi::to_widest (@1),
4352 TYPE_SIGN (TREE_TYPE (@0)), "))
4353 (cmp @0 { wide_int_to_tree (TREE_TYPE (@0), quot); })
4354 { constant_boolean_node (cmp == NE_EXPR, type); }))
4355 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
4356 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))
4357 && (wi::bit_and (wi::to_wide (@1), 1) == 1))
4360 tree itype = TREE_TYPE (@0);
4361 int p = TYPE_PRECISION (itype);
4362 wide_int m = wi::one (p + 1) << p;
4363 wide_int a = wide_int::from (wi::to_wide (@1), p + 1, UNSIGNED);
4364 wide_int i = wide_int::from (wi::mod_inv (a, m),
4365 p, TYPE_SIGN (itype));
4366 wide_int_to_tree (itype, wi::mul (i, wi::to_wide (@2)));
4369 /* Simplify comparison of something with itself. For IEEE
4370 floating-point, we can only do some of these simplifications. */
4374 (if (! FLOAT_TYPE_P (TREE_TYPE (@0))
4375 || ! HONOR_NANS (@0))
4376 { constant_boolean_node (true, type); }
4377 (if (cmp != EQ_EXPR)
4383 || ! FLOAT_TYPE_P (TREE_TYPE (@0))
4384 || ! HONOR_NANS (@0))
4385 { constant_boolean_node (false, type); })))
4386 (for cmp (unle unge uneq)
4389 { constant_boolean_node (true, type); }))
4390 (for cmp (unlt ungt)
4396 (if (!flag_trapping_math)
4397 { constant_boolean_node (false, type); }))
4399 /* x == ~x -> false */
4400 /* x != ~x -> true */
4403 (cmp:c @0 (bit_not @0))
4404 { constant_boolean_node (cmp == NE_EXPR, type); }))
4406 /* Fold ~X op ~Y as Y op X. */
4407 (for cmp (simple_comparison)
4409 (cmp (bit_not@2 @0) (bit_not@3 @1))
4410 (if (single_use (@2) && single_use (@3))
4413 /* Fold ~X op C as X op' ~C, where op' is the swapped comparison. */
4414 (for cmp (simple_comparison)
4415 scmp (swapped_simple_comparison)
4417 (cmp (bit_not@2 @0) CONSTANT_CLASS_P@1)
4418 (if (single_use (@2)
4419 && (TREE_CODE (@1) == INTEGER_CST || TREE_CODE (@1) == VECTOR_CST))
4420 (scmp @0 (bit_not @1)))))
4422 (for cmp (simple_comparison)
4423 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
4425 (cmp (convert@2 @0) (convert? @1))
4426 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
4427 && (DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@2))
4428 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0)))
4429 && (DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@2))
4430 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@1))))
4433 tree type1 = TREE_TYPE (@1);
4434 if (TREE_CODE (@1) == REAL_CST && !DECIMAL_FLOAT_TYPE_P (type1))
4436 REAL_VALUE_TYPE orig = TREE_REAL_CST (@1);
4437 if (TYPE_PRECISION (type1) > TYPE_PRECISION (float_type_node)
4438 && exact_real_truncate (TYPE_MODE (float_type_node), &orig))
4439 type1 = float_type_node;
4440 if (TYPE_PRECISION (type1) > TYPE_PRECISION (double_type_node)
4441 && exact_real_truncate (TYPE_MODE (double_type_node), &orig))
4442 type1 = double_type_node;
4445 = (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (type1)
4446 ? TREE_TYPE (@0) : type1);
4448 (if (TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (newtype))
4449 (cmp (convert:newtype @0) (convert:newtype @1))))))
4453 /* IEEE doesn't distinguish +0 and -0 in comparisons. */
4455 /* a CMP (-0) -> a CMP 0 */
4456 (if (REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@1)))
4457 (cmp @0 { build_real (TREE_TYPE (@1), dconst0); }))
4458 /* x != NaN is always true, other ops are always false. */
4459 (if (REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
4460 && ! HONOR_SNANS (@1))
4461 { constant_boolean_node (cmp == NE_EXPR, type); })
4462 /* Fold comparisons against infinity. */
4463 (if (REAL_VALUE_ISINF (TREE_REAL_CST (@1))
4464 && MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (@1))))
4467 REAL_VALUE_TYPE max;
4468 enum tree_code code = cmp;
4469 bool neg = REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1));
4471 code = swap_tree_comparison (code);
4474 /* x > +Inf is always false, if we ignore NaNs or exceptions. */
4475 (if (code == GT_EXPR
4476 && !(HONOR_NANS (@0) && flag_trapping_math))
4477 { constant_boolean_node (false, type); })
4478 (if (code == LE_EXPR)
4479 /* x <= +Inf is always true, if we don't care about NaNs. */
4480 (if (! HONOR_NANS (@0))
4481 { constant_boolean_node (true, type); }
4482 /* x <= +Inf is the same as x == x, i.e. !isnan(x), but this loses
4483 an "invalid" exception. */
4484 (if (!flag_trapping_math)
4486 /* x == +Inf and x >= +Inf are always equal to x > DBL_MAX, but
4487 for == this introduces an exception for x a NaN. */
4488 (if ((code == EQ_EXPR && !(HONOR_NANS (@0) && flag_trapping_math))
4490 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
4492 (lt @0 { build_real (TREE_TYPE (@0), max); })
4493 (gt @0 { build_real (TREE_TYPE (@0), max); }))))
4494 /* x < +Inf is always equal to x <= DBL_MAX. */
4495 (if (code == LT_EXPR)
4496 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
4498 (ge @0 { build_real (TREE_TYPE (@0), max); })
4499 (le @0 { build_real (TREE_TYPE (@0), max); }))))
4500 /* x != +Inf is always equal to !(x > DBL_MAX), but this introduces
4501 an exception for x a NaN so use an unordered comparison. */
4502 (if (code == NE_EXPR)
4503 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
4504 (if (! HONOR_NANS (@0))
4506 (ge @0 { build_real (TREE_TYPE (@0), max); })
4507 (le @0 { build_real (TREE_TYPE (@0), max); }))
4509 (unge @0 { build_real (TREE_TYPE (@0), max); })
4510 (unle @0 { build_real (TREE_TYPE (@0), max); }))))))))))
4512 /* If this is a comparison of a real constant with a PLUS_EXPR
4513 or a MINUS_EXPR of a real constant, we can convert it into a
4514 comparison with a revised real constant as long as no overflow
4515 occurs when unsafe_math_optimizations are enabled. */
4516 (if (flag_unsafe_math_optimizations)
4517 (for op (plus minus)
4519 (cmp (op @0 REAL_CST@1) REAL_CST@2)
4522 tree tem = const_binop (op == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR,
4523 TREE_TYPE (@1), @2, @1);
4525 (if (tem && !TREE_OVERFLOW (tem))
4526 (cmp @0 { tem; }))))))
4528 /* Likewise, we can simplify a comparison of a real constant with
4529 a MINUS_EXPR whose first operand is also a real constant, i.e.
4530 (c1 - x) < c2 becomes x > c1-c2. Reordering is allowed on
4531 floating-point types only if -fassociative-math is set. */
4532 (if (flag_associative_math)
4534 (cmp (minus REAL_CST@0 @1) REAL_CST@2)
4535 (with { tree tem = const_binop (MINUS_EXPR, TREE_TYPE (@1), @0, @2); }
4536 (if (tem && !TREE_OVERFLOW (tem))
4537 (cmp { tem; } @1)))))
4539 /* Fold comparisons against built-in math functions. */
4540 (if (flag_unsafe_math_optimizations && ! flag_errno_math)
4543 (cmp (sq @0) REAL_CST@1)
4545 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
4547 /* sqrt(x) < y is always false, if y is negative. */
4548 (if (cmp == EQ_EXPR || cmp == LT_EXPR || cmp == LE_EXPR)
4549 { constant_boolean_node (false, type); })
4550 /* sqrt(x) > y is always true, if y is negative and we
4551 don't care about NaNs, i.e. negative values of x. */
4552 (if (cmp == NE_EXPR || !HONOR_NANS (@0))
4553 { constant_boolean_node (true, type); })
4554 /* sqrt(x) > y is the same as x >= 0, if y is negative. */
4555 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })))
4556 (if (real_equal (TREE_REAL_CST_PTR (@1), &dconst0))
4558 /* sqrt(x) < 0 is always false. */
4559 (if (cmp == LT_EXPR)
4560 { constant_boolean_node (false, type); })
4561 /* sqrt(x) >= 0 is always true if we don't care about NaNs. */
4562 (if (cmp == GE_EXPR && !HONOR_NANS (@0))
4563 { constant_boolean_node (true, type); })
4564 /* sqrt(x) <= 0 -> x == 0. */
4565 (if (cmp == LE_EXPR)
4567 /* Otherwise sqrt(x) cmp 0 -> x cmp 0. Here cmp can be >=, >,
4568 == or !=. In the last case:
4570 (sqrt(x) != 0) == (NaN != 0) == true == (x != 0)
4572 if x is negative or NaN. Due to -funsafe-math-optimizations,
4573 the results for other x follow from natural arithmetic. */
4575 (if ((cmp == LT_EXPR
4579 && !REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
4580 /* Give up for -frounding-math. */
4581 && !HONOR_SIGN_DEPENDENT_ROUNDING (TREE_TYPE (@0)))
4585 enum tree_code ncmp = cmp;
4586 const real_format *fmt
4587 = REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (@0)));
4588 real_arithmetic (&c2, MULT_EXPR,
4589 &TREE_REAL_CST (@1), &TREE_REAL_CST (@1));
4590 real_convert (&c2, fmt, &c2);
4591 /* See PR91734: if c2 is inexact and sqrt(c2) < c (or sqrt(c2) >= c),
4592 then change LT_EXPR into LE_EXPR or GE_EXPR into GT_EXPR. */
4593 if (!REAL_VALUE_ISINF (c2))
4595 tree c3 = fold_const_call (CFN_SQRT, TREE_TYPE (@0),
4596 build_real (TREE_TYPE (@0), c2));
4597 if (c3 == NULL_TREE || TREE_CODE (c3) != REAL_CST)
4599 else if ((cmp == LT_EXPR || cmp == GE_EXPR)
4600 && real_less (&TREE_REAL_CST (c3), &TREE_REAL_CST (@1)))
4601 ncmp = cmp == LT_EXPR ? LE_EXPR : GT_EXPR;
4602 else if ((cmp == LE_EXPR || cmp == GT_EXPR)
4603 && real_less (&TREE_REAL_CST (@1), &TREE_REAL_CST (c3)))
4604 ncmp = cmp == LE_EXPR ? LT_EXPR : GE_EXPR;
4607 /* With rounding to even, sqrt of up to 3 different values
4608 gives the same normal result, so in some cases c2 needs
4610 REAL_VALUE_TYPE c2alt, tow;
4611 if (cmp == LT_EXPR || cmp == GE_EXPR)
4615 real_nextafter (&c2alt, fmt, &c2, &tow);
4616 real_convert (&c2alt, fmt, &c2alt);
4617 if (REAL_VALUE_ISINF (c2alt))
4621 c3 = fold_const_call (CFN_SQRT, TREE_TYPE (@0),
4622 build_real (TREE_TYPE (@0), c2alt));
4623 if (c3 == NULL_TREE || TREE_CODE (c3) != REAL_CST)
4625 else if (real_equal (&TREE_REAL_CST (c3),
4626 &TREE_REAL_CST (@1)))
4632 (if (cmp == GT_EXPR || cmp == GE_EXPR)
4633 (if (REAL_VALUE_ISINF (c2))
4634 /* sqrt(x) > y is x == +Inf, when y is very large. */
4635 (if (HONOR_INFINITIES (@0))
4636 (eq @0 { build_real (TREE_TYPE (@0), c2); })
4637 { constant_boolean_node (false, type); })
4638 /* sqrt(x) > c is the same as x > c*c. */
4639 (if (ncmp != ERROR_MARK)
4640 (if (ncmp == GE_EXPR)
4641 (ge @0 { build_real (TREE_TYPE (@0), c2); })
4642 (gt @0 { build_real (TREE_TYPE (@0), c2); }))))
4643 /* else if (cmp == LT_EXPR || cmp == LE_EXPR) */
4644 (if (REAL_VALUE_ISINF (c2))
4646 /* sqrt(x) < y is always true, when y is a very large
4647 value and we don't care about NaNs or Infinities. */
4648 (if (! HONOR_NANS (@0) && ! HONOR_INFINITIES (@0))
4649 { constant_boolean_node (true, type); })
4650 /* sqrt(x) < y is x != +Inf when y is very large and we
4651 don't care about NaNs. */
4652 (if (! HONOR_NANS (@0))
4653 (ne @0 { build_real (TREE_TYPE (@0), c2); }))
4654 /* sqrt(x) < y is x >= 0 when y is very large and we
4655 don't care about Infinities. */
4656 (if (! HONOR_INFINITIES (@0))
4657 (ge @0 { build_real (TREE_TYPE (@0), dconst0); }))
4658 /* sqrt(x) < y is x >= 0 && x != +Inf, when y is large. */
4661 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })
4662 (ne @0 { build_real (TREE_TYPE (@0), c2); }))))
4663 /* sqrt(x) < c is the same as x < c*c, if we ignore NaNs. */
4664 (if (ncmp != ERROR_MARK && ! HONOR_NANS (@0))
4665 (if (ncmp == LT_EXPR)
4666 (lt @0 { build_real (TREE_TYPE (@0), c2); })
4667 (le @0 { build_real (TREE_TYPE (@0), c2); }))
4668 /* sqrt(x) < c is the same as x >= 0 && x < c*c. */
4669 (if (ncmp != ERROR_MARK && GENERIC)
4670 (if (ncmp == LT_EXPR)
4672 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })
4673 (lt @0 { build_real (TREE_TYPE (@0), c2); }))
4675 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })
4676 (le @0 { build_real (TREE_TYPE (@0), c2); })))))))))))
4677 /* Transform sqrt(x) cmp sqrt(y) -> x cmp y. */
4679 (cmp (sq @0) (sq @1))
4680 (if (! HONOR_NANS (@0))
4683 /* Optimize various special cases of (FTYPE) N CMP (FTYPE) M. */
4684 (for cmp (lt le eq ne ge gt unordered ordered unlt unle ungt unge uneq ltgt)
4685 icmp (lt le eq ne ge gt unordered ordered lt le gt ge eq ne)
4687 (cmp (float@0 @1) (float @2))
4688 (if (SCALAR_FLOAT_TYPE_P (TREE_TYPE (@0))
4689 && ! DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0)))
4692 format_helper fmt (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (@0))));
4693 tree type1 = TREE_TYPE (@1);
4694 bool type1_signed_p = TYPE_SIGN (type1) == SIGNED;
4695 tree type2 = TREE_TYPE (@2);
4696 bool type2_signed_p = TYPE_SIGN (type2) == SIGNED;
4698 (if (fmt.can_represent_integral_type_p (type1)
4699 && fmt.can_represent_integral_type_p (type2))
4700 (if (cmp == ORDERED_EXPR || cmp == UNORDERED_EXPR)
4701 { constant_boolean_node (cmp == ORDERED_EXPR, type); }
4702 (if (TYPE_PRECISION (type1) > TYPE_PRECISION (type2)
4703 && type1_signed_p >= type2_signed_p)
4704 (icmp @1 (convert @2))
4705 (if (TYPE_PRECISION (type1) < TYPE_PRECISION (type2)
4706 && type1_signed_p <= type2_signed_p)
4707 (icmp (convert:type2 @1) @2)
4708 (if (TYPE_PRECISION (type1) == TYPE_PRECISION (type2)
4709 && type1_signed_p == type2_signed_p)
4710 (icmp @1 @2))))))))))
4712 /* Optimize various special cases of (FTYPE) N CMP CST. */
4713 (for cmp (lt le eq ne ge gt)
4714 icmp (le le eq ne ge ge)
4716 (cmp (float @0) REAL_CST@1)
4717 (if (SCALAR_FLOAT_TYPE_P (TREE_TYPE (@1))
4718 && ! DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@1)))
4721 tree itype = TREE_TYPE (@0);
4722 format_helper fmt (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (@1))));
4723 const REAL_VALUE_TYPE *cst = TREE_REAL_CST_PTR (@1);
4724 /* Be careful to preserve any potential exceptions due to
4725 NaNs. qNaNs are ok in == or != context.
4726 TODO: relax under -fno-trapping-math or
4727 -fno-signaling-nans. */
4729 = real_isnan (cst) && (cst->signalling
4730 || (cmp != EQ_EXPR && cmp != NE_EXPR));
4732 /* TODO: allow non-fitting itype and SNaNs when
4733 -fno-trapping-math. */
4734 (if (fmt.can_represent_integral_type_p (itype) && ! exception_p)
4737 signop isign = TYPE_SIGN (itype);
4738 REAL_VALUE_TYPE imin, imax;
4739 real_from_integer (&imin, fmt, wi::min_value (itype), isign);
4740 real_from_integer (&imax, fmt, wi::max_value (itype), isign);
4742 REAL_VALUE_TYPE icst;
4743 if (cmp == GT_EXPR || cmp == GE_EXPR)
4744 real_ceil (&icst, fmt, cst);
4745 else if (cmp == LT_EXPR || cmp == LE_EXPR)
4746 real_floor (&icst, fmt, cst);
4748 real_trunc (&icst, fmt, cst);
4750 bool cst_int_p = !real_isnan (cst) && real_identical (&icst, cst);
4752 bool overflow_p = false;
4754 = real_to_integer (&icst, &overflow_p, TYPE_PRECISION (itype));
4757 /* Optimize cases when CST is outside of ITYPE's range. */
4758 (if (real_compare (LT_EXPR, cst, &imin))
4759 { constant_boolean_node (cmp == GT_EXPR || cmp == GE_EXPR || cmp == NE_EXPR,
4761 (if (real_compare (GT_EXPR, cst, &imax))
4762 { constant_boolean_node (cmp == LT_EXPR || cmp == LE_EXPR || cmp == NE_EXPR,
4764 /* Remove cast if CST is an integer representable by ITYPE. */
4766 (cmp @0 { gcc_assert (!overflow_p);
4767 wide_int_to_tree (itype, icst_val); })
4769 /* When CST is fractional, optimize
4770 (FTYPE) N == CST -> 0
4771 (FTYPE) N != CST -> 1. */
4772 (if (cmp == EQ_EXPR || cmp == NE_EXPR)
4773 { constant_boolean_node (cmp == NE_EXPR, type); })
4774 /* Otherwise replace with sensible integer constant. */
4777 gcc_checking_assert (!overflow_p);
4779 (icmp @0 { wide_int_to_tree (itype, icst_val); })))))))))
4781 /* Fold A /[ex] B CMP C to A CMP B * C. */
4784 (cmp (exact_div @0 @1) INTEGER_CST@2)
4785 (if (!integer_zerop (@1))
4786 (if (wi::to_wide (@2) == 0)
4788 (if (TREE_CODE (@1) == INTEGER_CST)
4791 wi::overflow_type ovf;
4792 wide_int prod = wi::mul (wi::to_wide (@2), wi::to_wide (@1),
4793 TYPE_SIGN (TREE_TYPE (@1)), &ovf);
4796 { constant_boolean_node (cmp == NE_EXPR, type); }
4797 (cmp @0 { wide_int_to_tree (TREE_TYPE (@0), prod); }))))))))
4798 (for cmp (lt le gt ge)
4800 (cmp (exact_div @0 INTEGER_CST@1) INTEGER_CST@2)
4801 (if (wi::gt_p (wi::to_wide (@1), 0, TYPE_SIGN (TREE_TYPE (@1))))
4804 wi::overflow_type ovf;
4805 wide_int prod = wi::mul (wi::to_wide (@2), wi::to_wide (@1),
4806 TYPE_SIGN (TREE_TYPE (@1)), &ovf);
4809 { constant_boolean_node (wi::lt_p (wi::to_wide (@2), 0,
4810 TYPE_SIGN (TREE_TYPE (@2)))
4811 != (cmp == LT_EXPR || cmp == LE_EXPR), type); }
4812 (cmp @0 { wide_int_to_tree (TREE_TYPE (@0), prod); }))))))
4814 /* Fold (size_t)(A /[ex] B) CMP C to (size_t)A CMP (size_t)B * C or A CMP' 0.
4816 For small C (less than max/B), this is (size_t)A CMP (size_t)B * C.
4817 For large C (more than min/B+2^size), this is also true, with the
4818 multiplication computed modulo 2^size.
4819 For intermediate C, this just tests the sign of A. */
4820 (for cmp (lt le gt ge)
4823 (cmp (convert (exact_div @0 INTEGER_CST@1)) INTEGER_CST@2)
4824 (if (tree_nop_conversion_p (TREE_TYPE (@0), TREE_TYPE (@2))
4825 && TYPE_UNSIGNED (TREE_TYPE (@2)) && !TYPE_UNSIGNED (TREE_TYPE (@0))
4826 && wi::gt_p (wi::to_wide (@1), 0, TYPE_SIGN (TREE_TYPE (@1))))
4829 tree utype = TREE_TYPE (@2);
4830 wide_int denom = wi::to_wide (@1);
4831 wide_int right = wi::to_wide (@2);
4832 wide_int smax = wi::sdiv_trunc (wi::max_value (TREE_TYPE (@0)), denom);
4833 wide_int smin = wi::sdiv_trunc (wi::min_value (TREE_TYPE (@0)), denom);
4834 bool small = wi::leu_p (right, smax);
4835 bool large = wi::geu_p (right, smin);
4837 (if (small || large)
4838 (cmp (convert:utype @0) (mult @2 (convert @1)))
4839 (cmp2 @0 { build_zero_cst (TREE_TYPE (@0)); }))))))
4841 /* Unordered tests if either argument is a NaN. */
4843 (bit_ior (unordered @0 @0) (unordered @1 @1))
4844 (if (types_match (@0, @1))
4847 (bit_and (ordered @0 @0) (ordered @1 @1))
4848 (if (types_match (@0, @1))
4851 (bit_ior:c (unordered @0 @0) (unordered:c@2 @0 @1))
4854 (bit_and:c (ordered @0 @0) (ordered:c@2 @0 @1))
4857 /* Simple range test simplifications. */
4858 /* A < B || A >= B -> true. */
4859 (for test1 (lt le le le ne ge)
4860 test2 (ge gt ge ne eq ne)
4862 (bit_ior:c (test1 @0 @1) (test2 @0 @1))
4863 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
4864 || VECTOR_INTEGER_TYPE_P (TREE_TYPE (@0)))
4865 { constant_boolean_node (true, type); })))
4866 /* A < B && A >= B -> false. */
4867 (for test1 (lt lt lt le ne eq)
4868 test2 (ge gt eq gt eq gt)
4870 (bit_and:c (test1 @0 @1) (test2 @0 @1))
4871 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
4872 || VECTOR_INTEGER_TYPE_P (TREE_TYPE (@0)))
4873 { constant_boolean_node (false, type); })))
4875 /* A & (2**N - 1) <= 2**K - 1 -> A & (2**N - 2**K) == 0
4876 A & (2**N - 1) > 2**K - 1 -> A & (2**N - 2**K) != 0
4878 Note that comparisons
4879 A & (2**N - 1) < 2**K -> A & (2**N - 2**K) == 0
4880 A & (2**N - 1) >= 2**K -> A & (2**N - 2**K) != 0
4881 will be canonicalized to above so there's no need to
4888 (cmp (bit_and@0 @1 INTEGER_CST@2) INTEGER_CST@3)
4889 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)))
4892 tree ty = TREE_TYPE (@0);
4893 unsigned prec = TYPE_PRECISION (ty);
4894 wide_int mask = wi::to_wide (@2, prec);
4895 wide_int rhs = wi::to_wide (@3, prec);
4896 signop sgn = TYPE_SIGN (ty);
4898 (if ((mask & (mask + 1)) == 0 && wi::gt_p (rhs, 0, sgn)
4899 && (rhs & (rhs + 1)) == 0 && wi::ge_p (mask, rhs, sgn))
4900 (eqcmp (bit_and @1 { wide_int_to_tree (ty, mask - rhs); })
4901 { build_zero_cst (ty); }))))))
4903 /* -A CMP -B -> B CMP A. */
4904 (for cmp (tcc_comparison)
4905 scmp (swapped_tcc_comparison)
4907 (cmp (negate @0) (negate @1))
4908 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
4909 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
4910 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))))
4913 (cmp (negate @0) CONSTANT_CLASS_P@1)
4914 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
4915 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
4916 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))))
4917 (with { tree tem = const_unop (NEGATE_EXPR, TREE_TYPE (@0), @1); }
4918 (if (tem && !TREE_OVERFLOW (tem))
4919 (scmp @0 { tem; }))))))
4921 /* Convert ABS_EXPR<x> == 0 or ABS_EXPR<x> != 0 to x == 0 or x != 0. */
4924 (op (abs @0) zerop@1)
4927 /* From fold_sign_changed_comparison and fold_widened_comparison.
4928 FIXME: the lack of symmetry is disturbing. */
4929 (for cmp (simple_comparison)
4931 (cmp (convert@0 @00) (convert?@1 @10))
4932 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
4933 /* Disable this optimization if we're casting a function pointer
4934 type on targets that require function pointer canonicalization. */
4935 && !(targetm.have_canonicalize_funcptr_for_compare ()
4936 && ((POINTER_TYPE_P (TREE_TYPE (@00))
4937 && FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@00))))
4938 || (POINTER_TYPE_P (TREE_TYPE (@10))
4939 && FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@10))))))
4941 (if (TYPE_PRECISION (TREE_TYPE (@00)) == TYPE_PRECISION (TREE_TYPE (@0))
4942 && (TREE_CODE (@10) == INTEGER_CST
4944 && (TYPE_UNSIGNED (TREE_TYPE (@00)) == TYPE_UNSIGNED (TREE_TYPE (@0))
4947 && !POINTER_TYPE_P (TREE_TYPE (@00)))
4948 /* ??? The special-casing of INTEGER_CST conversion was in the original
4949 code and here to avoid a spurious overflow flag on the resulting
4950 constant which fold_convert produces. */
4951 (if (TREE_CODE (@1) == INTEGER_CST)
4952 (cmp @00 { force_fit_type (TREE_TYPE (@00), wi::to_widest (@1), 0,
4953 TREE_OVERFLOW (@1)); })
4954 (cmp @00 (convert @1)))
4956 (if (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (TREE_TYPE (@00)))
4957 /* If possible, express the comparison in the shorter mode. */
4958 (if ((cmp == EQ_EXPR || cmp == NE_EXPR
4959 || TYPE_UNSIGNED (TREE_TYPE (@0)) == TYPE_UNSIGNED (TREE_TYPE (@00))
4960 || (!TYPE_UNSIGNED (TREE_TYPE (@0))
4961 && TYPE_UNSIGNED (TREE_TYPE (@00))))
4962 && (types_match (TREE_TYPE (@10), TREE_TYPE (@00))
4963 || ((TYPE_PRECISION (TREE_TYPE (@00))
4964 >= TYPE_PRECISION (TREE_TYPE (@10)))
4965 && (TYPE_UNSIGNED (TREE_TYPE (@00))
4966 == TYPE_UNSIGNED (TREE_TYPE (@10))))
4967 || (TREE_CODE (@10) == INTEGER_CST
4968 && INTEGRAL_TYPE_P (TREE_TYPE (@00))
4969 && int_fits_type_p (@10, TREE_TYPE (@00)))))
4970 (cmp @00 (convert @10))
4971 (if (TREE_CODE (@10) == INTEGER_CST
4972 && INTEGRAL_TYPE_P (TREE_TYPE (@00))
4973 && !int_fits_type_p (@10, TREE_TYPE (@00)))
4976 tree min = lower_bound_in_type (TREE_TYPE (@10), TREE_TYPE (@00));
4977 tree max = upper_bound_in_type (TREE_TYPE (@10), TREE_TYPE (@00));
4978 bool above = integer_nonzerop (const_binop (LT_EXPR, type, max, @10));
4979 bool below = integer_nonzerop (const_binop (LT_EXPR, type, @10, min));
4981 (if (above || below)
4982 (if (cmp == EQ_EXPR || cmp == NE_EXPR)
4983 { constant_boolean_node (cmp == EQ_EXPR ? false : true, type); }
4984 (if (cmp == LT_EXPR || cmp == LE_EXPR)
4985 { constant_boolean_node (above ? true : false, type); }
4986 (if (cmp == GT_EXPR || cmp == GE_EXPR)
4987 { constant_boolean_node (above ? false : true, type); }))))))))))))
4991 /* SSA names are canonicalized to 2nd place. */
4992 (cmp addr@0 SSA_NAME@1)
4994 { poly_int64 off; tree base; }
4995 /* A local variable can never be pointed to by
4996 the default SSA name of an incoming parameter. */
4997 (if (SSA_NAME_IS_DEFAULT_DEF (@1)
4998 && TREE_CODE (SSA_NAME_VAR (@1)) == PARM_DECL
4999 && (base = get_base_address (TREE_OPERAND (@0, 0)))
5000 && TREE_CODE (base) == VAR_DECL
5001 && auto_var_in_fn_p (base, current_function_decl))
5002 (if (cmp == NE_EXPR)
5003 { constant_boolean_node (true, type); }
5004 { constant_boolean_node (false, type); })
5005 /* If the address is based on @1 decide using the offset. */
5006 (if ((base = get_addr_base_and_unit_offset (TREE_OPERAND (@0, 0), &off))
5007 && TREE_CODE (base) == MEM_REF
5008 && TREE_OPERAND (base, 0) == @1)
5009 (with { off += mem_ref_offset (base).force_shwi (); }
5010 (if (known_ne (off, 0))
5011 { constant_boolean_node (cmp == NE_EXPR, type); }
5012 (if (known_eq (off, 0))
5013 { constant_boolean_node (cmp == EQ_EXPR, type); }))))))))
5015 /* Equality compare simplifications from fold_binary */
5018 /* If we have (A | C) == D where C & ~D != 0, convert this into 0.
5019 Similarly for NE_EXPR. */
5021 (cmp (convert?@3 (bit_ior @0 INTEGER_CST@1)) INTEGER_CST@2)
5022 (if (tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0))
5023 && wi::bit_and_not (wi::to_wide (@1), wi::to_wide (@2)) != 0)
5024 { constant_boolean_node (cmp == NE_EXPR, type); }))
5026 /* (X ^ Y) == 0 becomes X == Y, and (X ^ Y) != 0 becomes X != Y. */
5028 (cmp (bit_xor @0 @1) integer_zerop)
5031 /* (X ^ Y) == Y becomes X == 0.
5032 Likewise (X ^ Y) == X becomes Y == 0. */
5034 (cmp:c (bit_xor:c @0 @1) @0)
5035 (cmp @1 { build_zero_cst (TREE_TYPE (@1)); }))
5038 /* (X & Y) == X becomes (X & ~Y) == 0. */
5040 (cmp:c (bit_and:c @0 @1) @0)
5041 (cmp (bit_and @0 (bit_not! @1)) { build_zero_cst (TREE_TYPE (@0)); }))
5043 (cmp:c (convert@3 (bit_and (convert@2 @0) INTEGER_CST@1)) (convert @0))
5044 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5045 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
5046 && INTEGRAL_TYPE_P (TREE_TYPE (@3))
5047 && TYPE_PRECISION (TREE_TYPE (@2)) == TYPE_PRECISION (TREE_TYPE (@0))
5048 && TYPE_PRECISION (TREE_TYPE (@3)) > TYPE_PRECISION (TREE_TYPE (@2))
5049 && !wi::neg_p (wi::to_wide (@1)))
5050 (cmp (bit_and @0 (convert (bit_not @1)))
5051 { build_zero_cst (TREE_TYPE (@0)); })))
5053 /* (X | Y) == Y becomes (X & ~Y) == 0. */
5055 (cmp:c (bit_ior:c @0 @1) @1)
5056 (cmp (bit_and @0 (bit_not! @1)) { build_zero_cst (TREE_TYPE (@0)); }))
5059 /* (X ^ C1) op C2 can be rewritten as X op (C1 ^ C2). */
5061 (cmp (convert?@3 (bit_xor @0 INTEGER_CST@1)) INTEGER_CST@2)
5062 (if (tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0)))
5063 (cmp @0 (bit_xor @1 (convert @2)))))
5066 (cmp (convert? addr@0) integer_zerop)
5067 (if (tree_single_nonzero_warnv_p (@0, NULL))
5068 { constant_boolean_node (cmp == NE_EXPR, type); }))
5070 /* (X & C) op (Y & C) into (X ^ Y) & C op 0. */
5072 (cmp (bit_and:cs @0 @2) (bit_and:cs @1 @2))
5073 (cmp (bit_and (bit_xor @0 @1) @2) { build_zero_cst (TREE_TYPE (@2)); })))
5075 /* (X < 0) != (Y < 0) into (X ^ Y) < 0.
5076 (X >= 0) != (Y >= 0) into (X ^ Y) < 0.
5077 (X < 0) == (Y < 0) into (X ^ Y) >= 0.
5078 (X >= 0) == (Y >= 0) into (X ^ Y) >= 0. */
5083 (cmp (sgncmp @0 integer_zerop@2) (sgncmp @1 integer_zerop))
5084 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
5085 && !TYPE_UNSIGNED (TREE_TYPE (@0))
5086 && types_match (@0, @1))
5087 (ncmp (bit_xor @0 @1) @2)))))
5088 /* (X < 0) == (Y >= 0) into (X ^ Y) < 0.
5089 (X < 0) != (Y >= 0) into (X ^ Y) >= 0. */
5093 (cmp:c (lt @0 integer_zerop@2) (ge @1 integer_zerop))
5094 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
5095 && !TYPE_UNSIGNED (TREE_TYPE (@0))
5096 && types_match (@0, @1))
5097 (ncmp (bit_xor @0 @1) @2))))
5099 /* If we have (A & C) == C where C is a power of 2, convert this into
5100 (A & C) != 0. Similarly for NE_EXPR. */
5104 (cmp (bit_and@2 @0 integer_pow2p@1) @1)
5105 (icmp @2 { build_zero_cst (TREE_TYPE (@0)); })))
5108 /* x < 0 ? ~y : y into (x >> (prec-1)) ^ y. */
5109 /* x >= 0 ? ~y : y into ~((x >> (prec-1)) ^ y). */
5111 (cond (cmp @0 integer_zerop) (bit_not @1) @1)
5112 (if (INTEGRAL_TYPE_P (type)
5113 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
5114 && !TYPE_UNSIGNED (TREE_TYPE (@0))
5115 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (type))
5118 tree shifter = build_int_cst (integer_type_node, TYPE_PRECISION (type) - 1);
5120 (if (cmp == LT_EXPR)
5121 (bit_xor (convert (rshift @0 {shifter;})) @1)
5122 (bit_not (bit_xor (convert (rshift @0 {shifter;})) @1))))))
5123 /* x < 0 ? y : ~y into ~((x >> (prec-1)) ^ y). */
5124 /* x >= 0 ? y : ~y into (x >> (prec-1)) ^ y. */
5126 (cond (cmp @0 integer_zerop) @1 (bit_not @1))
5127 (if (INTEGRAL_TYPE_P (type)
5128 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
5129 && !TYPE_UNSIGNED (TREE_TYPE (@0))
5130 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (type))
5133 tree shifter = build_int_cst (integer_type_node, TYPE_PRECISION (type) - 1);
5135 (if (cmp == GE_EXPR)
5136 (bit_xor (convert (rshift @0 {shifter;})) @1)
5137 (bit_not (bit_xor (convert (rshift @0 {shifter;})) @1)))))))
5139 /* If we have (A & C) != 0 ? D : 0 where C and D are powers of 2,
5140 convert this into a shift followed by ANDing with D. */
5143 (ne (bit_and @0 integer_pow2p@1) integer_zerop)
5144 INTEGER_CST@2 integer_zerop)
5145 (if (!POINTER_TYPE_P (type) && integer_pow2p (@2))
5147 int shift = (wi::exact_log2 (wi::to_wide (@2))
5148 - wi::exact_log2 (wi::to_wide (@1)));
5152 (lshift (convert @0) { build_int_cst (integer_type_node, shift); }) @2)
5154 (convert (rshift @0 { build_int_cst (integer_type_node, -shift); }))
5157 /* If we have (A & C) != 0 where C is the sign bit of A, convert
5158 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
5162 (cmp (bit_and (convert?@2 @0) integer_pow2p@1) integer_zerop)
5163 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5164 && type_has_mode_precision_p (TREE_TYPE (@0))
5165 && element_precision (@2) >= element_precision (@0)
5166 && wi::only_sign_bit_p (wi::to_wide (@1), element_precision (@0)))
5167 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
5168 (ncmp (convert:stype @0) { build_zero_cst (stype); })))))
5170 /* If we have A < 0 ? C : 0 where C is a power of 2, convert
5171 this into a right shift or sign extension followed by ANDing with C. */
5174 (lt @0 integer_zerop)
5175 INTEGER_CST@1 integer_zerop)
5176 (if (integer_pow2p (@1)
5177 && !TYPE_UNSIGNED (TREE_TYPE (@0)))
5179 int shift = element_precision (@0) - wi::exact_log2 (wi::to_wide (@1)) - 1;
5183 (convert (rshift @0 { build_int_cst (integer_type_node, shift); }))
5185 /* Otherwise ctype must be wider than TREE_TYPE (@0) and pure
5186 sign extension followed by AND with C will achieve the effect. */
5187 (bit_and (convert @0) @1)))))
5189 /* When the addresses are not directly of decls compare base and offset.
5190 This implements some remaining parts of fold_comparison address
5191 comparisons but still no complete part of it. Still it is good
5192 enough to make fold_stmt not regress when not dispatching to fold_binary. */
5193 (for cmp (simple_comparison)
5195 (cmp (convert1?@2 addr@0) (convert2? addr@1))
5198 poly_int64 off0, off1;
5199 tree base0 = get_addr_base_and_unit_offset (TREE_OPERAND (@0, 0), &off0);
5200 tree base1 = get_addr_base_and_unit_offset (TREE_OPERAND (@1, 0), &off1);
5201 if (base0 && TREE_CODE (base0) == MEM_REF)
5203 off0 += mem_ref_offset (base0).force_shwi ();
5204 base0 = TREE_OPERAND (base0, 0);
5206 if (base1 && TREE_CODE (base1) == MEM_REF)
5208 off1 += mem_ref_offset (base1).force_shwi ();
5209 base1 = TREE_OPERAND (base1, 0);
5212 (if (base0 && base1)
5216 /* Punt in GENERIC on variables with value expressions;
5217 the value expressions might point to fields/elements
5218 of other vars etc. */
5220 && ((VAR_P (base0) && DECL_HAS_VALUE_EXPR_P (base0))
5221 || (VAR_P (base1) && DECL_HAS_VALUE_EXPR_P (base1))))
5223 else if (decl_in_symtab_p (base0)
5224 && decl_in_symtab_p (base1))
5225 equal = symtab_node::get_create (base0)
5226 ->equal_address_to (symtab_node::get_create (base1));
5227 else if ((DECL_P (base0)
5228 || TREE_CODE (base0) == SSA_NAME
5229 || TREE_CODE (base0) == STRING_CST)
5231 || TREE_CODE (base1) == SSA_NAME
5232 || TREE_CODE (base1) == STRING_CST))
5233 equal = (base0 == base1);
5236 HOST_WIDE_INT ioff0 = -1, ioff1 = -1;
5237 off0.is_constant (&ioff0);
5238 off1.is_constant (&ioff1);
5239 if ((DECL_P (base0) && TREE_CODE (base1) == STRING_CST)
5240 || (TREE_CODE (base0) == STRING_CST && DECL_P (base1))
5241 || (TREE_CODE (base0) == STRING_CST
5242 && TREE_CODE (base1) == STRING_CST
5243 && ioff0 >= 0 && ioff1 >= 0
5244 && ioff0 < TREE_STRING_LENGTH (base0)
5245 && ioff1 < TREE_STRING_LENGTH (base1)
5246 /* This is a too conservative test that the STRING_CSTs
5247 will not end up being string-merged. */
5248 && strncmp (TREE_STRING_POINTER (base0) + ioff0,
5249 TREE_STRING_POINTER (base1) + ioff1,
5250 MIN (TREE_STRING_LENGTH (base0) - ioff0,
5251 TREE_STRING_LENGTH (base1) - ioff1)) != 0))
5253 else if (!DECL_P (base0) || !DECL_P (base1))
5255 else if (cmp != EQ_EXPR && cmp != NE_EXPR)
5257 /* If this is a pointer comparison, ignore for now even
5258 valid equalities where one pointer is the offset zero
5259 of one object and the other to one past end of another one. */
5260 else if (!INTEGRAL_TYPE_P (TREE_TYPE (@2)))
5262 /* Assume that automatic variables can't be adjacent to global
5264 else if (is_global_var (base0) != is_global_var (base1))
5268 tree sz0 = DECL_SIZE_UNIT (base0);
5269 tree sz1 = DECL_SIZE_UNIT (base1);
5270 /* If sizes are unknown, e.g. VLA or not representable,
5272 if (!tree_fits_poly_int64_p (sz0)
5273 || !tree_fits_poly_int64_p (sz1))
5277 poly_int64 size0 = tree_to_poly_int64 (sz0);
5278 poly_int64 size1 = tree_to_poly_int64 (sz1);
5279 /* If one offset is pointing (or could be) to the beginning
5280 of one object and the other is pointing to one past the
5281 last byte of the other object, punt. */
5282 if (maybe_eq (off0, 0) && maybe_eq (off1, size1))
5284 else if (maybe_eq (off1, 0) && maybe_eq (off0, size0))
5286 /* If both offsets are the same, there are some cases
5287 we know that are ok. Either if we know they aren't
5288 zero, or if we know both sizes are no zero. */
5290 && known_eq (off0, off1)
5291 && (known_ne (off0, 0)
5292 || (known_ne (size0, 0) && known_ne (size1, 0))))
5299 && (cmp == EQ_EXPR || cmp == NE_EXPR
5300 /* If the offsets are equal we can ignore overflow. */
5301 || known_eq (off0, off1)
5302 || TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
5303 /* Or if we compare using pointers to decls or strings. */
5304 || (POINTER_TYPE_P (TREE_TYPE (@2))
5305 && (DECL_P (base0) || TREE_CODE (base0) == STRING_CST))))
5307 (if (cmp == EQ_EXPR && (known_eq (off0, off1) || known_ne (off0, off1)))
5308 { constant_boolean_node (known_eq (off0, off1), type); })
5309 (if (cmp == NE_EXPR && (known_eq (off0, off1) || known_ne (off0, off1)))
5310 { constant_boolean_node (known_ne (off0, off1), type); })
5311 (if (cmp == LT_EXPR && (known_lt (off0, off1) || known_ge (off0, off1)))
5312 { constant_boolean_node (known_lt (off0, off1), type); })
5313 (if (cmp == LE_EXPR && (known_le (off0, off1) || known_gt (off0, off1)))
5314 { constant_boolean_node (known_le (off0, off1), type); })
5315 (if (cmp == GE_EXPR && (known_ge (off0, off1) || known_lt (off0, off1)))
5316 { constant_boolean_node (known_ge (off0, off1), type); })
5317 (if (cmp == GT_EXPR && (known_gt (off0, off1) || known_le (off0, off1)))
5318 { constant_boolean_node (known_gt (off0, off1), type); }))
5321 (if (cmp == EQ_EXPR)
5322 { constant_boolean_node (false, type); })
5323 (if (cmp == NE_EXPR)
5324 { constant_boolean_node (true, type); })))))))))
5326 /* Simplify pointer equality compares using PTA. */
5330 (if (POINTER_TYPE_P (TREE_TYPE (@0))
5331 && ptrs_compare_unequal (@0, @1))
5332 { constant_boolean_node (neeq != EQ_EXPR, type); })))
5334 /* PR70920: Transform (intptr_t)x eq/ne CST to x eq/ne (typeof x) CST.
5335 and (typeof ptr_cst) x eq/ne ptr_cst to x eq/ne (typeof x) CST.
5336 Disable the transform if either operand is pointer to function.
5337 This broke pr22051-2.c for arm where function pointer
5338 canonicalizaion is not wanted. */
5342 (cmp (convert @0) INTEGER_CST@1)
5343 (if (((POINTER_TYPE_P (TREE_TYPE (@0))
5344 && !FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@0)))
5345 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
5346 /* Don't perform this optimization in GENERIC if @0 has reference
5347 type when sanitizing. See PR101210. */
5349 && TREE_CODE (TREE_TYPE (@0)) == REFERENCE_TYPE
5350 && (flag_sanitize & (SANITIZE_NULL | SANITIZE_ALIGNMENT))))
5351 || (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5352 && POINTER_TYPE_P (TREE_TYPE (@1))
5353 && !FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@1)))))
5354 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1)))
5355 (cmp @0 (convert @1)))))
5357 /* Non-equality compare simplifications from fold_binary */
5358 (for cmp (lt gt le ge)
5359 /* Comparisons with the highest or lowest possible integer of
5360 the specified precision will have known values. */
5362 (cmp (convert?@2 @0) uniform_integer_cst_p@1)
5363 (if ((INTEGRAL_TYPE_P (TREE_TYPE (@1))
5364 || POINTER_TYPE_P (TREE_TYPE (@1))
5365 || VECTOR_INTEGER_TYPE_P (TREE_TYPE (@1)))
5366 && tree_nop_conversion_p (TREE_TYPE (@2), TREE_TYPE (@0)))
5369 tree cst = uniform_integer_cst_p (@1);
5370 tree arg1_type = TREE_TYPE (cst);
5371 unsigned int prec = TYPE_PRECISION (arg1_type);
5372 wide_int max = wi::max_value (arg1_type);
5373 wide_int signed_max = wi::max_value (prec, SIGNED);
5374 wide_int min = wi::min_value (arg1_type);
5377 (if (wi::to_wide (cst) == max)
5379 (if (cmp == GT_EXPR)
5380 { constant_boolean_node (false, type); })
5381 (if (cmp == GE_EXPR)
5383 (if (cmp == LE_EXPR)
5384 { constant_boolean_node (true, type); })
5385 (if (cmp == LT_EXPR)
5387 (if (wi::to_wide (cst) == min)
5389 (if (cmp == LT_EXPR)
5390 { constant_boolean_node (false, type); })
5391 (if (cmp == LE_EXPR)
5393 (if (cmp == GE_EXPR)
5394 { constant_boolean_node (true, type); })
5395 (if (cmp == GT_EXPR)
5397 (if (wi::to_wide (cst) == max - 1)
5399 (if (cmp == GT_EXPR)
5400 (eq @2 { build_uniform_cst (TREE_TYPE (@1),
5401 wide_int_to_tree (TREE_TYPE (cst),
5404 (if (cmp == LE_EXPR)
5405 (ne @2 { build_uniform_cst (TREE_TYPE (@1),
5406 wide_int_to_tree (TREE_TYPE (cst),
5409 (if (wi::to_wide (cst) == min + 1)
5411 (if (cmp == GE_EXPR)
5412 (ne @2 { build_uniform_cst (TREE_TYPE (@1),
5413 wide_int_to_tree (TREE_TYPE (cst),
5416 (if (cmp == LT_EXPR)
5417 (eq @2 { build_uniform_cst (TREE_TYPE (@1),
5418 wide_int_to_tree (TREE_TYPE (cst),
5421 (if (wi::to_wide (cst) == signed_max
5422 && TYPE_UNSIGNED (arg1_type)
5423 /* We will flip the signedness of the comparison operator
5424 associated with the mode of @1, so the sign bit is
5425 specified by this mode. Check that @1 is the signed
5426 max associated with this sign bit. */
5427 && prec == GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (arg1_type))
5428 /* signed_type does not work on pointer types. */
5429 && INTEGRAL_TYPE_P (arg1_type))
5430 /* The following case also applies to X < signed_max+1
5431 and X >= signed_max+1 because previous transformations. */
5432 (if (cmp == LE_EXPR || cmp == GT_EXPR)
5433 (with { tree st = signed_type_for (TREE_TYPE (@1)); }
5435 (if (cst == @1 && cmp == LE_EXPR)
5436 (ge (convert:st @0) { build_zero_cst (st); }))
5437 (if (cst == @1 && cmp == GT_EXPR)
5438 (lt (convert:st @0) { build_zero_cst (st); }))
5439 (if (cmp == LE_EXPR)
5440 (ge (view_convert:st @0) { build_zero_cst (st); }))
5441 (if (cmp == GT_EXPR)
5442 (lt (view_convert:st @0) { build_zero_cst (st); })))))))))))
5444 (for cmp (unordered ordered unlt unle ungt unge uneq ltgt)
5445 /* If the second operand is NaN, the result is constant. */
5448 (if (REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
5449 && (cmp != LTGT_EXPR || ! flag_trapping_math))
5450 { constant_boolean_node (cmp == ORDERED_EXPR || cmp == LTGT_EXPR
5451 ? false : true, type); })))
5453 /* Fold UNORDERED if either operand must be NaN, or neither can be. */
5457 (if (tree_expr_nan_p (@0) || tree_expr_nan_p (@1))
5458 { constant_boolean_node (true, type); })
5459 (if (!tree_expr_maybe_nan_p (@0) && !tree_expr_maybe_nan_p (@1))
5460 { constant_boolean_node (false, type); })))
5462 /* Fold ORDERED if either operand must be NaN, or neither can be. */
5466 (if (tree_expr_nan_p (@0) || tree_expr_nan_p (@1))
5467 { constant_boolean_node (false, type); })
5468 (if (!tree_expr_maybe_nan_p (@0) && !tree_expr_maybe_nan_p (@1))
5469 { constant_boolean_node (true, type); })))
5471 /* bool_var != 0 becomes bool_var. */
5473 (ne @0 integer_zerop)
5474 (if (TREE_CODE (TREE_TYPE (@0)) == BOOLEAN_TYPE
5475 && types_match (type, TREE_TYPE (@0)))
5477 /* bool_var == 1 becomes bool_var. */
5479 (eq @0 integer_onep)
5480 (if (TREE_CODE (TREE_TYPE (@0)) == BOOLEAN_TYPE
5481 && types_match (type, TREE_TYPE (@0)))
5484 bool_var == 0 becomes !bool_var or
5485 bool_var != 1 becomes !bool_var
5486 here because that only is good in assignment context as long
5487 as we require a tcc_comparison in GIMPLE_CONDs where we'd
5488 replace if (x == 0) with tem = ~x; if (tem != 0) which is
5489 clearly less optimal and which we'll transform again in forwprop. */
5491 /* When one argument is a constant, overflow detection can be simplified.
5492 Currently restricted to single use so as not to interfere too much with
5493 ADD_OVERFLOW detection in tree-ssa-math-opts.c.
5494 CONVERT?(CONVERT?(A) + CST) CMP A -> A CMP' CST' */
5495 (for cmp (lt le ge gt)
5498 (cmp:c (convert?@3 (plus@2 (convert?@4 @0) INTEGER_CST@1)) @0)
5499 (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@2))
5500 && types_match (TREE_TYPE (@0), TREE_TYPE (@3))
5501 && tree_nop_conversion_p (TREE_TYPE (@4), TREE_TYPE (@0))
5502 && wi::to_wide (@1) != 0
5505 unsigned int prec = TYPE_PRECISION (TREE_TYPE (@0));
5506 signop sign = TYPE_SIGN (TREE_TYPE (@0));
5508 (out @0 { wide_int_to_tree (TREE_TYPE (@0),
5509 wi::max_value (prec, sign)
5510 - wi::to_wide (@1)); })))))
5512 /* To detect overflow in unsigned A - B, A < B is simpler than A - B > A.
5513 However, the detection logic for SUB_OVERFLOW in tree-ssa-math-opts.c
5514 expects the long form, so we restrict the transformation for now. */
5517 (cmp:c (minus@2 @0 @1) @0)
5518 (if (single_use (@2)
5519 && ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
5520 && TYPE_UNSIGNED (TREE_TYPE (@0)))
5523 /* Optimize A - B + -1 >= A into B >= A for unsigned comparisons. */
5526 (cmp:c (plus (minus @0 @1) integer_minus_onep) @0)
5527 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
5528 && TYPE_UNSIGNED (TREE_TYPE (@0)))
5531 /* Testing for overflow is unnecessary if we already know the result. */
5536 (cmp:c (realpart (IFN_SUB_OVERFLOW@2 @0 @1)) @0)
5537 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
5538 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
5539 (out (imagpart @2) { build_zero_cst (TREE_TYPE (@0)); }))))
5544 (cmp:c (realpart (IFN_ADD_OVERFLOW:c@2 @0 @1)) @0)
5545 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
5546 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
5547 (out (imagpart @2) { build_zero_cst (TREE_TYPE (@0)); }))))
5549 /* For unsigned operands, -1 / B < A checks whether A * B would overflow.
5550 Simplify it to __builtin_mul_overflow (A, B, <unused>). */
5554 (cmp:c (trunc_div:s integer_all_onesp @1) @0)
5555 (if (TYPE_UNSIGNED (TREE_TYPE (@0)) && !VECTOR_TYPE_P (TREE_TYPE (@0)))
5556 (with { tree t = TREE_TYPE (@0), cpx = build_complex_type (t); }
5557 (out (imagpart (IFN_MUL_OVERFLOW:cpx @0 @1)) { build_zero_cst (t); })))))
5559 /* Similarly, for unsigned operands, (((type) A * B) >> prec) != 0 where type
5560 is at least twice as wide as type of A and B, simplify to
5561 __builtin_mul_overflow (A, B, <unused>). */
5564 (cmp (rshift (mult:s (convert@3 @0) (convert @1)) INTEGER_CST@2)
5566 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5567 && INTEGRAL_TYPE_P (TREE_TYPE (@3))
5568 && TYPE_UNSIGNED (TREE_TYPE (@0))
5569 && (TYPE_PRECISION (TREE_TYPE (@3))
5570 >= 2 * TYPE_PRECISION (TREE_TYPE (@0)))
5571 && tree_fits_uhwi_p (@2)
5572 && tree_to_uhwi (@2) == TYPE_PRECISION (TREE_TYPE (@0))
5573 && types_match (@0, @1)
5574 && type_has_mode_precision_p (TREE_TYPE (@0))
5575 && (optab_handler (umulv4_optab, TYPE_MODE (TREE_TYPE (@0)))
5576 != CODE_FOR_nothing))
5577 (with { tree t = TREE_TYPE (@0), cpx = build_complex_type (t); }
5578 (cmp (imagpart (IFN_MUL_OVERFLOW:cpx @0 @1)) { build_zero_cst (t); })))))
5580 /* Simplification of math builtins. These rules must all be optimizations
5581 as well as IL simplifications. If there is a possibility that the new
5582 form could be a pessimization, the rule should go in the canonicalization
5583 section that follows this one.
5585 Rules can generally go in this section if they satisfy one of
5588 - the rule describes an identity
5590 - the rule replaces calls with something as simple as addition or
5593 - the rule contains unary calls only and simplifies the surrounding
5594 arithmetic. (The idea here is to exclude non-unary calls in which
5595 one operand is constant and in which the call is known to be cheap
5596 when the operand has that value.) */
5598 (if (flag_unsafe_math_optimizations)
5599 /* Simplify sqrt(x) * sqrt(x) -> x. */
5601 (mult (SQRT_ALL@1 @0) @1)
5602 (if (!tree_expr_maybe_signaling_nan_p (@0))
5605 (for op (plus minus)
5606 /* Simplify (A / C) +- (B / C) -> (A +- B) / C. */
5610 (rdiv (op @0 @2) @1)))
5612 (for cmp (lt le gt ge)
5613 neg_cmp (gt ge lt le)
5614 /* Simplify (x * C1) cmp C2 -> x cmp (C2 / C1), where C1 != 0. */
5616 (cmp (mult @0 REAL_CST@1) REAL_CST@2)
5618 { tree tem = const_binop (RDIV_EXPR, type, @2, @1); }
5620 && !(REAL_VALUE_ISINF (TREE_REAL_CST (tem))
5621 || (real_zerop (tem) && !real_zerop (@1))))
5623 (if (real_less (&dconst0, TREE_REAL_CST_PTR (@1)))
5625 (if (real_less (TREE_REAL_CST_PTR (@1), &dconst0))
5626 (neg_cmp @0 { tem; })))))))
5628 /* Simplify sqrt(x) * sqrt(y) -> sqrt(x*y). */
5629 (for root (SQRT CBRT)
5631 (mult (root:s @0) (root:s @1))
5632 (root (mult @0 @1))))
5634 /* Simplify expN(x) * expN(y) -> expN(x+y). */
5635 (for exps (EXP EXP2 EXP10 POW10)
5637 (mult (exps:s @0) (exps:s @1))
5638 (exps (plus @0 @1))))
5640 /* Simplify a/root(b/c) into a*root(c/b). */
5641 (for root (SQRT CBRT)
5643 (rdiv @0 (root:s (rdiv:s @1 @2)))
5644 (mult @0 (root (rdiv @2 @1)))))
5646 /* Simplify x/expN(y) into x*expN(-y). */
5647 (for exps (EXP EXP2 EXP10 POW10)
5649 (rdiv @0 (exps:s @1))
5650 (mult @0 (exps (negate @1)))))
5652 (for logs (LOG LOG2 LOG10 LOG10)
5653 exps (EXP EXP2 EXP10 POW10)
5654 /* logN(expN(x)) -> x. */
5658 /* expN(logN(x)) -> x. */
5663 /* Optimize logN(func()) for various exponential functions. We
5664 want to determine the value "x" and the power "exponent" in
5665 order to transform logN(x**exponent) into exponent*logN(x). */
5666 (for logs (LOG LOG LOG LOG2 LOG2 LOG2 LOG10 LOG10)
5667 exps (EXP2 EXP10 POW10 EXP EXP10 POW10 EXP EXP2)
5670 (if (SCALAR_FLOAT_TYPE_P (type))
5676 /* Prepare to do logN(exp(exponent)) -> exponent*logN(e). */
5677 x = build_real_truncate (type, dconst_e ());
5680 /* Prepare to do logN(exp2(exponent)) -> exponent*logN(2). */
5681 x = build_real (type, dconst2);
5685 /* Prepare to do logN(exp10(exponent)) -> exponent*logN(10). */
5687 REAL_VALUE_TYPE dconst10;
5688 real_from_integer (&dconst10, VOIDmode, 10, SIGNED);
5689 x = build_real (type, dconst10);
5696 (mult (logs { x; }) @0)))))
5704 (if (SCALAR_FLOAT_TYPE_P (type))
5710 /* Prepare to do logN(sqrt(x)) -> 0.5*logN(x). */
5711 x = build_real (type, dconsthalf);
5714 /* Prepare to do logN(cbrt(x)) -> (1/3)*logN(x). */
5715 x = build_real_truncate (type, dconst_third ());
5721 (mult { x; } (logs @0))))))
5723 /* logN(pow(x,exponent)) -> exponent*logN(x). */
5724 (for logs (LOG LOG2 LOG10)
5728 (mult @1 (logs @0))))
5730 /* pow(C,x) -> exp(log(C)*x) if C > 0,
5731 or if C is a positive power of 2,
5732 pow(C,x) -> exp2(log2(C)*x). */
5740 (pows REAL_CST@0 @1)
5741 (if (real_compare (GT_EXPR, TREE_REAL_CST_PTR (@0), &dconst0)
5742 && real_isfinite (TREE_REAL_CST_PTR (@0))
5743 /* As libmvec doesn't have a vectorized exp2, defer optimizing
5744 the use_exp2 case until after vectorization. It seems actually
5745 beneficial for all constants to postpone this until later,
5746 because exp(log(C)*x), while faster, will have worse precision
5747 and if x folds into a constant too, that is unnecessary
5749 && canonicalize_math_after_vectorization_p ())
5751 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (@0);
5752 bool use_exp2 = false;
5753 if (targetm.libc_has_function (function_c99_misc, TREE_TYPE (@0))
5754 && value->cl == rvc_normal)
5756 REAL_VALUE_TYPE frac_rvt = *value;
5757 SET_REAL_EXP (&frac_rvt, 1);
5758 if (real_equal (&frac_rvt, &dconst1))
5763 (if (optimize_pow_to_exp (@0, @1))
5764 (exps (mult (logs @0) @1)))
5765 (exp2s (mult (log2s @0) @1)))))))
5768 /* pow(C,x)*expN(y) -> expN(logN(C)*x+y) if C > 0. */
5770 exps (EXP EXP2 EXP10 POW10)
5771 logs (LOG LOG2 LOG10 LOG10)
5773 (mult:c (pows:s REAL_CST@0 @1) (exps:s @2))
5774 (if (real_compare (GT_EXPR, TREE_REAL_CST_PTR (@0), &dconst0)
5775 && real_isfinite (TREE_REAL_CST_PTR (@0)))
5776 (exps (plus (mult (logs @0) @1) @2)))))
5781 exps (EXP EXP2 EXP10 POW10)
5782 /* sqrt(expN(x)) -> expN(x*0.5). */
5785 (exps (mult @0 { build_real (type, dconsthalf); })))
5786 /* cbrt(expN(x)) -> expN(x/3). */
5789 (exps (mult @0 { build_real_truncate (type, dconst_third ()); })))
5790 /* pow(expN(x), y) -> expN(x*y). */
5793 (exps (mult @0 @1))))
5795 /* tan(atan(x)) -> x. */
5802 /* Simplify sin(atan(x)) -> x / sqrt(x*x + 1). */
5806 copysigns (COPYSIGN)
5811 REAL_VALUE_TYPE r_cst;
5812 build_sinatan_real (&r_cst, type);
5813 tree t_cst = build_real (type, r_cst);
5814 tree t_one = build_one_cst (type);
5816 (if (SCALAR_FLOAT_TYPE_P (type))
5817 (cond (lt (abs @0) { t_cst; })
5818 (rdiv @0 (sqrts (plus (mult @0 @0) { t_one; })))
5819 (copysigns { t_one; } @0))))))
5821 /* Simplify cos(atan(x)) -> 1 / sqrt(x*x + 1). */
5825 copysigns (COPYSIGN)
5830 REAL_VALUE_TYPE r_cst;
5831 build_sinatan_real (&r_cst, type);
5832 tree t_cst = build_real (type, r_cst);
5833 tree t_one = build_one_cst (type);
5834 tree t_zero = build_zero_cst (type);
5836 (if (SCALAR_FLOAT_TYPE_P (type))
5837 (cond (lt (abs @0) { t_cst; })
5838 (rdiv { t_one; } (sqrts (plus (mult @0 @0) { t_one; })))
5839 (copysigns { t_zero; } @0))))))
5841 (if (!flag_errno_math)
5842 /* Simplify sinh(atanh(x)) -> x / sqrt((1 - x)*(1 + x)). */
5847 (sinhs (atanhs:s @0))
5848 (with { tree t_one = build_one_cst (type); }
5849 (rdiv @0 (sqrts (mult (minus { t_one; } @0) (plus { t_one; } @0)))))))
5851 /* Simplify cosh(atanh(x)) -> 1 / sqrt((1 - x)*(1 + x)) */
5856 (coshs (atanhs:s @0))
5857 (with { tree t_one = build_one_cst (type); }
5858 (rdiv { t_one; } (sqrts (mult (minus { t_one; } @0) (plus { t_one; } @0))))))))
5860 /* cabs(x+0i) or cabs(0+xi) -> abs(x). */
5862 (CABS (complex:C @0 real_zerop@1))
5865 /* trunc(trunc(x)) -> trunc(x), etc. */
5866 (for fns (TRUNC_ALL FLOOR_ALL CEIL_ALL ROUND_ALL NEARBYINT_ALL RINT_ALL)
5870 /* f(x) -> x if x is integer valued and f does nothing for such values. */
5871 (for fns (TRUNC_ALL FLOOR_ALL CEIL_ALL ROUND_ALL NEARBYINT_ALL RINT_ALL)
5873 (fns integer_valued_real_p@0)
5876 /* hypot(x,0) and hypot(0,x) -> abs(x). */
5878 (HYPOT:c @0 real_zerop@1)
5881 /* pow(1,x) -> 1. */
5883 (POW real_onep@0 @1)
5887 /* copysign(x,x) -> x. */
5888 (COPYSIGN_ALL @0 @0)
5892 /* copysign(x,-x) -> -x. */
5893 (COPYSIGN_ALL @0 (negate@1 @0))
5897 /* copysign(x,y) -> fabs(x) if y is nonnegative. */
5898 (COPYSIGN_ALL @0 tree_expr_nonnegative_p@1)
5901 (for scale (LDEXP SCALBN SCALBLN)
5902 /* ldexp(0, x) -> 0. */
5904 (scale real_zerop@0 @1)
5906 /* ldexp(x, 0) -> x. */
5908 (scale @0 integer_zerop@1)
5910 /* ldexp(x, y) -> x if x is +-Inf or NaN. */
5912 (scale REAL_CST@0 @1)
5913 (if (!real_isfinite (TREE_REAL_CST_PTR (@0)))
5916 /* Canonicalization of sequences of math builtins. These rules represent
5917 IL simplifications but are not necessarily optimizations.
5919 The sincos pass is responsible for picking "optimal" implementations
5920 of math builtins, which may be more complicated and can sometimes go
5921 the other way, e.g. converting pow into a sequence of sqrts.
5922 We only want to do these canonicalizations before the pass has run. */
5924 (if (flag_unsafe_math_optimizations && canonicalize_math_p ())
5925 /* Simplify tan(x) * cos(x) -> sin(x). */
5927 (mult:c (TAN:s @0) (COS:s @0))
5930 /* Simplify x * pow(x,c) -> pow(x,c+1). */
5932 (mult:c @0 (POW:s @0 REAL_CST@1))
5933 (if (!TREE_OVERFLOW (@1))
5934 (POW @0 (plus @1 { build_one_cst (type); }))))
5936 /* Simplify sin(x) / cos(x) -> tan(x). */
5938 (rdiv (SIN:s @0) (COS:s @0))
5941 /* Simplify sinh(x) / cosh(x) -> tanh(x). */
5943 (rdiv (SINH:s @0) (COSH:s @0))
5946 /* Simplify tanh (x) / sinh (x) -> 1.0 / cosh (x). */
5948 (rdiv (TANH:s @0) (SINH:s @0))
5949 (rdiv {build_one_cst (type);} (COSH @0)))
5951 /* Simplify cos(x) / sin(x) -> 1 / tan(x). */
5953 (rdiv (COS:s @0) (SIN:s @0))
5954 (rdiv { build_one_cst (type); } (TAN @0)))
5956 /* Simplify sin(x) / tan(x) -> cos(x). */
5958 (rdiv (SIN:s @0) (TAN:s @0))
5959 (if (! HONOR_NANS (@0)
5960 && ! HONOR_INFINITIES (@0))
5963 /* Simplify tan(x) / sin(x) -> 1.0 / cos(x). */
5965 (rdiv (TAN:s @0) (SIN:s @0))
5966 (if (! HONOR_NANS (@0)
5967 && ! HONOR_INFINITIES (@0))
5968 (rdiv { build_one_cst (type); } (COS @0))))
5970 /* Simplify pow(x,y) * pow(x,z) -> pow(x,y+z). */
5972 (mult (POW:s @0 @1) (POW:s @0 @2))
5973 (POW @0 (plus @1 @2)))
5975 /* Simplify pow(x,y) * pow(z,y) -> pow(x*z,y). */
5977 (mult (POW:s @0 @1) (POW:s @2 @1))
5978 (POW (mult @0 @2) @1))
5980 /* Simplify powi(x,y) * powi(z,y) -> powi(x*z,y). */
5982 (mult (POWI:s @0 @1) (POWI:s @2 @1))
5983 (POWI (mult @0 @2) @1))
5985 /* Simplify pow(x,c) / x -> pow(x,c-1). */
5987 (rdiv (POW:s @0 REAL_CST@1) @0)
5988 (if (!TREE_OVERFLOW (@1))
5989 (POW @0 (minus @1 { build_one_cst (type); }))))
5991 /* Simplify x / pow (y,z) -> x * pow(y,-z). */
5993 (rdiv @0 (POW:s @1 @2))
5994 (mult @0 (POW @1 (negate @2))))
5999 /* sqrt(sqrt(x)) -> pow(x,1/4). */
6002 (pows @0 { build_real (type, dconst_quarter ()); }))
6003 /* sqrt(cbrt(x)) -> pow(x,1/6). */
6006 (pows @0 { build_real_truncate (type, dconst_sixth ()); }))
6007 /* cbrt(sqrt(x)) -> pow(x,1/6). */
6010 (pows @0 { build_real_truncate (type, dconst_sixth ()); }))
6011 /* cbrt(cbrt(x)) -> pow(x,1/9), iff x is nonnegative. */
6013 (cbrts (cbrts tree_expr_nonnegative_p@0))
6014 (pows @0 { build_real_truncate (type, dconst_ninth ()); }))
6015 /* sqrt(pow(x,y)) -> pow(|x|,y*0.5). */
6017 (sqrts (pows @0 @1))
6018 (pows (abs @0) (mult @1 { build_real (type, dconsthalf); })))
6019 /* cbrt(pow(x,y)) -> pow(x,y/3), iff x is nonnegative. */
6021 (cbrts (pows tree_expr_nonnegative_p@0 @1))
6022 (pows @0 (mult @1 { build_real_truncate (type, dconst_third ()); })))
6023 /* pow(sqrt(x),y) -> pow(x,y*0.5). */
6025 (pows (sqrts @0) @1)
6026 (pows @0 (mult @1 { build_real (type, dconsthalf); })))
6027 /* pow(cbrt(x),y) -> pow(x,y/3) iff x is nonnegative. */
6029 (pows (cbrts tree_expr_nonnegative_p@0) @1)
6030 (pows @0 (mult @1 { build_real_truncate (type, dconst_third ()); })))
6031 /* pow(pow(x,y),z) -> pow(x,y*z) iff x is nonnegative. */
6033 (pows (pows tree_expr_nonnegative_p@0 @1) @2)
6034 (pows @0 (mult @1 @2))))
6036 /* cabs(x+xi) -> fabs(x)*sqrt(2). */
6038 (CABS (complex @0 @0))
6039 (mult (abs @0) { build_real_truncate (type, dconst_sqrt2 ()); }))
6041 /* hypot(x,x) -> fabs(x)*sqrt(2). */
6044 (mult (abs @0) { build_real_truncate (type, dconst_sqrt2 ()); }))
6046 /* cexp(x+yi) -> exp(x)*cexpi(y). */
6051 (cexps compositional_complex@0)
6052 (if (targetm.libc_has_function (function_c99_math_complex, TREE_TYPE (@0)))
6054 (mult (exps@1 (realpart @0)) (realpart (cexpis:type@2 (imagpart @0))))
6055 (mult @1 (imagpart @2)))))))
6057 (if (canonicalize_math_p ())
6058 /* floor(x) -> trunc(x) if x is nonnegative. */
6059 (for floors (FLOOR_ALL)
6062 (floors tree_expr_nonnegative_p@0)
6065 (match double_value_p
6067 (if (TYPE_MAIN_VARIANT (TREE_TYPE (@0)) == double_type_node)))
6068 (for froms (BUILT_IN_TRUNCL
6080 /* truncl(extend(x)) -> extend(trunc(x)), etc., if x is a double. */
6081 (if (optimize && canonicalize_math_p ())
6083 (froms (convert double_value_p@0))
6084 (convert (tos @0)))))
6086 (match float_value_p
6088 (if (TYPE_MAIN_VARIANT (TREE_TYPE (@0)) == float_type_node)))
6089 (for froms (BUILT_IN_TRUNCL BUILT_IN_TRUNC
6090 BUILT_IN_FLOORL BUILT_IN_FLOOR
6091 BUILT_IN_CEILL BUILT_IN_CEIL
6092 BUILT_IN_ROUNDL BUILT_IN_ROUND
6093 BUILT_IN_NEARBYINTL BUILT_IN_NEARBYINT
6094 BUILT_IN_RINTL BUILT_IN_RINT)
6095 tos (BUILT_IN_TRUNCF BUILT_IN_TRUNCF
6096 BUILT_IN_FLOORF BUILT_IN_FLOORF
6097 BUILT_IN_CEILF BUILT_IN_CEILF
6098 BUILT_IN_ROUNDF BUILT_IN_ROUNDF
6099 BUILT_IN_NEARBYINTF BUILT_IN_NEARBYINTF
6100 BUILT_IN_RINTF BUILT_IN_RINTF)
6101 /* truncl(extend(x)) and trunc(extend(x)) -> extend(truncf(x)), etc.,
6103 (if (optimize && canonicalize_math_p ()
6104 && targetm.libc_has_function (function_c99_misc, NULL_TREE))
6106 (froms (convert float_value_p@0))
6107 (convert (tos @0)))))
6109 (for froms (XFLOORL XCEILL XROUNDL XRINTL)
6110 tos (XFLOOR XCEIL XROUND XRINT)
6111 /* llfloorl(extend(x)) -> llfloor(x), etc., if x is a double. */
6112 (if (optimize && canonicalize_math_p ())
6114 (froms (convert double_value_p@0))
6117 (for froms (XFLOORL XCEILL XROUNDL XRINTL
6118 XFLOOR XCEIL XROUND XRINT)
6119 tos (XFLOORF XCEILF XROUNDF XRINTF)
6120 /* llfloorl(extend(x)) and llfloor(extend(x)) -> llfloorf(x), etc.,
6122 (if (optimize && canonicalize_math_p ())
6124 (froms (convert float_value_p@0))
6127 (if (canonicalize_math_p ())
6128 /* xfloor(x) -> fix_trunc(x) if x is nonnegative. */
6129 (for floors (IFLOOR LFLOOR LLFLOOR)
6131 (floors tree_expr_nonnegative_p@0)
6134 (if (canonicalize_math_p ())
6135 /* xfloor(x) -> fix_trunc(x), etc., if x is integer valued. */
6136 (for fns (IFLOOR LFLOOR LLFLOOR
6138 IROUND LROUND LLROUND)
6140 (fns integer_valued_real_p@0)
6142 (if (!flag_errno_math)
6143 /* xrint(x) -> fix_trunc(x), etc., if x is integer valued. */
6144 (for rints (IRINT LRINT LLRINT)
6146 (rints integer_valued_real_p@0)
6149 (if (canonicalize_math_p ())
6150 (for ifn (IFLOOR ICEIL IROUND IRINT)
6151 lfn (LFLOOR LCEIL LROUND LRINT)
6152 llfn (LLFLOOR LLCEIL LLROUND LLRINT)
6153 /* Canonicalize iround (x) to lround (x) on ILP32 targets where
6154 sizeof (int) == sizeof (long). */
6155 (if (TYPE_PRECISION (integer_type_node)
6156 == TYPE_PRECISION (long_integer_type_node))
6159 (lfn:long_integer_type_node @0)))
6160 /* Canonicalize llround (x) to lround (x) on LP64 targets where
6161 sizeof (long long) == sizeof (long). */
6162 (if (TYPE_PRECISION (long_long_integer_type_node)
6163 == TYPE_PRECISION (long_integer_type_node))
6166 (lfn:long_integer_type_node @0)))))
6168 /* cproj(x) -> x if we're ignoring infinities. */
6171 (if (!HONOR_INFINITIES (type))
6174 /* If the real part is inf and the imag part is known to be
6175 nonnegative, return (inf + 0i). */
6177 (CPROJ (complex REAL_CST@0 tree_expr_nonnegative_p@1))
6178 (if (real_isinf (TREE_REAL_CST_PTR (@0)))
6179 { build_complex_inf (type, false); }))
6181 /* If the imag part is inf, return (inf+I*copysign(0,imag)). */
6183 (CPROJ (complex @0 REAL_CST@1))
6184 (if (real_isinf (TREE_REAL_CST_PTR (@1)))
6185 { build_complex_inf (type, TREE_REAL_CST_PTR (@1)->sign); }))
6191 (pows @0 REAL_CST@1)
6193 const REAL_VALUE_TYPE *value = TREE_REAL_CST_PTR (@1);
6194 REAL_VALUE_TYPE tmp;
6197 /* pow(x,0) -> 1. */
6198 (if (real_equal (value, &dconst0))
6199 { build_real (type, dconst1); })
6200 /* pow(x,1) -> x. */
6201 (if (real_equal (value, &dconst1))
6203 /* pow(x,-1) -> 1/x. */
6204 (if (real_equal (value, &dconstm1))
6205 (rdiv { build_real (type, dconst1); } @0))
6206 /* pow(x,0.5) -> sqrt(x). */
6207 (if (flag_unsafe_math_optimizations
6208 && canonicalize_math_p ()
6209 && real_equal (value, &dconsthalf))
6211 /* pow(x,1/3) -> cbrt(x). */
6212 (if (flag_unsafe_math_optimizations
6213 && canonicalize_math_p ()
6214 && (tmp = real_value_truncate (TYPE_MODE (type), dconst_third ()),
6215 real_equal (value, &tmp)))
6218 /* powi(1,x) -> 1. */
6220 (POWI real_onep@0 @1)
6224 (POWI @0 INTEGER_CST@1)
6226 /* powi(x,0) -> 1. */
6227 (if (wi::to_wide (@1) == 0)
6228 { build_real (type, dconst1); })
6229 /* powi(x,1) -> x. */
6230 (if (wi::to_wide (@1) == 1)
6232 /* powi(x,-1) -> 1/x. */
6233 (if (wi::to_wide (@1) == -1)
6234 (rdiv { build_real (type, dconst1); } @0))))
6236 /* Narrowing of arithmetic and logical operations.
6238 These are conceptually similar to the transformations performed for
6239 the C/C++ front-ends by shorten_binary_op and shorten_compare. Long
6240 term we want to move all that code out of the front-ends into here. */
6242 /* Convert (outertype)((innertype0)a+(innertype1)b)
6243 into ((newtype)a+(newtype)b) where newtype
6244 is the widest mode from all of these. */
6245 (for op (plus minus mult rdiv)
6247 (convert (op:s@0 (convert1?@3 @1) (convert2?@4 @2)))
6248 /* If we have a narrowing conversion of an arithmetic operation where
6249 both operands are widening conversions from the same type as the outer
6250 narrowing conversion. Then convert the innermost operands to a
6251 suitable unsigned type (to avoid introducing undefined behavior),
6252 perform the operation and convert the result to the desired type. */
6253 (if (INTEGRAL_TYPE_P (type)
6256 /* We check for type compatibility between @0 and @1 below,
6257 so there's no need to check that @2/@4 are integral types. */
6258 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
6259 && INTEGRAL_TYPE_P (TREE_TYPE (@3))
6260 /* The precision of the type of each operand must match the
6261 precision of the mode of each operand, similarly for the
6263 && type_has_mode_precision_p (TREE_TYPE (@1))
6264 && type_has_mode_precision_p (TREE_TYPE (@2))
6265 && type_has_mode_precision_p (type)
6266 /* The inner conversion must be a widening conversion. */
6267 && TYPE_PRECISION (TREE_TYPE (@3)) > TYPE_PRECISION (TREE_TYPE (@1))
6268 && types_match (@1, type)
6269 && (types_match (@1, @2)
6270 /* Or the second operand is const integer or converted const
6271 integer from valueize. */
6272 || poly_int_tree_p (@4)))
6273 (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
6274 (op @1 (convert @2))
6275 (with { tree utype = unsigned_type_for (TREE_TYPE (@1)); }
6276 (convert (op (convert:utype @1)
6277 (convert:utype @2)))))
6278 (if (FLOAT_TYPE_P (type)
6279 && DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0))
6280 == DECIMAL_FLOAT_TYPE_P (type))
6281 (with { tree arg0 = strip_float_extensions (@1);
6282 tree arg1 = strip_float_extensions (@2);
6283 tree itype = TREE_TYPE (@0);
6284 tree ty1 = TREE_TYPE (arg0);
6285 tree ty2 = TREE_TYPE (arg1);
6286 enum tree_code code = TREE_CODE (itype); }
6287 (if (FLOAT_TYPE_P (ty1)
6288 && FLOAT_TYPE_P (ty2))
6289 (with { tree newtype = type;
6290 if (TYPE_MODE (ty1) == SDmode
6291 || TYPE_MODE (ty2) == SDmode
6292 || TYPE_MODE (type) == SDmode)
6293 newtype = dfloat32_type_node;
6294 if (TYPE_MODE (ty1) == DDmode
6295 || TYPE_MODE (ty2) == DDmode
6296 || TYPE_MODE (type) == DDmode)
6297 newtype = dfloat64_type_node;
6298 if (TYPE_MODE (ty1) == TDmode
6299 || TYPE_MODE (ty2) == TDmode
6300 || TYPE_MODE (type) == TDmode)
6301 newtype = dfloat128_type_node; }
6302 (if ((newtype == dfloat32_type_node
6303 || newtype == dfloat64_type_node
6304 || newtype == dfloat128_type_node)
6306 && types_match (newtype, type))
6307 (op (convert:newtype @1) (convert:newtype @2))
6308 (with { if (TYPE_PRECISION (ty1) > TYPE_PRECISION (newtype))
6310 if (TYPE_PRECISION (ty2) > TYPE_PRECISION (newtype))
6312 /* Sometimes this transformation is safe (cannot
6313 change results through affecting double rounding
6314 cases) and sometimes it is not. If NEWTYPE is
6315 wider than TYPE, e.g. (float)((long double)double
6316 + (long double)double) converted to
6317 (float)(double + double), the transformation is
6318 unsafe regardless of the details of the types
6319 involved; double rounding can arise if the result
6320 of NEWTYPE arithmetic is a NEWTYPE value half way
6321 between two representable TYPE values but the
6322 exact value is sufficiently different (in the
6323 right direction) for this difference to be
6324 visible in ITYPE arithmetic. If NEWTYPE is the
6325 same as TYPE, however, the transformation may be
6326 safe depending on the types involved: it is safe
6327 if the ITYPE has strictly more than twice as many
6328 mantissa bits as TYPE, can represent infinities
6329 and NaNs if the TYPE can, and has sufficient
6330 exponent range for the product or ratio of two
6331 values representable in the TYPE to be within the
6332 range of normal values of ITYPE. */
6333 (if (TYPE_PRECISION (newtype) < TYPE_PRECISION (itype)
6334 && (flag_unsafe_math_optimizations
6335 || (TYPE_PRECISION (newtype) == TYPE_PRECISION (type)
6336 && real_can_shorten_arithmetic (TYPE_MODE (itype),
6338 && !excess_precision_type (newtype)))
6339 && !types_match (itype, newtype))
6340 (convert:type (op (convert:newtype @1)
6341 (convert:newtype @2)))
6346 /* This is another case of narrowing, specifically when there's an outer
6347 BIT_AND_EXPR which masks off bits outside the type of the innermost
6348 operands. Like the previous case we have to convert the operands
6349 to unsigned types to avoid introducing undefined behavior for the
6350 arithmetic operation. */
6351 (for op (minus plus)
6353 (bit_and (op:s (convert@2 @0) (convert@3 @1)) INTEGER_CST@4)
6354 (if (INTEGRAL_TYPE_P (type)
6355 /* We check for type compatibility between @0 and @1 below,
6356 so there's no need to check that @1/@3 are integral types. */
6357 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
6358 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
6359 /* The precision of the type of each operand must match the
6360 precision of the mode of each operand, similarly for the
6362 && type_has_mode_precision_p (TREE_TYPE (@0))
6363 && type_has_mode_precision_p (TREE_TYPE (@1))
6364 && type_has_mode_precision_p (type)
6365 /* The inner conversion must be a widening conversion. */
6366 && TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (TREE_TYPE (@0))
6367 && types_match (@0, @1)
6368 && (tree_int_cst_min_precision (@4, TYPE_SIGN (TREE_TYPE (@0)))
6369 <= TYPE_PRECISION (TREE_TYPE (@0)))
6370 && (wi::to_wide (@4)
6371 & wi::mask (TYPE_PRECISION (TREE_TYPE (@0)),
6372 true, TYPE_PRECISION (type))) == 0)
6373 (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
6374 (with { tree ntype = TREE_TYPE (@0); }
6375 (convert (bit_and (op @0 @1) (convert:ntype @4))))
6376 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
6377 (convert (bit_and (op (convert:utype @0) (convert:utype @1))
6378 (convert:utype @4))))))))
6380 /* Transform (@0 < @1 and @0 < @2) to use min,
6381 (@0 > @1 and @0 > @2) to use max */
6382 (for logic (bit_and bit_and bit_and bit_and bit_ior bit_ior bit_ior bit_ior)
6383 op (lt le gt ge lt le gt ge )
6384 ext (min min max max max max min min )
6386 (logic (op:cs @0 @1) (op:cs @0 @2))
6387 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6388 && TREE_CODE (@0) != INTEGER_CST)
6389 (op @0 (ext @1 @2)))))
6392 /* signbit(x) -> 0 if x is nonnegative. */
6393 (SIGNBIT tree_expr_nonnegative_p@0)
6394 { integer_zero_node; })
6397 /* signbit(x) -> x<0 if x doesn't have signed zeros. */
6399 (if (!HONOR_SIGNED_ZEROS (@0))
6400 (convert (lt @0 { build_real (TREE_TYPE (@0), dconst0); }))))
6402 /* Transform comparisons of the form X +- C1 CMP C2 to X CMP C2 -+ C1. */
6404 (for op (plus minus)
6407 (cmp (op@3 @0 INTEGER_CST@1) INTEGER_CST@2)
6408 (if (!TREE_OVERFLOW (@1) && !TREE_OVERFLOW (@2)
6409 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0))
6410 && !TYPE_OVERFLOW_TRAPS (TREE_TYPE (@0))
6411 && !TYPE_SATURATING (TREE_TYPE (@0)))
6412 (with { tree res = int_const_binop (rop, @2, @1); }
6413 (if (TREE_OVERFLOW (res)
6414 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
6415 { constant_boolean_node (cmp == NE_EXPR, type); }
6416 (if (single_use (@3))
6417 (cmp @0 { TREE_OVERFLOW (res)
6418 ? drop_tree_overflow (res) : res; }))))))))
6419 (for cmp (lt le gt ge)
6420 (for op (plus minus)
6423 (cmp (op@3 @0 INTEGER_CST@1) INTEGER_CST@2)
6424 (if (!TREE_OVERFLOW (@1) && !TREE_OVERFLOW (@2)
6425 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
6426 (with { tree res = int_const_binop (rop, @2, @1); }
6427 (if (TREE_OVERFLOW (res))
6429 fold_overflow_warning (("assuming signed overflow does not occur "
6430 "when simplifying conditional to constant"),
6431 WARN_STRICT_OVERFLOW_CONDITIONAL);
6432 bool less = cmp == LE_EXPR || cmp == LT_EXPR;
6433 /* wi::ges_p (@2, 0) should be sufficient for a signed type. */
6434 bool ovf_high = wi::lt_p (wi::to_wide (@1), 0,
6435 TYPE_SIGN (TREE_TYPE (@1)))
6436 != (op == MINUS_EXPR);
6437 constant_boolean_node (less == ovf_high, type);
6439 (if (single_use (@3))
6442 fold_overflow_warning (("assuming signed overflow does not occur "
6443 "when changing X +- C1 cmp C2 to "
6445 WARN_STRICT_OVERFLOW_COMPARISON);
6447 (cmp @0 { res; })))))))))
6449 /* Canonicalizations of BIT_FIELD_REFs. */
6452 (BIT_FIELD_REF (BIT_FIELD_REF @0 @1 @2) @3 @4)
6453 (BIT_FIELD_REF @0 @3 { const_binop (PLUS_EXPR, bitsizetype, @2, @4); }))
6456 (BIT_FIELD_REF (view_convert @0) @1 @2)
6457 (BIT_FIELD_REF @0 @1 @2))
6460 (BIT_FIELD_REF @0 @1 integer_zerop)
6461 (if (tree_int_cst_equal (@1, TYPE_SIZE (TREE_TYPE (@0))))
6465 (BIT_FIELD_REF @0 @1 @2)
6467 (if (TREE_CODE (TREE_TYPE (@0)) == COMPLEX_TYPE
6468 && tree_int_cst_equal (@1, TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0)))))
6470 (if (integer_zerop (@2))
6471 (view_convert (realpart @0)))
6472 (if (tree_int_cst_equal (@2, TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0)))))
6473 (view_convert (imagpart @0)))))
6474 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6475 && INTEGRAL_TYPE_P (type)
6476 /* On GIMPLE this should only apply to register arguments. */
6477 && (! GIMPLE || is_gimple_reg (@0))
6478 /* A bit-field-ref that referenced the full argument can be stripped. */
6479 && ((compare_tree_int (@1, TYPE_PRECISION (TREE_TYPE (@0))) == 0
6480 && integer_zerop (@2))
6481 /* Low-parts can be reduced to integral conversions.
6482 ??? The following doesn't work for PDP endian. */
6483 || (BYTES_BIG_ENDIAN == WORDS_BIG_ENDIAN
6484 /* But only do this after vectorization. */
6485 && canonicalize_math_after_vectorization_p ()
6486 /* Don't even think about BITS_BIG_ENDIAN. */
6487 && TYPE_PRECISION (TREE_TYPE (@0)) % BITS_PER_UNIT == 0
6488 && TYPE_PRECISION (type) % BITS_PER_UNIT == 0
6489 && compare_tree_int (@2, (BYTES_BIG_ENDIAN
6490 ? (TYPE_PRECISION (TREE_TYPE (@0))
6491 - TYPE_PRECISION (type))
6495 /* Simplify vector extracts. */
6498 (BIT_FIELD_REF CONSTRUCTOR@0 @1 @2)
6499 (if (VECTOR_TYPE_P (TREE_TYPE (@0))
6500 && tree_fits_uhwi_p (TYPE_SIZE (type))
6501 && ((tree_to_uhwi (TYPE_SIZE (type))
6502 == tree_to_uhwi (TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0)))))
6503 || (VECTOR_TYPE_P (type)
6504 && (tree_to_uhwi (TYPE_SIZE (TREE_TYPE (type)))
6505 == tree_to_uhwi (TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0))))))))
6508 tree ctor = (TREE_CODE (@0) == SSA_NAME
6509 ? gimple_assign_rhs1 (SSA_NAME_DEF_STMT (@0)) : @0);
6510 tree eltype = TREE_TYPE (TREE_TYPE (ctor));
6511 unsigned HOST_WIDE_INT width = tree_to_uhwi (TYPE_SIZE (eltype));
6512 unsigned HOST_WIDE_INT n = tree_to_uhwi (@1);
6513 unsigned HOST_WIDE_INT idx = tree_to_uhwi (@2);
6516 && (idx % width) == 0
6518 && known_le ((idx + n) / width,
6519 TYPE_VECTOR_SUBPARTS (TREE_TYPE (ctor))))
6524 /* Constructor elements can be subvectors. */
6526 if (CONSTRUCTOR_NELTS (ctor) != 0)
6528 tree cons_elem = TREE_TYPE (CONSTRUCTOR_ELT (ctor, 0)->value);
6529 if (TREE_CODE (cons_elem) == VECTOR_TYPE)
6530 k = TYPE_VECTOR_SUBPARTS (cons_elem);
6532 unsigned HOST_WIDE_INT elt, count, const_k;
6535 /* We keep an exact subset of the constructor elements. */
6536 (if (multiple_p (idx, k, &elt) && multiple_p (n, k, &count))
6537 (if (CONSTRUCTOR_NELTS (ctor) == 0)
6538 { build_zero_cst (type); }
6540 (if (elt < CONSTRUCTOR_NELTS (ctor))
6541 (view_convert { CONSTRUCTOR_ELT (ctor, elt)->value; })
6542 { build_zero_cst (type); })
6543 /* We don't want to emit new CTORs unless the old one goes away.
6544 ??? Eventually allow this if the CTOR ends up constant or
6546 (if (single_use (@0))
6549 vec<constructor_elt, va_gc> *vals;
6550 vec_alloc (vals, count);
6551 bool constant_p = true;
6553 for (unsigned i = 0;
6554 i < count && elt + i < CONSTRUCTOR_NELTS (ctor); ++i)
6556 tree e = CONSTRUCTOR_ELT (ctor, elt + i)->value;
6557 CONSTRUCTOR_APPEND_ELT (vals, NULL_TREE, e);
6558 if (!CONSTANT_CLASS_P (e))
6561 tree evtype = (types_match (TREE_TYPE (type),
6562 TREE_TYPE (TREE_TYPE (ctor)))
6564 : build_vector_type (TREE_TYPE (TREE_TYPE (ctor)),
6566 res = (constant_p ? build_vector_from_ctor (evtype, vals)
6567 : build_constructor (evtype, vals));
6569 (view_convert { res; }))))))
6570 /* The bitfield references a single constructor element. */
6571 (if (k.is_constant (&const_k)
6572 && idx + n <= (idx / const_k + 1) * const_k)
6574 (if (CONSTRUCTOR_NELTS (ctor) <= idx / const_k)
6575 { build_zero_cst (type); })
6577 (view_convert { CONSTRUCTOR_ELT (ctor, idx / const_k)->value; }))
6578 (BIT_FIELD_REF { CONSTRUCTOR_ELT (ctor, idx / const_k)->value; }
6579 @1 { bitsize_int ((idx % const_k) * width); })))))))))
6581 /* Simplify a bit extraction from a bit insertion for the cases with
6582 the inserted element fully covering the extraction or the insertion
6583 not touching the extraction. */
6585 (BIT_FIELD_REF (bit_insert @0 @1 @ipos) @rsize @rpos)
6588 unsigned HOST_WIDE_INT isize;
6589 if (INTEGRAL_TYPE_P (TREE_TYPE (@1)))
6590 isize = TYPE_PRECISION (TREE_TYPE (@1));
6592 isize = tree_to_uhwi (TYPE_SIZE (TREE_TYPE (@1)));
6595 (if (wi::leu_p (wi::to_wide (@ipos), wi::to_wide (@rpos))
6596 && wi::leu_p (wi::to_wide (@rpos) + wi::to_wide (@rsize),
6597 wi::to_wide (@ipos) + isize))
6598 (BIT_FIELD_REF @1 @rsize { wide_int_to_tree (bitsizetype,
6600 - wi::to_wide (@ipos)); }))
6601 (if (wi::geu_p (wi::to_wide (@ipos),
6602 wi::to_wide (@rpos) + wi::to_wide (@rsize))
6603 || wi::geu_p (wi::to_wide (@rpos),
6604 wi::to_wide (@ipos) + isize))
6605 (BIT_FIELD_REF @0 @rsize @rpos)))))
6607 (if (canonicalize_math_after_vectorization_p ())
6610 (fmas:c (negate @0) @1 @2)
6611 (IFN_FNMA @0 @1 @2))
6613 (fmas @0 @1 (negate @2))
6616 (fmas:c (negate @0) @1 (negate @2))
6617 (IFN_FNMS @0 @1 @2))
6619 (negate (fmas@3 @0 @1 @2))
6620 (if (single_use (@3))
6621 (IFN_FNMS @0 @1 @2))))
6624 (IFN_FMS:c (negate @0) @1 @2)
6625 (IFN_FNMS @0 @1 @2))
6627 (IFN_FMS @0 @1 (negate @2))
6630 (IFN_FMS:c (negate @0) @1 (negate @2))
6631 (IFN_FNMA @0 @1 @2))
6633 (negate (IFN_FMS@3 @0 @1 @2))
6634 (if (single_use (@3))
6635 (IFN_FNMA @0 @1 @2)))
6638 (IFN_FNMA:c (negate @0) @1 @2)
6641 (IFN_FNMA @0 @1 (negate @2))
6642 (IFN_FNMS @0 @1 @2))
6644 (IFN_FNMA:c (negate @0) @1 (negate @2))
6647 (negate (IFN_FNMA@3 @0 @1 @2))
6648 (if (single_use (@3))
6649 (IFN_FMS @0 @1 @2)))
6652 (IFN_FNMS:c (negate @0) @1 @2)
6655 (IFN_FNMS @0 @1 (negate @2))
6656 (IFN_FNMA @0 @1 @2))
6658 (IFN_FNMS:c (negate @0) @1 (negate @2))
6661 (negate (IFN_FNMS@3 @0 @1 @2))
6662 (if (single_use (@3))
6663 (IFN_FMA @0 @1 @2))))
6665 /* CLZ simplifications. */
6670 (op (clz:s@2 @0) INTEGER_CST@1)
6671 (if (integer_zerop (@1) && single_use (@2))
6672 /* clz(X) == 0 is (int)X < 0 and clz(X) != 0 is (int)X >= 0. */
6673 (with { tree type0 = TREE_TYPE (@0);
6674 tree stype = signed_type_for (type0);
6675 HOST_WIDE_INT val = 0;
6676 /* Punt on hypothetical weird targets. */
6678 && CLZ_DEFINED_VALUE_AT_ZERO (SCALAR_TYPE_MODE (type0),
6684 (cmp (convert:stype @0) { build_zero_cst (stype); })))
6685 /* clz(X) == (prec-1) is X == 1 and clz(X) != (prec-1) is X != 1. */
6686 (with { bool ok = true;
6687 HOST_WIDE_INT val = 0;
6688 tree type0 = TREE_TYPE (@0);
6689 /* Punt on hypothetical weird targets. */
6691 && CLZ_DEFINED_VALUE_AT_ZERO (SCALAR_TYPE_MODE (type0),
6693 && val == TYPE_PRECISION (type0) - 1)
6696 (if (ok && wi::to_wide (@1) == (TYPE_PRECISION (type0) - 1))
6697 (op @0 { build_one_cst (type0); })))))))
6699 /* CTZ simplifications. */
6701 (for op (ge gt le lt)
6704 /* __builtin_ctz (x) >= C -> (x & ((1 << C) - 1)) == 0. */
6705 (op (ctz:s @0) INTEGER_CST@1)
6706 (with { bool ok = true;
6707 HOST_WIDE_INT val = 0;
6708 if (!tree_fits_shwi_p (@1))
6712 val = tree_to_shwi (@1);
6713 /* Canonicalize to >= or <. */
6714 if (op == GT_EXPR || op == LE_EXPR)
6716 if (val == HOST_WIDE_INT_MAX)
6722 bool zero_res = false;
6723 HOST_WIDE_INT zero_val = 0;
6724 tree type0 = TREE_TYPE (@0);
6725 int prec = TYPE_PRECISION (type0);
6727 && CTZ_DEFINED_VALUE_AT_ZERO (SCALAR_TYPE_MODE (type0),
6732 (if (ok && (!zero_res || zero_val >= val))
6733 { constant_boolean_node (cmp == EQ_EXPR ? true : false, type); })
6735 (if (ok && (!zero_res || zero_val < val))
6736 { constant_boolean_node (cmp == EQ_EXPR ? false : true, type); })
6737 (if (ok && (!zero_res || zero_val < 0 || zero_val >= prec))
6738 (cmp (bit_and @0 { wide_int_to_tree (type0,
6739 wi::mask (val, false, prec)); })
6740 { build_zero_cst (type0); })))))))
6743 /* __builtin_ctz (x) == C -> (x & ((1 << (C + 1)) - 1)) == (1 << C). */
6744 (op (ctz:s @0) INTEGER_CST@1)
6745 (with { bool zero_res = false;
6746 HOST_WIDE_INT zero_val = 0;
6747 tree type0 = TREE_TYPE (@0);
6748 int prec = TYPE_PRECISION (type0);
6750 && CTZ_DEFINED_VALUE_AT_ZERO (SCALAR_TYPE_MODE (type0),
6754 (if (tree_int_cst_sgn (@1) < 0 || wi::to_widest (@1) >= prec)
6755 (if (!zero_res || zero_val != wi::to_widest (@1))
6756 { constant_boolean_node (op == EQ_EXPR ? false : true, type); })
6757 (if (!zero_res || zero_val < 0 || zero_val >= prec)
6758 (op (bit_and @0 { wide_int_to_tree (type0,
6759 wi::mask (tree_to_uhwi (@1) + 1,
6761 { wide_int_to_tree (type0,
6762 wi::shifted_mask (tree_to_uhwi (@1), 1,
6763 false, prec)); })))))))
6765 /* POPCOUNT simplifications. */
6766 /* popcount(X) + popcount(Y) is popcount(X|Y) when X&Y must be zero. */
6768 (plus (POPCOUNT:s @0) (POPCOUNT:s @1))
6769 (if (wi::bit_and (tree_nonzero_bits (@0), tree_nonzero_bits (@1)) == 0)
6770 (POPCOUNT (bit_ior @0 @1))))
6772 /* popcount(X) == 0 is X == 0, and related (in)equalities. */
6773 (for popcount (POPCOUNT)
6774 (for cmp (le eq ne gt)
6777 (cmp (popcount @0) integer_zerop)
6778 (rep @0 { build_zero_cst (TREE_TYPE (@0)); }))))
6780 /* Canonicalize POPCOUNT(x)&1 as PARITY(X). */
6782 (bit_and (POPCOUNT @0) integer_onep)
6785 /* PARITY simplifications. */
6786 /* parity(~X) is parity(X). */
6788 (PARITY (bit_not @0))
6791 /* parity(X)^parity(Y) is parity(X^Y). */
6793 (bit_xor (PARITY:s @0) (PARITY:s @1))
6794 (PARITY (bit_xor @0 @1)))
6796 /* Common POPCOUNT/PARITY simplifications. */
6797 /* popcount(X&C1) is (X>>C2)&1 when C1 == 1<<C2. Same for parity(X&C1). */
6798 (for pfun (POPCOUNT PARITY)
6801 (with { wide_int nz = tree_nonzero_bits (@0); }
6805 (if (wi::popcount (nz) == 1)
6806 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
6807 (convert (rshift:utype (convert:utype @0)
6808 { build_int_cst (integer_type_node,
6809 wi::ctz (nz)); }))))))))
6812 /* 64- and 32-bits branchless implementations of popcount are detected:
6814 int popcount64c (uint64_t x)
6816 x -= (x >> 1) & 0x5555555555555555ULL;
6817 x = (x & 0x3333333333333333ULL) + ((x >> 2) & 0x3333333333333333ULL);
6818 x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0fULL;
6819 return (x * 0x0101010101010101ULL) >> 56;
6822 int popcount32c (uint32_t x)
6824 x -= (x >> 1) & 0x55555555;
6825 x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
6826 x = (x + (x >> 4)) & 0x0f0f0f0f;
6827 return (x * 0x01010101) >> 24;
6834 (rshift @8 INTEGER_CST@5)
6836 (bit_and @6 INTEGER_CST@7)
6840 (bit_and (rshift @0 INTEGER_CST@4) INTEGER_CST@11))
6846 /* Check constants and optab. */
6847 (with { unsigned prec = TYPE_PRECISION (type);
6848 int shift = (64 - prec) & 63;
6849 unsigned HOST_WIDE_INT c1
6850 = HOST_WIDE_INT_UC (0x0101010101010101) >> shift;
6851 unsigned HOST_WIDE_INT c2
6852 = HOST_WIDE_INT_UC (0x0F0F0F0F0F0F0F0F) >> shift;
6853 unsigned HOST_WIDE_INT c3
6854 = HOST_WIDE_INT_UC (0x3333333333333333) >> shift;
6855 unsigned HOST_WIDE_INT c4
6856 = HOST_WIDE_INT_UC (0x5555555555555555) >> shift;
6861 && TYPE_UNSIGNED (type)
6862 && integer_onep (@4)
6863 && wi::to_widest (@10) == 2
6864 && wi::to_widest (@5) == 4
6865 && wi::to_widest (@1) == prec - 8
6866 && tree_to_uhwi (@2) == c1
6867 && tree_to_uhwi (@3) == c2
6868 && tree_to_uhwi (@9) == c3
6869 && tree_to_uhwi (@7) == c3
6870 && tree_to_uhwi (@11) == c4)
6871 (if (direct_internal_fn_supported_p (IFN_POPCOUNT, type,
6873 (convert (IFN_POPCOUNT:type @0))
6874 /* Try to do popcount in two halves. PREC must be at least
6875 five bits for this to work without extension before adding. */
6877 tree half_type = NULL_TREE;
6878 opt_machine_mode m = mode_for_size ((prec + 1) / 2, MODE_INT, 1);
6881 && m.require () != TYPE_MODE (type))
6883 half_prec = GET_MODE_PRECISION (as_a <scalar_int_mode> (m));
6884 half_type = build_nonstandard_integer_type (half_prec, 1);
6886 gcc_assert (half_prec > 2);
6888 (if (half_type != NULL_TREE
6889 && direct_internal_fn_supported_p (IFN_POPCOUNT, half_type,
6892 (IFN_POPCOUNT:half_type (convert @0))
6893 (IFN_POPCOUNT:half_type (convert (rshift @0
6894 { build_int_cst (integer_type_node, half_prec); } )))))))))))
6896 /* __builtin_ffs needs to deal on many targets with the possible zero
6897 argument. If we know the argument is always non-zero, __builtin_ctz + 1
6898 should lead to better code. */
6900 (FFS tree_expr_nonzero_p@0)
6901 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6902 && direct_internal_fn_supported_p (IFN_CTZ, TREE_TYPE (@0),
6903 OPTIMIZE_FOR_SPEED))
6904 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
6905 (plus (CTZ:type (convert:utype @0)) { build_one_cst (type); }))))
6908 (for ffs (BUILT_IN_FFS BUILT_IN_FFSL BUILT_IN_FFSLL
6910 /* __builtin_ffs (X) == 0 -> X == 0.
6911 __builtin_ffs (X) == 6 -> (X & 63) == 32. */
6914 (cmp (ffs@2 @0) INTEGER_CST@1)
6915 (with { int prec = TYPE_PRECISION (TREE_TYPE (@0)); }
6917 (if (integer_zerop (@1))
6918 (cmp @0 { build_zero_cst (TREE_TYPE (@0)); }))
6919 (if (tree_int_cst_sgn (@1) < 0 || wi::to_widest (@1) > prec)
6920 { constant_boolean_node (cmp == NE_EXPR ? true : false, type); })
6921 (if (single_use (@2))
6922 (cmp (bit_and @0 { wide_int_to_tree (TREE_TYPE (@0),
6923 wi::mask (tree_to_uhwi (@1),
6925 { wide_int_to_tree (TREE_TYPE (@0),
6926 wi::shifted_mask (tree_to_uhwi (@1) - 1, 1,
6927 false, prec)); }))))))
6929 /* __builtin_ffs (X) > 6 -> X != 0 && (X & 63) == 0. */
6933 bit_op (bit_and bit_ior)
6935 (cmp (ffs@2 @0) INTEGER_CST@1)
6936 (with { int prec = TYPE_PRECISION (TREE_TYPE (@0)); }
6938 (if (integer_zerop (@1))
6939 (cmp2 @0 { build_zero_cst (TREE_TYPE (@0)); }))
6940 (if (tree_int_cst_sgn (@1) < 0)
6941 { constant_boolean_node (cmp == GT_EXPR ? true : false, type); })
6942 (if (wi::to_widest (@1) >= prec)
6943 { constant_boolean_node (cmp == GT_EXPR ? false : true, type); })
6944 (if (wi::to_widest (@1) == prec - 1)
6945 (cmp3 @0 { wide_int_to_tree (TREE_TYPE (@0),
6946 wi::shifted_mask (prec - 1, 1,
6948 (if (single_use (@2))
6949 (bit_op (cmp2 @0 { build_zero_cst (TREE_TYPE (@0)); })
6951 { wide_int_to_tree (TREE_TYPE (@0),
6952 wi::mask (tree_to_uhwi (@1),
6954 { build_zero_cst (TREE_TYPE (@0)); }))))))))
6963 r = c ? a1 op a2 : b;
6965 if the target can do it in one go. This makes the operation conditional
6966 on c, so could drop potentially-trapping arithmetic, but that's a valid
6967 simplification if the result of the operation isn't needed.
6969 Avoid speculatively generating a stand-alone vector comparison
6970 on targets that might not support them. Any target implementing
6971 conditional internal functions must support the same comparisons
6972 inside and outside a VEC_COND_EXPR. */
6975 (for uncond_op (UNCOND_BINARY)
6976 cond_op (COND_BINARY)
6978 (vec_cond @0 (view_convert? (uncond_op@4 @1 @2)) @3)
6979 (with { tree op_type = TREE_TYPE (@4); }
6980 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
6981 && element_precision (type) == element_precision (op_type))
6982 (view_convert (cond_op @0 @1 @2 (view_convert:op_type @3))))))
6984 (vec_cond @0 @1 (view_convert? (uncond_op@4 @2 @3)))
6985 (with { tree op_type = TREE_TYPE (@4); }
6986 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
6987 && element_precision (type) == element_precision (op_type))
6988 (view_convert (cond_op (bit_not @0) @2 @3 (view_convert:op_type @1)))))))
6990 /* Same for ternary operations. */
6991 (for uncond_op (UNCOND_TERNARY)
6992 cond_op (COND_TERNARY)
6994 (vec_cond @0 (view_convert? (uncond_op@5 @1 @2 @3)) @4)
6995 (with { tree op_type = TREE_TYPE (@5); }
6996 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
6997 && element_precision (type) == element_precision (op_type))
6998 (view_convert (cond_op @0 @1 @2 @3 (view_convert:op_type @4))))))
7000 (vec_cond @0 @1 (view_convert? (uncond_op@5 @2 @3 @4)))
7001 (with { tree op_type = TREE_TYPE (@5); }
7002 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
7003 && element_precision (type) == element_precision (op_type))
7004 (view_convert (cond_op (bit_not @0) @2 @3 @4
7005 (view_convert:op_type @1)))))))
7008 /* Detect cases in which a VEC_COND_EXPR effectively replaces the
7009 "else" value of an IFN_COND_*. */
7010 (for cond_op (COND_BINARY)
7012 (vec_cond @0 (view_convert? (cond_op @0 @1 @2 @3)) @4)
7013 (with { tree op_type = TREE_TYPE (@3); }
7014 (if (element_precision (type) == element_precision (op_type))
7015 (view_convert (cond_op @0 @1 @2 (view_convert:op_type @4))))))
7017 (vec_cond @0 @1 (view_convert? (cond_op @2 @3 @4 @5)))
7018 (with { tree op_type = TREE_TYPE (@5); }
7019 (if (inverse_conditions_p (@0, @2)
7020 && element_precision (type) == element_precision (op_type))
7021 (view_convert (cond_op @2 @3 @4 (view_convert:op_type @1)))))))
7023 /* Same for ternary operations. */
7024 (for cond_op (COND_TERNARY)
7026 (vec_cond @0 (view_convert? (cond_op @0 @1 @2 @3 @4)) @5)
7027 (with { tree op_type = TREE_TYPE (@4); }
7028 (if (element_precision (type) == element_precision (op_type))
7029 (view_convert (cond_op @0 @1 @2 @3 (view_convert:op_type @5))))))
7031 (vec_cond @0 @1 (view_convert? (cond_op @2 @3 @4 @5 @6)))
7032 (with { tree op_type = TREE_TYPE (@6); }
7033 (if (inverse_conditions_p (@0, @2)
7034 && element_precision (type) == element_precision (op_type))
7035 (view_convert (cond_op @2 @3 @4 @5 (view_convert:op_type @1)))))))
7037 /* For pointers @0 and @2 and nonnegative constant offset @1, look for
7040 A: (@0 + @1 < @2) | (@2 + @1 < @0)
7041 B: (@0 + @1 <= @2) | (@2 + @1 <= @0)
7043 If pointers are known not to wrap, B checks whether @1 bytes starting
7044 at @0 and @2 do not overlap, while A tests the same thing for @1 + 1
7045 bytes. A is more efficiently tested as:
7047 A: (sizetype) (@0 + @1 - @2) > @1 * 2
7049 The equivalent expression for B is given by replacing @1 with @1 - 1:
7051 B: (sizetype) (@0 + (@1 - 1) - @2) > (@1 - 1) * 2
7053 @0 and @2 can be swapped in both expressions without changing the result.
7055 The folds rely on sizetype's being unsigned (which is always true)
7056 and on its being the same width as the pointer (which we have to check).
7058 The fold replaces two pointer_plus expressions, two comparisons and
7059 an IOR with a pointer_plus, a pointer_diff, and a comparison, so in
7060 the best case it's a saving of two operations. The A fold retains one
7061 of the original pointer_pluses, so is a win even if both pointer_pluses
7062 are used elsewhere. The B fold is a wash if both pointer_pluses are
7063 used elsewhere, since all we end up doing is replacing a comparison with
7064 a pointer_plus. We do still apply the fold under those circumstances
7065 though, in case applying it to other conditions eventually makes one of the
7066 pointer_pluses dead. */
7067 (for ior (truth_orif truth_or bit_ior)
7070 (ior (cmp:cs (pointer_plus@3 @0 INTEGER_CST@1) @2)
7071 (cmp:cs (pointer_plus@4 @2 @1) @0))
7072 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
7073 && TYPE_OVERFLOW_WRAPS (sizetype)
7074 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (sizetype))
7075 /* Calculate the rhs constant. */
7076 (with { offset_int off = wi::to_offset (@1) - (cmp == LE_EXPR ? 1 : 0);
7077 offset_int rhs = off * 2; }
7078 /* Always fails for negative values. */
7079 (if (wi::min_precision (rhs, UNSIGNED) <= TYPE_PRECISION (sizetype))
7080 /* Since the order of @0 and @2 doesn't matter, let tree_swap_operands_p
7081 pick a canonical order. This increases the chances of using the
7082 same pointer_plus in multiple checks. */
7083 (with { bool swap_p = tree_swap_operands_p (@0, @2);
7084 tree rhs_tree = wide_int_to_tree (sizetype, rhs); }
7085 (if (cmp == LT_EXPR)
7086 (gt (convert:sizetype
7087 (pointer_diff:ssizetype { swap_p ? @4 : @3; }
7088 { swap_p ? @0 : @2; }))
7090 (gt (convert:sizetype
7091 (pointer_diff:ssizetype
7092 (pointer_plus { swap_p ? @2 : @0; }
7093 { wide_int_to_tree (sizetype, off); })
7094 { swap_p ? @0 : @2; }))
7095 { rhs_tree; })))))))))
7097 /* Fold REDUC (@0 & @1) -> @0[I] & @1[I] if element I is the only nonzero
7099 (for reduc (IFN_REDUC_PLUS IFN_REDUC_IOR IFN_REDUC_XOR)
7100 (simplify (reduc (view_convert? (bit_and @0 VECTOR_CST@1)))
7101 (with { int i = single_nonzero_element (@1); }
7103 (with { tree elt = vector_cst_elt (@1, i);
7104 tree elt_type = TREE_TYPE (elt);
7105 unsigned int elt_bits = tree_to_uhwi (TYPE_SIZE (elt_type));
7106 tree size = bitsize_int (elt_bits);
7107 tree pos = bitsize_int (elt_bits * i); }
7110 (BIT_FIELD_REF:elt_type @0 { size; } { pos; })
7114 (vec_perm @0 @1 VECTOR_CST@2)
7117 tree op0 = @0, op1 = @1, op2 = @2;
7119 /* Build a vector of integers from the tree mask. */
7120 vec_perm_builder builder;
7121 if (!tree_to_vec_perm_builder (&builder, op2))
7124 /* Create a vec_perm_indices for the integer vector. */
7125 poly_uint64 nelts = TYPE_VECTOR_SUBPARTS (type);
7126 bool single_arg = (op0 == op1);
7127 vec_perm_indices sel (builder, single_arg ? 1 : 2, nelts);
7129 (if (sel.series_p (0, 1, 0, 1))
7131 (if (sel.series_p (0, 1, nelts, 1))
7137 if (sel.all_from_input_p (0))
7139 else if (sel.all_from_input_p (1))
7142 sel.rotate_inputs (1);
7144 else if (known_ge (poly_uint64 (sel[0]), nelts))
7146 std::swap (op0, op1);
7147 sel.rotate_inputs (1);
7151 tree cop0 = op0, cop1 = op1;
7152 if (TREE_CODE (op0) == SSA_NAME
7153 && (def = dyn_cast <gassign *> (SSA_NAME_DEF_STMT (op0)))
7154 && gimple_assign_rhs_code (def) == CONSTRUCTOR)
7155 cop0 = gimple_assign_rhs1 (def);
7156 if (TREE_CODE (op1) == SSA_NAME
7157 && (def = dyn_cast <gassign *> (SSA_NAME_DEF_STMT (op1)))
7158 && gimple_assign_rhs_code (def) == CONSTRUCTOR)
7159 cop1 = gimple_assign_rhs1 (def);
7163 (if ((TREE_CODE (cop0) == VECTOR_CST
7164 || TREE_CODE (cop0) == CONSTRUCTOR)
7165 && (TREE_CODE (cop1) == VECTOR_CST
7166 || TREE_CODE (cop1) == CONSTRUCTOR)
7167 && (t = fold_vec_perm (type, cop0, cop1, sel)))
7171 bool changed = (op0 == op1 && !single_arg);
7172 tree ins = NULL_TREE;
7175 /* See if the permutation is performing a single element
7176 insert from a CONSTRUCTOR or constant and use a BIT_INSERT_EXPR
7177 in that case. But only if the vector mode is supported,
7178 otherwise this is invalid GIMPLE. */
7179 if (TYPE_MODE (type) != BLKmode
7180 && (TREE_CODE (cop0) == VECTOR_CST
7181 || TREE_CODE (cop0) == CONSTRUCTOR
7182 || TREE_CODE (cop1) == VECTOR_CST
7183 || TREE_CODE (cop1) == CONSTRUCTOR))
7185 bool insert_first_p = sel.series_p (1, 1, nelts + 1, 1);
7188 /* After canonicalizing the first elt to come from the
7189 first vector we only can insert the first elt from
7190 the first vector. */
7192 if ((ins = fold_read_from_vector (cop0, sel[0])))
7195 /* The above can fail for two-element vectors which always
7196 appear to insert the first element, so try inserting
7197 into the second lane as well. For more than two
7198 elements that's wasted time. */
7199 if (!insert_first_p || (!ins && maybe_eq (nelts, 2u)))
7201 unsigned int encoded_nelts = sel.encoding ().encoded_nelts ();
7202 for (at = 0; at < encoded_nelts; ++at)
7203 if (maybe_ne (sel[at], at))
7205 if (at < encoded_nelts
7206 && (known_eq (at + 1, nelts)
7207 || sel.series_p (at + 1, 1, at + 1, 1)))
7209 if (known_lt (poly_uint64 (sel[at]), nelts))
7210 ins = fold_read_from_vector (cop0, sel[at]);
7212 ins = fold_read_from_vector (cop1, sel[at] - nelts);
7217 /* Generate a canonical form of the selector. */
7218 if (!ins && sel.encoding () != builder)
7220 /* Some targets are deficient and fail to expand a single
7221 argument permutation while still allowing an equivalent
7222 2-argument version. */
7224 if (sel.ninputs () == 2
7225 || can_vec_perm_const_p (TYPE_MODE (type), sel, false))
7226 op2 = vec_perm_indices_to_tree (TREE_TYPE (op2), sel);
7229 vec_perm_indices sel2 (builder, 2, nelts);
7230 if (can_vec_perm_const_p (TYPE_MODE (type), sel2, false))
7231 op2 = vec_perm_indices_to_tree (TREE_TYPE (op2), sel2);
7233 /* Not directly supported with either encoding,
7234 so use the preferred form. */
7235 op2 = vec_perm_indices_to_tree (TREE_TYPE (op2), sel);
7237 if (!operand_equal_p (op2, oldop2, 0))
7242 (bit_insert { op0; } { ins; }
7243 { bitsize_int (at * vector_element_bits (type)); })
7245 (vec_perm { op0; } { op1; } { op2; }))))))))))
7247 /* VEC_PERM_EXPR (v, v, mask) -> v where v contains same element. */
7249 (match vec_same_elem_p
7251 (if (uniform_vector_p (@0))))
7253 (match vec_same_elem_p
7257 (vec_perm vec_same_elem_p@0 @0 @1)
7260 /* Match count trailing zeroes for simplify_count_trailing_zeroes in fwprop.
7261 The canonical form is array[((x & -x) * C) >> SHIFT] where C is a magic
7262 constant which when multiplied by a power of 2 contains a unique value
7263 in the top 5 or 6 bits. This is then indexed into a table which maps it
7264 to the number of trailing zeroes. */
7265 (match (ctz_table_index @1 @2 @3)
7266 (rshift (mult (bit_and:c (negate @1) @1) INTEGER_CST@2) INTEGER_CST@3))