1 /* Match-and-simplify patterns for shared GENERIC and GIMPLE folding.
2 This file is consumed by genmatch which produces gimple-match.cc
3 and generic-match.cc from it.
5 Copyright (C) 2014-2023 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
42 bitmask_inv_cst_vector_p)
45 (define_operator_list tcc_comparison
46 lt le eq ne ge gt unordered ordered unlt unle ungt unge uneq ltgt)
47 (define_operator_list inverted_tcc_comparison
48 ge gt ne eq lt le ordered unordered ge gt le lt ltgt uneq)
49 (define_operator_list inverted_tcc_comparison_with_nans
50 unge ungt ne eq unlt unle ordered unordered ge gt le lt ltgt uneq)
51 (define_operator_list swapped_tcc_comparison
52 gt ge eq ne le lt unordered ordered ungt unge unlt unle uneq ltgt)
53 (define_operator_list simple_comparison lt le eq ne ge gt)
54 (define_operator_list swapped_simple_comparison gt ge eq ne le lt)
55 (define_operator_list BSWAP BUILT_IN_BSWAP16 BUILT_IN_BSWAP32
56 BUILT_IN_BSWAP64 BUILT_IN_BSWAP128)
58 #include "cfn-operators.pd"
60 /* Define operand lists for math rounding functions {,i,l,ll}FN,
61 where the versions prefixed with "i" return an int, those prefixed with
62 "l" return a long and those prefixed with "ll" return a long long.
64 Also define operand lists:
66 X<FN>F for all float functions, in the order i, l, ll
67 X<FN> for all double functions, in the same order
68 X<FN>L for all long double functions, in the same order. */
69 #define DEFINE_INT_AND_FLOAT_ROUND_FN(FN) \
70 (define_operator_list X##FN##F BUILT_IN_I##FN##F \
73 (define_operator_list X##FN BUILT_IN_I##FN \
76 (define_operator_list X##FN##L BUILT_IN_I##FN##L \
80 DEFINE_INT_AND_FLOAT_ROUND_FN (FLOOR)
81 DEFINE_INT_AND_FLOAT_ROUND_FN (CEIL)
82 DEFINE_INT_AND_FLOAT_ROUND_FN (ROUND)
83 DEFINE_INT_AND_FLOAT_ROUND_FN (RINT)
85 /* Unary operations and their associated IFN_COND_* function. */
86 (define_operator_list UNCOND_UNARY
88 (define_operator_list COND_UNARY
89 IFN_COND_NEG IFN_COND_NOT)
91 /* Binary operations and their associated IFN_COND_* function. */
92 (define_operator_list UNCOND_BINARY
94 mult trunc_div trunc_mod rdiv
97 bit_and bit_ior bit_xor
99 (define_operator_list COND_BINARY
100 IFN_COND_ADD IFN_COND_SUB
101 IFN_COND_MUL IFN_COND_DIV IFN_COND_MOD IFN_COND_RDIV
102 IFN_COND_MIN IFN_COND_MAX
103 IFN_COND_FMIN IFN_COND_FMAX
104 IFN_COND_AND IFN_COND_IOR IFN_COND_XOR
105 IFN_COND_SHL IFN_COND_SHR)
107 /* Same for ternary operations. */
108 (define_operator_list UNCOND_TERNARY
109 IFN_FMA IFN_FMS IFN_FNMA IFN_FNMS)
110 (define_operator_list COND_TERNARY
111 IFN_COND_FMA IFN_COND_FMS IFN_COND_FNMA IFN_COND_FNMS)
113 /* __atomic_fetch_or_*, __atomic_fetch_xor_*, __atomic_xor_fetch_* */
114 (define_operator_list ATOMIC_FETCH_OR_XOR_N
115 BUILT_IN_ATOMIC_FETCH_OR_1 BUILT_IN_ATOMIC_FETCH_OR_2
116 BUILT_IN_ATOMIC_FETCH_OR_4 BUILT_IN_ATOMIC_FETCH_OR_8
117 BUILT_IN_ATOMIC_FETCH_OR_16
118 BUILT_IN_ATOMIC_FETCH_XOR_1 BUILT_IN_ATOMIC_FETCH_XOR_2
119 BUILT_IN_ATOMIC_FETCH_XOR_4 BUILT_IN_ATOMIC_FETCH_XOR_8
120 BUILT_IN_ATOMIC_FETCH_XOR_16
121 BUILT_IN_ATOMIC_XOR_FETCH_1 BUILT_IN_ATOMIC_XOR_FETCH_2
122 BUILT_IN_ATOMIC_XOR_FETCH_4 BUILT_IN_ATOMIC_XOR_FETCH_8
123 BUILT_IN_ATOMIC_XOR_FETCH_16)
124 /* __sync_fetch_and_or_*, __sync_fetch_and_xor_*, __sync_xor_and_fetch_* */
125 (define_operator_list SYNC_FETCH_OR_XOR_N
126 BUILT_IN_SYNC_FETCH_AND_OR_1 BUILT_IN_SYNC_FETCH_AND_OR_2
127 BUILT_IN_SYNC_FETCH_AND_OR_4 BUILT_IN_SYNC_FETCH_AND_OR_8
128 BUILT_IN_SYNC_FETCH_AND_OR_16
129 BUILT_IN_SYNC_FETCH_AND_XOR_1 BUILT_IN_SYNC_FETCH_AND_XOR_2
130 BUILT_IN_SYNC_FETCH_AND_XOR_4 BUILT_IN_SYNC_FETCH_AND_XOR_8
131 BUILT_IN_SYNC_FETCH_AND_XOR_16
132 BUILT_IN_SYNC_XOR_AND_FETCH_1 BUILT_IN_SYNC_XOR_AND_FETCH_2
133 BUILT_IN_SYNC_XOR_AND_FETCH_4 BUILT_IN_SYNC_XOR_AND_FETCH_8
134 BUILT_IN_SYNC_XOR_AND_FETCH_16)
135 /* __atomic_fetch_and_*. */
136 (define_operator_list ATOMIC_FETCH_AND_N
137 BUILT_IN_ATOMIC_FETCH_AND_1 BUILT_IN_ATOMIC_FETCH_AND_2
138 BUILT_IN_ATOMIC_FETCH_AND_4 BUILT_IN_ATOMIC_FETCH_AND_8
139 BUILT_IN_ATOMIC_FETCH_AND_16)
140 /* __sync_fetch_and_and_*. */
141 (define_operator_list SYNC_FETCH_AND_AND_N
142 BUILT_IN_SYNC_FETCH_AND_AND_1 BUILT_IN_SYNC_FETCH_AND_AND_2
143 BUILT_IN_SYNC_FETCH_AND_AND_4 BUILT_IN_SYNC_FETCH_AND_AND_8
144 BUILT_IN_SYNC_FETCH_AND_AND_16)
146 /* With nop_convert? combine convert? and view_convert? in one pattern
147 plus conditionalize on tree_nop_conversion_p conversions. */
148 (match (nop_convert @0)
150 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))))
151 (match (nop_convert @0)
153 (if (VECTOR_TYPE_P (type) && VECTOR_TYPE_P (TREE_TYPE (@0))
154 && known_eq (TYPE_VECTOR_SUBPARTS (type),
155 TYPE_VECTOR_SUBPARTS (TREE_TYPE (@0)))
156 && tree_nop_conversion_p (TREE_TYPE (type), TREE_TYPE (TREE_TYPE (@0))))))
159 /* These are used by gimple_bitwise_inverted_equal_p to simplify
160 detection of BIT_NOT and comparisons. */
161 (match (bit_not_with_nop @0)
163 (match (bit_not_with_nop @0)
164 (convert (bit_not @0))
165 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))))
166 (for cmp (tcc_comparison)
167 (match (maybe_cmp @0)
169 (match (maybe_cmp @0)
170 (convert (cmp@0 @1 @2))
171 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))))
175 /* Transform likes of (char) ABS_EXPR <(int) x> into (char) ABSU_EXPR <x>
176 ABSU_EXPR returns unsigned absolute value of the operand and the operand
177 of the ABSU_EXPR will have the corresponding signed type. */
178 (simplify (abs (convert @0))
179 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
180 && !TYPE_UNSIGNED (TREE_TYPE (@0))
181 && element_precision (type) > element_precision (TREE_TYPE (@0)))
182 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
183 (convert (absu:utype @0)))))
186 /* Optimize (X + (X >> (prec - 1))) ^ (X >> (prec - 1)) into abs (X). */
188 (bit_xor:c (plus:c @0 (rshift@2 @0 INTEGER_CST@1)) @2)
189 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
190 && !TYPE_UNSIGNED (TREE_TYPE (@0))
191 && wi::to_widest (@1) == element_precision (TREE_TYPE (@0)) - 1)
195 /* Simplifications of operations with one constant operand and
196 simplifications to constants or single values. */
198 (for op (plus pointer_plus minus bit_ior bit_xor)
200 (op @0 integer_zerop)
203 /* 0 +p index -> (type)index */
205 (pointer_plus integer_zerop @1)
206 (non_lvalue (convert @1)))
208 /* ptr - 0 -> (type)ptr */
210 (pointer_diff @0 integer_zerop)
213 /* See if ARG1 is zero and X + ARG1 reduces to X.
214 Likewise if the operands are reversed. */
216 (plus:c @0 real_zerop@1)
217 (if (fold_real_zero_addition_p (type, @0, @1, 0))
220 /* See if ARG1 is zero and X - ARG1 reduces to X. */
222 (minus @0 real_zerop@1)
223 (if (fold_real_zero_addition_p (type, @0, @1, 1))
226 /* Even if the fold_real_zero_addition_p can't simplify X + 0.0
227 into X, we can optimize (X + 0.0) + 0.0 or (X + 0.0) - 0.0
228 or (X - 0.0) + 0.0 into X + 0.0 and (X - 0.0) - 0.0 into X - 0.0
229 if not -frounding-math. For sNaNs the first operation would raise
230 exceptions but turn the result into qNan, so the second operation
231 would not raise it. */
232 (for inner_op (plus minus)
233 (for outer_op (plus minus)
235 (outer_op (inner_op@3 @0 REAL_CST@1) REAL_CST@2)
238 && !HONOR_SIGN_DEPENDENT_ROUNDING (type))
239 (with { bool inner_plus = ((inner_op == PLUS_EXPR)
240 ^ REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@1)));
242 = ((outer_op == PLUS_EXPR)
243 ^ REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@2))); }
244 (if (outer_plus && !inner_plus)
249 This is unsafe for certain floats even in non-IEEE formats.
250 In IEEE, it is unsafe because it does wrong for NaNs.
251 PR middle-end/98420: x - x may be -0.0 with FE_DOWNWARD.
252 Also note that operand_equal_p is always false if an operand
256 (if (!FLOAT_TYPE_P (type)
257 || (!tree_expr_maybe_nan_p (@0)
258 && !tree_expr_maybe_infinite_p (@0)
259 && (!HONOR_SIGN_DEPENDENT_ROUNDING (type)
260 || !HONOR_SIGNED_ZEROS (type))))
261 { build_zero_cst (type); }))
263 (pointer_diff @@0 @0)
264 { build_zero_cst (type); })
267 (mult @0 integer_zerop@1)
270 /* -x == x -> x == 0 */
273 (cmp:c @0 (negate @0))
274 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
275 && !TYPE_OVERFLOW_WRAPS (TREE_TYPE(@0)))
276 (cmp @0 { build_zero_cst (TREE_TYPE(@0)); }))))
278 /* Maybe fold x * 0 to 0. The expressions aren't the same
279 when x is NaN, since x * 0 is also NaN. Nor are they the
280 same in modes with signed zeros, since multiplying a
281 negative value by 0 gives -0, not +0. Nor when x is +-Inf,
282 since x * 0 is NaN. */
284 (mult @0 real_zerop@1)
285 (if (!tree_expr_maybe_nan_p (@0)
286 && (!HONOR_NANS (type) || !tree_expr_maybe_infinite_p (@0))
287 && (!HONOR_SIGNED_ZEROS (type) || tree_expr_nonnegative_p (@0)))
290 /* In IEEE floating point, x*1 is not equivalent to x for snans.
291 Likewise for complex arithmetic with signed zeros. */
294 (if (!tree_expr_maybe_signaling_nan_p (@0)
295 && (!HONOR_SIGNED_ZEROS (type)
296 || !COMPLEX_FLOAT_TYPE_P (type)))
299 /* Transform x * -1.0 into -x. */
301 (mult @0 real_minus_onep)
302 (if (!tree_expr_maybe_signaling_nan_p (@0)
303 && (!HONOR_SIGNED_ZEROS (type)
304 || !COMPLEX_FLOAT_TYPE_P (type)))
307 /* Transform x * { 0 or 1, 0 or 1, ... } into x & { 0 or -1, 0 or -1, ...},
308 unless the target has native support for the former but not the latter. */
310 (mult @0 VECTOR_CST@1)
311 (if (initializer_each_zero_or_onep (@1)
312 && !HONOR_SNANS (type)
313 && !HONOR_SIGNED_ZEROS (type))
314 (with { tree itype = FLOAT_TYPE_P (type) ? unsigned_type_for (type) : type; }
316 && (!VECTOR_MODE_P (TYPE_MODE (type))
317 || (VECTOR_MODE_P (TYPE_MODE (itype))
318 && optab_handler (and_optab,
319 TYPE_MODE (itype)) != CODE_FOR_nothing)))
320 (view_convert (bit_and:itype (view_convert @0)
321 (ne @1 { build_zero_cst (type); })))))))
323 /* In SWAR (SIMD within a register) code a signed comparison of packed data
324 can be constructed with a particular combination of shift, bitwise and,
325 and multiplication by constants. If that code is vectorized we can
326 convert this pattern into a more efficient vector comparison. */
328 (mult (bit_and (rshift @0 uniform_integer_cst_p@1)
329 uniform_integer_cst_p@2)
330 uniform_integer_cst_p@3)
332 tree rshift_cst = uniform_integer_cst_p (@1);
333 tree bit_and_cst = uniform_integer_cst_p (@2);
334 tree mult_cst = uniform_integer_cst_p (@3);
336 /* Make sure we're working with vectors and uniform vector constants. */
337 (if (VECTOR_TYPE_P (type)
338 && tree_fits_uhwi_p (rshift_cst)
339 && tree_fits_uhwi_p (mult_cst)
340 && tree_fits_uhwi_p (bit_and_cst))
341 /* Compute what constants would be needed for this to represent a packed
342 comparison based on the shift amount denoted by RSHIFT_CST. */
344 HOST_WIDE_INT vec_elem_bits = vector_element_bits (type);
345 poly_int64 vec_nelts = TYPE_VECTOR_SUBPARTS (type);
346 poly_int64 vec_bits = vec_elem_bits * vec_nelts;
347 unsigned HOST_WIDE_INT cmp_bits_i, bit_and_i, mult_i;
348 unsigned HOST_WIDE_INT target_mult_i, target_bit_and_i;
349 cmp_bits_i = tree_to_uhwi (rshift_cst) + 1;
350 mult_i = tree_to_uhwi (mult_cst);
351 target_mult_i = (HOST_WIDE_INT_1U << cmp_bits_i) - 1;
352 bit_and_i = tree_to_uhwi (bit_and_cst);
353 target_bit_and_i = 0;
355 /* The bit pattern in BIT_AND_I should be a mask for the least
356 significant bit of each packed element that is CMP_BITS wide. */
357 for (unsigned i = 0; i < vec_elem_bits / cmp_bits_i; i++)
358 target_bit_and_i = (target_bit_and_i << cmp_bits_i) | 1U;
360 (if ((exact_log2 (cmp_bits_i)) >= 0
361 && cmp_bits_i < HOST_BITS_PER_WIDE_INT
362 && multiple_p (vec_bits, cmp_bits_i)
363 && vec_elem_bits <= HOST_BITS_PER_WIDE_INT
364 && target_mult_i == mult_i
365 && target_bit_and_i == bit_and_i)
366 /* Compute the vector shape for the comparison and check if the target is
367 able to expand the comparison with that type. */
369 /* We're doing a signed comparison. */
370 tree cmp_type = build_nonstandard_integer_type (cmp_bits_i, 0);
371 poly_int64 vector_type_nelts = exact_div (vec_bits, cmp_bits_i);
372 tree vec_cmp_type = build_vector_type (cmp_type, vector_type_nelts);
373 tree vec_truth_type = truth_type_for (vec_cmp_type);
374 tree zeros = build_zero_cst (vec_cmp_type);
375 tree ones = build_all_ones_cst (vec_cmp_type);
377 (if (expand_vec_cmp_expr_p (vec_cmp_type, vec_truth_type, LT_EXPR)
378 && expand_vec_cond_expr_p (vec_cmp_type, vec_truth_type, LT_EXPR))
379 (view_convert:type (vec_cond (lt:vec_truth_type
380 (view_convert:vec_cmp_type @0)
382 { ones; } { zeros; })))))))))
384 (for cmp (gt ge lt le)
385 outp (convert convert negate negate)
386 outn (negate negate convert convert)
387 /* Transform X * (X > 0.0 ? 1.0 : -1.0) into abs(X). */
388 /* Transform X * (X >= 0.0 ? 1.0 : -1.0) into abs(X). */
389 /* Transform X * (X < 0.0 ? 1.0 : -1.0) into -abs(X). */
390 /* Transform X * (X <= 0.0 ? 1.0 : -1.0) into -abs(X). */
392 (mult:c @0 (cond (cmp @0 real_zerop) real_onep@1 real_minus_onep))
393 (if (!tree_expr_maybe_nan_p (@0) && !HONOR_SIGNED_ZEROS (type))
395 /* Transform X * (X > 0.0 ? -1.0 : 1.0) into -abs(X). */
396 /* Transform X * (X >= 0.0 ? -1.0 : 1.0) into -abs(X). */
397 /* Transform X * (X < 0.0 ? -1.0 : 1.0) into abs(X). */
398 /* Transform X * (X <= 0.0 ? -1.0 : 1.0) into abs(X). */
400 (mult:c @0 (cond (cmp @0 real_zerop) real_minus_onep real_onep@1))
401 (if (!tree_expr_maybe_nan_p (@0) && !HONOR_SIGNED_ZEROS (type))
404 /* Transform X * copysign (1.0, X) into abs(X). */
406 (mult:c @0 (COPYSIGN_ALL real_onep @0))
407 (if (!tree_expr_maybe_nan_p (@0) && !HONOR_SIGNED_ZEROS (type))
410 /* Transform X * copysign (1.0, -X) into -abs(X). */
412 (mult:c @0 (COPYSIGN_ALL real_onep (negate @0)))
413 (if (!tree_expr_maybe_nan_p (@0) && !HONOR_SIGNED_ZEROS (type))
416 /* Transform copysign (CST, X) into copysign (ABS(CST), X). */
418 (COPYSIGN_ALL REAL_CST@0 @1)
419 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@0)))
420 (COPYSIGN_ALL (negate @0) @1)))
422 /* Transform c ? x * copysign (1, y) : z to c ? x ^ signs(y) : z.
423 tree-ssa-math-opts.cc does the corresponding optimization for
424 unconditional multiplications (via xorsign). */
426 (IFN_COND_MUL:c @0 @1 (IFN_COPYSIGN real_onep @2) @3)
427 (with { tree signs = sign_mask_for (type); }
429 (with { tree inttype = TREE_TYPE (signs); }
431 (IFN_COND_XOR:inttype @0
432 (view_convert:inttype @1)
433 (bit_and (view_convert:inttype @2) { signs; })
434 (view_convert:inttype @3)))))))
436 /* (x >= 0 ? x : 0) + (x <= 0 ? -x : 0) -> abs x. */
438 (plus:c (max @0 integer_zerop) (max (negate @0) integer_zerop))
441 /* X * 1, X / 1 -> X. */
442 (for op (mult trunc_div ceil_div floor_div round_div exact_div)
447 /* (A / (1 << B)) -> (A >> B).
448 Only for unsigned A. For signed A, this would not preserve rounding
450 For example: (-1 / ( 1 << B)) != -1 >> B.
451 Also handle widening conversions, like:
452 (A / (unsigned long long) (1U << B)) -> (A >> B)
454 (A / (unsigned long long) (1 << B)) -> (A >> B).
455 If the left shift is signed, it can be done only if the upper bits
456 of A starting from shift's type sign bit are zero, as
457 (unsigned long long) (1 << 31) is -2147483648ULL, not 2147483648ULL,
458 so it is valid only if A >> 31 is zero. */
460 (trunc_div (convert?@0 @3) (convert2? (lshift integer_onep@1 @2)))
461 (if ((TYPE_UNSIGNED (type) || tree_expr_nonnegative_p (@0))
462 && (!VECTOR_TYPE_P (type)
463 || target_supports_op_p (type, RSHIFT_EXPR, optab_vector)
464 || target_supports_op_p (type, RSHIFT_EXPR, optab_scalar))
465 && (useless_type_conversion_p (type, TREE_TYPE (@1))
466 || (element_precision (type) >= element_precision (TREE_TYPE (@1))
467 && (TYPE_UNSIGNED (TREE_TYPE (@1))
468 || (element_precision (type)
469 == element_precision (TREE_TYPE (@1)))
470 || (INTEGRAL_TYPE_P (type)
471 && (tree_nonzero_bits (@0)
472 & wi::mask (element_precision (TREE_TYPE (@1)) - 1,
474 element_precision (type))) == 0)))))
475 (if (!VECTOR_TYPE_P (type)
476 && useless_type_conversion_p (TREE_TYPE (@3), TREE_TYPE (@1))
477 && element_precision (TREE_TYPE (@3)) < element_precision (type))
478 (convert (rshift @3 @2))
481 /* Preserve explicit divisions by 0: the C++ front-end wants to detect
482 undefined behavior in constexpr evaluation, and assuming that the division
483 traps enables better optimizations than these anyway. */
484 (for div (trunc_div ceil_div floor_div round_div exact_div)
485 /* 0 / X is always zero. */
487 (div integer_zerop@0 @1)
488 /* But not for 0 / 0 so that we can get the proper warnings and errors. */
489 (if (!integer_zerop (@1))
493 (div @0 integer_minus_onep@1)
494 (if (!TYPE_UNSIGNED (type))
496 /* X / bool_range_Y is X. */
499 (if (INTEGRAL_TYPE_P (type)
500 && ssa_name_has_boolean_range (@1)
501 && !flag_non_call_exceptions)
506 /* But not for 0 / 0 so that we can get the proper warnings and errors.
507 And not for _Fract types where we can't build 1. */
508 (if (!ALL_FRACT_MODE_P (TYPE_MODE (type))
509 && !integer_zerop (@0)
510 && (!flag_non_call_exceptions || tree_expr_nonzero_p (@0)))
511 { build_one_cst (type); }))
512 /* X / abs (X) is X < 0 ? -1 : 1. */
515 (if (INTEGRAL_TYPE_P (type)
516 && TYPE_OVERFLOW_UNDEFINED (type)
517 && !integer_zerop (@0)
518 && (!flag_non_call_exceptions || tree_expr_nonzero_p (@0)))
519 (cond (lt @0 { build_zero_cst (type); })
520 { build_minus_one_cst (type); } { build_one_cst (type); })))
523 (div:C @0 (negate @0))
524 (if ((INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
525 && TYPE_OVERFLOW_UNDEFINED (type)
526 && !integer_zerop (@0)
527 && (!flag_non_call_exceptions || tree_expr_nonzero_p (@0)))
528 { build_minus_one_cst (type); })))
530 /* For unsigned integral types, FLOOR_DIV_EXPR is the same as
531 TRUNC_DIV_EXPR. Rewrite into the latter in this case. Similarly
532 for MOD instead of DIV. */
533 (for floor_divmod (floor_div floor_mod)
534 trunc_divmod (trunc_div trunc_mod)
537 (if ((INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
538 && TYPE_UNSIGNED (type))
539 (trunc_divmod @0 @1))))
541 /* 1 / X -> X == 1 for unsigned integer X.
542 1 / X -> X >= -1 && X <= 1 ? X : 0 for signed integer X.
543 But not for 1 / 0 so that we can get proper warnings and errors,
544 and not for 1-bit integers as they are edge cases better handled
547 (trunc_div integer_onep@0 @1)
548 (if (INTEGRAL_TYPE_P (type)
549 && TYPE_PRECISION (type) > 1
550 && !integer_zerop (@1)
551 && (!flag_non_call_exceptions || tree_expr_nonzero_p (@1)))
552 (if (TYPE_UNSIGNED (type))
553 (convert (eq:boolean_type_node @1 { build_one_cst (type); }))
554 (with { tree utype = unsigned_type_for (type); }
555 (cond (le (plus (convert:utype @1) { build_one_cst (utype); })
556 { build_int_cst (utype, 2); })
557 @1 { build_zero_cst (type); })))))
559 /* Combine two successive divisions. Note that combining ceil_div
560 and floor_div is trickier and combining round_div even more so. */
561 (for div (trunc_div exact_div)
563 (div (div@3 @0 INTEGER_CST@1) INTEGER_CST@2)
565 wi::overflow_type overflow;
566 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@2),
567 TYPE_SIGN (type), &overflow);
569 (if (div == EXACT_DIV_EXPR
570 || optimize_successive_divisions_p (@2, @3))
572 (div @0 { wide_int_to_tree (type, mul); })
573 (if (TYPE_UNSIGNED (type)
574 || mul != wi::min_value (TYPE_PRECISION (type), SIGNED))
575 { build_zero_cst (type); }))))))
577 /* Combine successive multiplications. Similar to above, but handling
578 overflow is different. */
580 (mult (mult @0 INTEGER_CST@1) INTEGER_CST@2)
582 wi::overflow_type overflow;
583 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@2),
584 TYPE_SIGN (type), &overflow);
586 /* Skip folding on overflow: the only special case is @1 * @2 == -INT_MIN,
587 otherwise undefined overflow implies that @0 must be zero. */
588 (if (!overflow || TYPE_OVERFLOW_WRAPS (type))
589 (mult @0 { wide_int_to_tree (type, mul); }))))
591 /* Similar to above, but there could be an extra add/sub between
592 successive multuiplications. */
594 (mult (plus:s (mult:s@4 @0 INTEGER_CST@1) INTEGER_CST@2) INTEGER_CST@3)
596 bool overflowed = true;
597 wi::overflow_type ovf1, ovf2;
598 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@3),
599 TYPE_SIGN (type), &ovf1);
600 wide_int add = wi::mul (wi::to_wide (@2), wi::to_wide (@3),
601 TYPE_SIGN (type), &ovf2);
602 if (TYPE_OVERFLOW_UNDEFINED (type))
606 if (ovf1 == wi::OVF_NONE && ovf2 == wi::OVF_NONE
607 && get_global_range_query ()->range_of_expr (vr0, @4)
608 && !vr0.varying_p () && !vr0.undefined_p ())
610 wide_int wmin0 = vr0.lower_bound ();
611 wide_int wmax0 = vr0.upper_bound ();
612 wmin0 = wi::mul (wmin0, wi::to_wide (@3), TYPE_SIGN (type), &ovf1);
613 wmax0 = wi::mul (wmax0, wi::to_wide (@3), TYPE_SIGN (type), &ovf2);
614 if (ovf1 == wi::OVF_NONE && ovf2 == wi::OVF_NONE)
616 wi::add (wmin0, add, TYPE_SIGN (type), &ovf1);
617 wi::add (wmax0, add, TYPE_SIGN (type), &ovf2);
618 if (ovf1 == wi::OVF_NONE && ovf2 == wi::OVF_NONE)
627 /* Skip folding on overflow. */
629 (plus (mult @0 { wide_int_to_tree (type, mul); })
630 { wide_int_to_tree (type, add); }))))
632 /* Similar to above, but a multiplication between successive additions. */
634 (plus (mult:s (plus:s @0 INTEGER_CST@1) INTEGER_CST@2) INTEGER_CST@3)
636 bool overflowed = true;
637 wi::overflow_type ovf1;
638 wi::overflow_type ovf2;
639 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@2),
640 TYPE_SIGN (type), &ovf1);
641 wide_int add = wi::add (mul, wi::to_wide (@3),
642 TYPE_SIGN (type), &ovf2);
643 if (TYPE_OVERFLOW_UNDEFINED (type))
647 if (ovf1 == wi::OVF_NONE && ovf2 == wi::OVF_NONE
648 && get_global_range_query ()->range_of_expr (vr0, @0)
649 && !vr0.varying_p () && !vr0.undefined_p ())
651 wide_int wmin0 = vr0.lower_bound ();
652 wide_int wmax0 = vr0.upper_bound ();
653 wmin0 = wi::mul (wmin0, wi::to_wide (@2), TYPE_SIGN (type), &ovf1);
654 wmax0 = wi::mul (wmax0, wi::to_wide (@2), TYPE_SIGN (type), &ovf2);
655 if (ovf1 == wi::OVF_NONE && ovf2 == wi::OVF_NONE)
657 wi::add (wmin0, mul, TYPE_SIGN (type), &ovf1);
658 wi::add (wmax0, mul, TYPE_SIGN (type), &ovf2);
659 if (ovf1 == wi::OVF_NONE && ovf2 == wi::OVF_NONE)
668 /* Skip folding on overflow. */
670 (plus (mult @0 @2) { wide_int_to_tree (type, add); }))))
672 /* Optimize A / A to 1.0 if we don't care about
673 NaNs or Infinities. */
676 (if (FLOAT_TYPE_P (type)
677 && ! HONOR_NANS (type)
678 && ! HONOR_INFINITIES (type))
679 { build_one_cst (type); }))
681 /* Optimize -A / A to -1.0 if we don't care about
682 NaNs or Infinities. */
684 (rdiv:C @0 (negate @0))
685 (if (FLOAT_TYPE_P (type)
686 && ! HONOR_NANS (type)
687 && ! HONOR_INFINITIES (type))
688 { build_minus_one_cst (type); }))
690 /* PR71078: x / abs(x) -> copysign (1.0, x) */
692 (rdiv:C (convert? @0) (convert? (abs @0)))
693 (if (SCALAR_FLOAT_TYPE_P (type)
694 && ! HONOR_NANS (type)
695 && ! HONOR_INFINITIES (type))
697 (if (types_match (type, float_type_node))
698 (BUILT_IN_COPYSIGNF { build_one_cst (type); } (convert @0)))
699 (if (types_match (type, double_type_node))
700 (BUILT_IN_COPYSIGN { build_one_cst (type); } (convert @0)))
701 (if (types_match (type, long_double_type_node))
702 (BUILT_IN_COPYSIGNL { build_one_cst (type); } (convert @0))))))
704 /* In IEEE floating point, x/1 is not equivalent to x for snans. */
707 (if (!tree_expr_maybe_signaling_nan_p (@0))
710 /* In IEEE floating point, x/-1 is not equivalent to -x for snans. */
712 (rdiv @0 real_minus_onep)
713 (if (!tree_expr_maybe_signaling_nan_p (@0))
716 (if (flag_reciprocal_math)
717 /* Convert (A/B)/C to A/(B*C). */
719 (rdiv (rdiv:s @0 @1) @2)
720 (rdiv @0 (mult @1 @2)))
722 /* Canonicalize x / (C1 * y) to (x * C2) / y. */
724 (rdiv @0 (mult:s @1 REAL_CST@2))
726 { tree tem = const_binop (RDIV_EXPR, type, build_one_cst (type), @2); }
728 (rdiv (mult @0 { tem; } ) @1))))
730 /* Convert A/(B/C) to (A/B)*C */
732 (rdiv @0 (rdiv:s @1 @2))
733 (mult (rdiv @0 @1) @2)))
735 /* Simplify x / (- y) to -x / y. */
737 (rdiv @0 (negate @1))
738 (rdiv (negate @0) @1))
740 (if (flag_unsafe_math_optimizations)
741 /* Simplify (C / x op 0.0) to x op 0.0 for C != 0, C != Inf/Nan.
742 Since C / x may underflow to zero, do this only for unsafe math. */
743 (for op (lt le gt ge)
746 (op (rdiv REAL_CST@0 @1) real_zerop@2)
747 (if (!HONOR_SIGNED_ZEROS (@1) && !HONOR_INFINITIES (@1))
749 (if (real_less (&dconst0, TREE_REAL_CST_PTR (@0)))
751 /* For C < 0, use the inverted operator. */
752 (if (real_less (TREE_REAL_CST_PTR (@0), &dconst0))
755 /* Optimize (X & (-A)) / A where A is a power of 2, to X >> log2(A) */
756 (for div (trunc_div ceil_div floor_div round_div exact_div)
758 (div (convert? (bit_and @0 INTEGER_CST@1)) INTEGER_CST@2)
759 (if (integer_pow2p (@2)
760 && tree_int_cst_sgn (@2) > 0
761 && tree_nop_conversion_p (type, TREE_TYPE (@0))
762 && wi::to_wide (@2) + wi::to_wide (@1) == 0)
764 { build_int_cst (integer_type_node,
765 wi::exact_log2 (wi::to_wide (@2))); }))))
767 /* If ARG1 is a constant, we can convert this to a multiply by the
768 reciprocal. This does not have the same rounding properties,
769 so only do this if -freciprocal-math. We can actually
770 always safely do it if ARG1 is a power of two, but it's hard to
771 tell if it is or not in a portable manner. */
772 (for cst (REAL_CST COMPLEX_CST VECTOR_CST)
776 (if (flag_reciprocal_math
779 { tree tem = const_binop (RDIV_EXPR, type, build_one_cst (type), @1); }
781 (mult @0 { tem; } )))
782 (if (cst != COMPLEX_CST)
783 (with { tree inverse = exact_inverse (type, @1); }
785 (mult @0 { inverse; } ))))))))
787 (for mod (ceil_mod floor_mod round_mod trunc_mod)
788 /* 0 % X is always zero. */
790 (mod integer_zerop@0 @1)
791 /* But not for 0 % 0 so that we can get the proper warnings and errors. */
792 (if (!integer_zerop (@1))
794 /* X % 1 is always zero. */
796 (mod @0 integer_onep)
797 { build_zero_cst (type); })
798 /* X % -1 is zero. */
800 (mod @0 integer_minus_onep@1)
801 (if (!TYPE_UNSIGNED (type))
802 { build_zero_cst (type); }))
806 /* But not for 0 % 0 so that we can get the proper warnings and errors. */
807 (if (!integer_zerop (@0))
808 { build_zero_cst (type); }))
809 /* (X % Y) % Y is just X % Y. */
811 (mod (mod@2 @0 @1) @1)
813 /* From extract_muldiv_1: (X * C1) % C2 is zero if C1 is a multiple of C2. */
815 (mod (mult @0 INTEGER_CST@1) INTEGER_CST@2)
816 (if (ANY_INTEGRAL_TYPE_P (type)
817 && TYPE_OVERFLOW_UNDEFINED (type)
818 && wi::multiple_of_p (wi::to_wide (@1), wi::to_wide (@2),
820 { build_zero_cst (type); }))
821 /* For (X % C) == 0, if X is signed and C is power of 2, use unsigned
822 modulo and comparison, since it is simpler and equivalent. */
825 (cmp (mod @0 integer_pow2p@2) integer_zerop@1)
826 (if (!TYPE_UNSIGNED (TREE_TYPE (@0)))
827 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
828 (cmp (mod (convert:utype @0) (convert:utype @2)) (convert:utype @1)))))))
830 /* X % -C is the same as X % C. */
832 (trunc_mod @0 INTEGER_CST@1)
833 (if (TYPE_SIGN (type) == SIGNED
834 && !TREE_OVERFLOW (@1)
835 && wi::neg_p (wi::to_wide (@1))
836 && !TYPE_OVERFLOW_TRAPS (type)
837 /* Avoid this transformation if C is INT_MIN, i.e. C == -C. */
838 && !sign_bit_p (@1, @1))
839 (trunc_mod @0 (negate @1))))
841 /* X % -Y is the same as X % Y. */
843 (trunc_mod @0 (convert? (negate @1)))
844 (if (INTEGRAL_TYPE_P (type)
845 && !TYPE_UNSIGNED (type)
846 && !TYPE_OVERFLOW_TRAPS (type)
847 && tree_nop_conversion_p (type, TREE_TYPE (@1))
848 /* Avoid this transformation if X might be INT_MIN or
849 Y might be -1, because we would then change valid
850 INT_MIN % -(-1) into invalid INT_MIN % -1. */
851 && (expr_not_equal_to (@0, wi::to_wide (TYPE_MIN_VALUE (type)))
852 || expr_not_equal_to (@1, wi::minus_one (TYPE_PRECISION
854 (trunc_mod @0 (convert @1))))
856 /* X - (X / Y) * Y is the same as X % Y. */
858 (minus (convert1? @0) (convert2? (mult:c (trunc_div @@0 @@1) @1)))
859 (if (INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
860 (convert (trunc_mod @0 @1))))
862 /* x * (1 + y / x) - y -> x - y % x */
864 (minus (mult:cs @0 (plus:s (trunc_div:s @1 @0) integer_onep)) @1)
865 (if (INTEGRAL_TYPE_P (type))
866 (minus @0 (trunc_mod @1 @0))))
868 /* Optimize TRUNC_MOD_EXPR by a power of two into a BIT_AND_EXPR,
869 i.e. "X % C" into "X & (C - 1)", if X and C are positive.
870 Also optimize A % (C << N) where C is a power of 2,
871 to A & ((C << N) - 1).
872 Also optimize "A shift (B % C)", if C is a power of 2, to
873 "A shift (B & (C - 1))". SHIFT operation include "<<" and ">>"
874 and assume (B % C) is nonnegative as shifts negative values would
876 (match (power_of_two_cand @1)
878 (match (power_of_two_cand @1)
879 (lshift INTEGER_CST@1 @2))
880 (for mod (trunc_mod floor_mod)
881 (for shift (lshift rshift)
883 (shift @0 (mod @1 (power_of_two_cand@2 @3)))
884 (if (integer_pow2p (@3) && tree_int_cst_sgn (@3) > 0)
885 (shift @0 (bit_and @1 (minus @2 { build_int_cst (TREE_TYPE (@2),
888 (mod @0 (convert? (power_of_two_cand@1 @2)))
889 (if ((TYPE_UNSIGNED (type) || tree_expr_nonnegative_p (@0))
890 /* Allow any integral conversions of the divisor, except
891 conversion from narrower signed to wider unsigned type
892 where if @1 would be negative power of two, the divisor
893 would not be a power of two. */
894 && INTEGRAL_TYPE_P (type)
895 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
896 && (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@1))
897 || TYPE_UNSIGNED (TREE_TYPE (@1))
898 || !TYPE_UNSIGNED (type))
899 && integer_pow2p (@2) && tree_int_cst_sgn (@2) > 0)
900 (with { tree utype = TREE_TYPE (@1);
901 if (!TYPE_OVERFLOW_WRAPS (utype))
902 utype = unsigned_type_for (utype); }
903 (bit_and @0 (convert (minus (convert:utype @1)
904 { build_one_cst (utype); })))))))
906 /* Simplify (unsigned t * 2)/2 -> unsigned t & 0x7FFFFFFF. */
908 (trunc_div (mult @0 integer_pow2p@1) @1)
909 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)) && TYPE_UNSIGNED (TREE_TYPE (@0)))
910 (bit_and @0 { wide_int_to_tree
911 (type, wi::mask (TYPE_PRECISION (type)
912 - wi::exact_log2 (wi::to_wide (@1)),
913 false, TYPE_PRECISION (type))); })))
915 /* Simplify (unsigned t / 2) * 2 -> unsigned t & ~1. */
917 (mult (trunc_div @0 integer_pow2p@1) @1)
918 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)) && TYPE_UNSIGNED (TREE_TYPE (@0)))
919 (bit_and @0 (negate @1))))
921 /* Simplify (t * 2) / 2) -> t. */
922 (for div (trunc_div ceil_div floor_div round_div exact_div)
924 (div (mult:c @0 @1) @1)
925 (if (ANY_INTEGRAL_TYPE_P (type))
926 (if (TYPE_OVERFLOW_UNDEFINED (type))
931 bool overflowed = true;
932 value_range vr0, vr1;
933 if (INTEGRAL_TYPE_P (type)
934 && get_global_range_query ()->range_of_expr (vr0, @0)
935 && get_global_range_query ()->range_of_expr (vr1, @1)
936 && !vr0.varying_p () && !vr0.undefined_p ()
937 && !vr1.varying_p () && !vr1.undefined_p ())
939 wide_int wmin0 = vr0.lower_bound ();
940 wide_int wmax0 = vr0.upper_bound ();
941 wide_int wmin1 = vr1.lower_bound ();
942 wide_int wmax1 = vr1.upper_bound ();
943 /* If the multiplication can't overflow/wrap around, then
944 it can be optimized too. */
945 wi::overflow_type min_ovf, max_ovf;
946 wi::mul (wmin0, wmin1, TYPE_SIGN (type), &min_ovf);
947 wi::mul (wmax0, wmax1, TYPE_SIGN (type), &max_ovf);
948 if (min_ovf == wi::OVF_NONE && max_ovf == wi::OVF_NONE)
950 wi::mul (wmin0, wmax1, TYPE_SIGN (type), &min_ovf);
951 wi::mul (wmax0, wmin1, TYPE_SIGN (type), &max_ovf);
952 if (min_ovf == wi::OVF_NONE && max_ovf == wi::OVF_NONE)
963 /* Simplify cos(-x) and cos(|x|) -> cos(x). Similarly for cosh. */
968 /* Simplify pow(-x, y) and pow(|x|,y) -> pow(x,y) if y is an even integer. */
971 (pows (op @0) REAL_CST@1)
972 (with { HOST_WIDE_INT n; }
973 (if (real_isinteger (&TREE_REAL_CST (@1), &n) && (n & 1) == 0)
975 /* Likewise for powi. */
978 (pows (op @0) INTEGER_CST@1)
979 (if ((wi::to_wide (@1) & 1) == 0)
981 /* Strip negate and abs from both operands of hypot. */
989 /* copysign(-x, y) and copysign(abs(x), y) -> copysign(x, y). */
990 (for copysigns (COPYSIGN_ALL)
992 (copysigns (op @0) @1)
995 /* abs(x)*abs(x) -> x*x. Should be valid for all types. */
1000 /* Convert absu(x)*absu(x) -> x*x. */
1002 (mult (absu@1 @0) @1)
1003 (mult (convert@2 @0) @2))
1005 /* cos(copysign(x, y)) -> cos(x). Similarly for cosh. */
1006 (for coss (COS COSH)
1007 copysigns (COPYSIGN)
1009 (coss (copysigns @0 @1))
1012 /* pow(copysign(x, y), z) -> pow(x, z) if z is an even integer. */
1014 copysigns (COPYSIGN)
1016 (pows (copysigns @0 @2) REAL_CST@1)
1017 (with { HOST_WIDE_INT n; }
1018 (if (real_isinteger (&TREE_REAL_CST (@1), &n) && (n & 1) == 0)
1020 /* Likewise for powi. */
1022 copysigns (COPYSIGN)
1024 (pows (copysigns @0 @2) INTEGER_CST@1)
1025 (if ((wi::to_wide (@1) & 1) == 0)
1029 copysigns (COPYSIGN)
1030 /* hypot(copysign(x, y), z) -> hypot(x, z). */
1032 (hypots (copysigns @0 @1) @2)
1034 /* hypot(x, copysign(y, z)) -> hypot(x, y). */
1036 (hypots @0 (copysigns @1 @2))
1039 /* copysign(x, CST) -> [-]abs (x). */
1040 (for copysigns (COPYSIGN_ALL)
1042 (copysigns @0 REAL_CST@1)
1043 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
1047 /* copysign(copysign(x, y), z) -> copysign(x, z). */
1048 (for copysigns (COPYSIGN_ALL)
1050 (copysigns (copysigns @0 @1) @2)
1053 /* copysign(x,y)*copysign(x,y) -> x*x. */
1054 (for copysigns (COPYSIGN_ALL)
1056 (mult (copysigns@2 @0 @1) @2)
1059 /* ccos(-x) -> ccos(x). Similarly for ccosh. */
1060 (for ccoss (CCOS CCOSH)
1065 /* cabs(-x) and cos(conj(x)) -> cabs(x). */
1066 (for ops (conj negate)
1072 /* Fold (a * (1 << b)) into (a << b) */
1074 (mult:c @0 (convert? (lshift integer_onep@1 @2)))
1075 (if (! FLOAT_TYPE_P (type)
1076 && tree_nop_conversion_p (type, TREE_TYPE (@1)))
1079 /* Shifts by precision or greater result in zero. */
1080 (for shift (lshift rshift)
1082 (shift @0 uniform_integer_cst_p@1)
1083 (if ((GIMPLE || !sanitize_flags_p (SANITIZE_SHIFT_EXPONENT))
1084 /* Leave arithmetic right shifts of possibly negative values alone. */
1085 && (TYPE_UNSIGNED (type)
1086 || shift == LSHIFT_EXPR
1087 || tree_expr_nonnegative_p (@0))
1088 /* Use a signed compare to leave negative shift counts alone. */
1089 && wi::ges_p (wi::to_wide (uniform_integer_cst_p (@1)),
1090 element_precision (type)))
1091 { build_zero_cst (type); })))
1093 /* Shifts by constants distribute over several binary operations,
1094 hence (X << C) + (Y << C) can be simplified to (X + Y) << C. */
1095 (for op (plus minus)
1097 (op (lshift:s @0 @1) (lshift:s @2 @1))
1098 (if (INTEGRAL_TYPE_P (type)
1099 && TYPE_OVERFLOW_WRAPS (type)
1100 && !TYPE_SATURATING (type))
1101 (lshift (op @0 @2) @1))))
1103 (for op (bit_and bit_ior bit_xor)
1105 (op (lshift:s @0 @1) (lshift:s @2 @1))
1106 (if (INTEGRAL_TYPE_P (type))
1107 (lshift (op @0 @2) @1)))
1109 (op (rshift:s @0 @1) (rshift:s @2 @1))
1110 (if (INTEGRAL_TYPE_P (type))
1111 (rshift (op @0 @2) @1))))
1113 /* Fold (1 << (C - x)) where C = precision(type) - 1
1114 into ((1 << C) >> x). */
1116 (lshift integer_onep@0 (minus@1 INTEGER_CST@2 @3))
1117 (if (INTEGRAL_TYPE_P (type)
1118 && wi::eq_p (wi::to_wide (@2), TYPE_PRECISION (type) - 1)
1120 (if (TYPE_UNSIGNED (type))
1121 (rshift (lshift @0 @2) @3)
1123 { tree utype = unsigned_type_for (type); }
1124 (convert (rshift (lshift (convert:utype @0) @2) @3))))))
1126 /* Fold ((type)(a<0)) << SIGNBITOFA into ((type)a) & signbit. */
1128 (lshift (convert (lt @0 integer_zerop@1)) INTEGER_CST@2)
1129 (if (TYPE_SIGN (TREE_TYPE (@0)) == SIGNED
1130 && wi::eq_p (wi::to_wide (@2), TYPE_PRECISION (TREE_TYPE (@0)) - 1))
1131 (with { wide_int wone = wi::one (TYPE_PRECISION (type)); }
1132 (bit_and (convert @0)
1133 { wide_int_to_tree (type,
1134 wi::lshift (wone, wi::to_wide (@2))); }))))
1136 /* Fold (-x >> C) into -(x > 0) where C = precision(type) - 1. */
1137 (for cst (INTEGER_CST VECTOR_CST)
1139 (rshift (negate:s @0) cst@1)
1140 (if (!TYPE_UNSIGNED (type)
1141 && TYPE_OVERFLOW_UNDEFINED (type))
1142 (with { tree stype = TREE_TYPE (@1);
1143 tree bt = truth_type_for (type);
1144 tree zeros = build_zero_cst (type);
1145 tree cst = NULL_TREE; }
1147 /* Handle scalar case. */
1148 (if (INTEGRAL_TYPE_P (type)
1149 /* If we apply the rule to the scalar type before vectorization
1150 we will enforce the result of the comparison being a bool
1151 which will require an extra AND on the result that will be
1152 indistinguishable from when the user did actually want 0
1153 or 1 as the result so it can't be removed. */
1154 && canonicalize_math_after_vectorization_p ()
1155 && wi::eq_p (wi::to_wide (@1), TYPE_PRECISION (type) - 1))
1156 (negate (convert (gt @0 { zeros; }))))
1157 /* Handle vector case. */
1158 (if (VECTOR_INTEGER_TYPE_P (type)
1159 /* First check whether the target has the same mode for vector
1160 comparison results as it's operands do. */
1161 && TYPE_MODE (bt) == TYPE_MODE (type)
1162 /* Then check to see if the target is able to expand the comparison
1163 with the given type later on, otherwise we may ICE. */
1164 && expand_vec_cmp_expr_p (type, bt, GT_EXPR)
1165 && (cst = uniform_integer_cst_p (@1)) != NULL
1166 && wi::eq_p (wi::to_wide (cst), element_precision (type) - 1))
1167 (view_convert (gt:bt @0 { zeros; }))))))))
1169 /* Fold (C1/X)*C2 into (C1*C2)/X. */
1171 (mult (rdiv@3 REAL_CST@0 @1) REAL_CST@2)
1172 (if (flag_associative_math
1175 { tree tem = const_binop (MULT_EXPR, type, @0, @2); }
1177 (rdiv { tem; } @1)))))
1179 /* Simplify ~X & X as zero. */
1181 (bit_and (convert? @0) (convert? @1))
1182 (with { bool wascmp; }
1183 (if (types_match (TREE_TYPE (@0), TREE_TYPE (@1))
1184 && bitwise_inverted_equal_p (@0, @1, wascmp))
1185 { wascmp ? constant_boolean_node (false, type) : build_zero_cst (type); })))
1187 /* PR71636: Transform x & ((1U << b) - 1) -> x & ~(~0U << b); */
1189 (bit_and:c @0 (plus:s (lshift:s integer_onep @1) integer_minus_onep))
1190 (if (TYPE_UNSIGNED (type))
1191 (bit_and @0 (bit_not (lshift { build_all_ones_cst (type); } @1)))))
1193 (for bitop (bit_and bit_ior)
1195 /* PR35691: Transform
1196 (x == 0 & y == 0) -> (x | typeof(x)(y)) == 0.
1197 (x != 0 | y != 0) -> (x | typeof(x)(y)) != 0. */
1199 (bitop (cmp @0 integer_zerop@2) (cmp @1 integer_zerop))
1200 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1201 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
1202 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1)))
1203 (cmp (bit_ior @0 (convert @1)) @2)))
1205 (x == -1 & y == -1) -> (x & typeof(x)(y)) == -1.
1206 (x != -1 | y != -1) -> (x & typeof(x)(y)) != -1. */
1208 (bitop (cmp @0 integer_all_onesp@2) (cmp @1 integer_all_onesp))
1209 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1210 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
1211 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1)))
1212 (cmp (bit_and @0 (convert @1)) @2))))
1214 /* Fold (A & ~B) - (A & B) into (A ^ B) - B. */
1216 (minus (bit_and:cs @0 (bit_not @1)) (bit_and:cs @0 @1))
1217 (minus (bit_xor @0 @1) @1))
1219 (minus (bit_and:s @0 INTEGER_CST@2) (bit_and:s @0 INTEGER_CST@1))
1220 (if (~wi::to_wide (@2) == wi::to_wide (@1))
1221 (minus (bit_xor @0 @1) @1)))
1223 /* Fold (A & B) - (A & ~B) into B - (A ^ B). */
1225 (minus (bit_and:cs @0 @1) (bit_and:cs @0 (bit_not @1)))
1226 (minus @1 (bit_xor @0 @1)))
1228 /* Simplify (X & ~Y) |^+ (~X & Y) -> X ^ Y. */
1229 (for op (bit_ior bit_xor plus)
1231 (op (bit_and:c @0 (bit_not @1)) (bit_and:c (bit_not @0) @1))
1234 (op:c (bit_and @0 INTEGER_CST@2) (bit_and (bit_not @0) INTEGER_CST@1))
1235 (if (~wi::to_wide (@2) == wi::to_wide (@1))
1238 /* PR53979: Transform ((a ^ b) | a) -> (a | b) */
1240 (bit_ior:c (bit_xor:c @0 @1) @0)
1243 /* (a & ~b) | (a ^ b) --> a ^ b */
1245 (bit_ior:c (bit_and:c @0 (bit_not @1)) (bit_xor:c@2 @0 @1))
1248 /* (a & ~b) ^ ~a --> ~(a & b) */
1250 (bit_xor:c (bit_and:cs @0 (bit_not @1)) (bit_not @0))
1251 (bit_not (bit_and @0 @1)))
1253 /* (~a & b) ^ a --> (a | b) */
1255 (bit_xor:c (bit_and:cs (bit_not @0) @1) @0)
1258 /* (a | b) & ~(a ^ b) --> a & b */
1260 (bit_and:c (bit_ior @0 @1) (bit_not (bit_xor:c @0 @1)))
1263 /* (a | b) & (a == b) --> a & b (boolean version of the above). */
1265 (bit_and:c (bit_ior @0 @1) (nop_convert? (eq:c @0 @1)))
1266 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1267 && TYPE_PRECISION (TREE_TYPE (@0)) == 1)
1270 /* a | ~(a ^ b) --> a | ~b */
1272 (bit_ior:c @0 (bit_not:s (bit_xor:c @0 @1)))
1273 (bit_ior @0 (bit_not @1)))
1275 /* a | (a == b) --> a | (b^1) (boolean version of the above). */
1277 (bit_ior:c @0 (nop_convert? (eq:c @0 @1)))
1278 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1279 && TYPE_PRECISION (TREE_TYPE (@0)) == 1)
1280 (bit_ior @0 (bit_xor @1 { build_one_cst (type); }))))
1282 /* (a | b) | (a &^ b) --> a | b */
1283 (for op (bit_and bit_xor)
1285 (bit_ior:c (bit_ior@2 @0 @1) (op:c @0 @1))
1288 /* (a & b) | ~(a ^ b) --> ~(a ^ b) */
1290 (bit_ior:c (bit_and:c @0 @1) (bit_not@2 (bit_xor @0 @1)))
1293 /* (a & b) | (a == b) --> a == b */
1295 (bit_ior:c (bit_and:c @0 @1) (nop_convert?@2 (eq @0 @1)))
1296 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1297 && TYPE_PRECISION (TREE_TYPE (@0)) == 1)
1300 /* ~(~a & b) --> a | ~b */
1302 (bit_not (bit_and:cs (bit_not @0) @1))
1303 (bit_ior @0 (bit_not @1)))
1305 /* ~(~a | b) --> a & ~b */
1307 (bit_not (bit_ior:cs (bit_not @0) @1))
1308 (bit_and @0 (bit_not @1)))
1310 /* (a ^ b) & ((b ^ c) ^ a) --> (a ^ b) & ~c */
1312 (bit_and:c (bit_xor:c@3 @0 @1) (bit_xor:cs (bit_xor:cs @1 @2) @0))
1313 (bit_and @3 (bit_not @2)))
1315 /* (a ^ b) | ((b ^ c) ^ a) --> (a ^ b) | c */
1317 (bit_ior:c (bit_xor:c@3 @0 @1) (bit_xor:c (bit_xor:c @1 @2) @0))
1320 /* (~X | C) ^ D -> (X | C) ^ (~D ^ C) if (~D ^ C) can be simplified. */
1322 (bit_xor:c (bit_ior:cs (bit_not:s @0) @1) @2)
1323 (bit_xor (bit_ior @0 @1) (bit_xor! (bit_not! @2) @1)))
1325 /* (~X & C) ^ D -> (X & C) ^ (D ^ C) if (D ^ C) can be simplified. */
1327 (bit_xor:c (bit_and:cs (bit_not:s @0) @1) @2)
1328 (bit_xor (bit_and @0 @1) (bit_xor! @2 @1)))
1330 /* Simplify (~X & Y) to X ^ Y if we know that (X & ~Y) is 0. */
1332 (bit_and (bit_not SSA_NAME@0) INTEGER_CST@1)
1333 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1334 && wi::bit_and_not (get_nonzero_bits (@0), wi::to_wide (@1)) == 0)
1337 /* For constants M and N, if M == (1LL << cst) - 1 && (N & M) == M,
1338 ((A & N) + B) & M -> (A + B) & M
1339 Similarly if (N & M) == 0,
1340 ((A | N) + B) & M -> (A + B) & M
1341 and for - instead of + (or unary - instead of +)
1342 and/or ^ instead of |.
1343 If B is constant and (B & M) == 0, fold into A & M. */
1344 (for op (plus minus)
1345 (for bitop (bit_and bit_ior bit_xor)
1347 (bit_and (op:s (bitop:s@0 @3 INTEGER_CST@4) @1) INTEGER_CST@2)
1350 tree utype = fold_bit_and_mask (TREE_TYPE (@0), @2, op, @0, bitop,
1351 @3, @4, @1, ERROR_MARK, NULL_TREE,
1354 (convert (bit_and (op (convert:utype { pmop[0]; })
1355 (convert:utype { pmop[1]; }))
1356 (convert:utype @2))))))
1358 (bit_and (op:s @0 (bitop:s@1 @3 INTEGER_CST@4)) INTEGER_CST@2)
1361 tree utype = fold_bit_and_mask (TREE_TYPE (@0), @2, op, @0, ERROR_MARK,
1362 NULL_TREE, NULL_TREE, @1, bitop, @3,
1365 (convert (bit_and (op (convert:utype { pmop[0]; })
1366 (convert:utype { pmop[1]; }))
1367 (convert:utype @2)))))))
1369 (bit_and (op:s @0 @1) INTEGER_CST@2)
1372 tree utype = fold_bit_and_mask (TREE_TYPE (@0), @2, op, @0, ERROR_MARK,
1373 NULL_TREE, NULL_TREE, @1, ERROR_MARK,
1374 NULL_TREE, NULL_TREE, pmop); }
1376 (convert (bit_and (op (convert:utype { pmop[0]; })
1377 (convert:utype { pmop[1]; }))
1378 (convert:utype @2)))))))
1379 (for bitop (bit_and bit_ior bit_xor)
1381 (bit_and (negate:s (bitop:s@0 @2 INTEGER_CST@3)) INTEGER_CST@1)
1384 tree utype = fold_bit_and_mask (TREE_TYPE (@0), @1, NEGATE_EXPR, @0,
1385 bitop, @2, @3, NULL_TREE, ERROR_MARK,
1386 NULL_TREE, NULL_TREE, pmop); }
1388 (convert (bit_and (negate (convert:utype { pmop[0]; }))
1389 (convert:utype @1)))))))
1391 /* X % Y is smaller than Y. */
1394 (cmp (trunc_mod @0 @1) @1)
1395 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
1396 { constant_boolean_node (cmp == LT_EXPR, type); })))
1399 (cmp @1 (trunc_mod @0 @1))
1400 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
1401 { constant_boolean_node (cmp == GT_EXPR, type); })))
1405 (bit_ior @0 integer_all_onesp@1)
1410 (bit_ior @0 integer_zerop)
1415 (bit_and @0 integer_zerop@1)
1420 (for op (bit_ior bit_xor)
1422 (op (convert? @0) (convert? @1))
1423 (with { bool wascmp; }
1424 (if (types_match (TREE_TYPE (@0), TREE_TYPE (@1))
1425 && bitwise_inverted_equal_p (@0, @1, wascmp))
1428 ? constant_boolean_node (true, type)
1429 : build_all_ones_cst (TREE_TYPE (@0)); })))))
1434 { build_zero_cst (type); })
1436 /* Canonicalize X ^ ~0 to ~X. */
1438 (bit_xor @0 integer_all_onesp@1)
1443 (bit_and @0 integer_all_onesp)
1446 /* x & x -> x, x | x -> x */
1447 (for bitop (bit_and bit_ior)
1452 /* x & C -> x if we know that x & ~C == 0. */
1455 (bit_and SSA_NAME@0 INTEGER_CST@1)
1456 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1457 && wi::bit_and_not (get_nonzero_bits (@0), wi::to_wide (@1)) == 0)
1461 /* ~(~X - Y) -> X + Y and ~(~X + Y) -> X - Y. */
1463 (bit_not (minus (bit_not @0) @1))
1466 (bit_not (plus:c (bit_not @0) @1))
1468 /* (~X - ~Y) -> Y - X. */
1470 (minus (bit_not @0) (bit_not @1))
1471 (if (!TYPE_OVERFLOW_SANITIZED (type))
1472 (with { tree utype = unsigned_type_for (type); }
1473 (convert (minus (convert:utype @1) (convert:utype @0))))))
1475 /* ~(X - Y) -> ~X + Y. */
1477 (bit_not (minus:s @0 @1))
1478 (plus (bit_not @0) @1))
1480 (bit_not (plus:s @0 INTEGER_CST@1))
1481 (if ((INTEGRAL_TYPE_P (type)
1482 && TYPE_UNSIGNED (type))
1483 || (!TYPE_OVERFLOW_SANITIZED (type)
1484 && may_negate_without_overflow_p (@1)))
1485 (plus (bit_not @0) { const_unop (NEGATE_EXPR, type, @1); })))
1488 /* ~X + Y -> (Y - X) - 1. */
1490 (plus:c (bit_not @0) @1)
1491 (if (ANY_INTEGRAL_TYPE_P (type)
1492 && TYPE_OVERFLOW_WRAPS (type)
1493 /* -1 - X is folded to ~X, so we'd recurse endlessly. */
1494 && !integer_all_onesp (@1))
1495 (plus (minus @1 @0) { build_minus_one_cst (type); })
1496 (if (INTEGRAL_TYPE_P (type)
1497 && TREE_CODE (@1) == INTEGER_CST
1498 && wi::to_wide (@1) != wi::min_value (TYPE_PRECISION (type),
1500 (minus (plus @1 { build_minus_one_cst (type); }) @0))))
1503 /* ~(X >> Y) -> ~X >> Y if ~X can be simplified. */
1505 (bit_not (rshift:s @0 @1))
1506 (if (!TYPE_UNSIGNED (TREE_TYPE (@0)))
1507 (rshift (bit_not! @0) @1)
1508 /* For logical right shifts, this is possible only if @0 doesn't
1509 have MSB set and the logical right shift is changed into
1510 arithmetic shift. */
1511 (if (INTEGRAL_TYPE_P (type)
1512 && !wi::neg_p (tree_nonzero_bits (@0)))
1513 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
1514 (convert (rshift (bit_not! (convert:stype @0)) @1))))))
1516 /* x + (x & 1) -> (x + 1) & ~1 */
1518 (plus:c @0 (bit_and:s @0 integer_onep@1))
1519 (bit_and (plus @0 @1) (bit_not @1)))
1521 /* x & ~(x & y) -> x & ~y */
1522 /* x | ~(x | y) -> x | ~y */
1523 (for bitop (bit_and bit_ior)
1525 (bitop:c @0 (bit_not (bitop:cs @0 @1)))
1526 (bitop @0 (bit_not @1))))
1528 /* (~x & y) | ~(x | y) -> ~x */
1530 (bit_ior:c (bit_and:c (bit_not@2 @0) @1) (bit_not (bit_ior:c @0 @1)))
1533 /* (x | y) ^ (x | ~y) -> ~x */
1535 (bit_xor:c (bit_ior:c @0 @1) (bit_ior:c @0 (bit_not @1)))
1538 /* (x & y) | ~(x | y) -> ~(x ^ y) */
1540 (bit_ior:c (bit_and:s @0 @1) (bit_not:s (bit_ior:s @0 @1)))
1541 (bit_not (bit_xor @0 @1)))
1543 /* (~x | y) ^ (x ^ y) -> x | ~y */
1545 (bit_xor:c (bit_ior:cs (bit_not @0) @1) (bit_xor:s @0 @1))
1546 (bit_ior @0 (bit_not @1)))
1548 /* (x ^ y) | ~(x | y) -> ~(x & y) */
1550 (bit_ior:c (bit_xor:s @0 @1) (bit_not:s (bit_ior:s @0 @1)))
1551 (bit_not (bit_and @0 @1)))
1553 /* (x | y) & ~x -> y & ~x */
1554 /* (x & y) | ~x -> y | ~x */
1555 (for bitop (bit_and bit_ior)
1556 rbitop (bit_ior bit_and)
1558 (bitop:c (rbitop:c @0 @1) (bit_not@2 @0))
1561 /* (x & y) ^ (x | y) -> x ^ y */
1563 (bit_xor:c (bit_and @0 @1) (bit_ior @0 @1))
1566 /* (x ^ y) ^ (x | y) -> x & y */
1568 (bit_xor:c (bit_xor @0 @1) (bit_ior @0 @1))
1571 /* (x & y) + (x ^ y) -> x | y */
1572 /* (x & y) | (x ^ y) -> x | y */
1573 /* (x & y) ^ (x ^ y) -> x | y */
1574 (for op (plus bit_ior bit_xor)
1576 (op:c (bit_and @0 @1) (bit_xor @0 @1))
1579 /* (x & y) + (x | y) -> x + y */
1581 (plus:c (bit_and @0 @1) (bit_ior @0 @1))
1584 /* (x + y) - (x | y) -> x & y */
1586 (minus (plus @0 @1) (bit_ior @0 @1))
1587 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
1588 && !TYPE_SATURATING (type))
1591 /* (x + y) - (x & y) -> x | y */
1593 (minus (plus @0 @1) (bit_and @0 @1))
1594 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
1595 && !TYPE_SATURATING (type))
1598 /* (x | y) - y -> (x & ~y) */
1600 (minus (bit_ior:cs @0 @1) @1)
1601 (bit_and @0 (bit_not @1)))
1603 /* (x | y) - (x ^ y) -> x & y */
1605 (minus (bit_ior @0 @1) (bit_xor @0 @1))
1608 /* (x | y) - (x & y) -> x ^ y */
1610 (minus (bit_ior @0 @1) (bit_and @0 @1))
1613 /* (x | y) & ~(x & y) -> x ^ y */
1615 (bit_and:c (bit_ior @0 @1) (bit_not (bit_and @0 @1)))
1618 /* (x | y) & (~x ^ y) -> x & y */
1620 (bit_and:c (bit_ior:c @0 @1) (bit_xor:c @1 (bit_not @0)))
1623 /* (~x | y) & (x | ~y) -> ~(x ^ y) */
1625 (bit_and (bit_ior:cs (bit_not @0) @1) (bit_ior:cs @0 (bit_not @1)))
1626 (bit_not (bit_xor @0 @1)))
1628 /* (~x | y) ^ (x | ~y) -> x ^ y */
1630 (bit_xor (bit_ior:c (bit_not @0) @1) (bit_ior:c @0 (bit_not @1)))
1633 /* ((x & y) - (x | y)) - 1 -> ~(x ^ y) */
1635 (plus (nop_convert1? (minus@2 (nop_convert2? (bit_and:c @0 @1))
1636 (nop_convert2? (bit_ior @0 @1))))
1638 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
1639 && !TYPE_SATURATING (type) && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2))
1640 && !TYPE_OVERFLOW_TRAPS (TREE_TYPE (@2))
1641 && !TYPE_SATURATING (TREE_TYPE (@2)))
1642 (bit_not (convert (bit_xor @0 @1)))))
1644 (minus (nop_convert1? (plus@2 (nop_convert2? (bit_and:c @0 @1))
1646 (nop_convert3? (bit_ior @0 @1)))
1647 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
1648 && !TYPE_SATURATING (type) && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2))
1649 && !TYPE_OVERFLOW_TRAPS (TREE_TYPE (@2))
1650 && !TYPE_SATURATING (TREE_TYPE (@2)))
1651 (bit_not (convert (bit_xor @0 @1)))))
1653 (minus (nop_convert1? (bit_and @0 @1))
1654 (nop_convert2? (plus@2 (nop_convert3? (bit_ior:c @0 @1))
1656 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
1657 && !TYPE_SATURATING (type) && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2))
1658 && !TYPE_OVERFLOW_TRAPS (TREE_TYPE (@2))
1659 && !TYPE_SATURATING (TREE_TYPE (@2)))
1660 (bit_not (convert (bit_xor @0 @1)))))
1662 /* ~x & ~y -> ~(x | y)
1663 ~x | ~y -> ~(x & y) */
1664 (for op (bit_and bit_ior)
1665 rop (bit_ior bit_and)
1667 (op (convert1? (bit_not @0)) (convert2? (bit_not @1)))
1668 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
1669 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
1670 (bit_not (rop (convert @0) (convert @1))))))
1672 /* If we are XORing or adding two BIT_AND_EXPR's, both of which are and'ing
1673 with a constant, and the two constants have no bits in common,
1674 we should treat this as a BIT_IOR_EXPR since this may produce more
1676 (for op (bit_xor plus)
1678 (op (convert1? (bit_and@4 @0 INTEGER_CST@1))
1679 (convert2? (bit_and@5 @2 INTEGER_CST@3)))
1680 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
1681 && tree_nop_conversion_p (type, TREE_TYPE (@2))
1682 && (wi::to_wide (@1) & wi::to_wide (@3)) == 0)
1683 (bit_ior (convert @4) (convert @5)))))
1685 /* (X | Y) ^ X -> Y & ~ X*/
1687 (bit_xor:c (convert1? (bit_ior:c @@0 @1)) (convert2? @0))
1688 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1689 (convert (bit_and @1 (bit_not @0)))))
1691 /* (~X | Y) ^ X -> ~(X & Y). */
1693 (bit_xor:c (nop_convert1? (bit_ior:c (nop_convert2? (bit_not @0)) @1)) @2)
1694 (if (bitwise_equal_p (@0, @2))
1695 (convert (bit_not (bit_and @0 (convert @1))))))
1697 /* Convert ~X ^ ~Y to X ^ Y. */
1699 (bit_xor (convert1? (bit_not @0)) (convert2? (bit_not @1)))
1700 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
1701 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
1702 (bit_xor (convert @0) (convert @1))))
1704 /* Convert ~X ^ C to X ^ ~C. */
1706 (bit_xor (convert? (bit_not @0)) INTEGER_CST@1)
1707 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1708 (bit_xor (convert @0) (bit_not @1))))
1710 /* Fold (X & Y) ^ Y and (X ^ Y) & Y as ~X & Y. */
1711 (for opo (bit_and bit_xor)
1712 opi (bit_xor bit_and)
1714 (opo:c (opi:cs @0 @1) @1)
1715 (bit_and (bit_not @0) @1)))
1717 /* Given a bit-wise operation CODE applied to ARG0 and ARG1, see if both
1718 operands are another bit-wise operation with a common input. If so,
1719 distribute the bit operations to save an operation and possibly two if
1720 constants are involved. For example, convert
1721 (A | B) & (A | C) into A | (B & C)
1722 Further simplification will occur if B and C are constants. */
1723 (for op (bit_and bit_ior bit_xor)
1724 rop (bit_ior bit_and bit_and)
1726 (op (convert? (rop:c @@0 @1)) (convert? (rop:c @0 @2)))
1727 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
1728 && tree_nop_conversion_p (type, TREE_TYPE (@2)))
1729 (rop (convert @0) (op (convert @1) (convert @2))))))
1731 /* Some simple reassociation for bit operations, also handled in reassoc. */
1732 /* (X & Y) & Y -> X & Y
1733 (X | Y) | Y -> X | Y */
1734 (for op (bit_and bit_ior)
1736 (op:c (convert1?@2 (op:c @0 @@1)) (convert2? @1))
1738 /* (X ^ Y) ^ Y -> X */
1740 (bit_xor:c (convert1? (bit_xor:c @0 @@1)) (convert2? @1))
1742 /* (X & Y) & (X & Z) -> (X & Y) & Z
1743 (X | Y) | (X | Z) -> (X | Y) | Z */
1744 (for op (bit_and bit_ior)
1746 (op (convert1?@3 (op:c@4 @0 @1)) (convert2?@5 (op:c@6 @0 @2)))
1747 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
1748 && tree_nop_conversion_p (type, TREE_TYPE (@2)))
1749 (if (single_use (@5) && single_use (@6))
1750 (op @3 (convert @2))
1751 (if (single_use (@3) && single_use (@4))
1752 (op (convert @1) @5))))))
1753 /* (X ^ Y) ^ (X ^ Z) -> Y ^ Z */
1755 (bit_xor (convert1? (bit_xor:c @0 @1)) (convert2? (bit_xor:c @0 @2)))
1756 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
1757 && tree_nop_conversion_p (type, TREE_TYPE (@2)))
1758 (bit_xor (convert @1) (convert @2))))
1760 /* Convert abs (abs (X)) into abs (X).
1761 also absu (absu (X)) into absu (X). */
1767 (absu (convert@2 (absu@1 @0)))
1768 (if (tree_nop_conversion_p (TREE_TYPE (@2), TREE_TYPE (@1)))
1771 /* Convert abs[u] (-X) -> abs[u] (X). */
1780 /* Convert abs[u] (X) where X is nonnegative -> (X). */
1782 (abs tree_expr_nonnegative_p@0)
1786 (absu tree_expr_nonnegative_p@0)
1789 /* Simplify (-(X < 0) | 1) * X into abs (X) or absu(X). */
1791 (mult:c (nop_convert1?
1792 (bit_ior (nop_convert2? (negate (convert? (lt @0 integer_zerop))))
1795 (if (INTEGRAL_TYPE_P (type)
1796 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
1797 && !TYPE_UNSIGNED (TREE_TYPE (@0)))
1798 (if (TYPE_UNSIGNED (type))
1805 /* A few cases of fold-const.cc negate_expr_p predicate. */
1806 (match negate_expr_p
1808 (if ((INTEGRAL_TYPE_P (type)
1809 && TYPE_UNSIGNED (type))
1810 || (!TYPE_OVERFLOW_SANITIZED (type)
1811 && may_negate_without_overflow_p (t)))))
1812 (match negate_expr_p
1814 (match negate_expr_p
1816 (if (!TYPE_OVERFLOW_SANITIZED (type))))
1817 (match negate_expr_p
1819 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (t)))))
1820 /* VECTOR_CST handling of non-wrapping types would recurse in unsupported
1822 (match negate_expr_p
1824 (if (FLOAT_TYPE_P (TREE_TYPE (type)) || TYPE_OVERFLOW_WRAPS (type))))
1825 (match negate_expr_p
1827 (if ((ANY_INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_WRAPS (type))
1828 || (FLOAT_TYPE_P (type)
1829 && !HONOR_SIGN_DEPENDENT_ROUNDING (type)
1830 && !HONOR_SIGNED_ZEROS (type)))))
1832 /* (-A) * (-B) -> A * B */
1834 (mult:c (convert1? (negate @0)) (convert2? negate_expr_p@1))
1835 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
1836 && tree_nop_conversion_p (type, TREE_TYPE (@1)))
1837 (mult (convert @0) (convert (negate @1)))))
1839 /* -(A + B) -> (-B) - A. */
1841 (negate (plus:c @0 negate_expr_p@1))
1842 (if (!HONOR_SIGN_DEPENDENT_ROUNDING (type)
1843 && !HONOR_SIGNED_ZEROS (type))
1844 (minus (negate @1) @0)))
1846 /* -(A - B) -> B - A. */
1848 (negate (minus @0 @1))
1849 (if ((ANY_INTEGRAL_TYPE_P (type) && !TYPE_OVERFLOW_SANITIZED (type))
1850 || (FLOAT_TYPE_P (type)
1851 && !HONOR_SIGN_DEPENDENT_ROUNDING (type)
1852 && !HONOR_SIGNED_ZEROS (type)))
1855 (negate (pointer_diff @0 @1))
1856 (if (TYPE_OVERFLOW_UNDEFINED (type))
1857 (pointer_diff @1 @0)))
1859 /* A - B -> A + (-B) if B is easily negatable. */
1861 (minus @0 negate_expr_p@1)
1862 (if (!FIXED_POINT_TYPE_P (type))
1863 (plus @0 (negate @1))))
1865 /* 1 - a is a ^ 1 if a had a bool range. */
1866 /* This is only enabled for gimple as sometimes
1867 cfun is not set for the function which contains
1868 the SSA_NAME (e.g. while IPA passes are happening,
1869 fold might be called). */
1871 (minus integer_onep@0 SSA_NAME@1)
1872 (if (INTEGRAL_TYPE_P (type)
1873 && ssa_name_has_boolean_range (@1))
1876 /* Other simplifications of negation (c.f. fold_negate_expr_1). */
1878 (negate (mult:c@0 @1 negate_expr_p@2))
1879 (if (! TYPE_UNSIGNED (type)
1880 && ! HONOR_SIGN_DEPENDENT_ROUNDING (type)
1882 (mult @1 (negate @2))))
1885 (negate (rdiv@0 @1 negate_expr_p@2))
1886 (if (! HONOR_SIGN_DEPENDENT_ROUNDING (type)
1888 (rdiv @1 (negate @2))))
1891 (negate (rdiv@0 negate_expr_p@1 @2))
1892 (if (! HONOR_SIGN_DEPENDENT_ROUNDING (type)
1894 (rdiv (negate @1) @2)))
1896 /* Fold -((int)x >> (prec - 1)) into (unsigned)x >> (prec - 1). */
1898 (negate (convert? (rshift @0 INTEGER_CST@1)))
1899 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
1900 && wi::to_wide (@1) == element_precision (type) - 1)
1901 (with { tree stype = TREE_TYPE (@0);
1902 tree ntype = TYPE_UNSIGNED (stype) ? signed_type_for (stype)
1903 : unsigned_type_for (stype); }
1904 (if (VECTOR_TYPE_P (type))
1905 (view_convert (rshift (view_convert:ntype @0) @1))
1906 (convert (rshift (convert:ntype @0) @1))))))
1908 /* Try to fold (type) X op CST -> (type) (X op ((type-x) CST))
1910 For bitwise binary operations apply operand conversions to the
1911 binary operation result instead of to the operands. This allows
1912 to combine successive conversions and bitwise binary operations.
1913 We combine the above two cases by using a conditional convert. */
1914 (for bitop (bit_and bit_ior bit_xor)
1916 (bitop (convert@2 @0) (convert?@3 @1))
1917 (if (((TREE_CODE (@1) == INTEGER_CST
1918 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
1919 && (int_fits_type_p (@1, TREE_TYPE (@0))
1920 || tree_nop_conversion_p (TREE_TYPE (@0), type)))
1921 || types_match (@0, @1))
1922 && !POINTER_TYPE_P (TREE_TYPE (@0))
1923 && !VECTOR_TYPE_P (TREE_TYPE (@0))
1924 && TREE_CODE (TREE_TYPE (@0)) != OFFSET_TYPE
1925 /* ??? This transform conflicts with fold-const.cc doing
1926 Convert (T)(x & c) into (T)x & (T)c, if c is an integer
1927 constants (if x has signed type, the sign bit cannot be set
1928 in c). This folds extension into the BIT_AND_EXPR.
1929 Restrict it to GIMPLE to avoid endless recursions. */
1930 && (bitop != BIT_AND_EXPR || GIMPLE)
1931 && (/* That's a good idea if the conversion widens the operand, thus
1932 after hoisting the conversion the operation will be narrower.
1933 It is also a good if the conversion is a nop as moves the
1934 conversion to one side; allowing for combining of the conversions. */
1935 TYPE_PRECISION (TREE_TYPE (@0)) < TYPE_PRECISION (type)
1936 /* The conversion check for being a nop can only be done at the gimple
1937 level as fold_binary has some re-association code which can conflict
1938 with this if there is a "constant" which is not a full INTEGER_CST. */
1939 || (GIMPLE && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (type))
1940 /* It's also a good idea if the conversion is to a non-integer
1942 || GET_MODE_CLASS (TYPE_MODE (type)) != MODE_INT
1943 /* Or if the precision of TO is not the same as the precision
1945 || !type_has_mode_precision_p (type)
1946 /* In GIMPLE, getting rid of 2 conversions for one new results
1949 && TREE_CODE (@1) != INTEGER_CST
1950 && tree_nop_conversion_p (type, TREE_TYPE (@0))
1952 && single_use (@3))))
1953 (convert (bitop @0 (convert @1)))))
1954 /* In GIMPLE, getting rid of 2 conversions for one new results
1957 (convert (bitop:cs@2 (nop_convert:s @0) @1))
1959 && TREE_CODE (@1) != INTEGER_CST
1960 && tree_nop_conversion_p (type, TREE_TYPE (@2))
1961 && types_match (type, @0)
1962 && !POINTER_TYPE_P (TREE_TYPE (@0))
1963 && TREE_CODE (TREE_TYPE (@0)) != OFFSET_TYPE)
1964 (bitop @0 (convert @1)))))
1966 (for bitop (bit_and bit_ior)
1967 rbitop (bit_ior bit_and)
1968 /* (x | y) & x -> x */
1969 /* (x & y) | x -> x */
1971 (bitop:c (rbitop:c @0 @1) @0)
1973 /* (~x | y) & x -> x & y */
1974 /* (~x & y) | x -> x | y */
1976 (bitop:c (rbitop:c @2 @1) @0)
1977 (with { bool wascmp; }
1978 (if (bitwise_inverted_equal_p (@0, @2, wascmp)
1979 && (!wascmp || element_precision (type) == 1))
1982 /* ((x | y) & z) | x -> (z & y) | x
1983 ((x ^ y) & z) | x -> (z & y) | x */
1984 (for op (bit_ior bit_xor)
1986 (bit_ior:c (nop_convert1?:s
1987 (bit_and:cs (nop_convert2?:s (op:cs @0 @1)) @2)) @3)
1988 (if (bitwise_equal_p (@0, @3))
1989 (convert (bit_ior (bit_and @1 (convert @2)) (convert @0))))))
1991 /* (x | CST1) & CST2 -> (x & CST2) | (CST1 & CST2) */
1993 (bit_and (bit_ior @0 CONSTANT_CLASS_P@1) CONSTANT_CLASS_P@2)
1994 (bit_ior (bit_and @0 @2) (bit_and! @1 @2)))
1996 /* Combine successive equal operations with constants. */
1997 (for bitop (bit_and bit_ior bit_xor)
1999 (bitop (bitop @0 CONSTANT_CLASS_P@1) CONSTANT_CLASS_P@2)
2000 (if (!CONSTANT_CLASS_P (@0))
2001 /* This is the canonical form regardless of whether (bitop @1 @2) can be
2002 folded to a constant. */
2003 (bitop @0 (bitop! @1 @2))
2004 /* In this case we have three constants and (bitop @0 @1) doesn't fold
2005 to a constant. This can happen if @0 or @1 is a POLY_INT_CST and if
2006 the values involved are such that the operation can't be decided at
2007 compile time. Try folding one of @0 or @1 with @2 to see whether
2008 that combination can be decided at compile time.
2010 Keep the existing form if both folds fail, to avoid endless
2012 (with { tree cst1 = const_binop (bitop, type, @0, @2); }
2014 (bitop @1 { cst1; })
2015 (with { tree cst2 = const_binop (bitop, type, @1, @2); }
2017 (bitop @0 { cst2; }))))))))
2019 /* Try simple folding for X op !X, and X op X with the help
2020 of the truth_valued_p and logical_inverted_value predicates. */
2021 (match truth_valued_p
2023 (if (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) == 1)))
2024 (for op (tcc_comparison truth_and truth_andif truth_or truth_orif truth_xor)
2025 (match truth_valued_p
2027 (match truth_valued_p
2030 (match (logical_inverted_value @0)
2032 (match (logical_inverted_value @0)
2033 (bit_not truth_valued_p@0))
2034 (match (logical_inverted_value @0)
2035 (eq @0 integer_zerop))
2036 (match (logical_inverted_value @0)
2037 (ne truth_valued_p@0 integer_truep))
2038 (match (logical_inverted_value @0)
2039 (bit_xor truth_valued_p@0 integer_truep))
2043 (bit_and:c @0 (logical_inverted_value @0))
2044 { build_zero_cst (type); })
2045 /* X | !X and X ^ !X -> 1, , if X is truth-valued. */
2046 (for op (bit_ior bit_xor)
2048 (op:c truth_valued_p@0 (logical_inverted_value @0))
2049 { constant_boolean_node (true, type); }))
2050 /* X ==/!= !X is false/true. */
2053 (op:c truth_valued_p@0 (logical_inverted_value @0))
2054 { constant_boolean_node (op == NE_EXPR ? true : false, type); }))
2058 (bit_not (bit_not @0))
2061 /* zero_one_valued_p will match when a value is known to be either
2062 0 or 1 including constants 0 or 1.
2063 Signed 1-bits includes -1 so they cannot match here. */
2064 (match zero_one_valued_p
2066 (if (INTEGRAL_TYPE_P (type)
2067 && (TYPE_UNSIGNED (type)
2068 || TYPE_PRECISION (type) > 1)
2069 && wi::leu_p (tree_nonzero_bits (@0), 1))))
2070 (match zero_one_valued_p
2072 (if (INTEGRAL_TYPE_P (type)
2073 && (TYPE_UNSIGNED (type)
2074 || TYPE_PRECISION (type) > 1))))
2076 /* Transform { 0 or 1 } * { 0 or 1 } into { 0 or 1 } & { 0 or 1 }. */
2078 (mult zero_one_valued_p@0 zero_one_valued_p@1)
2079 (if (INTEGRAL_TYPE_P (type))
2082 (for cmp (tcc_comparison)
2083 icmp (inverted_tcc_comparison)
2084 /* Fold (((a < b) & c) | ((a >= b) & d)) into (a < b ? c : d) & 1. */
2087 (bit_and:c (convert? (cmp@0 @01 @02)) @3)
2088 (bit_and:c (convert? (icmp@4 @01 @02)) @5))
2089 (if (INTEGRAL_TYPE_P (type)
2090 /* The scalar version has to be canonicalized after vectorization
2091 because it makes unconditional loads conditional ones, which
2092 means we lose vectorization because the loads may trap. */
2093 && canonicalize_math_after_vectorization_p ())
2094 (bit_and (cond @0 @3 @5) { build_one_cst (type); })))
2096 /* Fold ((-(a < b) & c) | (-(a >= b) & d)) into a < b ? c : d. This is
2097 canonicalized further and we recognize the conditional form:
2098 (a < b ? c : 0) | (a >= b ? d : 0) into a < b ? c : d. */
2101 (cond (cmp@0 @01 @02) @3 zerop)
2102 (cond (icmp@4 @01 @02) @5 zerop))
2103 (if (INTEGRAL_TYPE_P (type)
2104 /* The scalar version has to be canonicalized after vectorization
2105 because it makes unconditional loads conditional ones, which
2106 means we lose vectorization because the loads may trap. */
2107 && canonicalize_math_after_vectorization_p ())
2110 /* Vector Fold (((a < b) & c) | ((a >= b) & d)) into a < b ? c : d.
2111 and ((~(a < b) & c) | (~(a >= b) & d)) into a < b ? c : d. */
2114 (bit_and:c (vec_cond:s (cmp@0 @6 @7) @4 @5) @2)
2115 (bit_and:c (vec_cond:s (icmp@1 @6 @7) @4 @5) @3))
2116 (if (integer_zerop (@5))
2118 (if (integer_onep (@4))
2119 (bit_and (vec_cond @0 @2 @3) @4))
2120 (if (integer_minus_onep (@4))
2121 (vec_cond @0 @2 @3)))
2122 (if (integer_zerop (@4))
2124 (if (integer_onep (@5))
2125 (bit_and (vec_cond @0 @3 @2) @5))
2126 (if (integer_minus_onep (@5))
2127 (vec_cond @0 @3 @2))))))
2129 /* Scalar Vectorized Fold ((-(a < b) & c) | (-(a >= b) & d))
2130 into a < b ? d : c. */
2133 (vec_cond:s (cmp@0 @4 @5) @2 integer_zerop)
2134 (vec_cond:s (icmp@1 @4 @5) @3 integer_zerop))
2135 (vec_cond @0 @2 @3)))
2137 /* Transform X & -Y into X * Y when Y is { 0 or 1 }. */
2139 (bit_and:c (convert? (negate zero_one_valued_p@0)) @1)
2140 (if (INTEGRAL_TYPE_P (type)
2141 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
2142 && TREE_CODE (TREE_TYPE (@0)) != BOOLEAN_TYPE
2143 /* Sign extending of the neg or a truncation of the neg
2145 && (!TYPE_UNSIGNED (TREE_TYPE (@0))
2146 || TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))))
2147 (mult (convert @0) @1)))
2149 /* Narrow integer multiplication by a zero_one_valued_p operand.
2150 Multiplication by [0,1] is guaranteed not to overflow. */
2152 (convert (mult@0 zero_one_valued_p@1 INTEGER_CST@2))
2153 (if (INTEGRAL_TYPE_P (type)
2154 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
2155 && TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (@0)))
2156 (mult (convert @1) (convert @2))))
2158 /* (X << C) != 0 can be simplified to X, when C is zero_one_valued_p.
2159 Check that the shift is well-defined (C is less than TYPE_PRECISION)
2160 as some targets (such as x86's SSE) may return zero for larger C. */
2162 (ne (lshift zero_one_valued_p@0 INTEGER_CST@1) integer_zerop@2)
2163 (if (tree_fits_shwi_p (@1)
2164 && tree_to_shwi (@1) > 0
2165 && tree_to_shwi (@1) < TYPE_PRECISION (TREE_TYPE (@0)))
2168 /* (X << C) == 0 can be simplified to X == 0, when C is zero_one_valued_p.
2169 Check that the shift is well-defined (C is less than TYPE_PRECISION)
2170 as some targets (such as x86's SSE) may return zero for larger C. */
2172 (eq (lshift zero_one_valued_p@0 INTEGER_CST@1) integer_zerop@2)
2173 (if (tree_fits_shwi_p (@1)
2174 && tree_to_shwi (@1) > 0
2175 && tree_to_shwi (@1) < TYPE_PRECISION (TREE_TYPE (@0)))
2178 /* Convert ~ (-A) to A - 1. */
2180 (bit_not (convert? (negate @0)))
2181 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
2182 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
2183 (convert (minus @0 { build_each_one_cst (TREE_TYPE (@0)); }))))
2185 /* Convert - (~A) to A + 1. */
2187 (negate (nop_convert? (bit_not @0)))
2188 (plus (view_convert @0) { build_each_one_cst (type); }))
2190 /* (a & b) ^ (a == b) -> !(a | b) */
2191 /* (a & b) == (a ^ b) -> !(a | b) */
2192 (for first_op (bit_xor eq)
2193 second_op (eq bit_xor)
2195 (first_op:c (bit_and:c truth_valued_p@0 truth_valued_p@1) (second_op:c @0 @1))
2196 (bit_not (bit_ior @0 @1))))
2198 /* Convert ~ (A - 1) or ~ (A + -1) to -A. */
2200 (bit_not (convert? (minus @0 integer_each_onep)))
2201 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
2202 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
2203 (convert (negate @0))))
2205 (bit_not (convert? (plus @0 integer_all_onesp)))
2206 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
2207 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
2208 (convert (negate @0))))
2210 /* Part of convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */
2212 (bit_not (convert? (bit_xor @0 INTEGER_CST@1)))
2213 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2214 (convert (bit_xor @0 (bit_not @1)))))
2216 (bit_not (convert? (bit_xor:c (bit_not @0) @1)))
2217 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2218 (convert (bit_xor @0 @1))))
2220 /* Otherwise prefer ~(X ^ Y) to ~X ^ Y as more canonical. */
2222 (bit_xor:c (nop_convert?:s (bit_not:s @0)) @1)
2223 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2224 (bit_not (bit_xor (view_convert @0) @1))))
2226 /* ~(a ^ b) is a == b for truth valued a and b. */
2228 (bit_not (bit_xor:s truth_valued_p@0 truth_valued_p@1))
2229 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2230 && TYPE_PRECISION (TREE_TYPE (@0)) == 1)
2231 (convert (eq @0 @1))))
2233 /* (~a) == b is a ^ b for truth valued a and b. */
2235 (eq:c (bit_not:s truth_valued_p@0) truth_valued_p@1)
2236 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2237 && TYPE_PRECISION (TREE_TYPE (@0)) == 1)
2238 (convert (bit_xor @0 @1))))
2240 /* (x & ~m) | (y & m) -> ((x ^ y) & m) ^ x */
2242 (bit_ior:c (bit_and:cs @0 (bit_not @2)) (bit_and:cs @1 @2))
2243 (bit_xor (bit_and (bit_xor @0 @1) @2) @0))
2245 /* Fold A - (A & B) into ~B & A. */
2247 (minus (convert1? @0) (convert2?:s (bit_and:cs @@0 @1)))
2248 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
2249 && tree_nop_conversion_p (type, TREE_TYPE (@1)))
2250 (convert (bit_and (bit_not @1) @0))))
2252 /* (m1 CMP m2) * d -> (m1 CMP m2) ? d : 0 */
2253 (if (!canonicalize_math_p ())
2254 (for cmp (tcc_comparison)
2256 (mult:c (convert (cmp@0 @1 @2)) @3)
2257 (if (INTEGRAL_TYPE_P (type)
2258 && INTEGRAL_TYPE_P (TREE_TYPE (@0)))
2259 (cond @0 @3 { build_zero_cst (type); })))
2260 /* (-(m1 CMP m2)) & d -> (m1 CMP m2) ? d : 0 */
2262 (bit_and:c (negate (convert (cmp@0 @1 @2))) @3)
2263 (if (INTEGRAL_TYPE_P (type)
2264 && INTEGRAL_TYPE_P (TREE_TYPE (@0)))
2265 (cond @0 @3 { build_zero_cst (type); })))
2269 /* For integral types with undefined overflow and C != 0 fold
2270 x * C EQ/NE y * C into x EQ/NE y. */
2273 (cmp (mult:c @0 @1) (mult:c @2 @1))
2274 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2275 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2276 && tree_expr_nonzero_p (@1))
2279 /* For integral types with wrapping overflow and C odd fold
2280 x * C EQ/NE y * C into x EQ/NE y. */
2283 (cmp (mult @0 INTEGER_CST@1) (mult @2 @1))
2284 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2285 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))
2286 && (TREE_INT_CST_LOW (@1) & 1) != 0)
2289 /* For integral types with undefined overflow and C != 0 fold
2290 x * C RELOP y * C into:
2292 x RELOP y for nonnegative C
2293 y RELOP x for negative C */
2294 (for cmp (lt gt le ge)
2296 (cmp (mult:c @0 @1) (mult:c @2 @1))
2297 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2298 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
2299 (if (tree_expr_nonnegative_p (@1) && tree_expr_nonzero_p (@1))
2301 (if (TREE_CODE (@1) == INTEGER_CST
2302 && wi::neg_p (wi::to_wide (@1), TYPE_SIGN (TREE_TYPE (@1))))
2305 /* (X - 1U) <= INT_MAX-1U into (int) X > 0. */
2309 (cmp (plus @0 integer_minus_onep@1) INTEGER_CST@2)
2310 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2311 && TYPE_UNSIGNED (TREE_TYPE (@0))
2312 && TYPE_PRECISION (TREE_TYPE (@0)) > 1
2313 && (wi::to_wide (@2)
2314 == wi::max_value (TYPE_PRECISION (TREE_TYPE (@0)), SIGNED) - 1))
2315 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
2316 (icmp (convert:stype @0) { build_int_cst (stype, 0); })))))
2318 /* X / 4 < Y / 4 iff X < Y when the division is known to be exact. */
2319 (for cmp (simple_comparison)
2321 (cmp (convert?@3 (exact_div @0 INTEGER_CST@2)) (convert? (exact_div @1 @2)))
2322 (if (element_precision (@3) >= element_precision (@0)
2323 && types_match (@0, @1))
2324 (if (wi::lt_p (wi::to_wide (@2), 0, TYPE_SIGN (TREE_TYPE (@2))))
2325 (if (!TYPE_UNSIGNED (TREE_TYPE (@3)))
2327 (if (tree_expr_nonzero_p (@0) && tree_expr_nonzero_p (@1))
2330 tree utype = unsigned_type_for (TREE_TYPE (@0));
2332 (cmp (convert:utype @1) (convert:utype @0)))))
2333 (if (wi::gt_p (wi::to_wide (@2), 1, TYPE_SIGN (TREE_TYPE (@2))))
2334 (if (TYPE_UNSIGNED (TREE_TYPE (@0)) || !TYPE_UNSIGNED (TREE_TYPE (@3)))
2338 tree utype = unsigned_type_for (TREE_TYPE (@0));
2340 (cmp (convert:utype @0) (convert:utype @1)))))))))
2342 /* X / C1 op C2 into a simple range test. */
2343 (for cmp (simple_comparison)
2345 (cmp (trunc_div:s @0 INTEGER_CST@1) INTEGER_CST@2)
2346 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2347 && integer_nonzerop (@1)
2348 && !TREE_OVERFLOW (@1)
2349 && !TREE_OVERFLOW (@2))
2350 (with { tree lo, hi; bool neg_overflow;
2351 enum tree_code code = fold_div_compare (cmp, @1, @2, &lo, &hi,
2354 (if (code == LT_EXPR || code == GE_EXPR)
2355 (if (TREE_OVERFLOW (lo))
2356 { build_int_cst (type, (code == LT_EXPR) ^ neg_overflow); }
2357 (if (code == LT_EXPR)
2360 (if (code == LE_EXPR || code == GT_EXPR)
2361 (if (TREE_OVERFLOW (hi))
2362 { build_int_cst (type, (code == LE_EXPR) ^ neg_overflow); }
2363 (if (code == LE_EXPR)
2367 { build_int_cst (type, code == NE_EXPR); })
2368 (if (code == EQ_EXPR && !hi)
2370 (if (code == EQ_EXPR && !lo)
2372 (if (code == NE_EXPR && !hi)
2374 (if (code == NE_EXPR && !lo)
2377 { build_range_check (UNKNOWN_LOCATION, type, @0, code == EQ_EXPR,
2381 tree etype = range_check_type (TREE_TYPE (@0));
2384 hi = fold_convert (etype, hi);
2385 lo = fold_convert (etype, lo);
2386 hi = const_binop (MINUS_EXPR, etype, hi, lo);
2389 (if (etype && hi && !TREE_OVERFLOW (hi))
2390 (if (code == EQ_EXPR)
2391 (le (minus (convert:etype @0) { lo; }) { hi; })
2392 (gt (minus (convert:etype @0) { lo; }) { hi; })))))))))
2394 /* X + Z < Y + Z is the same as X < Y when there is no overflow. */
2395 (for op (lt le ge gt)
2397 (op (plus:c @0 @2) (plus:c @1 @2))
2398 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2399 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
2402 /* As a special case, X + C < Y + C is the same as (signed) X < (signed) Y
2403 when C is an unsigned integer constant with only the MSB set, and X and
2404 Y have types of equal or lower integer conversion rank than C's. */
2405 (for op (lt le ge gt)
2407 (op (plus @1 INTEGER_CST@0) (plus @2 @0))
2408 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2409 && TYPE_UNSIGNED (TREE_TYPE (@0))
2410 && wi::only_sign_bit_p (wi::to_wide (@0)))
2411 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
2412 (op (convert:stype @1) (convert:stype @2))))))
2414 /* For equality and subtraction, this is also true with wrapping overflow. */
2415 (for op (eq ne minus)
2417 (op (plus:c @0 @2) (plus:c @1 @2))
2418 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2419 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2420 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
2423 /* X - Z < Y - Z is the same as X < Y when there is no overflow. */
2424 (for op (lt le ge gt)
2426 (op (minus @0 @2) (minus @1 @2))
2427 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2428 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
2430 /* For equality and subtraction, this is also true with wrapping overflow. */
2431 (for op (eq ne minus)
2433 (op (minus @0 @2) (minus @1 @2))
2434 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2435 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2436 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
2438 /* And for pointers... */
2439 (for op (simple_comparison)
2441 (op (pointer_diff@3 @0 @2) (pointer_diff @1 @2))
2442 (if (!TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
2445 (minus (pointer_diff@3 @0 @2) (pointer_diff @1 @2))
2446 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@3))
2447 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
2448 (pointer_diff @0 @1)))
2450 /* Z - X < Z - Y is the same as Y < X when there is no overflow. */
2451 (for op (lt le ge gt)
2453 (op (minus @2 @0) (minus @2 @1))
2454 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2455 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
2457 /* For equality and subtraction, this is also true with wrapping overflow. */
2458 (for op (eq ne minus)
2460 (op (minus @2 @0) (minus @2 @1))
2461 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2462 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2463 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
2465 /* And for pointers... */
2466 (for op (simple_comparison)
2468 (op (pointer_diff@3 @2 @0) (pointer_diff @2 @1))
2469 (if (!TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
2472 (minus (pointer_diff@3 @2 @0) (pointer_diff @2 @1))
2473 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@3))
2474 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
2475 (pointer_diff @1 @0)))
2477 /* X + Y < Y is the same as X < 0 when there is no overflow. */
2478 (for op (lt le gt ge)
2480 (op:c (plus:c@2 @0 @1) @1)
2481 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2482 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2483 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0))
2484 && (CONSTANT_CLASS_P (@0) || single_use (@2)))
2485 (op @0 { build_zero_cst (TREE_TYPE (@0)); }))))
2486 /* For equality, this is also true with wrapping overflow. */
2489 (op:c (nop_convert?@3 (plus:c@2 @0 (convert1? @1))) (convert2? @1))
2490 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2491 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2492 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
2493 && (CONSTANT_CLASS_P (@0) || (single_use (@2) && single_use (@3)))
2494 && tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@2))
2495 && tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@1)))
2496 (op @0 { build_zero_cst (TREE_TYPE (@0)); })))
2498 (op:c (nop_convert?@3 (pointer_plus@2 (convert1? @0) @1)) (convert2? @0))
2499 (if (tree_nop_conversion_p (TREE_TYPE (@2), TREE_TYPE (@0))
2500 && tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0))
2501 && (CONSTANT_CLASS_P (@1) || (single_use (@2) && single_use (@3))))
2502 (op @1 { build_zero_cst (TREE_TYPE (@1)); }))))
2504 /* (&a + b) !=/== (&a[1] + c) -> (&a[0] - &a[1]) + b !=/== c */
2507 (neeq:c ADDR_EXPR@0 (pointer_plus @2 @3))
2508 (with { poly_int64 diff; tree inner_type = TREE_TYPE (@3);}
2509 (if (ptr_difference_const (@0, @2, &diff))
2510 (neeq { build_int_cst_type (inner_type, diff); } @3))))
2512 (neeq (pointer_plus ADDR_EXPR@0 @1) (pointer_plus ADDR_EXPR@2 @3))
2513 (with { poly_int64 diff; tree inner_type = TREE_TYPE (@1);}
2514 (if (ptr_difference_const (@0, @2, &diff))
2515 (neeq (plus { build_int_cst_type (inner_type, diff); } @1) @3)))))
2517 /* X - Y < X is the same as Y > 0 when there is no overflow.
2518 For equality, this is also true with wrapping overflow. */
2519 (for op (simple_comparison)
2521 (op:c @0 (minus@2 @0 @1))
2522 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2523 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2524 || ((op == EQ_EXPR || op == NE_EXPR)
2525 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
2526 && (CONSTANT_CLASS_P (@1) || single_use (@2)))
2527 (op @1 { build_zero_cst (TREE_TYPE (@1)); }))))
2530 (X / Y) == 0 -> X < Y if X, Y are unsigned.
2531 (X / Y) != 0 -> X >= Y, if X, Y are unsigned. */
2535 (cmp (trunc_div @0 @1) integer_zerop)
2536 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
2537 /* Complex ==/!= is allowed, but not </>=. */
2538 && TREE_CODE (TREE_TYPE (@0)) != COMPLEX_TYPE
2539 && (VECTOR_TYPE_P (type) || !VECTOR_TYPE_P (TREE_TYPE (@0))))
2542 /* X == C - X can never be true if C is odd. */
2545 (cmp:c (convert? @0) (convert1? (minus INTEGER_CST@1 (convert2? @0))))
2546 (if (TREE_INT_CST_LOW (@1) & 1)
2547 { constant_boolean_node (cmp == NE_EXPR, type); })))
2549 /* Arguments on which one can call get_nonzero_bits to get the bits
2551 (match with_possible_nonzero_bits
2553 (match with_possible_nonzero_bits
2555 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))))
2556 /* Slightly extended version, do not make it recursive to keep it cheap. */
2557 (match (with_possible_nonzero_bits2 @0)
2558 with_possible_nonzero_bits@0)
2559 (match (with_possible_nonzero_bits2 @0)
2560 (bit_and:c with_possible_nonzero_bits@0 @2))
2562 /* Same for bits that are known to be set, but we do not have
2563 an equivalent to get_nonzero_bits yet. */
2564 (match (with_certain_nonzero_bits2 @0)
2566 (match (with_certain_nonzero_bits2 @0)
2567 (bit_ior @1 INTEGER_CST@0))
2569 /* X == C (or X & Z == Y | C) is impossible if ~nonzero(X) & C != 0. */
2572 (cmp:c (with_possible_nonzero_bits2 @0) (with_certain_nonzero_bits2 @1))
2573 (if (wi::bit_and_not (wi::to_wide (@1), get_nonzero_bits (@0)) != 0)
2574 { constant_boolean_node (cmp == NE_EXPR, type); })))
2576 /* ((X inner_op C0) outer_op C1)
2577 With X being a tree where value_range has reasoned certain bits to always be
2578 zero throughout its computed value range,
2579 inner_op = {|,^}, outer_op = {|,^} and inner_op != outer_op
2580 where zero_mask has 1's for all bits that are sure to be 0 in
2582 if (inner_op == '^') C0 &= ~C1;
2583 if ((C0 & ~zero_mask) == 0) then emit (X outer_op (C0 outer_op C1)
2584 if ((C1 & ~zero_mask) == 0) then emit (X inner_op (C0 outer_op C1)
2586 (for inner_op (bit_ior bit_xor)
2587 outer_op (bit_xor bit_ior)
2590 (inner_op:s @2 INTEGER_CST@0) INTEGER_CST@1)
2594 wide_int zero_mask_not;
2598 if (TREE_CODE (@2) == SSA_NAME)
2599 zero_mask_not = get_nonzero_bits (@2);
2603 if (inner_op == BIT_XOR_EXPR)
2605 C0 = wi::bit_and_not (wi::to_wide (@0), wi::to_wide (@1));
2606 cst_emit = C0 | wi::to_wide (@1);
2610 C0 = wi::to_wide (@0);
2611 cst_emit = C0 ^ wi::to_wide (@1);
2614 (if (!fail && (C0 & zero_mask_not) == 0)
2615 (outer_op @2 { wide_int_to_tree (type, cst_emit); })
2616 (if (!fail && (wi::to_wide (@1) & zero_mask_not) == 0)
2617 (inner_op @2 { wide_int_to_tree (type, cst_emit); }))))))
2619 /* Associate (p +p off1) +p off2 as (p +p (off1 + off2)). */
2621 (pointer_plus (pointer_plus:s @0 @1) @3)
2622 (pointer_plus @0 (plus @1 @3)))
2625 (pointer_plus (convert:s (pointer_plus:s @0 @1)) @3)
2626 (convert:type (pointer_plus @0 (plus @1 @3))))
2633 tem4 = (unsigned long) tem3;
2638 (pointer_plus @0 (convert?@2 (minus@3 (convert @1) (convert @0))))
2639 /* Conditionally look through a sign-changing conversion. */
2640 (if (TYPE_PRECISION (TREE_TYPE (@2)) == TYPE_PRECISION (TREE_TYPE (@3))
2641 && ((GIMPLE && useless_type_conversion_p (type, TREE_TYPE (@1)))
2642 || (GENERIC && type == TREE_TYPE (@1))))
2645 (pointer_plus @0 (convert?@2 (pointer_diff@3 @1 @@0)))
2646 (if (TYPE_PRECISION (TREE_TYPE (@2)) >= TYPE_PRECISION (TREE_TYPE (@3)))
2650 tem = (sizetype) ptr;
2654 and produce the simpler and easier to analyze with respect to alignment
2655 ... = ptr & ~algn; */
2657 (pointer_plus @0 (negate (bit_and (convert @0) INTEGER_CST@1)))
2658 (with { tree algn = wide_int_to_tree (TREE_TYPE (@0), ~wi::to_wide (@1)); }
2659 (bit_and @0 { algn; })))
2661 /* Try folding difference of addresses. */
2663 (minus (convert ADDR_EXPR@0) (convert (pointer_plus @1 @2)))
2664 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2665 (with { poly_int64 diff; }
2666 (if (ptr_difference_const (@0, @1, &diff))
2667 (minus { build_int_cst_type (type, diff); } (convert @2))))))
2669 (minus (convert (pointer_plus @0 @2)) (convert ADDR_EXPR@1))
2670 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2671 (with { poly_int64 diff; }
2672 (if (ptr_difference_const (@0, @1, &diff))
2673 (plus (convert @2) { build_int_cst_type (type, diff); })))))
2675 (minus (convert ADDR_EXPR@0) (convert @1))
2676 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2677 (with { poly_int64 diff; }
2678 (if (ptr_difference_const (@0, @1, &diff))
2679 { build_int_cst_type (type, diff); }))))
2681 (minus (convert @0) (convert ADDR_EXPR@1))
2682 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2683 (with { poly_int64 diff; }
2684 (if (ptr_difference_const (@0, @1, &diff))
2685 { build_int_cst_type (type, diff); }))))
2687 (pointer_diff (convert?@2 ADDR_EXPR@0) (convert1?@3 @1))
2688 (if (tree_nop_conversion_p (TREE_TYPE(@2), TREE_TYPE (@0))
2689 && tree_nop_conversion_p (TREE_TYPE(@3), TREE_TYPE (@1)))
2690 (with { poly_int64 diff; }
2691 (if (ptr_difference_const (@0, @1, &diff))
2692 { build_int_cst_type (type, diff); }))))
2694 (pointer_diff (convert?@2 @0) (convert1?@3 ADDR_EXPR@1))
2695 (if (tree_nop_conversion_p (TREE_TYPE(@2), TREE_TYPE (@0))
2696 && tree_nop_conversion_p (TREE_TYPE(@3), TREE_TYPE (@1)))
2697 (with { poly_int64 diff; }
2698 (if (ptr_difference_const (@0, @1, &diff))
2699 { build_int_cst_type (type, diff); }))))
2701 /* (&a+b) - (&a[1] + c) -> sizeof(a[0]) + (b - c) */
2703 (pointer_diff (pointer_plus ADDR_EXPR@0 @1) (pointer_plus ADDR_EXPR@2 @3))
2704 (with { poly_int64 diff; }
2705 (if (ptr_difference_const (@0, @2, &diff))
2706 (plus { build_int_cst_type (type, diff); } (convert (minus @1 @3))))))
2707 /* (p + b) - &p->d -> offsetof (*p, d) + b */
2709 (pointer_diff (pointer_plus @0 @1) ADDR_EXPR@2)
2710 (with { poly_int64 diff; }
2711 (if (ptr_difference_const (@0, @2, &diff))
2712 (plus { build_int_cst_type (type, diff); } (convert @1)))))
2714 (pointer_diff ADDR_EXPR@0 (pointer_plus @1 @2))
2715 (with { poly_int64 diff; }
2716 (if (ptr_difference_const (@0, @1, &diff))
2717 (minus { build_int_cst_type (type, diff); } (convert @2)))))
2719 /* Canonicalize (T *)(ptr - ptr-cst) to &MEM[ptr + -ptr-cst]. */
2721 (convert (pointer_diff @0 INTEGER_CST@1))
2722 (if (POINTER_TYPE_P (type))
2723 { build_fold_addr_expr_with_type
2724 (build2 (MEM_REF, char_type_node, @0,
2725 wide_int_to_tree (ptr_type_node, wi::neg (wi::to_wide (@1)))),
2728 /* If arg0 is derived from the address of an object or function, we may
2729 be able to fold this expression using the object or function's
2732 (bit_and (convert? @0) INTEGER_CST@1)
2733 (if (POINTER_TYPE_P (TREE_TYPE (@0))
2734 && tree_nop_conversion_p (type, TREE_TYPE (@0)))
2738 unsigned HOST_WIDE_INT bitpos;
2739 get_pointer_alignment_1 (@0, &align, &bitpos);
2741 (if (wi::ltu_p (wi::to_wide (@1), align / BITS_PER_UNIT))
2742 { wide_int_to_tree (type, (wi::to_wide (@1)
2743 & (bitpos / BITS_PER_UNIT))); }))))
2747 (if ((INTEGRAL_TYPE_P (type)
2748 || POINTER_TYPE_P(type))
2749 && wi::eq_p (wi::to_wide (t), wi::min_value (type)))))
2753 (if ((INTEGRAL_TYPE_P (type)
2754 || POINTER_TYPE_P(type))
2755 && wi::eq_p (wi::to_wide (t), wi::max_value (type)))))
2757 /* x > y && x != XXX_MIN --> x > y
2758 x > y && x == XXX_MIN --> false . */
2761 (bit_and:c (gt:c@2 @0 @1) (eqne @0 min_value))
2763 (if (eqne == EQ_EXPR)
2764 { constant_boolean_node (false, type); })
2765 (if (eqne == NE_EXPR)
2769 /* x < y && x != XXX_MAX --> x < y
2770 x < y && x == XXX_MAX --> false. */
2773 (bit_and:c (lt:c@2 @0 @1) (eqne @0 max_value))
2775 (if (eqne == EQ_EXPR)
2776 { constant_boolean_node (false, type); })
2777 (if (eqne == NE_EXPR)
2781 /* x <= y && x == XXX_MIN --> x == XXX_MIN. */
2783 (bit_and:c (le:c @0 @1) (eq@2 @0 min_value))
2786 /* x >= y && x == XXX_MAX --> x == XXX_MAX. */
2788 (bit_and:c (ge:c @0 @1) (eq@2 @0 max_value))
2791 /* x > y || x != XXX_MIN --> x != XXX_MIN. */
2793 (bit_ior:c (gt:c @0 @1) (ne@2 @0 min_value))
2796 /* x <= y || x != XXX_MIN --> true. */
2798 (bit_ior:c (le:c @0 @1) (ne @0 min_value))
2799 { constant_boolean_node (true, type); })
2801 /* x <= y || x == XXX_MIN --> x <= y. */
2803 (bit_ior:c (le:c@2 @0 @1) (eq @0 min_value))
2806 /* x < y || x != XXX_MAX --> x != XXX_MAX. */
2808 (bit_ior:c (lt:c @0 @1) (ne@2 @0 max_value))
2811 /* x >= y || x != XXX_MAX --> true
2812 x >= y || x == XXX_MAX --> x >= y. */
2815 (bit_ior:c (ge:c@2 @0 @1) (eqne @0 max_value))
2817 (if (eqne == EQ_EXPR)
2819 (if (eqne == NE_EXPR)
2820 { constant_boolean_node (true, type); }))))
2822 /* y == XXX_MIN || x < y --> x <= y - 1 */
2824 (bit_ior:c (eq:s @1 min_value) (lt:cs @0 @1))
2825 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2826 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
2827 (le @0 (minus @1 { build_int_cst (TREE_TYPE (@1), 1); }))))
2829 /* y != XXX_MIN && x >= y --> x > y - 1 */
2831 (bit_and:c (ne:s @1 min_value) (ge:cs @0 @1))
2832 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2833 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
2834 (gt @0 (minus @1 { build_int_cst (TREE_TYPE (@1), 1); }))))
2836 /* Convert (X == CST1) && (X OP2 CST2) to a known value
2837 based on CST1 OP2 CST2. Similarly for (X != CST1). */
2838 /* Convert (X == Y) && (X OP2 Y) to a known value if X is an integral type.
2839 Similarly for (X != Y). */
2842 (for code2 (eq ne lt gt le ge)
2844 (bit_and:c (code1@3 @0 @1) (code2@4 @0 @2))
2845 (if ((TREE_CODE (@1) == INTEGER_CST
2846 && TREE_CODE (@2) == INTEGER_CST)
2847 || ((INTEGRAL_TYPE_P (TREE_TYPE (@1))
2848 || POINTER_TYPE_P (TREE_TYPE (@1)))
2849 && operand_equal_p (@1, @2)))
2853 if (TREE_CODE (@1) == INTEGER_CST
2854 && TREE_CODE (@2) == INTEGER_CST)
2855 cmp = tree_int_cst_compare (@1, @2);
2859 case EQ_EXPR: val = (cmp == 0); break;
2860 case NE_EXPR: val = (cmp != 0); break;
2861 case LT_EXPR: val = (cmp < 0); break;
2862 case GT_EXPR: val = (cmp > 0); break;
2863 case LE_EXPR: val = (cmp <= 0); break;
2864 case GE_EXPR: val = (cmp >= 0); break;
2865 default: gcc_unreachable ();
2869 (if (code1 == EQ_EXPR && val) @3)
2870 (if (code1 == EQ_EXPR && !val) { constant_boolean_node (false, type); })
2871 (if (code1 == NE_EXPR && !val) @4)
2872 (if (code1 == NE_EXPR
2876 (if (code1 == NE_EXPR
2887 /* Convert (X OP1 CST1) && (X OP2 CST2).
2888 Convert (X OP1 Y) && (X OP2 Y). */
2890 (for code1 (lt le gt ge)
2891 (for code2 (lt le gt ge)
2893 (bit_and (code1:c@3 @0 @1) (code2:c@4 @0 @2))
2894 (if ((TREE_CODE (@1) == INTEGER_CST
2895 && TREE_CODE (@2) == INTEGER_CST)
2896 || ((INTEGRAL_TYPE_P (TREE_TYPE (@1))
2897 || POINTER_TYPE_P (TREE_TYPE (@1)))
2898 && operand_equal_p (@1, @2)))
2902 if (TREE_CODE (@1) == INTEGER_CST
2903 && TREE_CODE (@2) == INTEGER_CST)
2904 cmp = tree_int_cst_compare (@1, @2);
2907 /* Choose the more restrictive of two < or <= comparisons. */
2908 (if ((code1 == LT_EXPR || code1 == LE_EXPR)
2909 && (code2 == LT_EXPR || code2 == LE_EXPR))
2910 (if ((cmp < 0) || (cmp == 0 && code1 == LT_EXPR))
2913 /* Likewise chose the more restrictive of two > or >= comparisons. */
2914 (if ((code1 == GT_EXPR || code1 == GE_EXPR)
2915 && (code2 == GT_EXPR || code2 == GE_EXPR))
2916 (if ((cmp > 0) || (cmp == 0 && code1 == GT_EXPR))
2919 /* Check for singleton ranges. */
2921 && ((code1 == LE_EXPR && code2 == GE_EXPR)
2922 || (code1 == GE_EXPR && code2 == LE_EXPR)))
2924 /* Check for disjoint ranges. */
2926 && (code1 == LT_EXPR || code1 == LE_EXPR)
2927 && (code2 == GT_EXPR || code2 == GE_EXPR))
2928 { constant_boolean_node (false, type); })
2930 && (code1 == GT_EXPR || code1 == GE_EXPR)
2931 && (code2 == LT_EXPR || code2 == LE_EXPR))
2932 { constant_boolean_node (false, type); })
2935 /* Convert (X == CST1) || (X OP2 CST2) to a known value
2936 based on CST1 OP2 CST2. Similarly for (X != CST1). */
2937 /* Convert (X == Y) || (X OP2 Y) to a known value if X is an integral type.
2938 Similarly for (X != Y). */
2941 (for code2 (eq ne lt gt le ge)
2943 (bit_ior:c (code1@3 @0 @1) (code2@4 @0 @2))
2944 (if ((TREE_CODE (@1) == INTEGER_CST
2945 && TREE_CODE (@2) == INTEGER_CST)
2946 || ((INTEGRAL_TYPE_P (TREE_TYPE (@1))
2947 || POINTER_TYPE_P (TREE_TYPE (@1)))
2948 && operand_equal_p (@1, @2)))
2952 if (TREE_CODE (@1) == INTEGER_CST
2953 && TREE_CODE (@2) == INTEGER_CST)
2954 cmp = tree_int_cst_compare (@1, @2);
2958 case EQ_EXPR: val = (cmp == 0); break;
2959 case NE_EXPR: val = (cmp != 0); break;
2960 case LT_EXPR: val = (cmp < 0); break;
2961 case GT_EXPR: val = (cmp > 0); break;
2962 case LE_EXPR: val = (cmp <= 0); break;
2963 case GE_EXPR: val = (cmp >= 0); break;
2964 default: gcc_unreachable ();
2968 (if (code1 == EQ_EXPR && val) @4)
2969 (if (code1 == NE_EXPR && val) { constant_boolean_node (true, type); })
2970 (if (code1 == NE_EXPR && !val) @3)
2971 (if (code1 == EQ_EXPR
2975 (if (code1 == EQ_EXPR
2986 /* Convert (X OP1 CST1) || (X OP2 CST2).
2987 Convert (X OP1 Y) || (X OP2 Y). */
2989 (for code1 (lt le gt ge)
2990 (for code2 (lt le gt ge)
2992 (bit_ior (code1@3 @0 @1) (code2@4 @0 @2))
2993 (if ((TREE_CODE (@1) == INTEGER_CST
2994 && TREE_CODE (@2) == INTEGER_CST)
2995 || ((INTEGRAL_TYPE_P (TREE_TYPE (@1))
2996 || POINTER_TYPE_P (TREE_TYPE (@1)))
2997 && operand_equal_p (@1, @2)))
3001 if (TREE_CODE (@1) == INTEGER_CST
3002 && TREE_CODE (@2) == INTEGER_CST)
3003 cmp = tree_int_cst_compare (@1, @2);
3006 /* Choose the more restrictive of two < or <= comparisons. */
3007 (if ((code1 == LT_EXPR || code1 == LE_EXPR)
3008 && (code2 == LT_EXPR || code2 == LE_EXPR))
3009 (if ((cmp < 0) || (cmp == 0 && code1 == LT_EXPR))
3012 /* Likewise chose the more restrictive of two > or >= comparisons. */
3013 (if ((code1 == GT_EXPR || code1 == GE_EXPR)
3014 && (code2 == GT_EXPR || code2 == GE_EXPR))
3015 (if ((cmp > 0) || (cmp == 0 && code1 == GT_EXPR))
3018 /* Check for singleton ranges. */
3020 && ((code1 == LT_EXPR && code2 == GT_EXPR)
3021 || (code1 == GT_EXPR && code2 == LT_EXPR)))
3023 /* Check for disjoint ranges. */
3025 && (code1 == LT_EXPR || code1 == LE_EXPR)
3026 && (code2 == GT_EXPR || code2 == GE_EXPR))
3027 { constant_boolean_node (true, type); })
3029 && (code1 == GT_EXPR || code1 == GE_EXPR)
3030 && (code2 == LT_EXPR || code2 == LE_EXPR))
3031 { constant_boolean_node (true, type); })
3034 /* We can't reassociate at all for saturating types. */
3035 (if (!TYPE_SATURATING (type))
3037 /* Contract negates. */
3038 /* A + (-B) -> A - B */
3040 (plus:c @0 (convert? (negate @1)))
3041 /* Apply STRIP_NOPS on the negate. */
3042 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
3043 && !TYPE_OVERFLOW_SANITIZED (type))
3047 if (INTEGRAL_TYPE_P (type)
3048 && TYPE_OVERFLOW_WRAPS (type) != TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
3049 t1 = TYPE_OVERFLOW_WRAPS (type) ? type : TREE_TYPE (@1);
3051 (convert (minus (convert:t1 @0) (convert:t1 @1))))))
3052 /* A - (-B) -> A + B */
3054 (minus @0 (convert? (negate @1)))
3055 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
3056 && !TYPE_OVERFLOW_SANITIZED (type))
3060 if (INTEGRAL_TYPE_P (type)
3061 && TYPE_OVERFLOW_WRAPS (type) != TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
3062 t1 = TYPE_OVERFLOW_WRAPS (type) ? type : TREE_TYPE (@1);
3064 (convert (plus (convert:t1 @0) (convert:t1 @1))))))
3066 Sign-extension is ok except for INT_MIN, which thankfully cannot
3067 happen without overflow. */
3069 (negate (convert (negate @1)))
3070 (if (INTEGRAL_TYPE_P (type)
3071 && (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@1))
3072 || (!TYPE_UNSIGNED (TREE_TYPE (@1))
3073 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))))
3074 && !TYPE_OVERFLOW_SANITIZED (type)
3075 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@1)))
3078 (negate (convert negate_expr_p@1))
3079 (if (SCALAR_FLOAT_TYPE_P (type)
3080 && ((DECIMAL_FLOAT_TYPE_P (type)
3081 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@1))
3082 && TYPE_PRECISION (type) >= TYPE_PRECISION (TREE_TYPE (@1)))
3083 || !HONOR_SIGN_DEPENDENT_ROUNDING (type)))
3084 (convert (negate @1))))
3086 (negate (nop_convert? (negate @1)))
3087 (if (!TYPE_OVERFLOW_SANITIZED (type)
3088 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@1)))
3091 /* We can't reassociate floating-point unless -fassociative-math
3092 or fixed-point plus or minus because of saturation to +-Inf. */
3093 (if ((!FLOAT_TYPE_P (type) || flag_associative_math)
3094 && !FIXED_POINT_TYPE_P (type))
3096 /* Match patterns that allow contracting a plus-minus pair
3097 irrespective of overflow issues. */
3098 /* (A +- B) - A -> +- B */
3099 /* (A +- B) -+ B -> A */
3100 /* A - (A +- B) -> -+ B */
3101 /* A +- (B -+ A) -> +- B */
3103 (minus (nop_convert1? (plus:c (nop_convert2? @0) @1)) @0)
3106 (minus (nop_convert1? (minus (nop_convert2? @0) @1)) @0)
3107 (if (!ANY_INTEGRAL_TYPE_P (type)
3108 || TYPE_OVERFLOW_WRAPS (type))
3109 (negate (view_convert @1))
3110 (view_convert (negate @1))))
3112 (plus:c (nop_convert1? (minus @0 (nop_convert2? @1))) @1)
3115 (minus @0 (nop_convert1? (plus:c (nop_convert2? @0) @1)))
3116 (if (!ANY_INTEGRAL_TYPE_P (type)
3117 || TYPE_OVERFLOW_WRAPS (type))
3118 (negate (view_convert @1))
3119 (view_convert (negate @1))))
3121 (minus @0 (nop_convert1? (minus (nop_convert2? @0) @1)))
3123 /* (A +- B) + (C - A) -> C +- B */
3124 /* (A + B) - (A - C) -> B + C */
3125 /* More cases are handled with comparisons. */
3127 (plus:c (plus:c @0 @1) (minus @2 @0))
3130 (plus:c (minus @0 @1) (minus @2 @0))
3133 (plus:c (pointer_diff @0 @1) (pointer_diff @2 @0))
3134 (if (TYPE_OVERFLOW_UNDEFINED (type)
3135 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0)))
3136 (pointer_diff @2 @1)))
3138 (minus (plus:c @0 @1) (minus @0 @2))
3141 /* (A +- CST1) +- CST2 -> A + CST3
3142 Use view_convert because it is safe for vectors and equivalent for
3144 (for outer_op (plus minus)
3145 (for inner_op (plus minus)
3146 neg_inner_op (minus plus)
3148 (outer_op (nop_convert? (inner_op @0 CONSTANT_CLASS_P@1))
3150 /* If one of the types wraps, use that one. */
3151 (if (!ANY_INTEGRAL_TYPE_P (type) || TYPE_OVERFLOW_WRAPS (type))
3152 /* If all 3 captures are CONSTANT_CLASS_P, punt, as we might recurse
3153 forever if something doesn't simplify into a constant. */
3154 (if (!CONSTANT_CLASS_P (@0))
3155 (if (outer_op == PLUS_EXPR)
3156 (plus (view_convert @0) (inner_op! @2 (view_convert @1)))
3157 (minus (view_convert @0) (neg_inner_op! @2 (view_convert @1)))))
3158 (if (!ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3159 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
3160 (if (outer_op == PLUS_EXPR)
3161 (view_convert (plus @0 (inner_op! (view_convert @2) @1)))
3162 (view_convert (minus @0 (neg_inner_op! (view_convert @2) @1))))
3163 /* If the constant operation overflows we cannot do the transform
3164 directly as we would introduce undefined overflow, for example
3165 with (a - 1) + INT_MIN. */
3166 (if (types_match (type, @0) && !TYPE_OVERFLOW_SANITIZED (type))
3167 (with { tree cst = const_binop (outer_op == inner_op
3168 ? PLUS_EXPR : MINUS_EXPR,
3171 (if (INTEGRAL_TYPE_P (type) && !TREE_OVERFLOW (cst))
3172 (inner_op @0 { cst; } )
3173 /* X+INT_MAX+1 is X-INT_MIN. */
3174 (if (INTEGRAL_TYPE_P (type)
3175 && wi::to_wide (cst) == wi::min_value (type))
3176 (neg_inner_op @0 { wide_int_to_tree (type, wi::to_wide (cst)); })
3177 /* Last resort, use some unsigned type. */
3178 (with { tree utype = unsigned_type_for (type); }
3180 (view_convert (inner_op
3181 (view_convert:utype @0)
3183 { TREE_OVERFLOW (cst)
3184 ? drop_tree_overflow (cst) : cst; })))))))))))))))
3186 /* (CST1 - A) +- CST2 -> CST3 - A */
3187 (for outer_op (plus minus)
3189 (outer_op (nop_convert? (minus CONSTANT_CLASS_P@1 @0)) CONSTANT_CLASS_P@2)
3190 /* If one of the types wraps, use that one. */
3191 (if (!ANY_INTEGRAL_TYPE_P (type) || TYPE_OVERFLOW_WRAPS (type))
3192 /* If all 3 captures are CONSTANT_CLASS_P, punt, as we might recurse
3193 forever if something doesn't simplify into a constant. */
3194 (if (!CONSTANT_CLASS_P (@0))
3195 (minus (outer_op! (view_convert @1) @2) (view_convert @0)))
3196 (if (!ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3197 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
3198 (view_convert (minus (outer_op! @1 (view_convert @2)) @0))
3199 (if (types_match (type, @0) && !TYPE_OVERFLOW_SANITIZED (type))
3200 (with { tree cst = const_binop (outer_op, type, @1, @2); }
3201 (if (cst && !TREE_OVERFLOW (cst))
3202 (minus { cst; } @0))))))))
3204 /* CST1 - (CST2 - A) -> CST3 + A
3205 Use view_convert because it is safe for vectors and equivalent for
3208 (minus CONSTANT_CLASS_P@1 (nop_convert? (minus CONSTANT_CLASS_P@2 @0)))
3209 /* If one of the types wraps, use that one. */
3210 (if (!ANY_INTEGRAL_TYPE_P (type) || TYPE_OVERFLOW_WRAPS (type))
3211 /* If all 3 captures are CONSTANT_CLASS_P, punt, as we might recurse
3212 forever if something doesn't simplify into a constant. */
3213 (if (!CONSTANT_CLASS_P (@0))
3214 (plus (view_convert @0) (minus! @1 (view_convert @2))))
3215 (if (!ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3216 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
3217 (view_convert (plus @0 (minus! (view_convert @1) @2)))
3218 (if (types_match (type, @0) && !TYPE_OVERFLOW_SANITIZED (type))
3219 (with { tree cst = const_binop (MINUS_EXPR, type, @1, @2); }
3220 (if (cst && !TREE_OVERFLOW (cst))
3221 (plus { cst; } @0)))))))
3223 /* ((T)(A)) + CST -> (T)(A + CST) */
3226 (plus (convert:s SSA_NAME@0) INTEGER_CST@1)
3227 (if (TREE_CODE (TREE_TYPE (@0)) == INTEGER_TYPE
3228 && TREE_CODE (type) == INTEGER_TYPE
3229 && TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (@0))
3230 && int_fits_type_p (@1, TREE_TYPE (@0)))
3231 /* Perform binary operation inside the cast if the constant fits
3232 and (A + CST)'s range does not overflow. */
3235 wi::overflow_type min_ovf = wi::OVF_OVERFLOW,
3236 max_ovf = wi::OVF_OVERFLOW;
3237 tree inner_type = TREE_TYPE (@0);
3240 = wide_int::from (wi::to_wide (@1), TYPE_PRECISION (inner_type),
3241 TYPE_SIGN (inner_type));
3244 if (get_global_range_query ()->range_of_expr (vr, @0)
3245 && !vr.varying_p () && !vr.undefined_p ())
3247 wide_int wmin0 = vr.lower_bound ();
3248 wide_int wmax0 = vr.upper_bound ();
3249 wi::add (wmin0, w1, TYPE_SIGN (inner_type), &min_ovf);
3250 wi::add (wmax0, w1, TYPE_SIGN (inner_type), &max_ovf);
3253 (if (min_ovf == wi::OVF_NONE && max_ovf == wi::OVF_NONE)
3254 (convert (plus @0 { wide_int_to_tree (TREE_TYPE (@0), w1); } )))
3258 /* ((T)(A + CST1)) + CST2 -> (T)(A) + (T)CST1 + CST2 */
3260 (for op (plus minus)
3262 (plus (convert:s (op:s @0 INTEGER_CST@1)) INTEGER_CST@2)
3263 (if (TREE_CODE (TREE_TYPE (@0)) == INTEGER_TYPE
3264 && TREE_CODE (type) == INTEGER_TYPE
3265 && TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (@0))
3266 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
3267 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0))
3268 && TYPE_OVERFLOW_WRAPS (type))
3269 (plus (convert @0) (op @2 (convert @1))))))
3272 /* (T)(A) +- (T)(B) -> (T)(A +- B) only when (A +- B) could be simplified
3273 to a simple value. */
3274 (for op (plus minus)
3276 (op (convert @0) (convert @1))
3277 (if (INTEGRAL_TYPE_P (type)
3278 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
3279 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))
3280 && types_match (TREE_TYPE (@0), TREE_TYPE (@1))
3281 && !TYPE_OVERFLOW_TRAPS (type)
3282 && !TYPE_OVERFLOW_SANITIZED (type))
3283 (convert (op! @0 @1)))))
3287 (plus:c (convert? (bit_not @0)) (convert? @0))
3288 (if (!TYPE_OVERFLOW_TRAPS (type))
3289 (convert { build_all_ones_cst (TREE_TYPE (@0)); })))
3293 (plus (convert? (bit_not @0)) integer_each_onep)
3294 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
3295 (negate (convert @0))))
3299 (minus (convert? (negate @0)) integer_each_onep)
3300 (if (!TYPE_OVERFLOW_TRAPS (type)
3301 && TREE_CODE (type) != COMPLEX_TYPE
3302 && tree_nop_conversion_p (type, TREE_TYPE (@0)))
3303 (bit_not (convert @0))))
3307 (minus integer_all_onesp @0)
3308 (if (TREE_CODE (type) != COMPLEX_TYPE)
3311 /* (T)(P + A) - (T)P -> (T) A */
3313 (minus (convert (plus:c @@0 @1))
3315 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
3316 /* For integer types, if A has a smaller type
3317 than T the result depends on the possible
3319 E.g. T=size_t, A=(unsigned)429497295, P>0.
3320 However, if an overflow in P + A would cause
3321 undefined behavior, we can assume that there
3323 || (INTEGRAL_TYPE_P (TREE_TYPE (@1))
3324 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))))
3327 (minus (convert (pointer_plus @@0 @1))
3329 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
3330 /* For pointer types, if the conversion of A to the
3331 final type requires a sign- or zero-extension,
3332 then we have to punt - it is not defined which
3334 || (POINTER_TYPE_P (TREE_TYPE (@0))
3335 && TREE_CODE (@1) == INTEGER_CST
3336 && tree_int_cst_sign_bit (@1) == 0))
3339 (pointer_diff (pointer_plus @@0 @1) @0)
3340 /* The second argument of pointer_plus must be interpreted as signed, and
3341 thus sign-extended if necessary. */
3342 (with { tree stype = signed_type_for (TREE_TYPE (@1)); }
3343 /* Use view_convert instead of convert here, as POINTER_PLUS_EXPR
3344 second arg is unsigned even when we need to consider it as signed,
3345 we don't want to diagnose overflow here. */
3346 (convert (view_convert:stype @1))))
3348 /* (T)P - (T)(P + A) -> -(T) A */
3350 (minus (convert? @0)
3351 (convert (plus:c @@0 @1)))
3352 (if (INTEGRAL_TYPE_P (type)
3353 && TYPE_OVERFLOW_UNDEFINED (type)
3354 /* For integer literals, using an intermediate unsigned type to avoid
3355 an overflow at run time is counter-productive because it introduces
3356 spurious overflows at compile time, in the form of TREE_OVERFLOW on
3357 the result, which may be problematic in GENERIC for some front-ends:
3358 (T)P - (T)(P + 4) -> (T)(-(U)4) -> (T)(4294967292) -> -4(OVF)
3359 so we use the direct path for them. */
3360 && TREE_CODE (@1) != INTEGER_CST
3361 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
3362 (with { tree utype = unsigned_type_for (type); }
3363 (convert (negate (convert:utype @1))))
3364 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
3365 /* For integer types, if A has a smaller type
3366 than T the result depends on the possible
3368 E.g. T=size_t, A=(unsigned)429497295, P>0.
3369 However, if an overflow in P + A would cause
3370 undefined behavior, we can assume that there
3372 || (INTEGRAL_TYPE_P (TREE_TYPE (@1))
3373 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))))
3374 (negate (convert @1)))))
3377 (convert (pointer_plus @@0 @1)))
3378 (if (INTEGRAL_TYPE_P (type)
3379 && TYPE_OVERFLOW_UNDEFINED (type)
3380 /* See above the rationale for this condition. */
3381 && TREE_CODE (@1) != INTEGER_CST
3382 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
3383 (with { tree utype = unsigned_type_for (type); }
3384 (convert (negate (convert:utype @1))))
3385 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
3386 /* For pointer types, if the conversion of A to the
3387 final type requires a sign- or zero-extension,
3388 then we have to punt - it is not defined which
3390 || (POINTER_TYPE_P (TREE_TYPE (@0))
3391 && TREE_CODE (@1) == INTEGER_CST
3392 && tree_int_cst_sign_bit (@1) == 0))
3393 (negate (convert @1)))))
3395 (pointer_diff @0 (pointer_plus @@0 @1))
3396 /* The second argument of pointer_plus must be interpreted as signed, and
3397 thus sign-extended if necessary. */
3398 (with { tree stype = signed_type_for (TREE_TYPE (@1)); }
3399 /* Use view_convert instead of convert here, as POINTER_PLUS_EXPR
3400 second arg is unsigned even when we need to consider it as signed,
3401 we don't want to diagnose overflow here. */
3402 (negate (convert (view_convert:stype @1)))))
3404 /* (T)(P + A) - (T)(P + B) -> (T)A - (T)B */
3406 (minus (convert (plus:c @@0 @1))
3407 (convert (plus:c @0 @2)))
3408 (if (INTEGRAL_TYPE_P (type)
3409 && TYPE_OVERFLOW_UNDEFINED (type)
3410 && element_precision (type) <= element_precision (TREE_TYPE (@1))
3411 && element_precision (type) <= element_precision (TREE_TYPE (@2)))
3412 (with { tree utype = unsigned_type_for (type); }
3413 (convert (minus (convert:utype @1) (convert:utype @2))))
3414 (if (((element_precision (type) <= element_precision (TREE_TYPE (@1)))
3415 == (element_precision (type) <= element_precision (TREE_TYPE (@2))))
3416 && (element_precision (type) <= element_precision (TREE_TYPE (@1))
3417 /* For integer types, if A has a smaller type
3418 than T the result depends on the possible
3420 E.g. T=size_t, A=(unsigned)429497295, P>0.
3421 However, if an overflow in P + A would cause
3422 undefined behavior, we can assume that there
3424 || (INTEGRAL_TYPE_P (TREE_TYPE (@1))
3425 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
3426 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))
3427 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@2)))))
3428 (minus (convert @1) (convert @2)))))
3430 (minus (convert (pointer_plus @@0 @1))
3431 (convert (pointer_plus @0 @2)))
3432 (if (INTEGRAL_TYPE_P (type)
3433 && TYPE_OVERFLOW_UNDEFINED (type)
3434 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
3435 (with { tree utype = unsigned_type_for (type); }
3436 (convert (minus (convert:utype @1) (convert:utype @2))))
3437 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
3438 /* For pointer types, if the conversion of A to the
3439 final type requires a sign- or zero-extension,
3440 then we have to punt - it is not defined which
3442 || (POINTER_TYPE_P (TREE_TYPE (@0))
3443 && TREE_CODE (@1) == INTEGER_CST
3444 && tree_int_cst_sign_bit (@1) == 0
3445 && TREE_CODE (@2) == INTEGER_CST
3446 && tree_int_cst_sign_bit (@2) == 0))
3447 (minus (convert @1) (convert @2)))))
3449 (pointer_diff (pointer_plus @0 @2) (pointer_plus @1 @2))
3450 (pointer_diff @0 @1))
3452 (pointer_diff (pointer_plus @@0 @1) (pointer_plus @0 @2))
3453 /* The second argument of pointer_plus must be interpreted as signed, and
3454 thus sign-extended if necessary. */
3455 (with { tree stype = signed_type_for (TREE_TYPE (@1)); }
3456 /* Use view_convert instead of convert here, as POINTER_PLUS_EXPR
3457 second arg is unsigned even when we need to consider it as signed,
3458 we don't want to diagnose overflow here. */
3459 (minus (convert (view_convert:stype @1))
3460 (convert (view_convert:stype @2)))))))
3462 /* (A * C) +- (B * C) -> (A+-B) * C and (A * C) +- A -> A * (C+-1).
3463 Modeled after fold_plusminus_mult_expr. */
3464 (if (!TYPE_SATURATING (type)
3465 && (!FLOAT_TYPE_P (type) || flag_associative_math))
3466 (for plusminus (plus minus)
3468 (plusminus (mult:cs@3 @0 @1) (mult:cs@4 @0 @2))
3469 (if (!ANY_INTEGRAL_TYPE_P (type)
3470 || TYPE_OVERFLOW_WRAPS (type)
3471 || (INTEGRAL_TYPE_P (type)
3472 && tree_expr_nonzero_p (@0)
3473 && expr_not_equal_to (@0, wi::minus_one (TYPE_PRECISION (type)))))
3474 (if (single_use (@3) || single_use (@4))
3475 /* If @1 +- @2 is constant require a hard single-use on either
3476 original operand (but not on both). */
3477 (mult (plusminus @1 @2) @0)
3478 (mult! (plusminus @1 @2) @0)
3480 /* We cannot generate constant 1 for fract. */
3481 (if (!ALL_FRACT_MODE_P (TYPE_MODE (type)))
3483 (plusminus @0 (mult:c@3 @0 @2))
3484 (if ((!ANY_INTEGRAL_TYPE_P (type)
3485 || TYPE_OVERFLOW_WRAPS (type)
3486 /* For @0 + @0*@2 this transformation would introduce UB
3487 (where there was none before) for @0 in [-1,0] and @2 max.
3488 For @0 - @0*@2 this transformation would introduce UB
3489 for @0 0 and @2 in [min,min+1] or @0 -1 and @2 min+1. */
3490 || (INTEGRAL_TYPE_P (type)
3491 && ((tree_expr_nonzero_p (@0)
3492 && expr_not_equal_to (@0,
3493 wi::minus_one (TYPE_PRECISION (type))))
3494 || (plusminus == PLUS_EXPR
3495 ? expr_not_equal_to (@2,
3496 wi::max_value (TYPE_PRECISION (type), SIGNED))
3497 /* Let's ignore the @0 -1 and @2 min case. */
3498 : (expr_not_equal_to (@2,
3499 wi::min_value (TYPE_PRECISION (type), SIGNED))
3500 && expr_not_equal_to (@2,
3501 wi::min_value (TYPE_PRECISION (type), SIGNED)
3504 (mult (plusminus { build_one_cst (type); } @2) @0)))
3506 (plusminus (mult:c@3 @0 @2) @0)
3507 (if ((!ANY_INTEGRAL_TYPE_P (type)
3508 || TYPE_OVERFLOW_WRAPS (type)
3509 /* For @0*@2 + @0 this transformation would introduce UB
3510 (where there was none before) for @0 in [-1,0] and @2 max.
3511 For @0*@2 - @0 this transformation would introduce UB
3512 for @0 0 and @2 min. */
3513 || (INTEGRAL_TYPE_P (type)
3514 && ((tree_expr_nonzero_p (@0)
3515 && (plusminus == MINUS_EXPR
3516 || expr_not_equal_to (@0,
3517 wi::minus_one (TYPE_PRECISION (type)))))
3518 || expr_not_equal_to (@2,
3519 (plusminus == PLUS_EXPR
3520 ? wi::max_value (TYPE_PRECISION (type), SIGNED)
3521 : wi::min_value (TYPE_PRECISION (type), SIGNED))))))
3523 (mult (plusminus @2 { build_one_cst (type); }) @0))))))
3526 /* Canonicalize X + (X << C) into X * (1 + (1 << C)) and
3527 (X << C1) + (X << C2) into X * ((1 << C1) + (1 << C2)). */
3529 (plus:c @0 (lshift:s @0 INTEGER_CST@1))
3530 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3531 && tree_fits_uhwi_p (@1)
3532 && tree_to_uhwi (@1) < element_precision (type)
3533 && (INTEGRAL_TYPE_P (TREE_TYPE (@0))
3534 || optab_handler (smul_optab,
3535 TYPE_MODE (type)) != CODE_FOR_nothing))
3536 (with { tree t = type;
3537 if (!TYPE_OVERFLOW_WRAPS (t)) t = unsigned_type_for (t);
3538 wide_int w = wi::set_bit_in_zero (tree_to_uhwi (@1),
3539 element_precision (type));
3541 tree cst = wide_int_to_tree (VECTOR_TYPE_P (t) ? TREE_TYPE (t)
3543 cst = build_uniform_cst (t, cst); }
3544 (convert (mult (convert:t @0) { cst; })))))
3546 (plus (lshift:s @0 INTEGER_CST@1) (lshift:s @0 INTEGER_CST@2))
3547 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3548 && tree_fits_uhwi_p (@1)
3549 && tree_to_uhwi (@1) < element_precision (type)
3550 && tree_fits_uhwi_p (@2)
3551 && tree_to_uhwi (@2) < element_precision (type)
3552 && (INTEGRAL_TYPE_P (TREE_TYPE (@0))
3553 || optab_handler (smul_optab,
3554 TYPE_MODE (type)) != CODE_FOR_nothing))
3555 (with { tree t = type;
3556 if (!TYPE_OVERFLOW_WRAPS (t)) t = unsigned_type_for (t);
3557 unsigned int prec = element_precision (type);
3558 wide_int w = wi::set_bit_in_zero (tree_to_uhwi (@1), prec);
3559 w += wi::set_bit_in_zero (tree_to_uhwi (@2), prec);
3560 tree cst = wide_int_to_tree (VECTOR_TYPE_P (t) ? TREE_TYPE (t)
3562 cst = build_uniform_cst (t, cst); }
3563 (convert (mult (convert:t @0) { cst; })))))
3566 /* Canonicalize (X*C1)|(X*C2) and (X*C1)^(X*C2) to (C1+C2)*X when
3567 tree_nonzero_bits allows IOR and XOR to be treated like PLUS.
3568 Likewise, handle (X<<C3) and X as legitimate variants of X*C. */
3569 (for op (bit_ior bit_xor)
3571 (op (mult:s@0 @1 INTEGER_CST@2)
3572 (mult:s@3 @1 INTEGER_CST@4))
3573 (if (INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_WRAPS (type)
3574 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@3)) == 0)
3576 { wide_int_to_tree (type, wi::to_wide (@2) + wi::to_wide (@4)); })))
3578 (op:c (mult:s@0 @1 INTEGER_CST@2)
3579 (lshift:s@3 @1 INTEGER_CST@4))
3580 (if (INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_WRAPS (type)
3581 && tree_int_cst_sgn (@4) > 0
3582 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@3)) == 0)
3583 (with { wide_int wone = wi::one (TYPE_PRECISION (type));
3584 wide_int c = wi::add (wi::to_wide (@2),
3585 wi::lshift (wone, wi::to_wide (@4))); }
3586 (mult @1 { wide_int_to_tree (type, c); }))))
3588 (op:c (mult:s@0 @1 INTEGER_CST@2)
3590 (if (INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_WRAPS (type)
3591 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@1)) == 0)
3593 { wide_int_to_tree (type,
3594 wi::add (wi::to_wide (@2), 1)); })))
3596 (op (lshift:s@0 @1 INTEGER_CST@2)
3597 (lshift:s@3 @1 INTEGER_CST@4))
3598 (if (INTEGRAL_TYPE_P (type)
3599 && tree_int_cst_sgn (@2) > 0
3600 && tree_int_cst_sgn (@4) > 0
3601 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@3)) == 0)
3602 (with { tree t = type;
3603 if (!TYPE_OVERFLOW_WRAPS (t))
3604 t = unsigned_type_for (t);
3605 wide_int wone = wi::one (TYPE_PRECISION (t));
3606 wide_int c = wi::add (wi::lshift (wone, wi::to_wide (@2)),
3607 wi::lshift (wone, wi::to_wide (@4))); }
3608 (convert (mult:t (convert:t @1) { wide_int_to_tree (t,c); })))))
3610 (op:c (lshift:s@0 @1 INTEGER_CST@2)
3612 (if (INTEGRAL_TYPE_P (type)
3613 && tree_int_cst_sgn (@2) > 0
3614 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@1)) == 0)
3615 (with { tree t = type;
3616 if (!TYPE_OVERFLOW_WRAPS (t))
3617 t = unsigned_type_for (t);
3618 wide_int wone = wi::one (TYPE_PRECISION (t));
3619 wide_int c = wi::add (wi::lshift (wone, wi::to_wide (@2)), wone); }
3620 (convert (mult:t (convert:t @1) { wide_int_to_tree (t, c); }))))))
3622 /* Simplifications of MIN_EXPR, MAX_EXPR, fmin() and fmax(). */
3624 (for minmax (min max)
3628 /* max(max(x,y),x) -> max(x,y) */
3630 (minmax:c (minmax:c@2 @0 @1) @0)
3632 /* For fmin() and fmax(), skip folding when both are sNaN. */
3633 (for minmax (FMIN_ALL FMAX_ALL)
3636 (if (!tree_expr_maybe_signaling_nan_p (@0))
3638 /* min(max(x,y),y) -> y. */
3640 (min:c (max:c @0 @1) @1)
3642 /* max(min(x,y),y) -> y. */
3644 (max:c (min:c @0 @1) @1)
3646 /* max(a,-a) -> abs(a). */
3648 (max:c @0 (negate @0))
3649 (if (TREE_CODE (type) != COMPLEX_TYPE
3650 && (! ANY_INTEGRAL_TYPE_P (type)
3651 || TYPE_OVERFLOW_UNDEFINED (type)))
3653 /* min(a,-a) -> -abs(a). */
3655 (min:c @0 (negate @0))
3656 (if (TREE_CODE (type) != COMPLEX_TYPE
3657 && (! ANY_INTEGRAL_TYPE_P (type)
3658 || TYPE_OVERFLOW_UNDEFINED (type)))
3663 (if (INTEGRAL_TYPE_P (type)
3664 && TYPE_MIN_VALUE (type)
3665 && operand_equal_p (@1, TYPE_MIN_VALUE (type), OEP_ONLY_CONST))
3667 (if (INTEGRAL_TYPE_P (type)
3668 && TYPE_MAX_VALUE (type)
3669 && operand_equal_p (@1, TYPE_MAX_VALUE (type), OEP_ONLY_CONST))
3674 (if (INTEGRAL_TYPE_P (type)
3675 && TYPE_MAX_VALUE (type)
3676 && operand_equal_p (@1, TYPE_MAX_VALUE (type), OEP_ONLY_CONST))
3678 (if (INTEGRAL_TYPE_P (type)
3679 && TYPE_MIN_VALUE (type)
3680 && operand_equal_p (@1, TYPE_MIN_VALUE (type), OEP_ONLY_CONST))
3683 /* max (a, a + CST) -> a + CST where CST is positive. */
3684 /* max (a, a + CST) -> a where CST is negative. */
3686 (max:c @0 (plus@2 @0 INTEGER_CST@1))
3687 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
3688 (if (tree_int_cst_sgn (@1) > 0)
3692 /* min (a, a + CST) -> a where CST is positive. */
3693 /* min (a, a + CST) -> a + CST where CST is negative. */
3695 (min:c @0 (plus@2 @0 INTEGER_CST@1))
3696 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
3697 (if (tree_int_cst_sgn (@1) > 0)
3701 /* Simplify min (&var[off0], &var[off1]) etc. depending on whether
3702 the addresses are known to be less, equal or greater. */
3703 (for minmax (min max)
3706 (minmax (convert1?@2 addr@0) (convert2?@3 addr@1))
3709 poly_int64 off0, off1;
3711 int equal = address_compare (cmp, TREE_TYPE (@2), @0, @1, base0, base1,
3712 off0, off1, GENERIC);
3715 (if (minmax == MIN_EXPR)
3716 (if (known_le (off0, off1))
3718 (if (known_gt (off0, off1))
3720 (if (known_ge (off0, off1))
3722 (if (known_lt (off0, off1))
3725 /* (convert (minmax ((convert (x) c)))) -> minmax (x c) if x is promoted
3726 and the outer convert demotes the expression back to x's type. */
3727 (for minmax (min max)
3729 (convert (minmax@0 (convert @1) INTEGER_CST@2))
3730 (if (INTEGRAL_TYPE_P (type)
3731 && types_match (@1, type) && int_fits_type_p (@2, type)
3732 && TYPE_SIGN (TREE_TYPE (@0)) == TYPE_SIGN (type)
3733 && TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (type))
3734 (minmax @1 (convert @2)))))
3736 (for minmax (FMIN_ALL FMAX_ALL)
3737 /* If either argument is NaN and other one is not sNaN, return the other
3738 one. Avoid the transformation if we get (and honor) a signalling NaN. */
3740 (minmax:c @0 REAL_CST@1)
3741 (if (real_isnan (TREE_REAL_CST_PTR (@1))
3742 && (!HONOR_SNANS (@1) || !TREE_REAL_CST (@1).signalling)
3743 && !tree_expr_maybe_signaling_nan_p (@0))
3745 /* Convert fmin/fmax to MIN_EXPR/MAX_EXPR. C99 requires these
3746 functions to return the numeric arg if the other one is NaN.
3747 MIN and MAX don't honor that, so only transform if -ffinite-math-only
3748 is set. C99 doesn't require -0.0 to be handled, so we don't have to
3749 worry about it either. */
3750 (if (flag_finite_math_only)
3757 /* min (-A, -B) -> -max (A, B) */
3758 (for minmax (min max FMIN_ALL FMAX_ALL)
3759 maxmin (max min FMAX_ALL FMIN_ALL)
3761 (minmax (negate:s@2 @0) (negate:s@3 @1))
3762 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
3763 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3764 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))))
3765 (negate (maxmin @0 @1)))))
3766 /* MIN (~X, ~Y) -> ~MAX (X, Y)
3767 MAX (~X, ~Y) -> ~MIN (X, Y) */
3768 (for minmax (min max)
3771 (minmax (bit_not:s@2 @0) (bit_not:s@3 @1))
3772 (bit_not (maxmin @0 @1))))
3774 /* MIN (X, Y) == X -> X <= Y */
3775 (for minmax (min min max max)
3779 (cmp:c (minmax:c @0 @1) @0)
3780 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0)))
3782 /* MIN (X, 5) == 0 -> X == 0
3783 MIN (X, 5) == 7 -> false */
3786 (cmp (min @0 INTEGER_CST@1) INTEGER_CST@2)
3787 (if (wi::lt_p (wi::to_wide (@1), wi::to_wide (@2),
3788 TYPE_SIGN (TREE_TYPE (@0))))
3789 { constant_boolean_node (cmp == NE_EXPR, type); }
3790 (if (wi::gt_p (wi::to_wide (@1), wi::to_wide (@2),
3791 TYPE_SIGN (TREE_TYPE (@0))))
3795 (cmp (max @0 INTEGER_CST@1) INTEGER_CST@2)
3796 (if (wi::gt_p (wi::to_wide (@1), wi::to_wide (@2),
3797 TYPE_SIGN (TREE_TYPE (@0))))
3798 { constant_boolean_node (cmp == NE_EXPR, type); }
3799 (if (wi::lt_p (wi::to_wide (@1), wi::to_wide (@2),
3800 TYPE_SIGN (TREE_TYPE (@0))))
3802 /* MIN (X, C1) < C2 -> X < C2 || C1 < C2 */
3803 (for minmax (min min max max min min max max )
3804 cmp (lt le gt ge gt ge lt le )
3805 comb (bit_ior bit_ior bit_ior bit_ior bit_and bit_and bit_and bit_and)
3807 (cmp (minmax @0 INTEGER_CST@1) INTEGER_CST@2)
3808 (comb (cmp @0 @2) (cmp @1 @2))))
3810 /* X <= MAX(X, Y) -> true
3811 X > MAX(X, Y) -> false
3812 X >= MIN(X, Y) -> true
3813 X < MIN(X, Y) -> false */
3814 (for minmax (min min max max )
3817 (cmp @0 (minmax:c @0 @1))
3818 { constant_boolean_node (cmp == GE_EXPR || cmp == LE_EXPR, type); } ))
3820 /* Undo fancy ways of writing max/min or other ?: expressions, like
3821 a - ((a - b) & -(a < b)) and a - (a - b) * (a < b) into (a < b) ? b : a.
3822 People normally use ?: and that is what we actually try to optimize. */
3823 /* Transform A + (B-A)*cmp into cmp ? B : A. */
3825 (plus:c @0 (mult:c (minus @1 @0) zero_one_valued_p@2))
3826 (if (INTEGRAL_TYPE_P (type)
3827 && (GIMPLE || !TREE_SIDE_EFFECTS (@1)))
3828 (cond (convert:boolean_type_node @2) @1 @0)))
3829 /* Transform A - (A-B)*cmp into cmp ? B : A. */
3831 (minus @0 (mult:c (minus @0 @1) zero_one_valued_p@2))
3832 (if (INTEGRAL_TYPE_P (type)
3833 && (GIMPLE || !TREE_SIDE_EFFECTS (@1)))
3834 (cond (convert:boolean_type_node @2) @1 @0)))
3835 /* Transform A ^ (A^B)*cmp into cmp ? B : A. */
3837 (bit_xor:c @0 (mult:c (bit_xor:c @0 @1) zero_one_valued_p@2))
3838 (if (INTEGRAL_TYPE_P (type)
3839 && (GIMPLE || !TREE_SIDE_EFFECTS (@1)))
3840 (cond (convert:boolean_type_node @2) @1 @0)))
3842 /* (x <= 0 ? -x : 0) -> max(-x, 0). */
3844 (cond (le @0 integer_zerop@1) (negate@2 @0) integer_zerop@1)
3847 /* (zero_one == 0) ? y : z <op> y -> ((typeof(y))zero_one * z) <op> y */
3848 (for op (bit_xor bit_ior plus)
3850 (cond (eq zero_one_valued_p@0
3854 (if (INTEGRAL_TYPE_P (type)
3855 && TYPE_PRECISION (type) > 1
3856 && (INTEGRAL_TYPE_P (TREE_TYPE (@0))))
3857 (op (mult (convert:type @0) @2) @1))))
3859 /* (zero_one != 0) ? z <op> y : y -> ((typeof(y))zero_one * z) <op> y */
3860 (for op (bit_xor bit_ior plus)
3862 (cond (ne zero_one_valued_p@0
3866 (if (INTEGRAL_TYPE_P (type)
3867 && TYPE_PRECISION (type) > 1
3868 && (INTEGRAL_TYPE_P (TREE_TYPE (@0))))
3869 (op (mult (convert:type @0) @2) @1))))
3871 /* Simplifications of shift and rotates. */
3873 (for rotate (lrotate rrotate)
3875 (rotate integer_all_onesp@0 @1)
3878 /* Optimize -1 >> x for arithmetic right shifts. */
3880 (rshift integer_all_onesp@0 @1)
3881 (if (!TYPE_UNSIGNED (type))
3884 /* Optimize (x >> c) << c into x & (-1<<c). */
3886 (lshift (nop_convert? (rshift @0 INTEGER_CST@1)) @1)
3887 (if (wi::ltu_p (wi::to_wide (@1), element_precision (type)))
3888 /* It doesn't matter if the right shift is arithmetic or logical. */
3889 (bit_and (view_convert @0) (lshift { build_minus_one_cst (type); } @1))))
3892 (lshift (convert (convert@2 (rshift @0 INTEGER_CST@1))) @1)
3893 (if (wi::ltu_p (wi::to_wide (@1), element_precision (type))
3894 /* Allow intermediate conversion to integral type with whatever sign, as
3895 long as the low TYPE_PRECISION (type)
3896 - TYPE_PRECISION (TREE_TYPE (@2)) bits are preserved. */
3897 && INTEGRAL_TYPE_P (type)
3898 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
3899 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
3900 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (@0))
3901 && (TYPE_PRECISION (TREE_TYPE (@2)) >= TYPE_PRECISION (type)
3902 || wi::geu_p (wi::to_wide (@1),
3903 TYPE_PRECISION (type)
3904 - TYPE_PRECISION (TREE_TYPE (@2)))))
3905 (bit_and (convert @0) (lshift { build_minus_one_cst (type); } @1))))
3907 /* For (x << c) >> c, optimize into x & ((unsigned)-1 >> c) for
3908 unsigned x OR truncate into the precision(type) - c lowest bits
3909 of signed x (if they have mode precision or a precision of 1). */
3911 (rshift (nop_convert? (lshift @0 INTEGER_CST@1)) @@1)
3912 (if (wi::ltu_p (wi::to_wide (@1), element_precision (type)))
3913 (if (TYPE_UNSIGNED (type))
3914 (bit_and (convert @0) (rshift { build_minus_one_cst (type); } @1))
3915 (if (INTEGRAL_TYPE_P (type))
3917 int width = element_precision (type) - tree_to_uhwi (@1);
3918 tree stype = build_nonstandard_integer_type (width, 0);
3920 (if (width == 1 || type_has_mode_precision_p (stype))
3921 (convert (convert:stype @0))))))))
3923 /* Optimize x >> x into 0 */
3926 { build_zero_cst (type); })
3928 (for shiftrotate (lrotate rrotate lshift rshift)
3930 (shiftrotate @0 integer_zerop)
3933 (shiftrotate integer_zerop@0 @1)
3935 /* Prefer vector1 << scalar to vector1 << vector2
3936 if vector2 is uniform. */
3937 (for vec (VECTOR_CST CONSTRUCTOR)
3939 (shiftrotate @0 vec@1)
3940 (with { tree tem = uniform_vector_p (@1); }
3942 (shiftrotate @0 { tem; }))))))
3944 /* Simplify X << Y where Y's low width bits are 0 to X, as only valid
3945 Y is 0. Similarly for X >> Y. */
3947 (for shift (lshift rshift)
3949 (shift @0 SSA_NAME@1)
3950 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1)))
3952 int width = ceil_log2 (element_precision (TREE_TYPE (@0)));
3953 int prec = TYPE_PRECISION (TREE_TYPE (@1));
3955 (if ((get_nonzero_bits (@1) & wi::mask (width, false, prec)) == 0)
3959 /* Rewrite an LROTATE_EXPR by a constant into an
3960 RROTATE_EXPR by a new constant. */
3962 (lrotate @0 INTEGER_CST@1)
3963 (rrotate @0 { const_binop (MINUS_EXPR, TREE_TYPE (@1),
3964 build_int_cst (TREE_TYPE (@1),
3965 element_precision (type)), @1); }))
3967 /* Turn (a OP c1) OP c2 into a OP (c1+c2). */
3968 (for op (lrotate rrotate rshift lshift)
3970 (op (op @0 INTEGER_CST@1) INTEGER_CST@2)
3971 (with { unsigned int prec = element_precision (type); }
3972 (if (wi::ge_p (wi::to_wide (@1), 0, TYPE_SIGN (TREE_TYPE (@1)))
3973 && wi::lt_p (wi::to_wide (@1), prec, TYPE_SIGN (TREE_TYPE (@1)))
3974 && wi::ge_p (wi::to_wide (@2), 0, TYPE_SIGN (TREE_TYPE (@2)))
3975 && wi::lt_p (wi::to_wide (@2), prec, TYPE_SIGN (TREE_TYPE (@2))))
3976 (with { unsigned int low = (tree_to_uhwi (@1)
3977 + tree_to_uhwi (@2)); }
3978 /* Deal with a OP (c1 + c2) being undefined but (a OP c1) OP c2
3979 being well defined. */
3981 (if (op == LROTATE_EXPR || op == RROTATE_EXPR)
3982 (op @0 { build_int_cst (TREE_TYPE (@1), low % prec); })
3983 (if (TYPE_UNSIGNED (type) || op == LSHIFT_EXPR)
3984 { build_zero_cst (type); }
3985 (op @0 { build_int_cst (TREE_TYPE (@1), prec - 1); })))
3986 (op @0 { build_int_cst (TREE_TYPE (@1), low); })))))))
3989 /* Simplify (CST << x) & 1 to 0 if CST is even or to x == 0 if it is odd. */
3991 (bit_and (lshift INTEGER_CST@1 @0) integer_onep)
3992 (if ((wi::to_wide (@1) & 1) != 0)
3993 (convert (eq:boolean_type_node @0 { build_zero_cst (TREE_TYPE (@0)); }))
3994 { build_zero_cst (type); }))
3996 /* Simplify ((C << x) & D) != 0 where C and D are power of two constants,
3997 either to false if D is smaller (unsigned comparison) than C, or to
3998 x == log2 (D) - log2 (C). Similarly for right shifts. */
4002 (cmp (bit_and (lshift integer_pow2p@1 @0) integer_pow2p@2) integer_zerop)
4003 (with { int c1 = wi::clz (wi::to_wide (@1));
4004 int c2 = wi::clz (wi::to_wide (@2)); }
4006 { constant_boolean_node (cmp == NE_EXPR ? false : true, type); }
4007 (icmp @0 { build_int_cst (TREE_TYPE (@0), c1 - c2); }))))
4009 (cmp (bit_and (rshift integer_pow2p@1 @0) integer_pow2p@2) integer_zerop)
4010 (if (tree_int_cst_sgn (@1) > 0)
4011 (with { int c1 = wi::clz (wi::to_wide (@1));
4012 int c2 = wi::clz (wi::to_wide (@2)); }
4014 { constant_boolean_node (cmp == NE_EXPR ? false : true, type); }
4015 (icmp @0 { build_int_cst (TREE_TYPE (@0), c2 - c1); }))))))
4017 /* (CST1 << A) == CST2 -> A == ctz (CST2) - ctz (CST1)
4018 (CST1 << A) != CST2 -> A != ctz (CST2) - ctz (CST1)
4022 (cmp (lshift INTEGER_CST@0 @1) INTEGER_CST@2)
4023 (with { int cand = wi::ctz (wi::to_wide (@2)) - wi::ctz (wi::to_wide (@0)); }
4025 || (!integer_zerop (@2)
4026 && wi::lshift (wi::to_wide (@0), cand) != wi::to_wide (@2)))
4027 { constant_boolean_node (cmp == NE_EXPR, type); }
4028 (if (!integer_zerop (@2)
4029 && wi::lshift (wi::to_wide (@0), cand) == wi::to_wide (@2))
4030 (cmp @1 { build_int_cst (TREE_TYPE (@1), cand); }))))))
4032 /* Fold ((X << C1) & C2) cmp C3 into (X & (C2 >> C1)) cmp (C3 >> C1)
4033 ((X >> C1) & C2) cmp C3 into (X & (C2 << C1)) cmp (C3 << C1). */
4036 (cmp (bit_and:s (lshift:s @0 INTEGER_CST@1) INTEGER_CST@2) INTEGER_CST@3)
4037 (if (tree_fits_shwi_p (@1)
4038 && tree_to_shwi (@1) > 0
4039 && tree_to_shwi (@1) < TYPE_PRECISION (TREE_TYPE (@0)))
4040 (if (tree_to_shwi (@1) > wi::ctz (wi::to_wide (@3)))
4041 { constant_boolean_node (cmp == NE_EXPR, type); }
4042 (with { wide_int c1 = wi::to_wide (@1);
4043 wide_int c2 = wi::lrshift (wi::to_wide (@2), c1);
4044 wide_int c3 = wi::lrshift (wi::to_wide (@3), c1); }
4045 (cmp (bit_and @0 { wide_int_to_tree (TREE_TYPE (@0), c2); })
4046 { wide_int_to_tree (TREE_TYPE (@0), c3); })))))
4048 (cmp (bit_and:s (rshift:s @0 INTEGER_CST@1) INTEGER_CST@2) INTEGER_CST@3)
4049 (if (tree_fits_shwi_p (@1)
4050 && tree_to_shwi (@1) > 0
4051 && tree_to_shwi (@1) < TYPE_PRECISION (TREE_TYPE (@0)))
4052 (with { tree t0 = TREE_TYPE (@0);
4053 unsigned int prec = TYPE_PRECISION (t0);
4054 wide_int c1 = wi::to_wide (@1);
4055 wide_int c2 = wi::to_wide (@2);
4056 wide_int c3 = wi::to_wide (@3);
4057 wide_int sb = wi::set_bit_in_zero (prec - 1, prec); }
4058 (if ((c2 & c3) != c3)
4059 { constant_boolean_node (cmp == NE_EXPR, type); }
4060 (if (TYPE_UNSIGNED (t0))
4061 (if ((c3 & wi::arshift (sb, c1 - 1)) != 0)
4062 { constant_boolean_node (cmp == NE_EXPR, type); }
4063 (cmp (bit_and @0 { wide_int_to_tree (t0, c2 << c1); })
4064 { wide_int_to_tree (t0, c3 << c1); }))
4065 (with { wide_int smask = wi::arshift (sb, c1); }
4067 (if ((c2 & smask) == 0)
4068 (cmp (bit_and @0 { wide_int_to_tree (t0, c2 << c1); })
4069 { wide_int_to_tree (t0, c3 << c1); }))
4070 (if ((c3 & smask) == 0)
4071 (cmp (bit_and @0 { wide_int_to_tree (t0, (c2 << c1) | sb); })
4072 { wide_int_to_tree (t0, c3 << c1); }))
4073 (if ((c2 & smask) != (c3 & smask))
4074 { constant_boolean_node (cmp == NE_EXPR, type); })
4075 (cmp (bit_and @0 { wide_int_to_tree (t0, (c2 << c1) | sb); })
4076 { wide_int_to_tree (t0, (c3 << c1) | sb); })))))))))
4078 /* Fold (X << C1) & C2 into (X << C1) & (C2 | ((1 << C1) - 1))
4079 (X >> C1) & C2 into (X >> C1) & (C2 | ~((type) -1 >> C1))
4080 if the new mask might be further optimized. */
4081 (for shift (lshift rshift)
4083 (bit_and (convert?:s@4 (shift:s@5 (convert1?@3 @0) INTEGER_CST@1))
4085 (if (tree_nop_conversion_p (TREE_TYPE (@4), TREE_TYPE (@5))
4086 && TYPE_PRECISION (type) <= HOST_BITS_PER_WIDE_INT
4087 && tree_fits_uhwi_p (@1)
4088 && tree_to_uhwi (@1) > 0
4089 && tree_to_uhwi (@1) < TYPE_PRECISION (type))
4092 unsigned int shiftc = tree_to_uhwi (@1);
4093 unsigned HOST_WIDE_INT mask = TREE_INT_CST_LOW (@2);
4094 unsigned HOST_WIDE_INT newmask, zerobits = 0;
4095 tree shift_type = TREE_TYPE (@3);
4098 if (shift == LSHIFT_EXPR)
4099 zerobits = ((HOST_WIDE_INT_1U << shiftc) - 1);
4100 else if (shift == RSHIFT_EXPR
4101 && type_has_mode_precision_p (shift_type))
4103 prec = TYPE_PRECISION (TREE_TYPE (@3));
4105 /* See if more bits can be proven as zero because of
4108 && TYPE_UNSIGNED (TREE_TYPE (@0)))
4110 tree inner_type = TREE_TYPE (@0);
4111 if (type_has_mode_precision_p (inner_type)
4112 && TYPE_PRECISION (inner_type) < prec)
4114 prec = TYPE_PRECISION (inner_type);
4115 /* See if we can shorten the right shift. */
4117 shift_type = inner_type;
4118 /* Otherwise X >> C1 is all zeros, so we'll optimize
4119 it into (X, 0) later on by making sure zerobits
4123 zerobits = HOST_WIDE_INT_M1U;
4126 zerobits >>= HOST_BITS_PER_WIDE_INT - shiftc;
4127 zerobits <<= prec - shiftc;
4129 /* For arithmetic shift if sign bit could be set, zerobits
4130 can contain actually sign bits, so no transformation is
4131 possible, unless MASK masks them all away. In that
4132 case the shift needs to be converted into logical shift. */
4133 if (!TYPE_UNSIGNED (TREE_TYPE (@3))
4134 && prec == TYPE_PRECISION (TREE_TYPE (@3)))
4136 if ((mask & zerobits) == 0)
4137 shift_type = unsigned_type_for (TREE_TYPE (@3));
4143 /* ((X << 16) & 0xff00) is (X, 0). */
4144 (if ((mask & zerobits) == mask)
4145 { build_int_cst (type, 0); }
4146 (with { newmask = mask | zerobits; }
4147 (if (newmask != mask && (newmask & (newmask + 1)) == 0)
4150 /* Only do the transformation if NEWMASK is some integer
4152 for (prec = BITS_PER_UNIT;
4153 prec < HOST_BITS_PER_WIDE_INT; prec <<= 1)
4154 if (newmask == (HOST_WIDE_INT_1U << prec) - 1)
4157 (if (prec < HOST_BITS_PER_WIDE_INT
4158 || newmask == HOST_WIDE_INT_M1U)
4160 { tree newmaskt = build_int_cst_type (TREE_TYPE (@2), newmask); }
4161 (if (!tree_int_cst_equal (newmaskt, @2))
4162 (if (shift_type != TREE_TYPE (@3))
4163 (bit_and (convert (shift:shift_type (convert @3) @1)) { newmaskt; })
4164 (bit_and @4 { newmaskt; })))))))))))))
4166 /* ((1 << n) & M) != 0 -> n == log2 (M) */
4172 (nop_convert? (lshift integer_onep @0)) integer_pow2p@1) integer_zerop)
4173 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)))
4174 (icmp @0 { wide_int_to_tree (TREE_TYPE (@0),
4175 wi::exact_log2 (wi::to_wide (@1))); }))))
4177 /* Fold (X {&,^,|} C2) << C1 into (X << C1) {&,^,|} (C2 << C1)
4178 (X {&,^,|} C2) >> C1 into (X >> C1) & (C2 >> C1). */
4179 (for shift (lshift rshift)
4180 (for bit_op (bit_and bit_xor bit_ior)
4182 (shift (convert?:s (bit_op:s @0 INTEGER_CST@2)) INTEGER_CST@1)
4183 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
4184 (with { tree mask = int_const_binop (shift, fold_convert (type, @2), @1); }
4186 (bit_op (shift (convert @0) @1) { mask; })))))))
4188 /* ~(~X >> Y) -> X >> Y (for arithmetic shift). */
4190 (bit_not (convert1?:s (rshift:s (convert2?@0 (bit_not @1)) @2)))
4191 (if (!TYPE_UNSIGNED (TREE_TYPE (@0))
4192 && (element_precision (TREE_TYPE (@0))
4193 <= element_precision (TREE_TYPE (@1))
4194 || !TYPE_UNSIGNED (TREE_TYPE (@1))))
4196 { tree shift_type = TREE_TYPE (@0); }
4197 (convert (rshift (convert:shift_type @1) @2)))))
4199 /* ~(~X >>r Y) -> X >>r Y
4200 ~(~X <<r Y) -> X <<r Y */
4201 (for rotate (lrotate rrotate)
4203 (bit_not (convert1?:s (rotate:s (convert2?@0 (bit_not @1)) @2)))
4204 (if ((element_precision (TREE_TYPE (@0))
4205 <= element_precision (TREE_TYPE (@1))
4206 || !TYPE_UNSIGNED (TREE_TYPE (@1)))
4207 && (element_precision (type) <= element_precision (TREE_TYPE (@0))
4208 || !TYPE_UNSIGNED (TREE_TYPE (@0))))
4210 { tree rotate_type = TREE_TYPE (@0); }
4211 (convert (rotate (convert:rotate_type @1) @2))))))
4214 (for rotate (lrotate rrotate)
4215 invrot (rrotate lrotate)
4216 /* (X >>r Y) cmp (Z >>r Y) may simplify to X cmp Y. */
4218 (cmp (rotate @1 @0) (rotate @2 @0))
4220 /* (X >>r C1) cmp C2 may simplify to X cmp C3. */
4222 (cmp (rotate @0 INTEGER_CST@1) INTEGER_CST@2)
4223 (cmp @0 { const_binop (invrot, TREE_TYPE (@0), @2, @1); }))
4224 /* (X >>r Y) cmp C where C is 0 or ~0, may simplify to X cmp C. */
4226 (cmp (rotate @0 @1) INTEGER_CST@2)
4227 (if (integer_zerop (@2) || integer_all_onesp (@2))
4230 /* Narrow a lshift by constant. */
4232 (convert (lshift:s@0 @1 INTEGER_CST@2))
4233 (if (INTEGRAL_TYPE_P (type)
4234 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
4235 && !integer_zerop (@2)
4236 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0)))
4237 (if (TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (@0))
4238 || wi::ltu_p (wi::to_wide (@2), TYPE_PRECISION (type)))
4239 (lshift (convert @1) @2)
4240 (if (wi::ltu_p (wi::to_wide (@2), TYPE_PRECISION (TREE_TYPE (@0))))
4241 { build_zero_cst (type); }))))
4243 /* Simplifications of conversions. */
4245 /* Basic strip-useless-type-conversions / strip_nops. */
4246 (for cvt (convert view_convert float fix_trunc)
4249 (if ((GIMPLE && useless_type_conversion_p (type, TREE_TYPE (@0)))
4250 || (GENERIC && type == TREE_TYPE (@0)))
4253 /* Contract view-conversions. */
4255 (view_convert (view_convert @0))
4258 /* For integral conversions with the same precision or pointer
4259 conversions use a NOP_EXPR instead. */
4262 (if ((INTEGRAL_TYPE_P (type) || POINTER_TYPE_P (type))
4263 && (INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))
4264 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (@0)))
4267 /* Strip inner integral conversions that do not change precision or size, or
4268 zero-extend while keeping the same size (for bool-to-char). */
4270 (view_convert (convert@0 @1))
4271 (if ((INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))
4272 && (INTEGRAL_TYPE_P (TREE_TYPE (@1)) || POINTER_TYPE_P (TREE_TYPE (@1)))
4273 && TYPE_SIZE (TREE_TYPE (@0)) == TYPE_SIZE (TREE_TYPE (@1))
4274 && (TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1))
4275 || (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (TREE_TYPE (@1))
4276 && TYPE_UNSIGNED (TREE_TYPE (@1)))))
4279 /* Simplify a view-converted empty or single-element constructor. */
4281 (view_convert CONSTRUCTOR@0)
4283 { tree ctor = (TREE_CODE (@0) == SSA_NAME
4284 ? gimple_assign_rhs1 (SSA_NAME_DEF_STMT (@0)) : @0); }
4286 (if (CONSTRUCTOR_NELTS (ctor) == 0)
4287 { build_zero_cst (type); })
4288 (if (CONSTRUCTOR_NELTS (ctor) == 1
4289 && VECTOR_TYPE_P (TREE_TYPE (ctor))
4290 && operand_equal_p (TYPE_SIZE (type),
4291 TYPE_SIZE (TREE_TYPE
4292 (CONSTRUCTOR_ELT (ctor, 0)->value))))
4293 (view_convert { CONSTRUCTOR_ELT (ctor, 0)->value; })))))
4295 /* Re-association barriers around constants and other re-association
4296 barriers can be removed. */
4298 (paren CONSTANT_CLASS_P@0)
4301 (paren (paren@1 @0))
4304 /* Handle cases of two conversions in a row. */
4305 (for ocvt (convert float fix_trunc)
4306 (for icvt (convert float)
4311 tree inside_type = TREE_TYPE (@0);
4312 tree inter_type = TREE_TYPE (@1);
4313 int inside_int = INTEGRAL_TYPE_P (inside_type);
4314 int inside_ptr = POINTER_TYPE_P (inside_type);
4315 int inside_float = FLOAT_TYPE_P (inside_type);
4316 int inside_vec = VECTOR_TYPE_P (inside_type);
4317 unsigned int inside_prec = element_precision (inside_type);
4318 int inside_unsignedp = TYPE_UNSIGNED (inside_type);
4319 int inter_int = INTEGRAL_TYPE_P (inter_type);
4320 int inter_ptr = POINTER_TYPE_P (inter_type);
4321 int inter_float = FLOAT_TYPE_P (inter_type);
4322 int inter_vec = VECTOR_TYPE_P (inter_type);
4323 unsigned int inter_prec = element_precision (inter_type);
4324 int inter_unsignedp = TYPE_UNSIGNED (inter_type);
4325 int final_int = INTEGRAL_TYPE_P (type);
4326 int final_ptr = POINTER_TYPE_P (type);
4327 int final_float = FLOAT_TYPE_P (type);
4328 int final_vec = VECTOR_TYPE_P (type);
4329 unsigned int final_prec = element_precision (type);
4330 int final_unsignedp = TYPE_UNSIGNED (type);
4333 /* In addition to the cases of two conversions in a row
4334 handled below, if we are converting something to its own
4335 type via an object of identical or wider precision, neither
4336 conversion is needed. */
4337 (if (((GIMPLE && useless_type_conversion_p (type, inside_type))
4339 && TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (inside_type)))
4340 && (((inter_int || inter_ptr) && final_int)
4341 || (inter_float && final_float))
4342 && inter_prec >= final_prec)
4345 /* Likewise, if the intermediate and initial types are either both
4346 float or both integer, we don't need the middle conversion if the
4347 former is wider than the latter and doesn't change the signedness
4348 (for integers). Avoid this if the final type is a pointer since
4349 then we sometimes need the middle conversion. */
4350 (if (((inter_int && inside_int) || (inter_float && inside_float))
4351 && (final_int || final_float)
4352 && inter_prec >= inside_prec
4353 && (inter_float || inter_unsignedp == inside_unsignedp))
4356 /* If we have a sign-extension of a zero-extended value, we can
4357 replace that by a single zero-extension. Likewise if the
4358 final conversion does not change precision we can drop the
4359 intermediate conversion. */
4360 (if (inside_int && inter_int && final_int
4361 && ((inside_prec < inter_prec && inter_prec < final_prec
4362 && inside_unsignedp && !inter_unsignedp)
4363 || final_prec == inter_prec))
4366 /* Two conversions in a row are not needed unless:
4367 - some conversion is floating-point (overstrict for now), or
4368 - some conversion is a vector (overstrict for now), or
4369 - the intermediate type is narrower than both initial and
4371 - the intermediate type and innermost type differ in signedness,
4372 and the outermost type is wider than the intermediate, or
4373 - the initial type is a pointer type and the precisions of the
4374 intermediate and final types differ, or
4375 - the final type is a pointer type and the precisions of the
4376 initial and intermediate types differ. */
4377 (if (! inside_float && ! inter_float && ! final_float
4378 && ! inside_vec && ! inter_vec && ! final_vec
4379 && (inter_prec >= inside_prec || inter_prec >= final_prec)
4380 && ! (inside_int && inter_int
4381 && inter_unsignedp != inside_unsignedp
4382 && inter_prec < final_prec)
4383 && ((inter_unsignedp && inter_prec > inside_prec)
4384 == (final_unsignedp && final_prec > inter_prec))
4385 && ! (inside_ptr && inter_prec != final_prec)
4386 && ! (final_ptr && inside_prec != inter_prec))
4389 /* `(outer:M)(inter:N) a:O`
4390 can be converted to `(outer:M) a`
4391 if M <= O && N >= O. No matter what signedness of the casts,
4392 as the final is either a truncation from the original or just
4393 a sign change of the type. */
4394 (if (inside_int && inter_int && final_int
4395 && final_prec <= inside_prec
4396 && inter_prec >= inside_prec)
4399 /* A truncation to an unsigned type (a zero-extension) should be
4400 canonicalized as bitwise and of a mask. */
4401 (if (GIMPLE /* PR70366: doing this in GENERIC breaks -Wconversion. */
4402 && final_int && inter_int && inside_int
4403 && final_prec == inside_prec
4404 && final_prec > inter_prec
4406 (convert (bit_and @0 { wide_int_to_tree
4408 wi::mask (inter_prec, false,
4409 TYPE_PRECISION (inside_type))); })))
4411 /* If we are converting an integer to a floating-point that can
4412 represent it exactly and back to an integer, we can skip the
4413 floating-point conversion. */
4414 (if (GIMPLE /* PR66211 */
4415 && inside_int && inter_float && final_int &&
4416 (unsigned) significand_size (TYPE_MODE (inter_type))
4417 >= inside_prec - !inside_unsignedp)
4420 /* (float_type)(integer_type) x -> trunc (x) if the type of x matches
4421 float_type. Only do the transformation if we do not need to preserve
4422 trapping behaviour, so require !flag_trapping_math. */
4425 (float (fix_trunc @0))
4426 (if (!flag_trapping_math
4427 && types_match (type, TREE_TYPE (@0))
4428 && direct_internal_fn_supported_p (IFN_TRUNC, type,
4433 /* If we have a narrowing conversion to an integral type that is fed by a
4434 BIT_AND_EXPR, we might be able to remove the BIT_AND_EXPR if it merely
4435 masks off bits outside the final type (and nothing else). */
4437 (convert (bit_and @0 INTEGER_CST@1))
4438 (if (INTEGRAL_TYPE_P (type)
4439 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
4440 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))
4441 && operand_equal_p (@1, build_low_bits_mask (TREE_TYPE (@1),
4442 TYPE_PRECISION (type)), 0))
4446 /* (X /[ex] A) * A -> X. */
4448 (mult (convert1? (exact_div @0 @@1)) (convert2? @1))
4451 /* Simplify (A / B) * B + (A % B) -> A. */
4452 (for div (trunc_div ceil_div floor_div round_div)
4453 mod (trunc_mod ceil_mod floor_mod round_mod)
4455 (plus:c (mult:c (div @0 @1) @1) (mod @0 @1))
4458 /* x / y * y == x -> x % y == 0. */
4460 (eq:c (mult:c (trunc_div:s @0 @1) @1) @0)
4461 (if (TREE_CODE (TREE_TYPE (@0)) != COMPLEX_TYPE)
4462 (eq (trunc_mod @0 @1) { build_zero_cst (TREE_TYPE (@0)); })))
4464 /* ((X /[ex] A) +- B) * A --> X +- A * B. */
4465 (for op (plus minus)
4467 (mult (convert1? (op (convert2? (exact_div @0 INTEGER_CST@@1)) INTEGER_CST@2)) @1)
4468 (if (tree_nop_conversion_p (type, TREE_TYPE (@2))
4469 && tree_nop_conversion_p (TREE_TYPE (@0), TREE_TYPE (@2)))
4472 wi::overflow_type overflow;
4473 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@2),
4474 TYPE_SIGN (type), &overflow);
4476 (if (types_match (type, TREE_TYPE (@2))
4477 && types_match (TREE_TYPE (@0), TREE_TYPE (@2)) && !overflow)
4478 (op @0 { wide_int_to_tree (type, mul); })
4479 (with { tree utype = unsigned_type_for (type); }
4480 (convert (op (convert:utype @0)
4481 (mult (convert:utype @1) (convert:utype @2))))))))))
4483 /* Canonicalization of binary operations. */
4485 /* Convert X + -C into X - C. */
4487 (plus @0 REAL_CST@1)
4488 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
4489 (with { tree tem = const_unop (NEGATE_EXPR, type, @1); }
4490 (if (!TREE_OVERFLOW (tem) || !flag_trapping_math)
4491 (minus @0 { tem; })))))
4493 /* Convert x+x into x*2. */
4496 (if (SCALAR_FLOAT_TYPE_P (type))
4497 (mult @0 { build_real (type, dconst2); })
4498 (if (INTEGRAL_TYPE_P (type))
4499 (mult @0 { build_int_cst (type, 2); }))))
4503 (minus integer_zerop @1)
4506 (pointer_diff integer_zerop @1)
4507 (negate (convert @1)))
4509 /* (ARG0 - ARG1) is the same as (-ARG1 + ARG0). So check whether
4510 ARG0 is zero and X + ARG0 reduces to X, since that would mean
4511 (-ARG1 + ARG0) reduces to -ARG1. */
4513 (minus real_zerop@0 @1)
4514 (if (fold_real_zero_addition_p (type, @1, @0, 0))
4517 /* Transform x * -1 into -x. */
4519 (mult @0 integer_minus_onep)
4522 /* Reassociate (X * CST) * Y to (X * Y) * CST. This does not introduce
4523 signed overflow for CST != 0 && CST != -1. */
4525 (mult:c (mult:s@3 @0 INTEGER_CST@1) @2)
4526 (if (TREE_CODE (@2) != INTEGER_CST
4528 && !integer_zerop (@1) && !integer_minus_onep (@1))
4529 (mult (mult @0 @2) @1)))
4531 /* True if we can easily extract the real and imaginary parts of a complex
4533 (match compositional_complex
4534 (convert? (complex @0 @1)))
4536 /* COMPLEX_EXPR and REALPART/IMAGPART_EXPR cancellations. */
4538 (complex (realpart @0) (imagpart @0))
4541 (realpart (complex @0 @1))
4544 (imagpart (complex @0 @1))
4547 /* Sometimes we only care about half of a complex expression. */
4549 (realpart (convert?:s (conj:s @0)))
4550 (convert (realpart @0)))
4552 (imagpart (convert?:s (conj:s @0)))
4553 (convert (negate (imagpart @0))))
4554 (for part (realpart imagpart)
4555 (for op (plus minus)
4557 (part (convert?:s@2 (op:s @0 @1)))
4558 (convert (op (part @0) (part @1))))))
4560 (realpart (convert?:s (CEXPI:s @0)))
4563 (imagpart (convert?:s (CEXPI:s @0)))
4566 /* conj(conj(x)) -> x */
4568 (conj (convert? (conj @0)))
4569 (if (tree_nop_conversion_p (TREE_TYPE (@0), type))
4572 /* conj({x,y}) -> {x,-y} */
4574 (conj (convert?:s (complex:s @0 @1)))
4575 (with { tree itype = TREE_TYPE (type); }
4576 (complex (convert:itype @0) (negate (convert:itype @1)))))
4578 /* BSWAP simplifications, transforms checked by gcc.dg/builtin-bswap-8.c. */
4584 (bswap (bit_not (bswap @0)))
4586 (for bitop (bit_xor bit_ior bit_and)
4588 (bswap (bitop:c (bswap @0) @1))
4589 (bitop @0 (bswap @1))))
4592 (cmp (bswap@2 @0) (bswap @1))
4593 (with { tree ctype = TREE_TYPE (@2); }
4594 (cmp (convert:ctype @0) (convert:ctype @1))))
4596 (cmp (bswap @0) INTEGER_CST@1)
4597 (with { tree ctype = TREE_TYPE (@1); }
4598 (cmp (convert:ctype @0) (bswap! @1)))))
4599 /* (bswap(x) >> C1) & C2 can sometimes be simplified to (x >> C3) & C2. */
4601 (bit_and (convert1? (rshift@0 (convert2? (bswap@4 @1)) INTEGER_CST@2))
4603 (if (BITS_PER_UNIT == 8
4604 && tree_fits_uhwi_p (@2)
4605 && tree_fits_uhwi_p (@3))
4608 unsigned HOST_WIDE_INT prec = TYPE_PRECISION (TREE_TYPE (@4));
4609 unsigned HOST_WIDE_INT bits = tree_to_uhwi (@2);
4610 unsigned HOST_WIDE_INT mask = tree_to_uhwi (@3);
4611 unsigned HOST_WIDE_INT lo = bits & 7;
4612 unsigned HOST_WIDE_INT hi = bits - lo;
4615 && mask < (256u>>lo)
4616 && bits < TYPE_PRECISION (TREE_TYPE(@0)))
4617 (with { unsigned HOST_WIDE_INT ns = (prec - (hi + 8)) + lo; }
4619 (bit_and (convert @1) @3)
4622 tree utype = unsigned_type_for (TREE_TYPE (@1));
4623 tree nst = build_int_cst (integer_type_node, ns);
4625 (bit_and (convert (rshift:utype (convert:utype @1) {nst;})) @3))))))))
4626 /* bswap(x) >> C1 can sometimes be simplified to (T)x >> C2. */
4628 (rshift (convert? (bswap@2 @0)) INTEGER_CST@1)
4629 (if (BITS_PER_UNIT == 8
4630 && CHAR_TYPE_SIZE == 8
4631 && tree_fits_uhwi_p (@1))
4634 unsigned HOST_WIDE_INT prec = TYPE_PRECISION (TREE_TYPE (@2));
4635 unsigned HOST_WIDE_INT bits = tree_to_uhwi (@1);
4636 /* If the bswap was extended before the original shift, this
4637 byte (shift) has the sign of the extension, not the sign of
4638 the original shift. */
4639 tree st = TYPE_PRECISION (type) > prec ? TREE_TYPE (@2) : type;
4641 /* Special case: logical right shift of sign-extended bswap.
4642 (unsigned)(short)bswap16(x)>>12 is (unsigned)((short)x<<8)>>12. */
4643 (if (TYPE_PRECISION (type) > prec
4644 && !TYPE_UNSIGNED (TREE_TYPE (@2))
4645 && TYPE_UNSIGNED (type)
4646 && bits < prec && bits + 8 >= prec)
4647 (with { tree nst = build_int_cst (integer_type_node, prec - 8); }
4648 (rshift (convert (lshift:st (convert:st @0) {nst;})) @1))
4649 (if (bits + 8 == prec)
4650 (if (TYPE_UNSIGNED (st))
4651 (convert (convert:unsigned_char_type_node @0))
4652 (convert (convert:signed_char_type_node @0)))
4653 (if (bits < prec && bits + 8 > prec)
4656 tree nst = build_int_cst (integer_type_node, bits & 7);
4657 tree bt = TYPE_UNSIGNED (st) ? unsigned_char_type_node
4658 : signed_char_type_node;
4660 (convert (rshift:bt (convert:bt @0) {nst;})))))))))
4661 /* bswap(x) & C1 can sometimes be simplified to (x >> C2) & C1. */
4663 (bit_and (convert? (bswap@2 @0)) INTEGER_CST@1)
4664 (if (BITS_PER_UNIT == 8
4665 && tree_fits_uhwi_p (@1)
4666 && tree_to_uhwi (@1) < 256)
4669 unsigned HOST_WIDE_INT prec = TYPE_PRECISION (TREE_TYPE (@2));
4670 tree utype = unsigned_type_for (TREE_TYPE (@0));
4671 tree nst = build_int_cst (integer_type_node, prec - 8);
4673 (bit_and (convert (rshift:utype (convert:utype @0) {nst;})) @1)))))
4676 /* Combine COND_EXPRs and VEC_COND_EXPRs. */
4678 /* Simplify constant conditions.
4679 Only optimize constant conditions when the selected branch
4680 has the same type as the COND_EXPR. This avoids optimizing
4681 away "c ? x : throw", where the throw has a void type.
4682 Note that we cannot throw away the fold-const.cc variant nor
4683 this one as we depend on doing this transform before possibly
4684 A ? B : B -> B triggers and the fold-const.cc one can optimize
4685 0 ? A : B to B even if A has side-effects. Something
4686 genmatch cannot handle. */
4688 (cond INTEGER_CST@0 @1 @2)
4689 (if (integer_zerop (@0))
4690 (if (!VOID_TYPE_P (TREE_TYPE (@2)) || VOID_TYPE_P (type))
4692 (if (!VOID_TYPE_P (TREE_TYPE (@1)) || VOID_TYPE_P (type))
4695 (vec_cond VECTOR_CST@0 @1 @2)
4696 (if (integer_all_onesp (@0))
4698 (if (integer_zerop (@0))
4701 /* Sink unary operations to branches, but only if we do fold both. */
4702 (for op (negate bit_not abs absu)
4704 (op (vec_cond:s @0 @1 @2))
4705 (vec_cond @0 (op! @1) (op! @2))))
4707 /* Sink binary operation to branches, but only if we can fold it. */
4708 (for op (tcc_comparison plus minus mult bit_and bit_ior bit_xor
4709 lshift rshift rdiv trunc_div ceil_div floor_div round_div
4710 trunc_mod ceil_mod floor_mod round_mod min max)
4711 /* (c ? a : b) op (c ? d : e) --> c ? (a op d) : (b op e) */
4713 (op (vec_cond:s @0 @1 @2) (vec_cond:s @0 @3 @4))
4714 (vec_cond @0 (op! @1 @3) (op! @2 @4)))
4716 /* (c ? a : b) op d --> c ? (a op d) : (b op d) */
4718 (op (vec_cond:s @0 @1 @2) @3)
4719 (vec_cond @0 (op! @1 @3) (op! @2 @3)))
4721 (op @3 (vec_cond:s @0 @1 @2))
4722 (vec_cond @0 (op! @3 @1) (op! @3 @2))))
4725 (match (nop_atomic_bit_test_and_p @0 @1 @4)
4726 (bit_and (convert?@4 (ATOMIC_FETCH_OR_XOR_N @2 INTEGER_CST@0 @3))
4729 int ibit = tree_log2 (@0);
4730 int ibit2 = tree_log2 (@1);
4734 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))))))
4736 (match (nop_atomic_bit_test_and_p @0 @1 @3)
4737 (bit_and (convert?@3 (SYNC_FETCH_OR_XOR_N @2 INTEGER_CST@0))
4740 int ibit = tree_log2 (@0);
4741 int ibit2 = tree_log2 (@1);
4745 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))))))
4747 (match (nop_atomic_bit_test_and_p @0 @0 @4)
4750 (ATOMIC_FETCH_OR_XOR_N @2 (nop_convert? (lshift@0 integer_onep@5 @6)) @3))
4752 (if (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0)))))
4754 (match (nop_atomic_bit_test_and_p @0 @0 @4)
4757 (SYNC_FETCH_OR_XOR_N @2 (nop_convert? (lshift@0 integer_onep@3 @5))))
4759 (if (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0)))))
4761 (match (nop_atomic_bit_test_and_p @0 @1 @3)
4762 (bit_and@4 (convert?@3 (ATOMIC_FETCH_AND_N @2 INTEGER_CST@0 @5))
4765 int ibit = wi::exact_log2 (wi::zext (wi::bit_not (wi::to_wide (@0)),
4766 TYPE_PRECISION(type)));
4767 int ibit2 = tree_log2 (@1);
4771 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))))))
4773 (match (nop_atomic_bit_test_and_p @0 @1 @3)
4775 (convert?@3 (SYNC_FETCH_AND_AND_N @2 INTEGER_CST@0))
4778 int ibit = wi::exact_log2 (wi::zext (wi::bit_not (wi::to_wide (@0)),
4779 TYPE_PRECISION(type)));
4780 int ibit2 = tree_log2 (@1);
4784 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))))))
4786 (match (nop_atomic_bit_test_and_p @4 @0 @3)
4789 (ATOMIC_FETCH_AND_N @2 (nop_convert?@4 (bit_not (lshift@0 integer_onep@6 @7))) @5))
4791 (if (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@4)))))
4793 (match (nop_atomic_bit_test_and_p @4 @0 @3)
4796 (SYNC_FETCH_AND_AND_N @2 (nop_convert?@4 (bit_not (lshift@0 integer_onep@6 @7)))))
4798 (if (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@4)))))
4802 /* (v ? w : 0) ? a : b is just (v & w) ? a : b
4803 Currently disabled after pass lvec because ARM understands
4804 VEC_COND_EXPR<v==w,-1,0> but not a plain v==w fed to BIT_IOR_EXPR. */
4806 (vec_cond (vec_cond:s @0 @3 integer_zerop) @1 @2)
4807 (if (optimize_vectors_before_lowering_p () && types_match (@0, @3))
4808 (vec_cond (bit_and @0 @3) @1 @2)))
4810 (vec_cond (vec_cond:s @0 integer_all_onesp @3) @1 @2)
4811 (if (optimize_vectors_before_lowering_p () && types_match (@0, @3))
4812 (vec_cond (bit_ior @0 @3) @1 @2)))
4814 (vec_cond (vec_cond:s @0 integer_zerop @3) @1 @2)
4815 (if (optimize_vectors_before_lowering_p () && types_match (@0, @3))
4816 (vec_cond (bit_ior @0 (bit_not @3)) @2 @1)))
4818 (vec_cond (vec_cond:s @0 @3 integer_all_onesp) @1 @2)
4819 (if (optimize_vectors_before_lowering_p () && types_match (@0, @3))
4820 (vec_cond (bit_and @0 (bit_not @3)) @2 @1)))
4822 /* c1 ? c2 ? a : b : b --> (c1 & c2) ? a : b */
4824 (vec_cond @0 (vec_cond:s @1 @2 @3) @3)
4825 (if (optimize_vectors_before_lowering_p () && types_match (@0, @1))
4826 (vec_cond (bit_and @0 @1) @2 @3)))
4828 (vec_cond @0 @2 (vec_cond:s @1 @2 @3))
4829 (if (optimize_vectors_before_lowering_p () && types_match (@0, @1))
4830 (vec_cond (bit_ior @0 @1) @2 @3)))
4832 (vec_cond @0 (vec_cond:s @1 @2 @3) @2)
4833 (if (optimize_vectors_before_lowering_p () && types_match (@0, @1))
4834 (vec_cond (bit_ior (bit_not @0) @1) @2 @3)))
4836 (vec_cond @0 @3 (vec_cond:s @1 @2 @3))
4837 (if (optimize_vectors_before_lowering_p () && types_match (@0, @1))
4838 (vec_cond (bit_and (bit_not @0) @1) @2 @3)))
4840 /* Canonicalize mask ? { 0, ... } : { -1, ...} to ~mask if the mask
4841 types are compatible. */
4843 (vec_cond @0 VECTOR_CST@1 VECTOR_CST@2)
4844 (if (VECTOR_BOOLEAN_TYPE_P (type)
4845 && types_match (type, TREE_TYPE (@0)))
4846 (if (integer_zerop (@1) && integer_all_onesp (@2))
4848 (if (integer_all_onesp (@1) && integer_zerop (@2))
4851 /* A few simplifications of "a ? CST1 : CST2". */
4852 /* NOTE: Only do this on gimple as the if-chain-to-switch
4853 optimization depends on the gimple to have if statements in it. */
4856 (cond @0 INTEGER_CST@1 INTEGER_CST@2)
4858 (if (integer_zerop (@2))
4860 /* a ? 1 : 0 -> a if 0 and 1 are integral types. */
4861 (if (integer_onep (@1))
4862 (convert (convert:boolean_type_node @0)))
4863 /* a ? powerof2cst : 0 -> a << (log2(powerof2cst)) */
4864 (if (INTEGRAL_TYPE_P (type) && integer_pow2p (@1))
4866 tree shift = build_int_cst (integer_type_node, tree_log2 (@1));
4868 (lshift (convert (convert:boolean_type_node @0)) { shift; })))
4869 /* a ? -1 : 0 -> -a. No need to check the TYPE_PRECISION not being 1
4870 here as the powerof2cst case above will handle that case correctly. */
4871 (if (INTEGRAL_TYPE_P (type) && integer_all_onesp (@1))
4873 auto prec = TYPE_PRECISION (type);
4874 auto unsign = TYPE_UNSIGNED (type);
4875 tree inttype = build_nonstandard_integer_type (prec, unsign);
4877 (convert (negate (convert:inttype (convert:boolean_type_node @0))))))))
4878 (if (integer_zerop (@1))
4880 tree booltrue = constant_boolean_node (true, boolean_type_node);
4883 /* a ? 0 : 1 -> !a. */
4884 (if (integer_onep (@2))
4885 (convert (bit_xor (convert:boolean_type_node @0) { booltrue; } )))
4886 /* a ? powerof2cst : 0 -> (!a) << (log2(powerof2cst)) */
4887 (if (INTEGRAL_TYPE_P (type) && integer_pow2p (@2))
4889 tree shift = build_int_cst (integer_type_node, tree_log2 (@2));
4891 (lshift (convert (bit_xor (convert:boolean_type_node @0) { booltrue; } ))
4893 /* a ? -1 : 0 -> -(!a). No need to check the TYPE_PRECISION not being 1
4894 here as the powerof2cst case above will handle that case correctly. */
4895 (if (INTEGRAL_TYPE_P (type) && integer_all_onesp (@2))
4897 auto prec = TYPE_PRECISION (type);
4898 auto unsign = TYPE_UNSIGNED (type);
4899 tree inttype = build_nonstandard_integer_type (prec, unsign);
4904 (bit_xor (convert:boolean_type_node @0) { booltrue; } )
4916 /* (a > 1) ? 0 : (cast)a is the same as (cast)(a == 1)
4917 for unsigned types. */
4919 (cond (gt @0 integer_onep@1) integer_zerop (convert? @2))
4920 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
4921 && bitwise_equal_p (@0, @2))
4922 (convert (eq @0 @1))
4926 /* (a <= 1) & (cast)a is the same as (cast)(a == 1)
4927 for unsigned types. */
4929 (bit_and:c (convert1? (le @0 integer_onep@1)) (convert2? @2))
4930 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
4931 && bitwise_equal_p (@0, @2))
4932 (convert (eq @0 @1))
4937 (cond @0 zero_one_valued_p@1 zero_one_valued_p@2)
4939 /* bool0 ? bool1 : 0 -> bool0 & bool1 */
4940 (if (integer_zerop (@2))
4941 (bit_and (convert @0) @1))
4942 /* bool0 ? 0 : bool2 -> (bool0^1) & bool2 */
4943 (if (integer_zerop (@1))
4944 (bit_and (bit_xor (convert @0) { build_one_cst (type); } ) @2))
4945 /* bool0 ? 1 : bool2 -> bool0 | bool2 */
4946 (if (integer_onep (@1))
4947 (bit_ior (convert @0) @2))
4948 /* bool0 ? bool1 : 1 -> (bool0^1) | bool1 */
4949 (if (integer_onep (@2))
4950 (bit_ior (bit_xor (convert @0) @2) @1))
4955 # x_5 in range [cst1, cst2] where cst2 = cst1 + 1
4956 x_5 ? cstN ? cst4 : cst3
4957 # op is == or != and N is 1 or 2
4958 to r_6 = x_5 + (min (cst3, cst4) - cst1) or
4959 r_6 = (min (cst3, cst4) + cst1) - x_5 depending on op, N and which
4960 of cst3 and cst4 is smaller.
4961 This was originally done by two_value_replacement in phiopt (PR 88676). */
4964 (cond (eqne SSA_NAME@0 INTEGER_CST@1) INTEGER_CST@2 INTEGER_CST@3)
4965 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
4966 && INTEGRAL_TYPE_P (type)
4967 && (wi::to_widest (@2) + 1 == wi::to_widest (@3)
4968 || wi::to_widest (@2) == wi::to_widest (@3) + 1))
4971 get_range_query (cfun)->range_of_expr (r, @0);
4972 if (r.undefined_p ())
4973 r.set_varying (TREE_TYPE (@0));
4975 wide_int min = r.lower_bound ();
4976 wide_int max = r.upper_bound ();
4979 && (wi::to_wide (@1) == min
4980 || wi::to_wide (@1) == max))
4982 tree arg0 = @2, arg1 = @3;
4984 if ((eqne == EQ_EXPR) ^ (wi::to_wide (@1) == min))
4985 std::swap (arg0, arg1);
4986 if (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (type))
4987 type1 = TREE_TYPE (@0);
4990 auto prec = TYPE_PRECISION (type1);
4991 auto unsign = TYPE_UNSIGNED (type1);
4992 type1 = build_nonstandard_integer_type (prec, unsign);
4993 min = wide_int::from (min, prec,
4994 TYPE_SIGN (TREE_TYPE (@0)));
4995 wide_int a = wide_int::from (wi::to_wide (arg0), prec,
4997 enum tree_code code;
4998 wi::overflow_type ovf;
4999 if (tree_int_cst_lt (arg0, arg1))
5005 /* lhs is known to be in range [min, min+1] and we want to add a
5006 to it. Check if that operation can overflow for those 2 values
5007 and if yes, force unsigned type. */
5008 wi::add (min + (wi::neg_p (a) ? 0 : 1), a, SIGNED, &ovf);
5010 type1 = unsigned_type_for (type1);
5019 /* lhs is known to be in range [min, min+1] and we want to subtract
5020 it from a. Check if that operation can overflow for those 2
5021 values and if yes, force unsigned type. */
5022 wi::sub (a, min + (wi::neg_p (min) ? 0 : 1), SIGNED, &ovf);
5024 type1 = unsigned_type_for (type1);
5027 tree arg = wide_int_to_tree (type1, a);
5029 (if (code == PLUS_EXPR)
5030 (convert (plus (convert:type1 @0) { arg; }))
5031 (convert (minus { arg; } (convert:type1 @0)))
5042 (convert (cond@0 @1 INTEGER_CST@2 INTEGER_CST@3))
5043 (if (INTEGRAL_TYPE_P (type)
5044 && INTEGRAL_TYPE_P (TREE_TYPE (@0)))
5045 (cond @1 (convert @2) (convert @3))))
5047 /* Simplification moved from fold_cond_expr_with_comparison. It may also
5049 /* This pattern implements two kinds simplification:
5052 (cond (cmp (convert1? x) c1) (convert2? x) c2) -> (minmax (x c)) if:
5053 1) Conversions are type widening from smaller type.
5054 2) Const c1 equals to c2 after canonicalizing comparison.
5055 3) Comparison has tree code LT, LE, GT or GE.
5056 This specific pattern is needed when (cmp (convert x) c) may not
5057 be simplified by comparison patterns because of multiple uses of
5058 x. It also makes sense here because simplifying across multiple
5059 referred var is always benefitial for complicated cases.
5062 (cond (eq (convert1? x) c1) (convert2? x) c2) -> (cond (eq x c1) c1 c2). */
5063 (for cmp (lt le gt ge eq ne)
5065 (cond (cmp (convert1? @1) INTEGER_CST@3) (convert2? @1) INTEGER_CST@2)
5068 tree from_type = TREE_TYPE (@1);
5069 tree c1_type = TREE_TYPE (@3), c2_type = TREE_TYPE (@2);
5070 enum tree_code code = ERROR_MARK;
5072 if (INTEGRAL_TYPE_P (from_type)
5073 && int_fits_type_p (@2, from_type)
5074 && (types_match (c1_type, from_type)
5075 || (TYPE_PRECISION (c1_type) > TYPE_PRECISION (from_type)
5076 && (TYPE_UNSIGNED (from_type)
5077 || TYPE_SIGN (c1_type) == TYPE_SIGN (from_type))))
5078 && (types_match (c2_type, from_type)
5079 || (TYPE_PRECISION (c2_type) > TYPE_PRECISION (from_type)
5080 && (TYPE_UNSIGNED (from_type)
5081 || TYPE_SIGN (c2_type) == TYPE_SIGN (from_type)))))
5084 code = minmax_from_comparison (cmp, @1, @3, @1, @2);
5085 /* Can do A == C1 ? A : C2 -> A == C1 ? C1 : C2? */
5086 else if (int_fits_type_p (@3, from_type))
5090 (if (code == MAX_EXPR)
5091 (convert (max @1 (convert @2)))
5092 (if (code == MIN_EXPR)
5093 (convert (min @1 (convert @2)))
5094 (if (code == EQ_EXPR)
5095 (convert (cond (eq @1 (convert @3))
5096 (convert:from_type @3) (convert:from_type @2)))))))))
5098 /* (cond (cmp (convert? x) c1) (op x c2) c3) -> (op (minmax x c1) c2) if:
5100 1) OP is PLUS or MINUS.
5101 2) CMP is LT, LE, GT or GE.
5102 3) C3 == (C1 op C2), and computation doesn't have undefined behavior.
5104 This pattern also handles special cases like:
5106 A) Operand x is a unsigned to signed type conversion and c1 is
5107 integer zero. In this case,
5108 (signed type)x < 0 <=> x > MAX_VAL(signed type)
5109 (signed type)x >= 0 <=> x <= MAX_VAL(signed type)
5110 B) Const c1 may not equal to (C3 op' C2). In this case we also
5111 check equality for (c1+1) and (c1-1) by adjusting comparison
5114 TODO: Though signed type is handled by this pattern, it cannot be
5115 simplified at the moment because C standard requires additional
5116 type promotion. In order to match&simplify it here, the IR needs
5117 to be cleaned up by other optimizers, i.e, VRP. */
5118 (for op (plus minus)
5119 (for cmp (lt le gt ge)
5121 (cond (cmp (convert? @X) INTEGER_CST@1) (op @X INTEGER_CST@2) INTEGER_CST@3)
5122 (with { tree from_type = TREE_TYPE (@X), to_type = TREE_TYPE (@1); }
5123 (if (types_match (from_type, to_type)
5124 /* Check if it is special case A). */
5125 || (TYPE_UNSIGNED (from_type)
5126 && !TYPE_UNSIGNED (to_type)
5127 && TYPE_PRECISION (from_type) == TYPE_PRECISION (to_type)
5128 && integer_zerop (@1)
5129 && (cmp == LT_EXPR || cmp == GE_EXPR)))
5132 wi::overflow_type overflow = wi::OVF_NONE;
5133 enum tree_code code, cmp_code = cmp;
5135 wide_int c1 = wi::to_wide (@1);
5136 wide_int c2 = wi::to_wide (@2);
5137 wide_int c3 = wi::to_wide (@3);
5138 signop sgn = TYPE_SIGN (from_type);
5140 /* Handle special case A), given x of unsigned type:
5141 ((signed type)x < 0) <=> (x > MAX_VAL(signed type))
5142 ((signed type)x >= 0) <=> (x <= MAX_VAL(signed type)) */
5143 if (!types_match (from_type, to_type))
5145 if (cmp_code == LT_EXPR)
5147 if (cmp_code == GE_EXPR)
5149 c1 = wi::max_value (to_type);
5151 /* To simplify this pattern, we require c3 = (c1 op c2). Here we
5152 compute (c3 op' c2) and check if it equals to c1 with op' being
5153 the inverted operator of op. Make sure overflow doesn't happen
5154 if it is undefined. */
5155 if (op == PLUS_EXPR)
5156 real_c1 = wi::sub (c3, c2, sgn, &overflow);
5158 real_c1 = wi::add (c3, c2, sgn, &overflow);
5161 if (!overflow || !TYPE_OVERFLOW_UNDEFINED (from_type))
5163 /* Check if c1 equals to real_c1. Boundary condition is handled
5164 by adjusting comparison operation if necessary. */
5165 if (!wi::cmp (wi::sub (real_c1, 1, sgn, &overflow), c1, sgn)
5168 /* X <= Y - 1 equals to X < Y. */
5169 if (cmp_code == LE_EXPR)
5171 /* X > Y - 1 equals to X >= Y. */
5172 if (cmp_code == GT_EXPR)
5175 if (!wi::cmp (wi::add (real_c1, 1, sgn, &overflow), c1, sgn)
5178 /* X < Y + 1 equals to X <= Y. */
5179 if (cmp_code == LT_EXPR)
5181 /* X >= Y + 1 equals to X > Y. */
5182 if (cmp_code == GE_EXPR)
5185 if (code != cmp_code || !wi::cmp (real_c1, c1, sgn))
5187 if (cmp_code == LT_EXPR || cmp_code == LE_EXPR)
5189 if (cmp_code == GT_EXPR || cmp_code == GE_EXPR)
5194 (if (code == MAX_EXPR)
5195 (op (max @X { wide_int_to_tree (from_type, real_c1); })
5196 { wide_int_to_tree (from_type, c2); })
5197 (if (code == MIN_EXPR)
5198 (op (min @X { wide_int_to_tree (from_type, real_c1); })
5199 { wide_int_to_tree (from_type, c2); })))))))))
5202 /* A >= B ? A : B -> max (A, B) and friends. The code is still
5203 in fold_cond_expr_with_comparison for GENERIC folding with
5204 some extra constraints. */
5205 (for cmp (eq ne le lt unle unlt ge gt unge ungt uneq ltgt)
5207 (cond (cmp:c (nop_convert1?@c0 @0) (nop_convert2?@c1 @1))
5208 (convert3? @0) (convert4? @1))
5209 (if (!HONOR_SIGNED_ZEROS (type)
5210 && (/* Allow widening conversions of the compare operands as data. */
5211 (INTEGRAL_TYPE_P (type)
5212 && types_match (TREE_TYPE (@c0), TREE_TYPE (@0))
5213 && types_match (TREE_TYPE (@c1), TREE_TYPE (@1))
5214 && TYPE_PRECISION (TREE_TYPE (@0)) <= TYPE_PRECISION (type)
5215 && TYPE_PRECISION (TREE_TYPE (@1)) <= TYPE_PRECISION (type))
5216 /* Or sign conversions for the comparison. */
5217 || (types_match (type, TREE_TYPE (@0))
5218 && types_match (type, TREE_TYPE (@1)))))
5220 (if (cmp == EQ_EXPR)
5221 (if (VECTOR_TYPE_P (type))
5224 (if (cmp == NE_EXPR)
5225 (if (VECTOR_TYPE_P (type))
5228 (if (cmp == LE_EXPR || cmp == UNLE_EXPR || cmp == LT_EXPR || cmp == UNLT_EXPR)
5229 (if (!HONOR_NANS (type))
5230 (if (VECTOR_TYPE_P (type))
5231 (view_convert (min @c0 @c1))
5232 (convert (min @c0 @c1)))))
5233 (if (cmp == GE_EXPR || cmp == UNGE_EXPR || cmp == GT_EXPR || cmp == UNGT_EXPR)
5234 (if (!HONOR_NANS (type))
5235 (if (VECTOR_TYPE_P (type))
5236 (view_convert (max @c0 @c1))
5237 (convert (max @c0 @c1)))))
5238 (if (cmp == UNEQ_EXPR)
5239 (if (!HONOR_NANS (type))
5240 (if (VECTOR_TYPE_P (type))
5243 (if (cmp == LTGT_EXPR)
5244 (if (!HONOR_NANS (type))
5245 (if (VECTOR_TYPE_P (type))
5247 (convert @c0))))))))
5250 /* These was part of minmax phiopt. */
5251 /* Optimize (a CMP b) ? minmax<a, c> : minmax<b, c>
5252 to minmax<min/max<a, b>, c> */
5253 (for minmax (min max)
5254 (for cmp (lt le gt ge ne)
5256 (cond (cmp @1 @3) (minmax:c @1 @4) (minmax:c @2 @4))
5259 tree_code code = minmax_from_comparison (cmp, @1, @2, @1, @3);
5261 (if (code == MIN_EXPR)
5262 (minmax (min @1 @2) @4)
5263 (if (code == MAX_EXPR)
5264 (minmax (max @1 @2) @4)))))))
5266 /* Optimize (a CMP CST1) ? max<a,CST2> : a */
5267 (for cmp (gt ge lt le)
5268 minmax (min min max max)
5270 (cond (cmp @0 @1) (minmax:c@2 @0 @3) @4)
5273 tree_code code = minmax_from_comparison (cmp, @0, @1, @0, @4);
5275 (if ((cmp == LT_EXPR || cmp == LE_EXPR)
5277 && integer_nonzerop (fold_build2 (LE_EXPR, boolean_type_node, @3, @1)))
5279 (if ((cmp == GT_EXPR || cmp == GE_EXPR)
5281 && integer_nonzerop (fold_build2 (GE_EXPR, boolean_type_node, @3, @1)))
5284 /* X != C1 ? -X : C2 simplifies to -X when -C1 == C2. */
5286 (cond (ne @0 INTEGER_CST@1) (negate@3 @0) INTEGER_CST@2)
5287 (if (!TYPE_SATURATING (type)
5288 && (TYPE_OVERFLOW_WRAPS (type)
5289 || !wi::only_sign_bit_p (wi::to_wide (@1)))
5290 && wi::eq_p (wi::neg (wi::to_wide (@1)), wi::to_wide (@2)))
5293 /* X != C1 ? ~X : C2 simplifies to ~X when ~C1 == C2. */
5295 (cond (ne @0 INTEGER_CST@1) (bit_not@3 @0) INTEGER_CST@2)
5296 (if (wi::eq_p (wi::bit_not (wi::to_wide (@1)), wi::to_wide (@2)))
5299 /* (X + 1) > Y ? -X : 1 simplifies to X >= Y ? -X : 1 when
5300 X is unsigned, as when X + 1 overflows, X is -1, so -X == 1. */
5302 (cond (gt (plus @0 integer_onep) @1) (negate @0) integer_onep@2)
5303 (if (TYPE_UNSIGNED (type))
5304 (cond (ge @0 @1) (negate @0) @2)))
5306 (for cnd (cond vec_cond)
5307 /* A ? B : (A ? X : C) -> A ? B : C. */
5309 (cnd @0 (cnd @0 @1 @2) @3)
5312 (cnd @0 @1 (cnd @0 @2 @3))
5314 /* A ? B : (!A ? C : X) -> A ? B : C. */
5315 /* ??? This matches embedded conditions open-coded because genmatch
5316 would generate matching code for conditions in separate stmts only.
5317 The following is still important to merge then and else arm cases
5318 from if-conversion. */
5320 (cnd @0 @1 (cnd @2 @3 @4))
5321 (if (inverse_conditions_p (@0, @2))
5324 (cnd @0 (cnd @1 @2 @3) @4)
5325 (if (inverse_conditions_p (@0, @1))
5328 /* A ? B : B -> B. */
5333 /* !A ? B : C -> A ? C : B. */
5335 (cnd (logical_inverted_value truth_valued_p@0) @1 @2)
5338 /* abs/negative simplifications moved from fold_cond_expr_with_comparison,
5339 Need to handle (A - B) case as fold_cond_expr_with_comparison does.
5340 Need to handle UN* comparisons.
5342 None of these transformations work for modes with signed
5343 zeros. If A is +/-0, the first two transformations will
5344 change the sign of the result (from +0 to -0, or vice
5345 versa). The last four will fix the sign of the result,
5346 even though the original expressions could be positive or
5347 negative, depending on the sign of A.
5349 Note that all these transformations are correct if A is
5350 NaN, since the two alternatives (A and -A) are also NaNs. */
5352 (for cnd (cond vec_cond)
5353 /* A == 0 ? A : -A same as -A */
5356 (cnd (cmp @0 zerop) @0 (negate@1 @0))
5357 (if (!HONOR_SIGNED_ZEROS (type))
5360 (cnd (cmp @0 zerop) zerop (negate@1 @0))
5361 (if (!HONOR_SIGNED_ZEROS (type))
5364 /* A != 0 ? A : -A same as A */
5367 (cnd (cmp @0 zerop) @0 (negate @0))
5368 (if (!HONOR_SIGNED_ZEROS (type))
5371 (cnd (cmp @0 zerop) @0 integer_zerop)
5372 (if (!HONOR_SIGNED_ZEROS (type))
5375 /* A >=/> 0 ? A : -A same as abs (A) */
5378 (cnd (cmp @0 zerop) @0 (negate @0))
5379 (if (!HONOR_SIGNED_ZEROS (type)
5380 && !TYPE_UNSIGNED (type))
5382 /* A <=/< 0 ? A : -A same as -abs (A) */
5385 (cnd (cmp @0 zerop) @0 (negate @0))
5386 (if (!HONOR_SIGNED_ZEROS (type)
5387 && !TYPE_UNSIGNED (type))
5388 (if (ANY_INTEGRAL_TYPE_P (type)
5389 && !TYPE_OVERFLOW_WRAPS (type))
5391 tree utype = unsigned_type_for (type);
5393 (convert (negate (absu:utype @0))))
5394 (negate (abs @0)))))
5398 /* -(type)!A -> (type)A - 1. */
5400 (negate (convert?:s (logical_inverted_value:s @0)))
5401 (if (INTEGRAL_TYPE_P (type)
5402 && TREE_CODE (type) != BOOLEAN_TYPE
5403 && TYPE_PRECISION (type) > 1
5404 && TREE_CODE (@0) == SSA_NAME
5405 && ssa_name_has_boolean_range (@0))
5406 (plus (convert:type @0) { build_all_ones_cst (type); })))
5408 /* A + (B vcmp C ? 1 : 0) -> A - (B vcmp C ? -1 : 0), since vector comparisons
5409 return all -1 or all 0 results. */
5410 /* ??? We could instead convert all instances of the vec_cond to negate,
5411 but that isn't necessarily a win on its own. */
5413 (plus:c @3 (view_convert? (vec_cond:s @0 integer_each_onep@1 integer_zerop@2)))
5414 (if (VECTOR_TYPE_P (type)
5415 && known_eq (TYPE_VECTOR_SUBPARTS (type),
5416 TYPE_VECTOR_SUBPARTS (TREE_TYPE (@1)))
5417 && (TYPE_MODE (TREE_TYPE (type))
5418 == TYPE_MODE (TREE_TYPE (TREE_TYPE (@1)))))
5419 (minus @3 (view_convert (vec_cond @0 (negate @1) @2)))))
5421 /* ... likewise A - (B vcmp C ? 1 : 0) -> A + (B vcmp C ? -1 : 0). */
5423 (minus @3 (view_convert? (vec_cond:s @0 integer_each_onep@1 integer_zerop@2)))
5424 (if (VECTOR_TYPE_P (type)
5425 && known_eq (TYPE_VECTOR_SUBPARTS (type),
5426 TYPE_VECTOR_SUBPARTS (TREE_TYPE (@1)))
5427 && (TYPE_MODE (TREE_TYPE (type))
5428 == TYPE_MODE (TREE_TYPE (TREE_TYPE (@1)))))
5429 (plus @3 (view_convert (vec_cond @0 (negate @1) @2)))))
5432 /* Simplifications of comparisons. */
5434 /* See if we can reduce the magnitude of a constant involved in a
5435 comparison by changing the comparison code. This is a canonicalization
5436 formerly done by maybe_canonicalize_comparison_1. */
5440 (cmp @0 uniform_integer_cst_p@1)
5441 (with { tree cst = uniform_integer_cst_p (@1); }
5442 (if (tree_int_cst_sgn (cst) == -1)
5443 (acmp @0 { build_uniform_cst (TREE_TYPE (@1),
5444 wide_int_to_tree (TREE_TYPE (cst),
5450 (cmp @0 uniform_integer_cst_p@1)
5451 (with { tree cst = uniform_integer_cst_p (@1); }
5452 (if (tree_int_cst_sgn (cst) == 1)
5453 (acmp @0 { build_uniform_cst (TREE_TYPE (@1),
5454 wide_int_to_tree (TREE_TYPE (cst),
5455 wi::to_wide (cst) - 1)); })))))
5457 /* We can simplify a logical negation of a comparison to the
5458 inverted comparison. As we cannot compute an expression
5459 operator using invert_tree_comparison we have to simulate
5460 that with expression code iteration. */
5461 (for cmp (tcc_comparison)
5462 icmp (inverted_tcc_comparison)
5463 ncmp (inverted_tcc_comparison_with_nans)
5464 /* Ideally we'd like to combine the following two patterns
5465 and handle some more cases by using
5466 (logical_inverted_value (cmp @0 @1))
5467 here but for that genmatch would need to "inline" that.
5468 For now implement what forward_propagate_comparison did. */
5470 (bit_not (cmp @0 @1))
5471 (if (VECTOR_TYPE_P (type)
5472 || (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) == 1))
5473 /* Comparison inversion may be impossible for trapping math,
5474 invert_tree_comparison will tell us. But we can't use
5475 a computed operator in the replacement tree thus we have
5476 to play the trick below. */
5477 (with { enum tree_code ic = invert_tree_comparison
5478 (cmp, HONOR_NANS (@0)); }
5484 (bit_xor (cmp @0 @1) integer_truep)
5485 (with { enum tree_code ic = invert_tree_comparison
5486 (cmp, HONOR_NANS (@0)); }
5491 /* The following bits are handled by fold_binary_op_with_conditional_arg. */
5493 (ne (cmp@2 @0 @1) integer_zerop)
5494 (if (types_match (type, TREE_TYPE (@2)))
5497 (eq (cmp@2 @0 @1) integer_truep)
5498 (if (types_match (type, TREE_TYPE (@2)))
5501 (ne (cmp@2 @0 @1) integer_truep)
5502 (if (types_match (type, TREE_TYPE (@2)))
5503 (with { enum tree_code ic = invert_tree_comparison
5504 (cmp, HONOR_NANS (@0)); }
5510 (eq (cmp@2 @0 @1) integer_zerop)
5511 (if (types_match (type, TREE_TYPE (@2)))
5512 (with { enum tree_code ic = invert_tree_comparison
5513 (cmp, HONOR_NANS (@0)); }
5519 /* Transform comparisons of the form X - Y CMP 0 to X CMP Y.
5520 ??? The transformation is valid for the other operators if overflow
5521 is undefined for the type, but performing it here badly interacts
5522 with the transformation in fold_cond_expr_with_comparison which
5523 attempts to synthetize ABS_EXPR. */
5525 (for sub (minus pointer_diff)
5527 (cmp (sub@2 @0 @1) integer_zerop)
5528 (if (single_use (@2))
5531 /* Simplify (x < 0) ^ (y < 0) to (x ^ y) < 0 and
5532 (x >= 0) ^ (y >= 0) to (x ^ y) < 0. */
5535 (bit_xor (cmp:s @0 integer_zerop) (cmp:s @1 integer_zerop))
5536 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5537 && !TYPE_UNSIGNED (TREE_TYPE (@0))
5538 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
5539 (lt (bit_xor @0 @1) { build_zero_cst (TREE_TYPE (@0)); }))))
5540 /* Simplify (x < 0) ^ (y >= 0) to (x ^ y) >= 0 and
5541 (x >= 0) ^ (y < 0) to (x ^ y) >= 0. */
5543 (bit_xor:c (lt:s @0 integer_zerop) (ge:s @1 integer_zerop))
5544 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5545 && !TYPE_UNSIGNED (TREE_TYPE (@0))
5546 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
5547 (ge (bit_xor @0 @1) { build_zero_cst (TREE_TYPE (@0)); })))
5549 /* Transform comparisons of the form X * C1 CMP 0 to X CMP 0 in the
5550 signed arithmetic case. That form is created by the compiler
5551 often enough for folding it to be of value. One example is in
5552 computing loop trip counts after Operator Strength Reduction. */
5553 (for cmp (simple_comparison)
5554 scmp (swapped_simple_comparison)
5556 (cmp (mult@3 @0 INTEGER_CST@1) integer_zerop@2)
5557 /* Handle unfolded multiplication by zero. */
5558 (if (integer_zerop (@1))
5560 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
5561 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
5563 /* If @1 is negative we swap the sense of the comparison. */
5564 (if (tree_int_cst_sgn (@1) < 0)
5568 /* For integral types with undefined overflow fold
5569 x * C1 == C2 into x == C2 / C1 or false.
5570 If overflow wraps and C1 is odd, simplify to x == C2 / C1 in the ring
5574 (cmp (mult @0 INTEGER_CST@1) INTEGER_CST@2)
5575 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5576 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
5577 && wi::to_wide (@1) != 0)
5578 (with { widest_int quot; }
5579 (if (wi::multiple_of_p (wi::to_widest (@2), wi::to_widest (@1),
5580 TYPE_SIGN (TREE_TYPE (@0)), "))
5581 (cmp @0 { wide_int_to_tree (TREE_TYPE (@0), quot); })
5582 { constant_boolean_node (cmp == NE_EXPR, type); }))
5583 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5584 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))
5585 && (wi::bit_and (wi::to_wide (@1), 1) == 1))
5588 tree itype = TREE_TYPE (@0);
5589 int p = TYPE_PRECISION (itype);
5590 wide_int m = wi::one (p + 1) << p;
5591 wide_int a = wide_int::from (wi::to_wide (@1), p + 1, UNSIGNED);
5592 wide_int i = wide_int::from (wi::mod_inv (a, m),
5593 p, TYPE_SIGN (itype));
5594 wide_int_to_tree (itype, wi::mul (i, wi::to_wide (@2)));
5597 /* Simplify comparison of something with itself. For IEEE
5598 floating-point, we can only do some of these simplifications. */
5602 (if (! FLOAT_TYPE_P (TREE_TYPE (@0))
5603 || ! tree_expr_maybe_nan_p (@0))
5604 { constant_boolean_node (true, type); }
5606 /* With -ftrapping-math conversion to EQ loses an exception. */
5607 && (! FLOAT_TYPE_P (TREE_TYPE (@0))
5608 || ! flag_trapping_math))
5614 || ! FLOAT_TYPE_P (TREE_TYPE (@0))
5615 || ! tree_expr_maybe_nan_p (@0))
5616 { constant_boolean_node (false, type); })))
5617 (for cmp (unle unge uneq)
5620 { constant_boolean_node (true, type); }))
5621 (for cmp (unlt ungt)
5627 (if (!flag_trapping_math || !tree_expr_maybe_nan_p (@0))
5628 { constant_boolean_node (false, type); }))
5630 /* x == ~x -> false */
5631 /* x != ~x -> true */
5634 (cmp:c @0 (bit_not @0))
5635 { constant_boolean_node (cmp == NE_EXPR, type); }))
5637 /* Fold ~X op ~Y as Y op X. */
5638 (for cmp (simple_comparison)
5640 (cmp (bit_not@2 @0) (bit_not@3 @1))
5641 (if (single_use (@2) && single_use (@3))
5644 /* Fold ~X op C as X op' ~C, where op' is the swapped comparison. */
5645 (for cmp (simple_comparison)
5646 scmp (swapped_simple_comparison)
5648 (cmp (bit_not@2 @0) CONSTANT_CLASS_P@1)
5649 (if (single_use (@2)
5650 && (TREE_CODE (@1) == INTEGER_CST || TREE_CODE (@1) == VECTOR_CST))
5651 (scmp @0 (bit_not @1)))))
5653 (for cmp (simple_comparison)
5656 /* IEEE doesn't distinguish +0 and -0 in comparisons. */
5658 /* a CMP (-0) -> a CMP 0 */
5659 (if (REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@1)))
5660 (cmp @0 { build_real (TREE_TYPE (@1), dconst0); }))
5661 /* (-0) CMP b -> 0 CMP b. */
5662 (if (TREE_CODE (@0) == REAL_CST
5663 && REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@0)))
5664 (cmp { build_real (TREE_TYPE (@0), dconst0); } @1))
5665 /* x != NaN is always true, other ops are always false. */
5666 (if (REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
5667 && (cmp == EQ_EXPR || cmp == NE_EXPR || !flag_trapping_math)
5668 && !tree_expr_signaling_nan_p (@1)
5669 && !tree_expr_maybe_signaling_nan_p (@0))
5670 { constant_boolean_node (cmp == NE_EXPR, type); })
5671 /* NaN != y is always true, other ops are always false. */
5672 (if (TREE_CODE (@0) == REAL_CST
5673 && REAL_VALUE_ISNAN (TREE_REAL_CST (@0))
5674 && (cmp == EQ_EXPR || cmp == NE_EXPR || !flag_trapping_math)
5675 && !tree_expr_signaling_nan_p (@0)
5676 && !tree_expr_signaling_nan_p (@1))
5677 { constant_boolean_node (cmp == NE_EXPR, type); })
5678 /* Fold comparisons against infinity. */
5679 (if (REAL_VALUE_ISINF (TREE_REAL_CST (@1))
5680 && MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (@1))))
5683 REAL_VALUE_TYPE max;
5684 enum tree_code code = cmp;
5685 bool neg = REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1));
5687 code = swap_tree_comparison (code);
5690 /* x > +Inf is always false, if we ignore NaNs or exceptions. */
5691 (if (code == GT_EXPR
5692 && !(HONOR_NANS (@0) && flag_trapping_math))
5693 { constant_boolean_node (false, type); })
5694 (if (code == LE_EXPR)
5695 /* x <= +Inf is always true, if we don't care about NaNs. */
5696 (if (! HONOR_NANS (@0))
5697 { constant_boolean_node (true, type); }
5698 /* x <= +Inf is the same as x == x, i.e. !isnan(x), but this loses
5699 an "invalid" exception. */
5700 (if (!flag_trapping_math)
5702 /* x == +Inf and x >= +Inf are always equal to x > DBL_MAX, but
5703 for == this introduces an exception for x a NaN. */
5704 (if ((code == EQ_EXPR && !(HONOR_NANS (@0) && flag_trapping_math))
5706 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
5708 (lt @0 { build_real (TREE_TYPE (@0), max); })
5709 (gt @0 { build_real (TREE_TYPE (@0), max); }))))
5710 /* x < +Inf is always equal to x <= DBL_MAX. */
5711 (if (code == LT_EXPR)
5712 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
5714 (ge @0 { build_real (TREE_TYPE (@0), max); })
5715 (le @0 { build_real (TREE_TYPE (@0), max); }))))
5716 /* x != +Inf is always equal to !(x > DBL_MAX), but this introduces
5717 an exception for x a NaN so use an unordered comparison. */
5718 (if (code == NE_EXPR)
5719 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
5720 (if (! HONOR_NANS (@0))
5722 (ge @0 { build_real (TREE_TYPE (@0), max); })
5723 (le @0 { build_real (TREE_TYPE (@0), max); }))
5725 (unge @0 { build_real (TREE_TYPE (@0), max); })
5726 (unle @0 { build_real (TREE_TYPE (@0), max); }))))))))))
5728 /* If this is a comparison of a real constant with a PLUS_EXPR
5729 or a MINUS_EXPR of a real constant, we can convert it into a
5730 comparison with a revised real constant as long as no overflow
5731 occurs when unsafe_math_optimizations are enabled. */
5732 (if (flag_unsafe_math_optimizations)
5733 (for op (plus minus)
5735 (cmp (op @0 REAL_CST@1) REAL_CST@2)
5738 tree tem = const_binop (op == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR,
5739 TREE_TYPE (@1), @2, @1);
5741 (if (tem && !TREE_OVERFLOW (tem))
5742 (cmp @0 { tem; }))))))
5744 /* Likewise, we can simplify a comparison of a real constant with
5745 a MINUS_EXPR whose first operand is also a real constant, i.e.
5746 (c1 - x) < c2 becomes x > c1-c2. Reordering is allowed on
5747 floating-point types only if -fassociative-math is set. */
5748 (if (flag_associative_math)
5750 (cmp (minus REAL_CST@0 @1) REAL_CST@2)
5751 (with { tree tem = const_binop (MINUS_EXPR, TREE_TYPE (@1), @0, @2); }
5752 (if (tem && !TREE_OVERFLOW (tem))
5753 (cmp { tem; } @1)))))
5755 /* Fold comparisons against built-in math functions. */
5756 (if (flag_unsafe_math_optimizations && ! flag_errno_math)
5759 (cmp (sq @0) REAL_CST@1)
5761 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
5763 /* sqrt(x) < y is always false, if y is negative. */
5764 (if (cmp == EQ_EXPR || cmp == LT_EXPR || cmp == LE_EXPR)
5765 { constant_boolean_node (false, type); })
5766 /* sqrt(x) > y is always true, if y is negative and we
5767 don't care about NaNs, i.e. negative values of x. */
5768 (if (cmp == NE_EXPR || !HONOR_NANS (@0))
5769 { constant_boolean_node (true, type); })
5770 /* sqrt(x) > y is the same as x >= 0, if y is negative. */
5771 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })))
5772 (if (real_equal (TREE_REAL_CST_PTR (@1), &dconst0))
5774 /* sqrt(x) < 0 is always false. */
5775 (if (cmp == LT_EXPR)
5776 { constant_boolean_node (false, type); })
5777 /* sqrt(x) >= 0 is always true if we don't care about NaNs. */
5778 (if (cmp == GE_EXPR && !HONOR_NANS (@0))
5779 { constant_boolean_node (true, type); })
5780 /* sqrt(x) <= 0 -> x == 0. */
5781 (if (cmp == LE_EXPR)
5783 /* Otherwise sqrt(x) cmp 0 -> x cmp 0. Here cmp can be >=, >,
5784 == or !=. In the last case:
5786 (sqrt(x) != 0) == (NaN != 0) == true == (x != 0)
5788 if x is negative or NaN. Due to -funsafe-math-optimizations,
5789 the results for other x follow from natural arithmetic. */
5791 (if ((cmp == LT_EXPR
5795 && !REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
5796 /* Give up for -frounding-math. */
5797 && !HONOR_SIGN_DEPENDENT_ROUNDING (TREE_TYPE (@0)))
5801 enum tree_code ncmp = cmp;
5802 const real_format *fmt
5803 = REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (@0)));
5804 real_arithmetic (&c2, MULT_EXPR,
5805 &TREE_REAL_CST (@1), &TREE_REAL_CST (@1));
5806 real_convert (&c2, fmt, &c2);
5807 /* See PR91734: if c2 is inexact and sqrt(c2) < c (or sqrt(c2) >= c),
5808 then change LT_EXPR into LE_EXPR or GE_EXPR into GT_EXPR. */
5809 if (!REAL_VALUE_ISINF (c2))
5811 tree c3 = fold_const_call (CFN_SQRT, TREE_TYPE (@0),
5812 build_real (TREE_TYPE (@0), c2));
5813 if (c3 == NULL_TREE || TREE_CODE (c3) != REAL_CST)
5815 else if ((cmp == LT_EXPR || cmp == GE_EXPR)
5816 && real_less (&TREE_REAL_CST (c3), &TREE_REAL_CST (@1)))
5817 ncmp = cmp == LT_EXPR ? LE_EXPR : GT_EXPR;
5818 else if ((cmp == LE_EXPR || cmp == GT_EXPR)
5819 && real_less (&TREE_REAL_CST (@1), &TREE_REAL_CST (c3)))
5820 ncmp = cmp == LE_EXPR ? LT_EXPR : GE_EXPR;
5823 /* With rounding to even, sqrt of up to 3 different values
5824 gives the same normal result, so in some cases c2 needs
5826 REAL_VALUE_TYPE c2alt, tow;
5827 if (cmp == LT_EXPR || cmp == GE_EXPR)
5831 real_nextafter (&c2alt, fmt, &c2, &tow);
5832 real_convert (&c2alt, fmt, &c2alt);
5833 if (REAL_VALUE_ISINF (c2alt))
5837 c3 = fold_const_call (CFN_SQRT, TREE_TYPE (@0),
5838 build_real (TREE_TYPE (@0), c2alt));
5839 if (c3 == NULL_TREE || TREE_CODE (c3) != REAL_CST)
5841 else if (real_equal (&TREE_REAL_CST (c3),
5842 &TREE_REAL_CST (@1)))
5848 (if (cmp == GT_EXPR || cmp == GE_EXPR)
5849 (if (REAL_VALUE_ISINF (c2))
5850 /* sqrt(x) > y is x == +Inf, when y is very large. */
5851 (if (HONOR_INFINITIES (@0))
5852 (eq @0 { build_real (TREE_TYPE (@0), c2); })
5853 { constant_boolean_node (false, type); })
5854 /* sqrt(x) > c is the same as x > c*c. */
5855 (if (ncmp != ERROR_MARK)
5856 (if (ncmp == GE_EXPR)
5857 (ge @0 { build_real (TREE_TYPE (@0), c2); })
5858 (gt @0 { build_real (TREE_TYPE (@0), c2); }))))
5859 /* else if (cmp == LT_EXPR || cmp == LE_EXPR) */
5860 (if (REAL_VALUE_ISINF (c2))
5862 /* sqrt(x) < y is always true, when y is a very large
5863 value and we don't care about NaNs or Infinities. */
5864 (if (! HONOR_NANS (@0) && ! HONOR_INFINITIES (@0))
5865 { constant_boolean_node (true, type); })
5866 /* sqrt(x) < y is x != +Inf when y is very large and we
5867 don't care about NaNs. */
5868 (if (! HONOR_NANS (@0))
5869 (ne @0 { build_real (TREE_TYPE (@0), c2); }))
5870 /* sqrt(x) < y is x >= 0 when y is very large and we
5871 don't care about Infinities. */
5872 (if (! HONOR_INFINITIES (@0))
5873 (ge @0 { build_real (TREE_TYPE (@0), dconst0); }))
5874 /* sqrt(x) < y is x >= 0 && x != +Inf, when y is large. */
5877 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })
5878 (ne @0 { build_real (TREE_TYPE (@0), c2); }))))
5879 /* sqrt(x) < c is the same as x < c*c, if we ignore NaNs. */
5880 (if (ncmp != ERROR_MARK && ! HONOR_NANS (@0))
5881 (if (ncmp == LT_EXPR)
5882 (lt @0 { build_real (TREE_TYPE (@0), c2); })
5883 (le @0 { build_real (TREE_TYPE (@0), c2); }))
5884 /* sqrt(x) < c is the same as x >= 0 && x < c*c. */
5885 (if (ncmp != ERROR_MARK && GENERIC)
5886 (if (ncmp == LT_EXPR)
5888 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })
5889 (lt @0 { build_real (TREE_TYPE (@0), c2); }))
5891 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })
5892 (le @0 { build_real (TREE_TYPE (@0), c2); })))))))))))
5893 /* Transform sqrt(x) cmp sqrt(y) -> x cmp y. */
5895 (cmp (sq @0) (sq @1))
5896 (if (! HONOR_NANS (@0))
5899 /* Optimize various special cases of (FTYPE) N CMP (FTYPE) M. */
5900 (for cmp (lt le eq ne ge gt unordered ordered unlt unle ungt unge uneq ltgt)
5901 icmp (lt le eq ne ge gt unordered ordered lt le gt ge eq ne)
5903 (cmp (float@0 @1) (float @2))
5904 (if (SCALAR_FLOAT_TYPE_P (TREE_TYPE (@0))
5905 && ! DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0)))
5908 format_helper fmt (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (@0))));
5909 tree type1 = TREE_TYPE (@1);
5910 bool type1_signed_p = TYPE_SIGN (type1) == SIGNED;
5911 tree type2 = TREE_TYPE (@2);
5912 bool type2_signed_p = TYPE_SIGN (type2) == SIGNED;
5914 (if (fmt.can_represent_integral_type_p (type1)
5915 && fmt.can_represent_integral_type_p (type2))
5916 (if (cmp == ORDERED_EXPR || cmp == UNORDERED_EXPR)
5917 { constant_boolean_node (cmp == ORDERED_EXPR, type); }
5918 (if (TYPE_PRECISION (type1) > TYPE_PRECISION (type2)
5919 && type1_signed_p >= type2_signed_p)
5920 (icmp @1 (convert @2))
5921 (if (TYPE_PRECISION (type1) < TYPE_PRECISION (type2)
5922 && type1_signed_p <= type2_signed_p)
5923 (icmp (convert:type2 @1) @2)
5924 (if (TYPE_PRECISION (type1) == TYPE_PRECISION (type2)
5925 && type1_signed_p == type2_signed_p)
5926 (icmp @1 @2))))))))))
5928 /* Optimize various special cases of (FTYPE) N CMP CST. */
5929 (for cmp (lt le eq ne ge gt)
5930 icmp (le le eq ne ge ge)
5932 (cmp (float @0) REAL_CST@1)
5933 (if (SCALAR_FLOAT_TYPE_P (TREE_TYPE (@1))
5934 && ! DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@1)))
5937 tree itype = TREE_TYPE (@0);
5938 format_helper fmt (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (@1))));
5939 const REAL_VALUE_TYPE *cst = TREE_REAL_CST_PTR (@1);
5940 /* Be careful to preserve any potential exceptions due to
5941 NaNs. qNaNs are ok in == or != context.
5942 TODO: relax under -fno-trapping-math or
5943 -fno-signaling-nans. */
5945 = real_isnan (cst) && (cst->signalling
5946 || (cmp != EQ_EXPR && cmp != NE_EXPR));
5948 /* TODO: allow non-fitting itype and SNaNs when
5949 -fno-trapping-math. */
5950 (if (fmt.can_represent_integral_type_p (itype) && ! exception_p)
5953 signop isign = TYPE_SIGN (itype);
5954 REAL_VALUE_TYPE imin, imax;
5955 real_from_integer (&imin, fmt, wi::min_value (itype), isign);
5956 real_from_integer (&imax, fmt, wi::max_value (itype), isign);
5958 REAL_VALUE_TYPE icst;
5959 if (cmp == GT_EXPR || cmp == GE_EXPR)
5960 real_ceil (&icst, fmt, cst);
5961 else if (cmp == LT_EXPR || cmp == LE_EXPR)
5962 real_floor (&icst, fmt, cst);
5964 real_trunc (&icst, fmt, cst);
5966 bool cst_int_p = !real_isnan (cst) && real_identical (&icst, cst);
5968 bool overflow_p = false;
5970 = real_to_integer (&icst, &overflow_p, TYPE_PRECISION (itype));
5973 /* Optimize cases when CST is outside of ITYPE's range. */
5974 (if (real_compare (LT_EXPR, cst, &imin))
5975 { constant_boolean_node (cmp == GT_EXPR || cmp == GE_EXPR || cmp == NE_EXPR,
5977 (if (real_compare (GT_EXPR, cst, &imax))
5978 { constant_boolean_node (cmp == LT_EXPR || cmp == LE_EXPR || cmp == NE_EXPR,
5980 /* Remove cast if CST is an integer representable by ITYPE. */
5982 (cmp @0 { gcc_assert (!overflow_p);
5983 wide_int_to_tree (itype, icst_val); })
5985 /* When CST is fractional, optimize
5986 (FTYPE) N == CST -> 0
5987 (FTYPE) N != CST -> 1. */
5988 (if (cmp == EQ_EXPR || cmp == NE_EXPR)
5989 { constant_boolean_node (cmp == NE_EXPR, type); })
5990 /* Otherwise replace with sensible integer constant. */
5993 gcc_checking_assert (!overflow_p);
5995 (icmp @0 { wide_int_to_tree (itype, icst_val); })))))))))
5997 /* Fold A /[ex] B CMP C to A CMP B * C. */
6000 (cmp (exact_div @0 @1) INTEGER_CST@2)
6001 (if (!integer_zerop (@1))
6002 (if (wi::to_wide (@2) == 0)
6004 (if (TREE_CODE (@1) == INTEGER_CST)
6007 wi::overflow_type ovf;
6008 wide_int prod = wi::mul (wi::to_wide (@2), wi::to_wide (@1),
6009 TYPE_SIGN (TREE_TYPE (@1)), &ovf);
6012 { constant_boolean_node (cmp == NE_EXPR, type); }
6013 (cmp @0 { wide_int_to_tree (TREE_TYPE (@0), prod); }))))))))
6014 (for cmp (lt le gt ge)
6016 (cmp (exact_div @0 INTEGER_CST@1) INTEGER_CST@2)
6017 (if (wi::gt_p (wi::to_wide (@1), 0, TYPE_SIGN (TREE_TYPE (@1))))
6020 wi::overflow_type ovf;
6021 wide_int prod = wi::mul (wi::to_wide (@2), wi::to_wide (@1),
6022 TYPE_SIGN (TREE_TYPE (@1)), &ovf);
6025 { constant_boolean_node (wi::lt_p (wi::to_wide (@2), 0,
6026 TYPE_SIGN (TREE_TYPE (@2)))
6027 != (cmp == LT_EXPR || cmp == LE_EXPR), type); }
6028 (cmp @0 { wide_int_to_tree (TREE_TYPE (@0), prod); }))))))
6030 /* Fold (size_t)(A /[ex] B) CMP C to (size_t)A CMP (size_t)B * C or A CMP' 0.
6032 For small C (less than max/B), this is (size_t)A CMP (size_t)B * C.
6033 For large C (more than min/B+2^size), this is also true, with the
6034 multiplication computed modulo 2^size.
6035 For intermediate C, this just tests the sign of A. */
6036 (for cmp (lt le gt ge)
6039 (cmp (convert (exact_div @0 INTEGER_CST@1)) INTEGER_CST@2)
6040 (if (tree_nop_conversion_p (TREE_TYPE (@0), TREE_TYPE (@2))
6041 && TYPE_UNSIGNED (TREE_TYPE (@2)) && !TYPE_UNSIGNED (TREE_TYPE (@0))
6042 && wi::gt_p (wi::to_wide (@1), 0, TYPE_SIGN (TREE_TYPE (@1))))
6045 tree utype = TREE_TYPE (@2);
6046 wide_int denom = wi::to_wide (@1);
6047 wide_int right = wi::to_wide (@2);
6048 wide_int smax = wi::sdiv_trunc (wi::max_value (TREE_TYPE (@0)), denom);
6049 wide_int smin = wi::sdiv_trunc (wi::min_value (TREE_TYPE (@0)), denom);
6050 bool small = wi::leu_p (right, smax);
6051 bool large = wi::geu_p (right, smin);
6053 (if (small || large)
6054 (cmp (convert:utype @0) (mult @2 (convert @1)))
6055 (cmp2 @0 { build_zero_cst (TREE_TYPE (@0)); }))))))
6057 /* Unordered tests if either argument is a NaN. */
6059 (bit_ior (unordered @0 @0) (unordered @1 @1))
6060 (if (types_match (@0, @1))
6063 (bit_and (ordered @0 @0) (ordered @1 @1))
6064 (if (types_match (@0, @1))
6067 (bit_ior:c (unordered @0 @0) (unordered:c@2 @0 @1))
6070 (bit_and:c (ordered @0 @0) (ordered:c@2 @0 @1))
6073 /* A & (2**N - 1) <= 2**K - 1 -> A & (2**N - 2**K) == 0
6074 A & (2**N - 1) > 2**K - 1 -> A & (2**N - 2**K) != 0
6076 Note that comparisons
6077 A & (2**N - 1) < 2**K -> A & (2**N - 2**K) == 0
6078 A & (2**N - 1) >= 2**K -> A & (2**N - 2**K) != 0
6079 will be canonicalized to above so there's no need to
6086 (cmp (bit_and@0 @1 INTEGER_CST@2) INTEGER_CST@3)
6087 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)))
6090 tree ty = TREE_TYPE (@0);
6091 unsigned prec = TYPE_PRECISION (ty);
6092 wide_int mask = wi::to_wide (@2, prec);
6093 wide_int rhs = wi::to_wide (@3, prec);
6094 signop sgn = TYPE_SIGN (ty);
6096 (if ((mask & (mask + 1)) == 0 && wi::gt_p (rhs, 0, sgn)
6097 && (rhs & (rhs + 1)) == 0 && wi::ge_p (mask, rhs, sgn))
6098 (eqcmp (bit_and @1 { wide_int_to_tree (ty, mask - rhs); })
6099 { build_zero_cst (ty); }))))))
6101 /* -A CMP -B -> B CMP A. */
6102 (for cmp (tcc_comparison)
6103 scmp (swapped_tcc_comparison)
6105 (cmp (negate @0) (negate @1))
6106 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
6107 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
6110 || TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))))
6113 (cmp (negate @0) CONSTANT_CLASS_P@1)
6114 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
6115 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
6118 || TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))))
6119 (with { tree tem = const_unop (NEGATE_EXPR, TREE_TYPE (@0), @1); }
6120 (if (tem && !TREE_OVERFLOW (tem))
6121 (scmp @0 { tem; }))))))
6123 /* Convert ABS[U]_EXPR<x> == 0 or ABS[U]_EXPR<x> != 0 to x == 0 or x != 0. */
6127 (eqne (op @0) zerop@1)
6128 (eqne @0 { build_zero_cst (TREE_TYPE (@0)); }))))
6130 /* From fold_sign_changed_comparison and fold_widened_comparison.
6131 FIXME: the lack of symmetry is disturbing. */
6132 (for cmp (simple_comparison)
6134 (cmp (convert@0 @00) (convert?@1 @10))
6135 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6136 /* Disable this optimization if we're casting a function pointer
6137 type on targets that require function pointer canonicalization. */
6138 && !(targetm.have_canonicalize_funcptr_for_compare ()
6139 && ((POINTER_TYPE_P (TREE_TYPE (@00))
6140 && FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@00))))
6141 || (POINTER_TYPE_P (TREE_TYPE (@10))
6142 && FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@10))))))
6144 (if (TYPE_PRECISION (TREE_TYPE (@00)) == TYPE_PRECISION (TREE_TYPE (@0))
6145 && (TREE_CODE (@10) == INTEGER_CST
6147 && (TYPE_UNSIGNED (TREE_TYPE (@00)) == TYPE_UNSIGNED (TREE_TYPE (@0))
6150 && !POINTER_TYPE_P (TREE_TYPE (@00))
6151 /* (int)bool:32 != (int)uint is not the same as
6152 bool:32 != (bool:32)uint since boolean types only have two valid
6153 values independent of their precision. */
6154 && (TREE_CODE (TREE_TYPE (@00)) != BOOLEAN_TYPE
6155 || TREE_CODE (TREE_TYPE (@10)) == BOOLEAN_TYPE))
6156 /* ??? The special-casing of INTEGER_CST conversion was in the original
6157 code and here to avoid a spurious overflow flag on the resulting
6158 constant which fold_convert produces. */
6159 (if (TREE_CODE (@1) == INTEGER_CST)
6160 (cmp @00 { force_fit_type (TREE_TYPE (@00), wi::to_widest (@1), 0,
6161 TREE_OVERFLOW (@1)); })
6162 (cmp @00 (convert @1)))
6164 (if (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (TREE_TYPE (@00)))
6165 /* If possible, express the comparison in the shorter mode. */
6166 (if ((cmp == EQ_EXPR || cmp == NE_EXPR
6167 || TYPE_UNSIGNED (TREE_TYPE (@0)) == TYPE_UNSIGNED (TREE_TYPE (@00))
6168 || (!TYPE_UNSIGNED (TREE_TYPE (@0))
6169 && TYPE_UNSIGNED (TREE_TYPE (@00))))
6170 && (types_match (TREE_TYPE (@10), TREE_TYPE (@00))
6171 || ((TYPE_PRECISION (TREE_TYPE (@00))
6172 >= TYPE_PRECISION (TREE_TYPE (@10)))
6173 && (TYPE_UNSIGNED (TREE_TYPE (@00))
6174 == TYPE_UNSIGNED (TREE_TYPE (@10))))
6175 || (TREE_CODE (@10) == INTEGER_CST
6176 && INTEGRAL_TYPE_P (TREE_TYPE (@00))
6177 && int_fits_type_p (@10, TREE_TYPE (@00)))))
6178 (cmp @00 (convert @10))
6179 (if (TREE_CODE (@10) == INTEGER_CST
6180 && INTEGRAL_TYPE_P (TREE_TYPE (@00))
6181 && !int_fits_type_p (@10, TREE_TYPE (@00)))
6184 tree min = lower_bound_in_type (TREE_TYPE (@10), TREE_TYPE (@00));
6185 tree max = upper_bound_in_type (TREE_TYPE (@10), TREE_TYPE (@00));
6186 bool above = integer_nonzerop (const_binop (LT_EXPR, type, max, @10));
6187 bool below = integer_nonzerop (const_binop (LT_EXPR, type, @10, min));
6189 (if (above || below)
6190 (if (cmp == EQ_EXPR || cmp == NE_EXPR)
6191 { constant_boolean_node (cmp == EQ_EXPR ? false : true, type); }
6192 (if (cmp == LT_EXPR || cmp == LE_EXPR)
6193 { constant_boolean_node (above ? true : false, type); }
6194 (if (cmp == GT_EXPR || cmp == GE_EXPR)
6195 { constant_boolean_node (above ? false : true, type); })))))))))
6196 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
6197 (if (FLOAT_TYPE_P (TREE_TYPE (@00))
6198 && (DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0))
6199 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@00)))
6200 && (DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0))
6201 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@10))))
6204 tree type1 = TREE_TYPE (@10);
6205 if (TREE_CODE (@10) == REAL_CST && !DECIMAL_FLOAT_TYPE_P (type1))
6207 REAL_VALUE_TYPE orig = TREE_REAL_CST (@10);
6208 if (TYPE_PRECISION (type1) > TYPE_PRECISION (float_type_node)
6209 && exact_real_truncate (TYPE_MODE (float_type_node), &orig))
6210 type1 = float_type_node;
6211 if (TYPE_PRECISION (type1) > TYPE_PRECISION (double_type_node)
6212 && exact_real_truncate (TYPE_MODE (double_type_node), &orig))
6213 type1 = double_type_node;
6216 = (element_precision (TREE_TYPE (@00)) > element_precision (type1)
6217 ? TREE_TYPE (@00) : type1);
6219 (if (element_precision (TREE_TYPE (@0)) > element_precision (newtype))
6220 (cmp (convert:newtype @00) (convert:newtype @10))))))))
6225 /* SSA names are canonicalized to 2nd place. */
6226 (cmp addr@0 SSA_NAME@1)
6229 poly_int64 off; tree base;
6230 tree addr = (TREE_CODE (@0) == SSA_NAME
6231 ? gimple_assign_rhs1 (SSA_NAME_DEF_STMT (@0)) : @0);
6233 /* A local variable can never be pointed to by
6234 the default SSA name of an incoming parameter. */
6235 (if (SSA_NAME_IS_DEFAULT_DEF (@1)
6236 && TREE_CODE (SSA_NAME_VAR (@1)) == PARM_DECL
6237 && (base = get_base_address (TREE_OPERAND (addr, 0)))
6238 && TREE_CODE (base) == VAR_DECL
6239 && auto_var_in_fn_p (base, current_function_decl))
6240 (if (cmp == NE_EXPR)
6241 { constant_boolean_node (true, type); }
6242 { constant_boolean_node (false, type); })
6243 /* If the address is based on @1 decide using the offset. */
6244 (if ((base = get_addr_base_and_unit_offset (TREE_OPERAND (addr, 0), &off))
6245 && TREE_CODE (base) == MEM_REF
6246 && TREE_OPERAND (base, 0) == @1)
6247 (with { off += mem_ref_offset (base).force_shwi (); }
6248 (if (known_ne (off, 0))
6249 { constant_boolean_node (cmp == NE_EXPR, type); }
6250 (if (known_eq (off, 0))
6251 { constant_boolean_node (cmp == EQ_EXPR, type); }))))))))
6253 /* Equality compare simplifications from fold_binary */
6256 /* If we have (A | C) == D where C & ~D != 0, convert this into 0.
6257 Similarly for NE_EXPR. */
6259 (cmp (convert?@3 (bit_ior @0 INTEGER_CST@1)) INTEGER_CST@2)
6260 (if (tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0))
6261 && wi::bit_and_not (wi::to_wide (@1), wi::to_wide (@2)) != 0)
6262 { constant_boolean_node (cmp == NE_EXPR, type); }))
6264 /* (X ^ Y) == 0 becomes X == Y, and (X ^ Y) != 0 becomes X != Y. */
6266 (cmp (bit_xor @0 @1) integer_zerop)
6269 /* (X ^ Y) == Y becomes X == 0.
6270 Likewise (X ^ Y) == X becomes Y == 0. */
6272 (cmp:c (bit_xor:c @0 @1) @0)
6273 (cmp @1 { build_zero_cst (TREE_TYPE (@1)); }))
6275 /* (X & Y) == X becomes (X & ~Y) == 0. */
6277 (cmp:c (bit_and:c @0 @1) @0)
6278 (cmp (bit_and @0 (bit_not! @1)) { build_zero_cst (TREE_TYPE (@0)); }))
6280 (cmp:c (convert@3 (bit_and (convert@2 @0) INTEGER_CST@1)) (convert @0))
6281 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6282 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
6283 && INTEGRAL_TYPE_P (TREE_TYPE (@3))
6284 && TYPE_PRECISION (TREE_TYPE (@2)) == TYPE_PRECISION (TREE_TYPE (@0))
6285 && TYPE_PRECISION (TREE_TYPE (@3)) > TYPE_PRECISION (TREE_TYPE (@2))
6286 && !wi::neg_p (wi::to_wide (@1)))
6287 (cmp (bit_and @0 (convert (bit_not @1)))
6288 { build_zero_cst (TREE_TYPE (@0)); })))
6290 /* (X | Y) == Y becomes (X & ~Y) == 0. */
6292 (cmp:c (bit_ior:c @0 @1) @1)
6293 (cmp (bit_and @0 (bit_not! @1)) { build_zero_cst (TREE_TYPE (@0)); }))
6295 /* (X ^ C1) op C2 can be rewritten as X op (C1 ^ C2). */
6297 (cmp (convert?@3 (bit_xor @0 INTEGER_CST@1)) INTEGER_CST@2)
6298 (if (tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0)))
6299 (cmp @0 (bit_xor @1 (convert @2)))))
6302 (cmp (nop_convert? @0) integer_zerop)
6303 (if (tree_expr_nonzero_p (@0))
6304 { constant_boolean_node (cmp == NE_EXPR, type); }))
6306 /* (X & C) op (Y & C) into (X ^ Y) & C op 0. */
6308 (cmp (bit_and:cs @0 @2) (bit_and:cs @1 @2))
6309 (cmp (bit_and (bit_xor @0 @1) @2) { build_zero_cst (TREE_TYPE (@2)); })))
6311 /* (X < 0) != (Y < 0) into (X ^ Y) < 0.
6312 (X >= 0) != (Y >= 0) into (X ^ Y) < 0.
6313 (X < 0) == (Y < 0) into (X ^ Y) >= 0.
6314 (X >= 0) == (Y >= 0) into (X ^ Y) >= 0. */
6319 (cmp (sgncmp @0 integer_zerop@2) (sgncmp @1 integer_zerop))
6320 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
6321 && !TYPE_UNSIGNED (TREE_TYPE (@0))
6322 && types_match (@0, @1))
6323 (ncmp (bit_xor @0 @1) @2)))))
6324 /* (X < 0) == (Y >= 0) into (X ^ Y) < 0.
6325 (X < 0) != (Y >= 0) into (X ^ Y) >= 0. */
6329 (cmp:c (lt @0 integer_zerop@2) (ge @1 integer_zerop))
6330 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
6331 && !TYPE_UNSIGNED (TREE_TYPE (@0))
6332 && types_match (@0, @1))
6333 (ncmp (bit_xor @0 @1) @2))))
6335 /* If we have (A & C) == C where C is a power of 2, convert this into
6336 (A & C) != 0. Similarly for NE_EXPR. */
6340 (cmp (bit_and@2 @0 integer_pow2p@1) @1)
6341 (icmp @2 { build_zero_cst (TREE_TYPE (@0)); })))
6344 /* From fold_binary_op_with_conditional_arg handle the case of
6345 rewriting (a ? b : c) > d to a ? (b > d) : (c > d) when the
6346 compares simplify. */
6347 (for cmp (simple_comparison)
6349 (cmp:c (cond @0 @1 @2) @3)
6350 /* Do not move possibly trapping operations into the conditional as this
6351 pessimizes code and causes gimplification issues when applied late. */
6352 (if (!FLOAT_TYPE_P (TREE_TYPE (@3))
6353 || !operation_could_trap_p (cmp, true, false, @3))
6354 (cond @0 (cmp! @1 @3) (cmp! @2 @3)))))
6358 /* x < 0 ? ~y : y into (x >> (prec-1)) ^ y. */
6359 /* x >= 0 ? ~y : y into ~((x >> (prec-1)) ^ y). */
6361 (cond (cmp @0 integer_zerop) (bit_not @1) @1)
6362 (if (INTEGRAL_TYPE_P (type)
6363 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
6364 && !TYPE_UNSIGNED (TREE_TYPE (@0))
6365 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (type))
6368 tree shifter = build_int_cst (integer_type_node, TYPE_PRECISION (type) - 1);
6370 (if (cmp == LT_EXPR)
6371 (bit_xor (convert (rshift @0 {shifter;})) @1)
6372 (bit_not (bit_xor (convert (rshift @0 {shifter;})) @1))))))
6373 /* x < 0 ? y : ~y into ~((x >> (prec-1)) ^ y). */
6374 /* x >= 0 ? y : ~y into (x >> (prec-1)) ^ y. */
6376 (cond (cmp @0 integer_zerop) @1 (bit_not @1))
6377 (if (INTEGRAL_TYPE_P (type)
6378 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
6379 && !TYPE_UNSIGNED (TREE_TYPE (@0))
6380 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (type))
6383 tree shifter = build_int_cst (integer_type_node, TYPE_PRECISION (type) - 1);
6385 (if (cmp == GE_EXPR)
6386 (bit_xor (convert (rshift @0 {shifter;})) @1)
6387 (bit_not (bit_xor (convert (rshift @0 {shifter;})) @1)))))))
6389 /* If we have (A & C) != 0 ? D : 0 where C and D are powers of 2,
6390 convert this into a shift followed by ANDing with D. */
6393 (ne (bit_and @0 integer_pow2p@1) integer_zerop)
6394 INTEGER_CST@2 integer_zerop)
6395 (if (!POINTER_TYPE_P (type) && integer_pow2p (@2))
6397 int shift = (wi::exact_log2 (wi::to_wide (@2))
6398 - wi::exact_log2 (wi::to_wide (@1)));
6402 (lshift (convert @0) { build_int_cst (integer_type_node, shift); }) @2)
6404 (convert (rshift @0 { build_int_cst (integer_type_node, -shift); }))
6407 /* If we have (A & C) != 0 where C is the sign bit of A, convert
6408 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
6412 (cmp (bit_and (convert?@2 @0) integer_pow2p@1) integer_zerop)
6413 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6414 && type_has_mode_precision_p (TREE_TYPE (@0))
6415 && element_precision (@2) >= element_precision (@0)
6416 && wi::only_sign_bit_p (wi::to_wide (@1), element_precision (@0)))
6417 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
6418 (ncmp (convert:stype @0) { build_zero_cst (stype); })))))
6420 /* If we have A < 0 ? C : 0 where C is a power of 2, convert
6421 this into a right shift or sign extension followed by ANDing with C. */
6424 (lt @0 integer_zerop)
6425 INTEGER_CST@1 integer_zerop)
6426 (if (integer_pow2p (@1)
6427 && !TYPE_UNSIGNED (TREE_TYPE (@0)))
6429 int shift = element_precision (@0) - wi::exact_log2 (wi::to_wide (@1)) - 1;
6433 (convert (rshift @0 { build_int_cst (integer_type_node, shift); }))
6435 /* Otherwise ctype must be wider than TREE_TYPE (@0) and pure
6436 sign extension followed by AND with C will achieve the effect. */
6437 (bit_and (convert @0) @1)))))
6439 /* When the addresses are not directly of decls compare base and offset.
6440 This implements some remaining parts of fold_comparison address
6441 comparisons but still no complete part of it. Still it is good
6442 enough to make fold_stmt not regress when not dispatching to fold_binary. */
6443 (for cmp (simple_comparison)
6445 (cmp (convert1?@2 addr@0) (convert2? addr@1))
6448 poly_int64 off0, off1;
6450 int equal = address_compare (cmp, TREE_TYPE (@2), @0, @1, base0, base1,
6451 off0, off1, GENERIC);
6455 (if (cmp == EQ_EXPR && (known_eq (off0, off1) || known_ne (off0, off1)))
6456 { constant_boolean_node (known_eq (off0, off1), type); })
6457 (if (cmp == NE_EXPR && (known_eq (off0, off1) || known_ne (off0, off1)))
6458 { constant_boolean_node (known_ne (off0, off1), type); })
6459 (if (cmp == LT_EXPR && (known_lt (off0, off1) || known_ge (off0, off1)))
6460 { constant_boolean_node (known_lt (off0, off1), type); })
6461 (if (cmp == LE_EXPR && (known_le (off0, off1) || known_gt (off0, off1)))
6462 { constant_boolean_node (known_le (off0, off1), type); })
6463 (if (cmp == GE_EXPR && (known_ge (off0, off1) || known_lt (off0, off1)))
6464 { constant_boolean_node (known_ge (off0, off1), type); })
6465 (if (cmp == GT_EXPR && (known_gt (off0, off1) || known_le (off0, off1)))
6466 { constant_boolean_node (known_gt (off0, off1), type); }))
6469 (if (cmp == EQ_EXPR)
6470 { constant_boolean_node (false, type); })
6471 (if (cmp == NE_EXPR)
6472 { constant_boolean_node (true, type); })))))))
6475 /* a?~t:t -> (-(a))^t */
6478 (with { bool wascmp; }
6479 (if (INTEGRAL_TYPE_P (type)
6480 && bitwise_inverted_equal_p (@1, @2, wascmp)
6481 && (!wascmp || element_precision (type) == 1))
6483 auto prec = TYPE_PRECISION (type);
6484 auto unsign = TYPE_UNSIGNED (type);
6485 tree inttype = build_nonstandard_integer_type (prec, unsign);
6487 (convert (bit_xor (negate (convert:inttype @0)) (convert:inttype @2)))))))
6490 /* Simplify pointer equality compares using PTA. */
6494 (if (POINTER_TYPE_P (TREE_TYPE (@0))
6495 && ptrs_compare_unequal (@0, @1))
6496 { constant_boolean_node (neeq != EQ_EXPR, type); })))
6498 /* PR70920: Transform (intptr_t)x eq/ne CST to x eq/ne (typeof x) CST.
6499 and (typeof ptr_cst) x eq/ne ptr_cst to x eq/ne (typeof x) CST.
6500 Disable the transform if either operand is pointer to function.
6501 This broke pr22051-2.c for arm where function pointer
6502 canonicalizaion is not wanted. */
6506 (cmp (convert @0) INTEGER_CST@1)
6507 (if (((POINTER_TYPE_P (TREE_TYPE (@0))
6508 && !FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@0)))
6509 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
6510 /* Don't perform this optimization in GENERIC if @0 has reference
6511 type when sanitizing. See PR101210. */
6513 && TREE_CODE (TREE_TYPE (@0)) == REFERENCE_TYPE
6514 && (flag_sanitize & (SANITIZE_NULL | SANITIZE_ALIGNMENT))))
6515 || (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6516 && POINTER_TYPE_P (TREE_TYPE (@1))
6517 && !FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@1)))))
6518 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1)))
6519 (cmp @0 (convert @1)))))
6521 /* Non-equality compare simplifications from fold_binary */
6522 (for cmp (lt gt le ge)
6523 /* Comparisons with the highest or lowest possible integer of
6524 the specified precision will have known values. */
6526 (cmp (convert?@2 @0) uniform_integer_cst_p@1)
6527 (if ((INTEGRAL_TYPE_P (TREE_TYPE (@1))
6528 || POINTER_TYPE_P (TREE_TYPE (@1))
6529 || VECTOR_INTEGER_TYPE_P (TREE_TYPE (@1)))
6530 && tree_nop_conversion_p (TREE_TYPE (@2), TREE_TYPE (@0)))
6533 tree cst = uniform_integer_cst_p (@1);
6534 tree arg1_type = TREE_TYPE (cst);
6535 unsigned int prec = TYPE_PRECISION (arg1_type);
6536 wide_int max = wi::max_value (arg1_type);
6537 wide_int signed_max = wi::max_value (prec, SIGNED);
6538 wide_int min = wi::min_value (arg1_type);
6541 (if (wi::to_wide (cst) == max)
6543 (if (cmp == GT_EXPR)
6544 { constant_boolean_node (false, type); })
6545 (if (cmp == GE_EXPR)
6547 (if (cmp == LE_EXPR)
6548 { constant_boolean_node (true, type); })
6549 (if (cmp == LT_EXPR)
6551 (if (wi::to_wide (cst) == min)
6553 (if (cmp == LT_EXPR)
6554 { constant_boolean_node (false, type); })
6555 (if (cmp == LE_EXPR)
6557 (if (cmp == GE_EXPR)
6558 { constant_boolean_node (true, type); })
6559 (if (cmp == GT_EXPR)
6561 (if (wi::to_wide (cst) == max - 1)
6563 (if (cmp == GT_EXPR)
6564 (eq @2 { build_uniform_cst (TREE_TYPE (@1),
6565 wide_int_to_tree (TREE_TYPE (cst),
6568 (if (cmp == LE_EXPR)
6569 (ne @2 { build_uniform_cst (TREE_TYPE (@1),
6570 wide_int_to_tree (TREE_TYPE (cst),
6573 (if (wi::to_wide (cst) == min + 1)
6575 (if (cmp == GE_EXPR)
6576 (ne @2 { build_uniform_cst (TREE_TYPE (@1),
6577 wide_int_to_tree (TREE_TYPE (cst),
6580 (if (cmp == LT_EXPR)
6581 (eq @2 { build_uniform_cst (TREE_TYPE (@1),
6582 wide_int_to_tree (TREE_TYPE (cst),
6585 (if (wi::to_wide (cst) == signed_max
6586 && TYPE_UNSIGNED (arg1_type)
6587 /* We will flip the signedness of the comparison operator
6588 associated with the mode of @1, so the sign bit is
6589 specified by this mode. Check that @1 is the signed
6590 max associated with this sign bit. */
6591 && prec == GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (arg1_type))
6592 /* signed_type does not work on pointer types. */
6593 && INTEGRAL_TYPE_P (arg1_type))
6594 /* The following case also applies to X < signed_max+1
6595 and X >= signed_max+1 because previous transformations. */
6596 (if (cmp == LE_EXPR || cmp == GT_EXPR)
6597 (with { tree st = signed_type_for (TREE_TYPE (@1)); }
6599 (if (cst == @1 && cmp == LE_EXPR)
6600 (ge (convert:st @0) { build_zero_cst (st); }))
6601 (if (cst == @1 && cmp == GT_EXPR)
6602 (lt (convert:st @0) { build_zero_cst (st); }))
6603 (if (cmp == LE_EXPR)
6604 (ge (view_convert:st @0) { build_zero_cst (st); }))
6605 (if (cmp == GT_EXPR)
6606 (lt (view_convert:st @0) { build_zero_cst (st); })))))))))))
6608 /* unsigned < (typeof unsigned)(unsigned != 0) is always false. */
6610 (lt:c @0 (convert (ne @0 integer_zerop)))
6611 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
6612 { constant_boolean_node (false, type); }))
6614 /* x != (typeof x)(x == CST) -> CST == 0 ? 1 : (CST == 1 ? (x!=0&&x!=1) : x != 0) */
6615 /* x != (typeof x)(x != CST) -> CST == 1 ? 1 : (CST == 0 ? (x!=0&&x!=1) : x != 1) */
6616 /* x == (typeof x)(x == CST) -> CST == 0 ? 0 : (CST == 1 ? (x==0||x==1) : x == 0) */
6617 /* x == (typeof x)(x != CST) -> CST == 1 ? 0 : (CST == 0 ? (x==0||x==1) : x == 1) */
6621 (outer:c @0 (convert (inner @0 INTEGER_CST@1)))
6623 bool cst1 = integer_onep (@1);
6624 bool cst0 = integer_zerop (@1);
6625 bool innereq = inner == EQ_EXPR;
6626 bool outereq = outer == EQ_EXPR;
6629 (if (innereq ? cst0 : cst1)
6630 { constant_boolean_node (!outereq, type); })
6631 (if (innereq ? cst1 : cst0)
6633 tree utype = unsigned_type_for (TREE_TYPE (@0));
6634 tree ucst1 = build_one_cst (utype);
6637 (gt (convert:utype @0) { ucst1; })
6638 (le (convert:utype @0) { ucst1; })
6643 tree value = build_int_cst (TREE_TYPE (@0), !innereq);
6656 (for cmp (unordered ordered unlt unle ungt unge uneq ltgt)
6657 /* If the second operand is NaN, the result is constant. */
6660 (if (REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
6661 && (cmp != LTGT_EXPR || ! flag_trapping_math))
6662 { constant_boolean_node (cmp == ORDERED_EXPR || cmp == LTGT_EXPR
6663 ? false : true, type); })))
6665 /* Fold UNORDERED if either operand must be NaN, or neither can be. */
6669 (if (tree_expr_nan_p (@0) || tree_expr_nan_p (@1))
6670 { constant_boolean_node (true, type); })
6671 (if (!tree_expr_maybe_nan_p (@0) && !tree_expr_maybe_nan_p (@1))
6672 { constant_boolean_node (false, type); })))
6674 /* Fold ORDERED if either operand must be NaN, or neither can be. */
6678 (if (tree_expr_nan_p (@0) || tree_expr_nan_p (@1))
6679 { constant_boolean_node (false, type); })
6680 (if (!tree_expr_maybe_nan_p (@0) && !tree_expr_maybe_nan_p (@1))
6681 { constant_boolean_node (true, type); })))
6683 /* bool_var != 0 becomes bool_var. */
6685 (ne @0 integer_zerop)
6686 (if (TREE_CODE (TREE_TYPE (@0)) == BOOLEAN_TYPE
6687 && types_match (type, TREE_TYPE (@0)))
6689 /* bool_var == 1 becomes bool_var. */
6691 (eq @0 integer_onep)
6692 (if (TREE_CODE (TREE_TYPE (@0)) == BOOLEAN_TYPE
6693 && types_match (type, TREE_TYPE (@0)))
6696 bool_var == 0 becomes !bool_var or
6697 bool_var != 1 becomes !bool_var
6698 here because that only is good in assignment context as long
6699 as we require a tcc_comparison in GIMPLE_CONDs where we'd
6700 replace if (x == 0) with tem = ~x; if (tem != 0) which is
6701 clearly less optimal and which we'll transform again in forwprop. */
6703 /* Transform comparisons of the form (X & Y) CMP 0 to X CMP2 Z
6704 where ~Y + 1 == pow2 and Z = ~Y. */
6705 (for cst (VECTOR_CST INTEGER_CST)
6709 (cmp (bit_and:c@2 @0 cst@1) integer_zerop)
6710 (with { tree csts = bitmask_inv_cst_vector_p (@1); }
6711 (if (csts && (VECTOR_TYPE_P (TREE_TYPE (@1)) || single_use (@2)))
6712 (with { auto optab = VECTOR_TYPE_P (TREE_TYPE (@1))
6713 ? optab_vector : optab_default;
6714 tree utype = unsigned_type_for (TREE_TYPE (@1)); }
6715 (if (target_supports_op_p (utype, icmp, optab)
6716 || (optimize_vectors_before_lowering_p ()
6717 && (!target_supports_op_p (type, cmp, optab)
6718 || !target_supports_op_p (type, BIT_AND_EXPR, optab))))
6719 (if (TYPE_UNSIGNED (TREE_TYPE (@1)))
6721 (icmp (view_convert:utype @0) { csts; })))))))))
6723 /* When one argument is a constant, overflow detection can be simplified.
6724 Currently restricted to single use so as not to interfere too much with
6725 ADD_OVERFLOW detection in tree-ssa-math-opts.cc.
6726 CONVERT?(CONVERT?(A) + CST) CMP A -> A CMP' CST' */
6727 (for cmp (lt le ge gt)
6730 (cmp:c (convert?@3 (plus@2 (convert?@4 @0) INTEGER_CST@1)) @0)
6731 (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@2))
6732 && types_match (TREE_TYPE (@0), TREE_TYPE (@3))
6733 && tree_nop_conversion_p (TREE_TYPE (@4), TREE_TYPE (@0))
6734 && wi::to_wide (@1) != 0
6737 unsigned int prec = TYPE_PRECISION (TREE_TYPE (@0));
6738 signop sign = TYPE_SIGN (TREE_TYPE (@0));
6740 (out @0 { wide_int_to_tree (TREE_TYPE (@0),
6741 wi::max_value (prec, sign)
6742 - wi::to_wide (@1)); })))))
6744 /* To detect overflow in unsigned A - B, A < B is simpler than A - B > A.
6745 However, the detection logic for SUB_OVERFLOW in tree-ssa-math-opts.cc
6746 expects the long form, so we restrict the transformation for now. */
6749 (cmp:c (minus@2 @0 @1) @0)
6750 (if (single_use (@2)
6751 && ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
6752 && TYPE_UNSIGNED (TREE_TYPE (@0)))
6755 /* Optimize A - B + -1 >= A into B >= A for unsigned comparisons. */
6758 (cmp:c (plus (minus @0 @1) integer_minus_onep) @0)
6759 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
6760 && TYPE_UNSIGNED (TREE_TYPE (@0)))
6763 /* Testing for overflow is unnecessary if we already know the result. */
6768 (cmp:c (realpart (IFN_SUB_OVERFLOW@2 @0 @1)) @0)
6769 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
6770 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
6771 (out (imagpart @2) { build_zero_cst (TREE_TYPE (@0)); }))))
6776 (cmp:c (realpart (IFN_ADD_OVERFLOW:c@2 @0 @1)) @0)
6777 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
6778 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
6779 (out (imagpart @2) { build_zero_cst (TREE_TYPE (@0)); }))))
6781 /* For unsigned operands, -1 / B < A checks whether A * B would overflow.
6782 Simplify it to __builtin_mul_overflow (A, B, <unused>). */
6786 (cmp:c (trunc_div:s integer_all_onesp @1) @0)
6787 (if (TYPE_UNSIGNED (TREE_TYPE (@0)) && !VECTOR_TYPE_P (TREE_TYPE (@0)))
6788 (with { tree t = TREE_TYPE (@0), cpx = build_complex_type (t); }
6789 (out (imagpart (IFN_MUL_OVERFLOW:cpx @0 @1)) { build_zero_cst (t); })))))
6791 /* Similarly, for unsigned operands, (((type) A * B) >> prec) != 0 where type
6792 is at least twice as wide as type of A and B, simplify to
6793 __builtin_mul_overflow (A, B, <unused>). */
6796 (cmp (rshift (mult:s (convert@3 @0) (convert @1)) INTEGER_CST@2)
6798 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6799 && INTEGRAL_TYPE_P (TREE_TYPE (@3))
6800 && TYPE_UNSIGNED (TREE_TYPE (@0))
6801 && (TYPE_PRECISION (TREE_TYPE (@3))
6802 >= 2 * TYPE_PRECISION (TREE_TYPE (@0)))
6803 && tree_fits_uhwi_p (@2)
6804 && tree_to_uhwi (@2) == TYPE_PRECISION (TREE_TYPE (@0))
6805 && types_match (@0, @1)
6806 && type_has_mode_precision_p (TREE_TYPE (@0))
6807 && (optab_handler (umulv4_optab, TYPE_MODE (TREE_TYPE (@0)))
6808 != CODE_FOR_nothing))
6809 (with { tree t = TREE_TYPE (@0), cpx = build_complex_type (t); }
6810 (cmp (imagpart (IFN_MUL_OVERFLOW:cpx @0 @1)) { build_zero_cst (t); })))))
6812 /* Demote operands of IFN_{ADD,SUB,MUL}_OVERFLOW. */
6813 (for ovf (IFN_ADD_OVERFLOW IFN_SUB_OVERFLOW IFN_MUL_OVERFLOW)
6815 (ovf (convert@2 @0) @1)
6816 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6817 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
6818 && TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (TREE_TYPE (@0))
6819 && (!TYPE_UNSIGNED (TREE_TYPE (@2)) || TYPE_UNSIGNED (TREE_TYPE (@0))))
6822 (ovf @1 (convert@2 @0))
6823 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6824 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
6825 && TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (TREE_TYPE (@0))
6826 && (!TYPE_UNSIGNED (TREE_TYPE (@2)) || TYPE_UNSIGNED (TREE_TYPE (@0))))
6829 /* Optimize __builtin_mul_overflow_p (x, cst, (utype) 0) if all 3 types
6830 are unsigned to x > (umax / cst). Similarly for signed type, but
6831 in that case it needs to be outside of a range. */
6833 (imagpart (IFN_MUL_OVERFLOW:cs@2 @0 integer_nonzerop@1))
6834 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6835 && TYPE_MAX_VALUE (TREE_TYPE (@0))
6836 && types_match (TREE_TYPE (@0), TREE_TYPE (TREE_TYPE (@2)))
6837 && int_fits_type_p (@1, TREE_TYPE (@0)))
6838 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
6839 (convert (gt @0 (trunc_div! { TYPE_MAX_VALUE (TREE_TYPE (@0)); } @1)))
6840 (if (TYPE_MIN_VALUE (TREE_TYPE (@0)))
6841 (if (integer_minus_onep (@1))
6842 (convert (eq @0 { TYPE_MIN_VALUE (TREE_TYPE (@0)); }))
6845 tree div = fold_convert (TREE_TYPE (@0), @1);
6846 tree lo = int_const_binop (TRUNC_DIV_EXPR,
6847 TYPE_MIN_VALUE (TREE_TYPE (@0)), div);
6848 tree hi = int_const_binop (TRUNC_DIV_EXPR,
6849 TYPE_MAX_VALUE (TREE_TYPE (@0)), div);
6850 tree etype = range_check_type (TREE_TYPE (@0));
6853 if (wi::neg_p (wi::to_wide (div)))
6855 lo = fold_convert (etype, lo);
6856 hi = fold_convert (etype, hi);
6857 hi = int_const_binop (MINUS_EXPR, hi, lo);
6861 (convert (gt (minus (convert:etype @0) { lo; }) { hi; })))))))))
6863 /* Simplification of math builtins. These rules must all be optimizations
6864 as well as IL simplifications. If there is a possibility that the new
6865 form could be a pessimization, the rule should go in the canonicalization
6866 section that follows this one.
6868 Rules can generally go in this section if they satisfy one of
6871 - the rule describes an identity
6873 - the rule replaces calls with something as simple as addition or
6876 - the rule contains unary calls only and simplifies the surrounding
6877 arithmetic. (The idea here is to exclude non-unary calls in which
6878 one operand is constant and in which the call is known to be cheap
6879 when the operand has that value.) */
6881 (if (flag_unsafe_math_optimizations)
6882 /* Simplify sqrt(x) * sqrt(x) -> x. */
6884 (mult (SQRT_ALL@1 @0) @1)
6885 (if (!tree_expr_maybe_signaling_nan_p (@0))
6888 (for op (plus minus)
6889 /* Simplify (A / C) +- (B / C) -> (A +- B) / C. */
6893 (rdiv (op @0 @2) @1)))
6895 (for cmp (lt le gt ge)
6896 neg_cmp (gt ge lt le)
6897 /* Simplify (x * C1) cmp C2 -> x cmp (C2 / C1), where C1 != 0. */
6899 (cmp (mult @0 REAL_CST@1) REAL_CST@2)
6901 { tree tem = const_binop (RDIV_EXPR, type, @2, @1); }
6903 && !(REAL_VALUE_ISINF (TREE_REAL_CST (tem))
6904 || (real_zerop (tem) && !real_zerop (@1))))
6906 (if (real_less (&dconst0, TREE_REAL_CST_PTR (@1)))
6908 (if (real_less (TREE_REAL_CST_PTR (@1), &dconst0))
6909 (neg_cmp @0 { tem; })))))))
6911 /* Simplify sqrt(x) * sqrt(y) -> sqrt(x*y). */
6912 (for root (SQRT CBRT)
6914 (mult (root:s @0) (root:s @1))
6915 (root (mult @0 @1))))
6917 /* Simplify expN(x) * expN(y) -> expN(x+y). */
6918 (for exps (EXP EXP2 EXP10 POW10)
6920 (mult (exps:s @0) (exps:s @1))
6921 (exps (plus @0 @1))))
6923 /* Simplify a/root(b/c) into a*root(c/b). */
6924 (for root (SQRT CBRT)
6926 (rdiv @0 (root:s (rdiv:s @1 @2)))
6927 (mult @0 (root (rdiv @2 @1)))))
6929 /* Simplify x/expN(y) into x*expN(-y). */
6930 (for exps (EXP EXP2 EXP10 POW10)
6932 (rdiv @0 (exps:s @1))
6933 (mult @0 (exps (negate @1)))))
6935 (for logs (LOG LOG2 LOG10 LOG10)
6936 exps (EXP EXP2 EXP10 POW10)
6937 /* logN(expN(x)) -> x. */
6941 /* expN(logN(x)) -> x. */
6946 /* Optimize logN(func()) for various exponential functions. We
6947 want to determine the value "x" and the power "exponent" in
6948 order to transform logN(x**exponent) into exponent*logN(x). */
6949 (for logs (LOG LOG LOG LOG2 LOG2 LOG2 LOG10 LOG10)
6950 exps (EXP2 EXP10 POW10 EXP EXP10 POW10 EXP EXP2)
6953 (if (SCALAR_FLOAT_TYPE_P (type))
6959 /* Prepare to do logN(exp(exponent)) -> exponent*logN(e). */
6960 x = build_real_truncate (type, dconst_e ());
6963 /* Prepare to do logN(exp2(exponent)) -> exponent*logN(2). */
6964 x = build_real (type, dconst2);
6968 /* Prepare to do logN(exp10(exponent)) -> exponent*logN(10). */
6970 REAL_VALUE_TYPE dconst10;
6971 real_from_integer (&dconst10, VOIDmode, 10, SIGNED);
6972 x = build_real (type, dconst10);
6979 (mult (logs { x; }) @0)))))
6987 (if (SCALAR_FLOAT_TYPE_P (type))
6993 /* Prepare to do logN(sqrt(x)) -> 0.5*logN(x). */
6994 x = build_real (type, dconsthalf);
6997 /* Prepare to do logN(cbrt(x)) -> (1/3)*logN(x). */
6998 x = build_real_truncate (type, dconst_third ());
7004 (mult { x; } (logs @0))))))
7006 /* logN(pow(x,exponent)) -> exponent*logN(x). */
7007 (for logs (LOG LOG2 LOG10)
7011 (mult @1 (logs @0))))
7013 /* pow(C,x) -> exp(log(C)*x) if C > 0,
7014 or if C is a positive power of 2,
7015 pow(C,x) -> exp2(log2(C)*x). */
7023 (pows REAL_CST@0 @1)
7024 (if (real_compare (GT_EXPR, TREE_REAL_CST_PTR (@0), &dconst0)
7025 && real_isfinite (TREE_REAL_CST_PTR (@0))
7026 /* As libmvec doesn't have a vectorized exp2, defer optimizing
7027 the use_exp2 case until after vectorization. It seems actually
7028 beneficial for all constants to postpone this until later,
7029 because exp(log(C)*x), while faster, will have worse precision
7030 and if x folds into a constant too, that is unnecessary
7032 && canonicalize_math_after_vectorization_p ())
7034 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (@0);
7035 bool use_exp2 = false;
7036 if (targetm.libc_has_function (function_c99_misc, TREE_TYPE (@0))
7037 && value->cl == rvc_normal)
7039 REAL_VALUE_TYPE frac_rvt = *value;
7040 SET_REAL_EXP (&frac_rvt, 1);
7041 if (real_equal (&frac_rvt, &dconst1))
7046 (if (optimize_pow_to_exp (@0, @1))
7047 (exps (mult (logs @0) @1)))
7048 (exp2s (mult (log2s @0) @1)))))))
7051 /* pow(C,x)*expN(y) -> expN(logN(C)*x+y) if C > 0. */
7053 exps (EXP EXP2 EXP10 POW10)
7054 logs (LOG LOG2 LOG10 LOG10)
7056 (mult:c (pows:s REAL_CST@0 @1) (exps:s @2))
7057 (if (real_compare (GT_EXPR, TREE_REAL_CST_PTR (@0), &dconst0)
7058 && real_isfinite (TREE_REAL_CST_PTR (@0)))
7059 (exps (plus (mult (logs @0) @1) @2)))))
7064 exps (EXP EXP2 EXP10 POW10)
7065 /* sqrt(expN(x)) -> expN(x*0.5). */
7068 (exps (mult @0 { build_real (type, dconsthalf); })))
7069 /* cbrt(expN(x)) -> expN(x/3). */
7072 (exps (mult @0 { build_real_truncate (type, dconst_third ()); })))
7073 /* pow(expN(x), y) -> expN(x*y). */
7076 (exps (mult @0 @1))))
7078 /* tan(atan(x)) -> x. */
7085 /* Simplify sin(atan(x)) -> x / sqrt(x*x + 1). */
7089 copysigns (COPYSIGN)
7094 REAL_VALUE_TYPE r_cst;
7095 build_sinatan_real (&r_cst, type);
7096 tree t_cst = build_real (type, r_cst);
7097 tree t_one = build_one_cst (type);
7099 (if (SCALAR_FLOAT_TYPE_P (type))
7100 (cond (lt (abs @0) { t_cst; })
7101 (rdiv @0 (sqrts (plus (mult @0 @0) { t_one; })))
7102 (copysigns { t_one; } @0))))))
7104 /* Simplify cos(atan(x)) -> 1 / sqrt(x*x + 1). */
7108 copysigns (COPYSIGN)
7113 REAL_VALUE_TYPE r_cst;
7114 build_sinatan_real (&r_cst, type);
7115 tree t_cst = build_real (type, r_cst);
7116 tree t_one = build_one_cst (type);
7117 tree t_zero = build_zero_cst (type);
7119 (if (SCALAR_FLOAT_TYPE_P (type))
7120 (cond (lt (abs @0) { t_cst; })
7121 (rdiv { t_one; } (sqrts (plus (mult @0 @0) { t_one; })))
7122 (copysigns { t_zero; } @0))))))
7124 (if (!flag_errno_math)
7125 /* Simplify sinh(atanh(x)) -> x / sqrt((1 - x)*(1 + x)). */
7130 (sinhs (atanhs:s @0))
7131 (with { tree t_one = build_one_cst (type); }
7132 (rdiv @0 (sqrts (mult (minus { t_one; } @0) (plus { t_one; } @0)))))))
7134 /* Simplify cosh(atanh(x)) -> 1 / sqrt((1 - x)*(1 + x)) */
7139 (coshs (atanhs:s @0))
7140 (with { tree t_one = build_one_cst (type); }
7141 (rdiv { t_one; } (sqrts (mult (minus { t_one; } @0) (plus { t_one; } @0))))))))
7143 /* cabs(x+0i) or cabs(0+xi) -> abs(x). */
7145 (CABS (complex:C @0 real_zerop@1))
7148 /* trunc(trunc(x)) -> trunc(x), etc. */
7149 (for fns (TRUNC_ALL FLOOR_ALL CEIL_ALL ROUND_ALL NEARBYINT_ALL RINT_ALL)
7153 /* f(x) -> x if x is integer valued and f does nothing for such values. */
7154 (for fns (TRUNC_ALL FLOOR_ALL CEIL_ALL ROUND_ALL NEARBYINT_ALL RINT_ALL)
7156 (fns integer_valued_real_p@0)
7159 /* hypot(x,0) and hypot(0,x) -> abs(x). */
7161 (HYPOT:c @0 real_zerop@1)
7164 /* pow(1,x) -> 1. */
7166 (POW real_onep@0 @1)
7170 /* copysign(x,x) -> x. */
7171 (COPYSIGN_ALL @0 @0)
7175 /* copysign(x,-x) -> -x. */
7176 (COPYSIGN_ALL @0 (negate@1 @0))
7180 /* copysign(x,y) -> fabs(x) if y is nonnegative. */
7181 (COPYSIGN_ALL @0 tree_expr_nonnegative_p@1)
7184 (for scale (LDEXP SCALBN SCALBLN)
7185 /* ldexp(0, x) -> 0. */
7187 (scale real_zerop@0 @1)
7189 /* ldexp(x, 0) -> x. */
7191 (scale @0 integer_zerop@1)
7193 /* ldexp(x, y) -> x if x is +-Inf or NaN. */
7195 (scale REAL_CST@0 @1)
7196 (if (!real_isfinite (TREE_REAL_CST_PTR (@0)))
7199 /* Canonicalization of sequences of math builtins. These rules represent
7200 IL simplifications but are not necessarily optimizations.
7202 The sincos pass is responsible for picking "optimal" implementations
7203 of math builtins, which may be more complicated and can sometimes go
7204 the other way, e.g. converting pow into a sequence of sqrts.
7205 We only want to do these canonicalizations before the pass has run. */
7207 (if (flag_unsafe_math_optimizations && canonicalize_math_p ())
7208 /* Simplify tan(x) * cos(x) -> sin(x). */
7210 (mult:c (TAN:s @0) (COS:s @0))
7213 /* Simplify x * pow(x,c) -> pow(x,c+1). */
7215 (mult:c @0 (POW:s @0 REAL_CST@1))
7216 (if (!TREE_OVERFLOW (@1))
7217 (POW @0 (plus @1 { build_one_cst (type); }))))
7219 /* Simplify sin(x) / cos(x) -> tan(x). */
7221 (rdiv (SIN:s @0) (COS:s @0))
7224 /* Simplify sinh(x) / cosh(x) -> tanh(x). */
7226 (rdiv (SINH:s @0) (COSH:s @0))
7229 /* Simplify tanh (x) / sinh (x) -> 1.0 / cosh (x). */
7231 (rdiv (TANH:s @0) (SINH:s @0))
7232 (rdiv {build_one_cst (type);} (COSH @0)))
7234 /* Simplify cos(x) / sin(x) -> 1 / tan(x). */
7236 (rdiv (COS:s @0) (SIN:s @0))
7237 (rdiv { build_one_cst (type); } (TAN @0)))
7239 /* Simplify sin(x) / tan(x) -> cos(x). */
7241 (rdiv (SIN:s @0) (TAN:s @0))
7242 (if (! HONOR_NANS (@0)
7243 && ! HONOR_INFINITIES (@0))
7246 /* Simplify tan(x) / sin(x) -> 1.0 / cos(x). */
7248 (rdiv (TAN:s @0) (SIN:s @0))
7249 (if (! HONOR_NANS (@0)
7250 && ! HONOR_INFINITIES (@0))
7251 (rdiv { build_one_cst (type); } (COS @0))))
7253 /* Simplify pow(x,y) * pow(x,z) -> pow(x,y+z). */
7255 (mult (POW:s @0 @1) (POW:s @0 @2))
7256 (POW @0 (plus @1 @2)))
7258 /* Simplify pow(x,y) * pow(z,y) -> pow(x*z,y). */
7260 (mult (POW:s @0 @1) (POW:s @2 @1))
7261 (POW (mult @0 @2) @1))
7263 /* Simplify powi(x,y) * powi(z,y) -> powi(x*z,y). */
7265 (mult (POWI:s @0 @1) (POWI:s @2 @1))
7266 (POWI (mult @0 @2) @1))
7268 /* Simplify pow(x,c) / x -> pow(x,c-1). */
7270 (rdiv (POW:s @0 REAL_CST@1) @0)
7271 (if (!TREE_OVERFLOW (@1))
7272 (POW @0 (minus @1 { build_one_cst (type); }))))
7274 /* Simplify x / pow (y,z) -> x * pow(y,-z). */
7276 (rdiv @0 (POW:s @1 @2))
7277 (mult @0 (POW @1 (negate @2))))
7282 /* sqrt(sqrt(x)) -> pow(x,1/4). */
7285 (pows @0 { build_real (type, dconst_quarter ()); }))
7286 /* sqrt(cbrt(x)) -> pow(x,1/6). */
7289 (pows @0 { build_real_truncate (type, dconst_sixth ()); }))
7290 /* cbrt(sqrt(x)) -> pow(x,1/6). */
7293 (pows @0 { build_real_truncate (type, dconst_sixth ()); }))
7294 /* cbrt(cbrt(x)) -> pow(x,1/9), iff x is nonnegative. */
7296 (cbrts (cbrts tree_expr_nonnegative_p@0))
7297 (pows @0 { build_real_truncate (type, dconst_ninth ()); }))
7298 /* sqrt(pow(x,y)) -> pow(|x|,y*0.5). */
7300 (sqrts (pows @0 @1))
7301 (pows (abs @0) (mult @1 { build_real (type, dconsthalf); })))
7302 /* cbrt(pow(x,y)) -> pow(x,y/3), iff x is nonnegative. */
7304 (cbrts (pows tree_expr_nonnegative_p@0 @1))
7305 (pows @0 (mult @1 { build_real_truncate (type, dconst_third ()); })))
7306 /* pow(sqrt(x),y) -> pow(x,y*0.5). */
7308 (pows (sqrts @0) @1)
7309 (pows @0 (mult @1 { build_real (type, dconsthalf); })))
7310 /* pow(cbrt(x),y) -> pow(x,y/3) iff x is nonnegative. */
7312 (pows (cbrts tree_expr_nonnegative_p@0) @1)
7313 (pows @0 (mult @1 { build_real_truncate (type, dconst_third ()); })))
7314 /* pow(pow(x,y),z) -> pow(x,y*z) iff x is nonnegative. */
7316 (pows (pows tree_expr_nonnegative_p@0 @1) @2)
7317 (pows @0 (mult @1 @2))))
7319 /* cabs(x+xi) -> fabs(x)*sqrt(2). */
7321 (CABS (complex @0 @0))
7322 (mult (abs @0) { build_real_truncate (type, dconst_sqrt2 ()); }))
7324 /* hypot(x,x) -> fabs(x)*sqrt(2). */
7327 (mult (abs @0) { build_real_truncate (type, dconst_sqrt2 ()); }))
7329 /* cexp(x+yi) -> exp(x)*cexpi(y). */
7334 (cexps compositional_complex@0)
7335 (if (targetm.libc_has_function (function_c99_math_complex, TREE_TYPE (@0)))
7337 (mult (exps@1 (realpart @0)) (realpart (cexpis:type@2 (imagpart @0))))
7338 (mult @1 (imagpart @2)))))))
7340 (if (canonicalize_math_p ())
7341 /* floor(x) -> trunc(x) if x is nonnegative. */
7342 (for floors (FLOOR_ALL)
7345 (floors tree_expr_nonnegative_p@0)
7348 (match double_value_p
7350 (if (TYPE_MAIN_VARIANT (TREE_TYPE (@0)) == double_type_node)))
7351 (for froms (BUILT_IN_TRUNCL
7363 /* truncl(extend(x)) -> extend(trunc(x)), etc., if x is a double. */
7364 (if (optimize && canonicalize_math_p ())
7366 (froms (convert double_value_p@0))
7367 (convert (tos @0)))))
7369 (match float_value_p
7371 (if (TYPE_MAIN_VARIANT (TREE_TYPE (@0)) == float_type_node)))
7372 (for froms (BUILT_IN_TRUNCL BUILT_IN_TRUNC
7373 BUILT_IN_FLOORL BUILT_IN_FLOOR
7374 BUILT_IN_CEILL BUILT_IN_CEIL
7375 BUILT_IN_ROUNDL BUILT_IN_ROUND
7376 BUILT_IN_NEARBYINTL BUILT_IN_NEARBYINT
7377 BUILT_IN_RINTL BUILT_IN_RINT)
7378 tos (BUILT_IN_TRUNCF BUILT_IN_TRUNCF
7379 BUILT_IN_FLOORF BUILT_IN_FLOORF
7380 BUILT_IN_CEILF BUILT_IN_CEILF
7381 BUILT_IN_ROUNDF BUILT_IN_ROUNDF
7382 BUILT_IN_NEARBYINTF BUILT_IN_NEARBYINTF
7383 BUILT_IN_RINTF BUILT_IN_RINTF)
7384 /* truncl(extend(x)) and trunc(extend(x)) -> extend(truncf(x)), etc.,
7386 (if (optimize && canonicalize_math_p ()
7387 && targetm.libc_has_function (function_c99_misc, NULL_TREE))
7389 (froms (convert float_value_p@0))
7390 (convert (tos @0)))))
7393 (match float16_value_p
7395 (if (TYPE_MAIN_VARIANT (TREE_TYPE (@0)) == float16_type_node)))
7396 (for froms (BUILT_IN_TRUNCL BUILT_IN_TRUNC BUILT_IN_TRUNCF
7397 BUILT_IN_FLOORL BUILT_IN_FLOOR BUILT_IN_FLOORF
7398 BUILT_IN_CEILL BUILT_IN_CEIL BUILT_IN_CEILF
7399 BUILT_IN_ROUNDEVENL BUILT_IN_ROUNDEVEN BUILT_IN_ROUNDEVENF
7400 BUILT_IN_ROUNDL BUILT_IN_ROUND BUILT_IN_ROUNDF
7401 BUILT_IN_NEARBYINTL BUILT_IN_NEARBYINT BUILT_IN_NEARBYINTF
7402 BUILT_IN_RINTL BUILT_IN_RINT BUILT_IN_RINTF
7403 BUILT_IN_SQRTL BUILT_IN_SQRT BUILT_IN_SQRTF)
7404 tos (IFN_TRUNC IFN_TRUNC IFN_TRUNC
7405 IFN_FLOOR IFN_FLOOR IFN_FLOOR
7406 IFN_CEIL IFN_CEIL IFN_CEIL
7407 IFN_ROUNDEVEN IFN_ROUNDEVEN IFN_ROUNDEVEN
7408 IFN_ROUND IFN_ROUND IFN_ROUND
7409 IFN_NEARBYINT IFN_NEARBYINT IFN_NEARBYINT
7410 IFN_RINT IFN_RINT IFN_RINT
7411 IFN_SQRT IFN_SQRT IFN_SQRT)
7412 /* (_Float16) round ((doube) x) -> __built_in_roundf16 (x), etc.,
7413 if x is a _Float16. */
7415 (convert (froms (convert float16_value_p@0)))
7417 && types_match (type, TREE_TYPE (@0))
7418 && direct_internal_fn_supported_p (as_internal_fn (tos),
7419 type, OPTIMIZE_FOR_BOTH))
7422 /* Simplify (trunc)copysign ((extend)x, (extend)y) to copysignf (x, y),
7423 x,y is float value, similar for _Float16/double. */
7424 (for copysigns (COPYSIGN_ALL)
7426 (convert (copysigns (convert@2 @0) (convert @1)))
7428 && !HONOR_SNANS (@2)
7429 && types_match (type, TREE_TYPE (@0))
7430 && types_match (type, TREE_TYPE (@1))
7431 && TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (@2))
7432 && direct_internal_fn_supported_p (IFN_COPYSIGN,
7433 type, OPTIMIZE_FOR_BOTH))
7434 (IFN_COPYSIGN @0 @1))))
7436 (for froms (BUILT_IN_FMAF BUILT_IN_FMA BUILT_IN_FMAL)
7437 tos (IFN_FMA IFN_FMA IFN_FMA)
7439 (convert (froms (convert@3 @0) (convert @1) (convert @2)))
7440 (if (flag_unsafe_math_optimizations
7442 && FLOAT_TYPE_P (type)
7443 && FLOAT_TYPE_P (TREE_TYPE (@3))
7444 && types_match (type, TREE_TYPE (@0))
7445 && types_match (type, TREE_TYPE (@1))
7446 && types_match (type, TREE_TYPE (@2))
7447 && TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (@3))
7448 && direct_internal_fn_supported_p (as_internal_fn (tos),
7449 type, OPTIMIZE_FOR_BOTH))
7452 (for maxmin (max min)
7454 (convert (maxmin (convert@2 @0) (convert @1)))
7456 && FLOAT_TYPE_P (type)
7457 && FLOAT_TYPE_P (TREE_TYPE (@2))
7458 && types_match (type, TREE_TYPE (@0))
7459 && types_match (type, TREE_TYPE (@1))
7460 && element_precision (type) < element_precision (TREE_TYPE (@2)))
7464 (for froms (XFLOORL XCEILL XROUNDL XRINTL)
7465 tos (XFLOOR XCEIL XROUND XRINT)
7466 /* llfloorl(extend(x)) -> llfloor(x), etc., if x is a double. */
7467 (if (optimize && canonicalize_math_p ())
7469 (froms (convert double_value_p@0))
7472 (for froms (XFLOORL XCEILL XROUNDL XRINTL
7473 XFLOOR XCEIL XROUND XRINT)
7474 tos (XFLOORF XCEILF XROUNDF XRINTF)
7475 /* llfloorl(extend(x)) and llfloor(extend(x)) -> llfloorf(x), etc.,
7477 (if (optimize && canonicalize_math_p ())
7479 (froms (convert float_value_p@0))
7482 (if (canonicalize_math_p ())
7483 /* xfloor(x) -> fix_trunc(x) if x is nonnegative. */
7484 (for floors (IFLOOR LFLOOR LLFLOOR)
7486 (floors tree_expr_nonnegative_p@0)
7489 (if (canonicalize_math_p ())
7490 /* xfloor(x) -> fix_trunc(x), etc., if x is integer valued. */
7491 (for fns (IFLOOR LFLOOR LLFLOOR
7493 IROUND LROUND LLROUND)
7495 (fns integer_valued_real_p@0)
7497 (if (!flag_errno_math)
7498 /* xrint(x) -> fix_trunc(x), etc., if x is integer valued. */
7499 (for rints (IRINT LRINT LLRINT)
7501 (rints integer_valued_real_p@0)
7504 (if (canonicalize_math_p ())
7505 (for ifn (IFLOOR ICEIL IROUND IRINT)
7506 lfn (LFLOOR LCEIL LROUND LRINT)
7507 llfn (LLFLOOR LLCEIL LLROUND LLRINT)
7508 /* Canonicalize iround (x) to lround (x) on ILP32 targets where
7509 sizeof (int) == sizeof (long). */
7510 (if (TYPE_PRECISION (integer_type_node)
7511 == TYPE_PRECISION (long_integer_type_node))
7514 (lfn:long_integer_type_node @0)))
7515 /* Canonicalize llround (x) to lround (x) on LP64 targets where
7516 sizeof (long long) == sizeof (long). */
7517 (if (TYPE_PRECISION (long_long_integer_type_node)
7518 == TYPE_PRECISION (long_integer_type_node))
7521 (lfn:long_integer_type_node @0)))))
7523 /* cproj(x) -> x if we're ignoring infinities. */
7526 (if (!HONOR_INFINITIES (type))
7529 /* If the real part is inf and the imag part is known to be
7530 nonnegative, return (inf + 0i). */
7532 (CPROJ (complex REAL_CST@0 tree_expr_nonnegative_p@1))
7533 (if (real_isinf (TREE_REAL_CST_PTR (@0)))
7534 { build_complex_inf (type, false); }))
7536 /* If the imag part is inf, return (inf+I*copysign(0,imag)). */
7538 (CPROJ (complex @0 REAL_CST@1))
7539 (if (real_isinf (TREE_REAL_CST_PTR (@1)))
7540 { build_complex_inf (type, TREE_REAL_CST_PTR (@1)->sign); }))
7546 (pows @0 REAL_CST@1)
7548 const REAL_VALUE_TYPE *value = TREE_REAL_CST_PTR (@1);
7549 REAL_VALUE_TYPE tmp;
7552 /* pow(x,0) -> 1. */
7553 (if (real_equal (value, &dconst0))
7554 { build_real (type, dconst1); })
7555 /* pow(x,1) -> x. */
7556 (if (real_equal (value, &dconst1))
7558 /* pow(x,-1) -> 1/x. */
7559 (if (real_equal (value, &dconstm1))
7560 (rdiv { build_real (type, dconst1); } @0))
7561 /* pow(x,0.5) -> sqrt(x). */
7562 (if (flag_unsafe_math_optimizations
7563 && canonicalize_math_p ()
7564 && real_equal (value, &dconsthalf))
7566 /* pow(x,1/3) -> cbrt(x). */
7567 (if (flag_unsafe_math_optimizations
7568 && canonicalize_math_p ()
7569 && (tmp = real_value_truncate (TYPE_MODE (type), dconst_third ()),
7570 real_equal (value, &tmp)))
7573 /* powi(1,x) -> 1. */
7575 (POWI real_onep@0 @1)
7579 (POWI @0 INTEGER_CST@1)
7581 /* powi(x,0) -> 1. */
7582 (if (wi::to_wide (@1) == 0)
7583 { build_real (type, dconst1); })
7584 /* powi(x,1) -> x. */
7585 (if (wi::to_wide (@1) == 1)
7587 /* powi(x,-1) -> 1/x. */
7588 (if (wi::to_wide (@1) == -1)
7589 (rdiv { build_real (type, dconst1); } @0))))
7591 /* Narrowing of arithmetic and logical operations.
7593 These are conceptually similar to the transformations performed for
7594 the C/C++ front-ends by shorten_binary_op and shorten_compare. Long
7595 term we want to move all that code out of the front-ends into here. */
7597 /* Convert (outertype)((innertype0)a+(innertype1)b)
7598 into ((newtype)a+(newtype)b) where newtype
7599 is the widest mode from all of these. */
7600 (for op (plus minus mult rdiv)
7602 (convert (op:s@0 (convert1?@3 @1) (convert2?@4 @2)))
7603 /* If we have a narrowing conversion of an arithmetic operation where
7604 both operands are widening conversions from the same type as the outer
7605 narrowing conversion. Then convert the innermost operands to a
7606 suitable unsigned type (to avoid introducing undefined behavior),
7607 perform the operation and convert the result to the desired type. */
7608 (if (INTEGRAL_TYPE_P (type)
7611 /* We check for type compatibility between @0 and @1 below,
7612 so there's no need to check that @2/@4 are integral types. */
7613 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
7614 && INTEGRAL_TYPE_P (TREE_TYPE (@3))
7615 /* The precision of the type of each operand must match the
7616 precision of the mode of each operand, similarly for the
7618 && type_has_mode_precision_p (TREE_TYPE (@1))
7619 && type_has_mode_precision_p (TREE_TYPE (@2))
7620 && type_has_mode_precision_p (type)
7621 /* The inner conversion must be a widening conversion. */
7622 && TYPE_PRECISION (TREE_TYPE (@3)) > TYPE_PRECISION (TREE_TYPE (@1))
7623 && types_match (@1, type)
7624 && (types_match (@1, @2)
7625 /* Or the second operand is const integer or converted const
7626 integer from valueize. */
7627 || poly_int_tree_p (@4)))
7628 (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
7629 (op @1 (convert @2))
7630 (with { tree utype = unsigned_type_for (TREE_TYPE (@1)); }
7631 (convert (op (convert:utype @1)
7632 (convert:utype @2)))))
7633 (if (FLOAT_TYPE_P (type)
7634 && DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0))
7635 == DECIMAL_FLOAT_TYPE_P (type))
7636 (with { tree arg0 = strip_float_extensions (@1);
7637 tree arg1 = strip_float_extensions (@2);
7638 tree itype = TREE_TYPE (@0);
7639 tree ty1 = TREE_TYPE (arg0);
7640 tree ty2 = TREE_TYPE (arg1);
7641 enum tree_code code = TREE_CODE (itype); }
7642 (if (FLOAT_TYPE_P (ty1)
7643 && FLOAT_TYPE_P (ty2))
7644 (with { tree newtype = type;
7645 if (TYPE_MODE (ty1) == SDmode
7646 || TYPE_MODE (ty2) == SDmode
7647 || TYPE_MODE (type) == SDmode)
7648 newtype = dfloat32_type_node;
7649 if (TYPE_MODE (ty1) == DDmode
7650 || TYPE_MODE (ty2) == DDmode
7651 || TYPE_MODE (type) == DDmode)
7652 newtype = dfloat64_type_node;
7653 if (TYPE_MODE (ty1) == TDmode
7654 || TYPE_MODE (ty2) == TDmode
7655 || TYPE_MODE (type) == TDmode)
7656 newtype = dfloat128_type_node; }
7657 (if ((newtype == dfloat32_type_node
7658 || newtype == dfloat64_type_node
7659 || newtype == dfloat128_type_node)
7661 && types_match (newtype, type))
7662 (op (convert:newtype @1) (convert:newtype @2))
7663 (with { if (element_precision (ty1) > element_precision (newtype))
7665 if (element_precision (ty2) > element_precision (newtype))
7667 /* Sometimes this transformation is safe (cannot
7668 change results through affecting double rounding
7669 cases) and sometimes it is not. If NEWTYPE is
7670 wider than TYPE, e.g. (float)((long double)double
7671 + (long double)double) converted to
7672 (float)(double + double), the transformation is
7673 unsafe regardless of the details of the types
7674 involved; double rounding can arise if the result
7675 of NEWTYPE arithmetic is a NEWTYPE value half way
7676 between two representable TYPE values but the
7677 exact value is sufficiently different (in the
7678 right direction) for this difference to be
7679 visible in ITYPE arithmetic. If NEWTYPE is the
7680 same as TYPE, however, the transformation may be
7681 safe depending on the types involved: it is safe
7682 if the ITYPE has strictly more than twice as many
7683 mantissa bits as TYPE, can represent infinities
7684 and NaNs if the TYPE can, and has sufficient
7685 exponent range for the product or ratio of two
7686 values representable in the TYPE to be within the
7687 range of normal values of ITYPE. */
7688 (if (element_precision (newtype) < element_precision (itype)
7689 && (!VECTOR_MODE_P (TYPE_MODE (newtype))
7690 || target_supports_op_p (newtype, op, optab_default))
7691 && (flag_unsafe_math_optimizations
7692 || (element_precision (newtype) == element_precision (type)
7693 && real_can_shorten_arithmetic (element_mode (itype),
7694 element_mode (type))
7695 && !excess_precision_type (newtype)))
7696 && !types_match (itype, newtype))
7697 (convert:type (op (convert:newtype @1)
7698 (convert:newtype @2)))
7703 /* This is another case of narrowing, specifically when there's an outer
7704 BIT_AND_EXPR which masks off bits outside the type of the innermost
7705 operands. Like the previous case we have to convert the operands
7706 to unsigned types to avoid introducing undefined behavior for the
7707 arithmetic operation. */
7708 (for op (minus plus)
7710 (bit_and (op:s (convert@2 @0) (convert@3 @1)) INTEGER_CST@4)
7711 (if (INTEGRAL_TYPE_P (type)
7712 /* We check for type compatibility between @0 and @1 below,
7713 so there's no need to check that @1/@3 are integral types. */
7714 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
7715 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
7716 /* The precision of the type of each operand must match the
7717 precision of the mode of each operand, similarly for the
7719 && type_has_mode_precision_p (TREE_TYPE (@0))
7720 && type_has_mode_precision_p (TREE_TYPE (@1))
7721 && type_has_mode_precision_p (type)
7722 /* The inner conversion must be a widening conversion. */
7723 && TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (TREE_TYPE (@0))
7724 && types_match (@0, @1)
7725 && (tree_int_cst_min_precision (@4, TYPE_SIGN (TREE_TYPE (@0)))
7726 <= TYPE_PRECISION (TREE_TYPE (@0)))
7727 && (wi::to_wide (@4)
7728 & wi::mask (TYPE_PRECISION (TREE_TYPE (@0)),
7729 true, TYPE_PRECISION (type))) == 0)
7730 (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
7731 (with { tree ntype = TREE_TYPE (@0); }
7732 (convert (bit_and (op @0 @1) (convert:ntype @4))))
7733 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
7734 (convert (bit_and (op (convert:utype @0) (convert:utype @1))
7735 (convert:utype @4))))))))
7737 /* Transform (@0 < @1 and @0 < @2) to use min,
7738 (@0 > @1 and @0 > @2) to use max */
7739 (for logic (bit_and bit_and bit_and bit_and bit_ior bit_ior bit_ior bit_ior)
7740 op (lt le gt ge lt le gt ge )
7741 ext (min min max max max max min min )
7743 (logic (op:cs @0 @1) (op:cs @0 @2))
7744 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
7745 && TREE_CODE (@0) != INTEGER_CST)
7746 (op @0 (ext @1 @2)))))
7748 /* Max<bool0, bool1> -> bool0 | bool1
7749 Min<bool0, bool1> -> bool0 & bool1 */
7751 logic (bit_ior bit_and)
7753 (op zero_one_valued_p@0 zero_one_valued_p@1)
7756 /* signbit(x) != 0 ? -x : x -> abs(x)
7757 signbit(x) == 0 ? -x : x -> -abs(x) */
7761 (cond (neeq (sign @0) integer_zerop) (negate @0) @0)
7762 (if (neeq == NE_EXPR)
7764 (negate (abs @0))))))
7767 /* signbit(x) -> 0 if x is nonnegative. */
7768 (SIGNBIT tree_expr_nonnegative_p@0)
7769 { integer_zero_node; })
7772 /* signbit(x) -> x<0 if x doesn't have signed zeros. */
7774 (if (!HONOR_SIGNED_ZEROS (@0))
7775 (convert (lt @0 { build_real (TREE_TYPE (@0), dconst0); }))))
7777 /* Transform comparisons of the form X +- C1 CMP C2 to X CMP C2 -+ C1. */
7779 (for op (plus minus)
7782 (cmp (op@3 @0 INTEGER_CST@1) INTEGER_CST@2)
7783 (if (!TREE_OVERFLOW (@1) && !TREE_OVERFLOW (@2)
7784 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0))
7785 && !TYPE_OVERFLOW_TRAPS (TREE_TYPE (@0))
7786 && !TYPE_SATURATING (TREE_TYPE (@0)))
7787 (with { tree res = int_const_binop (rop, @2, @1); }
7788 (if (TREE_OVERFLOW (res)
7789 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
7790 { constant_boolean_node (cmp == NE_EXPR, type); }
7791 (if (single_use (@3))
7792 (cmp @0 { TREE_OVERFLOW (res)
7793 ? drop_tree_overflow (res) : res; }))))))))
7794 (for cmp (lt le gt ge)
7795 (for op (plus minus)
7798 (cmp (op@3 @0 INTEGER_CST@1) INTEGER_CST@2)
7799 (if (!TREE_OVERFLOW (@1) && !TREE_OVERFLOW (@2)
7800 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
7801 (with { tree res = int_const_binop (rop, @2, @1); }
7802 (if (TREE_OVERFLOW (res))
7804 fold_overflow_warning (("assuming signed overflow does not occur "
7805 "when simplifying conditional to constant"),
7806 WARN_STRICT_OVERFLOW_CONDITIONAL);
7807 bool less = cmp == LE_EXPR || cmp == LT_EXPR;
7808 /* wi::ges_p (@2, 0) should be sufficient for a signed type. */
7809 bool ovf_high = wi::lt_p (wi::to_wide (@1), 0,
7810 TYPE_SIGN (TREE_TYPE (@1)))
7811 != (op == MINUS_EXPR);
7812 constant_boolean_node (less == ovf_high, type);
7814 (if (single_use (@3))
7817 fold_overflow_warning (("assuming signed overflow does not occur "
7818 "when changing X +- C1 cmp C2 to "
7820 WARN_STRICT_OVERFLOW_COMPARISON);
7822 (cmp @0 { res; })))))))))
7824 /* Canonicalizations of BIT_FIELD_REFs. */
7827 (BIT_FIELD_REF (BIT_FIELD_REF @0 @1 @2) @3 @4)
7828 (BIT_FIELD_REF @0 @3 { const_binop (PLUS_EXPR, bitsizetype, @2, @4); }))
7831 (BIT_FIELD_REF (view_convert @0) @1 @2)
7832 (BIT_FIELD_REF @0 @1 @2))
7835 (BIT_FIELD_REF @0 @1 integer_zerop)
7836 (if (tree_int_cst_equal (@1, TYPE_SIZE (TREE_TYPE (@0))))
7840 (BIT_FIELD_REF @0 @1 @2)
7842 (if (TREE_CODE (TREE_TYPE (@0)) == COMPLEX_TYPE
7843 && tree_int_cst_equal (@1, TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0)))))
7845 (if (integer_zerop (@2))
7846 (view_convert (realpart @0)))
7847 (if (tree_int_cst_equal (@2, TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0)))))
7848 (view_convert (imagpart @0)))))
7849 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
7850 && INTEGRAL_TYPE_P (type)
7851 /* On GIMPLE this should only apply to register arguments. */
7852 && (! GIMPLE || is_gimple_reg (@0))
7853 /* A bit-field-ref that referenced the full argument can be stripped. */
7854 && ((compare_tree_int (@1, TYPE_PRECISION (TREE_TYPE (@0))) == 0
7855 && integer_zerop (@2))
7856 /* Low-parts can be reduced to integral conversions.
7857 ??? The following doesn't work for PDP endian. */
7858 || (BYTES_BIG_ENDIAN == WORDS_BIG_ENDIAN
7859 /* But only do this after vectorization. */
7860 && canonicalize_math_after_vectorization_p ()
7861 /* Don't even think about BITS_BIG_ENDIAN. */
7862 && TYPE_PRECISION (TREE_TYPE (@0)) % BITS_PER_UNIT == 0
7863 && TYPE_PRECISION (type) % BITS_PER_UNIT == 0
7864 && compare_tree_int (@2, (BYTES_BIG_ENDIAN
7865 ? (TYPE_PRECISION (TREE_TYPE (@0))
7866 - TYPE_PRECISION (type))
7870 /* Simplify vector extracts. */
7873 (BIT_FIELD_REF CONSTRUCTOR@0 @1 @2)
7874 (if (VECTOR_TYPE_P (TREE_TYPE (@0))
7875 && tree_fits_uhwi_p (TYPE_SIZE (type))
7876 && ((tree_to_uhwi (TYPE_SIZE (type))
7877 == tree_to_uhwi (TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0)))))
7878 || (VECTOR_TYPE_P (type)
7879 && (tree_to_uhwi (TYPE_SIZE (TREE_TYPE (type)))
7880 == tree_to_uhwi (TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0))))))))
7883 tree ctor = (TREE_CODE (@0) == SSA_NAME
7884 ? gimple_assign_rhs1 (SSA_NAME_DEF_STMT (@0)) : @0);
7885 tree eltype = TREE_TYPE (TREE_TYPE (ctor));
7886 unsigned HOST_WIDE_INT width = tree_to_uhwi (TYPE_SIZE (eltype));
7887 unsigned HOST_WIDE_INT n = tree_to_uhwi (@1);
7888 unsigned HOST_WIDE_INT idx = tree_to_uhwi (@2);
7891 && (idx % width) == 0
7893 && known_le ((idx + n) / width,
7894 TYPE_VECTOR_SUBPARTS (TREE_TYPE (ctor))))
7899 /* Constructor elements can be subvectors. */
7901 if (CONSTRUCTOR_NELTS (ctor) != 0)
7903 tree cons_elem = TREE_TYPE (CONSTRUCTOR_ELT (ctor, 0)->value);
7904 if (TREE_CODE (cons_elem) == VECTOR_TYPE)
7905 k = TYPE_VECTOR_SUBPARTS (cons_elem);
7907 unsigned HOST_WIDE_INT elt, count, const_k;
7910 /* We keep an exact subset of the constructor elements. */
7911 (if (multiple_p (idx, k, &elt) && multiple_p (n, k, &count))
7912 (if (CONSTRUCTOR_NELTS (ctor) == 0)
7913 { build_zero_cst (type); }
7915 (if (elt < CONSTRUCTOR_NELTS (ctor))
7916 (view_convert { CONSTRUCTOR_ELT (ctor, elt)->value; })
7917 { build_zero_cst (type); })
7918 /* We don't want to emit new CTORs unless the old one goes away.
7919 ??? Eventually allow this if the CTOR ends up constant or
7921 (if (single_use (@0))
7924 vec<constructor_elt, va_gc> *vals;
7925 vec_alloc (vals, count);
7926 bool constant_p = true;
7928 for (unsigned i = 0;
7929 i < count && elt + i < CONSTRUCTOR_NELTS (ctor); ++i)
7931 tree e = CONSTRUCTOR_ELT (ctor, elt + i)->value;
7932 CONSTRUCTOR_APPEND_ELT (vals, NULL_TREE, e);
7933 if (!CONSTANT_CLASS_P (e))
7936 tree evtype = (types_match (TREE_TYPE (type),
7937 TREE_TYPE (TREE_TYPE (ctor)))
7939 : build_vector_type (TREE_TYPE (TREE_TYPE (ctor)),
7941 /* We used to build a CTOR in the non-constant case here
7942 but that's not a GIMPLE value. We'd have to expose this
7943 operation somehow so the code generation can properly
7944 split it out to a separate stmt. */
7945 res = (constant_p ? build_vector_from_ctor (evtype, vals)
7946 : (GIMPLE ? NULL_TREE : build_constructor (evtype, vals)));
7949 (view_convert { res; })))))))
7950 /* The bitfield references a single constructor element. */
7951 (if (k.is_constant (&const_k)
7952 && idx + n <= (idx / const_k + 1) * const_k)
7954 (if (CONSTRUCTOR_NELTS (ctor) <= idx / const_k)
7955 { build_zero_cst (type); })
7957 (view_convert { CONSTRUCTOR_ELT (ctor, idx / const_k)->value; }))
7958 (BIT_FIELD_REF { CONSTRUCTOR_ELT (ctor, idx / const_k)->value; }
7959 @1 { bitsize_int ((idx % const_k) * width); })))))))))
7961 /* Simplify a bit extraction from a bit insertion for the cases with
7962 the inserted element fully covering the extraction or the insertion
7963 not touching the extraction. */
7965 (BIT_FIELD_REF (bit_insert @0 @1 @ipos) @rsize @rpos)
7968 unsigned HOST_WIDE_INT isize;
7969 if (INTEGRAL_TYPE_P (TREE_TYPE (@1)))
7970 isize = TYPE_PRECISION (TREE_TYPE (@1));
7972 isize = tree_to_uhwi (TYPE_SIZE (TREE_TYPE (@1)));
7975 (if ((!INTEGRAL_TYPE_P (TREE_TYPE (@1))
7976 || type_has_mode_precision_p (TREE_TYPE (@1)))
7977 && wi::leu_p (wi::to_wide (@ipos), wi::to_wide (@rpos))
7978 && wi::leu_p (wi::to_wide (@rpos) + wi::to_wide (@rsize),
7979 wi::to_wide (@ipos) + isize))
7980 (BIT_FIELD_REF @1 @rsize { wide_int_to_tree (bitsizetype,
7982 - wi::to_wide (@ipos)); }))
7983 (if (wi::eq_p (wi::to_wide (@ipos), wi::to_wide (@rpos))
7984 && compare_tree_int (@rsize, isize) == 0)
7986 (if (wi::geu_p (wi::to_wide (@ipos),
7987 wi::to_wide (@rpos) + wi::to_wide (@rsize))
7988 || wi::geu_p (wi::to_wide (@rpos),
7989 wi::to_wide (@ipos) + isize))
7990 (BIT_FIELD_REF @0 @rsize @rpos)))))
7992 (if (canonicalize_math_after_vectorization_p ())
7995 (fmas:c (negate @0) @1 @2)
7996 (IFN_FNMA @0 @1 @2))
7998 (fmas @0 @1 (negate @2))
8001 (fmas:c (negate @0) @1 (negate @2))
8002 (IFN_FNMS @0 @1 @2))
8004 (negate (fmas@3 @0 @1 @2))
8005 (if (single_use (@3))
8006 (IFN_FNMS @0 @1 @2))))
8009 (IFN_FMS:c (negate @0) @1 @2)
8010 (IFN_FNMS @0 @1 @2))
8012 (IFN_FMS @0 @1 (negate @2))
8015 (IFN_FMS:c (negate @0) @1 (negate @2))
8016 (IFN_FNMA @0 @1 @2))
8018 (negate (IFN_FMS@3 @0 @1 @2))
8019 (if (single_use (@3))
8020 (IFN_FNMA @0 @1 @2)))
8023 (IFN_FNMA:c (negate @0) @1 @2)
8026 (IFN_FNMA @0 @1 (negate @2))
8027 (IFN_FNMS @0 @1 @2))
8029 (IFN_FNMA:c (negate @0) @1 (negate @2))
8032 (negate (IFN_FNMA@3 @0 @1 @2))
8033 (if (single_use (@3))
8034 (IFN_FMS @0 @1 @2)))
8037 (IFN_FNMS:c (negate @0) @1 @2)
8040 (IFN_FNMS @0 @1 (negate @2))
8041 (IFN_FNMA @0 @1 @2))
8043 (IFN_FNMS:c (negate @0) @1 (negate @2))
8046 (negate (IFN_FNMS@3 @0 @1 @2))
8047 (if (single_use (@3))
8048 (IFN_FMA @0 @1 @2))))
8050 /* CLZ simplifications. */
8055 (op (clz:s@2 @0) INTEGER_CST@1)
8056 (if (integer_zerop (@1) && single_use (@2))
8057 /* clz(X) == 0 is (int)X < 0 and clz(X) != 0 is (int)X >= 0. */
8058 (with { tree type0 = TREE_TYPE (@0);
8059 tree stype = signed_type_for (type0);
8060 HOST_WIDE_INT val = 0;
8061 /* Punt on hypothetical weird targets. */
8063 && CLZ_DEFINED_VALUE_AT_ZERO (SCALAR_TYPE_MODE (type0),
8069 (cmp (convert:stype @0) { build_zero_cst (stype); })))
8070 /* clz(X) == (prec-1) is X == 1 and clz(X) != (prec-1) is X != 1. */
8071 (with { bool ok = true;
8072 HOST_WIDE_INT val = 0;
8073 tree type0 = TREE_TYPE (@0);
8074 /* Punt on hypothetical weird targets. */
8076 && CLZ_DEFINED_VALUE_AT_ZERO (SCALAR_TYPE_MODE (type0),
8078 && val == TYPE_PRECISION (type0) - 1)
8081 (if (ok && wi::to_wide (@1) == (TYPE_PRECISION (type0) - 1))
8082 (op @0 { build_one_cst (type0); })))))))
8084 /* CTZ simplifications. */
8086 (for op (ge gt le lt)
8089 /* __builtin_ctz (x) >= C -> (x & ((1 << C) - 1)) == 0. */
8090 (op (ctz:s @0) INTEGER_CST@1)
8091 (with { bool ok = true;
8092 HOST_WIDE_INT val = 0;
8093 if (!tree_fits_shwi_p (@1))
8097 val = tree_to_shwi (@1);
8098 /* Canonicalize to >= or <. */
8099 if (op == GT_EXPR || op == LE_EXPR)
8101 if (val == HOST_WIDE_INT_MAX)
8107 bool zero_res = false;
8108 HOST_WIDE_INT zero_val = 0;
8109 tree type0 = TREE_TYPE (@0);
8110 int prec = TYPE_PRECISION (type0);
8112 && CTZ_DEFINED_VALUE_AT_ZERO (SCALAR_TYPE_MODE (type0),
8117 (if (ok && (!zero_res || zero_val >= val))
8118 { constant_boolean_node (cmp == EQ_EXPR ? true : false, type); })
8120 (if (ok && (!zero_res || zero_val < val))
8121 { constant_boolean_node (cmp == EQ_EXPR ? false : true, type); })
8122 (if (ok && (!zero_res || zero_val < 0 || zero_val >= prec))
8123 (cmp (bit_and @0 { wide_int_to_tree (type0,
8124 wi::mask (val, false, prec)); })
8125 { build_zero_cst (type0); })))))))
8128 /* __builtin_ctz (x) == C -> (x & ((1 << (C + 1)) - 1)) == (1 << C). */
8129 (op (ctz:s @0) INTEGER_CST@1)
8130 (with { bool zero_res = false;
8131 HOST_WIDE_INT zero_val = 0;
8132 tree type0 = TREE_TYPE (@0);
8133 int prec = TYPE_PRECISION (type0);
8135 && CTZ_DEFINED_VALUE_AT_ZERO (SCALAR_TYPE_MODE (type0),
8139 (if (tree_int_cst_sgn (@1) < 0 || wi::to_widest (@1) >= prec)
8140 (if (!zero_res || zero_val != wi::to_widest (@1))
8141 { constant_boolean_node (op == EQ_EXPR ? false : true, type); })
8142 (if (!zero_res || zero_val < 0 || zero_val >= prec)
8143 (op (bit_and @0 { wide_int_to_tree (type0,
8144 wi::mask (tree_to_uhwi (@1) + 1,
8146 { wide_int_to_tree (type0,
8147 wi::shifted_mask (tree_to_uhwi (@1), 1,
8148 false, prec)); })))))))
8150 /* POPCOUNT simplifications. */
8151 /* popcount(X) + popcount(Y) is popcount(X|Y) when X&Y must be zero. */
8153 (plus (POPCOUNT:s @0) (POPCOUNT:s @1))
8154 (if (INTEGRAL_TYPE_P (type)
8155 && wi::bit_and (tree_nonzero_bits (@0), tree_nonzero_bits (@1)) == 0)
8156 (POPCOUNT (bit_ior @0 @1))))
8158 /* popcount(X) == 0 is X == 0, and related (in)equalities. */
8159 (for popcount (POPCOUNT)
8160 (for cmp (le eq ne gt)
8163 (cmp (popcount @0) integer_zerop)
8164 (rep @0 { build_zero_cst (TREE_TYPE (@0)); }))))
8166 /* popcount(bswap(x)) is popcount(x). */
8167 (for popcount (POPCOUNT)
8168 (for bswap (BUILT_IN_BSWAP16 BUILT_IN_BSWAP32
8169 BUILT_IN_BSWAP64 BUILT_IN_BSWAP128)
8171 (popcount (convert?@0 (bswap:s@1 @2)))
8172 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
8173 && INTEGRAL_TYPE_P (TREE_TYPE (@1)))
8174 (with { tree type0 = TREE_TYPE (@0);
8175 tree type1 = TREE_TYPE (@1);
8176 unsigned int prec0 = TYPE_PRECISION (type0);
8177 unsigned int prec1 = TYPE_PRECISION (type1); }
8178 (if (prec0 == prec1 || (prec0 > prec1 && TYPE_UNSIGNED (type1)))
8179 (popcount (convert:type0 (convert:type1 @2)))))))))
8181 /* popcount(rotate(X Y)) is popcount(X). */
8182 (for popcount (POPCOUNT)
8183 (for rot (lrotate rrotate)
8185 (popcount (convert?@0 (rot:s@1 @2 @3)))
8186 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
8187 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
8188 && (GIMPLE || !TREE_SIDE_EFFECTS (@3)))
8189 (with { tree type0 = TREE_TYPE (@0);
8190 tree type1 = TREE_TYPE (@1);
8191 unsigned int prec0 = TYPE_PRECISION (type0);
8192 unsigned int prec1 = TYPE_PRECISION (type1); }
8193 (if (prec0 == prec1 || (prec0 > prec1 && TYPE_UNSIGNED (type1)))
8194 (popcount (convert:type0 @2))))))))
8196 /* Canonicalize POPCOUNT(x)&1 as PARITY(X). */
8198 (bit_and (POPCOUNT @0) integer_onep)
8201 /* popcount(X&Y) + popcount(X|Y) is popcount(x) + popcount(Y). */
8203 (plus:c (POPCOUNT:s (bit_and:s @0 @1)) (POPCOUNT:s (bit_ior:cs @0 @1)))
8204 (plus (POPCOUNT @0) (POPCOUNT @1)))
8206 /* popcount(X) + popcount(Y) - popcount(X&Y) is popcount(X|Y). */
8207 /* popcount(X) + popcount(Y) - popcount(X|Y) is popcount(X&Y). */
8208 (for popcount (POPCOUNT)
8209 (for log1 (bit_and bit_ior)
8210 log2 (bit_ior bit_and)
8212 (minus (plus:s (popcount:s @0) (popcount:s @1))
8213 (popcount:s (log1:cs @0 @1)))
8214 (popcount (log2 @0 @1)))
8216 (plus:c (minus:s (popcount:s @0) (popcount:s (log1:cs @0 @1)))
8218 (popcount (log2 @0 @1)))))
8220 /* PARITY simplifications. */
8221 /* parity(~X) is parity(X). */
8223 (PARITY (bit_not @0))
8226 /* parity(bswap(x)) is parity(x). */
8227 (for parity (PARITY)
8228 (for bswap (BUILT_IN_BSWAP16 BUILT_IN_BSWAP32
8229 BUILT_IN_BSWAP64 BUILT_IN_BSWAP128)
8231 (parity (convert?@0 (bswap:s@1 @2)))
8232 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
8233 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
8234 && TYPE_PRECISION (TREE_TYPE (@0))
8235 >= TYPE_PRECISION (TREE_TYPE (@1)))
8236 (with { tree type0 = TREE_TYPE (@0);
8237 tree type1 = TREE_TYPE (@1); }
8238 (parity (convert:type0 (convert:type1 @2))))))))
8240 /* parity(rotate(X Y)) is parity(X). */
8241 (for parity (PARITY)
8242 (for rot (lrotate rrotate)
8244 (parity (convert?@0 (rot:s@1 @2 @3)))
8245 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
8246 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
8247 && (GIMPLE || !TREE_SIDE_EFFECTS (@3))
8248 && TYPE_PRECISION (TREE_TYPE (@0))
8249 >= TYPE_PRECISION (TREE_TYPE (@1)))
8250 (with { tree type0 = TREE_TYPE (@0); }
8251 (parity (convert:type0 @2)))))))
8253 /* parity(X)^parity(Y) is parity(X^Y). */
8255 (bit_xor (PARITY:s @0) (PARITY:s @1))
8256 (PARITY (bit_xor @0 @1)))
8258 /* a != 0 ? FUN(a) : 0 -> Fun(a) for some builtin functions. */
8259 (for func (POPCOUNT BSWAP FFS PARITY)
8261 (cond (ne @0 integer_zerop@1) (func@3 (convert? @0)) integer_zerop@2)
8264 /* a != 0 ? FUN(a) : CST -> Fun(a) for some CLRSB builtins
8265 where CST is precision-1. */
8268 (cond (ne @0 integer_zerop@1) (func@4 (convert?@3 @0)) INTEGER_CST@2)
8269 (if (wi::to_widest (@2) == TYPE_PRECISION (TREE_TYPE (@3)) - 1)
8273 /* a != 0 ? CLZ(a) : CST -> .CLZ(a) where CST is the result of the internal function for 0. */
8276 (cond (ne @0 integer_zerop@1) (func (convert?@3 @0)) INTEGER_CST@2)
8278 internal_fn ifn = IFN_LAST;
8279 if (direct_internal_fn_supported_p (IFN_CLZ, type, OPTIMIZE_FOR_BOTH)
8280 && CLZ_DEFINED_VALUE_AT_ZERO (SCALAR_INT_TYPE_MODE (type),
8284 (if (ifn == IFN_CLZ && wi::to_widest (@2) == val)
8287 /* a != 0 ? CTZ(a) : CST -> .CTZ(a) where CST is the result of the internal function for 0. */
8290 (cond (ne @0 integer_zerop@1) (func (convert?@3 @0)) INTEGER_CST@2)
8292 internal_fn ifn = IFN_LAST;
8293 if (direct_internal_fn_supported_p (IFN_CTZ, type, OPTIMIZE_FOR_BOTH)
8294 && CTZ_DEFINED_VALUE_AT_ZERO (SCALAR_INT_TYPE_MODE (type),
8298 (if (ifn == IFN_CTZ && wi::to_widest (@2) == val)
8302 /* Common POPCOUNT/PARITY simplifications. */
8303 /* popcount(X&C1) is (X>>C2)&1 when C1 == 1<<C2. Same for parity(X&C1). */
8304 (for pfun (POPCOUNT PARITY)
8307 (if (INTEGRAL_TYPE_P (type))
8308 (with { wide_int nz = tree_nonzero_bits (@0); }
8312 (if (wi::popcount (nz) == 1)
8313 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
8314 (convert (rshift:utype (convert:utype @0)
8315 { build_int_cst (integer_type_node,
8316 wi::ctz (nz)); })))))))))
8319 /* 64- and 32-bits branchless implementations of popcount are detected:
8321 int popcount64c (uint64_t x)
8323 x -= (x >> 1) & 0x5555555555555555ULL;
8324 x = (x & 0x3333333333333333ULL) + ((x >> 2) & 0x3333333333333333ULL);
8325 x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0fULL;
8326 return (x * 0x0101010101010101ULL) >> 56;
8329 int popcount32c (uint32_t x)
8331 x -= (x >> 1) & 0x55555555;
8332 x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
8333 x = (x + (x >> 4)) & 0x0f0f0f0f;
8334 return (x * 0x01010101) >> 24;
8341 (rshift @8 INTEGER_CST@5)
8343 (bit_and @6 INTEGER_CST@7)
8347 (bit_and (rshift @0 INTEGER_CST@4) INTEGER_CST@11))
8353 /* Check constants and optab. */
8354 (with { unsigned prec = TYPE_PRECISION (type);
8355 int shift = (64 - prec) & 63;
8356 unsigned HOST_WIDE_INT c1
8357 = HOST_WIDE_INT_UC (0x0101010101010101) >> shift;
8358 unsigned HOST_WIDE_INT c2
8359 = HOST_WIDE_INT_UC (0x0F0F0F0F0F0F0F0F) >> shift;
8360 unsigned HOST_WIDE_INT c3
8361 = HOST_WIDE_INT_UC (0x3333333333333333) >> shift;
8362 unsigned HOST_WIDE_INT c4
8363 = HOST_WIDE_INT_UC (0x5555555555555555) >> shift;
8368 && TYPE_UNSIGNED (type)
8369 && integer_onep (@4)
8370 && wi::to_widest (@10) == 2
8371 && wi::to_widest (@5) == 4
8372 && wi::to_widest (@1) == prec - 8
8373 && tree_to_uhwi (@2) == c1
8374 && tree_to_uhwi (@3) == c2
8375 && tree_to_uhwi (@9) == c3
8376 && tree_to_uhwi (@7) == c3
8377 && tree_to_uhwi (@11) == c4)
8378 (if (direct_internal_fn_supported_p (IFN_POPCOUNT, type,
8380 (convert (IFN_POPCOUNT:type @0))
8381 /* Try to do popcount in two halves. PREC must be at least
8382 five bits for this to work without extension before adding. */
8384 tree half_type = NULL_TREE;
8385 opt_machine_mode m = mode_for_size ((prec + 1) / 2, MODE_INT, 1);
8388 && m.require () != TYPE_MODE (type))
8390 half_prec = GET_MODE_PRECISION (as_a <scalar_int_mode> (m));
8391 half_type = build_nonstandard_integer_type (half_prec, 1);
8393 gcc_assert (half_prec > 2);
8395 (if (half_type != NULL_TREE
8396 && direct_internal_fn_supported_p (IFN_POPCOUNT, half_type,
8399 (IFN_POPCOUNT:half_type (convert @0))
8400 (IFN_POPCOUNT:half_type (convert (rshift @0
8401 { build_int_cst (integer_type_node, half_prec); } )))))))))))
8403 /* __builtin_ffs needs to deal on many targets with the possible zero
8404 argument. If we know the argument is always non-zero, __builtin_ctz + 1
8405 should lead to better code. */
8407 (FFS tree_expr_nonzero_p@0)
8408 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
8409 && direct_internal_fn_supported_p (IFN_CTZ, TREE_TYPE (@0),
8410 OPTIMIZE_FOR_SPEED))
8411 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
8412 (plus (CTZ:type (convert:utype @0)) { build_one_cst (type); }))))
8415 (for ffs (BUILT_IN_FFS BUILT_IN_FFSL BUILT_IN_FFSLL
8417 /* __builtin_ffs (X) == 0 -> X == 0.
8418 __builtin_ffs (X) == 6 -> (X & 63) == 32. */
8421 (cmp (ffs@2 @0) INTEGER_CST@1)
8422 (with { int prec = TYPE_PRECISION (TREE_TYPE (@0)); }
8424 (if (integer_zerop (@1))
8425 (cmp @0 { build_zero_cst (TREE_TYPE (@0)); }))
8426 (if (tree_int_cst_sgn (@1) < 0 || wi::to_widest (@1) > prec)
8427 { constant_boolean_node (cmp == NE_EXPR ? true : false, type); })
8428 (if (single_use (@2))
8429 (cmp (bit_and @0 { wide_int_to_tree (TREE_TYPE (@0),
8430 wi::mask (tree_to_uhwi (@1),
8432 { wide_int_to_tree (TREE_TYPE (@0),
8433 wi::shifted_mask (tree_to_uhwi (@1) - 1, 1,
8434 false, prec)); }))))))
8436 /* __builtin_ffs (X) > 6 -> X != 0 && (X & 63) == 0. */
8440 bit_op (bit_and bit_ior)
8442 (cmp (ffs@2 @0) INTEGER_CST@1)
8443 (with { int prec = TYPE_PRECISION (TREE_TYPE (@0)); }
8445 (if (integer_zerop (@1))
8446 (cmp2 @0 { build_zero_cst (TREE_TYPE (@0)); }))
8447 (if (tree_int_cst_sgn (@1) < 0)
8448 { constant_boolean_node (cmp == GT_EXPR ? true : false, type); })
8449 (if (wi::to_widest (@1) >= prec)
8450 { constant_boolean_node (cmp == GT_EXPR ? false : true, type); })
8451 (if (wi::to_widest (@1) == prec - 1)
8452 (cmp3 @0 { wide_int_to_tree (TREE_TYPE (@0),
8453 wi::shifted_mask (prec - 1, 1,
8455 (if (single_use (@2))
8456 (bit_op (cmp2 @0 { build_zero_cst (TREE_TYPE (@0)); })
8458 { wide_int_to_tree (TREE_TYPE (@0),
8459 wi::mask (tree_to_uhwi (@1),
8461 { build_zero_cst (TREE_TYPE (@0)); }))))))))
8468 --> r = .COND_FN (cond, a, b)
8472 --> r = .COND_FN (~cond, b, a). */
8474 (for uncond_op (UNCOND_UNARY)
8475 cond_op (COND_UNARY)
8477 (vec_cond @0 (view_convert? (uncond_op@3 @1)) @2)
8478 (with { tree op_type = TREE_TYPE (@3); }
8479 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
8480 && is_truth_type_for (op_type, TREE_TYPE (@0)))
8481 (cond_op @0 @1 @2))))
8483 (vec_cond @0 @1 (view_convert? (uncond_op@3 @2)))
8484 (with { tree op_type = TREE_TYPE (@3); }
8485 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
8486 && is_truth_type_for (op_type, TREE_TYPE (@0)))
8487 (cond_op (bit_not @0) @2 @1)))))
8489 /* `(a ? -1 : 0) ^ b` can be converted into a conditional not. */
8491 (bit_xor:c (vec_cond @0 uniform_integer_cst_p@1 uniform_integer_cst_p@2) @3)
8492 (if (canonicalize_math_after_vectorization_p ()
8493 && vectorized_internal_fn_supported_p (IFN_COND_NOT, type)
8494 && is_truth_type_for (type, TREE_TYPE (@0)))
8495 (if (integer_all_onesp (@1) && integer_zerop (@2))
8496 (IFN_COND_NOT @0 @3 @3))
8497 (if (integer_all_onesp (@2) && integer_zerop (@1))
8498 (IFN_COND_NOT (bit_not @0) @3 @3))))
8507 r = c ? a1 op a2 : b;
8509 if the target can do it in one go. This makes the operation conditional
8510 on c, so could drop potentially-trapping arithmetic, but that's a valid
8511 simplification if the result of the operation isn't needed.
8513 Avoid speculatively generating a stand-alone vector comparison
8514 on targets that might not support them. Any target implementing
8515 conditional internal functions must support the same comparisons
8516 inside and outside a VEC_COND_EXPR. */
8518 (for uncond_op (UNCOND_BINARY)
8519 cond_op (COND_BINARY)
8521 (vec_cond @0 (view_convert? (uncond_op@4 @1 @2)) @3)
8522 (with { tree op_type = TREE_TYPE (@4); }
8523 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
8524 && is_truth_type_for (op_type, TREE_TYPE (@0))
8526 (view_convert (cond_op @0 @1 @2 (view_convert:op_type @3))))))
8528 (vec_cond @0 @1 (view_convert? (uncond_op@4 @2 @3)))
8529 (with { tree op_type = TREE_TYPE (@4); }
8530 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
8531 && is_truth_type_for (op_type, TREE_TYPE (@0))
8533 (view_convert (cond_op (bit_not @0) @2 @3 (view_convert:op_type @1)))))))
8535 /* Same for ternary operations. */
8536 (for uncond_op (UNCOND_TERNARY)
8537 cond_op (COND_TERNARY)
8539 (vec_cond @0 (view_convert? (uncond_op@5 @1 @2 @3)) @4)
8540 (with { tree op_type = TREE_TYPE (@5); }
8541 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
8542 && is_truth_type_for (op_type, TREE_TYPE (@0))
8544 (view_convert (cond_op @0 @1 @2 @3 (view_convert:op_type @4))))))
8546 (vec_cond @0 @1 (view_convert? (uncond_op@5 @2 @3 @4)))
8547 (with { tree op_type = TREE_TYPE (@5); }
8548 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
8549 && is_truth_type_for (op_type, TREE_TYPE (@0))
8551 (view_convert (cond_op (bit_not @0) @2 @3 @4
8552 (view_convert:op_type @1)))))))
8555 /* Detect cases in which a VEC_COND_EXPR effectively replaces the
8556 "else" value of an IFN_COND_*. */
8557 (for cond_op (COND_BINARY)
8559 (vec_cond @0 (view_convert? (cond_op @0 @1 @2 @3)) @4)
8560 (with { tree op_type = TREE_TYPE (@3); }
8561 (if (element_precision (type) == element_precision (op_type))
8562 (view_convert (cond_op @0 @1 @2 (view_convert:op_type @4))))))
8564 (vec_cond @0 @1 (view_convert? (cond_op @2 @3 @4 @5)))
8565 (with { tree op_type = TREE_TYPE (@5); }
8566 (if (inverse_conditions_p (@0, @2)
8567 && element_precision (type) == element_precision (op_type))
8568 (view_convert (cond_op @2 @3 @4 (view_convert:op_type @1)))))))
8570 /* Same for ternary operations. */
8571 (for cond_op (COND_TERNARY)
8573 (vec_cond @0 (view_convert? (cond_op @0 @1 @2 @3 @4)) @5)
8574 (with { tree op_type = TREE_TYPE (@4); }
8575 (if (element_precision (type) == element_precision (op_type))
8576 (view_convert (cond_op @0 @1 @2 @3 (view_convert:op_type @5))))))
8578 (vec_cond @0 @1 (view_convert? (cond_op @2 @3 @4 @5 @6)))
8579 (with { tree op_type = TREE_TYPE (@6); }
8580 (if (inverse_conditions_p (@0, @2)
8581 && element_precision (type) == element_precision (op_type))
8582 (view_convert (cond_op @2 @3 @4 @5 (view_convert:op_type @1)))))))
8584 /* Detect simplication for a conditional reduction where
8587 c = mask2 ? d + a : d
8591 c = mask1 && mask2 ? d + b : d. */
8593 (IFN_COND_ADD @0 @1 (vec_cond @2 @3 integer_zerop) @1)
8594 (IFN_COND_ADD (bit_and @0 @2) @1 @3 @1))
8596 /* For pointers @0 and @2 and nonnegative constant offset @1, look for
8599 A: (@0 + @1 < @2) | (@2 + @1 < @0)
8600 B: (@0 + @1 <= @2) | (@2 + @1 <= @0)
8602 If pointers are known not to wrap, B checks whether @1 bytes starting
8603 at @0 and @2 do not overlap, while A tests the same thing for @1 + 1
8604 bytes. A is more efficiently tested as:
8606 A: (sizetype) (@0 + @1 - @2) > @1 * 2
8608 The equivalent expression for B is given by replacing @1 with @1 - 1:
8610 B: (sizetype) (@0 + (@1 - 1) - @2) > (@1 - 1) * 2
8612 @0 and @2 can be swapped in both expressions without changing the result.
8614 The folds rely on sizetype's being unsigned (which is always true)
8615 and on its being the same width as the pointer (which we have to check).
8617 The fold replaces two pointer_plus expressions, two comparisons and
8618 an IOR with a pointer_plus, a pointer_diff, and a comparison, so in
8619 the best case it's a saving of two operations. The A fold retains one
8620 of the original pointer_pluses, so is a win even if both pointer_pluses
8621 are used elsewhere. The B fold is a wash if both pointer_pluses are
8622 used elsewhere, since all we end up doing is replacing a comparison with
8623 a pointer_plus. We do still apply the fold under those circumstances
8624 though, in case applying it to other conditions eventually makes one of the
8625 pointer_pluses dead. */
8626 (for ior (truth_orif truth_or bit_ior)
8629 (ior (cmp:cs (pointer_plus@3 @0 INTEGER_CST@1) @2)
8630 (cmp:cs (pointer_plus@4 @2 @1) @0))
8631 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
8632 && TYPE_OVERFLOW_WRAPS (sizetype)
8633 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (sizetype))
8634 /* Calculate the rhs constant. */
8635 (with { offset_int off = wi::to_offset (@1) - (cmp == LE_EXPR ? 1 : 0);
8636 offset_int rhs = off * 2; }
8637 /* Always fails for negative values. */
8638 (if (wi::min_precision (rhs, UNSIGNED) <= TYPE_PRECISION (sizetype))
8639 /* Since the order of @0 and @2 doesn't matter, let tree_swap_operands_p
8640 pick a canonical order. This increases the chances of using the
8641 same pointer_plus in multiple checks. */
8642 (with { bool swap_p = tree_swap_operands_p (@0, @2);
8643 tree rhs_tree = wide_int_to_tree (sizetype, rhs); }
8644 (if (cmp == LT_EXPR)
8645 (gt (convert:sizetype
8646 (pointer_diff:ssizetype { swap_p ? @4 : @3; }
8647 { swap_p ? @0 : @2; }))
8649 (gt (convert:sizetype
8650 (pointer_diff:ssizetype
8651 (pointer_plus { swap_p ? @2 : @0; }
8652 { wide_int_to_tree (sizetype, off); })
8653 { swap_p ? @0 : @2; }))
8654 { rhs_tree; })))))))))
8656 /* Fold REDUC (@0 & @1) -> @0[I] & @1[I] if element I is the only nonzero
8658 (for reduc (IFN_REDUC_PLUS IFN_REDUC_IOR IFN_REDUC_XOR)
8659 (simplify (reduc (view_convert? (bit_and @0 VECTOR_CST@1)))
8660 (with { int i = single_nonzero_element (@1); }
8662 (with { tree elt = vector_cst_elt (@1, i);
8663 tree elt_type = TREE_TYPE (elt);
8664 unsigned int elt_bits = tree_to_uhwi (TYPE_SIZE (elt_type));
8665 tree size = bitsize_int (elt_bits);
8666 tree pos = bitsize_int (elt_bits * i); }
8669 (BIT_FIELD_REF:elt_type @0 { size; } { pos; })
8672 /* Fold reduction of a single nonzero element constructor. */
8673 (for reduc (IFN_REDUC_PLUS IFN_REDUC_IOR IFN_REDUC_XOR)
8674 (simplify (reduc (CONSTRUCTOR@0))
8675 (with { tree ctor = (TREE_CODE (@0) == SSA_NAME
8676 ? gimple_assign_rhs1 (SSA_NAME_DEF_STMT (@0)) : @0);
8677 tree elt = ctor_single_nonzero_element (ctor); }
8679 && !HONOR_SNANS (type)
8680 && !HONOR_SIGNED_ZEROS (type))
8683 /* Fold REDUC (@0 op VECTOR_CST) as REDUC (@0) op REDUC (VECTOR_CST). */
8684 (for reduc (IFN_REDUC_PLUS IFN_REDUC_MAX IFN_REDUC_MIN IFN_REDUC_FMAX
8685 IFN_REDUC_FMIN IFN_REDUC_AND IFN_REDUC_IOR IFN_REDUC_XOR)
8686 op (plus max min IFN_FMAX IFN_FMIN bit_and bit_ior bit_xor)
8687 (simplify (reduc (op @0 VECTOR_CST@1))
8688 (op (reduc:type @0) (reduc:type @1))))
8690 /* Simplify vector floating point operations of alternating sub/add pairs
8691 into using an fneg of a wider element type followed by a normal add.
8692 under IEEE 754 the fneg of the wider type will negate every even entry
8693 and when doing an add we get a sub of the even and add of every odd
8695 (for plusminus (plus minus)
8696 minusplus (minus plus)
8698 (vec_perm (plusminus @0 @1) (minusplus @2 @3) VECTOR_CST@4)
8699 (if (!VECTOR_INTEGER_TYPE_P (type)
8700 && !FLOAT_WORDS_BIG_ENDIAN
8701 /* plus is commutative, while minus is not, so :c can't be used.
8702 Do equality comparisons by hand and at the end pick the operands
8704 && (operand_equal_p (@0, @2, 0)
8705 ? operand_equal_p (@1, @3, 0)
8706 : operand_equal_p (@0, @3, 0) && operand_equal_p (@1, @2, 0)))
8709 /* Build a vector of integers from the tree mask. */
8710 vec_perm_builder builder;
8712 (if (tree_to_vec_perm_builder (&builder, @4))
8715 /* Create a vec_perm_indices for the integer vector. */
8716 poly_uint64 nelts = TYPE_VECTOR_SUBPARTS (type);
8717 vec_perm_indices sel (builder, 2, nelts);
8718 machine_mode vec_mode = TYPE_MODE (type);
8719 machine_mode wide_mode;
8720 scalar_mode wide_elt_mode;
8721 poly_uint64 wide_nunits;
8722 scalar_mode inner_mode = GET_MODE_INNER (vec_mode);
8724 (if (VECTOR_MODE_P (vec_mode)
8725 && sel.series_p (0, 2, 0, 2)
8726 && sel.series_p (1, 2, nelts + 1, 2)
8727 && GET_MODE_2XWIDER_MODE (inner_mode).exists (&wide_elt_mode)
8728 && multiple_p (GET_MODE_NUNITS (vec_mode), 2, &wide_nunits)
8729 && related_vector_mode (vec_mode, wide_elt_mode,
8730 wide_nunits).exists (&wide_mode))
8734 = lang_hooks.types.type_for_mode (GET_MODE_INNER (wide_mode),
8735 TYPE_UNSIGNED (type));
8736 tree ntype = build_vector_type_for_mode (stype, wide_mode);
8738 /* The format has to be a non-extended ieee format. */
8739 const struct real_format *fmt_old = FLOAT_MODE_FORMAT (vec_mode);
8740 const struct real_format *fmt_new = FLOAT_MODE_FORMAT (wide_mode);
8742 (if (TYPE_MODE (stype) != BLKmode
8743 && VECTOR_TYPE_P (ntype)
8748 /* If the target doesn't support v1xx vectors, try using
8749 scalar mode xx instead. */
8750 if (known_eq (GET_MODE_NUNITS (wide_mode), 1)
8751 && !target_supports_op_p (ntype, NEGATE_EXPR, optab_vector))
8754 (if (fmt_new->signbit_rw
8755 == fmt_old->signbit_rw + GET_MODE_UNIT_BITSIZE (vec_mode)
8756 && fmt_new->signbit_rw == fmt_new->signbit_ro
8757 && targetm.can_change_mode_class (TYPE_MODE (ntype),
8758 TYPE_MODE (type), ALL_REGS)
8759 && ((optimize_vectors_before_lowering_p ()
8760 && VECTOR_TYPE_P (ntype))
8761 || target_supports_op_p (ntype, NEGATE_EXPR, optab_vector)))
8762 (if (plusminus == PLUS_EXPR)
8763 (plus (view_convert:type (negate (view_convert:ntype @3))) @2)
8764 (minus @0 (view_convert:type
8765 (negate (view_convert:ntype @1))))))))))))))))
8768 (vec_perm @0 @1 VECTOR_CST@2)
8771 tree op0 = @0, op1 = @1, op2 = @2;
8772 machine_mode result_mode = TYPE_MODE (type);
8773 machine_mode op_mode = TYPE_MODE (TREE_TYPE (op0));
8775 /* Build a vector of integers from the tree mask. */
8776 vec_perm_builder builder;
8778 (if (tree_to_vec_perm_builder (&builder, op2))
8781 /* Create a vec_perm_indices for the integer vector. */
8782 poly_uint64 nelts = TYPE_VECTOR_SUBPARTS (type);
8783 bool single_arg = (op0 == op1);
8784 vec_perm_indices sel (builder, single_arg ? 1 : 2, nelts);
8786 (if (sel.series_p (0, 1, 0, 1))
8788 (if (sel.series_p (0, 1, nelts, 1))
8794 if (sel.all_from_input_p (0))
8796 else if (sel.all_from_input_p (1))
8799 sel.rotate_inputs (1);
8801 else if (known_ge (poly_uint64 (sel[0]), nelts))
8803 std::swap (op0, op1);
8804 sel.rotate_inputs (1);
8808 tree cop0 = op0, cop1 = op1;
8809 if (TREE_CODE (op0) == SSA_NAME
8810 && (def = dyn_cast <gassign *> (SSA_NAME_DEF_STMT (op0)))
8811 && gimple_assign_rhs_code (def) == CONSTRUCTOR)
8812 cop0 = gimple_assign_rhs1 (def);
8813 if (TREE_CODE (op1) == SSA_NAME
8814 && (def = dyn_cast <gassign *> (SSA_NAME_DEF_STMT (op1)))
8815 && gimple_assign_rhs_code (def) == CONSTRUCTOR)
8816 cop1 = gimple_assign_rhs1 (def);
8819 (if ((TREE_CODE (cop0) == VECTOR_CST
8820 || TREE_CODE (cop0) == CONSTRUCTOR)
8821 && (TREE_CODE (cop1) == VECTOR_CST
8822 || TREE_CODE (cop1) == CONSTRUCTOR)
8823 && (t = fold_vec_perm (type, cop0, cop1, sel)))
8827 bool changed = (op0 == op1 && !single_arg);
8828 tree ins = NULL_TREE;
8831 /* See if the permutation is performing a single element
8832 insert from a CONSTRUCTOR or constant and use a BIT_INSERT_EXPR
8833 in that case. But only if the vector mode is supported,
8834 otherwise this is invalid GIMPLE. */
8835 if (op_mode != BLKmode
8836 && (TREE_CODE (cop0) == VECTOR_CST
8837 || TREE_CODE (cop0) == CONSTRUCTOR
8838 || TREE_CODE (cop1) == VECTOR_CST
8839 || TREE_CODE (cop1) == CONSTRUCTOR))
8841 bool insert_first_p = sel.series_p (1, 1, nelts + 1, 1);
8844 /* After canonicalizing the first elt to come from the
8845 first vector we only can insert the first elt from
8846 the first vector. */
8848 if ((ins = fold_read_from_vector (cop0, sel[0])))
8851 /* The above can fail for two-element vectors which always
8852 appear to insert the first element, so try inserting
8853 into the second lane as well. For more than two
8854 elements that's wasted time. */
8855 if (!insert_first_p || (!ins && maybe_eq (nelts, 2u)))
8857 unsigned int encoded_nelts = sel.encoding ().encoded_nelts ();
8858 for (at = 0; at < encoded_nelts; ++at)
8859 if (maybe_ne (sel[at], at))
8861 if (at < encoded_nelts
8862 && (known_eq (at + 1, nelts)
8863 || sel.series_p (at + 1, 1, at + 1, 1)))
8865 if (known_lt (poly_uint64 (sel[at]), nelts))
8866 ins = fold_read_from_vector (cop0, sel[at]);
8868 ins = fold_read_from_vector (cop1, sel[at] - nelts);
8873 /* Generate a canonical form of the selector. */
8874 if (!ins && sel.encoding () != builder)
8876 /* Some targets are deficient and fail to expand a single
8877 argument permutation while still allowing an equivalent
8878 2-argument version. */
8880 if (sel.ninputs () == 2
8881 || can_vec_perm_const_p (result_mode, op_mode, sel, false))
8882 op2 = vec_perm_indices_to_tree (TREE_TYPE (op2), sel);
8885 vec_perm_indices sel2 (builder, 2, nelts);
8886 if (can_vec_perm_const_p (result_mode, op_mode, sel2, false))
8887 op2 = vec_perm_indices_to_tree (TREE_TYPE (op2), sel2);
8889 /* Not directly supported with either encoding,
8890 so use the preferred form. */
8891 op2 = vec_perm_indices_to_tree (TREE_TYPE (op2), sel);
8893 if (!operand_equal_p (op2, oldop2, 0))
8898 (bit_insert { op0; } { ins; }
8899 { bitsize_int (at * vector_element_bits (type)); })
8901 (vec_perm { op0; } { op1; } { op2; }))))))))))))
8903 /* VEC_PERM_EXPR (v, v, mask) -> v where v contains same element. */
8905 (match vec_same_elem_p
8908 (match vec_same_elem_p
8910 (if (TREE_CODE (@0) == SSA_NAME
8911 && uniform_vector_p (gimple_assign_rhs1 (SSA_NAME_DEF_STMT (@0))))))
8913 (match vec_same_elem_p
8915 (if (uniform_vector_p (@0))))
8919 (vec_perm vec_same_elem_p@0 @0 @1)
8920 (if (types_match (type, TREE_TYPE (@0)))
8924 tree elem = uniform_vector_p (@0);
8927 { build_vector_from_val (type, elem); }))))
8929 /* Push VEC_PERM earlier if that may help FMA perception (PR101895). */
8931 (plus:c (vec_perm:s (mult:c@0 @1 vec_same_elem_p@2) @0 @3) @4)
8932 (if (TREE_CODE (@0) == SSA_NAME && num_imm_uses (@0) == 2)
8933 (plus (mult (vec_perm @1 @1 @3) @2) @4)))
8935 (minus (vec_perm:s (mult:c@0 @1 vec_same_elem_p@2) @0 @3) @4)
8936 (if (TREE_CODE (@0) == SSA_NAME && num_imm_uses (@0) == 2)
8937 (minus (mult (vec_perm @1 @1 @3) @2) @4)))
8941 c = VEC_PERM_EXPR <a, b, VCST0>;
8942 d = VEC_PERM_EXPR <c, c, VCST1>;
8944 d = VEC_PERM_EXPR <a, b, NEW_VCST>; */
8947 (vec_perm (vec_perm@0 @1 @2 VECTOR_CST@3) @0 VECTOR_CST@4)
8948 (if (TYPE_VECTOR_SUBPARTS (type).is_constant ())
8951 machine_mode result_mode = TYPE_MODE (type);
8952 machine_mode op_mode = TYPE_MODE (TREE_TYPE (@1));
8953 int nelts = TYPE_VECTOR_SUBPARTS (type).to_constant ();
8954 vec_perm_builder builder0;
8955 vec_perm_builder builder1;
8956 vec_perm_builder builder2 (nelts, nelts, 1);
8958 (if (tree_to_vec_perm_builder (&builder0, @3)
8959 && tree_to_vec_perm_builder (&builder1, @4))
8962 vec_perm_indices sel0 (builder0, 2, nelts);
8963 vec_perm_indices sel1 (builder1, 1, nelts);
8965 for (int i = 0; i < nelts; i++)
8966 builder2.quick_push (sel0[sel1[i].to_constant ()]);
8968 vec_perm_indices sel2 (builder2, 2, nelts);
8970 tree op0 = NULL_TREE;
8971 /* If the new VEC_PERM_EXPR can't be handled but both
8972 original VEC_PERM_EXPRs can, punt.
8973 If one or both of the original VEC_PERM_EXPRs can't be
8974 handled and the new one can't be either, don't increase
8975 number of VEC_PERM_EXPRs that can't be handled. */
8976 if (can_vec_perm_const_p (result_mode, op_mode, sel2, false)
8978 ? (!can_vec_perm_const_p (result_mode, op_mode, sel0, false)
8979 || !can_vec_perm_const_p (result_mode, op_mode, sel1, false))
8980 : !can_vec_perm_const_p (result_mode, op_mode, sel1, false)))
8981 op0 = vec_perm_indices_to_tree (TREE_TYPE (@4), sel2);
8984 (vec_perm @1 @2 { op0; })))))))
8987 /* Match count trailing zeroes for simplify_count_trailing_zeroes in fwprop.
8988 The canonical form is array[((x & -x) * C) >> SHIFT] where C is a magic
8989 constant which when multiplied by a power of 2 contains a unique value
8990 in the top 5 or 6 bits. This is then indexed into a table which maps it
8991 to the number of trailing zeroes. */
8992 (match (ctz_table_index @1 @2 @3)
8993 (rshift (mult (bit_and:c (negate @1) @1) INTEGER_CST@2) INTEGER_CST@3))
8995 (match (cond_expr_convert_p @0 @2 @3 @6)
8996 (cond (simple_comparison@6 @0 @1) (convert@4 @2) (convert@5 @3))
8997 (if (INTEGRAL_TYPE_P (type)
8998 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
8999 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
9000 && INTEGRAL_TYPE_P (TREE_TYPE (@3))
9001 && TYPE_PRECISION (type) != TYPE_PRECISION (TREE_TYPE (@0))
9002 && TYPE_PRECISION (TREE_TYPE (@0))
9003 == TYPE_PRECISION (TREE_TYPE (@2))
9004 && TYPE_PRECISION (TREE_TYPE (@0))
9005 == TYPE_PRECISION (TREE_TYPE (@3))
9006 /* For vect_recog_cond_expr_convert_pattern, @2 and @3 can differ in
9007 signess when convert is truncation, but not ok for extension since
9008 it's sign_extend vs zero_extend. */
9009 && (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (type)
9010 || (TYPE_UNSIGNED (TREE_TYPE (@2))
9011 == TYPE_UNSIGNED (TREE_TYPE (@3))))
9013 && single_use (@5))))
9015 (for bit_op (bit_and bit_ior bit_xor)
9016 (match (bitwise_induction_p @0 @2 @3)
9018 (nop_convert1? (bit_not2?@0 (convert3? (lshift integer_onep@1 @2))))
9021 (match (bitwise_induction_p @0 @2 @3)
9023 (nop_convert1? (bit_xor@0 (convert2? (lshift integer_onep@1 @2)) @3))))
9025 /* n - (((n > C1) ? n : C1) & -C2) -> n & C1 for unsigned case.
9026 n - (((n > C1) ? n : C1) & -C2) -> (n <= C1) ? n : (n & C1) for signed case. */
9028 (minus @0 (bit_and (max @0 INTEGER_CST@1) INTEGER_CST@2))
9029 (with { auto i = wi::neg (wi::to_wide (@2)); }
9030 /* Check if -C2 is a power of 2 and C1 = -C2 - 1. */
9031 (if (wi::popcount (i) == 1
9032 && (wi::to_wide (@1)) == (i - 1))
9033 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
9035 (cond (le @0 @1) @0 (bit_and @0 @1))))))
9037 /* -x & 1 -> x & 1. */
9039 (bit_and (negate @0) integer_onep@1)
9040 (if (!TYPE_OVERFLOW_SANITIZED (type))
9044 c1 = VEC_PERM_EXPR (a, a, mask)
9045 c2 = VEC_PERM_EXPR (b, b, mask)
9049 c3 = VEC_PERM_EXPR (c, c, mask)
9050 For all integer non-div operations. */
9051 (for op (plus minus mult bit_and bit_ior bit_xor
9054 (op (vec_perm @0 @0 @2) (vec_perm @1 @1 @2))
9055 (if (VECTOR_INTEGER_TYPE_P (type))
9056 (vec_perm (op@3 @0 @1) @3 @2))))
9058 /* Similar for float arithmetic when permutation constant covers
9059 all vector elements. */
9060 (for op (plus minus mult)
9062 (op (vec_perm @0 @0 VECTOR_CST@2) (vec_perm @1 @1 VECTOR_CST@2))
9063 (if (VECTOR_FLOAT_TYPE_P (type)
9064 && TYPE_VECTOR_SUBPARTS (type).is_constant ())
9068 vec_perm_builder builder;
9069 bool full_perm_p = false;
9070 if (tree_to_vec_perm_builder (&builder, perm_cst))
9072 unsigned HOST_WIDE_INT nelts;
9074 nelts = TYPE_VECTOR_SUBPARTS (type).to_constant ();
9075 /* Create a vec_perm_indices for the VECTOR_CST. */
9076 vec_perm_indices sel (builder, 1, nelts);
9078 /* Check if perm indices covers all vector elements. */
9079 if (sel.encoding ().encoded_full_vector_p ())
9081 auto_sbitmap seen (nelts);
9082 bitmap_clear (seen);
9084 unsigned HOST_WIDE_INT count = 0, i;
9086 for (i = 0; i < nelts; i++)
9088 if (!bitmap_set_bit (seen, sel[i].to_constant ()))
9092 full_perm_p = count == nelts;
9097 (vec_perm (op@3 @0 @1) @3 @2))))))