| blob | c48fe2d6bf20d84fc349259e8a370c7acc4cda9a |
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
14 version.
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
19 for more details.
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. */
27 (define_predicates
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
31 zerop
32 initializer_each_zero_or_onep
33 CONSTANT_CLASS_P
34 tree_expr_nonnegative_p
35 tree_expr_nonzero_p
36 integer_valued_real_p
37 integer_pow2p
38 uniform_integer_cst_p
39 HONOR_NANS
40 uniform_vector_p
41 expand_vec_cmp_expr_p
42 bitmask_inv_cst_vector_p)
44 /* Operator lists. */
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 \
69 BUILT_IN_L##FN##F \
70 BUILT_IN_LL##FN##F) \
71 (define_operator_list X##FN BUILT_IN_I##FN \
72 BUILT_IN_L##FN \
73 BUILT_IN_LL##FN) \
74 (define_operator_list X##FN##L BUILT_IN_I##FN##L \
75 BUILT_IN_L##FN##L \
76 BUILT_IN_LL##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
85 negate)
86 (define_operator_list COND_UNARY
87 IFN_COND_NEG)
89 /* Binary operations and their associated IFN_COND_* function. */
90 (define_operator_list UNCOND_BINARY
91 plus minus
92 mult trunc_div trunc_mod rdiv
93 min max
94 IFN_FMIN IFN_FMAX
95 bit_and bit_ior bit_xor
96 lshift rshift)
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)
147 (convert @0)
148 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))))
149 (match (nop_convert @0)
150 (view_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)))))
166 #if GIMPLE
167 /* Optimize (X + (X >> (prec - 1))) ^ (X >> (prec - 1)) into abs (X). */
168 (simplify
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)
173 (abs @0)))
174 #endif
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)
180 (simplify
181 (op @0 integer_zerop)
182 (non_lvalue @0)))
184 /* 0 +p index -> (type)index */
185 (simplify
186 (pointer_plus integer_zerop @1)
187 (non_lvalue (convert @1)))
189 /* ptr - 0 -> (type)ptr */
190 (simplify
191 (pointer_diff @0 integer_zerop)
192 (convert @0))
194 /* See if ARG1 is zero and X + ARG1 reduces to X.
195 Likewise if the operands are reversed. */
196 (simplify
197 (plus:c @0 real_zerop@1)
198 (if (fold_real_zero_addition_p (type, @0, @1, 0))
199 (non_lvalue @0)))
201 /* See if ARG1 is zero and X - ARG1 reduces to X. */
202 (simplify
203 (minus @0 real_zerop@1)
204 (if (fold_real_zero_addition_p (type, @0, @1, 1))
205 (non_lvalue @0)))
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)
215 (simplify
216 (outer_op (inner_op@3 @0 REAL_CST@1) REAL_CST@2)
217 (if (real_zerop (@1)
218 && real_zerop (@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)));
222 bool outer_plus
223 = ((outer_op == PLUS_EXPR)
224 ^ REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@2))); }
225 (if (outer_plus && !inner_plus)
226 (outer_op @0 @2)
227 @3))))))
229 /* Simplify x - x.
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
234 is volatile. */
235 (simplify
236 (minus @0 @0)
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); }))
243 (simplify
244 (pointer_diff @@0 @0)
245 { build_zero_cst (type); })
247 (simplify
248 (mult @0 integer_zerop@1)
249 @1)
251 /* -x == x -> x == 0 */
252 (for cmp (eq ne)
253 (simplify
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. */
264 (simplify
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)))
269 @1))
271 /* In IEEE floating point, x*1 is not equivalent to x for snans.
272 Likewise for complex arithmetic with signed zeros. */
273 (simplify
274 (mult @0 real_onep)
275 (if (!tree_expr_maybe_signaling_nan_p (@0)
276 && (!HONOR_SIGNED_ZEROS (type)
277 || !COMPLEX_FLOAT_TYPE_P (type)))
278 (non_lvalue @0)))
280 /* Transform x * -1.0 into -x. */
281 (simplify
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)))
286 (negate @0)))
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. */
290 (simplify
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; }
296 (if (itype
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). */
311 (simplify
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))
314 (outp (abs @0))))
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). */
319 (simplify
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))
322 (outn (abs @0)))))
324 /* Transform X * copysign (1.0, X) into abs(X). */
325 (simplify
326 (mult:c @0 (COPYSIGN_ALL real_onep @0))
327 (if (!tree_expr_maybe_nan_p (@0) && !HONOR_SIGNED_ZEROS (type))
328 (abs @0)))
330 /* Transform X * copysign (1.0, -X) into -abs(X). */
331 (simplify
332 (mult:c @0 (COPYSIGN_ALL real_onep (negate @0)))
333 (if (!tree_expr_maybe_nan_p (@0) && !HONOR_SIGNED_ZEROS (type))
334 (negate (abs @0))))
336 /* Transform copysign (CST, X) into copysign (ABS(CST), X). */
337 (simplify
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. */
343 (simplify
344 (plus:c (max @0 integer_zerop) (max (negate @0) integer_zerop))
345 (abs @0))
347 /* X * 1, X / 1 -> X. */
348 (for op (mult trunc_div ceil_div floor_div round_div exact_div)
349 (simplify
350 (op @0 integer_onep)
351 (non_lvalue @0)))
353 /* (A / (1 << B)) -> (A >> B).
354 Only for unsigned A. For signed A, this would not preserve rounding
355 toward zero.
356 For example: (-1 / ( 1 << B)) != -1 >> B.
357 Also handle widening conversions, like:
358 (A / (unsigned long long) (1U << B)) -> (A >> B)
359 or
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. */
365 (simplify
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,
379 true,
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))
385 (rshift @0 @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. */
392 (simplify
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))
396 @0))
397 /* X / -1 is -X. */
398 (simplify
399 (div @0 integer_minus_onep@1)
400 (if (!TYPE_UNSIGNED (type))
401 (negate @0)))
402 /* X / bool_range_Y is X. */
403 (simplify
404 (div @0 SSA_NAME@1)
405 (if (INTEGRAL_TYPE_P (type)
406 && ssa_name_has_boolean_range (@1)
407 && !flag_non_call_exceptions)
408 @0))
409 /* X / X is one. */
410 (simplify
411 (div @0 @0)
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. */
419 (simplify
420 (div:C @0 (abs @0))
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); })))
427 /* X / -X is -1. */
428 (simplify
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)
441 (simplify
442 (floor_divmod @0 @1)
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
451 elsewhere. */
452 (simplify
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)
468 (simplify
469 (div (div@3 @0 INTEGER_CST@1) INTEGER_CST@2)
470 (with {
471 wi::overflow_type overflow;
472 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@2),
473 TYPE_SIGN (type), &overflow);
474 }
475 (if (div == EXACT_DIV_EXPR
476 || optimize_successive_divisions_p (@2, @3))
477 (if (!overflow)
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. */
485 (simplify
486 (mult (mult @0 INTEGER_CST@1) INTEGER_CST@2)
487 (with {
488 wi::overflow_type overflow;
489 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@2),
490 TYPE_SIGN (type), &overflow);
491 }
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. */
499 (simplify
500 (mult (plus:s (mult:s@4 @0 INTEGER_CST@1) INTEGER_CST@2) INTEGER_CST@3)
501 (with {
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))
509 {
510 #if GIMPLE
511 value_range vr0;
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)
515 {
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)
521 {
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)
525 overflowed = false;
526 }
527 }
528 #endif
529 }
530 else
531 overflowed = false;
532 }
533 /* Skip folding on overflow. */
534 (if (!overflowed)
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. */
539 (simplify
540 (plus (mult:s (plus:s @0 INTEGER_CST@1) INTEGER_CST@2) INTEGER_CST@3)
541 (with {
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))
550 {
551 #if GIMPLE
552 value_range vr0;
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)
556 {
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)
562 {
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)
566 overflowed = false;
567 }
568 }
569 #endif
570 }
571 else
572 overflowed = false;
573 }
574 /* Skip folding on overflow. */
575 (if (!overflowed)
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. */
580 (simplify
581 (rdiv @0 @0)
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. */
589 (simplify
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) */
597 (simplify
598 (rdiv:C (convert? @0) (convert? (abs @0)))
599 (if (SCALAR_FLOAT_TYPE_P (type)
600 && ! HONOR_NANS (type)
601 && ! HONOR_INFINITIES (type))
602 (switch
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. */
611 (simplify
612 (rdiv @0 real_onep)
613 (if (!tree_expr_maybe_signaling_nan_p (@0))
614 (non_lvalue @0)))
616 /* In IEEE floating point, x/-1 is not equivalent to -x for snans. */
617 (simplify
618 (rdiv @0 real_minus_onep)
619 (if (!tree_expr_maybe_signaling_nan_p (@0))
620 (negate @0)))
622 (if (flag_reciprocal_math)
623 /* Convert (A/B)/C to A/(B*C). */
624 (simplify
625 (rdiv (rdiv:s @0 @1) @2)
626 (rdiv @0 (mult @1 @2)))
628 /* Canonicalize x / (C1 * y) to (x * C2) / y. */
629 (simplify
630 (rdiv @0 (mult:s @1 REAL_CST@2))
631 (with
632 { tree tem = const_binop (RDIV_EXPR, type, build_one_cst (type), @2); }
633 (if (tem)
634 (rdiv (mult @0 { tem; } ) @1))))
636 /* Convert A/(B/C) to (A/B)*C */
637 (simplify
638 (rdiv @0 (rdiv:s @1 @2))
639 (mult (rdiv @0 @1) @2)))
641 /* Simplify x / (- y) to -x / y. */
642 (simplify
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)
650 neg_op (gt ge lt le)
651 (simplify
652 (op (rdiv REAL_CST@0 @1) real_zerop@2)
653 (if (!HONOR_SIGNED_ZEROS (@1) && !HONOR_INFINITIES (@1))
654 (switch
655 (if (real_less (&dconst0, TREE_REAL_CST_PTR (@0)))
656 (op @1 @2))
657 /* For C < 0, use the inverted operator. */
658 (if (real_less (TREE_REAL_CST_PTR (@0), &dconst0))
659 (neg_op @1 @2)))))))
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)
663 (simplify
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)
669 (rshift (convert @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)
679 (simplify
680 (rdiv @0 cst@1)
681 (if (optimize)
682 (if (flag_reciprocal_math
683 && !real_zerop (@1))
684 (with
685 { tree tem = const_binop (RDIV_EXPR, type, build_one_cst (type), @1); }
686 (if (tem)
687 (mult @0 { tem; } )))
688 (if (cst != COMPLEX_CST)
689 (with { tree inverse = exact_inverse (type, @1); }
690 (if (inverse)
691 (mult @0 { inverse; } ))))))))
693 (for mod (ceil_mod floor_mod round_mod trunc_mod)
694 /* 0 % X is always zero. */
695 (simplify
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))
699 @0))
700 /* X % 1 is always zero. */
701 (simplify
702 (mod @0 integer_onep)
703 { build_zero_cst (type); })
704 /* X % -1 is zero. */
705 (simplify
706 (mod @0 integer_minus_onep@1)
707 (if (!TYPE_UNSIGNED (type))
708 { build_zero_cst (type); }))
709 /* X % X is zero. */
710 (simplify
711 (mod @0 @0)
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. */
716 (simplify
717 (mod (mod@2 @0 @1) @1)
718 @2)
719 /* From extract_muldiv_1: (X * C1) % C2 is zero if C1 is a multiple of C2. */
720 (simplify
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),
725 TYPE_SIGN (type)))
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. */
729 (for cmp (eq ne)
730 (simplify
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. */
737 (simplify
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. */
748 (simplify
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
759 (TREE_TYPE (@1))))))
760 (trunc_mod @0 (convert @1))))
762 /* X - (X / Y) * Y is the same as X % Y. */
763 (simplify
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 */
769 (simplify
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
781 be UB. */
782 (match (power_of_two_cand @1)
783 INTEGER_CST@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)
788 (simplify
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),
792 1); }))))))
793 (simplify
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. */
813 (simplify
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. */
822 (simplify
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)
829 (simplify
830 (div (mult:c @0 @1) @1)
831 (if (ANY_INTEGRAL_TYPE_P (type))
832 (if (TYPE_OVERFLOW_UNDEFINED (type))
833 @0
834 #if GIMPLE
835 (with
836 {
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)
844 {
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)
855 {
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)
859 overflowed = false;
860 }
861 }
862 }
863 (if (!overflowed)
864 @0))
865 #endif
866 ))))
868 (for op (negate abs)
869 /* Simplify cos(-x) and cos(|x|) -> cos(x). Similarly for cosh. */
870 (for coss (COS COSH)
871 (simplify
872 (coss (op @0))
873 (coss @0)))
874 /* Simplify pow(-x, y) and pow(|x|,y) -> pow(x,y) if y is an even integer. */
875 (for pows (POW)
876 (simplify
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)
880 (pows @0 @1)))))
881 /* Likewise for powi. */
882 (for pows (POWI)
883 (simplify
884 (pows (op @0) INTEGER_CST@1)
885 (if ((wi::to_wide (@1) & 1) == 0)
886 (pows @0 @1))))
887 /* Strip negate and abs from both operands of hypot. */
888 (for hypots (HYPOT)
889 (simplify
890 (hypots (op @0) @1)
891 (hypots @0 @1))
892 (simplify
893 (hypots @0 (op @1))
894 (hypots @0 @1)))
895 /* copysign(-x, y) and copysign(abs(x), y) -> copysign(x, y). */
896 (for copysigns (COPYSIGN_ALL)
897 (simplify
898 (copysigns (op @0) @1)
899 (copysigns @0 @1))))
901 /* abs(x)*abs(x) -> x*x. Should be valid for all types. */
902 (simplify
903 (mult (abs@1 @0) @1)
904 (mult @0 @0))
906 /* Convert absu(x)*absu(x) -> x*x. */
907 (simplify
908 (mult (absu@1 @0) @1)
909 (mult (convert@2 @0) @2))
911 /* cos(copysign(x, y)) -> cos(x). Similarly for cosh. */
912 (for coss (COS COSH)
913 copysigns (COPYSIGN)
914 (simplify
915 (coss (copysigns @0 @1))
916 (coss @0)))
918 /* pow(copysign(x, y), z) -> pow(x, z) if z is an even integer. */
919 (for pows (POW)
920 copysigns (COPYSIGN)
921 (simplify
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)
925 (pows @0 @1)))))
926 /* Likewise for powi. */
927 (for pows (POWI)
928 copysigns (COPYSIGN)
929 (simplify
930 (pows (copysigns @0 @2) INTEGER_CST@1)
931 (if ((wi::to_wide (@1) & 1) == 0)
932 (pows @0 @1))))
934 (for hypots (HYPOT)
935 copysigns (COPYSIGN)
936 /* hypot(copysign(x, y), z) -> hypot(x, z). */
937 (simplify
938 (hypots (copysigns @0 @1) @2)
939 (hypots @0 @2))
940 /* hypot(x, copysign(y, z)) -> hypot(x, y). */
941 (simplify
942 (hypots @0 (copysigns @1 @2))
943 (hypots @0 @1)))
945 /* copysign(x, CST) -> [-]abs (x). */
946 (for copysigns (COPYSIGN_ALL)
947 (simplify
948 (copysigns @0 REAL_CST@1)
949 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
950 (negate (abs @0))
951 (abs @0))))
953 /* copysign(copysign(x, y), z) -> copysign(x, z). */
954 (for copysigns (COPYSIGN_ALL)
955 (simplify
956 (copysigns (copysigns @0 @1) @2)
957 (copysigns @0 @2)))
959 /* copysign(x,y)*copysign(x,y) -> x*x. */
960 (for copysigns (COPYSIGN_ALL)
961 (simplify
962 (mult (copysigns@2 @0 @1) @2)
963 (mult @0 @0)))
965 /* ccos(-x) -> ccos(x). Similarly for ccosh. */
966 (for ccoss (CCOS CCOSH)
967 (simplify
968 (ccoss (negate @0))
969 (ccoss @0)))
971 /* cabs(-x) and cos(conj(x)) -> cabs(x). */
972 (for ops (conj negate)
973 (for cabss (CABS)
974 (simplify
975 (cabss (ops @0))
976 (cabss @0))))
978 /* Fold (a * (1 << b)) into (a << b) */
979 (simplify
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)))
983 (lshift @0 @2)))
985 /* Shifts by constants distribute over several binary operations,
986 hence (X << C) + (Y << C) can be simplified to (X + Y) << C. */
987 (for op (plus minus)
988 (simplify
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)
996 (simplify
997 (op (lshift:s @0 @1) (lshift:s @2 @1))
998 (if (INTEGRAL_TYPE_P (type))
999 (lshift (op @0 @2) @1)))
1000 (simplify
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). */
1007 (simplify
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)
1011 && single_use (@1))
1012 (if (TYPE_UNSIGNED (type))
1013 (rshift (lshift @0 @2) @3)
1014 (with
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. */
1019 (simplify
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)
1030 (simplify
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; }
1038 (switch
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. */
1062 (simplify
1063 (mult (rdiv@3 REAL_CST@0 @1) REAL_CST@2)
1064 (if (flag_associative_math
1065 && single_use (@3))
1066 (with
1067 { tree tem = const_binop (MULT_EXPR, type, @0, @2); }
1068 (if (tem)
1069 (rdiv { tem; } @1)))))
1071 /* Simplify ~X & X as zero. */
1072 (simplify
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); */
1077 (simplify
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)
1083 cmp (eq ne)
1084 /* PR35691: Transform
1085 (x == 0 & y == 0) -> (x | typeof(x)(y)) == 0.
1086 (x != 0 | y != 0) -> (x | typeof(x)(y)) != 0. */
1087 (simplify
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)))
1093 /* Transform:
1094 (x == -1 & y == -1) -> (x & typeof(x)(y)) == -1.
1095 (x != -1 | y != -1) -> (x & typeof(x)(y)) != -1. */
1096 (simplify
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. */
1104 (simplify
1105 (minus (bit_and:cs @0 (bit_not @1)) (bit_and:cs @0 @1))
1106 (minus (bit_xor @0 @1) @1))
1107 (simplify
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). */
1113 (simplify
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)
1119 (simplify
1120 (op (bit_and:c @0 (bit_not @1)) (bit_and:c (bit_not @0) @1))
1121 (bit_xor @0 @1))
1122 (simplify
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))
1125 (bit_xor @0 @1))))
1127 /* PR53979: Transform ((a ^ b) | a) -> (a | b) */
1128 (simplify
1129 (bit_ior:c (bit_xor:c @0 @1) @0)
1130 (bit_ior @0 @1))
1132 /* (a & ~b) | (a ^ b) --> a ^ b */
1133 (simplify
1134 (bit_ior:c (bit_and:c @0 (bit_not @1)) (bit_xor:c@2 @0 @1))
1135 @2)
1137 /* (a & ~b) ^ ~a --> ~(a & b) */
1138 (simplify
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) */
1143 (simplify
1144 (bit_xor:c (bit_and:cs (bit_not @0) @1) @0)
1145 (bit_ior @0 @1))
1147 /* (a | b) & ~(a ^ b) --> a & b */
1148 (simplify
1149 (bit_and:c (bit_ior @0 @1) (bit_not (bit_xor:c @0 @1)))
1150 (bit_and @0 @1))
1152 /* a | ~(a ^ b) --> a | ~b */
1153 (simplify
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)
1159 (simplify
1160 (bit_ior:c (bit_ior@2 @0 @1) (op:c @0 @1))
1161 @2))
1163 /* (a & b) | ~(a ^ b) --> ~(a ^ b) */
1164 (simplify
1165 (bit_ior:c (bit_and:c @0 @1) (bit_not@2 (bit_xor @0 @1)))
1166 @2)
1168 /* ~(~a & b) --> a | ~b */
1169 (simplify
1170 (bit_not (bit_and:cs (bit_not @0) @1))
1171 (bit_ior @0 (bit_not @1)))
1173 /* ~(~a | b) --> a & ~b */
1174 (simplify
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 */
1179 (simplify
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 */
1184 (simplify
1185 (bit_ior:c (bit_xor:c@3 @0 @1) (bit_xor:c (bit_xor:c @1 @2) @0))
1186 (bit_ior @3 @2))
1188 /* (~X | C) ^ D -> (X | C) ^ (~D ^ C) if (~D ^ C) can be simplified. */
1189 (simplify
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. */
1194 (simplify
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. */
1199 (simplify
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)
1203 (bit_xor @0 @1)))
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)
1214 (simplify
1215 (bit_and (op:s (bitop:s@0 @3 INTEGER_CST@4) @1) INTEGER_CST@2)
1216 (with
1217 { tree pmop[2];
1218 tree utype = fold_bit_and_mask (TREE_TYPE (@0), @2, op, @0, bitop,
1219 @3, @4, @1, ERROR_MARK, NULL_TREE,
1220 NULL_TREE, pmop); }
1221 (if (utype)
1222 (convert (bit_and (op (convert:utype { pmop[0]; })
1223 (convert:utype { pmop[1]; }))
1224 (convert:utype @2))))))
1225 (simplify
1226 (bit_and (op:s @0 (bitop:s@1 @3 INTEGER_CST@4)) INTEGER_CST@2)
1227 (with
1228 { tree pmop[2];
1229 tree utype = fold_bit_and_mask (TREE_TYPE (@0), @2, op, @0, ERROR_MARK,
1230 NULL_TREE, NULL_TREE, @1, bitop, @3,
1231 @4, pmop); }
1232 (if (utype)
1233 (convert (bit_and (op (convert:utype { pmop[0]; })
1234 (convert:utype { pmop[1]; }))
1235 (convert:utype @2)))))))
1236 (simplify
1237 (bit_and (op:s @0 @1) INTEGER_CST@2)
1238 (with
1239 { tree pmop[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); }
1243 (if (utype)
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)
1248 (simplify
1249 (bit_and (negate:s (bitop:s@0 @2 INTEGER_CST@3)) INTEGER_CST@1)
1250 (with
1251 { tree pmop[2];
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); }
1255 (if (utype)
1256 (convert (bit_and (negate (convert:utype { pmop[0]; }))
1257 (convert:utype @1)))))))
1259 /* X % Y is smaller than Y. */
1260 (for cmp (lt ge)
1261 (simplify
1262 (cmp (trunc_mod @0 @1) @1)
1263 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
1264 { constant_boolean_node (cmp == LT_EXPR, type); })))
1265 (for cmp (gt le)
1266 (simplify
1267 (cmp @1 (trunc_mod @0 @1))
1268 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
1269 { constant_boolean_node (cmp == GT_EXPR, type); })))
1271 /* x | ~0 -> ~0 */
1272 (simplify
1273 (bit_ior @0 integer_all_onesp@1)
1274 @1)
1276 /* x | 0 -> x */
1277 (simplify
1278 (bit_ior @0 integer_zerop)
1279 @0)
1281 /* x & 0 -> 0 */
1282 (simplify
1283 (bit_and @0 integer_zerop@1)
1284 @1)
1286 /* ~x | x -> -1 */
1287 /* ~x ^ x -> -1 */
1288 (for op (bit_ior bit_xor)
1289 (simplify
1290 (op:c (convert? @0) (convert? (bit_not @0)))
1291 (convert { build_all_ones_cst (TREE_TYPE (@0)); })))
1293 /* x ^ x -> 0 */
1294 (simplify
1295 (bit_xor @0 @0)
1296 { build_zero_cst (type); })
1298 /* Canonicalize X ^ ~0 to ~X. */
1299 (simplify
1300 (bit_xor @0 integer_all_onesp@1)
1301 (bit_not @0))
1303 /* x & ~0 -> x */
1304 (simplify
1305 (bit_and @0 integer_all_onesp)
1306 (non_lvalue @0))
1308 /* x & x -> x, x | x -> x */
1309 (for bitop (bit_and bit_ior)
1310 (simplify
1311 (bitop @0 @0)
1312 (non_lvalue @0)))
1314 /* x & C -> x if we know that x & ~C == 0. */
1315 #if GIMPLE
1316 (simplify
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)
1320 @0))
1321 #endif
1323 /* ~(~X - Y) -> X + Y and ~(~X + Y) -> X - Y. */
1324 (simplify
1325 (bit_not (minus (bit_not @0) @1))
1326 (plus @0 @1))
1327 (simplify
1328 (bit_not (plus:c (bit_not @0) @1))
1329 (minus @0 @1))
1330 /* (~X - ~Y) -> Y - X. */
1331 (simplify
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. */
1338 (simplify
1339 (bit_not (minus:s @0 @1))
1340 (plus (bit_not @0) @1))
1341 (simplify
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); })))
1349 #if GIMPLE
1350 /* ~X + Y -> (Y - X) - 1. */
1351 (simplify
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),
1361 SIGNED))
1362 (minus (plus @1 { build_minus_one_cst (type); }) @0))))
1363 #endif
1365 /* ~(X >> Y) -> ~X >> Y if ~X can be simplified. */
1366 (simplify
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 */
1378 (simplify
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)
1385 (simplify
1386 (bitop:c @0 (bit_not (bitop:cs @0 @1)))
1387 (bitop @0 (bit_not @1))))
1389 /* (~x & y) | ~(x | y) -> ~x */
1390 (simplify
1391 (bit_ior:c (bit_and:c (bit_not@2 @0) @1) (bit_not (bit_ior:c @0 @1)))
1392 @2)
1394 /* (x | y) ^ (x | ~y) -> ~x */
1395 (simplify
1396 (bit_xor:c (bit_ior:c @0 @1) (bit_ior:c @0 (bit_not @1)))
1397 (bit_not @0))
1399 /* (x & y) | ~(x | y) -> ~(x ^ y) */
1400 (simplify
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 */
1405 (simplify
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) */
1410 (simplify
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)
1418 (simplify
1419 (bitop:c (rbitop:c @0 @1) (bit_not@2 @0))
1420 (bitop @1 @2)))
1422 /* (x & y) ^ (x | y) -> x ^ y */
1423 (simplify
1424 (bit_xor:c (bit_and @0 @1) (bit_ior @0 @1))
1425 (bit_xor @0 @1))
1427 /* (x ^ y) ^ (x | y) -> x & y */
1428 (simplify
1429 (bit_xor:c (bit_xor @0 @1) (bit_ior @0 @1))
1430 (bit_and @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)
1436 (simplify
1437 (op:c (bit_and @0 @1) (bit_xor @0 @1))
1438 (bit_ior @0 @1)))
1440 /* (x & y) + (x | y) -> x + y */
1441 (simplify
1442 (plus:c (bit_and @0 @1) (bit_ior @0 @1))
1443 (plus @0 @1))
1445 /* (x + y) - (x | y) -> x & y */
1446 (simplify
1447 (minus (plus @0 @1) (bit_ior @0 @1))
1448 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
1449 && !TYPE_SATURATING (type))
1450 (bit_and @0 @1)))
1452 /* (x + y) - (x & y) -> x | y */
1453 (simplify
1454 (minus (plus @0 @1) (bit_and @0 @1))
1455 (if (!TYPE_OVERFLOW_SANITIZED (type) && !TYPE_OVERFLOW_TRAPS (type)
1456 && !TYPE_SATURATING (type))
1457 (bit_ior @0 @1)))
1459 /* (x | y) - y -> (x & ~y) */
1460 (simplify
1461 (minus (bit_ior:cs @0 @1) @1)
1462 (bit_and @0 (bit_not @1)))
1464 /* (x | y) - (x ^ y) -> x & y */
1465 (simplify
1466 (minus (bit_ior @0 @1) (bit_xor @0 @1))
1467 (bit_and @0 @1))
1469 /* (x | y) - (x & y) -> x ^ y */
1470 (simplify
1471 (minus (bit_ior @0 @1) (bit_and @0 @1))
1472 (bit_xor @0 @1))
1474 /* (x | y) & ~(x & y) -> x ^ y */
1475 (simplify
1476 (bit_and:c (bit_ior @0 @1) (bit_not (bit_and @0 @1)))
1477 (bit_xor @0 @1))
1479 /* (x | y) & (~x ^ y) -> x & y */
1480 (simplify
1481 (bit_and:c (bit_ior:c @0 @1) (bit_xor:c @1 (bit_not @0)))
1482 (bit_and @0 @1))
1484 /* (~x | y) & (x | ~y) -> ~(x ^ y) */
1485 (simplify
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 */
1490 (simplify
1491 (bit_xor (bit_ior:c (bit_not @0) @1) (bit_ior:c @0 (bit_not @1)))
1492 (bit_xor @0 @1))
1494 /* ((x & y) - (x | y)) - 1 -> ~(x ^ y) */
1495 (simplify
1496 (plus (nop_convert1? (minus@2 (nop_convert2? (bit_and:c @0 @1))
1497 (nop_convert2? (bit_ior @0 @1))))
1498 integer_all_onesp)
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)))))
1504 (simplify
1505 (minus (nop_convert1? (plus@2 (nop_convert2? (bit_and:c @0 @1))
1506 integer_all_onesp))
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)))))
1513 (simplify
1514 (minus (nop_convert1? (bit_and @0 @1))
1515 (nop_convert2? (plus@2 (nop_convert3? (bit_ior:c @0 @1))
1516 integer_onep)))
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)
1527 (simplify
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
1536 simplifications. */
1537 (for op (bit_xor plus)
1538 (simplify
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*/
1547 (simplify
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. */
1553 (simplify
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. */
1560 (simplify
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)
1568 (simplify
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)
1580 (simplify
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)
1590 (simplify
1591 (op:c (convert1?@2 (op:c @0 @@1)) (convert2? @1))
1592 @2))
1593 /* (X ^ Y) ^ Y -> X */
1594 (simplify
1595 (bit_xor:c (convert1? (bit_xor:c @0 @@1)) (convert2? @1))
1596 (convert @0))
1597 /* (X & Y) & (X & Z) -> (X & Y) & Z
1598 (X | Y) | (X | Z) -> (X | Y) | Z */
1599 (for op (bit_and bit_ior)
1600 (simplify
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 */
1609 (simplify
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). */
1617 (simplify
1618 (abs (abs@1 @0))
1619 @1)
1621 (simplify
1622 (absu (convert@2 (absu@1 @0)))
1623 (if (tree_nop_conversion_p (TREE_TYPE (@2), TREE_TYPE (@1)))
1624 @1))
1626 /* Convert abs[u] (-X) -> abs[u] (X). */
1627 (simplify
1628 (abs (negate @0))
1629 (abs @0))
1631 (simplify
1632 (absu (negate @0))
1633 (absu @0))
1635 /* Convert abs[u] (X) where X is nonnegative -> (X). */
1636 (simplify
1637 (abs tree_expr_nonnegative_p@0)
1638 @0)
1640 (simplify
1641 (absu tree_expr_nonnegative_p@0)
1642 (convert @0))
1644 /* Simplify (-(X < 0) | 1) * X into abs (X) or absu(X). */
1645 (simplify
1646 (mult:c (nop_convert1?
1647 (bit_ior (nop_convert2? (negate (convert? (lt @0 integer_zerop))))
1648 integer_onep))
1649 (nop_convert3? @0))
1650 (if (INTEGRAL_TYPE_P (type)
1651 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
1652 && !TYPE_UNSIGNED (TREE_TYPE (@0)))
1653 (if (TYPE_UNSIGNED (type))
1654 (absu @0)
1655 (abs @0)
1656 )
1657 )
1658 )
1660 /* A few cases of fold-const.cc negate_expr_p predicate. */
1661 (match negate_expr_p
1662 INTEGER_CST
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
1668 FIXED_CST)
1669 (match negate_expr_p
1670 (negate @0)
1671 (if (!TYPE_OVERFLOW_SANITIZED (type))))
1672 (match negate_expr_p
1673 REAL_CST
1674 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (t)))))
1675 /* VECTOR_CST handling of non-wrapping types would recurse in unsupported
1676 ways. */
1677 (match negate_expr_p
1678 VECTOR_CST
1679 (if (FLOAT_TYPE_P (TREE_TYPE (type)) || TYPE_OVERFLOW_WRAPS (type))))
1680 (match negate_expr_p
1681 (minus @0 @1)
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 */
1688 (simplify
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. */
1695 (simplify
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. */
1702 (simplify
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)))
1708 (minus @1 @0)))
1709 (simplify
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. */
1715 (simplify
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). */
1721 (simplify
1722 (negate (mult:c@0 @1 negate_expr_p@2))
1723 (if (! TYPE_UNSIGNED (type)
1724 && ! HONOR_SIGN_DEPENDENT_ROUNDING (type)
1725 && single_use (@0))
1726 (mult @1 (negate @2))))
1728 (simplify
1729 (negate (rdiv@0 @1 negate_expr_p@2))
1730 (if (! HONOR_SIGN_DEPENDENT_ROUNDING (type)
1731 && single_use (@0))
1732 (rdiv @1 (negate @2))))
1734 (simplify
1735 (negate (rdiv@0 negate_expr_p@1 @2))
1736 (if (! HONOR_SIGN_DEPENDENT_ROUNDING (type)
1737 && single_use (@0))
1738 (rdiv (negate @1) @2)))
1740 /* Fold -((int)x >> (prec - 1)) into (unsigned)x >> (prec - 1). */
1741 (simplify
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))
1753 when profitable.
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)
1759 (simplify
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
1784 mode. */
1785 || GET_MODE_CLASS (TYPE_MODE (type)) != MODE_INT
1786 /* Or if the precision of TO is not the same as the precision
1787 of its mode. */
1788 || !type_has_mode_precision_p (type)
1789 /* In GIMPLE, getting rid of 2 conversions for one new results
1790 in smaller IL. */
1791 || (GIMPLE
1792 && TREE_CODE (@1) != INTEGER_CST
1793 && tree_nop_conversion_p (type, TREE_TYPE (@0))
1794 && single_use (@2)
1795 && single_use (@3))))
1796 (convert (bitop @0 (convert @1)))))
1797 /* In GIMPLE, getting rid of 2 conversions for one new results
1798 in smaller IL. */
1799 (simplify
1800 (convert (bitop:cs@2 (nop_convert:s @0) @1))
1801 (if (GIMPLE
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 */
1813 (simplify
1814 (bitop:c (rbitop:c @0 @1) @0)
1815 @0)
1816 /* (~x | y) & x -> x & y */
1817 /* (~x & y) | x -> x | y */
1818 (simplify
1819 (bitop:c (rbitop:c (bit_not @0) @1) @0)
1820 (bitop @0 @1)))
1822 /* ((x | y) & z) | x -> (z & y) | x */
1823 (simplify
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) */
1828 (simplify
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)
1834 (simplify
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
1847 oscillation. */
1848 (with { tree cst1 = const_binop (bitop, type, @0, @2); }
1849 (if (cst1)
1850 (bitop @1 { cst1; })
1851 (with { tree cst2 = const_binop (bitop, type, @1, @2); }
1852 (if (cst2)
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
1858 @0
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
1862 (op @0 @1)))
1863 (match truth_valued_p
1864 (truth_not @0))
1866 (match (logical_inverted_value @0)
1867 (truth_not @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))
1877 /* X & !X -> 0. */
1878 (simplify
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)
1883 (simplify
1884 (op:c truth_valued_p@0 (logical_inverted_value @0))
1885 { constant_boolean_node (true, type); }))
1886 /* X ==/!= !X is false/true. */
1887 (for op (eq ne)
1888 (simplify
1889 (op:c truth_valued_p@0 (logical_inverted_value @0))
1890 { constant_boolean_node (op == NE_EXPR ? true : false, type); }))
1892 /* ~~x -> x */
1893 (simplify
1894 (bit_not (bit_not @0))
1895 @0)
1897 (match zero_one_valued_p
1898 @0
1899 (if (INTEGRAL_TYPE_P (type) && tree_nonzero_bits (@0) == 1)))
1900 (match zero_one_valued_p
1901 truth_valued_p@0)
1903 /* Transform { 0 or 1 } * { 0 or 1 } into { 0 or 1 } & { 0 or 1 }. */
1904 (simplify
1905 (mult zero_one_valued_p@0 zero_one_valued_p@1)
1906 (if (INTEGRAL_TYPE_P (type))
1907 (bit_and @0 @1)))
1909 (for cmp (tcc_comparison)
1910 icmp (inverted_tcc_comparison)
1911 /* Fold (((a < b) & c) | ((a >= b) & d)) into (a < b ? c : d) & 1. */
1912 (simplify
1913 (bit_ior
1914 (bit_and:c (convert? (cmp@0 @01 @02)) @3)
1915 (bit_and:c (convert? (icmp@4 @01 @02)) @5))
1916 (if (INTEGRAL_TYPE_P (type)
1917 /* The scalar version has to be canonicalized after vectorization
1918 because it makes unconditional loads conditional ones, which
1919 means we lose vectorization because the loads may trap. */
1920 && canonicalize_math_after_vectorization_p ())
1921 (bit_and (cond @0 @3 @5) { build_one_cst (type); })))
1923 /* Fold ((-(a < b) & c) | (-(a >= b) & d)) into a < b ? c : d. This is
1924 canonicalized further and we recognize the conditional form:
1925 (a < b ? c : 0) | (a >= b ? d : 0) into a < b ? c : d. */
1926 (simplify
1927 (bit_ior
1928 (cond (cmp@0 @01 @02) @3 zerop)
1929 (cond (icmp@4 @01 @02) @5 zerop))
1930 (if (INTEGRAL_TYPE_P (type)
1931 /* The scalar version has to be canonicalized after vectorization
1932 because it makes unconditional loads conditional ones, which
1933 means we lose vectorization because the loads may trap. */
1934 && canonicalize_math_after_vectorization_p ())
1935 (cond @0 @3 @5)))
1937 /* Vector Fold (((a < b) & c) | ((a >= b) & d)) into a < b ? c : d.
1938 and ((~(a < b) & c) | (~(a >= b) & d)) into a < b ? c : d. */
1939 (simplify
1940 (bit_ior
1941 (bit_and:c (vec_cond:s (cmp@0 @6 @7) @4 @5) @2)
1942 (bit_and:c (vec_cond:s (icmp@1 @6 @7) @4 @5) @3))
1943 (if (integer_zerop (@5))
1944 (switch
1945 (if (integer_onep (@4))
1946 (bit_and (vec_cond @0 @2 @3) @4))
1947 (if (integer_minus_onep (@4))
1948 (vec_cond @0 @2 @3)))
1949 (if (integer_zerop (@4))
1950 (switch
1951 (if (integer_onep (@5))
1952 (bit_and (vec_cond @0 @3 @2) @5))
1953 (if (integer_minus_onep (@5))
1954 (vec_cond @0 @3 @2))))))
1956 /* Scalar Vectorized Fold ((-(a < b) & c) | (-(a >= b) & d))
1957 into a < b ? d : c. */
1958 (simplify
1959 (bit_ior
1960 (vec_cond:s (cmp@0 @4 @5) @2 integer_zerop)
1961 (vec_cond:s (icmp@1 @4 @5) @3 integer_zerop))
1962 (vec_cond @0 @2 @3)))
1964 /* Transform X & -Y into X * Y when Y is { 0 or 1 }. */
1965 (simplify
1966 (bit_and:c (convert? (negate zero_one_valued_p@0)) @1)
1967 (if (INTEGRAL_TYPE_P (type)
1968 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
1969 && TREE_CODE (TREE_TYPE (@0)) != BOOLEAN_TYPE
1970 && !TYPE_UNSIGNED (TREE_TYPE (@0)))
1971 (mult (convert @0) @1)))
1973 /* Narrow integer multiplication by a zero_one_valued_p operand.
1974 Multiplication by [0,1] is guaranteed not to overflow. */
1975 (simplify
1976 (convert (mult@0 zero_one_valued_p@1 INTEGER_CST@2))
1977 (if (INTEGRAL_TYPE_P (type)
1978 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
1979 && TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (@0)))
1980 (mult (convert @1) (convert @2))))
1982 /* (X << C) != 0 can be simplified to X, when C is zero_one_valued_p.
1983 Check that the shift is well-defined (C is less than TYPE_PRECISION)
1984 as some targets (such as x86's SSE) may return zero for larger C. */
1985 (simplify
1986 (ne (lshift zero_one_valued_p@0 INTEGER_CST@1) integer_zerop@2)
1987 (if (tree_fits_shwi_p (@1)
1988 && tree_to_shwi (@1) > 0
1989 && tree_to_shwi (@1) < TYPE_PRECISION (TREE_TYPE (@0)))
1990 (convert @0)))
1992 /* (X << C) == 0 can be simplified to X == 0, when C is zero_one_valued_p.
1993 Check that the shift is well-defined (C is less than TYPE_PRECISION)
1994 as some targets (such as x86's SSE) may return zero for larger C. */
1995 (simplify
1996 (eq (lshift zero_one_valued_p@0 INTEGER_CST@1) integer_zerop@2)
1997 (if (tree_fits_shwi_p (@1)
1998 && tree_to_shwi (@1) > 0
1999 && tree_to_shwi (@1) < TYPE_PRECISION (TREE_TYPE (@0)))
2000 (eq @0 @2)))
2002 /* Convert ~ (-A) to A - 1. */
2003 (simplify
2004 (bit_not (convert? (negate @0)))
2005 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
2006 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
2007 (convert (minus @0 { build_each_one_cst (TREE_TYPE (@0)); }))))
2009 /* Convert - (~A) to A + 1. */
2010 (simplify
2011 (negate (nop_convert? (bit_not @0)))
2012 (plus (view_convert @0) { build_each_one_cst (type); }))
2014 /* (a & b) ^ (a == b) -> !(a | b) */
2015 /* (a & b) == (a ^ b) -> !(a | b) */
2016 (for first_op (bit_xor eq)
2017 second_op (eq bit_xor)
2018 (simplify
2019 (first_op:c (bit_and:c truth_valued_p@0 truth_valued_p@1) (second_op:c @0 @1))
2020 (bit_not (bit_ior @0 @1))))
2022 /* Convert ~ (A - 1) or ~ (A + -1) to -A. */
2023 (simplify
2024 (bit_not (convert? (minus @0 integer_each_onep)))
2025 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
2026 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
2027 (convert (negate @0))))
2028 (simplify
2029 (bit_not (convert? (plus @0 integer_all_onesp)))
2030 (if (element_precision (type) <= element_precision (TREE_TYPE (@0))
2031 || !TYPE_UNSIGNED (TREE_TYPE (@0)))
2032 (convert (negate @0))))
2034 /* Part of convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */
2035 (simplify
2036 (bit_not (convert? (bit_xor @0 INTEGER_CST@1)))
2037 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2038 (convert (bit_xor @0 (bit_not @1)))))
2039 (simplify
2040 (bit_not (convert? (bit_xor:c (bit_not @0) @1)))
2041 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2042 (convert (bit_xor @0 @1))))
2044 /* Otherwise prefer ~(X ^ Y) to ~X ^ Y as more canonical. */
2045 (simplify
2046 (bit_xor:c (nop_convert?:s (bit_not:s @0)) @1)
2047 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2048 (bit_not (bit_xor (view_convert @0) @1))))
2050 /* ~(a ^ b) is a == b for truth valued a and b. */
2051 (simplify
2052 (bit_not (bit_xor:s truth_valued_p@0 truth_valued_p@1))
2053 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2054 && TYPE_PRECISION (TREE_TYPE (@0)) == 1)
2055 (convert (eq @0 @1))))
2057 /* (~a) == b is a ^ b for truth valued a and b. */
2058 (simplify
2059 (eq:c (bit_not:s truth_valued_p@0) truth_valued_p@1)
2060 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2061 && TYPE_PRECISION (TREE_TYPE (@0)) == 1)
2062 (convert (bit_xor @0 @1))))
2064 /* (x & ~m) | (y & m) -> ((x ^ y) & m) ^ x */
2065 (simplify
2066 (bit_ior:c (bit_and:cs @0 (bit_not @2)) (bit_and:cs @1 @2))
2067 (bit_xor (bit_and (bit_xor @0 @1) @2) @0))
2069 /* Fold A - (A & B) into ~B & A. */
2070 (simplify
2071 (minus (convert1? @0) (convert2?:s (bit_and:cs @@0 @1)))
2072 (if (tree_nop_conversion_p (type, TREE_TYPE (@0))
2073 && tree_nop_conversion_p (type, TREE_TYPE (@1)))
2074 (convert (bit_and (bit_not @1) @0))))
2076 /* (m1 CMP m2) * d -> (m1 CMP m2) ? d : 0 */
2077 (if (!canonicalize_math_p ())
2078 (for cmp (gt lt ge le)
2079 (simplify
2080 (mult (convert (cmp @0 @1)) @2)
2081 (cond (cmp @0 @1) @2 { build_zero_cst (type); }))))
2083 /* For integral types with undefined overflow and C != 0 fold
2084 x * C EQ/NE y * C into x EQ/NE y. */
2085 (for cmp (eq ne)
2086 (simplify
2087 (cmp (mult:c @0 @1) (mult:c @2 @1))
2088 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2089 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2090 && tree_expr_nonzero_p (@1))
2091 (cmp @0 @2))))
2093 /* For integral types with wrapping overflow and C odd fold
2094 x * C EQ/NE y * C into x EQ/NE y. */
2095 (for cmp (eq ne)
2096 (simplify
2097 (cmp (mult @0 INTEGER_CST@1) (mult @2 @1))
2098 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2099 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))
2100 && (TREE_INT_CST_LOW (@1) & 1) != 0)
2101 (cmp @0 @2))))
2103 /* For integral types with undefined overflow and C != 0 fold
2104 x * C RELOP y * C into:
2106 x RELOP y for nonnegative C
2107 y RELOP x for negative C */
2108 (for cmp (lt gt le ge)
2109 (simplify
2110 (cmp (mult:c @0 @1) (mult:c @2 @1))
2111 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2112 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
2113 (if (tree_expr_nonnegative_p (@1) && tree_expr_nonzero_p (@1))
2114 (cmp @0 @2)
2115 (if (TREE_CODE (@1) == INTEGER_CST
2116 && wi::neg_p (wi::to_wide (@1), TYPE_SIGN (TREE_TYPE (@1))))
2117 (cmp @2 @0))))))
2119 /* (X - 1U) <= INT_MAX-1U into (int) X > 0. */
2120 (for cmp (le gt)
2121 icmp (gt le)
2122 (simplify
2123 (cmp (plus @0 integer_minus_onep@1) INTEGER_CST@2)
2124 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2125 && TYPE_UNSIGNED (TREE_TYPE (@0))
2126 && TYPE_PRECISION (TREE_TYPE (@0)) > 1
2127 && (wi::to_wide (@2)
2128 == wi::max_value (TYPE_PRECISION (TREE_TYPE (@0)), SIGNED) - 1))
2129 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
2130 (icmp (convert:stype @0) { build_int_cst (stype, 0); })))))
2132 /* X / 4 < Y / 4 iff X < Y when the division is known to be exact. */
2133 (for cmp (simple_comparison)
2134 (simplify
2135 (cmp (convert?@3 (exact_div @0 INTEGER_CST@2)) (convert? (exact_div @1 @2)))
2136 (if (element_precision (@3) >= element_precision (@0)
2137 && types_match (@0, @1))
2138 (if (wi::lt_p (wi::to_wide (@2), 0, TYPE_SIGN (TREE_TYPE (@2))))
2139 (if (!TYPE_UNSIGNED (TREE_TYPE (@3)))
2140 (cmp @1 @0)
2141 (if (tree_expr_nonzero_p (@0) && tree_expr_nonzero_p (@1))
2142 (with
2143 {
2144 tree utype = unsigned_type_for (TREE_TYPE (@0));
2145 }
2146 (cmp (convert:utype @1) (convert:utype @0)))))
2147 (if (wi::gt_p (wi::to_wide (@2), 1, TYPE_SIGN (TREE_TYPE (@2))))
2148 (if (TYPE_UNSIGNED (TREE_TYPE (@0)) || !TYPE_UNSIGNED (TREE_TYPE (@3)))
2149 (cmp @0 @1)
2150 (with
2151 {
2152 tree utype = unsigned_type_for (TREE_TYPE (@0));
2153 }
2154 (cmp (convert:utype @0) (convert:utype @1)))))))))
2156 /* X / C1 op C2 into a simple range test. */
2157 (for cmp (simple_comparison)
2158 (simplify
2159 (cmp (trunc_div:s @0 INTEGER_CST@1) INTEGER_CST@2)
2160 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2161 && integer_nonzerop (@1)
2162 && !TREE_OVERFLOW (@1)
2163 && !TREE_OVERFLOW (@2))
2164 (with { tree lo, hi; bool neg_overflow;
2165 enum tree_code code = fold_div_compare (cmp, @1, @2, &lo, &hi,
2166 &neg_overflow); }
2167 (switch
2168 (if (code == LT_EXPR || code == GE_EXPR)
2169 (if (TREE_OVERFLOW (lo))
2170 { build_int_cst (type, (code == LT_EXPR) ^ neg_overflow); }
2171 (if (code == LT_EXPR)
2172 (lt @0 { lo; })
2173 (ge @0 { lo; }))))
2174 (if (code == LE_EXPR || code == GT_EXPR)
2175 (if (TREE_OVERFLOW (hi))
2176 { build_int_cst (type, (code == LE_EXPR) ^ neg_overflow); }
2177 (if (code == LE_EXPR)
2178 (le @0 { hi; })
2179 (gt @0 { hi; }))))
2180 (if (!lo && !hi)
2181 { build_int_cst (type, code == NE_EXPR); })
2182 (if (code == EQ_EXPR && !hi)
2183 (ge @0 { lo; }))
2184 (if (code == EQ_EXPR && !lo)
2185 (le @0 { hi; }))
2186 (if (code == NE_EXPR && !hi)
2187 (lt @0 { lo; }))
2188 (if (code == NE_EXPR && !lo)
2189 (gt @0 { hi; }))
2190 (if (GENERIC)
2191 { build_range_check (UNKNOWN_LOCATION, type, @0, code == EQ_EXPR,
2192 lo, hi); })
2193 (with
2194 {
2195 tree etype = range_check_type (TREE_TYPE (@0));
2196 if (etype)
2197 {
2198 hi = fold_convert (etype, hi);
2199 lo = fold_convert (etype, lo);
2200 hi = const_binop (MINUS_EXPR, etype, hi, lo);
2201 }
2202 }
2203 (if (etype && hi && !TREE_OVERFLOW (hi))
2204 (if (code == EQ_EXPR)
2205 (le (minus (convert:etype @0) { lo; }) { hi; })
2206 (gt (minus (convert:etype @0) { lo; }) { hi; })))))))))
2208 /* X + Z < Y + Z is the same as X < Y when there is no overflow. */
2209 (for op (lt le ge gt)
2210 (simplify
2211 (op (plus:c @0 @2) (plus:c @1 @2))
2212 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2213 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
2214 (op @0 @1))))
2216 /* As a special case, X + C < Y + C is the same as (signed) X < (signed) Y
2217 when C is an unsigned integer constant with only the MSB set, and X and
2218 Y have types of equal or lower integer conversion rank than C's. */
2219 (for op (lt le ge gt)
2220 (simplify
2221 (op (plus @1 INTEGER_CST@0) (plus @2 @0))
2222 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
2223 && TYPE_UNSIGNED (TREE_TYPE (@0))
2224 && wi::only_sign_bit_p (wi::to_wide (@0)))
2225 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
2226 (op (convert:stype @1) (convert:stype @2))))))
2228 /* For equality and subtraction, this is also true with wrapping overflow. */
2229 (for op (eq ne minus)
2230 (simplify
2231 (op (plus:c @0 @2) (plus:c @1 @2))
2232 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2233 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2234 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
2235 (op @0 @1))))
2237 /* X - Z < Y - Z is the same as X < Y when there is no overflow. */
2238 (for op (lt le ge gt)
2239 (simplify
2240 (op (minus @0 @2) (minus @1 @2))
2241 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2242 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
2243 (op @0 @1))))
2244 /* For equality and subtraction, this is also true with wrapping overflow. */
2245 (for op (eq ne minus)
2246 (simplify
2247 (op (minus @0 @2) (minus @1 @2))
2248 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2249 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2250 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
2251 (op @0 @1))))
2252 /* And for pointers... */
2253 (for op (simple_comparison)
2254 (simplify
2255 (op (pointer_diff@3 @0 @2) (pointer_diff @1 @2))
2256 (if (!TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
2257 (op @0 @1))))
2258 (simplify
2259 (minus (pointer_diff@3 @0 @2) (pointer_diff @1 @2))
2260 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@3))
2261 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
2262 (pointer_diff @0 @1)))
2264 /* Z - X < Z - Y is the same as Y < X when there is no overflow. */
2265 (for op (lt le ge gt)
2266 (simplify
2267 (op (minus @2 @0) (minus @2 @1))
2268 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2269 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
2270 (op @1 @0))))
2271 /* For equality and subtraction, this is also true with wrapping overflow. */
2272 (for op (eq ne minus)
2273 (simplify
2274 (op (minus @2 @0) (minus @2 @1))
2275 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2276 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2277 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
2278 (op @1 @0))))
2279 /* And for pointers... */
2280 (for op (simple_comparison)
2281 (simplify
2282 (op (pointer_diff@3 @2 @0) (pointer_diff @2 @1))
2283 (if (!TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
2284 (op @1 @0))))
2285 (simplify
2286 (minus (pointer_diff@3 @2 @0) (pointer_diff @2 @1))
2287 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@3))
2288 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@2)))
2289 (pointer_diff @1 @0)))
2291 /* X + Y < Y is the same as X < 0 when there is no overflow. */
2292 (for op (lt le gt ge)
2293 (simplify
2294 (op:c (plus:c@2 @0 @1) @1)
2295 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2296 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2297 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0))
2298 && (CONSTANT_CLASS_P (@0) || single_use (@2)))
2299 (op @0 { build_zero_cst (TREE_TYPE (@0)); }))))
2300 /* For equality, this is also true with wrapping overflow. */
2301 (for op (eq ne)
2302 (simplify
2303 (op:c (nop_convert?@3 (plus:c@2 @0 (convert1? @1))) (convert2? @1))
2304 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2305 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2306 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
2307 && (CONSTANT_CLASS_P (@0) || (single_use (@2) && single_use (@3)))
2308 && tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@2))
2309 && tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@1)))
2310 (op @0 { build_zero_cst (TREE_TYPE (@0)); })))
2311 (simplify
2312 (op:c (nop_convert?@3 (pointer_plus@2 (convert1? @0) @1)) (convert2? @0))
2313 (if (tree_nop_conversion_p (TREE_TYPE (@2), TREE_TYPE (@0))
2314 && tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0))
2315 && (CONSTANT_CLASS_P (@1) || (single_use (@2) && single_use (@3))))
2316 (op @1 { build_zero_cst (TREE_TYPE (@1)); }))))
2318 /* (&a + b) !=/== (&a[1] + c) -> (&a[0] - &a[1]) + b !=/== c */
2319 (for neeq (ne eq)
2320 (simplify
2321 (neeq:c ADDR_EXPR@0 (pointer_plus @2 @3))
2322 (with { poly_int64 diff; tree inner_type = TREE_TYPE (@3);}
2323 (if (ptr_difference_const (@0, @2, &diff))
2324 (neeq { build_int_cst_type (inner_type, diff); } @3))))
2325 (simplify
2326 (neeq (pointer_plus ADDR_EXPR@0 @1) (pointer_plus ADDR_EXPR@2 @3))
2327 (with { poly_int64 diff; tree inner_type = TREE_TYPE (@1);}
2328 (if (ptr_difference_const (@0, @2, &diff))
2329 (neeq (plus { build_int_cst_type (inner_type, diff); } @1) @3)))))
2331 /* X - Y < X is the same as Y > 0 when there is no overflow.
2332 For equality, this is also true with wrapping overflow. */
2333 (for op (simple_comparison)
2334 (simplify
2335 (op:c @0 (minus@2 @0 @1))
2336 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2337 && (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2338 || ((op == EQ_EXPR || op == NE_EXPR)
2339 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))))
2340 && (CONSTANT_CLASS_P (@1) || single_use (@2)))
2341 (op @1 { build_zero_cst (TREE_TYPE (@1)); }))))
2343 /* Transform:
2344 (X / Y) == 0 -> X < Y if X, Y are unsigned.
2345 (X / Y) != 0 -> X >= Y, if X, Y are unsigned. */
2346 (for cmp (eq ne)
2347 ocmp (lt ge)
2348 (simplify
2349 (cmp (trunc_div @0 @1) integer_zerop)
2350 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
2351 /* Complex ==/!= is allowed, but not </>=. */
2352 && TREE_CODE (TREE_TYPE (@0)) != COMPLEX_TYPE
2353 && (VECTOR_TYPE_P (type) || !VECTOR_TYPE_P (TREE_TYPE (@0))))
2354 (ocmp @0 @1))))
2356 /* X == C - X can never be true if C is odd. */
2357 (for cmp (eq ne)
2358 (simplify
2359 (cmp:c (convert? @0) (convert1? (minus INTEGER_CST@1 (convert2? @0))))
2360 (if (TREE_INT_CST_LOW (@1) & 1)
2361 { constant_boolean_node (cmp == NE_EXPR, type); })))
2363 /* Arguments on which one can call get_nonzero_bits to get the bits
2364 possibly set. */
2365 (match with_possible_nonzero_bits
2366 INTEGER_CST@0)
2367 (match with_possible_nonzero_bits
2368 SSA_NAME@0
2369 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))))
2370 /* Slightly extended version, do not make it recursive to keep it cheap. */
2371 (match (with_possible_nonzero_bits2 @0)
2372 with_possible_nonzero_bits@0)
2373 (match (with_possible_nonzero_bits2 @0)
2374 (bit_and:c with_possible_nonzero_bits@0 @2))
2376 /* Same for bits that are known to be set, but we do not have
2377 an equivalent to get_nonzero_bits yet. */
2378 (match (with_certain_nonzero_bits2 @0)
2379 INTEGER_CST@0)
2380 (match (with_certain_nonzero_bits2 @0)
2381 (bit_ior @1 INTEGER_CST@0))
2383 /* X == C (or X & Z == Y | C) is impossible if ~nonzero(X) & C != 0. */
2384 (for cmp (eq ne)
2385 (simplify
2386 (cmp:c (with_possible_nonzero_bits2 @0) (with_certain_nonzero_bits2 @1))
2387 (if (wi::bit_and_not (wi::to_wide (@1), get_nonzero_bits (@0)) != 0)
2388 { constant_boolean_node (cmp == NE_EXPR, type); })))
2390 /* ((X inner_op C0) outer_op C1)
2391 With X being a tree where value_range has reasoned certain bits to always be
2392 zero throughout its computed value range,
2393 inner_op = {|,^}, outer_op = {|,^} and inner_op != outer_op
2394 where zero_mask has 1's for all bits that are sure to be 0 in
2395 and 0's otherwise.
2396 if (inner_op == '^') C0 &= ~C1;
2397 if ((C0 & ~zero_mask) == 0) then emit (X outer_op (C0 outer_op C1)
2398 if ((C1 & ~zero_mask) == 0) then emit (X inner_op (C0 outer_op C1)
2399 */
2400 (for inner_op (bit_ior bit_xor)
2401 outer_op (bit_xor bit_ior)
2402 (simplify
2403 (outer_op
2404 (inner_op:s @2 INTEGER_CST@0) INTEGER_CST@1)
2405 (with
2406 {
2407 bool fail = false;
2408 wide_int zero_mask_not;
2409 wide_int C0;
2410 wide_int cst_emit;
2412 if (TREE_CODE (@2) == SSA_NAME)
2413 zero_mask_not = get_nonzero_bits (@2);
2414 else
2415 fail = true;
2417 if (inner_op == BIT_XOR_EXPR)
2418 {
2419 C0 = wi::bit_and_not (wi::to_wide (@0), wi::to_wide (@1));
2420 cst_emit = C0 | wi::to_wide (@1);
2421 }
2422 else
2423 {
2424 C0 = wi::to_wide (@0);
2425 cst_emit = C0 ^ wi::to_wide (@1);
2426 }
2427 }
2428 (if (!fail && (C0 & zero_mask_not) == 0)
2429 (outer_op @2 { wide_int_to_tree (type, cst_emit); })
2430 (if (!fail && (wi::to_wide (@1) & zero_mask_not) == 0)
2431 (inner_op @2 { wide_int_to_tree (type, cst_emit); }))))))
2433 /* Associate (p +p off1) +p off2 as (p +p (off1 + off2)). */
2434 (simplify
2435 (pointer_plus (pointer_plus:s @0 @1) @3)
2436 (pointer_plus @0 (plus @1 @3)))
2437 #if GENERIC
2438 (simplify
2439 (pointer_plus (convert:s (pointer_plus:s @0 @1)) @3)
2440 (convert:type (pointer_plus @0 (plus @1 @3))))
2441 #endif
2443 /* Pattern match
2444 tem1 = (long) ptr1;
2445 tem2 = (long) ptr2;
2446 tem3 = tem2 - tem1;
2447 tem4 = (unsigned long) tem3;
2448 tem5 = ptr1 + tem4;
2449 and produce
2450 tem5 = ptr2; */
2451 (simplify
2452 (pointer_plus @0 (convert?@2 (minus@3 (convert @1) (convert @0))))
2453 /* Conditionally look through a sign-changing conversion. */
2454 (if (TYPE_PRECISION (TREE_TYPE (@2)) == TYPE_PRECISION (TREE_TYPE (@3))
2455 && ((GIMPLE && useless_type_conversion_p (type, TREE_TYPE (@1)))
2456 || (GENERIC && type == TREE_TYPE (@1))))
2457 @1))
2458 (simplify
2459 (pointer_plus @0 (convert?@2 (pointer_diff@3 @1 @@0)))
2460 (if (TYPE_PRECISION (TREE_TYPE (@2)) >= TYPE_PRECISION (TREE_TYPE (@3)))
2461 (convert @1)))
2463 /* Pattern match
2464 tem = (sizetype) ptr;
2465 tem = tem & algn;
2466 tem = -tem;
2467 ... = ptr p+ tem;
2468 and produce the simpler and easier to analyze with respect to alignment
2469 ... = ptr & ~algn; */
2470 (simplify
2471 (pointer_plus @0 (negate (bit_and (convert @0) INTEGER_CST@1)))
2472 (with { tree algn = wide_int_to_tree (TREE_TYPE (@0), ~wi::to_wide (@1)); }
2473 (bit_and @0 { algn; })))
2475 /* Try folding difference of addresses. */
2476 (simplify
2477 (minus (convert ADDR_EXPR@0) (convert @1))
2478 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2479 (with { poly_int64 diff; }
2480 (if (ptr_difference_const (@0, @1, &diff))
2481 { build_int_cst_type (type, diff); }))))
2482 (simplify
2483 (minus (convert @0) (convert ADDR_EXPR@1))
2484 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
2485 (with { poly_int64 diff; }
2486 (if (ptr_difference_const (@0, @1, &diff))
2487 { build_int_cst_type (type, diff); }))))
2488 (simplify
2489 (pointer_diff (convert?@2 ADDR_EXPR@0) (convert1?@3 @1))
2490 (if (tree_nop_conversion_p (TREE_TYPE(@2), TREE_TYPE (@0))
2491 && tree_nop_conversion_p (TREE_TYPE(@3), TREE_TYPE (@1)))
2492 (with { poly_int64 diff; }
2493 (if (ptr_difference_const (@0, @1, &diff))
2494 { build_int_cst_type (type, diff); }))))
2495 (simplify
2496 (pointer_diff (convert?@2 @0) (convert1?@3 ADDR_EXPR@1))
2497 (if (tree_nop_conversion_p (TREE_TYPE(@2), TREE_TYPE (@0))
2498 && tree_nop_conversion_p (TREE_TYPE(@3), TREE_TYPE (@1)))
2499 (with { poly_int64 diff; }
2500 (if (ptr_difference_const (@0, @1, &diff))
2501 { build_int_cst_type (type, diff); }))))
2503 /* (&a+b) - (&a[1] + c) -> sizeof(a[0]) + (b - c) */
2504 (simplify
2505 (pointer_diff (pointer_plus ADDR_EXPR@0 @1) (pointer_plus ADDR_EXPR@2 @3))
2506 (with { poly_int64 diff; }
2507 (if (ptr_difference_const (@0, @2, &diff))
2508 (plus { build_int_cst_type (type, diff); } (convert (minus @1 @3))))))
2509 /* (p + b) - &p->d -> offsetof (*p, d) + b */
2510 (simplify
2511 (pointer_diff (pointer_plus @0 @1) ADDR_EXPR@2)
2512 (with { poly_int64 diff; }
2513 (if (ptr_difference_const (@0, @2, &diff))
2514 (plus { build_int_cst_type (type, diff); } (convert @1)))))
2515 (simplify
2516 (pointer_diff ADDR_EXPR@0 (pointer_plus @1 @2))
2517 (with { poly_int64 diff; }
2518 (if (ptr_difference_const (@0, @1, &diff))
2519 (minus { build_int_cst_type (type, diff); } (convert @2)))))
2521 /* Canonicalize (T *)(ptr - ptr-cst) to &MEM[ptr + -ptr-cst]. */
2522 (simplify
2523 (convert (pointer_diff @0 INTEGER_CST@1))
2524 (if (POINTER_TYPE_P (type))
2525 { build_fold_addr_expr_with_type
2526 (build2 (MEM_REF, char_type_node, @0,
2527 wide_int_to_tree (ptr_type_node, wi::neg (wi::to_wide (@1)))),
2528 type); }))
2530 /* If arg0 is derived from the address of an object or function, we may
2531 be able to fold this expression using the object or function's
2532 alignment. */
2533 (simplify
2534 (bit_and (convert? @0) INTEGER_CST@1)
2535 (if (POINTER_TYPE_P (TREE_TYPE (@0))
2536 && tree_nop_conversion_p (type, TREE_TYPE (@0)))
2537 (with
2538 {
2539 unsigned int align;
2540 unsigned HOST_WIDE_INT bitpos;
2541 get_pointer_alignment_1 (@0, &align, &bitpos);
2542 }
2543 (if (wi::ltu_p (wi::to_wide (@1), align / BITS_PER_UNIT))
2544 { wide_int_to_tree (type, (wi::to_wide (@1)
2545 & (bitpos / BITS_PER_UNIT))); }))))
2547 (match min_value
2548 INTEGER_CST
2549 (if (INTEGRAL_TYPE_P (type)
2550 && wi::eq_p (wi::to_wide (t), wi::min_value (type)))))
2552 (match max_value
2553 INTEGER_CST
2554 (if (INTEGRAL_TYPE_P (type)
2555 && wi::eq_p (wi::to_wide (t), wi::max_value (type)))))
2557 /* x > y && x != XXX_MIN --> x > y
2558 x > y && x == XXX_MIN --> false . */
2559 (for eqne (eq ne)
2560 (simplify
2561 (bit_and:c (gt:c@2 @0 @1) (eqne @0 min_value))
2562 (switch
2563 (if (eqne == EQ_EXPR)
2564 { constant_boolean_node (false, type); })
2565 (if (eqne == NE_EXPR)
2566 @2)
2567 )))
2569 /* x < y && x != XXX_MAX --> x < y
2570 x < y && x == XXX_MAX --> false. */
2571 (for eqne (eq ne)
2572 (simplify
2573 (bit_and:c (lt:c@2 @0 @1) (eqne @0 max_value))
2574 (switch
2575 (if (eqne == EQ_EXPR)
2576 { constant_boolean_node (false, type); })
2577 (if (eqne == NE_EXPR)
2578 @2)
2579 )))
2581 /* x <= y && x == XXX_MIN --> x == XXX_MIN. */
2582 (simplify
2583 (bit_and:c (le:c @0 @1) (eq@2 @0 min_value))
2584 @2)
2586 /* x >= y && x == XXX_MAX --> x == XXX_MAX. */
2587 (simplify
2588 (bit_and:c (ge:c @0 @1) (eq@2 @0 max_value))
2589 @2)
2591 /* x > y || x != XXX_MIN --> x != XXX_MIN. */
2592 (simplify
2593 (bit_ior:c (gt:c @0 @1) (ne@2 @0 min_value))
2594 @2)
2596 /* x <= y || x != XXX_MIN --> true. */
2597 (simplify
2598 (bit_ior:c (le:c @0 @1) (ne @0 min_value))
2599 { constant_boolean_node (true, type); })
2601 /* x <= y || x == XXX_MIN --> x <= y. */
2602 (simplify
2603 (bit_ior:c (le:c@2 @0 @1) (eq @0 min_value))
2604 @2)
2606 /* x < y || x != XXX_MAX --> x != XXX_MAX. */
2607 (simplify
2608 (bit_ior:c (lt:c @0 @1) (ne@2 @0 max_value))
2609 @2)
2611 /* x >= y || x != XXX_MAX --> true
2612 x >= y || x == XXX_MAX --> x >= y. */
2613 (for eqne (eq ne)
2614 (simplify
2615 (bit_ior:c (ge:c@2 @0 @1) (eqne @0 max_value))
2616 (switch
2617 (if (eqne == EQ_EXPR)
2618 @2)
2619 (if (eqne == NE_EXPR)
2620 { constant_boolean_node (true, type); }))))
2622 /* y == XXX_MIN || x < y --> x <= y - 1 */
2623 (simplify
2624 (bit_ior:c (eq:s @1 min_value) (lt:cs @0 @1))
2625 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2626 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
2627 (le @0 (minus @1 { build_int_cst (TREE_TYPE (@1), 1); }))))
2629 /* y != XXX_MIN && x >= y --> x > y - 1 */
2630 (simplify
2631 (bit_and:c (ne:s @1 min_value) (ge:cs @0 @1))
2632 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1))
2633 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
2634 (gt @0 (minus @1 { build_int_cst (TREE_TYPE (@1), 1); }))))
2636 /* Convert (X == CST1) && (X OP2 CST2) to a known value
2637 based on CST1 OP2 CST2. Similarly for (X != CST1). */
2639 (for code1 (eq ne)
2640 (for code2 (eq ne lt gt le ge)
2641 (simplify
2642 (bit_and:c (code1@3 @0 INTEGER_CST@1) (code2@4 @0 INTEGER_CST@2))
2643 (with
2644 {
2645 int cmp = tree_int_cst_compare (@1, @2);
2646 bool val;
2647 switch (code2)
2648 {
2649 case EQ_EXPR: val = (cmp == 0); break;
2650 case NE_EXPR: val = (cmp != 0); break;
2651 case LT_EXPR: val = (cmp < 0); break;
2652 case GT_EXPR: val = (cmp > 0); break;
2653 case LE_EXPR: val = (cmp <= 0); break;
2654 case GE_EXPR: val = (cmp >= 0); break;
2655 default: gcc_unreachable ();
2656 }
2657 }
2658 (switch
2659 (if (code1 == EQ_EXPR && val) @3)
2660 (if (code1 == EQ_EXPR && !val) { constant_boolean_node (false, type); })
2661 (if (code1 == NE_EXPR && !val) @4))))))
2663 /* Convert (X OP1 CST1) && (X OP2 CST2). */
2665 (for code1 (lt le gt ge)
2666 (for code2 (lt le gt ge)
2667 (simplify
2668 (bit_and (code1:c@3 @0 INTEGER_CST@1) (code2:c@4 @0 INTEGER_CST@2))
2669 (with
2670 {
2671 int cmp = tree_int_cst_compare (@1, @2);
2672 }
2673 (switch
2674 /* Choose the more restrictive of two < or <= comparisons. */
2675 (if ((code1 == LT_EXPR || code1 == LE_EXPR)
2676 && (code2 == LT_EXPR || code2 == LE_EXPR))
2677 (if ((cmp < 0) || (cmp == 0 && code1 == LT_EXPR))
2678 @3
2679 @4))
2680 /* Likewise chose the more restrictive of two > or >= comparisons. */
2681 (if ((code1 == GT_EXPR || code1 == GE_EXPR)
2682 && (code2 == GT_EXPR || code2 == GE_EXPR))
2683 (if ((cmp > 0) || (cmp == 0 && code1 == GT_EXPR))
2684 @3
2685 @4))
2686 /* Check for singleton ranges. */
2687 (if (cmp == 0
2688 && ((code1 == LE_EXPR && code2 == GE_EXPR)
2689 || (code1 == GE_EXPR && code2 == LE_EXPR)))
2690 (eq @0 @1))
2691 /* Check for disjoint ranges. */
2692 (if (cmp <= 0
2693 && (code1 == LT_EXPR || code1 == LE_EXPR)
2694 && (code2 == GT_EXPR || code2 == GE_EXPR))
2695 { constant_boolean_node (false, type); })
2696 (if (cmp >= 0
2697 && (code1 == GT_EXPR || code1 == GE_EXPR)
2698 && (code2 == LT_EXPR || code2 == LE_EXPR))
2699 { constant_boolean_node (false, type); })
2700 )))))
2702 /* Convert (X == CST1) || (X OP2 CST2) to a known value
2703 based on CST1 OP2 CST2. Similarly for (X != CST1). */
2705 (for code1 (eq ne)
2706 (for code2 (eq ne lt gt le ge)
2707 (simplify
2708 (bit_ior:c (code1@3 @0 INTEGER_CST@1) (code2@4 @0 INTEGER_CST@2))
2709 (with
2710 {
2711 int cmp = tree_int_cst_compare (@1, @2);
2712 bool val;
2713 switch (code2)
2714 {
2715 case EQ_EXPR: val = (cmp == 0); break;
2716 case NE_EXPR: val = (cmp != 0); break;
2717 case LT_EXPR: val = (cmp < 0); break;
2718 case GT_EXPR: val = (cmp > 0); break;
2719 case LE_EXPR: val = (cmp <= 0); break;
2720 case GE_EXPR: val = (cmp >= 0); break;
2721 default: gcc_unreachable ();
2722 }
2723 }
2724 (switch
2725 (if (code1 == EQ_EXPR && val) @4)
2726 (if (code1 == NE_EXPR && val) { constant_boolean_node (true, type); })
2727 (if (code1 == NE_EXPR && !val) @3))))))
2729 /* Convert (X OP1 CST1) || (X OP2 CST2). */
2731 (for code1 (lt le gt ge)
2732 (for code2 (lt le gt ge)
2733 (simplify
2734 (bit_ior (code1@3 @0 INTEGER_CST@1) (code2@4 @0 INTEGER_CST@2))
2735 (with
2736 {
2737 int cmp = tree_int_cst_compare (@1, @2);
2738 }
2739 (switch
2740 /* Choose the more restrictive of two < or <= comparisons. */
2741 (if ((code1 == LT_EXPR || code1 == LE_EXPR)
2742 && (code2 == LT_EXPR || code2 == LE_EXPR))
2743 (if ((cmp < 0) || (cmp == 0 && code1 == LT_EXPR))
2744 @4
2745 @3))
2746 /* Likewise chose the more restrictive of two > or >= comparisons. */
2747 (if ((code1 == GT_EXPR || code1 == GE_EXPR)
2748 && (code2 == GT_EXPR || code2 == GE_EXPR))
2749 (if ((cmp > 0) || (cmp == 0 && code1 == GT_EXPR))
2750 @4
2751 @3))
2752 /* Check for singleton ranges. */
2753 (if (cmp == 0
2754 && ((code1 == LT_EXPR && code2 == GT_EXPR)
2755 || (code1 == GT_EXPR && code2 == LT_EXPR)))
2756 (ne @0 @2))
2757 /* Check for disjoint ranges. */
2758 (if (cmp >= 0
2759 && (code1 == LT_EXPR || code1 == LE_EXPR)
2760 && (code2 == GT_EXPR || code2 == GE_EXPR))
2761 { constant_boolean_node (true, type); })
2762 (if (cmp <= 0
2763 && (code1 == GT_EXPR || code1 == GE_EXPR)
2764 && (code2 == LT_EXPR || code2 == LE_EXPR))
2765 { constant_boolean_node (true, type); })
2766 )))))
2768 /* We can't reassociate at all for saturating types. */
2769 (if (!TYPE_SATURATING (type))
2771 /* Contract negates. */
2772 /* A + (-B) -> A - B */
2773 (simplify
2774 (plus:c @0 (convert? (negate @1)))
2775 /* Apply STRIP_NOPS on the negate. */
2776 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
2777 && !TYPE_OVERFLOW_SANITIZED (type))
2778 (with
2779 {
2780 tree t1 = type;
2781 if (INTEGRAL_TYPE_P (type)
2782 && TYPE_OVERFLOW_WRAPS (type) != TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
2783 t1 = TYPE_OVERFLOW_WRAPS (type) ? type : TREE_TYPE (@1);
2784 }
2785 (convert (minus (convert:t1 @0) (convert:t1 @1))))))
2786 /* A - (-B) -> A + B */
2787 (simplify
2788 (minus @0 (convert? (negate @1)))
2789 (if (tree_nop_conversion_p (type, TREE_TYPE (@1))
2790 && !TYPE_OVERFLOW_SANITIZED (type))
2791 (with
2792 {
2793 tree t1 = type;
2794 if (INTEGRAL_TYPE_P (type)
2795 && TYPE_OVERFLOW_WRAPS (type) != TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
2796 t1 = TYPE_OVERFLOW_WRAPS (type) ? type : TREE_TYPE (@1);
2797 }
2798 (convert (plus (convert:t1 @0) (convert:t1 @1))))))
2799 /* -(T)(-A) -> (T)A
2800 Sign-extension is ok except for INT_MIN, which thankfully cannot
2801 happen without overflow. */
2802 (simplify
2803 (negate (convert (negate @1)))
2804 (if (INTEGRAL_TYPE_P (type)
2805 && (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@1))
2806 || (!TYPE_UNSIGNED (TREE_TYPE (@1))
2807 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))))
2808 && !TYPE_OVERFLOW_SANITIZED (type)
2809 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@1)))
2810 (convert @1)))
2811 (simplify
2812 (negate (convert negate_expr_p@1))
2813 (if (SCALAR_FLOAT_TYPE_P (type)
2814 && ((DECIMAL_FLOAT_TYPE_P (type)
2815 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@1))
2816 && TYPE_PRECISION (type) >= TYPE_PRECISION (TREE_TYPE (@1)))
2817 || !HONOR_SIGN_DEPENDENT_ROUNDING (type)))
2818 (convert (negate @1))))
2819 (simplify
2820 (negate (nop_convert? (negate @1)))
2821 (if (!TYPE_OVERFLOW_SANITIZED (type)
2822 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@1)))
2823 (view_convert @1)))
2825 /* We can't reassociate floating-point unless -fassociative-math
2826 or fixed-point plus or minus because of saturation to +-Inf. */
2827 (if ((!FLOAT_TYPE_P (type) || flag_associative_math)
2828 && !FIXED_POINT_TYPE_P (type))
2830 /* Match patterns that allow contracting a plus-minus pair
2831 irrespective of overflow issues. */
2832 /* (A +- B) - A -> +- B */
2833 /* (A +- B) -+ B -> A */
2834 /* A - (A +- B) -> -+ B */
2835 /* A +- (B -+ A) -> +- B */
2836 (simplify
2837 (minus (nop_convert1? (plus:c (nop_convert2? @0) @1)) @0)
2838 (view_convert @1))
2839 (simplify
2840 (minus (nop_convert1? (minus (nop_convert2? @0) @1)) @0)
2841 (if (!ANY_INTEGRAL_TYPE_P (type)
2842 || TYPE_OVERFLOW_WRAPS (type))
2843 (negate (view_convert @1))
2844 (view_convert (negate @1))))
2845 (simplify
2846 (plus:c (nop_convert1? (minus @0 (nop_convert2? @1))) @1)
2847 (view_convert @0))
2848 (simplify
2849 (minus @0 (nop_convert1? (plus:c (nop_convert2? @0) @1)))
2850 (if (!ANY_INTEGRAL_TYPE_P (type)
2851 || TYPE_OVERFLOW_WRAPS (type))
2852 (negate (view_convert @1))
2853 (view_convert (negate @1))))
2854 (simplify
2855 (minus @0 (nop_convert1? (minus (nop_convert2? @0) @1)))
2856 (view_convert @1))
2857 /* (A +- B) + (C - A) -> C +- B */
2858 /* (A + B) - (A - C) -> B + C */
2859 /* More cases are handled with comparisons. */
2860 (simplify
2861 (plus:c (plus:c @0 @1) (minus @2 @0))
2862 (plus @2 @1))
2863 (simplify
2864 (plus:c (minus @0 @1) (minus @2 @0))
2865 (minus @2 @1))
2866 (simplify
2867 (plus:c (pointer_diff @0 @1) (pointer_diff @2 @0))
2868 (if (TYPE_OVERFLOW_UNDEFINED (type)
2869 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0)))
2870 (pointer_diff @2 @1)))
2871 (simplify
2872 (minus (plus:c @0 @1) (minus @0 @2))
2873 (plus @1 @2))
2875 /* (A +- CST1) +- CST2 -> A + CST3
2876 Use view_convert because it is safe for vectors and equivalent for
2877 scalars. */
2878 (for outer_op (plus minus)
2879 (for inner_op (plus minus)
2880 neg_inner_op (minus plus)
2881 (simplify
2882 (outer_op (nop_convert? (inner_op @0 CONSTANT_CLASS_P@1))
2883 CONSTANT_CLASS_P@2)
2884 /* If one of the types wraps, use that one. */
2885 (if (!ANY_INTEGRAL_TYPE_P (type) || TYPE_OVERFLOW_WRAPS (type))
2886 /* If all 3 captures are CONSTANT_CLASS_P, punt, as we might recurse
2887 forever if something doesn't simplify into a constant. */
2888 (if (!CONSTANT_CLASS_P (@0))
2889 (if (outer_op == PLUS_EXPR)
2890 (plus (view_convert @0) (inner_op @2 (view_convert @1)))
2891 (minus (view_convert @0) (neg_inner_op @2 (view_convert @1)))))
2892 (if (!ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2893 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
2894 (if (outer_op == PLUS_EXPR)
2895 (view_convert (plus @0 (inner_op (view_convert @2) @1)))
2896 (view_convert (minus @0 (neg_inner_op (view_convert @2) @1))))
2897 /* If the constant operation overflows we cannot do the transform
2898 directly as we would introduce undefined overflow, for example
2899 with (a - 1) + INT_MIN. */
2900 (if (types_match (type, @0))
2901 (with { tree cst = const_binop (outer_op == inner_op
2902 ? PLUS_EXPR : MINUS_EXPR,
2903 type, @1, @2); }
2904 (if (cst && !TREE_OVERFLOW (cst))
2905 (inner_op @0 { cst; } )
2906 /* X+INT_MAX+1 is X-INT_MIN. */
2907 (if (INTEGRAL_TYPE_P (type) && cst
2908 && wi::to_wide (cst) == wi::min_value (type))
2909 (neg_inner_op @0 { wide_int_to_tree (type, wi::to_wide (cst)); })
2910 /* Last resort, use some unsigned type. */
2911 (with { tree utype = unsigned_type_for (type); }
2912 (if (utype)
2913 (view_convert (inner_op
2914 (view_convert:utype @0)
2915 (view_convert:utype
2916 { drop_tree_overflow (cst); }))))))))))))))
2918 /* (CST1 - A) +- CST2 -> CST3 - A */
2919 (for outer_op (plus minus)
2920 (simplify
2921 (outer_op (nop_convert? (minus CONSTANT_CLASS_P@1 @0)) CONSTANT_CLASS_P@2)
2922 /* If one of the types wraps, use that one. */
2923 (if (!ANY_INTEGRAL_TYPE_P (type) || TYPE_OVERFLOW_WRAPS (type))
2924 /* If all 3 captures are CONSTANT_CLASS_P, punt, as we might recurse
2925 forever if something doesn't simplify into a constant. */
2926 (if (!CONSTANT_CLASS_P (@0))
2927 (minus (outer_op (view_convert @1) @2) (view_convert @0)))
2928 (if (!ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2929 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
2930 (view_convert (minus (outer_op @1 (view_convert @2)) @0))
2931 (if (types_match (type, @0))
2932 (with { tree cst = const_binop (outer_op, type, @1, @2); }
2933 (if (cst && !TREE_OVERFLOW (cst))
2934 (minus { cst; } @0))))))))
2936 /* CST1 - (CST2 - A) -> CST3 + A
2937 Use view_convert because it is safe for vectors and equivalent for
2938 scalars. */
2939 (simplify
2940 (minus CONSTANT_CLASS_P@1 (nop_convert? (minus CONSTANT_CLASS_P@2 @0)))
2941 /* If one of the types wraps, use that one. */
2942 (if (!ANY_INTEGRAL_TYPE_P (type) || TYPE_OVERFLOW_WRAPS (type))
2943 /* If all 3 captures are CONSTANT_CLASS_P, punt, as we might recurse
2944 forever if something doesn't simplify into a constant. */
2945 (if (!CONSTANT_CLASS_P (@0))
2946 (plus (view_convert @0) (minus @1 (view_convert @2))))
2947 (if (!ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
2948 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
2949 (view_convert (plus @0 (minus (view_convert @1) @2)))
2950 (if (types_match (type, @0))
2951 (with { tree cst = const_binop (MINUS_EXPR, type, @1, @2); }
2952 (if (cst && !TREE_OVERFLOW (cst))
2953 (plus { cst; } @0)))))))
2955 /* ((T)(A)) + CST -> (T)(A + CST) */
2956 #if GIMPLE
2957 (simplify
2958 (plus (convert:s SSA_NAME@0) INTEGER_CST@1)
2959 (if (TREE_CODE (TREE_TYPE (@0)) == INTEGER_TYPE
2960 && TREE_CODE (type) == INTEGER_TYPE
2961 && TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (@0))
2962 && int_fits_type_p (@1, TREE_TYPE (@0)))
2963 /* Perform binary operation inside the cast if the constant fits
2964 and (A + CST)'s range does not overflow. */
2965 (with
2966 {
2967 wi::overflow_type min_ovf = wi::OVF_OVERFLOW,
2968 max_ovf = wi::OVF_OVERFLOW;
2969 tree inner_type = TREE_TYPE (@0);
2971 wide_int w1
2972 = wide_int::from (wi::to_wide (@1), TYPE_PRECISION (inner_type),
2973 TYPE_SIGN (inner_type));
2975 value_range vr;
2976 if (get_global_range_query ()->range_of_expr (vr, @0)
2977 && vr.kind () == VR_RANGE)
2978 {
2979 wide_int wmin0 = vr.lower_bound ();
2980 wide_int wmax0 = vr.upper_bound ();
2981 wi::add (wmin0, w1, TYPE_SIGN (inner_type), &min_ovf);
2982 wi::add (wmax0, w1, TYPE_SIGN (inner_type), &max_ovf);
2983 }
2984 }
2985 (if (min_ovf == wi::OVF_NONE && max_ovf == wi::OVF_NONE)
2986 (convert (plus @0 { wide_int_to_tree (TREE_TYPE (@0), w1); } )))
2987 )))
2988 #endif
2990 /* ((T)(A + CST1)) + CST2 -> (T)(A) + (T)CST1 + CST2 */
2991 #if GIMPLE
2992 (for op (plus minus)
2993 (simplify
2994 (plus (convert:s (op:s @0 INTEGER_CST@1)) INTEGER_CST@2)
2995 (if (TREE_CODE (TREE_TYPE (@0)) == INTEGER_TYPE
2996 && TREE_CODE (type) == INTEGER_TYPE
2997 && TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (@0))
2998 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
2999 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0))
3000 && TYPE_OVERFLOW_WRAPS (type))
3001 (plus (convert @0) (op @2 (convert @1))))))
3002 #endif
3004 /* (T)(A) +- (T)(B) -> (T)(A +- B) only when (A +- B) could be simplified
3005 to a simple value. */
3006 (for op (plus minus)
3007 (simplify
3008 (op (convert @0) (convert @1))
3009 (if (INTEGRAL_TYPE_P (type)
3010 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
3011 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))
3012 && types_match (TREE_TYPE (@0), TREE_TYPE (@1))
3013 && !TYPE_OVERFLOW_TRAPS (type)
3014 && !TYPE_OVERFLOW_SANITIZED (type))
3015 (convert (op! @0 @1)))))
3017 /* ~A + A -> -1 */
3018 (simplify
3019 (plus:c (convert? (bit_not @0)) (convert? @0))
3020 (if (!TYPE_OVERFLOW_TRAPS (type))
3021 (convert { build_all_ones_cst (TREE_TYPE (@0)); })))
3023 /* ~A + 1 -> -A */
3024 (simplify
3025 (plus (convert? (bit_not @0)) integer_each_onep)
3026 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
3027 (negate (convert @0))))
3029 /* -A - 1 -> ~A */
3030 (simplify
3031 (minus (convert? (negate @0)) integer_each_onep)
3032 (if (!TYPE_OVERFLOW_TRAPS (type)
3033 && TREE_CODE (type) != COMPLEX_TYPE
3034 && tree_nop_conversion_p (type, TREE_TYPE (@0)))
3035 (bit_not (convert @0))))
3037 /* -1 - A -> ~A */
3038 (simplify
3039 (minus integer_all_onesp @0)
3040 (if (TREE_CODE (type) != COMPLEX_TYPE)
3041 (bit_not @0)))
3043 /* (T)(P + A) - (T)P -> (T) A */
3044 (simplify
3045 (minus (convert (plus:c @@0 @1))
3046 (convert? @0))
3047 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
3048 /* For integer types, if A has a smaller type
3049 than T the result depends on the possible
3050 overflow in P + A.
3051 E.g. T=size_t, A=(unsigned)429497295, P>0.
3052 However, if an overflow in P + A would cause
3053 undefined behavior, we can assume that there
3054 is no overflow. */
3055 || (INTEGRAL_TYPE_P (TREE_TYPE (@1))
3056 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))))
3057 (convert @1)))
3058 (simplify
3059 (minus (convert (pointer_plus @@0 @1))
3060 (convert @0))
3061 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
3062 /* For pointer types, if the conversion of A to the
3063 final type requires a sign- or zero-extension,
3064 then we have to punt - it is not defined which
3065 one is correct. */
3066 || (POINTER_TYPE_P (TREE_TYPE (@0))
3067 && TREE_CODE (@1) == INTEGER_CST
3068 && tree_int_cst_sign_bit (@1) == 0))
3069 (convert @1)))
3070 (simplify
3071 (pointer_diff (pointer_plus @@0 @1) @0)
3072 /* The second argument of pointer_plus must be interpreted as signed, and
3073 thus sign-extended if necessary. */
3074 (with { tree stype = signed_type_for (TREE_TYPE (@1)); }
3075 /* Use view_convert instead of convert here, as POINTER_PLUS_EXPR
3076 second arg is unsigned even when we need to consider it as signed,
3077 we don't want to diagnose overflow here. */
3078 (convert (view_convert:stype @1))))
3080 /* (T)P - (T)(P + A) -> -(T) A */
3081 (simplify
3082 (minus (convert? @0)
3083 (convert (plus:c @@0 @1)))
3084 (if (INTEGRAL_TYPE_P (type)
3085 && TYPE_OVERFLOW_UNDEFINED (type)
3086 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
3087 (with { tree utype = unsigned_type_for (type); }
3088 (convert (negate (convert:utype @1))))
3089 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
3090 /* For integer types, if A has a smaller type
3091 than T the result depends on the possible
3092 overflow in P + A.
3093 E.g. T=size_t, A=(unsigned)429497295, P>0.
3094 However, if an overflow in P + A would cause
3095 undefined behavior, we can assume that there
3096 is no overflow. */
3097 || (INTEGRAL_TYPE_P (TREE_TYPE (@1))
3098 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))))
3099 (negate (convert @1)))))
3100 (simplify
3101 (minus (convert @0)
3102 (convert (pointer_plus @@0 @1)))
3103 (if (INTEGRAL_TYPE_P (type)
3104 && TYPE_OVERFLOW_UNDEFINED (type)
3105 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
3106 (with { tree utype = unsigned_type_for (type); }
3107 (convert (negate (convert:utype @1))))
3108 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
3109 /* For pointer types, if the conversion of A to the
3110 final type requires a sign- or zero-extension,
3111 then we have to punt - it is not defined which
3112 one is correct. */
3113 || (POINTER_TYPE_P (TREE_TYPE (@0))
3114 && TREE_CODE (@1) == INTEGER_CST
3115 && tree_int_cst_sign_bit (@1) == 0))
3116 (negate (convert @1)))))
3117 (simplify
3118 (pointer_diff @0 (pointer_plus @@0 @1))
3119 /* The second argument of pointer_plus must be interpreted as signed, and
3120 thus sign-extended if necessary. */
3121 (with { tree stype = signed_type_for (TREE_TYPE (@1)); }
3122 /* Use view_convert instead of convert here, as POINTER_PLUS_EXPR
3123 second arg is unsigned even when we need to consider it as signed,
3124 we don't want to diagnose overflow here. */
3125 (negate (convert (view_convert:stype @1)))))
3127 /* (T)(P + A) - (T)(P + B) -> (T)A - (T)B */
3128 (simplify
3129 (minus (convert (plus:c @@0 @1))
3130 (convert (plus:c @0 @2)))
3131 (if (INTEGRAL_TYPE_P (type)
3132 && TYPE_OVERFLOW_UNDEFINED (type)
3133 && element_precision (type) <= element_precision (TREE_TYPE (@1))
3134 && element_precision (type) <= element_precision (TREE_TYPE (@2)))
3135 (with { tree utype = unsigned_type_for (type); }
3136 (convert (minus (convert:utype @1) (convert:utype @2))))
3137 (if (((element_precision (type) <= element_precision (TREE_TYPE (@1)))
3138 == (element_precision (type) <= element_precision (TREE_TYPE (@2))))
3139 && (element_precision (type) <= element_precision (TREE_TYPE (@1))
3140 /* For integer types, if A has a smaller type
3141 than T the result depends on the possible
3142 overflow in P + A.
3143 E.g. T=size_t, A=(unsigned)429497295, P>0.
3144 However, if an overflow in P + A would cause
3145 undefined behavior, we can assume that there
3146 is no overflow. */
3147 || (INTEGRAL_TYPE_P (TREE_TYPE (@1))
3148 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
3149 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@1))
3150 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@2)))))
3151 (minus (convert @1) (convert @2)))))
3152 (simplify
3153 (minus (convert (pointer_plus @@0 @1))
3154 (convert (pointer_plus @0 @2)))
3155 (if (INTEGRAL_TYPE_P (type)
3156 && TYPE_OVERFLOW_UNDEFINED (type)
3157 && element_precision (type) <= element_precision (TREE_TYPE (@1)))
3158 (with { tree utype = unsigned_type_for (type); }
3159 (convert (minus (convert:utype @1) (convert:utype @2))))
3160 (if (element_precision (type) <= element_precision (TREE_TYPE (@1))
3161 /* For pointer types, if the conversion of A to the
3162 final type requires a sign- or zero-extension,
3163 then we have to punt - it is not defined which
3164 one is correct. */
3165 || (POINTER_TYPE_P (TREE_TYPE (@0))
3166 && TREE_CODE (@1) == INTEGER_CST
3167 && tree_int_cst_sign_bit (@1) == 0
3168 && TREE_CODE (@2) == INTEGER_CST
3169 && tree_int_cst_sign_bit (@2) == 0))
3170 (minus (convert @1) (convert @2)))))
3171 (simplify
3172 (pointer_diff (pointer_plus @0 @2) (pointer_plus @1 @2))
3173 (pointer_diff @0 @1))
3174 (simplify
3175 (pointer_diff (pointer_plus @@0 @1) (pointer_plus @0 @2))
3176 /* The second argument of pointer_plus must be interpreted as signed, and
3177 thus sign-extended if necessary. */
3178 (with { tree stype = signed_type_for (TREE_TYPE (@1)); }
3179 /* Use view_convert instead of convert here, as POINTER_PLUS_EXPR
3180 second arg is unsigned even when we need to consider it as signed,
3181 we don't want to diagnose overflow here. */
3182 (minus (convert (view_convert:stype @1))
3183 (convert (view_convert:stype @2)))))))
3185 /* (A * C) +- (B * C) -> (A+-B) * C and (A * C) +- A -> A * (C+-1).
3186 Modeled after fold_plusminus_mult_expr. */
3187 (if (!TYPE_SATURATING (type)
3188 && (!FLOAT_TYPE_P (type) || flag_associative_math))
3189 (for plusminus (plus minus)
3190 (simplify
3191 (plusminus (mult:cs@3 @0 @1) (mult:cs@4 @0 @2))
3192 (if (!ANY_INTEGRAL_TYPE_P (type)
3193 || TYPE_OVERFLOW_WRAPS (type)
3194 || (INTEGRAL_TYPE_P (type)
3195 && tree_expr_nonzero_p (@0)
3196 && expr_not_equal_to (@0, wi::minus_one (TYPE_PRECISION (type)))))
3197 (if (single_use (@3) || single_use (@4))
3198 /* If @1 +- @2 is constant require a hard single-use on either
3199 original operand (but not on both). */
3200 (mult (plusminus @1 @2) @0)
3201 (mult! (plusminus @1 @2) @0)
3202 )))
3203 /* We cannot generate constant 1 for fract. */
3204 (if (!ALL_FRACT_MODE_P (TYPE_MODE (type)))
3205 (simplify
3206 (plusminus @0 (mult:c@3 @0 @2))
3207 (if ((!ANY_INTEGRAL_TYPE_P (type)
3208 || TYPE_OVERFLOW_WRAPS (type)
3209 /* For @0 + @0*@2 this transformation would introduce UB
3210 (where there was none before) for @0 in [-1,0] and @2 max.
3211 For @0 - @0*@2 this transformation would introduce UB
3212 for @0 0 and @2 in [min,min+1] or @0 -1 and @2 min+1. */
3213 || (INTEGRAL_TYPE_P (type)
3214 && ((tree_expr_nonzero_p (@0)
3215 && expr_not_equal_to (@0,
3216 wi::minus_one (TYPE_PRECISION (type))))
3217 || (plusminus == PLUS_EXPR
3218 ? expr_not_equal_to (@2,
3219 wi::max_value (TYPE_PRECISION (type), SIGNED))
3220 /* Let's ignore the @0 -1 and @2 min case. */
3221 : (expr_not_equal_to (@2,
3222 wi::min_value (TYPE_PRECISION (type), SIGNED))
3223 && expr_not_equal_to (@2,
3224 wi::min_value (TYPE_PRECISION (type), SIGNED)
3225 + 1))))))
3226 && single_use (@3))
3227 (mult (plusminus { build_one_cst (type); } @2) @0)))
3228 (simplify
3229 (plusminus (mult:c@3 @0 @2) @0)
3230 (if ((!ANY_INTEGRAL_TYPE_P (type)
3231 || TYPE_OVERFLOW_WRAPS (type)
3232 /* For @0*@2 + @0 this transformation would introduce UB
3233 (where there was none before) for @0 in [-1,0] and @2 max.
3234 For @0*@2 - @0 this transformation would introduce UB
3235 for @0 0 and @2 min. */
3236 || (INTEGRAL_TYPE_P (type)
3237 && ((tree_expr_nonzero_p (@0)
3238 && (plusminus == MINUS_EXPR
3239 || expr_not_equal_to (@0,
3240 wi::minus_one (TYPE_PRECISION (type)))))
3241 || expr_not_equal_to (@2,
3242 (plusminus == PLUS_EXPR
3243 ? wi::max_value (TYPE_PRECISION (type), SIGNED)
3244 : wi::min_value (TYPE_PRECISION (type), SIGNED))))))
3245 && single_use (@3))
3246 (mult (plusminus @2 { build_one_cst (type); }) @0))))))
3248 #if GIMPLE
3249 /* Canonicalize X + (X << C) into X * (1 + (1 << C)) and
3250 (X << C1) + (X << C2) into X * ((1 << C1) + (1 << C2)). */
3251 (simplify
3252 (plus:c @0 (lshift:s @0 INTEGER_CST@1))
3253 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3254 && tree_fits_uhwi_p (@1)
3255 && tree_to_uhwi (@1) < element_precision (type)
3256 && (INTEGRAL_TYPE_P (TREE_TYPE (@0))
3257 || optab_handler (smul_optab,
3258 TYPE_MODE (type)) != CODE_FOR_nothing))
3259 (with { tree t = type;
3260 if (!TYPE_OVERFLOW_WRAPS (t)) t = unsigned_type_for (t);
3261 wide_int w = wi::set_bit_in_zero (tree_to_uhwi (@1),
3262 element_precision (type));
3263 w += 1;
3264 tree cst = wide_int_to_tree (VECTOR_TYPE_P (t) ? TREE_TYPE (t)
3265 : t, w);
3266 cst = build_uniform_cst (t, cst); }
3267 (convert (mult (convert:t @0) { cst; })))))
3268 (simplify
3269 (plus (lshift:s @0 INTEGER_CST@1) (lshift:s @0 INTEGER_CST@2))
3270 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3271 && tree_fits_uhwi_p (@1)
3272 && tree_to_uhwi (@1) < element_precision (type)
3273 && tree_fits_uhwi_p (@2)
3274 && tree_to_uhwi (@2) < element_precision (type)
3275 && (INTEGRAL_TYPE_P (TREE_TYPE (@0))
3276 || optab_handler (smul_optab,
3277 TYPE_MODE (type)) != CODE_FOR_nothing))
3278 (with { tree t = type;
3279 if (!TYPE_OVERFLOW_WRAPS (t)) t = unsigned_type_for (t);
3280 unsigned int prec = element_precision (type);
3281 wide_int w = wi::set_bit_in_zero (tree_to_uhwi (@1), prec);
3282 w += wi::set_bit_in_zero (tree_to_uhwi (@2), prec);
3283 tree cst = wide_int_to_tree (VECTOR_TYPE_P (t) ? TREE_TYPE (t)
3284 : t, w);
3285 cst = build_uniform_cst (t, cst); }
3286 (convert (mult (convert:t @0) { cst; })))))
3287 #endif
3289 /* Canonicalize (X*C1)|(X*C2) and (X*C1)^(X*C2) to (C1+C2)*X when
3290 tree_nonzero_bits allows IOR and XOR to be treated like PLUS.
3291 Likewise, handle (X<<C3) and X as legitimate variants of X*C. */
3292 (for op (bit_ior bit_xor)
3293 (simplify
3294 (op (mult:s@0 @1 INTEGER_CST@2)
3295 (mult:s@3 @1 INTEGER_CST@4))
3296 (if (INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_WRAPS (type)
3297 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@3)) == 0)
3298 (mult @1
3299 { wide_int_to_tree (type, wi::to_wide (@2) + wi::to_wide (@4)); })))
3300 (simplify
3301 (op:c (mult:s@0 @1 INTEGER_CST@2)
3302 (lshift:s@3 @1 INTEGER_CST@4))
3303 (if (INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_WRAPS (type)
3304 && tree_int_cst_sgn (@4) > 0
3305 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@3)) == 0)
3306 (with { wide_int wone = wi::one (TYPE_PRECISION (type));
3307 wide_int c = wi::add (wi::to_wide (@2),
3308 wi::lshift (wone, wi::to_wide (@4))); }
3309 (mult @1 { wide_int_to_tree (type, c); }))))
3310 (simplify
3311 (op:c (mult:s@0 @1 INTEGER_CST@2)
3312 @1)
3313 (if (INTEGRAL_TYPE_P (type) && TYPE_OVERFLOW_WRAPS (type)
3314 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@1)) == 0)
3315 (mult @1
3316 { wide_int_to_tree (type,
3317 wi::add (wi::to_wide (@2), 1)); })))
3318 (simplify
3319 (op (lshift:s@0 @1 INTEGER_CST@2)
3320 (lshift:s@3 @1 INTEGER_CST@4))
3321 (if (INTEGRAL_TYPE_P (type)
3322 && tree_int_cst_sgn (@2) > 0
3323 && tree_int_cst_sgn (@4) > 0
3324 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@3)) == 0)
3325 (with { tree t = type;
3326 if (!TYPE_OVERFLOW_WRAPS (t))
3327 t = unsigned_type_for (t);
3328 wide_int wone = wi::one (TYPE_PRECISION (t));
3329 wide_int c = wi::add (wi::lshift (wone, wi::to_wide (@2)),
3330 wi::lshift (wone, wi::to_wide (@4))); }
3331 (convert (mult:t (convert:t @1) { wide_int_to_tree (t,c); })))))
3332 (simplify
3333 (op:c (lshift:s@0 @1 INTEGER_CST@2)
3334 @1)
3335 (if (INTEGRAL_TYPE_P (type)
3336 && tree_int_cst_sgn (@2) > 0
3337 && (tree_nonzero_bits (@0) & tree_nonzero_bits (@1)) == 0)
3338 (with { tree t = type;
3339 if (!TYPE_OVERFLOW_WRAPS (t))
3340 t = unsigned_type_for (t);
3341 wide_int wone = wi::one (TYPE_PRECISION (t));
3342 wide_int c = wi::add (wi::lshift (wone, wi::to_wide (@2)), wone); }
3343 (convert (mult:t (convert:t @1) { wide_int_to_tree (t, c); }))))))
3345 /* Simplifications of MIN_EXPR, MAX_EXPR, fmin() and fmax(). */
3347 (for minmax (min max)
3348 (simplify
3349 (minmax @0 @0)
3350 @0))
3351 /* For fmin() and fmax(), skip folding when both are sNaN. */
3352 (for minmax (FMIN_ALL FMAX_ALL)
3353 (simplify
3354 (minmax @0 @0)
3355 (if (!tree_expr_maybe_signaling_nan_p (@0))
3356 @0)))
3357 /* min(max(x,y),y) -> y. */
3358 (simplify
3359 (min:c (max:c @0 @1) @1)
3360 @1)
3361 /* max(min(x,y),y) -> y. */
3362 (simplify
3363 (max:c (min:c @0 @1) @1)
3364 @1)
3365 /* max(a,-a) -> abs(a). */
3366 (simplify
3367 (max:c @0 (negate @0))
3368 (if (TREE_CODE (type) != COMPLEX_TYPE
3369 && (! ANY_INTEGRAL_TYPE_P (type)
3370 || TYPE_OVERFLOW_UNDEFINED (type)))
3371 (abs @0)))
3372 /* min(a,-a) -> -abs(a). */
3373 (simplify
3374 (min:c @0 (negate @0))
3375 (if (TREE_CODE (type) != COMPLEX_TYPE
3376 && (! ANY_INTEGRAL_TYPE_P (type)
3377 || TYPE_OVERFLOW_UNDEFINED (type)))
3378 (negate (abs @0))))
3379 (simplify
3380 (min @0 @1)
3381 (switch
3382 (if (INTEGRAL_TYPE_P (type)
3383 && TYPE_MIN_VALUE (type)
3384 && operand_equal_p (@1, TYPE_MIN_VALUE (type), OEP_ONLY_CONST))
3385 @1)
3386 (if (INTEGRAL_TYPE_P (type)
3387 && TYPE_MAX_VALUE (type)
3388 && operand_equal_p (@1, TYPE_MAX_VALUE (type), OEP_ONLY_CONST))
3389 @0)))
3390 (simplify
3391 (max @0 @1)
3392 (switch
3393 (if (INTEGRAL_TYPE_P (type)
3394 && TYPE_MAX_VALUE (type)
3395 && operand_equal_p (@1, TYPE_MAX_VALUE (type), OEP_ONLY_CONST))
3396 @1)
3397 (if (INTEGRAL_TYPE_P (type)
3398 && TYPE_MIN_VALUE (type)
3399 && operand_equal_p (@1, TYPE_MIN_VALUE (type), OEP_ONLY_CONST))
3400 @0)))
3402 /* max (a, a + CST) -> a + CST where CST is positive. */
3403 /* max (a, a + CST) -> a where CST is negative. */
3404 (simplify
3405 (max:c @0 (plus@2 @0 INTEGER_CST@1))
3406 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
3407 (if (tree_int_cst_sgn (@1) > 0)
3408 @2
3409 @0)))
3411 /* min (a, a + CST) -> a where CST is positive. */
3412 /* min (a, a + CST) -> a + CST where CST is negative. */
3413 (simplify
3414 (min:c @0 (plus@2 @0 INTEGER_CST@1))
3415 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
3416 (if (tree_int_cst_sgn (@1) > 0)
3417 @0
3418 @2)))
3420 /* Simplify min (&var[off0], &var[off1]) etc. depending on whether
3421 the addresses are known to be less, equal or greater. */
3422 (for minmax (min max)
3423 cmp (lt gt)
3424 (simplify
3425 (minmax (convert1?@2 addr@0) (convert2?@3 addr@1))
3426 (with
3427 {
3428 poly_int64 off0, off1;
3429 tree base0, base1;
3430 int equal = address_compare (cmp, TREE_TYPE (@2), @0, @1, base0, base1,
3431 off0, off1, GENERIC);
3432 }
3433 (if (equal == 1)
3434 (if (minmax == MIN_EXPR)
3435 (if (known_le (off0, off1))
3436 @2
3437 (if (known_gt (off0, off1))
3438 @3))
3439 (if (known_ge (off0, off1))
3440 @2
3441 (if (known_lt (off0, off1))
3442 @3)))))))
3444 /* (convert (minmax ((convert (x) c)))) -> minmax (x c) if x is promoted
3445 and the outer convert demotes the expression back to x's type. */
3446 (for minmax (min max)
3447 (simplify
3448 (convert (minmax@0 (convert @1) INTEGER_CST@2))
3449 (if (INTEGRAL_TYPE_P (type)
3450 && types_match (@1, type) && int_fits_type_p (@2, type)
3451 && TYPE_SIGN (TREE_TYPE (@0)) == TYPE_SIGN (type)
3452 && TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (type))
3453 (minmax @1 (convert @2)))))
3455 (for minmax (FMIN_ALL FMAX_ALL)
3456 /* If either argument is NaN and other one is not sNaN, return the other
3457 one. Avoid the transformation if we get (and honor) a signalling NaN. */
3458 (simplify
3459 (minmax:c @0 REAL_CST@1)
3460 (if (real_isnan (TREE_REAL_CST_PTR (@1))
3461 && (!HONOR_SNANS (@1) || !TREE_REAL_CST (@1).signalling)
3462 && !tree_expr_maybe_signaling_nan_p (@0))
3463 @0)))
3464 /* Convert fmin/fmax to MIN_EXPR/MAX_EXPR. C99 requires these
3465 functions to return the numeric arg if the other one is NaN.
3466 MIN and MAX don't honor that, so only transform if -ffinite-math-only
3467 is set. C99 doesn't require -0.0 to be handled, so we don't have to
3468 worry about it either. */
3469 (if (flag_finite_math_only)
3470 (simplify
3471 (FMIN_ALL @0 @1)
3472 (min @0 @1))
3473 (simplify
3474 (FMAX_ALL @0 @1)
3475 (max @0 @1)))
3476 /* min (-A, -B) -> -max (A, B) */
3477 (for minmax (min max FMIN_ALL FMAX_ALL)
3478 maxmin (max min FMAX_ALL FMIN_ALL)
3479 (simplify
3480 (minmax (negate:s@2 @0) (negate:s@3 @1))
3481 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
3482 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
3483 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))))
3484 (negate (maxmin @0 @1)))))
3485 /* MIN (~X, ~Y) -> ~MAX (X, Y)
3486 MAX (~X, ~Y) -> ~MIN (X, Y) */
3487 (for minmax (min max)
3488 maxmin (max min)
3489 (simplify
3490 (minmax (bit_not:s@2 @0) (bit_not:s@3 @1))
3491 (bit_not (maxmin @0 @1))))
3493 /* MIN (X, Y) == X -> X <= Y */
3494 (for minmax (min min max max)
3495 cmp (eq ne eq ne )
3496 out (le gt ge lt )
3497 (simplify
3498 (cmp:c (minmax:c @0 @1) @0)
3499 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0)))
3500 (out @0 @1))))
3501 /* MIN (X, 5) == 0 -> X == 0
3502 MIN (X, 5) == 7 -> false */
3503 (for cmp (eq ne)
3504 (simplify
3505 (cmp (min @0 INTEGER_CST@1) INTEGER_CST@2)
3506 (if (wi::lt_p (wi::to_wide (@1), wi::to_wide (@2),
3507 TYPE_SIGN (TREE_TYPE (@0))))
3508 { constant_boolean_node (cmp == NE_EXPR, type); }
3509 (if (wi::gt_p (wi::to_wide (@1), wi::to_wide (@2),
3510 TYPE_SIGN (TREE_TYPE (@0))))
3511 (cmp @0 @2)))))
3512 (for cmp (eq ne)
3513 (simplify
3514 (cmp (max @0 INTEGER_CST@1) INTEGER_CST@2)
3515 (if (wi::gt_p (wi::to_wide (@1), wi::to_wide (@2),
3516 TYPE_SIGN (TREE_TYPE (@0))))
3517 { constant_boolean_node (cmp == NE_EXPR, type); }
3518 (if (wi::lt_p (wi::to_wide (@1), wi::to_wide (@2),
3519 TYPE_SIGN (TREE_TYPE (@0))))
3520 (cmp @0 @2)))))
3521 /* MIN (X, C1) < C2 -> X < C2 || C1 < C2 */
3522 (for minmax (min min max max min min max max )
3523 cmp (lt le gt ge gt ge lt le )
3524 comb (bit_ior bit_ior bit_ior bit_ior bit_and bit_and bit_and bit_and)
3525 (simplify
3526 (cmp (minmax @0 INTEGER_CST@1) INTEGER_CST@2)
3527 (comb (cmp @0 @2) (cmp @1 @2))))
3529 /* X <= MAX(X, Y) -> true
3530 X > MAX(X, Y) -> false
3531 X >= MIN(X, Y) -> true
3532 X < MIN(X, Y) -> false */
3533 (for minmax (min min max max )
3534 cmp (ge lt le gt )
3535 (simplify
3536 (cmp @0 (minmax:c @0 @1))
3537 { constant_boolean_node (cmp == GE_EXPR || cmp == LE_EXPR, type); } ))
3539 /* Undo fancy ways of writing max/min or other ?: expressions, like
3540 a - ((a - b) & -(a < b)) and a - (a - b) * (a < b) into (a < b) ? b : a.
3541 People normally use ?: and that is what we actually try to optimize. */
3542 /* Transform A + (B-A)*cmp into cmp ? B : A. */
3543 (simplify
3544 (plus:c @0 (mult:c (minus @1 @0) zero_one_valued_p@2))
3545 (if (INTEGRAL_TYPE_P (type)
3546 && (GIMPLE || !TREE_SIDE_EFFECTS (@1)))
3547 (cond (convert:boolean_type_node @2) @1 @0)))
3548 /* Transform A - (A-B)*cmp into cmp ? B : A. */
3549 (simplify
3550 (minus @0 (mult:c (minus @0 @1) zero_one_valued_p@2))
3551 (if (INTEGRAL_TYPE_P (type)
3552 && (GIMPLE || !TREE_SIDE_EFFECTS (@1)))
3553 (cond (convert:boolean_type_node @2) @1 @0)))
3554 /* Transform A ^ (A^B)*cmp into cmp ? B : A. */
3555 (simplify
3556 (bit_xor:c @0 (mult:c (bit_xor:c @0 @1) zero_one_valued_p@2))
3557 (if (INTEGRAL_TYPE_P (type)
3558 && (GIMPLE || !TREE_SIDE_EFFECTS (@1)))
3559 (cond (convert:boolean_type_node @2) @1 @0)))
3561 /* (x <= 0 ? -x : 0) -> max(-x, 0). */
3562 (simplify
3563 (cond (le @0 integer_zerop@1) (negate@2 @0) integer_zerop@1)
3564 (max @2 @1))
3566 /* ((x & 0x1) == 0) ? y : z <op> y -> (-(typeof(y))(x & 0x1) & z) <op> y */
3567 (for op (bit_xor bit_ior)
3568 (simplify
3569 (cond (eq zero_one_valued_p@0
3570 integer_zerop)
3571 @1
3572 (op:c @2 @1))
3573 (if (INTEGRAL_TYPE_P (type)
3574 && TYPE_PRECISION (type) > 1
3575 && (INTEGRAL_TYPE_P (TREE_TYPE (@0))))
3576 (op (bit_and (negate (convert:type @0)) @2) @1))))
3578 /* ((x & 0x1) == 0) ? z <op> y : y -> (-(typeof(y))(x & 0x1) & z) <op> y */
3579 (for op (bit_xor bit_ior)
3580 (simplify
3581 (cond (ne zero_one_valued_p@0
3582 integer_zerop)
3583 (op:c @2 @1)
3584 @1)
3585 (if (INTEGRAL_TYPE_P (type)
3586 && TYPE_PRECISION (type) > 1
3587 && (INTEGRAL_TYPE_P (TREE_TYPE (@0))))
3588 (op (bit_and (negate (convert:type @0)) @2) @1))))
3590 /* Simplifications of shift and rotates. */
3592 (for rotate (lrotate rrotate)
3593 (simplify
3594 (rotate integer_all_onesp@0 @1)
3595 @0))
3597 /* Optimize -1 >> x for arithmetic right shifts. */
3598 (simplify
3599 (rshift integer_all_onesp@0 @1)
3600 (if (!TYPE_UNSIGNED (type))
3601 @0))
3603 /* Optimize (x >> c) << c into x & (-1<<c). */
3604 (simplify
3605 (lshift (nop_convert? (rshift @0 INTEGER_CST@1)) @1)
3606 (if (wi::ltu_p (wi::to_wide (@1), element_precision (type)))
3607 /* It doesn't matter if the right shift is arithmetic or logical. */
3608 (bit_and (view_convert @0) (lshift { build_minus_one_cst (type); } @1))))
3610 (simplify
3611 (lshift (convert (convert@2 (rshift @0 INTEGER_CST@1))) @1)
3612 (if (wi::ltu_p (wi::to_wide (@1), element_precision (type))
3613 /* Allow intermediate conversion to integral type with whatever sign, as
3614 long as the low TYPE_PRECISION (type)
3615 - TYPE_PRECISION (TREE_TYPE (@2)) bits are preserved. */
3616 && INTEGRAL_TYPE_P (type)
3617 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
3618 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
3619 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (@0))
3620 && (TYPE_PRECISION (TREE_TYPE (@2)) >= TYPE_PRECISION (type)
3621 || wi::geu_p (wi::to_wide (@1),
3622 TYPE_PRECISION (type)
3623 - TYPE_PRECISION (TREE_TYPE (@2)))))
3624 (bit_and (convert @0) (lshift { build_minus_one_cst (type); } @1))))
3626 /* Optimize (x << c) >> c into x & ((unsigned)-1 >> c) for unsigned
3627 types. */
3628 (simplify
3629 (rshift (lshift @0 INTEGER_CST@1) @1)
3630 (if (TYPE_UNSIGNED (type)
3631 && (wi::ltu_p (wi::to_wide (@1), element_precision (type))))
3632 (bit_and @0 (rshift { build_minus_one_cst (type); } @1))))
3634 /* Optimize x >> x into 0 */
3635 (simplify
3636 (rshift @0 @0)
3637 { build_zero_cst (type); })
3639 (for shiftrotate (lrotate rrotate lshift rshift)
3640 (simplify
3641 (shiftrotate @0 integer_zerop)
3642 (non_lvalue @0))
3643 (simplify
3644 (shiftrotate integer_zerop@0 @1)
3645 @0)
3646 /* Prefer vector1 << scalar to vector1 << vector2
3647 if vector2 is uniform. */
3648 (for vec (VECTOR_CST CONSTRUCTOR)
3649 (simplify
3650 (shiftrotate @0 vec@1)
3651 (with { tree tem = uniform_vector_p (@1); }
3652 (if (tem)
3653 (shiftrotate @0 { tem; }))))))
3655 /* Simplify X << Y where Y's low width bits are 0 to X, as only valid
3656 Y is 0. Similarly for X >> Y. */
3657 #if GIMPLE
3658 (for shift (lshift rshift)
3659 (simplify
3660 (shift @0 SSA_NAME@1)
3661 (if (INTEGRAL_TYPE_P (TREE_TYPE (@1)))
3662 (with {
3663 int width = ceil_log2 (element_precision (TREE_TYPE (@0)));
3664 int prec = TYPE_PRECISION (TREE_TYPE (@1));
3665 }
3666 (if ((get_nonzero_bits (@1) & wi::mask (width, false, prec)) == 0)
3667 @0)))))
3668 #endif
3670 /* Rewrite an LROTATE_EXPR by a constant into an
3671 RROTATE_EXPR by a new constant. */
3672 (simplify
3673 (lrotate @0 INTEGER_CST@1)
3674 (rrotate @0 { const_binop (MINUS_EXPR, TREE_TYPE (@1),
3675 build_int_cst (TREE_TYPE (@1),
3676 element_precision (type)), @1); }))
3678 /* Turn (a OP c1) OP c2 into a OP (c1+c2). */
3679 (for op (lrotate rrotate rshift lshift)
3680 (simplify
3681 (op (op @0 INTEGER_CST@1) INTEGER_CST@2)
3682 (with { unsigned int prec = element_precision (type); }
3683 (if (wi::ge_p (wi::to_wide (@1), 0, TYPE_SIGN (TREE_TYPE (@1)))
3684 && wi::lt_p (wi::to_wide (@1), prec, TYPE_SIGN (TREE_TYPE (@1)))
3685 && wi::ge_p (wi::to_wide (@2), 0, TYPE_SIGN (TREE_TYPE (@2)))
3686 && wi::lt_p (wi::to_wide (@2), prec, TYPE_SIGN (TREE_TYPE (@2))))
3687 (with { unsigned int low = (tree_to_uhwi (@1)
3688 + tree_to_uhwi (@2)); }
3689 /* Deal with a OP (c1 + c2) being undefined but (a OP c1) OP c2
3690 being well defined. */
3691 (if (low >= prec)
3692 (if (op == LROTATE_EXPR || op == RROTATE_EXPR)
3693 (op @0 { build_int_cst (TREE_TYPE (@1), low % prec); })
3694 (if (TYPE_UNSIGNED (type) || op == LSHIFT_EXPR)
3695 { build_zero_cst (type); }
3696 (op @0 { build_int_cst (TREE_TYPE (@1), prec - 1); })))
3697 (op @0 { build_int_cst (TREE_TYPE (@1), low); })))))))
3700 /* Simplify (CST << x) & 1 to 0 if CST is even or to x == 0 if it is odd. */
3701 (simplify
3702 (bit_and (lshift INTEGER_CST@1 @0) integer_onep)
3703 (if ((wi::to_wide (@1) & 1) != 0)
3704 (convert (eq:boolean_type_node @0 { build_zero_cst (TREE_TYPE (@0)); }))
3705 { build_zero_cst (type); }))
3707 /* Simplify ((C << x) & D) != 0 where C and D are power of two constants,
3708 either to false if D is smaller (unsigned comparison) than C, or to
3709 x == log2 (D) - log2 (C). Similarly for right shifts. */
3710 (for cmp (ne eq)
3711 icmp (eq ne)
3712 (simplify
3713 (cmp (bit_and (lshift integer_pow2p@1 @0) integer_pow2p@2) integer_zerop)
3714 (with { int c1 = wi::clz (wi::to_wide (@1));
3715 int c2 = wi::clz (wi::to_wide (@2)); }
3716 (if (c1 < c2)
3717 { constant_boolean_node (cmp == NE_EXPR ? false : true, type); }
3718 (icmp @0 { build_int_cst (TREE_TYPE (@0), c1 - c2); }))))
3719 (simplify
3720 (cmp (bit_and (rshift integer_pow2p@1 @0) integer_pow2p@2) integer_zerop)
3721 (if (tree_int_cst_sgn (@1) > 0)
3722 (with { int c1 = wi::clz (wi::to_wide (@1));
3723 int c2 = wi::clz (wi::to_wide (@2)); }
3724 (if (c1 > c2)
3725 { constant_boolean_node (cmp == NE_EXPR ? false : true, type); }
3726 (icmp @0 { build_int_cst (TREE_TYPE (@0), c2 - c1); }))))))
3728 /* (CST1 << A) == CST2 -> A == ctz (CST2) - ctz (CST1)
3729 (CST1 << A) != CST2 -> A != ctz (CST2) - ctz (CST1)
3730 if CST2 != 0. */
3731 (for cmp (ne eq)
3732 (simplify
3733 (cmp (lshift INTEGER_CST@0 @1) INTEGER_CST@2)
3734 (with { int cand = wi::ctz (wi::to_wide (@2)) - wi::ctz (wi::to_wide (@0)); }
3735 (if (cand < 0
3736 || (!integer_zerop (@2)
3737 && wi::lshift (wi::to_wide (@0), cand) != wi::to_wide (@2)))
3738 { constant_boolean_node (cmp == NE_EXPR, type); }
3739 (if (!integer_zerop (@2)
3740 && wi::lshift (wi::to_wide (@0), cand) == wi::to_wide (@2))
3741 (cmp @1 { build_int_cst (TREE_TYPE (@1), cand); }))))))
3743 /* Fold ((X << C1) & C2) cmp C3 into (X & (C2 >> C1)) cmp (C3 >> C1)
3744 ((X >> C1) & C2) cmp C3 into (X & (C2 << C1)) cmp (C3 << C1). */
3745 (for cmp (ne eq)
3746 (simplify
3747 (cmp (bit_and:s (lshift:s @0 INTEGER_CST@1) INTEGER_CST@2) INTEGER_CST@3)
3748 (if (tree_fits_shwi_p (@1)
3749 && tree_to_shwi (@1) > 0
3750 && tree_to_shwi (@1) < TYPE_PRECISION (TREE_TYPE (@0)))
3751 (if (tree_to_shwi (@1) > wi::ctz (wi::to_wide (@3)))
3752 { constant_boolean_node (cmp == NE_EXPR, type); }
3753 (with { wide_int c1 = wi::to_wide (@1);
3754 wide_int c2 = wi::lrshift (wi::to_wide (@2), c1);
3755 wide_int c3 = wi::lrshift (wi::to_wide (@3), c1); }
3756 (cmp (bit_and @0 { wide_int_to_tree (TREE_TYPE (@0), c2); })
3757 { wide_int_to_tree (TREE_TYPE (@0), c3); })))))
3758 (simplify
3759 (cmp (bit_and:s (rshift:s @0 INTEGER_CST@1) INTEGER_CST@2) INTEGER_CST@3)
3760 (if (tree_fits_shwi_p (@1)
3761 && tree_to_shwi (@1) > 0
3762 && tree_to_shwi (@1) < TYPE_PRECISION (TREE_TYPE (@0)))
3763 (with { tree t0 = TREE_TYPE (@0);
3764 unsigned int prec = TYPE_PRECISION (t0);
3765 wide_int c1 = wi::to_wide (@1);
3766 wide_int c2 = wi::to_wide (@2);
3767 wide_int c3 = wi::to_wide (@3);
3768 wide_int sb = wi::set_bit_in_zero (prec - 1, prec); }
3769 (if ((c2 & c3) != c3)
3770 { constant_boolean_node (cmp == NE_EXPR, type); }
3771 (if (TYPE_UNSIGNED (t0))
3772 (if ((c3 & wi::arshift (sb, c1 - 1)) != 0)
3773 { constant_boolean_node (cmp == NE_EXPR, type); }
3774 (cmp (bit_and @0 { wide_int_to_tree (t0, c2 << c1); })
3775 { wide_int_to_tree (t0, c3 << c1); }))
3776 (with { wide_int smask = wi::arshift (sb, c1); }
3777 (switch
3778 (if ((c2 & smask) == 0)
3779 (cmp (bit_and @0 { wide_int_to_tree (t0, c2 << c1); })
3780 { wide_int_to_tree (t0, c3 << c1); }))
3781 (if ((c3 & smask) == 0)
3782 (cmp (bit_and @0 { wide_int_to_tree (t0, (c2 << c1) | sb); })
3783 { wide_int_to_tree (t0, c3 << c1); }))
3784 (if ((c2 & smask) != (c3 & smask))
3785 { constant_boolean_node (cmp == NE_EXPR, type); })
3786 (cmp (bit_and @0 { wide_int_to_tree (t0, (c2 << c1) | sb); })
3787 { wide_int_to_tree (t0, (c3 << c1) | sb); })))))))))
3789 /* Fold (X << C1) & C2 into (X << C1) & (C2 | ((1 << C1) - 1))
3790 (X >> C1) & C2 into (X >> C1) & (C2 | ~((type) -1 >> C1))
3791 if the new mask might be further optimized. */
3792 (for shift (lshift rshift)
3793 (simplify
3794 (bit_and (convert?:s@4 (shift:s@5 (convert1?@3 @0) INTEGER_CST@1))
3795 INTEGER_CST@2)
3796 (if (tree_nop_conversion_p (TREE_TYPE (@4), TREE_TYPE (@5))
3797 && TYPE_PRECISION (type) <= HOST_BITS_PER_WIDE_INT
3798 && tree_fits_uhwi_p (@1)
3799 && tree_to_uhwi (@1) > 0
3800 && tree_to_uhwi (@1) < TYPE_PRECISION (type))
3801 (with
3802 {
3803 unsigned int shiftc = tree_to_uhwi (@1);
3804 unsigned HOST_WIDE_INT mask = TREE_INT_CST_LOW (@2);
3805 unsigned HOST_WIDE_INT newmask, zerobits = 0;
3806 tree shift_type = TREE_TYPE (@3);
3807 unsigned int prec;
3809 if (shift == LSHIFT_EXPR)
3810 zerobits = ((HOST_WIDE_INT_1U << shiftc) - 1);
3811 else if (shift == RSHIFT_EXPR
3812 && type_has_mode_precision_p (shift_type))
3813 {
3814 prec = TYPE_PRECISION (TREE_TYPE (@3));
3815 tree arg00 = @0;
3816 /* See if more bits can be proven as zero because of
3817 zero extension. */
3818 if (@3 != @0
3819 && TYPE_UNSIGNED (TREE_TYPE (@0)))
3820 {
3821 tree inner_type = TREE_TYPE (@0);
3822 if (type_has_mode_precision_p (inner_type)
3823 && TYPE_PRECISION (inner_type) < prec)
3824 {
3825 prec = TYPE_PRECISION (inner_type);
3826 /* See if we can shorten the right shift. */
3827 if (shiftc < prec)
3828 shift_type = inner_type;
3829 /* Otherwise X >> C1 is all zeros, so we'll optimize
3830 it into (X, 0) later on by making sure zerobits
3831 is all ones. */
3832 }
3833 }
3834 zerobits = HOST_WIDE_INT_M1U;
3835 if (shiftc < prec)
3836 {
3837 zerobits >>= HOST_BITS_PER_WIDE_INT - shiftc;
3838 zerobits <<= prec - shiftc;
3839 }
3840 /* For arithmetic shift if sign bit could be set, zerobits
3841 can contain actually sign bits, so no transformation is
3842 possible, unless MASK masks them all away. In that
3843 case the shift needs to be converted into logical shift. */
3844 if (!TYPE_UNSIGNED (TREE_TYPE (@3))
3845 && prec == TYPE_PRECISION (TREE_TYPE (@3)))
3846 {
3847 if ((mask & zerobits) == 0)
3848 shift_type = unsigned_type_for (TREE_TYPE (@3));
3849 else
3850 zerobits = 0;
3851 }
3852 }
3853 }
3854 /* ((X << 16) & 0xff00) is (X, 0). */
3855 (if ((mask & zerobits) == mask)
3856 { build_int_cst (type, 0); }
3857 (with { newmask = mask | zerobits; }
3858 (if (newmask != mask && (newmask & (newmask + 1)) == 0)
3859 (with
3860 {
3861 /* Only do the transformation if NEWMASK is some integer
3862 mode's mask. */
3863 for (prec = BITS_PER_UNIT;
3864 prec < HOST_BITS_PER_WIDE_INT; prec <<= 1)
3865 if (newmask == (HOST_WIDE_INT_1U << prec) - 1)
3866 break;
3867 }
3868 (if (prec < HOST_BITS_PER_WIDE_INT
3869 || newmask == HOST_WIDE_INT_M1U)
3870 (with
3871 { tree newmaskt = build_int_cst_type (TREE_TYPE (@2), newmask); }
3872 (if (!tree_int_cst_equal (newmaskt, @2))
3873 (if (shift_type != TREE_TYPE (@3))
3874 (bit_and (convert (shift:shift_type (convert @3) @1)) { newmaskt; })
3875 (bit_and @4 { newmaskt; })))))))))))))
3877 /* ((1 << n) & M) != 0 -> n == log2 (M) */
3878 (for cmp (ne eq)
3879 icmp (eq ne)
3880 (simplify
3881 (cmp
3882 (bit_and
3883 (nop_convert? (lshift integer_onep @0)) integer_pow2p@1) integer_zerop)
3884 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)))
3885 (icmp @0 { wide_int_to_tree (TREE_TYPE (@0),
3886 wi::exact_log2 (wi::to_wide (@1))); }))))
3888 /* Fold (X {&,^,|} C2) << C1 into (X << C1) {&,^,|} (C2 << C1)
3889 (X {&,^,|} C2) >> C1 into (X >> C1) & (C2 >> C1). */
3890 (for shift (lshift rshift)
3891 (for bit_op (bit_and bit_xor bit_ior)
3892 (simplify
3893 (shift (convert?:s (bit_op:s @0 INTEGER_CST@2)) INTEGER_CST@1)
3894 (if (tree_nop_conversion_p (type, TREE_TYPE (@0)))
3895 (with { tree mask = int_const_binop (shift, fold_convert (type, @2), @1); }
3896 (if (mask)
3897 (bit_op (shift (convert @0) @1) { mask; })))))))
3899 /* ~(~X >> Y) -> X >> Y (for arithmetic shift). */
3900 (simplify
3901 (bit_not (convert1?:s (rshift:s (convert2?@0 (bit_not @1)) @2)))
3902 (if (!TYPE_UNSIGNED (TREE_TYPE (@0))
3903 && (element_precision (TREE_TYPE (@0))
3904 <= element_precision (TREE_TYPE (@1))
3905 || !TYPE_UNSIGNED (TREE_TYPE (@1))))
3906 (with
3907 { tree shift_type = TREE_TYPE (@0); }
3908 (convert (rshift (convert:shift_type @1) @2)))))
3910 /* ~(~X >>r Y) -> X >>r Y
3911 ~(~X <<r Y) -> X <<r Y */
3912 (for rotate (lrotate rrotate)
3913 (simplify
3914 (bit_not (convert1?:s (rotate:s (convert2?@0 (bit_not @1)) @2)))
3915 (if ((element_precision (TREE_TYPE (@0))
3916 <= element_precision (TREE_TYPE (@1))
3917 || !TYPE_UNSIGNED (TREE_TYPE (@1)))
3918 && (element_precision (type) <= element_precision (TREE_TYPE (@0))
3919 || !TYPE_UNSIGNED (TREE_TYPE (@0))))
3920 (with
3921 { tree rotate_type = TREE_TYPE (@0); }
3922 (convert (rotate (convert:rotate_type @1) @2))))))
3924 (for cmp (eq ne)
3925 (for rotate (lrotate rrotate)
3926 invrot (rrotate lrotate)
3927 /* (X >>r Y) cmp (Z >>r Y) may simplify to X cmp Y. */
3928 (simplify
3929 (cmp (rotate @1 @0) (rotate @2 @0))
3930 (cmp @1 @2))
3931 /* (X >>r C1) cmp C2 may simplify to X cmp C3. */
3932 (simplify
3933 (cmp (rotate @0 INTEGER_CST@1) INTEGER_CST@2)
3934 (cmp @0 { const_binop (invrot, TREE_TYPE (@0), @2, @1); }))
3935 /* (X >>r Y) cmp C where C is 0 or ~0, may simplify to X cmp C. */
3936 (simplify
3937 (cmp (rotate @0 @1) INTEGER_CST@2)
3938 (if (integer_zerop (@2) || integer_all_onesp (@2))
3939 (cmp @0 @2)))))
3941 /* Narrow a lshift by constant. */
3942 (simplify
3943 (convert (lshift:s@0 @1 INTEGER_CST@2))
3944 (if (INTEGRAL_TYPE_P (type)
3945 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
3946 && !integer_zerop (@2)
3947 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0)))
3948 (if (TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (@0))
3949 || wi::ltu_p (wi::to_wide (@2), TYPE_PRECISION (type)))
3950 (lshift (convert @1) @2)
3951 (if (wi::ltu_p (wi::to_wide (@2), TYPE_PRECISION (TREE_TYPE (@0))))
3952 { build_zero_cst (type); }))))
3954 /* Simplifications of conversions. */
3956 /* Basic strip-useless-type-conversions / strip_nops. */
3957 (for cvt (convert view_convert float fix_trunc)
3958 (simplify
3959 (cvt @0)
3960 (if ((GIMPLE && useless_type_conversion_p (type, TREE_TYPE (@0)))
3961 || (GENERIC && type == TREE_TYPE (@0)))
3962 @0)))
3964 /* Contract view-conversions. */
3965 (simplify
3966 (view_convert (view_convert @0))
3967 (view_convert @0))
3969 /* For integral conversions with the same precision or pointer
3970 conversions use a NOP_EXPR instead. */
3971 (simplify
3972 (view_convert @0)
3973 (if ((INTEGRAL_TYPE_P (type) || POINTER_TYPE_P (type))
3974 && (INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))
3975 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (@0)))
3976 (convert @0)))
3978 /* Strip inner integral conversions that do not change precision or size, or
3979 zero-extend while keeping the same size (for bool-to-char). */
3980 (simplify
3981 (view_convert (convert@0 @1))
3982 (if ((INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))
3983 && (INTEGRAL_TYPE_P (TREE_TYPE (@1)) || POINTER_TYPE_P (TREE_TYPE (@1)))
3984 && TYPE_SIZE (TREE_TYPE (@0)) == TYPE_SIZE (TREE_TYPE (@1))
3985 && (TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1))
3986 || (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (TREE_TYPE (@1))
3987 && TYPE_UNSIGNED (TREE_TYPE (@1)))))
3988 (view_convert @1)))
3990 /* Simplify a view-converted empty or single-element constructor. */
3991 (simplify
3992 (view_convert CONSTRUCTOR@0)
3993 (with
3994 { tree ctor = (TREE_CODE (@0) == SSA_NAME
3995 ? gimple_assign_rhs1 (SSA_NAME_DEF_STMT (@0)) : @0); }
3996 (switch
3997 (if (CONSTRUCTOR_NELTS (ctor) == 0)
3998 { build_zero_cst (type); })
3999 (if (CONSTRUCTOR_NELTS (ctor) == 1
4000 && VECTOR_TYPE_P (TREE_TYPE (ctor))
4001 && operand_equal_p (TYPE_SIZE (type),
4002 TYPE_SIZE (TREE_TYPE
4003 (CONSTRUCTOR_ELT (ctor, 0)->value))))
4004 (view_convert { CONSTRUCTOR_ELT (ctor, 0)->value; })))))
4006 /* Re-association barriers around constants and other re-association
4007 barriers can be removed. */
4008 (simplify
4009 (paren CONSTANT_CLASS_P@0)
4010 @0)
4011 (simplify
4012 (paren (paren@1 @0))
4013 @1)
4015 /* Handle cases of two conversions in a row. */
4016 (for ocvt (convert float fix_trunc)
4017 (for icvt (convert float)
4018 (simplify
4019 (ocvt (icvt@1 @0))
4020 (with
4021 {
4022 tree inside_type = TREE_TYPE (@0);
4023 tree inter_type = TREE_TYPE (@1);
4024 int inside_int = INTEGRAL_TYPE_P (inside_type);
4025 int inside_ptr = POINTER_TYPE_P (inside_type);
4026 int inside_float = FLOAT_TYPE_P (inside_type);
4027 int inside_vec = VECTOR_TYPE_P (inside_type);
4028 unsigned int inside_prec = TYPE_PRECISION (inside_type);
4029 int inside_unsignedp = TYPE_UNSIGNED (inside_type);
4030 int inter_int = INTEGRAL_TYPE_P (inter_type);
4031 int inter_ptr = POINTER_TYPE_P (inter_type);
4032 int inter_float = FLOAT_TYPE_P (inter_type);
4033 int inter_vec = VECTOR_TYPE_P (inter_type);
4034 unsigned int inter_prec = TYPE_PRECISION (inter_type);
4035 int inter_unsignedp = TYPE_UNSIGNED (inter_type);
4036 int final_int = INTEGRAL_TYPE_P (type);
4037 int final_ptr = POINTER_TYPE_P (type);
4038 int final_float = FLOAT_TYPE_P (type);
4039 int final_vec = VECTOR_TYPE_P (type);
4040 unsigned int final_prec = TYPE_PRECISION (type);
4041 int final_unsignedp = TYPE_UNSIGNED (type);
4042 }
4043 (switch
4044 /* In addition to the cases of two conversions in a row
4045 handled below, if we are converting something to its own
4046 type via an object of identical or wider precision, neither
4047 conversion is needed. */
4048 (if (((GIMPLE && useless_type_conversion_p (type, inside_type))
4049 || (GENERIC
4050 && TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (inside_type)))
4051 && (((inter_int || inter_ptr) && final_int)
4052 || (inter_float && final_float))
4053 && inter_prec >= final_prec)
4054 (ocvt @0))
4056 /* Likewise, if the intermediate and initial types are either both
4057 float or both integer, we don't need the middle conversion if the
4058 former is wider than the latter and doesn't change the signedness
4059 (for integers). Avoid this if the final type is a pointer since
4060 then we sometimes need the middle conversion. */
4061 (if (((inter_int && inside_int) || (inter_float && inside_float))
4062 && (final_int || final_float)
4063 && inter_prec >= inside_prec
4064 && (inter_float || inter_unsignedp == inside_unsignedp))
4065 (ocvt @0))
4067 /* If we have a sign-extension of a zero-extended value, we can
4068 replace that by a single zero-extension. Likewise if the
4069 final conversion does not change precision we can drop the
4070 intermediate conversion. */
4071 (if (inside_int && inter_int && final_int
4072 && ((inside_prec < inter_prec && inter_prec < final_prec
4073 && inside_unsignedp && !inter_unsignedp)
4074 || final_prec == inter_prec))
4075 (ocvt @0))
4077 /* Two conversions in a row are not needed unless:
4078 - some conversion is floating-point (overstrict for now), or
4079 - some conversion is a vector (overstrict for now), or
4080 - the intermediate type is narrower than both initial and
4081 final, or
4082 - the intermediate type and innermost type differ in signedness,
4083 and the outermost type is wider than the intermediate, or
4084 - the initial type is a pointer type and the precisions of the
4085 intermediate and final types differ, or
4086 - the final type is a pointer type and the precisions of the
4087 initial and intermediate types differ. */
4088 (if (! inside_float && ! inter_float && ! final_float
4089 && ! inside_vec && ! inter_vec && ! final_vec
4090 && (inter_prec >= inside_prec || inter_prec >= final_prec)
4091 && ! (inside_int && inter_int
4092 && inter_unsignedp != inside_unsignedp
4093 && inter_prec < final_prec)
4094 && ((inter_unsignedp && inter_prec > inside_prec)
4095 == (final_unsignedp && final_prec > inter_prec))
4096 && ! (inside_ptr && inter_prec != final_prec)
4097 && ! (final_ptr && inside_prec != inter_prec))
4098 (ocvt @0))
4100 /* A truncation to an unsigned type (a zero-extension) should be
4101 canonicalized as bitwise and of a mask. */
4102 (if (GIMPLE /* PR70366: doing this in GENERIC breaks -Wconversion. */
4103 && final_int && inter_int && inside_int
4104 && final_prec == inside_prec
4105 && final_prec > inter_prec
4106 && inter_unsignedp)
4107 (convert (bit_and @0 { wide_int_to_tree
4108 (inside_type,
4109 wi::mask (inter_prec, false,
4110 TYPE_PRECISION (inside_type))); })))
4112 /* If we are converting an integer to a floating-point that can
4113 represent it exactly and back to an integer, we can skip the
4114 floating-point conversion. */
4115 (if (GIMPLE /* PR66211 */
4116 && inside_int && inter_float && final_int &&
4117 (unsigned) significand_size (TYPE_MODE (inter_type))
4118 >= inside_prec - !inside_unsignedp)
4119 (convert @0)))))))
4121 /* (float_type)(integer_type) x -> trunc (x) if the type of x matches
4122 float_type. Only do the transformation if we do not need to preserve
4123 trapping behaviour, so require !flag_trapping_math. */
4124 #if GIMPLE
4125 (simplify
4126 (float (fix_trunc @0))
4127 (if (!flag_trapping_math
4128 && types_match (type, TREE_TYPE (@0))
4129 && direct_internal_fn_supported_p (IFN_TRUNC, type,
4130 OPTIMIZE_FOR_BOTH))
4131 (IFN_TRUNC @0)))
4132 #endif
4134 /* If we have a narrowing conversion to an integral type that is fed by a
4135 BIT_AND_EXPR, we might be able to remove the BIT_AND_EXPR if it merely
4136 masks off bits outside the final type (and nothing else). */
4137 (simplify
4138 (convert (bit_and @0 INTEGER_CST@1))
4139 (if (INTEGRAL_TYPE_P (type)
4140 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
4141 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))
4142 && operand_equal_p (@1, build_low_bits_mask (TREE_TYPE (@1),
4143 TYPE_PRECISION (type)), 0))
4144 (convert @0)))
4147 /* (X /[ex] A) * A -> X. */
4148 (simplify
4149 (mult (convert1? (exact_div @0 @@1)) (convert2? @1))
4150 (convert @0))
4152 /* Simplify (A / B) * B + (A % B) -> A. */
4153 (for div (trunc_div ceil_div floor_div round_div)
4154 mod (trunc_mod ceil_mod floor_mod round_mod)
4155 (simplify
4156 (plus:c (mult:c (div @0 @1) @1) (mod @0 @1))
4157 @0))
4159 /* x / y * y == x -> x % y == 0. */
4160 (simplify
4161 (eq:c (mult:c (trunc_div:s @0 @1) @1) @0)
4162 (if (TREE_CODE (TREE_TYPE (@0)) != COMPLEX_TYPE)
4163 (eq (trunc_mod @0 @1) { build_zero_cst (TREE_TYPE (@0)); })))
4165 /* ((X /[ex] A) +- B) * A --> X +- A * B. */
4166 (for op (plus minus)
4167 (simplify
4168 (mult (convert1? (op (convert2? (exact_div @0 INTEGER_CST@@1)) INTEGER_CST@2)) @1)
4169 (if (tree_nop_conversion_p (type, TREE_TYPE (@2))
4170 && tree_nop_conversion_p (TREE_TYPE (@0), TREE_TYPE (@2)))
4171 (with
4172 {
4173 wi::overflow_type overflow;
4174 wide_int mul = wi::mul (wi::to_wide (@1), wi::to_wide (@2),
4175 TYPE_SIGN (type), &overflow);
4176 }
4177 (if (types_match (type, TREE_TYPE (@2))
4178 && types_match (TREE_TYPE (@0), TREE_TYPE (@2)) && !overflow)
4179 (op @0 { wide_int_to_tree (type, mul); })
4180 (with { tree utype = unsigned_type_for (type); }
4181 (convert (op (convert:utype @0)
4182 (mult (convert:utype @1) (convert:utype @2))))))))))
4184 /* Canonicalization of binary operations. */
4186 /* Convert X + -C into X - C. */
4187 (simplify
4188 (plus @0 REAL_CST@1)
4189 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
4190 (with { tree tem = const_unop (NEGATE_EXPR, type, @1); }
4191 (if (!TREE_OVERFLOW (tem) || !flag_trapping_math)
4192 (minus @0 { tem; })))))
4194 /* Convert x+x into x*2. */
4195 (simplify
4196 (plus @0 @0)
4197 (if (SCALAR_FLOAT_TYPE_P (type))
4198 (mult @0 { build_real (type, dconst2); })
4199 (if (INTEGRAL_TYPE_P (type))
4200 (mult @0 { build_int_cst (type, 2); }))))
4202 /* 0 - X -> -X. */
4203 (simplify
4204 (minus integer_zerop @1)
4205 (negate @1))
4206 (simplify
4207 (pointer_diff integer_zerop @1)
4208 (negate (convert @1)))
4210 /* (ARG0 - ARG1) is the same as (-ARG1 + ARG0). So check whether
4211 ARG0 is zero and X + ARG0 reduces to X, since that would mean
4212 (-ARG1 + ARG0) reduces to -ARG1. */
4213 (simplify
4214 (minus real_zerop@0 @1)
4215 (if (fold_real_zero_addition_p (type, @1, @0, 0))
4216 (negate @1)))
4218 /* Transform x * -1 into -x. */
4219 (simplify
4220 (mult @0 integer_minus_onep)
4221 (negate @0))
4223 /* Reassociate (X * CST) * Y to (X * Y) * CST. This does not introduce
4224 signed overflow for CST != 0 && CST != -1. */
4225 (simplify
4226 (mult:c (mult:s@3 @0 INTEGER_CST@1) @2)
4227 (if (TREE_CODE (@2) != INTEGER_CST
4228 && single_use (@3)
4229 && !integer_zerop (@1) && !integer_minus_onep (@1))
4230 (mult (mult @0 @2) @1)))
4232 /* True if we can easily extract the real and imaginary parts of a complex
4233 number. */
4234 (match compositional_complex
4235 (convert? (complex @0 @1)))
4237 /* COMPLEX_EXPR and REALPART/IMAGPART_EXPR cancellations. */
4238 (simplify
4239 (complex (realpart @0) (imagpart @0))
4240 @0)
4241 (simplify
4242 (realpart (complex @0 @1))
4243 @0)
4244 (simplify
4245 (imagpart (complex @0 @1))
4246 @1)
4248 /* Sometimes we only care about half of a complex expression. */
4249 (simplify
4250 (realpart (convert?:s (conj:s @0)))
4251 (convert (realpart @0)))
4252 (simplify
4253 (imagpart (convert?:s (conj:s @0)))
4254 (convert (negate (imagpart @0))))
4255 (for part (realpart imagpart)
4256 (for op (plus minus)
4257 (simplify
4258 (part (convert?:s@2 (op:s @0 @1)))
4259 (convert (op (part @0) (part @1))))))
4260 (simplify
4261 (realpart (convert?:s (CEXPI:s @0)))
4262 (convert (COS @0)))
4263 (simplify
4264 (imagpart (convert?:s (CEXPI:s @0)))
4265 (convert (SIN @0)))
4267 /* conj(conj(x)) -> x */
4268 (simplify
4269 (conj (convert? (conj @0)))
4270 (if (tree_nop_conversion_p (TREE_TYPE (@0), type))
4271 (convert @0)))
4273 /* conj({x,y}) -> {x,-y} */
4274 (simplify
4275 (conj (convert?:s (complex:s @0 @1)))
4276 (with { tree itype = TREE_TYPE (type); }
4277 (complex (convert:itype @0) (negate (convert:itype @1)))))
4279 /* BSWAP simplifications, transforms checked by gcc.dg/builtin-bswap-8.c. */
4280 (for bswap (BUILT_IN_BSWAP16 BUILT_IN_BSWAP32
4281 BUILT_IN_BSWAP64 BUILT_IN_BSWAP128)
4282 (simplify
4283 (bswap (bswap @0))
4284 @0)
4285 (simplify
4286 (bswap (bit_not (bswap @0)))
4287 (bit_not @0))
4288 (for bitop (bit_xor bit_ior bit_and)
4289 (simplify
4290 (bswap (bitop:c (bswap @0) @1))
4291 (bitop @0 (bswap @1))))
4292 (for cmp (eq ne)
4293 (simplify
4294 (cmp (bswap@2 @0) (bswap @1))
4295 (with { tree ctype = TREE_TYPE (@2); }
4296 (cmp (convert:ctype @0) (convert:ctype @1))))
4297 (simplify
4298 (cmp (bswap @0) INTEGER_CST@1)
4299 (with { tree ctype = TREE_TYPE (@1); }
4300 (cmp (convert:ctype @0) (bswap! @1)))))
4301 /* (bswap(x) >> C1) & C2 can sometimes be simplified to (x >> C3) & C2. */
4302 (simplify
4303 (bit_and (convert1? (rshift@0 (convert2? (bswap@4 @1)) INTEGER_CST@2))
4304 INTEGER_CST@3)
4305 (if (BITS_PER_UNIT == 8
4306 && tree_fits_uhwi_p (@2)
4307 && tree_fits_uhwi_p (@3))
4308 (with
4309 {
4310 unsigned HOST_WIDE_INT prec = TYPE_PRECISION (TREE_TYPE (@4));
4311 unsigned HOST_WIDE_INT bits = tree_to_uhwi (@2);
4312 unsigned HOST_WIDE_INT mask = tree_to_uhwi (@3);
4313 unsigned HOST_WIDE_INT lo = bits & 7;
4314 unsigned HOST_WIDE_INT hi = bits - lo;
4315 }
4316 (if (bits < prec
4317 && mask < (256u>>lo)
4318 && bits < TYPE_PRECISION (TREE_TYPE(@0)))
4319 (with { unsigned HOST_WIDE_INT ns = (prec - (hi + 8)) + lo; }
4320 (if (ns == 0)
4321 (bit_and (convert @1) @3)
4322 (with
4323 {
4324 tree utype = unsigned_type_for (TREE_TYPE (@1));
4325 tree nst = build_int_cst (integer_type_node, ns);
4326 }
4327 (bit_and (convert (rshift:utype (convert:utype @1) {nst;})) @3))))))))
4328 /* bswap(x) >> C1 can sometimes be simplified to (T)x >> C2. */
4329 (simplify
4330 (rshift (convert? (bswap@2 @0)) INTEGER_CST@1)
4331 (if (BITS_PER_UNIT == 8
4332 && CHAR_TYPE_SIZE == 8
4333 && tree_fits_uhwi_p (@1))
4334 (with
4335 {
4336 unsigned HOST_WIDE_INT prec = TYPE_PRECISION (TREE_TYPE (@2));
4337 unsigned HOST_WIDE_INT bits = tree_to_uhwi (@1);
4338 /* If the bswap was extended before the original shift, this
4339 byte (shift) has the sign of the extension, not the sign of
4340 the original shift. */
4341 tree st = TYPE_PRECISION (type) > prec ? TREE_TYPE (@2) : type;
4342 }
4343 /* Special case: logical right shift of sign-extended bswap.
4344 (unsigned)(short)bswap16(x)>>12 is (unsigned)((short)x<<8)>>12. */
4345 (if (TYPE_PRECISION (type) > prec
4346 && !TYPE_UNSIGNED (TREE_TYPE (@2))
4347 && TYPE_UNSIGNED (type)
4348 && bits < prec && bits + 8 >= prec)
4349 (with { tree nst = build_int_cst (integer_type_node, prec - 8); }
4350 (rshift (convert (lshift:st (convert:st @0) {nst;})) @1))
4351 (if (bits + 8 == prec)
4352 (if (TYPE_UNSIGNED (st))
4353 (convert (convert:unsigned_char_type_node @0))
4354 (convert (convert:signed_char_type_node @0)))
4355 (if (bits < prec && bits + 8 > prec)
4356 (with
4357 {
4358 tree nst = build_int_cst (integer_type_node, bits & 7);
4359 tree bt = TYPE_UNSIGNED (st) ? unsigned_char_type_node
4360 : signed_char_type_node;
4361 }
4362 (convert (rshift:bt (convert:bt @0) {nst;})))))))))
4363 /* bswap(x) & C1 can sometimes be simplified to (x >> C2) & C1. */
4364 (simplify
4365 (bit_and (convert? (bswap@2 @0)) INTEGER_CST@1)
4366 (if (BITS_PER_UNIT == 8
4367 && tree_fits_uhwi_p (@1)
4368 && tree_to_uhwi (@1) < 256)
4369 (with
4370 {
4371 unsigned HOST_WIDE_INT prec = TYPE_PRECISION (TREE_TYPE (@2));
4372 tree utype = unsigned_type_for (TREE_TYPE (@0));
4373 tree nst = build_int_cst (integer_type_node, prec - 8);
4374 }
4375 (bit_and (convert (rshift:utype (convert:utype @0) {nst;})) @1)))))
4378 /* Combine COND_EXPRs and VEC_COND_EXPRs. */
4380 /* Simplify constant conditions.
4381 Only optimize constant conditions when the selected branch
4382 has the same type as the COND_EXPR. This avoids optimizing
4383 away "c ? x : throw", where the throw has a void type.
4384 Note that we cannot throw away the fold-const.cc variant nor
4385 this one as we depend on doing this transform before possibly
4386 A ? B : B -> B triggers and the fold-const.cc one can optimize
4387 0 ? A : B to B even if A has side-effects. Something
4388 genmatch cannot handle. */
4389 (simplify
4390 (cond INTEGER_CST@0 @1 @2)
4391 (if (integer_zerop (@0))
4392 (if (!VOID_TYPE_P (TREE_TYPE (@2)) || VOID_TYPE_P (type))
4393 @2)
4394 (if (!VOID_TYPE_P (TREE_TYPE (@1)) || VOID_TYPE_P (type))
4395 @1)))
4396 (simplify
4397 (vec_cond VECTOR_CST@0 @1 @2)
4398 (if (integer_all_onesp (@0))
4399 @1
4400 (if (integer_zerop (@0))
4401 @2)))
4403 /* Sink unary operations to branches, but only if we do fold both. */
4404 (for op (negate bit_not abs absu)
4405 (simplify
4406 (op (vec_cond:s @0 @1 @2))
4407 (vec_cond @0 (op! @1) (op! @2))))
4409 /* Sink binary operation to branches, but only if we can fold it. */
4410 (for op (tcc_comparison plus minus mult bit_and bit_ior bit_xor
4411 lshift rshift rdiv trunc_div ceil_div floor_div round_div
4412 trunc_mod ceil_mod floor_mod round_mod min max)
4413 /* (c ? a : b) op (c ? d : e) --> c ? (a op d) : (b op e) */
4414 (simplify
4415 (op (vec_cond:s @0 @1 @2) (vec_cond:s @0 @3 @4))
4416 (vec_cond @0 (op! @1 @3) (op! @2 @4)))
4418 /* (c ? a : b) op d --> c ? (a op d) : (b op d) */
4419 (simplify
4420 (op (vec_cond:s @0 @1 @2) @3)
4421 (vec_cond @0 (op! @1 @3) (op! @2 @3)))
4422 (simplify
4423 (op @3 (vec_cond:s @0 @1 @2))
4424 (vec_cond @0 (op! @3 @1) (op! @3 @2))))
4426 #if GIMPLE
4427 (match (nop_atomic_bit_test_and_p @0 @1 @4)
4428 (bit_and (convert?@4 (ATOMIC_FETCH_OR_XOR_N @2 INTEGER_CST@0 @3))
4429 INTEGER_CST@1)
4430 (with {
4431 int ibit = tree_log2 (@0);
4432 int ibit2 = tree_log2 (@1);
4433 }
4434 (if (ibit == ibit2
4435 && ibit >= 0
4436 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))))))
4438 (match (nop_atomic_bit_test_and_p @0 @1 @3)
4439 (bit_and (convert?@3 (SYNC_FETCH_OR_XOR_N @2 INTEGER_CST@0))
4440 INTEGER_CST@1)
4441 (with {
4442 int ibit = tree_log2 (@0);
4443 int ibit2 = tree_log2 (@1);
4444 }
4445 (if (ibit == ibit2
4446 && ibit >= 0
4447 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))))))
4449 (match (nop_atomic_bit_test_and_p @0 @0 @4)
4450 (bit_and:c
4451 (convert1?@4
4452 (ATOMIC_FETCH_OR_XOR_N @2 (nop_convert? (lshift@0 integer_onep@5 @6)) @3))
4453 (convert2? @0))
4454 (if (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0)))))
4456 (match (nop_atomic_bit_test_and_p @0 @0 @4)
4457 (bit_and:c
4458 (convert1?@4
4459 (SYNC_FETCH_OR_XOR_N @2 (nop_convert? (lshift@0 integer_onep@3 @5))))
4460 (convert2? @0))
4461 (if (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0)))))
4463 (match (nop_atomic_bit_test_and_p @0 @1 @3)
4464 (bit_and@4 (convert?@3 (ATOMIC_FETCH_AND_N @2 INTEGER_CST@0 @5))
4465 INTEGER_CST@1)
4466 (with {
4467 int ibit = wi::exact_log2 (wi::zext (wi::bit_not (wi::to_wide (@0)),
4468 TYPE_PRECISION(type)));
4469 int ibit2 = tree_log2 (@1);
4470 }
4471 (if (ibit == ibit2
4472 && ibit >= 0
4473 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))))))
4475 (match (nop_atomic_bit_test_and_p @0 @1 @3)
4476 (bit_and@4
4477 (convert?@3 (SYNC_FETCH_AND_AND_N @2 INTEGER_CST@0))
4478 INTEGER_CST@1)
4479 (with {
4480 int ibit = wi::exact_log2 (wi::zext (wi::bit_not (wi::to_wide (@0)),
4481 TYPE_PRECISION(type)));
4482 int ibit2 = tree_log2 (@1);
4483 }
4484 (if (ibit == ibit2
4485 && ibit >= 0
4486 && TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@0))))))
4488 (match (nop_atomic_bit_test_and_p @4 @0 @3)
4489 (bit_and:c
4490 (convert1?@3
4491 (ATOMIC_FETCH_AND_N @2 (nop_convert?@4 (bit_not (lshift@0 integer_onep@6 @7))) @5))
4492 (convert2? @0))
4493 (if (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@4)))))
4495 (match (nop_atomic_bit_test_and_p @4 @0 @3)
4496 (bit_and:c
4497 (convert1?@3
4498 (SYNC_FETCH_AND_AND_N @2 (nop_convert?@4 (bit_not (lshift@0 integer_onep@6 @7)))))
4499 (convert2? @0))
4500 (if (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (@4)))))
4502 #endif
4504 /* (v ? w : 0) ? a : b is just (v & w) ? a : b
4505 Currently disabled after pass lvec because ARM understands
4506 VEC_COND_EXPR<v==w,-1,0> but not a plain v==w fed to BIT_IOR_EXPR. */
4507 (simplify
4508 (vec_cond (vec_cond:s @0 @3 integer_zerop) @1 @2)
4509 (if (optimize_vectors_before_lowering_p () && types_match (@0, @3))
4510 (vec_cond (bit_and @0 @3) @1 @2)))
4511 (simplify
4512 (vec_cond (vec_cond:s @0 integer_all_onesp @3) @1 @2)
4513 (if (optimize_vectors_before_lowering_p () && types_match (@0, @3))
4514 (vec_cond (bit_ior @0 @3) @1 @2)))
4515 (simplify
4516 (vec_cond (vec_cond:s @0 integer_zerop @3) @1 @2)
4517 (if (optimize_vectors_before_lowering_p () && types_match (@0, @3))
4518 (vec_cond (bit_ior @0 (bit_not @3)) @2 @1)))
4519 (simplify
4520 (vec_cond (vec_cond:s @0 @3 integer_all_onesp) @1 @2)
4521 (if (optimize_vectors_before_lowering_p () && types_match (@0, @3))
4522 (vec_cond (bit_and @0 (bit_not @3)) @2 @1)))
4524 /* c1 ? c2 ? a : b : b --> (c1 & c2) ? a : b */
4525 (simplify
4526 (vec_cond @0 (vec_cond:s @1 @2 @3) @3)
4527 (if (optimize_vectors_before_lowering_p () && types_match (@0, @1))
4528 (vec_cond (bit_and @0 @1) @2 @3)))
4529 (simplify
4530 (vec_cond @0 @2 (vec_cond:s @1 @2 @3))
4531 (if (optimize_vectors_before_lowering_p () && types_match (@0, @1))
4532 (vec_cond (bit_ior @0 @1) @2 @3)))
4533 (simplify
4534 (vec_cond @0 (vec_cond:s @1 @2 @3) @2)
4535 (if (optimize_vectors_before_lowering_p () && types_match (@0, @1))
4536 (vec_cond (bit_ior (bit_not @0) @1) @2 @3)))
4537 (simplify
4538 (vec_cond @0 @3 (vec_cond:s @1 @2 @3))
4539 (if (optimize_vectors_before_lowering_p () && types_match (@0, @1))
4540 (vec_cond (bit_and (bit_not @0) @1) @2 @3)))
4542 /* Canonicalize mask ? { 0, ... } : { -1, ...} to ~mask if the mask
4543 types are compatible. */
4544 (simplify
4545 (vec_cond @0 VECTOR_CST@1 VECTOR_CST@2)
4546 (if (VECTOR_BOOLEAN_TYPE_P (type)
4547 && types_match (type, TREE_TYPE (@0)))
4548 (if (integer_zerop (@1) && integer_all_onesp (@2))
4549 (bit_not @0)
4550 (if (integer_all_onesp (@1) && integer_zerop (@2))
4551 @0))))
4553 /* A few simplifications of "a ? CST1 : CST2". */
4554 /* NOTE: Only do this on gimple as the if-chain-to-switch
4555 optimization depends on the gimple to have if statements in it. */
4556 #if GIMPLE
4557 (simplify
4558 (cond @0 INTEGER_CST@1 INTEGER_CST@2)
4559 (switch
4560 (if (integer_zerop (@2))
4561 (switch
4562 /* a ? 1 : 0 -> a if 0 and 1 are integral types. */
4563 (if (integer_onep (@1))
4564 (convert (convert:boolean_type_node @0)))
4565 /* a ? powerof2cst : 0 -> a << (log2(powerof2cst)) */
4566 (if (INTEGRAL_TYPE_P (type) && integer_pow2p (@1))
4567 (with {
4568 tree shift = build_int_cst (integer_type_node, tree_log2 (@1));
4569 }
4570 (lshift (convert (convert:boolean_type_node @0)) { shift; })))
4571 /* a ? -1 : 0 -> -a. No need to check the TYPE_PRECISION not being 1
4572 here as the powerof2cst case above will handle that case correctly. */
4573 (if (INTEGRAL_TYPE_P (type) && integer_all_onesp (@1))
4574 (negate (convert (convert:boolean_type_node @0))))))
4575 (if (integer_zerop (@1))
4576 (with {
4577 tree booltrue = constant_boolean_node (true, boolean_type_node);
4578 }
4579 (switch
4580 /* a ? 0 : 1 -> !a. */
4581 (if (integer_onep (@2))
4582 (convert (bit_xor (convert:boolean_type_node @0) { booltrue; } )))
4583 /* a ? powerof2cst : 0 -> (!a) << (log2(powerof2cst)) */
4584 (if (INTEGRAL_TYPE_P (type) && integer_pow2p (@2))
4585 (with {
4586 tree shift = build_int_cst (integer_type_node, tree_log2 (@2));
4587 }
4588 (lshift (convert (bit_xor (convert:boolean_type_node @0) { booltrue; } ))
4589 { shift; })))
4590 /* a ? -1 : 0 -> -(!a). No need to check the TYPE_PRECISION not being 1
4591 here as the powerof2cst case above will handle that case correctly. */
4592 (if (INTEGRAL_TYPE_P (type) && integer_all_onesp (@2))
4593 (negate (convert (bit_xor (convert:boolean_type_node @0) { booltrue; } ))))
4594 )
4595 )
4596 )
4597 )
4598 )
4599 #endif
4601 (simplify
4602 (convert (cond@0 @1 INTEGER_CST@2 INTEGER_CST@3))
4603 (if (INTEGRAL_TYPE_P (type)
4604 && INTEGRAL_TYPE_P (TREE_TYPE (@0)))
4605 (cond @1 (convert @2) (convert @3))))
4607 /* Simplification moved from fold_cond_expr_with_comparison. It may also
4608 be extended. */
4609 /* This pattern implements two kinds simplification:
4611 Case 1)
4612 (cond (cmp (convert1? x) c1) (convert2? x) c2) -> (minmax (x c)) if:
4613 1) Conversions are type widening from smaller type.
4614 2) Const c1 equals to c2 after canonicalizing comparison.
4615 3) Comparison has tree code LT, LE, GT or GE.
4616 This specific pattern is needed when (cmp (convert x) c) may not
4617 be simplified by comparison patterns because of multiple uses of
4618 x. It also makes sense here because simplifying across multiple
4619 referred var is always benefitial for complicated cases.
4621 Case 2)
4622 (cond (eq (convert1? x) c1) (convert2? x) c2) -> (cond (eq x c1) c1 c2). */
4623 (for cmp (lt le gt ge eq)
4624 (simplify
4625 (cond (cmp (convert1? @1) INTEGER_CST@3) (convert2? @1) INTEGER_CST@2)
4626 (with
4627 {
4628 tree from_type = TREE_TYPE (@1);
4629 tree c1_type = TREE_TYPE (@3), c2_type = TREE_TYPE (@2);
4630 enum tree_code code = ERROR_MARK;
4632 if (INTEGRAL_TYPE_P (from_type)
4633 && int_fits_type_p (@2, from_type)
4634 && (types_match (c1_type, from_type)
4635 || (TYPE_PRECISION (c1_type) > TYPE_PRECISION (from_type)
4636 && (TYPE_UNSIGNED (from_type)
4637 || TYPE_SIGN (c1_type) == TYPE_SIGN (from_type))))
4638 && (types_match (c2_type, from_type)
4639 || (TYPE_PRECISION (c2_type) > TYPE_PRECISION (from_type)
4640 && (TYPE_UNSIGNED (from_type)
4641 || TYPE_SIGN (c2_type) == TYPE_SIGN (from_type)))))
4642 {
4643 if (cmp != EQ_EXPR)
4644 {
4645 if (wi::to_widest (@3) == (wi::to_widest (@2) - 1))
4646 {
4647 /* X <= Y - 1 equals to X < Y. */
4648 if (cmp == LE_EXPR)
4649 code = LT_EXPR;
4650 /* X > Y - 1 equals to X >= Y. */
4651 if (cmp == GT_EXPR)
4652 code = GE_EXPR;
4653 }
4654 if (wi::to_widest (@3) == (wi::to_widest (@2) + 1))
4655 {
4656 /* X < Y + 1 equals to X <= Y. */
4657 if (cmp == LT_EXPR)
4658 code = LE_EXPR;
4659 /* X >= Y + 1 equals to X > Y. */
4660 if (cmp == GE_EXPR)
4661 code = GT_EXPR;
4662 }
4663 if (code != ERROR_MARK
4664 || wi::to_widest (@2) == wi::to_widest (@3))
4665 {
4666 if (cmp == LT_EXPR || cmp == LE_EXPR)
4667 code = MIN_EXPR;
4668 if (cmp == GT_EXPR || cmp == GE_EXPR)
4669 code = MAX_EXPR;
4670 }
4671 }
4672 /* Can do A == C1 ? A : C2 -> A == C1 ? C1 : C2? */
4673 else if (int_fits_type_p (@3, from_type))
4674 code = EQ_EXPR;
4675 }
4676 }
4677 (if (code == MAX_EXPR)
4678 (convert (max @1 (convert @2)))
4679 (if (code == MIN_EXPR)
4680 (convert (min @1 (convert @2)))
4681 (if (code == EQ_EXPR)
4682 (convert (cond (eq @1 (convert @3))
4683 (convert:from_type @3) (convert:from_type @2)))))))))
4685 /* (cond (cmp (convert? x) c1) (op x c2) c3) -> (op (minmax x c1) c2) if:
4687 1) OP is PLUS or MINUS.
4688 2) CMP is LT, LE, GT or GE.
4689 3) C3 == (C1 op C2), and computation doesn't have undefined behavior.
4691 This pattern also handles special cases like:
4693 A) Operand x is a unsigned to signed type conversion and c1 is
4694 integer zero. In this case,
4695 (signed type)x < 0 <=> x > MAX_VAL(signed type)
4696 (signed type)x >= 0 <=> x <= MAX_VAL(signed type)
4697 B) Const c1 may not equal to (C3 op' C2). In this case we also
4698 check equality for (c1+1) and (c1-1) by adjusting comparison
4699 code.
4701 TODO: Though signed type is handled by this pattern, it cannot be
4702 simplified at the moment because C standard requires additional
4703 type promotion. In order to match&simplify it here, the IR needs
4704 to be cleaned up by other optimizers, i.e, VRP. */
4705 (for op (plus minus)
4706 (for cmp (lt le gt ge)
4707 (simplify
4708 (cond (cmp (convert? @X) INTEGER_CST@1) (op @X INTEGER_CST@2) INTEGER_CST@3)
4709 (with { tree from_type = TREE_TYPE (@X), to_type = TREE_TYPE (@1); }
4710 (if (types_match (from_type, to_type)
4711 /* Check if it is special case A). */
4712 || (TYPE_UNSIGNED (from_type)
4713 && !TYPE_UNSIGNED (to_type)
4714 && TYPE_PRECISION (from_type) == TYPE_PRECISION (to_type)
4715 && integer_zerop (@1)
4716 && (cmp == LT_EXPR || cmp == GE_EXPR)))
4717 (with
4718 {
4719 wi::overflow_type overflow = wi::OVF_NONE;
4720 enum tree_code code, cmp_code = cmp;
4721 wide_int real_c1;
4722 wide_int c1 = wi::to_wide (@1);
4723 wide_int c2 = wi::to_wide (@2);
4724 wide_int c3 = wi::to_wide (@3);
4725 signop sgn = TYPE_SIGN (from_type);
4727 /* Handle special case A), given x of unsigned type:
4728 ((signed type)x < 0) <=> (x > MAX_VAL(signed type))
4729 ((signed type)x >= 0) <=> (x <= MAX_VAL(signed type)) */
4730 if (!types_match (from_type, to_type))
4731 {
4732 if (cmp_code == LT_EXPR)
4733 cmp_code = GT_EXPR;
4734 if (cmp_code == GE_EXPR)
4735 cmp_code = LE_EXPR;
4736 c1 = wi::max_value (to_type);
4737 }
4738 /* To simplify this pattern, we require c3 = (c1 op c2). Here we
4739 compute (c3 op' c2) and check if it equals to c1 with op' being
4740 the inverted operator of op. Make sure overflow doesn't happen
4741 if it is undefined. */
4742 if (op == PLUS_EXPR)
4743 real_c1 = wi::sub (c3, c2, sgn, &overflow);
4744 else
4745 real_c1 = wi::add (c3, c2, sgn, &overflow);
4747 code = cmp_code;
4748 if (!overflow || !TYPE_OVERFLOW_UNDEFINED (from_type))
4749 {
4750 /* Check if c1 equals to real_c1. Boundary condition is handled
4751 by adjusting comparison operation if necessary. */
4752 if (!wi::cmp (wi::sub (real_c1, 1, sgn, &overflow), c1, sgn)
4753 && !overflow)
4754 {
4755 /* X <= Y - 1 equals to X < Y. */
4756 if (cmp_code == LE_EXPR)
4757 code = LT_EXPR;
4758 /* X > Y - 1 equals to X >= Y. */
4759 if (cmp_code == GT_EXPR)
4760 code = GE_EXPR;
4761 }
4762 if (!wi::cmp (wi::add (real_c1, 1, sgn, &overflow), c1, sgn)
4763 && !overflow)
4764 {
4765 /* X < Y + 1 equals to X <= Y. */
4766 if (cmp_code == LT_EXPR)
4767 code = LE_EXPR;
4768 /* X >= Y + 1 equals to X > Y. */
4769 if (cmp_code == GE_EXPR)
4770 code = GT_EXPR;
4771 }
4772 if (code != cmp_code || !wi::cmp (real_c1, c1, sgn))
4773 {
4774 if (cmp_code == LT_EXPR || cmp_code == LE_EXPR)
4775 code = MIN_EXPR;
4776 if (cmp_code == GT_EXPR || cmp_code == GE_EXPR)
4777 code = MAX_EXPR;
4778 }
4779 }
4780 }
4781 (if (code == MAX_EXPR)
4782 (op (max @X { wide_int_to_tree (from_type, real_c1); })
4783 { wide_int_to_tree (from_type, c2); })
4784 (if (code == MIN_EXPR)
4785 (op (min @X { wide_int_to_tree (from_type, real_c1); })
4786 { wide_int_to_tree (from_type, c2); })))))))))
4788 #if GIMPLE
4789 /* A >= B ? A : B -> max (A, B) and friends. The code is still
4790 in fold_cond_expr_with_comparison for GENERIC folding with
4791 some extra constraints. */
4792 (for cmp (eq ne le lt unle unlt ge gt unge ungt uneq ltgt)
4793 (simplify
4794 (cond (cmp:c (nop_convert1?@c0 @0) (nop_convert2?@c1 @1))
4795 (convert3? @0) (convert4? @1))
4796 (if (!HONOR_SIGNED_ZEROS (type)
4797 && (/* Allow widening conversions of the compare operands as data. */
4798 (INTEGRAL_TYPE_P (type)
4799 && types_match (TREE_TYPE (@c0), TREE_TYPE (@0))
4800 && types_match (TREE_TYPE (@c1), TREE_TYPE (@1))
4801 && TYPE_PRECISION (TREE_TYPE (@0)) <= TYPE_PRECISION (type)
4802 && TYPE_PRECISION (TREE_TYPE (@1)) <= TYPE_PRECISION (type))
4803 /* Or sign conversions for the comparison. */
4804 || (types_match (type, TREE_TYPE (@0))
4805 && types_match (type, TREE_TYPE (@1)))))
4806 (switch
4807 (if (cmp == EQ_EXPR)
4808 (if (VECTOR_TYPE_P (type))
4809 (view_convert @c1)
4810 (convert @c1)))
4811 (if (cmp == NE_EXPR)
4812 (if (VECTOR_TYPE_P (type))
4813 (view_convert @c0)
4814 (convert @c0)))
4815 (if (cmp == LE_EXPR || cmp == UNLE_EXPR || cmp == LT_EXPR || cmp == UNLT_EXPR)
4816 (if (!HONOR_NANS (type))
4817 (if (VECTOR_TYPE_P (type))
4818 (view_convert (min @c0 @c1))
4819 (convert (min @c0 @c1)))))
4820 (if (cmp == GE_EXPR || cmp == UNGE_EXPR || cmp == GT_EXPR || cmp == UNGT_EXPR)
4821 (if (!HONOR_NANS (type))
4822 (if (VECTOR_TYPE_P (type))
4823 (view_convert (max @c0 @c1))
4824 (convert (max @c0 @c1)))))
4825 (if (cmp == UNEQ_EXPR)
4826 (if (!HONOR_NANS (type))
4827 (if (VECTOR_TYPE_P (type))
4828 (view_convert @c1)
4829 (convert @c1))))
4830 (if (cmp == LTGT_EXPR)
4831 (if (!HONOR_NANS (type))
4832 (if (VECTOR_TYPE_P (type))
4833 (view_convert @c0)
4834 (convert @c0))))))))
4835 #endif
4837 /* X != C1 ? -X : C2 simplifies to -X when -C1 == C2. */
4838 (simplify
4839 (cond (ne @0 INTEGER_CST@1) (negate@3 @0) INTEGER_CST@2)
4840 (if (!TYPE_SATURATING (type)
4841 && (TYPE_OVERFLOW_WRAPS (type)
4842 || !wi::only_sign_bit_p (wi::to_wide (@1)))
4843 && wi::eq_p (wi::neg (wi::to_wide (@1)), wi::to_wide (@2)))
4844 @3))
4846 /* X != C1 ? ~X : C2 simplifies to ~X when ~C1 == C2. */
4847 (simplify
4848 (cond (ne @0 INTEGER_CST@1) (bit_not@3 @0) INTEGER_CST@2)
4849 (if (wi::eq_p (wi::bit_not (wi::to_wide (@1)), wi::to_wide (@2)))
4850 @3))
4852 /* (X + 1) > Y ? -X : 1 simplifies to X >= Y ? -X : 1 when
4853 X is unsigned, as when X + 1 overflows, X is -1, so -X == 1. */
4854 (simplify
4855 (cond (gt (plus @0 integer_onep) @1) (negate @0) integer_onep@2)
4856 (if (TYPE_UNSIGNED (type))
4857 (cond (ge @0 @1) (negate @0) @2)))
4859 (for cnd (cond vec_cond)
4860 /* A ? B : (A ? X : C) -> A ? B : C. */
4861 (simplify
4862 (cnd @0 (cnd @0 @1 @2) @3)
4863 (cnd @0 @1 @3))
4864 (simplify
4865 (cnd @0 @1 (cnd @0 @2 @3))
4866 (cnd @0 @1 @3))
4867 /* A ? B : (!A ? C : X) -> A ? B : C. */
4868 /* ??? This matches embedded conditions open-coded because genmatch
4869 would generate matching code for conditions in separate stmts only.
4870 The following is still important to merge then and else arm cases
4871 from if-conversion. */
4872 (simplify
4873 (cnd @0 @1 (cnd @2 @3 @4))
4874 (if (inverse_conditions_p (@0, @2))
4875 (cnd @0 @1 @3)))
4876 (simplify
4877 (cnd @0 (cnd @1 @2 @3) @4)
4878 (if (inverse_conditions_p (@0, @1))
4879 (cnd @0 @3 @4)))
4881 /* A ? B : B -> B. */
4882 (simplify
4883 (cnd @0 @1 @1)
4884 @1)
4886 /* !A ? B : C -> A ? C : B. */
4887 (simplify
4888 (cnd (logical_inverted_value truth_valued_p@0) @1 @2)
4889 (cnd @0 @2 @1)))
4891 /* abs/negative simplifications moved from fold_cond_expr_with_comparison,
4892 Need to handle (A - B) case as fold_cond_expr_with_comparison does.
4893 Need to handle UN* comparisons.
4895 None of these transformations work for modes with signed
4896 zeros. If A is +/-0, the first two transformations will
4897 change the sign of the result (from +0 to -0, or vice
4898 versa). The last four will fix the sign of the result,
4899 even though the original expressions could be positive or
4900 negative, depending on the sign of A.
4902 Note that all these transformations are correct if A is
4903 NaN, since the two alternatives (A and -A) are also NaNs. */
4905 (for cnd (cond vec_cond)
4906 /* A == 0 ? A : -A same as -A */
4907 (for cmp (eq uneq)
4908 (simplify
4909 (cnd (cmp @0 zerop) @0 (negate@1 @0))
4910 (if (!HONOR_SIGNED_ZEROS (type))
4911 @1))
4912 (simplify
4913 (cnd (cmp @0 zerop) zerop (negate@1 @0))
4914 (if (!HONOR_SIGNED_ZEROS (type))
4915 @1))
4916 )
4917 /* A != 0 ? A : -A same as A */
4918 (for cmp (ne ltgt)
4919 (simplify
4920 (cnd (cmp @0 zerop) @0 (negate @0))
4921 (if (!HONOR_SIGNED_ZEROS (type))
4922 @0))
4923 (simplify
4924 (cnd (cmp @0 zerop) @0 integer_zerop)
4925 (if (!HONOR_SIGNED_ZEROS (type))
4926 @0))
4927 )
4928 /* A >=/> 0 ? A : -A same as abs (A) */
4929 (for cmp (ge gt)
4930 (simplify
4931 (cnd (cmp @0 zerop) @0 (negate @0))
4932 (if (!HONOR_SIGNED_ZEROS (type)
4933 && !TYPE_UNSIGNED (type))
4934 (abs @0))))
4935 /* A <=/< 0 ? A : -A same as -abs (A) */
4936 (for cmp (le lt)
4937 (simplify
4938 (cnd (cmp @0 zerop) @0 (negate @0))
4939 (if (!HONOR_SIGNED_ZEROS (type)
4940 && !TYPE_UNSIGNED (type))
4941 (if (ANY_INTEGRAL_TYPE_P (type)
4942 && !TYPE_OVERFLOW_WRAPS (type))
4943 (with {
4944 tree utype = unsigned_type_for (type);
4945 }
4946 (convert (negate (absu:utype @0))))
4947 (negate (abs @0)))))
4948 )
4949 )
4951 /* -(type)!A -> (type)A - 1. */
4952 (simplify
4953 (negate (convert?:s (logical_inverted_value:s @0)))
4954 (if (INTEGRAL_TYPE_P (type)
4955 && TREE_CODE (type) != BOOLEAN_TYPE
4956 && TYPE_PRECISION (type) > 1
4957 && TREE_CODE (@0) == SSA_NAME
4958 && ssa_name_has_boolean_range (@0))
4959 (plus (convert:type @0) { build_all_ones_cst (type); })))
4961 /* A + (B vcmp C ? 1 : 0) -> A - (B vcmp C ? -1 : 0), since vector comparisons
4962 return all -1 or all 0 results. */
4963 /* ??? We could instead convert all instances of the vec_cond to negate,
4964 but that isn't necessarily a win on its own. */
4965 (simplify
4966 (plus:c @3 (view_convert? (vec_cond:s @0 integer_each_onep@1 integer_zerop@2)))
4967 (if (VECTOR_TYPE_P (type)
4968 && known_eq (TYPE_VECTOR_SUBPARTS (type),
4969 TYPE_VECTOR_SUBPARTS (TREE_TYPE (@1)))
4970 && (TYPE_MODE (TREE_TYPE (type))
4971 == TYPE_MODE (TREE_TYPE (TREE_TYPE (@1)))))
4972 (minus @3 (view_convert (vec_cond @0 (negate @1) @2)))))
4974 /* ... likewise A - (B vcmp C ? 1 : 0) -> A + (B vcmp C ? -1 : 0). */
4975 (simplify
4976 (minus @3 (view_convert? (vec_cond:s @0 integer_each_onep@1 integer_zerop@2)))
4977 (if (VECTOR_TYPE_P (type)
4978 && known_eq (TYPE_VECTOR_SUBPARTS (type),
4979 TYPE_VECTOR_SUBPARTS (TREE_TYPE (@1)))
4980 && (TYPE_MODE (TREE_TYPE (type))
4981 == TYPE_MODE (TREE_TYPE (TREE_TYPE (@1)))))
4982 (plus @3 (view_convert (vec_cond @0 (negate @1) @2)))))
4985 /* Simplifications of comparisons. */
4987 /* See if we can reduce the magnitude of a constant involved in a
4988 comparison by changing the comparison code. This is a canonicalization
4989 formerly done by maybe_canonicalize_comparison_1. */
4990 (for cmp (le gt)
4991 acmp (lt ge)
4992 (simplify
4993 (cmp @0 uniform_integer_cst_p@1)
4994 (with { tree cst = uniform_integer_cst_p (@1); }
4995 (if (tree_int_cst_sgn (cst) == -1)
4996 (acmp @0 { build_uniform_cst (TREE_TYPE (@1),
4997 wide_int_to_tree (TREE_TYPE (cst),
4998 wi::to_wide (cst)
4999 + 1)); })))))
5000 (for cmp (ge lt)
5001 acmp (gt le)
5002 (simplify
5003 (cmp @0 uniform_integer_cst_p@1)
5004 (with { tree cst = uniform_integer_cst_p (@1); }
5005 (if (tree_int_cst_sgn (cst) == 1)
5006 (acmp @0 { build_uniform_cst (TREE_TYPE (@1),
5007 wide_int_to_tree (TREE_TYPE (cst),
5008 wi::to_wide (cst) - 1)); })))))
5010 /* We can simplify a logical negation of a comparison to the
5011 inverted comparison. As we cannot compute an expression
5012 operator using invert_tree_comparison we have to simulate
5013 that with expression code iteration. */
5014 (for cmp (tcc_comparison)
5015 icmp (inverted_tcc_comparison)
5016 ncmp (inverted_tcc_comparison_with_nans)
5017 /* Ideally we'd like to combine the following two patterns
5018 and handle some more cases by using
5019 (logical_inverted_value (cmp @0 @1))
5020 here but for that genmatch would need to "inline" that.
5021 For now implement what forward_propagate_comparison did. */
5022 (simplify
5023 (bit_not (cmp @0 @1))
5024 (if (VECTOR_TYPE_P (type)
5025 || (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) == 1))
5026 /* Comparison inversion may be impossible for trapping math,
5027 invert_tree_comparison will tell us. But we can't use
5028 a computed operator in the replacement tree thus we have
5029 to play the trick below. */
5030 (with { enum tree_code ic = invert_tree_comparison
5031 (cmp, HONOR_NANS (@0)); }
5032 (if (ic == icmp)
5033 (icmp @0 @1)
5034 (if (ic == ncmp)
5035 (ncmp @0 @1))))))
5036 (simplify
5037 (bit_xor (cmp @0 @1) integer_truep)
5038 (with { enum tree_code ic = invert_tree_comparison
5039 (cmp, HONOR_NANS (@0)); }
5040 (if (ic == icmp)
5041 (icmp @0 @1)
5042 (if (ic == ncmp)
5043 (ncmp @0 @1)))))
5044 /* The following bits are handled by fold_binary_op_with_conditional_arg. */
5045 (simplify
5046 (ne (cmp@2 @0 @1) integer_zerop)
5047 (if (types_match (type, TREE_TYPE (@2)))
5048 (cmp @0 @1)))
5049 (simplify
5050 (eq (cmp@2 @0 @1) integer_truep)
5051 (if (types_match (type, TREE_TYPE (@2)))
5052 (cmp @0 @1)))
5053 (simplify
5054 (ne (cmp@2 @0 @1) integer_truep)
5055 (if (types_match (type, TREE_TYPE (@2)))
5056 (with { enum tree_code ic = invert_tree_comparison
5057 (cmp, HONOR_NANS (@0)); }
5058 (if (ic == icmp)
5059 (icmp @0 @1)
5060 (if (ic == ncmp)
5061 (ncmp @0 @1))))))
5062 (simplify
5063 (eq (cmp@2 @0 @1) integer_zerop)
5064 (if (types_match (type, TREE_TYPE (@2)))
5065 (with { enum tree_code ic = invert_tree_comparison
5066 (cmp, HONOR_NANS (@0)); }
5067 (if (ic == icmp)
5068 (icmp @0 @1)
5069 (if (ic == ncmp)
5070 (ncmp @0 @1)))))))
5072 /* Transform comparisons of the form X - Y CMP 0 to X CMP Y.
5073 ??? The transformation is valid for the other operators if overflow
5074 is undefined for the type, but performing it here badly interacts
5075 with the transformation in fold_cond_expr_with_comparison which
5076 attempts to synthetize ABS_EXPR. */
5077 (for cmp (eq ne)
5078 (for sub (minus pointer_diff)
5079 (simplify
5080 (cmp (sub@2 @0 @1) integer_zerop)
5081 (if (single_use (@2))
5082 (cmp @0 @1)))))
5084 /* Simplify (x < 0) ^ (y < 0) to (x ^ y) < 0 and
5085 (x >= 0) ^ (y >= 0) to (x ^ y) < 0. */
5086 (for cmp (lt ge)
5087 (simplify
5088 (bit_xor (cmp:s @0 integer_zerop) (cmp:s @1 integer_zerop))
5089 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5090 && !TYPE_UNSIGNED (TREE_TYPE (@0))
5091 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
5092 (lt (bit_xor @0 @1) { build_zero_cst (TREE_TYPE (@0)); }))))
5093 /* Simplify (x < 0) ^ (y >= 0) to (x ^ y) >= 0 and
5094 (x >= 0) ^ (y < 0) to (x ^ y) >= 0. */
5095 (simplify
5096 (bit_xor:c (lt:s @0 integer_zerop) (ge:s @1 integer_zerop))
5097 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5098 && !TYPE_UNSIGNED (TREE_TYPE (@0))
5099 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
5100 (ge (bit_xor @0 @1) { build_zero_cst (TREE_TYPE (@0)); })))
5102 /* Transform comparisons of the form X * C1 CMP 0 to X CMP 0 in the
5103 signed arithmetic case. That form is created by the compiler
5104 often enough for folding it to be of value. One example is in
5105 computing loop trip counts after Operator Strength Reduction. */
5106 (for cmp (simple_comparison)
5107 scmp (swapped_simple_comparison)
5108 (simplify
5109 (cmp (mult@3 @0 INTEGER_CST@1) integer_zerop@2)
5110 /* Handle unfolded multiplication by zero. */
5111 (if (integer_zerop (@1))
5112 (cmp @1 @2)
5113 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
5114 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
5115 && single_use (@3))
5116 /* If @1 is negative we swap the sense of the comparison. */
5117 (if (tree_int_cst_sgn (@1) < 0)
5118 (scmp @0 @2)
5119 (cmp @0 @2))))))
5121 /* For integral types with undefined overflow fold
5122 x * C1 == C2 into x == C2 / C1 or false.
5123 If overflow wraps and C1 is odd, simplify to x == C2 / C1 in the ring
5124 Z / 2^n Z. */
5125 (for cmp (eq ne)
5126 (simplify
5127 (cmp (mult @0 INTEGER_CST@1) INTEGER_CST@2)
5128 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5129 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
5130 && wi::to_wide (@1) != 0)
5131 (with { widest_int quot; }
5132 (if (wi::multiple_of_p (wi::to_widest (@2), wi::to_widest (@1),
5133 TYPE_SIGN (TREE_TYPE (@0)), "))
5134 (cmp @0 { wide_int_to_tree (TREE_TYPE (@0), quot); })
5135 { constant_boolean_node (cmp == NE_EXPR, type); }))
5136 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5137 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0))
5138 && (wi::bit_and (wi::to_wide (@1), 1) == 1))
5139 (cmp @0
5140 {
5141 tree itype = TREE_TYPE (@0);
5142 int p = TYPE_PRECISION (itype);
5143 wide_int m = wi::one (p + 1) << p;
5144 wide_int a = wide_int::from (wi::to_wide (@1), p + 1, UNSIGNED);
5145 wide_int i = wide_int::from (wi::mod_inv (a, m),
5146 p, TYPE_SIGN (itype));
5147 wide_int_to_tree (itype, wi::mul (i, wi::to_wide (@2)));
5148 })))))
5150 /* Simplify comparison of something with itself. For IEEE
5151 floating-point, we can only do some of these simplifications. */
5152 (for cmp (eq ge le)
5153 (simplify
5154 (cmp @0 @0)
5155 (if (! FLOAT_TYPE_P (TREE_TYPE (@0))
5156 || ! tree_expr_maybe_nan_p (@0))
5157 { constant_boolean_node (true, type); }
5158 (if (cmp != EQ_EXPR
5159 /* With -ftrapping-math conversion to EQ loses an exception. */
5160 && (! FLOAT_TYPE_P (TREE_TYPE (@0))
5161 || ! flag_trapping_math))
5162 (eq @0 @0)))))
5163 (for cmp (ne gt lt)
5164 (simplify
5165 (cmp @0 @0)
5166 (if (cmp != NE_EXPR
5167 || ! FLOAT_TYPE_P (TREE_TYPE (@0))
5168 || ! tree_expr_maybe_nan_p (@0))
5169 { constant_boolean_node (false, type); })))
5170 (for cmp (unle unge uneq)
5171 (simplify
5172 (cmp @0 @0)
5173 { constant_boolean_node (true, type); }))
5174 (for cmp (unlt ungt)
5175 (simplify
5176 (cmp @0 @0)
5177 (unordered @0 @0)))
5178 (simplify
5179 (ltgt @0 @0)
5180 (if (!flag_trapping_math || !tree_expr_maybe_nan_p (@0))
5181 { constant_boolean_node (false, type); }))
5183 /* x == ~x -> false */
5184 /* x != ~x -> true */
5185 (for cmp (eq ne)
5186 (simplify
5187 (cmp:c @0 (bit_not @0))
5188 { constant_boolean_node (cmp == NE_EXPR, type); }))
5190 /* Fold ~X op ~Y as Y op X. */
5191 (for cmp (simple_comparison)
5192 (simplify
5193 (cmp (bit_not@2 @0) (bit_not@3 @1))
5194 (if (single_use (@2) && single_use (@3))
5195 (cmp @1 @0))))
5197 /* Fold ~X op C as X op' ~C, where op' is the swapped comparison. */
5198 (for cmp (simple_comparison)
5199 scmp (swapped_simple_comparison)
5200 (simplify
5201 (cmp (bit_not@2 @0) CONSTANT_CLASS_P@1)
5202 (if (single_use (@2)
5203 && (TREE_CODE (@1) == INTEGER_CST || TREE_CODE (@1) == VECTOR_CST))
5204 (scmp @0 (bit_not @1)))))
5206 (for cmp (simple_comparison)
5207 (simplify
5208 (cmp @0 REAL_CST@1)
5209 /* IEEE doesn't distinguish +0 and -0 in comparisons. */
5210 (switch
5211 /* a CMP (-0) -> a CMP 0 */
5212 (if (REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@1)))
5213 (cmp @0 { build_real (TREE_TYPE (@1), dconst0); }))
5214 /* (-0) CMP b -> 0 CMP b. */
5215 (if (TREE_CODE (@0) == REAL_CST
5216 && REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (@0)))
5217 (cmp { build_real (TREE_TYPE (@0), dconst0); } @1))
5218 /* x != NaN is always true, other ops are always false. */
5219 (if (REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
5220 && (cmp == EQ_EXPR || cmp == NE_EXPR || !flag_trapping_math)
5221 && !tree_expr_signaling_nan_p (@1)
5222 && !tree_expr_maybe_signaling_nan_p (@0))
5223 { constant_boolean_node (cmp == NE_EXPR, type); })
5224 /* NaN != y is always true, other ops are always false. */
5225 (if (TREE_CODE (@0) == REAL_CST
5226 && REAL_VALUE_ISNAN (TREE_REAL_CST (@0))
5227 && (cmp == EQ_EXPR || cmp == NE_EXPR || !flag_trapping_math)
5228 && !tree_expr_signaling_nan_p (@0)
5229 && !tree_expr_signaling_nan_p (@1))
5230 { constant_boolean_node (cmp == NE_EXPR, type); })
5231 /* Fold comparisons against infinity. */
5232 (if (REAL_VALUE_ISINF (TREE_REAL_CST (@1))
5233 && MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (@1))))
5234 (with
5235 {
5236 REAL_VALUE_TYPE max;
5237 enum tree_code code = cmp;
5238 bool neg = REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1));
5239 if (neg)
5240 code = swap_tree_comparison (code);
5241 }
5242 (switch
5243 /* x > +Inf is always false, if we ignore NaNs or exceptions. */
5244 (if (code == GT_EXPR
5245 && !(HONOR_NANS (@0) && flag_trapping_math))
5246 { constant_boolean_node (false, type); })
5247 (if (code == LE_EXPR)
5248 /* x <= +Inf is always true, if we don't care about NaNs. */
5249 (if (! HONOR_NANS (@0))
5250 { constant_boolean_node (true, type); }
5251 /* x <= +Inf is the same as x == x, i.e. !isnan(x), but this loses
5252 an "invalid" exception. */
5253 (if (!flag_trapping_math)
5254 (eq @0 @0))))
5255 /* x == +Inf and x >= +Inf are always equal to x > DBL_MAX, but
5256 for == this introduces an exception for x a NaN. */
5257 (if ((code == EQ_EXPR && !(HONOR_NANS (@0) && flag_trapping_math))
5258 || code == GE_EXPR)
5259 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
5260 (if (neg)
5261 (lt @0 { build_real (TREE_TYPE (@0), max); })
5262 (gt @0 { build_real (TREE_TYPE (@0), max); }))))
5263 /* x < +Inf is always equal to x <= DBL_MAX. */
5264 (if (code == LT_EXPR)
5265 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
5266 (if (neg)
5267 (ge @0 { build_real (TREE_TYPE (@0), max); })
5268 (le @0 { build_real (TREE_TYPE (@0), max); }))))
5269 /* x != +Inf is always equal to !(x > DBL_MAX), but this introduces
5270 an exception for x a NaN so use an unordered comparison. */
5271 (if (code == NE_EXPR)
5272 (with { real_maxval (&max, neg, TYPE_MODE (TREE_TYPE (@0))); }
5273 (if (! HONOR_NANS (@0))
5274 (if (neg)
5275 (ge @0 { build_real (TREE_TYPE (@0), max); })
5276 (le @0 { build_real (TREE_TYPE (@0), max); }))
5277 (if (neg)
5278 (unge @0 { build_real (TREE_TYPE (@0), max); })
5279 (unle @0 { build_real (TREE_TYPE (@0), max); }))))))))))
5281 /* If this is a comparison of a real constant with a PLUS_EXPR
5282 or a MINUS_EXPR of a real constant, we can convert it into a
5283 comparison with a revised real constant as long as no overflow
5284 occurs when unsafe_math_optimizations are enabled. */
5285 (if (flag_unsafe_math_optimizations)
5286 (for op (plus minus)
5287 (simplify
5288 (cmp (op @0 REAL_CST@1) REAL_CST@2)
5289 (with
5290 {
5291 tree tem = const_binop (op == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR,
5292 TREE_TYPE (@1), @2, @1);
5293 }
5294 (if (tem && !TREE_OVERFLOW (tem))
5295 (cmp @0 { tem; }))))))
5297 /* Likewise, we can simplify a comparison of a real constant with
5298 a MINUS_EXPR whose first operand is also a real constant, i.e.
5299 (c1 - x) < c2 becomes x > c1-c2. Reordering is allowed on
5300 floating-point types only if -fassociative-math is set. */
5301 (if (flag_associative_math)
5302 (simplify
5303 (cmp (minus REAL_CST@0 @1) REAL_CST@2)
5304 (with { tree tem = const_binop (MINUS_EXPR, TREE_TYPE (@1), @0, @2); }
5305 (if (tem && !TREE_OVERFLOW (tem))
5306 (cmp { tem; } @1)))))
5308 /* Fold comparisons against built-in math functions. */
5309 (if (flag_unsafe_math_optimizations && ! flag_errno_math)
5310 (for sq (SQRT)
5311 (simplify
5312 (cmp (sq @0) REAL_CST@1)
5313 (switch
5314 (if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (@1)))
5315 (switch
5316 /* sqrt(x) < y is always false, if y is negative. */
5317 (if (cmp == EQ_EXPR || cmp == LT_EXPR || cmp == LE_EXPR)
5318 { constant_boolean_node (false, type); })
5319 /* sqrt(x) > y is always true, if y is negative and we
5320 don't care about NaNs, i.e. negative values of x. */
5321 (if (cmp == NE_EXPR || !HONOR_NANS (@0))
5322 { constant_boolean_node (true, type); })
5323 /* sqrt(x) > y is the same as x >= 0, if y is negative. */
5324 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })))
5325 (if (real_equal (TREE_REAL_CST_PTR (@1), &dconst0))
5326 (switch
5327 /* sqrt(x) < 0 is always false. */
5328 (if (cmp == LT_EXPR)
5329 { constant_boolean_node (false, type); })
5330 /* sqrt(x) >= 0 is always true if we don't care about NaNs. */
5331 (if (cmp == GE_EXPR && !HONOR_NANS (@0))
5332 { constant_boolean_node (true, type); })
5333 /* sqrt(x) <= 0 -> x == 0. */
5334 (if (cmp == LE_EXPR)
5335 (eq @0 @1))
5336 /* Otherwise sqrt(x) cmp 0 -> x cmp 0. Here cmp can be >=, >,
5337 == or !=. In the last case:
5339 (sqrt(x) != 0) == (NaN != 0) == true == (x != 0)
5341 if x is negative or NaN. Due to -funsafe-math-optimizations,
5342 the results for other x follow from natural arithmetic. */
5343 (cmp @0 @1)))
5344 (if ((cmp == LT_EXPR
5345 || cmp == LE_EXPR
5346 || cmp == GT_EXPR
5347 || cmp == GE_EXPR)
5348 && !REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
5349 /* Give up for -frounding-math. */
5350 && !HONOR_SIGN_DEPENDENT_ROUNDING (TREE_TYPE (@0)))
5351 (with
5352 {
5353 REAL_VALUE_TYPE c2;
5354 enum tree_code ncmp = cmp;
5355 const real_format *fmt
5356 = REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (@0)));
5357 real_arithmetic (&c2, MULT_EXPR,
5358 &TREE_REAL_CST (@1), &TREE_REAL_CST (@1));
5359 real_convert (&c2, fmt, &c2);
5360 /* See PR91734: if c2 is inexact and sqrt(c2) < c (or sqrt(c2) >= c),
5361 then change LT_EXPR into LE_EXPR or GE_EXPR into GT_EXPR. */
5362 if (!REAL_VALUE_ISINF (c2))
5363 {
5364 tree c3 = fold_const_call (CFN_SQRT, TREE_TYPE (@0),
5365 build_real (TREE_TYPE (@0), c2));
5366 if (c3 == NULL_TREE || TREE_CODE (c3) != REAL_CST)
5367 ncmp = ERROR_MARK;
5368 else if ((cmp == LT_EXPR || cmp == GE_EXPR)
5369 && real_less (&TREE_REAL_CST (c3), &TREE_REAL_CST (@1)))
5370 ncmp = cmp == LT_EXPR ? LE_EXPR : GT_EXPR;
5371 else if ((cmp == LE_EXPR || cmp == GT_EXPR)
5372 && real_less (&TREE_REAL_CST (@1), &TREE_REAL_CST (c3)))
5373 ncmp = cmp == LE_EXPR ? LT_EXPR : GE_EXPR;
5374 else
5375 {
5376 /* With rounding to even, sqrt of up to 3 different values
5377 gives the same normal result, so in some cases c2 needs
5378 to be adjusted. */
5379 REAL_VALUE_TYPE c2alt, tow;
5380 if (cmp == LT_EXPR || cmp == GE_EXPR)
5381 tow = dconst0;
5382 else
5383 tow = dconstinf;
5384 real_nextafter (&c2alt, fmt, &c2, &tow);
5385 real_convert (&c2alt, fmt, &c2alt);
5386 if (REAL_VALUE_ISINF (c2alt))
5387 ncmp = ERROR_MARK;
5388 else
5389 {
5390 c3 = fold_const_call (CFN_SQRT, TREE_TYPE (@0),
5391 build_real (TREE_TYPE (@0), c2alt));
5392 if (c3 == NULL_TREE || TREE_CODE (c3) != REAL_CST)
5393 ncmp = ERROR_MARK;
5394 else if (real_equal (&TREE_REAL_CST (c3),
5395 &TREE_REAL_CST (@1)))
5396 c2 = c2alt;
5397 }
5398 }
5399 }
5400 }
5401 (if (cmp == GT_EXPR || cmp == GE_EXPR)
5402 (if (REAL_VALUE_ISINF (c2))
5403 /* sqrt(x) > y is x == +Inf, when y is very large. */
5404 (if (HONOR_INFINITIES (@0))
5405 (eq @0 { build_real (TREE_TYPE (@0), c2); })
5406 { constant_boolean_node (false, type); })
5407 /* sqrt(x) > c is the same as x > c*c. */
5408 (if (ncmp != ERROR_MARK)
5409 (if (ncmp == GE_EXPR)
5410 (ge @0 { build_real (TREE_TYPE (@0), c2); })
5411 (gt @0 { build_real (TREE_TYPE (@0), c2); }))))
5412 /* else if (cmp == LT_EXPR || cmp == LE_EXPR) */
5413 (if (REAL_VALUE_ISINF (c2))
5414 (switch
5415 /* sqrt(x) < y is always true, when y is a very large
5416 value and we don't care about NaNs or Infinities. */
5417 (if (! HONOR_NANS (@0) && ! HONOR_INFINITIES (@0))
5418 { constant_boolean_node (true, type); })
5419 /* sqrt(x) < y is x != +Inf when y is very large and we
5420 don't care about NaNs. */
5421 (if (! HONOR_NANS (@0))
5422 (ne @0 { build_real (TREE_TYPE (@0), c2); }))
5423 /* sqrt(x) < y is x >= 0 when y is very large and we
5424 don't care about Infinities. */
5425 (if (! HONOR_INFINITIES (@0))
5426 (ge @0 { build_real (TREE_TYPE (@0), dconst0); }))
5427 /* sqrt(x) < y is x >= 0 && x != +Inf, when y is large. */
5428 (if (GENERIC)
5429 (truth_andif
5430 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })
5431 (ne @0 { build_real (TREE_TYPE (@0), c2); }))))
5432 /* sqrt(x) < c is the same as x < c*c, if we ignore NaNs. */
5433 (if (ncmp != ERROR_MARK && ! HONOR_NANS (@0))
5434 (if (ncmp == LT_EXPR)
5435 (lt @0 { build_real (TREE_TYPE (@0), c2); })
5436 (le @0 { build_real (TREE_TYPE (@0), c2); }))
5437 /* sqrt(x) < c is the same as x >= 0 && x < c*c. */
5438 (if (ncmp != ERROR_MARK && GENERIC)
5439 (if (ncmp == LT_EXPR)
5440 (truth_andif
5441 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })
5442 (lt @0 { build_real (TREE_TYPE (@0), c2); }))
5443 (truth_andif
5444 (ge @0 { build_real (TREE_TYPE (@0), dconst0); })
5445 (le @0 { build_real (TREE_TYPE (@0), c2); })))))))))))
5446 /* Transform sqrt(x) cmp sqrt(y) -> x cmp y. */
5447 (simplify
5448 (cmp (sq @0) (sq @1))
5449 (if (! HONOR_NANS (@0))
5450 (cmp @0 @1))))))
5452 /* Optimize various special cases of (FTYPE) N CMP (FTYPE) M. */
5453 (for cmp (lt le eq ne ge gt unordered ordered unlt unle ungt unge uneq ltgt)
5454 icmp (lt le eq ne ge gt unordered ordered lt le gt ge eq ne)
5455 (simplify
5456 (cmp (float@0 @1) (float @2))
5457 (if (SCALAR_FLOAT_TYPE_P (TREE_TYPE (@0))
5458 && ! DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0)))
5459 (with
5460 {
5461 format_helper fmt (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (@0))));
5462 tree type1 = TREE_TYPE (@1);
5463 bool type1_signed_p = TYPE_SIGN (type1) == SIGNED;
5464 tree type2 = TREE_TYPE (@2);
5465 bool type2_signed_p = TYPE_SIGN (type2) == SIGNED;
5466 }
5467 (if (fmt.can_represent_integral_type_p (type1)
5468 && fmt.can_represent_integral_type_p (type2))
5469 (if (cmp == ORDERED_EXPR || cmp == UNORDERED_EXPR)
5470 { constant_boolean_node (cmp == ORDERED_EXPR, type); }
5471 (if (TYPE_PRECISION (type1) > TYPE_PRECISION (type2)
5472 && type1_signed_p >= type2_signed_p)
5473 (icmp @1 (convert @2))
5474 (if (TYPE_PRECISION (type1) < TYPE_PRECISION (type2)
5475 && type1_signed_p <= type2_signed_p)
5476 (icmp (convert:type2 @1) @2)
5477 (if (TYPE_PRECISION (type1) == TYPE_PRECISION (type2)
5478 && type1_signed_p == type2_signed_p)
5479 (icmp @1 @2))))))))))
5481 /* Optimize various special cases of (FTYPE) N CMP CST. */
5482 (for cmp (lt le eq ne ge gt)
5483 icmp (le le eq ne ge ge)
5484 (simplify
5485 (cmp (float @0) REAL_CST@1)
5486 (if (SCALAR_FLOAT_TYPE_P (TREE_TYPE (@1))
5487 && ! DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@1)))
5488 (with
5489 {
5490 tree itype = TREE_TYPE (@0);
5491 format_helper fmt (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (@1))));
5492 const REAL_VALUE_TYPE *cst = TREE_REAL_CST_PTR (@1);
5493 /* Be careful to preserve any potential exceptions due to
5494 NaNs. qNaNs are ok in == or != context.
5495 TODO: relax under -fno-trapping-math or
5496 -fno-signaling-nans. */
5497 bool exception_p
5498 = real_isnan (cst) && (cst->signalling
5499 || (cmp != EQ_EXPR && cmp != NE_EXPR));
5500 }
5501 /* TODO: allow non-fitting itype and SNaNs when
5502 -fno-trapping-math. */
5503 (if (fmt.can_represent_integral_type_p (itype) && ! exception_p)
5504 (with
5505 {
5506 signop isign = TYPE_SIGN (itype);
5507 REAL_VALUE_TYPE imin, imax;
5508 real_from_integer (&imin, fmt, wi::min_value (itype), isign);
5509 real_from_integer (&imax, fmt, wi::max_value (itype), isign);
5511 REAL_VALUE_TYPE icst;
5512 if (cmp == GT_EXPR || cmp == GE_EXPR)
5513 real_ceil (&icst, fmt, cst);
5514 else if (cmp == LT_EXPR || cmp == LE_EXPR)
5515 real_floor (&icst, fmt, cst);
5516 else
5517 real_trunc (&icst, fmt, cst);
5519 bool cst_int_p = !real_isnan (cst) && real_identical (&icst, cst);
5521 bool overflow_p = false;
5522 wide_int icst_val
5523 = real_to_integer (&icst, &overflow_p, TYPE_PRECISION (itype));
5524 }
5525 (switch
5526 /* Optimize cases when CST is outside of ITYPE's range. */
5527 (if (real_compare (LT_EXPR, cst, &imin))
5528 { constant_boolean_node (cmp == GT_EXPR || cmp == GE_EXPR || cmp == NE_EXPR,
5529 type); })
5530 (if (real_compare (GT_EXPR, cst, &imax))
5531 { constant_boolean_node (cmp == LT_EXPR || cmp == LE_EXPR || cmp == NE_EXPR,
5532 type); })
5533 /* Remove cast if CST is an integer representable by ITYPE. */
5534 (if (cst_int_p)
5535 (cmp @0 { gcc_assert (!overflow_p);
5536 wide_int_to_tree (itype, icst_val); })
5537 )
5538 /* When CST is fractional, optimize
5539 (FTYPE) N == CST -> 0
5540 (FTYPE) N != CST -> 1. */
5541 (if (cmp == EQ_EXPR || cmp == NE_EXPR)
5542 { constant_boolean_node (cmp == NE_EXPR, type); })
5543 /* Otherwise replace with sensible integer constant. */
5544 (with
5545 {
5546 gcc_checking_assert (!overflow_p);
5547 }
5548 (icmp @0 { wide_int_to_tree (itype, icst_val); })))))))))
5550 /* Fold A /[ex] B CMP C to A CMP B * C. */
5551 (for cmp (eq ne)
5552 (simplify
5553 (cmp (exact_div @0 @1) INTEGER_CST@2)
5554 (if (!integer_zerop (@1))
5555 (if (wi::to_wide (@2) == 0)
5556 (cmp @0 @2)
5557 (if (TREE_CODE (@1) == INTEGER_CST)
5558 (with
5559 {
5560 wi::overflow_type ovf;
5561 wide_int prod = wi::mul (wi::to_wide (@2), wi::to_wide (@1),
5562 TYPE_SIGN (TREE_TYPE (@1)), &ovf);
5563 }
5564 (if (ovf)
5565 { constant_boolean_node (cmp == NE_EXPR, type); }
5566 (cmp @0 { wide_int_to_tree (TREE_TYPE (@0), prod); }))))))))
5567 (for cmp (lt le gt ge)
5568 (simplify
5569 (cmp (exact_div @0 INTEGER_CST@1) INTEGER_CST@2)
5570 (if (wi::gt_p (wi::to_wide (@1), 0, TYPE_SIGN (TREE_TYPE (@1))))
5571 (with
5572 {
5573 wi::overflow_type ovf;
5574 wide_int prod = wi::mul (wi::to_wide (@2), wi::to_wide (@1),
5575 TYPE_SIGN (TREE_TYPE (@1)), &ovf);
5576 }
5577 (if (ovf)
5578 { constant_boolean_node (wi::lt_p (wi::to_wide (@2), 0,
5579 TYPE_SIGN (TREE_TYPE (@2)))
5580 != (cmp == LT_EXPR || cmp == LE_EXPR), type); }
5581 (cmp @0 { wide_int_to_tree (TREE_TYPE (@0), prod); }))))))
5583 /* Fold (size_t)(A /[ex] B) CMP C to (size_t)A CMP (size_t)B * C or A CMP' 0.
5585 For small C (less than max/B), this is (size_t)A CMP (size_t)B * C.
5586 For large C (more than min/B+2^size), this is also true, with the
5587 multiplication computed modulo 2^size.
5588 For intermediate C, this just tests the sign of A. */
5589 (for cmp (lt le gt ge)
5590 cmp2 (ge ge lt lt)
5591 (simplify
5592 (cmp (convert (exact_div @0 INTEGER_CST@1)) INTEGER_CST@2)
5593 (if (tree_nop_conversion_p (TREE_TYPE (@0), TREE_TYPE (@2))
5594 && TYPE_UNSIGNED (TREE_TYPE (@2)) && !TYPE_UNSIGNED (TREE_TYPE (@0))
5595 && wi::gt_p (wi::to_wide (@1), 0, TYPE_SIGN (TREE_TYPE (@1))))
5596 (with
5597 {
5598 tree utype = TREE_TYPE (@2);
5599 wide_int denom = wi::to_wide (@1);
5600 wide_int right = wi::to_wide (@2);
5601 wide_int smax = wi::sdiv_trunc (wi::max_value (TREE_TYPE (@0)), denom);
5602 wide_int smin = wi::sdiv_trunc (wi::min_value (TREE_TYPE (@0)), denom);
5603 bool small = wi::leu_p (right, smax);
5604 bool large = wi::geu_p (right, smin);
5605 }
5606 (if (small || large)
5607 (cmp (convert:utype @0) (mult @2 (convert @1)))
5608 (cmp2 @0 { build_zero_cst (TREE_TYPE (@0)); }))))))
5610 /* Unordered tests if either argument is a NaN. */
5611 (simplify
5612 (bit_ior (unordered @0 @0) (unordered @1 @1))
5613 (if (types_match (@0, @1))
5614 (unordered @0 @1)))
5615 (simplify
5616 (bit_and (ordered @0 @0) (ordered @1 @1))
5617 (if (types_match (@0, @1))
5618 (ordered @0 @1)))
5619 (simplify
5620 (bit_ior:c (unordered @0 @0) (unordered:c@2 @0 @1))
5621 @2)
5622 (simplify
5623 (bit_and:c (ordered @0 @0) (ordered:c@2 @0 @1))
5624 @2)
5626 /* Simple range test simplifications. */
5627 /* A < B || A >= B -> true. */
5628 (for test1 (lt le le le ne ge)
5629 test2 (ge gt ge ne eq ne)
5630 (simplify
5631 (bit_ior:c (test1 @0 @1) (test2 @0 @1))
5632 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5633 || VECTOR_INTEGER_TYPE_P (TREE_TYPE (@0)))
5634 { constant_boolean_node (true, type); })))
5635 /* A < B && A >= B -> false. */
5636 (for test1 (lt lt lt le ne eq)
5637 test2 (ge gt eq gt eq gt)
5638 (simplify
5639 (bit_and:c (test1 @0 @1) (test2 @0 @1))
5640 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5641 || VECTOR_INTEGER_TYPE_P (TREE_TYPE (@0)))
5642 { constant_boolean_node (false, type); })))
5644 /* A & (2**N - 1) <= 2**K - 1 -> A & (2**N - 2**K) == 0
5645 A & (2**N - 1) > 2**K - 1 -> A & (2**N - 2**K) != 0
5647 Note that comparisons
5648 A & (2**N - 1) < 2**K -> A & (2**N - 2**K) == 0
5649 A & (2**N - 1) >= 2**K -> A & (2**N - 2**K) != 0
5650 will be canonicalized to above so there's no need to
5651 consider them here.
5652 */
5654 (for cmp (le gt)
5655 eqcmp (eq ne)
5656 (simplify
5657 (cmp (bit_and@0 @1 INTEGER_CST@2) INTEGER_CST@3)
5658 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)))
5659 (with
5660 {
5661 tree ty = TREE_TYPE (@0);
5662 unsigned prec = TYPE_PRECISION (ty);
5663 wide_int mask = wi::to_wide (@2, prec);
5664 wide_int rhs = wi::to_wide (@3, prec);
5665 signop sgn = TYPE_SIGN (ty);
5666 }
5667 (if ((mask & (mask + 1)) == 0 && wi::gt_p (rhs, 0, sgn)
5668 && (rhs & (rhs + 1)) == 0 && wi::ge_p (mask, rhs, sgn))
5669 (eqcmp (bit_and @1 { wide_int_to_tree (ty, mask - rhs); })
5670 { build_zero_cst (ty); }))))))
5672 /* -A CMP -B -> B CMP A. */
5673 (for cmp (tcc_comparison)
5674 scmp (swapped_tcc_comparison)
5675 (simplify
5676 (cmp (negate @0) (negate @1))
5677 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
5678 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
5679 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))))
5680 (scmp @0 @1)))
5681 (simplify
5682 (cmp (negate @0) CONSTANT_CLASS_P@1)
5683 (if (FLOAT_TYPE_P (TREE_TYPE (@0))
5684 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
5685 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))))
5686 (with { tree tem = const_unop (NEGATE_EXPR, TREE_TYPE (@0), @1); }
5687 (if (tem && !TREE_OVERFLOW (tem))
5688 (scmp @0 { tem; }))))))
5690 /* Convert ABS_EXPR<x> == 0 or ABS_EXPR<x> != 0 to x == 0 or x != 0. */
5691 (for op (eq ne)
5692 (simplify
5693 (op (abs @0) zerop@1)
5694 (op @0 @1)))
5696 /* From fold_sign_changed_comparison and fold_widened_comparison.
5697 FIXME: the lack of symmetry is disturbing. */
5698 (for cmp (simple_comparison)
5699 (simplify
5700 (cmp (convert@0 @00) (convert?@1 @10))
5701 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5702 /* Disable this optimization if we're casting a function pointer
5703 type on targets that require function pointer canonicalization. */
5704 && !(targetm.have_canonicalize_funcptr_for_compare ()
5705 && ((POINTER_TYPE_P (TREE_TYPE (@00))
5706 && FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@00))))
5707 || (POINTER_TYPE_P (TREE_TYPE (@10))
5708 && FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@10))))))
5709 && single_use (@0))
5710 (if (TYPE_PRECISION (TREE_TYPE (@00)) == TYPE_PRECISION (TREE_TYPE (@0))
5711 && (TREE_CODE (@10) == INTEGER_CST
5712 || @1 != @10)
5713 && (TYPE_UNSIGNED (TREE_TYPE (@00)) == TYPE_UNSIGNED (TREE_TYPE (@0))
5714 || cmp == NE_EXPR
5715 || cmp == EQ_EXPR)
5716 && !POINTER_TYPE_P (TREE_TYPE (@00))
5717 /* (int)bool:32 != (int)uint is not the same as
5718 bool:32 != (bool:32)uint since boolean types only have two valid
5719 values independent of their precision. */
5720 && (TREE_CODE (TREE_TYPE (@00)) != BOOLEAN_TYPE
5721 || TREE_CODE (TREE_TYPE (@10)) == BOOLEAN_TYPE))
5722 /* ??? The special-casing of INTEGER_CST conversion was in the original
5723 code and here to avoid a spurious overflow flag on the resulting
5724 constant which fold_convert produces. */
5725 (if (TREE_CODE (@1) == INTEGER_CST)
5726 (cmp @00 { force_fit_type (TREE_TYPE (@00), wi::to_widest (@1), 0,
5727 TREE_OVERFLOW (@1)); })
5728 (cmp @00 (convert @1)))
5730 (if (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (TREE_TYPE (@00)))
5731 /* If possible, express the comparison in the shorter mode. */
5732 (if ((cmp == EQ_EXPR || cmp == NE_EXPR
5733 || TYPE_UNSIGNED (TREE_TYPE (@0)) == TYPE_UNSIGNED (TREE_TYPE (@00))
5734 || (!TYPE_UNSIGNED (TREE_TYPE (@0))
5735 && TYPE_UNSIGNED (TREE_TYPE (@00))))
5736 && (types_match (TREE_TYPE (@10), TREE_TYPE (@00))
5737 || ((TYPE_PRECISION (TREE_TYPE (@00))
5738 >= TYPE_PRECISION (TREE_TYPE (@10)))
5739 && (TYPE_UNSIGNED (TREE_TYPE (@00))
5740 == TYPE_UNSIGNED (TREE_TYPE (@10))))
5741 || (TREE_CODE (@10) == INTEGER_CST
5742 && INTEGRAL_TYPE_P (TREE_TYPE (@00))
5743 && int_fits_type_p (@10, TREE_TYPE (@00)))))
5744 (cmp @00 (convert @10))
5745 (if (TREE_CODE (@10) == INTEGER_CST
5746 && INTEGRAL_TYPE_P (TREE_TYPE (@00))
5747 && !int_fits_type_p (@10, TREE_TYPE (@00)))
5748 (with
5749 {
5750 tree min = lower_bound_in_type (TREE_TYPE (@10), TREE_TYPE (@00));
5751 tree max = upper_bound_in_type (TREE_TYPE (@10), TREE_TYPE (@00));
5752 bool above = integer_nonzerop (const_binop (LT_EXPR, type, max, @10));
5753 bool below = integer_nonzerop (const_binop (LT_EXPR, type, @10, min));
5754 }
5755 (if (above || below)
5756 (if (cmp == EQ_EXPR || cmp == NE_EXPR)
5757 { constant_boolean_node (cmp == EQ_EXPR ? false : true, type); }
5758 (if (cmp == LT_EXPR || cmp == LE_EXPR)
5759 { constant_boolean_node (above ? true : false, type); }
5760 (if (cmp == GT_EXPR || cmp == GE_EXPR)
5761 { constant_boolean_node (above ? false : true, type); })))))))))
5762 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
5763 (if (FLOAT_TYPE_P (TREE_TYPE (@00))
5764 && (DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0))
5765 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@00)))
5766 && (DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0))
5767 == DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@10))))
5768 (with
5769 {
5770 tree type1 = TREE_TYPE (@10);
5771 if (TREE_CODE (@10) == REAL_CST && !DECIMAL_FLOAT_TYPE_P (type1))
5772 {
5773 REAL_VALUE_TYPE orig = TREE_REAL_CST (@10);
5774 if (TYPE_PRECISION (type1) > TYPE_PRECISION (float_type_node)
5775 && exact_real_truncate (TYPE_MODE (float_type_node), &orig))
5776 type1 = float_type_node;
5777 if (TYPE_PRECISION (type1) > TYPE_PRECISION (double_type_node)
5778 && exact_real_truncate (TYPE_MODE (double_type_node), &orig))
5779 type1 = double_type_node;
5780 }
5781 tree newtype
5782 = (TYPE_PRECISION (TREE_TYPE (@00)) > TYPE_PRECISION (type1)
5783 ? TREE_TYPE (@00) : type1);
5784 }
5785 (if (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (newtype))
5786 (cmp (convert:newtype @00) (convert:newtype @10))))))))
5789 (for cmp (eq ne)
5790 (simplify
5791 /* SSA names are canonicalized to 2nd place. */
5792 (cmp addr@0 SSA_NAME@1)
5793 (with
5794 {
5795 poly_int64 off; tree base;
5796 tree addr = (TREE_CODE (@0) == SSA_NAME
5797 ? gimple_assign_rhs1 (SSA_NAME_DEF_STMT (@0)) : @0);
5798 }
5799 /* A local variable can never be pointed to by
5800 the default SSA name of an incoming parameter. */
5801 (if (SSA_NAME_IS_DEFAULT_DEF (@1)
5802 && TREE_CODE (SSA_NAME_VAR (@1)) == PARM_DECL
5803 && (base = get_base_address (TREE_OPERAND (addr, 0)))
5804 && TREE_CODE (base) == VAR_DECL
5805 && auto_var_in_fn_p (base, current_function_decl))
5806 (if (cmp == NE_EXPR)
5807 { constant_boolean_node (true, type); }
5808 { constant_boolean_node (false, type); })
5809 /* If the address is based on @1 decide using the offset. */
5810 (if ((base = get_addr_base_and_unit_offset (TREE_OPERAND (addr, 0), &off))
5811 && TREE_CODE (base) == MEM_REF
5812 && TREE_OPERAND (base, 0) == @1)
5813 (with { off += mem_ref_offset (base).force_shwi (); }
5814 (if (known_ne (off, 0))
5815 { constant_boolean_node (cmp == NE_EXPR, type); }
5816 (if (known_eq (off, 0))
5817 { constant_boolean_node (cmp == EQ_EXPR, type); }))))))))
5819 /* Equality compare simplifications from fold_binary */
5820 (for cmp (eq ne)
5822 /* If we have (A | C) == D where C & ~D != 0, convert this into 0.
5823 Similarly for NE_EXPR. */
5824 (simplify
5825 (cmp (convert?@3 (bit_ior @0 INTEGER_CST@1)) INTEGER_CST@2)
5826 (if (tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0))
5827 && wi::bit_and_not (wi::to_wide (@1), wi::to_wide (@2)) != 0)
5828 { constant_boolean_node (cmp == NE_EXPR, type); }))
5830 /* (X ^ Y) == 0 becomes X == Y, and (X ^ Y) != 0 becomes X != Y. */
5831 (simplify
5832 (cmp (bit_xor @0 @1) integer_zerop)
5833 (cmp @0 @1))
5835 /* (X ^ Y) == Y becomes X == 0.
5836 Likewise (X ^ Y) == X becomes Y == 0. */
5837 (simplify
5838 (cmp:c (bit_xor:c @0 @1) @0)
5839 (cmp @1 { build_zero_cst (TREE_TYPE (@1)); }))
5841 /* (X & Y) == X becomes (X & ~Y) == 0. */
5842 (simplify
5843 (cmp:c (bit_and:c @0 @1) @0)
5844 (cmp (bit_and @0 (bit_not! @1)) { build_zero_cst (TREE_TYPE (@0)); }))
5845 (simplify
5846 (cmp:c (convert@3 (bit_and (convert@2 @0) INTEGER_CST@1)) (convert @0))
5847 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5848 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
5849 && INTEGRAL_TYPE_P (TREE_TYPE (@3))
5850 && TYPE_PRECISION (TREE_TYPE (@2)) == TYPE_PRECISION (TREE_TYPE (@0))
5851 && TYPE_PRECISION (TREE_TYPE (@3)) > TYPE_PRECISION (TREE_TYPE (@2))
5852 && !wi::neg_p (wi::to_wide (@1)))
5853 (cmp (bit_and @0 (convert (bit_not @1)))
5854 { build_zero_cst (TREE_TYPE (@0)); })))
5856 /* (X | Y) == Y becomes (X & ~Y) == 0. */
5857 (simplify
5858 (cmp:c (bit_ior:c @0 @1) @1)
5859 (cmp (bit_and @0 (bit_not! @1)) { build_zero_cst (TREE_TYPE (@0)); }))
5861 /* (X ^ C1) op C2 can be rewritten as X op (C1 ^ C2). */
5862 (simplify
5863 (cmp (convert?@3 (bit_xor @0 INTEGER_CST@1)) INTEGER_CST@2)
5864 (if (tree_nop_conversion_p (TREE_TYPE (@3), TREE_TYPE (@0)))
5865 (cmp @0 (bit_xor @1 (convert @2)))))
5867 (simplify
5868 (cmp (convert? addr@0) integer_zerop)
5869 (if (tree_single_nonzero_warnv_p (@0, NULL))
5870 { constant_boolean_node (cmp == NE_EXPR, type); }))
5872 /* (X & C) op (Y & C) into (X ^ Y) & C op 0. */
5873 (simplify
5874 (cmp (bit_and:cs @0 @2) (bit_and:cs @1 @2))
5875 (cmp (bit_and (bit_xor @0 @1) @2) { build_zero_cst (TREE_TYPE (@2)); })))
5877 /* (X < 0) != (Y < 0) into (X ^ Y) < 0.
5878 (X >= 0) != (Y >= 0) into (X ^ Y) < 0.
5879 (X < 0) == (Y < 0) into (X ^ Y) >= 0.
5880 (X >= 0) == (Y >= 0) into (X ^ Y) >= 0. */
5881 (for cmp (eq ne)
5882 ncmp (ge lt)
5883 (for sgncmp (ge lt)
5884 (simplify
5885 (cmp (sgncmp @0 integer_zerop@2) (sgncmp @1 integer_zerop))
5886 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
5887 && !TYPE_UNSIGNED (TREE_TYPE (@0))
5888 && types_match (@0, @1))
5889 (ncmp (bit_xor @0 @1) @2)))))
5890 /* (X < 0) == (Y >= 0) into (X ^ Y) < 0.
5891 (X < 0) != (Y >= 0) into (X ^ Y) >= 0. */
5892 (for cmp (eq ne)
5893 ncmp (lt ge)
5894 (simplify
5895 (cmp:c (lt @0 integer_zerop@2) (ge @1 integer_zerop))
5896 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
5897 && !TYPE_UNSIGNED (TREE_TYPE (@0))
5898 && types_match (@0, @1))
5899 (ncmp (bit_xor @0 @1) @2))))
5901 /* If we have (A & C) == C where C is a power of 2, convert this into
5902 (A & C) != 0. Similarly for NE_EXPR. */
5903 (for cmp (eq ne)
5904 icmp (ne eq)
5905 (simplify
5906 (cmp (bit_and@2 @0 integer_pow2p@1) @1)
5907 (icmp @2 { build_zero_cst (TREE_TYPE (@0)); })))
5909 #if GIMPLE
5910 /* From fold_binary_op_with_conditional_arg handle the case of
5911 rewriting (a ? b : c) > d to a ? (b > d) : (c > d) when the
5912 compares simplify. */
5913 (for cmp (simple_comparison)
5914 (simplify
5915 (cmp:c (cond @0 @1 @2) @3)
5916 /* Do not move possibly trapping operations into the conditional as this
5917 pessimizes code and causes gimplification issues when applied late. */
5918 (if (!FLOAT_TYPE_P (TREE_TYPE (@3))
5919 || !operation_could_trap_p (cmp, true, false, @3))
5920 (cond @0 (cmp! @1 @3) (cmp! @2 @3)))))
5921 #endif
5923 (for cmp (ge lt)
5924 /* x < 0 ? ~y : y into (x >> (prec-1)) ^ y. */
5925 /* x >= 0 ? ~y : y into ~((x >> (prec-1)) ^ y). */
5926 (simplify
5927 (cond (cmp @0 integer_zerop) (bit_not @1) @1)
5928 (if (INTEGRAL_TYPE_P (type)
5929 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
5930 && !TYPE_UNSIGNED (TREE_TYPE (@0))
5931 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (type))
5932 (with
5933 {
5934 tree shifter = build_int_cst (integer_type_node, TYPE_PRECISION (type) - 1);
5935 }
5936 (if (cmp == LT_EXPR)
5937 (bit_xor (convert (rshift @0 {shifter;})) @1)
5938 (bit_not (bit_xor (convert (rshift @0 {shifter;})) @1))))))
5939 /* x < 0 ? y : ~y into ~((x >> (prec-1)) ^ y). */
5940 /* x >= 0 ? y : ~y into (x >> (prec-1)) ^ y. */
5941 (simplify
5942 (cond (cmp @0 integer_zerop) @1 (bit_not @1))
5943 (if (INTEGRAL_TYPE_P (type)
5944 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
5945 && !TYPE_UNSIGNED (TREE_TYPE (@0))
5946 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (type))
5947 (with
5948 {
5949 tree shifter = build_int_cst (integer_type_node, TYPE_PRECISION (type) - 1);
5950 }
5951 (if (cmp == GE_EXPR)
5952 (bit_xor (convert (rshift @0 {shifter;})) @1)
5953 (bit_not (bit_xor (convert (rshift @0 {shifter;})) @1)))))))
5955 /* If we have (A & C) != 0 ? D : 0 where C and D are powers of 2,
5956 convert this into a shift followed by ANDing with D. */
5957 (simplify
5958 (cond
5959 (ne (bit_and @0 integer_pow2p@1) integer_zerop)
5960 INTEGER_CST@2 integer_zerop)
5961 (if (!POINTER_TYPE_P (type) && integer_pow2p (@2))
5962 (with {
5963 int shift = (wi::exact_log2 (wi::to_wide (@2))
5964 - wi::exact_log2 (wi::to_wide (@1)));
5965 }
5966 (if (shift > 0)
5967 (bit_and
5968 (lshift (convert @0) { build_int_cst (integer_type_node, shift); }) @2)
5969 (bit_and
5970 (convert (rshift @0 { build_int_cst (integer_type_node, -shift); }))
5971 @2)))))
5973 /* If we have (A & C) != 0 where C is the sign bit of A, convert
5974 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
5975 (for cmp (eq ne)
5976 ncmp (ge lt)
5977 (simplify
5978 (cmp (bit_and (convert?@2 @0) integer_pow2p@1) integer_zerop)
5979 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
5980 && type_has_mode_precision_p (TREE_TYPE (@0))
5981 && element_precision (@2) >= element_precision (@0)
5982 && wi::only_sign_bit_p (wi::to_wide (@1), element_precision (@0)))
5983 (with { tree stype = signed_type_for (TREE_TYPE (@0)); }
5984 (ncmp (convert:stype @0) { build_zero_cst (stype); })))))
5986 /* If we have A < 0 ? C : 0 where C is a power of 2, convert
5987 this into a right shift or sign extension followed by ANDing with C. */
5988 (simplify
5989 (cond
5990 (lt @0 integer_zerop)
5991 INTEGER_CST@1 integer_zerop)
5992 (if (integer_pow2p (@1)
5993 && !TYPE_UNSIGNED (TREE_TYPE (@0)))
5994 (with {
5995 int shift = element_precision (@0) - wi::exact_log2 (wi::to_wide (@1)) - 1;
5996 }
5997 (if (shift >= 0)
5998 (bit_and
5999 (convert (rshift @0 { build_int_cst (integer_type_node, shift); }))
6000 @1)
6001 /* Otherwise ctype must be wider than TREE_TYPE (@0) and pure
6002 sign extension followed by AND with C will achieve the effect. */
6003 (bit_and (convert @0) @1)))))
6005 /* When the addresses are not directly of decls compare base and offset.
6006 This implements some remaining parts of fold_comparison address
6007 comparisons but still no complete part of it. Still it is good
6008 enough to make fold_stmt not regress when not dispatching to fold_binary. */
6009 (for cmp (simple_comparison)
6010 (simplify
6011 (cmp (convert1?@2 addr@0) (convert2? addr@1))
6012 (with
6013 {
6014 poly_int64 off0, off1;
6015 tree base0, base1;
6016 int equal = address_compare (cmp, TREE_TYPE (@2), @0, @1, base0, base1,
6017 off0, off1, GENERIC);
6018 }
6019 (if (equal == 1)
6020 (switch
6021 (if (cmp == EQ_EXPR && (known_eq (off0, off1) || known_ne (off0, off1)))
6022 { constant_boolean_node (known_eq (off0, off1), type); })
6023 (if (cmp == NE_EXPR && (known_eq (off0, off1) || known_ne (off0, off1)))
6024 { constant_boolean_node (known_ne (off0, off1), type); })
6025 (if (cmp == LT_EXPR && (known_lt (off0, off1) || known_ge (off0, off1)))
6026 { constant_boolean_node (known_lt (off0, off1), type); })
6027 (if (cmp == LE_EXPR && (known_le (off0, off1) || known_gt (off0, off1)))
6028 { constant_boolean_node (known_le (off0, off1), type); })
6029 (if (cmp == GE_EXPR && (known_ge (off0, off1) || known_lt (off0, off1)))
6030 { constant_boolean_node (known_ge (off0, off1), type); })
6031 (if (cmp == GT_EXPR && (known_gt (off0, off1) || known_le (off0, off1)))
6032 { constant_boolean_node (known_gt (off0, off1), type); }))
6033 (if (equal == 0)
6034 (switch
6035 (if (cmp == EQ_EXPR)
6036 { constant_boolean_node (false, type); })
6037 (if (cmp == NE_EXPR)
6038 { constant_boolean_node (true, type); })))))))
6040 /* Simplify pointer equality compares using PTA. */
6041 (for neeq (ne eq)
6042 (simplify
6043 (neeq @0 @1)
6044 (if (POINTER_TYPE_P (TREE_TYPE (@0))
6045 && ptrs_compare_unequal (@0, @1))
6046 { constant_boolean_node (neeq != EQ_EXPR, type); })))
6048 /* PR70920: Transform (intptr_t)x eq/ne CST to x eq/ne (typeof x) CST.
6049 and (typeof ptr_cst) x eq/ne ptr_cst to x eq/ne (typeof x) CST.
6050 Disable the transform if either operand is pointer to function.
6051 This broke pr22051-2.c for arm where function pointer
6052 canonicalizaion is not wanted. */
6054 (for cmp (ne eq)
6055 (simplify
6056 (cmp (convert @0) INTEGER_CST@1)
6057 (if (((POINTER_TYPE_P (TREE_TYPE (@0))
6058 && !FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@0)))
6059 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
6060 /* Don't perform this optimization in GENERIC if @0 has reference
6061 type when sanitizing. See PR101210. */
6062 && !(GENERIC
6063 && TREE_CODE (TREE_TYPE (@0)) == REFERENCE_TYPE
6064 && (flag_sanitize & (SANITIZE_NULL | SANITIZE_ALIGNMENT))))
6065 || (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6066 && POINTER_TYPE_P (TREE_TYPE (@1))
6067 && !FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (@1)))))
6068 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1)))
6069 (cmp @0 (convert @1)))))
6071 /* Non-equality compare simplifications from fold_binary */
6072 (for cmp (lt gt le ge)
6073 /* Comparisons with the highest or lowest possible integer of
6074 the specified precision will have known values. */
6075 (simplify
6076 (cmp (convert?@2 @0) uniform_integer_cst_p@1)
6077 (if ((INTEGRAL_TYPE_P (TREE_TYPE (@1))
6078 || POINTER_TYPE_P (TREE_TYPE (@1))
6079 || VECTOR_INTEGER_TYPE_P (TREE_TYPE (@1)))
6080 && tree_nop_conversion_p (TREE_TYPE (@2), TREE_TYPE (@0)))
6081 (with
6082 {
6083 tree cst = uniform_integer_cst_p (@1);
6084 tree arg1_type = TREE_TYPE (cst);
6085 unsigned int prec = TYPE_PRECISION (arg1_type);
6086 wide_int max = wi::max_value (arg1_type);
6087 wide_int signed_max = wi::max_value (prec, SIGNED);
6088 wide_int min = wi::min_value (arg1_type);
6089 }
6090 (switch
6091 (if (wi::to_wide (cst) == max)
6092 (switch
6093 (if (cmp == GT_EXPR)
6094 { constant_boolean_node (false, type); })
6095 (if (cmp == GE_EXPR)
6096 (eq @2 @1))
6097 (if (cmp == LE_EXPR)
6098 { constant_boolean_node (true, type); })
6099 (if (cmp == LT_EXPR)
6100 (ne @2 @1))))
6101 (if (wi::to_wide (cst) == min)
6102 (switch
6103 (if (cmp == LT_EXPR)
6104 { constant_boolean_node (false, type); })
6105 (if (cmp == LE_EXPR)
6106 (eq @2 @1))
6107 (if (cmp == GE_EXPR)
6108 { constant_boolean_node (true, type); })
6109 (if (cmp == GT_EXPR)
6110 (ne @2 @1))))
6111 (if (wi::to_wide (cst) == max - 1)
6112 (switch
6113 (if (cmp == GT_EXPR)
6114 (eq @2 { build_uniform_cst (TREE_TYPE (@1),
6115 wide_int_to_tree (TREE_TYPE (cst),
6116 wi::to_wide (cst)
6117 + 1)); }))
6118 (if (cmp == LE_EXPR)
6119 (ne @2 { build_uniform_cst (TREE_TYPE (@1),
6120 wide_int_to_tree (TREE_TYPE (cst),
6121 wi::to_wide (cst)
6122 + 1)); }))))
6123 (if (wi::to_wide (cst) == min + 1)
6124 (switch
6125 (if (cmp == GE_EXPR)
6126 (ne @2 { build_uniform_cst (TREE_TYPE (@1),
6127 wide_int_to_tree (TREE_TYPE (cst),
6128 wi::to_wide (cst)
6129 - 1)); }))
6130 (if (cmp == LT_EXPR)
6131 (eq @2 { build_uniform_cst (TREE_TYPE (@1),
6132 wide_int_to_tree (TREE_TYPE (cst),
6133 wi::to_wide (cst)
6134 - 1)); }))))
6135 (if (wi::to_wide (cst) == signed_max
6136 && TYPE_UNSIGNED (arg1_type)
6137 /* We will flip the signedness of the comparison operator
6138 associated with the mode of @1, so the sign bit is
6139 specified by this mode. Check that @1 is the signed
6140 max associated with this sign bit. */
6141 && prec == GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (arg1_type))
6142 /* signed_type does not work on pointer types. */
6143 && INTEGRAL_TYPE_P (arg1_type))
6144 /* The following case also applies to X < signed_max+1
6145 and X >= signed_max+1 because previous transformations. */
6146 (if (cmp == LE_EXPR || cmp == GT_EXPR)
6147 (with { tree st = signed_type_for (TREE_TYPE (@1)); }
6148 (switch
6149 (if (cst == @1 && cmp == LE_EXPR)
6150 (ge (convert:st @0) { build_zero_cst (st); }))
6151 (if (cst == @1 && cmp == GT_EXPR)
6152 (lt (convert:st @0) { build_zero_cst (st); }))
6153 (if (cmp == LE_EXPR)
6154 (ge (view_convert:st @0) { build_zero_cst (st); }))
6155 (if (cmp == GT_EXPR)
6156 (lt (view_convert:st @0) { build_zero_cst (st); })))))))))))
6158 (for cmp (unordered ordered unlt unle ungt unge uneq ltgt)
6159 /* If the second operand is NaN, the result is constant. */
6160 (simplify
6161 (cmp @0 REAL_CST@1)
6162 (if (REAL_VALUE_ISNAN (TREE_REAL_CST (@1))
6163 && (cmp != LTGT_EXPR || ! flag_trapping_math))
6164 { constant_boolean_node (cmp == ORDERED_EXPR || cmp == LTGT_EXPR
6165 ? false : true, type); })))
6167 /* Fold UNORDERED if either operand must be NaN, or neither can be. */
6168 (simplify
6169 (unordered @0 @1)
6170 (switch
6171 (if (tree_expr_nan_p (@0) || tree_expr_nan_p (@1))
6172 { constant_boolean_node (true, type); })
6173 (if (!tree_expr_maybe_nan_p (@0) && !tree_expr_maybe_nan_p (@1))
6174 { constant_boolean_node (false, type); })))
6176 /* Fold ORDERED if either operand must be NaN, or neither can be. */
6177 (simplify
6178 (ordered @0 @1)
6179 (switch
6180 (if (tree_expr_nan_p (@0) || tree_expr_nan_p (@1))
6181 { constant_boolean_node (false, type); })
6182 (if (!tree_expr_maybe_nan_p (@0) && !tree_expr_maybe_nan_p (@1))
6183 { constant_boolean_node (true, type); })))
6185 /* bool_var != 0 becomes bool_var. */
6186 (simplify
6187 (ne @0 integer_zerop)
6188 (if (TREE_CODE (TREE_TYPE (@0)) == BOOLEAN_TYPE
6189 && types_match (type, TREE_TYPE (@0)))
6190 (non_lvalue @0)))
6191 /* bool_var == 1 becomes bool_var. */
6192 (simplify
6193 (eq @0 integer_onep)
6194 (if (TREE_CODE (TREE_TYPE (@0)) == BOOLEAN_TYPE
6195 && types_match (type, TREE_TYPE (@0)))
6196 (non_lvalue @0)))
6197 /* Do not handle
6198 bool_var == 0 becomes !bool_var or
6199 bool_var != 1 becomes !bool_var
6200 here because that only is good in assignment context as long
6201 as we require a tcc_comparison in GIMPLE_CONDs where we'd
6202 replace if (x == 0) with tem = ~x; if (tem != 0) which is
6203 clearly less optimal and which we'll transform again in forwprop. */
6205 /* Transform comparisons of the form (X & Y) CMP 0 to X CMP2 Z
6206 where ~Y + 1 == pow2 and Z = ~Y. */
6207 (for cst (VECTOR_CST INTEGER_CST)
6208 (for cmp (eq ne)
6209 icmp (le gt)
6210 (simplify
6211 (cmp (bit_and:c@2 @0 cst@1) integer_zerop)
6212 (with { tree csts = bitmask_inv_cst_vector_p (@1); }
6213 (if (csts && (VECTOR_TYPE_P (TREE_TYPE (@1)) || single_use (@2)))
6214 (with { auto optab = VECTOR_TYPE_P (TREE_TYPE (@1))
6215 ? optab_vector : optab_default;
6216 tree utype = unsigned_type_for (TREE_TYPE (@1)); }
6217 (if (target_supports_op_p (utype, icmp, optab)
6218 || (optimize_vectors_before_lowering_p ()
6219 && (!target_supports_op_p (type, cmp, optab)
6220 || !target_supports_op_p (type, BIT_AND_EXPR, optab))))
6221 (if (TYPE_UNSIGNED (TREE_TYPE (@1)))
6222 (icmp @0 { csts; })
6223 (icmp (view_convert:utype @0) { csts; })))))))))
6225 /* When one argument is a constant, overflow detection can be simplified.
6226 Currently restricted to single use so as not to interfere too much with
6227 ADD_OVERFLOW detection in tree-ssa-math-opts.cc.
6228 CONVERT?(CONVERT?(A) + CST) CMP A -> A CMP' CST' */
6229 (for cmp (lt le ge gt)
6230 out (gt gt le le)
6231 (simplify
6232 (cmp:c (convert?@3 (plus@2 (convert?@4 @0) INTEGER_CST@1)) @0)
6233 (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@2))
6234 && types_match (TREE_TYPE (@0), TREE_TYPE (@3))
6235 && tree_nop_conversion_p (TREE_TYPE (@4), TREE_TYPE (@0))
6236 && wi::to_wide (@1) != 0
6237 && single_use (@2))
6238 (with {
6239 unsigned int prec = TYPE_PRECISION (TREE_TYPE (@0));
6240 signop sign = TYPE_SIGN (TREE_TYPE (@0));
6241 }
6242 (out @0 { wide_int_to_tree (TREE_TYPE (@0),
6243 wi::max_value (prec, sign)
6244 - wi::to_wide (@1)); })))))
6246 /* To detect overflow in unsigned A - B, A < B is simpler than A - B > A.
6247 However, the detection logic for SUB_OVERFLOW in tree-ssa-math-opts.cc
6248 expects the long form, so we restrict the transformation for now. */
6249 (for cmp (gt le)
6250 (simplify
6251 (cmp:c (minus@2 @0 @1) @0)
6252 (if (single_use (@2)
6253 && ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
6254 && TYPE_UNSIGNED (TREE_TYPE (@0)))
6255 (cmp @1 @0))))
6257 /* Optimize A - B + -1 >= A into B >= A for unsigned comparisons. */
6258 (for cmp (ge lt)
6259 (simplify
6260 (cmp:c (plus (minus @0 @1) integer_minus_onep) @0)
6261 (if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (@0))
6262 && TYPE_UNSIGNED (TREE_TYPE (@0)))
6263 (cmp @1 @0))))
6265 /* Testing for overflow is unnecessary if we already know the result. */
6266 /* A - B > A */
6267 (for cmp (gt le)
6268 out (ne eq)
6269 (simplify
6270 (cmp:c (realpart (IFN_SUB_OVERFLOW@2 @0 @1)) @0)
6271 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
6272 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
6273 (out (imagpart @2) { build_zero_cst (TREE_TYPE (@0)); }))))
6274 /* A + B < A */
6275 (for cmp (lt ge)
6276 out (ne eq)
6277 (simplify
6278 (cmp:c (realpart (IFN_ADD_OVERFLOW:c@2 @0 @1)) @0)
6279 (if (TYPE_UNSIGNED (TREE_TYPE (@0))
6280 && types_match (TREE_TYPE (@0), TREE_TYPE (@1)))
6281 (out (imagpart @2) { build_zero_cst (TREE_TYPE (@0)); }))))
6283 /* For unsigned operands, -1 / B < A checks whether A * B would overflow.
6284 Simplify it to __builtin_mul_overflow (A, B, <unused>). */
6285 (for cmp (lt ge)
6286 out (ne eq)
6287 (simplify
6288 (cmp:c (trunc_div:s integer_all_onesp @1) @0)
6289 (if (TYPE_UNSIGNED (TREE_TYPE (@0)) && !VECTOR_TYPE_P (TREE_TYPE (@0)))
6290 (with { tree t = TREE_TYPE (@0), cpx = build_complex_type (t); }
6291 (out (imagpart (IFN_MUL_OVERFLOW:cpx @0 @1)) { build_zero_cst (t); })))))
6293 /* Similarly, for unsigned operands, (((type) A * B) >> prec) != 0 where type
6294 is at least twice as wide as type of A and B, simplify to
6295 __builtin_mul_overflow (A, B, <unused>). */
6296 (for cmp (eq ne)
6297 (simplify
6298 (cmp (rshift (mult:s (convert@3 @0) (convert @1)) INTEGER_CST@2)
6299 integer_zerop)
6300 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6301 && INTEGRAL_TYPE_P (TREE_TYPE (@3))
6302 && TYPE_UNSIGNED (TREE_TYPE (@0))
6303 && (TYPE_PRECISION (TREE_TYPE (@3))
6304 >= 2 * TYPE_PRECISION (TREE_TYPE (@0)))
6305 && tree_fits_uhwi_p (@2)
6306 && tree_to_uhwi (@2) == TYPE_PRECISION (TREE_TYPE (@0))
6307 && types_match (@0, @1)
6308 && type_has_mode_precision_p (TREE_TYPE (@0))
6309 && (optab_handler (umulv4_optab, TYPE_MODE (TREE_TYPE (@0)))
6310 != CODE_FOR_nothing))
6311 (with { tree t = TREE_TYPE (@0), cpx = build_complex_type (t); }
6312 (cmp (imagpart (IFN_MUL_OVERFLOW:cpx @0 @1)) { build_zero_cst (t); })))))
6314 /* Demote operands of IFN_{ADD,SUB,MUL}_OVERFLOW. */
6315 (for ovf (IFN_ADD_OVERFLOW IFN_SUB_OVERFLOW IFN_MUL_OVERFLOW)
6316 (simplify
6317 (ovf (convert@2 @0) @1)
6318 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6319 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
6320 && TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (TREE_TYPE (@0))
6321 && (!TYPE_UNSIGNED (TREE_TYPE (@2)) || TYPE_UNSIGNED (TREE_TYPE (@0))))
6322 (ovf @0 @1)))
6323 (simplify
6324 (ovf @1 (convert@2 @0))
6325 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6326 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
6327 && TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (TREE_TYPE (@0))
6328 && (!TYPE_UNSIGNED (TREE_TYPE (@2)) || TYPE_UNSIGNED (TREE_TYPE (@0))))
6329 (ovf @1 @0))))
6331 /* Optimize __builtin_mul_overflow_p (x, cst, (utype) 0) if all 3 types
6332 are unsigned to x > (umax / cst). Similarly for signed type, but
6333 in that case it needs to be outside of a range. */
6334 (simplify
6335 (imagpart (IFN_MUL_OVERFLOW:cs@2 @0 integer_nonzerop@1))
6336 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
6337 && TYPE_MAX_VALUE (TREE_TYPE (@0))
6338 && types_match (TREE_TYPE (@0), TREE_TYPE (TREE_TYPE (@2)))
6339 && int_fits_type_p (@1, TREE_TYPE (@0)))
6340 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
6341 (convert (gt @0 (trunc_div! { TYPE_MAX_VALUE (TREE_TYPE (@0)); } @1)))
6342 (if (TYPE_MIN_VALUE (TREE_TYPE (@0)))
6343 (if (integer_minus_onep (@1))
6344 (convert (eq @0 { TYPE_MIN_VALUE (TREE_TYPE (@0)); }))
6345 (with
6346 {
6347 tree div = fold_convert (TREE_TYPE (@0), @1);
6348 tree lo = int_const_binop (TRUNC_DIV_EXPR,
6349 TYPE_MIN_VALUE (TREE_TYPE (@0)), div);
6350 tree hi = int_const_binop (TRUNC_DIV_EXPR,
6351 TYPE_MAX_VALUE (TREE_TYPE (@0)), div);
6352 tree etype = range_check_type (TREE_TYPE (@0));
6353 if (etype)
6354 {
6355 if (wi::neg_p (wi::to_wide (div)))
6356 std::swap (lo, hi);
6357 lo = fold_convert (etype, lo);
6358 hi = fold_convert (etype, hi);
6359 hi = int_const_binop (MINUS_EXPR, hi, lo);
6360 }
6361 }
6362 (if (etype)
6363 (convert (gt (minus (convert:etype @0) { lo; }) { hi; })))))))))
6365 /* Simplification of math builtins. These rules must all be optimizations
6366 as well as IL simplifications. If there is a possibility that the new
6367 form could be a pessimization, the rule should go in the canonicalization
6368 section that follows this one.
6370 Rules can generally go in this section if they satisfy one of
6371 the following:
6373 - the rule describes an identity
6375 - the rule replaces calls with something as simple as addition or
6376 multiplication
6378 - the rule contains unary calls only and simplifies the surrounding
6379 arithmetic. (The idea here is to exclude non-unary calls in which
6380 one operand is constant and in which the call is known to be cheap
6381 when the operand has that value.) */
6383 (if (flag_unsafe_math_optimizations)
6384 /* Simplify sqrt(x) * sqrt(x) -> x. */
6385 (simplify
6386 (mult (SQRT_ALL@1 @0) @1)
6387 (if (!tree_expr_maybe_signaling_nan_p (@0))
6388 @0))
6390 (for op (plus minus)
6391 /* Simplify (A / C) +- (B / C) -> (A +- B) / C. */
6392 (simplify
6393 (op (rdiv @0 @1)
6394 (rdiv @2 @1))
6395 (rdiv (op @0 @2) @1)))
6397 (for cmp (lt le gt ge)
6398 neg_cmp (gt ge lt le)
6399 /* Simplify (x * C1) cmp C2 -> x cmp (C2 / C1), where C1 != 0. */
6400 (simplify
6401 (cmp (mult @0 REAL_CST@1) REAL_CST@2)
6402 (with
6403 { tree tem = const_binop (RDIV_EXPR, type, @2, @1); }
6404 (if (tem
6405 && !(REAL_VALUE_ISINF (TREE_REAL_CST (tem))
6406 || (real_zerop (tem) && !real_zerop (@1))))
6407 (switch
6408 (if (real_less (&dconst0, TREE_REAL_CST_PTR (@1)))
6409 (cmp @0 { tem; }))
6410 (if (real_less (TREE_REAL_CST_PTR (@1), &dconst0))
6411 (neg_cmp @0 { tem; })))))))
6413 /* Simplify sqrt(x) * sqrt(y) -> sqrt(x*y). */
6414 (for root (SQRT CBRT)
6415 (simplify
6416 (mult (root:s @0) (root:s @1))
6417 (root (mult @0 @1))))
6419 /* Simplify expN(x) * expN(y) -> expN(x+y). */
6420 (for exps (EXP EXP2 EXP10 POW10)
6421 (simplify
6422 (mult (exps:s @0) (exps:s @1))
6423 (exps (plus @0 @1))))
6425 /* Simplify a/root(b/c) into a*root(c/b). */
6426 (for root (SQRT CBRT)
6427 (simplify
6428 (rdiv @0 (root:s (rdiv:s @1 @2)))
6429 (mult @0 (root (rdiv @2 @1)))))
6431 /* Simplify x/expN(y) into x*expN(-y). */
6432 (for exps (EXP EXP2 EXP10 POW10)
6433 (simplify
6434 (rdiv @0 (exps:s @1))
6435 (mult @0 (exps (negate @1)))))
6437 (for logs (LOG LOG2 LOG10 LOG10)
6438 exps (EXP EXP2 EXP10 POW10)
6439 /* logN(expN(x)) -> x. */
6440 (simplify
6441 (logs (exps @0))
6442 @0)
6443 /* expN(logN(x)) -> x. */
6444 (simplify
6445 (exps (logs @0))
6446 @0))
6448 /* Optimize logN(func()) for various exponential functions. We
6449 want to determine the value "x" and the power "exponent" in
6450 order to transform logN(x**exponent) into exponent*logN(x). */
6451 (for logs (LOG LOG LOG LOG2 LOG2 LOG2 LOG10 LOG10)
6452 exps (EXP2 EXP10 POW10 EXP EXP10 POW10 EXP EXP2)
6453 (simplify
6454 (logs (exps @0))
6455 (if (SCALAR_FLOAT_TYPE_P (type))
6456 (with {
6457 tree x;
6458 switch (exps)
6459 {
6460 CASE_CFN_EXP:
6461 /* Prepare to do logN(exp(exponent)) -> exponent*logN(e). */
6462 x = build_real_truncate (type, dconst_e ());
6463 break;
6464 CASE_CFN_EXP2:
6465 /* Prepare to do logN(exp2(exponent)) -> exponent*logN(2). */
6466 x = build_real (type, dconst2);
6467 break;
6468 CASE_CFN_EXP10:
6469 CASE_CFN_POW10:
6470 /* Prepare to do logN(exp10(exponent)) -> exponent*logN(10). */
6471 {
6472 REAL_VALUE_TYPE dconst10;
6473 real_from_integer (&dconst10, VOIDmode, 10, SIGNED);
6474 x = build_real (type, dconst10);
6475 }
6476 break;
6477 default:
6478 gcc_unreachable ();
6479 }
6480 }
6481 (mult (logs { x; }) @0)))))
6483 (for logs (LOG LOG
6484 LOG2 LOG2
6485 LOG10 LOG10)
6486 exps (SQRT CBRT)
6487 (simplify
6488 (logs (exps @0))
6489 (if (SCALAR_FLOAT_TYPE_P (type))
6490 (with {
6491 tree x;
6492 switch (exps)
6493 {
6494 CASE_CFN_SQRT:
6495 /* Prepare to do logN(sqrt(x)) -> 0.5*logN(x). */
6496 x = build_real (type, dconsthalf);
6497 break;
6498 CASE_CFN_CBRT:
6499 /* Prepare to do logN(cbrt(x)) -> (1/3)*logN(x). */
6500 x = build_real_truncate (type, dconst_third ());
6501 break;
6502 default:
6503 gcc_unreachable ();
6504 }
6505 }
6506 (mult { x; } (logs @0))))))
6508 /* logN(pow(x,exponent)) -> exponent*logN(x). */
6509 (for logs (LOG LOG2 LOG10)
6510 pows (POW)
6511 (simplify
6512 (logs (pows @0 @1))
6513 (mult @1 (logs @0))))
6515 /* pow(C,x) -> exp(log(C)*x) if C > 0,
6516 or if C is a positive power of 2,
6517 pow(C,x) -> exp2(log2(C)*x). */
6518 #if GIMPLE
6519 (for pows (POW)
6520 exps (EXP)
6521 logs (LOG)
6522 exp2s (EXP2)
6523 log2s (LOG2)
6524 (simplify
6525 (pows REAL_CST@0 @1)
6526 (if (real_compare (GT_EXPR, TREE_REAL_CST_PTR (@0), &dconst0)
6527 && real_isfinite (TREE_REAL_CST_PTR (@0))
6528 /* As libmvec doesn't have a vectorized exp2, defer optimizing
6529 the use_exp2 case until after vectorization. It seems actually
6530 beneficial for all constants to postpone this until later,
6531 because exp(log(C)*x), while faster, will have worse precision
6532 and if x folds into a constant too, that is unnecessary
6533 pessimization. */
6534 && canonicalize_math_after_vectorization_p ())
6535 (with {
6536 const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (@0);
6537 bool use_exp2 = false;
6538 if (targetm.libc_has_function (function_c99_misc, TREE_TYPE (@0))
6539 && value->cl == rvc_normal)
6540 {
6541 REAL_VALUE_TYPE frac_rvt = *value;
6542 SET_REAL_EXP (&frac_rvt, 1);
6543 if (real_equal (&frac_rvt, &dconst1))
6544 use_exp2 = true;
6545 }
6546 }
6547 (if (!use_exp2)
6548 (if (optimize_pow_to_exp (@0, @1))
6549 (exps (mult (logs @0) @1)))
6550 (exp2s (mult (log2s @0) @1)))))))
6551 #endif
6553 /* pow(C,x)*expN(y) -> expN(logN(C)*x+y) if C > 0. */
6554 (for pows (POW)
6555 exps (EXP EXP2 EXP10 POW10)
6556 logs (LOG LOG2 LOG10 LOG10)
6557 (simplify
6558 (mult:c (pows:s REAL_CST@0 @1) (exps:s @2))
6559 (if (real_compare (GT_EXPR, TREE_REAL_CST_PTR (@0), &dconst0)
6560 && real_isfinite (TREE_REAL_CST_PTR (@0)))
6561 (exps (plus (mult (logs @0) @1) @2)))))
6563 (for sqrts (SQRT)
6564 cbrts (CBRT)
6565 pows (POW)
6566 exps (EXP EXP2 EXP10 POW10)
6567 /* sqrt(expN(x)) -> expN(x*0.5). */
6568 (simplify
6569 (sqrts (exps @0))
6570 (exps (mult @0 { build_real (type, dconsthalf); })))
6571 /* cbrt(expN(x)) -> expN(x/3). */
6572 (simplify
6573 (cbrts (exps @0))
6574 (exps (mult @0 { build_real_truncate (type, dconst_third ()); })))
6575 /* pow(expN(x), y) -> expN(x*y). */
6576 (simplify
6577 (pows (exps @0) @1)
6578 (exps (mult @0 @1))))
6580 /* tan(atan(x)) -> x. */
6581 (for tans (TAN)
6582 atans (ATAN)
6583 (simplify
6584 (tans (atans @0))
6585 @0)))
6587 /* Simplify sin(atan(x)) -> x / sqrt(x*x + 1). */
6588 (for sins (SIN)
6589 atans (ATAN)
6590 sqrts (SQRT)
6591 copysigns (COPYSIGN)
6592 (simplify
6593 (sins (atans:s @0))
6594 (with
6595 {
6596 REAL_VALUE_TYPE r_cst;
6597 build_sinatan_real (&r_cst, type);
6598 tree t_cst = build_real (type, r_cst);
6599 tree t_one = build_one_cst (type);
6600 }
6601 (if (SCALAR_FLOAT_TYPE_P (type))
6602 (cond (lt (abs @0) { t_cst; })
6603 (rdiv @0 (sqrts (plus (mult @0 @0) { t_one; })))
6604 (copysigns { t_one; } @0))))))
6606 /* Simplify cos(atan(x)) -> 1 / sqrt(x*x + 1). */
6607 (for coss (COS)
6608 atans (ATAN)
6609 sqrts (SQRT)
6610 copysigns (COPYSIGN)
6611 (simplify
6612 (coss (atans:s @0))
6613 (with
6614 {
6615 REAL_VALUE_TYPE r_cst;
6616 build_sinatan_real (&r_cst, type);
6617 tree t_cst = build_real (type, r_cst);
6618 tree t_one = build_one_cst (type);
6619 tree t_zero = build_zero_cst (type);
6620 }
6621 (if (SCALAR_FLOAT_TYPE_P (type))
6622 (cond (lt (abs @0) { t_cst; })
6623 (rdiv { t_one; } (sqrts (plus (mult @0 @0) { t_one; })))
6624 (copysigns { t_zero; } @0))))))
6626 (if (!flag_errno_math)
6627 /* Simplify sinh(atanh(x)) -> x / sqrt((1 - x)*(1 + x)). */
6628 (for sinhs (SINH)
6629 atanhs (ATANH)
6630 sqrts (SQRT)
6631 (simplify
6632 (sinhs (atanhs:s @0))
6633 (with { tree t_one = build_one_cst (type); }
6634 (rdiv @0 (sqrts (mult (minus { t_one; } @0) (plus { t_one; } @0)))))))
6636 /* Simplify cosh(atanh(x)) -> 1 / sqrt((1 - x)*(1 + x)) */
6637 (for coshs (COSH)
6638 atanhs (ATANH)
6639 sqrts (SQRT)
6640 (simplify
6641 (coshs (atanhs:s @0))
6642 (with { tree t_one = build_one_cst (type); }
6643 (rdiv { t_one; } (sqrts (mult (minus { t_one; } @0) (plus { t_one; } @0))))))))
6645 /* cabs(x+0i) or cabs(0+xi) -> abs(x). */
6646 (simplify
6647 (CABS (complex:C @0 real_zerop@1))
6648 (abs @0))
6650 /* trunc(trunc(x)) -> trunc(x), etc. */
6651 (for fns (TRUNC_ALL FLOOR_ALL CEIL_ALL ROUND_ALL NEARBYINT_ALL RINT_ALL)
6652 (simplify
6653 (fns (fns @0))
6654 (fns @0)))
6655 /* f(x) -> x if x is integer valued and f does nothing for such values. */
6656 (for fns (TRUNC_ALL FLOOR_ALL CEIL_ALL ROUND_ALL NEARBYINT_ALL RINT_ALL)
6657 (simplify
6658 (fns integer_valued_real_p@0)
6659 @0))
6661 /* hypot(x,0) and hypot(0,x) -> abs(x). */
6662 (simplify
6663 (HYPOT:c @0 real_zerop@1)
6664 (abs @0))
6666 /* pow(1,x) -> 1. */
6667 (simplify
6668 (POW real_onep@0 @1)
6669 @0)
6671 (simplify
6672 /* copysign(x,x) -> x. */
6673 (COPYSIGN_ALL @0 @0)
6674 @0)
6676 (simplify
6677 /* copysign(x,-x) -> -x. */
6678 (COPYSIGN_ALL @0 (negate@1 @0))
6679 @1)
6681 (simplify
6682 /* copysign(x,y) -> fabs(x) if y is nonnegative. */
6683 (COPYSIGN_ALL @0 tree_expr_nonnegative_p@1)
6684 (abs @0))
6686 (for scale (LDEXP SCALBN SCALBLN)
6687 /* ldexp(0, x) -> 0. */
6688 (simplify
6689 (scale real_zerop@0 @1)
6690 @0)
6691 /* ldexp(x, 0) -> x. */
6692 (simplify
6693 (scale @0 integer_zerop@1)
6694 @0)
6695 /* ldexp(x, y) -> x if x is +-Inf or NaN. */
6696 (simplify
6697 (scale REAL_CST@0 @1)
6698 (if (!real_isfinite (TREE_REAL_CST_PTR (@0)))
6699 @0)))
6701 /* Canonicalization of sequences of math builtins. These rules represent
6702 IL simplifications but are not necessarily optimizations.
6704 The sincos pass is responsible for picking "optimal" implementations
6705 of math builtins, which may be more complicated and can sometimes go
6706 the other way, e.g. converting pow into a sequence of sqrts.
6707 We only want to do these canonicalizations before the pass has run. */
6709 (if (flag_unsafe_math_optimizations && canonicalize_math_p ())
6710 /* Simplify tan(x) * cos(x) -> sin(x). */
6711 (simplify
6712 (mult:c (TAN:s @0) (COS:s @0))
6713 (SIN @0))
6715 /* Simplify x * pow(x,c) -> pow(x,c+1). */
6716 (simplify
6717 (mult:c @0 (POW:s @0 REAL_CST@1))
6718 (if (!TREE_OVERFLOW (@1))
6719 (POW @0 (plus @1 { build_one_cst (type); }))))
6721 /* Simplify sin(x) / cos(x) -> tan(x). */
6722 (simplify
6723 (rdiv (SIN:s @0) (COS:s @0))
6724 (TAN @0))
6726 /* Simplify sinh(x) / cosh(x) -> tanh(x). */
6727 (simplify
6728 (rdiv (SINH:s @0) (COSH:s @0))
6729 (TANH @0))
6731 /* Simplify tanh (x) / sinh (x) -> 1.0 / cosh (x). */
6732 (simplify
6733 (rdiv (TANH:s @0) (SINH:s @0))
6734 (rdiv {build_one_cst (type);} (COSH @0)))
6736 /* Simplify cos(x) / sin(x) -> 1 / tan(x). */
6737 (simplify
6738 (rdiv (COS:s @0) (SIN:s @0))
6739 (rdiv { build_one_cst (type); } (TAN @0)))
6741 /* Simplify sin(x) / tan(x) -> cos(x). */
6742 (simplify
6743 (rdiv (SIN:s @0) (TAN:s @0))
6744 (if (! HONOR_NANS (@0)
6745 && ! HONOR_INFINITIES (@0))
6746 (COS @0)))
6748 /* Simplify tan(x) / sin(x) -> 1.0 / cos(x). */
6749 (simplify
6750 (rdiv (TAN:s @0) (SIN:s @0))
6751 (if (! HONOR_NANS (@0)
6752 && ! HONOR_INFINITIES (@0))
6753 (rdiv { build_one_cst (type); } (COS @0))))
6755 /* Simplify pow(x,y) * pow(x,z) -> pow(x,y+z). */
6756 (simplify
6757 (mult (POW:s @0 @1) (POW:s @0 @2))
6758 (POW @0 (plus @1 @2)))
6760 /* Simplify pow(x,y) * pow(z,y) -> pow(x*z,y). */
6761 (simplify
6762 (mult (POW:s @0 @1) (POW:s @2 @1))
6763 (POW (mult @0 @2) @1))
6765 /* Simplify powi(x,y) * powi(z,y) -> powi(x*z,y). */
6766 (simplify
6767 (mult (POWI:s @0 @1) (POWI:s @2 @1))
6768 (POWI (mult @0 @2) @1))
6770 /* Simplify pow(x,c) / x -> pow(x,c-1). */
6771 (simplify
6772 (rdiv (POW:s @0 REAL_CST@1) @0)
6773 (if (!TREE_OVERFLOW (@1))
6774 (POW @0 (minus @1 { build_one_cst (type); }))))
6776 /* Simplify x / pow (y,z) -> x * pow(y,-z). */
6777 (simplify
6778 (rdiv @0 (POW:s @1 @2))
6779 (mult @0 (POW @1 (negate @2))))
6781 (for sqrts (SQRT)
6782 cbrts (CBRT)
6783 pows (POW)
6784 /* sqrt(sqrt(x)) -> pow(x,1/4). */
6785 (simplify
6786 (sqrts (sqrts @0))
6787 (pows @0 { build_real (type, dconst_quarter ()); }))
6788 /* sqrt(cbrt(x)) -> pow(x,1/6). */
6789 (simplify
6790 (sqrts (cbrts @0))
6791 (pows @0 { build_real_truncate (type, dconst_sixth ()); }))
6792 /* cbrt(sqrt(x)) -> pow(x,1/6). */
6793 (simplify
6794 (cbrts (sqrts @0))
6795 (pows @0 { build_real_truncate (type, dconst_sixth ()); }))
6796 /* cbrt(cbrt(x)) -> pow(x,1/9), iff x is nonnegative. */
6797 (simplify
6798 (cbrts (cbrts tree_expr_nonnegative_p@0))
6799 (pows @0 { build_real_truncate (type, dconst_ninth ()); }))
6800 /* sqrt(pow(x,y)) -> pow(|x|,y*0.5). */
6801 (simplify
6802 (sqrts (pows @0 @1))
6803 (pows (abs @0) (mult @1 { build_real (type, dconsthalf); })))
6804 /* cbrt(pow(x,y)) -> pow(x,y/3), iff x is nonnegative. */
6805 (simplify
6806 (cbrts (pows tree_expr_nonnegative_p@0 @1))
6807 (pows @0 (mult @1 { build_real_truncate (type, dconst_third ()); })))
6808 /* pow(sqrt(x),y) -> pow(x,y*0.5). */
6809 (simplify
6810 (pows (sqrts @0) @1)
6811 (pows @0 (mult @1 { build_real (type, dconsthalf); })))
6812 /* pow(cbrt(x),y) -> pow(x,y/3) iff x is nonnegative. */
6813 (simplify
6814 (pows (cbrts tree_expr_nonnegative_p@0) @1)
6815 (pows @0 (mult @1 { build_real_truncate (type, dconst_third ()); })))
6816 /* pow(pow(x,y),z) -> pow(x,y*z) iff x is nonnegative. */
6817 (simplify
6818 (pows (pows tree_expr_nonnegative_p@0 @1) @2)
6819 (pows @0 (mult @1 @2))))
6821 /* cabs(x+xi) -> fabs(x)*sqrt(2). */
6822 (simplify
6823 (CABS (complex @0 @0))
6824 (mult (abs @0) { build_real_truncate (type, dconst_sqrt2 ()); }))
6826 /* hypot(x,x) -> fabs(x)*sqrt(2). */
6827 (simplify
6828 (HYPOT @0 @0)
6829 (mult (abs @0) { build_real_truncate (type, dconst_sqrt2 ()); }))
6831 /* cexp(x+yi) -> exp(x)*cexpi(y). */
6832 (for cexps (CEXP)
6833 exps (EXP)
6834 cexpis (CEXPI)
6835 (simplify
6836 (cexps compositional_complex@0)
6837 (if (targetm.libc_has_function (function_c99_math_complex, TREE_TYPE (@0)))
6838 (complex
6839 (mult (exps@1 (realpart @0)) (realpart (cexpis:type@2 (imagpart @0))))
6840 (mult @1 (imagpart @2)))))))
6842 (if (canonicalize_math_p ())
6843 /* floor(x) -> trunc(x) if x is nonnegative. */
6844 (for floors (FLOOR_ALL)
6845 truncs (TRUNC_ALL)
6846 (simplify
6847 (floors tree_expr_nonnegative_p@0)
6848 (truncs @0))))
6850 (match double_value_p
6851 @0
6852 (if (TYPE_MAIN_VARIANT (TREE_TYPE (@0)) == double_type_node)))
6853 (for froms (BUILT_IN_TRUNCL
6854 BUILT_IN_FLOORL
6855 BUILT_IN_CEILL
6856 BUILT_IN_ROUNDL
6857 BUILT_IN_NEARBYINTL
6858 BUILT_IN_RINTL)
6859 tos (BUILT_IN_TRUNC
6860 BUILT_IN_FLOOR
6861 BUILT_IN_CEIL
6862 BUILT_IN_ROUND
6863 BUILT_IN_NEARBYINT
6864 BUILT_IN_RINT)
6865 /* truncl(extend(x)) -> extend(trunc(x)), etc., if x is a double. */
6866 (if (optimize && canonicalize_math_p ())
6867 (simplify
6868 (froms (convert double_value_p@0))
6869 (convert (tos @0)))))
6871 (match float_value_p
6872 @0
6873 (if (TYPE_MAIN_VARIANT (TREE_TYPE (@0)) == float_type_node)))
6874 (for froms (BUILT_IN_TRUNCL BUILT_IN_TRUNC
6875 BUILT_IN_FLOORL BUILT_IN_FLOOR
6876 BUILT_IN_CEILL BUILT_IN_CEIL
6877 BUILT_IN_ROUNDL BUILT_IN_ROUND
6878 BUILT_IN_NEARBYINTL BUILT_IN_NEARBYINT
6879 BUILT_IN_RINTL BUILT_IN_RINT)
6880 tos (BUILT_IN_TRUNCF BUILT_IN_TRUNCF
6881 BUILT_IN_FLOORF BUILT_IN_FLOORF
6882 BUILT_IN_CEILF BUILT_IN_CEILF
6883 BUILT_IN_ROUNDF BUILT_IN_ROUNDF
6884 BUILT_IN_NEARBYINTF BUILT_IN_NEARBYINTF
6885 BUILT_IN_RINTF BUILT_IN_RINTF)
6886 /* truncl(extend(x)) and trunc(extend(x)) -> extend(truncf(x)), etc.,
6887 if x is a float. */
6888 (if (optimize && canonicalize_math_p ()
6889 && targetm.libc_has_function (function_c99_misc, NULL_TREE))
6890 (simplify
6891 (froms (convert float_value_p@0))
6892 (convert (tos @0)))))
6894 #if GIMPLE
6895 (match float16_value_p
6896 @0
6897 (if (TYPE_MAIN_VARIANT (TREE_TYPE (@0)) == float16_type_node)))
6898 (for froms (BUILT_IN_TRUNCL BUILT_IN_TRUNC BUILT_IN_TRUNCF
6899 BUILT_IN_FLOORL BUILT_IN_FLOOR BUILT_IN_FLOORF
6900 BUILT_IN_CEILL BUILT_IN_CEIL BUILT_IN_CEILF
6901 BUILT_IN_ROUNDEVENL BUILT_IN_ROUNDEVEN BUILT_IN_ROUNDEVENF
6902 BUILT_IN_ROUNDL BUILT_IN_ROUND BUILT_IN_ROUNDF
6903 BUILT_IN_NEARBYINTL BUILT_IN_NEARBYINT BUILT_IN_NEARBYINTF
6904 BUILT_IN_RINTL BUILT_IN_RINT BUILT_IN_RINTF
6905 BUILT_IN_SQRTL BUILT_IN_SQRT BUILT_IN_SQRTF)
6906 tos (IFN_TRUNC IFN_TRUNC IFN_TRUNC
6907 IFN_FLOOR IFN_FLOOR IFN_FLOOR
6908 IFN_CEIL IFN_CEIL IFN_CEIL
6909 IFN_ROUNDEVEN IFN_ROUNDEVEN IFN_ROUNDEVEN
6910 IFN_ROUND IFN_ROUND IFN_ROUND
6911 IFN_NEARBYINT IFN_NEARBYINT IFN_NEARBYINT
6912 IFN_RINT IFN_RINT IFN_RINT
6913 IFN_SQRT IFN_SQRT IFN_SQRT)
6914 /* (_Float16) round ((doube) x) -> __built_in_roundf16 (x), etc.,
6915 if x is a _Float16. */
6916 (simplify
6917 (convert (froms (convert float16_value_p@0)))
6918 (if (optimize
6919 && types_match (type, TREE_TYPE (@0))
6920 && direct_internal_fn_supported_p (as_internal_fn (tos),
6921 type, OPTIMIZE_FOR_BOTH))
6922 (tos @0))))
6924 /* Simplify (trunc)copysign ((extend)x, (extend)y) to copysignf (x, y),
6925 x,y is float value, similar for _Float16/double. */
6926 (for copysigns (COPYSIGN_ALL)
6927 (simplify
6928 (convert (copysigns (convert@2 @0) (convert @1)))
6929 (if (optimize
6930 && !HONOR_SNANS (@2)
6931 && types_match (type, TREE_TYPE (@0))
6932 && types_match (type, TREE_TYPE (@1))
6933 && TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (@2))
6934 && direct_internal_fn_supported_p (IFN_COPYSIGN,
6935 type, OPTIMIZE_FOR_BOTH))
6936 (IFN_COPYSIGN @0 @1))))
6938 (for froms (BUILT_IN_FMAF BUILT_IN_FMA BUILT_IN_FMAL)
6939 tos (IFN_FMA IFN_FMA IFN_FMA)
6940 (simplify
6941 (convert (froms (convert@3 @0) (convert @1) (convert @2)))
6942 (if (flag_unsafe_math_optimizations
6943 && optimize
6944 && FLOAT_TYPE_P (type)
6945 && FLOAT_TYPE_P (TREE_TYPE (@3))
6946 && types_match (type, TREE_TYPE (@0))
6947 && types_match (type, TREE_TYPE (@1))
6948 && types_match (type, TREE_TYPE (@2))
6949 && TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (@3))
6950 && direct_internal_fn_supported_p (as_internal_fn (tos),
6951 type, OPTIMIZE_FOR_BOTH))
6952 (tos @0 @1 @2))))
6954 (for maxmin (max min)
6955 (simplify
6956 (convert (maxmin (convert@2 @0) (convert @1)))
6957 (if (optimize
6958 && FLOAT_TYPE_P (type)
6959 && FLOAT_TYPE_P (TREE_TYPE (@2))
6960 && types_match (type, TREE_TYPE (@0))
6961 && types_match (type, TREE_TYPE (@1))
6962 && element_precision (type) < element_precision (TREE_TYPE (@2)))
6963 (maxmin @0 @1))))
6964 #endif
6966 (for froms (XFLOORL XCEILL XROUNDL XRINTL)
6967 tos (XFLOOR XCEIL XROUND XRINT)
6968 /* llfloorl(extend(x)) -> llfloor(x), etc., if x is a double. */
6969 (if (optimize && canonicalize_math_p ())
6970 (simplify
6971 (froms (convert double_value_p@0))
6972 (tos @0))))
6974 (for froms (XFLOORL XCEILL XROUNDL XRINTL
6975 XFLOOR XCEIL XROUND XRINT)
6976 tos (XFLOORF XCEILF XROUNDF XRINTF)
6977 /* llfloorl(extend(x)) and llfloor(extend(x)) -> llfloorf(x), etc.,
6978 if x is a float. */
6979 (if (optimize && canonicalize_math_p ())
6980 (simplify
6981 (froms (convert float_value_p@0))
6982 (tos @0))))
6984 (if (canonicalize_math_p ())
6985 /* xfloor(x) -> fix_trunc(x) if x is nonnegative. */
6986 (for floors (IFLOOR LFLOOR LLFLOOR)
6987 (simplify
6988 (floors tree_expr_nonnegative_p@0)
6989 (fix_trunc @0))))
6991 (if (canonicalize_math_p ())
6992 /* xfloor(x) -> fix_trunc(x), etc., if x is integer valued. */
6993 (for fns (IFLOOR LFLOOR LLFLOOR
6994 ICEIL LCEIL LLCEIL
6995 IROUND LROUND LLROUND)
6996 (simplify
6997 (fns integer_valued_real_p@0)
6998 (fix_trunc @0)))
6999 (if (!flag_errno_math)
7000 /* xrint(x) -> fix_trunc(x), etc., if x is integer valued. */
7001 (for rints (IRINT LRINT LLRINT)
7002 (simplify
7003 (rints integer_valued_real_p@0)
7004 (fix_trunc @0)))))
7006 (if (canonicalize_math_p ())
7007 (for ifn (IFLOOR ICEIL IROUND IRINT)
7008 lfn (LFLOOR LCEIL LROUND LRINT)
7009 llfn (LLFLOOR LLCEIL LLROUND LLRINT)
7010 /* Canonicalize iround (x) to lround (x) on ILP32 targets where
7011 sizeof (int) == sizeof (long). */
7012 (if (TYPE_PRECISION (integer_type_node)
7013 == TYPE_PRECISION (long_integer_type_node))
7014 (simplify
7015 (ifn @0)
7016 (lfn:long_integer_type_node @0)))
7017 /* Canonicalize llround (x) to lround (x) on LP64 targets where
7018 sizeof (long long) == sizeof (long). */
7019 (if (TYPE_PRECISION (long_long_integer_type_node)
7020 == TYPE_PRECISION (long_integer_type_node))
7021 (simplify
7022 (llfn @0)
7023 (lfn:long_integer_type_node @0)))))
7025 /* cproj(x) -> x if we're ignoring infinities. */
7026 (simplify
7027 (CPROJ @0)
7028 (if (!HONOR_INFINITIES (type))
7029 @0))
7031 /* If the real part is inf and the imag part is known to be
7032 nonnegative, return (inf + 0i). */
7033 (simplify
7034 (CPROJ (complex REAL_CST@0 tree_expr_nonnegative_p@1))
7035 (if (real_isinf (TREE_REAL_CST_PTR (@0)))
7036 { build_complex_inf (type, false); }))
7038 /* If the imag part is inf, return (inf+I*copysign(0,imag)). */
7039 (simplify
7040 (CPROJ (complex @0 REAL_CST@1))
7041 (if (real_isinf (TREE_REAL_CST_PTR (@1)))
7042 { build_complex_inf (type, TREE_REAL_CST_PTR (@1)->sign); }))
7044 (for pows (POW)
7045 sqrts (SQRT)
7046 cbrts (CBRT)
7047 (simplify
7048 (pows @0 REAL_CST@1)
7049 (with {
7050 const REAL_VALUE_TYPE *value = TREE_REAL_CST_PTR (@1);
7051 REAL_VALUE_TYPE tmp;
7052 }
7053 (switch
7054 /* pow(x,0) -> 1. */
7055 (if (real_equal (value, &dconst0))
7056 { build_real (type, dconst1); })
7057 /* pow(x,1) -> x. */
7058 (if (real_equal (value, &dconst1))
7059 @0)
7060 /* pow(x,-1) -> 1/x. */
7061 (if (real_equal (value, &dconstm1))
7062 (rdiv { build_real (type, dconst1); } @0))
7063 /* pow(x,0.5) -> sqrt(x). */
7064 (if (flag_unsafe_math_optimizations
7065 && canonicalize_math_p ()
7066 && real_equal (value, &dconsthalf))
7067 (sqrts @0))
7068 /* pow(x,1/3) -> cbrt(x). */
7069 (if (flag_unsafe_math_optimizations
7070 && canonicalize_math_p ()
7071 && (tmp = real_value_truncate (TYPE_MODE (type), dconst_third ()),
7072 real_equal (value, &tmp)))
7073 (cbrts @0))))))
7075 /* powi(1,x) -> 1. */
7076 (simplify
7077 (POWI real_onep@0 @1)
7078 @0)
7080 (simplify
7081 (POWI @0 INTEGER_CST@1)
7082 (switch
7083 /* powi(x,0) -> 1. */
7084 (if (wi::to_wide (@1) == 0)
7085 { build_real (type, dconst1); })
7086 /* powi(x,1) -> x. */
7087 (if (wi::to_wide (@1) == 1)
7088 @0)
7089 /* powi(x,-1) -> 1/x. */
7090 (if (wi::to_wide (@1) == -1)
7091 (rdiv { build_real (type, dconst1); } @0))))
7093 /* Narrowing of arithmetic and logical operations.
7095 These are conceptually similar to the transformations performed for
7096 the C/C++ front-ends by shorten_binary_op and shorten_compare. Long
7097 term we want to move all that code out of the front-ends into here. */
7099 /* Convert (outertype)((innertype0)a+(innertype1)b)
7100 into ((newtype)a+(newtype)b) where newtype
7101 is the widest mode from all of these. */
7102 (for op (plus minus mult rdiv)
7103 (simplify
7104 (convert (op:s@0 (convert1?@3 @1) (convert2?@4 @2)))
7105 /* If we have a narrowing conversion of an arithmetic operation where
7106 both operands are widening conversions from the same type as the outer
7107 narrowing conversion. Then convert the innermost operands to a
7108 suitable unsigned type (to avoid introducing undefined behavior),
7109 perform the operation and convert the result to the desired type. */
7110 (if (INTEGRAL_TYPE_P (type)
7111 && op != MULT_EXPR
7112 && op != RDIV_EXPR
7113 /* We check for type compatibility between @0 and @1 below,
7114 so there's no need to check that @2/@4 are integral types. */
7115 && INTEGRAL_TYPE_P (TREE_TYPE (@1))
7116 && INTEGRAL_TYPE_P (TREE_TYPE (@3))
7117 /* The precision of the type of each operand must match the
7118 precision of the mode of each operand, similarly for the
7119 result. */
7120 && type_has_mode_precision_p (TREE_TYPE (@1))
7121 && type_has_mode_precision_p (TREE_TYPE (@2))
7122 && type_has_mode_precision_p (type)
7123 /* The inner conversion must be a widening conversion. */
7124 && TYPE_PRECISION (TREE_TYPE (@3)) > TYPE_PRECISION (TREE_TYPE (@1))
7125 && types_match (@1, type)
7126 && (types_match (@1, @2)
7127 /* Or the second operand is const integer or converted const
7128 integer from valueize. */
7129 || poly_int_tree_p (@4)))
7130 (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@1)))
7131 (op @1 (convert @2))
7132 (with { tree utype = unsigned_type_for (TREE_TYPE (@1)); }
7133 (convert (op (convert:utype @1)
7134 (convert:utype @2)))))
7135 (if (FLOAT_TYPE_P (type)
7136 && DECIMAL_FLOAT_TYPE_P (TREE_TYPE (@0))
7137 == DECIMAL_FLOAT_TYPE_P (type))
7138 (with { tree arg0 = strip_float_extensions (@1);
7139 tree arg1 = strip_float_extensions (@2);
7140 tree itype = TREE_TYPE (@0);
7141 tree ty1 = TREE_TYPE (arg0);
7142 tree ty2 = TREE_TYPE (arg1);
7143 enum tree_code code = TREE_CODE (itype); }
7144 (if (FLOAT_TYPE_P (ty1)
7145 && FLOAT_TYPE_P (ty2))
7146 (with { tree newtype = type;
7147 if (TYPE_MODE (ty1) == SDmode
7148 || TYPE_MODE (ty2) == SDmode
7149 || TYPE_MODE (type) == SDmode)
7150 newtype = dfloat32_type_node;
7151 if (TYPE_MODE (ty1) == DDmode
7152 || TYPE_MODE (ty2) == DDmode
7153 || TYPE_MODE (type) == DDmode)
7154 newtype = dfloat64_type_node;
7155 if (TYPE_MODE (ty1) == TDmode
7156 || TYPE_MODE (ty2) == TDmode
7157 || TYPE_MODE (type) == TDmode)
7158 newtype = dfloat128_type_node; }
7159 (if ((newtype == dfloat32_type_node
7160 || newtype == dfloat64_type_node
7161 || newtype == dfloat128_type_node)
7162 && newtype == type
7163 && types_match (newtype, type))
7164 (op (convert:newtype @1) (convert:newtype @2))
7165 (with { if (TYPE_PRECISION (ty1) > TYPE_PRECISION (newtype))
7166 newtype = ty1;
7167 if (TYPE_PRECISION (ty2) > TYPE_PRECISION (newtype))
7168 newtype = ty2; }
7169 /* Sometimes this transformation is safe (cannot
7170 change results through affecting double rounding
7171 cases) and sometimes it is not. If NEWTYPE is
7172 wider than TYPE, e.g. (float)((long double)double
7173 + (long double)double) converted to
7174 (float)(double + double), the transformation is
7175 unsafe regardless of the details of the types
7176 involved; double rounding can arise if the result
7177 of NEWTYPE arithmetic is a NEWTYPE value half way
7178 between two representable TYPE values but the
7179 exact value is sufficiently different (in the
7180 right direction) for this difference to be
7181 visible in ITYPE arithmetic. If NEWTYPE is the
7182 same as TYPE, however, the transformation may be
7183 safe depending on the types involved: it is safe
7184 if the ITYPE has strictly more than twice as many
7185 mantissa bits as TYPE, can represent infinities
7186 and NaNs if the TYPE can, and has sufficient
7187 exponent range for the product or ratio of two
7188 values representable in the TYPE to be within the
7189 range of normal values of ITYPE. */
7190 (if (TYPE_PRECISION (newtype) < TYPE_PRECISION (itype)
7191 && (flag_unsafe_math_optimizations
7192 || (TYPE_PRECISION (newtype) == TYPE_PRECISION (type)
7193 && real_can_shorten_arithmetic (TYPE_MODE (itype),
7194 TYPE_MODE (type))
7195 && !excess_precision_type (newtype)))
7196 && !types_match (itype, newtype))
7197 (convert:type (op (convert:newtype @1)
7198 (convert:newtype @2)))
7199 )))) )
7200 ))
7201 )))
7203 /* This is another case of narrowing, specifically when there's an outer
7204 BIT_AND_EXPR which masks off bits outside the type of the innermost
7205 operands. Like the previous case we have to convert the operands
7206 to unsigned types to avoid introducing undefined behavior for the
7207 arithmetic operation. */
7208 (for op (minus plus)
7209 (simplify
7210 (bit_and (op:s (convert@2 @0) (convert@3 @1)) INTEGER_CST@4)
7211 (if (INTEGRAL_TYPE_P (type)
7212 /* We check for type compatibility between @0 and @1 below,
7213 so there's no need to check that @1/@3 are integral types. */
7214 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
7215 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
7216 /* The precision of the type of each operand must match the
7217 precision of the mode of each operand, similarly for the
7218 result. */
7219 && type_has_mode_precision_p (TREE_TYPE (@0))
7220 && type_has_mode_precision_p (TREE_TYPE (@1))
7221 && type_has_mode_precision_p (type)
7222 /* The inner conversion must be a widening conversion. */
7223 && TYPE_PRECISION (TREE_TYPE (@2)) > TYPE_PRECISION (TREE_TYPE (@0))
7224 && types_match (@0, @1)
7225 && (tree_int_cst_min_precision (@4, TYPE_SIGN (TREE_TYPE (@0)))
7226 <= TYPE_PRECISION (TREE_TYPE (@0)))
7227 && (wi::to_wide (@4)
7228 & wi::mask (TYPE_PRECISION (TREE_TYPE (@0)),
7229 true, TYPE_PRECISION (type))) == 0)
7230 (if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (@0)))
7231 (with { tree ntype = TREE_TYPE (@0); }
7232 (convert (bit_and (op @0 @1) (convert:ntype @4))))
7233 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
7234 (convert (bit_and (op (convert:utype @0) (convert:utype @1))
7235 (convert:utype @4))))))))
7237 /* Transform (@0 < @1 and @0 < @2) to use min,
7238 (@0 > @1 and @0 > @2) to use max */
7239 (for logic (bit_and bit_and bit_and bit_and bit_ior bit_ior bit_ior bit_ior)
7240 op (lt le gt ge lt le gt ge )
7241 ext (min min max max max max min min )
7242 (simplify
7243 (logic (op:cs @0 @1) (op:cs @0 @2))
7244 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
7245 && TREE_CODE (@0) != INTEGER_CST)
7246 (op @0 (ext @1 @2)))))
7248 (simplify
7249 /* signbit(x) -> 0 if x is nonnegative. */
7250 (SIGNBIT tree_expr_nonnegative_p@0)
7251 { integer_zero_node; })
7253 (simplify
7254 /* signbit(x) -> x<0 if x doesn't have signed zeros. */
7255 (SIGNBIT @0)
7256 (if (!HONOR_SIGNED_ZEROS (@0))
7257 (convert (lt @0 { build_real (TREE_TYPE (@0), dconst0); }))))
7259 /* Transform comparisons of the form X +- C1 CMP C2 to X CMP C2 -+ C1. */
7260 (for cmp (eq ne)
7261 (for op (plus minus)
7262 rop (minus plus)
7263 (simplify
7264 (cmp (op@3 @0 INTEGER_CST@1) INTEGER_CST@2)
7265 (if (!TREE_OVERFLOW (@1) && !TREE_OVERFLOW (@2)
7266 && !TYPE_OVERFLOW_SANITIZED (TREE_TYPE (@0))
7267 && !TYPE_OVERFLOW_TRAPS (TREE_TYPE (@0))
7268 && !TYPE_SATURATING (TREE_TYPE (@0)))
7269 (with { tree res = int_const_binop (rop, @2, @1); }
7270 (if (TREE_OVERFLOW (res)
7271 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
7272 { constant_boolean_node (cmp == NE_EXPR, type); }
7273 (if (single_use (@3))
7274 (cmp @0 { TREE_OVERFLOW (res)
7275 ? drop_tree_overflow (res) : res; }))))))))
7276 (for cmp (lt le gt ge)
7277 (for op (plus minus)
7278 rop (minus plus)
7279 (simplify
7280 (cmp (op@3 @0 INTEGER_CST@1) INTEGER_CST@2)
7281 (if (!TREE_OVERFLOW (@1) && !TREE_OVERFLOW (@2)
7282 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0)))
7283 (with { tree res = int_const_binop (rop, @2, @1); }
7284 (if (TREE_OVERFLOW (res))
7285 {
7286 fold_overflow_warning (("assuming signed overflow does not occur "
7287 "when simplifying conditional to constant"),
7288 WARN_STRICT_OVERFLOW_CONDITIONAL);
7289 bool less = cmp == LE_EXPR || cmp == LT_EXPR;
7290 /* wi::ges_p (@2, 0) should be sufficient for a signed type. */
7291 bool ovf_high = wi::lt_p (wi::to_wide (@1), 0,
7292 TYPE_SIGN (TREE_TYPE (@1)))
7293 != (op == MINUS_EXPR);
7294 constant_boolean_node (less == ovf_high, type);
7295 }
7296 (if (single_use (@3))
7297 (with
7298 {
7299 fold_overflow_warning (("assuming signed overflow does not occur "
7300 "when changing X +- C1 cmp C2 to "
7301 "X cmp C2 -+ C1"),
7302 WARN_STRICT_OVERFLOW_COMPARISON);
7303 }
7304 (cmp @0 { res; })))))))))
7306 /* Canonicalizations of BIT_FIELD_REFs. */
7308 (simplify
7309 (BIT_FIELD_REF (BIT_FIELD_REF @0 @1 @2) @3 @4)
7310 (BIT_FIELD_REF @0 @3 { const_binop (PLUS_EXPR, bitsizetype, @2, @4); }))
7312 (simplify
7313 (BIT_FIELD_REF (view_convert @0) @1 @2)
7314 (BIT_FIELD_REF @0 @1 @2))
7316 (simplify
7317 (BIT_FIELD_REF @0 @1 integer_zerop)
7318 (if (tree_int_cst_equal (@1, TYPE_SIZE (TREE_TYPE (@0))))
7319 (view_convert @0)))
7321 (simplify
7322 (BIT_FIELD_REF @0 @1 @2)
7323 (switch
7324 (if (TREE_CODE (TREE_TYPE (@0)) == COMPLEX_TYPE
7325 && tree_int_cst_equal (@1, TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0)))))
7326 (switch
7327 (if (integer_zerop (@2))
7328 (view_convert (realpart @0)))
7329 (if (tree_int_cst_equal (@2, TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0)))))
7330 (view_convert (imagpart @0)))))
7331 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
7332 && INTEGRAL_TYPE_P (type)
7333 /* On GIMPLE this should only apply to register arguments. */
7334 && (! GIMPLE || is_gimple_reg (@0))
7335 /* A bit-field-ref that referenced the full argument can be stripped. */
7336 && ((compare_tree_int (@1, TYPE_PRECISION (TREE_TYPE (@0))) == 0
7337 && integer_zerop (@2))
7338 /* Low-parts can be reduced to integral conversions.
7339 ??? The following doesn't work for PDP endian. */
7340 || (BYTES_BIG_ENDIAN == WORDS_BIG_ENDIAN
7341 /* But only do this after vectorization. */
7342 && canonicalize_math_after_vectorization_p ()
7343 /* Don't even think about BITS_BIG_ENDIAN. */
7344 && TYPE_PRECISION (TREE_TYPE (@0)) % BITS_PER_UNIT == 0
7345 && TYPE_PRECISION (type) % BITS_PER_UNIT == 0
7346 && compare_tree_int (@2, (BYTES_BIG_ENDIAN
7347 ? (TYPE_PRECISION (TREE_TYPE (@0))
7348 - TYPE_PRECISION (type))
7349 : 0)) == 0)))
7350 (convert @0))))
7352 /* Simplify vector extracts. */
7354 (simplify
7355 (BIT_FIELD_REF CONSTRUCTOR@0 @1 @2)
7356 (if (VECTOR_TYPE_P (TREE_TYPE (@0))
7357 && tree_fits_uhwi_p (TYPE_SIZE (type))
7358 && ((tree_to_uhwi (TYPE_SIZE (type))
7359 == tree_to_uhwi (TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0)))))
7360 || (VECTOR_TYPE_P (type)
7361 && (tree_to_uhwi (TYPE_SIZE (TREE_TYPE (type)))
7362 == tree_to_uhwi (TYPE_SIZE (TREE_TYPE (TREE_TYPE (@0))))))))
7363 (with
7364 {
7365 tree ctor = (TREE_CODE (@0) == SSA_NAME
7366 ? gimple_assign_rhs1 (SSA_NAME_DEF_STMT (@0)) : @0);
7367 tree eltype = TREE_TYPE (TREE_TYPE (ctor));
7368 unsigned HOST_WIDE_INT width = tree_to_uhwi (TYPE_SIZE (eltype));
7369 unsigned HOST_WIDE_INT n = tree_to_uhwi (@1);
7370 unsigned HOST_WIDE_INT idx = tree_to_uhwi (@2);
7371 }
7372 (if (n != 0
7373 && (idx % width) == 0
7374 && (n % width) == 0
7375 && known_le ((idx + n) / width,
7376 TYPE_VECTOR_SUBPARTS (TREE_TYPE (ctor))))
7377 (with
7378 {
7379 idx = idx / width;
7380 n = n / width;
7381 /* Constructor elements can be subvectors. */
7382 poly_uint64 k = 1;
7383 if (CONSTRUCTOR_NELTS (ctor) != 0)
7384 {
7385 tree cons_elem = TREE_TYPE (CONSTRUCTOR_ELT (ctor, 0)->value);
7386 if (TREE_CODE (cons_elem) == VECTOR_TYPE)
7387 k = TYPE_VECTOR_SUBPARTS (cons_elem);
7388 }
7389 unsigned HOST_WIDE_INT elt, count, const_k;
7390 }
7391 (switch
7392 /* We keep an exact subset of the constructor elements. */
7393 (if (multiple_p (idx, k, &elt) && multiple_p (n, k, &count))
7394 (if (CONSTRUCTOR_NELTS (ctor) == 0)
7395 { build_zero_cst (type); }
7396 (if (count == 1)
7397 (if (elt < CONSTRUCTOR_NELTS (ctor))
7398 (view_convert { CONSTRUCTOR_ELT (ctor, elt)->value; })
7399 { build_zero_cst (type); })
7400 /* We don't want to emit new CTORs unless the old one goes away.
7401 ??? Eventually allow this if the CTOR ends up constant or
7402 uniform. */
7403 (if (single_use (@0))
7404 (with
7405 {
7406 vec<constructor_elt, va_gc> *vals;
7407 vec_alloc (vals, count);
7408 bool constant_p = true;
7409 tree res;
7410 for (unsigned i = 0;
7411 i < count && elt + i < CONSTRUCTOR_NELTS (ctor); ++i)
7412 {
7413 tree e = CONSTRUCTOR_ELT (ctor, elt + i)->value;
7414 CONSTRUCTOR_APPEND_ELT (vals, NULL_TREE, e);
7415 if (!CONSTANT_CLASS_P (e))
7416 constant_p = false;
7417 }
7418 tree evtype = (types_match (TREE_TYPE (type),
7419 TREE_TYPE (TREE_TYPE (ctor)))
7420 ? type
7421 : build_vector_type (TREE_TYPE (TREE_TYPE (ctor)),
7422 count * k));
7423 res = (constant_p ? build_vector_from_ctor (evtype, vals)
7424 : build_constructor (evtype, vals));
7425 }
7426 (view_convert { res; }))))))
7427 /* The bitfield references a single constructor element. */
7428 (if (k.is_constant (&const_k)
7429 && idx + n <= (idx / const_k + 1) * const_k)
7430 (switch
7431 (if (CONSTRUCTOR_NELTS (ctor) <= idx / const_k)
7432 { build_zero_cst (type); })
7433 (if (n == const_k)
7434 (view_convert { CONSTRUCTOR_ELT (ctor, idx / const_k)->value; }))
7435 (BIT_FIELD_REF { CONSTRUCTOR_ELT (ctor, idx / const_k)->value; }
7436 @1 { bitsize_int ((idx % const_k) * width); })))))))))
7438 /* Simplify a bit extraction from a bit insertion for the cases with
7439 the inserted element fully covering the extraction or the insertion
7440 not touching the extraction. */
7441 (simplify
7442 (BIT_FIELD_REF (bit_insert @0 @1 @ipos) @rsize @rpos)
7443 (with
7444 {
7445 unsigned HOST_WIDE_INT isize;
7446 if (INTEGRAL_TYPE_P (TREE_TYPE (@1)))
7447 isize = TYPE_PRECISION (TREE_TYPE (@1));
7448 else
7449 isize = tree_to_uhwi (TYPE_SIZE (TREE_TYPE (@1)));
7450 }
7451 (switch
7452 (if (wi::leu_p (wi::to_wide (@ipos), wi::to_wide (@rpos))
7453 && wi::leu_p (wi::to_wide (@rpos) + wi::to_wide (@rsize),
7454 wi::to_wide (@ipos) + isize))
7455 (BIT_FIELD_REF @1 @rsize { wide_int_to_tree (bitsizetype,
7456 wi::to_wide (@rpos)
7457 - wi::to_wide (@ipos)); }))
7458 (if (wi::geu_p (wi::to_wide (@ipos),
7459 wi::to_wide (@rpos) + wi::to_wide (@rsize))
7460 || wi::geu_p (wi::to_wide (@rpos),
7461 wi::to_wide (@ipos) + isize))
7462 (BIT_FIELD_REF @0 @rsize @rpos)))))
7464 (if (canonicalize_math_after_vectorization_p ())
7465 (for fmas (FMA)
7466 (simplify
7467 (fmas:c (negate @0) @1 @2)
7468 (IFN_FNMA @0 @1 @2))
7469 (simplify
7470 (fmas @0 @1 (negate @2))
7471 (IFN_FMS @0 @1 @2))
7472 (simplify
7473 (fmas:c (negate @0) @1 (negate @2))
7474 (IFN_FNMS @0 @1 @2))
7475 (simplify
7476 (negate (fmas@3 @0 @1 @2))
7477 (if (single_use (@3))
7478 (IFN_FNMS @0 @1 @2))))
7480 (simplify
7481 (IFN_FMS:c (negate @0) @1 @2)
7482 (IFN_FNMS @0 @1 @2))
7483 (simplify
7484 (IFN_FMS @0 @1 (negate @2))
7485 (IFN_FMA @0 @1 @2))
7486 (simplify
7487 (IFN_FMS:c (negate @0) @1 (negate @2))
7488 (IFN_FNMA @0 @1 @2))
7489 (simplify
7490 (negate (IFN_FMS@3 @0 @1 @2))
7491 (if (single_use (@3))
7492 (IFN_FNMA @0 @1 @2)))
7494 (simplify
7495 (IFN_FNMA:c (negate @0) @1 @2)
7496 (IFN_FMA @0 @1 @2))
7497 (simplify
7498 (IFN_FNMA @0 @1 (negate @2))
7499 (IFN_FNMS @0 @1 @2))
7500 (simplify
7501 (IFN_FNMA:c (negate @0) @1 (negate @2))
7502 (IFN_FMS @0 @1 @2))
7503 (simplify
7504 (negate (IFN_FNMA@3 @0 @1 @2))
7505 (if (single_use (@3))
7506 (IFN_FMS @0 @1 @2)))
7508 (simplify
7509 (IFN_FNMS:c (negate @0) @1 @2)
7510 (IFN_FMS @0 @1 @2))
7511 (simplify
7512 (IFN_FNMS @0 @1 (negate @2))
7513 (IFN_FNMA @0 @1 @2))
7514 (simplify
7515 (IFN_FNMS:c (negate @0) @1 (negate @2))
7516 (IFN_FMA @0 @1 @2))
7517 (simplify
7518 (negate (IFN_FNMS@3 @0 @1 @2))
7519 (if (single_use (@3))
7520 (IFN_FMA @0 @1 @2))))
7522 /* CLZ simplifications. */
7523 (for clz (CLZ)
7524 (for op (eq ne)
7525 cmp (lt ge)
7526 (simplify
7527 (op (clz:s@2 @0) INTEGER_CST@1)
7528 (if (integer_zerop (@1) && single_use (@2))
7529 /* clz(X) == 0 is (int)X < 0 and clz(X) != 0 is (int)X >= 0. */
7530 (with { tree type0 = TREE_TYPE (@0);
7531 tree stype = signed_type_for (type0);
7532 HOST_WIDE_INT val = 0;
7533 /* Punt on hypothetical weird targets. */
7534 if (clz == CFN_CLZ
7535 && CLZ_DEFINED_VALUE_AT_ZERO (SCALAR_TYPE_MODE (type0),
7536 val) == 2
7537 && val == 0)
7538 stype = NULL_TREE;
7539 }
7540 (if (stype)
7541 (cmp (convert:stype @0) { build_zero_cst (stype); })))
7542 /* clz(X) == (prec-1) is X == 1 and clz(X) != (prec-1) is X != 1. */
7543 (with { bool ok = true;
7544 HOST_WIDE_INT val = 0;
7545 tree type0 = TREE_TYPE (@0);
7546 /* Punt on hypothetical weird targets. */
7547 if (clz == CFN_CLZ
7548 && CLZ_DEFINED_VALUE_AT_ZERO (SCALAR_TYPE_MODE (type0),
7549 val) == 2
7550 && val == TYPE_PRECISION (type0) - 1)
7551 ok = false;
7552 }
7553 (if (ok && wi::to_wide (@1) == (TYPE_PRECISION (type0) - 1))
7554 (op @0 { build_one_cst (type0); })))))))
7556 /* CTZ simplifications. */
7557 (for ctz (CTZ)
7558 (for op (ge gt le lt)
7559 cmp (eq eq ne ne)
7560 (simplify
7561 /* __builtin_ctz (x) >= C -> (x & ((1 << C) - 1)) == 0. */
7562 (op (ctz:s @0) INTEGER_CST@1)
7563 (with { bool ok = true;
7564 HOST_WIDE_INT val = 0;
7565 if (!tree_fits_shwi_p (@1))
7566 ok = false;
7567 else
7568 {
7569 val = tree_to_shwi (@1);
7570 /* Canonicalize to >= or <. */
7571 if (op == GT_EXPR || op == LE_EXPR)
7572 {
7573 if (val == HOST_WIDE_INT_MAX)
7574 ok = false;
7575 else
7576 val++;
7577 }
7578 }
7579 bool zero_res = false;
7580 HOST_WIDE_INT zero_val = 0;
7581 tree type0 = TREE_TYPE (@0);
7582 int prec = TYPE_PRECISION (type0);
7583 if (ctz == CFN_CTZ
7584 && CTZ_DEFINED_VALUE_AT_ZERO (SCALAR_TYPE_MODE (type0),
7585 zero_val) == 2)
7586 zero_res = true;
7587 }
7588 (if (val <= 0)
7589 (if (ok && (!zero_res || zero_val >= val))
7590 { constant_boolean_node (cmp == EQ_EXPR ? true : false, type); })
7591 (if (val >= prec)
7592 (if (ok && (!zero_res || zero_val < val))
7593 { constant_boolean_node (cmp == EQ_EXPR ? false : true, type); })
7594 (if (ok && (!zero_res || zero_val < 0 || zero_val >= prec))
7595 (cmp (bit_and @0 { wide_int_to_tree (type0,
7596 wi::mask (val, false, prec)); })
7597 { build_zero_cst (type0); })))))))
7598 (for op (eq ne)
7599 (simplify
7600 /* __builtin_ctz (x) == C -> (x & ((1 << (C + 1)) - 1)) == (1 << C). */
7601 (op (ctz:s @0) INTEGER_CST@1)
7602 (with { bool zero_res = false;
7603 HOST_WIDE_INT zero_val = 0;
7604 tree type0 = TREE_TYPE (@0);
7605 int prec = TYPE_PRECISION (type0);
7606 if (ctz == CFN_CTZ
7607 && CTZ_DEFINED_VALUE_AT_ZERO (SCALAR_TYPE_MODE (type0),
7608 zero_val) == 2)
7609 zero_res = true;
7610 }
7611 (if (tree_int_cst_sgn (@1) < 0 || wi::to_widest (@1) >= prec)
7612 (if (!zero_res || zero_val != wi::to_widest (@1))
7613 { constant_boolean_node (op == EQ_EXPR ? false : true, type); })
7614 (if (!zero_res || zero_val < 0 || zero_val >= prec)
7615 (op (bit_and @0 { wide_int_to_tree (type0,
7616 wi::mask (tree_to_uhwi (@1) + 1,
7617 false, prec)); })
7618 { wide_int_to_tree (type0,
7619 wi::shifted_mask (tree_to_uhwi (@1), 1,
7620 false, prec)); })))))))
7622 /* POPCOUNT simplifications. */
7623 /* popcount(X) + popcount(Y) is popcount(X|Y) when X&Y must be zero. */
7624 (simplify
7625 (plus (POPCOUNT:s @0) (POPCOUNT:s @1))
7626 (if (wi::bit_and (tree_nonzero_bits (@0), tree_nonzero_bits (@1)) == 0)
7627 (POPCOUNT (bit_ior @0 @1))))
7629 /* popcount(X) == 0 is X == 0, and related (in)equalities. */
7630 (for popcount (POPCOUNT)
7631 (for cmp (le eq ne gt)
7632 rep (eq eq ne ne)
7633 (simplify
7634 (cmp (popcount @0) integer_zerop)
7635 (rep @0 { build_zero_cst (TREE_TYPE (@0)); }))))
7637 /* Canonicalize POPCOUNT(x)&1 as PARITY(X). */
7638 (simplify
7639 (bit_and (POPCOUNT @0) integer_onep)
7640 (PARITY @0))
7642 /* PARITY simplifications. */
7643 /* parity(~X) is parity(X). */
7644 (simplify
7645 (PARITY (bit_not @0))
7646 (PARITY @0))
7648 /* parity(X)^parity(Y) is parity(X^Y). */
7649 (simplify
7650 (bit_xor (PARITY:s @0) (PARITY:s @1))
7651 (PARITY (bit_xor @0 @1)))
7653 /* Common POPCOUNT/PARITY simplifications. */
7654 /* popcount(X&C1) is (X>>C2)&1 when C1 == 1<<C2. Same for parity(X&C1). */
7655 (for pfun (POPCOUNT PARITY)
7656 (simplify
7657 (pfun @0)
7658 (with { wide_int nz = tree_nonzero_bits (@0); }
7659 (switch
7660 (if (nz == 1)
7661 (convert @0))
7662 (if (wi::popcount (nz) == 1)
7663 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
7664 (convert (rshift:utype (convert:utype @0)
7665 { build_int_cst (integer_type_node,
7666 wi::ctz (nz)); }))))))))
7668 #if GIMPLE
7669 /* 64- and 32-bits branchless implementations of popcount are detected:
7671 int popcount64c (uint64_t x)
7672 {
7673 x -= (x >> 1) & 0x5555555555555555ULL;
7674 x = (x & 0x3333333333333333ULL) + ((x >> 2) & 0x3333333333333333ULL);
7675 x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0fULL;
7676 return (x * 0x0101010101010101ULL) >> 56;
7677 }
7679 int popcount32c (uint32_t x)
7680 {
7681 x -= (x >> 1) & 0x55555555;
7682 x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
7683 x = (x + (x >> 4)) & 0x0f0f0f0f;
7684 return (x * 0x01010101) >> 24;
7685 } */
7686 (simplify
7687 (rshift
7688 (mult
7689 (bit_and
7690 (plus:c
7691 (rshift @8 INTEGER_CST@5)
7692 (plus:c@8
7693 (bit_and @6 INTEGER_CST@7)
7694 (bit_and
7695 (rshift
7696 (minus@6 @0
7697 (bit_and (rshift @0 INTEGER_CST@4) INTEGER_CST@11))
7698 INTEGER_CST@10)
7699 INTEGER_CST@9)))
7700 INTEGER_CST@3)
7701 INTEGER_CST@2)
7702 INTEGER_CST@1)
7703 /* Check constants and optab. */
7704 (with { unsigned prec = TYPE_PRECISION (type);
7705 int shift = (64 - prec) & 63;
7706 unsigned HOST_WIDE_INT c1
7707 = HOST_WIDE_INT_UC (0x0101010101010101) >> shift;
7708 unsigned HOST_WIDE_INT c2
7709 = HOST_WIDE_INT_UC (0x0F0F0F0F0F0F0F0F) >> shift;
7710 unsigned HOST_WIDE_INT c3
7711 = HOST_WIDE_INT_UC (0x3333333333333333) >> shift;
7712 unsigned HOST_WIDE_INT c4
7713 = HOST_WIDE_INT_UC (0x5555555555555555) >> shift;
7714 }
7715 (if (prec >= 16
7716 && prec <= 64
7717 && pow2p_hwi (prec)
7718 && TYPE_UNSIGNED (type)
7719 && integer_onep (@4)
7720 && wi::to_widest (@10) == 2
7721 && wi::to_widest (@5) == 4
7722 && wi::to_widest (@1) == prec - 8
7723 && tree_to_uhwi (@2) == c1
7724 && tree_to_uhwi (@3) == c2
7725 && tree_to_uhwi (@9) == c3
7726 && tree_to_uhwi (@7) == c3
7727 && tree_to_uhwi (@11) == c4)
7728 (if (direct_internal_fn_supported_p (IFN_POPCOUNT, type,
7729 OPTIMIZE_FOR_BOTH))
7730 (convert (IFN_POPCOUNT:type @0))
7731 /* Try to do popcount in two halves. PREC must be at least
7732 five bits for this to work without extension before adding. */
7733 (with {
7734 tree half_type = NULL_TREE;
7735 opt_machine_mode m = mode_for_size ((prec + 1) / 2, MODE_INT, 1);
7736 int half_prec = 8;
7737 if (m.exists ()
7738 && m.require () != TYPE_MODE (type))
7739 {
7740 half_prec = GET_MODE_PRECISION (as_a <scalar_int_mode> (m));
7741 half_type = build_nonstandard_integer_type (half_prec, 1);
7742 }
7743 gcc_assert (half_prec > 2);
7744 }
7745 (if (half_type != NULL_TREE
7746 && direct_internal_fn_supported_p (IFN_POPCOUNT, half_type,
7747 OPTIMIZE_FOR_BOTH))
7748 (convert (plus
7749 (IFN_POPCOUNT:half_type (convert @0))
7750 (IFN_POPCOUNT:half_type (convert (rshift @0
7751 { build_int_cst (integer_type_node, half_prec); } )))))))))))
7753 /* __builtin_ffs needs to deal on many targets with the possible zero
7754 argument. If we know the argument is always non-zero, __builtin_ctz + 1
7755 should lead to better code. */
7756 (simplify
7757 (FFS tree_expr_nonzero_p@0)
7758 (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
7759 && direct_internal_fn_supported_p (IFN_CTZ, TREE_TYPE (@0),
7760 OPTIMIZE_FOR_SPEED))
7761 (with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
7762 (plus (CTZ:type (convert:utype @0)) { build_one_cst (type); }))))
7763 #endif
7765 (for ffs (BUILT_IN_FFS BUILT_IN_FFSL BUILT_IN_FFSLL
7766 BUILT_IN_FFSIMAX)
7767 /* __builtin_ffs (X) == 0 -> X == 0.
7768 __builtin_ffs (X) == 6 -> (X & 63) == 32. */
7769 (for cmp (eq ne)
7770 (simplify
7771 (cmp (ffs@2 @0) INTEGER_CST@1)
7772 (with { int prec = TYPE_PRECISION (TREE_TYPE (@0)); }
7773 (switch
7774 (if (integer_zerop (@1))
7775 (cmp @0 { build_zero_cst (TREE_TYPE (@0)); }))
7776 (if (tree_int_cst_sgn (@1) < 0 || wi::to_widest (@1) > prec)
7777 { constant_boolean_node (cmp == NE_EXPR ? true : false, type); })
7778 (if (single_use (@2))
7779 (cmp (bit_and @0 { wide_int_to_tree (TREE_TYPE (@0),
7780 wi::mask (tree_to_uhwi (@1),
7781 false, prec)); })
7782 { wide_int_to_tree (TREE_TYPE (@0),
7783 wi::shifted_mask (tree_to_uhwi (@1) - 1, 1,
7784 false, prec)); }))))))
7786 /* __builtin_ffs (X) > 6 -> X != 0 && (X & 63) == 0. */
7787 (for cmp (gt le)
7788 cmp2 (ne eq)
7789 cmp3 (eq ne)
7790 bit_op (bit_and bit_ior)
7791 (simplify
7792 (cmp (ffs@2 @0) INTEGER_CST@1)
7793 (with { int prec = TYPE_PRECISION (TREE_TYPE (@0)); }
7794 (switch
7795 (if (integer_zerop (@1))
7796 (cmp2 @0 { build_zero_cst (TREE_TYPE (@0)); }))
7797 (if (tree_int_cst_sgn (@1) < 0)
7798 { constant_boolean_node (cmp == GT_EXPR ? true : false, type); })
7799 (if (wi::to_widest (@1) >= prec)
7800 { constant_boolean_node (cmp == GT_EXPR ? false : true, type); })
7801 (if (wi::to_widest (@1) == prec - 1)
7802 (cmp3 @0 { wide_int_to_tree (TREE_TYPE (@0),
7803 wi::shifted_mask (prec - 1, 1,
7804 false, prec)); }))
7805 (if (single_use (@2))
7806 (bit_op (cmp2 @0 { build_zero_cst (TREE_TYPE (@0)); })
7807 (cmp3 (bit_and @0
7808 { wide_int_to_tree (TREE_TYPE (@0),
7809 wi::mask (tree_to_uhwi (@1),
7810 false, prec)); })
7811 { build_zero_cst (TREE_TYPE (@0)); }))))))))
7813 #if GIMPLE
7815 /* Simplify:
7816 a = op a1
7817 r = cond ? a : b
7818 --> r = .COND_FN (cond, a, b)
7819 and,
7820 a = op a1
7821 r = cond ? b : a
7822 --> r = .COND_FN (~cond, b, a). */
7824 (for uncond_op (UNCOND_UNARY)
7825 cond_op (COND_UNARY)
7826 (simplify
7827 (vec_cond @0 (view_convert? (uncond_op@3 @1)) @2)
7828 (with { tree op_type = TREE_TYPE (@3); }
7829 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
7830 && is_truth_type_for (op_type, TREE_TYPE (@0)))
7831 (cond_op @0 @1 @2))))
7832 (simplify
7833 (vec_cond @0 @1 (view_convert? (uncond_op@3 @2)))
7834 (with { tree op_type = TREE_TYPE (@3); }
7835 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
7836 && is_truth_type_for (op_type, TREE_TYPE (@0)))
7837 (cond_op (bit_not @0) @2 @1)))))
7839 /* Simplify:
7841 a = a1 op a2
7842 r = c ? a : b;
7844 to:
7846 r = c ? a1 op a2 : b;
7848 if the target can do it in one go. This makes the operation conditional
7849 on c, so could drop potentially-trapping arithmetic, but that's a valid
7850 simplification if the result of the operation isn't needed.
7852 Avoid speculatively generating a stand-alone vector comparison
7853 on targets that might not support them. Any target implementing
7854 conditional internal functions must support the same comparisons
7855 inside and outside a VEC_COND_EXPR. */
7857 (for uncond_op (UNCOND_BINARY)
7858 cond_op (COND_BINARY)
7859 (simplify
7860 (vec_cond @0 (view_convert? (uncond_op@4 @1 @2)) @3)
7861 (with { tree op_type = TREE_TYPE (@4); }
7862 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
7863 && is_truth_type_for (op_type, TREE_TYPE (@0))
7864 && single_use (@4))
7865 (view_convert (cond_op @0 @1 @2 (view_convert:op_type @3))))))
7866 (simplify
7867 (vec_cond @0 @1 (view_convert? (uncond_op@4 @2 @3)))
7868 (with { tree op_type = TREE_TYPE (@4); }
7869 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
7870 && is_truth_type_for (op_type, TREE_TYPE (@0))
7871 && single_use (@4))
7872 (view_convert (cond_op (bit_not @0) @2 @3 (view_convert:op_type @1)))))))
7874 /* Same for ternary operations. */
7875 (for uncond_op (UNCOND_TERNARY)
7876 cond_op (COND_TERNARY)
7877 (simplify
7878 (vec_cond @0 (view_convert? (uncond_op@5 @1 @2 @3)) @4)
7879 (with { tree op_type = TREE_TYPE (@5); }
7880 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
7881 && is_truth_type_for (op_type, TREE_TYPE (@0))
7882 && single_use (@5))
7883 (view_convert (cond_op @0 @1 @2 @3 (view_convert:op_type @4))))))
7884 (simplify
7885 (vec_cond @0 @1 (view_convert? (uncond_op@5 @2 @3 @4)))
7886 (with { tree op_type = TREE_TYPE (@5); }
7887 (if (vectorized_internal_fn_supported_p (as_internal_fn (cond_op), op_type)
7888 && is_truth_type_for (op_type, TREE_TYPE (@0))
7889 && single_use (@5))
7890 (view_convert (cond_op (bit_not @0) @2 @3 @4
7891 (view_convert:op_type @1)))))))
7892 #endif
7894 /* Detect cases in which a VEC_COND_EXPR effectively replaces the
7895 "else" value of an IFN_COND_*. */
7896 (for cond_op (COND_BINARY)
7897 (simplify
7898 (vec_cond @0 (view_convert? (cond_op @0 @1 @2 @3)) @4)
7899 (with { tree op_type = TREE_TYPE (@3); }
7900 (if (element_precision (type) == element_precision (op_type))
7901 (view_convert (cond_op @0 @1 @2 (view_convert:op_type @4))))))
7902 (simplify
7903 (vec_cond @0 @1 (view_convert? (cond_op @2 @3 @4 @5)))
7904 (with { tree op_type = TREE_TYPE (@5); }
7905 (if (inverse_conditions_p (@0, @2)
7906 && element_precision (type) == element_precision (op_type))
7907 (view_convert (cond_op @2 @3 @4 (view_convert:op_type @1)))))))
7909 /* Same for ternary operations. */
7910 (for cond_op (COND_TERNARY)
7911 (simplify
7912 (vec_cond @0 (view_convert? (cond_op @0 @1 @2 @3 @4)) @5)
7913 (with { tree op_type = TREE_TYPE (@4); }
7914 (if (element_precision (type) == element_precision (op_type))
7915 (view_convert (cond_op @0 @1 @2 @3 (view_convert:op_type @5))))))
7916 (simplify
7917 (vec_cond @0 @1 (view_convert? (cond_op @2 @3 @4 @5 @6)))
7918 (with { tree op_type = TREE_TYPE (@6); }
7919 (if (inverse_conditions_p (@0, @2)
7920 && element_precision (type) == element_precision (op_type))
7921 (view_convert (cond_op @2 @3 @4 @5 (view_convert:op_type @1)))))))
7923 /* Detect simplication for a conditional reduction where
7925 a = mask1 ? b : 0
7926 c = mask2 ? d + a : d
7928 is turned into
7930 c = mask1 && mask2 ? d + b : d. */
7931 (simplify
7932 (IFN_COND_ADD @0 @1 (vec_cond @2 @3 integer_zerop) @1)
7933 (IFN_COND_ADD (bit_and @0 @2) @1 @3 @1))
7935 /* For pointers @0 and @2 and nonnegative constant offset @1, look for
7936 expressions like:
7938 A: (@0 + @1 < @2) | (@2 + @1 < @0)
7939 B: (@0 + @1 <= @2) | (@2 + @1 <= @0)
7941 If pointers are known not to wrap, B checks whether @1 bytes starting
7942 at @0 and @2 do not overlap, while A tests the same thing for @1 + 1
7943 bytes. A is more efficiently tested as:
7945 A: (sizetype) (@0 + @1 - @2) > @1 * 2
7947 The equivalent expression for B is given by replacing @1 with @1 - 1:
7949 B: (sizetype) (@0 + (@1 - 1) - @2) > (@1 - 1) * 2
7951 @0 and @2 can be swapped in both expressions without changing the result.
7953 The folds rely on sizetype's being unsigned (which is always true)
7954 and on its being the same width as the pointer (which we have to check).
7956 The fold replaces two pointer_plus expressions, two comparisons and
7957 an IOR with a pointer_plus, a pointer_diff, and a comparison, so in
7958 the best case it's a saving of two operations. The A fold retains one
7959 of the original pointer_pluses, so is a win even if both pointer_pluses
7960 are used elsewhere. The B fold is a wash if both pointer_pluses are
7961 used elsewhere, since all we end up doing is replacing a comparison with
7962 a pointer_plus. We do still apply the fold under those circumstances
7963 though, in case applying it to other conditions eventually makes one of the
7964 pointer_pluses dead. */
7965 (for ior (truth_orif truth_or bit_ior)
7966 (for cmp (le lt)
7967 (simplify
7968 (ior (cmp:cs (pointer_plus@3 @0 INTEGER_CST@1) @2)
7969 (cmp:cs (pointer_plus@4 @2 @1) @0))
7970 (if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (@0))
7971 && TYPE_OVERFLOW_WRAPS (sizetype)
7972 && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (sizetype))
7973 /* Calculate the rhs constant. */
7974 (with { offset_int off = wi::to_offset (@1) - (cmp == LE_EXPR ? 1 : 0);
7975 offset_int rhs = off * 2; }
7976 /* Always fails for negative values. */
7977 (if (wi::min_precision (rhs, UNSIGNED) <= TYPE_PRECISION (sizetype))
7978 /* Since the order of @0 and @2 doesn't matter, let tree_swap_operands_p
7979 pick a canonical order. This increases the chances of using the
7980 same pointer_plus in multiple checks. */
7981 (with { bool swap_p = tree_swap_operands_p (@0, @2);
7982 tree rhs_tree = wide_int_to_tree (sizetype, rhs); }
7983 (if (cmp == LT_EXPR)
7984 (gt (convert:sizetype
7985 (pointer_diff:ssizetype { swap_p ? @4 : @3; }
7986 { swap_p ? @0 : @2; }))
7987 { rhs_tree; })
7988 (gt (convert:sizetype
7989 (pointer_diff:ssizetype
7990 (pointer_plus { swap_p ? @2 : @0; }
7991 { wide_int_to_tree (sizetype, off); })
7992 { swap_p ? @0 : @2; }))
7993 { rhs_tree; })))))))))
7995 /* Fold REDUC (@0 & @1) -> @0[I] & @1[I] if element I is the only nonzero
7996 element of @1. */
7997 (for reduc (IFN_REDUC_PLUS IFN_REDUC_IOR IFN_REDUC_XOR)
7998 (simplify (reduc (view_convert? (bit_and @0 VECTOR_CST@1)))
7999 (with { int i = single_nonzero_element (@1); }
8000 (if (i >= 0)
8001 (with { tree elt = vector_cst_elt (@1, i);
8002 tree elt_type = TREE_TYPE (elt);
8003 unsigned int elt_bits = tree_to_uhwi (TYPE_SIZE (elt_type));
8004 tree size = bitsize_int (elt_bits);
8005 tree pos = bitsize_int (elt_bits * i); }
8006 (view_convert
8007 (bit_and:elt_type
8008 (BIT_FIELD_REF:elt_type @0 { size; } { pos; })
8009 { elt; })))))))
8011 /* Fold reduction of a single nonzero element constructor. */
8012 (for reduc (IFN_REDUC_PLUS IFN_REDUC_IOR IFN_REDUC_XOR)
8013 (simplify (reduc (CONSTRUCTOR@0))
8014 (with { tree ctor = (TREE_CODE (@0) == SSA_NAME
8015 ? gimple_assign_rhs1 (SSA_NAME_DEF_STMT (@0)) : @0);
8016 tree elt = ctor_single_nonzero_element (ctor); }
8017 (if (elt
8018 && !HONOR_SNANS (type)
8019 && !HONOR_SIGNED_ZEROS (type))
8020 { elt; }))))
8022 /* Fold REDUC (@0 op VECTOR_CST) as REDUC (@0) op REDUC (VECTOR_CST). */
8023 (for reduc (IFN_REDUC_PLUS IFN_REDUC_MAX IFN_REDUC_MIN IFN_REDUC_FMAX
8024 IFN_REDUC_FMIN IFN_REDUC_AND IFN_REDUC_IOR IFN_REDUC_XOR)
8025 op (plus max min IFN_FMAX IFN_FMIN bit_and bit_ior bit_xor)
8026 (simplify (reduc (op @0 VECTOR_CST@1))
8027 (op (reduc:type @0) (reduc:type @1))))
8029 /* Simplify vector floating point operations of alternating sub/add pairs
8030 into using an fneg of a wider element type followed by a normal add.
8031 under IEEE 754 the fneg of the wider type will negate every even entry
8032 and when doing an add we get a sub of the even and add of every odd
8033 elements. */
8034 (simplify
8035 (vec_perm (plus:c @0 @1) (minus @0 @1) VECTOR_CST@2)
8036 (if (!VECTOR_INTEGER_TYPE_P (type)
8037 && !FLOAT_WORDS_BIG_ENDIAN)
8038 (with
8039 {
8040 /* Build a vector of integers from the tree mask. */
8041 vec_perm_builder builder;
8042 }
8043 (if (tree_to_vec_perm_builder (&builder, @2))
8044 (with
8045 {
8046 /* Create a vec_perm_indices for the integer vector. */
8047 poly_uint64 nelts = TYPE_VECTOR_SUBPARTS (type);
8048 vec_perm_indices sel (builder, 2, nelts);
8049 machine_mode vec_mode = TYPE_MODE (type);
8050 machine_mode wide_mode;
8051 scalar_mode wide_elt_mode;
8052 poly_uint64 wide_nunits;
8053 scalar_mode inner_mode = GET_MODE_INNER (vec_mode);
8054 }
8055 (if (sel.series_p (0, 2, 0, 2)
8056 && GET_MODE_2XWIDER_MODE (inner_mode).exists (&wide_elt_mode)
8057 && multiple_p (GET_MODE_NUNITS (vec_mode), 2, &wide_nunits)
8058 && related_vector_mode (vec_mode, wide_elt_mode,
8059 wide_nunits).exists (&wide_mode))
8060 (with
8061 {
8062 tree stype
8063 = lang_hooks.types.type_for_mode (GET_MODE_INNER (wide_mode),
8064 TYPE_UNSIGNED (type));
8065 tree ntype = build_vector_type_for_mode (stype, wide_mode);
8067 /* The format has to be a non-extended ieee format. */
8068 const struct real_format *fmt_old = FLOAT_MODE_FORMAT (vec_mode);
8069 const struct real_format *fmt_new = FLOAT_MODE_FORMAT (wide_mode);
8070 }
8071 (if (TYPE_MODE (stype) != BLKmode
8072 && VECTOR_TYPE_P (ntype)
8073 && fmt_old != NULL
8074 && fmt_new != NULL)
8075 (with
8076 {
8077 /* If the target doesn't support v1xx vectors, try using
8078 scalar mode xx instead. */
8079 if (known_eq (GET_MODE_NUNITS (wide_mode), 1)
8080 && !target_supports_op_p (ntype, NEGATE_EXPR, optab_vector))
8081 ntype = stype;
8082 }
8083 (if (fmt_new->signbit_rw
8084 == fmt_old->signbit_rw + GET_MODE_UNIT_BITSIZE (vec_mode)
8085 && fmt_new->signbit_rw == fmt_new->signbit_ro
8086 && targetm.can_change_mode_class (TYPE_MODE (ntype), TYPE_MODE (type), ALL_REGS)
8087 && ((optimize_vectors_before_lowering_p () && VECTOR_TYPE_P (ntype))
8088 || target_supports_op_p (ntype, NEGATE_EXPR, optab_vector)))
8089 (plus (view_convert:type (negate (view_convert:ntype @1))) @0)))))))))))
8091 (simplify
8092 (vec_perm @0 @1 VECTOR_CST@2)
8093 (with
8094 {
8095 tree op0 = @0, op1 = @1, op2 = @2;
8096 machine_mode result_mode = TYPE_MODE (type);
8097 machine_mode op_mode = TYPE_MODE (TREE_TYPE (op0));
8099 /* Build a vector of integers from the tree mask. */
8100 vec_perm_builder builder;
8101 }
8102 (if (tree_to_vec_perm_builder (&builder, op2))
8103 (with
8104 {
8105 /* Create a vec_perm_indices for the integer vector. */
8106 poly_uint64 nelts = TYPE_VECTOR_SUBPARTS (type);
8107 bool single_arg = (op0 == op1);
8108 vec_perm_indices sel (builder, single_arg ? 1 : 2, nelts);
8109 }
8110 (if (sel.series_p (0, 1, 0, 1))
8111 { op0; }
8112 (if (sel.series_p (0, 1, nelts, 1))
8113 { op1; }
8114 (with
8115 {
8116 if (!single_arg)
8117 {
8118 if (sel.all_from_input_p (0))
8119 op1 = op0;
8120 else if (sel.all_from_input_p (1))
8121 {
8122 op0 = op1;
8123 sel.rotate_inputs (1);
8124 }
8125 else if (known_ge (poly_uint64 (sel[0]), nelts))
8126 {
8127 std::swap (op0, op1);
8128 sel.rotate_inputs (1);
8129 }
8130 }
8131 gassign *def;
8132 tree cop0 = op0, cop1 = op1;
8133 if (TREE_CODE (op0) == SSA_NAME
8134 && (def = dyn_cast <gassign *> (SSA_NAME_DEF_STMT (op0)))
8135 && gimple_assign_rhs_code (def) == CONSTRUCTOR)
8136 cop0 = gimple_assign_rhs1 (def);
8137 if (TREE_CODE (op1) == SSA_NAME
8138 && (def = dyn_cast <gassign *> (SSA_NAME_DEF_STMT (op1)))
8139 && gimple_assign_rhs_code (def) == CONSTRUCTOR)
8140 cop1 = gimple_assign_rhs1 (def);
8141 tree t;
8142 }
8143 (if ((TREE_CODE (cop0) == VECTOR_CST
8144 || TREE_CODE (cop0) == CONSTRUCTOR)
8145 && (TREE_CODE (cop1) == VECTOR_CST
8146 || TREE_CODE (cop1) == CONSTRUCTOR)
8147 && (t = fold_vec_perm (type, cop0, cop1, sel)))
8148 { t; }
8149 (with
8150 {
8151 bool changed = (op0 == op1 && !single_arg);
8152 tree ins = NULL_TREE;
8153 unsigned at = 0;
8155 /* See if the permutation is performing a single element
8156 insert from a CONSTRUCTOR or constant and use a BIT_INSERT_EXPR
8157 in that case. But only if the vector mode is supported,
8158 otherwise this is invalid GIMPLE. */
8159 if (op_mode != BLKmode
8160 && (TREE_CODE (cop0) == VECTOR_CST
8161 || TREE_CODE (cop0) == CONSTRUCTOR
8162 || TREE_CODE (cop1) == VECTOR_CST
8163 || TREE_CODE (cop1) == CONSTRUCTOR))
8164 {
8165 bool insert_first_p = sel.series_p (1, 1, nelts + 1, 1);
8166 if (insert_first_p)
8167 {
8168 /* After canonicalizing the first elt to come from the
8169 first vector we only can insert the first elt from
8170 the first vector. */
8171 at = 0;
8172 if ((ins = fold_read_from_vector (cop0, sel[0])))
8173 op0 = op1;
8174 }
8175 /* The above can fail for two-element vectors which always
8176 appear to insert the first element, so try inserting
8177 into the second lane as well. For more than two
8178 elements that's wasted time. */
8179 if (!insert_first_p || (!ins && maybe_eq (nelts, 2u)))
8180 {
8181 unsigned int encoded_nelts = sel.encoding ().encoded_nelts ();
8182 for (at = 0; at < encoded_nelts; ++at)
8183 if (maybe_ne (sel[at], at))
8184 break;
8185 if (at < encoded_nelts
8186 && (known_eq (at + 1, nelts)
8187 || sel.series_p (at + 1, 1, at + 1, 1)))
8188 {
8189 if (known_lt (poly_uint64 (sel[at]), nelts))
8190 ins = fold_read_from_vector (cop0, sel[at]);
8191 else
8192 ins = fold_read_from_vector (cop1, sel[at] - nelts);
8193 }
8194 }
8195 }
8197 /* Generate a canonical form of the selector. */
8198 if (!ins && sel.encoding () != builder)
8199 {
8200 /* Some targets are deficient and fail to expand a single
8201 argument permutation while still allowing an equivalent
8202 2-argument version. */
8203 tree oldop2 = op2;
8204 if (sel.ninputs () == 2
8205 || can_vec_perm_const_p (result_mode, op_mode, sel, false))
8206 op2 = vec_perm_indices_to_tree (TREE_TYPE (op2), sel);
8207 else
8208 {
8209 vec_perm_indices sel2 (builder, 2, nelts);
8210 if (can_vec_perm_const_p (result_mode, op_mode, sel2, false))
8211 op2 = vec_perm_indices_to_tree (TREE_TYPE (op2), sel2);
8212 else
8213 /* Not directly supported with either encoding,
8214 so use the preferred form. */
8215 op2 = vec_perm_indices_to_tree (TREE_TYPE (op2), sel);
8216 }
8217 if (!operand_equal_p (op2, oldop2, 0))
8218 changed = true;
8219 }
8220 }
8221 (if (ins)
8222 (bit_insert { op0; } { ins; }
8223 { bitsize_int (at * vector_element_bits (type)); })
8224 (if (changed)
8225 (vec_perm { op0; } { op1; } { op2; }))))))))))))
8227 /* VEC_PERM_EXPR (v, v, mask) -> v where v contains same element. */
8229 (match vec_same_elem_p
8230 (vec_duplicate @0))
8232 (match vec_same_elem_p
8233 CONSTRUCTOR@0
8234 (if (TREE_CODE (@0) == SSA_NAME
8235 && uniform_vector_p (gimple_assign_rhs1 (SSA_NAME_DEF_STMT (@0))))))
8237 (match vec_same_elem_p
8238 @0
8239 (if (uniform_vector_p (@0))))
8242 (simplify
8243 (vec_perm vec_same_elem_p@0 @0 @1)
8244 @0)
8246 /* Push VEC_PERM earlier if that may help FMA perception (PR101895). */
8247 (simplify
8248 (plus:c (vec_perm:s (mult:c@0 @1 vec_same_elem_p@2) @0 @3) @4)
8249 (if (TREE_CODE (@0) == SSA_NAME && num_imm_uses (@0) == 2)
8250 (plus (mult (vec_perm @1 @1 @3) @2) @4)))
8251 (simplify
8252 (minus (vec_perm:s (mult:c@0 @1 vec_same_elem_p@2) @0 @3) @4)
8253 (if (TREE_CODE (@0) == SSA_NAME && num_imm_uses (@0) == 2)
8254 (minus (mult (vec_perm @1 @1 @3) @2) @4)))
8257 /* Merge
8258 c = VEC_PERM_EXPR <a, b, VCST0>;
8259 d = VEC_PERM_EXPR <c, c, VCST1>;
8260 to
8261 d = VEC_PERM_EXPR <a, b, NEW_VCST>; */
8263 (simplify
8264 (vec_perm (vec_perm@0 @1 @2 VECTOR_CST@3) @0 VECTOR_CST@4)
8265 (if (TYPE_VECTOR_SUBPARTS (type).is_constant ())
8266 (with
8267 {
8268 machine_mode result_mode = TYPE_MODE (type);
8269 machine_mode op_mode = TYPE_MODE (TREE_TYPE (@1));
8270 int nelts = TYPE_VECTOR_SUBPARTS (type).to_constant ();
8271 vec_perm_builder builder0;
8272 vec_perm_builder builder1;
8273 vec_perm_builder builder2 (nelts, nelts, 1);
8274 }
8275 (if (tree_to_vec_perm_builder (&builder0, @3)
8276 && tree_to_vec_perm_builder (&builder1, @4))
8277 (with
8278 {
8279 vec_perm_indices sel0 (builder0, 2, nelts);
8280 vec_perm_indices sel1 (builder1, 1, nelts);
8282 for (int i = 0; i < nelts; i++)
8283 builder2.quick_push (sel0[sel1[i].to_constant ()]);
8285 vec_perm_indices sel2 (builder2, 2, nelts);
8287 tree op0 = NULL_TREE;
8288 /* If the new VEC_PERM_EXPR can't be handled but both
8289 original VEC_PERM_EXPRs can, punt.
8290 If one or both of the original VEC_PERM_EXPRs can't be
8291 handled and the new one can't be either, don't increase
8292 number of VEC_PERM_EXPRs that can't be handled. */
8293 if (can_vec_perm_const_p (result_mode, op_mode, sel2, false)
8294 || (single_use (@0)
8295 ? (!can_vec_perm_const_p (result_mode, op_mode, sel0, false)
8296 || !can_vec_perm_const_p (result_mode, op_mode, sel1, false))
8297 : !can_vec_perm_const_p (result_mode, op_mode, sel1, false)))
8298 op0 = vec_perm_indices_to_tree (TREE_TYPE (@4), sel2);
8299 }
8300 (if (op0)
8301 (vec_perm @1 @2 { op0; })))))))
8304 /* Match count trailing zeroes for simplify_count_trailing_zeroes in fwprop.
8305 The canonical form is array[((x & -x) * C) >> SHIFT] where C is a magic
8306 constant which when multiplied by a power of 2 contains a unique value
8307 in the top 5 or 6 bits. This is then indexed into a table which maps it
8308 to the number of trailing zeroes. */
8309 (match (ctz_table_index @1 @2 @3)
8310 (rshift (mult (bit_and:c (negate @1) @1) INTEGER_CST@2) INTEGER_CST@3))
8312 (match (cond_expr_convert_p @0 @2 @3 @6)
8313 (cond (simple_comparison@6 @0 @1) (convert@4 @2) (convert@5 @3))
8314 (if (INTEGRAL_TYPE_P (type)
8315 && INTEGRAL_TYPE_P (TREE_TYPE (@2))
8316 && INTEGRAL_TYPE_P (TREE_TYPE (@0))
8317 && INTEGRAL_TYPE_P (TREE_TYPE (@3))
8318 && TYPE_PRECISION (type) != TYPE_PRECISION (TREE_TYPE (@0))
8319 && TYPE_PRECISION (TREE_TYPE (@0))
8320 == TYPE_PRECISION (TREE_TYPE (@2))
8321 && TYPE_PRECISION (TREE_TYPE (@0))
8322 == TYPE_PRECISION (TREE_TYPE (@3))
8323 /* For vect_recog_cond_expr_convert_pattern, @2 and @3 can differ in
8324 signess when convert is truncation, but not ok for extension since
8325 it's sign_extend vs zero_extend. */
8326 && (TYPE_PRECISION (TREE_TYPE (@0)) > TYPE_PRECISION (type)
8327 || (TYPE_UNSIGNED (TREE_TYPE (@2))
8328 == TYPE_UNSIGNED (TREE_TYPE (@3))))
8329 && single_use (@4)
8330 && single_use (@5))))
8332 (for bit_op (bit_and bit_ior bit_xor)
8333 (match (bitwise_induction_p @0 @2 @3)
8334 (bit_op:c
8335 (nop_convert1? (bit_not2?@0 (convert3? (lshift integer_onep@1 @2))))
8336 @3)))
8338 (match (bitwise_induction_p @0 @2 @3)
8339 (bit_not
8340 (nop_convert1? (bit_xor@0 (convert2? (lshift integer_onep@1 @2)) @3))))
8342 /* n - (((n > C1) ? n : C1) & -C2) -> n & C1 for unsigned case.
8343 n - (((n > C1) ? n : C1) & -C2) -> (n <= C1) ? n : (n & C1) for signed case. */
8344 (simplify
8345 (minus @0 (bit_and (max @0 INTEGER_CST@1) INTEGER_CST@2))
8346 (with { auto i = wi::neg (wi::to_wide (@2)); }
8347 /* Check if -C2 is a power of 2 and C1 = -C2 - 1. */
8348 (if (wi::popcount (i) == 1
8349 && (wi::to_wide (@1)) == (i - 1))
8350 (if (TYPE_UNSIGNED (TREE_TYPE (@0)))
8351 (bit_and @0 @1)
8352 (cond (le @0 @1) @0 (bit_and @0 @1))))))
8354 /* -x & 1 -> x & 1. */
8355 (simplify
8356 (bit_and (negate @0) integer_onep@1)
8357 (if (!TYPE_OVERFLOW_SANITIZED (type))
8358 (bit_and @0 @1)))
8360 /* Optimize
8361 c1 = VEC_PERM_EXPR (a, a, mask)
8362 c2 = VEC_PERM_EXPR (b, b, mask)
8363 c3 = c1 op c2
8364 -->
8365 c = a op b
8366 c3 = VEC_PERM_EXPR (c, c, mask)
8367 For all integer non-div operations. */
8368 (for op (plus minus mult bit_and bit_ior bit_xor
8369 lshift rshift)
8370 (simplify
8371 (op (vec_perm @0 @0 @2) (vec_perm @1 @1 @2))
8372 (if (VECTOR_INTEGER_TYPE_P (type))
8373 (vec_perm (op@3 @0 @1) @3 @2))))
8375 /* Similar for float arithmetic when permutation constant covers
8376 all vector elements. */
8377 (for op (plus minus mult)
8378 (simplify
8379 (op (vec_perm @0 @0 VECTOR_CST@2) (vec_perm @1 @1 VECTOR_CST@2))
8380 (if (VECTOR_FLOAT_TYPE_P (type)
8381 && TYPE_VECTOR_SUBPARTS (type).is_constant ())
8382 (with
8383 {
8384 tree perm_cst = @2;
8385 vec_perm_builder builder;
8386 bool full_perm_p = false;
8387 if (tree_to_vec_perm_builder (&builder, perm_cst))
8388 {
8389 unsigned HOST_WIDE_INT nelts;
8391 nelts = TYPE_VECTOR_SUBPARTS (type).to_constant ();
8392 /* Create a vec_perm_indices for the VECTOR_CST. */
8393 vec_perm_indices sel (builder, 1, nelts);
8395 /* Check if perm indices covers all vector elements. */
8396 if (sel.encoding ().encoded_full_vector_p ())
8397 {
8398 auto_sbitmap seen (nelts);
8399 bitmap_clear (seen);
8401 unsigned HOST_WIDE_INT count = 0, i;
8403 for (i = 0; i < nelts; i++)
8404 {
8405 if (!bitmap_set_bit (seen, sel[i].to_constant ()))
8406 break;
8407 count++;
8408 }
8409 full_perm_p = count == nelts;
8410 }
8411 }
8412 }
8413 (if (full_perm_p)
8414 (vec_perm (op@3 @0 @1) @3 @2))))))