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-2024 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)
90 (define_operator_list COND_LEN_UNARY
91 IFN_COND_LEN_NEG IFN_COND_LEN_NOT)
93 /* Binary operations and their associated IFN_COND_* function. */
94 (define_operator_list UNCOND_BINARY
96 mult trunc_div trunc_mod rdiv
98 IFN_FMIN IFN_FMAX IFN_COPYSIGN
99 bit_and bit_ior bit_xor
101 (define_operator_list COND_BINARY
102 IFN_COND_ADD IFN_COND_SUB
103 IFN_COND_MUL IFN_COND_DIV IFN_COND_MOD IFN_COND_RDIV
104 IFN_COND_MIN IFN_COND_MAX
105 IFN_COND_FMIN IFN_COND_FMAX IFN_COND_COPYSIGN
106 IFN_COND_AND IFN_COND_IOR IFN_COND_XOR
107 IFN_COND_SHL IFN_COND_SHR)
108 (define_operator_list COND_LEN_BINARY
109 IFN_COND_LEN_ADD IFN_COND_LEN_SUB
110 IFN_COND_LEN_MUL IFN_COND_LEN_DIV
111 IFN_COND_LEN_MOD IFN_COND_LEN_RDIV
112 IFN_COND_LEN_MIN IFN_COND_LEN_MAX
113 IFN_COND_LEN_FMIN IFN_COND_LEN_FMAX IFN_COND_LEN_COPYSIGN
114 IFN_COND_LEN_AND IFN_COND_LEN_IOR IFN_COND_LEN_XOR
115 IFN_COND_LEN_SHL IFN_COND_LEN_SHR)
117 /* Same for ternary operations. */
118 (define_operator_list UNCOND_TERNARY
119 IFN_FMA IFN_FMS IFN_FNMA IFN_FNMS)
120 (define_operator_list COND_TERNARY
121 IFN_COND_FMA IFN_COND_FMS IFN_COND_FNMA IFN_COND_FNMS)
122 (define_operator_list COND_LEN_TERNARY
123 IFN_COND_LEN_FMA IFN_COND_LEN_FMS IFN_COND_LEN_FNMA IFN_COND_LEN_FNMS)
125 /* __atomic_fetch_or_*, __atomic_fetch_xor_*, __atomic_xor_fetch_* */
126 (define_operator_list ATOMIC_FETCH_OR_XOR_N
127 BUILT_IN_ATOMIC_FETCH_OR_1 BUILT_IN_ATOMIC_FETCH_OR_2
128 BUILT_IN_ATOMIC_FETCH_OR_4 BUILT_IN_ATOMIC_FETCH_OR_8
129 BUILT_IN_ATOMIC_FETCH_OR_16
130 BUILT_IN_ATOMIC_FETCH_XOR_1 BUILT_IN_ATOMIC_FETCH_XOR_2
131 BUILT_IN_ATOMIC_FETCH_XOR_4 BUILT_IN_ATOMIC_FETCH_XOR_8
132 BUILT_IN_ATOMIC_FETCH_XOR_16
133 BUILT_IN_ATOMIC_XOR_FETCH_1 BUILT_IN_ATOMIC_XOR_FETCH_2
134 BUILT_IN_ATOMIC_XOR_FETCH_4 BUILT_IN_ATOMIC_XOR_FETCH_8
135 BUILT_IN_ATOMIC_XOR_FETCH_16)
136 /* __sync_fetch_and_or_*, __sync_fetch_and_xor_*, __sync_xor_and_fetch_* */
137 (define_operator_list SYNC_FETCH_OR_XOR_N
138 BUILT_IN_SYNC_FETCH_AND_OR_1 BUILT_IN_SYNC_FETCH_AND_OR_2
139 BUILT_IN_SYNC_FETCH_AND_OR_4 BUILT_IN_SYNC_FETCH_AND_OR_8
140 BUILT_IN_SYNC_FETCH_AND_OR_16
141 BUILT_IN_SYNC_FETCH_AND_XOR_1 BUILT_IN_SYNC_FETCH_AND_XOR_2
142 BUILT_IN_SYNC_FETCH_AND_XOR_4 BUILT_IN_SYNC_FETCH_AND_XOR_8
143 BUILT_IN_SYNC_FETCH_AND_XOR_16
144 BUILT_IN_SYNC_XOR_AND_FETCH_1 BUILT_IN_SYNC_XOR_AND_FETCH_2
145 BUILT_IN_SYNC_XOR_AND_FETCH_4 BUILT_IN_SYNC_XOR_AND_FETCH_8
146 BUILT_IN_SYNC_XOR_AND_FETCH_16)
147 /* __atomic_fetch_and_*. */
148 (define_operator_list ATOMIC_FETCH_AND_N
149 BUILT_IN_ATOMIC_FETCH_AND_1 BUILT_IN_ATOMIC_FETCH_AND_2
150 BUILT_IN_ATOMIC_FETCH_AND_4 BUILT_IN_ATOMIC_FETCH_AND_8
151 BUILT_IN_ATOMIC_FETCH_AND_16)
152 /* __sync_fetch_and_and_*. */
153 (define_operator_list SYNC_FETCH_AND_AND_N
154 BUILT_IN_SYNC_FETCH_AND_AND_1 BUILT_IN_SYNC_FETCH_AND_AND_2
155 BUILT_IN_SYNC_FETCH_AND_AND_4 BUILT_IN_SYNC_FETCH_AND_AND_8
156 BUILT_IN_SYNC_FETCH_AND_AND_16)
158 /* With nop_convert? combine convert? and view_convert? in one pattern
159 plus conditionalize on tree_nop_conversion_p conversions. */
160 (match (nop_convert @0)
162 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))))
163 (match (nop_convert @0)
165 (if (VECTOR_TYPE_P (type) && VECTOR_TYPE_P (TREE_TYPE (@0))
166 && known_eq (TYPE_VECTOR_SUBPARTS (type),
167 TYPE_VECTOR_SUBPARTS (TREE_TYPE (@0)))
168 && tree_nop_conversion_p (TREE_TYPE (type), TREE_TYPE (TREE_TYPE (@0))))))
171 /* These are used by gimple_bitwise_inverted_equal_p to simplify
172 detection of BIT_NOT and comparisons. */
173 (match (bit_not_with_nop @0)
175 (match (bit_not_with_nop @0)
176 (convert (bit_not @0))
177 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))))
178 (for cmp (tcc_comparison)
179 (match (maybe_cmp @0)
181 (match (maybe_cmp @0)
182 (convert (cmp@0 @1 @2))
183 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))))
185 /* `a ^ b` is another form of `a != b` when the type
186 is a 1bit precission integer. */
187 (match (maybe_cmp @0)
189 (if (INTEGRAL_TYPE_P (type)
190 && TYPE_PRECISION (type) == 1)))
193 /* Transform likes of (char) ABS_EXPR <(int) x> into (char) ABSU_EXPR <x>
194 ABSU_EXPR returns unsigned absolute value of the operand and the operand
195 of the ABSU_EXPR will have the corresponding signed type. */
196 (simplify (abs (convert @0))
197 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
198 && !TYPE_UNSIGNED (TREE_TYPE (@0))
199 && element_precision (type) > element_precision (TREE_TYPE (@0)))
200 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
201 (convert (absu:utype @0)))))
204 /* Optimize (X + (X >> (prec - 1))) ^ (X >> (prec - 1)) into abs (X). */
206 (bit_xor:c (plus:c @0 (rshift@2 @0 INTEGER_CST@1)) @2)
207 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
208 && !TYPE_UNSIGNED (TREE_TYPE (@0))
209 && wi::to_widest (@1) == element_precision (TREE_TYPE (@0)) - 1)
213 /* Simplifications of operations with one constant operand and
214 simplifications to constants or single values. */
216 (for op (plus pointer_plus minus bit_ior bit_xor)
218 (op @0 integer_zerop)
221 /* 0 +p index -> (type)index */
223 (pointer_plus integer_zerop @1)
224 (non_lvalue (convert @1)))
226 /* ptr - 0 -> (type)ptr */
228 (pointer_diff @0 integer_zerop)
231 /* See if ARG1 is zero and X + ARG1 reduces to X.
232 Likewise if the operands are reversed. */
234 (plus:c @0 real_zerop@1)
235 (if (fold_real_zero_addition_p (type, @0, @1, 0))
238 /* See if ARG1 is zero and X - ARG1 reduces to X. */
240 (minus @0 real_zerop@1)
241 (if (fold_real_zero_addition_p (type, @0, @1, 1))
244 /* Even if the fold_real_zero_addition_p can't simplify X + 0.0
245 into X, we can optimize (X + 0.0) + 0.0 or (X + 0.0) - 0.0
246 or (X - 0.0) + 0.0 into X + 0.0 and (X - 0.0) - 0.0 into X - 0.0
247 if not -frounding-math. For sNaNs the first operation would raise
248 exceptions but turn the result into qNan, so the second operation
249 would not raise it. */
250 (for inner_op (plus minus)
251 (for outer_op (plus minus)
253 (outer_op (inner_op@3 @0 REAL_CST@1) REAL_CST@2)
256 && !HONOR_SIGN_DEPENDENT_ROUNDING (type))
257 (with { bool inner_plus = ((inner_op == PLUS_EXPR)
258 ^ REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@1)));
260 = ((outer_op == PLUS_EXPR)
261 ^ REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@2))); }
262 (if (outer_plus && !inner_plus)
267 This is unsafe for certain floats even in non-IEEE formats.
268 In IEEE, it is unsafe because it does wrong for NaNs.
269 PR middle-end/98420: x - x may be -0.0 with FE_DOWNWARD.
270 Also note that operand_equal_p is always false if an operand
274 (if (!FLOAT_TYPE_P (type)
275 || (!tree_expr_maybe_nan_p (@0)
276 && !tree_expr_maybe_infinite_p (@0)
277 && (!HONOR_SIGN_DEPENDENT_ROUNDING (type)
278 || !HONOR_SIGNED_ZEROS (type))))
279 { build_zero_cst (type); }))
281 (pointer_diff @@0 @0)
282 { build_zero_cst (type); })
285 (mult @0 integer_zerop@1)
288 /* -x == x -> x == 0 */
291 (cmp:c @0 (negate @0))
292 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
293 && !TYPE_OVERFLOW_WRAPS (TREE_TYPE(@0)))
294 (cmp @0 { build_zero_cst (TREE_TYPE(@0)); }))))
296 /* Maybe fold x * 0 to 0. The expressions aren't the same
297 when x is NaN, since x * 0 is also NaN. Nor are they the
298 same in modes with signed zeros, since multiplying a
299 negative value by 0 gives -0, not +0. Nor when x is +-Inf,
300 since x * 0 is NaN. */
302 (mult @0 real_zerop@1)
303 (if (!tree_expr_maybe_nan_p (@0)
304 && (!HONOR_NANS (type) || !tree_expr_maybe_infinite_p (@0))
305 && (!HONOR_SIGNED_ZEROS (type) || tree_expr_nonnegative_p (@0)))
308 /* In IEEE floating point, x*1 is not equivalent to x for snans.
309 Likewise for complex arithmetic with signed zeros. */
312 (if (!tree_expr_maybe_signaling_nan_p (@0)
313 && (!HONOR_SIGNED_ZEROS (type)
314 || !COMPLEX_FLOAT_TYPE_P (type)))
317 /* Transform x * -1.0 into -x. */
319 (mult @0 real_minus_onep)
320 (if (!tree_expr_maybe_signaling_nan_p (@0)
321 && (!HONOR_SIGNED_ZEROS (type)
322 || !COMPLEX_FLOAT_TYPE_P (type)))
325 /* Transform x * { 0 or 1, 0 or 1, ... } into x & { 0 or -1, 0 or -1, ...},
326 unless the target has native support for the former but not the latter. */
328 (mult @0 VECTOR_CST@1)
329 (if (initializer_each_zero_or_onep (@1)
330 && !HONOR_SNANS (type)
331 && !HONOR_SIGNED_ZEROS (type))
332 (with { tree itype = FLOAT_TYPE_P (type) ? unsigned_type_for (type) : type; }
334 && (!VECTOR_MODE_P (TYPE_MODE (type))
335 || (VECTOR_MODE_P (TYPE_MODE (itype))
336 && optab_handler (and_optab,
337 TYPE_MODE (itype)) != CODE_FOR_nothing)))
338 (view_convert (bit_and:itype (view_convert @0)
339 (ne @1 { build_zero_cst (type); })))))))
341 /* In SWAR (SIMD within a register) code a signed comparison of packed data
342 can be constructed with a particular combination of shift, bitwise and,
343 and multiplication by constants. If that code is vectorized we can
344 convert this pattern into a more efficient vector comparison. */
346 (mult (bit_and (rshift @0 uniform_integer_cst_p@1)
347 uniform_integer_cst_p@2)
348 uniform_integer_cst_p@3)
350 tree rshift_cst = uniform_integer_cst_p (@1);
351 tree bit_and_cst = uniform_integer_cst_p (@2);
352 tree mult_cst = uniform_integer_cst_p (@3);
354 /* Make sure we're working with vectors and uniform vector constants. */
355 (if (VECTOR_TYPE_P (type)
356 && tree_fits_uhwi_p (rshift_cst)
357 && tree_fits_uhwi_p (mult_cst)
358 && tree_fits_uhwi_p (bit_and_cst))
359 /* Compute what constants would be needed for this to represent a packed
360 comparison based on the shift amount denoted by RSHIFT_CST. */
362 HOST_WIDE_INT vec_elem_bits = vector_element_bits (type);
363 poly_int64 vec_nelts = TYPE_VECTOR_SUBPARTS (type);
364 poly_int64 vec_bits = vec_elem_bits * vec_nelts;
365 unsigned HOST_WIDE_INT cmp_bits_i, bit_and_i, mult_i;
366 unsigned HOST_WIDE_INT target_mult_i, target_bit_and_i;
367 cmp_bits_i = tree_to_uhwi (rshift_cst) + 1;
368 mult_i = tree_to_uhwi (mult_cst);
369 target_mult_i = (HOST_WIDE_INT_1U << cmp_bits_i) - 1;
370 bit_and_i = tree_to_uhwi (bit_and_cst);
371 target_bit_and_i = 0;
373 /* The bit pattern in BIT_AND_I should be a mask for the least
374 significant bit of each packed element that is CMP_BITS wide. */
375 for (unsigned i = 0; i < vec_elem_bits / cmp_bits_i; i++)
376 target_bit_and_i = (target_bit_and_i << cmp_bits_i) | 1U;
378 (if ((exact_log2 (cmp_bits_i)) >= 0
379 && cmp_bits_i < HOST_BITS_PER_WIDE_INT
380 && multiple_p (vec_bits, cmp_bits_i)
381 && vec_elem_bits <= HOST_BITS_PER_WIDE_INT
382 && target_mult_i == mult_i
383 && target_bit_and_i == bit_and_i)
384 /* Compute the vector shape for the comparison and check if the target is
385 able to expand the comparison with that type. */
387 /* We're doing a signed comparison. */
388 tree cmp_type = build_nonstandard_integer_type (cmp_bits_i, 0);
389 poly_int64 vector_type_nelts = exact_div (vec_bits, cmp_bits_i);
390 tree vec_cmp_type = build_vector_type (cmp_type, vector_type_nelts);
391 tree vec_truth_type = truth_type_for (vec_cmp_type);
392 tree zeros = build_zero_cst (vec_cmp_type);
393 tree ones = build_all_ones_cst (vec_cmp_type);
395 (if (expand_vec_cmp_expr_p (vec_cmp_type, vec_truth_type, LT_EXPR)
396 && expand_vec_cond_expr_p (vec_cmp_type, vec_truth_type, LT_EXPR))
397 (view_convert:type (vec_cond (lt:vec_truth_type
398 (view_convert:vec_cmp_type @0)
400 { ones; } { zeros; })))))))))
402 (for cmp (gt ge lt le)
403 outp (convert convert negate negate)
404 outn (negate negate convert convert)
405 /* Transform X * (X > 0.0 ? 1.0 : -1.0) into abs(X). */
406 /* Transform X * (X >= 0.0 ? 1.0 : -1.0) into abs(X). */
407 /* Transform X * (X < 0.0 ? 1.0 : -1.0) into -abs(X). */
408 /* Transform X * (X <= 0.0 ? 1.0 : -1.0) into -abs(X). */
410 (mult:c @0 (cond (cmp @0 real_zerop) real_onep@1 real_minus_onep))
411 (if (!tree_expr_maybe_nan_p (@0) && !HONOR_SIGNED_ZEROS (type))
413 /* Transform X * (X > 0.0 ? -1.0 : 1.0) into -abs(X). */
414 /* Transform X * (X >= 0.0 ? -1.0 : 1.0) into -abs(X). */
415 /* Transform X * (X < 0.0 ? -1.0 : 1.0) into abs(X). */
416 /* Transform X * (X <= 0.0 ? -1.0 : 1.0) into abs(X). */
418 (mult:c @0 (cond (cmp @0 real_zerop) real_minus_onep real_onep@1))
419 (if (!tree_expr_maybe_nan_p (@0) && !HONOR_SIGNED_ZEROS (type))
422 /* Transform X * copysign (1.0, X) into abs(X). */
424 (mult:c @0 (COPYSIGN_ALL real_onep @0))
425 (if (!tree_expr_maybe_nan_p (@0) && !HONOR_SIGNED_ZEROS (type))
428 /* Transform X * copysign (1.0, -X) into -abs(X). */
430 (mult:c @0 (COPYSIGN_ALL real_onep (negate @0)))
431 (if (!tree_expr_maybe_nan_p (@0) && !HONOR_SIGNED_ZEROS (type))
434 /* Transform copysign (CST, X) into copysign (ABS(CST), X). */
436 (COPYSIGN_ALL REAL_CST@0 @1)
437 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@0)))
438 (COPYSIGN_ALL (negate @0) @1)))
440 /* Transform c ? x * copysign (1, y) : z to c ? x ^ signs(y) : z.
441 tree-ssa-math-opts.cc does the corresponding optimization for
442 unconditional multiplications (via xorsign). */
444 (IFN_COND_MUL:c @0 @1 (IFN_COPYSIGN real_onep @2) @3)
445 (with { tree signs = sign_mask_for (type); }
447 (with { tree inttype = TREE_TYPE (signs); }
449 (IFN_COND_XOR:inttype @0
450 (view_convert:inttype @1)
451 (bit_and (view_convert:inttype @2) { signs; })
452 (view_convert:inttype @3)))))))
454 /* (x >= 0 ? x : 0) + (x <= 0 ? -x : 0) -> abs x. */
456 (plus:c (max @0 integer_zerop) (max (negate @0) integer_zerop))
457 (if (ANY_INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_UNDEFINED (type))
460 /* X * 1, X / 1 -> X. */
461 (for op (mult trunc_div ceil_div floor_div round_div exact_div)
466 /* (A / (1 << B)) -> (A >> B).
467 Only for unsigned A. For signed A, this would not preserve rounding
469 For example: (-1 / ( 1 << B)) != -1 >> B.
470 Also handle widening conversions, like:
471 (A / (unsigned long long) (1U << B)) -> (A >> B)
473 (A / (unsigned long long) (1 << B)) -> (A >> B).
474 If the left shift is signed, it can be done only if the upper bits
475 of A starting from shift's type sign bit are zero, as
476 (unsigned long long) (1 << 31) is -2147483648ULL, not 2147483648ULL,
477 so it is valid only if A >> 31 is zero. */
479 (trunc_div (convert?@0 @3) (convert2? (lshift integer_onep@1 @2)))
480 (if ((TYPE_UNSIGNED (type) || tree_expr_nonnegative_p (@0))
481 && (!VECTOR_TYPE_P (type)
482 || target_supports_op_p (type, RSHIFT_EXPR, optab_vector)
483 || target_supports_op_p (type, RSHIFT_EXPR, optab_scalar))
484 && (useless_type_conversion_p (type, TREE_TYPE (@1))
485 || (element_precision (type) >= element_precision (TREE_TYPE (@1))
486 && (TYPE_UNSIGNED (TREE_TYPE (@1))
487 || (element_precision (type)
488 == element_precision (TREE_TYPE (@1)))
489 || (INTEGRAL_TYPE_P (type)
490 && (tree_nonzero_bits (@0)
491 & wi::mask (element_precision (TREE_TYPE (@1)) - 1,
493 element_precision (type))) == 0)))))
494 (if (!VECTOR_TYPE_P (type)
495 && useless_type_conversion_p (TREE_TYPE (@3), TREE_TYPE (@1))
496 && element_precision (TREE_TYPE (@3)) < element_precision (type))
497 (convert (rshift @3 @2))
500 /* Preserve explicit divisions by 0: the C++ front-end wants to detect
501 undefined behavior in constexpr evaluation, and assuming that the division
502 traps enables better optimizations than these anyway. */
503 (for div (trunc_div ceil_div floor_div round_div exact_div)
504 /* 0 / X is always zero. */
506 (div integer_zerop@0 @1)
507 /* But not for 0 / 0 so that we can get the proper warnings and errors. */
508 (if (!integer_zerop (@1))
512 (div @0 integer_minus_onep@1)
513 (if (!TYPE_UNSIGNED (type))
515 /* X / bool_range_Y is X. */
518 (if (INTEGRAL_TYPE_P (type)
519 && ssa_name_has_boolean_range (@1)
520 && !flag_non_call_exceptions)
525 /* But not for 0 / 0 so that we can get the proper warnings and errors.
526 And not for _Fract types where we can't build 1. */
527 (if (!ALL_FRACT_MODE_P (TYPE_MODE (type))
528 && !integer_zerop (@0)
529 && (!flag_non_call_exceptions || tree_expr_nonzero_p (@0)))
530 { build_one_cst (type); }))
531 /* X / abs (X) is X < 0 ? -1 : 1. */
534 (if (INTEGRAL_TYPE_P (type)
535 && TYPE_OVERFLOW_UNDEFINED (type)
536 && !integer_zerop (@0)
537 && (!flag_non_call_exceptions || tree_expr_nonzero_p (@0)))
538 (cond (lt @0 { build_zero_cst (type); })
539 { build_minus_one_cst (type); } { build_one_cst (type); })))
542 (div:C @0 (negate @0))
543 (if ((INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
544 && TYPE_OVERFLOW_UNDEFINED (type)
545 && !integer_zerop (@0)
546 && (!flag_non_call_exceptions || tree_expr_nonzero_p (@0)))
547 { build_minus_one_cst (type); })))
549 /* For unsigned integral types, FLOOR_DIV_EXPR is the same as
550 TRUNC_DIV_EXPR. Rewrite into the latter in this case. Similarly
551 for MOD instead of DIV. */
552 (for floor_divmod (floor_div floor_mod)
553 trunc_divmod (trunc_div trunc_mod)
556 (if ((INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
557 && TYPE_UNSIGNED (type))
558 (trunc_divmod @0 @1))))
560 /* 1 / X -> X == 1 for unsigned integer X.
561 1 / X -> X >= -1 && X <= 1 ? X : 0 for signed integer X.
562 But not for 1 / 0 so that we can get proper warnings and errors,
563 and not for 1-bit integers as they are edge cases better handled
564 elsewhere. Delay the conversion of the signed division until late
565 because `1 / X` is simplier to handle than the resulting COND_EXPR. */
567 (trunc_div integer_onep@0 @1)
568 (if (INTEGRAL_TYPE_P (type)
569 && TYPE_PRECISION (type) > 1
570 && !integer_zerop (@1)
571 && (!flag_non_call_exceptions || tree_expr_nonzero_p (@1)))
572 (if (TYPE_UNSIGNED (type))
573 (convert (eq:boolean_type_node @1 { build_one_cst (type); }))
574 (if (!canonicalize_math_p ())
575 (with { tree utype = unsigned_type_for (type); }
576 (cond (le (plus (convert:utype @1) { build_one_cst (utype); })
577 { build_int_cst (utype, 2); })
578 @1 { build_zero_cst (type); }))))))
580 /* Combine two successive divisions. Note that combining ceil_div
581 and floor_div is trickier and combining round_div even more so. */
582 (for div (trunc_div exact_div)
584 (div (div@3 @0 INTEGER_CST@1) INTEGER_CST@2)
586 wi::overflow_type overflow;
587 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@2),
588 TYPE_SIGN (type), &overflow);
590 (if (div == EXACT_DIV_EXPR
591 || optimize_successive_divisions_p (@2, @3))
593 (div @0 { wide_int_to_tree (type, mul); })
594 (if (TYPE_UNSIGNED (type)
595 || mul != wi::min_value (TYPE_PRECISION (type), SIGNED))
596 { build_zero_cst (type); }))))))
598 /* Combine successive multiplications. Similar to above, but handling
599 overflow is different. */
601 (mult (mult @0 INTEGER_CST@1) INTEGER_CST@2)
603 wi::overflow_type overflow;
604 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@2),
605 TYPE_SIGN (type), &overflow);
607 /* Skip folding on overflow: the only special case is @1 * @2 == -INT_MIN,
608 otherwise undefined overflow implies that @0 must be zero. */
609 (if (!overflow || TYPE_OVERFLOW_WRAPS (type))
610 (mult @0 { wide_int_to_tree (type, mul); }))))
612 /* Similar to above, but there could be an extra add/sub between
613 successive multuiplications. */
615 (mult (plus:s (mult:s@4 @0 INTEGER_CST@1) INTEGER_CST@2) INTEGER_CST@3)
617 bool overflowed = true;
618 wi::overflow_type ovf1, ovf2;
619 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@3),
620 TYPE_SIGN (type), &ovf1);
621 wide_int add = wi::mul (wi::to_wide (@2), wi::to_wide (@3),
622 TYPE_SIGN (type), &ovf2);
623 if (TYPE_OVERFLOW_UNDEFINED (type))
627 if (ovf1 == wi::OVF_NONE && ovf2 == wi::OVF_NONE
628 && get_global_range_query ()->range_of_expr (vr0, @4)
629 && !vr0.varying_p () && !vr0.undefined_p ())
631 wide_int wmin0 = vr0.lower_bound ();
632 wide_int wmax0 = vr0.upper_bound ();
633 wmin0 = wi::mul (wmin0, wi::to_wide (@3), TYPE_SIGN (type), &ovf1);
634 wmax0 = wi::mul (wmax0, wi::to_wide (@3), TYPE_SIGN (type), &ovf2);
635 if (ovf1 == wi::OVF_NONE && ovf2 == wi::OVF_NONE)
637 wi::add (wmin0, add, TYPE_SIGN (type), &ovf1);
638 wi::add (wmax0, add, TYPE_SIGN (type), &ovf2);
639 if (ovf1 == wi::OVF_NONE && ovf2 == wi::OVF_NONE)
648 /* Skip folding on overflow. */
650 (plus (mult @0 { wide_int_to_tree (type, mul); })
651 { wide_int_to_tree (type, add); }))))
653 /* Similar to above, but a multiplication between successive additions. */
655 (plus (mult:s (plus:s @0 INTEGER_CST@1) INTEGER_CST@2) INTEGER_CST@3)
657 bool overflowed = true;
658 wi::overflow_type ovf1;
659 wi::overflow_type ovf2;
660 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@2),
661 TYPE_SIGN (type), &ovf1);
662 wide_int add = wi::add (mul, wi::to_wide (@3),
663 TYPE_SIGN (type), &ovf2);
664 if (TYPE_OVERFLOW_UNDEFINED (type))
668 if (ovf1 == wi::OVF_NONE && ovf2 == wi::OVF_NONE
669 && get_global_range_query ()->range_of_expr (vr0, @0)
670 && !vr0.varying_p () && !vr0.undefined_p ())
672 wide_int wmin0 = vr0.lower_bound ();
673 wide_int wmax0 = vr0.upper_bound ();
674 wmin0 = wi::mul (wmin0, wi::to_wide (@2), TYPE_SIGN (type), &ovf1);
675 wmax0 = wi::mul (wmax0, wi::to_wide (@2), TYPE_SIGN (type), &ovf2);
676 if (ovf1 == wi::OVF_NONE && ovf2 == wi::OVF_NONE)
678 wi::add (wmin0, mul, TYPE_SIGN (type), &ovf1);
679 wi::add (wmax0, mul, TYPE_SIGN (type), &ovf2);
680 if (ovf1 == wi::OVF_NONE && ovf2 == wi::OVF_NONE)
689 /* Skip folding on overflow. */
691 (plus (mult @0 @2) { wide_int_to_tree (type, add); }))))
693 /* Optimize A / A to 1.0 if we don't care about
694 NaNs or Infinities. */
697 (if (FLOAT_TYPE_P (type)
698 && ! HONOR_NANS (type)
699 && ! HONOR_INFINITIES (type))
700 { build_one_cst (type); }))
702 /* Optimize -A / A to -1.0 if we don't care about
703 NaNs or Infinities. */
705 (rdiv:C @0 (negate @0))
706 (if (FLOAT_TYPE_P (type)
707 && ! HONOR_NANS (type)
708 && ! HONOR_INFINITIES (type))
709 { build_minus_one_cst (type); }))
711 /* PR71078: x / abs(x) -> copysign (1.0, x) */
713 (rdiv:C (convert? @0) (convert? (abs @0)))
714 (if (SCALAR_FLOAT_TYPE_P (type)
715 && ! HONOR_NANS (type)
716 && ! HONOR_INFINITIES (type))
718 (if (types_match (type, float_type_node))
719 (BUILT_IN_COPYSIGNF { build_one_cst (type); } (convert @0)))
720 (if (types_match (type, double_type_node))
721 (BUILT_IN_COPYSIGN { build_one_cst (type); } (convert @0)))
722 (if (types_match (type, long_double_type_node))
723 (BUILT_IN_COPYSIGNL { build_one_cst (type); } (convert @0))))))
725 /* In IEEE floating point, x/1 is not equivalent to x for snans. */
728 (if (!tree_expr_maybe_signaling_nan_p (@0))
731 /* In IEEE floating point, x/-1 is not equivalent to -x for snans. */
733 (rdiv @0 real_minus_onep)
734 (if (!tree_expr_maybe_signaling_nan_p (@0))
737 (if (flag_reciprocal_math)
738 /* Convert (A/B)/C to A/(B*C). */
740 (rdiv (rdiv:s @0 @1) @2)
741 (rdiv @0 (mult @1 @2)))
743 /* Canonicalize x / (C1 * y) to (x * C2) / y. */
745 (rdiv @0 (mult:s @1 REAL_CST@2))
747 { tree tem = const_binop (RDIV_EXPR, type, build_one_cst (type), @2); }
749 (rdiv (mult @0 { tem; } ) @1))))
751 /* Convert A/(B/C) to (A/B)*C */
753 (rdiv @0 (rdiv:s @1 @2))
754 (mult (rdiv @0 @1) @2)))
756 /* Simplify x / (- y) to -x / y. */
758 (rdiv @0 (negate @1))
759 (rdiv (negate @0) @1))
761 (if (flag_unsafe_math_optimizations)
762 /* Simplify (C / x op 0.0) to x op 0.0 for C != 0, C != Inf/Nan.
763 Since C / x may underflow to zero, do this only for unsafe math. */
764 (for op (lt le gt ge)
767 (op (rdiv REAL_CST@0 @1) real_zerop@2)
768 (if (!HONOR_SIGNED_ZEROS (@1) && !HONOR_INFINITIES (@1))
770 (if (real_less (&dconst0, TREE_REAL_CST_PTR (@0)))
772 /* For C < 0, use the inverted operator. */
773 (if (real_less (TREE_REAL_CST_PTR (@0), &dconst0))
776 /* Optimize (X & (-A)) / A where A is a power of 2, to X >> log2(A) */
777 (for div (trunc_div ceil_div floor_div round_div exact_div)
779 (div (convert? (bit_and @0 INTEGER_CST@1)) INTEGER_CST@2)
780 (if (integer_pow2p (@2)
781 && tree_int_cst_sgn (@2) > 0
782 && tree_nop_conversion_p (type, TREE_TYPE (@0))
783 && wi::to_wide (@2) + wi::to_wide (@1) == 0)
785 { build_int_cst (integer_type_node,
786 wi::exact_log2 (wi::to_wide (@2))); }))))
788 /* If ARG1 is a constant, we can convert this to a multiply by the
789 reciprocal. This does not have the same rounding properties,
790 so only do this if -freciprocal-math. We can actually
791 always safely do it if ARG1 is a power of two, but it's hard to
792 tell if it is or not in a portable manner. */
793 (for cst (REAL_CST COMPLEX_CST VECTOR_CST)
797 (if (flag_reciprocal_math
800 { tree tem = const_binop (RDIV_EXPR, type, build_one_cst (type), @1); }
802 (mult @0 { tem; } )))
803 (if (cst != COMPLEX_CST)
804 (with { tree inverse = exact_inverse (type, @1); }
806 (mult @0 { inverse; } ))))))))
808 (for mod (ceil_mod floor_mod round_mod trunc_mod)
809 /* 0 % X is always zero. */
811 (mod integer_zerop@0 @1)
812 /* But not for 0 % 0 so that we can get the proper warnings and errors. */
813 (if (!integer_zerop (@1))
815 /* X % 1 is always zero. */
817 (mod @0 integer_onep)
818 { build_zero_cst (type); })
819 /* X % -1 is zero. */
821 (mod @0 integer_minus_onep@1)
822 (if (!TYPE_UNSIGNED (type))
823 { build_zero_cst (type); }))
827 /* But not for 0 % 0 so that we can get the proper warnings and errors. */
828 (if (!integer_zerop (@0))
829 { build_zero_cst (type); }))
830 /* (X % Y) % Y is just X % Y. */
832 (mod (mod@2 @0 @1) @1)
834 /* From extract_muldiv_1: (X * C1) % C2 is zero if C1 is a multiple of C2. */
836 (mod (mult @0 INTEGER_CST@1) INTEGER_CST@2)
837 (if (ANY_INTEGRAL_TYPE_P (type)
838 && TYPE_OVERFLOW_UNDEFINED (type)
839 && wi::multiple_of_p (wi::to_wide (@1), wi::to_wide (@2),
841 { build_zero_cst (type); }))
842 /* For (X % C) == 0, if X is signed and C is power of 2, use unsigned
843 modulo and comparison, since it is simpler and equivalent. */
846 (cmp (mod @0 integer_pow2p@2) integer_zerop@1)
847 (if (!TYPE_UNSIGNED (TREE_TYPE (@0)))
848 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
849 (cmp (mod (convert:utype @0) (convert:utype @2)) (convert:utype @1)))))))
851 /* X % -C is the same as X % C. */
853 (trunc_mod @0 INTEGER_CST@1)
854 (if (TYPE_SIGN (type) == SIGNED
855 && !TREE_OVERFLOW (@1)
856 && wi::neg_p (wi::to_wide (@1))
857 && !TYPE_OVERFLOW_TRAPS (type)
858 /* Avoid this transformation if C is INT_MIN, i.e. C == -C. */
859 && !sign_bit_p (@1, @1))
860 (trunc_mod @0 (negate @1))))
862 /* X % -Y is the same as X % Y. */
864 (trunc_mod @0 (convert? (negate @1)))
865 (if (INTEGRAL_TYPE_P (type)
866 && !TYPE_UNSIGNED (type)
867 && !TYPE_OVERFLOW_TRAPS (type)
868 && tree_nop_conversion_p (type, TREE_TYPE (@1))
869 /* Avoid this transformation if X might be INT_MIN or
870 Y might be -1, because we would then change valid
871 INT_MIN % -(-1) into invalid INT_MIN % -1. */
872 && (expr_not_equal_to (@0, wi::to_wide (TYPE_MIN_VALUE (type)))
873 || expr_not_equal_to (@1, wi::minus_one (TYPE_PRECISION
875 (trunc_mod @0 (convert @1))))
877 /* X - (X / Y) * Y is the same as X % Y. */
879 (minus (convert1? @0) (convert2? (mult:c (trunc_div @@0 @@1) @1)))
880 (if (INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
881 (convert (trunc_mod @0 @1))))
883 /* x * (1 + y / x) - y -> x - y % x */
885 (minus (mult:cs @0 (plus:s (trunc_div:s @1 @0) integer_onep)) @1)
886 (if (INTEGRAL_TYPE_P (type))
887 (minus @0 (trunc_mod @1 @0))))
889 /* Optimize TRUNC_MOD_EXPR by a power of two into a BIT_AND_EXPR,
890 i.e. "X % C" into "X & (C - 1)", if X and C are positive.
891 Also optimize A % (C << N) where C is a power of 2,
892 to A & ((C << N) - 1).
893 Also optimize "A shift (B % C)", if C is a power of 2, to
894 "A shift (B & (C - 1))". SHIFT operation include "<<" and ">>"
895 and assume (B % C) is nonnegative as shifts negative values would
897 (match (power_of_two_cand @1)
899 (match (power_of_two_cand @1)
900 (lshift INTEGER_CST@1 @2))
901 (for mod (trunc_mod floor_mod)
902 (for shift (lshift rshift)
904 (shift @0 (mod @1 (power_of_two_cand@2 @3)))
905 (if (integer_pow2p (@3) && tree_int_cst_sgn (@3) > 0)
906 (shift @0 (bit_and @1 (minus @2 { build_int_cst (TREE_TYPE (@2),
909 (mod @0 (convert? (power_of_two_cand@1 @2)))
910 (if ((TYPE_UNSIGNED (type) || tree_expr_nonnegative_p (@0))
911 /* Allow any integral conversions of the divisor, except
912 conversion from narrower signed to wider unsigned type
913 where if @1 would be negative power of two, the divisor
914 would not be a power of two. */
915 && INTEGRAL_TYPE_P (type)
916 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
917 && (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@1))
918 || TYPE_UNSIGNED (TREE_TYPE (@1))
919 || !TYPE_UNSIGNED (type))
920 && integer_pow2p (@2) && tree_int_cst_sgn (@2) > 0)
921 (with { tree utype = TREE_TYPE (@1);
922 if (!TYPE_OVERFLOW_WRAPS (utype))
923 utype = unsigned_type_for (utype); }
924 (bit_and @0 (convert (minus (convert:utype @1)
925 { build_one_cst (utype); })))))))
927 /* Simplify (unsigned t * 2)/2 -> unsigned t & 0x7FFFFFFF. */
929 (trunc_div (mult @0 integer_pow2p@1) @1)
930 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)) && TYPE_UNSIGNED (TREE_TYPE (@0)))
931 (bit_and @0 { wide_int_to_tree
932 (type, wi::mask (TYPE_PRECISION (type)
933 - wi::exact_log2 (wi::to_wide (@1)),
934 false, TYPE_PRECISION (type))); })))
936 /* Simplify (unsigned t / 2) * 2 -> unsigned t & ~1. */
938 (mult (trunc_div @0 integer_pow2p@1) @1)
939 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)) && TYPE_UNSIGNED (TREE_TYPE (@0)))
940 (bit_and @0 (negate @1))))
942 (for div (trunc_div ceil_div floor_div round_div exact_div)
943 /* Simplify (t * u) / u -> t. */
945 (div (mult:c @0 @1) @1)
946 (if (ANY_INTEGRAL_TYPE_P (type))
947 (if (TYPE_OVERFLOW_UNDEFINED (type) && !TYPE_OVERFLOW_SANITIZED (type))
950 (with {value_range vr0, vr1;}
951 (if (INTEGRAL_TYPE_P (type)
952 && get_range_query (cfun)->range_of_expr (vr0, @0)
953 && get_range_query (cfun)->range_of_expr (vr1, @1)
954 && range_op_handler (MULT_EXPR).overflow_free_p (vr0, vr1))
959 /* Simplify (t * u) / v -> t * (u / v) if u is multiple of v. */
961 (div (mult @0 INTEGER_CST@1) INTEGER_CST@2)
962 (if (INTEGRAL_TYPE_P (type)
963 && wi::multiple_of_p (wi::to_widest (@1), wi::to_widest (@2), SIGNED))
964 (if (TYPE_OVERFLOW_UNDEFINED (type) && !TYPE_OVERFLOW_SANITIZED (type))
965 (mult @0 (div! @1 @2))
966 (with {value_range vr0, vr1;}
967 (if (get_range_query (cfun)->range_of_expr (vr0, @0)
968 && get_range_query (cfun)->range_of_expr (vr1, @1)
969 && range_op_handler (MULT_EXPR).overflow_free_p (vr0, vr1))
970 (mult @0 (div! @1 @2))))
973 /* Simplify (t * u) / (t * v) -> (u / v) if u is multiple of v. */
975 (div (mult @0 INTEGER_CST@1) (mult @0 INTEGER_CST@2))
976 (if (INTEGRAL_TYPE_P (type)
977 && wi::multiple_of_p (wi::to_widest (@1), wi::to_widest (@2), SIGNED))
978 (if (TYPE_OVERFLOW_UNDEFINED (type) && !TYPE_OVERFLOW_SANITIZED (type))
981 (with {value_range vr0, vr1, vr2;}
982 (if (get_range_query (cfun)->range_of_expr (vr0, @0)
983 && get_range_query (cfun)->range_of_expr (vr1, @1)
984 && get_range_query (cfun)->range_of_expr (vr2, @2)
985 && range_op_handler (MULT_EXPR).overflow_free_p (vr0, vr1)
986 && range_op_handler (MULT_EXPR).overflow_free_p (vr0, vr2))
992 (for div (trunc_div exact_div)
993 /* Simplify (X + M*N) / N -> X / N + M. */
995 (div (plus:c@4 @0 (mult:c@3 @1 @2)) @2)
996 (with {value_range vr0, vr1, vr2, vr3, vr4;}
997 (if (INTEGRAL_TYPE_P (type)
998 && get_range_query (cfun)->range_of_expr (vr1, @1)
999 && get_range_query (cfun)->range_of_expr (vr2, @2)
1000 /* "N*M" doesn't overflow. */
1001 && range_op_handler (MULT_EXPR).overflow_free_p (vr1, vr2)
1002 && get_range_query (cfun)->range_of_expr (vr0, @0)
1003 && get_range_query (cfun)->range_of_expr (vr3, @3)
1004 /* "X+(N*M)" doesn't overflow. */
1005 && range_op_handler (PLUS_EXPR).overflow_free_p (vr0, vr3)
1006 && get_range_query (cfun)->range_of_expr (vr4, @4)
1007 && !vr4.undefined_p ()
1008 /* "X+N*M" is not with opposite sign as "X". */
1009 && (TYPE_UNSIGNED (type)
1010 || (vr0.nonnegative_p () && vr4.nonnegative_p ())
1011 || (vr0.nonpositive_p () && vr4.nonpositive_p ())))
1012 (plus (div @0 @2) @1))))
1014 /* Simplify (X - M*N) / N -> X / N - M. */
1016 (div (minus@4 @0 (mult:c@3 @1 @2)) @2)
1017 (with {value_range vr0, vr1, vr2, vr3, vr4;}
1018 (if (INTEGRAL_TYPE_P (type)
1019 && get_range_query (cfun)->range_of_expr (vr1, @1)
1020 && get_range_query (cfun)->range_of_expr (vr2, @2)
1021 /* "N * M" doesn't overflow. */
1022 && range_op_handler (MULT_EXPR).overflow_free_p (vr1, vr2)
1023 && get_range_query (cfun)->range_of_expr (vr0, @0)
1024 && get_range_query (cfun)->range_of_expr (vr3, @3)
1025 /* "X - (N*M)" doesn't overflow. */
1026 && range_op_handler (MINUS_EXPR).overflow_free_p (vr0, vr3)
1027 && get_range_query (cfun)->range_of_expr (vr4, @4)
1028 && !vr4.undefined_p ()
1029 /* "X-N*M" is not with opposite sign as "X". */
1030 && (TYPE_UNSIGNED (type)
1031 || (vr0.nonnegative_p () && vr4.nonnegative_p ())
1032 || (vr0.nonpositive_p () && vr4.nonpositive_p ())))
1033 (minus (div @0 @2) @1)))))
1036 (X + C) / N -> X / N + C / N where C is multiple of N.
1037 (X + C) >> N -> X >> N + C>>N if low N bits of C is 0. */
1038 (for op (trunc_div exact_div rshift)
1040 (op (plus@3 @0 INTEGER_CST@1) INTEGER_CST@2)
1043 wide_int c = wi::to_wide (@1);
1044 wide_int n = wi::to_wide (@2);
1045 bool shift = op == RSHIFT_EXPR;
1046 #define plus_op1(v) (shift ? wi::rshift (v, n, TYPE_SIGN (type)) \
1047 : wi::div_trunc (v, n, TYPE_SIGN (type)))
1048 #define exact_mod(v) (shift ? wi::ctz (v) >= n.to_shwi () \
1049 : wi::multiple_of_p (v, n, TYPE_SIGN (type)))
1050 value_range vr0, vr1, vr3;
1052 (if (INTEGRAL_TYPE_P (type)
1053 && get_range_query (cfun)->range_of_expr (vr0, @0))
1055 && get_range_query (cfun)->range_of_expr (vr1, @1)
1056 /* "X+C" doesn't overflow. */
1057 && range_op_handler (PLUS_EXPR).overflow_free_p (vr0, vr1)
1058 && get_range_query (cfun)->range_of_expr (vr3, @3)
1059 && !vr3.undefined_p ()
1060 /* "X+C" and "X" are not of opposite sign. */
1061 && (TYPE_UNSIGNED (type)
1062 || (vr0.nonnegative_p () && vr3.nonnegative_p ())
1063 || (vr0.nonpositive_p () && vr3.nonpositive_p ())))
1064 (plus (op @0 @2) { wide_int_to_tree (type, plus_op1 (c)); })
1065 (if (!vr0.undefined_p () && TYPE_UNSIGNED (type) && c.sign_mask () < 0
1067 /* unsigned "X-(-C)" doesn't underflow. */
1068 && wi::geu_p (vr0.lower_bound (), -c))
1069 (plus (op @0 @2) { wide_int_to_tree (type, -plus_op1 (-c)); })))))))
1074 /* (nop_outer_cast)-(inner_cast)var -> -(outer_cast)(var)
1075 if var is smaller in precision.
1076 This is always safe for both doing the negative in signed or unsigned
1077 as the value for undefined will not show up.
1078 Note the outer cast cannot be a boolean type as the only valid values
1079 are 0,-1/1 (depending on the signedness of the boolean) and the negative
1080 is there to get the correct value. */
1082 (convert (negate:s@1 (convert:s @0)))
1083 (if (INTEGRAL_TYPE_P (type)
1084 && tree_nop_conversion_p (type, TREE_TYPE (@1))
1085 && TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (@0))
1086 && TREE_CODE (type) != BOOLEAN_TYPE)
1087 (negate (convert @0))))
1089 (for op (negate abs)
1090 /* Simplify cos(-x) and cos(|x|) -> cos(x). Similarly for cosh. */
1091 (for coss (COS COSH)
1095 /* Simplify pow(-x, y) and pow(|x|,y) -> pow(x,y) if y is an even integer. */
1098 (pows (op @0) REAL_CST@1)
1099 (with { HOST_WIDE_INT n; }
1100 (if (real_isinteger (&TREE_REAL_CST (@1), &n) && (n & 1) == 0)
1102 /* Likewise for powi. */
1105 (pows (op @0) INTEGER_CST@1)
1106 (if ((wi::to_wide (@1) & 1) == 0)
1108 /* Strip negate and abs from both operands of hypot. */
1116 /* copysign(-x, y) and copysign(abs(x), y) -> copysign(x, y). */
1117 (for copysigns (COPYSIGN_ALL)
1119 (copysigns (op @0) @1)
1120 (copysigns @0 @1))))
1122 /* abs(x)*abs(x) -> x*x. Should be valid for all types. */
1124 (mult (abs@1 @0) @1)
1127 /* Convert absu(x)*absu(x) -> x*x. */
1129 (mult (absu@1 @0) @1)
1130 (mult (convert@2 @0) @2))
1132 /* cos(copysign(x, y)) -> cos(x). Similarly for cosh. */
1133 (for coss (COS COSH)
1134 (for copysigns (COPYSIGN)
1136 (coss (copysigns @0 @1))
1139 /* pow(copysign(x, y), z) -> pow(x, z) if z is an even integer. */
1141 (for copysigns (COPYSIGN)
1143 (pows (copysigns @0 @2) REAL_CST@1)
1144 (with { HOST_WIDE_INT n; }
1145 (if (real_isinteger (&TREE_REAL_CST (@1), &n) && (n & 1) == 0)
1147 /* Likewise for powi. */
1149 (for copysigns (COPYSIGN)
1151 (pows (copysigns @0 @2) INTEGER_CST@1)
1152 (if ((wi::to_wide (@1) & 1) == 0)
1156 (for copysigns (COPYSIGN)
1157 /* hypot(copysign(x, y), z) -> hypot(x, z). */
1159 (hypots (copysigns @0 @1) @2)
1161 /* hypot(x, copysign(y, z)) -> hypot(x, y). */
1163 (hypots @0 (copysigns @1 @2))
1166 /* copysign(x, CST) -> abs (x). If the target does not
1167 support the copysign optab then canonicalize
1168 copysign(x, -CST) -> fneg (abs (x)). */
1169 (for copysigns (COPYSIGN_ALL)
1171 (copysigns @0 REAL_CST@1)
1172 (if (!REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
1175 (if (!direct_internal_fn_supported_p (IFN_COPYSIGN, type,
1182 /* Transform fneg (fabs (X)) -> copysign (X, -1) as the canonical
1183 representation if the target supports the copysign optab. */
1186 (if (direct_internal_fn_supported_p (IFN_COPYSIGN, type,
1188 (IFN_COPYSIGN @0 { build_minus_one_cst (type); })))
1190 /* copysign(copysign(x, y), z) -> copysign(x, z). */
1191 (for copysigns (COPYSIGN_ALL)
1193 (copysigns (copysigns @0 @1) @2)
1196 /* copysign(x,y)*copysign(x,y) -> x*x. */
1197 (for copysigns (COPYSIGN_ALL)
1199 (mult (copysigns@2 @0 @1) @2)
1202 /* ccos(-x) -> ccos(x). Similarly for ccosh. */
1203 (for ccoss (CCOS CCOSH)
1208 /* cabs(-x) and cos(conj(x)) -> cabs(x). */
1209 (for ops (conj negate)
1215 /* Fold (a * (1 << b)) into (a << b) */
1217 (mult:c @0 (convert? (lshift integer_onep@1 @2)))
1218 (if (! FLOAT_TYPE_P (type)
1219 && tree_nop_conversion_p (type, TREE_TYPE (@1)))
1222 /* Fold a * !a into 0. */
1224 (mult:c @0 (convert? (eq @0 integer_zerop)))
1225 { build_zero_cst (type); })
1227 (mult:c @0 (vec_cond (eq @0 integer_zerop) @1 integer_zerop))
1228 { build_zero_cst (type); })
1230 (mult:c @0 (vec_cond (ne @0 integer_zerop) integer_zerop @1))
1231 { build_zero_cst (type); })
1233 /* Shifts by precision or greater result in zero. */
1234 (for shift (lshift rshift)
1236 (shift @0 uniform_integer_cst_p@1)
1237 (if ((GIMPLE || !sanitize_flags_p (SANITIZE_SHIFT_EXPONENT))
1238 /* Leave arithmetic right shifts of possibly negative values alone. */
1239 && (TYPE_UNSIGNED (type)
1240 || shift == LSHIFT_EXPR
1241 || tree_expr_nonnegative_p (@0))
1242 /* Use a signed compare to leave negative shift counts alone. */
1243 && wi::ges_p (wi::to_wide (uniform_integer_cst_p (@1)),
1244 element_precision (type)))
1245 { build_zero_cst (type); })))
1247 /* Shifts by constants distribute over several binary operations,
1248 hence (X << C) + (Y << C) can be simplified to (X + Y) << C. */
1249 (for op (plus minus)
1251 (op (lshift:s @0 @1) (lshift:s @2 @1))
1252 (if (INTEGRAL_TYPE_P (type)
1253 && TYPE_OVERFLOW_WRAPS (type)
1254 && !TYPE_SATURATING (type))
1255 (lshift (op @0 @2) @1))))
1257 (for op (bit_and bit_ior bit_xor)
1259 (op (lshift:s @0 @1) (lshift:s @2 @1))
1260 (if (INTEGRAL_TYPE_P (type))
1261 (lshift (op @0 @2) @1)))
1263 (op (rshift:s @0 @1) (rshift:s @2 @1))
1264 (if (INTEGRAL_TYPE_P (type))
1265 (rshift (op @0 @2) @1))))
1267 /* Fold (1 << (C - x)) where C = precision(type) - 1
1268 into ((1 << C) >> x). */
1270 (lshift integer_onep@0 (minus@1 INTEGER_CST@2 @3))
1271 (if (INTEGRAL_TYPE_P (type)
1272 && wi::eq_p (wi::to_wide (@2), TYPE_PRECISION (type) - 1)
1274 (if (TYPE_UNSIGNED (type))
1275 (rshift (lshift @0 @2) @3)
1277 { tree utype = unsigned_type_for (type); }
1278 (convert (rshift (lshift (convert:utype @0) @2) @3))))))
1280 /* Fold ((type)(a<0)) << SIGNBITOFA into ((type)a) & signbit. */
1282 (lshift (convert (lt @0 integer_zerop@1)) INTEGER_CST@2)
1283 (if (TYPE_SIGN (TREE_TYPE (@0)) == SIGNED
1284 && wi::eq_p (wi::to_wide (@2), TYPE_PRECISION (TREE_TYPE (@0)) - 1))
1285 (with { wide_int wone = wi::one (TYPE_PRECISION (type)); }
1286 (bit_and (convert @0)
1287 { wide_int_to_tree (type,
1288 wi::lshift (wone, wi::to_wide (@2))); }))))
1290 /* Fold (-x >> C) into -(x > 0) where C = precision(type) - 1. */
1291 (for cst (INTEGER_CST VECTOR_CST)
1293 (rshift (negate:s @0) cst@1)
1294 (if (!TYPE_UNSIGNED (type)
1295 && TYPE_OVERFLOW_UNDEFINED (type))
1296 (with { tree stype = TREE_TYPE (@1);
1297 tree bt = truth_type_for (type);
1298 tree zeros = build_zero_cst (type);
1299 tree cst = NULL_TREE; }
1301 /* Handle scalar case. */
1302 (if (INTEGRAL_TYPE_P (type)
1303 /* If we apply the rule to the scalar type before vectorization
1304 we will enforce the result of the comparison being a bool
1305 which will require an extra AND on the result that will be
1306 indistinguishable from when the user did actually want 0
1307 or 1 as the result so it can't be removed. */
1308 && canonicalize_math_after_vectorization_p ()
1309 && wi::eq_p (wi::to_wide (@1), TYPE_PRECISION (type) - 1))
1310 (negate (convert (gt @0 { zeros; }))))
1311 /* Handle vector case. */
1312 (if (VECTOR_INTEGER_TYPE_P (type)
1313 /* First check whether the target has the same mode for vector
1314 comparison results as it's operands do. */
1315 && TYPE_MODE (bt) == TYPE_MODE (type)
1316 /* Then check to see if the target is able to expand the comparison
1317 with the given type later on, otherwise we may ICE. */
1318 && expand_vec_cmp_expr_p (type, bt, GT_EXPR)
1319 && (cst = uniform_integer_cst_p (@1)) != NULL
1320 && wi::eq_p (wi::to_wide (cst), element_precision (type) - 1))
1321 (view_convert (gt:bt @0 { zeros; }))))))))
1323 /* Fold (C1/X)*C2 into (C1*C2)/X. */
1325 (mult (rdiv@3 REAL_CST@0 @1) REAL_CST@2)
1326 (if (flag_associative_math
1329 { tree tem = const_binop (MULT_EXPR, type, @0, @2); }
1331 (rdiv { tem; } @1)))))
1333 /* Simplify ~X & X as zero. */
1335 (bit_and (convert? @0) (convert? @1))
1336 (with { bool wascmp; }
1337 (if (types_match (TREE_TYPE (@0), TREE_TYPE (@1))
1338 && bitwise_inverted_equal_p (@0, @1, wascmp))
1339 { wascmp ? constant_boolean_node (false, type) : build_zero_cst (type); })))
1341 /* PR71636: Transform x & ((1U << b) - 1) -> x & ~(~0U << b); */
1343 (bit_and:c @0 (plus:s (lshift:s integer_onep @1) integer_minus_onep))
1344 (if (TYPE_UNSIGNED (type))
1345 (bit_and @0 (bit_not (lshift { build_all_ones_cst (type); } @1)))))
1347 (for bitop (bit_and bit_ior)
1349 /* PR35691: Transform
1350 (x == 0 & y == 0) -> (x | typeof(x)(y)) == 0.
1351 (x != 0 | y != 0) -> (x | typeof(x)(y)) != 0. */
1353 (bitop (cmp @0 integer_zerop@2) (cmp @1 integer_zerop))
1354 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1355 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
1356 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1)))
1357 (cmp (bit_ior @0 (convert @1)) @2)))
1359 (x == -1 & y == -1) -> (x & typeof(x)(y)) == -1.
1360 (x != -1 | y != -1) -> (x & typeof(x)(y)) != -1. */
1362 (bitop (cmp @0 integer_all_onesp@2) (cmp @1 integer_all_onesp))
1363 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1364 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
1365 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1)))
1366 (cmp (bit_and @0 (convert @1)) @2))))
1368 /* Fold (A & ~B) - (A & B) into (A ^ B) - B. */
1370 (minus (bit_and:cs @0 (bit_not @1)) (bit_and:cs @0 @1))
1371 (minus (bit_xor @0 @1) @1))
1373 (minus (bit_and:s @0 INTEGER_CST@2) (bit_and:s @0 INTEGER_CST@1))
1374 (if (~wi::to_wide (@2) == wi::to_wide (@1))
1375 (minus (bit_xor @0 @1) @1)))
1377 /* Fold (A & B) - (A & ~B) into B - (A ^ B). */
1379 (minus (bit_and:cs @0 @1) (bit_and:cs @0 (bit_not @1)))
1380 (minus @1 (bit_xor @0 @1)))
1382 /* Simplify (X & ~Y) |^+ (~X & Y) -> X ^ Y. */
1383 (for op (bit_ior bit_xor plus)
1385 (op (bit_and:c @0 @2) (bit_and:c @3 @1))
1386 (with { bool wascmp0, wascmp1; }
1387 (if (bitwise_inverted_equal_p (@2, @1, wascmp0)
1388 && bitwise_inverted_equal_p (@0, @3, wascmp1)
1389 && ((!wascmp0 && !wascmp1)
1390 || element_precision (type) == 1))
1393 /* PR53979: Transform ((a ^ b) | a) -> (a | b) */
1395 (bit_ior:c (bit_xor:c @0 @1) @0)
1398 /* (a & ~b) | (a ^ b) --> a ^ b */
1400 (bit_ior:c (bit_and:c @0 (bit_not @1)) (bit_xor:c@2 @0 @1))
1403 /* (a & ~b) ^ ~a --> ~(a & b) */
1405 (bit_xor:c (bit_and:cs @0 (bit_not @1)) (bit_not @0))
1406 (bit_not (bit_and @0 @1)))
1408 /* (~a & b) ^ a --> (a | b) */
1410 (bit_xor:c (bit_and:cs (bit_not @0) @1) @0)
1413 /* (a | b) & ~(a ^ b) --> a & b */
1415 (bit_and:c (bit_ior @0 @1) (bit_not (bit_xor:c @0 @1)))
1418 /* (a | b) & (a == b) --> a & b (boolean version of the above). */
1420 (bit_and:c (bit_ior @0 @1) (nop_convert? (eq:c @0 @1)))
1421 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1422 && TYPE_PRECISION (TREE_TYPE (@0)) == 1)
1425 /* a | ~(a ^ b) --> a | ~b */
1427 (bit_ior:c @0 (bit_not:s (bit_xor:c @0 @1)))
1428 (bit_ior @0 (bit_not @1)))
1430 /* a | (a == b) --> a | (b^1) (boolean version of the above). */
1432 (bit_ior:c @0 (nop_convert? (eq:c @0 @1)))
1433 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1434 && TYPE_PRECISION (TREE_TYPE (@0)) == 1)
1435 (bit_ior @0 (bit_xor @1 { build_one_cst (type); }))))
1437 /* a | ((~a) ^ b) --> a | (~b) (alt version of the above 2) */
1439 (bit_ior:c @0 (bit_xor:cs @1 @2))
1440 (with { bool wascmp; }
1441 (if (bitwise_inverted_equal_p (@0, @1, wascmp)
1442 && (!wascmp || element_precision (type) == 1))
1443 (bit_ior @0 (bit_not @2)))))
1445 /* a & ~(a ^ b) --> a & b */
1447 (bit_and:c @0 (bit_not (bit_xor:c @0 @1)))
1450 /* a & (a == b) --> a & b (boolean version of the above). */
1452 (bit_and:c @0 (nop_convert? (eq:c @0 @1)))
1453 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1454 && TYPE_PRECISION (TREE_TYPE (@0)) == 1)
1457 /* a & ((~a) ^ b) --> a & b (alt version of the above 2) */
1459 (bit_and:c @0 (bit_xor:c @1 @2))
1460 (with { bool wascmp; }
1461 (if (bitwise_inverted_equal_p (@0, @1, wascmp)
1462 && (!wascmp || element_precision (type) == 1))
1465 /* (a | b) | (a &^ b) --> a | b */
1466 (for op (bit_and bit_xor)
1468 (bit_ior:c (bit_ior@2 @0 @1) (op:c @0 @1))
1471 /* (a & b) | ~(a ^ b) --> ~(a ^ b) */
1473 (bit_ior:c (bit_and:c @0 @1) (bit_not@2 (bit_xor @0 @1)))
1476 /* (a & b) | (a == b) --> a == b */
1478 (bit_ior:c (bit_and:c @0 @1) (nop_convert?@2 (eq @0 @1)))
1479 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1480 && TYPE_PRECISION (TREE_TYPE (@0)) == 1)
1483 /* ~(~a & b) --> a | ~b */
1485 (bit_not (bit_and:cs (bit_not @0) @1))
1486 (bit_ior @0 (bit_not @1)))
1488 /* ~(~a | b) --> a & ~b */
1490 (bit_not (bit_ior:cs (bit_not @0) @1))
1491 (bit_and @0 (bit_not @1)))
1493 /* (a ^ b) & ((b ^ c) ^ a) --> (a ^ b) & ~c */
1495 (bit_and:c (bit_xor:c@3 @0 @1) (bit_xor:cs (bit_xor:cs @1 @2) @0))
1496 (bit_and @3 (bit_not @2)))
1498 /* (a ^ b) | ((b ^ c) ^ a) --> (a ^ b) | c */
1500 (bit_ior:c (bit_xor:c@3 @0 @1) (bit_xor:c (bit_xor:c @1 @2) @0))
1503 /* (~X | C) ^ D -> (X | C) ^ (~D ^ C) if (~D ^ C) can be simplified. */
1505 (bit_xor:c (bit_ior:cs (bit_not:s @0) @1) @2)
1506 (bit_xor (bit_ior @0 @1) (bit_xor! (bit_not! @2) @1)))
1508 /* (~X & C) ^ D -> (X & C) ^ (D ^ C) if (D ^ C) can be simplified. */
1510 (bit_xor:c (bit_and:cs (bit_not:s @0) @1) @2)
1511 (bit_xor (bit_and @0 @1) (bit_xor! @2 @1)))
1513 /* Simplify (~X & Y) to X ^ Y if we know that (X & ~Y) is 0. */
1515 (bit_and (bit_not SSA_NAME@0) INTEGER_CST@1)
1516 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1517 && wi::bit_and_not (get_nonzero_bits (@0), wi::to_wide (@1)) == 0)
1520 /* For constants M and N, if M == (1LL << cst) - 1 && (N & M) == M,
1521 ((A & N) + B) & M -> (A + B) & M
1522 Similarly if (N & M) == 0,
1523 ((A | N) + B) & M -> (A + B) & M
1524 and for - instead of + (or unary - instead of +)
1525 and/or ^ instead of |.
1526 If B is constant and (B & M) == 0, fold into A & M. */
1527 (for op (plus minus)
1528 (for bitop (bit_and bit_ior bit_xor)
1530 (bit_and (op:s (bitop:s@0 @3 INTEGER_CST@4) @1) INTEGER_CST@2)
1533 tree utype = fold_bit_and_mask (TREE_TYPE (@0), @2, op, @0, bitop,
1534 @3, @4, @1, ERROR_MARK, NULL_TREE,
1537 (convert (bit_and (op (convert:utype { pmop[0]; })
1538 (convert:utype { pmop[1]; }))
1539 (convert:utype @2))))))
1541 (bit_and (op:s @0 (bitop:s@1 @3 INTEGER_CST@4)) INTEGER_CST@2)
1544 tree utype = fold_bit_and_mask (TREE_TYPE (@0), @2, op, @0, ERROR_MARK,
1545 NULL_TREE, NULL_TREE, @1, bitop, @3,
1548 (convert (bit_and (op (convert:utype { pmop[0]; })
1549 (convert:utype { pmop[1]; }))
1550 (convert:utype @2)))))))
1552 (bit_and (op:s @0 @1) INTEGER_CST@2)
1555 tree utype = fold_bit_and_mask (TREE_TYPE (@0), @2, op, @0, ERROR_MARK,
1556 NULL_TREE, NULL_TREE, @1, ERROR_MARK,
1557 NULL_TREE, NULL_TREE, pmop); }
1559 (convert (bit_and (op (convert:utype { pmop[0]; })
1560 (convert:utype { pmop[1]; }))
1561 (convert:utype @2)))))))
1562 (for bitop (bit_and bit_ior bit_xor)
1564 (bit_and (negate:s (bitop:s@0 @2 INTEGER_CST@3)) INTEGER_CST@1)
1567 tree utype = fold_bit_and_mask (TREE_TYPE (@0), @1, NEGATE_EXPR, @0,
1568 bitop, @2, @3, NULL_TREE, ERROR_MARK,
1569 NULL_TREE, NULL_TREE, pmop); }
1571 (convert (bit_and (negate (convert:utype { pmop[0]; }))
1572 (convert:utype @1)))))))
1574 /* X % Y is smaller than Y. */
1577 (cmp:c (trunc_mod @0 @1) @1)
1578 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
1579 { constant_boolean_node (cmp == LT_EXPR, type); })))
1583 (bit_ior @0 integer_all_onesp@1)
1588 (bit_ior @0 integer_zerop)
1593 (bit_and @0 integer_zerop@1)
1598 (for op (bit_ior bit_xor)
1600 (op (convert? @0) (convert? @1))
1601 (with { bool wascmp; }
1602 (if (types_match (TREE_TYPE (@0), TREE_TYPE (@1))
1603 && bitwise_inverted_equal_p (@0, @1, wascmp))
1606 ? constant_boolean_node (true, type)
1607 : build_all_ones_cst (TREE_TYPE (@0)); })))))
1612 { build_zero_cst (type); })
1614 /* Canonicalize X ^ ~0 to ~X. */
1616 (bit_xor @0 integer_all_onesp@1)
1621 (bit_and @0 integer_all_onesp)
1624 /* x & x -> x, x | x -> x */
1625 (for bitop (bit_and bit_ior)
1630 /* x & C -> x if we know that x & ~C == 0. */
1633 (bit_and SSA_NAME@0 INTEGER_CST@1)
1634 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1635 && wi::bit_and_not (get_nonzero_bits (@0), wi::to_wide (@1)) == 0)
1638 /* `a & (x | CST)` -> a if we know that (a & ~CST) == 0 */
1640 (bit_and:c SSA_NAME@0 (bit_ior @1 INTEGER_CST@2))
1641 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1642 && wi::bit_and_not (get_nonzero_bits (@0), wi::to_wide (@2)) == 0)
1645 /* x | C -> C if we know that x & ~C == 0. */
1647 (bit_ior SSA_NAME@0 INTEGER_CST@1)
1648 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1649 && wi::bit_and_not (get_nonzero_bits (@0), wi::to_wide (@1)) == 0)
1653 /* ~(~X - Y) -> X + Y and ~(~X + Y) -> X - Y. */
1655 (bit_not (minus (bit_not @0) @1))
1658 (bit_not (plus:c (bit_not @0) @1))
1660 /* (~X - ~Y) -> Y - X. */
1662 (minus (bit_not @0) (bit_not @1))
1663 (if (!TYPE_OVERFLOW_SANITIZED (type))
1664 (with { tree utype = unsigned_type_for (type); }
1665 (convert (minus (convert:utype @1) (convert:utype @0))))))
1667 /* ~(X - Y) -> ~X + Y. */
1669 (bit_not (minus:s @0 @1))
1670 (plus (bit_not @0) @1))
1672 (bit_not (plus:s @0 INTEGER_CST@1))
1673 (if ((INTEGRAL_TYPE_P (type)
1674 && TYPE_UNSIGNED (type))
1675 || (!TYPE_OVERFLOW_SANITIZED (type)
1676 && may_negate_without_overflow_p (@1)))
1677 (plus (bit_not @0) { const_unop (NEGATE_EXPR, type, @1); })))
1680 /* ~X + Y -> (Y - X) - 1. */
1682 (plus:c (bit_not @0) @1)
1683 (if (ANY_INTEGRAL_TYPE_P (type)
1684 && TYPE_OVERFLOW_WRAPS (type)
1685 /* -1 - X is folded to ~X, so we'd recurse endlessly. */
1686 && !integer_all_onesp (@1))
1687 (plus (minus @1 @0) { build_minus_one_cst (type); })
1688 (if (INTEGRAL_TYPE_P (type)
1689 && TREE_CODE (@1) == INTEGER_CST
1690 && wi::to_wide (@1) != wi::min_value (TYPE_PRECISION (type),
1692 (minus (plus @1 { build_minus_one_cst (type); }) @0))))
1695 /* ~(X >> Y) -> ~X >> Y if ~X can be simplified. */
1697 (bit_not (rshift:s @0 @1))
1698 (if (!TYPE_UNSIGNED (TREE_TYPE (@0)))
1699 (rshift (bit_not! @0) @1)
1700 /* For logical right shifts, this is possible only if @0 doesn't
1701 have MSB set and the logical right shift is changed into
1702 arithmetic shift. */
1703 (if (INTEGRAL_TYPE_P (type)
1704 && !wi::neg_p (tree_nonzero_bits (@0)))
1705 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
1706 (convert (rshift (bit_not! (convert:stype @0)) @1))))))
1708 /* x + (x & 1) -> (x + 1) & ~1 */
1710 (plus:c @0 (bit_and:s @0 integer_onep@1))
1711 (bit_and (plus @0 @1) (bit_not @1)))
1713 /* x & ~(x & y) -> x & ~y */
1714 /* x | ~(x | y) -> x | ~y */
1715 (for bitop (bit_and bit_ior)
1717 (bitop:c @0 (bit_not (bitop:cs @0 @1)))
1718 (bitop @0 (bit_not @1))))
1720 /* (~x & y) | ~(x | y) -> ~x */
1722 (bit_ior:c (bit_and:c (bit_not@2 @0) @1) (bit_not (bit_ior:c @0 @1)))
1725 /* (x | y) ^ (x | ~y) -> ~x */
1727 (bit_xor:c (bit_ior:c @0 @1) (bit_ior:c @0 (bit_not @1)))
1730 /* (x & y) | ~(x | y) -> ~(x ^ y) */
1732 (bit_ior:c (bit_and:s @0 @1) (bit_not:s (bit_ior:s @0 @1)))
1733 (bit_not (bit_xor @0 @1)))
1735 /* (~x | y) ^ (x ^ y) -> x | ~y */
1737 (bit_xor:c (bit_ior:cs (bit_not @0) @1) (bit_xor:s @0 @1))
1738 (bit_ior @0 (bit_not @1)))
1740 /* (x ^ y) | ~(x | y) -> ~(x & y) */
1742 (bit_ior:c (bit_xor:s @0 @1) (bit_not:s (bit_ior:s @0 @1)))
1743 (bit_not (bit_and @0 @1)))
1745 /* (x & y) ^ (x | y) -> x ^ y */
1747 (bit_xor:c (bit_and @0 @1) (bit_ior @0 @1))
1750 /* (x ^ y) ^ (x | y) -> x & y */
1752 (bit_xor:c (bit_xor @0 @1) (bit_ior @0 @1))
1755 /* (x & y) + (x ^ y) -> x | y */
1756 /* (x & y) | (x ^ y) -> x | y */
1757 /* (x & y) ^ (x ^ y) -> x | y */
1758 (for op (plus bit_ior bit_xor)
1760 (op:c (bit_and @0 @1) (bit_xor @0 @1))
1763 /* (x & y) + (x | y) -> x + y */
1765 (plus:c (bit_and @0 @1) (bit_ior @0 @1))
1768 /* (x + y) - (x | y) -> x & y */
1770 (minus (plus @0 @1) (bit_ior @0 @1))
1771 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
1772 && !TYPE_SATURATING (type))
1775 /* (x + y) - (x & y) -> x | y */
1777 (minus (plus @0 @1) (bit_and @0 @1))
1778 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
1779 && !TYPE_SATURATING (type))
1782 /* (x | y) - y -> (x & ~y) */
1784 (minus (bit_ior:cs @0 @1) @1)
1785 (bit_and @0 (bit_not @1)))
1787 /* (x | y) - (x ^ y) -> x & y */
1789 (minus (bit_ior @0 @1) (bit_xor @0 @1))
1792 /* (x | y) - (x & y) -> x ^ y */
1794 (minus (bit_ior @0 @1) (bit_and @0 @1))
1797 /* (x | y) & ~(x & y) -> x ^ y */
1799 (bit_and:c (bit_ior @0 @1) (bit_not (bit_and @0 @1)))
1802 /* (x | y) & (~x ^ y) -> x & y */
1804 (bit_and:c (bit_ior:c @0 @1) (bit_xor:c @1 @2))
1805 (with { bool wascmp; }
1806 (if (bitwise_inverted_equal_p (@0, @2, wascmp)
1807 && (!wascmp || element_precision (type) == 1))
1810 /* (~x | y) & (x | ~y) -> ~(x ^ y) */
1812 (bit_and (bit_ior:cs (bit_not @0) @1) (bit_ior:cs @0 (bit_not @1)))
1813 (bit_not (bit_xor @0 @1)))
1815 /* (~x | y) ^ (x | ~y) -> x ^ y */
1817 (bit_xor (bit_ior:c (bit_not @0) @1) (bit_ior:c @0 (bit_not @1)))
1820 /* ((x & y) - (x | y)) - 1 -> ~(x ^ y) */
1822 (plus (nop_convert1? (minus@2 (nop_convert2? (bit_and:c @0 @1))
1823 (nop_convert2? (bit_ior @0 @1))))
1825 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
1826 && !TYPE_SATURATING (type) && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2))
1827 && !TYPE_OVERFLOW_TRAPS (TREE_TYPE (@2))
1828 && !TYPE_SATURATING (TREE_TYPE (@2)))
1829 (bit_not (convert (bit_xor @0 @1)))))
1831 (minus (nop_convert1? (plus@2 (nop_convert2? (bit_and:c @0 @1))
1833 (nop_convert3? (bit_ior @0 @1)))
1834 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
1835 && !TYPE_SATURATING (type) && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2))
1836 && !TYPE_OVERFLOW_TRAPS (TREE_TYPE (@2))
1837 && !TYPE_SATURATING (TREE_TYPE (@2)))
1838 (bit_not (convert (bit_xor @0 @1)))))
1840 (minus (nop_convert1? (bit_and @0 @1))
1841 (nop_convert2? (plus@2 (nop_convert3? (bit_ior:c @0 @1))
1843 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
1844 && !TYPE_SATURATING (type) && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2))
1845 && !TYPE_OVERFLOW_TRAPS (TREE_TYPE (@2))
1846 && !TYPE_SATURATING (TREE_TYPE (@2)))
1847 (bit_not (convert (bit_xor @0 @1)))))
1849 /* ~x & ~y -> ~(x | y)
1850 ~x | ~y -> ~(x & y) */
1851 (for op (bit_and bit_ior)
1852 rop (bit_ior bit_and)
1854 (op (convert1? (bit_not @0)) (convert2? (bit_not @1)))
1855 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
1856 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
1857 (bit_not (rop (convert @0) (convert @1))))))
1859 /* If we are XORing or adding two BIT_AND_EXPR's, both of which are and'ing
1860 with a constant, and the two constants have no bits in common,
1861 we should treat this as a BIT_IOR_EXPR since this may produce more
1863 (for op (bit_xor plus)
1865 (op (convert1? (bit_and@4 @0 INTEGER_CST@1))
1866 (convert2? (bit_and@5 @2 INTEGER_CST@3)))
1867 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
1868 && tree_nop_conversion_p (type, TREE_TYPE (@2))
1869 && (wi::to_wide (@1) & wi::to_wide (@3)) == 0)
1870 (bit_ior (convert @4) (convert @5)))))
1872 /* (X | Y) ^ X -> Y & ~ X*/
1874 (bit_xor:c (convert1? (bit_ior:c @@0 @1)) (convert2? @0))
1875 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1876 (convert (bit_and @1 (bit_not @0)))))
1878 /* (~X | Y) ^ X -> ~(X & Y). */
1880 (bit_xor:c (nop_convert1? (bit_ior:c (nop_convert2? (bit_not @0)) @1)) @2)
1881 (if (bitwise_equal_p (@0, @2))
1882 (convert (bit_not (bit_and @0 (convert @1))))))
1884 /* Convert ~X ^ ~Y to X ^ Y. */
1886 (bit_xor (convert1? (bit_not @0)) (convert2? (bit_not @1)))
1887 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
1888 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
1889 (bit_xor (convert @0) (convert @1))))
1891 /* Convert ~X ^ C to X ^ ~C. */
1893 (bit_xor (convert? (bit_not @0)) INTEGER_CST@1)
1894 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1895 (bit_xor (convert @0) (bit_not @1))))
1897 /* Fold (X & Y) ^ Y and (X ^ Y) & Y as ~X & Y. */
1898 (for opo (bit_and bit_xor)
1899 opi (bit_xor bit_and)
1901 (opo:c (opi:cs @0 @1) @1)
1902 (bit_and (bit_not @0) @1)))
1904 /* Given a bit-wise operation CODE applied to ARG0 and ARG1, see if both
1905 operands are another bit-wise operation with a common input. If so,
1906 distribute the bit operations to save an operation and possibly two if
1907 constants are involved. For example, convert
1908 (A | B) & (A | C) into A | (B & C)
1909 Further simplification will occur if B and C are constants. */
1910 (for op (bit_and bit_ior bit_xor)
1911 rop (bit_ior bit_and bit_and)
1913 (op (convert? (rop:c @@0 @1)) (convert? (rop:c @0 @2)))
1914 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
1915 && tree_nop_conversion_p (type, TREE_TYPE (@2)))
1916 (rop (convert @0) (op (convert @1) (convert @2))))))
1918 /* Some simple reassociation for bit operations, also handled in reassoc. */
1919 /* (X & Y) & Y -> X & Y
1920 (X | Y) | Y -> X | Y */
1921 (for op (bit_and bit_ior)
1923 (op:c (convert1?@2 (op:c @0 @@1)) (convert2? @1))
1925 /* (X ^ Y) ^ Y -> X */
1927 (bit_xor:c (convert1? (bit_xor:c @0 @@1)) (convert2? @1))
1930 /* (X & ~Y) & Y -> 0 */
1932 (bit_and:c (bit_and @0 @1) @2)
1933 (with { bool wascmp; }
1934 (if (bitwise_inverted_equal_p (@0, @2, wascmp)
1935 || bitwise_inverted_equal_p (@1, @2, wascmp))
1936 { wascmp ? constant_boolean_node (false, type) : build_zero_cst (type); })))
1937 /* (X | ~Y) | Y -> -1 */
1939 (bit_ior:c (bit_ior @0 @1) @2)
1940 (with { bool wascmp; }
1941 (if ((bitwise_inverted_equal_p (@0, @2, wascmp)
1942 || bitwise_inverted_equal_p (@1, @2, wascmp))
1943 && (!wascmp || element_precision (type) == 1))
1944 { build_all_ones_cst (TREE_TYPE (@0)); })))
1946 /* (X & Y) & (X & Z) -> (X & Y) & Z
1947 (X | Y) | (X | Z) -> (X | Y) | Z */
1948 (for op (bit_and bit_ior)
1950 (op (convert1?@3 (op:c@4 @0 @1)) (convert2?@5 (op:c@6 @0 @2)))
1951 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
1952 && tree_nop_conversion_p (type, TREE_TYPE (@2)))
1953 (if (single_use (@5) && single_use (@6))
1954 (op @3 (convert @2))
1955 (if (single_use (@3) && single_use (@4))
1956 (op (convert @1) @5))))))
1957 /* (X ^ Y) ^ (X ^ Z) -> Y ^ Z */
1959 (bit_xor (convert1? (bit_xor:c @0 @1)) (convert2? (bit_xor:c @0 @2)))
1960 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
1961 && tree_nop_conversion_p (type, TREE_TYPE (@2)))
1962 (bit_xor (convert @1) (convert @2))))
1964 /* Convert abs (abs (X)) into abs (X).
1965 also absu (absu (X)) into absu (X). */
1971 (absu (convert@2 (absu@1 @0)))
1972 (if (tree_nop_conversion_p (TREE_TYPE (@2), TREE_TYPE (@1)))
1975 /* Convert abs[u] (-X) -> abs[u] (X). */
1984 /* Convert abs[u] (X) where X is nonnegative -> (X). */
1986 (abs tree_expr_nonnegative_p@0)
1990 (absu tree_expr_nonnegative_p@0)
1993 /* Simplify (-(X < 0) | 1) * X into abs (X) or absu(X). */
1995 (mult:c (nop_convert1?
1996 (bit_ior (nop_convert2? (negate (convert? (lt @0 integer_zerop))))
1999 (if (INTEGRAL_TYPE_P (type)
2000 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
2001 && !TYPE_UNSIGNED (TREE_TYPE (@0)))
2002 (if (TYPE_UNSIGNED (type))
2009 /* A few cases of fold-const.cc negate_expr_p predicate. */
2010 (match negate_expr_p
2012 (if ((INTEGRAL_TYPE_P (type)
2013 && TYPE_UNSIGNED (type))
2014 || (!TYPE_OVERFLOW_SANITIZED (type)
2015 && may_negate_without_overflow_p (t)))))
2016 (match negate_expr_p
2018 (match negate_expr_p
2020 (if (!TYPE_OVERFLOW_SANITIZED (type))))
2021 (match negate_expr_p
2023 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (t)))))
2024 /* VECTOR_CST handling of non-wrapping types would recurse in unsupported
2026 (match negate_expr_p
2028 (if (FLOAT_TYPE_P (TREE_TYPE (type)) || TYPE_OVERFLOW_WRAPS (type))))
2029 (match negate_expr_p
2031 (if ((ANY_INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_WRAPS (type))
2032 || (FLOAT_TYPE_P (type)
2033 && !HONOR_SIGN_DEPENDENT_ROUNDING (type)
2034 && !HONOR_SIGNED_ZEROS (type)))))
2036 /* (-A) * (-B) -> A * B */
2038 (mult:c (convert1? (negate @0)) (convert2? negate_expr_p@1))
2039 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
2040 && tree_nop_conversion_p (type, TREE_TYPE (@1)))
2041 (mult (convert @0) (convert (negate @1)))))
2043 /* -(A + B) -> (-B) - A. */
2045 (negate (plus:c @0 negate_expr_p@1))
2046 (if (!HONOR_SIGN_DEPENDENT_ROUNDING (type)
2047 && !HONOR_SIGNED_ZEROS (type))
2048 (minus (negate @1) @0)))
2050 /* -(A - B) -> B - A. */
2052 (negate (minus @0 @1))
2053 (if ((ANY_INTEGRAL_TYPE_P (type) && !TYPE_OVERFLOW_SANITIZED (type))
2054 || (FLOAT_TYPE_P (type)
2055 && !HONOR_SIGN_DEPENDENT_ROUNDING (type)
2056 && !HONOR_SIGNED_ZEROS (type)))
2059 (negate (pointer_diff @0 @1))
2060 (if (TYPE_OVERFLOW_UNDEFINED (type))
2061 (pointer_diff @1 @0)))
2063 /* A - B -> A + (-B) if B is easily negatable. */
2065 (minus @0 negate_expr_p@1)
2066 (if (!FIXED_POINT_TYPE_P (type))
2067 (plus @0 (negate @1))))
2069 /* 1 - a is a ^ 1 if a had a bool range. */
2070 /* This is only enabled for gimple as sometimes
2071 cfun is not set for the function which contains
2072 the SSA_NAME (e.g. while IPA passes are happening,
2073 fold might be called). */
2075 (minus integer_onep@0 SSA_NAME@1)
2076 (if (INTEGRAL_TYPE_P (type)
2077 && ssa_name_has_boolean_range (@1))
2080 /* Other simplifications of negation (c.f. fold_negate_expr_1). */
2082 (negate (mult:c@0 @1 negate_expr_p@2))
2083 (if (! TYPE_UNSIGNED (type)
2084 && ! HONOR_SIGN_DEPENDENT_ROUNDING (type)
2086 (mult @1 (negate @2))))
2089 (negate (rdiv@0 @1 negate_expr_p@2))
2090 (if (! HONOR_SIGN_DEPENDENT_ROUNDING (type)
2092 (rdiv @1 (negate @2))))
2095 (negate (rdiv@0 negate_expr_p@1 @2))
2096 (if (! HONOR_SIGN_DEPENDENT_ROUNDING (type)
2098 (rdiv (negate @1) @2)))
2100 /* Fold -((int)x >> (prec - 1)) into (unsigned)x >> (prec - 1). */
2102 (negate (convert? (rshift @0 INTEGER_CST@1)))
2103 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
2104 && wi::to_wide (@1) == element_precision (type) - 1)
2105 (with { tree stype = TREE_TYPE (@0);
2106 tree ntype = TYPE_UNSIGNED (stype) ? signed_type_for (stype)
2107 : unsigned_type_for (stype); }
2108 (if (VECTOR_TYPE_P (type))
2109 (view_convert (rshift (view_convert:ntype @0) @1))
2110 (convert (rshift (convert:ntype @0) @1))))))
2112 /* Try to fold (type) X op CST -> (type) (X op ((type-x) CST))
2114 For bitwise binary operations apply operand conversions to the
2115 binary operation result instead of to the operands. This allows
2116 to combine successive conversions and bitwise binary operations.
2117 We combine the above two cases by using a conditional convert. */
2118 (for bitop (bit_and bit_ior bit_xor)
2120 (bitop (convert@2 @0) (convert?@3 @1))
2121 (if (((TREE_CODE (@1) == INTEGER_CST
2122 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
2123 && (int_fits_type_p (@1, TREE_TYPE (@0))
2124 || tree_nop_conversion_p (TREE_TYPE (@0), type)))
2125 || types_match (@0, @1))
2126 && !POINTER_TYPE_P (TREE_TYPE (@0))
2127 && !VECTOR_TYPE_P (TREE_TYPE (@0))
2128 && TREE_CODE (TREE_TYPE (@0)) != OFFSET_TYPE
2129 /* ??? This transform conflicts with fold-const.cc doing
2130 Convert (T)(x & c) into (T)x & (T)c, if c is an integer
2131 constants (if x has signed type, the sign bit cannot be set
2132 in c). This folds extension into the BIT_AND_EXPR.
2133 Restrict it to GIMPLE to avoid endless recursions. */
2134 && (bitop != BIT_AND_EXPR || GIMPLE)
2135 && (/* That's a good idea if the conversion widens the operand, thus
2136 after hoisting the conversion the operation will be narrower.
2137 It is also a good if the conversion is a nop as moves the
2138 conversion to one side; allowing for combining of the conversions. */
2139 TYPE_PRECISION (TREE_TYPE (@0)) < TYPE_PRECISION (type)
2140 /* The conversion check for being a nop can only be done at the gimple
2141 level as fold_binary has some re-association code which can conflict
2142 with this if there is a "constant" which is not a full INTEGER_CST. */
2143 || (GIMPLE && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (type))
2144 /* It's also a good idea if the conversion is to a non-integer
2146 || GET_MODE_CLASS (TYPE_MODE (type)) != MODE_INT
2147 /* Or if the precision of TO is not the same as the precision
2149 || !type_has_mode_precision_p (type)
2150 /* In GIMPLE, getting rid of 2 conversions for one new results
2153 && TREE_CODE (@1) != INTEGER_CST
2154 && tree_nop_conversion_p (type, TREE_TYPE (@0))
2156 && single_use (@3))))
2157 (convert (bitop @0 (convert @1)))))
2158 /* In GIMPLE, getting rid of 2 conversions for one new results
2161 (convert (bitop:cs@2 (nop_convert:s @0) @1))
2163 && TREE_CODE (@1) != INTEGER_CST
2164 && tree_nop_conversion_p (type, TREE_TYPE (@2))
2165 && types_match (type, @0)
2166 && !POINTER_TYPE_P (TREE_TYPE (@0))
2167 && TREE_CODE (TREE_TYPE (@0)) != OFFSET_TYPE)
2168 (bitop @0 (convert @1)))))
2170 (for bitop (bit_and bit_ior)
2171 rbitop (bit_ior bit_and)
2172 /* (x | y) & x -> x */
2173 /* (x & y) | x -> x */
2175 (bitop:c (rbitop:c @0 @1) @0)
2177 /* (~x | y) & x -> x & y */
2178 /* (~x & y) | x -> x | y */
2180 (bitop:c (rbitop:c @2 @1) @0)
2181 (with { bool wascmp; }
2182 (if (bitwise_inverted_equal_p (@0, @2, wascmp)
2183 && (!wascmp || element_precision (type) == 1))
2185 /* (x | y) & (x & z) -> (x & z) */
2186 /* (x & y) | (x | z) -> (x | z) */
2188 (bitop:c (rbitop:c @0 @1) (bitop:c@3 @0 @2))
2190 /* (x | c) & ~(y | c) -> x & ~(y | c) */
2191 /* (x & c) | ~(y & c) -> x | ~(y & c) */
2193 (bitop:c (rbitop:c @0 @1) (bit_not@3 (rbitop:c @1 @2)))
2195 /* x & ~(y | x) -> 0 */
2196 /* x | ~(y & x) -> -1 */
2198 (bitop:c @0 (bit_not (rbitop:c @0 @1)))
2199 (if (bitop == BIT_AND_EXPR)
2200 { build_zero_cst (type); }
2201 { build_minus_one_cst (type); })))
2203 /* ((x | y) & z) | x -> (z & y) | x
2204 ((x ^ y) & z) | x -> (z & y) | x */
2205 (for op (bit_ior bit_xor)
2207 (bit_ior:c (nop_convert1?:s
2208 (bit_and:cs (nop_convert2?:s (op:cs @0 @1)) @2)) @3)
2209 (if (bitwise_equal_p (@0, @3))
2210 (convert (bit_ior (bit_and @1 (convert @2)) (convert @0))))))
2212 /* (x | CST1) & CST2 -> (x & CST2) | (CST1 & CST2) */
2214 (bit_and (bit_ior @0 CONSTANT_CLASS_P@1) CONSTANT_CLASS_P@2)
2215 (bit_ior (bit_and @0 @2) (bit_and! @1 @2)))
2217 /* Combine successive equal operations with constants. */
2218 (for bitop (bit_and bit_ior bit_xor)
2220 (bitop (bitop @0 CONSTANT_CLASS_P@1) CONSTANT_CLASS_P@2)
2221 (if (!CONSTANT_CLASS_P (@0))
2222 /* This is the canonical form regardless of whether (bitop @1 @2) can be
2223 folded to a constant. */
2224 (bitop @0 (bitop! @1 @2))
2225 /* In this case we have three constants and (bitop @0 @1) doesn't fold
2226 to a constant. This can happen if @0 or @1 is a POLY_INT_CST and if
2227 the values involved are such that the operation can't be decided at
2228 compile time. Try folding one of @0 or @1 with @2 to see whether
2229 that combination can be decided at compile time.
2231 Keep the existing form if both folds fail, to avoid endless
2233 (with { tree cst1 = const_binop (bitop, type, @0, @2); }
2235 (bitop @1 { cst1; })
2236 (with { tree cst2 = const_binop (bitop, type, @1, @2); }
2238 (bitop @0 { cst2; }))))))))
2240 /* Try simple folding for X op !X, and X op X with the help
2241 of the truth_valued_p and logical_inverted_value predicates. */
2242 (match truth_valued_p
2244 (if (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) == 1)))
2245 (for op (tcc_comparison truth_and truth_andif truth_or truth_orif truth_xor)
2246 (match truth_valued_p
2248 (match truth_valued_p
2251 (match (logical_inverted_value @0)
2253 (match (logical_inverted_value @0)
2254 (bit_not truth_valued_p@0))
2255 (match (logical_inverted_value @0)
2256 (eq @0 integer_zerop))
2257 (match (logical_inverted_value @0)
2258 (ne truth_valued_p@0 integer_truep))
2259 (match (logical_inverted_value @0)
2260 (bit_xor truth_valued_p@0 integer_truep))
2264 (bit_and:c @0 (logical_inverted_value @0))
2265 { build_zero_cst (type); })
2266 /* X | !X and X ^ !X -> 1, , if X is truth-valued. */
2267 (for op (bit_ior bit_xor)
2269 (op:c truth_valued_p@0 (logical_inverted_value @0))
2270 { constant_boolean_node (true, type); }))
2271 /* X ==/!= !X is false/true. */
2274 (op:c truth_valued_p@0 (logical_inverted_value @0))
2275 { constant_boolean_node (op == NE_EXPR ? true : false, type); }))
2279 (bit_not (bit_not @0))
2282 /* zero_one_valued_p will match when a value is known to be either
2283 0 or 1 including constants 0 or 1.
2284 Signed 1-bits includes -1 so they cannot match here. */
2285 (match zero_one_valued_p
2287 (if (INTEGRAL_TYPE_P (type)
2288 && (TYPE_UNSIGNED (type)
2289 || TYPE_PRECISION (type) > 1)
2290 && wi::leu_p (tree_nonzero_bits (@0), 1))))
2291 (match zero_one_valued_p
2293 (if (INTEGRAL_TYPE_P (type)
2294 && (TYPE_UNSIGNED (type)
2295 || TYPE_PRECISION (type) > 1))))
2297 /* (a&1) is always [0,1] too. This is useful again when
2298 the range is not known. */
2299 /* Note this can't be recursive due to VN handling of equivalents,
2300 VN and would cause an infinite recursion. */
2301 (match zero_one_valued_p
2302 (bit_and:c@0 @1 integer_onep)
2303 (if (INTEGRAL_TYPE_P (type))))
2305 /* A conversion from an zero_one_valued_p is still a [0,1].
2306 This is useful when the range of a variable is not known */
2307 /* Note this matches can't be recursive because of the way VN handles
2308 nop conversions being equivalent and then recursive between them. */
2309 (match zero_one_valued_p
2311 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2312 && (TYPE_UNSIGNED (TREE_TYPE (@1))
2313 || TYPE_PRECISION (TREE_TYPE (@1)) > 1)
2314 && INTEGRAL_TYPE_P (type)
2315 && (TYPE_UNSIGNED (type)
2316 || TYPE_PRECISION (type) > 1)
2317 && wi::leu_p (tree_nonzero_bits (@1), 1))))
2319 /* Transform { 0 or 1 } * { 0 or 1 } into { 0 or 1 } & { 0 or 1 }. */
2321 (mult zero_one_valued_p@0 zero_one_valued_p@1)
2322 (if (INTEGRAL_TYPE_P (type))
2325 (for cmp (tcc_comparison)
2326 icmp (inverted_tcc_comparison)
2327 /* Fold (((a < b) & c) | ((a >= b) & d)) into (a < b ? c : d) & 1. */
2330 (bit_and:c (convert? (cmp@0 @01 @02)) @3)
2331 (bit_and:c (convert? (icmp@4 @01 @02)) @5))
2332 (if (INTEGRAL_TYPE_P (type)
2333 && invert_tree_comparison (cmp, HONOR_NANS (@01)) == icmp
2334 /* The scalar version has to be canonicalized after vectorization
2335 because it makes unconditional loads conditional ones, which
2336 means we lose vectorization because the loads may trap. */
2337 && canonicalize_math_after_vectorization_p ())
2338 (bit_and (cond @0 @3 @5) { build_one_cst (type); })))
2340 /* Fold ((-(a < b) & c) | (-(a >= b) & d)) into a < b ? c : d. This is
2341 canonicalized further and we recognize the conditional form:
2342 (a < b ? c : 0) | (a >= b ? d : 0) into a < b ? c : d. */
2345 (cond (cmp@0 @01 @02) @3 zerop)
2346 (cond (icmp@4 @01 @02) @5 zerop))
2347 (if (INTEGRAL_TYPE_P (type)
2348 && invert_tree_comparison (cmp, HONOR_NANS (@01)) == icmp
2349 /* The scalar version has to be canonicalized after vectorization
2350 because it makes unconditional loads conditional ones, which
2351 means we lose vectorization because the loads may trap. */
2352 && canonicalize_math_after_vectorization_p ())
2355 /* Vector Fold (((a < b) & c) | ((a >= b) & d)) into a < b ? c : d.
2356 and ((~(a < b) & c) | (~(a >= b) & d)) into a < b ? c : d. */
2359 (bit_and:c (vec_cond:s (cmp@0 @6 @7) @4 @5) @2)
2360 (bit_and:c (vec_cond:s (icmp@1 @6 @7) @4 @5) @3))
2361 (if (integer_zerop (@5)
2362 && invert_tree_comparison (cmp, HONOR_NANS (@6)) == icmp)
2364 (if (integer_onep (@4))
2365 (bit_and (vec_cond @0 @2 @3) @4))
2366 (if (integer_minus_onep (@4))
2367 (vec_cond @0 @2 @3)))
2368 (if (integer_zerop (@4)
2369 && invert_tree_comparison (cmp, HONOR_NANS (@6)) == icmp)
2371 (if (integer_onep (@5))
2372 (bit_and (vec_cond @0 @3 @2) @5))
2373 (if (integer_minus_onep (@5))
2374 (vec_cond @0 @3 @2))))))
2376 /* Scalar Vectorized Fold ((-(a < b) & c) | (-(a >= b) & d))
2377 into a < b ? d : c. */
2380 (vec_cond:s (cmp@0 @4 @5) @2 integer_zerop)
2381 (vec_cond:s (icmp@1 @4 @5) @3 integer_zerop))
2382 (if (invert_tree_comparison (cmp, HONOR_NANS (@4)) == icmp)
2383 (vec_cond @0 @2 @3))))
2385 /* Transform X & -Y into X * Y when Y is { 0 or 1 }. */
2387 (bit_and:c (convert? (negate zero_one_valued_p@0)) @1)
2388 (if (INTEGRAL_TYPE_P (type)
2389 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
2390 && TREE_CODE (TREE_TYPE (@0)) != BOOLEAN_TYPE
2391 /* Sign extending of the neg or a truncation of the neg
2393 && (!TYPE_UNSIGNED (TREE_TYPE (@0))
2394 || TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))))
2395 (mult (convert @0) @1)))
2397 /* Narrow integer multiplication by a zero_one_valued_p operand.
2398 Multiplication by [0,1] is guaranteed not to overflow. */
2400 (convert (mult@0 zero_one_valued_p@1 INTEGER_CST@2))
2401 (if (INTEGRAL_TYPE_P (type)
2402 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
2403 && TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (@0)))
2404 (mult (convert @1) (convert @2))))
2406 /* (X << C) != 0 can be simplified to X, when C is zero_one_valued_p.
2407 Check that the shift is well-defined (C is less than TYPE_PRECISION)
2408 as some targets (such as x86's SSE) may return zero for larger C. */
2410 (ne (lshift zero_one_valued_p@0 INTEGER_CST@1) integer_zerop@2)
2411 (if (tree_fits_shwi_p (@1)
2412 && tree_to_shwi (@1) > 0
2413 && tree_to_shwi (@1) < TYPE_PRECISION (TREE_TYPE (@0)))
2416 /* (X << C) == 0 can be simplified to X == 0, when C is zero_one_valued_p.
2417 Check that the shift is well-defined (C is less than TYPE_PRECISION)
2418 as some targets (such as x86's SSE) may return zero for larger C. */
2420 (eq (lshift zero_one_valued_p@0 INTEGER_CST@1) integer_zerop@2)
2421 (if (tree_fits_shwi_p (@1)
2422 && tree_to_shwi (@1) > 0
2423 && tree_to_shwi (@1) < TYPE_PRECISION (TREE_TYPE (@0)))
2426 /* Convert ~ (-A) to A - 1. */
2428 (bit_not (convert? (negate @0)))
2429 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
2430 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
2431 (convert (minus @0 { build_each_one_cst (TREE_TYPE (@0)); }))))
2433 /* Convert - (~A) to A + 1. */
2435 (negate (nop_convert? (bit_not @0)))
2436 (plus (view_convert @0) { build_each_one_cst (type); }))
2438 /* (a & b) ^ (a == b) -> !(a | b) */
2439 /* (a & b) == (a ^ b) -> !(a | b) */
2440 (for first_op (bit_xor eq)
2441 second_op (eq bit_xor)
2443 (first_op:c (bit_and:c truth_valued_p@0 truth_valued_p@1) (second_op:c @0 @1))
2444 (bit_not (bit_ior @0 @1))))
2446 /* Convert ~ (A - 1) or ~ (A + -1) to -A. */
2448 (bit_not (convert? (minus @0 integer_each_onep)))
2449 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
2450 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
2451 (convert (negate @0))))
2453 (bit_not (convert? (plus @0 integer_all_onesp)))
2454 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
2455 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
2456 (convert (negate @0))))
2458 /* Part of convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */
2460 (bit_not (convert? (bit_xor @0 INTEGER_CST@1)))
2461 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2462 (convert (bit_xor @0 (bit_not @1)))))
2464 (bit_not (convert? (bit_xor:c (bit_not @0) @1)))
2465 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2466 (convert (bit_xor @0 @1))))
2468 /* Otherwise prefer ~(X ^ Y) to ~X ^ Y as more canonical. */
2470 (bit_xor:c (nop_convert?:s (bit_not:s @0)) @1)
2471 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2472 (bit_not (bit_xor (view_convert @0) @1))))
2474 /* ~(a ^ b) is a == b for truth valued a and b. */
2476 (bit_not (bit_xor:s truth_valued_p@0 truth_valued_p@1))
2477 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2478 && TYPE_PRECISION (TREE_TYPE (@0)) == 1)
2479 (convert (eq @0 @1))))
2481 /* (~a) == b is a ^ b for truth valued a and b. */
2483 (eq:c (bit_not:s truth_valued_p@0) truth_valued_p@1)
2484 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2485 && TYPE_PRECISION (TREE_TYPE (@0)) == 1)
2486 (convert (bit_xor @0 @1))))
2488 /* (x & ~m) | (y & m) -> ((x ^ y) & m) ^ x */
2490 (bit_ior:c (bit_and:cs @0 (bit_not @2)) (bit_and:cs @1 @2))
2491 (bit_xor (bit_and (bit_xor @0 @1) @2) @0))
2493 /* Fold A - (A & B) into ~B & A. */
2495 (minus (convert1? @0) (convert2?:s (bit_and:cs @@0 @1)))
2496 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
2497 && tree_nop_conversion_p (type, TREE_TYPE (@1)))
2498 (convert (bit_and (bit_not @1) @0))))
2500 /* (m1 CMP m2) * d -> (m1 CMP m2) ? d : 0 */
2501 (if (!canonicalize_math_p ())
2502 (for cmp (tcc_comparison)
2504 (mult:c (convert (cmp@0 @1 @2)) @3)
2505 (if (INTEGRAL_TYPE_P (type)
2506 && INTEGRAL_TYPE_P (TREE_TYPE (@0)))
2507 (cond @0 @3 { build_zero_cst (type); })))
2508 /* (-(m1 CMP m2)) & d -> (m1 CMP m2) ? d : 0 */
2510 (bit_and:c (negate (convert (cmp@0 @1 @2))) @3)
2511 (if (INTEGRAL_TYPE_P (type)
2512 && INTEGRAL_TYPE_P (TREE_TYPE (@0)))
2513 (cond @0 @3 { build_zero_cst (type); })))
2517 /* For integral types with undefined overflow and C != 0 fold
2518 x * C EQ/NE y * C into x EQ/NE y. */
2521 (cmp (mult:c @0 @1) (mult:c @2 @1))
2522 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2523 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2524 && tree_expr_nonzero_p (@1))
2527 /* For integral types with wrapping overflow and C odd fold
2528 x * C EQ/NE y * C into x EQ/NE y. */
2531 (cmp (mult @0 INTEGER_CST@1) (mult @2 @1))
2532 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2533 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))
2534 && (TREE_INT_CST_LOW (@1) & 1) != 0)
2537 /* For integral types with undefined overflow and C != 0 fold
2538 x * C RELOP y * C into:
2540 x RELOP y for nonnegative C
2541 y RELOP x for negative C */
2542 (for cmp (lt gt le ge)
2544 (cmp (mult:c @0 @1) (mult:c @2 @1))
2545 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2546 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
2547 (if (tree_expr_nonnegative_p (@1) && tree_expr_nonzero_p (@1))
2549 (if (TREE_CODE (@1) == INTEGER_CST
2550 && wi::neg_p (wi::to_wide (@1), TYPE_SIGN (TREE_TYPE (@1))))
2553 /* (X - 1U) <= INT_MAX-1U into (int) X > 0. */
2557 (cmp (plus @0 integer_minus_onep@1) INTEGER_CST@2)
2558 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2559 && TYPE_UNSIGNED (TREE_TYPE (@0))
2560 && TYPE_PRECISION (TREE_TYPE (@0)) > 1
2561 && (wi::to_wide (@2)
2562 == wi::max_value (TYPE_PRECISION (TREE_TYPE (@0)), SIGNED) - 1))
2563 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
2564 (icmp (convert:stype @0) { build_int_cst (stype, 0); })))))
2566 /* X / 4 < Y / 4 iff X < Y when the division is known to be exact. */
2567 (for cmp (simple_comparison)
2569 (cmp (convert?@3 (exact_div @0 INTEGER_CST@2)) (convert? (exact_div @1 @2)))
2570 (if (element_precision (@3) >= element_precision (@0)
2571 && types_match (@0, @1))
2572 (if (wi::lt_p (wi::to_wide (@2), 0, TYPE_SIGN (TREE_TYPE (@2))))
2573 (if (!TYPE_UNSIGNED (TREE_TYPE (@3)))
2575 (if (tree_expr_nonzero_p (@0) && tree_expr_nonzero_p (@1))
2578 tree utype = unsigned_type_for (TREE_TYPE (@0));
2580 (cmp (convert:utype @1) (convert:utype @0)))))
2581 (if (wi::gt_p (wi::to_wide (@2), 1, TYPE_SIGN (TREE_TYPE (@2))))
2582 (if (TYPE_UNSIGNED (TREE_TYPE (@0)) || !TYPE_UNSIGNED (TREE_TYPE (@3)))
2586 tree utype = unsigned_type_for (TREE_TYPE (@0));
2588 (cmp (convert:utype @0) (convert:utype @1)))))))))
2590 /* X / C1 op C2 into a simple range test. */
2591 (for cmp (simple_comparison)
2593 (cmp (trunc_div:s @0 INTEGER_CST@1) INTEGER_CST@2)
2594 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2595 && integer_nonzerop (@1)
2596 && !TREE_OVERFLOW (@1)
2597 && !TREE_OVERFLOW (@2))
2598 (with { tree lo, hi; bool neg_overflow;
2599 enum tree_code code = fold_div_compare (cmp, @1, @2, &lo, &hi,
2602 (if (code == LT_EXPR || code == GE_EXPR)
2603 (if (TREE_OVERFLOW (lo))
2604 { build_int_cst (type, (code == LT_EXPR) ^ neg_overflow); }
2605 (if (code == LT_EXPR)
2608 (if (code == LE_EXPR || code == GT_EXPR)
2609 (if (TREE_OVERFLOW (hi))
2610 { build_int_cst (type, (code == LE_EXPR) ^ neg_overflow); }
2611 (if (code == LE_EXPR)
2615 { build_int_cst (type, code == NE_EXPR); })
2616 (if (code == EQ_EXPR && !hi)
2618 (if (code == EQ_EXPR && !lo)
2620 (if (code == NE_EXPR && !hi)
2622 (if (code == NE_EXPR && !lo)
2625 { build_range_check (UNKNOWN_LOCATION, type, @0, code == EQ_EXPR,
2629 tree etype = range_check_type (TREE_TYPE (@0));
2632 hi = fold_convert (etype, hi);
2633 lo = fold_convert (etype, lo);
2634 hi = const_binop (MINUS_EXPR, etype, hi, lo);
2637 (if (etype && hi && !TREE_OVERFLOW (hi))
2638 (if (code == EQ_EXPR)
2639 (le (minus (convert:etype @0) { lo; }) { hi; })
2640 (gt (minus (convert:etype @0) { lo; }) { hi; })))))))))
2642 /* X + Z < Y + Z is the same as X < Y when there is no overflow. */
2643 (for op (lt le ge gt)
2645 (op (plus:c @0 @2) (plus:c @1 @2))
2646 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2647 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
2650 /* As a special case, X + C < Y + C is the same as (signed) X < (signed) Y
2651 when C is an unsigned integer constant with only the MSB set, and X and
2652 Y have types of equal or lower integer conversion rank than C's. */
2653 (for op (lt le ge gt)
2655 (op (plus @1 INTEGER_CST@0) (plus @2 @0))
2656 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2657 && TYPE_UNSIGNED (TREE_TYPE (@0))
2658 && wi::only_sign_bit_p (wi::to_wide (@0)))
2659 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
2660 (op (convert:stype @1) (convert:stype @2))))))
2662 /* For equality and subtraction, this is also true with wrapping overflow. */
2663 (for op (eq ne minus)
2665 (op (plus:c @0 @2) (plus:c @1 @2))
2666 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2667 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2668 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
2670 /* And similar for pointers. */
2673 (op (pointer_plus @0 @1) (pointer_plus @0 @2))
2676 (pointer_diff (pointer_plus @0 @1) (pointer_plus @0 @2))
2677 (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
2678 (convert (minus @1 @2))))
2680 /* X - Z < Y - Z is the same as X < Y when there is no overflow. */
2681 (for op (lt le ge gt)
2683 (op (minus @0 @2) (minus @1 @2))
2684 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2685 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
2687 /* For equality and subtraction, this is also true with wrapping overflow. */
2688 (for op (eq ne minus)
2690 (op (minus @0 @2) (minus @1 @2))
2691 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2692 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2693 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
2695 /* And for pointers... */
2696 (for op (simple_comparison)
2698 (op (pointer_diff@3 @0 @2) (pointer_diff @1 @2))
2699 (if (!TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
2702 (minus (pointer_diff@3 @0 @2) (pointer_diff @1 @2))
2703 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@3))
2704 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
2705 (pointer_diff @0 @1)))
2707 /* Z - X < Z - Y is the same as Y < X when there is no overflow. */
2708 (for op (lt le ge gt)
2710 (op (minus @2 @0) (minus @2 @1))
2711 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2712 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
2714 /* For equality and subtraction, this is also true with wrapping overflow. */
2715 (for op (eq ne minus)
2717 (op (minus @2 @0) (minus @2 @1))
2718 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2719 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2720 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
2722 /* And for pointers... */
2723 (for op (simple_comparison)
2725 (op (pointer_diff@3 @2 @0) (pointer_diff @2 @1))
2726 (if (!TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
2729 (minus (pointer_diff@3 @2 @0) (pointer_diff @2 @1))
2730 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@3))
2731 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
2732 (pointer_diff @1 @0)))
2734 /* X + Y < Y is the same as X < 0 when there is no overflow. */
2735 (for op (lt le gt ge)
2737 (op:c (plus:c@2 @0 @1) @1)
2738 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2739 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2740 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0))
2741 && (CONSTANT_CLASS_P (@0) || single_use (@2)))
2742 (op @0 { build_zero_cst (TREE_TYPE (@0)); }))))
2743 /* For equality, this is also true with wrapping overflow. */
2746 (op:c (nop_convert?@3 (plus:c@2 @0 (convert1? @1))) (convert2? @1))
2747 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2748 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2749 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
2750 && (CONSTANT_CLASS_P (@0) || (single_use (@2) && single_use (@3)))
2751 && tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@2))
2752 && tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@1)))
2753 (op @0 { build_zero_cst (TREE_TYPE (@0)); })))
2755 (op:c (nop_convert?@3 (pointer_plus@2 (convert1? @0) @1)) (convert2? @0))
2756 (if (tree_nop_conversion_p (TREE_TYPE (@2), TREE_TYPE (@0))
2757 && tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0))
2758 && (CONSTANT_CLASS_P (@1) || (single_use (@2) && single_use (@3))))
2759 (op @1 { build_zero_cst (TREE_TYPE (@1)); }))))
2761 /* (&a + b) !=/== (&a[1] + c) -> (&a[0] - &a[1]) + b !=/== c */
2764 (neeq:c ADDR_EXPR@0 (pointer_plus @2 @3))
2765 (with { poly_int64 diff; tree inner_type = TREE_TYPE (@3);}
2766 (if (ptr_difference_const (@0, @2, &diff))
2767 (neeq { build_int_cst_type (inner_type, diff); } @3))))
2769 (neeq (pointer_plus ADDR_EXPR@0 @1) (pointer_plus ADDR_EXPR@2 @3))
2770 (with { poly_int64 diff; tree inner_type = TREE_TYPE (@1);}
2771 (if (ptr_difference_const (@0, @2, &diff))
2772 (neeq (plus { build_int_cst_type (inner_type, diff); } @1) @3)))))
2774 /* X - Y < X is the same as Y > 0 when there is no overflow.
2775 For equality, this is also true with wrapping overflow. */
2776 (for op (simple_comparison)
2778 (op:c @0 (minus@2 @0 @1))
2779 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2780 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2781 || ((op == EQ_EXPR || op == NE_EXPR)
2782 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
2783 && (CONSTANT_CLASS_P (@1) || single_use (@2)))
2784 (op @1 { build_zero_cst (TREE_TYPE (@1)); }))))
2787 (X / Y) == 0 -> X < Y if X, Y are unsigned.
2788 (X / Y) != 0 -> X >= Y, if X, Y are unsigned. */
2792 (cmp (trunc_div @0 @1) integer_zerop)
2793 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
2794 /* Complex ==/!= is allowed, but not </>=. */
2795 && TREE_CODE (TREE_TYPE (@0)) != COMPLEX_TYPE
2796 && (VECTOR_TYPE_P (type) || !VECTOR_TYPE_P (TREE_TYPE (@0))))
2799 /* X == C - X can never be true if C is odd. */
2802 (cmp:c (convert? @0) (convert1? (minus INTEGER_CST@1 (convert2? @0))))
2803 (if (TREE_INT_CST_LOW (@1) & 1)
2804 { constant_boolean_node (cmp == NE_EXPR, type); })))
2809 U needs to be non-negative.
2813 U and N needs to be non-negative
2817 U needs to be non-negative and N needs to be a negative constant.
2819 (for cmp (lt ge le gt )
2820 bitop (bit_ior bit_ior bit_and bit_and)
2822 (cmp:c (bitop:c tree_expr_nonnegative_p@0 @1) @0)
2823 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)))
2824 (if (bitop == BIT_AND_EXPR || tree_expr_nonnegative_p (@1))
2825 { constant_boolean_node (cmp == GE_EXPR || cmp == LE_EXPR, type); }
2826 /* The sign is opposite now so the comparison is swapped around. */
2827 (if (TREE_CODE (@1) == INTEGER_CST && wi::neg_p (wi::to_wide (@1)))
2828 { constant_boolean_node (cmp == LT_EXPR, type); })))))
2830 /* Arguments on which one can call get_nonzero_bits to get the bits
2832 (match with_possible_nonzero_bits
2834 (match with_possible_nonzero_bits
2836 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))))
2837 /* Slightly extended version, do not make it recursive to keep it cheap. */
2838 (match (with_possible_nonzero_bits2 @0)
2839 with_possible_nonzero_bits@0)
2840 (match (with_possible_nonzero_bits2 @0)
2841 (bit_and:c with_possible_nonzero_bits@0 @2))
2843 /* Same for bits that are known to be set, but we do not have
2844 an equivalent to get_nonzero_bits yet. */
2845 (match (with_certain_nonzero_bits2 @0)
2847 (match (with_certain_nonzero_bits2 @0)
2848 (bit_ior @1 INTEGER_CST@0))
2850 /* X == C (or X & Z == Y | C) is impossible if ~nonzero(X) & C != 0. */
2853 (cmp:c (with_possible_nonzero_bits2 @0) (with_certain_nonzero_bits2 @1))
2854 (if (wi::bit_and_not (wi::to_wide (@1), get_nonzero_bits (@0)) != 0)
2855 { constant_boolean_node (cmp == NE_EXPR, type); })))
2857 /* ((X inner_op C0) outer_op C1)
2858 With X being a tree where value_range has reasoned certain bits to always be
2859 zero throughout its computed value range,
2860 inner_op = {|,^}, outer_op = {|,^} and inner_op != outer_op
2861 where zero_mask has 1's for all bits that are sure to be 0 in
2863 if (inner_op == '^') C0 &= ~C1;
2864 if ((C0 & ~zero_mask) == 0) then emit (X outer_op (C0 outer_op C1)
2865 if ((C1 & ~zero_mask) == 0) then emit (X inner_op (C0 outer_op C1)
2867 (for inner_op (bit_ior bit_xor)
2868 outer_op (bit_xor bit_ior)
2871 (inner_op:s @2 INTEGER_CST@0) INTEGER_CST@1)
2875 wide_int zero_mask_not;
2879 if (TREE_CODE (@2) == SSA_NAME)
2880 zero_mask_not = get_nonzero_bits (@2);
2884 if (inner_op == BIT_XOR_EXPR)
2886 C0 = wi::bit_and_not (wi::to_wide (@0), wi::to_wide (@1));
2887 cst_emit = C0 | wi::to_wide (@1);
2891 C0 = wi::to_wide (@0);
2892 cst_emit = C0 ^ wi::to_wide (@1);
2895 (if (!fail && (C0 & zero_mask_not) == 0)
2896 (outer_op @2 { wide_int_to_tree (type, cst_emit); })
2897 (if (!fail && (wi::to_wide (@1) & zero_mask_not) == 0)
2898 (inner_op @2 { wide_int_to_tree (type, cst_emit); }))))))
2900 /* Associate (p +p off1) +p off2 as (p +p (off1 + off2)). */
2902 (pointer_plus (pointer_plus:s @0 @1) @3)
2903 (pointer_plus @0 (plus @1 @3)))
2906 (pointer_plus (convert:s (pointer_plus:s @0 @1)) @3)
2907 (convert:type (pointer_plus @0 (plus @1 @3))))
2914 tem4 = (unsigned long) tem3;
2919 (pointer_plus @0 (convert?@2 (minus@3 (convert @1) (convert @0))))
2920 /* Conditionally look through a sign-changing conversion. */
2921 (if (TYPE_PRECISION (TREE_TYPE (@2)) == TYPE_PRECISION (TREE_TYPE (@3))
2922 && ((GIMPLE && useless_type_conversion_p (type, TREE_TYPE (@1)))
2923 || (GENERIC && type == TREE_TYPE (@1))))
2926 (pointer_plus @0 (convert?@2 (pointer_diff@3 @1 @@0)))
2927 (if (TYPE_PRECISION (TREE_TYPE (@2)) >= TYPE_PRECISION (TREE_TYPE (@3)))
2931 tem = (sizetype) ptr;
2935 and produce the simpler and easier to analyze with respect to alignment
2936 ... = ptr & ~algn; */
2938 (pointer_plus @0 (negate (bit_and (convert @0) INTEGER_CST@1)))
2939 (with { tree algn = wide_int_to_tree (TREE_TYPE (@0), ~wi::to_wide (@1)); }
2940 (bit_and @0 { algn; })))
2942 /* Try folding difference of addresses. */
2944 (minus (convert ADDR_EXPR@0) (convert (pointer_plus @1 @2)))
2945 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2946 (with { poly_int64 diff; }
2947 (if (ptr_difference_const (@0, @1, &diff))
2948 (minus { build_int_cst_type (type, diff); } (convert @2))))))
2950 (minus (convert (pointer_plus @0 @2)) (convert ADDR_EXPR@1))
2951 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2952 (with { poly_int64 diff; }
2953 (if (ptr_difference_const (@0, @1, &diff))
2954 (plus (convert @2) { build_int_cst_type (type, diff); })))))
2956 (minus (convert ADDR_EXPR@0) (convert @1))
2957 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2958 (with { poly_int64 diff; }
2959 (if (ptr_difference_const (@0, @1, &diff))
2960 { build_int_cst_type (type, diff); }))))
2962 (minus (convert @0) (convert ADDR_EXPR@1))
2963 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2964 (with { poly_int64 diff; }
2965 (if (ptr_difference_const (@0, @1, &diff))
2966 { build_int_cst_type (type, diff); }))))
2968 (pointer_diff (convert?@2 ADDR_EXPR@0) (convert1?@3 @1))
2969 (if (tree_nop_conversion_p (TREE_TYPE(@2), TREE_TYPE (@0))
2970 && tree_nop_conversion_p (TREE_TYPE(@3), TREE_TYPE (@1)))
2971 (with { poly_int64 diff; }
2972 (if (ptr_difference_const (@0, @1, &diff))
2973 { build_int_cst_type (type, diff); }))))
2975 (pointer_diff (convert?@2 @0) (convert1?@3 ADDR_EXPR@1))
2976 (if (tree_nop_conversion_p (TREE_TYPE(@2), TREE_TYPE (@0))
2977 && tree_nop_conversion_p (TREE_TYPE(@3), TREE_TYPE (@1)))
2978 (with { poly_int64 diff; }
2979 (if (ptr_difference_const (@0, @1, &diff))
2980 { build_int_cst_type (type, diff); }))))
2982 /* (&a+b) - (&a[1] + c) -> sizeof(a[0]) + (b - c) */
2984 (pointer_diff (pointer_plus ADDR_EXPR@0 @1) (pointer_plus ADDR_EXPR@2 @3))
2985 (with { poly_int64 diff; }
2986 (if (ptr_difference_const (@0, @2, &diff))
2987 (plus { build_int_cst_type (type, diff); } (convert (minus @1 @3))))))
2988 /* (p + b) - &p->d -> offsetof (*p, d) + b */
2990 (pointer_diff (pointer_plus @0 @1) ADDR_EXPR@2)
2991 (with { poly_int64 diff; }
2992 (if (ptr_difference_const (@0, @2, &diff))
2993 (plus { build_int_cst_type (type, diff); } (convert @1)))))
2995 (pointer_diff ADDR_EXPR@0 (pointer_plus @1 @2))
2996 (with { poly_int64 diff; }
2997 (if (ptr_difference_const (@0, @1, &diff))
2998 (minus { build_int_cst_type (type, diff); } (convert @2)))))
3000 /* Canonicalize (T *)(ptr - ptr-cst) to &MEM[ptr + -ptr-cst]. */
3002 (convert (pointer_diff @0 INTEGER_CST@1))
3003 (if (POINTER_TYPE_P (type))
3004 { build_fold_addr_expr_with_type
3005 (build2 (MEM_REF, char_type_node, @0,
3006 wide_int_to_tree (ptr_type_node, wi::neg (wi::to_wide (@1)))),
3009 /* If arg0 is derived from the address of an object or function, we may
3010 be able to fold this expression using the object or function's
3013 (bit_and (convert? @0) INTEGER_CST@1)
3014 (if (POINTER_TYPE_P (TREE_TYPE (@0))
3015 && tree_nop_conversion_p (type, TREE_TYPE (@0)))
3019 unsigned HOST_WIDE_INT bitpos;
3020 get_pointer_alignment_1 (@0, &align, &bitpos);
3022 (if (wi::ltu_p (wi::to_wide (@1), align / BITS_PER_UNIT))
3023 { wide_int_to_tree (type, (wi::to_wide (@1)
3024 & (bitpos / BITS_PER_UNIT))); }))))
3027 uniform_integer_cst_p
3029 tree int_cst = uniform_integer_cst_p (t);
3030 tree inner_type = TREE_TYPE (int_cst);
3032 (if ((INTEGRAL_TYPE_P (inner_type)
3033 || POINTER_TYPE_P (inner_type))
3034 && wi::eq_p (wi::to_wide (int_cst), wi::min_value (inner_type))))))
3037 uniform_integer_cst_p
3039 tree int_cst = uniform_integer_cst_p (t);
3040 tree itype = TREE_TYPE (int_cst);
3042 (if ((INTEGRAL_TYPE_P (itype)
3043 || POINTER_TYPE_P (itype))
3044 && wi::eq_p (wi::to_wide (int_cst), wi::max_value (itype))))))
3046 /* x > y && x != XXX_MIN --> x > y
3047 x > y && x == XXX_MIN --> false . */
3050 (bit_and:c (gt:c@2 @0 @1) (eqne @0 min_value))
3052 (if (eqne == EQ_EXPR)
3053 { constant_boolean_node (false, type); })
3054 (if (eqne == NE_EXPR)
3058 /* x < y && x != XXX_MAX --> x < y
3059 x < y && x == XXX_MAX --> false. */
3062 (bit_and:c (lt:c@2 @0 @1) (eqne @0 max_value))
3064 (if (eqne == EQ_EXPR)
3065 { constant_boolean_node (false, type); })
3066 (if (eqne == NE_EXPR)
3070 /* x <= y && x == XXX_MIN --> x == XXX_MIN. */
3072 (bit_and:c (le:c @0 @1) (eq@2 @0 min_value))
3075 /* x >= y && x == XXX_MAX --> x == XXX_MAX. */
3077 (bit_and:c (ge:c @0 @1) (eq@2 @0 max_value))
3080 /* x > y || x != XXX_MIN --> x != XXX_MIN. */
3082 (bit_ior:c (gt:c @0 @1) (ne@2 @0 min_value))
3085 /* x <= y || x != XXX_MIN --> true. */
3087 (bit_ior:c (le:c @0 @1) (ne @0 min_value))
3088 { constant_boolean_node (true, type); })
3090 /* x <= y || x == XXX_MIN --> x <= y. */
3092 (bit_ior:c (le:c@2 @0 @1) (eq @0 min_value))
3095 /* x < y || x != XXX_MAX --> x != XXX_MAX. */
3097 (bit_ior:c (lt:c @0 @1) (ne@2 @0 max_value))
3100 /* x >= y || x != XXX_MAX --> true
3101 x >= y || x == XXX_MAX --> x >= y. */
3104 (bit_ior:c (ge:c@2 @0 @1) (eqne @0 max_value))
3106 (if (eqne == EQ_EXPR)
3108 (if (eqne == NE_EXPR)
3109 { constant_boolean_node (true, type); }))))
3111 /* y == XXX_MIN || x < y --> x <= y - 1 */
3113 (bit_ior:c (eq:s @1 min_value) (lt:cs @0 @1))
3114 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
3115 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
3116 (le @0 (minus @1 { build_int_cst (TREE_TYPE (@1), 1); }))))
3118 /* y != XXX_MIN && x >= y --> x > y - 1 */
3120 (bit_and:c (ne:s @1 min_value) (ge:cs @0 @1))
3121 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
3122 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
3123 (gt @0 (minus @1 { build_int_cst (TREE_TYPE (@1), 1); }))))
3125 /* Convert (X == CST1) && ((other)X OP2 CST2) to a known value
3126 based on CST1 OP2 CST2. Similarly for (X != CST1). */
3127 /* Convert (X == Y) && (X OP2 Y) to a known value if X is an integral type.
3128 Similarly for (X != Y). */
3131 (for code2 (eq ne lt gt le ge)
3133 (bit_and:c (code1:c@3 @0 @1) (code2:c@4 (convert?@c0 @0) @2))
3134 (if ((TREE_CODE (@1) == INTEGER_CST
3135 && TREE_CODE (@2) == INTEGER_CST)
3136 || ((INTEGRAL_TYPE_P (TREE_TYPE (@1))
3137 || POINTER_TYPE_P (TREE_TYPE (@1)))
3138 && bitwise_equal_p (@1, @2)))
3141 bool one_before = false;
3142 bool one_after = false;
3144 bool allbits = true;
3145 if (TREE_CODE (@1) == INTEGER_CST
3146 && TREE_CODE (@2) == INTEGER_CST)
3148 allbits = TYPE_PRECISION (TREE_TYPE (@1)) <= TYPE_PRECISION (TREE_TYPE (@2));
3149 auto t1 = wi::to_wide (fold_convert (TREE_TYPE (@2), @1));
3150 auto t2 = wi::to_wide (@2);
3151 cmp = wi::cmp (t1, t2, TYPE_SIGN (TREE_TYPE (@2)));
3162 case EQ_EXPR: val = (cmp == 0); break;
3163 case NE_EXPR: val = (cmp != 0); break;
3164 case LT_EXPR: val = (cmp < 0); break;
3165 case GT_EXPR: val = (cmp > 0); break;
3166 case LE_EXPR: val = (cmp <= 0); break;
3167 case GE_EXPR: val = (cmp >= 0); break;
3168 default: gcc_unreachable ();
3172 (if (code1 == EQ_EXPR && val) @3)
3173 (if (code1 == EQ_EXPR && !val) { constant_boolean_node (false, type); })
3174 (if (code1 == NE_EXPR && !val && allbits) @4)
3175 (if (code1 == NE_EXPR
3179 (gt @c0 (convert @1)))
3180 (if (code1 == NE_EXPR
3184 (lt @c0 (convert @1)))
3185 /* (a != (b+1)) & (a > b) -> a > (b+1) */
3186 (if (code1 == NE_EXPR
3190 (gt @c0 (convert @1)))
3191 /* (a != (b-1)) & (a < b) -> a < (b-1) */
3192 (if (code1 == NE_EXPR
3196 (lt @c0 (convert @1)))
3204 /* Convert (X OP1 CST1) && (X OP2 CST2).
3205 Convert (X OP1 Y) && (X OP2 Y). */
3207 (for code1 (lt le gt ge)
3208 (for code2 (lt le gt ge)
3210 (bit_and (code1:c@3 @0 @1) (code2:c@4 @0 @2))
3211 (if ((TREE_CODE (@1) == INTEGER_CST
3212 && TREE_CODE (@2) == INTEGER_CST)
3213 || ((INTEGRAL_TYPE_P (TREE_TYPE (@1))
3214 || POINTER_TYPE_P (TREE_TYPE (@1)))
3215 && operand_equal_p (@1, @2)))
3219 if (TREE_CODE (@1) == INTEGER_CST
3220 && TREE_CODE (@2) == INTEGER_CST)
3221 cmp = tree_int_cst_compare (@1, @2);
3224 /* Choose the more restrictive of two < or <= comparisons. */
3225 (if ((code1 == LT_EXPR || code1 == LE_EXPR)
3226 && (code2 == LT_EXPR || code2 == LE_EXPR))
3227 (if ((cmp < 0) || (cmp == 0 && code1 == LT_EXPR))
3230 /* Likewise chose the more restrictive of two > or >= comparisons. */
3231 (if ((code1 == GT_EXPR || code1 == GE_EXPR)
3232 && (code2 == GT_EXPR || code2 == GE_EXPR))
3233 (if ((cmp > 0) || (cmp == 0 && code1 == GT_EXPR))
3236 /* Check for singleton ranges. */
3238 && ((code1 == LE_EXPR && code2 == GE_EXPR)
3239 || (code1 == GE_EXPR && code2 == LE_EXPR)))
3241 /* Check for disjoint ranges. */
3243 && (code1 == LT_EXPR || code1 == LE_EXPR)
3244 && (code2 == GT_EXPR || code2 == GE_EXPR))
3245 { constant_boolean_node (false, type); })
3247 && (code1 == GT_EXPR || code1 == GE_EXPR)
3248 && (code2 == LT_EXPR || code2 == LE_EXPR))
3249 { constant_boolean_node (false, type); })
3252 /* Convert (X == CST1) || (X OP2 CST2) to a known value
3253 based on CST1 OP2 CST2. Similarly for (X != CST1). */
3254 /* Convert (X == Y) || (X OP2 Y) to a known value if X is an integral type.
3255 Similarly for (X != Y). */
3258 (for code2 (eq ne lt gt le ge)
3260 (bit_ior:c (code1:c@3 @0 @1) (code2:c@4 (convert?@c0 @0) @2))
3261 (if ((TREE_CODE (@1) == INTEGER_CST
3262 && TREE_CODE (@2) == INTEGER_CST)
3263 || ((INTEGRAL_TYPE_P (TREE_TYPE (@1))
3264 || POINTER_TYPE_P (TREE_TYPE (@1)))
3265 && bitwise_equal_p (@1, @2)))
3268 bool one_before = false;
3269 bool one_after = false;
3271 bool allbits = true;
3272 if (TREE_CODE (@1) == INTEGER_CST
3273 && TREE_CODE (@2) == INTEGER_CST)
3275 allbits = TYPE_PRECISION (TREE_TYPE (@1)) <= TYPE_PRECISION (TREE_TYPE (@2));
3276 auto t1 = wi::to_wide (fold_convert (TREE_TYPE (@2), @1));
3277 auto t2 = wi::to_wide (@2);
3278 cmp = wi::cmp (t1, t2, TYPE_SIGN (TREE_TYPE (@2)));
3289 case EQ_EXPR: val = (cmp == 0); break;
3290 case NE_EXPR: val = (cmp != 0); break;
3291 case LT_EXPR: val = (cmp < 0); break;
3292 case GT_EXPR: val = (cmp > 0); break;
3293 case LE_EXPR: val = (cmp <= 0); break;
3294 case GE_EXPR: val = (cmp >= 0); break;
3295 default: gcc_unreachable ();
3299 (if (code1 == EQ_EXPR && val) @4)
3300 (if (code1 == NE_EXPR && val && allbits) { constant_boolean_node (true, type); })
3301 (if (code1 == NE_EXPR && !val && allbits) @3)
3302 (if (code1 == EQ_EXPR
3307 (if (code1 == EQ_EXPR
3312 /* (a == (b-1)) | (a >= b) -> a >= (b-1) */
3313 (if (code1 == EQ_EXPR
3317 (ge @c0 (convert @1)))
3318 /* (a == (b+1)) | (a <= b) -> a <= (b-1) */
3319 (if (code1 == EQ_EXPR
3323 (le @c0 (convert @1)))
3331 /* Convert (X OP1 CST1) || (X OP2 CST2).
3332 Convert (X OP1 Y) || (X OP2 Y). */
3334 (for code1 (lt le gt ge)
3335 (for code2 (lt le gt ge)
3337 (bit_ior (code1@3 @0 @1) (code2@4 @0 @2))
3338 (if ((TREE_CODE (@1) == INTEGER_CST
3339 && TREE_CODE (@2) == INTEGER_CST)
3340 || ((INTEGRAL_TYPE_P (TREE_TYPE (@1))
3341 || POINTER_TYPE_P (TREE_TYPE (@1)))
3342 && operand_equal_p (@1, @2)))
3346 if (TREE_CODE (@1) == INTEGER_CST
3347 && TREE_CODE (@2) == INTEGER_CST)
3348 cmp = tree_int_cst_compare (@1, @2);
3351 /* Choose the more restrictive of two < or <= comparisons. */
3352 (if ((code1 == LT_EXPR || code1 == LE_EXPR)
3353 && (code2 == LT_EXPR || code2 == LE_EXPR))
3354 (if ((cmp < 0) || (cmp == 0 && code1 == LT_EXPR))
3357 /* Likewise chose the more restrictive of two > or >= comparisons. */
3358 (if ((code1 == GT_EXPR || code1 == GE_EXPR)
3359 && (code2 == GT_EXPR || code2 == GE_EXPR))
3360 (if ((cmp > 0) || (cmp == 0 && code1 == GT_EXPR))
3363 /* Check for singleton ranges. */
3365 && ((code1 == LT_EXPR && code2 == GT_EXPR)
3366 || (code1 == GT_EXPR && code2 == LT_EXPR)))
3368 /* Check for disjoint ranges. */
3370 && (code1 == LT_EXPR || code1 == LE_EXPR)
3371 && (code2 == GT_EXPR || code2 == GE_EXPR))
3372 { constant_boolean_node (true, type); })
3374 && (code1 == GT_EXPR || code1 == GE_EXPR)
3375 && (code2 == LT_EXPR || code2 == LE_EXPR))
3376 { constant_boolean_node (true, type); })
3379 /* Optimize (a CMP b) ^ (a CMP b) */
3380 /* Optimize (a CMP b) != (a CMP b) */
3381 (for op (bit_xor ne)
3382 (for cmp1 (lt lt lt le le le)
3383 cmp2 (gt eq ne ge eq ne)
3384 rcmp (ne le gt ne lt ge)
3386 (op:c (cmp1:c @0 @1) (cmp2:c @0 @1))
3387 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))
3390 /* Optimize (a CMP b) == (a CMP b) */
3391 (for cmp1 (lt lt lt le le le)
3392 cmp2 (gt eq ne ge eq ne)
3393 rcmp (eq gt le eq ge lt)
3395 (eq:c (cmp1:c @0 @1) (cmp2:c @0 @1))
3396 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))
3399 /* (type)([0,1]@a != 0) -> (type)a
3400 (type)([0,1]@a == 1) -> (type)a
3401 (type)([0,1]@a == 0) -> a ^ 1
3402 (type)([0,1]@a != 1) -> a ^ 1. */
3405 (convert (eqne zero_one_valued_p@0 INTEGER_CST@1))
3406 (if ((integer_zerop (@1) || integer_onep (@1)))
3407 (if ((eqne == EQ_EXPR) ^ integer_zerop (@1))
3409 /* Only do this if the types match as (type)(a == 0) is
3410 canonical form normally, while `a ^ 1` is canonical when
3411 there is no type change. */
3412 (if (types_match (type, TREE_TYPE (@0)))
3413 (bit_xor @0 { build_one_cst (type); } ))))))
3415 /* We can't reassociate at all for saturating types. */
3416 (if (!TYPE_SATURATING (type))
3418 /* Contract negates. */
3419 /* A + (-B) -> A - B */
3421 (plus:c @0 (convert? (negate @1)))
3422 /* Apply STRIP_NOPS on the negate. */
3423 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
3424 && !TYPE_OVERFLOW_SANITIZED (type))
3428 if (INTEGRAL_TYPE_P (type)
3429 && TYPE_OVERFLOW_WRAPS (type) != TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
3430 t1 = TYPE_OVERFLOW_WRAPS (type) ? type : TREE_TYPE (@1);
3432 (convert (minus (convert:t1 @0) (convert:t1 @1))))))
3433 /* A - (-B) -> A + B */
3435 (minus @0 (convert? (negate @1)))
3436 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
3437 && !TYPE_OVERFLOW_SANITIZED (type))
3441 if (INTEGRAL_TYPE_P (type)
3442 && TYPE_OVERFLOW_WRAPS (type) != TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
3443 t1 = TYPE_OVERFLOW_WRAPS (type) ? type : TREE_TYPE (@1);
3445 (convert (plus (convert:t1 @0) (convert:t1 @1))))))
3447 Sign-extension is ok except for INT_MIN, which thankfully cannot
3448 happen without overflow. */
3450 (negate (convert (negate @1)))
3451 (if (INTEGRAL_TYPE_P (type)
3452 && (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@1))
3453 || (!TYPE_UNSIGNED (TREE_TYPE (@1))
3454 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))))
3455 && !TYPE_OVERFLOW_SANITIZED (type)
3456 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@1)))
3459 (negate (convert negate_expr_p@1))
3460 (if (SCALAR_FLOAT_TYPE_P (type)
3461 && ((DECIMAL_FLOAT_TYPE_P (type)
3462 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@1))
3463 && TYPE_PRECISION (type) >= TYPE_PRECISION (TREE_TYPE (@1)))
3464 || !HONOR_SIGN_DEPENDENT_ROUNDING (type)))
3465 (convert (negate @1))))
3467 (negate (nop_convert? (negate @1)))
3468 (if (!TYPE_OVERFLOW_SANITIZED (type)
3469 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@1)))
3472 /* We can't reassociate floating-point unless -fassociative-math
3473 or fixed-point plus or minus because of saturation to +-Inf. */
3474 (if ((!FLOAT_TYPE_P (type) || flag_associative_math)
3475 && !FIXED_POINT_TYPE_P (type))
3477 /* Match patterns that allow contracting a plus-minus pair
3478 irrespective of overflow issues. */
3479 /* (A +- B) - A -> +- B */
3480 /* (A +- B) -+ B -> A */
3481 /* A - (A +- B) -> -+ B */
3482 /* A +- (B -+ A) -> +- B */
3484 (minus (nop_convert1? (plus:c (nop_convert2? @0) @1)) @0)
3487 (minus (nop_convert1? (minus (nop_convert2? @0) @1)) @0)
3488 (if (!ANY_INTEGRAL_TYPE_P (type)
3489 || TYPE_OVERFLOW_WRAPS (type))
3490 (negate (view_convert @1))
3491 (view_convert (negate @1))))
3493 (plus:c (nop_convert1? (minus @0 (nop_convert2? @1))) @1)
3496 (minus @0 (nop_convert1? (plus:c (nop_convert2? @0) @1)))
3497 (if (!ANY_INTEGRAL_TYPE_P (type)
3498 || TYPE_OVERFLOW_WRAPS (type))
3499 (negate (view_convert @1))
3500 (view_convert (negate @1))))
3502 (minus @0 (nop_convert1? (minus (nop_convert2? @0) @1)))
3504 /* (A +- B) + (C - A) -> C +- B */
3505 /* (A + B) - (A - C) -> B + C */
3506 /* More cases are handled with comparisons. */
3508 (plus:c (plus:c @0 @1) (minus @2 @0))
3511 (plus:c (minus @0 @1) (minus @2 @0))
3514 (plus:c (pointer_diff @0 @1) (pointer_diff @2 @0))
3515 (if (TYPE_OVERFLOW_UNDEFINED (type)
3516 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0)))
3517 (pointer_diff @2 @1)))
3519 (minus (plus:c @0 @1) (minus @0 @2))
3522 /* (A +- CST1) +- CST2 -> A + CST3
3523 Use view_convert because it is safe for vectors and equivalent for
3525 (for outer_op (plus minus)
3526 (for inner_op (plus minus)
3527 neg_inner_op (minus plus)
3529 (outer_op (nop_convert? (inner_op @0 CONSTANT_CLASS_P@1))
3531 /* If one of the types wraps, use that one. */
3532 (if (!ANY_INTEGRAL_TYPE_P (type) || TYPE_OVERFLOW_WRAPS (type))
3533 /* If all 3 captures are CONSTANT_CLASS_P, punt, as we might recurse
3534 forever if something doesn't simplify into a constant. */
3535 (if (!CONSTANT_CLASS_P (@0))
3536 (if (outer_op == PLUS_EXPR)
3537 (plus (view_convert @0) (inner_op! @2 (view_convert @1)))
3538 (minus (view_convert @0) (neg_inner_op! @2 (view_convert @1)))))
3539 (if (!ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3540 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
3541 (if (outer_op == PLUS_EXPR)
3542 (view_convert (plus @0 (inner_op! (view_convert @2) @1)))
3543 (view_convert (minus @0 (neg_inner_op! (view_convert @2) @1))))
3544 /* If the constant operation overflows we cannot do the transform
3545 directly as we would introduce undefined overflow, for example
3546 with (a - 1) + INT_MIN. */
3547 (if (types_match (type, @0) && !TYPE_OVERFLOW_SANITIZED (type))
3548 (with { tree cst = const_binop (outer_op == inner_op
3549 ? PLUS_EXPR : MINUS_EXPR,
3552 (if (INTEGRAL_TYPE_P (type) && !TREE_OVERFLOW (cst))
3553 (inner_op @0 { cst; } )
3554 /* X+INT_MAX+1 is X-INT_MIN. */
3555 (if (INTEGRAL_TYPE_P (type)
3556 && wi::to_wide (cst) == wi::min_value (type))
3557 (neg_inner_op @0 { wide_int_to_tree (type, wi::to_wide (cst)); })
3558 /* Last resort, use some unsigned type. */
3559 (with { tree utype = unsigned_type_for (type); }
3561 (view_convert (inner_op
3562 (view_convert:utype @0)
3564 { TREE_OVERFLOW (cst)
3565 ? drop_tree_overflow (cst) : cst; })))))))))))))))
3567 /* (CST1 - A) +- CST2 -> CST3 - A */
3568 (for outer_op (plus minus)
3570 (outer_op (nop_convert? (minus CONSTANT_CLASS_P@1 @0)) CONSTANT_CLASS_P@2)
3571 /* If one of the types wraps, use that one. */
3572 (if (!ANY_INTEGRAL_TYPE_P (type) || TYPE_OVERFLOW_WRAPS (type))
3573 /* If all 3 captures are CONSTANT_CLASS_P, punt, as we might recurse
3574 forever if something doesn't simplify into a constant. */
3575 (if (!CONSTANT_CLASS_P (@0))
3576 (minus (outer_op! (view_convert @1) @2) (view_convert @0)))
3577 (if (!ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3578 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
3579 (view_convert (minus (outer_op! @1 (view_convert @2)) @0))
3580 (if (types_match (type, @0) && !TYPE_OVERFLOW_SANITIZED (type))
3581 (with { tree cst = const_binop (outer_op, type, @1, @2); }
3582 (if (cst && !TREE_OVERFLOW (cst))
3583 (minus { cst; } @0))))))))
3585 /* CST1 - (CST2 - A) -> CST3 + A
3586 Use view_convert because it is safe for vectors and equivalent for
3589 (minus CONSTANT_CLASS_P@1 (nop_convert? (minus CONSTANT_CLASS_P@2 @0)))
3590 /* If one of the types wraps, use that one. */
3591 (if (!ANY_INTEGRAL_TYPE_P (type) || TYPE_OVERFLOW_WRAPS (type))
3592 /* If all 3 captures are CONSTANT_CLASS_P, punt, as we might recurse
3593 forever if something doesn't simplify into a constant. */
3594 (if (!CONSTANT_CLASS_P (@0))
3595 (plus (view_convert @0) (minus! @1 (view_convert @2))))
3596 (if (!ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3597 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
3598 (view_convert (plus @0 (minus! (view_convert @1) @2)))
3599 (if (types_match (type, @0) && !TYPE_OVERFLOW_SANITIZED (type))
3600 (with { tree cst = const_binop (MINUS_EXPR, type, @1, @2); }
3601 (if (cst && !TREE_OVERFLOW (cst))
3602 (plus { cst; } @0)))))))
3604 /* ((T)(A)) + CST -> (T)(A + CST) */
3607 (plus (convert:s SSA_NAME@0) INTEGER_CST@1)
3608 (if (TREE_CODE (TREE_TYPE (@0)) == INTEGER_TYPE
3609 && TREE_CODE (type) == INTEGER_TYPE
3610 && TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (@0))
3611 && int_fits_type_p (@1, TREE_TYPE (@0)))
3612 /* Perform binary operation inside the cast if the constant fits
3613 and (A + CST)'s range does not overflow. */
3616 wi::overflow_type min_ovf = wi::OVF_OVERFLOW,
3617 max_ovf = wi::OVF_OVERFLOW;
3618 tree inner_type = TREE_TYPE (@0);
3621 = wide_int::from (wi::to_wide (@1), TYPE_PRECISION (inner_type),
3622 TYPE_SIGN (inner_type));
3625 if (get_global_range_query ()->range_of_expr (vr, @0)
3626 && !vr.varying_p () && !vr.undefined_p ())
3628 wide_int wmin0 = vr.lower_bound ();
3629 wide_int wmax0 = vr.upper_bound ();
3630 wi::add (wmin0, w1, TYPE_SIGN (inner_type), &min_ovf);
3631 wi::add (wmax0, w1, TYPE_SIGN (inner_type), &max_ovf);
3634 (if (min_ovf == wi::OVF_NONE && max_ovf == wi::OVF_NONE)
3635 (convert (plus @0 { wide_int_to_tree (TREE_TYPE (@0), w1); } )))
3639 /* ((T)(A + CST1)) + CST2 -> (T)(A) + (T)CST1 + CST2 */
3641 (for op (plus minus)
3643 (plus (convert:s (op:s @0 INTEGER_CST@1)) INTEGER_CST@2)
3644 (if (TREE_CODE (TREE_TYPE (@0)) == INTEGER_TYPE
3645 && TREE_CODE (type) == INTEGER_TYPE
3646 && TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (@0))
3647 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
3648 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0))
3649 && TYPE_OVERFLOW_WRAPS (type))
3650 (plus (convert @0) (op @2 (convert @1))))))
3653 /* (T)(A) +- (T)(B) -> (T)(A +- B) only when (A +- B) could be simplified
3654 to a simple value. */
3655 (for op (plus minus)
3657 (op (convert @0) (convert @1))
3658 (if (INTEGRAL_TYPE_P (type)
3659 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
3660 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))
3661 && types_match (TREE_TYPE (@0), TREE_TYPE (@1))
3662 && !TYPE_OVERFLOW_TRAPS (type)
3663 && !TYPE_OVERFLOW_SANITIZED (type))
3664 (convert (op! @0 @1)))))
3668 (plus:c (convert? (bit_not @0)) (convert? @0))
3669 (if (!TYPE_OVERFLOW_TRAPS (type))
3670 (convert { build_all_ones_cst (TREE_TYPE (@0)); })))
3674 (plus (convert? (bit_not @0)) integer_each_onep)
3675 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
3676 (negate (convert @0))))
3680 (minus (convert? (negate @0)) integer_each_onep)
3681 (if (!TYPE_OVERFLOW_TRAPS (type)
3682 && TREE_CODE (type) != COMPLEX_TYPE
3683 && tree_nop_conversion_p (type, TREE_TYPE (@0)))
3684 (bit_not (convert @0))))
3688 (minus integer_all_onesp @0)
3689 (if (TREE_CODE (type) != COMPLEX_TYPE)
3692 /* (T)(P + A) - (T)P -> (T) A */
3694 (minus (convert (plus:c @@0 @1))
3696 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
3697 /* For integer types, if A has a smaller type
3698 than T the result depends on the possible
3700 E.g. T=size_t, A=(unsigned)429497295, P>0.
3701 However, if an overflow in P + A would cause
3702 undefined behavior, we can assume that there
3704 || (INTEGRAL_TYPE_P (TREE_TYPE (@1))
3705 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))))
3708 (minus (convert (pointer_plus @@0 @1))
3710 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
3711 /* For pointer types, if the conversion of A to the
3712 final type requires a sign- or zero-extension,
3713 then we have to punt - it is not defined which
3715 || (POINTER_TYPE_P (TREE_TYPE (@0))
3716 && TREE_CODE (@1) == INTEGER_CST
3717 && tree_int_cst_sign_bit (@1) == 0))
3720 (pointer_diff (pointer_plus @@0 @1) @0)
3721 /* The second argument of pointer_plus must be interpreted as signed, and
3722 thus sign-extended if necessary. */
3723 (with { tree stype = signed_type_for (TREE_TYPE (@1)); }
3724 /* Use view_convert instead of convert here, as POINTER_PLUS_EXPR
3725 second arg is unsigned even when we need to consider it as signed,
3726 we don't want to diagnose overflow here. */
3727 (convert (view_convert:stype @1))))
3729 /* (T)P - (T)(P + A) -> -(T) A */
3731 (minus (convert? @0)
3732 (convert (plus:c @@0 @1)))
3733 (if (INTEGRAL_TYPE_P (type)
3734 && TYPE_OVERFLOW_UNDEFINED (type)
3735 /* For integer literals, using an intermediate unsigned type to avoid
3736 an overflow at run time is counter-productive because it introduces
3737 spurious overflows at compile time, in the form of TREE_OVERFLOW on
3738 the result, which may be problematic in GENERIC for some front-ends:
3739 (T)P - (T)(P + 4) -> (T)(-(U)4) -> (T)(4294967292) -> -4(OVF)
3740 so we use the direct path for them. */
3741 && TREE_CODE (@1) != INTEGER_CST
3742 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
3743 (with { tree utype = unsigned_type_for (type); }
3744 (convert (negate (convert:utype @1))))
3745 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
3746 /* For integer types, if A has a smaller type
3747 than T the result depends on the possible
3749 E.g. T=size_t, A=(unsigned)429497295, P>0.
3750 However, if an overflow in P + A would cause
3751 undefined behavior, we can assume that there
3753 || (INTEGRAL_TYPE_P (TREE_TYPE (@1))
3754 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))))
3755 (negate (convert @1)))))
3758 (convert (pointer_plus @@0 @1)))
3759 (if (INTEGRAL_TYPE_P (type)
3760 && TYPE_OVERFLOW_UNDEFINED (type)
3761 /* See above the rationale for this condition. */
3762 && TREE_CODE (@1) != INTEGER_CST
3763 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
3764 (with { tree utype = unsigned_type_for (type); }
3765 (convert (negate (convert:utype @1))))
3766 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
3767 /* For pointer types, if the conversion of A to the
3768 final type requires a sign- or zero-extension,
3769 then we have to punt - it is not defined which
3771 || (POINTER_TYPE_P (TREE_TYPE (@0))
3772 && TREE_CODE (@1) == INTEGER_CST
3773 && tree_int_cst_sign_bit (@1) == 0))
3774 (negate (convert @1)))))
3776 (pointer_diff @0 (pointer_plus @@0 @1))
3777 /* The second argument of pointer_plus must be interpreted as signed, and
3778 thus sign-extended if necessary. */
3779 (with { tree stype = signed_type_for (TREE_TYPE (@1)); }
3780 /* Use view_convert instead of convert here, as POINTER_PLUS_EXPR
3781 second arg is unsigned even when we need to consider it as signed,
3782 we don't want to diagnose overflow here. */
3783 (negate (convert (view_convert:stype @1)))))
3785 /* (T)(P + A) - (T)(P + B) -> (T)A - (T)B */
3787 (minus (convert (plus:c @@0 @1))
3788 (convert (plus:c @0 @2)))
3789 (if (INTEGRAL_TYPE_P (type)
3790 && TYPE_OVERFLOW_UNDEFINED (type)
3791 && element_precision (type) <= element_precision (TREE_TYPE (@1))
3792 && element_precision (type) <= element_precision (TREE_TYPE (@2)))
3793 (with { tree utype = unsigned_type_for (type); }
3794 (convert (minus (convert:utype @1) (convert:utype @2))))
3795 (if (((element_precision (type) <= element_precision (TREE_TYPE (@1)))
3796 == (element_precision (type) <= element_precision (TREE_TYPE (@2))))
3797 && (element_precision (type) <= element_precision (TREE_TYPE (@1))
3798 /* For integer types, if A has a smaller type
3799 than T the result depends on the possible
3801 E.g. T=size_t, A=(unsigned)429497295, P>0.
3802 However, if an overflow in P + A would cause
3803 undefined behavior, we can assume that there
3805 || (INTEGRAL_TYPE_P (TREE_TYPE (@1))
3806 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
3807 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))
3808 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@2)))))
3809 (minus (convert @1) (convert @2)))))
3811 (minus (convert (pointer_plus @@0 @1))
3812 (convert (pointer_plus @0 @2)))
3813 (if (INTEGRAL_TYPE_P (type)
3814 && TYPE_OVERFLOW_UNDEFINED (type)
3815 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
3816 (with { tree utype = unsigned_type_for (type); }
3817 (convert (minus (convert:utype @1) (convert:utype @2))))
3818 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
3819 /* For pointer types, if the conversion of A to the
3820 final type requires a sign- or zero-extension,
3821 then we have to punt - it is not defined which
3823 || (POINTER_TYPE_P (TREE_TYPE (@0))
3824 && TREE_CODE (@1) == INTEGER_CST
3825 && tree_int_cst_sign_bit (@1) == 0
3826 && TREE_CODE (@2) == INTEGER_CST
3827 && tree_int_cst_sign_bit (@2) == 0))
3828 (minus (convert @1) (convert @2)))))
3830 (pointer_diff (pointer_plus @0 @2) (pointer_plus @1 @2))
3831 (pointer_diff @0 @1))
3833 (pointer_diff (pointer_plus @@0 @1) (pointer_plus @0 @2))
3834 /* The second argument of pointer_plus must be interpreted as signed, and
3835 thus sign-extended if necessary. */
3836 (with { tree stype = signed_type_for (TREE_TYPE (@1)); }
3837 /* Use view_convert instead of convert here, as POINTER_PLUS_EXPR
3838 second arg is unsigned even when we need to consider it as signed,
3839 we don't want to diagnose overflow here. */
3840 (minus (convert (view_convert:stype @1))
3841 (convert (view_convert:stype @2)))))))
3843 /* (A * C) +- (B * C) -> (A+-B) * C and (A * C) +- A -> A * (C+-1).
3844 Modeled after fold_plusminus_mult_expr. */
3845 (if (!TYPE_SATURATING (type)
3846 && (!FLOAT_TYPE_P (type) || flag_associative_math))
3847 (for plusminus (plus minus)
3849 (plusminus (mult:cs@3 @0 @1) (mult:cs@4 @0 @2))
3850 (if (!ANY_INTEGRAL_TYPE_P (type)
3851 || TYPE_OVERFLOW_WRAPS (type)
3852 || (INTEGRAL_TYPE_P (type)
3853 && tree_expr_nonzero_p (@0)
3854 && expr_not_equal_to (@0, wi::minus_one (TYPE_PRECISION (type)))))
3855 (if (single_use (@3) || single_use (@4))
3856 /* If @1 +- @2 is constant require a hard single-use on either
3857 original operand (but not on both). */
3858 (mult (plusminus @1 @2) @0)
3859 (mult! (plusminus @1 @2) @0)
3861 /* We cannot generate constant 1 for fract. */
3862 (if (!ALL_FRACT_MODE_P (TYPE_MODE (type)))
3864 (plusminus @0 (mult:c@3 @0 @2))
3865 (if ((!ANY_INTEGRAL_TYPE_P (type)
3866 || TYPE_OVERFLOW_WRAPS (type)
3867 /* For @0 + @0*@2 this transformation would introduce UB
3868 (where there was none before) for @0 in [-1,0] and @2 max.
3869 For @0 - @0*@2 this transformation would introduce UB
3870 for @0 0 and @2 in [min,min+1] or @0 -1 and @2 min+1. */
3871 || (INTEGRAL_TYPE_P (type)
3872 && ((tree_expr_nonzero_p (@0)
3873 && expr_not_equal_to (@0,
3874 wi::minus_one (TYPE_PRECISION (type))))
3875 || (plusminus == PLUS_EXPR
3876 ? expr_not_equal_to (@2,
3877 wi::max_value (TYPE_PRECISION (type), SIGNED))
3878 /* Let's ignore the @0 -1 and @2 min case. */
3879 : (expr_not_equal_to (@2,
3880 wi::min_value (TYPE_PRECISION (type), SIGNED))
3881 && expr_not_equal_to (@2,
3882 wi::min_value (TYPE_PRECISION (type), SIGNED)
3885 (mult (plusminus { build_one_cst (type); } @2) @0)))
3887 (plusminus (mult:c@3 @0 @2) @0)
3888 (if ((!ANY_INTEGRAL_TYPE_P (type)
3889 || TYPE_OVERFLOW_WRAPS (type)
3890 /* For @0*@2 + @0 this transformation would introduce UB
3891 (where there was none before) for @0 in [-1,0] and @2 max.
3892 For @0*@2 - @0 this transformation would introduce UB
3893 for @0 0 and @2 min. */
3894 || (INTEGRAL_TYPE_P (type)
3895 && ((tree_expr_nonzero_p (@0)
3896 && (plusminus == MINUS_EXPR
3897 || expr_not_equal_to (@0,
3898 wi::minus_one (TYPE_PRECISION (type)))))
3899 || expr_not_equal_to (@2,
3900 (plusminus == PLUS_EXPR
3901 ? wi::max_value (TYPE_PRECISION (type), SIGNED)
3902 : wi::min_value (TYPE_PRECISION (type), SIGNED))))))
3904 (mult (plusminus @2 { build_one_cst (type); }) @0))))))
3907 /* Canonicalize X + (X << C) into X * (1 + (1 << C)) and
3908 (X << C1) + (X << C2) into X * ((1 << C1) + (1 << C2)). */
3910 (plus:c @0 (lshift:s @0 INTEGER_CST@1))
3911 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3912 && tree_fits_uhwi_p (@1)
3913 && tree_to_uhwi (@1) < element_precision (type)
3914 && (INTEGRAL_TYPE_P (TREE_TYPE (@0))
3915 || optab_handler (smul_optab,
3916 TYPE_MODE (type)) != CODE_FOR_nothing))
3917 (with { tree t = type;
3918 if (!TYPE_OVERFLOW_WRAPS (t)) t = unsigned_type_for (t);
3919 wide_int w = wi::set_bit_in_zero (tree_to_uhwi (@1),
3920 element_precision (type));
3922 tree cst = wide_int_to_tree (VECTOR_TYPE_P (t) ? TREE_TYPE (t)
3924 cst = build_uniform_cst (t, cst); }
3925 (convert (mult (convert:t @0) { cst; })))))
3927 (plus (lshift:s @0 INTEGER_CST@1) (lshift:s @0 INTEGER_CST@2))
3928 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3929 && tree_fits_uhwi_p (@1)
3930 && tree_to_uhwi (@1) < element_precision (type)
3931 && tree_fits_uhwi_p (@2)
3932 && tree_to_uhwi (@2) < element_precision (type)
3933 && (INTEGRAL_TYPE_P (TREE_TYPE (@0))
3934 || optab_handler (smul_optab,
3935 TYPE_MODE (type)) != CODE_FOR_nothing))
3936 (with { tree t = type;
3937 if (!TYPE_OVERFLOW_WRAPS (t)) t = unsigned_type_for (t);
3938 unsigned int prec = element_precision (type);
3939 wide_int w = wi::set_bit_in_zero (tree_to_uhwi (@1), prec);
3940 w += wi::set_bit_in_zero (tree_to_uhwi (@2), prec);
3941 tree cst = wide_int_to_tree (VECTOR_TYPE_P (t) ? TREE_TYPE (t)
3943 cst = build_uniform_cst (t, cst); }
3944 (convert (mult (convert:t @0) { cst; })))))
3947 /* Canonicalize (X*C1)|(X*C2) and (X*C1)^(X*C2) to (C1+C2)*X when
3948 tree_nonzero_bits allows IOR and XOR to be treated like PLUS.
3949 Likewise, handle (X<<C3) and X as legitimate variants of X*C. */
3950 (for op (bit_ior bit_xor)
3952 (op (mult:s@0 @1 INTEGER_CST@2)
3953 (mult:s@3 @1 INTEGER_CST@4))
3954 (if (INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_WRAPS (type)
3955 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@3)) == 0)
3957 { wide_int_to_tree (type, wi::to_wide (@2) + wi::to_wide (@4)); })))
3959 (op:c (mult:s@0 @1 INTEGER_CST@2)
3960 (lshift:s@3 @1 INTEGER_CST@4))
3961 (if (INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_WRAPS (type)
3962 && tree_int_cst_sgn (@4) > 0
3963 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@3)) == 0)
3964 (with { wide_int wone = wi::one (TYPE_PRECISION (type));
3965 wide_int c = wi::add (wi::to_wide (@2),
3966 wi::lshift (wone, wi::to_wide (@4))); }
3967 (mult @1 { wide_int_to_tree (type, c); }))))
3969 (op:c (mult:s@0 @1 INTEGER_CST@2)
3971 (if (INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_WRAPS (type)
3972 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@1)) == 0)
3974 { wide_int_to_tree (type,
3975 wi::add (wi::to_wide (@2), 1)); })))
3977 (op (lshift:s@0 @1 INTEGER_CST@2)
3978 (lshift:s@3 @1 INTEGER_CST@4))
3979 (if (INTEGRAL_TYPE_P (type)
3980 && tree_int_cst_sgn (@2) > 0
3981 && tree_int_cst_sgn (@4) > 0
3982 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@3)) == 0)
3983 (with { tree t = type;
3984 if (!TYPE_OVERFLOW_WRAPS (t))
3985 t = unsigned_type_for (t);
3986 wide_int wone = wi::one (TYPE_PRECISION (t));
3987 wide_int c = wi::add (wi::lshift (wone, wi::to_wide (@2)),
3988 wi::lshift (wone, wi::to_wide (@4))); }
3989 (convert (mult:t (convert:t @1) { wide_int_to_tree (t,c); })))))
3991 (op:c (lshift:s@0 @1 INTEGER_CST@2)
3993 (if (INTEGRAL_TYPE_P (type)
3994 && tree_int_cst_sgn (@2) > 0
3995 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@1)) == 0)
3996 (with { tree t = type;
3997 if (!TYPE_OVERFLOW_WRAPS (t))
3998 t = unsigned_type_for (t);
3999 wide_int wone = wi::one (TYPE_PRECISION (t));
4000 wide_int c = wi::add (wi::lshift (wone, wi::to_wide (@2)), wone); }
4001 (convert (mult:t (convert:t @1) { wide_int_to_tree (t, c); }))))))
4003 /* Simplifications of MIN_EXPR, MAX_EXPR, fmin() and fmax(). */
4005 (for minmax (min max)
4009 /* max(max(x,y),x) -> max(x,y) */
4011 (minmax:c (minmax:c@2 @0 @1) @0)
4013 /* For fmin() and fmax(), skip folding when both are sNaN. */
4014 (for minmax (FMIN_ALL FMAX_ALL)
4017 (if (!tree_expr_maybe_signaling_nan_p (@0))
4019 /* min(max(x,y),y) -> y. */
4021 (min:c (max:c @0 @1) @1)
4023 /* max(min(x,y),y) -> y. */
4025 (max:c (min:c @0 @1) @1)
4027 /* max(a,-a) -> abs(a). */
4029 (max:c @0 (negate @0))
4030 (if (TREE_CODE (type) != COMPLEX_TYPE
4031 && (! ANY_INTEGRAL_TYPE_P (type)
4032 || TYPE_OVERFLOW_UNDEFINED (type)))
4034 /* min(a,-a) -> -abs(a). */
4036 (min:c @0 (negate @0))
4037 (if (TREE_CODE (type) != COMPLEX_TYPE
4038 && (! ANY_INTEGRAL_TYPE_P (type)
4039 || TYPE_OVERFLOW_UNDEFINED (type)))
4044 (if (INTEGRAL_TYPE_P (type)
4045 && TYPE_MIN_VALUE (type)
4046 && operand_equal_p (@1, TYPE_MIN_VALUE (type), OEP_ONLY_CONST))
4048 (if (INTEGRAL_TYPE_P (type)
4049 && TYPE_MAX_VALUE (type)
4050 && operand_equal_p (@1, TYPE_MAX_VALUE (type), OEP_ONLY_CONST))
4055 (if (INTEGRAL_TYPE_P (type)
4056 && TYPE_MAX_VALUE (type)
4057 && operand_equal_p (@1, TYPE_MAX_VALUE (type), OEP_ONLY_CONST))
4059 (if (INTEGRAL_TYPE_P (type)
4060 && TYPE_MIN_VALUE (type)
4061 && operand_equal_p (@1, TYPE_MIN_VALUE (type), OEP_ONLY_CONST))
4064 /* max (a, a + CST) -> a + CST where CST is positive. */
4065 /* max (a, a + CST) -> a where CST is negative. */
4067 (max:c @0 (plus@2 @0 INTEGER_CST@1))
4068 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
4069 (if (tree_int_cst_sgn (@1) > 0)
4073 /* min (a, a + CST) -> a where CST is positive. */
4074 /* min (a, a + CST) -> a + CST where CST is negative. */
4076 (min:c @0 (plus@2 @0 INTEGER_CST@1))
4077 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
4078 (if (tree_int_cst_sgn (@1) > 0)
4082 /* Simplify min (&var[off0], &var[off1]) etc. depending on whether
4083 the addresses are known to be less, equal or greater. */
4084 (for minmax (min max)
4087 (minmax (convert1?@2 addr@0) (convert2?@3 addr@1))
4090 poly_int64 off0, off1;
4092 int equal = address_compare (cmp, TREE_TYPE (@2), @0, @1, base0, base1,
4093 off0, off1, GENERIC);
4096 (if (minmax == MIN_EXPR)
4097 (if (known_le (off0, off1))
4099 (if (known_gt (off0, off1))
4101 (if (known_ge (off0, off1))
4103 (if (known_lt (off0, off1))
4106 /* (convert (minmax ((convert (x) c)))) -> minmax (x c) if x is promoted
4107 and the outer convert demotes the expression back to x's type. */
4108 (for minmax (min max)
4110 (convert (minmax@0 (convert @1) INTEGER_CST@2))
4111 (if (INTEGRAL_TYPE_P (type)
4112 && types_match (@1, type) && int_fits_type_p (@2, type)
4113 && TYPE_SIGN (TREE_TYPE (@0)) == TYPE_SIGN (type)
4114 && TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (type))
4115 (minmax @1 (convert @2)))))
4117 (for minmax (FMIN_ALL FMAX_ALL)
4118 /* If either argument is NaN and other one is not sNaN, return the other
4119 one. Avoid the transformation if we get (and honor) a signalling NaN. */
4121 (minmax:c @0 REAL_CST@1)
4122 (if (real_isnan (TREE_REAL_CST_PTR (@1))
4123 && (!HONOR_SNANS (@1) || !TREE_REAL_CST (@1).signalling)
4124 && !tree_expr_maybe_signaling_nan_p (@0))
4126 /* Convert fmin/fmax to MIN_EXPR/MAX_EXPR. C99 requires these
4127 functions to return the numeric arg if the other one is NaN.
4128 MIN and MAX don't honor that, so only transform if -ffinite-math-only
4129 is set. C99 doesn't require -0.0 to be handled, so we don't have to
4130 worry about it either. */
4131 (if (flag_finite_math_only)
4138 /* min (-A, -B) -> -max (A, B) */
4139 (for minmax (min max FMIN_ALL FMAX_ALL)
4140 maxmin (max min FMAX_ALL FMIN_ALL)
4142 (minmax (negate:s@2 @0) (negate:s@3 @1))
4143 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
4144 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
4145 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))))
4146 (negate (maxmin @0 @1)))))
4147 /* MIN (~X, ~Y) -> ~MAX (X, Y)
4148 MAX (~X, ~Y) -> ~MIN (X, Y) */
4149 (for minmax (min max)
4152 (minmax (bit_not:s@2 @0) (bit_not:s@3 @1))
4153 (bit_not (maxmin @0 @1)))
4154 /* ~MAX(~X, Y) --> MIN(X, ~Y) */
4155 /* ~MIN(~X, Y) --> MAX(X, ~Y) */
4157 (bit_not (minmax:cs (bit_not @0) @1))
4158 (maxmin @0 (bit_not @1))))
4160 /* MIN (X, Y) == X -> X <= Y */
4161 /* MIN (X, Y) < X -> X > Y */
4162 /* MIN (X, Y) >= X -> X <= Y */
4163 (for minmax (min min min min max max max max)
4164 cmp (eq ne lt ge eq ne gt le )
4165 out (le gt gt le ge lt lt ge )
4167 (cmp:c (minmax:c @0 @1) @0)
4168 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0)))
4170 /* MIN (X, 5) == 0 -> X == 0
4171 MIN (X, 5) == 7 -> false */
4174 (cmp (min @0 INTEGER_CST@1) INTEGER_CST@2)
4175 (if (wi::lt_p (wi::to_wide (@1), wi::to_wide (@2),
4176 TYPE_SIGN (TREE_TYPE (@0))))
4177 { constant_boolean_node (cmp == NE_EXPR, type); }
4178 (if (wi::gt_p (wi::to_wide (@1), wi::to_wide (@2),
4179 TYPE_SIGN (TREE_TYPE (@0))))
4183 (cmp (max @0 INTEGER_CST@1) INTEGER_CST@2)
4184 (if (wi::gt_p (wi::to_wide (@1), wi::to_wide (@2),
4185 TYPE_SIGN (TREE_TYPE (@0))))
4186 { constant_boolean_node (cmp == NE_EXPR, type); }
4187 (if (wi::lt_p (wi::to_wide (@1), wi::to_wide (@2),
4188 TYPE_SIGN (TREE_TYPE (@0))))
4191 /* X <= MAX(X, Y) -> true
4192 X > MAX(X, Y) -> false
4193 X >= MIN(X, Y) -> true
4194 X < MIN(X, Y) -> false */
4195 (for minmax (min min max max )
4198 (cmp:c @0 (minmax:c @0 @1))
4199 { constant_boolean_node (cmp == GE_EXPR || cmp == LE_EXPR, type); } ))
4201 /* MIN (X, C1) < C2 -> X < C2 || C1 < C2 */
4202 (for minmax (min min max max min min max max )
4203 cmp (lt le gt ge gt ge lt le )
4204 comb (bit_ior bit_ior bit_ior bit_ior bit_and bit_and bit_and bit_and)
4206 (cmp (minmax @0 INTEGER_CST@1) INTEGER_CST@2)
4207 (comb (cmp @0 @2) (cmp @1 @2))))
4209 /* Undo fancy ways of writing max/min or other ?: expressions, like
4210 a - ((a - b) & -(a < b)) and a - (a - b) * (a < b) into (a < b) ? b : a.
4211 People normally use ?: and that is what we actually try to optimize. */
4212 /* Transform A + (B-A)*cmp into cmp ? B : A. */
4214 (plus:c @0 (mult:c (minus @1 @0) zero_one_valued_p@2))
4215 (if (INTEGRAL_TYPE_P (type)
4216 && (GIMPLE || !TREE_SIDE_EFFECTS (@1)))
4217 (cond (convert:boolean_type_node @2) @1 @0)))
4218 /* Transform A - (A-B)*cmp into cmp ? B : A. */
4220 (minus @0 (mult:c (minus @0 @1) zero_one_valued_p@2))
4221 (if (INTEGRAL_TYPE_P (type)
4222 && (GIMPLE || !TREE_SIDE_EFFECTS (@1)))
4223 (cond (convert:boolean_type_node @2) @1 @0)))
4224 /* Transform A ^ (A^B)*cmp into cmp ? B : A. */
4226 (bit_xor:c @0 (mult:c (bit_xor:c @0 @1) zero_one_valued_p@2))
4227 (if (INTEGRAL_TYPE_P (type)
4228 && (GIMPLE || !TREE_SIDE_EFFECTS (@1)))
4229 (cond (convert:boolean_type_node @2) @1 @0)))
4231 /* (x <= 0 ? -x : 0) -> max(-x, 0). */
4233 (cond (le @0 integer_zerop@1) (negate@2 @0) integer_zerop@1)
4234 (if (ANY_INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_UNDEFINED (type))
4237 /* (zero_one == 0) ? y : z <op> y -> ((typeof(y))zero_one * z) <op> y */
4238 (for op (bit_xor bit_ior plus)
4240 (cond (eq zero_one_valued_p@0
4244 (if (INTEGRAL_TYPE_P (type)
4245 && TYPE_PRECISION (type) > 1
4246 && (INTEGRAL_TYPE_P (TREE_TYPE (@0))))
4247 (op (mult (convert:type @0) @2) @1))))
4249 /* (zero_one != 0) ? z <op> y : y -> ((typeof(y))zero_one * z) <op> y */
4250 (for op (bit_xor bit_ior plus)
4252 (cond (ne zero_one_valued_p@0
4256 (if (INTEGRAL_TYPE_P (type)
4257 && TYPE_PRECISION (type) > 1
4258 && (INTEGRAL_TYPE_P (TREE_TYPE (@0))))
4259 (op (mult (convert:type @0) @2) @1))))
4261 /* ?: Value replacement. */
4262 /* a == 0 ? b : b + a -> b + a */
4263 (for op (plus bit_ior bit_xor)
4265 (cond (eq @0 integer_zerop) @1 (op:c@2 @1 @0))
4267 /* a == 0 ? b : b - a -> b - a */
4268 /* a == 0 ? b : b ptr+ a -> b ptr+ a */
4269 /* a == 0 ? b : b shift/rotate a -> b shift/rotate a */
4270 (for op (lrotate rrotate lshift rshift minus pointer_plus)
4272 (cond (eq @0 integer_zerop) @1 (op@2 @1 @0))
4275 /* a == 1 ? b : b / a -> b / a */
4276 (for op (trunc_div ceil_div floor_div round_div exact_div)
4278 (cond (eq @0 integer_onep) @1 (op@2 @1 @0))
4281 /* a == 1 ? b : a * b -> a * b */
4284 (cond (eq @0 integer_onep) @1 (op:c@2 @1 @0))
4287 /* a == -1 ? b : a & b -> a & b */
4290 (cond (eq @0 integer_all_onesp) @1 (op:c@2 @1 @0))
4293 /* Simplifications of shift and rotates. */
4295 (for rotate (lrotate rrotate)
4297 (rotate integer_all_onesp@0 @1)
4300 /* Optimize -1 >> x for arithmetic right shifts. */
4302 (rshift integer_all_onesp@0 @1)
4303 (if (!TYPE_UNSIGNED (type))
4306 /* Optimize (x >> c) << c into x & (-1<<c). */
4308 (lshift (nop_convert? (rshift @0 INTEGER_CST@1)) @1)
4309 (if (wi::ltu_p (wi::to_wide (@1), element_precision (type)))
4310 /* It doesn't matter if the right shift is arithmetic or logical. */
4311 (bit_and (view_convert @0) (lshift { build_minus_one_cst (type); } @1))))
4314 (lshift (convert (convert@2 (rshift @0 INTEGER_CST@1))) @1)
4315 (if (wi::ltu_p (wi::to_wide (@1), element_precision (type))
4316 /* Allow intermediate conversion to integral type with whatever sign, as
4317 long as the low TYPE_PRECISION (type)
4318 - TYPE_PRECISION (TREE_TYPE (@2)) bits are preserved. */
4319 && INTEGRAL_TYPE_P (type)
4320 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
4321 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
4322 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (@0))
4323 && (TYPE_PRECISION (TREE_TYPE (@2)) >= TYPE_PRECISION (type)
4324 || wi::geu_p (wi::to_wide (@1),
4325 TYPE_PRECISION (type)
4326 - TYPE_PRECISION (TREE_TYPE (@2)))))
4327 (bit_and (convert @0) (lshift { build_minus_one_cst (type); } @1))))
4329 /* For (x << c) >> c, optimize into x & ((unsigned)-1 >> c) for
4330 unsigned x OR truncate into the precision(type) - c lowest bits
4331 of signed x (if they have mode precision or a precision of 1). */
4333 (rshift (nop_convert? (lshift @0 INTEGER_CST@1)) @@1)
4334 (if (wi::ltu_p (wi::to_wide (@1), element_precision (type)))
4335 (if (TYPE_UNSIGNED (type))
4336 (bit_and (convert @0) (rshift { build_minus_one_cst (type); } @1))
4337 (if (INTEGRAL_TYPE_P (type))
4339 int width = element_precision (type) - tree_to_uhwi (@1);
4340 tree stype = NULL_TREE;
4341 if (width <= MAX_FIXED_MODE_SIZE)
4342 stype = build_nonstandard_integer_type (width, 0);
4344 (if (stype && (width == 1 || type_has_mode_precision_p (stype)))
4345 (convert (convert:stype @0))))))))
4347 /* Optimize x >> x into 0 */
4350 { build_zero_cst (type); })
4352 (for shiftrotate (lrotate rrotate lshift rshift)
4354 (shiftrotate @0 integer_zerop)
4357 (shiftrotate integer_zerop@0 @1)
4359 /* Prefer vector1 << scalar to vector1 << vector2
4360 if vector2 is uniform. */
4361 (for vec (VECTOR_CST CONSTRUCTOR)
4363 (shiftrotate @0 vec@1)
4364 (with { tree tem = uniform_vector_p (@1); }
4366 (shiftrotate @0 { tem; }))))))
4368 /* Simplify X << Y where Y's low width bits are 0 to X, as only valid
4369 Y is 0. Similarly for X >> Y. */
4371 (for shift (lshift rshift)
4373 (shift @0 SSA_NAME@1)
4374 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1)))
4376 int width = ceil_log2 (element_precision (TREE_TYPE (@0)));
4377 int prec = TYPE_PRECISION (TREE_TYPE (@1));
4379 (if ((get_nonzero_bits (@1) & wi::mask (width, false, prec)) == 0)
4383 /* Rewrite an LROTATE_EXPR by a constant into an
4384 RROTATE_EXPR by a new constant. */
4386 (lrotate @0 INTEGER_CST@1)
4387 (rrotate @0 { const_binop (MINUS_EXPR, TREE_TYPE (@1),
4388 build_int_cst (TREE_TYPE (@1),
4389 element_precision (type)), @1); }))
4391 /* Turn (a OP c1) OP c2 into a OP (c1+c2). */
4392 (for op (lrotate rrotate rshift lshift)
4394 (op (op @0 INTEGER_CST@1) INTEGER_CST@2)
4395 (with { unsigned int prec = element_precision (type); }
4396 (if (wi::ge_p (wi::to_wide (@1), 0, TYPE_SIGN (TREE_TYPE (@1)))
4397 && wi::lt_p (wi::to_wide (@1), prec, TYPE_SIGN (TREE_TYPE (@1)))
4398 && wi::ge_p (wi::to_wide (@2), 0, TYPE_SIGN (TREE_TYPE (@2)))
4399 && wi::lt_p (wi::to_wide (@2), prec, TYPE_SIGN (TREE_TYPE (@2))))
4400 (with { unsigned int low = (tree_to_uhwi (@1)
4401 + tree_to_uhwi (@2)); }
4402 /* Deal with a OP (c1 + c2) being undefined but (a OP c1) OP c2
4403 being well defined. */
4405 (if (op == LROTATE_EXPR || op == RROTATE_EXPR)
4406 (op @0 { build_int_cst (TREE_TYPE (@1), low % prec); })
4407 (if (TYPE_UNSIGNED (type) || op == LSHIFT_EXPR)
4408 { build_zero_cst (type); }
4409 (op @0 { build_int_cst (TREE_TYPE (@1), prec - 1); })))
4410 (op @0 { build_int_cst (TREE_TYPE (@1), low); })))))))
4413 /* Simplify (CST << x) & 1 to 0 if CST is even or to x == 0 if it is odd. */
4415 (bit_and (lshift INTEGER_CST@1 @0) integer_onep)
4416 (if ((wi::to_wide (@1) & 1) != 0)
4417 (convert (eq:boolean_type_node @0 { build_zero_cst (TREE_TYPE (@0)); }))
4418 { build_zero_cst (type); }))
4420 /* Simplify ((C << x) & D) != 0 where C and D are power of two constants,
4421 either to false if D is smaller (unsigned comparison) than C, or to
4422 x == log2 (D) - log2 (C). Similarly for right shifts.
4423 Note for `(1 >> x)`, the & 1 has been removed so matching that seperately. */
4427 (cmp (bit_and (lshift integer_pow2p@1 @0) integer_pow2p@2) integer_zerop)
4428 (with { int c1 = wi::clz (wi::to_wide (@1));
4429 int c2 = wi::clz (wi::to_wide (@2)); }
4431 { constant_boolean_node (cmp == NE_EXPR ? false : true, type); }
4432 (icmp @0 { build_int_cst (TREE_TYPE (@0), c1 - c2); }))))
4434 (cmp (bit_and (rshift integer_pow2p@1 @0) integer_pow2p@2) integer_zerop)
4435 (if (tree_int_cst_sgn (@1) > 0)
4436 (with { int c1 = wi::clz (wi::to_wide (@1));
4437 int c2 = wi::clz (wi::to_wide (@2)); }
4439 { constant_boolean_node (cmp == NE_EXPR ? false : true, type); }
4440 (icmp @0 { build_int_cst (TREE_TYPE (@0), c2 - c1); })))))
4441 /* `(1 >> X) != 0` -> `X == 0` */
4442 /* `(1 >> X) == 0` -> `X != 0` */
4444 (cmp (rshift integer_onep@1 @0) integer_zerop)
4445 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1)))
4446 (icmp @0 { build_zero_cst (TREE_TYPE (@0)); }))))
4448 /* (CST1 << A) == CST2 -> A == ctz (CST2) - ctz (CST1)
4449 (CST1 << A) != CST2 -> A != ctz (CST2) - ctz (CST1)
4453 (cmp (lshift INTEGER_CST@0 @1) INTEGER_CST@2)
4454 (with { int cand = wi::ctz (wi::to_wide (@2)) - wi::ctz (wi::to_wide (@0)); }
4456 || (!integer_zerop (@2)
4457 && wi::lshift (wi::to_wide (@0), cand) != wi::to_wide (@2)))
4458 { constant_boolean_node (cmp == NE_EXPR, type); }
4459 (if (!integer_zerop (@2)
4460 && wi::lshift (wi::to_wide (@0), cand) == wi::to_wide (@2))
4461 (cmp @1 { build_int_cst (TREE_TYPE (@1), cand); }))))))
4463 /* Fold ((X << C1) & C2) cmp C3 into (X & (C2 >> C1)) cmp (C3 >> C1)
4464 ((X >> C1) & C2) cmp C3 into (X & (C2 << C1)) cmp (C3 << C1). */
4467 (cmp (bit_and:s (lshift:s @0 INTEGER_CST@1) INTEGER_CST@2) INTEGER_CST@3)
4468 (if (tree_fits_shwi_p (@1)
4469 && tree_to_shwi (@1) > 0
4470 && tree_to_shwi (@1) < TYPE_PRECISION (TREE_TYPE (@0)))
4471 (if (tree_to_shwi (@1) > wi::ctz (wi::to_wide (@3)))
4472 { constant_boolean_node (cmp == NE_EXPR, type); }
4473 (with { wide_int c1 = wi::to_wide (@1);
4474 wide_int c2 = wi::lrshift (wi::to_wide (@2), c1);
4475 wide_int c3 = wi::lrshift (wi::to_wide (@3), c1); }
4476 (cmp (bit_and @0 { wide_int_to_tree (TREE_TYPE (@0), c2); })
4477 { wide_int_to_tree (TREE_TYPE (@0), c3); })))))
4479 (cmp (bit_and:s (rshift:s @0 INTEGER_CST@1) INTEGER_CST@2) INTEGER_CST@3)
4480 (if (tree_fits_shwi_p (@1)
4481 && tree_to_shwi (@1) > 0
4482 && tree_to_shwi (@1) < TYPE_PRECISION (TREE_TYPE (@0)))
4483 (with { tree t0 = TREE_TYPE (@0);
4484 unsigned int prec = TYPE_PRECISION (t0);
4485 wide_int c1 = wi::to_wide (@1);
4486 wide_int c2 = wi::to_wide (@2);
4487 wide_int c3 = wi::to_wide (@3);
4488 wide_int sb = wi::set_bit_in_zero (prec - 1, prec); }
4489 (if ((c2 & c3) != c3)
4490 { constant_boolean_node (cmp == NE_EXPR, type); }
4491 (if (TYPE_UNSIGNED (t0))
4492 (if ((c3 & wi::arshift (sb, c1 - 1)) != 0)
4493 { constant_boolean_node (cmp == NE_EXPR, type); }
4494 (cmp (bit_and @0 { wide_int_to_tree (t0, c2 << c1); })
4495 { wide_int_to_tree (t0, c3 << c1); }))
4496 (with { wide_int smask = wi::arshift (sb, c1); }
4498 (if ((c2 & smask) == 0)
4499 (cmp (bit_and @0 { wide_int_to_tree (t0, c2 << c1); })
4500 { wide_int_to_tree (t0, c3 << c1); }))
4501 (if ((c3 & smask) == 0)
4502 (cmp (bit_and @0 { wide_int_to_tree (t0, (c2 << c1) | sb); })
4503 { wide_int_to_tree (t0, c3 << c1); }))
4504 (if ((c2 & smask) != (c3 & smask))
4505 { constant_boolean_node (cmp == NE_EXPR, type); })
4506 (cmp (bit_and @0 { wide_int_to_tree (t0, (c2 << c1) | sb); })
4507 { wide_int_to_tree (t0, (c3 << c1) | sb); })))))))))
4509 /* Fold (X << C1) & C2 into (X << C1) & (C2 | ((1 << C1) - 1))
4510 (X >> C1) & C2 into (X >> C1) & (C2 | ~((type) -1 >> C1))
4511 if the new mask might be further optimized. */
4512 (for shift (lshift rshift)
4514 (bit_and (convert?:s@4 (shift:s@5 (convert1?@3 @0) INTEGER_CST@1))
4516 (if (tree_nop_conversion_p (TREE_TYPE (@4), TREE_TYPE (@5))
4517 && TYPE_PRECISION (type) <= HOST_BITS_PER_WIDE_INT
4518 && tree_fits_uhwi_p (@1)
4519 && tree_to_uhwi (@1) > 0
4520 && tree_to_uhwi (@1) < TYPE_PRECISION (type))
4523 unsigned int shiftc = tree_to_uhwi (@1);
4524 unsigned HOST_WIDE_INT mask = TREE_INT_CST_LOW (@2);
4525 unsigned HOST_WIDE_INT newmask, zerobits = 0;
4526 tree shift_type = TREE_TYPE (@3);
4529 if (shift == LSHIFT_EXPR)
4530 zerobits = ((HOST_WIDE_INT_1U << shiftc) - 1);
4531 else if (shift == RSHIFT_EXPR
4532 && type_has_mode_precision_p (shift_type))
4534 prec = TYPE_PRECISION (TREE_TYPE (@3));
4536 /* See if more bits can be proven as zero because of
4539 && TYPE_UNSIGNED (TREE_TYPE (@0)))
4541 tree inner_type = TREE_TYPE (@0);
4542 if (type_has_mode_precision_p (inner_type)
4543 && TYPE_PRECISION (inner_type) < prec)
4545 prec = TYPE_PRECISION (inner_type);
4546 /* See if we can shorten the right shift. */
4548 shift_type = inner_type;
4549 /* Otherwise X >> C1 is all zeros, so we'll optimize
4550 it into (X, 0) later on by making sure zerobits
4554 zerobits = HOST_WIDE_INT_M1U;
4557 zerobits >>= HOST_BITS_PER_WIDE_INT - shiftc;
4558 zerobits <<= prec - shiftc;
4560 /* For arithmetic shift if sign bit could be set, zerobits
4561 can contain actually sign bits, so no transformation is
4562 possible, unless MASK masks them all away. In that
4563 case the shift needs to be converted into logical shift. */
4564 if (!TYPE_UNSIGNED (TREE_TYPE (@3))
4565 && prec == TYPE_PRECISION (TREE_TYPE (@3)))
4567 if ((mask & zerobits) == 0)
4568 shift_type = unsigned_type_for (TREE_TYPE (@3));
4574 /* ((X << 16) & 0xff00) is (X, 0). */
4575 (if ((mask & zerobits) == mask)
4576 { build_int_cst (type, 0); }
4577 (with { newmask = mask | zerobits; }
4578 (if (newmask != mask && (newmask & (newmask + 1)) == 0)
4581 /* Only do the transformation if NEWMASK is some integer
4583 for (prec = BITS_PER_UNIT;
4584 prec < HOST_BITS_PER_WIDE_INT; prec <<= 1)
4585 if (newmask == (HOST_WIDE_INT_1U << prec) - 1)
4588 (if (prec < HOST_BITS_PER_WIDE_INT
4589 || newmask == HOST_WIDE_INT_M1U)
4591 { tree newmaskt = build_int_cst_type (TREE_TYPE (@2), newmask); }
4592 (if (!tree_int_cst_equal (newmaskt, @2))
4593 (if (shift_type != TREE_TYPE (@3))
4594 (bit_and (convert (shift:shift_type (convert @3) @1)) { newmaskt; })
4595 (bit_and @4 { newmaskt; })))))))))))))
4597 /* ((1 << n) & M) != 0 -> n == log2 (M) */
4603 (nop_convert? (lshift integer_onep @0)) integer_pow2p@1) integer_zerop)
4604 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)))
4605 (icmp @0 { wide_int_to_tree (TREE_TYPE (@0),
4606 wi::exact_log2 (wi::to_wide (@1))); }))))
4608 /* Fold (X {&,^,|} C2) << C1 into (X << C1) {&,^,|} (C2 << C1)
4609 (X {&,^,|} C2) >> C1 into (X >> C1) & (C2 >> C1). */
4610 (for shift (lshift rshift)
4611 (for bit_op (bit_and bit_xor bit_ior)
4613 (shift (convert?:s (bit_op:s @0 INTEGER_CST@2)) INTEGER_CST@1)
4614 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
4615 (with { tree mask = int_const_binop (shift, fold_convert (type, @2), @1); }
4617 (bit_op (shift (convert @0) @1) { mask; })))))))
4619 /* ~(~X >> Y) -> X >> Y (for arithmetic shift). */
4621 (bit_not (convert1?:s (rshift:s (convert2?@0 (bit_not @1)) @2)))
4622 (if (!TYPE_UNSIGNED (TREE_TYPE (@0))
4623 && (element_precision (TREE_TYPE (@0))
4624 <= element_precision (TREE_TYPE (@1))
4625 || !TYPE_UNSIGNED (TREE_TYPE (@1))))
4627 { tree shift_type = TREE_TYPE (@0); }
4628 (convert (rshift (convert:shift_type @1) @2)))))
4630 /* ~(~X >>r Y) -> X >>r Y
4631 ~(~X <<r Y) -> X <<r Y */
4632 (for rotate (lrotate rrotate)
4634 (bit_not (convert1?:s (rotate:s (convert2?@0 (bit_not @1)) @2)))
4635 (if ((element_precision (TREE_TYPE (@0))
4636 <= element_precision (TREE_TYPE (@1))
4637 || !TYPE_UNSIGNED (TREE_TYPE (@1)))
4638 && (element_precision (type) <= element_precision (TREE_TYPE (@0))
4639 || !TYPE_UNSIGNED (TREE_TYPE (@0))))
4641 { tree rotate_type = TREE_TYPE (@0); }
4642 (convert (rotate (convert:rotate_type @1) @2))))))
4645 (for rotate (lrotate rrotate)
4646 invrot (rrotate lrotate)
4647 /* (X >>r Y) cmp (Z >>r Y) may simplify to X cmp Y. */
4649 (cmp (rotate @1 @0) (rotate @2 @0))
4651 /* (X >>r C1) cmp C2 may simplify to X cmp C3. */
4653 (cmp (rotate @0 INTEGER_CST@1) INTEGER_CST@2)
4654 (cmp @0 { const_binop (invrot, TREE_TYPE (@0), @2, @1); }))
4655 /* (X >>r Y) cmp C where C is 0 or ~0, may simplify to X cmp C. */
4657 (cmp (rotate @0 @1) INTEGER_CST@2)
4658 (if (integer_zerop (@2) || integer_all_onesp (@2))
4661 /* Narrow a lshift by constant. */
4663 (convert (lshift:s@0 @1 INTEGER_CST@2))
4664 (if (INTEGRAL_TYPE_P (type)
4665 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
4666 && !integer_zerop (@2)
4667 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0)))
4668 (if (TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (@0))
4669 || wi::ltu_p (wi::to_wide (@2), TYPE_PRECISION (type)))
4670 (lshift (convert @1) @2)
4671 (if (wi::ltu_p (wi::to_wide (@2), TYPE_PRECISION (TREE_TYPE (@0))))
4672 { build_zero_cst (type); }))))
4674 /* Simplifications of conversions. */
4676 /* Basic strip-useless-type-conversions / strip_nops. */
4677 (for cvt (convert view_convert float fix_trunc)
4680 (if ((GIMPLE && useless_type_conversion_p (type, TREE_TYPE (@0)))
4681 || (GENERIC && type == TREE_TYPE (@0)))
4684 /* Contract view-conversions. */
4686 (view_convert (view_convert @0))
4689 /* For integral conversions with the same precision or pointer
4690 conversions use a NOP_EXPR instead. */
4693 (if ((INTEGRAL_TYPE_P (type) || POINTER_TYPE_P (type))
4694 && (INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))
4695 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (@0)))
4698 /* Strip inner integral conversions that do not change precision or size, or
4699 zero-extend while keeping the same size (for bool-to-char). */
4701 (view_convert (convert@0 @1))
4702 (if ((INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))
4703 && (INTEGRAL_TYPE_P (TREE_TYPE (@1)) || POINTER_TYPE_P (TREE_TYPE (@1)))
4704 && TYPE_SIZE (TREE_TYPE (@0)) == TYPE_SIZE (TREE_TYPE (@1))
4705 && (TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1))
4706 || (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (TREE_TYPE (@1))
4707 && TYPE_UNSIGNED (TREE_TYPE (@1)))))
4710 /* Simplify a view-converted empty or single-element constructor. */
4712 (view_convert CONSTRUCTOR@0)
4714 { tree ctor = (TREE_CODE (@0) == SSA_NAME
4715 ? gimple_assign_rhs1 (SSA_NAME_DEF_STMT (@0)) : @0); }
4717 (if (CONSTRUCTOR_NELTS (ctor) == 0)
4718 { build_zero_cst (type); })
4719 (if (CONSTRUCTOR_NELTS (ctor) == 1
4720 && VECTOR_TYPE_P (TREE_TYPE (ctor))
4721 && operand_equal_p (TYPE_SIZE (type),
4722 TYPE_SIZE (TREE_TYPE
4723 (CONSTRUCTOR_ELT (ctor, 0)->value))))
4724 (view_convert { CONSTRUCTOR_ELT (ctor, 0)->value; })))))
4726 /* Re-association barriers around constants and other re-association
4727 barriers can be removed. */
4729 (paren CONSTANT_CLASS_P@0)
4732 (paren (paren@1 @0))
4735 /* Handle cases of two conversions in a row. */
4736 (for ocvt (convert float fix_trunc)
4737 (for icvt (convert float)
4742 tree inside_type = TREE_TYPE (@0);
4743 tree inter_type = TREE_TYPE (@1);
4744 int inside_int = INTEGRAL_TYPE_P (inside_type);
4745 int inside_ptr = POINTER_TYPE_P (inside_type);
4746 int inside_float = FLOAT_TYPE_P (inside_type);
4747 int inside_vec = VECTOR_TYPE_P (inside_type);
4748 unsigned int inside_prec = element_precision (inside_type);
4749 int inside_unsignedp = TYPE_UNSIGNED (inside_type);
4750 int inter_int = INTEGRAL_TYPE_P (inter_type);
4751 int inter_ptr = POINTER_TYPE_P (inter_type);
4752 int inter_float = FLOAT_TYPE_P (inter_type);
4753 int inter_vec = VECTOR_TYPE_P (inter_type);
4754 unsigned int inter_prec = element_precision (inter_type);
4755 int inter_unsignedp = TYPE_UNSIGNED (inter_type);
4756 int final_int = INTEGRAL_TYPE_P (type);
4757 int final_ptr = POINTER_TYPE_P (type);
4758 int final_float = FLOAT_TYPE_P (type);
4759 int final_vec = VECTOR_TYPE_P (type);
4760 unsigned int final_prec = element_precision (type);
4761 int final_unsignedp = TYPE_UNSIGNED (type);
4764 /* In addition to the cases of two conversions in a row
4765 handled below, if we are converting something to its own
4766 type via an object of identical or wider precision, neither
4767 conversion is needed. */
4768 (if (((GIMPLE && useless_type_conversion_p (type, inside_type))
4770 && TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (inside_type)))
4771 && (((inter_int || inter_ptr) && final_int)
4772 || (inter_float && final_float))
4773 && inter_prec >= final_prec)
4776 /* Likewise, if the intermediate and initial types are either both
4777 float or both integer, we don't need the middle conversion if the
4778 former is wider than the latter and doesn't change the signedness
4779 (for integers). Avoid this if the final type is a pointer since
4780 then we sometimes need the middle conversion. */
4781 (if (((inter_int && inside_int) || (inter_float && inside_float))
4782 && (final_int || final_float)
4783 && inter_prec >= inside_prec
4784 && (inter_float || inter_unsignedp == inside_unsignedp))
4787 /* If we have a sign-extension of a zero-extended value, we can
4788 replace that by a single zero-extension. Likewise if the
4789 final conversion does not change precision we can drop the
4790 intermediate conversion. Similarly truncation of a sign-extension
4791 can be replaced by a single sign-extension. */
4792 (if (inside_int && inter_int && final_int
4793 && ((inside_prec < inter_prec && inter_prec < final_prec
4794 && inside_unsignedp && !inter_unsignedp)
4795 || final_prec == inter_prec
4796 || (inside_prec < inter_prec && inter_prec > final_prec
4797 && !inside_unsignedp && inter_unsignedp)))
4800 /* Two conversions in a row are not needed unless:
4801 - some conversion is floating-point (overstrict for now), or
4802 - some conversion is a vector (overstrict for now), or
4803 - the intermediate type is narrower than both initial and
4805 - the intermediate type and innermost type differ in signedness,
4806 and the outermost type is wider than the intermediate, or
4807 - the initial type is a pointer type and the precisions of the
4808 intermediate and final types differ, or
4809 - the final type is a pointer type and the precisions of the
4810 initial and intermediate types differ. */
4811 (if (! inside_float && ! inter_float && ! final_float
4812 && ! inside_vec && ! inter_vec && ! final_vec
4813 && (inter_prec >= inside_prec || inter_prec >= final_prec)
4814 && ! (inside_int && inter_int
4815 && inter_unsignedp != inside_unsignedp
4816 && inter_prec < final_prec)
4817 && ((inter_unsignedp && inter_prec > inside_prec)
4818 == (final_unsignedp && final_prec > inter_prec))
4819 && ! (inside_ptr && inter_prec != final_prec)
4820 && ! (final_ptr && inside_prec != inter_prec))
4823 /* `(outer:M)(inter:N) a:O`
4824 can be converted to `(outer:M) a`
4825 if M <= O && N >= O. No matter what signedness of the casts,
4826 as the final is either a truncation from the original or just
4827 a sign change of the type. */
4828 (if (inside_int && inter_int && final_int
4829 && final_prec <= inside_prec
4830 && inter_prec >= inside_prec)
4833 /* A truncation to an unsigned type (a zero-extension) should be
4834 canonicalized as bitwise and of a mask. */
4835 (if (GIMPLE /* PR70366: doing this in GENERIC breaks -Wconversion. */
4836 && final_int && inter_int && inside_int
4837 && final_prec == inside_prec
4838 && final_prec > inter_prec
4840 (convert (bit_and @0 { wide_int_to_tree
4842 wi::mask (inter_prec, false,
4843 TYPE_PRECISION (inside_type))); })))
4845 /* If we are converting an integer to a floating-point that can
4846 represent it exactly and back to an integer, we can skip the
4847 floating-point conversion. */
4848 (if (GIMPLE /* PR66211 */
4849 && inside_int && inter_float && final_int &&
4850 (unsigned) significand_size (TYPE_MODE (inter_type))
4851 >= inside_prec - !inside_unsignedp)
4854 /* (float_type)(integer_type) x -> trunc (x) if the type of x matches
4855 float_type. Only do the transformation if we do not need to preserve
4856 trapping behaviour, so require !flag_trapping_math. */
4859 (float (fix_trunc @0))
4860 (if (!flag_trapping_math
4861 && !HONOR_SIGNED_ZEROS (type)
4862 && types_match (type, TREE_TYPE (@0))
4863 && direct_internal_fn_supported_p (IFN_TRUNC, type,
4868 /* If we have a narrowing conversion to an integral type that is fed by a
4869 BIT_AND_EXPR, we might be able to remove the BIT_AND_EXPR if it merely
4870 masks off bits outside the final type (and nothing else). */
4872 (convert (bit_and @0 INTEGER_CST@1))
4873 (if (INTEGRAL_TYPE_P (type)
4874 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
4875 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))
4876 && operand_equal_p (@1, build_low_bits_mask (TREE_TYPE (@1),
4877 TYPE_PRECISION (type)), 0))
4881 /* (X /[ex] A) * A -> X. */
4883 (mult (convert1? (exact_div @0 @@1)) (convert2? @1))
4886 /* Simplify (A / B) * B + (A % B) -> A. */
4887 (for div (trunc_div ceil_div floor_div round_div)
4888 mod (trunc_mod ceil_mod floor_mod round_mod)
4890 (plus:c (mult:c (div @0 @1) @1) (mod @0 @1))
4893 /* x / y * y == x -> x % y == 0. */
4895 (eq:c (mult:c (trunc_div:s @0 @1) @1) @0)
4896 (if (TREE_CODE (TREE_TYPE (@0)) != COMPLEX_TYPE)
4897 (eq (trunc_mod @0 @1) { build_zero_cst (TREE_TYPE (@0)); })))
4899 /* ((X /[ex] A) +- B) * A --> X +- A * B. */
4900 (for op (plus minus)
4902 (mult (convert1? (op (convert2? (exact_div @0 INTEGER_CST@@1)) INTEGER_CST@2)) @1)
4903 (if (tree_nop_conversion_p (type, TREE_TYPE (@2))
4904 && tree_nop_conversion_p (TREE_TYPE (@0), TREE_TYPE (@2)))
4907 wi::overflow_type overflow;
4908 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@2),
4909 TYPE_SIGN (type), &overflow);
4911 (if (types_match (type, TREE_TYPE (@2))
4912 && types_match (TREE_TYPE (@0), TREE_TYPE (@2)) && !overflow)
4913 (op @0 { wide_int_to_tree (type, mul); })
4914 (with { tree utype = unsigned_type_for (type); }
4915 (convert (op (convert:utype @0)
4916 (mult (convert:utype @1) (convert:utype @2))))))))))
4918 /* Canonicalization of binary operations. */
4920 /* Convert X + -C into X - C. */
4922 (plus @0 REAL_CST@1)
4923 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
4924 (with { tree tem = const_unop (NEGATE_EXPR, type, @1); }
4925 (if (!TREE_OVERFLOW (tem) || !flag_trapping_math)
4926 (minus @0 { tem; })))))
4928 /* Convert x+x into x*2. */
4931 (if (SCALAR_FLOAT_TYPE_P (type))
4932 (mult @0 { build_real (type, dconst2); })
4933 (if (INTEGRAL_TYPE_P (type))
4934 (mult @0 { build_int_cst (type, 2); }))))
4938 (minus integer_zerop @1)
4941 (pointer_diff integer_zerop @1)
4942 (negate (convert @1)))
4944 /* (ARG0 - ARG1) is the same as (-ARG1 + ARG0). So check whether
4945 ARG0 is zero and X + ARG0 reduces to X, since that would mean
4946 (-ARG1 + ARG0) reduces to -ARG1. */
4948 (minus real_zerop@0 @1)
4949 (if (fold_real_zero_addition_p (type, @1, @0, 0))
4952 /* Transform x * -1 into -x. */
4954 (mult @0 integer_minus_onep)
4957 /* Reassociate (X * CST) * Y to (X * Y) * CST. This does not introduce
4958 signed overflow for CST != 0 && CST != -1. */
4960 (mult:c (mult:s@3 @0 INTEGER_CST@1) @2)
4961 (if (TREE_CODE (@2) != INTEGER_CST
4963 && !integer_zerop (@1) && !integer_minus_onep (@1))
4964 (mult (mult @0 @2) @1)))
4966 /* True if we can easily extract the real and imaginary parts of a complex
4968 (match compositional_complex
4969 (convert? (complex @0 @1)))
4971 /* COMPLEX_EXPR and REALPART/IMAGPART_EXPR cancellations. */
4973 (complex (realpart @0) (imagpart @0))
4976 (realpart (complex @0 @1))
4979 (imagpart (complex @0 @1))
4982 /* Sometimes we only care about half of a complex expression. */
4984 (realpart (convert?:s (conj:s @0)))
4985 (convert (realpart @0)))
4987 (imagpart (convert?:s (conj:s @0)))
4988 (convert (negate (imagpart @0))))
4989 (for part (realpart imagpart)
4990 (for op (plus minus)
4992 (part (convert?:s@2 (op:s @0 @1)))
4993 (convert (op (part @0) (part @1))))))
4995 (realpart (convert?:s (CEXPI:s @0)))
4998 (imagpart (convert?:s (CEXPI:s @0)))
5001 /* conj(conj(x)) -> x */
5003 (conj (convert? (conj @0)))
5004 (if (tree_nop_conversion_p (TREE_TYPE (@0), type))
5007 /* conj({x,y}) -> {x,-y} */
5009 (conj (convert?:s (complex:s @0 @1)))
5010 (with { tree itype = TREE_TYPE (type); }
5011 (complex (convert:itype @0) (negate (convert:itype @1)))))
5013 /* BSWAP simplifications, transforms checked by gcc.dg/builtin-bswap-8.c. */
5019 (bswap (bit_not (bswap @0)))
5021 (for bitop (bit_xor bit_ior bit_and)
5023 (bswap (bitop:c (bswap @0) @1))
5024 (bitop @0 (bswap @1))))
5027 (cmp (bswap@2 @0) (bswap @1))
5028 (with { tree ctype = TREE_TYPE (@2); }
5029 (cmp (convert:ctype @0) (convert:ctype @1))))
5031 (cmp (bswap @0) INTEGER_CST@1)
5032 (with { tree ctype = TREE_TYPE (@1); }
5033 (cmp (convert:ctype @0) (bswap! @1)))))
5034 /* (bswap(x) >> C1) & C2 can sometimes be simplified to (x >> C3) & C2. */
5036 (bit_and (convert1? (rshift@0 (convert2? (bswap@4 @1)) INTEGER_CST@2))
5038 (if (BITS_PER_UNIT == 8
5039 && tree_fits_uhwi_p (@2)
5040 && tree_fits_uhwi_p (@3))
5043 unsigned HOST_WIDE_INT prec = TYPE_PRECISION (TREE_TYPE (@4));
5044 unsigned HOST_WIDE_INT bits = tree_to_uhwi (@2);
5045 unsigned HOST_WIDE_INT mask = tree_to_uhwi (@3);
5046 unsigned HOST_WIDE_INT lo = bits & 7;
5047 unsigned HOST_WIDE_INT hi = bits - lo;
5050 && mask < (256u>>lo)
5051 && bits < TYPE_PRECISION (TREE_TYPE(@0)))
5052 (with { unsigned HOST_WIDE_INT ns = (prec - (hi + 8)) + lo; }
5054 (bit_and (convert @1) @3)
5057 tree utype = unsigned_type_for (TREE_TYPE (@1));
5058 tree nst = build_int_cst (integer_type_node, ns);
5060 (bit_and (convert (rshift:utype (convert:utype @1) {nst;})) @3))))))))
5061 /* bswap(x) >> C1 can sometimes be simplified to (T)x >> C2. */
5063 (rshift (convert? (bswap@2 @0)) INTEGER_CST@1)
5064 (if (BITS_PER_UNIT == 8
5065 && CHAR_TYPE_SIZE == 8
5066 && tree_fits_uhwi_p (@1))
5069 unsigned HOST_WIDE_INT prec = TYPE_PRECISION (TREE_TYPE (@2));
5070 unsigned HOST_WIDE_INT bits = tree_to_uhwi (@1);
5071 /* If the bswap was extended before the original shift, this
5072 byte (shift) has the sign of the extension, not the sign of
5073 the original shift. */
5074 tree st = TYPE_PRECISION (type) > prec ? TREE_TYPE (@2) : type;
5076 /* Special case: logical right shift of sign-extended bswap.
5077 (unsigned)(short)bswap16(x)>>12 is (unsigned)((short)x<<8)>>12. */
5078 (if (TYPE_PRECISION (type) > prec
5079 && !TYPE_UNSIGNED (TREE_TYPE (@2))
5080 && TYPE_UNSIGNED (type)
5081 && bits < prec && bits + 8 >= prec)
5082 (with { tree nst = build_int_cst (integer_type_node, prec - 8); }
5083 (rshift (convert (lshift:st (convert:st @0) {nst;})) @1))
5084 (if (bits + 8 == prec)
5085 (if (TYPE_UNSIGNED (st))
5086 (convert (convert:unsigned_char_type_node @0))
5087 (convert (convert:signed_char_type_node @0)))
5088 (if (bits < prec && bits + 8 > prec)
5091 tree nst = build_int_cst (integer_type_node, bits & 7);
5092 tree bt = TYPE_UNSIGNED (st) ? unsigned_char_type_node
5093 : signed_char_type_node;
5095 (convert (rshift:bt (convert:bt @0) {nst;})))))))))
5096 /* bswap(x) & C1 can sometimes be simplified to (x >> C2) & C1. */
5098 (bit_and (convert? (bswap@2 @0)) INTEGER_CST@1)
5099 (if (BITS_PER_UNIT == 8
5100 && tree_fits_uhwi_p (@1)
5101 && tree_to_uhwi (@1) < 256)
5104 unsigned HOST_WIDE_INT prec = TYPE_PRECISION (TREE_TYPE (@2));
5105 tree utype = unsigned_type_for (TREE_TYPE (@0));
5106 tree nst = build_int_cst (integer_type_node, prec - 8);
5108 (bit_and (convert (rshift:utype (convert:utype @0) {nst;})) @1)))))
5111 /* Combine COND_EXPRs and VEC_COND_EXPRs. */
5113 /* Simplify constant conditions.
5114 Only optimize constant conditions when the selected branch
5115 has the same type as the COND_EXPR. This avoids optimizing
5116 away "c ? x : throw", where the throw has a void type.
5117 Note that we cannot throw away the fold-const.cc variant nor
5118 this one as we depend on doing this transform before possibly
5119 A ? B : B -> B triggers and the fold-const.cc one can optimize
5120 0 ? A : B to B even if A has side-effects. Something
5121 genmatch cannot handle. */
5123 (cond INTEGER_CST@0 @1 @2)
5124 (if (integer_zerop (@0))
5125 (if (!VOID_TYPE_P (TREE_TYPE (@2)) || VOID_TYPE_P (type))
5127 (if (!VOID_TYPE_P (TREE_TYPE (@1)) || VOID_TYPE_P (type))
5130 (vec_cond VECTOR_CST@0 @1 @2)
5131 (if (integer_all_onesp (@0))
5133 (if (integer_zerop (@0))
5136 /* Sink unary operations to branches, but only if we do fold both. */
5137 (for op (negate bit_not abs absu)
5139 (op (vec_cond:s @0 @1 @2))
5140 (vec_cond @0 (op! @1) (op! @2))))
5142 /* Sink unary conversions to branches, but only if we do fold both
5143 and the target's truth type is the same as we already have. */
5145 (convert (vec_cond:s @0 @1 @2))
5146 (if (VECTOR_TYPE_P (type)
5147 && types_match (TREE_TYPE (@0), truth_type_for (type)))
5148 (vec_cond @0 (convert! @1) (convert! @2))))
5150 /* Likewise for view_convert of nop_conversions. */
5152 (view_convert (vec_cond:s @0 @1 @2))
5153 (if (VECTOR_TYPE_P (type) && VECTOR_TYPE_P (TREE_TYPE (@1))
5154 && known_eq (TYPE_VECTOR_SUBPARTS (type),
5155 TYPE_VECTOR_SUBPARTS (TREE_TYPE (@1)))
5156 && tree_nop_conversion_p (TREE_TYPE (type), TREE_TYPE (TREE_TYPE (@1))))
5157 (vec_cond @0 (view_convert! @1) (view_convert! @2))))
5159 /* Sink binary operation to branches, but only if we can fold it. */
5160 (for op (tcc_comparison plus minus mult bit_and bit_ior bit_xor
5161 lshift rshift rdiv trunc_div ceil_div floor_div round_div
5162 trunc_mod ceil_mod floor_mod round_mod min max)
5163 /* (c ? a : b) op (c ? d : e) --> c ? (a op d) : (b op e) */
5165 (op (vec_cond:s @0 @1 @2) (vec_cond:s @0 @3 @4))
5166 (if (TREE_CODE_CLASS (op) != tcc_comparison
5167 || types_match (type, TREE_TYPE (@1))
5168 || expand_vec_cond_expr_p (type, TREE_TYPE (@0), ERROR_MARK)
5169 || (optimize_vectors_before_lowering_p ()
5170 /* The following is optimistic on the side of non-support, we are
5171 missing the legacy vcond{,u,eq} cases. Do this only when
5172 lowering will be able to fixup.. */
5173 && !expand_vec_cond_expr_p (TREE_TYPE (@1),
5174 TREE_TYPE (@0), ERROR_MARK)))
5175 (vec_cond @0 (op! @1 @3) (op! @2 @4))))
5177 /* (c ? a : b) op d --> c ? (a op d) : (b op d) */
5179 (op (vec_cond:s @0 @1 @2) @3)
5180 (if (TREE_CODE_CLASS (op) != tcc_comparison
5181 || types_match (type, TREE_TYPE (@1))
5182 || expand_vec_cond_expr_p (type, TREE_TYPE (@0), ERROR_MARK)
5183 || (optimize_vectors_before_lowering_p ()
5184 && !expand_vec_cond_expr_p (TREE_TYPE (@1),
5185 TREE_TYPE (@0), ERROR_MARK)))
5186 (vec_cond @0 (op! @1 @3) (op! @2 @3))))
5188 (op @3 (vec_cond:s @0 @1 @2))
5189 (if (TREE_CODE_CLASS (op) != tcc_comparison
5190 || types_match (type, TREE_TYPE (@1))
5191 || expand_vec_cond_expr_p (type, TREE_TYPE (@0), ERROR_MARK)
5192 || (optimize_vectors_before_lowering_p ()
5193 && !expand_vec_cond_expr_p (TREE_TYPE (@1),
5194 TREE_TYPE (@0), ERROR_MARK)))
5195 (vec_cond @0 (op! @3 @1) (op! @3 @2)))))
5198 (match (nop_atomic_bit_test_and_p @0 @1 @4)
5199 (bit_and (convert?@4 (ATOMIC_FETCH_OR_XOR_N @2 INTEGER_CST@0 @3))
5202 int ibit = tree_log2 (@0);
5203 int ibit2 = tree_log2 (@1);
5207 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))))))
5209 (match (nop_atomic_bit_test_and_p @0 @1 @3)
5210 (bit_and (convert?@3 (SYNC_FETCH_OR_XOR_N @2 INTEGER_CST@0))
5213 int ibit = tree_log2 (@0);
5214 int ibit2 = tree_log2 (@1);
5218 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))))))
5220 (match (nop_atomic_bit_test_and_p @0 @0 @4)
5223 (ATOMIC_FETCH_OR_XOR_N @2 (nop_convert? (lshift@0 integer_onep@5 @6)) @3))
5225 (if (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0)))))
5227 (match (nop_atomic_bit_test_and_p @0 @0 @4)
5230 (SYNC_FETCH_OR_XOR_N @2 (nop_convert? (lshift@0 integer_onep@3 @5))))
5232 (if (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0)))))
5234 (match (nop_atomic_bit_test_and_p @0 @1 @3)
5235 (bit_and@4 (convert?@3 (ATOMIC_FETCH_AND_N @2 INTEGER_CST@0 @5))
5238 int ibit = wi::exact_log2 (wi::zext (wi::bit_not (wi::to_wide (@0)),
5239 TYPE_PRECISION(type)));
5240 int ibit2 = tree_log2 (@1);
5244 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))))))
5246 (match (nop_atomic_bit_test_and_p @0 @1 @3)
5248 (convert?@3 (SYNC_FETCH_AND_AND_N @2 INTEGER_CST@0))
5251 int ibit = wi::exact_log2 (wi::zext (wi::bit_not (wi::to_wide (@0)),
5252 TYPE_PRECISION(type)));
5253 int ibit2 = tree_log2 (@1);
5257 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))))))
5259 (match (nop_atomic_bit_test_and_p @4 @0 @3)
5262 (ATOMIC_FETCH_AND_N @2 (nop_convert?@4 (bit_not (lshift@0 integer_onep@6 @7))) @5))
5264 (if (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@4)))))
5266 (match (nop_atomic_bit_test_and_p @4 @0 @3)
5269 (SYNC_FETCH_AND_AND_N @2 (nop_convert?@4 (bit_not (lshift@0 integer_onep@6 @7)))))
5271 (if (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@4)))))
5275 /* (v ? w : 0) ? a : b is just (v & w) ? a : b
5276 Currently disabled after pass lvec because ARM understands
5277 VEC_COND_EXPR<v==w,-1,0> but not a plain v==w fed to BIT_IOR_EXPR. */
5279 /* These can only be done in gimple as fold likes to convert:
5280 (CMP) & N into (CMP) ? N : 0
5281 and we try to match the same pattern again and again. */
5283 (vec_cond (vec_cond:s @0 @3 integer_zerop) @1 @2)
5284 (if (optimize_vectors_before_lowering_p () && types_match (@0, @3))
5285 (vec_cond (bit_and @0 @3) @1 @2)))
5287 (vec_cond (vec_cond:s @0 integer_all_onesp @3) @1 @2)
5288 (if (optimize_vectors_before_lowering_p () && types_match (@0, @3))
5289 (vec_cond (bit_ior @0 @3) @1 @2)))
5291 (vec_cond (vec_cond:s @0 integer_zerop @3) @1 @2)
5292 (if (optimize_vectors_before_lowering_p () && types_match (@0, @3))
5293 (vec_cond (bit_ior @0 (bit_not @3)) @2 @1)))
5295 (vec_cond (vec_cond:s @0 @3 integer_all_onesp) @1 @2)
5296 (if (optimize_vectors_before_lowering_p () && types_match (@0, @3))
5297 (vec_cond (bit_and @0 (bit_not @3)) @2 @1)))
5299 /* ((VCE (a cmp b ? -1 : 0)) < 0) ? c : d is just
5300 (VCE ((a cmp b) ? (VCE c) : (VCE d))) when TYPE_PRECISION of the
5301 component type of the outer vec_cond is greater equal the inner one. */
5302 (for cmp (simple_comparison)
5305 (lt (view_convert@5 (vec_cond@6 (cmp@4 @0 @1)
5308 integer_zerop) @2 @3)
5309 (if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (@0))
5310 && VECTOR_INTEGER_TYPE_P (TREE_TYPE (@5))
5311 && !TYPE_UNSIGNED (TREE_TYPE (@5))
5312 && VECTOR_TYPE_P (TREE_TYPE (@6))
5313 && VECTOR_TYPE_P (type)
5314 && tree_int_cst_le (TYPE_SIZE (TREE_TYPE (type)),
5315 TYPE_SIZE (TREE_TYPE (TREE_TYPE (@6))))
5316 && TYPE_SIZE (type) == TYPE_SIZE (TREE_TYPE (@6)))
5317 (with { tree vtype = TREE_TYPE (@6);}
5319 (vec_cond @4 (view_convert:vtype @2) (view_convert:vtype @3)))))))
5321 /* c1 ? c2 ? a : b : b --> (c1 & c2) ? a : b */
5323 (vec_cond @0 (vec_cond:s @1 @2 @3) @3)
5324 (if (optimize_vectors_before_lowering_p () && types_match (@0, @1))
5325 (vec_cond (bit_and @0 @1) @2 @3)))
5327 (vec_cond @0 @2 (vec_cond:s @1 @2 @3))
5328 (if (optimize_vectors_before_lowering_p () && types_match (@0, @1))
5329 (vec_cond (bit_ior @0 @1) @2 @3)))
5331 (vec_cond @0 (vec_cond:s @1 @2 @3) @2)
5332 (if (optimize_vectors_before_lowering_p () && types_match (@0, @1))
5333 (vec_cond (bit_ior (bit_not @0) @1) @2 @3)))
5335 (vec_cond @0 @3 (vec_cond:s @1 @2 @3))
5336 (if (optimize_vectors_before_lowering_p () && types_match (@0, @1))
5337 (vec_cond (bit_and (bit_not @0) @1) @2 @3)))
5340 /* Canonicalize mask ? { 0, ... } : { -1, ...} to ~mask if the mask
5341 types are compatible. */
5343 (vec_cond @0 VECTOR_CST@1 VECTOR_CST@2)
5344 (if (VECTOR_BOOLEAN_TYPE_P (type)
5345 && types_match (type, TREE_TYPE (@0)))
5346 (if (integer_zerop (@1) && integer_all_onesp (@2))
5348 (if (integer_all_onesp (@1) && integer_zerop (@2))
5351 /* A few simplifications of "a ? CST1 : CST2". */
5352 /* NOTE: Only do this on gimple as the if-chain-to-switch
5353 optimization depends on the gimple to have if statements in it. */
5356 (cond @0 INTEGER_CST@1 INTEGER_CST@2)
5358 (if (integer_zerop (@2))
5360 /* a ? 1 : 0 -> a if 0 and 1 are integral types. */
5361 (if (integer_onep (@1))
5362 (convert (convert:boolean_type_node @0)))
5363 /* a ? -1 : 0 -> -a. */
5364 (if (INTEGRAL_TYPE_P (type) && integer_all_onesp (@1))
5365 (if (TYPE_PRECISION (type) == 1)
5366 /* For signed 1-bit precision just cast bool to the type. */
5367 (convert (convert:boolean_type_node @0))
5368 (if (TREE_CODE (type) == BOOLEAN_TYPE)
5370 tree intt = build_nonstandard_integer_type (TYPE_PRECISION (type),
5371 TYPE_UNSIGNED (type));
5373 (convert (negate (convert:intt (convert:boolean_type_node @0)))))
5374 (negate (convert:type (convert:boolean_type_node @0))))))
5375 /* a ? powerof2cst : 0 -> a << (log2(powerof2cst)) */
5376 (if (INTEGRAL_TYPE_P (type) && integer_pow2p (@1))
5378 tree shift = build_int_cst (integer_type_node, tree_log2 (@1));
5380 (lshift (convert (convert:boolean_type_node @0)) { shift; })))))
5381 (if (integer_zerop (@1))
5383 /* a ? 0 : 1 -> !a. */
5384 (if (integer_onep (@2))
5385 (convert (bit_xor (convert:boolean_type_node @0) { boolean_true_node; })))
5386 /* a ? 0 : -1 -> -(!a). */
5387 (if (INTEGRAL_TYPE_P (type) && integer_all_onesp (@2))
5388 (if (TYPE_PRECISION (type) == 1)
5389 /* For signed 1-bit precision just cast bool to the type. */
5390 (convert (bit_xor (convert:boolean_type_node @0) { boolean_true_node; }))
5391 (if (TREE_CODE (type) == BOOLEAN_TYPE)
5393 tree intt = build_nonstandard_integer_type (TYPE_PRECISION (type),
5394 TYPE_UNSIGNED (type));
5396 (convert (negate (convert:intt (bit_xor (convert:boolean_type_node @0)
5397 { boolean_true_node; })))))
5398 (negate (convert:type (bit_xor (convert:boolean_type_node @0)
5399 { boolean_true_node; }))))))
5400 /* a ? 0 : powerof2cst -> (!a) << (log2(powerof2cst)) */
5401 (if (INTEGRAL_TYPE_P (type) && integer_pow2p (@2))
5403 tree shift = build_int_cst (integer_type_node, tree_log2 (@2));
5405 (lshift (convert (bit_xor (convert:boolean_type_node @0)
5406 { boolean_true_node; })) { shift; })))))))
5408 /* (a > 1) ? 0 : (cast)a is the same as (cast)(a == 1)
5409 for unsigned types. */
5411 (cond (gt @0 integer_onep@1) integer_zerop (convert? @2))
5412 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
5413 && bitwise_equal_p (@0, @2))
5414 (convert (eq @0 @1))
5418 /* (a <= 1) & (cast)a is the same as (cast)(a == 1)
5419 for unsigned types. */
5421 (bit_and:c (convert1? (le @0 integer_onep@1)) (convert2? @2))
5422 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
5423 && bitwise_equal_p (@0, @2))
5424 (convert (eq @0 @1))
5428 /* `(a == CST) & a` can be simplified to `0` or `(a == CST)` depending
5429 on the first bit of the CST. */
5431 (bit_and:c (convert@2 (eq @0 INTEGER_CST@1)) (convert? @0))
5432 (if ((wi::to_wide (@1) & 1) != 0)
5434 { build_zero_cst (type); }))
5437 # x_5 in range [cst1, cst2] where cst2 = cst1 + 1
5438 x_5 == cstN ? cst4 : cst3
5439 # op is == or != and N is 1 or 2
5440 to r_6 = x_5 + (min (cst3, cst4) - cst1) or
5441 r_6 = (min (cst3, cst4) + cst1) - x_5 depending on op, N and which
5442 of cst3 and cst4 is smaller.
5443 This was originally done by two_value_replacement in phiopt (PR 88676). */
5446 (cond (eqne SSA_NAME@0 INTEGER_CST@1) INTEGER_CST@2 INTEGER_CST@3)
5447 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5448 && INTEGRAL_TYPE_P (type)
5449 && (wi::to_widest (@2) + 1 == wi::to_widest (@3)
5450 || wi::to_widest (@2) == wi::to_widest (@3) + 1))
5453 get_range_query (cfun)->range_of_expr (r, @0);
5454 if (r.undefined_p ())
5455 r.set_varying (TREE_TYPE (@0));
5457 wide_int min = r.lower_bound ();
5458 wide_int max = r.upper_bound ();
5461 && (wi::to_wide (@1) == min
5462 || wi::to_wide (@1) == max))
5464 tree arg0 = @2, arg1 = @3;
5466 if ((eqne == EQ_EXPR) ^ (wi::to_wide (@1) == min))
5467 std::swap (arg0, arg1);
5468 if (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (type))
5469 type1 = TREE_TYPE (@0);
5472 auto prec = TYPE_PRECISION (type1);
5473 auto unsign = TYPE_UNSIGNED (type1);
5474 if (TREE_CODE (type1) == BOOLEAN_TYPE)
5475 type1 = build_nonstandard_integer_type (prec, unsign);
5476 min = wide_int::from (min, prec,
5477 TYPE_SIGN (TREE_TYPE (@0)));
5478 wide_int a = wide_int::from (wi::to_wide (arg0), prec,
5480 enum tree_code code;
5481 wi::overflow_type ovf;
5482 if (tree_int_cst_lt (arg0, arg1))
5488 /* lhs is known to be in range [min, min+1] and we want to add a
5489 to it. Check if that operation can overflow for those 2 values
5490 and if yes, force unsigned type. */
5491 wi::add (min + (wi::neg_p (a) ? 0 : 1), a, SIGNED, &ovf);
5493 type1 = unsigned_type_for (type1);
5502 /* lhs is known to be in range [min, min+1] and we want to subtract
5503 it from a. Check if that operation can overflow for those 2
5504 values and if yes, force unsigned type. */
5505 wi::sub (a, min + (wi::neg_p (min) ? 0 : 1), SIGNED, &ovf);
5507 type1 = unsigned_type_for (type1);
5510 tree arg = wide_int_to_tree (type1, a);
5512 (if (code == PLUS_EXPR)
5513 (convert (plus (convert:type1 @0) { arg; }))
5514 (convert (minus { arg; } (convert:type1 @0))))))))))
5518 (convert (cond@0 @1 INTEGER_CST@2 INTEGER_CST@3))
5519 (if (INTEGRAL_TYPE_P (type)
5520 && INTEGRAL_TYPE_P (TREE_TYPE (@0)))
5521 (cond @1 (convert @2) (convert @3))))
5523 /* Simplification moved from fold_cond_expr_with_comparison. It may also
5525 /* This pattern implements two kinds simplification:
5528 (cond (cmp (convert1? x) c1) (convert2? x) c2) -> (minmax (x c)) if:
5529 1) Conversions are type widening from smaller type.
5530 2) Const c1 equals to c2 after canonicalizing comparison.
5531 3) Comparison has tree code LT, LE, GT or GE.
5532 This specific pattern is needed when (cmp (convert x) c) may not
5533 be simplified by comparison patterns because of multiple uses of
5534 x. It also makes sense here because simplifying across multiple
5535 referred var is always benefitial for complicated cases.
5538 (cond (eq (convert1? x) c1) (convert2? x) c2) -> (cond (eq x c1) c1 c2). */
5539 (for cmp (lt le gt ge eq ne)
5541 (cond (cmp (convert1? @1) INTEGER_CST@3) (convert2? @1) INTEGER_CST@2)
5544 tree from_type = TREE_TYPE (@1);
5545 tree c1_type = TREE_TYPE (@3), c2_type = TREE_TYPE (@2);
5546 enum tree_code code = ERROR_MARK;
5548 if (INTEGRAL_TYPE_P (from_type)
5549 && int_fits_type_p (@2, from_type)
5550 && (types_match (c1_type, from_type)
5551 || (TYPE_PRECISION (c1_type) > TYPE_PRECISION (from_type)
5552 && (TYPE_UNSIGNED (from_type)
5553 || TYPE_SIGN (c1_type) == TYPE_SIGN (from_type))))
5554 && (types_match (c2_type, from_type)
5555 || (TYPE_PRECISION (c2_type) > TYPE_PRECISION (from_type)
5556 && (TYPE_UNSIGNED (from_type)
5557 || TYPE_SIGN (c2_type) == TYPE_SIGN (from_type)))))
5560 code = minmax_from_comparison (cmp, @1, @3, @1, @2);
5561 /* Can do A == C1 ? A : C2 -> A == C1 ? C1 : C2? */
5562 else if (int_fits_type_p (@3, from_type))
5566 (if (code == MAX_EXPR)
5567 (convert (max @1 (convert @2)))
5568 (if (code == MIN_EXPR)
5569 (convert (min @1 (convert @2)))
5570 (if (code == EQ_EXPR)
5571 (convert (cond (eq @1 (convert @3))
5572 (convert:from_type @3) (convert:from_type @2)))))))))
5574 /* (cond (cmp (convert? x) c1) (op x c2) c3) -> (op (minmax x c1) c2) if:
5576 1) OP is PLUS or MINUS.
5577 2) CMP is LT, LE, GT or GE.
5578 3) C3 == (C1 op C2), and computation doesn't have undefined behavior.
5580 This pattern also handles special cases like:
5582 A) Operand x is a unsigned to signed type conversion and c1 is
5583 integer zero. In this case,
5584 (signed type)x < 0 <=> x > MAX_VAL(signed type)
5585 (signed type)x >= 0 <=> x <= MAX_VAL(signed type)
5586 B) Const c1 may not equal to (C3 op' C2). In this case we also
5587 check equality for (c1+1) and (c1-1) by adjusting comparison
5590 TODO: Though signed type is handled by this pattern, it cannot be
5591 simplified at the moment because C standard requires additional
5592 type promotion. In order to match&simplify it here, the IR needs
5593 to be cleaned up by other optimizers, i.e, VRP. */
5594 (for op (plus minus)
5595 (for cmp (lt le gt ge)
5597 (cond (cmp (convert? @X) INTEGER_CST@1) (op @X INTEGER_CST@2) INTEGER_CST@3)
5598 (with { tree from_type = TREE_TYPE (@X), to_type = TREE_TYPE (@1); }
5599 (if (types_match (from_type, to_type)
5600 /* Check if it is special case A). */
5601 || (TYPE_UNSIGNED (from_type)
5602 && !TYPE_UNSIGNED (to_type)
5603 && TYPE_PRECISION (from_type) == TYPE_PRECISION (to_type)
5604 && integer_zerop (@1)
5605 && (cmp == LT_EXPR || cmp == GE_EXPR)))
5608 wi::overflow_type overflow = wi::OVF_NONE;
5609 enum tree_code code, cmp_code = cmp;
5611 wide_int c1 = wi::to_wide (@1);
5612 wide_int c2 = wi::to_wide (@2);
5613 wide_int c3 = wi::to_wide (@3);
5614 signop sgn = TYPE_SIGN (from_type);
5616 /* Handle special case A), given x of unsigned type:
5617 ((signed type)x < 0) <=> (x > MAX_VAL(signed type))
5618 ((signed type)x >= 0) <=> (x <= MAX_VAL(signed type)) */
5619 if (!types_match (from_type, to_type))
5621 if (cmp_code == LT_EXPR)
5623 if (cmp_code == GE_EXPR)
5625 c1 = wi::max_value (to_type);
5627 /* To simplify this pattern, we require c3 = (c1 op c2). Here we
5628 compute (c3 op' c2) and check if it equals to c1 with op' being
5629 the inverted operator of op. Make sure overflow doesn't happen
5630 if it is undefined. */
5631 if (op == PLUS_EXPR)
5632 real_c1 = wi::sub (c3, c2, sgn, &overflow);
5634 real_c1 = wi::add (c3, c2, sgn, &overflow);
5637 if (!overflow || !TYPE_OVERFLOW_UNDEFINED (from_type))
5639 /* Check if c1 equals to real_c1. Boundary condition is handled
5640 by adjusting comparison operation if necessary. */
5641 if (!wi::cmp (wi::sub (real_c1, 1, sgn, &overflow), c1, sgn)
5644 /* X <= Y - 1 equals to X < Y. */
5645 if (cmp_code == LE_EXPR)
5647 /* X > Y - 1 equals to X >= Y. */
5648 if (cmp_code == GT_EXPR)
5651 if (!wi::cmp (wi::add (real_c1, 1, sgn, &overflow), c1, sgn)
5654 /* X < Y + 1 equals to X <= Y. */
5655 if (cmp_code == LT_EXPR)
5657 /* X >= Y + 1 equals to X > Y. */
5658 if (cmp_code == GE_EXPR)
5661 if (code != cmp_code || !wi::cmp (real_c1, c1, sgn))
5663 if (cmp_code == LT_EXPR || cmp_code == LE_EXPR)
5665 if (cmp_code == GT_EXPR || cmp_code == GE_EXPR)
5670 (if (code == MAX_EXPR)
5671 (op (max @X { wide_int_to_tree (from_type, real_c1); })
5672 { wide_int_to_tree (from_type, c2); })
5673 (if (code == MIN_EXPR)
5674 (op (min @X { wide_int_to_tree (from_type, real_c1); })
5675 { wide_int_to_tree (from_type, c2); })))))))))
5678 /* A >= B ? A : B -> max (A, B) and friends. The code is still
5679 in fold_cond_expr_with_comparison for GENERIC folding with
5680 some extra constraints. */
5681 (for cmp (eq ne le lt unle unlt ge gt unge ungt uneq ltgt)
5683 (cond (cmp:c (nop_convert1?@c0 @0) (nop_convert2?@c1 @1))
5684 (convert3? @0) (convert4? @1))
5685 (if (!HONOR_SIGNED_ZEROS (type)
5686 && (/* Allow widening conversions of the compare operands as data. */
5687 (INTEGRAL_TYPE_P (type)
5688 && types_match (TREE_TYPE (@c0), TREE_TYPE (@0))
5689 && types_match (TREE_TYPE (@c1), TREE_TYPE (@1))
5690 && TYPE_PRECISION (TREE_TYPE (@0)) <= TYPE_PRECISION (type)
5691 && TYPE_PRECISION (TREE_TYPE (@1)) <= TYPE_PRECISION (type))
5692 /* Or sign conversions for the comparison. */
5693 || (types_match (type, TREE_TYPE (@0))
5694 && types_match (type, TREE_TYPE (@1)))))
5696 (if (cmp == EQ_EXPR)
5697 (if (VECTOR_TYPE_P (type))
5700 (if (cmp == NE_EXPR)
5701 (if (VECTOR_TYPE_P (type))
5704 (if (cmp == LE_EXPR || cmp == UNLE_EXPR || cmp == LT_EXPR || cmp == UNLT_EXPR)
5705 (if (!HONOR_NANS (type))
5706 (if (VECTOR_TYPE_P (type))
5707 (view_convert (min @c0 @c1))
5708 (convert (min @c0 @c1)))))
5709 (if (cmp == GE_EXPR || cmp == UNGE_EXPR || cmp == GT_EXPR || cmp == UNGT_EXPR)
5710 (if (!HONOR_NANS (type))
5711 (if (VECTOR_TYPE_P (type))
5712 (view_convert (max @c0 @c1))
5713 (convert (max @c0 @c1)))))
5714 (if (cmp == UNEQ_EXPR)
5715 (if (!HONOR_NANS (type))
5716 (if (VECTOR_TYPE_P (type))
5719 (if (cmp == LTGT_EXPR)
5720 (if (!HONOR_NANS (type))
5721 (if (VECTOR_TYPE_P (type))
5723 (convert @c0))))))))
5725 /* This is for VEC_COND_EXPR
5726 Optimize A < B ? A : B to MIN (A, B)
5727 A > B ? A : B to MAX (A, B). */
5728 (for cmp (lt le ungt unge gt ge unlt unle)
5729 minmax (min min min min max max max max)
5730 MINMAX (MIN_EXPR MIN_EXPR MIN_EXPR MIN_EXPR MAX_EXPR MAX_EXPR MAX_EXPR MAX_EXPR)
5732 (vec_cond (cmp @0 @1) @0 @1)
5733 (if (VECTOR_INTEGER_TYPE_P (type)
5734 && target_supports_op_p (type, MINMAX, optab_vector))
5737 (for cmp (lt le ungt unge gt ge unlt unle)
5738 minmax (max max max max min min min min)
5739 MINMAX (MAX_EXPR MAX_EXPR MAX_EXPR MAX_EXPR MIN_EXPR MIN_EXPR MIN_EXPR MIN_EXPR)
5741 (vec_cond (cmp @0 @1) @1 @0)
5742 (if (VECTOR_INTEGER_TYPE_P (type)
5743 && target_supports_op_p (type, MINMAX, optab_vector))
5747 (for cnd (cond vec_cond)
5748 /* (a != b) ? (a - b) : 0 -> (a - b) */
5750 (cnd (ne:c @0 @1) (minus@2 @0 @1) integer_zerop)
5752 /* (a != b) ? (a ^ b) : 0 -> (a ^ b) */
5754 (cnd (ne:c @0 @1) (bit_xor:c@2 @0 @1) integer_zerop)
5756 /* (a != b) ? (a & b) : a -> (a & b) */
5757 /* (a != b) ? (a | b) : a -> (a | b) */
5758 /* (a != b) ? min(a,b) : a -> min(a,b) */
5759 /* (a != b) ? max(a,b) : a -> max(a,b) */
5760 (for op (bit_and bit_ior min max)
5762 (cnd (ne:c @0 @1) (op:c@2 @0 @1) @0)
5764 /* (a != b) ? (a * b) : (a * a) -> (a * b) */
5765 /* (a != b) ? (a + b) : (a + a) -> (a + b) */
5768 (cnd (ne:c @0 @1) (op@2 @0 @1) (op @0 @0))
5769 (if (ANY_INTEGRAL_TYPE_P (type))
5771 /* (a != b) ? (a + b) : (2 * a) -> (a + b) */
5773 (cnd (ne:c @0 @1) (plus:c@2 @0 @1) (mult @0 uniform_integer_cst_p@3))
5774 (if (wi::to_wide (uniform_integer_cst_p (@3)) == 2)
5778 /* These was part of minmax phiopt. */
5779 /* Optimize (a CMP b) ? minmax<a, c> : minmax<b, c>
5780 to minmax<min/max<a, b>, c> */
5781 (for minmax (min max)
5782 (for cmp (lt le gt ge ne)
5784 (cond (cmp:c @1 @3) (minmax:c @1 @4) (minmax:c @2 @4))
5787 tree_code code = minmax_from_comparison (cmp, @1, @2, @1, @3);
5789 (if (code == MIN_EXPR)
5790 (minmax (min @1 @2) @4)
5791 (if (code == MAX_EXPR)
5792 (minmax (max @1 @2) @4)))))))
5794 /* Optimize (a CMP CST1) ? max<a,CST2> : a */
5795 (for cmp (gt ge lt le)
5796 minmax (min min max max)
5798 (cond (cmp:c @0 @1) (minmax:c@2 @0 @3) @4)
5801 tree_code code = minmax_from_comparison (cmp, @0, @1, @0, @4);
5803 (if ((cmp == LT_EXPR || cmp == LE_EXPR)
5805 && integer_nonzerop (fold_build2 (LE_EXPR, boolean_type_node, @3, @4)))
5807 (if ((cmp == GT_EXPR || cmp == GE_EXPR)
5809 && integer_nonzerop (fold_build2 (GE_EXPR, boolean_type_node, @3, @4)))
5813 /* These patterns should be after min/max detection as simplifications
5814 of `(type)(zero_one ==/!= 0)` to `(type)(zero_one)`
5815 and `(type)(zero_one^1)` are not done yet. See PR 110637.
5816 Even without those, reaching min/max/and/ior faster is better. */
5818 (cond @0 zero_one_valued_p@1 zero_one_valued_p@2)
5820 /* bool0 ? bool1 : 0 -> bool0 & bool1 */
5821 (if (integer_zerop (@2))
5822 (bit_and (convert @0) @1))
5823 /* bool0 ? 0 : bool2 -> (bool0^1) & bool2 */
5824 (if (integer_zerop (@1))
5825 (bit_and (bit_xor (convert @0) { build_one_cst (type); } ) @2))
5826 /* bool0 ? 1 : bool2 -> bool0 | bool2 */
5827 (if (integer_onep (@1))
5828 (bit_ior (convert @0) @2))
5829 /* bool0 ? bool1 : 1 -> (bool0^1) | bool1 */
5830 (if (integer_onep (@2))
5831 (bit_ior (bit_xor (convert @0) @2) @1))
5836 /* X != C1 ? -X : C2 simplifies to -X when -C1 == C2. */
5838 (cond (ne @0 INTEGER_CST@1) (negate@3 @0) INTEGER_CST@2)
5839 (if (!TYPE_SATURATING (type)
5840 && (TYPE_OVERFLOW_WRAPS (type)
5841 || !wi::only_sign_bit_p (wi::to_wide (@1)))
5842 && wi::eq_p (wi::neg (wi::to_wide (@1)), wi::to_wide (@2)))
5845 /* X != C1 ? ~X : C2 simplifies to ~X when ~C1 == C2. */
5847 (cond (ne @0 INTEGER_CST@1) (bit_not@3 @0) INTEGER_CST@2)
5848 (if (wi::eq_p (wi::bit_not (wi::to_wide (@1)), wi::to_wide (@2)))
5851 /* X != C1 ? abs(X) : C2 simplifies to abs(x) when abs(C1) == C2. */
5854 (cond (ne @0 INTEGER_CST@1) (op@3 @0) INTEGER_CST@2)
5855 (if (wi::abs (wi::to_wide (@1)) == wi::to_wide (@2))
5856 (if (op != ABSU_EXPR && wi::only_sign_bit_p (wi::to_wide (@1)))
5857 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
5858 (convert (absu:utype @0)))
5861 /* (X + 1) > Y ? -X : 1 simplifies to X >= Y ? -X : 1 when
5862 X is unsigned, as when X + 1 overflows, X is -1, so -X == 1. */
5864 (cond (gt (plus @0 integer_onep) @1) (negate @0) integer_onep@2)
5865 (if (TYPE_UNSIGNED (type))
5866 (cond (ge @0 @1) (negate @0) @2)))
5868 (for cnd (cond vec_cond)
5869 /* A ? B : (A ? X : C) -> A ? B : C. */
5871 (cnd @0 (cnd @0 @1 @2) @3)
5874 (cnd @0 @1 (cnd @0 @2 @3))
5876 /* A ? B : (!A ? C : X) -> A ? B : C. */
5877 /* ??? This matches embedded conditions open-coded because genmatch
5878 would generate matching code for conditions in separate stmts only.
5879 The following is still important to merge then and else arm cases
5880 from if-conversion. */
5882 (cnd @0 @1 (cnd @2 @3 @4))
5883 (if (inverse_conditions_p (@0, @2))
5886 (cnd @0 (cnd @1 @2 @3) @4)
5887 (if (inverse_conditions_p (@0, @1))
5890 /* A ? B : B -> B. */
5895 /* !A ? B : C -> A ? C : B. */
5897 (cnd (logical_inverted_value truth_valued_p@0) @1 @2)
5898 /* For CONDs, don't handle signed values here. */
5899 (if (cnd == VEC_COND_EXPR
5900 || TYPE_UNSIGNED (TREE_TYPE (@0)))
5903 /* abs/negative simplifications moved from fold_cond_expr_with_comparison.
5905 None of these transformations work for modes with signed
5906 zeros. If A is +/-0, the first two transformations will
5907 change the sign of the result (from +0 to -0, or vice
5908 versa). The last four will fix the sign of the result,
5909 even though the original expressions could be positive or
5910 negative, depending on the sign of A.
5912 Note that all these transformations are correct if A is
5913 NaN, since the two alternatives (A and -A) are also NaNs. */
5915 (for cnd (cond vec_cond)
5916 /* A == 0 ? A : -A same as -A */
5919 (cnd (cmp @0 zerop) @2 (negate@1 @2))
5920 (if (!HONOR_SIGNED_ZEROS (type)
5921 && bitwise_equal_p (@0, @2))
5924 (cnd (cmp @0 zerop) zerop (negate@1 @2))
5925 (if (!HONOR_SIGNED_ZEROS (type)
5926 && bitwise_equal_p (@0, @2))
5929 /* A != 0 ? A : -A same as A */
5932 (cnd (cmp @0 zerop) @1 (negate @1))
5933 (if (!HONOR_SIGNED_ZEROS (type)
5934 && bitwise_equal_p (@0, @1))
5937 (cnd (cmp @0 zerop) @1 integer_zerop)
5938 (if (!HONOR_SIGNED_ZEROS (type)
5939 && bitwise_equal_p (@0, @1))
5942 /* A >=/> 0 ? A : -A same as abs (A) */
5945 (cnd (cmp @0 zerop) @1 (negate @1))
5946 (if (!HONOR_SIGNED_ZEROS (TREE_TYPE(@0))
5947 && !TYPE_UNSIGNED (TREE_TYPE(@0))
5948 && bitwise_equal_p (@0, @1))
5949 (if (TYPE_UNSIGNED (type))
5952 /* A <=/< 0 ? A : -A same as -abs (A) */
5955 (cnd (cmp @0 zerop) @1 (negate @1))
5956 (if (!HONOR_SIGNED_ZEROS (TREE_TYPE(@0))
5957 && !TYPE_UNSIGNED (TREE_TYPE(@0))
5958 && bitwise_equal_p (@0, @1))
5959 (if ((ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
5960 && !TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
5961 || TYPE_UNSIGNED (type))
5963 tree utype = unsigned_type_for (TREE_TYPE(@0));
5965 (convert (negate (absu:utype @0))))
5966 (negate (abs @0)))))
5969 /* (A - B) == 0 ? (A - B) : (B - A) same as (B - A) */
5972 (cnd (cmp (minus@0 @1 @2) zerop) @0 (minus@3 @2 @1))
5973 (if (!HONOR_SIGNED_ZEROS (type))
5976 (cnd (cmp (minus@0 @1 @2) integer_zerop) integer_zerop (minus@3 @2 @1))
5979 /* (A - B) != 0 ? (A - B) : (B - A) same as (A - B) */
5982 (cnd (cmp (minus@0 @1 @2) zerop) @0 (minus @2 @1))
5983 (if (!HONOR_SIGNED_ZEROS (type))
5986 (cnd (cmp (minus@0 @1 @2) integer_zerop) @0 integer_zerop)
5989 /* (A - B) >=/> 0 ? (A - B) : (B - A) same as abs (A - B) */
5992 (cnd (cmp (minus@0 @1 @2) zerop) @0 (minus @2 @1))
5993 (if (!HONOR_SIGNED_ZEROS (type)
5994 && !TYPE_UNSIGNED (type))
5996 /* (A - B) <=/< 0 ? (A - B) : (B - A) same as -abs (A - B) */
5999 (cnd (cmp (minus@0 @1 @2) zerop) @0 (minus @2 @1))
6000 (if (!HONOR_SIGNED_ZEROS (type)
6001 && !TYPE_UNSIGNED (type))
6002 (if (ANY_INTEGRAL_TYPE_P (type)
6003 && !TYPE_OVERFLOW_WRAPS (type))
6005 tree utype = unsigned_type_for (type);
6007 (convert (negate (absu:utype @0))))
6008 (negate (abs @0)))))
6012 /* -(type)!A -> (type)A - 1. */
6014 (negate (convert?:s (logical_inverted_value:s @0)))
6015 (if (INTEGRAL_TYPE_P (type)
6016 && TREE_CODE (type) != BOOLEAN_TYPE
6017 && TYPE_PRECISION (type) > 1
6018 && TREE_CODE (@0) == SSA_NAME
6019 && ssa_name_has_boolean_range (@0))
6020 (plus (convert:type @0) { build_all_ones_cst (type); })))
6022 /* A + (B vcmp C ? 1 : 0) -> A - (B vcmp C ? -1 : 0), since vector comparisons
6023 return all -1 or all 0 results. */
6024 /* ??? We could instead convert all instances of the vec_cond to negate,
6025 but that isn't necessarily a win on its own. */
6027 (plus:c @3 (view_convert? (vec_cond:s @0 integer_each_onep@1 integer_zerop@2)))
6028 (if (VECTOR_TYPE_P (type)
6029 && known_eq (TYPE_VECTOR_SUBPARTS (type),
6030 TYPE_VECTOR_SUBPARTS (TREE_TYPE (@1)))
6031 && (TYPE_MODE (TREE_TYPE (type))
6032 == TYPE_MODE (TREE_TYPE (TREE_TYPE (@1)))))
6033 (minus @3 (view_convert (vec_cond @0 (negate @1) @2)))))
6035 /* ... likewise A - (B vcmp C ? 1 : 0) -> A + (B vcmp C ? -1 : 0). */
6037 (minus @3 (view_convert? (vec_cond:s @0 integer_each_onep@1 integer_zerop@2)))
6038 (if (VECTOR_TYPE_P (type)
6039 && known_eq (TYPE_VECTOR_SUBPARTS (type),
6040 TYPE_VECTOR_SUBPARTS (TREE_TYPE (@1)))
6041 && (TYPE_MODE (TREE_TYPE (type))
6042 == TYPE_MODE (TREE_TYPE (TREE_TYPE (@1)))))
6043 (plus @3 (view_convert (vec_cond @0 (negate @1) @2)))))
6046 /* Simplifications of comparisons. */
6048 /* See if we can reduce the magnitude of a constant involved in a
6049 comparison by changing the comparison code. This is a canonicalization
6050 formerly done by maybe_canonicalize_comparison_1. */
6054 (cmp @0 uniform_integer_cst_p@1)
6055 (with { tree cst = uniform_integer_cst_p (@1); }
6056 (if (tree_int_cst_sgn (cst) == -1)
6057 (acmp @0 { build_uniform_cst (TREE_TYPE (@1),
6058 wide_int_to_tree (TREE_TYPE (cst),
6064 (cmp @0 uniform_integer_cst_p@1)
6065 (with { tree cst = uniform_integer_cst_p (@1); }
6066 (if (tree_int_cst_sgn (cst) == 1)
6067 (acmp @0 { build_uniform_cst (TREE_TYPE (@1),
6068 wide_int_to_tree (TREE_TYPE (cst),
6069 wi::to_wide (cst) - 1)); })))))
6071 /* We can simplify a logical negation of a comparison to the
6072 inverted comparison. As we cannot compute an expression
6073 operator using invert_tree_comparison we have to simulate
6074 that with expression code iteration. */
6075 (for cmp (tcc_comparison)
6076 icmp (inverted_tcc_comparison)
6077 ncmp (inverted_tcc_comparison_with_nans)
6078 /* Ideally we'd like to combine the following two patterns
6079 and handle some more cases by using
6080 (logical_inverted_value (cmp @0 @1))
6081 here but for that genmatch would need to "inline" that.
6082 For now implement what forward_propagate_comparison did. */
6084 (bit_not (cmp @0 @1))
6085 (if (VECTOR_TYPE_P (type)
6086 || (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) == 1))
6087 /* Comparison inversion may be impossible for trapping math,
6088 invert_tree_comparison will tell us. But we can't use
6089 a computed operator in the replacement tree thus we have
6090 to play the trick below. */
6091 (with { enum tree_code ic = invert_tree_comparison
6092 (cmp, HONOR_NANS (@0)); }
6098 (bit_xor (cmp @0 @1) integer_truep)
6099 (with { enum tree_code ic = invert_tree_comparison
6100 (cmp, HONOR_NANS (@0)); }
6105 /* The following bits are handled by fold_binary_op_with_conditional_arg. */
6107 (ne (cmp@2 @0 @1) integer_zerop)
6108 (if (types_match (type, TREE_TYPE (@2)))
6111 (eq (cmp@2 @0 @1) integer_truep)
6112 (if (types_match (type, TREE_TYPE (@2)))
6115 (ne (cmp@2 @0 @1) integer_truep)
6116 (if (types_match (type, TREE_TYPE (@2)))
6117 (with { enum tree_code ic = invert_tree_comparison
6118 (cmp, HONOR_NANS (@0)); }
6124 (eq (cmp@2 @0 @1) integer_zerop)
6125 (if (types_match (type, TREE_TYPE (@2)))
6126 (with { enum tree_code ic = invert_tree_comparison
6127 (cmp, HONOR_NANS (@0)); }
6133 /* Transform comparisons of the form X - Y CMP 0 to X CMP Y.
6134 ??? The transformation is valid for the other operators if overflow
6135 is undefined for the type, but performing it here badly interacts
6136 with the transformation in fold_cond_expr_with_comparison which
6137 attempts to synthetize ABS_EXPR. */
6139 (for sub (minus pointer_diff)
6141 (cmp (sub@2 @0 @1) integer_zerop)
6142 (if (single_use (@2))
6145 /* Simplify (x < 0) ^ (y < 0) to (x ^ y) < 0 and
6146 (x >= 0) ^ (y >= 0) to (x ^ y) < 0. */
6149 (bit_xor (cmp:s @0 integer_zerop) (cmp:s @1 integer_zerop))
6150 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6151 && !TYPE_UNSIGNED (TREE_TYPE (@0))
6152 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
6153 (lt (bit_xor @0 @1) { build_zero_cst (TREE_TYPE (@0)); }))))
6154 /* Simplify (x < 0) ^ (y >= 0) to (x ^ y) >= 0 and
6155 (x >= 0) ^ (y < 0) to (x ^ y) >= 0. */
6157 (bit_xor:c (lt:s @0 integer_zerop) (ge:s @1 integer_zerop))
6158 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6159 && !TYPE_UNSIGNED (TREE_TYPE (@0))
6160 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
6161 (ge (bit_xor @0 @1) { build_zero_cst (TREE_TYPE (@0)); })))
6163 /* Transform comparisons of the form X * C1 CMP 0 to X CMP 0 in the
6164 signed arithmetic case. That form is created by the compiler
6165 often enough for folding it to be of value. One example is in
6166 computing loop trip counts after Operator Strength Reduction. */
6167 (for cmp (simple_comparison)
6168 scmp (swapped_simple_comparison)
6170 (cmp (mult@3 @0 INTEGER_CST@1) integer_zerop@2)
6171 /* Handle unfolded multiplication by zero. */
6172 (if (integer_zerop (@1))
6174 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
6175 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
6177 /* If @1 is negative we swap the sense of the comparison. */
6178 (if (tree_int_cst_sgn (@1) < 0)
6182 /* For integral types with undefined overflow fold
6183 x * C1 == C2 into x == C2 / C1 or false.
6184 If overflow wraps and C1 is odd, simplify to x == C2 / C1 in the ring
6188 (cmp (mult @0 INTEGER_CST@1) INTEGER_CST@2)
6189 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6190 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
6191 && wi::to_wide (@1) != 0)
6192 (with { widest_int quot; }
6193 (if (wi::multiple_of_p (wi::to_widest (@2), wi::to_widest (@1),
6194 TYPE_SIGN (TREE_TYPE (@0)), "))
6195 (cmp @0 { wide_int_to_tree (TREE_TYPE (@0), quot); })
6196 { constant_boolean_node (cmp == NE_EXPR, type); }))
6197 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6198 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))
6199 && (wi::bit_and (wi::to_wide (@1), 1) == 1))
6202 tree itype = TREE_TYPE (@0);
6203 int p = TYPE_PRECISION (itype);
6204 wide_int m = wi::one (p + 1) << p;
6205 wide_int a = wide_int::from (wi::to_wide (@1), p + 1, UNSIGNED);
6206 wide_int i = wide_int::from (wi::mod_inv (a, m),
6207 p, TYPE_SIGN (itype));
6208 wide_int_to_tree (itype, wi::mul (i, wi::to_wide (@2)));
6211 /* Simplify comparison of something with itself. For IEEE
6212 floating-point, we can only do some of these simplifications. */
6216 (if (! FLOAT_TYPE_P (TREE_TYPE (@0))
6217 || ! tree_expr_maybe_nan_p (@0))
6218 { constant_boolean_node (true, type); }
6220 /* With -ftrapping-math conversion to EQ loses an exception. */
6221 && (! FLOAT_TYPE_P (TREE_TYPE (@0))
6222 || ! flag_trapping_math))
6228 || ! FLOAT_TYPE_P (TREE_TYPE (@0))
6229 || ! tree_expr_maybe_nan_p (@0))
6230 { constant_boolean_node (false, type); })))
6231 (for cmp (unle unge uneq)
6234 { constant_boolean_node (true, type); }))
6235 (for cmp (unlt ungt)
6241 (if (!flag_trapping_math || !tree_expr_maybe_nan_p (@0))
6242 { constant_boolean_node (false, type); }))
6244 /* x == ~x -> false */
6245 /* x != ~x -> true */
6248 (cmp:c @0 (bit_not @0))
6249 { constant_boolean_node (cmp == NE_EXPR, type); }))
6251 /* Fold ~X op ~Y as Y op X. */
6252 (for cmp (simple_comparison)
6254 (cmp (nop_convert1?@4 (bit_not@2 @0)) (nop_convert2? (bit_not@3 @1)))
6255 (if (single_use (@2) && single_use (@3))
6256 (with { tree otype = TREE_TYPE (@4); }
6257 (cmp (convert:otype @1) (convert:otype @0))))))
6259 /* Fold ~X op C as X op' ~C, where op' is the swapped comparison. */
6260 (for cmp (simple_comparison)
6261 scmp (swapped_simple_comparison)
6263 (cmp (nop_convert? (bit_not@2 @0)) CONSTANT_CLASS_P@1)
6264 (if (single_use (@2)
6265 && (TREE_CODE (@1) == INTEGER_CST || TREE_CODE (@1) == VECTOR_CST))
6266 (with { tree otype = TREE_TYPE (@1); }
6267 (scmp (convert:otype @0) (bit_not @1))))))
6269 (for cmp (simple_comparison)
6272 /* IEEE doesn't distinguish +0 and -0 in comparisons. */
6274 /* a CMP (-0) -> a CMP 0 */
6275 (if (REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@1)))
6276 (cmp @0 { build_real (TREE_TYPE (@1), dconst0); }))
6277 /* (-0) CMP b -> 0 CMP b. */
6278 (if (TREE_CODE (@0) == REAL_CST
6279 && REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@0)))
6280 (cmp { build_real (TREE_TYPE (@0), dconst0); } @1))
6281 /* x != NaN is always true, other ops are always false. */
6282 (if (REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
6283 && (cmp == EQ_EXPR || cmp == NE_EXPR || !flag_trapping_math)
6284 && !tree_expr_signaling_nan_p (@1)
6285 && !tree_expr_maybe_signaling_nan_p (@0))
6286 { constant_boolean_node (cmp == NE_EXPR, type); })
6287 /* NaN != y is always true, other ops are always false. */
6288 (if (TREE_CODE (@0) == REAL_CST
6289 && REAL_VALUE_ISNAN (TREE_REAL_CST (@0))
6290 && (cmp == EQ_EXPR || cmp == NE_EXPR || !flag_trapping_math)
6291 && !tree_expr_signaling_nan_p (@0)
6292 && !tree_expr_signaling_nan_p (@1))
6293 { constant_boolean_node (cmp == NE_EXPR, type); })
6294 /* Fold comparisons against infinity. */
6295 (if (REAL_VALUE_ISINF (TREE_REAL_CST (@1))
6296 && MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (@1))))
6299 REAL_VALUE_TYPE max;
6300 enum tree_code code = cmp;
6301 bool neg = REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1));
6303 code = swap_tree_comparison (code);
6306 /* x > +Inf is always false, if we ignore NaNs or exceptions. */
6307 (if (code == GT_EXPR
6308 && !(HONOR_NANS (@0) && flag_trapping_math))
6309 { constant_boolean_node (false, type); })
6310 (if (code == LE_EXPR)
6311 /* x <= +Inf is always true, if we don't care about NaNs. */
6312 (if (! HONOR_NANS (@0))
6313 { constant_boolean_node (true, type); }
6314 /* x <= +Inf is the same as x == x, i.e. !isnan(x), but this loses
6315 an "invalid" exception. */
6316 (if (!flag_trapping_math)
6318 /* x == +Inf and x >= +Inf are always equal to x > DBL_MAX, but
6319 for == this introduces an exception for x a NaN. */
6320 (if ((code == EQ_EXPR && !(HONOR_NANS (@0) && flag_trapping_math))
6322 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
6324 (lt @0 { build_real (TREE_TYPE (@0), max); })
6325 (gt @0 { build_real (TREE_TYPE (@0), max); }))))
6326 /* x < +Inf is always equal to x <= DBL_MAX. */
6327 (if (code == LT_EXPR)
6328 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
6330 (ge @0 { build_real (TREE_TYPE (@0), max); })
6331 (le @0 { build_real (TREE_TYPE (@0), max); }))))
6332 /* x != +Inf is always equal to !(x > DBL_MAX), but this introduces
6333 an exception for x a NaN so use an unordered comparison. */
6334 (if (code == NE_EXPR)
6335 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
6336 (if (! HONOR_NANS (@0))
6338 (ge @0 { build_real (TREE_TYPE (@0), max); })
6339 (le @0 { build_real (TREE_TYPE (@0), max); }))
6341 (unge @0 { build_real (TREE_TYPE (@0), max); })
6342 (unle @0 { build_real (TREE_TYPE (@0), max); }))))))))))
6344 /* If this is a comparison of a real constant with a PLUS_EXPR
6345 or a MINUS_EXPR of a real constant, we can convert it into a
6346 comparison with a revised real constant as long as no overflow
6347 occurs when unsafe_math_optimizations are enabled. */
6348 (if (flag_unsafe_math_optimizations)
6349 (for op (plus minus)
6351 (cmp (op @0 REAL_CST@1) REAL_CST@2)
6354 tree tem = const_binop (op == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR,
6355 TREE_TYPE (@1), @2, @1);
6357 (if (tem && !TREE_OVERFLOW (tem))
6358 (cmp @0 { tem; }))))))
6360 /* Likewise, we can simplify a comparison of a real constant with
6361 a MINUS_EXPR whose first operand is also a real constant, i.e.
6362 (c1 - x) < c2 becomes x > c1-c2. Reordering is allowed on
6363 floating-point types only if -fassociative-math is set. */
6364 (if (flag_associative_math)
6366 (cmp (minus REAL_CST@0 @1) REAL_CST@2)
6367 (with { tree tem = const_binop (MINUS_EXPR, TREE_TYPE (@1), @0, @2); }
6368 (if (tem && !TREE_OVERFLOW (tem))
6369 (cmp { tem; } @1)))))
6371 /* Fold comparisons against built-in math functions. */
6372 (if (flag_unsafe_math_optimizations && ! flag_errno_math)
6375 (cmp (sq @0) REAL_CST@1)
6377 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
6379 /* sqrt(x) < y is always false, if y is negative. */
6380 (if (cmp == EQ_EXPR || cmp == LT_EXPR || cmp == LE_EXPR)
6381 { constant_boolean_node (false, type); })
6382 /* sqrt(x) > y is always true, if y is negative and we
6383 don't care about NaNs, i.e. negative values of x. */
6384 (if (cmp == NE_EXPR || !HONOR_NANS (@0))
6385 { constant_boolean_node (true, type); })
6386 /* sqrt(x) > y is the same as x >= 0, if y is negative. */
6387 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })))
6388 (if (real_equal (TREE_REAL_CST_PTR (@1), &dconst0))
6390 /* sqrt(x) < 0 is always false. */
6391 (if (cmp == LT_EXPR)
6392 { constant_boolean_node (false, type); })
6393 /* sqrt(x) >= 0 is always true if we don't care about NaNs. */
6394 (if (cmp == GE_EXPR && !HONOR_NANS (@0))
6395 { constant_boolean_node (true, type); })
6396 /* sqrt(x) <= 0 -> x == 0. */
6397 (if (cmp == LE_EXPR)
6399 /* Otherwise sqrt(x) cmp 0 -> x cmp 0. Here cmp can be >=, >,
6400 == or !=. In the last case:
6402 (sqrt(x) != 0) == (NaN != 0) == true == (x != 0)
6404 if x is negative or NaN. Due to -funsafe-math-optimizations,
6405 the results for other x follow from natural arithmetic. */
6407 (if ((cmp == LT_EXPR
6411 && !REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
6412 /* Give up for -frounding-math. */
6413 && !HONOR_SIGN_DEPENDENT_ROUNDING (TREE_TYPE (@0)))
6417 enum tree_code ncmp = cmp;
6418 const real_format *fmt
6419 = REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (@0)));
6420 real_arithmetic (&c2, MULT_EXPR,
6421 &TREE_REAL_CST (@1), &TREE_REAL_CST (@1));
6422 real_convert (&c2, fmt, &c2);
6423 /* See PR91734: if c2 is inexact and sqrt(c2) < c (or sqrt(c2) >= c),
6424 then change LT_EXPR into LE_EXPR or GE_EXPR into GT_EXPR. */
6425 if (!REAL_VALUE_ISINF (c2))
6427 tree c3 = fold_const_call (CFN_SQRT, TREE_TYPE (@0),
6428 build_real (TREE_TYPE (@0), c2));
6429 if (c3 == NULL_TREE || TREE_CODE (c3) != REAL_CST)
6431 else if ((cmp == LT_EXPR || cmp == GE_EXPR)
6432 && real_less (&TREE_REAL_CST (c3), &TREE_REAL_CST (@1)))
6433 ncmp = cmp == LT_EXPR ? LE_EXPR : GT_EXPR;
6434 else if ((cmp == LE_EXPR || cmp == GT_EXPR)
6435 && real_less (&TREE_REAL_CST (@1), &TREE_REAL_CST (c3)))
6436 ncmp = cmp == LE_EXPR ? LT_EXPR : GE_EXPR;
6439 /* With rounding to even, sqrt of up to 3 different values
6440 gives the same normal result, so in some cases c2 needs
6442 REAL_VALUE_TYPE c2alt, tow;
6443 if (cmp == LT_EXPR || cmp == GE_EXPR)
6447 real_nextafter (&c2alt, fmt, &c2, &tow);
6448 real_convert (&c2alt, fmt, &c2alt);
6449 if (REAL_VALUE_ISINF (c2alt))
6453 c3 = fold_const_call (CFN_SQRT, TREE_TYPE (@0),
6454 build_real (TREE_TYPE (@0), c2alt));
6455 if (c3 == NULL_TREE || TREE_CODE (c3) != REAL_CST)
6457 else if (real_equal (&TREE_REAL_CST (c3),
6458 &TREE_REAL_CST (@1)))
6464 (if (cmp == GT_EXPR || cmp == GE_EXPR)
6465 (if (REAL_VALUE_ISINF (c2))
6466 /* sqrt(x) > y is x == +Inf, when y is very large. */
6467 (if (HONOR_INFINITIES (@0))
6468 (eq @0 { build_real (TREE_TYPE (@0), c2); })
6469 { constant_boolean_node (false, type); })
6470 /* sqrt(x) > c is the same as x > c*c. */
6471 (if (ncmp != ERROR_MARK)
6472 (if (ncmp == GE_EXPR)
6473 (ge @0 { build_real (TREE_TYPE (@0), c2); })
6474 (gt @0 { build_real (TREE_TYPE (@0), c2); }))))
6475 /* else if (cmp == LT_EXPR || cmp == LE_EXPR) */
6476 (if (REAL_VALUE_ISINF (c2))
6478 /* sqrt(x) < y is always true, when y is a very large
6479 value and we don't care about NaNs or Infinities. */
6480 (if (! HONOR_NANS (@0) && ! HONOR_INFINITIES (@0))
6481 { constant_boolean_node (true, type); })
6482 /* sqrt(x) < y is x != +Inf when y is very large and we
6483 don't care about NaNs. */
6484 (if (! HONOR_NANS (@0))
6485 (ne @0 { build_real (TREE_TYPE (@0), c2); }))
6486 /* sqrt(x) < y is x >= 0 when y is very large and we
6487 don't care about Infinities. */
6488 (if (! HONOR_INFINITIES (@0))
6489 (ge @0 { build_real (TREE_TYPE (@0), dconst0); }))
6490 /* sqrt(x) < y is x >= 0 && x != +Inf, when y is large. */
6493 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })
6494 (ne @0 { build_real (TREE_TYPE (@0), c2); }))))
6495 /* sqrt(x) < c is the same as x < c*c, if we ignore NaNs. */
6496 (if (ncmp != ERROR_MARK && ! HONOR_NANS (@0))
6497 (if (ncmp == LT_EXPR)
6498 (lt @0 { build_real (TREE_TYPE (@0), c2); })
6499 (le @0 { build_real (TREE_TYPE (@0), c2); }))
6500 /* sqrt(x) < c is the same as x >= 0 && x < c*c. */
6501 (if (ncmp != ERROR_MARK && GENERIC)
6502 (if (ncmp == LT_EXPR)
6504 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })
6505 (lt @0 { build_real (TREE_TYPE (@0), c2); }))
6507 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })
6508 (le @0 { build_real (TREE_TYPE (@0), c2); })))))))))))
6509 /* Transform sqrt(x) cmp sqrt(y) -> x cmp y. */
6511 (cmp (sq @0) (sq @1))
6512 (if (! HONOR_NANS (@0))
6515 /* Optimize various special cases of (FTYPE) N CMP (FTYPE) M. */
6516 (for cmp (lt le eq ne ge gt unordered ordered unlt unle ungt unge uneq ltgt)
6517 icmp (lt le eq ne ge gt unordered ordered lt le gt ge eq ne)
6519 (cmp (float@0 @1) (float @2))
6520 (if (SCALAR_FLOAT_TYPE_P (TREE_TYPE (@0))
6521 && ! DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0)))
6524 format_helper fmt (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (@0))));
6525 tree type1 = TREE_TYPE (@1);
6526 bool type1_signed_p = TYPE_SIGN (type1) == SIGNED;
6527 tree type2 = TREE_TYPE (@2);
6528 bool type2_signed_p = TYPE_SIGN (type2) == SIGNED;
6530 (if (fmt.can_represent_integral_type_p (type1)
6531 && fmt.can_represent_integral_type_p (type2))
6532 (if (cmp == ORDERED_EXPR || cmp == UNORDERED_EXPR)
6533 { constant_boolean_node (cmp == ORDERED_EXPR, type); }
6534 (if (TYPE_PRECISION (type1) > TYPE_PRECISION (type2)
6535 && type1_signed_p >= type2_signed_p)
6536 (icmp @1 (convert @2))
6537 (if (TYPE_PRECISION (type1) < TYPE_PRECISION (type2)
6538 && type1_signed_p <= type2_signed_p)
6539 (icmp (convert:type2 @1) @2)
6540 (if (TYPE_PRECISION (type1) == TYPE_PRECISION (type2)
6541 && type1_signed_p == type2_signed_p)
6542 (icmp @1 @2))))))))))
6544 /* Optimize various special cases of (FTYPE) N CMP CST. */
6545 (for cmp (lt le eq ne ge gt)
6546 icmp (le le eq ne ge ge)
6548 (cmp (float @0) REAL_CST@1)
6549 (if (SCALAR_FLOAT_TYPE_P (TREE_TYPE (@1))
6550 && ! DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@1)))
6553 tree itype = TREE_TYPE (@0);
6554 format_helper fmt (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (@1))));
6555 const REAL_VALUE_TYPE *cst = TREE_REAL_CST_PTR (@1);
6556 /* Be careful to preserve any potential exceptions due to
6557 NaNs. qNaNs are ok in == or != context.
6558 TODO: relax under -fno-trapping-math or
6559 -fno-signaling-nans. */
6561 = real_isnan (cst) && (cst->signalling
6562 || (cmp != EQ_EXPR && cmp != NE_EXPR));
6564 /* TODO: allow non-fitting itype and SNaNs when
6565 -fno-trapping-math. */
6566 (if (fmt.can_represent_integral_type_p (itype) && ! exception_p)
6569 signop isign = TYPE_SIGN (itype);
6570 REAL_VALUE_TYPE imin, imax;
6571 real_from_integer (&imin, fmt, wi::min_value (itype), isign);
6572 real_from_integer (&imax, fmt, wi::max_value (itype), isign);
6574 REAL_VALUE_TYPE icst;
6575 if (cmp == GT_EXPR || cmp == GE_EXPR)
6576 real_ceil (&icst, fmt, cst);
6577 else if (cmp == LT_EXPR || cmp == LE_EXPR)
6578 real_floor (&icst, fmt, cst);
6580 real_trunc (&icst, fmt, cst);
6582 bool cst_int_p = !real_isnan (cst) && real_identical (&icst, cst);
6584 bool overflow_p = false;
6586 = real_to_integer (&icst, &overflow_p, TYPE_PRECISION (itype));
6589 /* Optimize cases when CST is outside of ITYPE's range. */
6590 (if (real_compare (LT_EXPR, cst, &imin))
6591 { constant_boolean_node (cmp == GT_EXPR || cmp == GE_EXPR || cmp == NE_EXPR,
6593 (if (real_compare (GT_EXPR, cst, &imax))
6594 { constant_boolean_node (cmp == LT_EXPR || cmp == LE_EXPR || cmp == NE_EXPR,
6596 /* Remove cast if CST is an integer representable by ITYPE. */
6598 (cmp @0 { gcc_assert (!overflow_p);
6599 wide_int_to_tree (itype, icst_val); })
6601 /* When CST is fractional, optimize
6602 (FTYPE) N == CST -> 0
6603 (FTYPE) N != CST -> 1. */
6604 (if (cmp == EQ_EXPR || cmp == NE_EXPR)
6605 { constant_boolean_node (cmp == NE_EXPR, type); })
6606 /* Otherwise replace with sensible integer constant. */
6609 gcc_checking_assert (!overflow_p);
6611 (icmp @0 { wide_int_to_tree (itype, icst_val); })))))))))
6613 /* Fold A /[ex] B CMP C to A CMP B * C. */
6616 (cmp (exact_div @0 @1) INTEGER_CST@2)
6617 (if (!integer_zerop (@1))
6618 (if (wi::to_wide (@2) == 0)
6620 (if (TREE_CODE (@1) == INTEGER_CST)
6623 wi::overflow_type ovf;
6624 wide_int prod = wi::mul (wi::to_wide (@2), wi::to_wide (@1),
6625 TYPE_SIGN (TREE_TYPE (@1)), &ovf);
6628 { constant_boolean_node (cmp == NE_EXPR, type); }
6629 (cmp @0 { wide_int_to_tree (TREE_TYPE (@0), prod); }))))))))
6630 (for cmp (lt le gt ge)
6632 (cmp (exact_div @0 INTEGER_CST@1) INTEGER_CST@2)
6633 (if (wi::gt_p (wi::to_wide (@1), 0, TYPE_SIGN (TREE_TYPE (@1))))
6636 wi::overflow_type ovf;
6637 wide_int prod = wi::mul (wi::to_wide (@2), wi::to_wide (@1),
6638 TYPE_SIGN (TREE_TYPE (@1)), &ovf);
6641 { constant_boolean_node (wi::lt_p (wi::to_wide (@2), 0,
6642 TYPE_SIGN (TREE_TYPE (@2)))
6643 != (cmp == LT_EXPR || cmp == LE_EXPR), type); }
6644 (cmp @0 { wide_int_to_tree (TREE_TYPE (@0), prod); }))))))
6646 /* Fold (size_t)(A /[ex] B) CMP C to (size_t)A CMP (size_t)B * C or A CMP' 0.
6648 For small C (less than max/B), this is (size_t)A CMP (size_t)B * C.
6649 For large C (more than min/B+2^size), this is also true, with the
6650 multiplication computed modulo 2^size.
6651 For intermediate C, this just tests the sign of A. */
6652 (for cmp (lt le gt ge)
6655 (cmp (convert (exact_div @0 INTEGER_CST@1)) INTEGER_CST@2)
6656 (if (tree_nop_conversion_p (TREE_TYPE (@0), TREE_TYPE (@2))
6657 && TYPE_UNSIGNED (TREE_TYPE (@2)) && !TYPE_UNSIGNED (TREE_TYPE (@0))
6658 && wi::gt_p (wi::to_wide (@1), 0, TYPE_SIGN (TREE_TYPE (@1))))
6661 tree utype = TREE_TYPE (@2);
6662 wide_int denom = wi::to_wide (@1);
6663 wide_int right = wi::to_wide (@2);
6664 wide_int smax = wi::sdiv_trunc (wi::max_value (TREE_TYPE (@0)), denom);
6665 wide_int smin = wi::sdiv_trunc (wi::min_value (TREE_TYPE (@0)), denom);
6666 bool small = wi::leu_p (right, smax);
6667 bool large = wi::geu_p (right, smin);
6669 (if (small || large)
6670 (cmp (convert:utype @0) (mult @2 (convert @1)))
6671 (cmp2 @0 { build_zero_cst (TREE_TYPE (@0)); }))))))
6673 /* Unordered tests if either argument is a NaN. */
6675 (bit_ior (unordered @0 @0) (unordered @1 @1))
6676 (if (types_match (@0, @1))
6679 (bit_and (ordered @0 @0) (ordered @1 @1))
6680 (if (types_match (@0, @1))
6683 (bit_ior:c (unordered @0 @0) (unordered:c@2 @0 @1))
6686 (bit_and:c (ordered @0 @0) (ordered:c@2 @0 @1))
6689 /* A & (2**N - 1) <= 2**K - 1 -> A & (2**N - 2**K) == 0
6690 A & (2**N - 1) > 2**K - 1 -> A & (2**N - 2**K) != 0
6692 Note that comparisons
6693 A & (2**N - 1) < 2**K -> A & (2**N - 2**K) == 0
6694 A & (2**N - 1) >= 2**K -> A & (2**N - 2**K) != 0
6695 will be canonicalized to above so there's no need to
6702 (cmp (bit_and@0 @1 INTEGER_CST@2) INTEGER_CST@3)
6703 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)))
6706 tree ty = TREE_TYPE (@0);
6707 unsigned prec = TYPE_PRECISION (ty);
6708 wide_int mask = wi::to_wide (@2, prec);
6709 wide_int rhs = wi::to_wide (@3, prec);
6710 signop sgn = TYPE_SIGN (ty);
6712 (if ((mask & (mask + 1)) == 0 && wi::gt_p (rhs, 0, sgn)
6713 && (rhs & (rhs + 1)) == 0 && wi::ge_p (mask, rhs, sgn))
6714 (eqcmp (bit_and @1 { wide_int_to_tree (ty, mask - rhs); })
6715 { build_zero_cst (ty); }))))))
6717 /* -A CMP -B -> B CMP A. */
6718 (for cmp (tcc_comparison)
6719 scmp (swapped_tcc_comparison)
6721 (cmp (negate @0) (negate @1))
6722 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
6723 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
6726 || TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))))
6729 (cmp (negate @0) CONSTANT_CLASS_P@1)
6730 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
6731 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
6734 || TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))))
6735 (with { tree tem = const_unop (NEGATE_EXPR, TREE_TYPE (@0), @1); }
6736 (if (tem && !TREE_OVERFLOW (tem))
6737 (scmp @0 { tem; }))))))
6739 /* Convert ABS[U]_EXPR<x> == 0 or ABS[U]_EXPR<x> != 0 to x == 0 or x != 0. */
6743 (eqne (op @0) zerop@1)
6744 (eqne @0 { build_zero_cst (TREE_TYPE (@0)); }))))
6746 /* From fold_sign_changed_comparison and fold_widened_comparison.
6747 FIXME: the lack of symmetry is disturbing. */
6748 (for cmp (simple_comparison)
6750 (cmp (convert@0 @00) (convert?@1 @10))
6751 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6752 /* Disable this optimization if we're casting a function pointer
6753 type on targets that require function pointer canonicalization. */
6754 && !(targetm.have_canonicalize_funcptr_for_compare ()
6755 && ((POINTER_TYPE_P (TREE_TYPE (@00))
6756 && FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@00))))
6757 || (POINTER_TYPE_P (TREE_TYPE (@10))
6758 && FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@10))))))
6760 (if (TYPE_PRECISION (TREE_TYPE (@00)) == TYPE_PRECISION (TREE_TYPE (@0))
6761 && (TREE_CODE (@10) == INTEGER_CST
6763 && (TYPE_UNSIGNED (TREE_TYPE (@00)) == TYPE_UNSIGNED (TREE_TYPE (@0))
6766 && !POINTER_TYPE_P (TREE_TYPE (@00))
6767 /* (int)bool:32 != (int)uint is not the same as
6768 bool:32 != (bool:32)uint since boolean types only have two valid
6769 values independent of their precision. */
6770 && (TREE_CODE (TREE_TYPE (@00)) != BOOLEAN_TYPE
6771 || TREE_CODE (TREE_TYPE (@10)) == BOOLEAN_TYPE))
6772 /* ??? The special-casing of INTEGER_CST conversion was in the original
6773 code and here to avoid a spurious overflow flag on the resulting
6774 constant which fold_convert produces. */
6775 (if (TREE_CODE (@1) == INTEGER_CST)
6776 (cmp @00 { force_fit_type (TREE_TYPE (@00),
6777 wide_int::from (wi::to_wide (@1),
6778 MAX (TYPE_PRECISION (TREE_TYPE (@1)),
6779 TYPE_PRECISION (TREE_TYPE (@00))),
6780 TYPE_SIGN (TREE_TYPE (@1))),
6781 0, TREE_OVERFLOW (@1)); })
6782 (cmp @00 (convert @1)))
6784 (if (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (TREE_TYPE (@00)))
6785 /* If possible, express the comparison in the shorter mode. */
6786 (if ((cmp == EQ_EXPR || cmp == NE_EXPR
6787 || TYPE_UNSIGNED (TREE_TYPE (@0)) == TYPE_UNSIGNED (TREE_TYPE (@00))
6788 || (!TYPE_UNSIGNED (TREE_TYPE (@0))
6789 && TYPE_UNSIGNED (TREE_TYPE (@00))))
6790 && (types_match (TREE_TYPE (@10), TREE_TYPE (@00))
6791 || ((TYPE_PRECISION (TREE_TYPE (@00))
6792 >= TYPE_PRECISION (TREE_TYPE (@10)))
6793 && (TYPE_UNSIGNED (TREE_TYPE (@00))
6794 == TYPE_UNSIGNED (TREE_TYPE (@10))))
6795 || (TREE_CODE (@1) == INTEGER_CST
6796 && INTEGRAL_TYPE_P (TREE_TYPE (@00))
6797 && int_fits_type_p (@1, TREE_TYPE (@00)))))
6798 (cmp @00 (convert @10))
6799 (if (TREE_CODE (@1) == INTEGER_CST
6800 && INTEGRAL_TYPE_P (TREE_TYPE (@00))
6801 && !int_fits_type_p (@1, TREE_TYPE (@00)))
6804 tree min = lower_bound_in_type (TREE_TYPE (@10), TREE_TYPE (@00));
6805 tree max = upper_bound_in_type (TREE_TYPE (@10), TREE_TYPE (@00));
6806 bool above = integer_nonzerop (const_binop (LT_EXPR, type, max, @1));
6807 bool below = integer_nonzerop (const_binop (LT_EXPR, type, @1, min));
6809 (if (above || below)
6810 (if (cmp == EQ_EXPR || cmp == NE_EXPR)
6811 { constant_boolean_node (cmp == EQ_EXPR ? false : true, type); }
6812 (if (cmp == LT_EXPR || cmp == LE_EXPR)
6813 { constant_boolean_node (above ? true : false, type); }
6814 (if (cmp == GT_EXPR || cmp == GE_EXPR)
6815 { constant_boolean_node (above ? false : true, type); })))))))))
6816 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
6817 (if (FLOAT_TYPE_P (TREE_TYPE (@00))
6818 && (DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0))
6819 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@00)))
6820 && (DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0))
6821 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@10))))
6824 tree type1 = TREE_TYPE (@10);
6825 if (TREE_CODE (@10) == REAL_CST && !DECIMAL_FLOAT_TYPE_P (type1))
6827 REAL_VALUE_TYPE orig = TREE_REAL_CST (@10);
6828 if (TYPE_PRECISION (type1) > TYPE_PRECISION (float_type_node)
6829 && exact_real_truncate (TYPE_MODE (float_type_node), &orig))
6830 type1 = float_type_node;
6831 if (TYPE_PRECISION (type1) > TYPE_PRECISION (double_type_node)
6832 && exact_real_truncate (TYPE_MODE (double_type_node), &orig))
6833 type1 = double_type_node;
6836 = (element_precision (TREE_TYPE (@00)) > element_precision (type1)
6837 ? TREE_TYPE (@00) : type1);
6839 (if (element_precision (TREE_TYPE (@0)) > element_precision (newtype)
6840 && (!VECTOR_TYPE_P (type) || is_truth_type_for (newtype, type)))
6841 (cmp (convert:newtype @00) (convert:newtype @10))))))))
6846 /* SSA names are canonicalized to 2nd place. */
6847 (cmp addr@0 SSA_NAME@1)
6850 poly_int64 off; tree base;
6851 tree addr = (TREE_CODE (@0) == SSA_NAME
6852 ? gimple_assign_rhs1 (SSA_NAME_DEF_STMT (@0)) : @0);
6854 /* A local variable can never be pointed to by
6855 the default SSA name of an incoming parameter. */
6856 (if (SSA_NAME_IS_DEFAULT_DEF (@1)
6857 && TREE_CODE (SSA_NAME_VAR (@1)) == PARM_DECL
6858 && (base = get_base_address (TREE_OPERAND (addr, 0)))
6859 && TREE_CODE (base) == VAR_DECL
6860 && auto_var_in_fn_p (base, current_function_decl))
6861 (if (cmp == NE_EXPR)
6862 { constant_boolean_node (true, type); }
6863 { constant_boolean_node (false, type); })
6864 /* If the address is based on @1 decide using the offset. */
6865 (if ((base = get_addr_base_and_unit_offset (TREE_OPERAND (addr, 0), &off))
6866 && TREE_CODE (base) == MEM_REF
6867 && TREE_OPERAND (base, 0) == @1)
6868 (with { off += mem_ref_offset (base).force_shwi (); }
6869 (if (known_ne (off, 0))
6870 { constant_boolean_node (cmp == NE_EXPR, type); }
6871 (if (known_eq (off, 0))
6872 { constant_boolean_node (cmp == EQ_EXPR, type); }))))))))
6874 /* Equality compare simplifications from fold_binary */
6877 /* If we have (A | C) == D where C & ~D != 0, convert this into 0.
6878 Similarly for NE_EXPR. */
6880 (cmp (convert?@3 (bit_ior @0 INTEGER_CST@1)) INTEGER_CST@2)
6881 (if (tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0))
6882 && wi::bit_and_not (wi::to_wide (@1), wi::to_wide (@2)) != 0)
6883 { constant_boolean_node (cmp == NE_EXPR, type); }))
6885 /* (X ^ Y) == 0 becomes X == Y, and (X ^ Y) != 0 becomes X != Y. */
6887 (cmp (bit_xor @0 @1) integer_zerop)
6890 /* (X ^ Y) == Y becomes X == 0.
6891 Likewise (X ^ Y) == X becomes Y == 0. */
6893 (cmp:c (bit_xor:c @0 @1) @0)
6894 (cmp @1 { build_zero_cst (TREE_TYPE (@1)); }))
6896 /* (X & Y) == X becomes (X & ~Y) == 0. */
6898 (cmp:c (bit_and:c @0 @1) @0)
6899 (cmp (bit_and @0 (bit_not! @1)) { build_zero_cst (TREE_TYPE (@0)); }))
6901 (cmp:c (convert@3 (bit_and (convert@2 @0) INTEGER_CST@1)) (convert @0))
6902 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6903 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
6904 && INTEGRAL_TYPE_P (TREE_TYPE (@3))
6905 && TYPE_PRECISION (TREE_TYPE (@2)) == TYPE_PRECISION (TREE_TYPE (@0))
6906 && TYPE_PRECISION (TREE_TYPE (@3)) > TYPE_PRECISION (TREE_TYPE (@2))
6907 && !wi::neg_p (wi::to_wide (@1)))
6908 (cmp (bit_and @0 (convert (bit_not @1)))
6909 { build_zero_cst (TREE_TYPE (@0)); })))
6911 /* (X | Y) == Y becomes (X & ~Y) == 0. */
6913 (cmp:c (bit_ior:c @0 @1) @1)
6914 (cmp (bit_and @0 (bit_not! @1)) { build_zero_cst (TREE_TYPE (@0)); }))
6916 /* (X ^ C1) op C2 can be rewritten as X op (C1 ^ C2). */
6918 (cmp (convert?@3 (bit_xor @0 INTEGER_CST@1)) INTEGER_CST@2)
6919 (if (tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0)))
6920 (cmp @0 (bit_xor @1 (convert @2)))))
6923 (cmp (nop_convert? @0) integer_zerop)
6924 (if (tree_expr_nonzero_p (@0))
6925 { constant_boolean_node (cmp == NE_EXPR, type); }))
6927 /* (X & C) op (Y & C) into (X ^ Y) & C op 0. */
6929 (cmp (bit_and:cs @0 @2) (bit_and:cs @1 @2))
6930 (cmp (bit_and (bit_xor @0 @1) @2) { build_zero_cst (TREE_TYPE (@2)); })))
6932 /* (X < 0) != (Y < 0) into (X ^ Y) < 0.
6933 (X >= 0) != (Y >= 0) into (X ^ Y) < 0.
6934 (X < 0) == (Y < 0) into (X ^ Y) >= 0.
6935 (X >= 0) == (Y >= 0) into (X ^ Y) >= 0. */
6940 (cmp (sgncmp @0 integer_zerop@2) (sgncmp @1 integer_zerop))
6941 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
6942 && !TYPE_UNSIGNED (TREE_TYPE (@0))
6943 && types_match (@0, @1))
6944 (ncmp (bit_xor @0 @1) @2)))))
6945 /* (X < 0) == (Y >= 0) into (X ^ Y) < 0.
6946 (X < 0) != (Y >= 0) into (X ^ Y) >= 0. */
6950 (cmp:c (lt @0 integer_zerop@2) (ge @1 integer_zerop))
6951 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
6952 && !TYPE_UNSIGNED (TREE_TYPE (@0))
6953 && types_match (@0, @1))
6954 (ncmp (bit_xor @0 @1) @2))))
6956 /* If we have (A & C) == C where C is a power of 2, convert this into
6957 (A & C) != 0. Similarly for NE_EXPR. */
6961 (cmp (bit_and@2 @0 integer_pow2p@1) @1)
6962 (icmp @2 { build_zero_cst (TREE_TYPE (@0)); })))
6965 /* From fold_binary_op_with_conditional_arg handle the case of
6966 rewriting (a ? b : c) > d to a ? (b > d) : (c > d) when the
6967 compares simplify. */
6968 (for cmp (simple_comparison)
6970 (cmp:c (cond @0 @1 @2) @3)
6971 /* Do not move possibly trapping operations into the conditional as this
6972 pessimizes code and causes gimplification issues when applied late. */
6973 (if (!FLOAT_TYPE_P (TREE_TYPE (@3))
6974 || !operation_could_trap_p (cmp, true, false, @3))
6975 (cond @0 (cmp! @1 @3) (cmp! @2 @3)))))
6979 /* x < 0 ? ~y : y into (x >> (prec-1)) ^ y. */
6980 /* x >= 0 ? ~y : y into ~((x >> (prec-1)) ^ y). */
6982 (cond (cmp @0 integer_zerop) (bit_not @1) @1)
6983 (if (INTEGRAL_TYPE_P (type)
6984 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
6985 && !TYPE_UNSIGNED (TREE_TYPE (@0))
6986 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (type))
6989 tree shifter = build_int_cst (integer_type_node, TYPE_PRECISION (type) - 1);
6991 (if (cmp == LT_EXPR)
6992 (bit_xor (convert (rshift @0 {shifter;})) @1)
6993 (bit_not (bit_xor (convert (rshift @0 {shifter;})) @1))))))
6994 /* x < 0 ? y : ~y into ~((x >> (prec-1)) ^ y). */
6995 /* x >= 0 ? y : ~y into (x >> (prec-1)) ^ y. */
6997 (cond (cmp @0 integer_zerop) @1 (bit_not @1))
6998 (if (INTEGRAL_TYPE_P (type)
6999 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
7000 && !TYPE_UNSIGNED (TREE_TYPE (@0))
7001 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (type))
7004 tree shifter = build_int_cst (integer_type_node, TYPE_PRECISION (type) - 1);
7006 (if (cmp == GE_EXPR)
7007 (bit_xor (convert (rshift @0 {shifter;})) @1)
7008 (bit_not (bit_xor (convert (rshift @0 {shifter;})) @1)))))))
7010 /* If we have (A & C) != 0 ? D : 0 where C and D are powers of 2,
7011 convert this into a shift followed by ANDing with D. */
7014 (ne (bit_and @0 integer_pow2p@1) integer_zerop)
7015 INTEGER_CST@2 integer_zerop)
7016 (if (!POINTER_TYPE_P (type) && integer_pow2p (@2))
7018 int shift = (wi::exact_log2 (wi::to_wide (@2))
7019 - wi::exact_log2 (wi::to_wide (@1)));
7023 (lshift (convert @0) { build_int_cst (integer_type_node, shift); }) @2)
7025 (convert (rshift @0 { build_int_cst (integer_type_node, -shift); }))
7028 /* If we have (A & C) != 0 where C is the sign bit of A, convert
7029 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
7033 (cmp (bit_and (convert?@2 @0) integer_pow2p@1) integer_zerop)
7034 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
7035 && type_has_mode_precision_p (TREE_TYPE (@0))
7036 && element_precision (@2) >= element_precision (@0)
7037 && wi::only_sign_bit_p (wi::to_wide (@1), element_precision (@0)))
7038 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
7039 (ncmp (convert:stype @0) { build_zero_cst (stype); })))))
7041 /* If we have A < 0 ? C : 0 where C is a power of 2, convert
7042 this into a right shift or sign extension followed by ANDing with C. */
7045 (lt @0 integer_zerop)
7046 INTEGER_CST@1 integer_zerop)
7047 (if (integer_pow2p (@1)
7048 && !TYPE_UNSIGNED (TREE_TYPE (@0)))
7050 int shift = element_precision (@0) - wi::exact_log2 (wi::to_wide (@1)) - 1;
7054 (convert (rshift @0 { build_int_cst (integer_type_node, shift); }))
7056 /* Otherwise ctype must be wider than TREE_TYPE (@0) and pure
7057 sign extension followed by AND with C will achieve the effect. */
7058 (bit_and (convert @0) @1)))))
7060 /* When the addresses are not directly of decls compare base and offset.
7061 This implements some remaining parts of fold_comparison address
7062 comparisons but still no complete part of it. Still it is good
7063 enough to make fold_stmt not regress when not dispatching to fold_binary. */
7064 (for cmp (simple_comparison)
7066 (cmp (convert1?@2 addr@0) (convert2? addr@1))
7069 poly_int64 off0, off1;
7071 int equal = address_compare (cmp, TREE_TYPE (@2), @0, @1, base0, base1,
7072 off0, off1, GENERIC);
7076 (if (cmp == EQ_EXPR && (known_eq (off0, off1) || known_ne (off0, off1)))
7077 { constant_boolean_node (known_eq (off0, off1), type); })
7078 (if (cmp == NE_EXPR && (known_eq (off0, off1) || known_ne (off0, off1)))
7079 { constant_boolean_node (known_ne (off0, off1), type); })
7080 (if (cmp == LT_EXPR && (known_lt (off0, off1) || known_ge (off0, off1)))
7081 { constant_boolean_node (known_lt (off0, off1), type); })
7082 (if (cmp == LE_EXPR && (known_le (off0, off1) || known_gt (off0, off1)))
7083 { constant_boolean_node (known_le (off0, off1), type); })
7084 (if (cmp == GE_EXPR && (known_ge (off0, off1) || known_lt (off0, off1)))
7085 { constant_boolean_node (known_ge (off0, off1), type); })
7086 (if (cmp == GT_EXPR && (known_gt (off0, off1) || known_le (off0, off1)))
7087 { constant_boolean_node (known_gt (off0, off1), type); }))
7090 (if (cmp == EQ_EXPR)
7091 { constant_boolean_node (false, type); })
7092 (if (cmp == NE_EXPR)
7093 { constant_boolean_node (true, type); })))))))
7096 /* a?~t:t -> (-(a))^t */
7099 (with { bool wascmp; }
7100 (if (INTEGRAL_TYPE_P (type)
7101 && TYPE_UNSIGNED (TREE_TYPE (@0))
7102 && bitwise_inverted_equal_p (@1, @2, wascmp)
7103 && (!wascmp || TYPE_PRECISION (type) == 1))
7104 (if ((!TYPE_UNSIGNED (type) && TREE_CODE (type) == BOOLEAN_TYPE)
7105 || TYPE_PRECISION (type) == 1)
7106 (bit_xor (convert:type @0) @2)
7107 (bit_xor (negate (convert:type @0)) @2)))))
7110 /* Simplify pointer equality compares using PTA. */
7114 (if (POINTER_TYPE_P (TREE_TYPE (@0))
7115 && ptrs_compare_unequal (@0, @1))
7116 { constant_boolean_node (neeq != EQ_EXPR, type); })))
7118 /* PR70920: Transform (intptr_t)x eq/ne CST to x eq/ne (typeof x) CST.
7119 and (typeof ptr_cst) x eq/ne ptr_cst to x eq/ne (typeof x) CST.
7120 Disable the transform if either operand is pointer to function.
7121 This broke pr22051-2.c for arm where function pointer
7122 canonicalizaion is not wanted. */
7126 (cmp (convert @0) INTEGER_CST@1)
7127 (if (((POINTER_TYPE_P (TREE_TYPE (@0))
7128 && !FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@0)))
7129 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
7130 /* Don't perform this optimization in GENERIC if @0 has reference
7131 type when sanitizing. See PR101210. */
7133 && TREE_CODE (TREE_TYPE (@0)) == REFERENCE_TYPE
7134 && (flag_sanitize & (SANITIZE_NULL | SANITIZE_ALIGNMENT))))
7135 || (INTEGRAL_TYPE_P (TREE_TYPE (@0))
7136 && POINTER_TYPE_P (TREE_TYPE (@1))
7137 && !FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@1)))))
7138 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1)))
7139 (cmp @0 (convert @1)))))
7141 /* Non-equality compare simplifications from fold_binary */
7142 (for cmp (lt gt le ge)
7143 /* Comparisons with the highest or lowest possible integer of
7144 the specified precision will have known values. */
7146 (cmp (convert?@2 @0) uniform_integer_cst_p@1)
7147 (if ((INTEGRAL_TYPE_P (TREE_TYPE (@1))
7148 || POINTER_TYPE_P (TREE_TYPE (@1))
7149 || VECTOR_INTEGER_TYPE_P (TREE_TYPE (@1)))
7150 && tree_nop_conversion_p (TREE_TYPE (@2), TREE_TYPE (@0)))
7153 tree cst = uniform_integer_cst_p (@1);
7154 tree arg1_type = TREE_TYPE (cst);
7155 unsigned int prec = TYPE_PRECISION (arg1_type);
7156 wide_int max = wi::max_value (arg1_type);
7157 wide_int signed_max = wi::max_value (prec, SIGNED);
7158 wide_int min = wi::min_value (arg1_type);
7161 (if (wi::to_wide (cst) == max)
7163 (if (cmp == GT_EXPR)
7164 { constant_boolean_node (false, type); })
7165 (if (cmp == GE_EXPR)
7167 (if (cmp == LE_EXPR)
7168 { constant_boolean_node (true, type); })
7169 (if (cmp == LT_EXPR)
7171 (if (wi::to_wide (cst) == min)
7173 (if (cmp == LT_EXPR)
7174 { constant_boolean_node (false, type); })
7175 (if (cmp == LE_EXPR)
7177 (if (cmp == GE_EXPR)
7178 { constant_boolean_node (true, type); })
7179 (if (cmp == GT_EXPR)
7181 (if (wi::to_wide (cst) == max - 1)
7183 (if (cmp == GT_EXPR)
7184 (eq @2 { build_uniform_cst (TREE_TYPE (@1),
7185 wide_int_to_tree (TREE_TYPE (cst),
7188 (if (cmp == LE_EXPR)
7189 (ne @2 { build_uniform_cst (TREE_TYPE (@1),
7190 wide_int_to_tree (TREE_TYPE (cst),
7193 (if (wi::to_wide (cst) == min + 1)
7195 (if (cmp == GE_EXPR)
7196 (ne @2 { build_uniform_cst (TREE_TYPE (@1),
7197 wide_int_to_tree (TREE_TYPE (cst),
7200 (if (cmp == LT_EXPR)
7201 (eq @2 { build_uniform_cst (TREE_TYPE (@1),
7202 wide_int_to_tree (TREE_TYPE (cst),
7205 (if (wi::to_wide (cst) == signed_max
7206 && TYPE_UNSIGNED (arg1_type)
7207 && TYPE_MODE (arg1_type) != BLKmode
7208 /* We will flip the signedness of the comparison operator
7209 associated with the mode of @1, so the sign bit is
7210 specified by this mode. Check that @1 is the signed
7211 max associated with this sign bit. */
7212 && prec == GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (arg1_type))
7213 /* signed_type does not work on pointer types. */
7214 && INTEGRAL_TYPE_P (arg1_type))
7215 /* The following case also applies to X < signed_max+1
7216 and X >= signed_max+1 because previous transformations. */
7217 (if (cmp == LE_EXPR || cmp == GT_EXPR)
7218 (with { tree st = signed_type_for (TREE_TYPE (@1)); }
7220 (if (cst == @1 && cmp == LE_EXPR)
7221 (ge (convert:st @0) { build_zero_cst (st); }))
7222 (if (cst == @1 && cmp == GT_EXPR)
7223 (lt (convert:st @0) { build_zero_cst (st); }))
7224 (if (cmp == LE_EXPR)
7225 (ge (view_convert:st @0) { build_zero_cst (st); }))
7226 (if (cmp == GT_EXPR)
7227 (lt (view_convert:st @0) { build_zero_cst (st); })))))))))))
7229 /* unsigned < (typeof unsigned)(unsigned != 0) is always false. */
7231 (lt:c @0 (convert (ne @0 integer_zerop)))
7232 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
7233 { constant_boolean_node (false, type); }))
7235 /* x != (typeof x)(x == CST) -> CST == 0 ? 1 : (CST == 1 ? (x!=0&&x!=1) : x != 0) */
7236 /* x != (typeof x)(x != CST) -> CST == 1 ? 1 : (CST == 0 ? (x!=0&&x!=1) : x != 1) */
7237 /* x == (typeof x)(x == CST) -> CST == 0 ? 0 : (CST == 1 ? (x==0||x==1) : x == 0) */
7238 /* x == (typeof x)(x != CST) -> CST == 1 ? 0 : (CST == 0 ? (x==0||x==1) : x == 1) */
7242 (outer:c @0 (convert (inner @0 INTEGER_CST@1)))
7244 bool cst1 = integer_onep (@1);
7245 bool cst0 = integer_zerop (@1);
7246 bool innereq = inner == EQ_EXPR;
7247 bool outereq = outer == EQ_EXPR;
7250 (if (innereq ? cst0 : cst1)
7251 { constant_boolean_node (!outereq, type); })
7252 (if (innereq ? cst1 : cst0)
7254 tree utype = unsigned_type_for (TREE_TYPE (@0));
7255 tree ucst1 = build_one_cst (utype);
7258 (gt (convert:utype @0) { ucst1; })
7259 (le (convert:utype @0) { ucst1; })
7264 tree value = build_int_cst (TREE_TYPE (@0), !innereq);
7277 (for cmp (unordered ordered unlt unle ungt unge uneq ltgt)
7278 /* If the second operand is NaN, the result is constant. */
7281 (if (REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
7282 && (cmp != LTGT_EXPR || ! flag_trapping_math))
7283 { constant_boolean_node (cmp == ORDERED_EXPR || cmp == LTGT_EXPR
7284 ? false : true, type); })))
7286 /* Fold UNORDERED if either operand must be NaN, or neither can be. */
7290 (if (tree_expr_nan_p (@0) || tree_expr_nan_p (@1))
7291 { constant_boolean_node (true, type); })
7292 (if (!tree_expr_maybe_nan_p (@0) && !tree_expr_maybe_nan_p (@1))
7293 { constant_boolean_node (false, type); })))
7295 /* Fold ORDERED if either operand must be NaN, or neither can be. */
7299 (if (tree_expr_nan_p (@0) || tree_expr_nan_p (@1))
7300 { constant_boolean_node (false, type); })
7301 (if (!tree_expr_maybe_nan_p (@0) && !tree_expr_maybe_nan_p (@1))
7302 { constant_boolean_node (true, type); })))
7304 /* bool_var != 0 becomes bool_var. */
7306 (ne @0 integer_zerop)
7307 (if (TREE_CODE (TREE_TYPE (@0)) == BOOLEAN_TYPE
7308 && types_match (type, TREE_TYPE (@0)))
7310 /* bool_var == 1 becomes bool_var. */
7312 (eq @0 integer_onep)
7313 (if (TREE_CODE (TREE_TYPE (@0)) == BOOLEAN_TYPE
7314 && types_match (type, TREE_TYPE (@0)))
7317 bool_var == 0 becomes !bool_var or
7318 bool_var != 1 becomes !bool_var
7319 here because that only is good in assignment context as long
7320 as we require a tcc_comparison in GIMPLE_CONDs where we'd
7321 replace if (x == 0) with tem = ~x; if (tem != 0) which is
7322 clearly less optimal and which we'll transform again in forwprop. */
7324 /* Transform comparisons of the form (X & Y) CMP 0 to X CMP2 Z
7325 where ~Y + 1 == pow2 and Z = ~Y. */
7326 (for cst (VECTOR_CST INTEGER_CST)
7330 (cmp (bit_and:c@2 @0 cst@1) integer_zerop)
7331 (with { tree csts = bitmask_inv_cst_vector_p (@1); }
7332 (if (csts && (VECTOR_TYPE_P (TREE_TYPE (@1)) || single_use (@2)))
7333 (with { auto optab = VECTOR_TYPE_P (TREE_TYPE (@1))
7334 ? optab_vector : optab_default;
7335 tree utype = unsigned_type_for (TREE_TYPE (@1)); }
7336 (if (target_supports_op_p (utype, icmp, optab)
7337 || (optimize_vectors_before_lowering_p ()
7338 && (!target_supports_op_p (type, cmp, optab)
7339 || !target_supports_op_p (type, BIT_AND_EXPR, optab))))
7340 (if (TYPE_UNSIGNED (TREE_TYPE (@1)))
7342 (icmp (view_convert:utype @0) { csts; })))))))))
7344 /* When one argument is a constant, overflow detection can be simplified.
7345 Currently restricted to single use so as not to interfere too much with
7346 ADD_OVERFLOW detection in tree-ssa-math-opts.cc.
7347 CONVERT?(CONVERT?(A) + CST) CMP A -> A CMP' CST' */
7348 (for cmp (lt le ge gt)
7351 (cmp:c (convert?@3 (plus@2 (convert?@4 @0) INTEGER_CST@1)) @0)
7352 (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@2))
7353 && types_match (TREE_TYPE (@0), TREE_TYPE (@3))
7354 && tree_nop_conversion_p (TREE_TYPE (@4), TREE_TYPE (@0))
7355 && wi::to_wide (@1) != 0
7358 unsigned int prec = TYPE_PRECISION (TREE_TYPE (@0));
7359 signop sign = TYPE_SIGN (TREE_TYPE (@0));
7361 (out @0 { wide_int_to_tree (TREE_TYPE (@0),
7362 wi::max_value (prec, sign)
7363 - wi::to_wide (@1)); })))))
7365 /* To detect overflow in unsigned A - B, A < B is simpler than A - B > A.
7366 However, the detection logic for SUB_OVERFLOW in tree-ssa-math-opts.cc
7367 expects the long form, so we restrict the transformation for now. */
7370 (cmp:c (minus@2 @0 @1) @0)
7371 (if (single_use (@2)
7372 && ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
7373 && TYPE_UNSIGNED (TREE_TYPE (@0)))
7376 /* Optimize A - B + -1 >= A into B >= A for unsigned comparisons. */
7379 (cmp:c (plus (minus @0 @1) integer_minus_onep) @0)
7380 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
7381 && TYPE_UNSIGNED (TREE_TYPE (@0)))
7384 /* Testing for overflow is unnecessary if we already know the result. */
7389 (cmp:c (realpart (IFN_SUB_OVERFLOW@2 @0 @1)) @0)
7390 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
7391 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
7392 (out (imagpart @2) { build_zero_cst (TREE_TYPE (@0)); }))))
7397 (cmp:c (realpart (IFN_ADD_OVERFLOW:c@2 @0 @1)) @0)
7398 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
7399 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
7400 (out (imagpart @2) { build_zero_cst (TREE_TYPE (@0)); }))))
7402 /* For unsigned operands, -1 / B < A checks whether A * B would overflow.
7403 Simplify it to __builtin_mul_overflow (A, B, <unused>). */
7407 (cmp:c (trunc_div:s integer_all_onesp @1) @0)
7408 (if (TYPE_UNSIGNED (TREE_TYPE (@0)) && !VECTOR_TYPE_P (TREE_TYPE (@0)))
7409 (with { tree t = TREE_TYPE (@0), cpx = build_complex_type (t); }
7410 (out (imagpart (IFN_MUL_OVERFLOW:cpx @0 @1)) { build_zero_cst (t); })))))
7412 /* Similarly, for unsigned operands, (((type) A * B) >> prec) != 0 where type
7413 is at least twice as wide as type of A and B, simplify to
7414 __builtin_mul_overflow (A, B, <unused>). */
7417 (cmp (rshift (mult:s (convert@3 @0) (convert @1)) INTEGER_CST@2)
7419 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
7420 && INTEGRAL_TYPE_P (TREE_TYPE (@3))
7421 && TYPE_UNSIGNED (TREE_TYPE (@0))
7422 && (TYPE_PRECISION (TREE_TYPE (@3))
7423 >= 2 * TYPE_PRECISION (TREE_TYPE (@0)))
7424 && tree_fits_uhwi_p (@2)
7425 && tree_to_uhwi (@2) == TYPE_PRECISION (TREE_TYPE (@0))
7426 && types_match (@0, @1)
7427 && type_has_mode_precision_p (TREE_TYPE (@0))
7428 && (optab_handler (umulv4_optab, TYPE_MODE (TREE_TYPE (@0)))
7429 != CODE_FOR_nothing))
7430 (with { tree t = TREE_TYPE (@0), cpx = build_complex_type (t); }
7431 (cmp (imagpart (IFN_MUL_OVERFLOW:cpx @0 @1)) { build_zero_cst (t); })))))
7433 /* Demote operands of IFN_{ADD,SUB,MUL}_OVERFLOW. */
7434 (for ovf (IFN_ADD_OVERFLOW IFN_SUB_OVERFLOW IFN_MUL_OVERFLOW)
7436 (ovf (convert@2 @0) @1)
7437 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
7438 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
7439 && TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (TREE_TYPE (@0))
7440 && (!TYPE_UNSIGNED (TREE_TYPE (@2)) || TYPE_UNSIGNED (TREE_TYPE (@0))))
7443 (ovf @1 (convert@2 @0))
7444 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
7445 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
7446 && TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (TREE_TYPE (@0))
7447 && (!TYPE_UNSIGNED (TREE_TYPE (@2)) || TYPE_UNSIGNED (TREE_TYPE (@0))))
7450 /* Optimize __builtin_mul_overflow_p (x, cst, (utype) 0) if all 3 types
7451 are unsigned to x > (umax / cst). Similarly for signed type, but
7452 in that case it needs to be outside of a range. */
7454 (imagpart (IFN_MUL_OVERFLOW:cs@2 @0 integer_nonzerop@1))
7455 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
7456 && TYPE_MAX_VALUE (TREE_TYPE (@0))
7457 && types_match (TREE_TYPE (@0), TREE_TYPE (TREE_TYPE (@2)))
7458 && int_fits_type_p (@1, TREE_TYPE (@0)))
7459 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
7460 (convert (gt @0 (trunc_div! { TYPE_MAX_VALUE (TREE_TYPE (@0)); } @1)))
7461 (if (TYPE_MIN_VALUE (TREE_TYPE (@0)))
7462 (if (integer_minus_onep (@1))
7463 (convert (eq @0 { TYPE_MIN_VALUE (TREE_TYPE (@0)); }))
7466 tree div = fold_convert (TREE_TYPE (@0), @1);
7467 tree lo = int_const_binop (TRUNC_DIV_EXPR,
7468 TYPE_MIN_VALUE (TREE_TYPE (@0)), div);
7469 tree hi = int_const_binop (TRUNC_DIV_EXPR,
7470 TYPE_MAX_VALUE (TREE_TYPE (@0)), div);
7471 tree etype = range_check_type (TREE_TYPE (@0));
7474 if (wi::neg_p (wi::to_wide (div)))
7476 lo = fold_convert (etype, lo);
7477 hi = fold_convert (etype, hi);
7478 hi = int_const_binop (MINUS_EXPR, hi, lo);
7482 (convert (gt (minus (convert:etype @0) { lo; }) { hi; })))))))))
7484 /* Simplification of math builtins. These rules must all be optimizations
7485 as well as IL simplifications. If there is a possibility that the new
7486 form could be a pessimization, the rule should go in the canonicalization
7487 section that follows this one.
7489 Rules can generally go in this section if they satisfy one of
7492 - the rule describes an identity
7494 - the rule replaces calls with something as simple as addition or
7497 - the rule contains unary calls only and simplifies the surrounding
7498 arithmetic. (The idea here is to exclude non-unary calls in which
7499 one operand is constant and in which the call is known to be cheap
7500 when the operand has that value.) */
7502 (if (flag_unsafe_math_optimizations)
7503 /* Simplify sqrt(x) * sqrt(x) -> x. */
7505 (mult (SQRT_ALL@1 @0) @1)
7506 (if (!tree_expr_maybe_signaling_nan_p (@0))
7509 (for op (plus minus)
7510 /* Simplify (A / C) +- (B / C) -> (A +- B) / C. */
7514 (rdiv (op @0 @2) @1)))
7516 (for cmp (lt le gt ge)
7517 neg_cmp (gt ge lt le)
7518 /* Simplify (x * C1) cmp C2 -> x cmp (C2 / C1), where C1 != 0. */
7520 (cmp (mult @0 REAL_CST@1) REAL_CST@2)
7522 { tree tem = const_binop (RDIV_EXPR, type, @2, @1); }
7524 && !(REAL_VALUE_ISINF (TREE_REAL_CST (tem))
7525 || (real_zerop (tem) && !real_zerop (@1))))
7527 (if (real_less (&dconst0, TREE_REAL_CST_PTR (@1)))
7529 (if (real_less (TREE_REAL_CST_PTR (@1), &dconst0))
7530 (neg_cmp @0 { tem; })))))))
7532 /* Simplify sqrt(x) * sqrt(y) -> sqrt(x*y). */
7533 (for root (SQRT CBRT)
7535 (mult (root:s @0) (root:s @1))
7536 (root (mult @0 @1))))
7538 /* Simplify expN(x) * expN(y) -> expN(x+y). */
7539 (for exps (EXP EXP2 EXP10 POW10)
7541 (mult (exps:s @0) (exps:s @1))
7542 (exps (plus @0 @1))))
7544 /* Simplify a/root(b/c) into a*root(c/b). */
7545 (for root (SQRT CBRT)
7547 (rdiv @0 (root:s (rdiv:s @1 @2)))
7548 (mult @0 (root (rdiv @2 @1)))))
7550 /* Simplify x/expN(y) into x*expN(-y). */
7551 (for exps (EXP EXP2 EXP10 POW10)
7553 (rdiv @0 (exps:s @1))
7554 (mult @0 (exps (negate @1)))))
7556 (for logs (LOG LOG2 LOG10 LOG10)
7557 exps (EXP EXP2 EXP10 POW10)
7558 /* logN(expN(x)) -> x. */
7562 /* expN(logN(x)) -> x. */
7567 /* Optimize logN(func()) for various exponential functions. We
7568 want to determine the value "x" and the power "exponent" in
7569 order to transform logN(x**exponent) into exponent*logN(x). */
7570 (for logs (LOG LOG LOG LOG2 LOG2 LOG2 LOG10 LOG10)
7571 exps (EXP2 EXP10 POW10 EXP EXP10 POW10 EXP EXP2)
7574 (if (SCALAR_FLOAT_TYPE_P (type))
7580 /* Prepare to do logN(exp(exponent)) -> exponent*logN(e). */
7581 x = build_real_truncate (type, dconst_e ());
7584 /* Prepare to do logN(exp2(exponent)) -> exponent*logN(2). */
7585 x = build_real (type, dconst2);
7589 /* Prepare to do logN(exp10(exponent)) -> exponent*logN(10). */
7591 REAL_VALUE_TYPE dconst10;
7592 real_from_integer (&dconst10, VOIDmode, 10, SIGNED);
7593 x = build_real (type, dconst10);
7600 (mult (logs { x; }) @0)))))
7608 (if (SCALAR_FLOAT_TYPE_P (type))
7614 /* Prepare to do logN(sqrt(x)) -> 0.5*logN(x). */
7615 x = build_real (type, dconsthalf);
7618 /* Prepare to do logN(cbrt(x)) -> (1/3)*logN(x). */
7619 x = build_real_truncate (type, dconst_third ());
7625 (mult { x; } (logs @0))))))
7627 /* logN(pow(x,exponent)) -> exponent*logN(x). */
7628 (for logs (LOG LOG2 LOG10)
7632 (mult @1 (logs @0))))
7634 /* pow(C,x) -> exp(log(C)*x) if C > 0,
7635 or if C is a positive power of 2,
7636 pow(C,x) -> exp2(log2(C)*x). */
7644 (pows REAL_CST@0 @1)
7645 (if (real_compare (GT_EXPR, TREE_REAL_CST_PTR (@0), &dconst0)
7646 && real_isfinite (TREE_REAL_CST_PTR (@0))
7647 /* As libmvec doesn't have a vectorized exp2, defer optimizing
7648 the use_exp2 case until after vectorization. It seems actually
7649 beneficial for all constants to postpone this until later,
7650 because exp(log(C)*x), while faster, will have worse precision
7651 and if x folds into a constant too, that is unnecessary
7653 && canonicalize_math_after_vectorization_p ())
7655 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (@0);
7656 bool use_exp2 = false;
7657 if (targetm.libc_has_function (function_c99_misc, TREE_TYPE (@0))
7658 && value->cl == rvc_normal)
7660 REAL_VALUE_TYPE frac_rvt = *value;
7661 SET_REAL_EXP (&frac_rvt, 1);
7662 if (real_equal (&frac_rvt, &dconst1))
7667 (if (optimize_pow_to_exp (@0, @1))
7668 (exps (mult (logs @0) @1)))
7669 (exp2s (mult (log2s @0) @1)))))))
7672 /* pow(C,x)*expN(y) -> expN(logN(C)*x+y) if C > 0. */
7674 exps (EXP EXP2 EXP10 POW10)
7675 logs (LOG LOG2 LOG10 LOG10)
7677 (mult:c (pows:s REAL_CST@0 @1) (exps:s @2))
7678 (if (real_compare (GT_EXPR, TREE_REAL_CST_PTR (@0), &dconst0)
7679 && real_isfinite (TREE_REAL_CST_PTR (@0)))
7680 (exps (plus (mult (logs @0) @1) @2)))))
7685 exps (EXP EXP2 EXP10 POW10)
7686 /* sqrt(expN(x)) -> expN(x*0.5). */
7689 (exps (mult @0 { build_real (type, dconsthalf); })))
7690 /* cbrt(expN(x)) -> expN(x/3). */
7693 (exps (mult @0 { build_real_truncate (type, dconst_third ()); })))
7694 /* pow(expN(x), y) -> expN(x*y). */
7697 (exps (mult @0 @1))))
7699 /* tan(atan(x)) -> x. */
7706 /* Simplify sin(atan(x)) -> x / sqrt(x*x + 1). */
7710 copysigns (COPYSIGN)
7715 REAL_VALUE_TYPE r_cst;
7716 build_sinatan_real (&r_cst, type);
7717 tree t_cst = build_real (type, r_cst);
7718 tree t_one = build_one_cst (type);
7720 (if (SCALAR_FLOAT_TYPE_P (type))
7721 (cond (lt (abs @0) { t_cst; })
7722 (rdiv @0 (sqrts (plus (mult @0 @0) { t_one; })))
7723 (copysigns { t_one; } @0))))))
7725 /* Simplify cos(atan(x)) -> 1 / sqrt(x*x + 1). */
7729 copysigns (COPYSIGN)
7734 REAL_VALUE_TYPE r_cst;
7735 build_sinatan_real (&r_cst, type);
7736 tree t_cst = build_real (type, r_cst);
7737 tree t_one = build_one_cst (type);
7738 tree t_zero = build_zero_cst (type);
7740 (if (SCALAR_FLOAT_TYPE_P (type))
7741 (cond (lt (abs @0) { t_cst; })
7742 (rdiv { t_one; } (sqrts (plus (mult @0 @0) { t_one; })))
7743 (copysigns { t_zero; } @0))))))
7745 (if (!flag_errno_math)
7746 /* Simplify sinh(atanh(x)) -> x / sqrt((1 - x)*(1 + x)). */
7751 (sinhs (atanhs:s @0))
7752 (with { tree t_one = build_one_cst (type); }
7753 (rdiv @0 (sqrts (mult (minus { t_one; } @0) (plus { t_one; } @0)))))))
7755 /* Simplify cosh(atanh(x)) -> 1 / sqrt((1 - x)*(1 + x)) */
7760 (coshs (atanhs:s @0))
7761 (with { tree t_one = build_one_cst (type); }
7762 (rdiv { t_one; } (sqrts (mult (minus { t_one; } @0) (plus { t_one; } @0))))))))
7764 /* cabs(x+0i) or cabs(0+xi) -> abs(x). */
7766 (CABS (complex:C @0 real_zerop@1))
7769 /* trunc(trunc(x)) -> trunc(x), etc. */
7770 (for fns (TRUNC_ALL FLOOR_ALL CEIL_ALL ROUND_ALL NEARBYINT_ALL RINT_ALL)
7774 /* f(x) -> x if x is integer valued and f does nothing for such values. */
7775 (for fns (TRUNC_ALL FLOOR_ALL CEIL_ALL ROUND_ALL NEARBYINT_ALL RINT_ALL)
7777 (fns integer_valued_real_p@0)
7780 /* hypot(x,0) and hypot(0,x) -> abs(x). */
7782 (HYPOT:c @0 real_zerop@1)
7785 /* pow(1,x) -> 1. */
7787 (POW real_onep@0 @1)
7791 /* copysign(x,x) -> x. */
7792 (COPYSIGN_ALL @0 @0)
7796 /* copysign(x,-x) -> -x. */
7797 (COPYSIGN_ALL @0 (negate@1 @0))
7801 /* copysign(x,y) -> fabs(x) if y is nonnegative. */
7802 (COPYSIGN_ALL @0 tree_expr_nonnegative_p@1)
7806 /* fabs (copysign(x, y)) -> fabs (x). */
7807 (abs (COPYSIGN_ALL @0 @1))
7810 (for scale (LDEXP SCALBN SCALBLN)
7811 /* ldexp(0, x) -> 0. */
7813 (scale real_zerop@0 @1)
7815 /* ldexp(x, 0) -> x. */
7817 (scale @0 integer_zerop@1)
7819 /* ldexp(x, y) -> x if x is +-Inf or NaN. */
7821 (scale REAL_CST@0 @1)
7822 (if (!real_isfinite (TREE_REAL_CST_PTR (@0)))
7825 /* Canonicalization of sequences of math builtins. These rules represent
7826 IL simplifications but are not necessarily optimizations.
7828 The sincos pass is responsible for picking "optimal" implementations
7829 of math builtins, which may be more complicated and can sometimes go
7830 the other way, e.g. converting pow into a sequence of sqrts.
7831 We only want to do these canonicalizations before the pass has run. */
7833 (if (flag_unsafe_math_optimizations && canonicalize_math_p ())
7834 /* Simplify tan(x) * cos(x) -> sin(x). */
7836 (mult:c (TAN:s @0) (COS:s @0))
7839 /* Simplify x * pow(x,c) -> pow(x,c+1). */
7841 (mult:c @0 (POW:s @0 REAL_CST@1))
7842 (if (!TREE_OVERFLOW (@1))
7843 (POW @0 (plus @1 { build_one_cst (type); }))))
7845 /* Simplify sin(x) / cos(x) -> tan(x). */
7847 (rdiv (SIN:s @0) (COS:s @0))
7850 /* Simplify sinh(x) / cosh(x) -> tanh(x). */
7852 (rdiv (SINH:s @0) (COSH:s @0))
7855 /* Simplify tanh (x) / sinh (x) -> 1.0 / cosh (x). */
7857 (rdiv (TANH:s @0) (SINH:s @0))
7858 (rdiv {build_one_cst (type);} (COSH @0)))
7860 /* Simplify cos(x) / sin(x) -> 1 / tan(x). */
7862 (rdiv (COS:s @0) (SIN:s @0))
7863 (rdiv { build_one_cst (type); } (TAN @0)))
7865 /* Simplify sin(x) / tan(x) -> cos(x). */
7867 (rdiv (SIN:s @0) (TAN:s @0))
7868 (if (! HONOR_NANS (@0)
7869 && ! HONOR_INFINITIES (@0))
7872 /* Simplify tan(x) / sin(x) -> 1.0 / cos(x). */
7874 (rdiv (TAN:s @0) (SIN:s @0))
7875 (if (! HONOR_NANS (@0)
7876 && ! HONOR_INFINITIES (@0))
7877 (rdiv { build_one_cst (type); } (COS @0))))
7879 /* Simplify pow(x,y) * pow(x,z) -> pow(x,y+z). */
7881 (mult (POW:s @0 @1) (POW:s @0 @2))
7882 (POW @0 (plus @1 @2)))
7884 /* Simplify pow(x,y) * pow(z,y) -> pow(x*z,y). */
7886 (mult (POW:s @0 @1) (POW:s @2 @1))
7887 (POW (mult @0 @2) @1))
7889 /* Simplify powi(x,y) * powi(z,y) -> powi(x*z,y). */
7891 (mult (POWI:s @0 @1) (POWI:s @2 @1))
7892 (POWI (mult @0 @2) @1))
7894 /* Simplify pow(x,c) / x -> pow(x,c-1). */
7896 (rdiv (POW:s @0 REAL_CST@1) @0)
7897 (if (!TREE_OVERFLOW (@1))
7898 (POW @0 (minus @1 { build_one_cst (type); }))))
7900 /* Simplify x / pow (y,z) -> x * pow(y,-z). */
7902 (rdiv @0 (POW:s @1 @2))
7903 (mult @0 (POW @1 (negate @2))))
7908 /* sqrt(sqrt(x)) -> pow(x,1/4). */
7911 (pows @0 { build_real (type, dconst_quarter ()); }))
7912 /* sqrt(cbrt(x)) -> pow(x,1/6). */
7915 (pows @0 { build_real_truncate (type, dconst_sixth ()); }))
7916 /* cbrt(sqrt(x)) -> pow(x,1/6). */
7919 (pows @0 { build_real_truncate (type, dconst_sixth ()); }))
7920 /* cbrt(cbrt(x)) -> pow(x,1/9), iff x is nonnegative. */
7922 (cbrts (cbrts tree_expr_nonnegative_p@0))
7923 (pows @0 { build_real_truncate (type, dconst_ninth ()); }))
7924 /* sqrt(pow(x,y)) -> pow(|x|,y*0.5). */
7926 (sqrts (pows @0 @1))
7927 (pows (abs @0) (mult @1 { build_real (type, dconsthalf); })))
7928 /* cbrt(pow(x,y)) -> pow(x,y/3), iff x is nonnegative. */
7930 (cbrts (pows tree_expr_nonnegative_p@0 @1))
7931 (pows @0 (mult @1 { build_real_truncate (type, dconst_third ()); })))
7932 /* pow(sqrt(x),y) -> pow(x,y*0.5). */
7934 (pows (sqrts @0) @1)
7935 (pows @0 (mult @1 { build_real (type, dconsthalf); })))
7936 /* pow(cbrt(x),y) -> pow(x,y/3) iff x is nonnegative. */
7938 (pows (cbrts tree_expr_nonnegative_p@0) @1)
7939 (pows @0 (mult @1 { build_real_truncate (type, dconst_third ()); })))
7940 /* pow(pow(x,y),z) -> pow(x,y*z) iff x is nonnegative. */
7942 (pows (pows tree_expr_nonnegative_p@0 @1) @2)
7943 (pows @0 (mult @1 @2))))
7945 /* cabs(x+xi) -> fabs(x)*sqrt(2). */
7947 (CABS (complex @0 @0))
7948 (mult (abs @0) { build_real_truncate (type, dconst_sqrt2 ()); }))
7950 /* hypot(x,x) -> fabs(x)*sqrt(2). */
7953 (mult (abs @0) { build_real_truncate (type, dconst_sqrt2 ()); }))
7955 /* cexp(x+yi) -> exp(x)*cexpi(y). */
7960 (cexps compositional_complex@0)
7961 (if (targetm.libc_has_function (function_c99_math_complex, TREE_TYPE (@0)))
7963 (mult (exps@1 (realpart @0)) (realpart (cexpis:type@2 (imagpart @0))))
7964 (mult @1 (imagpart @2)))))))
7966 (if (canonicalize_math_p ())
7967 /* floor(x) -> trunc(x) if x is nonnegative. */
7968 (for floors (FLOOR_ALL)
7971 (floors tree_expr_nonnegative_p@0)
7974 (match double_value_p
7976 (if (TYPE_MAIN_VARIANT (TREE_TYPE (@0)) == double_type_node)))
7977 (for froms (BUILT_IN_TRUNCL
7989 /* truncl(extend(x)) -> extend(trunc(x)), etc., if x is a double. */
7990 (if (optimize && canonicalize_math_p ())
7992 (froms (convert double_value_p@0))
7993 (convert (tos @0)))))
7995 (match float_value_p
7997 (if (TYPE_MAIN_VARIANT (TREE_TYPE (@0)) == float_type_node)))
7998 (for froms (BUILT_IN_TRUNCL BUILT_IN_TRUNC
7999 BUILT_IN_FLOORL BUILT_IN_FLOOR
8000 BUILT_IN_CEILL BUILT_IN_CEIL
8001 BUILT_IN_ROUNDL BUILT_IN_ROUND
8002 BUILT_IN_NEARBYINTL BUILT_IN_NEARBYINT
8003 BUILT_IN_RINTL BUILT_IN_RINT)
8004 tos (BUILT_IN_TRUNCF BUILT_IN_TRUNCF
8005 BUILT_IN_FLOORF BUILT_IN_FLOORF
8006 BUILT_IN_CEILF BUILT_IN_CEILF
8007 BUILT_IN_ROUNDF BUILT_IN_ROUNDF
8008 BUILT_IN_NEARBYINTF BUILT_IN_NEARBYINTF
8009 BUILT_IN_RINTF BUILT_IN_RINTF)
8010 /* truncl(extend(x)) and trunc(extend(x)) -> extend(truncf(x)), etc.,
8012 (if (optimize && canonicalize_math_p ()
8013 && targetm.libc_has_function (function_c99_misc, NULL_TREE))
8015 (froms (convert float_value_p@0))
8016 (convert (tos @0)))))
8019 (match float16_value_p
8021 (if (TYPE_MAIN_VARIANT (TREE_TYPE (@0)) == float16_type_node)))
8022 (for froms (BUILT_IN_TRUNCL BUILT_IN_TRUNC BUILT_IN_TRUNCF
8023 BUILT_IN_FLOORL BUILT_IN_FLOOR BUILT_IN_FLOORF
8024 BUILT_IN_CEILL BUILT_IN_CEIL BUILT_IN_CEILF
8025 BUILT_IN_ROUNDEVENL BUILT_IN_ROUNDEVEN BUILT_IN_ROUNDEVENF
8026 BUILT_IN_ROUNDL BUILT_IN_ROUND BUILT_IN_ROUNDF
8027 BUILT_IN_NEARBYINTL BUILT_IN_NEARBYINT BUILT_IN_NEARBYINTF
8028 BUILT_IN_RINTL BUILT_IN_RINT BUILT_IN_RINTF
8029 BUILT_IN_SQRTL BUILT_IN_SQRT BUILT_IN_SQRTF)
8030 tos (IFN_TRUNC IFN_TRUNC IFN_TRUNC
8031 IFN_FLOOR IFN_FLOOR IFN_FLOOR
8032 IFN_CEIL IFN_CEIL IFN_CEIL
8033 IFN_ROUNDEVEN IFN_ROUNDEVEN IFN_ROUNDEVEN
8034 IFN_ROUND IFN_ROUND IFN_ROUND
8035 IFN_NEARBYINT IFN_NEARBYINT IFN_NEARBYINT
8036 IFN_RINT IFN_RINT IFN_RINT
8037 IFN_SQRT IFN_SQRT IFN_SQRT)
8038 /* (_Float16) round ((doube) x) -> __built_in_roundf16 (x), etc.,
8039 if x is a _Float16. */
8041 (convert (froms (convert float16_value_p@0)))
8043 && types_match (type, TREE_TYPE (@0))
8044 && direct_internal_fn_supported_p (as_internal_fn (tos),
8045 type, OPTIMIZE_FOR_BOTH))
8048 /* Simplify (trunc)copysign ((extend)x, (extend)y) to copysignf (x, y),
8049 x,y is float value, similar for _Float16/double. */
8050 (for copysigns (COPYSIGN_ALL)
8052 (convert (copysigns (convert@2 @0) (convert @1)))
8054 && !HONOR_SNANS (@2)
8055 && types_match (type, TREE_TYPE (@0))
8056 && types_match (type, TREE_TYPE (@1))
8057 && TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (@2))
8058 && direct_internal_fn_supported_p (IFN_COPYSIGN,
8059 type, OPTIMIZE_FOR_BOTH))
8060 (IFN_COPYSIGN @0 @1))))
8062 (for froms (BUILT_IN_FMAF BUILT_IN_FMA BUILT_IN_FMAL)
8063 tos (IFN_FMA IFN_FMA IFN_FMA)
8065 (convert (froms (convert@3 @0) (convert @1) (convert @2)))
8066 (if (flag_unsafe_math_optimizations
8068 && FLOAT_TYPE_P (type)
8069 && FLOAT_TYPE_P (TREE_TYPE (@3))
8070 && types_match (type, TREE_TYPE (@0))
8071 && types_match (type, TREE_TYPE (@1))
8072 && types_match (type, TREE_TYPE (@2))
8073 && TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (@3))
8074 && direct_internal_fn_supported_p (as_internal_fn (tos),
8075 type, OPTIMIZE_FOR_BOTH))
8078 (for maxmin (max min)
8080 (convert (maxmin (convert@2 @0) (convert @1)))
8082 && FLOAT_TYPE_P (type)
8083 && FLOAT_TYPE_P (TREE_TYPE (@2))
8084 && types_match (type, TREE_TYPE (@0))
8085 && types_match (type, TREE_TYPE (@1))
8086 && element_precision (type) < element_precision (TREE_TYPE (@2)))
8090 (for froms (XFLOORL XCEILL XROUNDL XRINTL)
8091 tos (XFLOOR XCEIL XROUND XRINT)
8092 /* llfloorl(extend(x)) -> llfloor(x), etc., if x is a double. */
8093 (if (optimize && canonicalize_math_p ())
8095 (froms (convert double_value_p@0))
8098 (for froms (XFLOORL XCEILL XROUNDL XRINTL
8099 XFLOOR XCEIL XROUND XRINT)
8100 tos (XFLOORF XCEILF XROUNDF XRINTF)
8101 /* llfloorl(extend(x)) and llfloor(extend(x)) -> llfloorf(x), etc.,
8103 (if (optimize && canonicalize_math_p ())
8105 (froms (convert float_value_p@0))
8108 (if (canonicalize_math_p ())
8109 /* xfloor(x) -> fix_trunc(x) if x is nonnegative. */
8110 (for floors (IFLOOR LFLOOR LLFLOOR)
8112 (floors tree_expr_nonnegative_p@0)
8115 (if (canonicalize_math_p ())
8116 /* xfloor(x) -> fix_trunc(x), etc., if x is integer valued. */
8117 (for fns (IFLOOR LFLOOR LLFLOOR
8119 IROUND LROUND LLROUND)
8121 (fns integer_valued_real_p@0)
8123 (if (!flag_errno_math)
8124 /* xrint(x) -> fix_trunc(x), etc., if x is integer valued. */
8125 (for rints (IRINT LRINT LLRINT)
8127 (rints integer_valued_real_p@0)
8130 (if (canonicalize_math_p ())
8131 (for ifn (IFLOOR ICEIL IROUND IRINT)
8132 lfn (LFLOOR LCEIL LROUND LRINT)
8133 llfn (LLFLOOR LLCEIL LLROUND LLRINT)
8134 /* Canonicalize iround (x) to lround (x) on ILP32 targets where
8135 sizeof (int) == sizeof (long). */
8136 (if (TYPE_PRECISION (integer_type_node)
8137 == TYPE_PRECISION (long_integer_type_node))
8140 (lfn:long_integer_type_node @0)))
8141 /* Canonicalize llround (x) to lround (x) on LP64 targets where
8142 sizeof (long long) == sizeof (long). */
8143 (if (TYPE_PRECISION (long_long_integer_type_node)
8144 == TYPE_PRECISION (long_integer_type_node))
8147 (lfn:long_integer_type_node @0)))))
8149 /* cproj(x) -> x if we're ignoring infinities. */
8152 (if (!HONOR_INFINITIES (type))
8155 /* If the real part is inf and the imag part is known to be
8156 nonnegative, return (inf + 0i). */
8158 (CPROJ (complex REAL_CST@0 tree_expr_nonnegative_p@1))
8159 (if (real_isinf (TREE_REAL_CST_PTR (@0)))
8160 { build_complex_inf (type, false); }))
8162 /* If the imag part is inf, return (inf+I*copysign(0,imag)). */
8164 (CPROJ (complex @0 REAL_CST@1))
8165 (if (real_isinf (TREE_REAL_CST_PTR (@1)))
8166 { build_complex_inf (type, TREE_REAL_CST_PTR (@1)->sign); }))
8172 (pows @0 REAL_CST@1)
8174 const REAL_VALUE_TYPE *value = TREE_REAL_CST_PTR (@1);
8175 REAL_VALUE_TYPE tmp;
8178 /* pow(x,0) -> 1. */
8179 (if (real_equal (value, &dconst0))
8180 { build_real (type, dconst1); })
8181 /* pow(x,1) -> x. */
8182 (if (real_equal (value, &dconst1))
8184 /* pow(x,-1) -> 1/x. */
8185 (if (real_equal (value, &dconstm1))
8186 (rdiv { build_real (type, dconst1); } @0))
8187 /* pow(x,0.5) -> sqrt(x). */
8188 (if (flag_unsafe_math_optimizations
8189 && canonicalize_math_p ()
8190 && real_equal (value, &dconsthalf))
8192 /* pow(x,1/3) -> cbrt(x). */
8193 (if (flag_unsafe_math_optimizations
8194 && canonicalize_math_p ()
8195 && (tmp = real_value_truncate (TYPE_MODE (type), dconst_third ()),
8196 real_equal (value, &tmp)))
8199 /* powi(1,x) -> 1. */
8201 (POWI real_onep@0 @1)
8205 (POWI @0 INTEGER_CST@1)
8207 /* powi(x,0) -> 1. */
8208 (if (wi::to_wide (@1) == 0)
8209 { build_real (type, dconst1); })
8210 /* powi(x,1) -> x. */
8211 (if (wi::to_wide (@1) == 1)
8213 /* powi(x,-1) -> 1/x. */
8214 (if (wi::to_wide (@1) == -1)
8215 (rdiv { build_real (type, dconst1); } @0))))
8217 /* Narrowing of arithmetic and logical operations.
8219 These are conceptually similar to the transformations performed for
8220 the C/C++ front-ends by shorten_binary_op and shorten_compare. Long
8221 term we want to move all that code out of the front-ends into here. */
8223 /* Convert (outertype)((innertype0)a+(innertype1)b)
8224 into ((newtype)a+(newtype)b) where newtype
8225 is the widest mode from all of these. */
8226 (for op (plus minus mult rdiv)
8228 (convert (op:s@0 (convert1?@3 @1) (convert2?@4 @2)))
8229 /* If we have a narrowing conversion of an arithmetic operation where
8230 both operands are widening conversions from the same type as the outer
8231 narrowing conversion. Then convert the innermost operands to a
8232 suitable unsigned type (to avoid introducing undefined behavior),
8233 perform the operation and convert the result to the desired type. */
8234 (if (INTEGRAL_TYPE_P (type)
8237 /* We check for type compatibility between @0 and @1 below,
8238 so there's no need to check that @2/@4 are integral types. */
8239 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
8240 && INTEGRAL_TYPE_P (TREE_TYPE (@3))
8241 /* The precision of the type of each operand must match the
8242 precision of the mode of each operand, similarly for the
8244 && type_has_mode_precision_p (TREE_TYPE (@1))
8245 && type_has_mode_precision_p (TREE_TYPE (@2))
8246 && type_has_mode_precision_p (type)
8247 /* The inner conversion must be a widening conversion. */
8248 && TYPE_PRECISION (TREE_TYPE (@3)) > TYPE_PRECISION (TREE_TYPE (@1))
8249 && types_match (@1, type)
8250 && (types_match (@1, @2)
8251 /* Or the second operand is const integer or converted const
8252 integer from valueize. */
8253 || poly_int_tree_p (@4)))
8254 (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
8255 (op @1 (convert @2))
8256 (with { tree utype = unsigned_type_for (TREE_TYPE (@1)); }
8257 (convert (op (convert:utype @1)
8258 (convert:utype @2)))))
8259 (if (FLOAT_TYPE_P (type)
8260 && DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0))
8261 == DECIMAL_FLOAT_TYPE_P (type))
8262 (with { tree arg0 = strip_float_extensions (@1);
8263 tree arg1 = strip_float_extensions (@2);
8264 tree itype = TREE_TYPE (@0);
8265 tree ty1 = TREE_TYPE (arg0);
8266 tree ty2 = TREE_TYPE (arg1);
8267 enum tree_code code = TREE_CODE (itype); }
8268 (if (FLOAT_TYPE_P (ty1)
8269 && FLOAT_TYPE_P (ty2))
8270 (with { tree newtype = type;
8271 if (TYPE_MODE (ty1) == SDmode
8272 || TYPE_MODE (ty2) == SDmode
8273 || TYPE_MODE (type) == SDmode)
8274 newtype = dfloat32_type_node;
8275 if (TYPE_MODE (ty1) == DDmode
8276 || TYPE_MODE (ty2) == DDmode
8277 || TYPE_MODE (type) == DDmode)
8278 newtype = dfloat64_type_node;
8279 if (TYPE_MODE (ty1) == TDmode
8280 || TYPE_MODE (ty2) == TDmode
8281 || TYPE_MODE (type) == TDmode)
8282 newtype = dfloat128_type_node; }
8283 (if ((newtype == dfloat32_type_node
8284 || newtype == dfloat64_type_node
8285 || newtype == dfloat128_type_node)
8287 && types_match (newtype, type))
8288 (op (convert:newtype @1) (convert:newtype @2))
8289 (with { if (element_precision (ty1) > element_precision (newtype))
8291 if (element_precision (ty2) > element_precision (newtype))
8293 /* Sometimes this transformation is safe (cannot
8294 change results through affecting double rounding
8295 cases) and sometimes it is not. If NEWTYPE is
8296 wider than TYPE, e.g. (float)((long double)double
8297 + (long double)double) converted to
8298 (float)(double + double), the transformation is
8299 unsafe regardless of the details of the types
8300 involved; double rounding can arise if the result
8301 of NEWTYPE arithmetic is a NEWTYPE value half way
8302 between two representable TYPE values but the
8303 exact value is sufficiently different (in the
8304 right direction) for this difference to be
8305 visible in ITYPE arithmetic. If NEWTYPE is the
8306 same as TYPE, however, the transformation may be
8307 safe depending on the types involved: it is safe
8308 if the ITYPE has strictly more than twice as many
8309 mantissa bits as TYPE, can represent infinities
8310 and NaNs if the TYPE can, and has sufficient
8311 exponent range for the product or ratio of two
8312 values representable in the TYPE to be within the
8313 range of normal values of ITYPE. */
8314 (if (element_precision (newtype) < element_precision (itype)
8315 && (!VECTOR_MODE_P (TYPE_MODE (newtype))
8316 || target_supports_op_p (newtype, op, optab_default))
8317 && (flag_unsafe_math_optimizations
8318 || (element_precision (newtype) == element_precision (type)
8319 && real_can_shorten_arithmetic (element_mode (itype),
8320 element_mode (type))
8321 && !excess_precision_type (newtype)))
8322 && !types_match (itype, newtype))
8323 (convert:type (op (convert:newtype @1)
8324 (convert:newtype @2)))
8329 /* This is another case of narrowing, specifically when there's an outer
8330 BIT_AND_EXPR which masks off bits outside the type of the innermost
8331 operands. Like the previous case we have to convert the operands
8332 to unsigned types to avoid introducing undefined behavior for the
8333 arithmetic operation. */
8334 (for op (minus plus)
8336 (bit_and (op:s (convert@2 @0) (convert@3 @1)) INTEGER_CST@4)
8337 (if (INTEGRAL_TYPE_P (type)
8338 /* We check for type compatibility between @0 and @1 below,
8339 so there's no need to check that @1/@3 are integral types. */
8340 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
8341 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
8342 /* The precision of the type of each operand must match the
8343 precision of the mode of each operand, similarly for the
8345 && type_has_mode_precision_p (TREE_TYPE (@0))
8346 && type_has_mode_precision_p (TREE_TYPE (@1))
8347 && type_has_mode_precision_p (type)
8348 /* The inner conversion must be a widening conversion. */
8349 && TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (TREE_TYPE (@0))
8350 && types_match (@0, @1)
8351 && (tree_int_cst_min_precision (@4, TYPE_SIGN (TREE_TYPE (@0)))
8352 <= TYPE_PRECISION (TREE_TYPE (@0)))
8353 && (wi::to_wide (@4)
8354 & wi::mask (TYPE_PRECISION (TREE_TYPE (@0)),
8355 true, TYPE_PRECISION (type))) == 0)
8356 (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
8357 (with { tree ntype = TREE_TYPE (@0); }
8358 (convert (bit_and (op @0 @1) (convert:ntype @4))))
8359 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
8360 (convert (bit_and (op (convert:utype @0) (convert:utype @1))
8361 (convert:utype @4))))))))
8363 /* Transform (@0 < @1 and @0 < @2) to use min,
8364 (@0 > @1 and @0 > @2) to use max */
8365 (for logic (bit_and bit_and bit_and bit_and bit_ior bit_ior bit_ior bit_ior)
8366 op (lt le gt ge lt le gt ge )
8367 ext (min min max max max max min min )
8369 (logic (op:cs @0 @1) (op:cs @0 @2))
8370 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
8371 && TREE_CODE (@0) != INTEGER_CST)
8372 (op @0 (ext @1 @2)))))
8374 /* Max<bool0, bool1> -> bool0 | bool1
8375 Min<bool0, bool1> -> bool0 & bool1 */
8377 logic (bit_ior bit_and)
8379 (op zero_one_valued_p@0 zero_one_valued_p@1)
8382 /* signbit(x) != 0 ? -x : x -> abs(x)
8383 signbit(x) == 0 ? -x : x -> -abs(x) */
8387 (cond (neeq (sign @0) integer_zerop) (negate @0) @0)
8388 (if (neeq == NE_EXPR)
8390 (negate (abs @0))))))
8393 /* signbit(x) -> 0 if x is nonnegative. */
8394 (SIGNBIT tree_expr_nonnegative_p@0)
8395 { integer_zero_node; })
8398 /* signbit(x) -> x<0 if x doesn't have signed zeros. */
8400 (if (!HONOR_SIGNED_ZEROS (@0))
8401 (convert (lt @0 { build_real (TREE_TYPE (@0), dconst0); }))))
8403 /* Transform comparisons of the form X +- C1 CMP C2 to X CMP C2 -+ C1. */
8405 (for op (plus minus)
8408 (cmp (op@3 @0 INTEGER_CST@1) INTEGER_CST@2)
8409 (if (!TREE_OVERFLOW (@1) && !TREE_OVERFLOW (@2)
8410 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0))
8411 && !TYPE_OVERFLOW_TRAPS (TREE_TYPE (@0))
8412 && !TYPE_SATURATING (TREE_TYPE (@0)))
8413 (with { tree res = int_const_binop (rop, @2, @1); }
8414 (if (TREE_OVERFLOW (res)
8415 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
8416 { constant_boolean_node (cmp == NE_EXPR, type); }
8417 (if (single_use (@3))
8418 (cmp @0 { TREE_OVERFLOW (res)
8419 ? drop_tree_overflow (res) : res; }))))))))
8420 (for cmp (lt le gt ge)
8421 (for op (plus minus)
8424 (cmp (op@3 @0 INTEGER_CST@1) INTEGER_CST@2)
8425 (if (!TREE_OVERFLOW (@1) && !TREE_OVERFLOW (@2)
8426 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
8427 (with { tree res = int_const_binop (rop, @2, @1); }
8428 (if (TREE_OVERFLOW (res))
8430 fold_overflow_warning (("assuming signed overflow does not occur "
8431 "when simplifying conditional to constant"),
8432 WARN_STRICT_OVERFLOW_CONDITIONAL);
8433 bool less = cmp == LE_EXPR || cmp == LT_EXPR;
8434 /* wi::ges_p (@2, 0) should be sufficient for a signed type. */
8435 bool ovf_high = wi::lt_p (wi::to_wide (@1), 0,
8436 TYPE_SIGN (TREE_TYPE (@1)))
8437 != (op == MINUS_EXPR);
8438 constant_boolean_node (less == ovf_high, type);
8440 (if (single_use (@3))
8443 fold_overflow_warning (("assuming signed overflow does not occur "
8444 "when changing X +- C1 cmp C2 to "
8446 WARN_STRICT_OVERFLOW_COMPARISON);
8448 (cmp @0 { res; })))))))))
8450 /* Canonicalizations of BIT_FIELD_REFs. */
8453 (BIT_FIELD_REF (BIT_FIELD_REF @0 @1 @2) @3 @4)
8454 (BIT_FIELD_REF @0 @3 { const_binop (PLUS_EXPR, bitsizetype, @2, @4); }))
8457 (BIT_FIELD_REF (view_convert @0) @1 @2)
8458 (if (! INTEGRAL_TYPE_P (TREE_TYPE (@0))
8459 || type_has_mode_precision_p (TREE_TYPE (@0)))
8460 (BIT_FIELD_REF @0 @1 @2)))
8463 (BIT_FIELD_REF @0 @1 integer_zerop)
8464 (if (tree_int_cst_equal (@1, TYPE_SIZE (TREE_TYPE (@0))))
8468 (BIT_FIELD_REF @0 @1 @2)
8470 (if (TREE_CODE (TREE_TYPE (@0)) == COMPLEX_TYPE
8471 && tree_int_cst_equal (@1, TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0)))))
8473 (if (integer_zerop (@2))
8474 (view_convert (realpart @0)))
8475 (if (tree_int_cst_equal (@2, TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0)))))
8476 (view_convert (imagpart @0)))))
8477 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
8478 && INTEGRAL_TYPE_P (type)
8479 /* On GIMPLE this should only apply to register arguments. */
8480 && (! GIMPLE || is_gimple_reg (@0))
8481 /* A bit-field-ref that referenced the full argument can be stripped. */
8482 && ((compare_tree_int (@1, TYPE_PRECISION (TREE_TYPE (@0))) == 0
8483 && integer_zerop (@2))
8484 /* Low-parts can be reduced to integral conversions.
8485 ??? The following doesn't work for PDP endian. */
8486 || (BYTES_BIG_ENDIAN == WORDS_BIG_ENDIAN
8487 /* But only do this after vectorization. */
8488 && canonicalize_math_after_vectorization_p ()
8489 /* Don't even think about BITS_BIG_ENDIAN. */
8490 && TYPE_PRECISION (TREE_TYPE (@0)) % BITS_PER_UNIT == 0
8491 && TYPE_PRECISION (type) % BITS_PER_UNIT == 0
8492 && compare_tree_int (@2, (BYTES_BIG_ENDIAN
8493 ? (TYPE_PRECISION (TREE_TYPE (@0))
8494 - TYPE_PRECISION (type))
8498 /* Simplify vector extracts. */
8501 (BIT_FIELD_REF CONSTRUCTOR@0 @1 @2)
8502 (if (VECTOR_TYPE_P (TREE_TYPE (@0))
8503 && tree_fits_uhwi_p (TYPE_SIZE (type))
8504 && ((tree_to_uhwi (TYPE_SIZE (type))
8505 == tree_to_uhwi (TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0)))))
8506 || (VECTOR_TYPE_P (type)
8507 && (tree_to_uhwi (TYPE_SIZE (TREE_TYPE (type)))
8508 == tree_to_uhwi (TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0))))))))
8511 tree ctor = (TREE_CODE (@0) == SSA_NAME
8512 ? gimple_assign_rhs1 (SSA_NAME_DEF_STMT (@0)) : @0);
8513 tree eltype = TREE_TYPE (TREE_TYPE (ctor));
8514 unsigned HOST_WIDE_INT width = tree_to_uhwi (TYPE_SIZE (eltype));
8515 unsigned HOST_WIDE_INT n = tree_to_uhwi (@1);
8516 unsigned HOST_WIDE_INT idx = tree_to_uhwi (@2);
8519 && (idx % width) == 0
8521 && known_le ((idx + n) / width,
8522 TYPE_VECTOR_SUBPARTS (TREE_TYPE (ctor))))
8527 /* Constructor elements can be subvectors. */
8529 if (CONSTRUCTOR_NELTS (ctor) != 0)
8531 tree cons_elem = TREE_TYPE (CONSTRUCTOR_ELT (ctor, 0)->value);
8532 if (TREE_CODE (cons_elem) == VECTOR_TYPE)
8533 k = TYPE_VECTOR_SUBPARTS (cons_elem);
8535 unsigned HOST_WIDE_INT elt, count, const_k;
8538 /* We keep an exact subset of the constructor elements. */
8539 (if (multiple_p (idx, k, &elt) && multiple_p (n, k, &count))
8540 (if (CONSTRUCTOR_NELTS (ctor) == 0)
8541 { build_zero_cst (type); }
8543 (if (elt < CONSTRUCTOR_NELTS (ctor))
8544 (view_convert { CONSTRUCTOR_ELT (ctor, elt)->value; })
8545 { build_zero_cst (type); })
8546 /* We don't want to emit new CTORs unless the old one goes away.
8547 ??? Eventually allow this if the CTOR ends up constant or
8549 (if (single_use (@0))
8552 vec<constructor_elt, va_gc> *vals;
8553 vec_alloc (vals, count);
8554 bool constant_p = true;
8556 for (unsigned i = 0;
8557 i < count && elt + i < CONSTRUCTOR_NELTS (ctor); ++i)
8559 tree e = CONSTRUCTOR_ELT (ctor, elt + i)->value;
8560 CONSTRUCTOR_APPEND_ELT (vals, NULL_TREE, e);
8561 if (!CONSTANT_CLASS_P (e))
8564 tree evtype = (types_match (TREE_TYPE (type),
8565 TREE_TYPE (TREE_TYPE (ctor)))
8567 : build_vector_type (TREE_TYPE (TREE_TYPE (ctor)),
8569 /* We used to build a CTOR in the non-constant case here
8570 but that's not a GIMPLE value. We'd have to expose this
8571 operation somehow so the code generation can properly
8572 split it out to a separate stmt. */
8573 res = (constant_p ? build_vector_from_ctor (evtype, vals)
8574 : (GIMPLE ? NULL_TREE : build_constructor (evtype, vals)));
8577 (view_convert { res; })))))))
8578 /* The bitfield references a single constructor element. */
8579 (if (k.is_constant (&const_k)
8580 && idx + n <= (idx / const_k + 1) * const_k)
8582 (if (CONSTRUCTOR_NELTS (ctor) <= idx / const_k)
8583 { build_zero_cst (type); })
8585 (view_convert { CONSTRUCTOR_ELT (ctor, idx / const_k)->value; }))
8586 (BIT_FIELD_REF { CONSTRUCTOR_ELT (ctor, idx / const_k)->value; }
8587 @1 { bitsize_int ((idx % const_k) * width); })))))))))
8589 /* Simplify a bit extraction from a bit insertion for the cases with
8590 the inserted element fully covering the extraction or the insertion
8591 not touching the extraction. */
8593 (BIT_FIELD_REF (bit_insert @0 @1 @ipos) @rsize @rpos)
8596 unsigned HOST_WIDE_INT isize;
8597 if (INTEGRAL_TYPE_P (TREE_TYPE (@1)))
8598 isize = TYPE_PRECISION (TREE_TYPE (@1));
8600 isize = tree_to_uhwi (TYPE_SIZE (TREE_TYPE (@1)));
8603 (if ((!INTEGRAL_TYPE_P (TREE_TYPE (@1))
8604 || type_has_mode_precision_p (TREE_TYPE (@1)))
8605 && wi::leu_p (wi::to_wide (@ipos), wi::to_wide (@rpos))
8606 && wi::leu_p (wi::to_wide (@rpos) + wi::to_wide (@rsize),
8607 wi::to_wide (@ipos) + isize))
8608 (BIT_FIELD_REF @1 @rsize { wide_int_to_tree (bitsizetype,
8610 - wi::to_wide (@ipos)); }))
8611 (if (wi::eq_p (wi::to_wide (@ipos), wi::to_wide (@rpos))
8612 && compare_tree_int (@rsize, isize) == 0)
8614 (if (wi::geu_p (wi::to_wide (@ipos),
8615 wi::to_wide (@rpos) + wi::to_wide (@rsize))
8616 || wi::geu_p (wi::to_wide (@rpos),
8617 wi::to_wide (@ipos) + isize))
8618 (BIT_FIELD_REF @0 @rsize @rpos)))))
8620 /* Simplify vector inserts of other vector extracts to a permute. */
8622 (bit_insert @0 (BIT_FIELD_REF@2 @1 @rsize @rpos) @ipos)
8623 (if (VECTOR_TYPE_P (type)
8624 && (VECTOR_MODE_P (TYPE_MODE (type))
8625 || optimize_vectors_before_lowering_p ())
8626 && types_match (@0, @1)
8627 && types_match (TREE_TYPE (TREE_TYPE (@0)), TREE_TYPE (@2))
8628 && TYPE_VECTOR_SUBPARTS (type).is_constant ()
8629 && multiple_p (wi::to_poly_offset (@rpos),
8630 wi::to_poly_offset (TYPE_SIZE (TREE_TYPE (type)))))
8633 unsigned HOST_WIDE_INT elsz
8634 = tree_to_uhwi (TYPE_SIZE (TREE_TYPE (TREE_TYPE (@1))));
8635 poly_uint64 relt = exact_div (tree_to_poly_uint64 (@rpos), elsz);
8636 poly_uint64 ielt = exact_div (tree_to_poly_uint64 (@ipos), elsz);
8637 unsigned nunits = TYPE_VECTOR_SUBPARTS (type).to_constant ();
8638 vec_perm_builder builder;
8639 builder.new_vector (nunits, nunits, 1);
8640 for (unsigned i = 0; i < nunits; ++i)
8641 builder.quick_push (known_eq (ielt, i) ? nunits + relt : i);
8642 vec_perm_indices sel (builder, 2, nunits);
8644 (if (!VECTOR_MODE_P (TYPE_MODE (type))
8645 || can_vec_perm_const_p (TYPE_MODE (type), TYPE_MODE (type), sel, false))
8646 (vec_perm @0 @1 { vec_perm_indices_to_tree
8647 (build_vector_type (ssizetype, nunits), sel); })))))
8649 (if (canonicalize_math_after_vectorization_p ())
8652 (fmas:c (negate @0) @1 @2)
8653 (IFN_FNMA @0 @1 @2))
8655 (fmas @0 @1 (negate @2))
8658 (fmas:c (negate @0) @1 (negate @2))
8659 (IFN_FNMS @0 @1 @2))
8661 (negate (fmas@3 @0 @1 @2))
8662 (if (single_use (@3))
8663 (IFN_FNMS @0 @1 @2))))
8666 (IFN_FMS:c (negate @0) @1 @2)
8667 (IFN_FNMS @0 @1 @2))
8669 (IFN_FMS @0 @1 (negate @2))
8672 (IFN_FMS:c (negate @0) @1 (negate @2))
8673 (IFN_FNMA @0 @1 @2))
8675 (negate (IFN_FMS@3 @0 @1 @2))
8676 (if (single_use (@3))
8677 (IFN_FNMA @0 @1 @2)))
8680 (IFN_FNMA:c (negate @0) @1 @2)
8683 (IFN_FNMA @0 @1 (negate @2))
8684 (IFN_FNMS @0 @1 @2))
8686 (IFN_FNMA:c (negate @0) @1 (negate @2))
8689 (negate (IFN_FNMA@3 @0 @1 @2))
8690 (if (single_use (@3))
8691 (IFN_FMS @0 @1 @2)))
8694 (IFN_FNMS:c (negate @0) @1 @2)
8697 (IFN_FNMS @0 @1 (negate @2))
8698 (IFN_FNMA @0 @1 @2))
8700 (IFN_FNMS:c (negate @0) @1 (negate @2))
8703 (negate (IFN_FNMS@3 @0 @1 @2))
8704 (if (single_use (@3))
8705 (IFN_FMA @0 @1 @2))))
8707 /* CLZ simplifications. */
8712 (op (clz:s@2 @0) INTEGER_CST@1)
8713 (if (integer_zerop (@1) && single_use (@2))
8714 /* clz(X) == 0 is (int)X < 0 and clz(X) != 0 is (int)X >= 0. */
8715 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
8716 (cmp (convert:stype @0) { build_zero_cst (stype); }))
8717 /* clz(X) == (prec-1) is X == 1 and clz(X) != (prec-1) is X != 1. */
8718 (if (wi::to_wide (@1) == TYPE_PRECISION (TREE_TYPE (@0)) - 1)
8719 (op @0 { build_one_cst (TREE_TYPE (@0)); }))))))
8723 (op (IFN_CLZ:s@2 @0 @3) INTEGER_CST@1)
8724 (if (integer_zerop (@1) && single_use (@2))
8725 /* clz(X) == 0 is (int)X < 0 and clz(X) != 0 is (int)X >= 0. */
8726 (with { tree type0 = TREE_TYPE (@0);
8727 tree stype = signed_type_for (TREE_TYPE (@0));
8728 /* Punt if clz(0) == 0. */
8729 if (integer_zerop (@3))
8733 (cmp (convert:stype @0) { build_zero_cst (stype); })))
8734 /* clz(X) == (prec-1) is X == 1 and clz(X) != (prec-1) is X != 1. */
8735 (with { bool ok = true;
8736 tree type0 = TREE_TYPE (@0);
8737 /* Punt if clz(0) == prec - 1. */
8738 if (wi::to_widest (@3) == TYPE_PRECISION (type0) - 1)
8741 (if (ok && wi::to_wide (@1) == (TYPE_PRECISION (type0) - 1))
8742 (op @0 { build_one_cst (type0); }))))))
8744 /* CTZ simplifications. */
8746 (for op (ge gt le lt)
8749 /* __builtin_ctz (x) >= C -> (x & ((1 << C) - 1)) == 0. */
8750 (op (ctz:s @0) INTEGER_CST@1)
8751 (with { bool ok = true;
8752 HOST_WIDE_INT val = 0;
8753 if (!tree_fits_shwi_p (@1))
8757 val = tree_to_shwi (@1);
8758 /* Canonicalize to >= or <. */
8759 if (op == GT_EXPR || op == LE_EXPR)
8761 if (val == HOST_WIDE_INT_MAX)
8767 tree type0 = TREE_TYPE (@0);
8768 int prec = TYPE_PRECISION (type0);
8770 (if (ok && prec <= MAX_FIXED_MODE_SIZE)
8772 { constant_boolean_node (cmp == EQ_EXPR ? true : false, type); }
8774 { constant_boolean_node (cmp == EQ_EXPR ? false : true, type); }
8775 (cmp (bit_and @0 { wide_int_to_tree (type0,
8776 wi::mask (val, false, prec)); })
8777 { build_zero_cst (type0); })))))))
8780 /* __builtin_ctz (x) == C -> (x & ((1 << (C + 1)) - 1)) == (1 << C). */
8781 (op (ctz:s @0) INTEGER_CST@1)
8782 (with { tree type0 = TREE_TYPE (@0);
8783 int prec = TYPE_PRECISION (type0);
8785 (if (prec <= MAX_FIXED_MODE_SIZE)
8786 (if (tree_int_cst_sgn (@1) < 0 || wi::to_widest (@1) >= prec)
8787 { constant_boolean_node (op == EQ_EXPR ? false : true, type); }
8788 (op (bit_and @0 { wide_int_to_tree (type0,
8789 wi::mask (tree_to_uhwi (@1) + 1,
8791 { wide_int_to_tree (type0,
8792 wi::shifted_mask (tree_to_uhwi (@1), 1,
8793 false, prec)); })))))))
8794 (for op (ge gt le lt)
8797 /* __builtin_ctz (x) >= C -> (x & ((1 << C) - 1)) == 0. */
8798 (op (IFN_CTZ:s @0 @2) INTEGER_CST@1)
8799 (with { bool ok = true;
8800 HOST_WIDE_INT val = 0;
8801 if (!tree_fits_shwi_p (@1))
8805 val = tree_to_shwi (@1);
8806 /* Canonicalize to >= or <. */
8807 if (op == GT_EXPR || op == LE_EXPR)
8809 if (val == HOST_WIDE_INT_MAX)
8815 HOST_WIDE_INT zero_val = tree_to_shwi (@2);
8816 tree type0 = TREE_TYPE (@0);
8817 int prec = TYPE_PRECISION (type0);
8818 if (prec > MAX_FIXED_MODE_SIZE)
8822 (if (ok && zero_val >= val)
8823 { constant_boolean_node (cmp == EQ_EXPR ? true : false, type); })
8825 (if (ok && zero_val < val)
8826 { constant_boolean_node (cmp == EQ_EXPR ? false : true, type); })
8827 (if (ok && (zero_val < 0 || zero_val >= prec))
8828 (cmp (bit_and @0 { wide_int_to_tree (type0,
8829 wi::mask (val, false, prec)); })
8830 { build_zero_cst (type0); })))))))
8833 /* __builtin_ctz (x) == C -> (x & ((1 << (C + 1)) - 1)) == (1 << C). */
8834 (op (IFN_CTZ:s @0 @2) INTEGER_CST@1)
8835 (with { HOST_WIDE_INT zero_val = tree_to_shwi (@2);
8836 tree type0 = TREE_TYPE (@0);
8837 int prec = TYPE_PRECISION (type0);
8839 (if (prec <= MAX_FIXED_MODE_SIZE)
8840 (if (tree_int_cst_sgn (@1) < 0 || wi::to_widest (@1) >= prec)
8841 (if (zero_val != wi::to_widest (@1))
8842 { constant_boolean_node (op == EQ_EXPR ? false : true, type); })
8843 (if (zero_val < 0 || zero_val >= prec)
8844 (op (bit_and @0 { wide_int_to_tree (type0,
8845 wi::mask (tree_to_uhwi (@1) + 1,
8847 { wide_int_to_tree (type0,
8848 wi::shifted_mask (tree_to_uhwi (@1), 1,
8849 false, prec)); })))))))
8852 /* ctz(ext(X)) == ctz(X). Valid just for the UB at zero cases though. */
8854 (CTZ (convert@1 @0))
8855 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
8856 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
8857 && TYPE_PRECISION (TREE_TYPE (@1)) > TYPE_PRECISION (TREE_TYPE (@0)))
8858 (with { combined_fn cfn = CFN_LAST;
8859 tree type0 = TREE_TYPE (@0);
8860 if (TREE_CODE (type0) == BITINT_TYPE)
8862 if (TYPE_PRECISION (type0) > MAX_FIXED_MODE_SIZE)
8866 = build_nonstandard_integer_type (TYPE_PRECISION (type0),
8869 type0 = unsigned_type_for (type0);
8871 && direct_internal_fn_supported_p (IFN_CTZ, type0,
8875 && TYPE_PRECISION (TREE_TYPE (@1)) > BITS_PER_WORD
8876 && !direct_internal_fn_supported_p (IFN_CTZ,
8880 if (TYPE_PRECISION (type0)
8881 == TYPE_PRECISION (unsigned_type_node))
8882 cfn = CFN_BUILT_IN_CTZ;
8883 else if (TYPE_PRECISION (type0)
8884 == TYPE_PRECISION (long_long_unsigned_type_node))
8885 cfn = CFN_BUILT_IN_CTZLL;
8887 (if (cfn == CFN_CTZ)
8888 (IFN_CTZ (convert:type0 @0))
8889 (if (cfn == CFN_BUILT_IN_CTZ)
8890 (BUILT_IN_CTZ (convert:type0 @0))
8891 (if (cfn == CFN_BUILT_IN_CTZLL)
8892 (BUILT_IN_CTZLL (convert:type0 @0))))))))
8895 /* POPCOUNT simplifications. */
8896 /* popcount(X) + popcount(Y) is popcount(X|Y) when X&Y must be zero. */
8898 (plus (POPCOUNT:s @0) (POPCOUNT:s @1))
8899 (if (INTEGRAL_TYPE_P (type)
8900 && (wi::bit_and (widest_int::from (tree_nonzero_bits (@0), UNSIGNED),
8901 widest_int::from (tree_nonzero_bits (@1), UNSIGNED))
8903 (with { tree utype = TREE_TYPE (@0);
8904 if (TYPE_PRECISION (utype) < TYPE_PRECISION (TREE_TYPE (@1)))
8905 utype = TREE_TYPE (@1); }
8906 (POPCOUNT (bit_ior (convert:utype @0) (convert:utype @1))))))
8908 /* popcount(X) == 0 is X == 0, and related (in)equalities. */
8909 (for popcount (POPCOUNT)
8910 (for cmp (le eq ne gt)
8913 (cmp (popcount @0) integer_zerop)
8914 (rep @0 { build_zero_cst (TREE_TYPE (@0)); }))))
8916 /* popcount(bswap(x)) is popcount(x). */
8917 (for popcount (POPCOUNT)
8918 (for bswap (BUILT_IN_BSWAP16 BUILT_IN_BSWAP32
8919 BUILT_IN_BSWAP64 BUILT_IN_BSWAP128)
8921 (popcount (convert?@0 (bswap:s@1 @2)))
8922 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
8923 && INTEGRAL_TYPE_P (TREE_TYPE (@1)))
8924 (with { tree type0 = TREE_TYPE (@0);
8925 tree type1 = TREE_TYPE (@1);
8926 unsigned int prec0 = TYPE_PRECISION (type0);
8927 unsigned int prec1 = TYPE_PRECISION (type1); }
8928 (if (prec0 == prec1 || (prec0 > prec1 && TYPE_UNSIGNED (type1)))
8929 (popcount (convert:type0 (convert:type1 @2)))))))))
8931 /* popcount(rotate(X Y)) is popcount(X). */
8932 (for popcount (POPCOUNT)
8933 (for rot (lrotate rrotate)
8935 (popcount (convert?@0 (rot:s@1 @2 @3)))
8936 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
8937 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
8938 && (GIMPLE || !TREE_SIDE_EFFECTS (@3)))
8939 (with { tree type0 = TREE_TYPE (@0);
8940 tree type1 = TREE_TYPE (@1);
8941 unsigned int prec0 = TYPE_PRECISION (type0);
8942 unsigned int prec1 = TYPE_PRECISION (type1); }
8943 (if (prec0 == prec1 || (prec0 > prec1 && TYPE_UNSIGNED (type1)))
8944 (popcount (convert:type0 @2))))))))
8946 /* Canonicalize POPCOUNT(x)&1 as PARITY(X). */
8948 (bit_and (POPCOUNT @0) integer_onep)
8951 /* popcount(X&Y) + popcount(X|Y) is popcount(x) + popcount(Y). */
8953 (plus:c (POPCOUNT:s (bit_and:s @0 @1)) (POPCOUNT:s (bit_ior:cs @0 @1)))
8954 (plus (POPCOUNT:type @0) (POPCOUNT:type @1)))
8956 /* popcount(X) + popcount(Y) - popcount(X&Y) is popcount(X|Y). */
8957 /* popcount(X) + popcount(Y) - popcount(X|Y) is popcount(X&Y). */
8958 (for popcount (POPCOUNT)
8959 (for log1 (bit_and bit_ior)
8960 log2 (bit_ior bit_and)
8962 (minus (plus:s (popcount:s @0) (popcount:s @1))
8963 (popcount:s (log1:cs @0 @1)))
8964 (popcount (log2 @0 @1)))
8966 (plus:c (minus:s (popcount:s @0) (popcount:s (log1:cs @0 @1)))
8968 (popcount (log2 @0 @1)))))
8971 /* popcount(zext(X)) == popcount(X). */
8973 (POPCOUNT (convert@1 @0))
8974 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
8975 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
8976 && TYPE_UNSIGNED (TREE_TYPE (@0))
8977 && TYPE_PRECISION (TREE_TYPE (@1)) > TYPE_PRECISION (TREE_TYPE (@0)))
8978 (with { combined_fn cfn = CFN_LAST;
8979 tree type0 = TREE_TYPE (@0);
8980 if (TREE_CODE (type0) == BITINT_TYPE)
8982 if (TYPE_PRECISION (type0) > MAX_FIXED_MODE_SIZE)
8986 = build_nonstandard_integer_type (TYPE_PRECISION (type0),
8990 && direct_internal_fn_supported_p (IFN_POPCOUNT, type0,
8994 && TYPE_PRECISION (TREE_TYPE (@1)) > BITS_PER_WORD
8995 && !direct_internal_fn_supported_p (IFN_POPCOUNT,
8999 if (TYPE_PRECISION (type0)
9000 == TYPE_PRECISION (unsigned_type_node))
9001 cfn = CFN_BUILT_IN_POPCOUNT;
9002 else if (TYPE_PRECISION (type0)
9003 == TYPE_PRECISION (long_long_unsigned_type_node))
9004 cfn = CFN_BUILT_IN_POPCOUNTLL;
9006 (if (cfn == CFN_POPCOUNT)
9007 (IFN_POPCOUNT (convert:type0 @0))
9008 (if (cfn == CFN_BUILT_IN_POPCOUNT)
9009 (BUILT_IN_POPCOUNT (convert:type0 @0))
9010 (if (cfn == CFN_BUILT_IN_POPCOUNTLL)
9011 (BUILT_IN_POPCOUNTLL (convert:type0 @0))))))))
9014 /* PARITY simplifications. */
9015 /* parity(~X) is parity(X). */
9017 (PARITY (bit_not @0))
9020 /* parity(bswap(x)) is parity(x). */
9021 (for parity (PARITY)
9022 (for bswap (BUILT_IN_BSWAP16 BUILT_IN_BSWAP32
9023 BUILT_IN_BSWAP64 BUILT_IN_BSWAP128)
9025 (parity (convert?@0 (bswap:s@1 @2)))
9026 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
9027 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
9028 && TYPE_PRECISION (TREE_TYPE (@0))
9029 >= TYPE_PRECISION (TREE_TYPE (@1)))
9030 (with { tree type0 = TREE_TYPE (@0);
9031 tree type1 = TREE_TYPE (@1); }
9032 (parity (convert:type0 (convert:type1 @2))))))))
9034 /* parity(rotate(X Y)) is parity(X). */
9035 (for parity (PARITY)
9036 (for rot (lrotate rrotate)
9038 (parity (convert?@0 (rot:s@1 @2 @3)))
9039 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
9040 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
9041 && (GIMPLE || !TREE_SIDE_EFFECTS (@3))
9042 && TYPE_PRECISION (TREE_TYPE (@0))
9043 >= TYPE_PRECISION (TREE_TYPE (@1)))
9044 (with { tree type0 = TREE_TYPE (@0); }
9045 (parity (convert:type0 @2)))))))
9047 /* parity(X)^parity(Y) is parity(X^Y). */
9049 (bit_xor (PARITY:s @0) (PARITY:s @1))
9050 (if (types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
9051 (PARITY (bit_xor @0 @1))
9052 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
9053 && INTEGRAL_TYPE_P (TREE_TYPE (@1)))
9054 (with { tree utype = TREE_TYPE (@0);
9055 if (TYPE_PRECISION (utype) < TYPE_PRECISION (TREE_TYPE (@1)))
9056 utype = TREE_TYPE (@1); }
9057 (PARITY (bit_xor (convert:utype @0) (convert:utype @1)))))))
9060 /* parity(zext(X)) == parity(X). */
9061 /* parity(sext(X)) == parity(X) if the difference in precision is even. */
9063 (PARITY (convert@1 @0))
9064 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
9065 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
9066 && TYPE_PRECISION (TREE_TYPE (@1)) > TYPE_PRECISION (TREE_TYPE (@0))
9067 && (TYPE_UNSIGNED (TREE_TYPE (@0))
9068 || ((TYPE_PRECISION (TREE_TYPE (@1))
9069 - TYPE_PRECISION (TREE_TYPE (@0))) & 1) == 0))
9070 (with { combined_fn cfn = CFN_LAST;
9071 tree type0 = TREE_TYPE (@0);
9072 if (TREE_CODE (type0) == BITINT_TYPE)
9074 if (TYPE_PRECISION (type0) > MAX_FIXED_MODE_SIZE)
9078 = build_nonstandard_integer_type (TYPE_PRECISION (type0),
9081 type0 = unsigned_type_for (type0);
9083 && direct_internal_fn_supported_p (IFN_PARITY, type0,
9087 && TYPE_PRECISION (TREE_TYPE (@1)) > BITS_PER_WORD
9088 && !direct_internal_fn_supported_p (IFN_PARITY,
9092 if (TYPE_PRECISION (type0)
9093 == TYPE_PRECISION (unsigned_type_node))
9094 cfn = CFN_BUILT_IN_PARITY;
9095 else if (TYPE_PRECISION (type0)
9096 == TYPE_PRECISION (long_long_unsigned_type_node))
9097 cfn = CFN_BUILT_IN_PARITYLL;
9099 (if (cfn == CFN_PARITY)
9100 (IFN_PARITY (convert:type0 @0))
9101 (if (cfn == CFN_BUILT_IN_PARITY)
9102 (BUILT_IN_PARITY (convert:type0 @0))
9103 (if (cfn == CFN_BUILT_IN_PARITYLL)
9104 (BUILT_IN_PARITYLL (convert:type0 @0))))))))
9107 /* a != 0 ? FUN(a) : 0 -> Fun(a) for some builtin functions. */
9108 (for func (POPCOUNT BSWAP FFS PARITY)
9110 (cond (ne @0 integer_zerop@1) (func@3 (convert? @0)) integer_zerop@2)
9113 /* a != 0 ? FUN(a) : CST -> Fun(a) for some CLRSB builtins
9114 where CST is precision-1. */
9117 (cond (ne @0 integer_zerop@1) (func@4 (convert?@3 @0)) INTEGER_CST@2)
9118 (if (wi::to_widest (@2) == TYPE_PRECISION (TREE_TYPE (@3)) - 1)
9122 /* a != 0 ? CLZ(a) : CST -> .CLZ(a) where CST is the result of the internal function for 0. */
9125 (cond (ne @0 integer_zerop@1) (func (convert?@3 @0)) INTEGER_CST@2)
9127 internal_fn ifn = IFN_LAST;
9128 if (TREE_CODE (TREE_TYPE (@3)) == BITINT_TYPE)
9130 if (tree_fits_shwi_p (@2))
9132 HOST_WIDE_INT valw = tree_to_shwi (@2);
9133 if ((int) valw == valw)
9140 else if (direct_internal_fn_supported_p (IFN_CLZ, TREE_TYPE (@3),
9142 && CLZ_DEFINED_VALUE_AT_ZERO
9143 (SCALAR_INT_TYPE_MODE (TREE_TYPE (@3)), val) == 2)
9146 (if (ifn == IFN_CLZ && wi::to_widest (@2) == val)
9149 (cond (ne @0 integer_zerop@1) (IFN_CLZ (convert?@3 @0) INTEGER_CST@2) @2)
9151 internal_fn ifn = IFN_LAST;
9152 if (TREE_CODE (TREE_TYPE (@3)) == BITINT_TYPE)
9154 else if (direct_internal_fn_supported_p (IFN_CLZ, TREE_TYPE (@3),
9158 (if (ifn == IFN_CLZ)
9161 /* a != 0 ? CTZ(a) : CST -> .CTZ(a) where CST is the result of the internal function for 0. */
9164 (cond (ne @0 integer_zerop@1) (func (convert?@3 @0)) INTEGER_CST@2)
9166 internal_fn ifn = IFN_LAST;
9167 if (TREE_CODE (TREE_TYPE (@3)) == BITINT_TYPE)
9169 if (tree_fits_shwi_p (@2))
9171 HOST_WIDE_INT valw = tree_to_shwi (@2);
9172 if ((int) valw == valw)
9179 else if (direct_internal_fn_supported_p (IFN_CTZ, TREE_TYPE (@3),
9181 && CTZ_DEFINED_VALUE_AT_ZERO
9182 (SCALAR_INT_TYPE_MODE (TREE_TYPE (@3)), val) == 2)
9185 (if (ifn == IFN_CTZ && wi::to_widest (@2) == val)
9188 (cond (ne @0 integer_zerop@1) (IFN_CTZ (convert?@3 @0) INTEGER_CST@2) @2)
9190 internal_fn ifn = IFN_LAST;
9191 if (TREE_CODE (TREE_TYPE (@3)) == BITINT_TYPE)
9193 else if (direct_internal_fn_supported_p (IFN_CTZ, TREE_TYPE (@3),
9197 (if (ifn == IFN_CTZ)
9201 /* Common POPCOUNT/PARITY simplifications. */
9202 /* popcount(X&C1) is (X>>C2)&1 when C1 == 1<<C2. Same for parity(X&C1). */
9203 (for pfun (POPCOUNT PARITY)
9206 (if (INTEGRAL_TYPE_P (type))
9207 (with { wide_int nz = tree_nonzero_bits (@0); }
9211 (if (wi::popcount (nz) == 1)
9212 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
9213 (convert (rshift:utype (convert:utype @0)
9214 { build_int_cst (integer_type_node,
9215 wi::ctz (nz)); })))))))))
9218 /* 64- and 32-bits branchless implementations of popcount are detected:
9220 int popcount64c (uint64_t x)
9222 x -= (x >> 1) & 0x5555555555555555ULL;
9223 x = (x & 0x3333333333333333ULL) + ((x >> 2) & 0x3333333333333333ULL);
9224 x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0fULL;
9225 return (x * 0x0101010101010101ULL) >> 56;
9228 int popcount32c (uint32_t x)
9230 x -= (x >> 1) & 0x55555555;
9231 x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
9232 x = (x + (x >> 4)) & 0x0f0f0f0f;
9233 return (x * 0x01010101) >> 24;
9240 (rshift @8 INTEGER_CST@5)
9242 (bit_and @6 INTEGER_CST@7)
9246 (bit_and (rshift @0 INTEGER_CST@4) INTEGER_CST@11))
9252 /* Check constants and optab. */
9253 (with { unsigned prec = TYPE_PRECISION (type);
9254 int shift = (64 - prec) & 63;
9255 unsigned HOST_WIDE_INT c1
9256 = HOST_WIDE_INT_UC (0x0101010101010101) >> shift;
9257 unsigned HOST_WIDE_INT c2
9258 = HOST_WIDE_INT_UC (0x0F0F0F0F0F0F0F0F) >> shift;
9259 unsigned HOST_WIDE_INT c3
9260 = HOST_WIDE_INT_UC (0x3333333333333333) >> shift;
9261 unsigned HOST_WIDE_INT c4
9262 = HOST_WIDE_INT_UC (0x5555555555555555) >> shift;
9267 && TYPE_UNSIGNED (type)
9268 && integer_onep (@4)
9269 && wi::to_widest (@10) == 2
9270 && wi::to_widest (@5) == 4
9271 && wi::to_widest (@1) == prec - 8
9272 && tree_to_uhwi (@2) == c1
9273 && tree_to_uhwi (@3) == c2
9274 && tree_to_uhwi (@9) == c3
9275 && tree_to_uhwi (@7) == c3
9276 && tree_to_uhwi (@11) == c4)
9277 (if (direct_internal_fn_supported_p (IFN_POPCOUNT, type,
9279 (convert (IFN_POPCOUNT:type @0))
9280 /* Try to do popcount in two halves. PREC must be at least
9281 five bits for this to work without extension before adding. */
9283 tree half_type = NULL_TREE;
9284 opt_machine_mode m = mode_for_size ((prec + 1) / 2, MODE_INT, 1);
9287 && m.require () != TYPE_MODE (type))
9289 half_prec = GET_MODE_PRECISION (as_a <scalar_int_mode> (m));
9290 half_type = build_nonstandard_integer_type (half_prec, 1);
9292 gcc_assert (half_prec > 2);
9294 (if (half_type != NULL_TREE
9295 && direct_internal_fn_supported_p (IFN_POPCOUNT, half_type,
9298 (IFN_POPCOUNT:half_type (convert @0))
9299 (IFN_POPCOUNT:half_type (convert (rshift @0
9300 { build_int_cst (integer_type_node, half_prec); } )))))))))))
9302 /* __builtin_ffs needs to deal on many targets with the possible zero
9303 argument. If we know the argument is always non-zero, __builtin_ctz + 1
9304 should lead to better code. */
9306 (FFS tree_expr_nonzero_p@0)
9307 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
9308 && direct_internal_fn_supported_p (IFN_CTZ, TREE_TYPE (@0),
9309 OPTIMIZE_FOR_SPEED))
9310 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
9311 (plus (CTZ:type (convert:utype @0)) { build_one_cst (type); }))))
9315 /* __builtin_ffs (X) == 0 -> X == 0.
9316 __builtin_ffs (X) == 6 -> (X & 63) == 32. */
9319 (cmp (ffs@2 @0) INTEGER_CST@1)
9320 (with { int prec = TYPE_PRECISION (TREE_TYPE (@0)); }
9322 (if (integer_zerop (@1))
9323 (cmp @0 { build_zero_cst (TREE_TYPE (@0)); }))
9324 (if (tree_int_cst_sgn (@1) < 0 || wi::to_widest (@1) > prec)
9325 { constant_boolean_node (cmp == NE_EXPR ? true : false, type); })
9326 (if (single_use (@2))
9327 (cmp (bit_and @0 { wide_int_to_tree (TREE_TYPE (@0),
9328 wi::mask (tree_to_uhwi (@1),
9330 { wide_int_to_tree (TREE_TYPE (@0),
9331 wi::shifted_mask (tree_to_uhwi (@1) - 1, 1,
9332 false, prec)); }))))))
9334 /* __builtin_ffs (X) > 6 -> X != 0 && (X & 63) == 0. */
9338 bit_op (bit_and bit_ior)
9340 (cmp (ffs@2 @0) INTEGER_CST@1)
9341 (with { int prec = TYPE_PRECISION (TREE_TYPE (@0)); }
9343 (if (integer_zerop (@1))
9344 (cmp2 @0 { build_zero_cst (TREE_TYPE (@0)); }))
9345 (if (tree_int_cst_sgn (@1) < 0)
9346 { constant_boolean_node (cmp == GT_EXPR ? true : false, type); })
9347 (if (wi::to_widest (@1) >= prec)
9348 { constant_boolean_node (cmp == GT_EXPR ? false : true, type); })
9349 (if (wi::to_widest (@1) == prec - 1)
9350 (cmp3 @0 { wide_int_to_tree (TREE_TYPE (@0),
9351 wi::shifted_mask (prec - 1, 1,
9353 (if (single_use (@2))
9354 (bit_op (cmp2 @0 { build_zero_cst (TREE_TYPE (@0)); })
9356 { wide_int_to_tree (TREE_TYPE (@0),
9357 wi::mask (tree_to_uhwi (@1),
9359 { build_zero_cst (TREE_TYPE (@0)); }))))))))
9362 /* ffs(ext(X)) == ffs(X). */
9364 (FFS (convert@1 @0))
9365 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
9366 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
9367 && TYPE_PRECISION (TREE_TYPE (@1)) > TYPE_PRECISION (TREE_TYPE (@0)))
9368 (with { combined_fn cfn = CFN_LAST;
9369 tree type0 = TREE_TYPE (@0);
9370 if (TREE_CODE (type0) == BITINT_TYPE)
9372 if (TYPE_PRECISION (type0) > MAX_FIXED_MODE_SIZE)
9376 = build_nonstandard_integer_type (TYPE_PRECISION (type0),
9379 type0 = signed_type_for (type0);
9381 && direct_internal_fn_supported_p (IFN_FFS, type0,
9385 && TYPE_PRECISION (TREE_TYPE (@1)) > BITS_PER_WORD
9386 && !direct_internal_fn_supported_p (IFN_FFS,
9390 if (TYPE_PRECISION (type0)
9391 == TYPE_PRECISION (integer_type_node))
9392 cfn = CFN_BUILT_IN_FFS;
9393 else if (TYPE_PRECISION (type0)
9394 == TYPE_PRECISION (long_long_integer_type_node))
9395 cfn = CFN_BUILT_IN_FFSLL;
9397 (if (cfn == CFN_FFS)
9398 (IFN_FFS (convert:type0 @0))
9399 (if (cfn == CFN_BUILT_IN_FFS)
9400 (BUILT_IN_FFS (convert:type0 @0))
9401 (if (cfn == CFN_BUILT_IN_FFSLL)
9402 (BUILT_IN_FFSLL (convert:type0 @0))))))))
9410 --> r = .COND_FN (cond, a, b)
9414 --> r = .COND_FN (~cond, b, a). */
9416 (for uncond_op (UNCOND_UNARY)
9417 cond_op (COND_UNARY)
9419 (vec_cond @0 (view_convert? (uncond_op@3 @1)) @2)
9420 (with { tree op_type = TREE_TYPE (@3); }
9421 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
9422 && is_truth_type_for (op_type, TREE_TYPE (@0)))
9423 (cond_op @0 (view_convert @1) @2))))
9425 (vec_cond @0 @1 (view_convert? (uncond_op@3 @2)))
9426 (with { tree op_type = TREE_TYPE (@3); }
9427 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
9428 && is_truth_type_for (op_type, TREE_TYPE (@0)))
9429 (cond_op (bit_not @0) (view_convert @2) @1)))))
9431 (for uncond_op (UNCOND_UNARY)
9432 cond_op (COND_LEN_UNARY)
9434 (IFN_VCOND_MASK_LEN @0 (view_convert? (uncond_op@3 @1)) @2 @4 @5)
9435 (with { tree op_type = TREE_TYPE (@3); }
9436 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
9437 && is_truth_type_for (op_type, TREE_TYPE (@0)))
9438 (cond_op @0 (view_convert @1) @2 @4 @5))))
9440 (IFN_VCOND_MASK_LEN @0 @1 (view_convert? (uncond_op@3 @2)) @4 @5)
9441 (with { tree op_type = TREE_TYPE (@3); }
9442 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
9443 && is_truth_type_for (op_type, TREE_TYPE (@0)))
9444 (cond_op (bit_not @0) (view_convert @2) @1 @4 @5)))))
9446 /* `(a ? -1 : 0) ^ b` can be converted into a conditional not. */
9448 (bit_xor:c (vec_cond @0 uniform_integer_cst_p@1 uniform_integer_cst_p@2) @3)
9449 (if (canonicalize_math_after_vectorization_p ()
9450 && vectorized_internal_fn_supported_p (IFN_COND_NOT, type)
9451 && is_truth_type_for (type, TREE_TYPE (@0)))
9452 (if (integer_all_onesp (@1) && integer_zerop (@2))
9453 (IFN_COND_NOT @0 @3 @3))
9454 (if (integer_all_onesp (@2) && integer_zerop (@1))
9455 (IFN_COND_NOT (bit_not @0) @3 @3))))
9464 r = c ? a1 op a2 : b;
9466 if the target can do it in one go. This makes the operation conditional
9467 on c, so could drop potentially-trapping arithmetic, but that's a valid
9468 simplification if the result of the operation isn't needed.
9470 Avoid speculatively generating a stand-alone vector comparison
9471 on targets that might not support them. Any target implementing
9472 conditional internal functions must support the same comparisons
9473 inside and outside a VEC_COND_EXPR. */
9475 (for uncond_op (UNCOND_BINARY)
9476 cond_op (COND_BINARY)
9478 (vec_cond @0 (view_convert? (uncond_op@4 @1 @2)) @3)
9479 (with { tree op_type = TREE_TYPE (@4); }
9480 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
9481 && is_truth_type_for (op_type, TREE_TYPE (@0))
9483 (view_convert (cond_op @0 @1 @2 (view_convert:op_type @3))))))
9485 (vec_cond @0 @1 (view_convert? (uncond_op@4 @2 @3)))
9486 (with { tree op_type = TREE_TYPE (@4); }
9487 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
9488 && is_truth_type_for (op_type, TREE_TYPE (@0))
9490 (view_convert (cond_op (bit_not @0) @2 @3 (view_convert:op_type @1)))))))
9492 (for uncond_op (UNCOND_BINARY)
9493 cond_op (COND_LEN_BINARY)
9495 (IFN_VCOND_MASK_LEN @0 (view_convert? (uncond_op@4 @1 @2)) @3 @5 @6)
9496 (with { tree op_type = TREE_TYPE (@4); }
9497 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
9498 && is_truth_type_for (op_type, TREE_TYPE (@0))
9500 (view_convert (cond_op @0 @1 @2 (view_convert:op_type @3) @5 @6)))))
9502 (IFN_VCOND_MASK_LEN @0 @1 (view_convert? (uncond_op@4 @2 @3)) @5 @6)
9503 (with { tree op_type = TREE_TYPE (@4); }
9504 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
9505 && is_truth_type_for (op_type, TREE_TYPE (@0))
9507 (view_convert (cond_op (bit_not @0) @2 @3 (view_convert:op_type @1) @5 @6))))))
9509 /* Same for ternary operations. */
9510 (for uncond_op (UNCOND_TERNARY)
9511 cond_op (COND_TERNARY)
9513 (vec_cond @0 (view_convert? (uncond_op@5 @1 @2 @3)) @4)
9514 (with { tree op_type = TREE_TYPE (@5); }
9515 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
9516 && is_truth_type_for (op_type, TREE_TYPE (@0))
9518 (view_convert (cond_op @0 @1 @2 @3 (view_convert:op_type @4))))))
9520 (vec_cond @0 @1 (view_convert? (uncond_op@5 @2 @3 @4)))
9521 (with { tree op_type = TREE_TYPE (@5); }
9522 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
9523 && is_truth_type_for (op_type, TREE_TYPE (@0))
9525 (view_convert (cond_op (bit_not @0) @2 @3 @4
9526 (view_convert:op_type @1)))))))
9528 (for uncond_op (UNCOND_TERNARY)
9529 cond_op (COND_LEN_TERNARY)
9531 (IFN_VCOND_MASK_LEN @0 (view_convert? (uncond_op@5 @1 @2 @3)) @4 @6 @7)
9532 (with { tree op_type = TREE_TYPE (@5); }
9533 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
9534 && is_truth_type_for (op_type, TREE_TYPE (@0))
9536 (view_convert (cond_op @0 @1 @2 @3 (view_convert:op_type @4) @6 @7)))))
9538 (IFN_VCOND_MASK_LEN @0 @1 (view_convert? (uncond_op@5 @2 @3 @4 @6 @7)))
9539 (with { tree op_type = TREE_TYPE (@5); }
9540 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
9541 && is_truth_type_for (op_type, TREE_TYPE (@0))
9543 (view_convert (cond_op (bit_not @0) @2 @3 @4 (view_convert:op_type @1) @6 @7))))))
9546 /* Detect cases in which a VEC_COND_EXPR effectively replaces the
9547 "else" value of an IFN_COND_*. */
9548 (for cond_op (COND_BINARY)
9550 (vec_cond @0 (view_convert? (cond_op @0 @1 @2 @3)) @4)
9551 (with { tree op_type = TREE_TYPE (@3); }
9552 (if (element_precision (type) == element_precision (op_type))
9553 (view_convert (cond_op @0 @1 @2 (view_convert:op_type @4))))))
9555 (vec_cond @0 @1 (view_convert? (cond_op @2 @3 @4 @5)))
9556 (with { tree op_type = TREE_TYPE (@5); }
9557 (if (inverse_conditions_p (@0, @2)
9558 && element_precision (type) == element_precision (op_type))
9559 (view_convert (cond_op @2 @3 @4 (view_convert:op_type @1)))))))
9561 /* Same for ternary operations. */
9562 (for cond_op (COND_TERNARY)
9564 (vec_cond @0 (view_convert? (cond_op @0 @1 @2 @3 @4)) @5)
9565 (with { tree op_type = TREE_TYPE (@4); }
9566 (if (element_precision (type) == element_precision (op_type))
9567 (view_convert (cond_op @0 @1 @2 @3 (view_convert:op_type @5))))))
9569 (vec_cond @0 @1 (view_convert? (cond_op @2 @3 @4 @5 @6)))
9570 (with { tree op_type = TREE_TYPE (@6); }
9571 (if (inverse_conditions_p (@0, @2)
9572 && element_precision (type) == element_precision (op_type))
9573 (view_convert (cond_op @2 @3 @4 @5 (view_convert:op_type @1)))))))
9575 /* Detect cases in which a VEC_COND_EXPR effectively replaces the
9576 "else" value of an IFN_COND_LEN_*. */
9577 (for cond_len_op (COND_LEN_BINARY)
9579 (vec_cond @0 (view_convert? (cond_len_op @0 @1 @2 @3 @4 @5)) @6)
9580 (with { tree op_type = TREE_TYPE (@3); }
9581 (if (element_precision (type) == element_precision (op_type))
9582 (view_convert (cond_len_op @0 @1 @2 (view_convert:op_type @6) @4 @5)))))
9584 (vec_cond @0 @1 (view_convert? (cond_len_op @2 @3 @4 @5 @6 @7)))
9585 (with { tree op_type = TREE_TYPE (@5); }
9586 (if (inverse_conditions_p (@0, @2)
9587 && element_precision (type) == element_precision (op_type))
9588 (view_convert (cond_len_op @2 @3 @4 (view_convert:op_type @1) @6 @7))))))
9590 /* Same for ternary operations. */
9591 (for cond_len_op (COND_LEN_TERNARY)
9593 (vec_cond @0 (view_convert? (cond_len_op @0 @1 @2 @3 @4 @5 @6)) @7)
9594 (with { tree op_type = TREE_TYPE (@4); }
9595 (if (element_precision (type) == element_precision (op_type))
9596 (view_convert (cond_len_op @0 @1 @2 @3 (view_convert:op_type @7) @5 @6)))))
9598 (vec_cond @0 @1 (view_convert? (cond_len_op @2 @3 @4 @5 @6 @7 @8)))
9599 (with { tree op_type = TREE_TYPE (@6); }
9600 (if (inverse_conditions_p (@0, @2)
9601 && element_precision (type) == element_precision (op_type))
9602 (view_convert (cond_len_op @2 @3 @4 @5 (view_convert:op_type @1) @7 @8))))))
9604 /* Detect simplication for a conditional reduction where
9607 c = mask2 ? d + a : d
9611 c = mask1 && mask2 ? d + b : d. */
9613 (IFN_COND_ADD @0 @1 (vec_cond @2 @3 zerop@4) @1)
9614 (if (ANY_INTEGRAL_TYPE_P (type)
9615 || (FLOAT_TYPE_P (type)
9616 && fold_real_zero_addition_p (type, NULL_TREE, @4, 0)))
9617 (IFN_COND_ADD (bit_and @0 @2) @1 @3 @1)))
9619 /* Detect simplication for a conditional length reduction where
9622 c = i < len + bias ? d + a : d
9626 c = mask && i < len + bias ? d + b : d. */
9628 (IFN_COND_LEN_ADD integer_truep @0 (vec_cond @1 @2 zerop@5) @0 @3 @4)
9629 (if (ANY_INTEGRAL_TYPE_P (type)
9630 || (FLOAT_TYPE_P (type)
9631 && fold_real_zero_addition_p (type, NULL_TREE, @5, 0)))
9632 (IFN_COND_LEN_ADD @1 @0 @2 @0 @3 @4)))
9634 /* Detect simplification for vector condition folding where
9636 c = mask1 ? (masked_op mask2 a b els) : els
9640 c = masked_op (mask1 & mask2) a b els
9642 where the operation can be partially applied to one operand. */
9644 (for cond_op (COND_BINARY)
9647 (cond_op:s @1 @2 @3 @4) @4)
9648 (cond_op (bit_and @1 @0) @2 @3 @4)))
9650 /* And same for ternary expressions. */
9652 (for cond_op (COND_TERNARY)
9655 (cond_op:s @1 @2 @3 @4 @5) @5)
9656 (cond_op (bit_and @1 @0) @2 @3 @4 @5)))
9658 /* For pointers @0 and @2 and nonnegative constant offset @1, look for
9661 A: (@0 + @1 < @2) | (@2 + @1 < @0)
9662 B: (@0 + @1 <= @2) | (@2 + @1 <= @0)
9664 If pointers are known not to wrap, B checks whether @1 bytes starting
9665 at @0 and @2 do not overlap, while A tests the same thing for @1 + 1
9666 bytes. A is more efficiently tested as:
9668 A: (sizetype) (@0 + @1 - @2) > @1 * 2
9670 The equivalent expression for B is given by replacing @1 with @1 - 1:
9672 B: (sizetype) (@0 + (@1 - 1) - @2) > (@1 - 1) * 2
9674 @0 and @2 can be swapped in both expressions without changing the result.
9676 The folds rely on sizetype's being unsigned (which is always true)
9677 and on its being the same width as the pointer (which we have to check).
9679 The fold replaces two pointer_plus expressions, two comparisons and
9680 an IOR with a pointer_plus, a pointer_diff, and a comparison, so in
9681 the best case it's a saving of two operations. The A fold retains one
9682 of the original pointer_pluses, so is a win even if both pointer_pluses
9683 are used elsewhere. The B fold is a wash if both pointer_pluses are
9684 used elsewhere, since all we end up doing is replacing a comparison with
9685 a pointer_plus. We do still apply the fold under those circumstances
9686 though, in case applying it to other conditions eventually makes one of the
9687 pointer_pluses dead. */
9688 (for ior (truth_orif truth_or bit_ior)
9691 (ior (cmp:cs (pointer_plus@3 @0 INTEGER_CST@1) @2)
9692 (cmp:cs (pointer_plus@4 @2 @1) @0))
9693 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
9694 && TYPE_OVERFLOW_WRAPS (sizetype)
9695 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (sizetype))
9696 /* Calculate the rhs constant. */
9697 (with { offset_int off = wi::to_offset (@1) - (cmp == LE_EXPR ? 1 : 0);
9698 offset_int rhs = off * 2; }
9699 /* Always fails for negative values. */
9700 (if (wi::min_precision (rhs, UNSIGNED) <= TYPE_PRECISION (sizetype))
9701 /* Since the order of @0 and @2 doesn't matter, let tree_swap_operands_p
9702 pick a canonical order. This increases the chances of using the
9703 same pointer_plus in multiple checks. */
9704 (with { bool swap_p = tree_swap_operands_p (@0, @2);
9705 tree rhs_tree = wide_int_to_tree (sizetype, rhs); }
9706 (if (cmp == LT_EXPR)
9707 (gt (convert:sizetype
9708 (pointer_diff:ssizetype { swap_p ? @4 : @3; }
9709 { swap_p ? @0 : @2; }))
9711 (gt (convert:sizetype
9712 (pointer_diff:ssizetype
9713 (pointer_plus { swap_p ? @2 : @0; }
9714 { wide_int_to_tree (sizetype, off); })
9715 { swap_p ? @0 : @2; }))
9716 { rhs_tree; })))))))))
9718 /* Fold REDUC (@0 & @1) -> @0[I] & @1[I] if element I is the only nonzero
9720 (for reduc (IFN_REDUC_PLUS IFN_REDUC_IOR IFN_REDUC_XOR)
9721 (simplify (reduc (view_convert? (bit_and @0 VECTOR_CST@1)))
9722 (with { int i = single_nonzero_element (@1); }
9724 (with { tree elt = vector_cst_elt (@1, i);
9725 tree elt_type = TREE_TYPE (elt);
9726 unsigned int elt_bits = tree_to_uhwi (TYPE_SIZE (elt_type));
9727 tree size = bitsize_int (elt_bits);
9728 tree pos = bitsize_int (elt_bits * i); }
9731 (BIT_FIELD_REF:elt_type @0 { size; } { pos; })
9734 /* Fold reduction of a single nonzero element constructor. */
9735 (for reduc (IFN_REDUC_PLUS IFN_REDUC_IOR IFN_REDUC_XOR)
9736 (simplify (reduc (CONSTRUCTOR@0))
9737 (with { tree ctor = (TREE_CODE (@0) == SSA_NAME
9738 ? gimple_assign_rhs1 (SSA_NAME_DEF_STMT (@0)) : @0);
9739 tree elt = ctor_single_nonzero_element (ctor); }
9741 && !HONOR_SNANS (type)
9742 && !HONOR_SIGNED_ZEROS (type))
9745 /* Fold REDUC (@0 op VECTOR_CST) as REDUC (@0) op REDUC (VECTOR_CST). */
9746 (for reduc (IFN_REDUC_PLUS IFN_REDUC_MAX IFN_REDUC_MIN IFN_REDUC_FMAX
9747 IFN_REDUC_FMIN IFN_REDUC_AND IFN_REDUC_IOR IFN_REDUC_XOR)
9748 op (plus max min IFN_FMAX IFN_FMIN bit_and bit_ior bit_xor)
9749 (simplify (reduc (op @0 VECTOR_CST@1))
9750 (op (reduc:type @0) (reduc:type @1))))
9752 /* Simplify vector floating point operations of alternating sub/add pairs
9753 into using an fneg of a wider element type followed by a normal add.
9754 under IEEE 754 the fneg of the wider type will negate every even entry
9755 and when doing an add we get a sub of the even and add of every odd
9757 (for plusminus (plus minus)
9758 minusplus (minus plus)
9760 (vec_perm (plusminus @0 @1) (minusplus @2 @3) VECTOR_CST@4)
9761 (if (!VECTOR_INTEGER_TYPE_P (type)
9762 && !FLOAT_WORDS_BIG_ENDIAN
9763 /* plus is commutative, while minus is not, so :c can't be used.
9764 Do equality comparisons by hand and at the end pick the operands
9766 && (operand_equal_p (@0, @2, 0)
9767 ? operand_equal_p (@1, @3, 0)
9768 : operand_equal_p (@0, @3, 0) && operand_equal_p (@1, @2, 0)))
9771 /* Build a vector of integers from the tree mask. */
9772 vec_perm_builder builder;
9774 (if (tree_to_vec_perm_builder (&builder, @4))
9777 /* Create a vec_perm_indices for the integer vector. */
9778 poly_uint64 nelts = TYPE_VECTOR_SUBPARTS (type);
9779 vec_perm_indices sel (builder, 2, nelts);
9780 machine_mode vec_mode = TYPE_MODE (type);
9781 machine_mode wide_mode;
9782 scalar_mode wide_elt_mode;
9783 poly_uint64 wide_nunits;
9784 scalar_mode inner_mode = GET_MODE_INNER (vec_mode);
9786 (if (VECTOR_MODE_P (vec_mode)
9787 && sel.series_p (0, 2, 0, 2)
9788 && sel.series_p (1, 2, nelts + 1, 2)
9789 && GET_MODE_2XWIDER_MODE (inner_mode).exists (&wide_elt_mode)
9790 && multiple_p (GET_MODE_NUNITS (vec_mode), 2, &wide_nunits)
9791 && related_vector_mode (vec_mode, wide_elt_mode,
9792 wide_nunits).exists (&wide_mode))
9796 = lang_hooks.types.type_for_mode (GET_MODE_INNER (wide_mode),
9797 TYPE_UNSIGNED (type));
9798 tree ntype = build_vector_type_for_mode (stype, wide_mode);
9800 /* The format has to be a non-extended ieee format. */
9801 const struct real_format *fmt_old = FLOAT_MODE_FORMAT (vec_mode);
9802 const struct real_format *fmt_new = FLOAT_MODE_FORMAT (wide_mode);
9804 (if (TYPE_MODE (stype) != BLKmode
9805 && VECTOR_TYPE_P (ntype)
9810 /* If the target doesn't support v1xx vectors, try using
9811 scalar mode xx instead. */
9812 if (known_eq (GET_MODE_NUNITS (wide_mode), 1)
9813 && !target_supports_op_p (ntype, NEGATE_EXPR, optab_vector))
9816 (if (fmt_new->signbit_rw
9817 == fmt_old->signbit_rw + GET_MODE_UNIT_BITSIZE (vec_mode)
9818 && fmt_new->signbit_rw == fmt_new->signbit_ro
9819 && targetm.can_change_mode_class (TYPE_MODE (ntype),
9820 TYPE_MODE (type), ALL_REGS)
9821 && ((optimize_vectors_before_lowering_p ()
9822 && VECTOR_TYPE_P (ntype))
9823 || target_supports_op_p (ntype, NEGATE_EXPR, optab_vector)))
9824 (if (plusminus == PLUS_EXPR)
9825 (plus (view_convert:type (negate (view_convert:ntype @3))) @2)
9826 (minus @0 (view_convert:type
9827 (negate (view_convert:ntype @1))))))))))))))))
9830 (vec_perm @0 @1 VECTOR_CST@2)
9833 tree op0 = @0, op1 = @1, op2 = @2;
9834 machine_mode result_mode = TYPE_MODE (type);
9835 machine_mode op_mode = TYPE_MODE (TREE_TYPE (op0));
9837 /* Build a vector of integers from the tree mask. */
9838 vec_perm_builder builder;
9840 (if (tree_to_vec_perm_builder (&builder, op2))
9843 /* Create a vec_perm_indices for the integer vector. */
9844 poly_uint64 nelts = TYPE_VECTOR_SUBPARTS (type);
9845 bool single_arg = (op0 == op1);
9846 vec_perm_indices sel (builder, single_arg ? 1 : 2, nelts);
9848 (if (sel.series_p (0, 1, 0, 1))
9850 (if (sel.series_p (0, 1, nelts, 1))
9856 if (sel.all_from_input_p (0))
9858 else if (sel.all_from_input_p (1))
9861 sel.rotate_inputs (1);
9863 else if (known_ge (poly_uint64 (sel[0]), nelts))
9865 std::swap (op0, op1);
9866 sel.rotate_inputs (1);
9870 tree cop0 = op0, cop1 = op1;
9871 if (TREE_CODE (op0) == SSA_NAME
9872 && (def = dyn_cast <gassign *> (SSA_NAME_DEF_STMT (op0)))
9873 && gimple_assign_rhs_code (def) == CONSTRUCTOR)
9874 cop0 = gimple_assign_rhs1 (def);
9875 if (TREE_CODE (op1) == SSA_NAME
9876 && (def = dyn_cast <gassign *> (SSA_NAME_DEF_STMT (op1)))
9877 && gimple_assign_rhs_code (def) == CONSTRUCTOR)
9878 cop1 = gimple_assign_rhs1 (def);
9881 (if ((TREE_CODE (cop0) == VECTOR_CST
9882 || TREE_CODE (cop0) == CONSTRUCTOR)
9883 && (TREE_CODE (cop1) == VECTOR_CST
9884 || TREE_CODE (cop1) == CONSTRUCTOR)
9885 && (t = fold_vec_perm (type, cop0, cop1, sel)))
9889 bool changed = (op0 == op1 && !single_arg);
9890 tree ins = NULL_TREE;
9893 /* See if the permutation is performing a single element
9894 insert from a CONSTRUCTOR or constant and use a BIT_INSERT_EXPR
9895 in that case. But only if the vector mode is supported,
9896 otherwise this is invalid GIMPLE. */
9897 if (op_mode != BLKmode
9898 && (TREE_CODE (cop0) == VECTOR_CST
9899 || TREE_CODE (cop0) == CONSTRUCTOR
9900 || TREE_CODE (cop1) == VECTOR_CST
9901 || TREE_CODE (cop1) == CONSTRUCTOR))
9903 bool insert_first_p = sel.series_p (1, 1, nelts + 1, 1);
9906 /* After canonicalizing the first elt to come from the
9907 first vector we only can insert the first elt from
9908 the first vector. */
9910 if ((ins = fold_read_from_vector (cop0, sel[0])))
9913 /* The above can fail for two-element vectors which always
9914 appear to insert the first element, so try inserting
9915 into the second lane as well. For more than two
9916 elements that's wasted time. */
9917 if (!insert_first_p || (!ins && maybe_eq (nelts, 2u)))
9919 unsigned int encoded_nelts = sel.encoding ().encoded_nelts ();
9920 for (at = 0; at < encoded_nelts; ++at)
9921 if (maybe_ne (sel[at], at))
9923 if (at < encoded_nelts
9924 && (known_eq (at + 1, nelts)
9925 || sel.series_p (at + 1, 1, at + 1, 1)))
9927 if (known_lt (poly_uint64 (sel[at]), nelts))
9928 ins = fold_read_from_vector (cop0, sel[at]);
9930 ins = fold_read_from_vector (cop1, sel[at] - nelts);
9935 /* Generate a canonical form of the selector. */
9936 if (!ins && sel.encoding () != builder)
9938 /* Some targets are deficient and fail to expand a single
9939 argument permutation while still allowing an equivalent
9940 2-argument version. */
9942 if (sel.ninputs () == 2
9943 || can_vec_perm_const_p (result_mode, op_mode, sel, false))
9944 op2 = vec_perm_indices_to_tree (TREE_TYPE (op2), sel);
9947 vec_perm_indices sel2 (builder, 2, nelts);
9948 if (can_vec_perm_const_p (result_mode, op_mode, sel2, false))
9949 op2 = vec_perm_indices_to_tree (TREE_TYPE (op2), sel2);
9951 /* Not directly supported with either encoding,
9952 so use the preferred form. */
9953 op2 = vec_perm_indices_to_tree (TREE_TYPE (op2), sel);
9955 if (!operand_equal_p (op2, oldop2, 0))
9960 (bit_insert { op0; } { ins; }
9961 { bitsize_int (at * vector_element_bits (type)); })
9963 (vec_perm { op0; } { op1; } { op2; }))))))))))))
9965 /* VEC_PERM_EXPR (v, v, mask) -> v where v contains same element. */
9967 (match vec_same_elem_p
9970 (match vec_same_elem_p
9972 (if (TREE_CODE (@0) == SSA_NAME
9973 && uniform_vector_p (gimple_assign_rhs1 (SSA_NAME_DEF_STMT (@0))))))
9975 (match vec_same_elem_p
9977 (if (uniform_vector_p (@0))))
9981 (vec_perm vec_same_elem_p@0 @0 @1)
9982 (if (types_match (type, TREE_TYPE (@0)))
9986 tree elem = uniform_vector_p (@0);
9989 { build_vector_from_val (type, elem); }))))
9991 /* Push VEC_PERM earlier if that may help FMA perception (PR101895). */
9993 (plus:c (vec_perm:s (mult:c@0 @1 vec_same_elem_p@2) @0 @3) @4)
9994 (if (TREE_CODE (@0) == SSA_NAME && num_imm_uses (@0) == 2)
9995 (plus (mult (vec_perm @1 @1 @3) @2) @4)))
9997 (minus (vec_perm:s (mult:c@0 @1 vec_same_elem_p@2) @0 @3) @4)
9998 (if (TREE_CODE (@0) == SSA_NAME && num_imm_uses (@0) == 2)
9999 (minus (mult (vec_perm @1 @1 @3) @2) @4)))
10003 c = VEC_PERM_EXPR <a, b, VCST0>;
10004 d = VEC_PERM_EXPR <c, c, VCST1>;
10006 d = VEC_PERM_EXPR <a, b, NEW_VCST>; */
10009 (vec_perm (vec_perm@0 @1 @2 VECTOR_CST@3) @0 VECTOR_CST@4)
10010 (if (TYPE_VECTOR_SUBPARTS (type).is_constant ())
10013 machine_mode result_mode = TYPE_MODE (type);
10014 machine_mode op_mode = TYPE_MODE (TREE_TYPE (@1));
10015 int nelts = TYPE_VECTOR_SUBPARTS (type).to_constant ();
10016 vec_perm_builder builder0;
10017 vec_perm_builder builder1;
10018 vec_perm_builder builder2 (nelts, nelts, 1);
10020 (if (tree_to_vec_perm_builder (&builder0, @3)
10021 && tree_to_vec_perm_builder (&builder1, @4))
10024 vec_perm_indices sel0 (builder0, 2, nelts);
10025 vec_perm_indices sel1 (builder1, 1, nelts);
10027 for (int i = 0; i < nelts; i++)
10028 builder2.quick_push (sel0[sel1[i].to_constant ()]);
10030 vec_perm_indices sel2 (builder2, 2, nelts);
10032 tree op0 = NULL_TREE;
10033 /* If the new VEC_PERM_EXPR can't be handled but both
10034 original VEC_PERM_EXPRs can, punt.
10035 If one or both of the original VEC_PERM_EXPRs can't be
10036 handled and the new one can't be either, don't increase
10037 number of VEC_PERM_EXPRs that can't be handled. */
10038 if (can_vec_perm_const_p (result_mode, op_mode, sel2, false)
10039 || (single_use (@0)
10040 ? (!can_vec_perm_const_p (result_mode, op_mode, sel0, false)
10041 || !can_vec_perm_const_p (result_mode, op_mode, sel1, false))
10042 : !can_vec_perm_const_p (result_mode, op_mode, sel1, false)))
10043 op0 = vec_perm_indices_to_tree (TREE_TYPE (@4), sel2);
10046 (vec_perm @1 @2 { op0; })))))))
10049 c = VEC_PERM_EXPR <a, b, VCST0>;
10050 d = VEC_PERM_EXPR <x, c, VCST1>;
10052 d = VEC_PERM_EXPR <x, {a,b}, NEW_VCST>;
10053 when all elements from a or b are replaced by the later
10057 (vec_perm @5 (vec_perm@0 @1 @2 VECTOR_CST@3) VECTOR_CST@4)
10058 (if (TYPE_VECTOR_SUBPARTS (type).is_constant ())
10061 machine_mode result_mode = TYPE_MODE (type);
10062 machine_mode op_mode = TYPE_MODE (TREE_TYPE (@1));
10063 int nelts = TYPE_VECTOR_SUBPARTS (type).to_constant ();
10064 vec_perm_builder builder0;
10065 vec_perm_builder builder1;
10066 vec_perm_builder builder2 (nelts, nelts, 2);
10068 (if (tree_to_vec_perm_builder (&builder0, @3)
10069 && tree_to_vec_perm_builder (&builder1, @4))
10072 vec_perm_indices sel0 (builder0, 2, nelts);
10073 vec_perm_indices sel1 (builder1, 2, nelts);
10074 bool use_1 = false, use_2 = false;
10076 for (int i = 0; i < nelts; i++)
10078 if (known_lt ((poly_uint64)sel1[i], sel1.nelts_per_input ()))
10079 builder2.quick_push (sel1[i]);
10082 poly_uint64 j = sel0[(sel1[i] - sel1.nelts_per_input ())
10084 if (known_lt (j, sel0.nelts_per_input ()))
10089 j -= sel0.nelts_per_input ();
10091 builder2.quick_push (j + sel1.nelts_per_input ());
10095 (if (use_1 ^ use_2)
10098 vec_perm_indices sel2 (builder2, 2, nelts);
10099 tree op0 = NULL_TREE;
10100 /* If the new VEC_PERM_EXPR can't be handled but both
10101 original VEC_PERM_EXPRs can, punt.
10102 If one or both of the original VEC_PERM_EXPRs can't be
10103 handled and the new one can't be either, don't increase
10104 number of VEC_PERM_EXPRs that can't be handled. */
10105 if (can_vec_perm_const_p (result_mode, op_mode, sel2, false)
10106 || (single_use (@0)
10107 ? (!can_vec_perm_const_p (result_mode, op_mode, sel0, false)
10108 || !can_vec_perm_const_p (result_mode, op_mode, sel1, false))
10109 : !can_vec_perm_const_p (result_mode, op_mode, sel1, false)))
10110 op0 = vec_perm_indices_to_tree (TREE_TYPE (@4), sel2);
10115 (vec_perm @5 @1 { op0; }))
10117 (vec_perm @5 @2 { op0; })))))))))))
10119 /* And the case with swapped outer permute sources. */
10122 (vec_perm (vec_perm@0 @1 @2 VECTOR_CST@3) @5 VECTOR_CST@4)
10123 (if (TYPE_VECTOR_SUBPARTS (type).is_constant ())
10126 machine_mode result_mode = TYPE_MODE (type);
10127 machine_mode op_mode = TYPE_MODE (TREE_TYPE (@1));
10128 int nelts = TYPE_VECTOR_SUBPARTS (type).to_constant ();
10129 vec_perm_builder builder0;
10130 vec_perm_builder builder1;
10131 vec_perm_builder builder2 (nelts, nelts, 2);
10133 (if (tree_to_vec_perm_builder (&builder0, @3)
10134 && tree_to_vec_perm_builder (&builder1, @4))
10137 vec_perm_indices sel0 (builder0, 2, nelts);
10138 vec_perm_indices sel1 (builder1, 2, nelts);
10139 bool use_1 = false, use_2 = false;
10141 for (int i = 0; i < nelts; i++)
10143 if (known_ge ((poly_uint64)sel1[i], sel1.nelts_per_input ()))
10144 builder2.quick_push (sel1[i]);
10147 poly_uint64 j = sel0[sel1[i].to_constant ()];
10148 if (known_lt (j, sel0.nelts_per_input ()))
10153 j -= sel0.nelts_per_input ();
10155 builder2.quick_push (j);
10159 (if (use_1 ^ use_2)
10162 vec_perm_indices sel2 (builder2, 2, nelts);
10163 tree op0 = NULL_TREE;
10164 /* If the new VEC_PERM_EXPR can't be handled but both
10165 original VEC_PERM_EXPRs can, punt.
10166 If one or both of the original VEC_PERM_EXPRs can't be
10167 handled and the new one can't be either, don't increase
10168 number of VEC_PERM_EXPRs that can't be handled. */
10169 if (can_vec_perm_const_p (result_mode, op_mode, sel2, false)
10170 || (single_use (@0)
10171 ? (!can_vec_perm_const_p (result_mode, op_mode, sel0, false)
10172 || !can_vec_perm_const_p (result_mode, op_mode, sel1, false))
10173 : !can_vec_perm_const_p (result_mode, op_mode, sel1, false)))
10174 op0 = vec_perm_indices_to_tree (TREE_TYPE (@4), sel2);
10179 (vec_perm @1 @5 { op0; }))
10181 (vec_perm @2 @5 { op0; })))))))))))
10184 /* Match count trailing zeroes for simplify_count_trailing_zeroes in fwprop.
10185 The canonical form is array[((x & -x) * C) >> SHIFT] where C is a magic
10186 constant which when multiplied by a power of 2 contains a unique value
10187 in the top 5 or 6 bits. This is then indexed into a table which maps it
10188 to the number of trailing zeroes. */
10189 (match (ctz_table_index @1 @2 @3)
10190 (rshift (mult (bit_and:c (negate @1) @1) INTEGER_CST@2) INTEGER_CST@3))
10192 (match (cond_expr_convert_p @0 @2 @3 @6)
10193 (cond (simple_comparison@6 @0 @1) (convert@4 @2) (convert@5 @3))
10194 (if (INTEGRAL_TYPE_P (type)
10195 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
10196 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
10197 && INTEGRAL_TYPE_P (TREE_TYPE (@3))
10198 && TYPE_PRECISION (type) != TYPE_PRECISION (TREE_TYPE (@0))
10199 && TYPE_PRECISION (TREE_TYPE (@0))
10200 == TYPE_PRECISION (TREE_TYPE (@2))
10201 && TYPE_PRECISION (TREE_TYPE (@0))
10202 == TYPE_PRECISION (TREE_TYPE (@3))
10203 /* For vect_recog_cond_expr_convert_pattern, @2 and @3 can differ in
10204 signess when convert is truncation, but not ok for extension since
10205 it's sign_extend vs zero_extend. */
10206 && (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (type)
10207 || (TYPE_UNSIGNED (TREE_TYPE (@2))
10208 == TYPE_UNSIGNED (TREE_TYPE (@3))))
10210 && single_use (@5))))
10212 (for bit_op (bit_and bit_ior bit_xor)
10213 (match (bitwise_induction_p @0 @2 @3)
10215 (nop_convert1? (bit_not2?@0 (convert3? (lshift integer_onep@1 @2))))
10218 (match (bitwise_induction_p @0 @2 @3)
10220 (nop_convert1? (bit_xor@0 (convert2? (lshift integer_onep@1 @2)) @3))))
10222 /* n - (((n > C1) ? n : C1) & -C2) -> n & C1 for unsigned case.
10223 n - (((n > C1) ? n : C1) & -C2) -> (n <= C1) ? n : (n & C1) for signed case. */
10225 (minus @0 (bit_and (max @0 INTEGER_CST@1) INTEGER_CST@2))
10226 (with { auto i = wi::neg (wi::to_wide (@2)); }
10227 /* Check if -C2 is a power of 2 and C1 = -C2 - 1. */
10228 (if (wi::popcount (i) == 1
10229 && (wi::to_wide (@1)) == (i - 1))
10230 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
10232 (cond (le @0 @1) @0 (bit_and @0 @1))))))
10234 /* -x & 1 -> x & 1. */
10236 (bit_and (negate @0) integer_onep@1)
10237 (if (!TYPE_OVERFLOW_SANITIZED (type))
10240 /* `-a` is just `a` if the type is 1bit wide or when converting
10241 to a 1bit type; similar to the above transformation of `(-x)&1`.
10242 This is used mostly with the transformation of
10243 `a ? ~b : b` into `(-a)^b`.
10244 It also can show up with bitfields. */
10246 (convert? (negate @0))
10247 (if (INTEGRAL_TYPE_P (type)
10248 && TYPE_PRECISION (type) == 1
10249 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0)))
10253 c1 = VEC_PERM_EXPR (a, a, mask)
10254 c2 = VEC_PERM_EXPR (b, b, mask)
10258 c3 = VEC_PERM_EXPR (c, c, mask)
10259 For all integer non-div operations. */
10260 (for op (plus minus mult bit_and bit_ior bit_xor
10263 (op (vec_perm @0 @0 @2) (vec_perm @1 @1 @2))
10264 (if (VECTOR_INTEGER_TYPE_P (type))
10265 (vec_perm (op@3 @0 @1) @3 @2))))
10267 /* Similar for float arithmetic when permutation constant covers
10268 all vector elements. */
10269 (for op (plus minus mult)
10271 (op (vec_perm @0 @0 VECTOR_CST@2) (vec_perm @1 @1 VECTOR_CST@2))
10272 (if (VECTOR_FLOAT_TYPE_P (type)
10273 && TYPE_VECTOR_SUBPARTS (type).is_constant ())
10276 tree perm_cst = @2;
10277 vec_perm_builder builder;
10278 bool full_perm_p = false;
10279 if (tree_to_vec_perm_builder (&builder, perm_cst))
10281 unsigned HOST_WIDE_INT nelts;
10283 nelts = TYPE_VECTOR_SUBPARTS (type).to_constant ();
10284 /* Create a vec_perm_indices for the VECTOR_CST. */
10285 vec_perm_indices sel (builder, 1, nelts);
10287 /* Check if perm indices covers all vector elements. */
10288 if (sel.encoding ().encoded_full_vector_p ())
10290 auto_sbitmap seen (nelts);
10291 bitmap_clear (seen);
10293 unsigned HOST_WIDE_INT count = 0, i;
10295 for (i = 0; i < nelts; i++)
10297 if (!bitmap_set_bit (seen, sel[i].to_constant ()))
10301 full_perm_p = count == nelts;
10306 (vec_perm (op@3 @0 @1) @3 @2))))))