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-2022 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)
56 #include "cfn-operators.pd"
58 /* Define operand lists for math rounding functions {,i,l,ll}FN,
59 where the versions prefixed with "i" return an int, those prefixed with
60 "l" return a long and those prefixed with "ll" return a long long.
62 Also define operand lists:
64 X<FN>F for all float functions, in the order i, l, ll
65 X<FN> for all double functions, in the same order
66 X<FN>L for all long double functions, in the same order. */
67 #define DEFINE_INT_AND_FLOAT_ROUND_FN(FN) \
68 (define_operator_list X##FN##F BUILT_IN_I##FN##F \
71 (define_operator_list X##FN BUILT_IN_I##FN \
74 (define_operator_list X##FN##L BUILT_IN_I##FN##L \
78 DEFINE_INT_AND_FLOAT_ROUND_FN (FLOOR)
79 DEFINE_INT_AND_FLOAT_ROUND_FN (CEIL)
80 DEFINE_INT_AND_FLOAT_ROUND_FN (ROUND)
81 DEFINE_INT_AND_FLOAT_ROUND_FN (RINT)
83 /* Unary operations and their associated IFN_COND_* function. */
84 (define_operator_list UNCOND_UNARY
86 (define_operator_list COND_UNARY
89 /* Binary operations and their associated IFN_COND_* function. */
90 (define_operator_list UNCOND_BINARY
92 mult trunc_div trunc_mod rdiv
95 bit_and bit_ior bit_xor
97 (define_operator_list COND_BINARY
98 IFN_COND_ADD IFN_COND_SUB
99 IFN_COND_MUL IFN_COND_DIV IFN_COND_MOD IFN_COND_RDIV
100 IFN_COND_MIN IFN_COND_MAX
101 IFN_COND_FMIN IFN_COND_FMAX
102 IFN_COND_AND IFN_COND_IOR IFN_COND_XOR
103 IFN_COND_SHL IFN_COND_SHR)
105 /* Same for ternary operations. */
106 (define_operator_list UNCOND_TERNARY
107 IFN_FMA IFN_FMS IFN_FNMA IFN_FNMS)
108 (define_operator_list COND_TERNARY
109 IFN_COND_FMA IFN_COND_FMS IFN_COND_FNMA IFN_COND_FNMS)
111 /* __atomic_fetch_or_*, __atomic_fetch_xor_*, __atomic_xor_fetch_* */
112 (define_operator_list ATOMIC_FETCH_OR_XOR_N
113 BUILT_IN_ATOMIC_FETCH_OR_1 BUILT_IN_ATOMIC_FETCH_OR_2
114 BUILT_IN_ATOMIC_FETCH_OR_4 BUILT_IN_ATOMIC_FETCH_OR_8
115 BUILT_IN_ATOMIC_FETCH_OR_16
116 BUILT_IN_ATOMIC_FETCH_XOR_1 BUILT_IN_ATOMIC_FETCH_XOR_2
117 BUILT_IN_ATOMIC_FETCH_XOR_4 BUILT_IN_ATOMIC_FETCH_XOR_8
118 BUILT_IN_ATOMIC_FETCH_XOR_16
119 BUILT_IN_ATOMIC_XOR_FETCH_1 BUILT_IN_ATOMIC_XOR_FETCH_2
120 BUILT_IN_ATOMIC_XOR_FETCH_4 BUILT_IN_ATOMIC_XOR_FETCH_8
121 BUILT_IN_ATOMIC_XOR_FETCH_16)
122 /* __sync_fetch_and_or_*, __sync_fetch_and_xor_*, __sync_xor_and_fetch_* */
123 (define_operator_list SYNC_FETCH_OR_XOR_N
124 BUILT_IN_SYNC_FETCH_AND_OR_1 BUILT_IN_SYNC_FETCH_AND_OR_2
125 BUILT_IN_SYNC_FETCH_AND_OR_4 BUILT_IN_SYNC_FETCH_AND_OR_8
126 BUILT_IN_SYNC_FETCH_AND_OR_16
127 BUILT_IN_SYNC_FETCH_AND_XOR_1 BUILT_IN_SYNC_FETCH_AND_XOR_2
128 BUILT_IN_SYNC_FETCH_AND_XOR_4 BUILT_IN_SYNC_FETCH_AND_XOR_8
129 BUILT_IN_SYNC_FETCH_AND_XOR_16
130 BUILT_IN_SYNC_XOR_AND_FETCH_1 BUILT_IN_SYNC_XOR_AND_FETCH_2
131 BUILT_IN_SYNC_XOR_AND_FETCH_4 BUILT_IN_SYNC_XOR_AND_FETCH_8
132 BUILT_IN_SYNC_XOR_AND_FETCH_16)
133 /* __atomic_fetch_and_*. */
134 (define_operator_list ATOMIC_FETCH_AND_N
135 BUILT_IN_ATOMIC_FETCH_AND_1 BUILT_IN_ATOMIC_FETCH_AND_2
136 BUILT_IN_ATOMIC_FETCH_AND_4 BUILT_IN_ATOMIC_FETCH_AND_8
137 BUILT_IN_ATOMIC_FETCH_AND_16)
138 /* __sync_fetch_and_and_*. */
139 (define_operator_list SYNC_FETCH_AND_AND_N
140 BUILT_IN_SYNC_FETCH_AND_AND_1 BUILT_IN_SYNC_FETCH_AND_AND_2
141 BUILT_IN_SYNC_FETCH_AND_AND_4 BUILT_IN_SYNC_FETCH_AND_AND_8
142 BUILT_IN_SYNC_FETCH_AND_AND_16)
144 /* With nop_convert? combine convert? and view_convert? in one pattern
145 plus conditionalize on tree_nop_conversion_p conversions. */
146 (match (nop_convert @0)
148 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))))
149 (match (nop_convert @0)
151 (if (VECTOR_TYPE_P (type) && VECTOR_TYPE_P (TREE_TYPE (@0))
152 && known_eq (TYPE_VECTOR_SUBPARTS (type),
153 TYPE_VECTOR_SUBPARTS (TREE_TYPE (@0)))
154 && tree_nop_conversion_p (TREE_TYPE (type), TREE_TYPE (TREE_TYPE (@0))))))
156 /* Transform likes of (char) ABS_EXPR <(int) x> into (char) ABSU_EXPR <x>
157 ABSU_EXPR returns unsigned absolute value of the operand and the operand
158 of the ABSU_EXPR will have the corresponding signed type. */
159 (simplify (abs (convert @0))
160 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
161 && !TYPE_UNSIGNED (TREE_TYPE (@0))
162 && element_precision (type) > element_precision (TREE_TYPE (@0)))
163 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
164 (convert (absu:utype @0)))))
167 /* Optimize (X + (X >> (prec - 1))) ^ (X >> (prec - 1)) into abs (X). */
169 (bit_xor:c (plus:c @0 (rshift@2 @0 INTEGER_CST@1)) @2)
170 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
171 && !TYPE_UNSIGNED (TREE_TYPE (@0))
172 && wi::to_widest (@1) == element_precision (TREE_TYPE (@0)) - 1)
176 /* Simplifications of operations with one constant operand and
177 simplifications to constants or single values. */
179 (for op (plus pointer_plus minus bit_ior bit_xor)
181 (op @0 integer_zerop)
184 /* 0 +p index -> (type)index */
186 (pointer_plus integer_zerop @1)
187 (non_lvalue (convert @1)))
189 /* ptr - 0 -> (type)ptr */
191 (pointer_diff @0 integer_zerop)
194 /* See if ARG1 is zero and X + ARG1 reduces to X.
195 Likewise if the operands are reversed. */
197 (plus:c @0 real_zerop@1)
198 (if (fold_real_zero_addition_p (type, @0, @1, 0))
201 /* See if ARG1 is zero and X - ARG1 reduces to X. */
203 (minus @0 real_zerop@1)
204 (if (fold_real_zero_addition_p (type, @0, @1, 1))
207 /* Even if the fold_real_zero_addition_p can't simplify X + 0.0
208 into X, we can optimize (X + 0.0) + 0.0 or (X + 0.0) - 0.0
209 or (X - 0.0) + 0.0 into X + 0.0 and (X - 0.0) - 0.0 into X - 0.0
210 if not -frounding-math. For sNaNs the first operation would raise
211 exceptions but turn the result into qNan, so the second operation
212 would not raise it. */
213 (for inner_op (plus minus)
214 (for outer_op (plus minus)
216 (outer_op (inner_op@3 @0 REAL_CST@1) REAL_CST@2)
219 && !HONOR_SIGN_DEPENDENT_ROUNDING (type))
220 (with { bool inner_plus = ((inner_op == PLUS_EXPR)
221 ^ REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@1)));
223 = ((outer_op == PLUS_EXPR)
224 ^ REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@2))); }
225 (if (outer_plus && !inner_plus)
230 This is unsafe for certain floats even in non-IEEE formats.
231 In IEEE, it is unsafe because it does wrong for NaNs.
232 PR middle-end/98420: x - x may be -0.0 with FE_DOWNWARD.
233 Also note that operand_equal_p is always false if an operand
237 (if (!FLOAT_TYPE_P (type)
238 || (!tree_expr_maybe_nan_p (@0)
239 && !tree_expr_maybe_infinite_p (@0)
240 && (!HONOR_SIGN_DEPENDENT_ROUNDING (type)
241 || !HONOR_SIGNED_ZEROS (type))))
242 { build_zero_cst (type); }))
244 (pointer_diff @@0 @0)
245 { build_zero_cst (type); })
248 (mult @0 integer_zerop@1)
251 /* -x == x -> x == 0 */
254 (cmp:c @0 (negate @0))
255 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
256 && !TYPE_OVERFLOW_WRAPS (TREE_TYPE(@0)))
257 (cmp @0 { build_zero_cst (TREE_TYPE(@0)); }))))
259 /* Maybe fold x * 0 to 0. The expressions aren't the same
260 when x is NaN, since x * 0 is also NaN. Nor are they the
261 same in modes with signed zeros, since multiplying a
262 negative value by 0 gives -0, not +0. Nor when x is +-Inf,
263 since x * 0 is NaN. */
265 (mult @0 real_zerop@1)
266 (if (!tree_expr_maybe_nan_p (@0)
267 && (!HONOR_NANS (type) || !tree_expr_maybe_infinite_p (@0))
268 && (!HONOR_SIGNED_ZEROS (type) || tree_expr_nonnegative_p (@0)))
271 /* In IEEE floating point, x*1 is not equivalent to x for snans.
272 Likewise for complex arithmetic with signed zeros. */
275 (if (!tree_expr_maybe_signaling_nan_p (@0)
276 && (!HONOR_SIGNED_ZEROS (type)
277 || !COMPLEX_FLOAT_TYPE_P (type)))
280 /* Transform x * -1.0 into -x. */
282 (mult @0 real_minus_onep)
283 (if (!tree_expr_maybe_signaling_nan_p (@0)
284 && (!HONOR_SIGNED_ZEROS (type)
285 || !COMPLEX_FLOAT_TYPE_P (type)))
288 /* Transform x * { 0 or 1, 0 or 1, ... } into x & { 0 or -1, 0 or -1, ...},
289 unless the target has native support for the former but not the latter. */
291 (mult @0 VECTOR_CST@1)
292 (if (initializer_each_zero_or_onep (@1)
293 && !HONOR_SNANS (type)
294 && !HONOR_SIGNED_ZEROS (type))
295 (with { tree itype = FLOAT_TYPE_P (type) ? unsigned_type_for (type) : type; }
297 && (!VECTOR_MODE_P (TYPE_MODE (type))
298 || (VECTOR_MODE_P (TYPE_MODE (itype))
299 && optab_handler (and_optab,
300 TYPE_MODE (itype)) != CODE_FOR_nothing)))
301 (view_convert (bit_and:itype (view_convert @0)
302 (ne @1 { build_zero_cst (type); })))))))
304 (for cmp (gt ge lt le)
305 outp (convert convert negate negate)
306 outn (negate negate convert convert)
307 /* Transform X * (X > 0.0 ? 1.0 : -1.0) into abs(X). */
308 /* Transform X * (X >= 0.0 ? 1.0 : -1.0) into abs(X). */
309 /* Transform X * (X < 0.0 ? 1.0 : -1.0) into -abs(X). */
310 /* Transform X * (X <= 0.0 ? 1.0 : -1.0) into -abs(X). */
312 (mult:c @0 (cond (cmp @0 real_zerop) real_onep@1 real_minus_onep))
313 (if (!tree_expr_maybe_nan_p (@0) && !HONOR_SIGNED_ZEROS (type))
315 /* Transform X * (X > 0.0 ? -1.0 : 1.0) into -abs(X). */
316 /* Transform X * (X >= 0.0 ? -1.0 : 1.0) into -abs(X). */
317 /* Transform X * (X < 0.0 ? -1.0 : 1.0) into abs(X). */
318 /* Transform X * (X <= 0.0 ? -1.0 : 1.0) into abs(X). */
320 (mult:c @0 (cond (cmp @0 real_zerop) real_minus_onep real_onep@1))
321 (if (!tree_expr_maybe_nan_p (@0) && !HONOR_SIGNED_ZEROS (type))
324 /* Transform X * copysign (1.0, X) into abs(X). */
326 (mult:c @0 (COPYSIGN_ALL real_onep @0))
327 (if (!tree_expr_maybe_nan_p (@0) && !HONOR_SIGNED_ZEROS (type))
330 /* Transform X * copysign (1.0, -X) into -abs(X). */
332 (mult:c @0 (COPYSIGN_ALL real_onep (negate @0)))
333 (if (!tree_expr_maybe_nan_p (@0) && !HONOR_SIGNED_ZEROS (type))
336 /* Transform copysign (CST, X) into copysign (ABS(CST), X). */
338 (COPYSIGN_ALL REAL_CST@0 @1)
339 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@0)))
340 (COPYSIGN_ALL (negate @0) @1)))
342 /* (x >= 0 ? x : 0) + (x <= 0 ? -x : 0) -> abs x. */
344 (plus:c (max @0 integer_zerop) (max (negate @0) integer_zerop))
347 /* X * 1, X / 1 -> X. */
348 (for op (mult trunc_div ceil_div floor_div round_div exact_div)
353 /* (A / (1 << B)) -> (A >> B).
354 Only for unsigned A. For signed A, this would not preserve rounding
356 For example: (-1 / ( 1 << B)) != -1 >> B.
357 Also handle widening conversions, like:
358 (A / (unsigned long long) (1U << B)) -> (A >> B)
360 (A / (unsigned long long) (1 << B)) -> (A >> B).
361 If the left shift is signed, it can be done only if the upper bits
362 of A starting from shift's type sign bit are zero, as
363 (unsigned long long) (1 << 31) is -2147483648ULL, not 2147483648ULL,
364 so it is valid only if A >> 31 is zero. */
366 (trunc_div (convert?@0 @3) (convert2? (lshift integer_onep@1 @2)))
367 (if ((TYPE_UNSIGNED (type) || tree_expr_nonnegative_p (@0))
368 && (!VECTOR_TYPE_P (type)
369 || target_supports_op_p (type, RSHIFT_EXPR, optab_vector)
370 || target_supports_op_p (type, RSHIFT_EXPR, optab_scalar))
371 && (useless_type_conversion_p (type, TREE_TYPE (@1))
372 || (element_precision (type) >= element_precision (TREE_TYPE (@1))
373 && (TYPE_UNSIGNED (TREE_TYPE (@1))
374 || (element_precision (type)
375 == element_precision (TREE_TYPE (@1)))
376 || (INTEGRAL_TYPE_P (type)
377 && (tree_nonzero_bits (@0)
378 & wi::mask (element_precision (TREE_TYPE (@1)) - 1,
380 element_precision (type))) == 0)))))
381 (if (!VECTOR_TYPE_P (type)
382 && useless_type_conversion_p (TREE_TYPE (@3), TREE_TYPE (@1))
383 && element_precision (TREE_TYPE (@3)) < element_precision (type))
384 (convert (rshift @3 @2))
387 /* Preserve explicit divisions by 0: the C++ front-end wants to detect
388 undefined behavior in constexpr evaluation, and assuming that the division
389 traps enables better optimizations than these anyway. */
390 (for div (trunc_div ceil_div floor_div round_div exact_div)
391 /* 0 / X is always zero. */
393 (div integer_zerop@0 @1)
394 /* But not for 0 / 0 so that we can get the proper warnings and errors. */
395 (if (!integer_zerop (@1))
399 (div @0 integer_minus_onep@1)
400 (if (!TYPE_UNSIGNED (type))
402 /* X / bool_range_Y is X. */
405 (if (INTEGRAL_TYPE_P (type)
406 && ssa_name_has_boolean_range (@1)
407 && !flag_non_call_exceptions)
412 /* But not for 0 / 0 so that we can get the proper warnings and errors.
413 And not for _Fract types where we can't build 1. */
414 (if (!ALL_FRACT_MODE_P (TYPE_MODE (type))
415 && !integer_zerop (@0)
416 && (!flag_non_call_exceptions || tree_expr_nonzero_p (@0)))
417 { build_one_cst (type); }))
418 /* X / abs (X) is X < 0 ? -1 : 1. */
421 (if (INTEGRAL_TYPE_P (type)
422 && TYPE_OVERFLOW_UNDEFINED (type)
423 && !integer_zerop (@0)
424 && (!flag_non_call_exceptions || tree_expr_nonzero_p (@0)))
425 (cond (lt @0 { build_zero_cst (type); })
426 { build_minus_one_cst (type); } { build_one_cst (type); })))
429 (div:C @0 (negate @0))
430 (if ((INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
431 && TYPE_OVERFLOW_UNDEFINED (type)
432 && !integer_zerop (@0)
433 && (!flag_non_call_exceptions || tree_expr_nonzero_p (@0)))
434 { build_minus_one_cst (type); })))
436 /* For unsigned integral types, FLOOR_DIV_EXPR is the same as
437 TRUNC_DIV_EXPR. Rewrite into the latter in this case. Similarly
438 for MOD instead of DIV. */
439 (for floor_divmod (floor_div floor_mod)
440 trunc_divmod (trunc_div trunc_mod)
443 (if ((INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
444 && TYPE_UNSIGNED (type))
445 (trunc_divmod @0 @1))))
447 /* 1 / X -> X == 1 for unsigned integer X.
448 1 / X -> X >= -1 && X <= 1 ? X : 0 for signed integer X.
449 But not for 1 / 0 so that we can get proper warnings and errors,
450 and not for 1-bit integers as they are edge cases better handled
453 (trunc_div integer_onep@0 @1)
454 (if (INTEGRAL_TYPE_P (type)
455 && TYPE_PRECISION (type) > 1
456 && !integer_zerop (@1)
457 && (!flag_non_call_exceptions || tree_expr_nonzero_p (@1)))
458 (if (TYPE_UNSIGNED (type))
459 (convert (eq:boolean_type_node @1 { build_one_cst (type); }))
460 (with { tree utype = unsigned_type_for (type); }
461 (cond (le (plus (convert:utype @1) { build_one_cst (utype); })
462 { build_int_cst (utype, 2); })
463 @1 { build_zero_cst (type); })))))
465 /* Combine two successive divisions. Note that combining ceil_div
466 and floor_div is trickier and combining round_div even more so. */
467 (for div (trunc_div exact_div)
469 (div (div@3 @0 INTEGER_CST@1) INTEGER_CST@2)
471 wi::overflow_type overflow;
472 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@2),
473 TYPE_SIGN (type), &overflow);
475 (if (div == EXACT_DIV_EXPR
476 || optimize_successive_divisions_p (@2, @3))
478 (div @0 { wide_int_to_tree (type, mul); })
479 (if (TYPE_UNSIGNED (type)
480 || mul != wi::min_value (TYPE_PRECISION (type), SIGNED))
481 { build_zero_cst (type); }))))))
483 /* Combine successive multiplications. Similar to above, but handling
484 overflow is different. */
486 (mult (mult @0 INTEGER_CST@1) INTEGER_CST@2)
488 wi::overflow_type overflow;
489 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@2),
490 TYPE_SIGN (type), &overflow);
492 /* Skip folding on overflow: the only special case is @1 * @2 == -INT_MIN,
493 otherwise undefined overflow implies that @0 must be zero. */
494 (if (!overflow || TYPE_OVERFLOW_WRAPS (type))
495 (mult @0 { wide_int_to_tree (type, mul); }))))
497 /* Similar to above, but there could be an extra add/sub between
498 successive multuiplications. */
500 (mult (plus:s (mult:s@4 @0 INTEGER_CST@1) INTEGER_CST@2) INTEGER_CST@3)
502 bool overflowed = true;
503 wi::overflow_type ovf1, ovf2;
504 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@3),
505 TYPE_SIGN (type), &ovf1);
506 wide_int add = wi::mul (wi::to_wide (@2), wi::to_wide (@3),
507 TYPE_SIGN (type), &ovf2);
508 if (TYPE_OVERFLOW_UNDEFINED (type))
512 if (ovf1 == wi::OVF_NONE && ovf2 == wi::OVF_NONE
513 && get_global_range_query ()->range_of_expr (vr0, @4)
514 && vr0.kind () == VR_RANGE)
516 wide_int wmin0 = vr0.lower_bound ();
517 wide_int wmax0 = vr0.upper_bound ();
518 wmin0 = wi::mul (wmin0, wi::to_wide (@3), TYPE_SIGN (type), &ovf1);
519 wmax0 = wi::mul (wmax0, wi::to_wide (@3), TYPE_SIGN (type), &ovf2);
520 if (ovf1 == wi::OVF_NONE && ovf2 == wi::OVF_NONE)
522 wi::add (wmin0, add, TYPE_SIGN (type), &ovf1);
523 wi::add (wmax0, add, TYPE_SIGN (type), &ovf2);
524 if (ovf1 == wi::OVF_NONE && ovf2 == wi::OVF_NONE)
533 /* Skip folding on overflow. */
535 (plus (mult @0 { wide_int_to_tree (type, mul); })
536 { wide_int_to_tree (type, add); }))))
538 /* Similar to above, but a multiplication between successive additions. */
540 (plus (mult:s (plus:s @0 INTEGER_CST@1) INTEGER_CST@2) INTEGER_CST@3)
542 bool overflowed = true;
543 wi::overflow_type ovf1;
544 wi::overflow_type ovf2;
545 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@2),
546 TYPE_SIGN (type), &ovf1);
547 wide_int add = wi::add (mul, wi::to_wide (@3),
548 TYPE_SIGN (type), &ovf2);
549 if (TYPE_OVERFLOW_UNDEFINED (type))
553 if (ovf1 == wi::OVF_NONE && ovf2 == wi::OVF_NONE
554 && get_global_range_query ()->range_of_expr (vr0, @0)
555 && vr0.kind () == VR_RANGE)
557 wide_int wmin0 = vr0.lower_bound ();
558 wide_int wmax0 = vr0.upper_bound ();
559 wmin0 = wi::mul (wmin0, wi::to_wide (@2), TYPE_SIGN (type), &ovf1);
560 wmax0 = wi::mul (wmax0, wi::to_wide (@2), TYPE_SIGN (type), &ovf2);
561 if (ovf1 == wi::OVF_NONE && ovf2 == wi::OVF_NONE)
563 wi::add (wmin0, mul, TYPE_SIGN (type), &ovf1);
564 wi::add (wmax0, mul, TYPE_SIGN (type), &ovf2);
565 if (ovf1 == wi::OVF_NONE && ovf2 == wi::OVF_NONE)
574 /* Skip folding on overflow. */
576 (plus (mult @0 @2) { wide_int_to_tree (type, add); }))))
578 /* Optimize A / A to 1.0 if we don't care about
579 NaNs or Infinities. */
582 (if (FLOAT_TYPE_P (type)
583 && ! HONOR_NANS (type)
584 && ! HONOR_INFINITIES (type))
585 { build_one_cst (type); }))
587 /* Optimize -A / A to -1.0 if we don't care about
588 NaNs or Infinities. */
590 (rdiv:C @0 (negate @0))
591 (if (FLOAT_TYPE_P (type)
592 && ! HONOR_NANS (type)
593 && ! HONOR_INFINITIES (type))
594 { build_minus_one_cst (type); }))
596 /* PR71078: x / abs(x) -> copysign (1.0, x) */
598 (rdiv:C (convert? @0) (convert? (abs @0)))
599 (if (SCALAR_FLOAT_TYPE_P (type)
600 && ! HONOR_NANS (type)
601 && ! HONOR_INFINITIES (type))
603 (if (types_match (type, float_type_node))
604 (BUILT_IN_COPYSIGNF { build_one_cst (type); } (convert @0)))
605 (if (types_match (type, double_type_node))
606 (BUILT_IN_COPYSIGN { build_one_cst (type); } (convert @0)))
607 (if (types_match (type, long_double_type_node))
608 (BUILT_IN_COPYSIGNL { build_one_cst (type); } (convert @0))))))
610 /* In IEEE floating point, x/1 is not equivalent to x for snans. */
613 (if (!tree_expr_maybe_signaling_nan_p (@0))
616 /* In IEEE floating point, x/-1 is not equivalent to -x for snans. */
618 (rdiv @0 real_minus_onep)
619 (if (!tree_expr_maybe_signaling_nan_p (@0))
622 (if (flag_reciprocal_math)
623 /* Convert (A/B)/C to A/(B*C). */
625 (rdiv (rdiv:s @0 @1) @2)
626 (rdiv @0 (mult @1 @2)))
628 /* Canonicalize x / (C1 * y) to (x * C2) / y. */
630 (rdiv @0 (mult:s @1 REAL_CST@2))
632 { tree tem = const_binop (RDIV_EXPR, type, build_one_cst (type), @2); }
634 (rdiv (mult @0 { tem; } ) @1))))
636 /* Convert A/(B/C) to (A/B)*C */
638 (rdiv @0 (rdiv:s @1 @2))
639 (mult (rdiv @0 @1) @2)))
641 /* Simplify x / (- y) to -x / y. */
643 (rdiv @0 (negate @1))
644 (rdiv (negate @0) @1))
646 (if (flag_unsafe_math_optimizations)
647 /* Simplify (C / x op 0.0) to x op 0.0 for C != 0, C != Inf/Nan.
648 Since C / x may underflow to zero, do this only for unsafe math. */
649 (for op (lt le gt ge)
652 (op (rdiv REAL_CST@0 @1) real_zerop@2)
653 (if (!HONOR_SIGNED_ZEROS (@1) && !HONOR_INFINITIES (@1))
655 (if (real_less (&dconst0, TREE_REAL_CST_PTR (@0)))
657 /* For C < 0, use the inverted operator. */
658 (if (real_less (TREE_REAL_CST_PTR (@0), &dconst0))
661 /* Optimize (X & (-A)) / A where A is a power of 2, to X >> log2(A) */
662 (for div (trunc_div ceil_div floor_div round_div exact_div)
664 (div (convert? (bit_and @0 INTEGER_CST@1)) INTEGER_CST@2)
665 (if (integer_pow2p (@2)
666 && tree_int_cst_sgn (@2) > 0
667 && tree_nop_conversion_p (type, TREE_TYPE (@0))
668 && wi::to_wide (@2) + wi::to_wide (@1) == 0)
670 { build_int_cst (integer_type_node,
671 wi::exact_log2 (wi::to_wide (@2))); }))))
673 /* If ARG1 is a constant, we can convert this to a multiply by the
674 reciprocal. This does not have the same rounding properties,
675 so only do this if -freciprocal-math. We can actually
676 always safely do it if ARG1 is a power of two, but it's hard to
677 tell if it is or not in a portable manner. */
678 (for cst (REAL_CST COMPLEX_CST VECTOR_CST)
682 (if (flag_reciprocal_math
685 { tree tem = const_binop (RDIV_EXPR, type, build_one_cst (type), @1); }
687 (mult @0 { tem; } )))
688 (if (cst != COMPLEX_CST)
689 (with { tree inverse = exact_inverse (type, @1); }
691 (mult @0 { inverse; } ))))))))
693 (for mod (ceil_mod floor_mod round_mod trunc_mod)
694 /* 0 % X is always zero. */
696 (mod integer_zerop@0 @1)
697 /* But not for 0 % 0 so that we can get the proper warnings and errors. */
698 (if (!integer_zerop (@1))
700 /* X % 1 is always zero. */
702 (mod @0 integer_onep)
703 { build_zero_cst (type); })
704 /* X % -1 is zero. */
706 (mod @0 integer_minus_onep@1)
707 (if (!TYPE_UNSIGNED (type))
708 { build_zero_cst (type); }))
712 /* But not for 0 % 0 so that we can get the proper warnings and errors. */
713 (if (!integer_zerop (@0))
714 { build_zero_cst (type); }))
715 /* (X % Y) % Y is just X % Y. */
717 (mod (mod@2 @0 @1) @1)
719 /* From extract_muldiv_1: (X * C1) % C2 is zero if C1 is a multiple of C2. */
721 (mod (mult @0 INTEGER_CST@1) INTEGER_CST@2)
722 (if (ANY_INTEGRAL_TYPE_P (type)
723 && TYPE_OVERFLOW_UNDEFINED (type)
724 && wi::multiple_of_p (wi::to_wide (@1), wi::to_wide (@2),
726 { build_zero_cst (type); }))
727 /* For (X % C) == 0, if X is signed and C is power of 2, use unsigned
728 modulo and comparison, since it is simpler and equivalent. */
731 (cmp (mod @0 integer_pow2p@2) integer_zerop@1)
732 (if (!TYPE_UNSIGNED (TREE_TYPE (@0)))
733 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
734 (cmp (mod (convert:utype @0) (convert:utype @2)) (convert:utype @1)))))))
736 /* X % -C is the same as X % C. */
738 (trunc_mod @0 INTEGER_CST@1)
739 (if (TYPE_SIGN (type) == SIGNED
740 && !TREE_OVERFLOW (@1)
741 && wi::neg_p (wi::to_wide (@1))
742 && !TYPE_OVERFLOW_TRAPS (type)
743 /* Avoid this transformation if C is INT_MIN, i.e. C == -C. */
744 && !sign_bit_p (@1, @1))
745 (trunc_mod @0 (negate @1))))
747 /* X % -Y is the same as X % Y. */
749 (trunc_mod @0 (convert? (negate @1)))
750 (if (INTEGRAL_TYPE_P (type)
751 && !TYPE_UNSIGNED (type)
752 && !TYPE_OVERFLOW_TRAPS (type)
753 && tree_nop_conversion_p (type, TREE_TYPE (@1))
754 /* Avoid this transformation if X might be INT_MIN or
755 Y might be -1, because we would then change valid
756 INT_MIN % -(-1) into invalid INT_MIN % -1. */
757 && (expr_not_equal_to (@0, wi::to_wide (TYPE_MIN_VALUE (type)))
758 || expr_not_equal_to (@1, wi::minus_one (TYPE_PRECISION
760 (trunc_mod @0 (convert @1))))
762 /* X - (X / Y) * Y is the same as X % Y. */
764 (minus (convert1? @0) (convert2? (mult:c (trunc_div @@0 @@1) @1)))
765 (if (INTEGRAL_TYPE_P (type) || VECTOR_INTEGER_TYPE_P (type))
766 (convert (trunc_mod @0 @1))))
768 /* x * (1 + y / x) - y -> x - y % x */
770 (minus (mult:cs @0 (plus:s (trunc_div:s @1 @0) integer_onep)) @1)
771 (if (INTEGRAL_TYPE_P (type))
772 (minus @0 (trunc_mod @1 @0))))
774 /* Optimize TRUNC_MOD_EXPR by a power of two into a BIT_AND_EXPR,
775 i.e. "X % C" into "X & (C - 1)", if X and C are positive.
776 Also optimize A % (C << N) where C is a power of 2,
777 to A & ((C << N) - 1).
778 Also optimize "A shift (B % C)", if C is a power of 2, to
779 "A shift (B & (C - 1))". SHIFT operation include "<<" and ">>"
780 and assume (B % C) is nonnegative as shifts negative values would
782 (match (power_of_two_cand @1)
784 (match (power_of_two_cand @1)
785 (lshift INTEGER_CST@1 @2))
786 (for mod (trunc_mod floor_mod)
787 (for shift (lshift rshift)
789 (shift @0 (mod @1 (power_of_two_cand@2 @3)))
790 (if (integer_pow2p (@3) && tree_int_cst_sgn (@3) > 0)
791 (shift @0 (bit_and @1 (minus @2 { build_int_cst (TREE_TYPE (@2),
794 (mod @0 (convert? (power_of_two_cand@1 @2)))
795 (if ((TYPE_UNSIGNED (type) || tree_expr_nonnegative_p (@0))
796 /* Allow any integral conversions of the divisor, except
797 conversion from narrower signed to wider unsigned type
798 where if @1 would be negative power of two, the divisor
799 would not be a power of two. */
800 && INTEGRAL_TYPE_P (type)
801 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
802 && (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@1))
803 || TYPE_UNSIGNED (TREE_TYPE (@1))
804 || !TYPE_UNSIGNED (type))
805 && integer_pow2p (@2) && tree_int_cst_sgn (@2) > 0)
806 (with { tree utype = TREE_TYPE (@1);
807 if (!TYPE_OVERFLOW_WRAPS (utype))
808 utype = unsigned_type_for (utype); }
809 (bit_and @0 (convert (minus (convert:utype @1)
810 { build_one_cst (utype); })))))))
812 /* Simplify (unsigned t * 2)/2 -> unsigned t & 0x7FFFFFFF. */
814 (trunc_div (mult @0 integer_pow2p@1) @1)
815 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)) && TYPE_UNSIGNED (TREE_TYPE (@0)))
816 (bit_and @0 { wide_int_to_tree
817 (type, wi::mask (TYPE_PRECISION (type)
818 - wi::exact_log2 (wi::to_wide (@1)),
819 false, TYPE_PRECISION (type))); })))
821 /* Simplify (unsigned t / 2) * 2 -> unsigned t & ~1. */
823 (mult (trunc_div @0 integer_pow2p@1) @1)
824 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)) && TYPE_UNSIGNED (TREE_TYPE (@0)))
825 (bit_and @0 (negate @1))))
827 /* Simplify (t * 2) / 2) -> t. */
828 (for div (trunc_div ceil_div floor_div round_div exact_div)
830 (div (mult:c @0 @1) @1)
831 (if (ANY_INTEGRAL_TYPE_P (type))
832 (if (TYPE_OVERFLOW_UNDEFINED (type))
837 bool overflowed = true;
838 value_range vr0, vr1;
839 if (INTEGRAL_TYPE_P (type)
840 && get_global_range_query ()->range_of_expr (vr0, @0)
841 && get_global_range_query ()->range_of_expr (vr1, @1)
842 && vr0.kind () == VR_RANGE
843 && vr1.kind () == VR_RANGE)
845 wide_int wmin0 = vr0.lower_bound ();
846 wide_int wmax0 = vr0.upper_bound ();
847 wide_int wmin1 = vr1.lower_bound ();
848 wide_int wmax1 = vr1.upper_bound ();
849 /* If the multiplication can't overflow/wrap around, then
850 it can be optimized too. */
851 wi::overflow_type min_ovf, max_ovf;
852 wi::mul (wmin0, wmin1, TYPE_SIGN (type), &min_ovf);
853 wi::mul (wmax0, wmax1, TYPE_SIGN (type), &max_ovf);
854 if (min_ovf == wi::OVF_NONE && max_ovf == wi::OVF_NONE)
856 wi::mul (wmin0, wmax1, TYPE_SIGN (type), &min_ovf);
857 wi::mul (wmax0, wmin1, TYPE_SIGN (type), &max_ovf);
858 if (min_ovf == wi::OVF_NONE && max_ovf == wi::OVF_NONE)
869 /* Simplify cos(-x) and cos(|x|) -> cos(x). Similarly for cosh. */
874 /* Simplify pow(-x, y) and pow(|x|,y) -> pow(x,y) if y is an even integer. */
877 (pows (op @0) REAL_CST@1)
878 (with { HOST_WIDE_INT n; }
879 (if (real_isinteger (&TREE_REAL_CST (@1), &n) && (n & 1) == 0)
881 /* Likewise for powi. */
884 (pows (op @0) INTEGER_CST@1)
885 (if ((wi::to_wide (@1) & 1) == 0)
887 /* Strip negate and abs from both operands of hypot. */
895 /* copysign(-x, y) and copysign(abs(x), y) -> copysign(x, y). */
896 (for copysigns (COPYSIGN_ALL)
898 (copysigns (op @0) @1)
901 /* abs(x)*abs(x) -> x*x. Should be valid for all types. */
906 /* Convert absu(x)*absu(x) -> x*x. */
908 (mult (absu@1 @0) @1)
909 (mult (convert@2 @0) @2))
911 /* cos(copysign(x, y)) -> cos(x). Similarly for cosh. */
915 (coss (copysigns @0 @1))
918 /* pow(copysign(x, y), z) -> pow(x, z) if z is an even integer. */
922 (pows (copysigns @0 @2) REAL_CST@1)
923 (with { HOST_WIDE_INT n; }
924 (if (real_isinteger (&TREE_REAL_CST (@1), &n) && (n & 1) == 0)
926 /* Likewise for powi. */
930 (pows (copysigns @0 @2) INTEGER_CST@1)
931 (if ((wi::to_wide (@1) & 1) == 0)
936 /* hypot(copysign(x, y), z) -> hypot(x, z). */
938 (hypots (copysigns @0 @1) @2)
940 /* hypot(x, copysign(y, z)) -> hypot(x, y). */
942 (hypots @0 (copysigns @1 @2))
945 /* copysign(x, CST) -> [-]abs (x). */
946 (for copysigns (COPYSIGN_ALL)
948 (copysigns @0 REAL_CST@1)
949 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
953 /* copysign(copysign(x, y), z) -> copysign(x, z). */
954 (for copysigns (COPYSIGN_ALL)
956 (copysigns (copysigns @0 @1) @2)
959 /* copysign(x,y)*copysign(x,y) -> x*x. */
960 (for copysigns (COPYSIGN_ALL)
962 (mult (copysigns@2 @0 @1) @2)
965 /* ccos(-x) -> ccos(x). Similarly for ccosh. */
966 (for ccoss (CCOS CCOSH)
971 /* cabs(-x) and cos(conj(x)) -> cabs(x). */
972 (for ops (conj negate)
978 /* Fold (a * (1 << b)) into (a << b) */
980 (mult:c @0 (convert? (lshift integer_onep@1 @2)))
981 (if (! FLOAT_TYPE_P (type)
982 && tree_nop_conversion_p (type, TREE_TYPE (@1)))
985 /* Shifts by constants distribute over several binary operations,
986 hence (X << C) + (Y << C) can be simplified to (X + Y) << C. */
989 (op (lshift:s @0 @1) (lshift:s @2 @1))
990 (if (INTEGRAL_TYPE_P (type)
991 && TYPE_OVERFLOW_WRAPS (type)
992 && !TYPE_SATURATING (type))
993 (lshift (op @0 @2) @1))))
995 (for op (bit_and bit_ior bit_xor)
997 (op (lshift:s @0 @1) (lshift:s @2 @1))
998 (if (INTEGRAL_TYPE_P (type))
999 (lshift (op @0 @2) @1)))
1001 (op (rshift:s @0 @1) (rshift:s @2 @1))
1002 (if (INTEGRAL_TYPE_P (type))
1003 (rshift (op @0 @2) @1))))
1005 /* Fold (1 << (C - x)) where C = precision(type) - 1
1006 into ((1 << C) >> x). */
1008 (lshift integer_onep@0 (minus@1 INTEGER_CST@2 @3))
1009 (if (INTEGRAL_TYPE_P (type)
1010 && wi::eq_p (wi::to_wide (@2), TYPE_PRECISION (type) - 1)
1012 (if (TYPE_UNSIGNED (type))
1013 (rshift (lshift @0 @2) @3)
1015 { tree utype = unsigned_type_for (type); }
1016 (convert (rshift (lshift (convert:utype @0) @2) @3))))))
1018 /* Fold ((type)(a<0)) << SIGNBITOFA into ((type)a) & signbit. */
1020 (lshift (convert (lt @0 integer_zerop@1)) INTEGER_CST@2)
1021 (if (TYPE_SIGN (TREE_TYPE (@0)) == SIGNED
1022 && wi::eq_p (wi::to_wide (@2), TYPE_PRECISION (TREE_TYPE (@0)) - 1))
1023 (with { wide_int wone = wi::one (TYPE_PRECISION (type)); }
1024 (bit_and (convert @0)
1025 { wide_int_to_tree (type,
1026 wi::lshift (wone, wi::to_wide (@2))); }))))
1028 /* Fold (-x >> C) into -(x > 0) where C = precision(type) - 1. */
1029 (for cst (INTEGER_CST VECTOR_CST)
1031 (rshift (negate:s @0) cst@1)
1032 (if (!TYPE_UNSIGNED (type)
1033 && TYPE_OVERFLOW_UNDEFINED (type))
1034 (with { tree stype = TREE_TYPE (@1);
1035 tree bt = truth_type_for (type);
1036 tree zeros = build_zero_cst (type);
1037 tree cst = NULL_TREE; }
1039 /* Handle scalar case. */
1040 (if (INTEGRAL_TYPE_P (type)
1041 /* If we apply the rule to the scalar type before vectorization
1042 we will enforce the result of the comparison being a bool
1043 which will require an extra AND on the result that will be
1044 indistinguishable from when the user did actually want 0
1045 or 1 as the result so it can't be removed. */
1046 && canonicalize_math_after_vectorization_p ()
1047 && wi::eq_p (wi::to_wide (@1), TYPE_PRECISION (type) - 1))
1048 (negate (convert (gt @0 { zeros; }))))
1049 /* Handle vector case. */
1050 (if (VECTOR_INTEGER_TYPE_P (type)
1051 /* First check whether the target has the same mode for vector
1052 comparison results as it's operands do. */
1053 && TYPE_MODE (bt) == TYPE_MODE (type)
1054 /* Then check to see if the target is able to expand the comparison
1055 with the given type later on, otherwise we may ICE. */
1056 && expand_vec_cmp_expr_p (type, bt, GT_EXPR)
1057 && (cst = uniform_integer_cst_p (@1)) != NULL
1058 && wi::eq_p (wi::to_wide (cst), element_precision (type) - 1))
1059 (view_convert (gt:bt @0 { zeros; }))))))))
1061 /* Fold (C1/X)*C2 into (C1*C2)/X. */
1063 (mult (rdiv@3 REAL_CST@0 @1) REAL_CST@2)
1064 (if (flag_associative_math
1067 { tree tem = const_binop (MULT_EXPR, type, @0, @2); }
1069 (rdiv { tem; } @1)))))
1071 /* Simplify ~X & X as zero. */
1073 (bit_and:c (convert? @0) (convert? (bit_not @0)))
1074 { build_zero_cst (type); })
1076 /* PR71636: Transform x & ((1U << b) - 1) -> x & ~(~0U << b); */
1078 (bit_and:c @0 (plus:s (lshift:s integer_onep @1) integer_minus_onep))
1079 (if (TYPE_UNSIGNED (type))
1080 (bit_and @0 (bit_not (lshift { build_all_ones_cst (type); } @1)))))
1082 (for bitop (bit_and bit_ior)
1084 /* PR35691: Transform
1085 (x == 0 & y == 0) -> (x | typeof(x)(y)) == 0.
1086 (x != 0 | y != 0) -> (x | typeof(x)(y)) != 0. */
1088 (bitop (cmp @0 integer_zerop@2) (cmp @1 integer_zerop))
1089 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1090 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
1091 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1)))
1092 (cmp (bit_ior @0 (convert @1)) @2)))
1094 (x == -1 & y == -1) -> (x & typeof(x)(y)) == -1.
1095 (x != -1 | y != -1) -> (x & typeof(x)(y)) != -1. */
1097 (bitop (cmp @0 integer_all_onesp@2) (cmp @1 integer_all_onesp))
1098 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1099 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
1100 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1)))
1101 (cmp (bit_and @0 (convert @1)) @2))))
1103 /* Fold (A & ~B) - (A & B) into (A ^ B) - B. */
1105 (minus (bit_and:cs @0 (bit_not @1)) (bit_and:cs @0 @1))
1106 (minus (bit_xor @0 @1) @1))
1108 (minus (bit_and:s @0 INTEGER_CST@2) (bit_and:s @0 INTEGER_CST@1))
1109 (if (~wi::to_wide (@2) == wi::to_wide (@1))
1110 (minus (bit_xor @0 @1) @1)))
1112 /* Fold (A & B) - (A & ~B) into B - (A ^ B). */
1114 (minus (bit_and:cs @0 @1) (bit_and:cs @0 (bit_not @1)))
1115 (minus @1 (bit_xor @0 @1)))
1117 /* Simplify (X & ~Y) |^+ (~X & Y) -> X ^ Y. */
1118 (for op (bit_ior bit_xor plus)
1120 (op (bit_and:c @0 (bit_not @1)) (bit_and:c (bit_not @0) @1))
1123 (op:c (bit_and @0 INTEGER_CST@2) (bit_and (bit_not @0) INTEGER_CST@1))
1124 (if (~wi::to_wide (@2) == wi::to_wide (@1))
1127 /* PR53979: Transform ((a ^ b) | a) -> (a | b) */
1129 (bit_ior:c (bit_xor:c @0 @1) @0)
1132 /* (a & ~b) | (a ^ b) --> a ^ b */
1134 (bit_ior:c (bit_and:c @0 (bit_not @1)) (bit_xor:c@2 @0 @1))
1137 /* (a & ~b) ^ ~a --> ~(a & b) */
1139 (bit_xor:c (bit_and:cs @0 (bit_not @1)) (bit_not @0))
1140 (bit_not (bit_and @0 @1)))
1142 /* (~a & b) ^ a --> (a | b) */
1144 (bit_xor:c (bit_and:cs (bit_not @0) @1) @0)
1147 /* (a | b) & ~(a ^ b) --> a & b */
1149 (bit_and:c (bit_ior @0 @1) (bit_not (bit_xor:c @0 @1)))
1152 /* a | ~(a ^ b) --> a | ~b */
1154 (bit_ior:c @0 (bit_not:s (bit_xor:c @0 @1)))
1155 (bit_ior @0 (bit_not @1)))
1157 /* (a | b) | (a &^ b) --> a | b */
1158 (for op (bit_and bit_xor)
1160 (bit_ior:c (bit_ior@2 @0 @1) (op:c @0 @1))
1163 /* (a & b) | ~(a ^ b) --> ~(a ^ b) */
1165 (bit_ior:c (bit_and:c @0 @1) (bit_not@2 (bit_xor @0 @1)))
1168 /* ~(~a & b) --> a | ~b */
1170 (bit_not (bit_and:cs (bit_not @0) @1))
1171 (bit_ior @0 (bit_not @1)))
1173 /* ~(~a | b) --> a & ~b */
1175 (bit_not (bit_ior:cs (bit_not @0) @1))
1176 (bit_and @0 (bit_not @1)))
1178 /* (a ^ b) & ((b ^ c) ^ a) --> (a ^ b) & ~c */
1180 (bit_and:c (bit_xor:c@3 @0 @1) (bit_xor:cs (bit_xor:cs @1 @2) @0))
1181 (bit_and @3 (bit_not @2)))
1183 /* (a ^ b) | ((b ^ c) ^ a) --> (a ^ b) | c */
1185 (bit_ior:c (bit_xor:c@3 @0 @1) (bit_xor:c (bit_xor:c @1 @2) @0))
1188 /* (~X | C) ^ D -> (X | C) ^ (~D ^ C) if (~D ^ C) can be simplified. */
1190 (bit_xor:c (bit_ior:cs (bit_not:s @0) @1) @2)
1191 (bit_xor (bit_ior @0 @1) (bit_xor! (bit_not! @2) @1)))
1193 /* (~X & C) ^ D -> (X & C) ^ (D ^ C) if (D ^ C) can be simplified. */
1195 (bit_xor:c (bit_and:cs (bit_not:s @0) @1) @2)
1196 (bit_xor (bit_and @0 @1) (bit_xor! @2 @1)))
1198 /* Simplify (~X & Y) to X ^ Y if we know that (X & ~Y) is 0. */
1200 (bit_and (bit_not SSA_NAME@0) INTEGER_CST@1)
1201 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1202 && wi::bit_and_not (get_nonzero_bits (@0), wi::to_wide (@1)) == 0)
1205 /* For constants M and N, if M == (1LL << cst) - 1 && (N & M) == M,
1206 ((A & N) + B) & M -> (A + B) & M
1207 Similarly if (N & M) == 0,
1208 ((A | N) + B) & M -> (A + B) & M
1209 and for - instead of + (or unary - instead of +)
1210 and/or ^ instead of |.
1211 If B is constant and (B & M) == 0, fold into A & M. */
1212 (for op (plus minus)
1213 (for bitop (bit_and bit_ior bit_xor)
1215 (bit_and (op:s (bitop:s@0 @3 INTEGER_CST@4) @1) INTEGER_CST@2)
1218 tree utype = fold_bit_and_mask (TREE_TYPE (@0), @2, op, @0, bitop,
1219 @3, @4, @1, ERROR_MARK, NULL_TREE,
1222 (convert (bit_and (op (convert:utype { pmop[0]; })
1223 (convert:utype { pmop[1]; }))
1224 (convert:utype @2))))))
1226 (bit_and (op:s @0 (bitop:s@1 @3 INTEGER_CST@4)) INTEGER_CST@2)
1229 tree utype = fold_bit_and_mask (TREE_TYPE (@0), @2, op, @0, ERROR_MARK,
1230 NULL_TREE, NULL_TREE, @1, bitop, @3,
1233 (convert (bit_and (op (convert:utype { pmop[0]; })
1234 (convert:utype { pmop[1]; }))
1235 (convert:utype @2)))))))
1237 (bit_and (op:s @0 @1) INTEGER_CST@2)
1240 tree utype = fold_bit_and_mask (TREE_TYPE (@0), @2, op, @0, ERROR_MARK,
1241 NULL_TREE, NULL_TREE, @1, ERROR_MARK,
1242 NULL_TREE, NULL_TREE, pmop); }
1244 (convert (bit_and (op (convert:utype { pmop[0]; })
1245 (convert:utype { pmop[1]; }))
1246 (convert:utype @2)))))))
1247 (for bitop (bit_and bit_ior bit_xor)
1249 (bit_and (negate:s (bitop:s@0 @2 INTEGER_CST@3)) INTEGER_CST@1)
1252 tree utype = fold_bit_and_mask (TREE_TYPE (@0), @1, NEGATE_EXPR, @0,
1253 bitop, @2, @3, NULL_TREE, ERROR_MARK,
1254 NULL_TREE, NULL_TREE, pmop); }
1256 (convert (bit_and (negate (convert:utype { pmop[0]; }))
1257 (convert:utype @1)))))))
1259 /* X % Y is smaller than Y. */
1262 (cmp (trunc_mod @0 @1) @1)
1263 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
1264 { constant_boolean_node (cmp == LT_EXPR, type); })))
1267 (cmp @1 (trunc_mod @0 @1))
1268 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
1269 { constant_boolean_node (cmp == GT_EXPR, type); })))
1273 (bit_ior @0 integer_all_onesp@1)
1278 (bit_ior @0 integer_zerop)
1283 (bit_and @0 integer_zerop@1)
1288 (for op (bit_ior bit_xor)
1290 (op:c (convert? @0) (convert? (bit_not @0)))
1291 (convert { build_all_ones_cst (TREE_TYPE (@0)); })))
1296 { build_zero_cst (type); })
1298 /* Canonicalize X ^ ~0 to ~X. */
1300 (bit_xor @0 integer_all_onesp@1)
1305 (bit_and @0 integer_all_onesp)
1308 /* x & x -> x, x | x -> x */
1309 (for bitop (bit_and bit_ior)
1314 /* x & C -> x if we know that x & ~C == 0. */
1317 (bit_and SSA_NAME@0 INTEGER_CST@1)
1318 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1319 && wi::bit_and_not (get_nonzero_bits (@0), wi::to_wide (@1)) == 0)
1323 /* ~(~X - Y) -> X + Y and ~(~X + Y) -> X - Y. */
1325 (bit_not (minus (bit_not @0) @1))
1328 (bit_not (plus:c (bit_not @0) @1))
1330 /* (~X - ~Y) -> Y - X. */
1332 (minus (bit_not @0) (bit_not @1))
1333 (if (!TYPE_OVERFLOW_SANITIZED (type))
1334 (with { tree utype = unsigned_type_for (type); }
1335 (convert (minus (convert:utype @1) (convert:utype @0))))))
1337 /* ~(X - Y) -> ~X + Y. */
1339 (bit_not (minus:s @0 @1))
1340 (plus (bit_not @0) @1))
1342 (bit_not (plus:s @0 INTEGER_CST@1))
1343 (if ((INTEGRAL_TYPE_P (type)
1344 && TYPE_UNSIGNED (type))
1345 || (!TYPE_OVERFLOW_SANITIZED (type)
1346 && may_negate_without_overflow_p (@1)))
1347 (plus (bit_not @0) { const_unop (NEGATE_EXPR, type, @1); })))
1350 /* ~X + Y -> (Y - X) - 1. */
1352 (plus:c (bit_not @0) @1)
1353 (if (ANY_INTEGRAL_TYPE_P (type)
1354 && TYPE_OVERFLOW_WRAPS (type)
1355 /* -1 - X is folded to ~X, so we'd recurse endlessly. */
1356 && !integer_all_onesp (@1))
1357 (plus (minus @1 @0) { build_minus_one_cst (type); })
1358 (if (INTEGRAL_TYPE_P (type)
1359 && TREE_CODE (@1) == INTEGER_CST
1360 && wi::to_wide (@1) != wi::min_value (TYPE_PRECISION (type),
1362 (minus (plus @1 { build_minus_one_cst (type); }) @0))))
1365 /* ~(X >> Y) -> ~X >> Y if ~X can be simplified. */
1367 (bit_not (rshift:s @0 @1))
1368 (if (!TYPE_UNSIGNED (TREE_TYPE (@0)))
1369 (rshift (bit_not! @0) @1)
1370 /* For logical right shifts, this is possible only if @0 doesn't
1371 have MSB set and the logical right shift is changed into
1372 arithmetic shift. */
1373 (if (!wi::neg_p (tree_nonzero_bits (@0)))
1374 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
1375 (convert (rshift (bit_not! (convert:stype @0)) @1))))))
1377 /* x + (x & 1) -> (x + 1) & ~1 */
1379 (plus:c @0 (bit_and:s @0 integer_onep@1))
1380 (bit_and (plus @0 @1) (bit_not @1)))
1382 /* x & ~(x & y) -> x & ~y */
1383 /* x | ~(x | y) -> x | ~y */
1384 (for bitop (bit_and bit_ior)
1386 (bitop:c @0 (bit_not (bitop:cs @0 @1)))
1387 (bitop @0 (bit_not @1))))
1389 /* (~x & y) | ~(x | y) -> ~x */
1391 (bit_ior:c (bit_and:c (bit_not@2 @0) @1) (bit_not (bit_ior:c @0 @1)))
1394 /* (x | y) ^ (x | ~y) -> ~x */
1396 (bit_xor:c (bit_ior:c @0 @1) (bit_ior:c @0 (bit_not @1)))
1399 /* (x & y) | ~(x | y) -> ~(x ^ y) */
1401 (bit_ior:c (bit_and:s @0 @1) (bit_not:s (bit_ior:s @0 @1)))
1402 (bit_not (bit_xor @0 @1)))
1404 /* (~x | y) ^ (x ^ y) -> x | ~y */
1406 (bit_xor:c (bit_ior:cs (bit_not @0) @1) (bit_xor:s @0 @1))
1407 (bit_ior @0 (bit_not @1)))
1409 /* (x ^ y) | ~(x | y) -> ~(x & y) */
1411 (bit_ior:c (bit_xor:s @0 @1) (bit_not:s (bit_ior:s @0 @1)))
1412 (bit_not (bit_and @0 @1)))
1414 /* (x | y) & ~x -> y & ~x */
1415 /* (x & y) | ~x -> y | ~x */
1416 (for bitop (bit_and bit_ior)
1417 rbitop (bit_ior bit_and)
1419 (bitop:c (rbitop:c @0 @1) (bit_not@2 @0))
1422 /* (x & y) ^ (x | y) -> x ^ y */
1424 (bit_xor:c (bit_and @0 @1) (bit_ior @0 @1))
1427 /* (x ^ y) ^ (x | y) -> x & y */
1429 (bit_xor:c (bit_xor @0 @1) (bit_ior @0 @1))
1432 /* (x & y) + (x ^ y) -> x | y */
1433 /* (x & y) | (x ^ y) -> x | y */
1434 /* (x & y) ^ (x ^ y) -> x | y */
1435 (for op (plus bit_ior bit_xor)
1437 (op:c (bit_and @0 @1) (bit_xor @0 @1))
1440 /* (x & y) + (x | y) -> x + y */
1442 (plus:c (bit_and @0 @1) (bit_ior @0 @1))
1445 /* (x + y) - (x | y) -> x & y */
1447 (minus (plus @0 @1) (bit_ior @0 @1))
1448 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
1449 && !TYPE_SATURATING (type))
1452 /* (x + y) - (x & y) -> x | y */
1454 (minus (plus @0 @1) (bit_and @0 @1))
1455 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
1456 && !TYPE_SATURATING (type))
1459 /* (x | y) - y -> (x & ~y) */
1461 (minus (bit_ior:cs @0 @1) @1)
1462 (bit_and @0 (bit_not @1)))
1464 /* (x | y) - (x ^ y) -> x & y */
1466 (minus (bit_ior @0 @1) (bit_xor @0 @1))
1469 /* (x | y) - (x & y) -> x ^ y */
1471 (minus (bit_ior @0 @1) (bit_and @0 @1))
1474 /* (x | y) & ~(x & y) -> x ^ y */
1476 (bit_and:c (bit_ior @0 @1) (bit_not (bit_and @0 @1)))
1479 /* (x | y) & (~x ^ y) -> x & y */
1481 (bit_and:c (bit_ior:c @0 @1) (bit_xor:c @1 (bit_not @0)))
1484 /* (~x | y) & (x | ~y) -> ~(x ^ y) */
1486 (bit_and (bit_ior:cs (bit_not @0) @1) (bit_ior:cs @0 (bit_not @1)))
1487 (bit_not (bit_xor @0 @1)))
1489 /* (~x | y) ^ (x | ~y) -> x ^ y */
1491 (bit_xor (bit_ior:c (bit_not @0) @1) (bit_ior:c @0 (bit_not @1)))
1494 /* ((x & y) - (x | y)) - 1 -> ~(x ^ y) */
1496 (plus (nop_convert1? (minus@2 (nop_convert2? (bit_and:c @0 @1))
1497 (nop_convert2? (bit_ior @0 @1))))
1499 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
1500 && !TYPE_SATURATING (type) && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2))
1501 && !TYPE_OVERFLOW_TRAPS (TREE_TYPE (@2))
1502 && !TYPE_SATURATING (TREE_TYPE (@2)))
1503 (bit_not (convert (bit_xor @0 @1)))))
1505 (minus (nop_convert1? (plus@2 (nop_convert2? (bit_and:c @0 @1))
1507 (nop_convert3? (bit_ior @0 @1)))
1508 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
1509 && !TYPE_SATURATING (type) && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2))
1510 && !TYPE_OVERFLOW_TRAPS (TREE_TYPE (@2))
1511 && !TYPE_SATURATING (TREE_TYPE (@2)))
1512 (bit_not (convert (bit_xor @0 @1)))))
1514 (minus (nop_convert1? (bit_and @0 @1))
1515 (nop_convert2? (plus@2 (nop_convert3? (bit_ior:c @0 @1))
1517 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
1518 && !TYPE_SATURATING (type) && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2))
1519 && !TYPE_OVERFLOW_TRAPS (TREE_TYPE (@2))
1520 && !TYPE_SATURATING (TREE_TYPE (@2)))
1521 (bit_not (convert (bit_xor @0 @1)))))
1523 /* ~x & ~y -> ~(x | y)
1524 ~x | ~y -> ~(x & y) */
1525 (for op (bit_and bit_ior)
1526 rop (bit_ior bit_and)
1528 (op (convert1? (bit_not @0)) (convert2? (bit_not @1)))
1529 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
1530 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
1531 (bit_not (rop (convert @0) (convert @1))))))
1533 /* If we are XORing or adding two BIT_AND_EXPR's, both of which are and'ing
1534 with a constant, and the two constants have no bits in common,
1535 we should treat this as a BIT_IOR_EXPR since this may produce more
1537 (for op (bit_xor plus)
1539 (op (convert1? (bit_and@4 @0 INTEGER_CST@1))
1540 (convert2? (bit_and@5 @2 INTEGER_CST@3)))
1541 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
1542 && tree_nop_conversion_p (type, TREE_TYPE (@2))
1543 && (wi::to_wide (@1) & wi::to_wide (@3)) == 0)
1544 (bit_ior (convert @4) (convert @5)))))
1546 /* (X | Y) ^ X -> Y & ~ X*/
1548 (bit_xor:c (convert1? (bit_ior:c @@0 @1)) (convert2? @0))
1549 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1550 (convert (bit_and @1 (bit_not @0)))))
1552 /* Convert ~X ^ ~Y to X ^ Y. */
1554 (bit_xor (convert1? (bit_not @0)) (convert2? (bit_not @1)))
1555 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
1556 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
1557 (bit_xor (convert @0) (convert @1))))
1559 /* Convert ~X ^ C to X ^ ~C. */
1561 (bit_xor (convert? (bit_not @0)) INTEGER_CST@1)
1562 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1563 (bit_xor (convert @0) (bit_not @1))))
1565 /* Fold (X & Y) ^ Y and (X ^ Y) & Y as ~X & Y. */
1566 (for opo (bit_and bit_xor)
1567 opi (bit_xor bit_and)
1569 (opo:c (opi:cs @0 @1) @1)
1570 (bit_and (bit_not @0) @1)))
1572 /* Given a bit-wise operation CODE applied to ARG0 and ARG1, see if both
1573 operands are another bit-wise operation with a common input. If so,
1574 distribute the bit operations to save an operation and possibly two if
1575 constants are involved. For example, convert
1576 (A | B) & (A | C) into A | (B & C)
1577 Further simplification will occur if B and C are constants. */
1578 (for op (bit_and bit_ior bit_xor)
1579 rop (bit_ior bit_and bit_and)
1581 (op (convert? (rop:c @@0 @1)) (convert? (rop:c @0 @2)))
1582 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
1583 && tree_nop_conversion_p (type, TREE_TYPE (@2)))
1584 (rop (convert @0) (op (convert @1) (convert @2))))))
1586 /* Some simple reassociation for bit operations, also handled in reassoc. */
1587 /* (X & Y) & Y -> X & Y
1588 (X | Y) | Y -> X | Y */
1589 (for op (bit_and bit_ior)
1591 (op:c (convert1?@2 (op:c @0 @@1)) (convert2? @1))
1593 /* (X ^ Y) ^ Y -> X */
1595 (bit_xor:c (convert1? (bit_xor:c @0 @@1)) (convert2? @1))
1597 /* (X & Y) & (X & Z) -> (X & Y) & Z
1598 (X | Y) | (X | Z) -> (X | Y) | Z */
1599 (for op (bit_and bit_ior)
1601 (op (convert1?@3 (op:c@4 @0 @1)) (convert2?@5 (op:c@6 @0 @2)))
1602 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
1603 && tree_nop_conversion_p (type, TREE_TYPE (@2)))
1604 (if (single_use (@5) && single_use (@6))
1605 (op @3 (convert @2))
1606 (if (single_use (@3) && single_use (@4))
1607 (op (convert @1) @5))))))
1608 /* (X ^ Y) ^ (X ^ Z) -> Y ^ Z */
1610 (bit_xor (convert1? (bit_xor:c @0 @1)) (convert2? (bit_xor:c @0 @2)))
1611 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
1612 && tree_nop_conversion_p (type, TREE_TYPE (@2)))
1613 (bit_xor (convert @1) (convert @2))))
1615 /* Convert abs (abs (X)) into abs (X).
1616 also absu (absu (X)) into absu (X). */
1622 (absu (convert@2 (absu@1 @0)))
1623 (if (tree_nop_conversion_p (TREE_TYPE (@2), TREE_TYPE (@1)))
1626 /* Convert abs[u] (-X) -> abs[u] (X). */
1635 /* Convert abs[u] (X) where X is nonnegative -> (X). */
1637 (abs tree_expr_nonnegative_p@0)
1641 (absu tree_expr_nonnegative_p@0)
1644 /* Simplify (-(X < 0) | 1) * X into abs (X) or absu(X). */
1646 (mult:c (nop_convert1?
1647 (bit_ior (nop_convert2? (negate (convert? (lt @0 integer_zerop))))
1650 (if (INTEGRAL_TYPE_P (type)
1651 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
1652 && !TYPE_UNSIGNED (TREE_TYPE (@0)))
1653 (if (TYPE_UNSIGNED (type))
1660 /* A few cases of fold-const.cc negate_expr_p predicate. */
1661 (match negate_expr_p
1663 (if ((INTEGRAL_TYPE_P (type)
1664 && TYPE_UNSIGNED (type))
1665 || (!TYPE_OVERFLOW_SANITIZED (type)
1666 && may_negate_without_overflow_p (t)))))
1667 (match negate_expr_p
1669 (match negate_expr_p
1671 (if (!TYPE_OVERFLOW_SANITIZED (type))))
1672 (match negate_expr_p
1674 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (t)))))
1675 /* VECTOR_CST handling of non-wrapping types would recurse in unsupported
1677 (match negate_expr_p
1679 (if (FLOAT_TYPE_P (TREE_TYPE (type)) || TYPE_OVERFLOW_WRAPS (type))))
1680 (match negate_expr_p
1682 (if ((ANY_INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_WRAPS (type))
1683 || (FLOAT_TYPE_P (type)
1684 && !HONOR_SIGN_DEPENDENT_ROUNDING (type)
1685 && !HONOR_SIGNED_ZEROS (type)))))
1687 /* (-A) * (-B) -> A * B */
1689 (mult:c (convert1? (negate @0)) (convert2? negate_expr_p@1))
1690 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
1691 && tree_nop_conversion_p (type, TREE_TYPE (@1)))
1692 (mult (convert @0) (convert (negate @1)))))
1694 /* -(A + B) -> (-B) - A. */
1696 (negate (plus:c @0 negate_expr_p@1))
1697 (if (!HONOR_SIGN_DEPENDENT_ROUNDING (type)
1698 && !HONOR_SIGNED_ZEROS (type))
1699 (minus (negate @1) @0)))
1701 /* -(A - B) -> B - A. */
1703 (negate (minus @0 @1))
1704 (if ((ANY_INTEGRAL_TYPE_P (type) && !TYPE_OVERFLOW_SANITIZED (type))
1705 || (FLOAT_TYPE_P (type)
1706 && !HONOR_SIGN_DEPENDENT_ROUNDING (type)
1707 && !HONOR_SIGNED_ZEROS (type)))
1710 (negate (pointer_diff @0 @1))
1711 (if (TYPE_OVERFLOW_UNDEFINED (type))
1712 (pointer_diff @1 @0)))
1714 /* A - B -> A + (-B) if B is easily negatable. */
1716 (minus @0 negate_expr_p@1)
1717 (if (!FIXED_POINT_TYPE_P (type))
1718 (plus @0 (negate @1))))
1720 /* Other simplifications of negation (c.f. fold_negate_expr_1). */
1722 (negate (mult:c@0 @1 negate_expr_p@2))
1723 (if (! TYPE_UNSIGNED (type)
1724 && ! HONOR_SIGN_DEPENDENT_ROUNDING (type)
1726 (mult @1 (negate @2))))
1729 (negate (rdiv@0 @1 negate_expr_p@2))
1730 (if (! HONOR_SIGN_DEPENDENT_ROUNDING (type)
1732 (rdiv @1 (negate @2))))
1735 (negate (rdiv@0 negate_expr_p@1 @2))
1736 (if (! HONOR_SIGN_DEPENDENT_ROUNDING (type)
1738 (rdiv (negate @1) @2)))
1740 /* Fold -((int)x >> (prec - 1)) into (unsigned)x >> (prec - 1). */
1742 (negate (convert? (rshift @0 INTEGER_CST@1)))
1743 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
1744 && wi::to_wide (@1) == element_precision (type) - 1)
1745 (with { tree stype = TREE_TYPE (@0);
1746 tree ntype = TYPE_UNSIGNED (stype) ? signed_type_for (stype)
1747 : unsigned_type_for (stype); }
1748 (if (VECTOR_TYPE_P (type))
1749 (view_convert (rshift (view_convert:ntype @0) @1))
1750 (convert (rshift (convert:ntype @0) @1))))))
1752 /* Try to fold (type) X op CST -> (type) (X op ((type-x) CST))
1754 For bitwise binary operations apply operand conversions to the
1755 binary operation result instead of to the operands. This allows
1756 to combine successive conversions and bitwise binary operations.
1757 We combine the above two cases by using a conditional convert. */
1758 (for bitop (bit_and bit_ior bit_xor)
1760 (bitop (convert@2 @0) (convert?@3 @1))
1761 (if (((TREE_CODE (@1) == INTEGER_CST
1762 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
1763 && (int_fits_type_p (@1, TREE_TYPE (@0))
1764 || tree_nop_conversion_p (TREE_TYPE (@0), type)))
1765 || types_match (@0, @1))
1766 && !POINTER_TYPE_P (TREE_TYPE (@0))
1767 && TREE_CODE (TREE_TYPE (@0)) != OFFSET_TYPE
1768 /* ??? This transform conflicts with fold-const.cc doing
1769 Convert (T)(x & c) into (T)x & (T)c, if c is an integer
1770 constants (if x has signed type, the sign bit cannot be set
1771 in c). This folds extension into the BIT_AND_EXPR.
1772 Restrict it to GIMPLE to avoid endless recursions. */
1773 && (bitop != BIT_AND_EXPR || GIMPLE)
1774 && (/* That's a good idea if the conversion widens the operand, thus
1775 after hoisting the conversion the operation will be narrower.
1776 It is also a good if the conversion is a nop as moves the
1777 conversion to one side; allowing for combining of the conversions. */
1778 TYPE_PRECISION (TREE_TYPE (@0)) < TYPE_PRECISION (type)
1779 /* The conversion check for being a nop can only be done at the gimple
1780 level as fold_binary has some re-association code which can conflict
1781 with this if there is a "constant" which is not a full INTEGER_CST. */
1782 || (GIMPLE && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (type))
1783 /* It's also a good idea if the conversion is to a non-integer
1785 || GET_MODE_CLASS (TYPE_MODE (type)) != MODE_INT
1786 /* Or if the precision of TO is not the same as the precision
1788 || !type_has_mode_precision_p (type)
1789 /* In GIMPLE, getting rid of 2 conversions for one new results
1792 && TREE_CODE (@1) != INTEGER_CST
1793 && tree_nop_conversion_p (type, TREE_TYPE (@0))
1795 && single_use (@3))))
1796 (convert (bitop @0 (convert @1)))))
1797 /* In GIMPLE, getting rid of 2 conversions for one new results
1800 (convert (bitop:cs@2 (nop_convert:s @0) @1))
1802 && TREE_CODE (@1) != INTEGER_CST
1803 && tree_nop_conversion_p (type, TREE_TYPE (@2))
1804 && types_match (type, @0)
1805 && !POINTER_TYPE_P (TREE_TYPE (@0))
1806 && TREE_CODE (TREE_TYPE (@0)) != OFFSET_TYPE)
1807 (bitop @0 (convert @1)))))
1809 (for bitop (bit_and bit_ior)
1810 rbitop (bit_ior bit_and)
1811 /* (x | y) & x -> x */
1812 /* (x & y) | x -> x */
1814 (bitop:c (rbitop:c @0 @1) @0)
1816 /* (~x | y) & x -> x & y */
1817 /* (~x & y) | x -> x | y */
1819 (bitop:c (rbitop:c (bit_not @0) @1) @0)
1822 /* ((x | y) & z) | x -> (z & y) | x */
1824 (bit_ior:c (bit_and:cs (bit_ior:cs @0 @1) @2) @0)
1825 (bit_ior (bit_and @2 @1) @0))
1827 /* (x | CST1) & CST2 -> (x & CST2) | (CST1 & CST2) */
1829 (bit_and (bit_ior @0 CONSTANT_CLASS_P@1) CONSTANT_CLASS_P@2)
1830 (bit_ior (bit_and @0 @2) (bit_and @1 @2)))
1832 /* Combine successive equal operations with constants. */
1833 (for bitop (bit_and bit_ior bit_xor)
1835 (bitop (bitop @0 CONSTANT_CLASS_P@1) CONSTANT_CLASS_P@2)
1836 (if (!CONSTANT_CLASS_P (@0))
1837 /* This is the canonical form regardless of whether (bitop @1 @2) can be
1838 folded to a constant. */
1839 (bitop @0 (bitop @1 @2))
1840 /* In this case we have three constants and (bitop @0 @1) doesn't fold
1841 to a constant. This can happen if @0 or @1 is a POLY_INT_CST and if
1842 the values involved are such that the operation can't be decided at
1843 compile time. Try folding one of @0 or @1 with @2 to see whether
1844 that combination can be decided at compile time.
1846 Keep the existing form if both folds fail, to avoid endless
1848 (with { tree cst1 = const_binop (bitop, type, @0, @2); }
1850 (bitop @1 { cst1; })
1851 (with { tree cst2 = const_binop (bitop, type, @1, @2); }
1853 (bitop @0 { cst2; }))))))))
1855 /* Try simple folding for X op !X, and X op X with the help
1856 of the truth_valued_p and logical_inverted_value predicates. */
1857 (match truth_valued_p
1859 (if (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) == 1)))
1860 (for op (tcc_comparison truth_and truth_andif truth_or truth_orif truth_xor)
1861 (match truth_valued_p
1863 (match truth_valued_p
1866 (match (logical_inverted_value @0)
1868 (match (logical_inverted_value @0)
1869 (bit_not truth_valued_p@0))
1870 (match (logical_inverted_value @0)
1871 (eq @0 integer_zerop))
1872 (match (logical_inverted_value @0)
1873 (ne truth_valued_p@0 integer_truep))
1874 (match (logical_inverted_value @0)
1875 (bit_xor truth_valued_p@0 integer_truep))
1879 (bit_and:c @0 (logical_inverted_value @0))
1880 { build_zero_cst (type); })
1881 /* X | !X and X ^ !X -> 1, , if X is truth-valued. */
1882 (for op (bit_ior bit_xor)
1884 (op:c truth_valued_p@0 (logical_inverted_value @0))
1885 { constant_boolean_node (true, type); }))
1886 /* X ==/!= !X is false/true. */
1889 (op:c truth_valued_p@0 (logical_inverted_value @0))
1890 { constant_boolean_node (op == NE_EXPR ? true : false, type); }))
1894 (bit_not (bit_not @0))
1897 (match zero_one_valued_p
1899 (if (INTEGRAL_TYPE_P (type) && tree_nonzero_bits (@0) == 1)))
1900 (match zero_one_valued_p
1903 /* Transform { 0 or 1 } * { 0 or 1 } into { 0 or 1 } & { 0 or 1 }. */
1905 (mult zero_one_valued_p@0 zero_one_valued_p@1)
1906 (if (INTEGRAL_TYPE_P (type))
1909 /* Transform X & -Y into X * Y when Y is { 0 or 1 }. */
1911 (bit_and:c (convert? (negate zero_one_valued_p@0)) @1)
1912 (if (INTEGRAL_TYPE_P (type)
1913 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
1914 && TREE_CODE (TREE_TYPE (@0)) != BOOLEAN_TYPE
1915 && !TYPE_UNSIGNED (TREE_TYPE (@0)))
1916 (mult (convert @0) @1)))
1918 /* Narrow integer multiplication by a zero_one_valued_p operand.
1919 Multiplication by [0,1] is guaranteed not to overflow. */
1921 (convert (mult@0 zero_one_valued_p@1 INTEGER_CST@2))
1922 (if (INTEGRAL_TYPE_P (type)
1923 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
1924 && TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (@0)))
1925 (mult (convert @1) (convert @2))))
1927 /* (X << C) != 0 can be simplified to X, when C is zero_one_valued_p.
1928 Check that the shift is well-defined (C is less than TYPE_PRECISION)
1929 as some targets (such as x86's SSE) may return zero for larger C. */
1931 (ne (lshift zero_one_valued_p@0 INTEGER_CST@1) integer_zerop@2)
1932 (if (tree_fits_shwi_p (@1)
1933 && tree_to_shwi (@1) > 0
1934 && tree_to_shwi (@1) < TYPE_PRECISION (TREE_TYPE (@0)))
1937 /* (X << C) == 0 can be simplified to X == 0, when C is zero_one_valued_p.
1938 Check that the shift is well-defined (C is less than TYPE_PRECISION)
1939 as some targets (such as x86's SSE) may return zero for larger C. */
1941 (eq (lshift zero_one_valued_p@0 INTEGER_CST@1) integer_zerop@2)
1942 (if (tree_fits_shwi_p (@1)
1943 && tree_to_shwi (@1) > 0
1944 && tree_to_shwi (@1) < TYPE_PRECISION (TREE_TYPE (@0)))
1947 /* Convert ~ (-A) to A - 1. */
1949 (bit_not (convert? (negate @0)))
1950 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
1951 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
1952 (convert (minus @0 { build_each_one_cst (TREE_TYPE (@0)); }))))
1954 /* Convert - (~A) to A + 1. */
1956 (negate (nop_convert? (bit_not @0)))
1957 (plus (view_convert @0) { build_each_one_cst (type); }))
1959 /* (a & b) ^ (a == b) -> !(a | b) */
1960 /* (a & b) == (a ^ b) -> !(a | b) */
1961 (for first_op (bit_xor eq)
1962 second_op (eq bit_xor)
1964 (first_op:c (bit_and:c truth_valued_p@0 truth_valued_p@1) (second_op:c @0 @1))
1965 (bit_not (bit_ior @0 @1))))
1967 /* Convert ~ (A - 1) or ~ (A + -1) to -A. */
1969 (bit_not (convert? (minus @0 integer_each_onep)))
1970 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
1971 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
1972 (convert (negate @0))))
1974 (bit_not (convert? (plus @0 integer_all_onesp)))
1975 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
1976 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
1977 (convert (negate @0))))
1979 /* Part of convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */
1981 (bit_not (convert? (bit_xor @0 INTEGER_CST@1)))
1982 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1983 (convert (bit_xor @0 (bit_not @1)))))
1985 (bit_not (convert? (bit_xor:c (bit_not @0) @1)))
1986 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1987 (convert (bit_xor @0 @1))))
1989 /* Otherwise prefer ~(X ^ Y) to ~X ^ Y as more canonical. */
1991 (bit_xor:c (nop_convert?:s (bit_not:s @0)) @1)
1992 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
1993 (bit_not (bit_xor (view_convert @0) @1))))
1995 /* ~(a ^ b) is a == b for truth valued a and b. */
1997 (bit_not (bit_xor:s truth_valued_p@0 truth_valued_p@1))
1998 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
1999 && TYPE_PRECISION (TREE_TYPE (@0)) == 1)
2000 (convert (eq @0 @1))))
2002 /* (~a) == b is a ^ b for truth valued a and b. */
2004 (eq:c (bit_not:s truth_valued_p@0) truth_valued_p@1)
2005 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2006 && TYPE_PRECISION (TREE_TYPE (@0)) == 1)
2007 (convert (bit_xor @0 @1))))
2009 /* (x & ~m) | (y & m) -> ((x ^ y) & m) ^ x */
2011 (bit_ior:c (bit_and:cs @0 (bit_not @2)) (bit_and:cs @1 @2))
2012 (bit_xor (bit_and (bit_xor @0 @1) @2) @0))
2014 /* Fold A - (A & B) into ~B & A. */
2016 (minus (convert1? @0) (convert2?:s (bit_and:cs @@0 @1)))
2017 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
2018 && tree_nop_conversion_p (type, TREE_TYPE (@1)))
2019 (convert (bit_and (bit_not @1) @0))))
2021 /* (m1 CMP m2) * d -> (m1 CMP m2) ? d : 0 */
2022 (if (!canonicalize_math_p ())
2023 (for cmp (gt lt ge le)
2025 (mult (convert (cmp @0 @1)) @2)
2026 (cond (cmp @0 @1) @2 { build_zero_cst (type); }))))
2028 /* For integral types with undefined overflow and C != 0 fold
2029 x * C EQ/NE y * C into x EQ/NE y. */
2032 (cmp (mult:c @0 @1) (mult:c @2 @1))
2033 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2034 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2035 && tree_expr_nonzero_p (@1))
2038 /* For integral types with wrapping overflow and C odd fold
2039 x * C EQ/NE y * C into x EQ/NE y. */
2042 (cmp (mult @0 INTEGER_CST@1) (mult @2 @1))
2043 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2044 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))
2045 && (TREE_INT_CST_LOW (@1) & 1) != 0)
2048 /* For integral types with undefined overflow and C != 0 fold
2049 x * C RELOP y * C into:
2051 x RELOP y for nonnegative C
2052 y RELOP x for negative C */
2053 (for cmp (lt gt le ge)
2055 (cmp (mult:c @0 @1) (mult:c @2 @1))
2056 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2057 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
2058 (if (tree_expr_nonnegative_p (@1) && tree_expr_nonzero_p (@1))
2060 (if (TREE_CODE (@1) == INTEGER_CST
2061 && wi::neg_p (wi::to_wide (@1), TYPE_SIGN (TREE_TYPE (@1))))
2064 /* (X - 1U) <= INT_MAX-1U into (int) X > 0. */
2068 (cmp (plus @0 integer_minus_onep@1) INTEGER_CST@2)
2069 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2070 && TYPE_UNSIGNED (TREE_TYPE (@0))
2071 && TYPE_PRECISION (TREE_TYPE (@0)) > 1
2072 && (wi::to_wide (@2)
2073 == wi::max_value (TYPE_PRECISION (TREE_TYPE (@0)), SIGNED) - 1))
2074 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
2075 (icmp (convert:stype @0) { build_int_cst (stype, 0); })))))
2077 /* X / 4 < Y / 4 iff X < Y when the division is known to be exact. */
2078 (for cmp (simple_comparison)
2080 (cmp (convert?@3 (exact_div @0 INTEGER_CST@2)) (convert? (exact_div @1 @2)))
2081 (if (element_precision (@3) >= element_precision (@0)
2082 && types_match (@0, @1))
2083 (if (wi::lt_p (wi::to_wide (@2), 0, TYPE_SIGN (TREE_TYPE (@2))))
2084 (if (!TYPE_UNSIGNED (TREE_TYPE (@3)))
2086 (if (tree_expr_nonzero_p (@0) && tree_expr_nonzero_p (@1))
2089 tree utype = unsigned_type_for (TREE_TYPE (@0));
2091 (cmp (convert:utype @1) (convert:utype @0)))))
2092 (if (wi::gt_p (wi::to_wide (@2), 1, TYPE_SIGN (TREE_TYPE (@2))))
2093 (if (TYPE_UNSIGNED (TREE_TYPE (@0)) || !TYPE_UNSIGNED (TREE_TYPE (@3)))
2097 tree utype = unsigned_type_for (TREE_TYPE (@0));
2099 (cmp (convert:utype @0) (convert:utype @1)))))))))
2101 /* X / C1 op C2 into a simple range test. */
2102 (for cmp (simple_comparison)
2104 (cmp (trunc_div:s @0 INTEGER_CST@1) INTEGER_CST@2)
2105 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2106 && integer_nonzerop (@1)
2107 && !TREE_OVERFLOW (@1)
2108 && !TREE_OVERFLOW (@2))
2109 (with { tree lo, hi; bool neg_overflow;
2110 enum tree_code code = fold_div_compare (cmp, @1, @2, &lo, &hi,
2113 (if (code == LT_EXPR || code == GE_EXPR)
2114 (if (TREE_OVERFLOW (lo))
2115 { build_int_cst (type, (code == LT_EXPR) ^ neg_overflow); }
2116 (if (code == LT_EXPR)
2119 (if (code == LE_EXPR || code == GT_EXPR)
2120 (if (TREE_OVERFLOW (hi))
2121 { build_int_cst (type, (code == LE_EXPR) ^ neg_overflow); }
2122 (if (code == LE_EXPR)
2126 { build_int_cst (type, code == NE_EXPR); })
2127 (if (code == EQ_EXPR && !hi)
2129 (if (code == EQ_EXPR && !lo)
2131 (if (code == NE_EXPR && !hi)
2133 (if (code == NE_EXPR && !lo)
2136 { build_range_check (UNKNOWN_LOCATION, type, @0, code == EQ_EXPR,
2140 tree etype = range_check_type (TREE_TYPE (@0));
2143 hi = fold_convert (etype, hi);
2144 lo = fold_convert (etype, lo);
2145 hi = const_binop (MINUS_EXPR, etype, hi, lo);
2148 (if (etype && hi && !TREE_OVERFLOW (hi))
2149 (if (code == EQ_EXPR)
2150 (le (minus (convert:etype @0) { lo; }) { hi; })
2151 (gt (minus (convert:etype @0) { lo; }) { hi; })))))))))
2153 /* X + Z < Y + Z is the same as X < Y when there is no overflow. */
2154 (for op (lt le ge gt)
2156 (op (plus:c @0 @2) (plus:c @1 @2))
2157 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2158 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
2161 /* As a special case, X + C < Y + C is the same as (signed) X < (signed) Y
2162 when C is an unsigned integer constant with only the MSB set, and X and
2163 Y have types of equal or lower integer conversion rank than C's. */
2164 (for op (lt le ge gt)
2166 (op (plus @1 INTEGER_CST@0) (plus @2 @0))
2167 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2168 && TYPE_UNSIGNED (TREE_TYPE (@0))
2169 && wi::only_sign_bit_p (wi::to_wide (@0)))
2170 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
2171 (op (convert:stype @1) (convert:stype @2))))))
2173 /* For equality and subtraction, this is also true with wrapping overflow. */
2174 (for op (eq ne minus)
2176 (op (plus:c @0 @2) (plus:c @1 @2))
2177 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2178 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2179 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
2182 /* X - Z < Y - Z is the same as X < Y when there is no overflow. */
2183 (for op (lt le ge gt)
2185 (op (minus @0 @2) (minus @1 @2))
2186 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2187 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
2189 /* For equality and subtraction, this is also true with wrapping overflow. */
2190 (for op (eq ne minus)
2192 (op (minus @0 @2) (minus @1 @2))
2193 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2194 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2195 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
2197 /* And for pointers... */
2198 (for op (simple_comparison)
2200 (op (pointer_diff@3 @0 @2) (pointer_diff @1 @2))
2201 (if (!TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
2204 (minus (pointer_diff@3 @0 @2) (pointer_diff @1 @2))
2205 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@3))
2206 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
2207 (pointer_diff @0 @1)))
2209 /* Z - X < Z - Y is the same as Y < X when there is no overflow. */
2210 (for op (lt le ge gt)
2212 (op (minus @2 @0) (minus @2 @1))
2213 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2214 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
2216 /* For equality and subtraction, this is also true with wrapping overflow. */
2217 (for op (eq ne minus)
2219 (op (minus @2 @0) (minus @2 @1))
2220 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2221 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2222 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
2224 /* And for pointers... */
2225 (for op (simple_comparison)
2227 (op (pointer_diff@3 @2 @0) (pointer_diff @2 @1))
2228 (if (!TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
2231 (minus (pointer_diff@3 @2 @0) (pointer_diff @2 @1))
2232 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@3))
2233 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
2234 (pointer_diff @1 @0)))
2236 /* X + Y < Y is the same as X < 0 when there is no overflow. */
2237 (for op (lt le gt ge)
2239 (op:c (plus:c@2 @0 @1) @1)
2240 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2241 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2242 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0))
2243 && (CONSTANT_CLASS_P (@0) || single_use (@2)))
2244 (op @0 { build_zero_cst (TREE_TYPE (@0)); }))))
2245 /* For equality, this is also true with wrapping overflow. */
2248 (op:c (nop_convert?@3 (plus:c@2 @0 (convert1? @1))) (convert2? @1))
2249 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2250 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2251 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
2252 && (CONSTANT_CLASS_P (@0) || (single_use (@2) && single_use (@3)))
2253 && tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@2))
2254 && tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@1)))
2255 (op @0 { build_zero_cst (TREE_TYPE (@0)); })))
2257 (op:c (nop_convert?@3 (pointer_plus@2 (convert1? @0) @1)) (convert2? @0))
2258 (if (tree_nop_conversion_p (TREE_TYPE (@2), TREE_TYPE (@0))
2259 && tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0))
2260 && (CONSTANT_CLASS_P (@1) || (single_use (@2) && single_use (@3))))
2261 (op @1 { build_zero_cst (TREE_TYPE (@1)); }))))
2263 /* (&a + b) !=/== (&a[1] + c) -> (&a[0] - &a[1]) + b !=/== c */
2266 (neeq:c ADDR_EXPR@0 (pointer_plus ADDR_EXPR@2 @3))
2267 (with { poly_int64 diff; tree inner_type = TREE_TYPE (@3);}
2268 (if (ptr_difference_const (@0, @2, &diff))
2269 (neeq { build_int_cst_type (inner_type, diff); } @3))))
2271 (neeq (pointer_plus ADDR_EXPR@0 @1) (pointer_plus ADDR_EXPR@2 @3))
2272 (with { poly_int64 diff; tree inner_type = TREE_TYPE (@1);}
2273 (if (ptr_difference_const (@0, @2, &diff))
2274 (neeq (plus { build_int_cst_type (inner_type, diff); } @1) @3)))))
2276 /* X - Y < X is the same as Y > 0 when there is no overflow.
2277 For equality, this is also true with wrapping overflow. */
2278 (for op (simple_comparison)
2280 (op:c @0 (minus@2 @0 @1))
2281 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2282 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2283 || ((op == EQ_EXPR || op == NE_EXPR)
2284 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
2285 && (CONSTANT_CLASS_P (@1) || single_use (@2)))
2286 (op @1 { build_zero_cst (TREE_TYPE (@1)); }))))
2289 (X / Y) == 0 -> X < Y if X, Y are unsigned.
2290 (X / Y) != 0 -> X >= Y, if X, Y are unsigned. */
2294 (cmp (trunc_div @0 @1) integer_zerop)
2295 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
2296 /* Complex ==/!= is allowed, but not </>=. */
2297 && TREE_CODE (TREE_TYPE (@0)) != COMPLEX_TYPE
2298 && (VECTOR_TYPE_P (type) || !VECTOR_TYPE_P (TREE_TYPE (@0))))
2301 /* X == C - X can never be true if C is odd. */
2304 (cmp:c (convert? @0) (convert1? (minus INTEGER_CST@1 (convert2? @0))))
2305 (if (TREE_INT_CST_LOW (@1) & 1)
2306 { constant_boolean_node (cmp == NE_EXPR, type); })))
2308 /* Arguments on which one can call get_nonzero_bits to get the bits
2310 (match with_possible_nonzero_bits
2312 (match with_possible_nonzero_bits
2314 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))))
2315 /* Slightly extended version, do not make it recursive to keep it cheap. */
2316 (match (with_possible_nonzero_bits2 @0)
2317 with_possible_nonzero_bits@0)
2318 (match (with_possible_nonzero_bits2 @0)
2319 (bit_and:c with_possible_nonzero_bits@0 @2))
2321 /* Same for bits that are known to be set, but we do not have
2322 an equivalent to get_nonzero_bits yet. */
2323 (match (with_certain_nonzero_bits2 @0)
2325 (match (with_certain_nonzero_bits2 @0)
2326 (bit_ior @1 INTEGER_CST@0))
2328 /* X == C (or X & Z == Y | C) is impossible if ~nonzero(X) & C != 0. */
2331 (cmp:c (with_possible_nonzero_bits2 @0) (with_certain_nonzero_bits2 @1))
2332 (if (wi::bit_and_not (wi::to_wide (@1), get_nonzero_bits (@0)) != 0)
2333 { constant_boolean_node (cmp == NE_EXPR, type); })))
2335 /* ((X inner_op C0) outer_op C1)
2336 With X being a tree where value_range has reasoned certain bits to always be
2337 zero throughout its computed value range,
2338 inner_op = {|,^}, outer_op = {|,^} and inner_op != outer_op
2339 where zero_mask has 1's for all bits that are sure to be 0 in
2341 if (inner_op == '^') C0 &= ~C1;
2342 if ((C0 & ~zero_mask) == 0) then emit (X outer_op (C0 outer_op C1)
2343 if ((C1 & ~zero_mask) == 0) then emit (X inner_op (C0 outer_op C1)
2345 (for inner_op (bit_ior bit_xor)
2346 outer_op (bit_xor bit_ior)
2349 (inner_op:s @2 INTEGER_CST@0) INTEGER_CST@1)
2353 wide_int zero_mask_not;
2357 if (TREE_CODE (@2) == SSA_NAME)
2358 zero_mask_not = get_nonzero_bits (@2);
2362 if (inner_op == BIT_XOR_EXPR)
2364 C0 = wi::bit_and_not (wi::to_wide (@0), wi::to_wide (@1));
2365 cst_emit = C0 | wi::to_wide (@1);
2369 C0 = wi::to_wide (@0);
2370 cst_emit = C0 ^ wi::to_wide (@1);
2373 (if (!fail && (C0 & zero_mask_not) == 0)
2374 (outer_op @2 { wide_int_to_tree (type, cst_emit); })
2375 (if (!fail && (wi::to_wide (@1) & zero_mask_not) == 0)
2376 (inner_op @2 { wide_int_to_tree (type, cst_emit); }))))))
2378 /* Associate (p +p off1) +p off2 as (p +p (off1 + off2)). */
2380 (pointer_plus (pointer_plus:s @0 @1) @3)
2381 (pointer_plus @0 (plus @1 @3)))
2384 (pointer_plus (convert:s (pointer_plus:s @0 @1)) @3)
2385 (convert:type (pointer_plus @0 (plus @1 @3))))
2392 tem4 = (unsigned long) tem3;
2397 (pointer_plus @0 (convert?@2 (minus@3 (convert @1) (convert @0))))
2398 /* Conditionally look through a sign-changing conversion. */
2399 (if (TYPE_PRECISION (TREE_TYPE (@2)) == TYPE_PRECISION (TREE_TYPE (@3))
2400 && ((GIMPLE && useless_type_conversion_p (type, TREE_TYPE (@1)))
2401 || (GENERIC && type == TREE_TYPE (@1))))
2404 (pointer_plus @0 (convert?@2 (pointer_diff@3 @1 @@0)))
2405 (if (TYPE_PRECISION (TREE_TYPE (@2)) >= TYPE_PRECISION (TREE_TYPE (@3)))
2409 tem = (sizetype) ptr;
2413 and produce the simpler and easier to analyze with respect to alignment
2414 ... = ptr & ~algn; */
2416 (pointer_plus @0 (negate (bit_and (convert @0) INTEGER_CST@1)))
2417 (with { tree algn = wide_int_to_tree (TREE_TYPE (@0), ~wi::to_wide (@1)); }
2418 (bit_and @0 { algn; })))
2420 /* Try folding difference of addresses. */
2422 (minus (convert ADDR_EXPR@0) (convert @1))
2423 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2424 (with { poly_int64 diff; }
2425 (if (ptr_difference_const (@0, @1, &diff))
2426 { build_int_cst_type (type, diff); }))))
2428 (minus (convert @0) (convert ADDR_EXPR@1))
2429 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2430 (with { poly_int64 diff; }
2431 (if (ptr_difference_const (@0, @1, &diff))
2432 { build_int_cst_type (type, diff); }))))
2434 (pointer_diff (convert?@2 ADDR_EXPR@0) (convert1?@3 @1))
2435 (if (tree_nop_conversion_p (TREE_TYPE(@2), TREE_TYPE (@0))
2436 && tree_nop_conversion_p (TREE_TYPE(@3), TREE_TYPE (@1)))
2437 (with { poly_int64 diff; }
2438 (if (ptr_difference_const (@0, @1, &diff))
2439 { build_int_cst_type (type, diff); }))))
2441 (pointer_diff (convert?@2 @0) (convert1?@3 ADDR_EXPR@1))
2442 (if (tree_nop_conversion_p (TREE_TYPE(@2), TREE_TYPE (@0))
2443 && tree_nop_conversion_p (TREE_TYPE(@3), TREE_TYPE (@1)))
2444 (with { poly_int64 diff; }
2445 (if (ptr_difference_const (@0, @1, &diff))
2446 { build_int_cst_type (type, diff); }))))
2448 /* (&a+b) - (&a[1] + c) -> sizeof(a[0]) + (b - c) */
2450 (pointer_diff (pointer_plus ADDR_EXPR@0 @1) (pointer_plus ADDR_EXPR@2 @3))
2451 (with { poly_int64 diff; }
2452 (if (ptr_difference_const (@0, @2, &diff))
2453 (plus { build_int_cst_type (type, diff); } (convert (minus @1 @3))))))
2454 /* (p + b) - &p->d -> offsetof (*p, d) + b */
2456 (pointer_diff (pointer_plus @0 @1) ADDR_EXPR@2)
2457 (with { poly_int64 diff; }
2458 (if (ptr_difference_const (@0, @2, &diff))
2459 (plus { build_int_cst_type (type, diff); } (convert @1)))))
2461 (pointer_diff ADDR_EXPR@0 (pointer_plus @1 @2))
2462 (with { poly_int64 diff; }
2463 (if (ptr_difference_const (@0, @1, &diff))
2464 (minus { build_int_cst_type (type, diff); } (convert @2)))))
2466 /* Canonicalize (T *)(ptr - ptr-cst) to &MEM[ptr + -ptr-cst]. */
2468 (convert (pointer_diff @0 INTEGER_CST@1))
2469 (if (POINTER_TYPE_P (type))
2470 { build_fold_addr_expr_with_type
2471 (build2 (MEM_REF, char_type_node, @0,
2472 wide_int_to_tree (ptr_type_node, wi::neg (wi::to_wide (@1)))),
2475 /* If arg0 is derived from the address of an object or function, we may
2476 be able to fold this expression using the object or function's
2479 (bit_and (convert? @0) INTEGER_CST@1)
2480 (if (POINTER_TYPE_P (TREE_TYPE (@0))
2481 && tree_nop_conversion_p (type, TREE_TYPE (@0)))
2485 unsigned HOST_WIDE_INT bitpos;
2486 get_pointer_alignment_1 (@0, &align, &bitpos);
2488 (if (wi::ltu_p (wi::to_wide (@1), align / BITS_PER_UNIT))
2489 { wide_int_to_tree (type, (wi::to_wide (@1)
2490 & (bitpos / BITS_PER_UNIT))); }))))
2494 (if (INTEGRAL_TYPE_P (type)
2495 && wi::eq_p (wi::to_wide (t), wi::min_value (type)))))
2499 (if (INTEGRAL_TYPE_P (type)
2500 && wi::eq_p (wi::to_wide (t), wi::max_value (type)))))
2502 /* x > y && x != XXX_MIN --> x > y
2503 x > y && x == XXX_MIN --> false . */
2506 (bit_and:c (gt:c@2 @0 @1) (eqne @0 min_value))
2508 (if (eqne == EQ_EXPR)
2509 { constant_boolean_node (false, type); })
2510 (if (eqne == NE_EXPR)
2514 /* x < y && x != XXX_MAX --> x < y
2515 x < y && x == XXX_MAX --> false. */
2518 (bit_and:c (lt:c@2 @0 @1) (eqne @0 max_value))
2520 (if (eqne == EQ_EXPR)
2521 { constant_boolean_node (false, type); })
2522 (if (eqne == NE_EXPR)
2526 /* x <= y && x == XXX_MIN --> x == XXX_MIN. */
2528 (bit_and:c (le:c @0 @1) (eq@2 @0 min_value))
2531 /* x >= y && x == XXX_MAX --> x == XXX_MAX. */
2533 (bit_and:c (ge:c @0 @1) (eq@2 @0 max_value))
2536 /* x > y || x != XXX_MIN --> x != XXX_MIN. */
2538 (bit_ior:c (gt:c @0 @1) (ne@2 @0 min_value))
2541 /* x <= y || x != XXX_MIN --> true. */
2543 (bit_ior:c (le:c @0 @1) (ne @0 min_value))
2544 { constant_boolean_node (true, type); })
2546 /* x <= y || x == XXX_MIN --> x <= y. */
2548 (bit_ior:c (le:c@2 @0 @1) (eq @0 min_value))
2551 /* x < y || x != XXX_MAX --> x != XXX_MAX. */
2553 (bit_ior:c (lt:c @0 @1) (ne@2 @0 max_value))
2556 /* x >= y || x != XXX_MAX --> true
2557 x >= y || x == XXX_MAX --> x >= y. */
2560 (bit_ior:c (ge:c@2 @0 @1) (eqne @0 max_value))
2562 (if (eqne == EQ_EXPR)
2564 (if (eqne == NE_EXPR)
2565 { constant_boolean_node (true, type); }))))
2567 /* y == XXX_MIN || x < y --> x <= y - 1 */
2569 (bit_ior:c (eq:s @1 min_value) (lt:cs @0 @1))
2570 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2571 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
2572 (le @0 (minus @1 { build_int_cst (TREE_TYPE (@1), 1); }))))
2574 /* y != XXX_MIN && x >= y --> x > y - 1 */
2576 (bit_and:c (ne:s @1 min_value) (ge:cs @0 @1))
2577 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2578 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
2579 (gt @0 (minus @1 { build_int_cst (TREE_TYPE (@1), 1); }))))
2581 /* Convert (X == CST1) && (X OP2 CST2) to a known value
2582 based on CST1 OP2 CST2. Similarly for (X != CST1). */
2585 (for code2 (eq ne lt gt le ge)
2587 (bit_and:c (code1@3 @0 INTEGER_CST@1) (code2@4 @0 INTEGER_CST@2))
2590 int cmp = tree_int_cst_compare (@1, @2);
2594 case EQ_EXPR: val = (cmp == 0); break;
2595 case NE_EXPR: val = (cmp != 0); break;
2596 case LT_EXPR: val = (cmp < 0); break;
2597 case GT_EXPR: val = (cmp > 0); break;
2598 case LE_EXPR: val = (cmp <= 0); break;
2599 case GE_EXPR: val = (cmp >= 0); break;
2600 default: gcc_unreachable ();
2604 (if (code1 == EQ_EXPR && val) @3)
2605 (if (code1 == EQ_EXPR && !val) { constant_boolean_node (false, type); })
2606 (if (code1 == NE_EXPR && !val) @4))))))
2608 /* Convert (X OP1 CST1) && (X OP2 CST2). */
2610 (for code1 (lt le gt ge)
2611 (for code2 (lt le gt ge)
2613 (bit_and (code1:c@3 @0 INTEGER_CST@1) (code2:c@4 @0 INTEGER_CST@2))
2616 int cmp = tree_int_cst_compare (@1, @2);
2619 /* Choose the more restrictive of two < or <= comparisons. */
2620 (if ((code1 == LT_EXPR || code1 == LE_EXPR)
2621 && (code2 == LT_EXPR || code2 == LE_EXPR))
2622 (if ((cmp < 0) || (cmp == 0 && code1 == LT_EXPR))
2625 /* Likewise chose the more restrictive of two > or >= comparisons. */
2626 (if ((code1 == GT_EXPR || code1 == GE_EXPR)
2627 && (code2 == GT_EXPR || code2 == GE_EXPR))
2628 (if ((cmp > 0) || (cmp == 0 && code1 == GT_EXPR))
2631 /* Check for singleton ranges. */
2633 && ((code1 == LE_EXPR && code2 == GE_EXPR)
2634 || (code1 == GE_EXPR && code2 == LE_EXPR)))
2636 /* Check for disjoint ranges. */
2638 && (code1 == LT_EXPR || code1 == LE_EXPR)
2639 && (code2 == GT_EXPR || code2 == GE_EXPR))
2640 { constant_boolean_node (false, type); })
2642 && (code1 == GT_EXPR || code1 == GE_EXPR)
2643 && (code2 == LT_EXPR || code2 == LE_EXPR))
2644 { constant_boolean_node (false, type); })
2647 /* Convert (X == CST1) || (X OP2 CST2) to a known value
2648 based on CST1 OP2 CST2. Similarly for (X != CST1). */
2651 (for code2 (eq ne lt gt le ge)
2653 (bit_ior:c (code1@3 @0 INTEGER_CST@1) (code2@4 @0 INTEGER_CST@2))
2656 int cmp = tree_int_cst_compare (@1, @2);
2660 case EQ_EXPR: val = (cmp == 0); break;
2661 case NE_EXPR: val = (cmp != 0); break;
2662 case LT_EXPR: val = (cmp < 0); break;
2663 case GT_EXPR: val = (cmp > 0); break;
2664 case LE_EXPR: val = (cmp <= 0); break;
2665 case GE_EXPR: val = (cmp >= 0); break;
2666 default: gcc_unreachable ();
2670 (if (code1 == EQ_EXPR && val) @4)
2671 (if (code1 == NE_EXPR && val) { constant_boolean_node (true, type); })
2672 (if (code1 == NE_EXPR && !val) @3))))))
2674 /* Convert (X OP1 CST1) || (X OP2 CST2). */
2676 (for code1 (lt le gt ge)
2677 (for code2 (lt le gt ge)
2679 (bit_ior (code1@3 @0 INTEGER_CST@1) (code2@4 @0 INTEGER_CST@2))
2682 int cmp = tree_int_cst_compare (@1, @2);
2685 /* Choose the more restrictive of two < or <= comparisons. */
2686 (if ((code1 == LT_EXPR || code1 == LE_EXPR)
2687 && (code2 == LT_EXPR || code2 == LE_EXPR))
2688 (if ((cmp < 0) || (cmp == 0 && code1 == LT_EXPR))
2691 /* Likewise chose the more restrictive of two > or >= comparisons. */
2692 (if ((code1 == GT_EXPR || code1 == GE_EXPR)
2693 && (code2 == GT_EXPR || code2 == GE_EXPR))
2694 (if ((cmp > 0) || (cmp == 0 && code1 == GT_EXPR))
2697 /* Check for singleton ranges. */
2699 && ((code1 == LT_EXPR && code2 == GT_EXPR)
2700 || (code1 == GT_EXPR && code2 == LT_EXPR)))
2702 /* Check for disjoint ranges. */
2704 && (code1 == LT_EXPR || code1 == LE_EXPR)
2705 && (code2 == GT_EXPR || code2 == GE_EXPR))
2706 { constant_boolean_node (true, type); })
2708 && (code1 == GT_EXPR || code1 == GE_EXPR)
2709 && (code2 == LT_EXPR || code2 == LE_EXPR))
2710 { constant_boolean_node (true, type); })
2713 /* We can't reassociate at all for saturating types. */
2714 (if (!TYPE_SATURATING (type))
2716 /* Contract negates. */
2717 /* A + (-B) -> A - B */
2719 (plus:c @0 (convert? (negate @1)))
2720 /* Apply STRIP_NOPS on the negate. */
2721 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
2722 && !TYPE_OVERFLOW_SANITIZED (type))
2726 if (INTEGRAL_TYPE_P (type)
2727 && TYPE_OVERFLOW_WRAPS (type) != TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
2728 t1 = TYPE_OVERFLOW_WRAPS (type) ? type : TREE_TYPE (@1);
2730 (convert (minus (convert:t1 @0) (convert:t1 @1))))))
2731 /* A - (-B) -> A + B */
2733 (minus @0 (convert? (negate @1)))
2734 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
2735 && !TYPE_OVERFLOW_SANITIZED (type))
2739 if (INTEGRAL_TYPE_P (type)
2740 && TYPE_OVERFLOW_WRAPS (type) != TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
2741 t1 = TYPE_OVERFLOW_WRAPS (type) ? type : TREE_TYPE (@1);
2743 (convert (plus (convert:t1 @0) (convert:t1 @1))))))
2745 Sign-extension is ok except for INT_MIN, which thankfully cannot
2746 happen without overflow. */
2748 (negate (convert (negate @1)))
2749 (if (INTEGRAL_TYPE_P (type)
2750 && (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@1))
2751 || (!TYPE_UNSIGNED (TREE_TYPE (@1))
2752 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))))
2753 && !TYPE_OVERFLOW_SANITIZED (type)
2754 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@1)))
2757 (negate (convert negate_expr_p@1))
2758 (if (SCALAR_FLOAT_TYPE_P (type)
2759 && ((DECIMAL_FLOAT_TYPE_P (type)
2760 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@1))
2761 && TYPE_PRECISION (type) >= TYPE_PRECISION (TREE_TYPE (@1)))
2762 || !HONOR_SIGN_DEPENDENT_ROUNDING (type)))
2763 (convert (negate @1))))
2765 (negate (nop_convert? (negate @1)))
2766 (if (!TYPE_OVERFLOW_SANITIZED (type)
2767 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@1)))
2770 /* We can't reassociate floating-point unless -fassociative-math
2771 or fixed-point plus or minus because of saturation to +-Inf. */
2772 (if ((!FLOAT_TYPE_P (type) || flag_associative_math)
2773 && !FIXED_POINT_TYPE_P (type))
2775 /* Match patterns that allow contracting a plus-minus pair
2776 irrespective of overflow issues. */
2777 /* (A +- B) - A -> +- B */
2778 /* (A +- B) -+ B -> A */
2779 /* A - (A +- B) -> -+ B */
2780 /* A +- (B -+ A) -> +- B */
2782 (minus (nop_convert1? (plus:c (nop_convert2? @0) @1)) @0)
2785 (minus (nop_convert1? (minus (nop_convert2? @0) @1)) @0)
2786 (if (!ANY_INTEGRAL_TYPE_P (type)
2787 || TYPE_OVERFLOW_WRAPS (type))
2788 (negate (view_convert @1))
2789 (view_convert (negate @1))))
2791 (plus:c (nop_convert1? (minus @0 (nop_convert2? @1))) @1)
2794 (minus @0 (nop_convert1? (plus:c (nop_convert2? @0) @1)))
2795 (if (!ANY_INTEGRAL_TYPE_P (type)
2796 || TYPE_OVERFLOW_WRAPS (type))
2797 (negate (view_convert @1))
2798 (view_convert (negate @1))))
2800 (minus @0 (nop_convert1? (minus (nop_convert2? @0) @1)))
2802 /* (A +- B) + (C - A) -> C +- B */
2803 /* (A + B) - (A - C) -> B + C */
2804 /* More cases are handled with comparisons. */
2806 (plus:c (plus:c @0 @1) (minus @2 @0))
2809 (plus:c (minus @0 @1) (minus @2 @0))
2812 (plus:c (pointer_diff @0 @1) (pointer_diff @2 @0))
2813 (if (TYPE_OVERFLOW_UNDEFINED (type)
2814 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0)))
2815 (pointer_diff @2 @1)))
2817 (minus (plus:c @0 @1) (minus @0 @2))
2820 /* (A +- CST1) +- CST2 -> A + CST3
2821 Use view_convert because it is safe for vectors and equivalent for
2823 (for outer_op (plus minus)
2824 (for inner_op (plus minus)
2825 neg_inner_op (minus plus)
2827 (outer_op (nop_convert? (inner_op @0 CONSTANT_CLASS_P@1))
2829 /* If one of the types wraps, use that one. */
2830 (if (!ANY_INTEGRAL_TYPE_P (type) || TYPE_OVERFLOW_WRAPS (type))
2831 /* If all 3 captures are CONSTANT_CLASS_P, punt, as we might recurse
2832 forever if something doesn't simplify into a constant. */
2833 (if (!CONSTANT_CLASS_P (@0))
2834 (if (outer_op == PLUS_EXPR)
2835 (plus (view_convert @0) (inner_op @2 (view_convert @1)))
2836 (minus (view_convert @0) (neg_inner_op @2 (view_convert @1)))))
2837 (if (!ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2838 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
2839 (if (outer_op == PLUS_EXPR)
2840 (view_convert (plus @0 (inner_op (view_convert @2) @1)))
2841 (view_convert (minus @0 (neg_inner_op (view_convert @2) @1))))
2842 /* If the constant operation overflows we cannot do the transform
2843 directly as we would introduce undefined overflow, for example
2844 with (a - 1) + INT_MIN. */
2845 (if (types_match (type, @0))
2846 (with { tree cst = const_binop (outer_op == inner_op
2847 ? PLUS_EXPR : MINUS_EXPR,
2849 (if (cst && !TREE_OVERFLOW (cst))
2850 (inner_op @0 { cst; } )
2851 /* X+INT_MAX+1 is X-INT_MIN. */
2852 (if (INTEGRAL_TYPE_P (type) && cst
2853 && wi::to_wide (cst) == wi::min_value (type))
2854 (neg_inner_op @0 { wide_int_to_tree (type, wi::to_wide (cst)); })
2855 /* Last resort, use some unsigned type. */
2856 (with { tree utype = unsigned_type_for (type); }
2858 (view_convert (inner_op
2859 (view_convert:utype @0)
2861 { drop_tree_overflow (cst); }))))))))))))))
2863 /* (CST1 - A) +- CST2 -> CST3 - A */
2864 (for outer_op (plus minus)
2866 (outer_op (nop_convert? (minus CONSTANT_CLASS_P@1 @0)) CONSTANT_CLASS_P@2)
2867 /* If one of the types wraps, use that one. */
2868 (if (!ANY_INTEGRAL_TYPE_P (type) || TYPE_OVERFLOW_WRAPS (type))
2869 /* If all 3 captures are CONSTANT_CLASS_P, punt, as we might recurse
2870 forever if something doesn't simplify into a constant. */
2871 (if (!CONSTANT_CLASS_P (@0))
2872 (minus (outer_op (view_convert @1) @2) (view_convert @0)))
2873 (if (!ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2874 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
2875 (view_convert (minus (outer_op @1 (view_convert @2)) @0))
2876 (if (types_match (type, @0))
2877 (with { tree cst = const_binop (outer_op, type, @1, @2); }
2878 (if (cst && !TREE_OVERFLOW (cst))
2879 (minus { cst; } @0))))))))
2881 /* CST1 - (CST2 - A) -> CST3 + A
2882 Use view_convert because it is safe for vectors and equivalent for
2885 (minus CONSTANT_CLASS_P@1 (nop_convert? (minus CONSTANT_CLASS_P@2 @0)))
2886 /* If one of the types wraps, use that one. */
2887 (if (!ANY_INTEGRAL_TYPE_P (type) || TYPE_OVERFLOW_WRAPS (type))
2888 /* If all 3 captures are CONSTANT_CLASS_P, punt, as we might recurse
2889 forever if something doesn't simplify into a constant. */
2890 (if (!CONSTANT_CLASS_P (@0))
2891 (plus (view_convert @0) (minus @1 (view_convert @2))))
2892 (if (!ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2893 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
2894 (view_convert (plus @0 (minus (view_convert @1) @2)))
2895 (if (types_match (type, @0))
2896 (with { tree cst = const_binop (MINUS_EXPR, type, @1, @2); }
2897 (if (cst && !TREE_OVERFLOW (cst))
2898 (plus { cst; } @0)))))))
2900 /* ((T)(A)) + CST -> (T)(A + CST) */
2903 (plus (convert:s SSA_NAME@0) INTEGER_CST@1)
2904 (if (TREE_CODE (TREE_TYPE (@0)) == INTEGER_TYPE
2905 && TREE_CODE (type) == INTEGER_TYPE
2906 && TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (@0))
2907 && int_fits_type_p (@1, TREE_TYPE (@0)))
2908 /* Perform binary operation inside the cast if the constant fits
2909 and (A + CST)'s range does not overflow. */
2912 wi::overflow_type min_ovf = wi::OVF_OVERFLOW,
2913 max_ovf = wi::OVF_OVERFLOW;
2914 tree inner_type = TREE_TYPE (@0);
2917 = wide_int::from (wi::to_wide (@1), TYPE_PRECISION (inner_type),
2918 TYPE_SIGN (inner_type));
2921 if (get_global_range_query ()->range_of_expr (vr, @0)
2922 && vr.kind () == VR_RANGE)
2924 wide_int wmin0 = vr.lower_bound ();
2925 wide_int wmax0 = vr.upper_bound ();
2926 wi::add (wmin0, w1, TYPE_SIGN (inner_type), &min_ovf);
2927 wi::add (wmax0, w1, TYPE_SIGN (inner_type), &max_ovf);
2930 (if (min_ovf == wi::OVF_NONE && max_ovf == wi::OVF_NONE)
2931 (convert (plus @0 { wide_int_to_tree (TREE_TYPE (@0), w1); } )))
2935 /* ((T)(A + CST1)) + CST2 -> (T)(A) + (T)CST1 + CST2 */
2937 (for op (plus minus)
2939 (plus (convert:s (op:s @0 INTEGER_CST@1)) INTEGER_CST@2)
2940 (if (TREE_CODE (TREE_TYPE (@0)) == INTEGER_TYPE
2941 && TREE_CODE (type) == INTEGER_TYPE
2942 && TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (@0))
2943 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2944 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0))
2945 && TYPE_OVERFLOW_WRAPS (type))
2946 (plus (convert @0) (op @2 (convert @1))))))
2949 /* (T)(A) +- (T)(B) -> (T)(A +- B) only when (A +- B) could be simplified
2950 to a simple value. */
2951 (for op (plus minus)
2953 (op (convert @0) (convert @1))
2954 (if (INTEGRAL_TYPE_P (type)
2955 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
2956 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))
2957 && types_match (TREE_TYPE (@0), TREE_TYPE (@1))
2958 && !TYPE_OVERFLOW_TRAPS (type)
2959 && !TYPE_OVERFLOW_SANITIZED (type))
2960 (convert (op! @0 @1)))))
2964 (plus:c (convert? (bit_not @0)) (convert? @0))
2965 (if (!TYPE_OVERFLOW_TRAPS (type))
2966 (convert { build_all_ones_cst (TREE_TYPE (@0)); })))
2970 (plus (convert? (bit_not @0)) integer_each_onep)
2971 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2972 (negate (convert @0))))
2976 (minus (convert? (negate @0)) integer_each_onep)
2977 (if (!TYPE_OVERFLOW_TRAPS (type)
2978 && TREE_CODE (type) != COMPLEX_TYPE
2979 && tree_nop_conversion_p (type, TREE_TYPE (@0)))
2980 (bit_not (convert @0))))
2984 (minus integer_all_onesp @0)
2985 (if (TREE_CODE (type) != COMPLEX_TYPE)
2988 /* (T)(P + A) - (T)P -> (T) A */
2990 (minus (convert (plus:c @@0 @1))
2992 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
2993 /* For integer types, if A has a smaller type
2994 than T the result depends on the possible
2996 E.g. T=size_t, A=(unsigned)429497295, P>0.
2997 However, if an overflow in P + A would cause
2998 undefined behavior, we can assume that there
3000 || (INTEGRAL_TYPE_P (TREE_TYPE (@1))
3001 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))))
3004 (minus (convert (pointer_plus @@0 @1))
3006 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
3007 /* For pointer types, if the conversion of A to the
3008 final type requires a sign- or zero-extension,
3009 then we have to punt - it is not defined which
3011 || (POINTER_TYPE_P (TREE_TYPE (@0))
3012 && TREE_CODE (@1) == INTEGER_CST
3013 && tree_int_cst_sign_bit (@1) == 0))
3016 (pointer_diff (pointer_plus @@0 @1) @0)
3017 /* The second argument of pointer_plus must be interpreted as signed, and
3018 thus sign-extended if necessary. */
3019 (with { tree stype = signed_type_for (TREE_TYPE (@1)); }
3020 /* Use view_convert instead of convert here, as POINTER_PLUS_EXPR
3021 second arg is unsigned even when we need to consider it as signed,
3022 we don't want to diagnose overflow here. */
3023 (convert (view_convert:stype @1))))
3025 /* (T)P - (T)(P + A) -> -(T) A */
3027 (minus (convert? @0)
3028 (convert (plus:c @@0 @1)))
3029 (if (INTEGRAL_TYPE_P (type)
3030 && TYPE_OVERFLOW_UNDEFINED (type)
3031 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
3032 (with { tree utype = unsigned_type_for (type); }
3033 (convert (negate (convert:utype @1))))
3034 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
3035 /* For integer types, if A has a smaller type
3036 than T the result depends on the possible
3038 E.g. T=size_t, A=(unsigned)429497295, P>0.
3039 However, if an overflow in P + A would cause
3040 undefined behavior, we can assume that there
3042 || (INTEGRAL_TYPE_P (TREE_TYPE (@1))
3043 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))))
3044 (negate (convert @1)))))
3047 (convert (pointer_plus @@0 @1)))
3048 (if (INTEGRAL_TYPE_P (type)
3049 && TYPE_OVERFLOW_UNDEFINED (type)
3050 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
3051 (with { tree utype = unsigned_type_for (type); }
3052 (convert (negate (convert:utype @1))))
3053 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
3054 /* For pointer types, if the conversion of A to the
3055 final type requires a sign- or zero-extension,
3056 then we have to punt - it is not defined which
3058 || (POINTER_TYPE_P (TREE_TYPE (@0))
3059 && TREE_CODE (@1) == INTEGER_CST
3060 && tree_int_cst_sign_bit (@1) == 0))
3061 (negate (convert @1)))))
3063 (pointer_diff @0 (pointer_plus @@0 @1))
3064 /* The second argument of pointer_plus must be interpreted as signed, and
3065 thus sign-extended if necessary. */
3066 (with { tree stype = signed_type_for (TREE_TYPE (@1)); }
3067 /* Use view_convert instead of convert here, as POINTER_PLUS_EXPR
3068 second arg is unsigned even when we need to consider it as signed,
3069 we don't want to diagnose overflow here. */
3070 (negate (convert (view_convert:stype @1)))))
3072 /* (T)(P + A) - (T)(P + B) -> (T)A - (T)B */
3074 (minus (convert (plus:c @@0 @1))
3075 (convert (plus:c @0 @2)))
3076 (if (INTEGRAL_TYPE_P (type)
3077 && TYPE_OVERFLOW_UNDEFINED (type)
3078 && element_precision (type) <= element_precision (TREE_TYPE (@1))
3079 && element_precision (type) <= element_precision (TREE_TYPE (@2)))
3080 (with { tree utype = unsigned_type_for (type); }
3081 (convert (minus (convert:utype @1) (convert:utype @2))))
3082 (if (((element_precision (type) <= element_precision (TREE_TYPE (@1)))
3083 == (element_precision (type) <= element_precision (TREE_TYPE (@2))))
3084 && (element_precision (type) <= element_precision (TREE_TYPE (@1))
3085 /* For integer types, if A has a smaller type
3086 than T the result depends on the possible
3088 E.g. T=size_t, A=(unsigned)429497295, P>0.
3089 However, if an overflow in P + A would cause
3090 undefined behavior, we can assume that there
3092 || (INTEGRAL_TYPE_P (TREE_TYPE (@1))
3093 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
3094 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))
3095 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@2)))))
3096 (minus (convert @1) (convert @2)))))
3098 (minus (convert (pointer_plus @@0 @1))
3099 (convert (pointer_plus @0 @2)))
3100 (if (INTEGRAL_TYPE_P (type)
3101 && TYPE_OVERFLOW_UNDEFINED (type)
3102 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
3103 (with { tree utype = unsigned_type_for (type); }
3104 (convert (minus (convert:utype @1) (convert:utype @2))))
3105 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
3106 /* For pointer types, if the conversion of A to the
3107 final type requires a sign- or zero-extension,
3108 then we have to punt - it is not defined which
3110 || (POINTER_TYPE_P (TREE_TYPE (@0))
3111 && TREE_CODE (@1) == INTEGER_CST
3112 && tree_int_cst_sign_bit (@1) == 0
3113 && TREE_CODE (@2) == INTEGER_CST
3114 && tree_int_cst_sign_bit (@2) == 0))
3115 (minus (convert @1) (convert @2)))))
3117 (pointer_diff (pointer_plus @0 @2) (pointer_plus @1 @2))
3118 (pointer_diff @0 @1))
3120 (pointer_diff (pointer_plus @@0 @1) (pointer_plus @0 @2))
3121 /* The second argument of pointer_plus must be interpreted as signed, and
3122 thus sign-extended if necessary. */
3123 (with { tree stype = signed_type_for (TREE_TYPE (@1)); }
3124 /* Use view_convert instead of convert here, as POINTER_PLUS_EXPR
3125 second arg is unsigned even when we need to consider it as signed,
3126 we don't want to diagnose overflow here. */
3127 (minus (convert (view_convert:stype @1))
3128 (convert (view_convert:stype @2)))))))
3130 /* (A * C) +- (B * C) -> (A+-B) * C and (A * C) +- A -> A * (C+-1).
3131 Modeled after fold_plusminus_mult_expr. */
3132 (if (!TYPE_SATURATING (type)
3133 && (!FLOAT_TYPE_P (type) || flag_associative_math))
3134 (for plusminus (plus minus)
3136 (plusminus (mult:cs@3 @0 @1) (mult:cs@4 @0 @2))
3137 (if (!ANY_INTEGRAL_TYPE_P (type)
3138 || TYPE_OVERFLOW_WRAPS (type)
3139 || (INTEGRAL_TYPE_P (type)
3140 && tree_expr_nonzero_p (@0)
3141 && expr_not_equal_to (@0, wi::minus_one (TYPE_PRECISION (type)))))
3142 (if (single_use (@3) || single_use (@4))
3143 /* If @1 +- @2 is constant require a hard single-use on either
3144 original operand (but not on both). */
3145 (mult (plusminus @1 @2) @0)
3146 (mult! (plusminus @1 @2) @0)
3148 /* We cannot generate constant 1 for fract. */
3149 (if (!ALL_FRACT_MODE_P (TYPE_MODE (type)))
3151 (plusminus @0 (mult:c@3 @0 @2))
3152 (if ((!ANY_INTEGRAL_TYPE_P (type)
3153 || TYPE_OVERFLOW_WRAPS (type)
3154 /* For @0 + @0*@2 this transformation would introduce UB
3155 (where there was none before) for @0 in [-1,0] and @2 max.
3156 For @0 - @0*@2 this transformation would introduce UB
3157 for @0 0 and @2 in [min,min+1] or @0 -1 and @2 min+1. */
3158 || (INTEGRAL_TYPE_P (type)
3159 && ((tree_expr_nonzero_p (@0)
3160 && expr_not_equal_to (@0,
3161 wi::minus_one (TYPE_PRECISION (type))))
3162 || (plusminus == PLUS_EXPR
3163 ? expr_not_equal_to (@2,
3164 wi::max_value (TYPE_PRECISION (type), SIGNED))
3165 /* Let's ignore the @0 -1 and @2 min case. */
3166 : (expr_not_equal_to (@2,
3167 wi::min_value (TYPE_PRECISION (type), SIGNED))
3168 && expr_not_equal_to (@2,
3169 wi::min_value (TYPE_PRECISION (type), SIGNED)
3172 (mult (plusminus { build_one_cst (type); } @2) @0)))
3174 (plusminus (mult:c@3 @0 @2) @0)
3175 (if ((!ANY_INTEGRAL_TYPE_P (type)
3176 || TYPE_OVERFLOW_WRAPS (type)
3177 /* For @0*@2 + @0 this transformation would introduce UB
3178 (where there was none before) for @0 in [-1,0] and @2 max.
3179 For @0*@2 - @0 this transformation would introduce UB
3180 for @0 0 and @2 min. */
3181 || (INTEGRAL_TYPE_P (type)
3182 && ((tree_expr_nonzero_p (@0)
3183 && (plusminus == MINUS_EXPR
3184 || expr_not_equal_to (@0,
3185 wi::minus_one (TYPE_PRECISION (type)))))
3186 || expr_not_equal_to (@2,
3187 (plusminus == PLUS_EXPR
3188 ? wi::max_value (TYPE_PRECISION (type), SIGNED)
3189 : wi::min_value (TYPE_PRECISION (type), SIGNED))))))
3191 (mult (plusminus @2 { build_one_cst (type); }) @0))))))
3194 /* Canonicalize X + (X << C) into X * (1 + (1 << C)) and
3195 (X << C1) + (X << C2) into X * ((1 << C1) + (1 << C2)). */
3197 (plus:c @0 (lshift:s @0 INTEGER_CST@1))
3198 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3199 && tree_fits_uhwi_p (@1)
3200 && tree_to_uhwi (@1) < element_precision (type)
3201 && (INTEGRAL_TYPE_P (TREE_TYPE (@0))
3202 || optab_handler (smul_optab,
3203 TYPE_MODE (type)) != CODE_FOR_nothing))
3204 (with { tree t = type;
3205 if (!TYPE_OVERFLOW_WRAPS (t)) t = unsigned_type_for (t);
3206 wide_int w = wi::set_bit_in_zero (tree_to_uhwi (@1),
3207 element_precision (type));
3209 tree cst = wide_int_to_tree (VECTOR_TYPE_P (t) ? TREE_TYPE (t)
3211 cst = build_uniform_cst (t, cst); }
3212 (convert (mult (convert:t @0) { cst; })))))
3214 (plus (lshift:s @0 INTEGER_CST@1) (lshift:s @0 INTEGER_CST@2))
3215 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3216 && tree_fits_uhwi_p (@1)
3217 && tree_to_uhwi (@1) < element_precision (type)
3218 && tree_fits_uhwi_p (@2)
3219 && tree_to_uhwi (@2) < element_precision (type)
3220 && (INTEGRAL_TYPE_P (TREE_TYPE (@0))
3221 || optab_handler (smul_optab,
3222 TYPE_MODE (type)) != CODE_FOR_nothing))
3223 (with { tree t = type;
3224 if (!TYPE_OVERFLOW_WRAPS (t)) t = unsigned_type_for (t);
3225 unsigned int prec = element_precision (type);
3226 wide_int w = wi::set_bit_in_zero (tree_to_uhwi (@1), prec);
3227 w += wi::set_bit_in_zero (tree_to_uhwi (@2), prec);
3228 tree cst = wide_int_to_tree (VECTOR_TYPE_P (t) ? TREE_TYPE (t)
3230 cst = build_uniform_cst (t, cst); }
3231 (convert (mult (convert:t @0) { cst; })))))
3234 /* Canonicalize (X*C1)|(X*C2) and (X*C1)^(X*C2) to (C1+C2)*X when
3235 tree_nonzero_bits allows IOR and XOR to be treated like PLUS.
3236 Likewise, handle (X<<C3) and X as legitimate variants of X*C. */
3237 (for op (bit_ior bit_xor)
3239 (op (mult:s@0 @1 INTEGER_CST@2)
3240 (mult:s@3 @1 INTEGER_CST@4))
3241 (if (INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_WRAPS (type)
3242 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@3)) == 0)
3244 { wide_int_to_tree (type, wi::to_wide (@2) + wi::to_wide (@4)); })))
3246 (op:c (mult:s@0 @1 INTEGER_CST@2)
3247 (lshift:s@3 @1 INTEGER_CST@4))
3248 (if (INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_WRAPS (type)
3249 && tree_int_cst_sgn (@4) > 0
3250 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@3)) == 0)
3251 (with { wide_int wone = wi::one (TYPE_PRECISION (type));
3252 wide_int c = wi::add (wi::to_wide (@2),
3253 wi::lshift (wone, wi::to_wide (@4))); }
3254 (mult @1 { wide_int_to_tree (type, c); }))))
3256 (op:c (mult:s@0 @1 INTEGER_CST@2)
3258 (if (INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_WRAPS (type)
3259 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@1)) == 0)
3261 { wide_int_to_tree (type,
3262 wi::add (wi::to_wide (@2), 1)); })))
3264 (op (lshift:s@0 @1 INTEGER_CST@2)
3265 (lshift:s@3 @1 INTEGER_CST@4))
3266 (if (INTEGRAL_TYPE_P (type)
3267 && tree_int_cst_sgn (@2) > 0
3268 && tree_int_cst_sgn (@4) > 0
3269 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@3)) == 0)
3270 (with { tree t = type;
3271 if (!TYPE_OVERFLOW_WRAPS (t))
3272 t = unsigned_type_for (t);
3273 wide_int wone = wi::one (TYPE_PRECISION (t));
3274 wide_int c = wi::add (wi::lshift (wone, wi::to_wide (@2)),
3275 wi::lshift (wone, wi::to_wide (@4))); }
3276 (convert (mult:t (convert:t @1) { wide_int_to_tree (t,c); })))))
3278 (op:c (lshift:s@0 @1 INTEGER_CST@2)
3280 (if (INTEGRAL_TYPE_P (type)
3281 && tree_int_cst_sgn (@2) > 0
3282 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@1)) == 0)
3283 (with { tree t = type;
3284 if (!TYPE_OVERFLOW_WRAPS (t))
3285 t = unsigned_type_for (t);
3286 wide_int wone = wi::one (TYPE_PRECISION (t));
3287 wide_int c = wi::add (wi::lshift (wone, wi::to_wide (@2)), wone); }
3288 (convert (mult:t (convert:t @1) { wide_int_to_tree (t, c); }))))))
3290 /* Simplifications of MIN_EXPR, MAX_EXPR, fmin() and fmax(). */
3292 (for minmax (min max)
3296 /* For fmin() and fmax(), skip folding when both are sNaN. */
3297 (for minmax (FMIN_ALL FMAX_ALL)
3300 (if (!tree_expr_maybe_signaling_nan_p (@0))
3302 /* min(max(x,y),y) -> y. */
3304 (min:c (max:c @0 @1) @1)
3306 /* max(min(x,y),y) -> y. */
3308 (max:c (min:c @0 @1) @1)
3310 /* max(a,-a) -> abs(a). */
3312 (max:c @0 (negate @0))
3313 (if (TREE_CODE (type) != COMPLEX_TYPE
3314 && (! ANY_INTEGRAL_TYPE_P (type)
3315 || TYPE_OVERFLOW_UNDEFINED (type)))
3317 /* min(a,-a) -> -abs(a). */
3319 (min:c @0 (negate @0))
3320 (if (TREE_CODE (type) != COMPLEX_TYPE
3321 && (! ANY_INTEGRAL_TYPE_P (type)
3322 || TYPE_OVERFLOW_UNDEFINED (type)))
3327 (if (INTEGRAL_TYPE_P (type)
3328 && TYPE_MIN_VALUE (type)
3329 && operand_equal_p (@1, TYPE_MIN_VALUE (type), OEP_ONLY_CONST))
3331 (if (INTEGRAL_TYPE_P (type)
3332 && TYPE_MAX_VALUE (type)
3333 && operand_equal_p (@1, TYPE_MAX_VALUE (type), OEP_ONLY_CONST))
3338 (if (INTEGRAL_TYPE_P (type)
3339 && TYPE_MAX_VALUE (type)
3340 && operand_equal_p (@1, TYPE_MAX_VALUE (type), OEP_ONLY_CONST))
3342 (if (INTEGRAL_TYPE_P (type)
3343 && TYPE_MIN_VALUE (type)
3344 && operand_equal_p (@1, TYPE_MIN_VALUE (type), OEP_ONLY_CONST))
3347 /* max (a, a + CST) -> a + CST where CST is positive. */
3348 /* max (a, a + CST) -> a where CST is negative. */
3350 (max:c @0 (plus@2 @0 INTEGER_CST@1))
3351 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
3352 (if (tree_int_cst_sgn (@1) > 0)
3356 /* min (a, a + CST) -> a where CST is positive. */
3357 /* min (a, a + CST) -> a + CST where CST is negative. */
3359 (min:c @0 (plus@2 @0 INTEGER_CST@1))
3360 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
3361 (if (tree_int_cst_sgn (@1) > 0)
3365 /* Simplify min (&var[off0], &var[off1]) etc. depending on whether
3366 the addresses are known to be less, equal or greater. */
3367 (for minmax (min max)
3370 (minmax (convert1?@2 addr@0) (convert2?@3 addr@1))
3373 poly_int64 off0, off1;
3375 int equal = address_compare (cmp, TREE_TYPE (@2), @0, @1, base0, base1,
3376 off0, off1, GENERIC);
3379 (if (minmax == MIN_EXPR)
3380 (if (known_le (off0, off1))
3382 (if (known_gt (off0, off1))
3384 (if (known_ge (off0, off1))
3386 (if (known_lt (off0, off1))
3389 /* (convert (minmax ((convert (x) c)))) -> minmax (x c) if x is promoted
3390 and the outer convert demotes the expression back to x's type. */
3391 (for minmax (min max)
3393 (convert (minmax@0 (convert @1) INTEGER_CST@2))
3394 (if (INTEGRAL_TYPE_P (type)
3395 && types_match (@1, type) && int_fits_type_p (@2, type)
3396 && TYPE_SIGN (TREE_TYPE (@0)) == TYPE_SIGN (type)
3397 && TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (type))
3398 (minmax @1 (convert @2)))))
3400 (for minmax (FMIN_ALL FMAX_ALL)
3401 /* If either argument is NaN and other one is not sNaN, return the other
3402 one. Avoid the transformation if we get (and honor) a signalling NaN. */
3404 (minmax:c @0 REAL_CST@1)
3405 (if (real_isnan (TREE_REAL_CST_PTR (@1))
3406 && (!HONOR_SNANS (@1) || !TREE_REAL_CST (@1).signalling)
3407 && !tree_expr_maybe_signaling_nan_p (@0))
3409 /* Convert fmin/fmax to MIN_EXPR/MAX_EXPR. C99 requires these
3410 functions to return the numeric arg if the other one is NaN.
3411 MIN and MAX don't honor that, so only transform if -ffinite-math-only
3412 is set. C99 doesn't require -0.0 to be handled, so we don't have to
3413 worry about it either. */
3414 (if (flag_finite_math_only)
3421 /* min (-A, -B) -> -max (A, B) */
3422 (for minmax (min max FMIN_ALL FMAX_ALL)
3423 maxmin (max min FMAX_ALL FMIN_ALL)
3425 (minmax (negate:s@2 @0) (negate:s@3 @1))
3426 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
3427 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3428 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))))
3429 (negate (maxmin @0 @1)))))
3430 /* MIN (~X, ~Y) -> ~MAX (X, Y)
3431 MAX (~X, ~Y) -> ~MIN (X, Y) */
3432 (for minmax (min max)
3435 (minmax (bit_not:s@2 @0) (bit_not:s@3 @1))
3436 (bit_not (maxmin @0 @1))))
3438 /* MIN (X, Y) == X -> X <= Y */
3439 (for minmax (min min max max)
3443 (cmp:c (minmax:c @0 @1) @0)
3444 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0)))
3446 /* MIN (X, 5) == 0 -> X == 0
3447 MIN (X, 5) == 7 -> false */
3450 (cmp (min @0 INTEGER_CST@1) INTEGER_CST@2)
3451 (if (wi::lt_p (wi::to_wide (@1), wi::to_wide (@2),
3452 TYPE_SIGN (TREE_TYPE (@0))))
3453 { constant_boolean_node (cmp == NE_EXPR, type); }
3454 (if (wi::gt_p (wi::to_wide (@1), wi::to_wide (@2),
3455 TYPE_SIGN (TREE_TYPE (@0))))
3459 (cmp (max @0 INTEGER_CST@1) INTEGER_CST@2)
3460 (if (wi::gt_p (wi::to_wide (@1), wi::to_wide (@2),
3461 TYPE_SIGN (TREE_TYPE (@0))))
3462 { constant_boolean_node (cmp == NE_EXPR, type); }
3463 (if (wi::lt_p (wi::to_wide (@1), wi::to_wide (@2),
3464 TYPE_SIGN (TREE_TYPE (@0))))
3466 /* MIN (X, C1) < C2 -> X < C2 || C1 < C2 */
3467 (for minmax (min min max max min min max max )
3468 cmp (lt le gt ge gt ge lt le )
3469 comb (bit_ior bit_ior bit_ior bit_ior bit_and bit_and bit_and bit_and)
3471 (cmp (minmax @0 INTEGER_CST@1) INTEGER_CST@2)
3472 (comb (cmp @0 @2) (cmp @1 @2))))
3474 /* X <= MAX(X, Y) -> true
3475 X > MAX(X, Y) -> false
3476 X >= MIN(X, Y) -> true
3477 X < MIN(X, Y) -> false */
3478 (for minmax (min min max max )
3481 (cmp @0 (minmax:c @0 @1))
3482 { constant_boolean_node (cmp == GE_EXPR || cmp == LE_EXPR, type); } ))
3484 /* Undo fancy ways of writing max/min or other ?: expressions, like
3485 a - ((a - b) & -(a < b)) and a - (a - b) * (a < b) into (a < b) ? b : a.
3486 People normally use ?: and that is what we actually try to optimize. */
3487 /* Transform A + (B-A)*cmp into cmp ? B : A. */
3489 (plus:c @0 (mult:c (minus @1 @0) zero_one_valued_p@2))
3490 (if (INTEGRAL_TYPE_P (type)
3491 && (GIMPLE || !TREE_SIDE_EFFECTS (@1)))
3492 (cond (convert:boolean_type_node @2) @1 @0)))
3493 /* Transform A - (A-B)*cmp into cmp ? B : A. */
3495 (minus @0 (mult:c (minus @0 @1) zero_one_valued_p@2))
3496 (if (INTEGRAL_TYPE_P (type)
3497 && (GIMPLE || !TREE_SIDE_EFFECTS (@1)))
3498 (cond (convert:boolean_type_node @2) @1 @0)))
3499 /* Transform A ^ (A^B)*cmp into cmp ? B : A. */
3501 (bit_xor:c @0 (mult:c (bit_xor:c @0 @1) zero_one_valued_p@2))
3502 (if (INTEGRAL_TYPE_P (type)
3503 && (GIMPLE || !TREE_SIDE_EFFECTS (@1)))
3504 (cond (convert:boolean_type_node @2) @1 @0)))
3506 /* (x <= 0 ? -x : 0) -> max(-x, 0). */
3508 (cond (le @0 integer_zerop@1) (negate@2 @0) integer_zerop@1)
3511 /* ((x & 0x1) == 0) ? y : z <op> y -> (-(typeof(y))(x & 0x1) & z) <op> y */
3512 (for op (bit_xor bit_ior)
3514 (cond (eq zero_one_valued_p@0
3518 (if (INTEGRAL_TYPE_P (type)
3519 && TYPE_PRECISION (type) > 1
3520 && (INTEGRAL_TYPE_P (TREE_TYPE (@0))))
3521 (op (bit_and (negate (convert:type @0)) @2) @1))))
3523 /* ((x & 0x1) == 0) ? z <op> y : y -> (-(typeof(y))(x & 0x1) & z) <op> y */
3524 (for op (bit_xor bit_ior)
3526 (cond (ne zero_one_valued_p@0
3530 (if (INTEGRAL_TYPE_P (type)
3531 && TYPE_PRECISION (type) > 1
3532 && (INTEGRAL_TYPE_P (TREE_TYPE (@0))))
3533 (op (bit_and (negate (convert:type @0)) @2) @1))))
3535 /* Simplifications of shift and rotates. */
3537 (for rotate (lrotate rrotate)
3539 (rotate integer_all_onesp@0 @1)
3542 /* Optimize -1 >> x for arithmetic right shifts. */
3544 (rshift integer_all_onesp@0 @1)
3545 (if (!TYPE_UNSIGNED (type))
3548 /* Optimize (x >> c) << c into x & (-1<<c). */
3550 (lshift (nop_convert? (rshift @0 INTEGER_CST@1)) @1)
3551 (if (wi::ltu_p (wi::to_wide (@1), element_precision (type)))
3552 /* It doesn't matter if the right shift is arithmetic or logical. */
3553 (bit_and (view_convert @0) (lshift { build_minus_one_cst (type); } @1))))
3556 (lshift (convert (convert@2 (rshift @0 INTEGER_CST@1))) @1)
3557 (if (wi::ltu_p (wi::to_wide (@1), element_precision (type))
3558 /* Allow intermediate conversion to integral type with whatever sign, as
3559 long as the low TYPE_PRECISION (type)
3560 - TYPE_PRECISION (TREE_TYPE (@2)) bits are preserved. */
3561 && INTEGRAL_TYPE_P (type)
3562 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
3563 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
3564 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (@0))
3565 && (TYPE_PRECISION (TREE_TYPE (@2)) >= TYPE_PRECISION (type)
3566 || wi::geu_p (wi::to_wide (@1),
3567 TYPE_PRECISION (type)
3568 - TYPE_PRECISION (TREE_TYPE (@2)))))
3569 (bit_and (convert @0) (lshift { build_minus_one_cst (type); } @1))))
3571 /* Optimize (x << c) >> c into x & ((unsigned)-1 >> c) for unsigned
3574 (rshift (lshift @0 INTEGER_CST@1) @1)
3575 (if (TYPE_UNSIGNED (type)
3576 && (wi::ltu_p (wi::to_wide (@1), element_precision (type))))
3577 (bit_and @0 (rshift { build_minus_one_cst (type); } @1))))
3579 /* Optimize x >> x into 0 */
3582 { build_zero_cst (type); })
3584 (for shiftrotate (lrotate rrotate lshift rshift)
3586 (shiftrotate @0 integer_zerop)
3589 (shiftrotate integer_zerop@0 @1)
3591 /* Prefer vector1 << scalar to vector1 << vector2
3592 if vector2 is uniform. */
3593 (for vec (VECTOR_CST CONSTRUCTOR)
3595 (shiftrotate @0 vec@1)
3596 (with { tree tem = uniform_vector_p (@1); }
3598 (shiftrotate @0 { tem; }))))))
3600 /* Simplify X << Y where Y's low width bits are 0 to X, as only valid
3601 Y is 0. Similarly for X >> Y. */
3603 (for shift (lshift rshift)
3605 (shift @0 SSA_NAME@1)
3606 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1)))
3608 int width = ceil_log2 (element_precision (TREE_TYPE (@0)));
3609 int prec = TYPE_PRECISION (TREE_TYPE (@1));
3611 (if ((get_nonzero_bits (@1) & wi::mask (width, false, prec)) == 0)
3615 /* Rewrite an LROTATE_EXPR by a constant into an
3616 RROTATE_EXPR by a new constant. */
3618 (lrotate @0 INTEGER_CST@1)
3619 (rrotate @0 { const_binop (MINUS_EXPR, TREE_TYPE (@1),
3620 build_int_cst (TREE_TYPE (@1),
3621 element_precision (type)), @1); }))
3623 /* Turn (a OP c1) OP c2 into a OP (c1+c2). */
3624 (for op (lrotate rrotate rshift lshift)
3626 (op (op @0 INTEGER_CST@1) INTEGER_CST@2)
3627 (with { unsigned int prec = element_precision (type); }
3628 (if (wi::ge_p (wi::to_wide (@1), 0, TYPE_SIGN (TREE_TYPE (@1)))
3629 && wi::lt_p (wi::to_wide (@1), prec, TYPE_SIGN (TREE_TYPE (@1)))
3630 && wi::ge_p (wi::to_wide (@2), 0, TYPE_SIGN (TREE_TYPE (@2)))
3631 && wi::lt_p (wi::to_wide (@2), prec, TYPE_SIGN (TREE_TYPE (@2))))
3632 (with { unsigned int low = (tree_to_uhwi (@1)
3633 + tree_to_uhwi (@2)); }
3634 /* Deal with a OP (c1 + c2) being undefined but (a OP c1) OP c2
3635 being well defined. */
3637 (if (op == LROTATE_EXPR || op == RROTATE_EXPR)
3638 (op @0 { build_int_cst (TREE_TYPE (@1), low % prec); })
3639 (if (TYPE_UNSIGNED (type) || op == LSHIFT_EXPR)
3640 { build_zero_cst (type); }
3641 (op @0 { build_int_cst (TREE_TYPE (@1), prec - 1); })))
3642 (op @0 { build_int_cst (TREE_TYPE (@1), low); })))))))
3645 /* Simplify (CST << x) & 1 to 0 if CST is even or to x == 0 if it is odd. */
3647 (bit_and (lshift INTEGER_CST@1 @0) integer_onep)
3648 (if ((wi::to_wide (@1) & 1) != 0)
3649 (convert (eq:boolean_type_node @0 { build_zero_cst (TREE_TYPE (@0)); }))
3650 { build_zero_cst (type); }))
3652 /* Simplify ((C << x) & D) != 0 where C and D are power of two constants,
3653 either to false if D is smaller (unsigned comparison) than C, or to
3654 x == log2 (D) - log2 (C). Similarly for right shifts. */
3658 (cmp (bit_and (lshift integer_pow2p@1 @0) integer_pow2p@2) integer_zerop)
3659 (with { int c1 = wi::clz (wi::to_wide (@1));
3660 int c2 = wi::clz (wi::to_wide (@2)); }
3662 { constant_boolean_node (cmp == NE_EXPR ? false : true, type); }
3663 (icmp @0 { build_int_cst (TREE_TYPE (@0), c1 - c2); }))))
3665 (cmp (bit_and (rshift integer_pow2p@1 @0) integer_pow2p@2) integer_zerop)
3666 (if (tree_int_cst_sgn (@1) > 0)
3667 (with { int c1 = wi::clz (wi::to_wide (@1));
3668 int c2 = wi::clz (wi::to_wide (@2)); }
3670 { constant_boolean_node (cmp == NE_EXPR ? false : true, type); }
3671 (icmp @0 { build_int_cst (TREE_TYPE (@0), c2 - c1); }))))))
3673 /* (CST1 << A) == CST2 -> A == ctz (CST2) - ctz (CST1)
3674 (CST1 << A) != CST2 -> A != ctz (CST2) - ctz (CST1)
3678 (cmp (lshift INTEGER_CST@0 @1) INTEGER_CST@2)
3679 (with { int cand = wi::ctz (wi::to_wide (@2)) - wi::ctz (wi::to_wide (@0)); }
3681 || (!integer_zerop (@2)
3682 && wi::lshift (wi::to_wide (@0), cand) != wi::to_wide (@2)))
3683 { constant_boolean_node (cmp == NE_EXPR, type); }
3684 (if (!integer_zerop (@2)
3685 && wi::lshift (wi::to_wide (@0), cand) == wi::to_wide (@2))
3686 (cmp @1 { build_int_cst (TREE_TYPE (@1), cand); }))))))
3688 /* Fold ((X << C1) & C2) cmp C3 into (X & (C2 >> C1)) cmp (C3 >> C1)
3689 ((X >> C1) & C2) cmp C3 into (X & (C2 << C1)) cmp (C3 << C1). */
3692 (cmp (bit_and:s (lshift:s @0 INTEGER_CST@1) INTEGER_CST@2) INTEGER_CST@3)
3693 (if (tree_fits_shwi_p (@1)
3694 && tree_to_shwi (@1) > 0
3695 && tree_to_shwi (@1) < TYPE_PRECISION (TREE_TYPE (@0)))
3696 (if (tree_to_shwi (@1) > wi::ctz (wi::to_wide (@3)))
3697 { constant_boolean_node (cmp == NE_EXPR, type); }
3698 (with { wide_int c1 = wi::to_wide (@1);
3699 wide_int c2 = wi::lrshift (wi::to_wide (@2), c1);
3700 wide_int c3 = wi::lrshift (wi::to_wide (@3), c1); }
3701 (cmp (bit_and @0 { wide_int_to_tree (TREE_TYPE (@0), c2); })
3702 { wide_int_to_tree (TREE_TYPE (@0), c3); })))))
3704 (cmp (bit_and:s (rshift:s @0 INTEGER_CST@1) INTEGER_CST@2) INTEGER_CST@3)
3705 (if (tree_fits_shwi_p (@1)
3706 && tree_to_shwi (@1) > 0
3707 && tree_to_shwi (@1) < TYPE_PRECISION (TREE_TYPE (@0)))
3708 (with { tree t0 = TREE_TYPE (@0);
3709 unsigned int prec = TYPE_PRECISION (t0);
3710 wide_int c1 = wi::to_wide (@1);
3711 wide_int c2 = wi::to_wide (@2);
3712 wide_int c3 = wi::to_wide (@3);
3713 wide_int sb = wi::set_bit_in_zero (prec - 1, prec); }
3714 (if ((c2 & c3) != c3)
3715 { constant_boolean_node (cmp == NE_EXPR, type); }
3716 (if (TYPE_UNSIGNED (t0))
3717 (if ((c3 & wi::arshift (sb, c1 - 1)) != 0)
3718 { constant_boolean_node (cmp == NE_EXPR, type); }
3719 (cmp (bit_and @0 { wide_int_to_tree (t0, c2 << c1); })
3720 { wide_int_to_tree (t0, c3 << c1); }))
3721 (with { wide_int smask = wi::arshift (sb, c1); }
3723 (if ((c2 & smask) == 0)
3724 (cmp (bit_and @0 { wide_int_to_tree (t0, c2 << c1); })
3725 { wide_int_to_tree (t0, c3 << c1); }))
3726 (if ((c3 & smask) == 0)
3727 (cmp (bit_and @0 { wide_int_to_tree (t0, (c2 << c1) | sb); })
3728 { wide_int_to_tree (t0, c3 << c1); }))
3729 (if ((c2 & smask) != (c3 & smask))
3730 { constant_boolean_node (cmp == NE_EXPR, type); })
3731 (cmp (bit_and @0 { wide_int_to_tree (t0, (c2 << c1) | sb); })
3732 { wide_int_to_tree (t0, (c3 << c1) | sb); })))))))))
3734 /* Fold (X << C1) & C2 into (X << C1) & (C2 | ((1 << C1) - 1))
3735 (X >> C1) & C2 into (X >> C1) & (C2 | ~((type) -1 >> C1))
3736 if the new mask might be further optimized. */
3737 (for shift (lshift rshift)
3739 (bit_and (convert?:s@4 (shift:s@5 (convert1?@3 @0) INTEGER_CST@1))
3741 (if (tree_nop_conversion_p (TREE_TYPE (@4), TREE_TYPE (@5))
3742 && TYPE_PRECISION (type) <= HOST_BITS_PER_WIDE_INT
3743 && tree_fits_uhwi_p (@1)
3744 && tree_to_uhwi (@1) > 0
3745 && tree_to_uhwi (@1) < TYPE_PRECISION (type))
3748 unsigned int shiftc = tree_to_uhwi (@1);
3749 unsigned HOST_WIDE_INT mask = TREE_INT_CST_LOW (@2);
3750 unsigned HOST_WIDE_INT newmask, zerobits = 0;
3751 tree shift_type = TREE_TYPE (@3);
3754 if (shift == LSHIFT_EXPR)
3755 zerobits = ((HOST_WIDE_INT_1U << shiftc) - 1);
3756 else if (shift == RSHIFT_EXPR
3757 && type_has_mode_precision_p (shift_type))
3759 prec = TYPE_PRECISION (TREE_TYPE (@3));
3761 /* See if more bits can be proven as zero because of
3764 && TYPE_UNSIGNED (TREE_TYPE (@0)))
3766 tree inner_type = TREE_TYPE (@0);
3767 if (type_has_mode_precision_p (inner_type)
3768 && TYPE_PRECISION (inner_type) < prec)
3770 prec = TYPE_PRECISION (inner_type);
3771 /* See if we can shorten the right shift. */
3773 shift_type = inner_type;
3774 /* Otherwise X >> C1 is all zeros, so we'll optimize
3775 it into (X, 0) later on by making sure zerobits
3779 zerobits = HOST_WIDE_INT_M1U;
3782 zerobits >>= HOST_BITS_PER_WIDE_INT - shiftc;
3783 zerobits <<= prec - shiftc;
3785 /* For arithmetic shift if sign bit could be set, zerobits
3786 can contain actually sign bits, so no transformation is
3787 possible, unless MASK masks them all away. In that
3788 case the shift needs to be converted into logical shift. */
3789 if (!TYPE_UNSIGNED (TREE_TYPE (@3))
3790 && prec == TYPE_PRECISION (TREE_TYPE (@3)))
3792 if ((mask & zerobits) == 0)
3793 shift_type = unsigned_type_for (TREE_TYPE (@3));
3799 /* ((X << 16) & 0xff00) is (X, 0). */
3800 (if ((mask & zerobits) == mask)
3801 { build_int_cst (type, 0); }
3802 (with { newmask = mask | zerobits; }
3803 (if (newmask != mask && (newmask & (newmask + 1)) == 0)
3806 /* Only do the transformation if NEWMASK is some integer
3808 for (prec = BITS_PER_UNIT;
3809 prec < HOST_BITS_PER_WIDE_INT; prec <<= 1)
3810 if (newmask == (HOST_WIDE_INT_1U << prec) - 1)
3813 (if (prec < HOST_BITS_PER_WIDE_INT
3814 || newmask == HOST_WIDE_INT_M1U)
3816 { tree newmaskt = build_int_cst_type (TREE_TYPE (@2), newmask); }
3817 (if (!tree_int_cst_equal (newmaskt, @2))
3818 (if (shift_type != TREE_TYPE (@3))
3819 (bit_and (convert (shift:shift_type (convert @3) @1)) { newmaskt; })
3820 (bit_and @4 { newmaskt; })))))))))))))
3822 /* ((1 << n) & M) != 0 -> n == log2 (M) */
3828 (nop_convert? (lshift integer_onep @0)) integer_pow2p@1) integer_zerop)
3829 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)))
3830 (icmp @0 { wide_int_to_tree (TREE_TYPE (@0),
3831 wi::exact_log2 (wi::to_wide (@1))); }))))
3833 /* Fold (X {&,^,|} C2) << C1 into (X << C1) {&,^,|} (C2 << C1)
3834 (X {&,^,|} C2) >> C1 into (X >> C1) & (C2 >> C1). */
3835 (for shift (lshift rshift)
3836 (for bit_op (bit_and bit_xor bit_ior)
3838 (shift (convert?:s (bit_op:s @0 INTEGER_CST@2)) INTEGER_CST@1)
3839 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
3840 (with { tree mask = int_const_binop (shift, fold_convert (type, @2), @1); }
3842 (bit_op (shift (convert @0) @1) { mask; })))))))
3844 /* ~(~X >> Y) -> X >> Y (for arithmetic shift). */
3846 (bit_not (convert1?:s (rshift:s (convert2?@0 (bit_not @1)) @2)))
3847 (if (!TYPE_UNSIGNED (TREE_TYPE (@0))
3848 && (element_precision (TREE_TYPE (@0))
3849 <= element_precision (TREE_TYPE (@1))
3850 || !TYPE_UNSIGNED (TREE_TYPE (@1))))
3852 { tree shift_type = TREE_TYPE (@0); }
3853 (convert (rshift (convert:shift_type @1) @2)))))
3855 /* ~(~X >>r Y) -> X >>r Y
3856 ~(~X <<r Y) -> X <<r Y */
3857 (for rotate (lrotate rrotate)
3859 (bit_not (convert1?:s (rotate:s (convert2?@0 (bit_not @1)) @2)))
3860 (if ((element_precision (TREE_TYPE (@0))
3861 <= element_precision (TREE_TYPE (@1))
3862 || !TYPE_UNSIGNED (TREE_TYPE (@1)))
3863 && (element_precision (type) <= element_precision (TREE_TYPE (@0))
3864 || !TYPE_UNSIGNED (TREE_TYPE (@0))))
3866 { tree rotate_type = TREE_TYPE (@0); }
3867 (convert (rotate (convert:rotate_type @1) @2))))))
3870 (for rotate (lrotate rrotate)
3871 invrot (rrotate lrotate)
3872 /* (X >>r Y) cmp (Z >>r Y) may simplify to X cmp Y. */
3874 (cmp (rotate @1 @0) (rotate @2 @0))
3876 /* (X >>r C1) cmp C2 may simplify to X cmp C3. */
3878 (cmp (rotate @0 INTEGER_CST@1) INTEGER_CST@2)
3879 (cmp @0 { const_binop (invrot, TREE_TYPE (@0), @2, @1); }))
3880 /* (X >>r Y) cmp C where C is 0 or ~0, may simplify to X cmp C. */
3882 (cmp (rotate @0 @1) INTEGER_CST@2)
3883 (if (integer_zerop (@2) || integer_all_onesp (@2))
3886 /* Narrow a lshift by constant. */
3888 (convert (lshift:s@0 @1 INTEGER_CST@2))
3889 (if (INTEGRAL_TYPE_P (type)
3890 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
3891 && !integer_zerop (@2)
3892 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0)))
3893 (if (TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (@0))
3894 || wi::ltu_p (wi::to_wide (@2), TYPE_PRECISION (type)))
3895 (lshift (convert @1) @2)
3896 (if (wi::ltu_p (wi::to_wide (@2), TYPE_PRECISION (TREE_TYPE (@0))))
3897 { build_zero_cst (type); }))))
3899 /* Simplifications of conversions. */
3901 /* Basic strip-useless-type-conversions / strip_nops. */
3902 (for cvt (convert view_convert float fix_trunc)
3905 (if ((GIMPLE && useless_type_conversion_p (type, TREE_TYPE (@0)))
3906 || (GENERIC && type == TREE_TYPE (@0)))
3909 /* Contract view-conversions. */
3911 (view_convert (view_convert @0))
3914 /* For integral conversions with the same precision or pointer
3915 conversions use a NOP_EXPR instead. */
3918 (if ((INTEGRAL_TYPE_P (type) || POINTER_TYPE_P (type))
3919 && (INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))
3920 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (@0)))
3923 /* Strip inner integral conversions that do not change precision or size, or
3924 zero-extend while keeping the same size (for bool-to-char). */
3926 (view_convert (convert@0 @1))
3927 (if ((INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))
3928 && (INTEGRAL_TYPE_P (TREE_TYPE (@1)) || POINTER_TYPE_P (TREE_TYPE (@1)))
3929 && TYPE_SIZE (TREE_TYPE (@0)) == TYPE_SIZE (TREE_TYPE (@1))
3930 && (TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1))
3931 || (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (TREE_TYPE (@1))
3932 && TYPE_UNSIGNED (TREE_TYPE (@1)))))
3935 /* Simplify a view-converted empty or single-element constructor. */
3937 (view_convert CONSTRUCTOR@0)
3941 (if (CONSTRUCTOR_NELTS (ctor) == 0)
3942 { build_zero_cst (type); })
3943 (if (CONSTRUCTOR_NELTS (ctor) == 1
3944 && VECTOR_TYPE_P (TREE_TYPE (ctor))
3945 && operand_equal_p (TYPE_SIZE (type),
3946 TYPE_SIZE (TREE_TYPE
3947 (CONSTRUCTOR_ELT (ctor, 0)->value))))
3948 (view_convert { CONSTRUCTOR_ELT (ctor, 0)->value; })))))
3950 /* Re-association barriers around constants and other re-association
3951 barriers can be removed. */
3953 (paren CONSTANT_CLASS_P@0)
3956 (paren (paren@1 @0))
3959 /* Handle cases of two conversions in a row. */
3960 (for ocvt (convert float fix_trunc)
3961 (for icvt (convert float)
3966 tree inside_type = TREE_TYPE (@0);
3967 tree inter_type = TREE_TYPE (@1);
3968 int inside_int = INTEGRAL_TYPE_P (inside_type);
3969 int inside_ptr = POINTER_TYPE_P (inside_type);
3970 int inside_float = FLOAT_TYPE_P (inside_type);
3971 int inside_vec = VECTOR_TYPE_P (inside_type);
3972 unsigned int inside_prec = TYPE_PRECISION (inside_type);
3973 int inside_unsignedp = TYPE_UNSIGNED (inside_type);
3974 int inter_int = INTEGRAL_TYPE_P (inter_type);
3975 int inter_ptr = POINTER_TYPE_P (inter_type);
3976 int inter_float = FLOAT_TYPE_P (inter_type);
3977 int inter_vec = VECTOR_TYPE_P (inter_type);
3978 unsigned int inter_prec = TYPE_PRECISION (inter_type);
3979 int inter_unsignedp = TYPE_UNSIGNED (inter_type);
3980 int final_int = INTEGRAL_TYPE_P (type);
3981 int final_ptr = POINTER_TYPE_P (type);
3982 int final_float = FLOAT_TYPE_P (type);
3983 int final_vec = VECTOR_TYPE_P (type);
3984 unsigned int final_prec = TYPE_PRECISION (type);
3985 int final_unsignedp = TYPE_UNSIGNED (type);
3988 /* In addition to the cases of two conversions in a row
3989 handled below, if we are converting something to its own
3990 type via an object of identical or wider precision, neither
3991 conversion is needed. */
3992 (if (((GIMPLE && useless_type_conversion_p (type, inside_type))
3994 && TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (inside_type)))
3995 && (((inter_int || inter_ptr) && final_int)
3996 || (inter_float && final_float))
3997 && inter_prec >= final_prec)
4000 /* Likewise, if the intermediate and initial types are either both
4001 float or both integer, we don't need the middle conversion if the
4002 former is wider than the latter and doesn't change the signedness
4003 (for integers). Avoid this if the final type is a pointer since
4004 then we sometimes need the middle conversion. */
4005 (if (((inter_int && inside_int) || (inter_float && inside_float))
4006 && (final_int || final_float)
4007 && inter_prec >= inside_prec
4008 && (inter_float || inter_unsignedp == inside_unsignedp))
4011 /* If we have a sign-extension of a zero-extended value, we can
4012 replace that by a single zero-extension. Likewise if the
4013 final conversion does not change precision we can drop the
4014 intermediate conversion. */
4015 (if (inside_int && inter_int && final_int
4016 && ((inside_prec < inter_prec && inter_prec < final_prec
4017 && inside_unsignedp && !inter_unsignedp)
4018 || final_prec == inter_prec))
4021 /* Two conversions in a row are not needed unless:
4022 - some conversion is floating-point (overstrict for now), or
4023 - some conversion is a vector (overstrict for now), or
4024 - the intermediate type is narrower than both initial and
4026 - the intermediate type and innermost type differ in signedness,
4027 and the outermost type is wider than the intermediate, or
4028 - the initial type is a pointer type and the precisions of the
4029 intermediate and final types differ, or
4030 - the final type is a pointer type and the precisions of the
4031 initial and intermediate types differ. */
4032 (if (! inside_float && ! inter_float && ! final_float
4033 && ! inside_vec && ! inter_vec && ! final_vec
4034 && (inter_prec >= inside_prec || inter_prec >= final_prec)
4035 && ! (inside_int && inter_int
4036 && inter_unsignedp != inside_unsignedp
4037 && inter_prec < final_prec)
4038 && ((inter_unsignedp && inter_prec > inside_prec)
4039 == (final_unsignedp && final_prec > inter_prec))
4040 && ! (inside_ptr && inter_prec != final_prec)
4041 && ! (final_ptr && inside_prec != inter_prec))
4044 /* A truncation to an unsigned type (a zero-extension) should be
4045 canonicalized as bitwise and of a mask. */
4046 (if (GIMPLE /* PR70366: doing this in GENERIC breaks -Wconversion. */
4047 && final_int && inter_int && inside_int
4048 && final_prec == inside_prec
4049 && final_prec > inter_prec
4051 (convert (bit_and @0 { wide_int_to_tree
4053 wi::mask (inter_prec, false,
4054 TYPE_PRECISION (inside_type))); })))
4056 /* If we are converting an integer to a floating-point that can
4057 represent it exactly and back to an integer, we can skip the
4058 floating-point conversion. */
4059 (if (GIMPLE /* PR66211 */
4060 && inside_int && inter_float && final_int &&
4061 (unsigned) significand_size (TYPE_MODE (inter_type))
4062 >= inside_prec - !inside_unsignedp)
4065 /* (float_type)(integer_type) x -> trunc (x) if the type of x matches
4066 float_type. Only do the transformation if we do not need to preserve
4067 trapping behaviour, so require !flag_trapping_math. */
4070 (float (fix_trunc @0))
4071 (if (!flag_trapping_math
4072 && types_match (type, TREE_TYPE (@0))
4073 && direct_internal_fn_supported_p (IFN_TRUNC, type,
4078 /* If we have a narrowing conversion to an integral type that is fed by a
4079 BIT_AND_EXPR, we might be able to remove the BIT_AND_EXPR if it merely
4080 masks off bits outside the final type (and nothing else). */
4082 (convert (bit_and @0 INTEGER_CST@1))
4083 (if (INTEGRAL_TYPE_P (type)
4084 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
4085 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))
4086 && operand_equal_p (@1, build_low_bits_mask (TREE_TYPE (@1),
4087 TYPE_PRECISION (type)), 0))
4091 /* (X /[ex] A) * A -> X. */
4093 (mult (convert1? (exact_div @0 @@1)) (convert2? @1))
4096 /* Simplify (A / B) * B + (A % B) -> A. */
4097 (for div (trunc_div ceil_div floor_div round_div)
4098 mod (trunc_mod ceil_mod floor_mod round_mod)
4100 (plus:c (mult:c (div @0 @1) @1) (mod @0 @1))
4103 /* x / y * y == x -> x % y == 0. */
4105 (eq:c (mult:c (trunc_div:s @0 @1) @1) @0)
4106 (if (TREE_CODE (TREE_TYPE (@0)) != COMPLEX_TYPE)
4107 (eq (trunc_mod @0 @1) { build_zero_cst (TREE_TYPE (@0)); })))
4109 /* ((X /[ex] A) +- B) * A --> X +- A * B. */
4110 (for op (plus minus)
4112 (mult (convert1? (op (convert2? (exact_div @0 INTEGER_CST@@1)) INTEGER_CST@2)) @1)
4113 (if (tree_nop_conversion_p (type, TREE_TYPE (@2))
4114 && tree_nop_conversion_p (TREE_TYPE (@0), TREE_TYPE (@2)))
4117 wi::overflow_type overflow;
4118 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@2),
4119 TYPE_SIGN (type), &overflow);
4121 (if (types_match (type, TREE_TYPE (@2))
4122 && types_match (TREE_TYPE (@0), TREE_TYPE (@2)) && !overflow)
4123 (op @0 { wide_int_to_tree (type, mul); })
4124 (with { tree utype = unsigned_type_for (type); }
4125 (convert (op (convert:utype @0)
4126 (mult (convert:utype @1) (convert:utype @2))))))))))
4128 /* Canonicalization of binary operations. */
4130 /* Convert X + -C into X - C. */
4132 (plus @0 REAL_CST@1)
4133 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
4134 (with { tree tem = const_unop (NEGATE_EXPR, type, @1); }
4135 (if (!TREE_OVERFLOW (tem) || !flag_trapping_math)
4136 (minus @0 { tem; })))))
4138 /* Convert x+x into x*2. */
4141 (if (SCALAR_FLOAT_TYPE_P (type))
4142 (mult @0 { build_real (type, dconst2); })
4143 (if (INTEGRAL_TYPE_P (type))
4144 (mult @0 { build_int_cst (type, 2); }))))
4148 (minus integer_zerop @1)
4151 (pointer_diff integer_zerop @1)
4152 (negate (convert @1)))
4154 /* (ARG0 - ARG1) is the same as (-ARG1 + ARG0). So check whether
4155 ARG0 is zero and X + ARG0 reduces to X, since that would mean
4156 (-ARG1 + ARG0) reduces to -ARG1. */
4158 (minus real_zerop@0 @1)
4159 (if (fold_real_zero_addition_p (type, @1, @0, 0))
4162 /* Transform x * -1 into -x. */
4164 (mult @0 integer_minus_onep)
4167 /* Reassociate (X * CST) * Y to (X * Y) * CST. This does not introduce
4168 signed overflow for CST != 0 && CST != -1. */
4170 (mult:c (mult:s@3 @0 INTEGER_CST@1) @2)
4171 (if (TREE_CODE (@2) != INTEGER_CST
4173 && !integer_zerop (@1) && !integer_minus_onep (@1))
4174 (mult (mult @0 @2) @1)))
4176 /* True if we can easily extract the real and imaginary parts of a complex
4178 (match compositional_complex
4179 (convert? (complex @0 @1)))
4181 /* COMPLEX_EXPR and REALPART/IMAGPART_EXPR cancellations. */
4183 (complex (realpart @0) (imagpart @0))
4186 (realpart (complex @0 @1))
4189 (imagpart (complex @0 @1))
4192 /* Sometimes we only care about half of a complex expression. */
4194 (realpart (convert?:s (conj:s @0)))
4195 (convert (realpart @0)))
4197 (imagpart (convert?:s (conj:s @0)))
4198 (convert (negate (imagpart @0))))
4199 (for part (realpart imagpart)
4200 (for op (plus minus)
4202 (part (convert?:s@2 (op:s @0 @1)))
4203 (convert (op (part @0) (part @1))))))
4205 (realpart (convert?:s (CEXPI:s @0)))
4208 (imagpart (convert?:s (CEXPI:s @0)))
4211 /* conj(conj(x)) -> x */
4213 (conj (convert? (conj @0)))
4214 (if (tree_nop_conversion_p (TREE_TYPE (@0), type))
4217 /* conj({x,y}) -> {x,-y} */
4219 (conj (convert?:s (complex:s @0 @1)))
4220 (with { tree itype = TREE_TYPE (type); }
4221 (complex (convert:itype @0) (negate (convert:itype @1)))))
4223 /* BSWAP simplifications, transforms checked by gcc.dg/builtin-bswap-8.c. */
4224 (for bswap (BUILT_IN_BSWAP16 BUILT_IN_BSWAP32
4225 BUILT_IN_BSWAP64 BUILT_IN_BSWAP128)
4230 (bswap (bit_not (bswap @0)))
4232 (for bitop (bit_xor bit_ior bit_and)
4234 (bswap (bitop:c (bswap @0) @1))
4235 (bitop @0 (bswap @1))))
4238 (cmp (bswap@2 @0) (bswap @1))
4239 (with { tree ctype = TREE_TYPE (@2); }
4240 (cmp (convert:ctype @0) (convert:ctype @1))))
4242 (cmp (bswap @0) INTEGER_CST@1)
4243 (with { tree ctype = TREE_TYPE (@1); }
4244 (cmp (convert:ctype @0) (bswap! @1)))))
4245 /* (bswap(x) >> C1) & C2 can sometimes be simplified to (x >> C3) & C2. */
4247 (bit_and (convert1? (rshift@0 (convert2? (bswap@4 @1)) INTEGER_CST@2))
4249 (if (BITS_PER_UNIT == 8
4250 && tree_fits_uhwi_p (@2)
4251 && tree_fits_uhwi_p (@3))
4254 unsigned HOST_WIDE_INT prec = TYPE_PRECISION (TREE_TYPE (@4));
4255 unsigned HOST_WIDE_INT bits = tree_to_uhwi (@2);
4256 unsigned HOST_WIDE_INT mask = tree_to_uhwi (@3);
4257 unsigned HOST_WIDE_INT lo = bits & 7;
4258 unsigned HOST_WIDE_INT hi = bits - lo;
4261 && mask < (256u>>lo)
4262 && bits < TYPE_PRECISION (TREE_TYPE(@0)))
4263 (with { unsigned HOST_WIDE_INT ns = (prec - (hi + 8)) + lo; }
4265 (bit_and (convert @1) @3)
4268 tree utype = unsigned_type_for (TREE_TYPE (@1));
4269 tree nst = build_int_cst (integer_type_node, ns);
4271 (bit_and (convert (rshift:utype (convert:utype @1) {nst;})) @3))))))))
4272 /* bswap(x) >> C1 can sometimes be simplified to (T)x >> C2. */
4274 (rshift (convert? (bswap@2 @0)) INTEGER_CST@1)
4275 (if (BITS_PER_UNIT == 8
4276 && CHAR_TYPE_SIZE == 8
4277 && tree_fits_uhwi_p (@1))
4280 unsigned HOST_WIDE_INT prec = TYPE_PRECISION (TREE_TYPE (@2));
4281 unsigned HOST_WIDE_INT bits = tree_to_uhwi (@1);
4282 /* If the bswap was extended before the original shift, this
4283 byte (shift) has the sign of the extension, not the sign of
4284 the original shift. */
4285 tree st = TYPE_PRECISION (type) > prec ? TREE_TYPE (@2) : type;
4287 /* Special case: logical right shift of sign-extended bswap.
4288 (unsigned)(short)bswap16(x)>>12 is (unsigned)((short)x<<8)>>12. */
4289 (if (TYPE_PRECISION (type) > prec
4290 && !TYPE_UNSIGNED (TREE_TYPE (@2))
4291 && TYPE_UNSIGNED (type)
4292 && bits < prec && bits + 8 >= prec)
4293 (with { tree nst = build_int_cst (integer_type_node, prec - 8); }
4294 (rshift (convert (lshift:st (convert:st @0) {nst;})) @1))
4295 (if (bits + 8 == prec)
4296 (if (TYPE_UNSIGNED (st))
4297 (convert (convert:unsigned_char_type_node @0))
4298 (convert (convert:signed_char_type_node @0)))
4299 (if (bits < prec && bits + 8 > prec)
4302 tree nst = build_int_cst (integer_type_node, bits & 7);
4303 tree bt = TYPE_UNSIGNED (st) ? unsigned_char_type_node
4304 : signed_char_type_node;
4306 (convert (rshift:bt (convert:bt @0) {nst;})))))))))
4307 /* bswap(x) & C1 can sometimes be simplified to (x >> C2) & C1. */
4309 (bit_and (convert? (bswap@2 @0)) INTEGER_CST@1)
4310 (if (BITS_PER_UNIT == 8
4311 && tree_fits_uhwi_p (@1)
4312 && tree_to_uhwi (@1) < 256)
4315 unsigned HOST_WIDE_INT prec = TYPE_PRECISION (TREE_TYPE (@2));
4316 tree utype = unsigned_type_for (TREE_TYPE (@0));
4317 tree nst = build_int_cst (integer_type_node, prec - 8);
4319 (bit_and (convert (rshift:utype (convert:utype @0) {nst;})) @1)))))
4322 /* Combine COND_EXPRs and VEC_COND_EXPRs. */
4324 /* Simplify constant conditions.
4325 Only optimize constant conditions when the selected branch
4326 has the same type as the COND_EXPR. This avoids optimizing
4327 away "c ? x : throw", where the throw has a void type.
4328 Note that we cannot throw away the fold-const.cc variant nor
4329 this one as we depend on doing this transform before possibly
4330 A ? B : B -> B triggers and the fold-const.cc one can optimize
4331 0 ? A : B to B even if A has side-effects. Something
4332 genmatch cannot handle. */
4334 (cond INTEGER_CST@0 @1 @2)
4335 (if (integer_zerop (@0))
4336 (if (!VOID_TYPE_P (TREE_TYPE (@2)) || VOID_TYPE_P (type))
4338 (if (!VOID_TYPE_P (TREE_TYPE (@1)) || VOID_TYPE_P (type))
4341 (vec_cond VECTOR_CST@0 @1 @2)
4342 (if (integer_all_onesp (@0))
4344 (if (integer_zerop (@0))
4347 /* Sink unary operations to branches, but only if we do fold both. */
4348 (for op (negate bit_not abs absu)
4350 (op (vec_cond:s @0 @1 @2))
4351 (vec_cond @0 (op! @1) (op! @2))))
4353 /* Sink binary operation to branches, but only if we can fold it. */
4354 (for op (tcc_comparison plus minus mult bit_and bit_ior bit_xor
4355 lshift rshift rdiv trunc_div ceil_div floor_div round_div
4356 trunc_mod ceil_mod floor_mod round_mod min max)
4357 /* (c ? a : b) op (c ? d : e) --> c ? (a op d) : (b op e) */
4359 (op (vec_cond:s @0 @1 @2) (vec_cond:s @0 @3 @4))
4360 (vec_cond @0 (op! @1 @3) (op! @2 @4)))
4362 /* (c ? a : b) op d --> c ? (a op d) : (b op d) */
4364 (op (vec_cond:s @0 @1 @2) @3)
4365 (vec_cond @0 (op! @1 @3) (op! @2 @3)))
4367 (op @3 (vec_cond:s @0 @1 @2))
4368 (vec_cond @0 (op! @3 @1) (op! @3 @2))))
4371 (match (nop_atomic_bit_test_and_p @0 @1 @4)
4372 (bit_and (convert?@4 (ATOMIC_FETCH_OR_XOR_N @2 INTEGER_CST@0 @3))
4375 int ibit = tree_log2 (@0);
4376 int ibit2 = tree_log2 (@1);
4380 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))))))
4382 (match (nop_atomic_bit_test_and_p @0 @1 @3)
4383 (bit_and (convert?@3 (SYNC_FETCH_OR_XOR_N @2 INTEGER_CST@0))
4386 int ibit = tree_log2 (@0);
4387 int ibit2 = tree_log2 (@1);
4391 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))))))
4393 (match (nop_atomic_bit_test_and_p @0 @0 @4)
4396 (ATOMIC_FETCH_OR_XOR_N @2 (nop_convert? (lshift@0 integer_onep@5 @6)) @3))
4398 (if (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0)))))
4400 (match (nop_atomic_bit_test_and_p @0 @0 @4)
4403 (SYNC_FETCH_OR_XOR_N @2 (nop_convert? (lshift@0 integer_onep@3 @5))))
4405 (if (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0)))))
4407 (match (nop_atomic_bit_test_and_p @0 @1 @3)
4408 (bit_and@4 (convert?@3 (ATOMIC_FETCH_AND_N @2 INTEGER_CST@0 @5))
4411 int ibit = wi::exact_log2 (wi::zext (wi::bit_not (wi::to_wide (@0)),
4412 TYPE_PRECISION(type)));
4413 int ibit2 = tree_log2 (@1);
4417 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))))))
4419 (match (nop_atomic_bit_test_and_p @0 @1 @3)
4421 (convert?@3 (SYNC_FETCH_AND_AND_N @2 INTEGER_CST@0))
4424 int ibit = wi::exact_log2 (wi::zext (wi::bit_not (wi::to_wide (@0)),
4425 TYPE_PRECISION(type)));
4426 int ibit2 = tree_log2 (@1);
4430 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))))))
4432 (match (nop_atomic_bit_test_and_p @4 @0 @3)
4435 (ATOMIC_FETCH_AND_N @2 (nop_convert?@4 (bit_not (lshift@0 integer_onep@6 @7))) @5))
4437 (if (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@4)))))
4439 (match (nop_atomic_bit_test_and_p @4 @0 @3)
4442 (SYNC_FETCH_AND_AND_N @2 (nop_convert?@4 (bit_not (lshift@0 integer_onep@6 @7)))))
4444 (if (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@4)))))
4448 /* (v ? w : 0) ? a : b is just (v & w) ? a : b
4449 Currently disabled after pass lvec because ARM understands
4450 VEC_COND_EXPR<v==w,-1,0> but not a plain v==w fed to BIT_IOR_EXPR. */
4452 (vec_cond (vec_cond:s @0 @3 integer_zerop) @1 @2)
4453 (if (optimize_vectors_before_lowering_p () && types_match (@0, @3))
4454 (vec_cond (bit_and @0 @3) @1 @2)))
4456 (vec_cond (vec_cond:s @0 integer_all_onesp @3) @1 @2)
4457 (if (optimize_vectors_before_lowering_p () && types_match (@0, @3))
4458 (vec_cond (bit_ior @0 @3) @1 @2)))
4460 (vec_cond (vec_cond:s @0 integer_zerop @3) @1 @2)
4461 (if (optimize_vectors_before_lowering_p () && types_match (@0, @3))
4462 (vec_cond (bit_ior @0 (bit_not @3)) @2 @1)))
4464 (vec_cond (vec_cond:s @0 @3 integer_all_onesp) @1 @2)
4465 (if (optimize_vectors_before_lowering_p () && types_match (@0, @3))
4466 (vec_cond (bit_and @0 (bit_not @3)) @2 @1)))
4468 /* c1 ? c2 ? a : b : b --> (c1 & c2) ? a : b */
4470 (vec_cond @0 (vec_cond:s @1 @2 @3) @3)
4471 (if (optimize_vectors_before_lowering_p () && types_match (@0, @1))
4472 (vec_cond (bit_and @0 @1) @2 @3)))
4474 (vec_cond @0 @2 (vec_cond:s @1 @2 @3))
4475 (if (optimize_vectors_before_lowering_p () && types_match (@0, @1))
4476 (vec_cond (bit_ior @0 @1) @2 @3)))
4478 (vec_cond @0 (vec_cond:s @1 @2 @3) @2)
4479 (if (optimize_vectors_before_lowering_p () && types_match (@0, @1))
4480 (vec_cond (bit_ior (bit_not @0) @1) @2 @3)))
4482 (vec_cond @0 @3 (vec_cond:s @1 @2 @3))
4483 (if (optimize_vectors_before_lowering_p () && types_match (@0, @1))
4484 (vec_cond (bit_and (bit_not @0) @1) @2 @3)))
4486 /* Canonicalize mask ? { 0, ... } : { -1, ...} to ~mask if the mask
4487 types are compatible. */
4489 (vec_cond @0 VECTOR_CST@1 VECTOR_CST@2)
4490 (if (VECTOR_BOOLEAN_TYPE_P (type)
4491 && types_match (type, TREE_TYPE (@0)))
4492 (if (integer_zerop (@1) && integer_all_onesp (@2))
4494 (if (integer_all_onesp (@1) && integer_zerop (@2))
4497 /* A few simplifications of "a ? CST1 : CST2". */
4498 /* NOTE: Only do this on gimple as the if-chain-to-switch
4499 optimization depends on the gimple to have if statements in it. */
4502 (cond @0 INTEGER_CST@1 INTEGER_CST@2)
4504 (if (integer_zerop (@2))
4506 /* a ? 1 : 0 -> a if 0 and 1 are integral types. */
4507 (if (integer_onep (@1))
4508 (convert (convert:boolean_type_node @0)))
4509 /* a ? powerof2cst : 0 -> a << (log2(powerof2cst)) */
4510 (if (INTEGRAL_TYPE_P (type) && integer_pow2p (@1))
4512 tree shift = build_int_cst (integer_type_node, tree_log2 (@1));
4514 (lshift (convert (convert:boolean_type_node @0)) { shift; })))
4515 /* a ? -1 : 0 -> -a. No need to check the TYPE_PRECISION not being 1
4516 here as the powerof2cst case above will handle that case correctly. */
4517 (if (INTEGRAL_TYPE_P (type) && integer_all_onesp (@1))
4518 (negate (convert (convert:boolean_type_node @0))))))
4519 (if (integer_zerop (@1))
4521 tree booltrue = constant_boolean_node (true, boolean_type_node);
4524 /* a ? 0 : 1 -> !a. */
4525 (if (integer_onep (@2))
4526 (convert (bit_xor (convert:boolean_type_node @0) { booltrue; } )))
4527 /* a ? powerof2cst : 0 -> (!a) << (log2(powerof2cst)) */
4528 (if (INTEGRAL_TYPE_P (type) && integer_pow2p (@2))
4530 tree shift = build_int_cst (integer_type_node, tree_log2 (@2));
4532 (lshift (convert (bit_xor (convert:boolean_type_node @0) { booltrue; } ))
4534 /* a ? -1 : 0 -> -(!a). No need to check the TYPE_PRECISION not being 1
4535 here as the powerof2cst case above will handle that case correctly. */
4536 (if (INTEGRAL_TYPE_P (type) && integer_all_onesp (@2))
4537 (negate (convert (bit_xor (convert:boolean_type_node @0) { booltrue; } ))))
4546 (convert (cond@0 @1 INTEGER_CST@2 INTEGER_CST@3))
4547 (if (INTEGRAL_TYPE_P (type)
4548 && INTEGRAL_TYPE_P (TREE_TYPE (@0)))
4549 (cond @1 (convert @2) (convert @3))))
4551 /* Simplification moved from fold_cond_expr_with_comparison. It may also
4553 /* This pattern implements two kinds simplification:
4556 (cond (cmp (convert1? x) c1) (convert2? x) c2) -> (minmax (x c)) if:
4557 1) Conversions are type widening from smaller type.
4558 2) Const c1 equals to c2 after canonicalizing comparison.
4559 3) Comparison has tree code LT, LE, GT or GE.
4560 This specific pattern is needed when (cmp (convert x) c) may not
4561 be simplified by comparison patterns because of multiple uses of
4562 x. It also makes sense here because simplifying across multiple
4563 referred var is always benefitial for complicated cases.
4566 (cond (eq (convert1? x) c1) (convert2? x) c2) -> (cond (eq x c1) c1 c2). */
4567 (for cmp (lt le gt ge eq)
4569 (cond (cmp (convert1? @1) INTEGER_CST@3) (convert2? @1) INTEGER_CST@2)
4572 tree from_type = TREE_TYPE (@1);
4573 tree c1_type = TREE_TYPE (@3), c2_type = TREE_TYPE (@2);
4574 enum tree_code code = ERROR_MARK;
4576 if (INTEGRAL_TYPE_P (from_type)
4577 && int_fits_type_p (@2, from_type)
4578 && (types_match (c1_type, from_type)
4579 || (TYPE_PRECISION (c1_type) > TYPE_PRECISION (from_type)
4580 && (TYPE_UNSIGNED (from_type)
4581 || TYPE_SIGN (c1_type) == TYPE_SIGN (from_type))))
4582 && (types_match (c2_type, from_type)
4583 || (TYPE_PRECISION (c2_type) > TYPE_PRECISION (from_type)
4584 && (TYPE_UNSIGNED (from_type)
4585 || TYPE_SIGN (c2_type) == TYPE_SIGN (from_type)))))
4589 if (wi::to_widest (@3) == (wi::to_widest (@2) - 1))
4591 /* X <= Y - 1 equals to X < Y. */
4594 /* X > Y - 1 equals to X >= Y. */
4598 if (wi::to_widest (@3) == (wi::to_widest (@2) + 1))
4600 /* X < Y + 1 equals to X <= Y. */
4603 /* X >= Y + 1 equals to X > Y. */
4607 if (code != ERROR_MARK
4608 || wi::to_widest (@2) == wi::to_widest (@3))
4610 if (cmp == LT_EXPR || cmp == LE_EXPR)
4612 if (cmp == GT_EXPR || cmp == GE_EXPR)
4616 /* Can do A == C1 ? A : C2 -> A == C1 ? C1 : C2? */
4617 else if (int_fits_type_p (@3, from_type))
4621 (if (code == MAX_EXPR)
4622 (convert (max @1 (convert @2)))
4623 (if (code == MIN_EXPR)
4624 (convert (min @1 (convert @2)))
4625 (if (code == EQ_EXPR)
4626 (convert (cond (eq @1 (convert @3))
4627 (convert:from_type @3) (convert:from_type @2)))))))))
4629 /* (cond (cmp (convert? x) c1) (op x c2) c3) -> (op (minmax x c1) c2) if:
4631 1) OP is PLUS or MINUS.
4632 2) CMP is LT, LE, GT or GE.
4633 3) C3 == (C1 op C2), and computation doesn't have undefined behavior.
4635 This pattern also handles special cases like:
4637 A) Operand x is a unsigned to signed type conversion and c1 is
4638 integer zero. In this case,
4639 (signed type)x < 0 <=> x > MAX_VAL(signed type)
4640 (signed type)x >= 0 <=> x <= MAX_VAL(signed type)
4641 B) Const c1 may not equal to (C3 op' C2). In this case we also
4642 check equality for (c1+1) and (c1-1) by adjusting comparison
4645 TODO: Though signed type is handled by this pattern, it cannot be
4646 simplified at the moment because C standard requires additional
4647 type promotion. In order to match&simplify it here, the IR needs
4648 to be cleaned up by other optimizers, i.e, VRP. */
4649 (for op (plus minus)
4650 (for cmp (lt le gt ge)
4652 (cond (cmp (convert? @X) INTEGER_CST@1) (op @X INTEGER_CST@2) INTEGER_CST@3)
4653 (with { tree from_type = TREE_TYPE (@X), to_type = TREE_TYPE (@1); }
4654 (if (types_match (from_type, to_type)
4655 /* Check if it is special case A). */
4656 || (TYPE_UNSIGNED (from_type)
4657 && !TYPE_UNSIGNED (to_type)
4658 && TYPE_PRECISION (from_type) == TYPE_PRECISION (to_type)
4659 && integer_zerop (@1)
4660 && (cmp == LT_EXPR || cmp == GE_EXPR)))
4663 wi::overflow_type overflow = wi::OVF_NONE;
4664 enum tree_code code, cmp_code = cmp;
4666 wide_int c1 = wi::to_wide (@1);
4667 wide_int c2 = wi::to_wide (@2);
4668 wide_int c3 = wi::to_wide (@3);
4669 signop sgn = TYPE_SIGN (from_type);
4671 /* Handle special case A), given x of unsigned type:
4672 ((signed type)x < 0) <=> (x > MAX_VAL(signed type))
4673 ((signed type)x >= 0) <=> (x <= MAX_VAL(signed type)) */
4674 if (!types_match (from_type, to_type))
4676 if (cmp_code == LT_EXPR)
4678 if (cmp_code == GE_EXPR)
4680 c1 = wi::max_value (to_type);
4682 /* To simplify this pattern, we require c3 = (c1 op c2). Here we
4683 compute (c3 op' c2) and check if it equals to c1 with op' being
4684 the inverted operator of op. Make sure overflow doesn't happen
4685 if it is undefined. */
4686 if (op == PLUS_EXPR)
4687 real_c1 = wi::sub (c3, c2, sgn, &overflow);
4689 real_c1 = wi::add (c3, c2, sgn, &overflow);
4692 if (!overflow || !TYPE_OVERFLOW_UNDEFINED (from_type))
4694 /* Check if c1 equals to real_c1. Boundary condition is handled
4695 by adjusting comparison operation if necessary. */
4696 if (!wi::cmp (wi::sub (real_c1, 1, sgn, &overflow), c1, sgn)
4699 /* X <= Y - 1 equals to X < Y. */
4700 if (cmp_code == LE_EXPR)
4702 /* X > Y - 1 equals to X >= Y. */
4703 if (cmp_code == GT_EXPR)
4706 if (!wi::cmp (wi::add (real_c1, 1, sgn, &overflow), c1, sgn)
4709 /* X < Y + 1 equals to X <= Y. */
4710 if (cmp_code == LT_EXPR)
4712 /* X >= Y + 1 equals to X > Y. */
4713 if (cmp_code == GE_EXPR)
4716 if (code != cmp_code || !wi::cmp (real_c1, c1, sgn))
4718 if (cmp_code == LT_EXPR || cmp_code == LE_EXPR)
4720 if (cmp_code == GT_EXPR || cmp_code == GE_EXPR)
4725 (if (code == MAX_EXPR)
4726 (op (max @X { wide_int_to_tree (from_type, real_c1); })
4727 { wide_int_to_tree (from_type, c2); })
4728 (if (code == MIN_EXPR)
4729 (op (min @X { wide_int_to_tree (from_type, real_c1); })
4730 { wide_int_to_tree (from_type, c2); })))))))))
4733 /* A >= B ? A : B -> max (A, B) and friends. The code is still
4734 in fold_cond_expr_with_comparison for GENERIC folding with
4735 some extra constraints. */
4736 (for cmp (eq ne le lt unle unlt ge gt unge ungt uneq ltgt)
4738 (cond (cmp:c (nop_convert1?@c0 @0) (nop_convert2?@c1 @1))
4739 (convert3? @0) (convert4? @1))
4740 (if (!HONOR_SIGNED_ZEROS (type)
4741 && (/* Allow widening conversions of the compare operands as data. */
4742 (INTEGRAL_TYPE_P (type)
4743 && types_match (TREE_TYPE (@c0), TREE_TYPE (@0))
4744 && types_match (TREE_TYPE (@c1), TREE_TYPE (@1))
4745 && TYPE_PRECISION (TREE_TYPE (@0)) <= TYPE_PRECISION (type)
4746 && TYPE_PRECISION (TREE_TYPE (@1)) <= TYPE_PRECISION (type))
4747 /* Or sign conversions for the comparison. */
4748 || (types_match (type, TREE_TYPE (@0))
4749 && types_match (type, TREE_TYPE (@1)))))
4751 (if (cmp == EQ_EXPR)
4752 (if (VECTOR_TYPE_P (type))
4755 (if (cmp == NE_EXPR)
4756 (if (VECTOR_TYPE_P (type))
4759 (if (cmp == LE_EXPR || cmp == UNLE_EXPR || cmp == LT_EXPR || cmp == UNLT_EXPR)
4760 (if (!HONOR_NANS (type))
4761 (if (VECTOR_TYPE_P (type))
4762 (view_convert (min @c0 @c1))
4763 (convert (min @c0 @c1)))))
4764 (if (cmp == GE_EXPR || cmp == UNGE_EXPR || cmp == GT_EXPR || cmp == UNGT_EXPR)
4765 (if (!HONOR_NANS (type))
4766 (if (VECTOR_TYPE_P (type))
4767 (view_convert (max @c0 @c1))
4768 (convert (max @c0 @c1)))))
4769 (if (cmp == UNEQ_EXPR)
4770 (if (!HONOR_NANS (type))
4771 (if (VECTOR_TYPE_P (type))
4774 (if (cmp == LTGT_EXPR)
4775 (if (!HONOR_NANS (type))
4776 (if (VECTOR_TYPE_P (type))
4778 (convert @c0))))))))
4781 /* X != C1 ? -X : C2 simplifies to -X when -C1 == C2. */
4783 (cond (ne @0 INTEGER_CST@1) (negate@3 @0) INTEGER_CST@2)
4784 (if (!TYPE_SATURATING (type)
4785 && (TYPE_OVERFLOW_WRAPS (type)
4786 || !wi::only_sign_bit_p (wi::to_wide (@1)))
4787 && wi::eq_p (wi::neg (wi::to_wide (@1)), wi::to_wide (@2)))
4790 /* X != C1 ? ~X : C2 simplifies to ~X when ~C1 == C2. */
4792 (cond (ne @0 INTEGER_CST@1) (bit_not@3 @0) INTEGER_CST@2)
4793 (if (wi::eq_p (wi::bit_not (wi::to_wide (@1)), wi::to_wide (@2)))
4796 /* (X + 1) > Y ? -X : 1 simplifies to X >= Y ? -X : 1 when
4797 X is unsigned, as when X + 1 overflows, X is -1, so -X == 1. */
4799 (cond (gt (plus @0 integer_onep) @1) (negate @0) integer_onep@2)
4800 (if (TYPE_UNSIGNED (type))
4801 (cond (ge @0 @1) (negate @0) @2)))
4803 (for cnd (cond vec_cond)
4804 /* A ? B : (A ? X : C) -> A ? B : C. */
4806 (cnd @0 (cnd @0 @1 @2) @3)
4809 (cnd @0 @1 (cnd @0 @2 @3))
4811 /* A ? B : (!A ? C : X) -> A ? B : C. */
4812 /* ??? This matches embedded conditions open-coded because genmatch
4813 would generate matching code for conditions in separate stmts only.
4814 The following is still important to merge then and else arm cases
4815 from if-conversion. */
4817 (cnd @0 @1 (cnd @2 @3 @4))
4818 (if (inverse_conditions_p (@0, @2))
4821 (cnd @0 (cnd @1 @2 @3) @4)
4822 (if (inverse_conditions_p (@0, @1))
4825 /* A ? B : B -> B. */
4830 /* !A ? B : C -> A ? C : B. */
4832 (cnd (logical_inverted_value truth_valued_p@0) @1 @2)
4835 /* abs/negative simplifications moved from fold_cond_expr_with_comparison,
4836 Need to handle (A - B) case as fold_cond_expr_with_comparison does.
4837 Need to handle UN* comparisons.
4839 None of these transformations work for modes with signed
4840 zeros. If A is +/-0, the first two transformations will
4841 change the sign of the result (from +0 to -0, or vice
4842 versa). The last four will fix the sign of the result,
4843 even though the original expressions could be positive or
4844 negative, depending on the sign of A.
4846 Note that all these transformations are correct if A is
4847 NaN, since the two alternatives (A and -A) are also NaNs. */
4849 (for cnd (cond vec_cond)
4850 /* A == 0 ? A : -A same as -A */
4853 (cnd (cmp @0 zerop) @0 (negate@1 @0))
4854 (if (!HONOR_SIGNED_ZEROS (type))
4857 (cnd (cmp @0 zerop) zerop (negate@1 @0))
4858 (if (!HONOR_SIGNED_ZEROS (type))
4861 /* A != 0 ? A : -A same as A */
4864 (cnd (cmp @0 zerop) @0 (negate @0))
4865 (if (!HONOR_SIGNED_ZEROS (type))
4868 (cnd (cmp @0 zerop) @0 integer_zerop)
4869 (if (!HONOR_SIGNED_ZEROS (type))
4872 /* A >=/> 0 ? A : -A same as abs (A) */
4875 (cnd (cmp @0 zerop) @0 (negate @0))
4876 (if (!HONOR_SIGNED_ZEROS (type)
4877 && !TYPE_UNSIGNED (type))
4879 /* A <=/< 0 ? A : -A same as -abs (A) */
4882 (cnd (cmp @0 zerop) @0 (negate @0))
4883 (if (!HONOR_SIGNED_ZEROS (type)
4884 && !TYPE_UNSIGNED (type))
4885 (if (ANY_INTEGRAL_TYPE_P (type)
4886 && !TYPE_OVERFLOW_WRAPS (type))
4888 tree utype = unsigned_type_for (type);
4890 (convert (negate (absu:utype @0))))
4891 (negate (abs @0)))))
4895 /* -(type)!A -> (type)A - 1. */
4897 (negate (convert?:s (logical_inverted_value:s @0)))
4898 (if (INTEGRAL_TYPE_P (type)
4899 && TREE_CODE (type) != BOOLEAN_TYPE
4900 && TYPE_PRECISION (type) > 1
4901 && TREE_CODE (@0) == SSA_NAME
4902 && ssa_name_has_boolean_range (@0))
4903 (plus (convert:type @0) { build_all_ones_cst (type); })))
4905 /* A + (B vcmp C ? 1 : 0) -> A - (B vcmp C ? -1 : 0), since vector comparisons
4906 return all -1 or all 0 results. */
4907 /* ??? We could instead convert all instances of the vec_cond to negate,
4908 but that isn't necessarily a win on its own. */
4910 (plus:c @3 (view_convert? (vec_cond:s @0 integer_each_onep@1 integer_zerop@2)))
4911 (if (VECTOR_TYPE_P (type)
4912 && known_eq (TYPE_VECTOR_SUBPARTS (type),
4913 TYPE_VECTOR_SUBPARTS (TREE_TYPE (@1)))
4914 && (TYPE_MODE (TREE_TYPE (type))
4915 == TYPE_MODE (TREE_TYPE (TREE_TYPE (@1)))))
4916 (minus @3 (view_convert (vec_cond @0 (negate @1) @2)))))
4918 /* ... likewise A - (B vcmp C ? 1 : 0) -> A + (B vcmp C ? -1 : 0). */
4920 (minus @3 (view_convert? (vec_cond:s @0 integer_each_onep@1 integer_zerop@2)))
4921 (if (VECTOR_TYPE_P (type)
4922 && known_eq (TYPE_VECTOR_SUBPARTS (type),
4923 TYPE_VECTOR_SUBPARTS (TREE_TYPE (@1)))
4924 && (TYPE_MODE (TREE_TYPE (type))
4925 == TYPE_MODE (TREE_TYPE (TREE_TYPE (@1)))))
4926 (plus @3 (view_convert (vec_cond @0 (negate @1) @2)))))
4929 /* Simplifications of comparisons. */
4931 /* See if we can reduce the magnitude of a constant involved in a
4932 comparison by changing the comparison code. This is a canonicalization
4933 formerly done by maybe_canonicalize_comparison_1. */
4937 (cmp @0 uniform_integer_cst_p@1)
4938 (with { tree cst = uniform_integer_cst_p (@1); }
4939 (if (tree_int_cst_sgn (cst) == -1)
4940 (acmp @0 { build_uniform_cst (TREE_TYPE (@1),
4941 wide_int_to_tree (TREE_TYPE (cst),
4947 (cmp @0 uniform_integer_cst_p@1)
4948 (with { tree cst = uniform_integer_cst_p (@1); }
4949 (if (tree_int_cst_sgn (cst) == 1)
4950 (acmp @0 { build_uniform_cst (TREE_TYPE (@1),
4951 wide_int_to_tree (TREE_TYPE (cst),
4952 wi::to_wide (cst) - 1)); })))))
4954 /* We can simplify a logical negation of a comparison to the
4955 inverted comparison. As we cannot compute an expression
4956 operator using invert_tree_comparison we have to simulate
4957 that with expression code iteration. */
4958 (for cmp (tcc_comparison)
4959 icmp (inverted_tcc_comparison)
4960 ncmp (inverted_tcc_comparison_with_nans)
4961 /* Ideally we'd like to combine the following two patterns
4962 and handle some more cases by using
4963 (logical_inverted_value (cmp @0 @1))
4964 here but for that genmatch would need to "inline" that.
4965 For now implement what forward_propagate_comparison did. */
4967 (bit_not (cmp @0 @1))
4968 (if (VECTOR_TYPE_P (type)
4969 || (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) == 1))
4970 /* Comparison inversion may be impossible for trapping math,
4971 invert_tree_comparison will tell us. But we can't use
4972 a computed operator in the replacement tree thus we have
4973 to play the trick below. */
4974 (with { enum tree_code ic = invert_tree_comparison
4975 (cmp, HONOR_NANS (@0)); }
4981 (bit_xor (cmp @0 @1) integer_truep)
4982 (with { enum tree_code ic = invert_tree_comparison
4983 (cmp, HONOR_NANS (@0)); }
4988 /* The following bits are handled by fold_binary_op_with_conditional_arg. */
4990 (ne (cmp@2 @0 @1) integer_zerop)
4991 (if (types_match (type, TREE_TYPE (@2)))
4994 (eq (cmp@2 @0 @1) integer_truep)
4995 (if (types_match (type, TREE_TYPE (@2)))
4998 (ne (cmp@2 @0 @1) integer_truep)
4999 (if (types_match (type, TREE_TYPE (@2)))
5000 (with { enum tree_code ic = invert_tree_comparison
5001 (cmp, HONOR_NANS (@0)); }
5007 (eq (cmp@2 @0 @1) integer_zerop)
5008 (if (types_match (type, TREE_TYPE (@2)))
5009 (with { enum tree_code ic = invert_tree_comparison
5010 (cmp, HONOR_NANS (@0)); }
5016 /* Transform comparisons of the form X - Y CMP 0 to X CMP Y.
5017 ??? The transformation is valid for the other operators if overflow
5018 is undefined for the type, but performing it here badly interacts
5019 with the transformation in fold_cond_expr_with_comparison which
5020 attempts to synthetize ABS_EXPR. */
5022 (for sub (minus pointer_diff)
5024 (cmp (sub@2 @0 @1) integer_zerop)
5025 (if (single_use (@2))
5028 /* Simplify (x < 0) ^ (y < 0) to (x ^ y) < 0 and
5029 (x >= 0) ^ (y >= 0) to (x ^ y) < 0. */
5032 (bit_xor (cmp:s @0 integer_zerop) (cmp:s @1 integer_zerop))
5033 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5034 && !TYPE_UNSIGNED (TREE_TYPE (@0))
5035 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
5036 (lt (bit_xor @0 @1) { build_zero_cst (TREE_TYPE (@0)); }))))
5037 /* Simplify (x < 0) ^ (y >= 0) to (x ^ y) >= 0 and
5038 (x >= 0) ^ (y < 0) to (x ^ y) >= 0. */
5040 (bit_xor:c (lt:s @0 integer_zerop) (ge:s @1 integer_zerop))
5041 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5042 && !TYPE_UNSIGNED (TREE_TYPE (@0))
5043 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
5044 (ge (bit_xor @0 @1) { build_zero_cst (TREE_TYPE (@0)); })))
5046 /* Transform comparisons of the form X * C1 CMP 0 to X CMP 0 in the
5047 signed arithmetic case. That form is created by the compiler
5048 often enough for folding it to be of value. One example is in
5049 computing loop trip counts after Operator Strength Reduction. */
5050 (for cmp (simple_comparison)
5051 scmp (swapped_simple_comparison)
5053 (cmp (mult@3 @0 INTEGER_CST@1) integer_zerop@2)
5054 /* Handle unfolded multiplication by zero. */
5055 (if (integer_zerop (@1))
5057 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
5058 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
5060 /* If @1 is negative we swap the sense of the comparison. */
5061 (if (tree_int_cst_sgn (@1) < 0)
5065 /* For integral types with undefined overflow fold
5066 x * C1 == C2 into x == C2 / C1 or false.
5067 If overflow wraps and C1 is odd, simplify to x == C2 / C1 in the ring
5071 (cmp (mult @0 INTEGER_CST@1) INTEGER_CST@2)
5072 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5073 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
5074 && wi::to_wide (@1) != 0)
5075 (with { widest_int quot; }
5076 (if (wi::multiple_of_p (wi::to_widest (@2), wi::to_widest (@1),
5077 TYPE_SIGN (TREE_TYPE (@0)), "))
5078 (cmp @0 { wide_int_to_tree (TREE_TYPE (@0), quot); })
5079 { constant_boolean_node (cmp == NE_EXPR, type); }))
5080 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5081 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))
5082 && (wi::bit_and (wi::to_wide (@1), 1) == 1))
5085 tree itype = TREE_TYPE (@0);
5086 int p = TYPE_PRECISION (itype);
5087 wide_int m = wi::one (p + 1) << p;
5088 wide_int a = wide_int::from (wi::to_wide (@1), p + 1, UNSIGNED);
5089 wide_int i = wide_int::from (wi::mod_inv (a, m),
5090 p, TYPE_SIGN (itype));
5091 wide_int_to_tree (itype, wi::mul (i, wi::to_wide (@2)));
5094 /* Simplify comparison of something with itself. For IEEE
5095 floating-point, we can only do some of these simplifications. */
5099 (if (! FLOAT_TYPE_P (TREE_TYPE (@0))
5100 || ! tree_expr_maybe_nan_p (@0))
5101 { constant_boolean_node (true, type); }
5103 /* With -ftrapping-math conversion to EQ loses an exception. */
5104 && (! FLOAT_TYPE_P (TREE_TYPE (@0))
5105 || ! flag_trapping_math))
5111 || ! FLOAT_TYPE_P (TREE_TYPE (@0))
5112 || ! tree_expr_maybe_nan_p (@0))
5113 { constant_boolean_node (false, type); })))
5114 (for cmp (unle unge uneq)
5117 { constant_boolean_node (true, type); }))
5118 (for cmp (unlt ungt)
5124 (if (!flag_trapping_math || !tree_expr_maybe_nan_p (@0))
5125 { constant_boolean_node (false, type); }))
5127 /* x == ~x -> false */
5128 /* x != ~x -> true */
5131 (cmp:c @0 (bit_not @0))
5132 { constant_boolean_node (cmp == NE_EXPR, type); }))
5134 /* Fold ~X op ~Y as Y op X. */
5135 (for cmp (simple_comparison)
5137 (cmp (bit_not@2 @0) (bit_not@3 @1))
5138 (if (single_use (@2) && single_use (@3))
5141 /* Fold ~X op C as X op' ~C, where op' is the swapped comparison. */
5142 (for cmp (simple_comparison)
5143 scmp (swapped_simple_comparison)
5145 (cmp (bit_not@2 @0) CONSTANT_CLASS_P@1)
5146 (if (single_use (@2)
5147 && (TREE_CODE (@1) == INTEGER_CST || TREE_CODE (@1) == VECTOR_CST))
5148 (scmp @0 (bit_not @1)))))
5150 (for cmp (simple_comparison)
5153 /* IEEE doesn't distinguish +0 and -0 in comparisons. */
5155 /* a CMP (-0) -> a CMP 0 */
5156 (if (REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@1)))
5157 (cmp @0 { build_real (TREE_TYPE (@1), dconst0); }))
5158 /* (-0) CMP b -> 0 CMP b. */
5159 (if (TREE_CODE (@0) == REAL_CST
5160 && REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@0)))
5161 (cmp { build_real (TREE_TYPE (@0), dconst0); } @1))
5162 /* x != NaN is always true, other ops are always false. */
5163 (if (REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
5164 && (cmp == EQ_EXPR || cmp == NE_EXPR || !flag_trapping_math)
5165 && !tree_expr_signaling_nan_p (@1)
5166 && !tree_expr_maybe_signaling_nan_p (@0))
5167 { constant_boolean_node (cmp == NE_EXPR, type); })
5168 /* NaN != y is always true, other ops are always false. */
5169 (if (TREE_CODE (@0) == REAL_CST
5170 && REAL_VALUE_ISNAN (TREE_REAL_CST (@0))
5171 && (cmp == EQ_EXPR || cmp == NE_EXPR || !flag_trapping_math)
5172 && !tree_expr_signaling_nan_p (@0)
5173 && !tree_expr_signaling_nan_p (@1))
5174 { constant_boolean_node (cmp == NE_EXPR, type); })
5175 /* Fold comparisons against infinity. */
5176 (if (REAL_VALUE_ISINF (TREE_REAL_CST (@1))
5177 && MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (@1))))
5180 REAL_VALUE_TYPE max;
5181 enum tree_code code = cmp;
5182 bool neg = REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1));
5184 code = swap_tree_comparison (code);
5187 /* x > +Inf is always false, if we ignore NaNs or exceptions. */
5188 (if (code == GT_EXPR
5189 && !(HONOR_NANS (@0) && flag_trapping_math))
5190 { constant_boolean_node (false, type); })
5191 (if (code == LE_EXPR)
5192 /* x <= +Inf is always true, if we don't care about NaNs. */
5193 (if (! HONOR_NANS (@0))
5194 { constant_boolean_node (true, type); }
5195 /* x <= +Inf is the same as x == x, i.e. !isnan(x), but this loses
5196 an "invalid" exception. */
5197 (if (!flag_trapping_math)
5199 /* x == +Inf and x >= +Inf are always equal to x > DBL_MAX, but
5200 for == this introduces an exception for x a NaN. */
5201 (if ((code == EQ_EXPR && !(HONOR_NANS (@0) && flag_trapping_math))
5203 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
5205 (lt @0 { build_real (TREE_TYPE (@0), max); })
5206 (gt @0 { build_real (TREE_TYPE (@0), max); }))))
5207 /* x < +Inf is always equal to x <= DBL_MAX. */
5208 (if (code == LT_EXPR)
5209 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
5211 (ge @0 { build_real (TREE_TYPE (@0), max); })
5212 (le @0 { build_real (TREE_TYPE (@0), max); }))))
5213 /* x != +Inf is always equal to !(x > DBL_MAX), but this introduces
5214 an exception for x a NaN so use an unordered comparison. */
5215 (if (code == NE_EXPR)
5216 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
5217 (if (! HONOR_NANS (@0))
5219 (ge @0 { build_real (TREE_TYPE (@0), max); })
5220 (le @0 { build_real (TREE_TYPE (@0), max); }))
5222 (unge @0 { build_real (TREE_TYPE (@0), max); })
5223 (unle @0 { build_real (TREE_TYPE (@0), max); }))))))))))
5225 /* If this is a comparison of a real constant with a PLUS_EXPR
5226 or a MINUS_EXPR of a real constant, we can convert it into a
5227 comparison with a revised real constant as long as no overflow
5228 occurs when unsafe_math_optimizations are enabled. */
5229 (if (flag_unsafe_math_optimizations)
5230 (for op (plus minus)
5232 (cmp (op @0 REAL_CST@1) REAL_CST@2)
5235 tree tem = const_binop (op == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR,
5236 TREE_TYPE (@1), @2, @1);
5238 (if (tem && !TREE_OVERFLOW (tem))
5239 (cmp @0 { tem; }))))))
5241 /* Likewise, we can simplify a comparison of a real constant with
5242 a MINUS_EXPR whose first operand is also a real constant, i.e.
5243 (c1 - x) < c2 becomes x > c1-c2. Reordering is allowed on
5244 floating-point types only if -fassociative-math is set. */
5245 (if (flag_associative_math)
5247 (cmp (minus REAL_CST@0 @1) REAL_CST@2)
5248 (with { tree tem = const_binop (MINUS_EXPR, TREE_TYPE (@1), @0, @2); }
5249 (if (tem && !TREE_OVERFLOW (tem))
5250 (cmp { tem; } @1)))))
5252 /* Fold comparisons against built-in math functions. */
5253 (if (flag_unsafe_math_optimizations && ! flag_errno_math)
5256 (cmp (sq @0) REAL_CST@1)
5258 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
5260 /* sqrt(x) < y is always false, if y is negative. */
5261 (if (cmp == EQ_EXPR || cmp == LT_EXPR || cmp == LE_EXPR)
5262 { constant_boolean_node (false, type); })
5263 /* sqrt(x) > y is always true, if y is negative and we
5264 don't care about NaNs, i.e. negative values of x. */
5265 (if (cmp == NE_EXPR || !HONOR_NANS (@0))
5266 { constant_boolean_node (true, type); })
5267 /* sqrt(x) > y is the same as x >= 0, if y is negative. */
5268 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })))
5269 (if (real_equal (TREE_REAL_CST_PTR (@1), &dconst0))
5271 /* sqrt(x) < 0 is always false. */
5272 (if (cmp == LT_EXPR)
5273 { constant_boolean_node (false, type); })
5274 /* sqrt(x) >= 0 is always true if we don't care about NaNs. */
5275 (if (cmp == GE_EXPR && !HONOR_NANS (@0))
5276 { constant_boolean_node (true, type); })
5277 /* sqrt(x) <= 0 -> x == 0. */
5278 (if (cmp == LE_EXPR)
5280 /* Otherwise sqrt(x) cmp 0 -> x cmp 0. Here cmp can be >=, >,
5281 == or !=. In the last case:
5283 (sqrt(x) != 0) == (NaN != 0) == true == (x != 0)
5285 if x is negative or NaN. Due to -funsafe-math-optimizations,
5286 the results for other x follow from natural arithmetic. */
5288 (if ((cmp == LT_EXPR
5292 && !REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
5293 /* Give up for -frounding-math. */
5294 && !HONOR_SIGN_DEPENDENT_ROUNDING (TREE_TYPE (@0)))
5298 enum tree_code ncmp = cmp;
5299 const real_format *fmt
5300 = REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (@0)));
5301 real_arithmetic (&c2, MULT_EXPR,
5302 &TREE_REAL_CST (@1), &TREE_REAL_CST (@1));
5303 real_convert (&c2, fmt, &c2);
5304 /* See PR91734: if c2 is inexact and sqrt(c2) < c (or sqrt(c2) >= c),
5305 then change LT_EXPR into LE_EXPR or GE_EXPR into GT_EXPR. */
5306 if (!REAL_VALUE_ISINF (c2))
5308 tree c3 = fold_const_call (CFN_SQRT, TREE_TYPE (@0),
5309 build_real (TREE_TYPE (@0), c2));
5310 if (c3 == NULL_TREE || TREE_CODE (c3) != REAL_CST)
5312 else if ((cmp == LT_EXPR || cmp == GE_EXPR)
5313 && real_less (&TREE_REAL_CST (c3), &TREE_REAL_CST (@1)))
5314 ncmp = cmp == LT_EXPR ? LE_EXPR : GT_EXPR;
5315 else if ((cmp == LE_EXPR || cmp == GT_EXPR)
5316 && real_less (&TREE_REAL_CST (@1), &TREE_REAL_CST (c3)))
5317 ncmp = cmp == LE_EXPR ? LT_EXPR : GE_EXPR;
5320 /* With rounding to even, sqrt of up to 3 different values
5321 gives the same normal result, so in some cases c2 needs
5323 REAL_VALUE_TYPE c2alt, tow;
5324 if (cmp == LT_EXPR || cmp == GE_EXPR)
5328 real_nextafter (&c2alt, fmt, &c2, &tow);
5329 real_convert (&c2alt, fmt, &c2alt);
5330 if (REAL_VALUE_ISINF (c2alt))
5334 c3 = fold_const_call (CFN_SQRT, TREE_TYPE (@0),
5335 build_real (TREE_TYPE (@0), c2alt));
5336 if (c3 == NULL_TREE || TREE_CODE (c3) != REAL_CST)
5338 else if (real_equal (&TREE_REAL_CST (c3),
5339 &TREE_REAL_CST (@1)))
5345 (if (cmp == GT_EXPR || cmp == GE_EXPR)
5346 (if (REAL_VALUE_ISINF (c2))
5347 /* sqrt(x) > y is x == +Inf, when y is very large. */
5348 (if (HONOR_INFINITIES (@0))
5349 (eq @0 { build_real (TREE_TYPE (@0), c2); })
5350 { constant_boolean_node (false, type); })
5351 /* sqrt(x) > c is the same as x > c*c. */
5352 (if (ncmp != ERROR_MARK)
5353 (if (ncmp == GE_EXPR)
5354 (ge @0 { build_real (TREE_TYPE (@0), c2); })
5355 (gt @0 { build_real (TREE_TYPE (@0), c2); }))))
5356 /* else if (cmp == LT_EXPR || cmp == LE_EXPR) */
5357 (if (REAL_VALUE_ISINF (c2))
5359 /* sqrt(x) < y is always true, when y is a very large
5360 value and we don't care about NaNs or Infinities. */
5361 (if (! HONOR_NANS (@0) && ! HONOR_INFINITIES (@0))
5362 { constant_boolean_node (true, type); })
5363 /* sqrt(x) < y is x != +Inf when y is very large and we
5364 don't care about NaNs. */
5365 (if (! HONOR_NANS (@0))
5366 (ne @0 { build_real (TREE_TYPE (@0), c2); }))
5367 /* sqrt(x) < y is x >= 0 when y is very large and we
5368 don't care about Infinities. */
5369 (if (! HONOR_INFINITIES (@0))
5370 (ge @0 { build_real (TREE_TYPE (@0), dconst0); }))
5371 /* sqrt(x) < y is x >= 0 && x != +Inf, when y is large. */
5374 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })
5375 (ne @0 { build_real (TREE_TYPE (@0), c2); }))))
5376 /* sqrt(x) < c is the same as x < c*c, if we ignore NaNs. */
5377 (if (ncmp != ERROR_MARK && ! HONOR_NANS (@0))
5378 (if (ncmp == LT_EXPR)
5379 (lt @0 { build_real (TREE_TYPE (@0), c2); })
5380 (le @0 { build_real (TREE_TYPE (@0), c2); }))
5381 /* sqrt(x) < c is the same as x >= 0 && x < c*c. */
5382 (if (ncmp != ERROR_MARK && GENERIC)
5383 (if (ncmp == LT_EXPR)
5385 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })
5386 (lt @0 { build_real (TREE_TYPE (@0), c2); }))
5388 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })
5389 (le @0 { build_real (TREE_TYPE (@0), c2); })))))))))))
5390 /* Transform sqrt(x) cmp sqrt(y) -> x cmp y. */
5392 (cmp (sq @0) (sq @1))
5393 (if (! HONOR_NANS (@0))
5396 /* Optimize various special cases of (FTYPE) N CMP (FTYPE) M. */
5397 (for cmp (lt le eq ne ge gt unordered ordered unlt unle ungt unge uneq ltgt)
5398 icmp (lt le eq ne ge gt unordered ordered lt le gt ge eq ne)
5400 (cmp (float@0 @1) (float @2))
5401 (if (SCALAR_FLOAT_TYPE_P (TREE_TYPE (@0))
5402 && ! DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0)))
5405 format_helper fmt (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (@0))));
5406 tree type1 = TREE_TYPE (@1);
5407 bool type1_signed_p = TYPE_SIGN (type1) == SIGNED;
5408 tree type2 = TREE_TYPE (@2);
5409 bool type2_signed_p = TYPE_SIGN (type2) == SIGNED;
5411 (if (fmt.can_represent_integral_type_p (type1)
5412 && fmt.can_represent_integral_type_p (type2))
5413 (if (cmp == ORDERED_EXPR || cmp == UNORDERED_EXPR)
5414 { constant_boolean_node (cmp == ORDERED_EXPR, type); }
5415 (if (TYPE_PRECISION (type1) > TYPE_PRECISION (type2)
5416 && type1_signed_p >= type2_signed_p)
5417 (icmp @1 (convert @2))
5418 (if (TYPE_PRECISION (type1) < TYPE_PRECISION (type2)
5419 && type1_signed_p <= type2_signed_p)
5420 (icmp (convert:type2 @1) @2)
5421 (if (TYPE_PRECISION (type1) == TYPE_PRECISION (type2)
5422 && type1_signed_p == type2_signed_p)
5423 (icmp @1 @2))))))))))
5425 /* Optimize various special cases of (FTYPE) N CMP CST. */
5426 (for cmp (lt le eq ne ge gt)
5427 icmp (le le eq ne ge ge)
5429 (cmp (float @0) REAL_CST@1)
5430 (if (SCALAR_FLOAT_TYPE_P (TREE_TYPE (@1))
5431 && ! DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@1)))
5434 tree itype = TREE_TYPE (@0);
5435 format_helper fmt (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (@1))));
5436 const REAL_VALUE_TYPE *cst = TREE_REAL_CST_PTR (@1);
5437 /* Be careful to preserve any potential exceptions due to
5438 NaNs. qNaNs are ok in == or != context.
5439 TODO: relax under -fno-trapping-math or
5440 -fno-signaling-nans. */
5442 = real_isnan (cst) && (cst->signalling
5443 || (cmp != EQ_EXPR && cmp != NE_EXPR));
5445 /* TODO: allow non-fitting itype and SNaNs when
5446 -fno-trapping-math. */
5447 (if (fmt.can_represent_integral_type_p (itype) && ! exception_p)
5450 signop isign = TYPE_SIGN (itype);
5451 REAL_VALUE_TYPE imin, imax;
5452 real_from_integer (&imin, fmt, wi::min_value (itype), isign);
5453 real_from_integer (&imax, fmt, wi::max_value (itype), isign);
5455 REAL_VALUE_TYPE icst;
5456 if (cmp == GT_EXPR || cmp == GE_EXPR)
5457 real_ceil (&icst, fmt, cst);
5458 else if (cmp == LT_EXPR || cmp == LE_EXPR)
5459 real_floor (&icst, fmt, cst);
5461 real_trunc (&icst, fmt, cst);
5463 bool cst_int_p = !real_isnan (cst) && real_identical (&icst, cst);
5465 bool overflow_p = false;
5467 = real_to_integer (&icst, &overflow_p, TYPE_PRECISION (itype));
5470 /* Optimize cases when CST is outside of ITYPE's range. */
5471 (if (real_compare (LT_EXPR, cst, &imin))
5472 { constant_boolean_node (cmp == GT_EXPR || cmp == GE_EXPR || cmp == NE_EXPR,
5474 (if (real_compare (GT_EXPR, cst, &imax))
5475 { constant_boolean_node (cmp == LT_EXPR || cmp == LE_EXPR || cmp == NE_EXPR,
5477 /* Remove cast if CST is an integer representable by ITYPE. */
5479 (cmp @0 { gcc_assert (!overflow_p);
5480 wide_int_to_tree (itype, icst_val); })
5482 /* When CST is fractional, optimize
5483 (FTYPE) N == CST -> 0
5484 (FTYPE) N != CST -> 1. */
5485 (if (cmp == EQ_EXPR || cmp == NE_EXPR)
5486 { constant_boolean_node (cmp == NE_EXPR, type); })
5487 /* Otherwise replace with sensible integer constant. */
5490 gcc_checking_assert (!overflow_p);
5492 (icmp @0 { wide_int_to_tree (itype, icst_val); })))))))))
5494 /* Fold A /[ex] B CMP C to A CMP B * C. */
5497 (cmp (exact_div @0 @1) INTEGER_CST@2)
5498 (if (!integer_zerop (@1))
5499 (if (wi::to_wide (@2) == 0)
5501 (if (TREE_CODE (@1) == INTEGER_CST)
5504 wi::overflow_type ovf;
5505 wide_int prod = wi::mul (wi::to_wide (@2), wi::to_wide (@1),
5506 TYPE_SIGN (TREE_TYPE (@1)), &ovf);
5509 { constant_boolean_node (cmp == NE_EXPR, type); }
5510 (cmp @0 { wide_int_to_tree (TREE_TYPE (@0), prod); }))))))))
5511 (for cmp (lt le gt ge)
5513 (cmp (exact_div @0 INTEGER_CST@1) INTEGER_CST@2)
5514 (if (wi::gt_p (wi::to_wide (@1), 0, TYPE_SIGN (TREE_TYPE (@1))))
5517 wi::overflow_type ovf;
5518 wide_int prod = wi::mul (wi::to_wide (@2), wi::to_wide (@1),
5519 TYPE_SIGN (TREE_TYPE (@1)), &ovf);
5522 { constant_boolean_node (wi::lt_p (wi::to_wide (@2), 0,
5523 TYPE_SIGN (TREE_TYPE (@2)))
5524 != (cmp == LT_EXPR || cmp == LE_EXPR), type); }
5525 (cmp @0 { wide_int_to_tree (TREE_TYPE (@0), prod); }))))))
5527 /* Fold (size_t)(A /[ex] B) CMP C to (size_t)A CMP (size_t)B * C or A CMP' 0.
5529 For small C (less than max/B), this is (size_t)A CMP (size_t)B * C.
5530 For large C (more than min/B+2^size), this is also true, with the
5531 multiplication computed modulo 2^size.
5532 For intermediate C, this just tests the sign of A. */
5533 (for cmp (lt le gt ge)
5536 (cmp (convert (exact_div @0 INTEGER_CST@1)) INTEGER_CST@2)
5537 (if (tree_nop_conversion_p (TREE_TYPE (@0), TREE_TYPE (@2))
5538 && TYPE_UNSIGNED (TREE_TYPE (@2)) && !TYPE_UNSIGNED (TREE_TYPE (@0))
5539 && wi::gt_p (wi::to_wide (@1), 0, TYPE_SIGN (TREE_TYPE (@1))))
5542 tree utype = TREE_TYPE (@2);
5543 wide_int denom = wi::to_wide (@1);
5544 wide_int right = wi::to_wide (@2);
5545 wide_int smax = wi::sdiv_trunc (wi::max_value (TREE_TYPE (@0)), denom);
5546 wide_int smin = wi::sdiv_trunc (wi::min_value (TREE_TYPE (@0)), denom);
5547 bool small = wi::leu_p (right, smax);
5548 bool large = wi::geu_p (right, smin);
5550 (if (small || large)
5551 (cmp (convert:utype @0) (mult @2 (convert @1)))
5552 (cmp2 @0 { build_zero_cst (TREE_TYPE (@0)); }))))))
5554 /* Unordered tests if either argument is a NaN. */
5556 (bit_ior (unordered @0 @0) (unordered @1 @1))
5557 (if (types_match (@0, @1))
5560 (bit_and (ordered @0 @0) (ordered @1 @1))
5561 (if (types_match (@0, @1))
5564 (bit_ior:c (unordered @0 @0) (unordered:c@2 @0 @1))
5567 (bit_and:c (ordered @0 @0) (ordered:c@2 @0 @1))
5570 /* Simple range test simplifications. */
5571 /* A < B || A >= B -> true. */
5572 (for test1 (lt le le le ne ge)
5573 test2 (ge gt ge ne eq ne)
5575 (bit_ior:c (test1 @0 @1) (test2 @0 @1))
5576 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5577 || VECTOR_INTEGER_TYPE_P (TREE_TYPE (@0)))
5578 { constant_boolean_node (true, type); })))
5579 /* A < B && A >= B -> false. */
5580 (for test1 (lt lt lt le ne eq)
5581 test2 (ge gt eq gt eq gt)
5583 (bit_and:c (test1 @0 @1) (test2 @0 @1))
5584 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5585 || VECTOR_INTEGER_TYPE_P (TREE_TYPE (@0)))
5586 { constant_boolean_node (false, type); })))
5588 /* A & (2**N - 1) <= 2**K - 1 -> A & (2**N - 2**K) == 0
5589 A & (2**N - 1) > 2**K - 1 -> A & (2**N - 2**K) != 0
5591 Note that comparisons
5592 A & (2**N - 1) < 2**K -> A & (2**N - 2**K) == 0
5593 A & (2**N - 1) >= 2**K -> A & (2**N - 2**K) != 0
5594 will be canonicalized to above so there's no need to
5601 (cmp (bit_and@0 @1 INTEGER_CST@2) INTEGER_CST@3)
5602 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)))
5605 tree ty = TREE_TYPE (@0);
5606 unsigned prec = TYPE_PRECISION (ty);
5607 wide_int mask = wi::to_wide (@2, prec);
5608 wide_int rhs = wi::to_wide (@3, prec);
5609 signop sgn = TYPE_SIGN (ty);
5611 (if ((mask & (mask + 1)) == 0 && wi::gt_p (rhs, 0, sgn)
5612 && (rhs & (rhs + 1)) == 0 && wi::ge_p (mask, rhs, sgn))
5613 (eqcmp (bit_and @1 { wide_int_to_tree (ty, mask - rhs); })
5614 { build_zero_cst (ty); }))))))
5616 /* -A CMP -B -> B CMP A. */
5617 (for cmp (tcc_comparison)
5618 scmp (swapped_tcc_comparison)
5620 (cmp (negate @0) (negate @1))
5621 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
5622 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
5623 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))))
5626 (cmp (negate @0) CONSTANT_CLASS_P@1)
5627 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
5628 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
5629 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))))
5630 (with { tree tem = const_unop (NEGATE_EXPR, TREE_TYPE (@0), @1); }
5631 (if (tem && !TREE_OVERFLOW (tem))
5632 (scmp @0 { tem; }))))))
5634 /* Convert ABS_EXPR<x> == 0 or ABS_EXPR<x> != 0 to x == 0 or x != 0. */
5637 (op (abs @0) zerop@1)
5640 /* From fold_sign_changed_comparison and fold_widened_comparison.
5641 FIXME: the lack of symmetry is disturbing. */
5642 (for cmp (simple_comparison)
5644 (cmp (convert@0 @00) (convert?@1 @10))
5645 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5646 /* Disable this optimization if we're casting a function pointer
5647 type on targets that require function pointer canonicalization. */
5648 && !(targetm.have_canonicalize_funcptr_for_compare ()
5649 && ((POINTER_TYPE_P (TREE_TYPE (@00))
5650 && FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@00))))
5651 || (POINTER_TYPE_P (TREE_TYPE (@10))
5652 && FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@10))))))
5654 (if (TYPE_PRECISION (TREE_TYPE (@00)) == TYPE_PRECISION (TREE_TYPE (@0))
5655 && (TREE_CODE (@10) == INTEGER_CST
5657 && (TYPE_UNSIGNED (TREE_TYPE (@00)) == TYPE_UNSIGNED (TREE_TYPE (@0))
5660 && !POINTER_TYPE_P (TREE_TYPE (@00))
5661 /* (int)bool:32 != (int)uint is not the same as
5662 bool:32 != (bool:32)uint since boolean types only have two valid
5663 values independent of their precision. */
5664 && (TREE_CODE (TREE_TYPE (@00)) != BOOLEAN_TYPE
5665 || TREE_CODE (TREE_TYPE (@10)) == BOOLEAN_TYPE))
5666 /* ??? The special-casing of INTEGER_CST conversion was in the original
5667 code and here to avoid a spurious overflow flag on the resulting
5668 constant which fold_convert produces. */
5669 (if (TREE_CODE (@1) == INTEGER_CST)
5670 (cmp @00 { force_fit_type (TREE_TYPE (@00), wi::to_widest (@1), 0,
5671 TREE_OVERFLOW (@1)); })
5672 (cmp @00 (convert @1)))
5674 (if (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (TREE_TYPE (@00)))
5675 /* If possible, express the comparison in the shorter mode. */
5676 (if ((cmp == EQ_EXPR || cmp == NE_EXPR
5677 || TYPE_UNSIGNED (TREE_TYPE (@0)) == TYPE_UNSIGNED (TREE_TYPE (@00))
5678 || (!TYPE_UNSIGNED (TREE_TYPE (@0))
5679 && TYPE_UNSIGNED (TREE_TYPE (@00))))
5680 && (types_match (TREE_TYPE (@10), TREE_TYPE (@00))
5681 || ((TYPE_PRECISION (TREE_TYPE (@00))
5682 >= TYPE_PRECISION (TREE_TYPE (@10)))
5683 && (TYPE_UNSIGNED (TREE_TYPE (@00))
5684 == TYPE_UNSIGNED (TREE_TYPE (@10))))
5685 || (TREE_CODE (@10) == INTEGER_CST
5686 && INTEGRAL_TYPE_P (TREE_TYPE (@00))
5687 && int_fits_type_p (@10, TREE_TYPE (@00)))))
5688 (cmp @00 (convert @10))
5689 (if (TREE_CODE (@10) == INTEGER_CST
5690 && INTEGRAL_TYPE_P (TREE_TYPE (@00))
5691 && !int_fits_type_p (@10, TREE_TYPE (@00)))
5694 tree min = lower_bound_in_type (TREE_TYPE (@10), TREE_TYPE (@00));
5695 tree max = upper_bound_in_type (TREE_TYPE (@10), TREE_TYPE (@00));
5696 bool above = integer_nonzerop (const_binop (LT_EXPR, type, max, @10));
5697 bool below = integer_nonzerop (const_binop (LT_EXPR, type, @10, min));
5699 (if (above || below)
5700 (if (cmp == EQ_EXPR || cmp == NE_EXPR)
5701 { constant_boolean_node (cmp == EQ_EXPR ? false : true, type); }
5702 (if (cmp == LT_EXPR || cmp == LE_EXPR)
5703 { constant_boolean_node (above ? true : false, type); }
5704 (if (cmp == GT_EXPR || cmp == GE_EXPR)
5705 { constant_boolean_node (above ? false : true, type); })))))))))
5706 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
5707 (if (FLOAT_TYPE_P (TREE_TYPE (@00))
5708 && (DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0))
5709 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@00)))
5710 && (DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0))
5711 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@10))))
5714 tree type1 = TREE_TYPE (@10);
5715 if (TREE_CODE (@10) == REAL_CST && !DECIMAL_FLOAT_TYPE_P (type1))
5717 REAL_VALUE_TYPE orig = TREE_REAL_CST (@10);
5718 if (TYPE_PRECISION (type1) > TYPE_PRECISION (float_type_node)
5719 && exact_real_truncate (TYPE_MODE (float_type_node), &orig))
5720 type1 = float_type_node;
5721 if (TYPE_PRECISION (type1) > TYPE_PRECISION (double_type_node)
5722 && exact_real_truncate (TYPE_MODE (double_type_node), &orig))
5723 type1 = double_type_node;
5726 = (TYPE_PRECISION (TREE_TYPE (@00)) > TYPE_PRECISION (type1)
5727 ? TREE_TYPE (@00) : type1);
5729 (if (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (newtype))
5730 (cmp (convert:newtype @00) (convert:newtype @10))))))))
5735 /* SSA names are canonicalized to 2nd place. */
5736 (cmp addr@0 SSA_NAME@1)
5738 { poly_int64 off; tree base; }
5739 /* A local variable can never be pointed to by
5740 the default SSA name of an incoming parameter. */
5741 (if (SSA_NAME_IS_DEFAULT_DEF (@1)
5742 && TREE_CODE (SSA_NAME_VAR (@1)) == PARM_DECL
5743 && (base = get_base_address (TREE_OPERAND (@0, 0)))
5744 && TREE_CODE (base) == VAR_DECL
5745 && auto_var_in_fn_p (base, current_function_decl))
5746 (if (cmp == NE_EXPR)
5747 { constant_boolean_node (true, type); }
5748 { constant_boolean_node (false, type); })
5749 /* If the address is based on @1 decide using the offset. */
5750 (if ((base = get_addr_base_and_unit_offset (TREE_OPERAND (@0, 0), &off))
5751 && TREE_CODE (base) == MEM_REF
5752 && TREE_OPERAND (base, 0) == @1)
5753 (with { off += mem_ref_offset (base).force_shwi (); }
5754 (if (known_ne (off, 0))
5755 { constant_boolean_node (cmp == NE_EXPR, type); }
5756 (if (known_eq (off, 0))
5757 { constant_boolean_node (cmp == EQ_EXPR, type); }))))))))
5759 /* Equality compare simplifications from fold_binary */
5762 /* If we have (A | C) == D where C & ~D != 0, convert this into 0.
5763 Similarly for NE_EXPR. */
5765 (cmp (convert?@3 (bit_ior @0 INTEGER_CST@1)) INTEGER_CST@2)
5766 (if (tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0))
5767 && wi::bit_and_not (wi::to_wide (@1), wi::to_wide (@2)) != 0)
5768 { constant_boolean_node (cmp == NE_EXPR, type); }))
5770 /* (X ^ Y) == 0 becomes X == Y, and (X ^ Y) != 0 becomes X != Y. */
5772 (cmp (bit_xor @0 @1) integer_zerop)
5775 /* (X ^ Y) == Y becomes X == 0.
5776 Likewise (X ^ Y) == X becomes Y == 0. */
5778 (cmp:c (bit_xor:c @0 @1) @0)
5779 (cmp @1 { build_zero_cst (TREE_TYPE (@1)); }))
5781 /* (X & Y) == X becomes (X & ~Y) == 0. */
5783 (cmp:c (bit_and:c @0 @1) @0)
5784 (cmp (bit_and @0 (bit_not! @1)) { build_zero_cst (TREE_TYPE (@0)); }))
5786 (cmp:c (convert@3 (bit_and (convert@2 @0) INTEGER_CST@1)) (convert @0))
5787 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5788 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
5789 && INTEGRAL_TYPE_P (TREE_TYPE (@3))
5790 && TYPE_PRECISION (TREE_TYPE (@2)) == TYPE_PRECISION (TREE_TYPE (@0))
5791 && TYPE_PRECISION (TREE_TYPE (@3)) > TYPE_PRECISION (TREE_TYPE (@2))
5792 && !wi::neg_p (wi::to_wide (@1)))
5793 (cmp (bit_and @0 (convert (bit_not @1)))
5794 { build_zero_cst (TREE_TYPE (@0)); })))
5796 /* (X | Y) == Y becomes (X & ~Y) == 0. */
5798 (cmp:c (bit_ior:c @0 @1) @1)
5799 (cmp (bit_and @0 (bit_not! @1)) { build_zero_cst (TREE_TYPE (@0)); }))
5801 /* (X ^ C1) op C2 can be rewritten as X op (C1 ^ C2). */
5803 (cmp (convert?@3 (bit_xor @0 INTEGER_CST@1)) INTEGER_CST@2)
5804 (if (tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0)))
5805 (cmp @0 (bit_xor @1 (convert @2)))))
5808 (cmp (convert? addr@0) integer_zerop)
5809 (if (tree_single_nonzero_warnv_p (@0, NULL))
5810 { constant_boolean_node (cmp == NE_EXPR, type); }))
5812 /* (X & C) op (Y & C) into (X ^ Y) & C op 0. */
5814 (cmp (bit_and:cs @0 @2) (bit_and:cs @1 @2))
5815 (cmp (bit_and (bit_xor @0 @1) @2) { build_zero_cst (TREE_TYPE (@2)); })))
5817 /* (X < 0) != (Y < 0) into (X ^ Y) < 0.
5818 (X >= 0) != (Y >= 0) into (X ^ Y) < 0.
5819 (X < 0) == (Y < 0) into (X ^ Y) >= 0.
5820 (X >= 0) == (Y >= 0) into (X ^ Y) >= 0. */
5825 (cmp (sgncmp @0 integer_zerop@2) (sgncmp @1 integer_zerop))
5826 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
5827 && !TYPE_UNSIGNED (TREE_TYPE (@0))
5828 && types_match (@0, @1))
5829 (ncmp (bit_xor @0 @1) @2)))))
5830 /* (X < 0) == (Y >= 0) into (X ^ Y) < 0.
5831 (X < 0) != (Y >= 0) into (X ^ Y) >= 0. */
5835 (cmp:c (lt @0 integer_zerop@2) (ge @1 integer_zerop))
5836 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
5837 && !TYPE_UNSIGNED (TREE_TYPE (@0))
5838 && types_match (@0, @1))
5839 (ncmp (bit_xor @0 @1) @2))))
5841 /* If we have (A & C) == C where C is a power of 2, convert this into
5842 (A & C) != 0. Similarly for NE_EXPR. */
5846 (cmp (bit_and@2 @0 integer_pow2p@1) @1)
5847 (icmp @2 { build_zero_cst (TREE_TYPE (@0)); })))
5850 /* From fold_binary_op_with_conditional_arg handle the case of
5851 rewriting (a ? b : c) > d to a ? (b > d) : (c > d) when the
5852 compares simplify. */
5853 (for cmp (simple_comparison)
5855 (cmp:c (cond @0 @1 @2) @3)
5856 /* Do not move possibly trapping operations into the conditional as this
5857 pessimizes code and causes gimplification issues when applied late. */
5858 (if (!FLOAT_TYPE_P (TREE_TYPE (@3))
5859 || !operation_could_trap_p (cmp, true, false, @3))
5860 (cond @0 (cmp! @1 @3) (cmp! @2 @3)))))
5864 /* x < 0 ? ~y : y into (x >> (prec-1)) ^ y. */
5865 /* x >= 0 ? ~y : y into ~((x >> (prec-1)) ^ y). */
5867 (cond (cmp @0 integer_zerop) (bit_not @1) @1)
5868 (if (INTEGRAL_TYPE_P (type)
5869 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
5870 && !TYPE_UNSIGNED (TREE_TYPE (@0))
5871 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (type))
5874 tree shifter = build_int_cst (integer_type_node, TYPE_PRECISION (type) - 1);
5876 (if (cmp == LT_EXPR)
5877 (bit_xor (convert (rshift @0 {shifter;})) @1)
5878 (bit_not (bit_xor (convert (rshift @0 {shifter;})) @1))))))
5879 /* x < 0 ? y : ~y into ~((x >> (prec-1)) ^ y). */
5880 /* x >= 0 ? y : ~y into (x >> (prec-1)) ^ y. */
5882 (cond (cmp @0 integer_zerop) @1 (bit_not @1))
5883 (if (INTEGRAL_TYPE_P (type)
5884 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
5885 && !TYPE_UNSIGNED (TREE_TYPE (@0))
5886 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (type))
5889 tree shifter = build_int_cst (integer_type_node, TYPE_PRECISION (type) - 1);
5891 (if (cmp == GE_EXPR)
5892 (bit_xor (convert (rshift @0 {shifter;})) @1)
5893 (bit_not (bit_xor (convert (rshift @0 {shifter;})) @1)))))))
5895 /* If we have (A & C) != 0 ? D : 0 where C and D are powers of 2,
5896 convert this into a shift followed by ANDing with D. */
5899 (ne (bit_and @0 integer_pow2p@1) integer_zerop)
5900 INTEGER_CST@2 integer_zerop)
5901 (if (!POINTER_TYPE_P (type) && integer_pow2p (@2))
5903 int shift = (wi::exact_log2 (wi::to_wide (@2))
5904 - wi::exact_log2 (wi::to_wide (@1)));
5908 (lshift (convert @0) { build_int_cst (integer_type_node, shift); }) @2)
5910 (convert (rshift @0 { build_int_cst (integer_type_node, -shift); }))
5913 /* If we have (A & C) != 0 where C is the sign bit of A, convert
5914 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
5918 (cmp (bit_and (convert?@2 @0) integer_pow2p@1) integer_zerop)
5919 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5920 && type_has_mode_precision_p (TREE_TYPE (@0))
5921 && element_precision (@2) >= element_precision (@0)
5922 && wi::only_sign_bit_p (wi::to_wide (@1), element_precision (@0)))
5923 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
5924 (ncmp (convert:stype @0) { build_zero_cst (stype); })))))
5926 /* If we have A < 0 ? C : 0 where C is a power of 2, convert
5927 this into a right shift or sign extension followed by ANDing with C. */
5930 (lt @0 integer_zerop)
5931 INTEGER_CST@1 integer_zerop)
5932 (if (integer_pow2p (@1)
5933 && !TYPE_UNSIGNED (TREE_TYPE (@0)))
5935 int shift = element_precision (@0) - wi::exact_log2 (wi::to_wide (@1)) - 1;
5939 (convert (rshift @0 { build_int_cst (integer_type_node, shift); }))
5941 /* Otherwise ctype must be wider than TREE_TYPE (@0) and pure
5942 sign extension followed by AND with C will achieve the effect. */
5943 (bit_and (convert @0) @1)))))
5945 /* When the addresses are not directly of decls compare base and offset.
5946 This implements some remaining parts of fold_comparison address
5947 comparisons but still no complete part of it. Still it is good
5948 enough to make fold_stmt not regress when not dispatching to fold_binary. */
5949 (for cmp (simple_comparison)
5951 (cmp (convert1?@2 addr@0) (convert2? addr@1))
5954 poly_int64 off0, off1;
5956 int equal = address_compare (cmp, TREE_TYPE (@2), @0, @1, base0, base1,
5957 off0, off1, GENERIC);
5961 (if (cmp == EQ_EXPR && (known_eq (off0, off1) || known_ne (off0, off1)))
5962 { constant_boolean_node (known_eq (off0, off1), type); })
5963 (if (cmp == NE_EXPR && (known_eq (off0, off1) || known_ne (off0, off1)))
5964 { constant_boolean_node (known_ne (off0, off1), type); })
5965 (if (cmp == LT_EXPR && (known_lt (off0, off1) || known_ge (off0, off1)))
5966 { constant_boolean_node (known_lt (off0, off1), type); })
5967 (if (cmp == LE_EXPR && (known_le (off0, off1) || known_gt (off0, off1)))
5968 { constant_boolean_node (known_le (off0, off1), type); })
5969 (if (cmp == GE_EXPR && (known_ge (off0, off1) || known_lt (off0, off1)))
5970 { constant_boolean_node (known_ge (off0, off1), type); })
5971 (if (cmp == GT_EXPR && (known_gt (off0, off1) || known_le (off0, off1)))
5972 { constant_boolean_node (known_gt (off0, off1), type); }))
5975 (if (cmp == EQ_EXPR)
5976 { constant_boolean_node (false, type); })
5977 (if (cmp == NE_EXPR)
5978 { constant_boolean_node (true, type); })))))))
5980 /* Simplify pointer equality compares using PTA. */
5984 (if (POINTER_TYPE_P (TREE_TYPE (@0))
5985 && ptrs_compare_unequal (@0, @1))
5986 { constant_boolean_node (neeq != EQ_EXPR, type); })))
5988 /* PR70920: Transform (intptr_t)x eq/ne CST to x eq/ne (typeof x) CST.
5989 and (typeof ptr_cst) x eq/ne ptr_cst to x eq/ne (typeof x) CST.
5990 Disable the transform if either operand is pointer to function.
5991 This broke pr22051-2.c for arm where function pointer
5992 canonicalizaion is not wanted. */
5996 (cmp (convert @0) INTEGER_CST@1)
5997 (if (((POINTER_TYPE_P (TREE_TYPE (@0))
5998 && !FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@0)))
5999 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
6000 /* Don't perform this optimization in GENERIC if @0 has reference
6001 type when sanitizing. See PR101210. */
6003 && TREE_CODE (TREE_TYPE (@0)) == REFERENCE_TYPE
6004 && (flag_sanitize & (SANITIZE_NULL | SANITIZE_ALIGNMENT))))
6005 || (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6006 && POINTER_TYPE_P (TREE_TYPE (@1))
6007 && !FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@1)))))
6008 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1)))
6009 (cmp @0 (convert @1)))))
6011 /* Non-equality compare simplifications from fold_binary */
6012 (for cmp (lt gt le ge)
6013 /* Comparisons with the highest or lowest possible integer of
6014 the specified precision will have known values. */
6016 (cmp (convert?@2 @0) uniform_integer_cst_p@1)
6017 (if ((INTEGRAL_TYPE_P (TREE_TYPE (@1))
6018 || POINTER_TYPE_P (TREE_TYPE (@1))
6019 || VECTOR_INTEGER_TYPE_P (TREE_TYPE (@1)))
6020 && tree_nop_conversion_p (TREE_TYPE (@2), TREE_TYPE (@0)))
6023 tree cst = uniform_integer_cst_p (@1);
6024 tree arg1_type = TREE_TYPE (cst);
6025 unsigned int prec = TYPE_PRECISION (arg1_type);
6026 wide_int max = wi::max_value (arg1_type);
6027 wide_int signed_max = wi::max_value (prec, SIGNED);
6028 wide_int min = wi::min_value (arg1_type);
6031 (if (wi::to_wide (cst) == max)
6033 (if (cmp == GT_EXPR)
6034 { constant_boolean_node (false, type); })
6035 (if (cmp == GE_EXPR)
6037 (if (cmp == LE_EXPR)
6038 { constant_boolean_node (true, type); })
6039 (if (cmp == LT_EXPR)
6041 (if (wi::to_wide (cst) == min)
6043 (if (cmp == LT_EXPR)
6044 { constant_boolean_node (false, type); })
6045 (if (cmp == LE_EXPR)
6047 (if (cmp == GE_EXPR)
6048 { constant_boolean_node (true, type); })
6049 (if (cmp == GT_EXPR)
6051 (if (wi::to_wide (cst) == max - 1)
6053 (if (cmp == GT_EXPR)
6054 (eq @2 { build_uniform_cst (TREE_TYPE (@1),
6055 wide_int_to_tree (TREE_TYPE (cst),
6058 (if (cmp == LE_EXPR)
6059 (ne @2 { build_uniform_cst (TREE_TYPE (@1),
6060 wide_int_to_tree (TREE_TYPE (cst),
6063 (if (wi::to_wide (cst) == min + 1)
6065 (if (cmp == GE_EXPR)
6066 (ne @2 { build_uniform_cst (TREE_TYPE (@1),
6067 wide_int_to_tree (TREE_TYPE (cst),
6070 (if (cmp == LT_EXPR)
6071 (eq @2 { build_uniform_cst (TREE_TYPE (@1),
6072 wide_int_to_tree (TREE_TYPE (cst),
6075 (if (wi::to_wide (cst) == signed_max
6076 && TYPE_UNSIGNED (arg1_type)
6077 /* We will flip the signedness of the comparison operator
6078 associated with the mode of @1, so the sign bit is
6079 specified by this mode. Check that @1 is the signed
6080 max associated with this sign bit. */
6081 && prec == GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (arg1_type))
6082 /* signed_type does not work on pointer types. */
6083 && INTEGRAL_TYPE_P (arg1_type))
6084 /* The following case also applies to X < signed_max+1
6085 and X >= signed_max+1 because previous transformations. */
6086 (if (cmp == LE_EXPR || cmp == GT_EXPR)
6087 (with { tree st = signed_type_for (TREE_TYPE (@1)); }
6089 (if (cst == @1 && cmp == LE_EXPR)
6090 (ge (convert:st @0) { build_zero_cst (st); }))
6091 (if (cst == @1 && cmp == GT_EXPR)
6092 (lt (convert:st @0) { build_zero_cst (st); }))
6093 (if (cmp == LE_EXPR)
6094 (ge (view_convert:st @0) { build_zero_cst (st); }))
6095 (if (cmp == GT_EXPR)
6096 (lt (view_convert:st @0) { build_zero_cst (st); })))))))))))
6098 (for cmp (unordered ordered unlt unle ungt unge uneq ltgt)
6099 /* If the second operand is NaN, the result is constant. */
6102 (if (REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
6103 && (cmp != LTGT_EXPR || ! flag_trapping_math))
6104 { constant_boolean_node (cmp == ORDERED_EXPR || cmp == LTGT_EXPR
6105 ? false : true, type); })))
6107 /* Fold UNORDERED if either operand must be NaN, or neither can be. */
6111 (if (tree_expr_nan_p (@0) || tree_expr_nan_p (@1))
6112 { constant_boolean_node (true, type); })
6113 (if (!tree_expr_maybe_nan_p (@0) && !tree_expr_maybe_nan_p (@1))
6114 { constant_boolean_node (false, type); })))
6116 /* Fold ORDERED if either operand must be NaN, or neither can be. */
6120 (if (tree_expr_nan_p (@0) || tree_expr_nan_p (@1))
6121 { constant_boolean_node (false, type); })
6122 (if (!tree_expr_maybe_nan_p (@0) && !tree_expr_maybe_nan_p (@1))
6123 { constant_boolean_node (true, type); })))
6125 /* bool_var != 0 becomes bool_var. */
6127 (ne @0 integer_zerop)
6128 (if (TREE_CODE (TREE_TYPE (@0)) == BOOLEAN_TYPE
6129 && types_match (type, TREE_TYPE (@0)))
6131 /* bool_var == 1 becomes bool_var. */
6133 (eq @0 integer_onep)
6134 (if (TREE_CODE (TREE_TYPE (@0)) == BOOLEAN_TYPE
6135 && types_match (type, TREE_TYPE (@0)))
6138 bool_var == 0 becomes !bool_var or
6139 bool_var != 1 becomes !bool_var
6140 here because that only is good in assignment context as long
6141 as we require a tcc_comparison in GIMPLE_CONDs where we'd
6142 replace if (x == 0) with tem = ~x; if (tem != 0) which is
6143 clearly less optimal and which we'll transform again in forwprop. */
6145 /* Transform comparisons of the form (X & Y) CMP 0 to X CMP2 Z
6146 where ~Y + 1 == pow2 and Z = ~Y. */
6147 (for cst (VECTOR_CST INTEGER_CST)
6151 (cmp (bit_and:c@2 @0 cst@1) integer_zerop)
6152 (with { tree csts = bitmask_inv_cst_vector_p (@1); }
6153 (if (csts && (VECTOR_TYPE_P (TREE_TYPE (@1)) || single_use (@2)))
6154 (with { auto optab = VECTOR_TYPE_P (TREE_TYPE (@1))
6155 ? optab_vector : optab_default;
6156 tree utype = unsigned_type_for (TREE_TYPE (@1)); }
6157 (if (target_supports_op_p (utype, icmp, optab)
6158 || (optimize_vectors_before_lowering_p ()
6159 && (!target_supports_op_p (type, cmp, optab)
6160 || !target_supports_op_p (type, BIT_AND_EXPR, optab))))
6161 (if (TYPE_UNSIGNED (TREE_TYPE (@1)))
6163 (icmp (view_convert:utype @0) { csts; })))))))))
6165 /* When one argument is a constant, overflow detection can be simplified.
6166 Currently restricted to single use so as not to interfere too much with
6167 ADD_OVERFLOW detection in tree-ssa-math-opts.cc.
6168 CONVERT?(CONVERT?(A) + CST) CMP A -> A CMP' CST' */
6169 (for cmp (lt le ge gt)
6172 (cmp:c (convert?@3 (plus@2 (convert?@4 @0) INTEGER_CST@1)) @0)
6173 (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@2))
6174 && types_match (TREE_TYPE (@0), TREE_TYPE (@3))
6175 && tree_nop_conversion_p (TREE_TYPE (@4), TREE_TYPE (@0))
6176 && wi::to_wide (@1) != 0
6179 unsigned int prec = TYPE_PRECISION (TREE_TYPE (@0));
6180 signop sign = TYPE_SIGN (TREE_TYPE (@0));
6182 (out @0 { wide_int_to_tree (TREE_TYPE (@0),
6183 wi::max_value (prec, sign)
6184 - wi::to_wide (@1)); })))))
6186 /* To detect overflow in unsigned A - B, A < B is simpler than A - B > A.
6187 However, the detection logic for SUB_OVERFLOW in tree-ssa-math-opts.cc
6188 expects the long form, so we restrict the transformation for now. */
6191 (cmp:c (minus@2 @0 @1) @0)
6192 (if (single_use (@2)
6193 && ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
6194 && TYPE_UNSIGNED (TREE_TYPE (@0)))
6197 /* Optimize A - B + -1 >= A into B >= A for unsigned comparisons. */
6200 (cmp:c (plus (minus @0 @1) integer_minus_onep) @0)
6201 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
6202 && TYPE_UNSIGNED (TREE_TYPE (@0)))
6205 /* Testing for overflow is unnecessary if we already know the result. */
6210 (cmp:c (realpart (IFN_SUB_OVERFLOW@2 @0 @1)) @0)
6211 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
6212 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
6213 (out (imagpart @2) { build_zero_cst (TREE_TYPE (@0)); }))))
6218 (cmp:c (realpart (IFN_ADD_OVERFLOW:c@2 @0 @1)) @0)
6219 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
6220 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
6221 (out (imagpart @2) { build_zero_cst (TREE_TYPE (@0)); }))))
6223 /* For unsigned operands, -1 / B < A checks whether A * B would overflow.
6224 Simplify it to __builtin_mul_overflow (A, B, <unused>). */
6228 (cmp:c (trunc_div:s integer_all_onesp @1) @0)
6229 (if (TYPE_UNSIGNED (TREE_TYPE (@0)) && !VECTOR_TYPE_P (TREE_TYPE (@0)))
6230 (with { tree t = TREE_TYPE (@0), cpx = build_complex_type (t); }
6231 (out (imagpart (IFN_MUL_OVERFLOW:cpx @0 @1)) { build_zero_cst (t); })))))
6233 /* Similarly, for unsigned operands, (((type) A * B) >> prec) != 0 where type
6234 is at least twice as wide as type of A and B, simplify to
6235 __builtin_mul_overflow (A, B, <unused>). */
6238 (cmp (rshift (mult:s (convert@3 @0) (convert @1)) INTEGER_CST@2)
6240 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6241 && INTEGRAL_TYPE_P (TREE_TYPE (@3))
6242 && TYPE_UNSIGNED (TREE_TYPE (@0))
6243 && (TYPE_PRECISION (TREE_TYPE (@3))
6244 >= 2 * TYPE_PRECISION (TREE_TYPE (@0)))
6245 && tree_fits_uhwi_p (@2)
6246 && tree_to_uhwi (@2) == TYPE_PRECISION (TREE_TYPE (@0))
6247 && types_match (@0, @1)
6248 && type_has_mode_precision_p (TREE_TYPE (@0))
6249 && (optab_handler (umulv4_optab, TYPE_MODE (TREE_TYPE (@0)))
6250 != CODE_FOR_nothing))
6251 (with { tree t = TREE_TYPE (@0), cpx = build_complex_type (t); }
6252 (cmp (imagpart (IFN_MUL_OVERFLOW:cpx @0 @1)) { build_zero_cst (t); })))))
6254 /* Demote operands of IFN_{ADD,SUB,MUL}_OVERFLOW. */
6255 (for ovf (IFN_ADD_OVERFLOW IFN_SUB_OVERFLOW IFN_MUL_OVERFLOW)
6257 (ovf (convert@2 @0) @1)
6258 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6259 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
6260 && TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (TREE_TYPE (@0))
6261 && (!TYPE_UNSIGNED (TREE_TYPE (@2)) || TYPE_UNSIGNED (TREE_TYPE (@0))))
6264 (ovf @1 (convert@2 @0))
6265 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6266 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
6267 && TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (TREE_TYPE (@0))
6268 && (!TYPE_UNSIGNED (TREE_TYPE (@2)) || TYPE_UNSIGNED (TREE_TYPE (@0))))
6271 /* Optimize __builtin_mul_overflow_p (x, cst, (utype) 0) if all 3 types
6272 are unsigned to x > (umax / cst). Similarly for signed type, but
6273 in that case it needs to be outside of a range. */
6275 (imagpart (IFN_MUL_OVERFLOW:cs@2 @0 integer_nonzerop@1))
6276 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6277 && TYPE_MAX_VALUE (TREE_TYPE (@0))
6278 && types_match (TREE_TYPE (@0), TREE_TYPE (TREE_TYPE (@2)))
6279 && int_fits_type_p (@1, TREE_TYPE (@0)))
6280 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
6281 (convert (gt @0 (trunc_div! { TYPE_MAX_VALUE (TREE_TYPE (@0)); } @1)))
6282 (if (TYPE_MIN_VALUE (TREE_TYPE (@0)))
6283 (if (integer_minus_onep (@1))
6284 (convert (eq @0 { TYPE_MIN_VALUE (TREE_TYPE (@0)); }))
6287 tree div = fold_convert (TREE_TYPE (@0), @1);
6288 tree lo = int_const_binop (TRUNC_DIV_EXPR,
6289 TYPE_MIN_VALUE (TREE_TYPE (@0)), div);
6290 tree hi = int_const_binop (TRUNC_DIV_EXPR,
6291 TYPE_MAX_VALUE (TREE_TYPE (@0)), div);
6292 tree etype = range_check_type (TREE_TYPE (@0));
6295 if (wi::neg_p (wi::to_wide (div)))
6297 lo = fold_convert (etype, lo);
6298 hi = fold_convert (etype, hi);
6299 hi = int_const_binop (MINUS_EXPR, hi, lo);
6303 (convert (gt (minus (convert:etype @0) { lo; }) { hi; })))))))))
6305 /* Simplification of math builtins. These rules must all be optimizations
6306 as well as IL simplifications. If there is a possibility that the new
6307 form could be a pessimization, the rule should go in the canonicalization
6308 section that follows this one.
6310 Rules can generally go in this section if they satisfy one of
6313 - the rule describes an identity
6315 - the rule replaces calls with something as simple as addition or
6318 - the rule contains unary calls only and simplifies the surrounding
6319 arithmetic. (The idea here is to exclude non-unary calls in which
6320 one operand is constant and in which the call is known to be cheap
6321 when the operand has that value.) */
6323 (if (flag_unsafe_math_optimizations)
6324 /* Simplify sqrt(x) * sqrt(x) -> x. */
6326 (mult (SQRT_ALL@1 @0) @1)
6327 (if (!tree_expr_maybe_signaling_nan_p (@0))
6330 (for op (plus minus)
6331 /* Simplify (A / C) +- (B / C) -> (A +- B) / C. */
6335 (rdiv (op @0 @2) @1)))
6337 (for cmp (lt le gt ge)
6338 neg_cmp (gt ge lt le)
6339 /* Simplify (x * C1) cmp C2 -> x cmp (C2 / C1), where C1 != 0. */
6341 (cmp (mult @0 REAL_CST@1) REAL_CST@2)
6343 { tree tem = const_binop (RDIV_EXPR, type, @2, @1); }
6345 && !(REAL_VALUE_ISINF (TREE_REAL_CST (tem))
6346 || (real_zerop (tem) && !real_zerop (@1))))
6348 (if (real_less (&dconst0, TREE_REAL_CST_PTR (@1)))
6350 (if (real_less (TREE_REAL_CST_PTR (@1), &dconst0))
6351 (neg_cmp @0 { tem; })))))))
6353 /* Simplify sqrt(x) * sqrt(y) -> sqrt(x*y). */
6354 (for root (SQRT CBRT)
6356 (mult (root:s @0) (root:s @1))
6357 (root (mult @0 @1))))
6359 /* Simplify expN(x) * expN(y) -> expN(x+y). */
6360 (for exps (EXP EXP2 EXP10 POW10)
6362 (mult (exps:s @0) (exps:s @1))
6363 (exps (plus @0 @1))))
6365 /* Simplify a/root(b/c) into a*root(c/b). */
6366 (for root (SQRT CBRT)
6368 (rdiv @0 (root:s (rdiv:s @1 @2)))
6369 (mult @0 (root (rdiv @2 @1)))))
6371 /* Simplify x/expN(y) into x*expN(-y). */
6372 (for exps (EXP EXP2 EXP10 POW10)
6374 (rdiv @0 (exps:s @1))
6375 (mult @0 (exps (negate @1)))))
6377 (for logs (LOG LOG2 LOG10 LOG10)
6378 exps (EXP EXP2 EXP10 POW10)
6379 /* logN(expN(x)) -> x. */
6383 /* expN(logN(x)) -> x. */
6388 /* Optimize logN(func()) for various exponential functions. We
6389 want to determine the value "x" and the power "exponent" in
6390 order to transform logN(x**exponent) into exponent*logN(x). */
6391 (for logs (LOG LOG LOG LOG2 LOG2 LOG2 LOG10 LOG10)
6392 exps (EXP2 EXP10 POW10 EXP EXP10 POW10 EXP EXP2)
6395 (if (SCALAR_FLOAT_TYPE_P (type))
6401 /* Prepare to do logN(exp(exponent)) -> exponent*logN(e). */
6402 x = build_real_truncate (type, dconst_e ());
6405 /* Prepare to do logN(exp2(exponent)) -> exponent*logN(2). */
6406 x = build_real (type, dconst2);
6410 /* Prepare to do logN(exp10(exponent)) -> exponent*logN(10). */
6412 REAL_VALUE_TYPE dconst10;
6413 real_from_integer (&dconst10, VOIDmode, 10, SIGNED);
6414 x = build_real (type, dconst10);
6421 (mult (logs { x; }) @0)))))
6429 (if (SCALAR_FLOAT_TYPE_P (type))
6435 /* Prepare to do logN(sqrt(x)) -> 0.5*logN(x). */
6436 x = build_real (type, dconsthalf);
6439 /* Prepare to do logN(cbrt(x)) -> (1/3)*logN(x). */
6440 x = build_real_truncate (type, dconst_third ());
6446 (mult { x; } (logs @0))))))
6448 /* logN(pow(x,exponent)) -> exponent*logN(x). */
6449 (for logs (LOG LOG2 LOG10)
6453 (mult @1 (logs @0))))
6455 /* pow(C,x) -> exp(log(C)*x) if C > 0,
6456 or if C is a positive power of 2,
6457 pow(C,x) -> exp2(log2(C)*x). */
6465 (pows REAL_CST@0 @1)
6466 (if (real_compare (GT_EXPR, TREE_REAL_CST_PTR (@0), &dconst0)
6467 && real_isfinite (TREE_REAL_CST_PTR (@0))
6468 /* As libmvec doesn't have a vectorized exp2, defer optimizing
6469 the use_exp2 case until after vectorization. It seems actually
6470 beneficial for all constants to postpone this until later,
6471 because exp(log(C)*x), while faster, will have worse precision
6472 and if x folds into a constant too, that is unnecessary
6474 && canonicalize_math_after_vectorization_p ())
6476 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (@0);
6477 bool use_exp2 = false;
6478 if (targetm.libc_has_function (function_c99_misc, TREE_TYPE (@0))
6479 && value->cl == rvc_normal)
6481 REAL_VALUE_TYPE frac_rvt = *value;
6482 SET_REAL_EXP (&frac_rvt, 1);
6483 if (real_equal (&frac_rvt, &dconst1))
6488 (if (optimize_pow_to_exp (@0, @1))
6489 (exps (mult (logs @0) @1)))
6490 (exp2s (mult (log2s @0) @1)))))))
6493 /* pow(C,x)*expN(y) -> expN(logN(C)*x+y) if C > 0. */
6495 exps (EXP EXP2 EXP10 POW10)
6496 logs (LOG LOG2 LOG10 LOG10)
6498 (mult:c (pows:s REAL_CST@0 @1) (exps:s @2))
6499 (if (real_compare (GT_EXPR, TREE_REAL_CST_PTR (@0), &dconst0)
6500 && real_isfinite (TREE_REAL_CST_PTR (@0)))
6501 (exps (plus (mult (logs @0) @1) @2)))))
6506 exps (EXP EXP2 EXP10 POW10)
6507 /* sqrt(expN(x)) -> expN(x*0.5). */
6510 (exps (mult @0 { build_real (type, dconsthalf); })))
6511 /* cbrt(expN(x)) -> expN(x/3). */
6514 (exps (mult @0 { build_real_truncate (type, dconst_third ()); })))
6515 /* pow(expN(x), y) -> expN(x*y). */
6518 (exps (mult @0 @1))))
6520 /* tan(atan(x)) -> x. */
6527 /* Simplify sin(atan(x)) -> x / sqrt(x*x + 1). */
6531 copysigns (COPYSIGN)
6536 REAL_VALUE_TYPE r_cst;
6537 build_sinatan_real (&r_cst, type);
6538 tree t_cst = build_real (type, r_cst);
6539 tree t_one = build_one_cst (type);
6541 (if (SCALAR_FLOAT_TYPE_P (type))
6542 (cond (lt (abs @0) { t_cst; })
6543 (rdiv @0 (sqrts (plus (mult @0 @0) { t_one; })))
6544 (copysigns { t_one; } @0))))))
6546 /* Simplify cos(atan(x)) -> 1 / sqrt(x*x + 1). */
6550 copysigns (COPYSIGN)
6555 REAL_VALUE_TYPE r_cst;
6556 build_sinatan_real (&r_cst, type);
6557 tree t_cst = build_real (type, r_cst);
6558 tree t_one = build_one_cst (type);
6559 tree t_zero = build_zero_cst (type);
6561 (if (SCALAR_FLOAT_TYPE_P (type))
6562 (cond (lt (abs @0) { t_cst; })
6563 (rdiv { t_one; } (sqrts (plus (mult @0 @0) { t_one; })))
6564 (copysigns { t_zero; } @0))))))
6566 (if (!flag_errno_math)
6567 /* Simplify sinh(atanh(x)) -> x / sqrt((1 - x)*(1 + x)). */
6572 (sinhs (atanhs:s @0))
6573 (with { tree t_one = build_one_cst (type); }
6574 (rdiv @0 (sqrts (mult (minus { t_one; } @0) (plus { t_one; } @0)))))))
6576 /* Simplify cosh(atanh(x)) -> 1 / sqrt((1 - x)*(1 + x)) */
6581 (coshs (atanhs:s @0))
6582 (with { tree t_one = build_one_cst (type); }
6583 (rdiv { t_one; } (sqrts (mult (minus { t_one; } @0) (plus { t_one; } @0))))))))
6585 /* cabs(x+0i) or cabs(0+xi) -> abs(x). */
6587 (CABS (complex:C @0 real_zerop@1))
6590 /* trunc(trunc(x)) -> trunc(x), etc. */
6591 (for fns (TRUNC_ALL FLOOR_ALL CEIL_ALL ROUND_ALL NEARBYINT_ALL RINT_ALL)
6595 /* f(x) -> x if x is integer valued and f does nothing for such values. */
6596 (for fns (TRUNC_ALL FLOOR_ALL CEIL_ALL ROUND_ALL NEARBYINT_ALL RINT_ALL)
6598 (fns integer_valued_real_p@0)
6601 /* hypot(x,0) and hypot(0,x) -> abs(x). */
6603 (HYPOT:c @0 real_zerop@1)
6606 /* pow(1,x) -> 1. */
6608 (POW real_onep@0 @1)
6612 /* copysign(x,x) -> x. */
6613 (COPYSIGN_ALL @0 @0)
6617 /* copysign(x,-x) -> -x. */
6618 (COPYSIGN_ALL @0 (negate@1 @0))
6622 /* copysign(x,y) -> fabs(x) if y is nonnegative. */
6623 (COPYSIGN_ALL @0 tree_expr_nonnegative_p@1)
6626 (for scale (LDEXP SCALBN SCALBLN)
6627 /* ldexp(0, x) -> 0. */
6629 (scale real_zerop@0 @1)
6631 /* ldexp(x, 0) -> x. */
6633 (scale @0 integer_zerop@1)
6635 /* ldexp(x, y) -> x if x is +-Inf or NaN. */
6637 (scale REAL_CST@0 @1)
6638 (if (!real_isfinite (TREE_REAL_CST_PTR (@0)))
6641 /* Canonicalization of sequences of math builtins. These rules represent
6642 IL simplifications but are not necessarily optimizations.
6644 The sincos pass is responsible for picking "optimal" implementations
6645 of math builtins, which may be more complicated and can sometimes go
6646 the other way, e.g. converting pow into a sequence of sqrts.
6647 We only want to do these canonicalizations before the pass has run. */
6649 (if (flag_unsafe_math_optimizations && canonicalize_math_p ())
6650 /* Simplify tan(x) * cos(x) -> sin(x). */
6652 (mult:c (TAN:s @0) (COS:s @0))
6655 /* Simplify x * pow(x,c) -> pow(x,c+1). */
6657 (mult:c @0 (POW:s @0 REAL_CST@1))
6658 (if (!TREE_OVERFLOW (@1))
6659 (POW @0 (plus @1 { build_one_cst (type); }))))
6661 /* Simplify sin(x) / cos(x) -> tan(x). */
6663 (rdiv (SIN:s @0) (COS:s @0))
6666 /* Simplify sinh(x) / cosh(x) -> tanh(x). */
6668 (rdiv (SINH:s @0) (COSH:s @0))
6671 /* Simplify tanh (x) / sinh (x) -> 1.0 / cosh (x). */
6673 (rdiv (TANH:s @0) (SINH:s @0))
6674 (rdiv {build_one_cst (type);} (COSH @0)))
6676 /* Simplify cos(x) / sin(x) -> 1 / tan(x). */
6678 (rdiv (COS:s @0) (SIN:s @0))
6679 (rdiv { build_one_cst (type); } (TAN @0)))
6681 /* Simplify sin(x) / tan(x) -> cos(x). */
6683 (rdiv (SIN:s @0) (TAN:s @0))
6684 (if (! HONOR_NANS (@0)
6685 && ! HONOR_INFINITIES (@0))
6688 /* Simplify tan(x) / sin(x) -> 1.0 / cos(x). */
6690 (rdiv (TAN:s @0) (SIN:s @0))
6691 (if (! HONOR_NANS (@0)
6692 && ! HONOR_INFINITIES (@0))
6693 (rdiv { build_one_cst (type); } (COS @0))))
6695 /* Simplify pow(x,y) * pow(x,z) -> pow(x,y+z). */
6697 (mult (POW:s @0 @1) (POW:s @0 @2))
6698 (POW @0 (plus @1 @2)))
6700 /* Simplify pow(x,y) * pow(z,y) -> pow(x*z,y). */
6702 (mult (POW:s @0 @1) (POW:s @2 @1))
6703 (POW (mult @0 @2) @1))
6705 /* Simplify powi(x,y) * powi(z,y) -> powi(x*z,y). */
6707 (mult (POWI:s @0 @1) (POWI:s @2 @1))
6708 (POWI (mult @0 @2) @1))
6710 /* Simplify pow(x,c) / x -> pow(x,c-1). */
6712 (rdiv (POW:s @0 REAL_CST@1) @0)
6713 (if (!TREE_OVERFLOW (@1))
6714 (POW @0 (minus @1 { build_one_cst (type); }))))
6716 /* Simplify x / pow (y,z) -> x * pow(y,-z). */
6718 (rdiv @0 (POW:s @1 @2))
6719 (mult @0 (POW @1 (negate @2))))
6724 /* sqrt(sqrt(x)) -> pow(x,1/4). */
6727 (pows @0 { build_real (type, dconst_quarter ()); }))
6728 /* sqrt(cbrt(x)) -> pow(x,1/6). */
6731 (pows @0 { build_real_truncate (type, dconst_sixth ()); }))
6732 /* cbrt(sqrt(x)) -> pow(x,1/6). */
6735 (pows @0 { build_real_truncate (type, dconst_sixth ()); }))
6736 /* cbrt(cbrt(x)) -> pow(x,1/9), iff x is nonnegative. */
6738 (cbrts (cbrts tree_expr_nonnegative_p@0))
6739 (pows @0 { build_real_truncate (type, dconst_ninth ()); }))
6740 /* sqrt(pow(x,y)) -> pow(|x|,y*0.5). */
6742 (sqrts (pows @0 @1))
6743 (pows (abs @0) (mult @1 { build_real (type, dconsthalf); })))
6744 /* cbrt(pow(x,y)) -> pow(x,y/3), iff x is nonnegative. */
6746 (cbrts (pows tree_expr_nonnegative_p@0 @1))
6747 (pows @0 (mult @1 { build_real_truncate (type, dconst_third ()); })))
6748 /* pow(sqrt(x),y) -> pow(x,y*0.5). */
6750 (pows (sqrts @0) @1)
6751 (pows @0 (mult @1 { build_real (type, dconsthalf); })))
6752 /* pow(cbrt(x),y) -> pow(x,y/3) iff x is nonnegative. */
6754 (pows (cbrts tree_expr_nonnegative_p@0) @1)
6755 (pows @0 (mult @1 { build_real_truncate (type, dconst_third ()); })))
6756 /* pow(pow(x,y),z) -> pow(x,y*z) iff x is nonnegative. */
6758 (pows (pows tree_expr_nonnegative_p@0 @1) @2)
6759 (pows @0 (mult @1 @2))))
6761 /* cabs(x+xi) -> fabs(x)*sqrt(2). */
6763 (CABS (complex @0 @0))
6764 (mult (abs @0) { build_real_truncate (type, dconst_sqrt2 ()); }))
6766 /* hypot(x,x) -> fabs(x)*sqrt(2). */
6769 (mult (abs @0) { build_real_truncate (type, dconst_sqrt2 ()); }))
6771 /* cexp(x+yi) -> exp(x)*cexpi(y). */
6776 (cexps compositional_complex@0)
6777 (if (targetm.libc_has_function (function_c99_math_complex, TREE_TYPE (@0)))
6779 (mult (exps@1 (realpart @0)) (realpart (cexpis:type@2 (imagpart @0))))
6780 (mult @1 (imagpart @2)))))))
6782 (if (canonicalize_math_p ())
6783 /* floor(x) -> trunc(x) if x is nonnegative. */
6784 (for floors (FLOOR_ALL)
6787 (floors tree_expr_nonnegative_p@0)
6790 (match double_value_p
6792 (if (TYPE_MAIN_VARIANT (TREE_TYPE (@0)) == double_type_node)))
6793 (for froms (BUILT_IN_TRUNCL
6805 /* truncl(extend(x)) -> extend(trunc(x)), etc., if x is a double. */
6806 (if (optimize && canonicalize_math_p ())
6808 (froms (convert double_value_p@0))
6809 (convert (tos @0)))))
6811 (match float_value_p
6813 (if (TYPE_MAIN_VARIANT (TREE_TYPE (@0)) == float_type_node)))
6814 (for froms (BUILT_IN_TRUNCL BUILT_IN_TRUNC
6815 BUILT_IN_FLOORL BUILT_IN_FLOOR
6816 BUILT_IN_CEILL BUILT_IN_CEIL
6817 BUILT_IN_ROUNDL BUILT_IN_ROUND
6818 BUILT_IN_NEARBYINTL BUILT_IN_NEARBYINT
6819 BUILT_IN_RINTL BUILT_IN_RINT)
6820 tos (BUILT_IN_TRUNCF BUILT_IN_TRUNCF
6821 BUILT_IN_FLOORF BUILT_IN_FLOORF
6822 BUILT_IN_CEILF BUILT_IN_CEILF
6823 BUILT_IN_ROUNDF BUILT_IN_ROUNDF
6824 BUILT_IN_NEARBYINTF BUILT_IN_NEARBYINTF
6825 BUILT_IN_RINTF BUILT_IN_RINTF)
6826 /* truncl(extend(x)) and trunc(extend(x)) -> extend(truncf(x)), etc.,
6828 (if (optimize && canonicalize_math_p ()
6829 && targetm.libc_has_function (function_c99_misc, NULL_TREE))
6831 (froms (convert float_value_p@0))
6832 (convert (tos @0)))))
6835 (match float16_value_p
6837 (if (TYPE_MAIN_VARIANT (TREE_TYPE (@0)) == float16_type_node)))
6838 (for froms (BUILT_IN_TRUNCL BUILT_IN_TRUNC BUILT_IN_TRUNCF
6839 BUILT_IN_FLOORL BUILT_IN_FLOOR BUILT_IN_FLOORF
6840 BUILT_IN_CEILL BUILT_IN_CEIL BUILT_IN_CEILF
6841 BUILT_IN_ROUNDEVENL BUILT_IN_ROUNDEVEN BUILT_IN_ROUNDEVENF
6842 BUILT_IN_ROUNDL BUILT_IN_ROUND BUILT_IN_ROUNDF
6843 BUILT_IN_NEARBYINTL BUILT_IN_NEARBYINT BUILT_IN_NEARBYINTF
6844 BUILT_IN_RINTL BUILT_IN_RINT BUILT_IN_RINTF
6845 BUILT_IN_SQRTL BUILT_IN_SQRT BUILT_IN_SQRTF)
6846 tos (IFN_TRUNC IFN_TRUNC IFN_TRUNC
6847 IFN_FLOOR IFN_FLOOR IFN_FLOOR
6848 IFN_CEIL IFN_CEIL IFN_CEIL
6849 IFN_ROUNDEVEN IFN_ROUNDEVEN IFN_ROUNDEVEN
6850 IFN_ROUND IFN_ROUND IFN_ROUND
6851 IFN_NEARBYINT IFN_NEARBYINT IFN_NEARBYINT
6852 IFN_RINT IFN_RINT IFN_RINT
6853 IFN_SQRT IFN_SQRT IFN_SQRT)
6854 /* (_Float16) round ((doube) x) -> __built_in_roundf16 (x), etc.,
6855 if x is a _Float16. */
6857 (convert (froms (convert float16_value_p@0)))
6859 && types_match (type, TREE_TYPE (@0))
6860 && direct_internal_fn_supported_p (as_internal_fn (tos),
6861 type, OPTIMIZE_FOR_BOTH))
6864 /* Simplify (trunc)copysign ((extend)x, (extend)y) to copysignf (x, y),
6865 x,y is float value, similar for _Float16/double. */
6866 (for copysigns (COPYSIGN_ALL)
6868 (convert (copysigns (convert@2 @0) (convert @1)))
6870 && !HONOR_SNANS (@2)
6871 && types_match (type, TREE_TYPE (@0))
6872 && types_match (type, TREE_TYPE (@1))
6873 && TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (@2))
6874 && direct_internal_fn_supported_p (IFN_COPYSIGN,
6875 type, OPTIMIZE_FOR_BOTH))
6876 (IFN_COPYSIGN @0 @1))))
6878 (for froms (BUILT_IN_FMAF BUILT_IN_FMA BUILT_IN_FMAL)
6879 tos (IFN_FMA IFN_FMA IFN_FMA)
6881 (convert (froms (convert@3 @0) (convert @1) (convert @2)))
6882 (if (flag_unsafe_math_optimizations
6884 && FLOAT_TYPE_P (type)
6885 && FLOAT_TYPE_P (TREE_TYPE (@3))
6886 && types_match (type, TREE_TYPE (@0))
6887 && types_match (type, TREE_TYPE (@1))
6888 && types_match (type, TREE_TYPE (@2))
6889 && TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (@3))
6890 && direct_internal_fn_supported_p (as_internal_fn (tos),
6891 type, OPTIMIZE_FOR_BOTH))
6894 (for maxmin (max min)
6896 (convert (maxmin (convert@2 @0) (convert @1)))
6898 && FLOAT_TYPE_P (type)
6899 && FLOAT_TYPE_P (TREE_TYPE (@2))
6900 && types_match (type, TREE_TYPE (@0))
6901 && types_match (type, TREE_TYPE (@1))
6902 && element_precision (type) < element_precision (TREE_TYPE (@2)))
6906 (for froms (XFLOORL XCEILL XROUNDL XRINTL)
6907 tos (XFLOOR XCEIL XROUND XRINT)
6908 /* llfloorl(extend(x)) -> llfloor(x), etc., if x is a double. */
6909 (if (optimize && canonicalize_math_p ())
6911 (froms (convert double_value_p@0))
6914 (for froms (XFLOORL XCEILL XROUNDL XRINTL
6915 XFLOOR XCEIL XROUND XRINT)
6916 tos (XFLOORF XCEILF XROUNDF XRINTF)
6917 /* llfloorl(extend(x)) and llfloor(extend(x)) -> llfloorf(x), etc.,
6919 (if (optimize && canonicalize_math_p ())
6921 (froms (convert float_value_p@0))
6924 (if (canonicalize_math_p ())
6925 /* xfloor(x) -> fix_trunc(x) if x is nonnegative. */
6926 (for floors (IFLOOR LFLOOR LLFLOOR)
6928 (floors tree_expr_nonnegative_p@0)
6931 (if (canonicalize_math_p ())
6932 /* xfloor(x) -> fix_trunc(x), etc., if x is integer valued. */
6933 (for fns (IFLOOR LFLOOR LLFLOOR
6935 IROUND LROUND LLROUND)
6937 (fns integer_valued_real_p@0)
6939 (if (!flag_errno_math)
6940 /* xrint(x) -> fix_trunc(x), etc., if x is integer valued. */
6941 (for rints (IRINT LRINT LLRINT)
6943 (rints integer_valued_real_p@0)
6946 (if (canonicalize_math_p ())
6947 (for ifn (IFLOOR ICEIL IROUND IRINT)
6948 lfn (LFLOOR LCEIL LROUND LRINT)
6949 llfn (LLFLOOR LLCEIL LLROUND LLRINT)
6950 /* Canonicalize iround (x) to lround (x) on ILP32 targets where
6951 sizeof (int) == sizeof (long). */
6952 (if (TYPE_PRECISION (integer_type_node)
6953 == TYPE_PRECISION (long_integer_type_node))
6956 (lfn:long_integer_type_node @0)))
6957 /* Canonicalize llround (x) to lround (x) on LP64 targets where
6958 sizeof (long long) == sizeof (long). */
6959 (if (TYPE_PRECISION (long_long_integer_type_node)
6960 == TYPE_PRECISION (long_integer_type_node))
6963 (lfn:long_integer_type_node @0)))))
6965 /* cproj(x) -> x if we're ignoring infinities. */
6968 (if (!HONOR_INFINITIES (type))
6971 /* If the real part is inf and the imag part is known to be
6972 nonnegative, return (inf + 0i). */
6974 (CPROJ (complex REAL_CST@0 tree_expr_nonnegative_p@1))
6975 (if (real_isinf (TREE_REAL_CST_PTR (@0)))
6976 { build_complex_inf (type, false); }))
6978 /* If the imag part is inf, return (inf+I*copysign(0,imag)). */
6980 (CPROJ (complex @0 REAL_CST@1))
6981 (if (real_isinf (TREE_REAL_CST_PTR (@1)))
6982 { build_complex_inf (type, TREE_REAL_CST_PTR (@1)->sign); }))
6988 (pows @0 REAL_CST@1)
6990 const REAL_VALUE_TYPE *value = TREE_REAL_CST_PTR (@1);
6991 REAL_VALUE_TYPE tmp;
6994 /* pow(x,0) -> 1. */
6995 (if (real_equal (value, &dconst0))
6996 { build_real (type, dconst1); })
6997 /* pow(x,1) -> x. */
6998 (if (real_equal (value, &dconst1))
7000 /* pow(x,-1) -> 1/x. */
7001 (if (real_equal (value, &dconstm1))
7002 (rdiv { build_real (type, dconst1); } @0))
7003 /* pow(x,0.5) -> sqrt(x). */
7004 (if (flag_unsafe_math_optimizations
7005 && canonicalize_math_p ()
7006 && real_equal (value, &dconsthalf))
7008 /* pow(x,1/3) -> cbrt(x). */
7009 (if (flag_unsafe_math_optimizations
7010 && canonicalize_math_p ()
7011 && (tmp = real_value_truncate (TYPE_MODE (type), dconst_third ()),
7012 real_equal (value, &tmp)))
7015 /* powi(1,x) -> 1. */
7017 (POWI real_onep@0 @1)
7021 (POWI @0 INTEGER_CST@1)
7023 /* powi(x,0) -> 1. */
7024 (if (wi::to_wide (@1) == 0)
7025 { build_real (type, dconst1); })
7026 /* powi(x,1) -> x. */
7027 (if (wi::to_wide (@1) == 1)
7029 /* powi(x,-1) -> 1/x. */
7030 (if (wi::to_wide (@1) == -1)
7031 (rdiv { build_real (type, dconst1); } @0))))
7033 /* Narrowing of arithmetic and logical operations.
7035 These are conceptually similar to the transformations performed for
7036 the C/C++ front-ends by shorten_binary_op and shorten_compare. Long
7037 term we want to move all that code out of the front-ends into here. */
7039 /* Convert (outertype)((innertype0)a+(innertype1)b)
7040 into ((newtype)a+(newtype)b) where newtype
7041 is the widest mode from all of these. */
7042 (for op (plus minus mult rdiv)
7044 (convert (op:s@0 (convert1?@3 @1) (convert2?@4 @2)))
7045 /* If we have a narrowing conversion of an arithmetic operation where
7046 both operands are widening conversions from the same type as the outer
7047 narrowing conversion. Then convert the innermost operands to a
7048 suitable unsigned type (to avoid introducing undefined behavior),
7049 perform the operation and convert the result to the desired type. */
7050 (if (INTEGRAL_TYPE_P (type)
7053 /* We check for type compatibility between @0 and @1 below,
7054 so there's no need to check that @2/@4 are integral types. */
7055 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
7056 && INTEGRAL_TYPE_P (TREE_TYPE (@3))
7057 /* The precision of the type of each operand must match the
7058 precision of the mode of each operand, similarly for the
7060 && type_has_mode_precision_p (TREE_TYPE (@1))
7061 && type_has_mode_precision_p (TREE_TYPE (@2))
7062 && type_has_mode_precision_p (type)
7063 /* The inner conversion must be a widening conversion. */
7064 && TYPE_PRECISION (TREE_TYPE (@3)) > TYPE_PRECISION (TREE_TYPE (@1))
7065 && types_match (@1, type)
7066 && (types_match (@1, @2)
7067 /* Or the second operand is const integer or converted const
7068 integer from valueize. */
7069 || poly_int_tree_p (@4)))
7070 (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
7071 (op @1 (convert @2))
7072 (with { tree utype = unsigned_type_for (TREE_TYPE (@1)); }
7073 (convert (op (convert:utype @1)
7074 (convert:utype @2)))))
7075 (if (FLOAT_TYPE_P (type)
7076 && DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0))
7077 == DECIMAL_FLOAT_TYPE_P (type))
7078 (with { tree arg0 = strip_float_extensions (@1);
7079 tree arg1 = strip_float_extensions (@2);
7080 tree itype = TREE_TYPE (@0);
7081 tree ty1 = TREE_TYPE (arg0);
7082 tree ty2 = TREE_TYPE (arg1);
7083 enum tree_code code = TREE_CODE (itype); }
7084 (if (FLOAT_TYPE_P (ty1)
7085 && FLOAT_TYPE_P (ty2))
7086 (with { tree newtype = type;
7087 if (TYPE_MODE (ty1) == SDmode
7088 || TYPE_MODE (ty2) == SDmode
7089 || TYPE_MODE (type) == SDmode)
7090 newtype = dfloat32_type_node;
7091 if (TYPE_MODE (ty1) == DDmode
7092 || TYPE_MODE (ty2) == DDmode
7093 || TYPE_MODE (type) == DDmode)
7094 newtype = dfloat64_type_node;
7095 if (TYPE_MODE (ty1) == TDmode
7096 || TYPE_MODE (ty2) == TDmode
7097 || TYPE_MODE (type) == TDmode)
7098 newtype = dfloat128_type_node; }
7099 (if ((newtype == dfloat32_type_node
7100 || newtype == dfloat64_type_node
7101 || newtype == dfloat128_type_node)
7103 && types_match (newtype, type))
7104 (op (convert:newtype @1) (convert:newtype @2))
7105 (with { if (TYPE_PRECISION (ty1) > TYPE_PRECISION (newtype))
7107 if (TYPE_PRECISION (ty2) > TYPE_PRECISION (newtype))
7109 /* Sometimes this transformation is safe (cannot
7110 change results through affecting double rounding
7111 cases) and sometimes it is not. If NEWTYPE is
7112 wider than TYPE, e.g. (float)((long double)double
7113 + (long double)double) converted to
7114 (float)(double + double), the transformation is
7115 unsafe regardless of the details of the types
7116 involved; double rounding can arise if the result
7117 of NEWTYPE arithmetic is a NEWTYPE value half way
7118 between two representable TYPE values but the
7119 exact value is sufficiently different (in the
7120 right direction) for this difference to be
7121 visible in ITYPE arithmetic. If NEWTYPE is the
7122 same as TYPE, however, the transformation may be
7123 safe depending on the types involved: it is safe
7124 if the ITYPE has strictly more than twice as many
7125 mantissa bits as TYPE, can represent infinities
7126 and NaNs if the TYPE can, and has sufficient
7127 exponent range for the product or ratio of two
7128 values representable in the TYPE to be within the
7129 range of normal values of ITYPE. */
7130 (if (TYPE_PRECISION (newtype) < TYPE_PRECISION (itype)
7131 && (flag_unsafe_math_optimizations
7132 || (TYPE_PRECISION (newtype) == TYPE_PRECISION (type)
7133 && real_can_shorten_arithmetic (TYPE_MODE (itype),
7135 && !excess_precision_type (newtype)))
7136 && !types_match (itype, newtype))
7137 (convert:type (op (convert:newtype @1)
7138 (convert:newtype @2)))
7143 /* This is another case of narrowing, specifically when there's an outer
7144 BIT_AND_EXPR which masks off bits outside the type of the innermost
7145 operands. Like the previous case we have to convert the operands
7146 to unsigned types to avoid introducing undefined behavior for the
7147 arithmetic operation. */
7148 (for op (minus plus)
7150 (bit_and (op:s (convert@2 @0) (convert@3 @1)) INTEGER_CST@4)
7151 (if (INTEGRAL_TYPE_P (type)
7152 /* We check for type compatibility between @0 and @1 below,
7153 so there's no need to check that @1/@3 are integral types. */
7154 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
7155 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
7156 /* The precision of the type of each operand must match the
7157 precision of the mode of each operand, similarly for the
7159 && type_has_mode_precision_p (TREE_TYPE (@0))
7160 && type_has_mode_precision_p (TREE_TYPE (@1))
7161 && type_has_mode_precision_p (type)
7162 /* The inner conversion must be a widening conversion. */
7163 && TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (TREE_TYPE (@0))
7164 && types_match (@0, @1)
7165 && (tree_int_cst_min_precision (@4, TYPE_SIGN (TREE_TYPE (@0)))
7166 <= TYPE_PRECISION (TREE_TYPE (@0)))
7167 && (wi::to_wide (@4)
7168 & wi::mask (TYPE_PRECISION (TREE_TYPE (@0)),
7169 true, TYPE_PRECISION (type))) == 0)
7170 (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
7171 (with { tree ntype = TREE_TYPE (@0); }
7172 (convert (bit_and (op @0 @1) (convert:ntype @4))))
7173 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
7174 (convert (bit_and (op (convert:utype @0) (convert:utype @1))
7175 (convert:utype @4))))))))
7177 /* Transform (@0 < @1 and @0 < @2) to use min,
7178 (@0 > @1 and @0 > @2) to use max */
7179 (for logic (bit_and bit_and bit_and bit_and bit_ior bit_ior bit_ior bit_ior)
7180 op (lt le gt ge lt le gt ge )
7181 ext (min min max max max max min min )
7183 (logic (op:cs @0 @1) (op:cs @0 @2))
7184 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
7185 && TREE_CODE (@0) != INTEGER_CST)
7186 (op @0 (ext @1 @2)))))
7189 /* signbit(x) -> 0 if x is nonnegative. */
7190 (SIGNBIT tree_expr_nonnegative_p@0)
7191 { integer_zero_node; })
7194 /* signbit(x) -> x<0 if x doesn't have signed zeros. */
7196 (if (!HONOR_SIGNED_ZEROS (@0))
7197 (convert (lt @0 { build_real (TREE_TYPE (@0), dconst0); }))))
7199 /* Transform comparisons of the form X +- C1 CMP C2 to X CMP C2 -+ C1. */
7201 (for op (plus minus)
7204 (cmp (op@3 @0 INTEGER_CST@1) INTEGER_CST@2)
7205 (if (!TREE_OVERFLOW (@1) && !TREE_OVERFLOW (@2)
7206 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0))
7207 && !TYPE_OVERFLOW_TRAPS (TREE_TYPE (@0))
7208 && !TYPE_SATURATING (TREE_TYPE (@0)))
7209 (with { tree res = int_const_binop (rop, @2, @1); }
7210 (if (TREE_OVERFLOW (res)
7211 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
7212 { constant_boolean_node (cmp == NE_EXPR, type); }
7213 (if (single_use (@3))
7214 (cmp @0 { TREE_OVERFLOW (res)
7215 ? drop_tree_overflow (res) : res; }))))))))
7216 (for cmp (lt le gt ge)
7217 (for op (plus minus)
7220 (cmp (op@3 @0 INTEGER_CST@1) INTEGER_CST@2)
7221 (if (!TREE_OVERFLOW (@1) && !TREE_OVERFLOW (@2)
7222 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
7223 (with { tree res = int_const_binop (rop, @2, @1); }
7224 (if (TREE_OVERFLOW (res))
7226 fold_overflow_warning (("assuming signed overflow does not occur "
7227 "when simplifying conditional to constant"),
7228 WARN_STRICT_OVERFLOW_CONDITIONAL);
7229 bool less = cmp == LE_EXPR || cmp == LT_EXPR;
7230 /* wi::ges_p (@2, 0) should be sufficient for a signed type. */
7231 bool ovf_high = wi::lt_p (wi::to_wide (@1), 0,
7232 TYPE_SIGN (TREE_TYPE (@1)))
7233 != (op == MINUS_EXPR);
7234 constant_boolean_node (less == ovf_high, type);
7236 (if (single_use (@3))
7239 fold_overflow_warning (("assuming signed overflow does not occur "
7240 "when changing X +- C1 cmp C2 to "
7242 WARN_STRICT_OVERFLOW_COMPARISON);
7244 (cmp @0 { res; })))))))))
7246 /* Canonicalizations of BIT_FIELD_REFs. */
7249 (BIT_FIELD_REF (BIT_FIELD_REF @0 @1 @2) @3 @4)
7250 (BIT_FIELD_REF @0 @3 { const_binop (PLUS_EXPR, bitsizetype, @2, @4); }))
7253 (BIT_FIELD_REF (view_convert @0) @1 @2)
7254 (BIT_FIELD_REF @0 @1 @2))
7257 (BIT_FIELD_REF @0 @1 integer_zerop)
7258 (if (tree_int_cst_equal (@1, TYPE_SIZE (TREE_TYPE (@0))))
7262 (BIT_FIELD_REF @0 @1 @2)
7264 (if (TREE_CODE (TREE_TYPE (@0)) == COMPLEX_TYPE
7265 && tree_int_cst_equal (@1, TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0)))))
7267 (if (integer_zerop (@2))
7268 (view_convert (realpart @0)))
7269 (if (tree_int_cst_equal (@2, TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0)))))
7270 (view_convert (imagpart @0)))))
7271 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
7272 && INTEGRAL_TYPE_P (type)
7273 /* On GIMPLE this should only apply to register arguments. */
7274 && (! GIMPLE || is_gimple_reg (@0))
7275 /* A bit-field-ref that referenced the full argument can be stripped. */
7276 && ((compare_tree_int (@1, TYPE_PRECISION (TREE_TYPE (@0))) == 0
7277 && integer_zerop (@2))
7278 /* Low-parts can be reduced to integral conversions.
7279 ??? The following doesn't work for PDP endian. */
7280 || (BYTES_BIG_ENDIAN == WORDS_BIG_ENDIAN
7281 /* But only do this after vectorization. */
7282 && canonicalize_math_after_vectorization_p ()
7283 /* Don't even think about BITS_BIG_ENDIAN. */
7284 && TYPE_PRECISION (TREE_TYPE (@0)) % BITS_PER_UNIT == 0
7285 && TYPE_PRECISION (type) % BITS_PER_UNIT == 0
7286 && compare_tree_int (@2, (BYTES_BIG_ENDIAN
7287 ? (TYPE_PRECISION (TREE_TYPE (@0))
7288 - TYPE_PRECISION (type))
7292 /* Simplify vector extracts. */
7295 (BIT_FIELD_REF CONSTRUCTOR@0 @1 @2)
7296 (if (VECTOR_TYPE_P (TREE_TYPE (@0))
7297 && tree_fits_uhwi_p (TYPE_SIZE (type))
7298 && ((tree_to_uhwi (TYPE_SIZE (type))
7299 == tree_to_uhwi (TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0)))))
7300 || (VECTOR_TYPE_P (type)
7301 && (tree_to_uhwi (TYPE_SIZE (TREE_TYPE (type)))
7302 == tree_to_uhwi (TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0))))))))
7306 tree eltype = TREE_TYPE (TREE_TYPE (ctor));
7307 unsigned HOST_WIDE_INT width = tree_to_uhwi (TYPE_SIZE (eltype));
7308 unsigned HOST_WIDE_INT n = tree_to_uhwi (@1);
7309 unsigned HOST_WIDE_INT idx = tree_to_uhwi (@2);
7312 && (idx % width) == 0
7314 && known_le ((idx + n) / width,
7315 TYPE_VECTOR_SUBPARTS (TREE_TYPE (ctor))))
7320 /* Constructor elements can be subvectors. */
7322 if (CONSTRUCTOR_NELTS (ctor) != 0)
7324 tree cons_elem = TREE_TYPE (CONSTRUCTOR_ELT (ctor, 0)->value);
7325 if (TREE_CODE (cons_elem) == VECTOR_TYPE)
7326 k = TYPE_VECTOR_SUBPARTS (cons_elem);
7328 unsigned HOST_WIDE_INT elt, count, const_k;
7331 /* We keep an exact subset of the constructor elements. */
7332 (if (multiple_p (idx, k, &elt) && multiple_p (n, k, &count))
7333 (if (CONSTRUCTOR_NELTS (ctor) == 0)
7334 { build_zero_cst (type); }
7336 (if (elt < CONSTRUCTOR_NELTS (ctor))
7337 (view_convert { CONSTRUCTOR_ELT (ctor, elt)->value; })
7338 { build_zero_cst (type); })
7339 /* We don't want to emit new CTORs unless the old one goes away.
7340 ??? Eventually allow this if the CTOR ends up constant or
7342 (if (single_use (@0))
7345 vec<constructor_elt, va_gc> *vals;
7346 vec_alloc (vals, count);
7347 bool constant_p = true;
7349 for (unsigned i = 0;
7350 i < count && elt + i < CONSTRUCTOR_NELTS (ctor); ++i)
7352 tree e = CONSTRUCTOR_ELT (ctor, elt + i)->value;
7353 CONSTRUCTOR_APPEND_ELT (vals, NULL_TREE, e);
7354 if (!CONSTANT_CLASS_P (e))
7357 tree evtype = (types_match (TREE_TYPE (type),
7358 TREE_TYPE (TREE_TYPE (ctor)))
7360 : build_vector_type (TREE_TYPE (TREE_TYPE (ctor)),
7362 res = (constant_p ? build_vector_from_ctor (evtype, vals)
7363 : build_constructor (evtype, vals));
7365 (view_convert { res; }))))))
7366 /* The bitfield references a single constructor element. */
7367 (if (k.is_constant (&const_k)
7368 && idx + n <= (idx / const_k + 1) * const_k)
7370 (if (CONSTRUCTOR_NELTS (ctor) <= idx / const_k)
7371 { build_zero_cst (type); })
7373 (view_convert { CONSTRUCTOR_ELT (ctor, idx / const_k)->value; }))
7374 (BIT_FIELD_REF { CONSTRUCTOR_ELT (ctor, idx / const_k)->value; }
7375 @1 { bitsize_int ((idx % const_k) * width); })))))))))
7377 /* Simplify a bit extraction from a bit insertion for the cases with
7378 the inserted element fully covering the extraction or the insertion
7379 not touching the extraction. */
7381 (BIT_FIELD_REF (bit_insert @0 @1 @ipos) @rsize @rpos)
7384 unsigned HOST_WIDE_INT isize;
7385 if (INTEGRAL_TYPE_P (TREE_TYPE (@1)))
7386 isize = TYPE_PRECISION (TREE_TYPE (@1));
7388 isize = tree_to_uhwi (TYPE_SIZE (TREE_TYPE (@1)));
7391 (if (wi::leu_p (wi::to_wide (@ipos), wi::to_wide (@rpos))
7392 && wi::leu_p (wi::to_wide (@rpos) + wi::to_wide (@rsize),
7393 wi::to_wide (@ipos) + isize))
7394 (BIT_FIELD_REF @1 @rsize { wide_int_to_tree (bitsizetype,
7396 - wi::to_wide (@ipos)); }))
7397 (if (wi::geu_p (wi::to_wide (@ipos),
7398 wi::to_wide (@rpos) + wi::to_wide (@rsize))
7399 || wi::geu_p (wi::to_wide (@rpos),
7400 wi::to_wide (@ipos) + isize))
7401 (BIT_FIELD_REF @0 @rsize @rpos)))))
7403 (if (canonicalize_math_after_vectorization_p ())
7406 (fmas:c (negate @0) @1 @2)
7407 (IFN_FNMA @0 @1 @2))
7409 (fmas @0 @1 (negate @2))
7412 (fmas:c (negate @0) @1 (negate @2))
7413 (IFN_FNMS @0 @1 @2))
7415 (negate (fmas@3 @0 @1 @2))
7416 (if (single_use (@3))
7417 (IFN_FNMS @0 @1 @2))))
7420 (IFN_FMS:c (negate @0) @1 @2)
7421 (IFN_FNMS @0 @1 @2))
7423 (IFN_FMS @0 @1 (negate @2))
7426 (IFN_FMS:c (negate @0) @1 (negate @2))
7427 (IFN_FNMA @0 @1 @2))
7429 (negate (IFN_FMS@3 @0 @1 @2))
7430 (if (single_use (@3))
7431 (IFN_FNMA @0 @1 @2)))
7434 (IFN_FNMA:c (negate @0) @1 @2)
7437 (IFN_FNMA @0 @1 (negate @2))
7438 (IFN_FNMS @0 @1 @2))
7440 (IFN_FNMA:c (negate @0) @1 (negate @2))
7443 (negate (IFN_FNMA@3 @0 @1 @2))
7444 (if (single_use (@3))
7445 (IFN_FMS @0 @1 @2)))
7448 (IFN_FNMS:c (negate @0) @1 @2)
7451 (IFN_FNMS @0 @1 (negate @2))
7452 (IFN_FNMA @0 @1 @2))
7454 (IFN_FNMS:c (negate @0) @1 (negate @2))
7457 (negate (IFN_FNMS@3 @0 @1 @2))
7458 (if (single_use (@3))
7459 (IFN_FMA @0 @1 @2))))
7461 /* CLZ simplifications. */
7466 (op (clz:s@2 @0) INTEGER_CST@1)
7467 (if (integer_zerop (@1) && single_use (@2))
7468 /* clz(X) == 0 is (int)X < 0 and clz(X) != 0 is (int)X >= 0. */
7469 (with { tree type0 = TREE_TYPE (@0);
7470 tree stype = signed_type_for (type0);
7471 HOST_WIDE_INT val = 0;
7472 /* Punt on hypothetical weird targets. */
7474 && CLZ_DEFINED_VALUE_AT_ZERO (SCALAR_TYPE_MODE (type0),
7480 (cmp (convert:stype @0) { build_zero_cst (stype); })))
7481 /* clz(X) == (prec-1) is X == 1 and clz(X) != (prec-1) is X != 1. */
7482 (with { bool ok = true;
7483 HOST_WIDE_INT val = 0;
7484 tree type0 = TREE_TYPE (@0);
7485 /* Punt on hypothetical weird targets. */
7487 && CLZ_DEFINED_VALUE_AT_ZERO (SCALAR_TYPE_MODE (type0),
7489 && val == TYPE_PRECISION (type0) - 1)
7492 (if (ok && wi::to_wide (@1) == (TYPE_PRECISION (type0) - 1))
7493 (op @0 { build_one_cst (type0); })))))))
7495 /* CTZ simplifications. */
7497 (for op (ge gt le lt)
7500 /* __builtin_ctz (x) >= C -> (x & ((1 << C) - 1)) == 0. */
7501 (op (ctz:s @0) INTEGER_CST@1)
7502 (with { bool ok = true;
7503 HOST_WIDE_INT val = 0;
7504 if (!tree_fits_shwi_p (@1))
7508 val = tree_to_shwi (@1);
7509 /* Canonicalize to >= or <. */
7510 if (op == GT_EXPR || op == LE_EXPR)
7512 if (val == HOST_WIDE_INT_MAX)
7518 bool zero_res = false;
7519 HOST_WIDE_INT zero_val = 0;
7520 tree type0 = TREE_TYPE (@0);
7521 int prec = TYPE_PRECISION (type0);
7523 && CTZ_DEFINED_VALUE_AT_ZERO (SCALAR_TYPE_MODE (type0),
7528 (if (ok && (!zero_res || zero_val >= val))
7529 { constant_boolean_node (cmp == EQ_EXPR ? true : false, type); })
7531 (if (ok && (!zero_res || zero_val < val))
7532 { constant_boolean_node (cmp == EQ_EXPR ? false : true, type); })
7533 (if (ok && (!zero_res || zero_val < 0 || zero_val >= prec))
7534 (cmp (bit_and @0 { wide_int_to_tree (type0,
7535 wi::mask (val, false, prec)); })
7536 { build_zero_cst (type0); })))))))
7539 /* __builtin_ctz (x) == C -> (x & ((1 << (C + 1)) - 1)) == (1 << C). */
7540 (op (ctz:s @0) INTEGER_CST@1)
7541 (with { bool zero_res = false;
7542 HOST_WIDE_INT zero_val = 0;
7543 tree type0 = TREE_TYPE (@0);
7544 int prec = TYPE_PRECISION (type0);
7546 && CTZ_DEFINED_VALUE_AT_ZERO (SCALAR_TYPE_MODE (type0),
7550 (if (tree_int_cst_sgn (@1) < 0 || wi::to_widest (@1) >= prec)
7551 (if (!zero_res || zero_val != wi::to_widest (@1))
7552 { constant_boolean_node (op == EQ_EXPR ? false : true, type); })
7553 (if (!zero_res || zero_val < 0 || zero_val >= prec)
7554 (op (bit_and @0 { wide_int_to_tree (type0,
7555 wi::mask (tree_to_uhwi (@1) + 1,
7557 { wide_int_to_tree (type0,
7558 wi::shifted_mask (tree_to_uhwi (@1), 1,
7559 false, prec)); })))))))
7561 /* POPCOUNT simplifications. */
7562 /* popcount(X) + popcount(Y) is popcount(X|Y) when X&Y must be zero. */
7564 (plus (POPCOUNT:s @0) (POPCOUNT:s @1))
7565 (if (wi::bit_and (tree_nonzero_bits (@0), tree_nonzero_bits (@1)) == 0)
7566 (POPCOUNT (bit_ior @0 @1))))
7568 /* popcount(X) == 0 is X == 0, and related (in)equalities. */
7569 (for popcount (POPCOUNT)
7570 (for cmp (le eq ne gt)
7573 (cmp (popcount @0) integer_zerop)
7574 (rep @0 { build_zero_cst (TREE_TYPE (@0)); }))))
7576 /* Canonicalize POPCOUNT(x)&1 as PARITY(X). */
7578 (bit_and (POPCOUNT @0) integer_onep)
7581 /* PARITY simplifications. */
7582 /* parity(~X) is parity(X). */
7584 (PARITY (bit_not @0))
7587 /* parity(X)^parity(Y) is parity(X^Y). */
7589 (bit_xor (PARITY:s @0) (PARITY:s @1))
7590 (PARITY (bit_xor @0 @1)))
7592 /* Common POPCOUNT/PARITY simplifications. */
7593 /* popcount(X&C1) is (X>>C2)&1 when C1 == 1<<C2. Same for parity(X&C1). */
7594 (for pfun (POPCOUNT PARITY)
7597 (with { wide_int nz = tree_nonzero_bits (@0); }
7601 (if (wi::popcount (nz) == 1)
7602 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
7603 (convert (rshift:utype (convert:utype @0)
7604 { build_int_cst (integer_type_node,
7605 wi::ctz (nz)); }))))))))
7608 /* 64- and 32-bits branchless implementations of popcount are detected:
7610 int popcount64c (uint64_t x)
7612 x -= (x >> 1) & 0x5555555555555555ULL;
7613 x = (x & 0x3333333333333333ULL) + ((x >> 2) & 0x3333333333333333ULL);
7614 x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0fULL;
7615 return (x * 0x0101010101010101ULL) >> 56;
7618 int popcount32c (uint32_t x)
7620 x -= (x >> 1) & 0x55555555;
7621 x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
7622 x = (x + (x >> 4)) & 0x0f0f0f0f;
7623 return (x * 0x01010101) >> 24;
7630 (rshift @8 INTEGER_CST@5)
7632 (bit_and @6 INTEGER_CST@7)
7636 (bit_and (rshift @0 INTEGER_CST@4) INTEGER_CST@11))
7642 /* Check constants and optab. */
7643 (with { unsigned prec = TYPE_PRECISION (type);
7644 int shift = (64 - prec) & 63;
7645 unsigned HOST_WIDE_INT c1
7646 = HOST_WIDE_INT_UC (0x0101010101010101) >> shift;
7647 unsigned HOST_WIDE_INT c2
7648 = HOST_WIDE_INT_UC (0x0F0F0F0F0F0F0F0F) >> shift;
7649 unsigned HOST_WIDE_INT c3
7650 = HOST_WIDE_INT_UC (0x3333333333333333) >> shift;
7651 unsigned HOST_WIDE_INT c4
7652 = HOST_WIDE_INT_UC (0x5555555555555555) >> shift;
7657 && TYPE_UNSIGNED (type)
7658 && integer_onep (@4)
7659 && wi::to_widest (@10) == 2
7660 && wi::to_widest (@5) == 4
7661 && wi::to_widest (@1) == prec - 8
7662 && tree_to_uhwi (@2) == c1
7663 && tree_to_uhwi (@3) == c2
7664 && tree_to_uhwi (@9) == c3
7665 && tree_to_uhwi (@7) == c3
7666 && tree_to_uhwi (@11) == c4)
7667 (if (direct_internal_fn_supported_p (IFN_POPCOUNT, type,
7669 (convert (IFN_POPCOUNT:type @0))
7670 /* Try to do popcount in two halves. PREC must be at least
7671 five bits for this to work without extension before adding. */
7673 tree half_type = NULL_TREE;
7674 opt_machine_mode m = mode_for_size ((prec + 1) / 2, MODE_INT, 1);
7677 && m.require () != TYPE_MODE (type))
7679 half_prec = GET_MODE_PRECISION (as_a <scalar_int_mode> (m));
7680 half_type = build_nonstandard_integer_type (half_prec, 1);
7682 gcc_assert (half_prec > 2);
7684 (if (half_type != NULL_TREE
7685 && direct_internal_fn_supported_p (IFN_POPCOUNT, half_type,
7688 (IFN_POPCOUNT:half_type (convert @0))
7689 (IFN_POPCOUNT:half_type (convert (rshift @0
7690 { build_int_cst (integer_type_node, half_prec); } )))))))))))
7692 /* __builtin_ffs needs to deal on many targets with the possible zero
7693 argument. If we know the argument is always non-zero, __builtin_ctz + 1
7694 should lead to better code. */
7696 (FFS tree_expr_nonzero_p@0)
7697 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
7698 && direct_internal_fn_supported_p (IFN_CTZ, TREE_TYPE (@0),
7699 OPTIMIZE_FOR_SPEED))
7700 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
7701 (plus (CTZ:type (convert:utype @0)) { build_one_cst (type); }))))
7704 (for ffs (BUILT_IN_FFS BUILT_IN_FFSL BUILT_IN_FFSLL
7706 /* __builtin_ffs (X) == 0 -> X == 0.
7707 __builtin_ffs (X) == 6 -> (X & 63) == 32. */
7710 (cmp (ffs@2 @0) INTEGER_CST@1)
7711 (with { int prec = TYPE_PRECISION (TREE_TYPE (@0)); }
7713 (if (integer_zerop (@1))
7714 (cmp @0 { build_zero_cst (TREE_TYPE (@0)); }))
7715 (if (tree_int_cst_sgn (@1) < 0 || wi::to_widest (@1) > prec)
7716 { constant_boolean_node (cmp == NE_EXPR ? true : false, type); })
7717 (if (single_use (@2))
7718 (cmp (bit_and @0 { wide_int_to_tree (TREE_TYPE (@0),
7719 wi::mask (tree_to_uhwi (@1),
7721 { wide_int_to_tree (TREE_TYPE (@0),
7722 wi::shifted_mask (tree_to_uhwi (@1) - 1, 1,
7723 false, prec)); }))))))
7725 /* __builtin_ffs (X) > 6 -> X != 0 && (X & 63) == 0. */
7729 bit_op (bit_and bit_ior)
7731 (cmp (ffs@2 @0) INTEGER_CST@1)
7732 (with { int prec = TYPE_PRECISION (TREE_TYPE (@0)); }
7734 (if (integer_zerop (@1))
7735 (cmp2 @0 { build_zero_cst (TREE_TYPE (@0)); }))
7736 (if (tree_int_cst_sgn (@1) < 0)
7737 { constant_boolean_node (cmp == GT_EXPR ? true : false, type); })
7738 (if (wi::to_widest (@1) >= prec)
7739 { constant_boolean_node (cmp == GT_EXPR ? false : true, type); })
7740 (if (wi::to_widest (@1) == prec - 1)
7741 (cmp3 @0 { wide_int_to_tree (TREE_TYPE (@0),
7742 wi::shifted_mask (prec - 1, 1,
7744 (if (single_use (@2))
7745 (bit_op (cmp2 @0 { build_zero_cst (TREE_TYPE (@0)); })
7747 { wide_int_to_tree (TREE_TYPE (@0),
7748 wi::mask (tree_to_uhwi (@1),
7750 { build_zero_cst (TREE_TYPE (@0)); }))))))))
7757 --> r = .COND_FN (cond, a, b)
7761 --> r = .COND_FN (~cond, b, a). */
7763 (for uncond_op (UNCOND_UNARY)
7764 cond_op (COND_UNARY)
7766 (vec_cond @0 (view_convert? (uncond_op@3 @1)) @2)
7767 (with { tree op_type = TREE_TYPE (@3); }
7768 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
7769 && is_truth_type_for (op_type, TREE_TYPE (@0)))
7770 (cond_op @0 @1 @2))))
7772 (vec_cond @0 @1 (view_convert? (uncond_op@3 @2)))
7773 (with { tree op_type = TREE_TYPE (@3); }
7774 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
7775 && is_truth_type_for (op_type, TREE_TYPE (@0)))
7776 (cond_op (bit_not @0) @2 @1)))))
7785 r = c ? a1 op a2 : b;
7787 if the target can do it in one go. This makes the operation conditional
7788 on c, so could drop potentially-trapping arithmetic, but that's a valid
7789 simplification if the result of the operation isn't needed.
7791 Avoid speculatively generating a stand-alone vector comparison
7792 on targets that might not support them. Any target implementing
7793 conditional internal functions must support the same comparisons
7794 inside and outside a VEC_COND_EXPR. */
7796 (for uncond_op (UNCOND_BINARY)
7797 cond_op (COND_BINARY)
7799 (vec_cond @0 (view_convert? (uncond_op@4 @1 @2)) @3)
7800 (with { tree op_type = TREE_TYPE (@4); }
7801 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
7802 && is_truth_type_for (op_type, TREE_TYPE (@0))
7804 (view_convert (cond_op @0 @1 @2 (view_convert:op_type @3))))))
7806 (vec_cond @0 @1 (view_convert? (uncond_op@4 @2 @3)))
7807 (with { tree op_type = TREE_TYPE (@4); }
7808 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
7809 && is_truth_type_for (op_type, TREE_TYPE (@0))
7811 (view_convert (cond_op (bit_not @0) @2 @3 (view_convert:op_type @1)))))))
7813 /* Same for ternary operations. */
7814 (for uncond_op (UNCOND_TERNARY)
7815 cond_op (COND_TERNARY)
7817 (vec_cond @0 (view_convert? (uncond_op@5 @1 @2 @3)) @4)
7818 (with { tree op_type = TREE_TYPE (@5); }
7819 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
7820 && is_truth_type_for (op_type, TREE_TYPE (@0))
7822 (view_convert (cond_op @0 @1 @2 @3 (view_convert:op_type @4))))))
7824 (vec_cond @0 @1 (view_convert? (uncond_op@5 @2 @3 @4)))
7825 (with { tree op_type = TREE_TYPE (@5); }
7826 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
7827 && is_truth_type_for (op_type, TREE_TYPE (@0))
7829 (view_convert (cond_op (bit_not @0) @2 @3 @4
7830 (view_convert:op_type @1)))))))
7833 /* Detect cases in which a VEC_COND_EXPR effectively replaces the
7834 "else" value of an IFN_COND_*. */
7835 (for cond_op (COND_BINARY)
7837 (vec_cond @0 (view_convert? (cond_op @0 @1 @2 @3)) @4)
7838 (with { tree op_type = TREE_TYPE (@3); }
7839 (if (element_precision (type) == element_precision (op_type))
7840 (view_convert (cond_op @0 @1 @2 (view_convert:op_type @4))))))
7842 (vec_cond @0 @1 (view_convert? (cond_op @2 @3 @4 @5)))
7843 (with { tree op_type = TREE_TYPE (@5); }
7844 (if (inverse_conditions_p (@0, @2)
7845 && element_precision (type) == element_precision (op_type))
7846 (view_convert (cond_op @2 @3 @4 (view_convert:op_type @1)))))))
7848 /* Same for ternary operations. */
7849 (for cond_op (COND_TERNARY)
7851 (vec_cond @0 (view_convert? (cond_op @0 @1 @2 @3 @4)) @5)
7852 (with { tree op_type = TREE_TYPE (@4); }
7853 (if (element_precision (type) == element_precision (op_type))
7854 (view_convert (cond_op @0 @1 @2 @3 (view_convert:op_type @5))))))
7856 (vec_cond @0 @1 (view_convert? (cond_op @2 @3 @4 @5 @6)))
7857 (with { tree op_type = TREE_TYPE (@6); }
7858 (if (inverse_conditions_p (@0, @2)
7859 && element_precision (type) == element_precision (op_type))
7860 (view_convert (cond_op @2 @3 @4 @5 (view_convert:op_type @1)))))))
7862 /* Detect simplication for a conditional reduction where
7865 c = mask2 ? d + a : d
7869 c = mask1 && mask2 ? d + b : d. */
7871 (IFN_COND_ADD @0 @1 (vec_cond @2 @3 integer_zerop) @1)
7872 (IFN_COND_ADD (bit_and @0 @2) @1 @3 @1))
7874 /* For pointers @0 and @2 and nonnegative constant offset @1, look for
7877 A: (@0 + @1 < @2) | (@2 + @1 < @0)
7878 B: (@0 + @1 <= @2) | (@2 + @1 <= @0)
7880 If pointers are known not to wrap, B checks whether @1 bytes starting
7881 at @0 and @2 do not overlap, while A tests the same thing for @1 + 1
7882 bytes. A is more efficiently tested as:
7884 A: (sizetype) (@0 + @1 - @2) > @1 * 2
7886 The equivalent expression for B is given by replacing @1 with @1 - 1:
7888 B: (sizetype) (@0 + (@1 - 1) - @2) > (@1 - 1) * 2
7890 @0 and @2 can be swapped in both expressions without changing the result.
7892 The folds rely on sizetype's being unsigned (which is always true)
7893 and on its being the same width as the pointer (which we have to check).
7895 The fold replaces two pointer_plus expressions, two comparisons and
7896 an IOR with a pointer_plus, a pointer_diff, and a comparison, so in
7897 the best case it's a saving of two operations. The A fold retains one
7898 of the original pointer_pluses, so is a win even if both pointer_pluses
7899 are used elsewhere. The B fold is a wash if both pointer_pluses are
7900 used elsewhere, since all we end up doing is replacing a comparison with
7901 a pointer_plus. We do still apply the fold under those circumstances
7902 though, in case applying it to other conditions eventually makes one of the
7903 pointer_pluses dead. */
7904 (for ior (truth_orif truth_or bit_ior)
7907 (ior (cmp:cs (pointer_plus@3 @0 INTEGER_CST@1) @2)
7908 (cmp:cs (pointer_plus@4 @2 @1) @0))
7909 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
7910 && TYPE_OVERFLOW_WRAPS (sizetype)
7911 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (sizetype))
7912 /* Calculate the rhs constant. */
7913 (with { offset_int off = wi::to_offset (@1) - (cmp == LE_EXPR ? 1 : 0);
7914 offset_int rhs = off * 2; }
7915 /* Always fails for negative values. */
7916 (if (wi::min_precision (rhs, UNSIGNED) <= TYPE_PRECISION (sizetype))
7917 /* Since the order of @0 and @2 doesn't matter, let tree_swap_operands_p
7918 pick a canonical order. This increases the chances of using the
7919 same pointer_plus in multiple checks. */
7920 (with { bool swap_p = tree_swap_operands_p (@0, @2);
7921 tree rhs_tree = wide_int_to_tree (sizetype, rhs); }
7922 (if (cmp == LT_EXPR)
7923 (gt (convert:sizetype
7924 (pointer_diff:ssizetype { swap_p ? @4 : @3; }
7925 { swap_p ? @0 : @2; }))
7927 (gt (convert:sizetype
7928 (pointer_diff:ssizetype
7929 (pointer_plus { swap_p ? @2 : @0; }
7930 { wide_int_to_tree (sizetype, off); })
7931 { swap_p ? @0 : @2; }))
7932 { rhs_tree; })))))))))
7934 /* Fold REDUC (@0 & @1) -> @0[I] & @1[I] if element I is the only nonzero
7936 (for reduc (IFN_REDUC_PLUS IFN_REDUC_IOR IFN_REDUC_XOR)
7937 (simplify (reduc (view_convert? (bit_and @0 VECTOR_CST@1)))
7938 (with { int i = single_nonzero_element (@1); }
7940 (with { tree elt = vector_cst_elt (@1, i);
7941 tree elt_type = TREE_TYPE (elt);
7942 unsigned int elt_bits = tree_to_uhwi (TYPE_SIZE (elt_type));
7943 tree size = bitsize_int (elt_bits);
7944 tree pos = bitsize_int (elt_bits * i); }
7947 (BIT_FIELD_REF:elt_type @0 { size; } { pos; })
7950 /* Fold reduction of a single nonzero element constructor. */
7951 (for reduc (IFN_REDUC_PLUS IFN_REDUC_IOR IFN_REDUC_XOR)
7952 (simplify (reduc (CONSTRUCTOR@0))
7953 (with { tree ctor = @0;
7954 tree elt = ctor_single_nonzero_element (ctor); }
7956 && !HONOR_SNANS (type)
7957 && !HONOR_SIGNED_ZEROS (type))
7960 /* Fold REDUC (@0 op VECTOR_CST) as REDUC (@0) op REDUC (VECTOR_CST). */
7961 (for reduc (IFN_REDUC_PLUS IFN_REDUC_MAX IFN_REDUC_MIN IFN_REDUC_FMAX
7962 IFN_REDUC_FMIN IFN_REDUC_AND IFN_REDUC_IOR IFN_REDUC_XOR)
7963 op (plus max min IFN_FMAX IFN_FMIN bit_and bit_ior bit_xor)
7964 (simplify (reduc (op @0 VECTOR_CST@1))
7965 (op (reduc:type @0) (reduc:type @1))))
7967 /* Simplify vector floating point operations of alternating sub/add pairs
7968 into using an fneg of a wider element type followed by a normal add.
7969 under IEEE 754 the fneg of the wider type will negate every even entry
7970 and when doing an add we get a sub of the even and add of every odd
7973 (vec_perm (plus:c @0 @1) (minus @0 @1) VECTOR_CST@2)
7974 (if (!VECTOR_INTEGER_TYPE_P (type)
7975 && !FLOAT_WORDS_BIG_ENDIAN)
7978 /* Build a vector of integers from the tree mask. */
7979 vec_perm_builder builder;
7981 (if (tree_to_vec_perm_builder (&builder, @2))
7984 /* Create a vec_perm_indices for the integer vector. */
7985 poly_uint64 nelts = TYPE_VECTOR_SUBPARTS (type);
7986 vec_perm_indices sel (builder, 2, nelts);
7987 machine_mode vec_mode = TYPE_MODE (type);
7988 machine_mode wide_mode;
7989 scalar_mode wide_elt_mode;
7990 poly_uint64 wide_nunits;
7991 scalar_mode inner_mode = GET_MODE_INNER (vec_mode);
7993 (if (sel.series_p (0, 2, 0, 2)
7994 && GET_MODE_2XWIDER_MODE (inner_mode).exists (&wide_elt_mode)
7995 && multiple_p (GET_MODE_NUNITS (vec_mode), 2, &wide_nunits)
7996 && related_vector_mode (vec_mode, wide_elt_mode,
7997 wide_nunits).exists (&wide_mode))
8001 = lang_hooks.types.type_for_mode (GET_MODE_INNER (wide_mode),
8002 TYPE_UNSIGNED (type));
8003 tree ntype = build_vector_type_for_mode (stype, wide_mode);
8005 /* The format has to be a non-extended ieee format. */
8006 const struct real_format *fmt_old = FLOAT_MODE_FORMAT (vec_mode);
8007 const struct real_format *fmt_new = FLOAT_MODE_FORMAT (wide_mode);
8009 (if (TYPE_MODE (stype) != BLKmode
8010 && VECTOR_TYPE_P (ntype)
8015 /* If the target doesn't support v1xx vectors, try using
8016 scalar mode xx instead. */
8017 if (known_eq (GET_MODE_NUNITS (wide_mode), 1)
8018 && !target_supports_op_p (ntype, NEGATE_EXPR, optab_vector))
8021 (if (fmt_new->signbit_rw
8022 == fmt_old->signbit_rw + GET_MODE_UNIT_BITSIZE (vec_mode)
8023 && fmt_new->signbit_rw == fmt_new->signbit_ro
8024 && targetm.can_change_mode_class (TYPE_MODE (ntype), TYPE_MODE (type), ALL_REGS)
8025 && ((optimize_vectors_before_lowering_p () && VECTOR_TYPE_P (ntype))
8026 || target_supports_op_p (ntype, NEGATE_EXPR, optab_vector)))
8027 (plus (view_convert:type (negate (view_convert:ntype @1))) @0)))))))))))
8030 (vec_perm @0 @1 VECTOR_CST@2)
8033 tree op0 = @0, op1 = @1, op2 = @2;
8034 machine_mode result_mode = TYPE_MODE (type);
8035 machine_mode op_mode = TYPE_MODE (TREE_TYPE (op0));
8037 /* Build a vector of integers from the tree mask. */
8038 vec_perm_builder builder;
8040 (if (tree_to_vec_perm_builder (&builder, op2))
8043 /* Create a vec_perm_indices for the integer vector. */
8044 poly_uint64 nelts = TYPE_VECTOR_SUBPARTS (type);
8045 bool single_arg = (op0 == op1);
8046 vec_perm_indices sel (builder, single_arg ? 1 : 2, nelts);
8048 (if (sel.series_p (0, 1, 0, 1))
8050 (if (sel.series_p (0, 1, nelts, 1))
8056 if (sel.all_from_input_p (0))
8058 else if (sel.all_from_input_p (1))
8061 sel.rotate_inputs (1);
8063 else if (known_ge (poly_uint64 (sel[0]), nelts))
8065 std::swap (op0, op1);
8066 sel.rotate_inputs (1);
8070 tree cop0 = op0, cop1 = op1;
8071 if (TREE_CODE (op0) == SSA_NAME
8072 && (def = dyn_cast <gassign *> (SSA_NAME_DEF_STMT (op0)))
8073 && gimple_assign_rhs_code (def) == CONSTRUCTOR)
8074 cop0 = gimple_assign_rhs1 (def);
8075 if (TREE_CODE (op1) == SSA_NAME
8076 && (def = dyn_cast <gassign *> (SSA_NAME_DEF_STMT (op1)))
8077 && gimple_assign_rhs_code (def) == CONSTRUCTOR)
8078 cop1 = gimple_assign_rhs1 (def);
8081 (if ((TREE_CODE (cop0) == VECTOR_CST
8082 || TREE_CODE (cop0) == CONSTRUCTOR)
8083 && (TREE_CODE (cop1) == VECTOR_CST
8084 || TREE_CODE (cop1) == CONSTRUCTOR)
8085 && (t = fold_vec_perm (type, cop0, cop1, sel)))
8089 bool changed = (op0 == op1 && !single_arg);
8090 tree ins = NULL_TREE;
8093 /* See if the permutation is performing a single element
8094 insert from a CONSTRUCTOR or constant and use a BIT_INSERT_EXPR
8095 in that case. But only if the vector mode is supported,
8096 otherwise this is invalid GIMPLE. */
8097 if (op_mode != BLKmode
8098 && (TREE_CODE (cop0) == VECTOR_CST
8099 || TREE_CODE (cop0) == CONSTRUCTOR
8100 || TREE_CODE (cop1) == VECTOR_CST
8101 || TREE_CODE (cop1) == CONSTRUCTOR))
8103 bool insert_first_p = sel.series_p (1, 1, nelts + 1, 1);
8106 /* After canonicalizing the first elt to come from the
8107 first vector we only can insert the first elt from
8108 the first vector. */
8110 if ((ins = fold_read_from_vector (cop0, sel[0])))
8113 /* The above can fail for two-element vectors which always
8114 appear to insert the first element, so try inserting
8115 into the second lane as well. For more than two
8116 elements that's wasted time. */
8117 if (!insert_first_p || (!ins && maybe_eq (nelts, 2u)))
8119 unsigned int encoded_nelts = sel.encoding ().encoded_nelts ();
8120 for (at = 0; at < encoded_nelts; ++at)
8121 if (maybe_ne (sel[at], at))
8123 if (at < encoded_nelts
8124 && (known_eq (at + 1, nelts)
8125 || sel.series_p (at + 1, 1, at + 1, 1)))
8127 if (known_lt (poly_uint64 (sel[at]), nelts))
8128 ins = fold_read_from_vector (cop0, sel[at]);
8130 ins = fold_read_from_vector (cop1, sel[at] - nelts);
8135 /* Generate a canonical form of the selector. */
8136 if (!ins && sel.encoding () != builder)
8138 /* Some targets are deficient and fail to expand a single
8139 argument permutation while still allowing an equivalent
8140 2-argument version. */
8142 if (sel.ninputs () == 2
8143 || can_vec_perm_const_p (result_mode, op_mode, sel, false))
8144 op2 = vec_perm_indices_to_tree (TREE_TYPE (op2), sel);
8147 vec_perm_indices sel2 (builder, 2, nelts);
8148 if (can_vec_perm_const_p (result_mode, op_mode, sel2, false))
8149 op2 = vec_perm_indices_to_tree (TREE_TYPE (op2), sel2);
8151 /* Not directly supported with either encoding,
8152 so use the preferred form. */
8153 op2 = vec_perm_indices_to_tree (TREE_TYPE (op2), sel);
8155 if (!operand_equal_p (op2, oldop2, 0))
8160 (bit_insert { op0; } { ins; }
8161 { bitsize_int (at * vector_element_bits (type)); })
8163 (vec_perm { op0; } { op1; } { op2; }))))))))))))
8165 /* VEC_PERM_EXPR (v, v, mask) -> v where v contains same element. */
8167 (match vec_same_elem_p
8170 (match vec_same_elem_p
8172 (if (uniform_vector_p (@0))))
8174 (match vec_same_elem_p
8176 (if (uniform_vector_p (@0))))
8180 (vec_perm vec_same_elem_p@0 @0 @1)
8183 /* Push VEC_PERM earlier if that may help FMA perception (PR101895). */
8185 (plus:c (vec_perm:s (mult:c@0 @1 vec_same_elem_p@2) @0 @3) @4)
8186 (if (TREE_CODE (@0) == SSA_NAME && num_imm_uses (@0) == 2)
8187 (plus (mult (vec_perm @1 @1 @3) @2) @4)))
8189 (minus (vec_perm:s (mult:c@0 @1 vec_same_elem_p@2) @0 @3) @4)
8190 (if (TREE_CODE (@0) == SSA_NAME && num_imm_uses (@0) == 2)
8191 (minus (mult (vec_perm @1 @1 @3) @2) @4)))
8195 c = VEC_PERM_EXPR <a, b, VCST0>;
8196 d = VEC_PERM_EXPR <c, c, VCST1>;
8198 d = VEC_PERM_EXPR <a, b, NEW_VCST>; */
8201 (vec_perm (vec_perm@0 @1 @2 VECTOR_CST@3) @0 VECTOR_CST@4)
8202 (if (TYPE_VECTOR_SUBPARTS (type).is_constant ())
8205 machine_mode result_mode = TYPE_MODE (type);
8206 machine_mode op_mode = TYPE_MODE (TREE_TYPE (@1));
8207 int nelts = TYPE_VECTOR_SUBPARTS (type).to_constant ();
8208 vec_perm_builder builder0;
8209 vec_perm_builder builder1;
8210 vec_perm_builder builder2 (nelts, nelts, 1);
8212 (if (tree_to_vec_perm_builder (&builder0, @3)
8213 && tree_to_vec_perm_builder (&builder1, @4))
8216 vec_perm_indices sel0 (builder0, 2, nelts);
8217 vec_perm_indices sel1 (builder1, 1, nelts);
8219 for (int i = 0; i < nelts; i++)
8220 builder2.quick_push (sel0[sel1[i].to_constant ()]);
8222 vec_perm_indices sel2 (builder2, 2, nelts);
8224 tree op0 = NULL_TREE;
8225 /* If the new VEC_PERM_EXPR can't be handled but both
8226 original VEC_PERM_EXPRs can, punt.
8227 If one or both of the original VEC_PERM_EXPRs can't be
8228 handled and the new one can't be either, don't increase
8229 number of VEC_PERM_EXPRs that can't be handled. */
8230 if (can_vec_perm_const_p (result_mode, op_mode, sel2, false)
8232 ? (!can_vec_perm_const_p (result_mode, op_mode, sel0, false)
8233 || !can_vec_perm_const_p (result_mode, op_mode, sel1, false))
8234 : !can_vec_perm_const_p (result_mode, op_mode, sel1, false)))
8235 op0 = vec_perm_indices_to_tree (TREE_TYPE (@4), sel2);
8238 (vec_perm @1 @2 { op0; })))))))
8241 /* Match count trailing zeroes for simplify_count_trailing_zeroes in fwprop.
8242 The canonical form is array[((x & -x) * C) >> SHIFT] where C is a magic
8243 constant which when multiplied by a power of 2 contains a unique value
8244 in the top 5 or 6 bits. This is then indexed into a table which maps it
8245 to the number of trailing zeroes. */
8246 (match (ctz_table_index @1 @2 @3)
8247 (rshift (mult (bit_and:c (negate @1) @1) INTEGER_CST@2) INTEGER_CST@3))
8249 (match (cond_expr_convert_p @0 @2 @3 @6)
8250 (cond (simple_comparison@6 @0 @1) (convert@4 @2) (convert@5 @3))
8251 (if (INTEGRAL_TYPE_P (type)
8252 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
8253 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
8254 && INTEGRAL_TYPE_P (TREE_TYPE (@3))
8255 && TYPE_PRECISION (type) != TYPE_PRECISION (TREE_TYPE (@0))
8256 && TYPE_PRECISION (TREE_TYPE (@0))
8257 == TYPE_PRECISION (TREE_TYPE (@2))
8258 && TYPE_PRECISION (TREE_TYPE (@0))
8259 == TYPE_PRECISION (TREE_TYPE (@3))
8260 /* For vect_recog_cond_expr_convert_pattern, @2 and @3 can differ in
8261 signess when convert is truncation, but not ok for extension since
8262 it's sign_extend vs zero_extend. */
8263 && (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (type)
8264 || (TYPE_UNSIGNED (TREE_TYPE (@2))
8265 == TYPE_UNSIGNED (TREE_TYPE (@3))))
8267 && single_use (@5))))
8269 (for bit_op (bit_and bit_ior bit_xor)
8270 (match (bitwise_induction_p @0 @2 @3)
8272 (nop_convert1? (bit_not2?@0 (convert3? (lshift integer_onep@1 @2))))
8275 (match (bitwise_induction_p @0 @2 @3)
8277 (nop_convert1? (bit_xor@0 (convert2? (lshift integer_onep@1 @2)) @3))))
8279 /* n - (((n > C1) ? n : C1) & -C2) -> n & C1 for unsigned case.
8280 n - (((n > C1) ? n : C1) & -C2) -> (n <= C1) ? n : (n & C1) for signed case. */
8282 (minus @0 (bit_and (max @0 INTEGER_CST@1) INTEGER_CST@2))
8283 (with { auto i = wi::neg (wi::to_wide (@2)); }
8284 /* Check if -C2 is a power of 2 and C1 = -C2 - 1. */
8285 (if (wi::popcount (i) == 1
8286 && (wi::to_wide (@1)) == (i - 1))
8287 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
8289 (cond (le @0 @1) @0 (bit_and @0 @1))))))
8291 /* -x & 1 -> x & 1. */
8293 (bit_and (negate @0) integer_onep@1)
8294 (if (!TYPE_OVERFLOW_SANITIZED (type))
8298 c1 = VEC_PERM_EXPR (a, a, mask)
8299 c2 = VEC_PERM_EXPR (b, b, mask)
8303 c3 = VEC_PERM_EXPR (c, c, mask)
8304 For all integer non-div operations. */
8305 (for op (plus minus mult bit_and bit_ior bit_xor
8308 (op (vec_perm @0 @0 @2) (vec_perm @1 @1 @2))
8309 (if (VECTOR_INTEGER_TYPE_P (type))
8310 (vec_perm (op@3 @0 @1) @3 @2))))
8312 /* Similar for float arithmetic when permutation constant covers
8313 all vector elements. */
8314 (for op (plus minus mult)
8316 (op (vec_perm @0 @0 VECTOR_CST@2) (vec_perm @1 @1 VECTOR_CST@2))
8317 (if (VECTOR_FLOAT_TYPE_P (type)
8318 && TYPE_VECTOR_SUBPARTS (type).is_constant ())
8322 vec_perm_builder builder;
8323 bool full_perm_p = false;
8324 if (tree_to_vec_perm_builder (&builder, perm_cst))
8326 unsigned HOST_WIDE_INT nelts;
8328 nelts = TYPE_VECTOR_SUBPARTS (type).to_constant ();
8329 /* Create a vec_perm_indices for the VECTOR_CST. */
8330 vec_perm_indices sel (builder, 1, nelts);
8332 /* Check if perm indices covers all vector elements. */
8333 if (sel.encoding ().encoded_full_vector_p ())
8335 auto_sbitmap seen (nelts);
8336 bitmap_clear (seen);
8338 unsigned HOST_WIDE_INT count = 0, i;
8340 for (i = 0; i < nelts; i++)
8342 if (!bitmap_set_bit (seen, sel[i].to_constant ()))
8346 full_perm_p = count == nelts;
8351 (vec_perm (op@3 @0 @1) @3 @2))))))