1 /* Fold a constant sub-tree into a single node for C-compiler
2 Copyright (C) 1987-2015 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /*@@ This file should be rewritten to use an arbitrary precision
21 @@ representation for "struct tree_int_cst" and "struct tree_real_cst".
22 @@ Perhaps the routines could also be used for bc/dc, and made a lib.
23 @@ The routines that translate from the ap rep should
24 @@ warn if precision et. al. is lost.
25 @@ This would also make life easier when this technology is used
26 @@ for cross-compilers. */
28 /* The entry points in this file are fold, size_int_wide and size_binop.
30 fold takes a tree as argument and returns a simplified tree.
32 size_binop takes a tree code for an arithmetic operation
33 and two operands that are trees, and produces a tree for the
34 result, assuming the type comes from `sizetype'.
36 size_int takes an integer value, and creates a tree constant
37 with type from `sizetype'.
39 Note: Since the folders get called on non-gimple code as well as
40 gimple code, we need to handle GIMPLE tuples as well as their
41 corresponding tree equivalents. */
45 #include "coretypes.h"
53 #include "fold-const.h"
54 #include "stor-layout.h"
56 #include "tree-iterator.h"
58 #include "insn-config.h"
68 #include "diagnostic-core.h"
70 #include "langhooks.h"
72 #include "internal-fn.h"
78 #include "generic-match.h"
79 #include "optabs-query.h"
81 #ifndef LOAD_EXTEND_OP
82 #define LOAD_EXTEND_OP(M) UNKNOWN
85 /* Nonzero if we are folding constants inside an initializer; zero
87 int folding_initializer
= 0;
89 /* The following constants represent a bit based encoding of GCC's
90 comparison operators. This encoding simplifies transformations
91 on relational comparison operators, such as AND and OR. */
92 enum comparison_code
{
111 static bool negate_mathfn_p (enum built_in_function
);
112 static bool negate_expr_p (tree
);
113 static tree
negate_expr (tree
);
114 static tree
split_tree (tree
, enum tree_code
, tree
*, tree
*, tree
*, int);
115 static tree
associate_trees (location_t
, tree
, tree
, enum tree_code
, tree
);
116 static enum comparison_code
comparison_to_compcode (enum tree_code
);
117 static enum tree_code
compcode_to_comparison (enum comparison_code
);
118 static int operand_equal_for_comparison_p (tree
, tree
, tree
);
119 static int twoval_comparison_p (tree
, tree
*, tree
*, int *);
120 static tree
eval_subst (location_t
, tree
, tree
, tree
, tree
, tree
);
121 static tree
make_bit_field_ref (location_t
, tree
, tree
,
122 HOST_WIDE_INT
, HOST_WIDE_INT
, int);
123 static tree
optimize_bit_field_compare (location_t
, enum tree_code
,
125 static tree
decode_field_reference (location_t
, tree
, HOST_WIDE_INT
*,
127 machine_mode
*, int *, int *,
129 static int simple_operand_p (const_tree
);
130 static bool simple_operand_p_2 (tree
);
131 static tree
range_binop (enum tree_code
, tree
, tree
, int, tree
, int);
132 static tree
range_predecessor (tree
);
133 static tree
range_successor (tree
);
134 static tree
fold_range_test (location_t
, enum tree_code
, tree
, tree
, tree
);
135 static tree
fold_cond_expr_with_comparison (location_t
, tree
, tree
, tree
, tree
);
136 static tree
unextend (tree
, int, int, tree
);
137 static tree
optimize_minmax_comparison (location_t
, enum tree_code
,
139 static tree
extract_muldiv (tree
, tree
, enum tree_code
, tree
, bool *);
140 static tree
extract_muldiv_1 (tree
, tree
, enum tree_code
, tree
, bool *);
141 static tree
fold_binary_op_with_conditional_arg (location_t
,
142 enum tree_code
, tree
,
145 static tree
fold_div_compare (location_t
, enum tree_code
, tree
, tree
, tree
);
146 static bool reorder_operands_p (const_tree
, const_tree
);
147 static tree
fold_negate_const (tree
, tree
);
148 static tree
fold_not_const (const_tree
, tree
);
149 static tree
fold_relational_const (enum tree_code
, tree
, tree
, tree
);
150 static tree
fold_convert_const (enum tree_code
, tree
, tree
);
151 static tree
fold_view_convert_expr (tree
, tree
);
152 static bool vec_cst_ctor_to_array (tree
, tree
*);
155 /* Return EXPR_LOCATION of T if it is not UNKNOWN_LOCATION.
156 Otherwise, return LOC. */
159 expr_location_or (tree t
, location_t loc
)
161 location_t tloc
= EXPR_LOCATION (t
);
162 return tloc
== UNKNOWN_LOCATION
? loc
: tloc
;
165 /* Similar to protected_set_expr_location, but never modify x in place,
166 if location can and needs to be set, unshare it. */
169 protected_set_expr_location_unshare (tree x
, location_t loc
)
171 if (CAN_HAVE_LOCATION_P (x
)
172 && EXPR_LOCATION (x
) != loc
173 && !(TREE_CODE (x
) == SAVE_EXPR
174 || TREE_CODE (x
) == TARGET_EXPR
175 || TREE_CODE (x
) == BIND_EXPR
))
178 SET_EXPR_LOCATION (x
, loc
);
183 /* If ARG2 divides ARG1 with zero remainder, carries out the exact
184 division and returns the quotient. Otherwise returns
188 div_if_zero_remainder (const_tree arg1
, const_tree arg2
)
192 if (wi::multiple_of_p (wi::to_widest (arg1
), wi::to_widest (arg2
),
194 return wide_int_to_tree (TREE_TYPE (arg1
), quo
);
199 /* This is nonzero if we should defer warnings about undefined
200 overflow. This facility exists because these warnings are a
201 special case. The code to estimate loop iterations does not want
202 to issue any warnings, since it works with expressions which do not
203 occur in user code. Various bits of cleanup code call fold(), but
204 only use the result if it has certain characteristics (e.g., is a
205 constant); that code only wants to issue a warning if the result is
208 static int fold_deferring_overflow_warnings
;
210 /* If a warning about undefined overflow is deferred, this is the
211 warning. Note that this may cause us to turn two warnings into
212 one, but that is fine since it is sufficient to only give one
213 warning per expression. */
215 static const char* fold_deferred_overflow_warning
;
217 /* If a warning about undefined overflow is deferred, this is the
218 level at which the warning should be emitted. */
220 static enum warn_strict_overflow_code fold_deferred_overflow_code
;
222 /* Start deferring overflow warnings. We could use a stack here to
223 permit nested calls, but at present it is not necessary. */
226 fold_defer_overflow_warnings (void)
228 ++fold_deferring_overflow_warnings
;
231 /* Stop deferring overflow warnings. If there is a pending warning,
232 and ISSUE is true, then issue the warning if appropriate. STMT is
233 the statement with which the warning should be associated (used for
234 location information); STMT may be NULL. CODE is the level of the
235 warning--a warn_strict_overflow_code value. This function will use
236 the smaller of CODE and the deferred code when deciding whether to
237 issue the warning. CODE may be zero to mean to always use the
241 fold_undefer_overflow_warnings (bool issue
, const gimple
*stmt
, int code
)
246 gcc_assert (fold_deferring_overflow_warnings
> 0);
247 --fold_deferring_overflow_warnings
;
248 if (fold_deferring_overflow_warnings
> 0)
250 if (fold_deferred_overflow_warning
!= NULL
252 && code
< (int) fold_deferred_overflow_code
)
253 fold_deferred_overflow_code
= (enum warn_strict_overflow_code
) code
;
257 warnmsg
= fold_deferred_overflow_warning
;
258 fold_deferred_overflow_warning
= NULL
;
260 if (!issue
|| warnmsg
== NULL
)
263 if (gimple_no_warning_p (stmt
))
266 /* Use the smallest code level when deciding to issue the
268 if (code
== 0 || code
> (int) fold_deferred_overflow_code
)
269 code
= fold_deferred_overflow_code
;
271 if (!issue_strict_overflow_warning (code
))
275 locus
= input_location
;
277 locus
= gimple_location (stmt
);
278 warning_at (locus
, OPT_Wstrict_overflow
, "%s", warnmsg
);
281 /* Stop deferring overflow warnings, ignoring any deferred
285 fold_undefer_and_ignore_overflow_warnings (void)
287 fold_undefer_overflow_warnings (false, NULL
, 0);
290 /* Whether we are deferring overflow warnings. */
293 fold_deferring_overflow_warnings_p (void)
295 return fold_deferring_overflow_warnings
> 0;
298 /* This is called when we fold something based on the fact that signed
299 overflow is undefined. */
302 fold_overflow_warning (const char* gmsgid
, enum warn_strict_overflow_code wc
)
304 if (fold_deferring_overflow_warnings
> 0)
306 if (fold_deferred_overflow_warning
== NULL
307 || wc
< fold_deferred_overflow_code
)
309 fold_deferred_overflow_warning
= gmsgid
;
310 fold_deferred_overflow_code
= wc
;
313 else if (issue_strict_overflow_warning (wc
))
314 warning (OPT_Wstrict_overflow
, gmsgid
);
317 /* Return true if the built-in mathematical function specified by CODE
318 is odd, i.e. -f(x) == f(-x). */
321 negate_mathfn_p (enum built_in_function code
)
325 CASE_FLT_FN (BUILT_IN_ASIN
):
326 CASE_FLT_FN (BUILT_IN_ASINH
):
327 CASE_FLT_FN (BUILT_IN_ATAN
):
328 CASE_FLT_FN (BUILT_IN_ATANH
):
329 CASE_FLT_FN (BUILT_IN_CASIN
):
330 CASE_FLT_FN (BUILT_IN_CASINH
):
331 CASE_FLT_FN (BUILT_IN_CATAN
):
332 CASE_FLT_FN (BUILT_IN_CATANH
):
333 CASE_FLT_FN (BUILT_IN_CBRT
):
334 CASE_FLT_FN (BUILT_IN_CPROJ
):
335 CASE_FLT_FN (BUILT_IN_CSIN
):
336 CASE_FLT_FN (BUILT_IN_CSINH
):
337 CASE_FLT_FN (BUILT_IN_CTAN
):
338 CASE_FLT_FN (BUILT_IN_CTANH
):
339 CASE_FLT_FN (BUILT_IN_ERF
):
340 CASE_FLT_FN (BUILT_IN_LLROUND
):
341 CASE_FLT_FN (BUILT_IN_LROUND
):
342 CASE_FLT_FN (BUILT_IN_ROUND
):
343 CASE_FLT_FN (BUILT_IN_SIN
):
344 CASE_FLT_FN (BUILT_IN_SINH
):
345 CASE_FLT_FN (BUILT_IN_TAN
):
346 CASE_FLT_FN (BUILT_IN_TANH
):
347 CASE_FLT_FN (BUILT_IN_TRUNC
):
350 CASE_FLT_FN (BUILT_IN_LLRINT
):
351 CASE_FLT_FN (BUILT_IN_LRINT
):
352 CASE_FLT_FN (BUILT_IN_NEARBYINT
):
353 CASE_FLT_FN (BUILT_IN_RINT
):
354 return !flag_rounding_math
;
362 /* Check whether we may negate an integer constant T without causing
366 may_negate_without_overflow_p (const_tree t
)
370 gcc_assert (TREE_CODE (t
) == INTEGER_CST
);
372 type
= TREE_TYPE (t
);
373 if (TYPE_UNSIGNED (type
))
376 return !wi::only_sign_bit_p (t
);
379 /* Determine whether an expression T can be cheaply negated using
380 the function negate_expr without introducing undefined overflow. */
383 negate_expr_p (tree t
)
390 type
= TREE_TYPE (t
);
393 switch (TREE_CODE (t
))
396 if (INTEGRAL_TYPE_P (type
) && TYPE_OVERFLOW_WRAPS (type
))
399 /* Check that -CST will not overflow type. */
400 return may_negate_without_overflow_p (t
);
402 return (INTEGRAL_TYPE_P (type
)
403 && TYPE_OVERFLOW_WRAPS (type
));
409 return !TYPE_OVERFLOW_SANITIZED (type
);
412 /* We want to canonicalize to positive real constants. Pretend
413 that only negative ones can be easily negated. */
414 return REAL_VALUE_NEGATIVE (TREE_REAL_CST (t
));
417 return negate_expr_p (TREE_REALPART (t
))
418 && negate_expr_p (TREE_IMAGPART (t
));
422 if (FLOAT_TYPE_P (TREE_TYPE (type
)) || TYPE_OVERFLOW_WRAPS (type
))
425 int count
= TYPE_VECTOR_SUBPARTS (type
), i
;
427 for (i
= 0; i
< count
; i
++)
428 if (!negate_expr_p (VECTOR_CST_ELT (t
, i
)))
435 return negate_expr_p (TREE_OPERAND (t
, 0))
436 && negate_expr_p (TREE_OPERAND (t
, 1));
439 return negate_expr_p (TREE_OPERAND (t
, 0));
442 if (HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
443 || HONOR_SIGNED_ZEROS (element_mode (type
)))
445 /* -(A + B) -> (-B) - A. */
446 if (negate_expr_p (TREE_OPERAND (t
, 1))
447 && reorder_operands_p (TREE_OPERAND (t
, 0),
448 TREE_OPERAND (t
, 1)))
450 /* -(A + B) -> (-A) - B. */
451 return negate_expr_p (TREE_OPERAND (t
, 0));
454 /* We can't turn -(A-B) into B-A when we honor signed zeros. */
455 return !HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
456 && !HONOR_SIGNED_ZEROS (element_mode (type
))
457 && reorder_operands_p (TREE_OPERAND (t
, 0),
458 TREE_OPERAND (t
, 1));
461 if (TYPE_UNSIGNED (TREE_TYPE (t
)))
467 if (! HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (TREE_TYPE (t
))))
468 return negate_expr_p (TREE_OPERAND (t
, 1))
469 || negate_expr_p (TREE_OPERAND (t
, 0));
475 /* In general we can't negate A / B, because if A is INT_MIN and
476 B is 1, we may turn this into INT_MIN / -1 which is undefined
477 and actually traps on some architectures. But if overflow is
478 undefined, we can negate, because - (INT_MIN / 1) is an
480 if (INTEGRAL_TYPE_P (TREE_TYPE (t
)))
482 if (!TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (t
)))
484 /* If overflow is undefined then we have to be careful because
485 we ask whether it's ok to associate the negate with the
486 division which is not ok for example for
487 -((a - b) / c) where (-(a - b)) / c may invoke undefined
488 overflow because of negating INT_MIN. So do not use
489 negate_expr_p here but open-code the two important cases. */
490 if (TREE_CODE (TREE_OPERAND (t
, 0)) == NEGATE_EXPR
491 || (TREE_CODE (TREE_OPERAND (t
, 0)) == INTEGER_CST
492 && may_negate_without_overflow_p (TREE_OPERAND (t
, 0))))
495 else if (negate_expr_p (TREE_OPERAND (t
, 0)))
497 return negate_expr_p (TREE_OPERAND (t
, 1));
500 /* Negate -((double)float) as (double)(-float). */
501 if (TREE_CODE (type
) == REAL_TYPE
)
503 tree tem
= strip_float_extensions (t
);
505 return negate_expr_p (tem
);
510 /* Negate -f(x) as f(-x). */
511 if (negate_mathfn_p (builtin_mathfn_code (t
)))
512 return negate_expr_p (CALL_EXPR_ARG (t
, 0));
516 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
517 if (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
)
519 tree op1
= TREE_OPERAND (t
, 1);
520 if (wi::eq_p (op1
, TYPE_PRECISION (type
) - 1))
531 /* Given T, an expression, return a folded tree for -T or NULL_TREE, if no
532 simplification is possible.
533 If negate_expr_p would return true for T, NULL_TREE will never be
537 fold_negate_expr (location_t loc
, tree t
)
539 tree type
= TREE_TYPE (t
);
542 switch (TREE_CODE (t
))
544 /* Convert - (~A) to A + 1. */
546 if (INTEGRAL_TYPE_P (type
))
547 return fold_build2_loc (loc
, PLUS_EXPR
, type
, TREE_OPERAND (t
, 0),
548 build_one_cst (type
));
552 tem
= fold_negate_const (t
, type
);
553 if (TREE_OVERFLOW (tem
) == TREE_OVERFLOW (t
)
554 || (ANY_INTEGRAL_TYPE_P (type
)
555 && !TYPE_OVERFLOW_TRAPS (type
)
556 && TYPE_OVERFLOW_WRAPS (type
))
557 || (flag_sanitize
& SANITIZE_SI_OVERFLOW
) == 0)
562 tem
= fold_negate_const (t
, type
);
566 tem
= fold_negate_const (t
, type
);
571 tree rpart
= fold_negate_expr (loc
, TREE_REALPART (t
));
572 tree ipart
= fold_negate_expr (loc
, TREE_IMAGPART (t
));
574 return build_complex (type
, rpart
, ipart
);
580 int count
= TYPE_VECTOR_SUBPARTS (type
), i
;
581 tree
*elts
= XALLOCAVEC (tree
, count
);
583 for (i
= 0; i
< count
; i
++)
585 elts
[i
] = fold_negate_expr (loc
, VECTOR_CST_ELT (t
, i
));
586 if (elts
[i
] == NULL_TREE
)
590 return build_vector (type
, elts
);
594 if (negate_expr_p (t
))
595 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
596 fold_negate_expr (loc
, TREE_OPERAND (t
, 0)),
597 fold_negate_expr (loc
, TREE_OPERAND (t
, 1)));
601 if (negate_expr_p (t
))
602 return fold_build1_loc (loc
, CONJ_EXPR
, type
,
603 fold_negate_expr (loc
, TREE_OPERAND (t
, 0)));
607 if (!TYPE_OVERFLOW_SANITIZED (type
))
608 return TREE_OPERAND (t
, 0);
612 if (!HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
613 && !HONOR_SIGNED_ZEROS (element_mode (type
)))
615 /* -(A + B) -> (-B) - A. */
616 if (negate_expr_p (TREE_OPERAND (t
, 1))
617 && reorder_operands_p (TREE_OPERAND (t
, 0),
618 TREE_OPERAND (t
, 1)))
620 tem
= negate_expr (TREE_OPERAND (t
, 1));
621 return fold_build2_loc (loc
, MINUS_EXPR
, type
,
622 tem
, TREE_OPERAND (t
, 0));
625 /* -(A + B) -> (-A) - B. */
626 if (negate_expr_p (TREE_OPERAND (t
, 0)))
628 tem
= negate_expr (TREE_OPERAND (t
, 0));
629 return fold_build2_loc (loc
, MINUS_EXPR
, type
,
630 tem
, TREE_OPERAND (t
, 1));
636 /* - (A - B) -> B - A */
637 if (!HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
638 && !HONOR_SIGNED_ZEROS (element_mode (type
))
639 && reorder_operands_p (TREE_OPERAND (t
, 0), TREE_OPERAND (t
, 1)))
640 return fold_build2_loc (loc
, MINUS_EXPR
, type
,
641 TREE_OPERAND (t
, 1), TREE_OPERAND (t
, 0));
645 if (TYPE_UNSIGNED (type
))
651 if (! HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
)))
653 tem
= TREE_OPERAND (t
, 1);
654 if (negate_expr_p (tem
))
655 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
656 TREE_OPERAND (t
, 0), negate_expr (tem
));
657 tem
= TREE_OPERAND (t
, 0);
658 if (negate_expr_p (tem
))
659 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
660 negate_expr (tem
), TREE_OPERAND (t
, 1));
667 /* In general we can't negate A / B, because if A is INT_MIN and
668 B is 1, we may turn this into INT_MIN / -1 which is undefined
669 and actually traps on some architectures. But if overflow is
670 undefined, we can negate, because - (INT_MIN / 1) is an
672 if (!INTEGRAL_TYPE_P (type
) || TYPE_OVERFLOW_UNDEFINED (type
))
674 const char * const warnmsg
= G_("assuming signed overflow does not "
675 "occur when negating a division");
676 tem
= TREE_OPERAND (t
, 1);
677 if (negate_expr_p (tem
))
679 if (INTEGRAL_TYPE_P (type
)
680 && (TREE_CODE (tem
) != INTEGER_CST
681 || integer_onep (tem
)))
682 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_MISC
);
683 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
684 TREE_OPERAND (t
, 0), negate_expr (tem
));
686 /* If overflow is undefined then we have to be careful because
687 we ask whether it's ok to associate the negate with the
688 division which is not ok for example for
689 -((a - b) / c) where (-(a - b)) / c may invoke undefined
690 overflow because of negating INT_MIN. So do not use
691 negate_expr_p here but open-code the two important cases. */
692 tem
= TREE_OPERAND (t
, 0);
693 if ((INTEGRAL_TYPE_P (type
)
694 && (TREE_CODE (tem
) == NEGATE_EXPR
695 || (TREE_CODE (tem
) == INTEGER_CST
696 && may_negate_without_overflow_p (tem
))))
697 || !INTEGRAL_TYPE_P (type
))
698 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
699 negate_expr (tem
), TREE_OPERAND (t
, 1));
704 /* Convert -((double)float) into (double)(-float). */
705 if (TREE_CODE (type
) == REAL_TYPE
)
707 tem
= strip_float_extensions (t
);
708 if (tem
!= t
&& negate_expr_p (tem
))
709 return fold_convert_loc (loc
, type
, negate_expr (tem
));
714 /* Negate -f(x) as f(-x). */
715 if (negate_mathfn_p (builtin_mathfn_code (t
))
716 && negate_expr_p (CALL_EXPR_ARG (t
, 0)))
720 fndecl
= get_callee_fndecl (t
);
721 arg
= negate_expr (CALL_EXPR_ARG (t
, 0));
722 return build_call_expr_loc (loc
, fndecl
, 1, arg
);
727 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
728 if (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
)
730 tree op1
= TREE_OPERAND (t
, 1);
731 if (wi::eq_p (op1
, TYPE_PRECISION (type
) - 1))
733 tree ntype
= TYPE_UNSIGNED (type
)
734 ? signed_type_for (type
)
735 : unsigned_type_for (type
);
736 tree temp
= fold_convert_loc (loc
, ntype
, TREE_OPERAND (t
, 0));
737 temp
= fold_build2_loc (loc
, RSHIFT_EXPR
, ntype
, temp
, op1
);
738 return fold_convert_loc (loc
, type
, temp
);
750 /* Like fold_negate_expr, but return a NEGATE_EXPR tree, if T can not be
751 negated in a simpler way. Also allow for T to be NULL_TREE, in which case
763 loc
= EXPR_LOCATION (t
);
764 type
= TREE_TYPE (t
);
767 tem
= fold_negate_expr (loc
, t
);
769 tem
= build1_loc (loc
, NEGATE_EXPR
, TREE_TYPE (t
), t
);
770 return fold_convert_loc (loc
, type
, tem
);
773 /* Split a tree IN into a constant, literal and variable parts that could be
774 combined with CODE to make IN. "constant" means an expression with
775 TREE_CONSTANT but that isn't an actual constant. CODE must be a
776 commutative arithmetic operation. Store the constant part into *CONP,
777 the literal in *LITP and return the variable part. If a part isn't
778 present, set it to null. If the tree does not decompose in this way,
779 return the entire tree as the variable part and the other parts as null.
781 If CODE is PLUS_EXPR we also split trees that use MINUS_EXPR. In that
782 case, we negate an operand that was subtracted. Except if it is a
783 literal for which we use *MINUS_LITP instead.
785 If NEGATE_P is true, we are negating all of IN, again except a literal
786 for which we use *MINUS_LITP instead.
788 If IN is itself a literal or constant, return it as appropriate.
790 Note that we do not guarantee that any of the three values will be the
791 same type as IN, but they will have the same signedness and mode. */
794 split_tree (tree in
, enum tree_code code
, tree
*conp
, tree
*litp
,
795 tree
*minus_litp
, int negate_p
)
803 /* Strip any conversions that don't change the machine mode or signedness. */
804 STRIP_SIGN_NOPS (in
);
806 if (TREE_CODE (in
) == INTEGER_CST
|| TREE_CODE (in
) == REAL_CST
807 || TREE_CODE (in
) == FIXED_CST
)
809 else if (TREE_CODE (in
) == code
810 || ((! FLOAT_TYPE_P (TREE_TYPE (in
)) || flag_associative_math
)
811 && ! SAT_FIXED_POINT_TYPE_P (TREE_TYPE (in
))
812 /* We can associate addition and subtraction together (even
813 though the C standard doesn't say so) for integers because
814 the value is not affected. For reals, the value might be
815 affected, so we can't. */
816 && ((code
== PLUS_EXPR
&& TREE_CODE (in
) == MINUS_EXPR
)
817 || (code
== MINUS_EXPR
&& TREE_CODE (in
) == PLUS_EXPR
))))
819 tree op0
= TREE_OPERAND (in
, 0);
820 tree op1
= TREE_OPERAND (in
, 1);
821 int neg1_p
= TREE_CODE (in
) == MINUS_EXPR
;
822 int neg_litp_p
= 0, neg_conp_p
= 0, neg_var_p
= 0;
824 /* First see if either of the operands is a literal, then a constant. */
825 if (TREE_CODE (op0
) == INTEGER_CST
|| TREE_CODE (op0
) == REAL_CST
826 || TREE_CODE (op0
) == FIXED_CST
)
827 *litp
= op0
, op0
= 0;
828 else if (TREE_CODE (op1
) == INTEGER_CST
|| TREE_CODE (op1
) == REAL_CST
829 || TREE_CODE (op1
) == FIXED_CST
)
830 *litp
= op1
, neg_litp_p
= neg1_p
, op1
= 0;
832 if (op0
!= 0 && TREE_CONSTANT (op0
))
833 *conp
= op0
, op0
= 0;
834 else if (op1
!= 0 && TREE_CONSTANT (op1
))
835 *conp
= op1
, neg_conp_p
= neg1_p
, op1
= 0;
837 /* If we haven't dealt with either operand, this is not a case we can
838 decompose. Otherwise, VAR is either of the ones remaining, if any. */
839 if (op0
!= 0 && op1
!= 0)
844 var
= op1
, neg_var_p
= neg1_p
;
846 /* Now do any needed negations. */
848 *minus_litp
= *litp
, *litp
= 0;
850 *conp
= negate_expr (*conp
);
852 var
= negate_expr (var
);
854 else if (TREE_CODE (in
) == BIT_NOT_EXPR
855 && code
== PLUS_EXPR
)
857 /* -X - 1 is folded to ~X, undo that here. */
858 *minus_litp
= build_one_cst (TREE_TYPE (in
));
859 var
= negate_expr (TREE_OPERAND (in
, 0));
861 else if (TREE_CONSTANT (in
))
869 *minus_litp
= *litp
, *litp
= 0;
870 else if (*minus_litp
)
871 *litp
= *minus_litp
, *minus_litp
= 0;
872 *conp
= negate_expr (*conp
);
873 var
= negate_expr (var
);
879 /* Re-associate trees split by the above function. T1 and T2 are
880 either expressions to associate or null. Return the new
881 expression, if any. LOC is the location of the new expression. If
882 we build an operation, do it in TYPE and with CODE. */
885 associate_trees (location_t loc
, tree t1
, tree t2
, enum tree_code code
, tree type
)
892 /* If either input is CODE, a PLUS_EXPR, or a MINUS_EXPR, don't
893 try to fold this since we will have infinite recursion. But do
894 deal with any NEGATE_EXPRs. */
895 if (TREE_CODE (t1
) == code
|| TREE_CODE (t2
) == code
896 || TREE_CODE (t1
) == MINUS_EXPR
|| TREE_CODE (t2
) == MINUS_EXPR
)
898 if (code
== PLUS_EXPR
)
900 if (TREE_CODE (t1
) == NEGATE_EXPR
)
901 return build2_loc (loc
, MINUS_EXPR
, type
,
902 fold_convert_loc (loc
, type
, t2
),
903 fold_convert_loc (loc
, type
,
904 TREE_OPERAND (t1
, 0)));
905 else if (TREE_CODE (t2
) == NEGATE_EXPR
)
906 return build2_loc (loc
, MINUS_EXPR
, type
,
907 fold_convert_loc (loc
, type
, t1
),
908 fold_convert_loc (loc
, type
,
909 TREE_OPERAND (t2
, 0)));
910 else if (integer_zerop (t2
))
911 return fold_convert_loc (loc
, type
, t1
);
913 else if (code
== MINUS_EXPR
)
915 if (integer_zerop (t2
))
916 return fold_convert_loc (loc
, type
, t1
);
919 return build2_loc (loc
, code
, type
, fold_convert_loc (loc
, type
, t1
),
920 fold_convert_loc (loc
, type
, t2
));
923 return fold_build2_loc (loc
, code
, type
, fold_convert_loc (loc
, type
, t1
),
924 fold_convert_loc (loc
, type
, t2
));
927 /* Check whether TYPE1 and TYPE2 are equivalent integer types, suitable
928 for use in int_const_binop, size_binop and size_diffop. */
931 int_binop_types_match_p (enum tree_code code
, const_tree type1
, const_tree type2
)
933 if (!INTEGRAL_TYPE_P (type1
) && !POINTER_TYPE_P (type1
))
935 if (!INTEGRAL_TYPE_P (type2
) && !POINTER_TYPE_P (type2
))
950 return TYPE_UNSIGNED (type1
) == TYPE_UNSIGNED (type2
)
951 && TYPE_PRECISION (type1
) == TYPE_PRECISION (type2
)
952 && TYPE_MODE (type1
) == TYPE_MODE (type2
);
956 /* Combine two integer constants ARG1 and ARG2 under operation CODE
957 to produce a new constant. Return NULL_TREE if we don't know how
958 to evaluate CODE at compile-time. */
961 int_const_binop_1 (enum tree_code code
, const_tree arg1
, const_tree parg2
,
966 tree type
= TREE_TYPE (arg1
);
967 signop sign
= TYPE_SIGN (type
);
968 bool overflow
= false;
970 wide_int arg2
= wide_int::from (parg2
, TYPE_PRECISION (type
),
971 TYPE_SIGN (TREE_TYPE (parg2
)));
976 res
= wi::bit_or (arg1
, arg2
);
980 res
= wi::bit_xor (arg1
, arg2
);
984 res
= wi::bit_and (arg1
, arg2
);
989 if (wi::neg_p (arg2
))
992 if (code
== RSHIFT_EXPR
)
998 if (code
== RSHIFT_EXPR
)
999 /* It's unclear from the C standard whether shifts can overflow.
1000 The following code ignores overflow; perhaps a C standard
1001 interpretation ruling is needed. */
1002 res
= wi::rshift (arg1
, arg2
, sign
);
1004 res
= wi::lshift (arg1
, arg2
);
1009 if (wi::neg_p (arg2
))
1012 if (code
== RROTATE_EXPR
)
1013 code
= LROTATE_EXPR
;
1015 code
= RROTATE_EXPR
;
1018 if (code
== RROTATE_EXPR
)
1019 res
= wi::rrotate (arg1
, arg2
);
1021 res
= wi::lrotate (arg1
, arg2
);
1025 res
= wi::add (arg1
, arg2
, sign
, &overflow
);
1029 res
= wi::sub (arg1
, arg2
, sign
, &overflow
);
1033 res
= wi::mul (arg1
, arg2
, sign
, &overflow
);
1036 case MULT_HIGHPART_EXPR
:
1037 res
= wi::mul_high (arg1
, arg2
, sign
);
1040 case TRUNC_DIV_EXPR
:
1041 case EXACT_DIV_EXPR
:
1044 res
= wi::div_trunc (arg1
, arg2
, sign
, &overflow
);
1047 case FLOOR_DIV_EXPR
:
1050 res
= wi::div_floor (arg1
, arg2
, sign
, &overflow
);
1056 res
= wi::div_ceil (arg1
, arg2
, sign
, &overflow
);
1059 case ROUND_DIV_EXPR
:
1062 res
= wi::div_round (arg1
, arg2
, sign
, &overflow
);
1065 case TRUNC_MOD_EXPR
:
1068 res
= wi::mod_trunc (arg1
, arg2
, sign
, &overflow
);
1071 case FLOOR_MOD_EXPR
:
1074 res
= wi::mod_floor (arg1
, arg2
, sign
, &overflow
);
1080 res
= wi::mod_ceil (arg1
, arg2
, sign
, &overflow
);
1083 case ROUND_MOD_EXPR
:
1086 res
= wi::mod_round (arg1
, arg2
, sign
, &overflow
);
1090 res
= wi::min (arg1
, arg2
, sign
);
1094 res
= wi::max (arg1
, arg2
, sign
);
1101 t
= force_fit_type (type
, res
, overflowable
,
1102 (((sign
== SIGNED
|| overflowable
== -1)
1104 | TREE_OVERFLOW (arg1
) | TREE_OVERFLOW (parg2
)));
1110 int_const_binop (enum tree_code code
, const_tree arg1
, const_tree arg2
)
1112 return int_const_binop_1 (code
, arg1
, arg2
, 1);
1115 /* Combine two constants ARG1 and ARG2 under operation CODE to produce a new
1116 constant. We assume ARG1 and ARG2 have the same data type, or at least
1117 are the same kind of constant and the same machine mode. Return zero if
1118 combining the constants is not allowed in the current operating mode. */
1121 const_binop (enum tree_code code
, tree arg1
, tree arg2
)
1123 /* Sanity check for the recursive cases. */
1130 if (TREE_CODE (arg1
) == INTEGER_CST
&& TREE_CODE (arg2
) == INTEGER_CST
)
1132 if (code
== POINTER_PLUS_EXPR
)
1133 return int_const_binop (PLUS_EXPR
,
1134 arg1
, fold_convert (TREE_TYPE (arg1
), arg2
));
1136 return int_const_binop (code
, arg1
, arg2
);
1139 if (TREE_CODE (arg1
) == REAL_CST
&& TREE_CODE (arg2
) == REAL_CST
)
1144 REAL_VALUE_TYPE value
;
1145 REAL_VALUE_TYPE result
;
1149 /* The following codes are handled by real_arithmetic. */
1164 d1
= TREE_REAL_CST (arg1
);
1165 d2
= TREE_REAL_CST (arg2
);
1167 type
= TREE_TYPE (arg1
);
1168 mode
= TYPE_MODE (type
);
1170 /* Don't perform operation if we honor signaling NaNs and
1171 either operand is a NaN. */
1172 if (HONOR_SNANS (mode
)
1173 && (REAL_VALUE_ISNAN (d1
) || REAL_VALUE_ISNAN (d2
)))
1176 /* Don't perform operation if it would raise a division
1177 by zero exception. */
1178 if (code
== RDIV_EXPR
1179 && REAL_VALUES_EQUAL (d2
, dconst0
)
1180 && (flag_trapping_math
|| ! MODE_HAS_INFINITIES (mode
)))
1183 /* If either operand is a NaN, just return it. Otherwise, set up
1184 for floating-point trap; we return an overflow. */
1185 if (REAL_VALUE_ISNAN (d1
))
1187 else if (REAL_VALUE_ISNAN (d2
))
1190 inexact
= real_arithmetic (&value
, code
, &d1
, &d2
);
1191 real_convert (&result
, mode
, &value
);
1193 /* Don't constant fold this floating point operation if
1194 the result has overflowed and flag_trapping_math. */
1195 if (flag_trapping_math
1196 && MODE_HAS_INFINITIES (mode
)
1197 && REAL_VALUE_ISINF (result
)
1198 && !REAL_VALUE_ISINF (d1
)
1199 && !REAL_VALUE_ISINF (d2
))
1202 /* Don't constant fold this floating point operation if the
1203 result may dependent upon the run-time rounding mode and
1204 flag_rounding_math is set, or if GCC's software emulation
1205 is unable to accurately represent the result. */
1206 if ((flag_rounding_math
1207 || (MODE_COMPOSITE_P (mode
) && !flag_unsafe_math_optimizations
))
1208 && (inexact
|| !real_identical (&result
, &value
)))
1211 t
= build_real (type
, result
);
1213 TREE_OVERFLOW (t
) = TREE_OVERFLOW (arg1
) | TREE_OVERFLOW (arg2
);
1217 if (TREE_CODE (arg1
) == FIXED_CST
)
1219 FIXED_VALUE_TYPE f1
;
1220 FIXED_VALUE_TYPE f2
;
1221 FIXED_VALUE_TYPE result
;
1226 /* The following codes are handled by fixed_arithmetic. */
1232 case TRUNC_DIV_EXPR
:
1233 if (TREE_CODE (arg2
) != FIXED_CST
)
1235 f2
= TREE_FIXED_CST (arg2
);
1241 if (TREE_CODE (arg2
) != INTEGER_CST
)
1244 f2
.data
.high
= w2
.elt (1);
1245 f2
.data
.low
= w2
.elt (0);
1254 f1
= TREE_FIXED_CST (arg1
);
1255 type
= TREE_TYPE (arg1
);
1256 sat_p
= TYPE_SATURATING (type
);
1257 overflow_p
= fixed_arithmetic (&result
, code
, &f1
, &f2
, sat_p
);
1258 t
= build_fixed (type
, result
);
1259 /* Propagate overflow flags. */
1260 if (overflow_p
| TREE_OVERFLOW (arg1
) | TREE_OVERFLOW (arg2
))
1261 TREE_OVERFLOW (t
) = 1;
1265 if (TREE_CODE (arg1
) == COMPLEX_CST
&& TREE_CODE (arg2
) == COMPLEX_CST
)
1267 tree type
= TREE_TYPE (arg1
);
1268 tree r1
= TREE_REALPART (arg1
);
1269 tree i1
= TREE_IMAGPART (arg1
);
1270 tree r2
= TREE_REALPART (arg2
);
1271 tree i2
= TREE_IMAGPART (arg2
);
1278 real
= const_binop (code
, r1
, r2
);
1279 imag
= const_binop (code
, i1
, i2
);
1283 if (COMPLEX_FLOAT_TYPE_P (type
))
1284 return do_mpc_arg2 (arg1
, arg2
, type
,
1285 /* do_nonfinite= */ folding_initializer
,
1288 real
= const_binop (MINUS_EXPR
,
1289 const_binop (MULT_EXPR
, r1
, r2
),
1290 const_binop (MULT_EXPR
, i1
, i2
));
1291 imag
= const_binop (PLUS_EXPR
,
1292 const_binop (MULT_EXPR
, r1
, i2
),
1293 const_binop (MULT_EXPR
, i1
, r2
));
1297 if (COMPLEX_FLOAT_TYPE_P (type
))
1298 return do_mpc_arg2 (arg1
, arg2
, type
,
1299 /* do_nonfinite= */ folding_initializer
,
1302 case TRUNC_DIV_EXPR
:
1304 case FLOOR_DIV_EXPR
:
1305 case ROUND_DIV_EXPR
:
1306 if (flag_complex_method
== 0)
1308 /* Keep this algorithm in sync with
1309 tree-complex.c:expand_complex_div_straight().
1311 Expand complex division to scalars, straightforward algorithm.
1312 a / b = ((ar*br + ai*bi)/t) + i((ai*br - ar*bi)/t)
1316 = const_binop (PLUS_EXPR
,
1317 const_binop (MULT_EXPR
, r2
, r2
),
1318 const_binop (MULT_EXPR
, i2
, i2
));
1320 = const_binop (PLUS_EXPR
,
1321 const_binop (MULT_EXPR
, r1
, r2
),
1322 const_binop (MULT_EXPR
, i1
, i2
));
1324 = const_binop (MINUS_EXPR
,
1325 const_binop (MULT_EXPR
, i1
, r2
),
1326 const_binop (MULT_EXPR
, r1
, i2
));
1328 real
= const_binop (code
, t1
, magsquared
);
1329 imag
= const_binop (code
, t2
, magsquared
);
1333 /* Keep this algorithm in sync with
1334 tree-complex.c:expand_complex_div_wide().
1336 Expand complex division to scalars, modified algorithm to minimize
1337 overflow with wide input ranges. */
1338 tree compare
= fold_build2 (LT_EXPR
, boolean_type_node
,
1339 fold_abs_const (r2
, TREE_TYPE (type
)),
1340 fold_abs_const (i2
, TREE_TYPE (type
)));
1342 if (integer_nonzerop (compare
))
1344 /* In the TRUE branch, we compute
1346 div = (br * ratio) + bi;
1347 tr = (ar * ratio) + ai;
1348 ti = (ai * ratio) - ar;
1351 tree ratio
= const_binop (code
, r2
, i2
);
1352 tree div
= const_binop (PLUS_EXPR
, i2
,
1353 const_binop (MULT_EXPR
, r2
, ratio
));
1354 real
= const_binop (MULT_EXPR
, r1
, ratio
);
1355 real
= const_binop (PLUS_EXPR
, real
, i1
);
1356 real
= const_binop (code
, real
, div
);
1358 imag
= const_binop (MULT_EXPR
, i1
, ratio
);
1359 imag
= const_binop (MINUS_EXPR
, imag
, r1
);
1360 imag
= const_binop (code
, imag
, div
);
1364 /* In the FALSE branch, we compute
1366 divisor = (d * ratio) + c;
1367 tr = (b * ratio) + a;
1368 ti = b - (a * ratio);
1371 tree ratio
= const_binop (code
, i2
, r2
);
1372 tree div
= const_binop (PLUS_EXPR
, r2
,
1373 const_binop (MULT_EXPR
, i2
, ratio
));
1375 real
= const_binop (MULT_EXPR
, i1
, ratio
);
1376 real
= const_binop (PLUS_EXPR
, real
, r1
);
1377 real
= const_binop (code
, real
, div
);
1379 imag
= const_binop (MULT_EXPR
, r1
, ratio
);
1380 imag
= const_binop (MINUS_EXPR
, i1
, imag
);
1381 imag
= const_binop (code
, imag
, div
);
1391 return build_complex (type
, real
, imag
);
1394 if (TREE_CODE (arg1
) == VECTOR_CST
1395 && TREE_CODE (arg2
) == VECTOR_CST
)
1397 tree type
= TREE_TYPE (arg1
);
1398 int count
= TYPE_VECTOR_SUBPARTS (type
), i
;
1399 tree
*elts
= XALLOCAVEC (tree
, count
);
1401 for (i
= 0; i
< count
; i
++)
1403 tree elem1
= VECTOR_CST_ELT (arg1
, i
);
1404 tree elem2
= VECTOR_CST_ELT (arg2
, i
);
1406 elts
[i
] = const_binop (code
, elem1
, elem2
);
1408 /* It is possible that const_binop cannot handle the given
1409 code and return NULL_TREE */
1410 if (elts
[i
] == NULL_TREE
)
1414 return build_vector (type
, elts
);
1417 /* Shifts allow a scalar offset for a vector. */
1418 if (TREE_CODE (arg1
) == VECTOR_CST
1419 && TREE_CODE (arg2
) == INTEGER_CST
)
1421 tree type
= TREE_TYPE (arg1
);
1422 int count
= TYPE_VECTOR_SUBPARTS (type
), i
;
1423 tree
*elts
= XALLOCAVEC (tree
, count
);
1425 for (i
= 0; i
< count
; i
++)
1427 tree elem1
= VECTOR_CST_ELT (arg1
, i
);
1429 elts
[i
] = const_binop (code
, elem1
, arg2
);
1431 /* It is possible that const_binop cannot handle the given
1432 code and return NULL_TREE. */
1433 if (elts
[i
] == NULL_TREE
)
1437 return build_vector (type
, elts
);
1442 /* Overload that adds a TYPE parameter to be able to dispatch
1443 to fold_relational_const. */
1446 const_binop (enum tree_code code
, tree type
, tree arg1
, tree arg2
)
1448 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
1449 return fold_relational_const (code
, type
, arg1
, arg2
);
1451 /* ??? Until we make the const_binop worker take the type of the
1452 result as argument put those cases that need it here. */
1456 if ((TREE_CODE (arg1
) == REAL_CST
1457 && TREE_CODE (arg2
) == REAL_CST
)
1458 || (TREE_CODE (arg1
) == INTEGER_CST
1459 && TREE_CODE (arg2
) == INTEGER_CST
))
1460 return build_complex (type
, arg1
, arg2
);
1463 case VEC_PACK_TRUNC_EXPR
:
1464 case VEC_PACK_FIX_TRUNC_EXPR
:
1466 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (type
), i
;
1469 gcc_assert (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg1
)) == nelts
/ 2
1470 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg2
)) == nelts
/ 2);
1471 if (TREE_CODE (arg1
) != VECTOR_CST
1472 || TREE_CODE (arg2
) != VECTOR_CST
)
1475 elts
= XALLOCAVEC (tree
, nelts
);
1476 if (!vec_cst_ctor_to_array (arg1
, elts
)
1477 || !vec_cst_ctor_to_array (arg2
, elts
+ nelts
/ 2))
1480 for (i
= 0; i
< nelts
; i
++)
1482 elts
[i
] = fold_convert_const (code
== VEC_PACK_TRUNC_EXPR
1483 ? NOP_EXPR
: FIX_TRUNC_EXPR
,
1484 TREE_TYPE (type
), elts
[i
]);
1485 if (elts
[i
] == NULL_TREE
|| !CONSTANT_CLASS_P (elts
[i
]))
1489 return build_vector (type
, elts
);
1492 case VEC_WIDEN_MULT_LO_EXPR
:
1493 case VEC_WIDEN_MULT_HI_EXPR
:
1494 case VEC_WIDEN_MULT_EVEN_EXPR
:
1495 case VEC_WIDEN_MULT_ODD_EXPR
:
1497 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (type
);
1498 unsigned int out
, ofs
, scale
;
1501 gcc_assert (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg1
)) == nelts
* 2
1502 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg2
)) == nelts
* 2);
1503 if (TREE_CODE (arg1
) != VECTOR_CST
|| TREE_CODE (arg2
) != VECTOR_CST
)
1506 elts
= XALLOCAVEC (tree
, nelts
* 4);
1507 if (!vec_cst_ctor_to_array (arg1
, elts
)
1508 || !vec_cst_ctor_to_array (arg2
, elts
+ nelts
* 2))
1511 if (code
== VEC_WIDEN_MULT_LO_EXPR
)
1512 scale
= 0, ofs
= BYTES_BIG_ENDIAN
? nelts
: 0;
1513 else if (code
== VEC_WIDEN_MULT_HI_EXPR
)
1514 scale
= 0, ofs
= BYTES_BIG_ENDIAN
? 0 : nelts
;
1515 else if (code
== VEC_WIDEN_MULT_EVEN_EXPR
)
1517 else /* if (code == VEC_WIDEN_MULT_ODD_EXPR) */
1520 for (out
= 0; out
< nelts
; out
++)
1522 unsigned int in1
= (out
<< scale
) + ofs
;
1523 unsigned int in2
= in1
+ nelts
* 2;
1526 t1
= fold_convert_const (NOP_EXPR
, TREE_TYPE (type
), elts
[in1
]);
1527 t2
= fold_convert_const (NOP_EXPR
, TREE_TYPE (type
), elts
[in2
]);
1529 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
1531 elts
[out
] = const_binop (MULT_EXPR
, t1
, t2
);
1532 if (elts
[out
] == NULL_TREE
|| !CONSTANT_CLASS_P (elts
[out
]))
1536 return build_vector (type
, elts
);
1542 if (TREE_CODE_CLASS (code
) != tcc_binary
)
1545 /* Make sure type and arg0 have the same saturating flag. */
1546 gcc_checking_assert (TYPE_SATURATING (type
)
1547 == TYPE_SATURATING (TREE_TYPE (arg1
)));
1549 return const_binop (code
, arg1
, arg2
);
1552 /* Compute CODE ARG1 with resulting type TYPE with ARG1 being constant.
1553 Return zero if computing the constants is not possible. */
1556 const_unop (enum tree_code code
, tree type
, tree arg0
)
1562 case FIX_TRUNC_EXPR
:
1563 case FIXED_CONVERT_EXPR
:
1564 return fold_convert_const (code
, type
, arg0
);
1566 case ADDR_SPACE_CONVERT_EXPR
:
1567 if (integer_zerop (arg0
))
1568 return fold_convert_const (code
, type
, arg0
);
1571 case VIEW_CONVERT_EXPR
:
1572 return fold_view_convert_expr (type
, arg0
);
1576 /* Can't call fold_negate_const directly here as that doesn't
1577 handle all cases and we might not be able to negate some
1579 tree tem
= fold_negate_expr (UNKNOWN_LOCATION
, arg0
);
1580 if (tem
&& CONSTANT_CLASS_P (tem
))
1586 if (TREE_CODE (arg0
) == INTEGER_CST
|| TREE_CODE (arg0
) == REAL_CST
)
1587 return fold_abs_const (arg0
, type
);
1591 if (TREE_CODE (arg0
) == COMPLEX_CST
)
1593 tree ipart
= fold_negate_const (TREE_IMAGPART (arg0
),
1595 return build_complex (type
, TREE_REALPART (arg0
), ipart
);
1600 if (TREE_CODE (arg0
) == INTEGER_CST
)
1601 return fold_not_const (arg0
, type
);
1602 /* Perform BIT_NOT_EXPR on each element individually. */
1603 else if (TREE_CODE (arg0
) == VECTOR_CST
)
1607 unsigned count
= VECTOR_CST_NELTS (arg0
), i
;
1609 elements
= XALLOCAVEC (tree
, count
);
1610 for (i
= 0; i
< count
; i
++)
1612 elem
= VECTOR_CST_ELT (arg0
, i
);
1613 elem
= const_unop (BIT_NOT_EXPR
, TREE_TYPE (type
), elem
);
1614 if (elem
== NULL_TREE
)
1619 return build_vector (type
, elements
);
1623 case TRUTH_NOT_EXPR
:
1624 if (TREE_CODE (arg0
) == INTEGER_CST
)
1625 return constant_boolean_node (integer_zerop (arg0
), type
);
1629 if (TREE_CODE (arg0
) == COMPLEX_CST
)
1630 return fold_convert (type
, TREE_REALPART (arg0
));
1634 if (TREE_CODE (arg0
) == COMPLEX_CST
)
1635 return fold_convert (type
, TREE_IMAGPART (arg0
));
1638 case VEC_UNPACK_LO_EXPR
:
1639 case VEC_UNPACK_HI_EXPR
:
1640 case VEC_UNPACK_FLOAT_LO_EXPR
:
1641 case VEC_UNPACK_FLOAT_HI_EXPR
:
1643 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (type
), i
;
1645 enum tree_code subcode
;
1647 gcc_assert (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0
)) == nelts
* 2);
1648 if (TREE_CODE (arg0
) != VECTOR_CST
)
1651 elts
= XALLOCAVEC (tree
, nelts
* 2);
1652 if (!vec_cst_ctor_to_array (arg0
, elts
))
1655 if ((!BYTES_BIG_ENDIAN
) ^ (code
== VEC_UNPACK_LO_EXPR
1656 || code
== VEC_UNPACK_FLOAT_LO_EXPR
))
1659 if (code
== VEC_UNPACK_LO_EXPR
|| code
== VEC_UNPACK_HI_EXPR
)
1662 subcode
= FLOAT_EXPR
;
1664 for (i
= 0; i
< nelts
; i
++)
1666 elts
[i
] = fold_convert_const (subcode
, TREE_TYPE (type
), elts
[i
]);
1667 if (elts
[i
] == NULL_TREE
|| !CONSTANT_CLASS_P (elts
[i
]))
1671 return build_vector (type
, elts
);
1674 case REDUC_MIN_EXPR
:
1675 case REDUC_MAX_EXPR
:
1676 case REDUC_PLUS_EXPR
:
1678 unsigned int nelts
, i
;
1680 enum tree_code subcode
;
1682 if (TREE_CODE (arg0
) != VECTOR_CST
)
1684 nelts
= TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0
));
1686 elts
= XALLOCAVEC (tree
, nelts
);
1687 if (!vec_cst_ctor_to_array (arg0
, elts
))
1692 case REDUC_MIN_EXPR
: subcode
= MIN_EXPR
; break;
1693 case REDUC_MAX_EXPR
: subcode
= MAX_EXPR
; break;
1694 case REDUC_PLUS_EXPR
: subcode
= PLUS_EXPR
; break;
1695 default: gcc_unreachable ();
1698 for (i
= 1; i
< nelts
; i
++)
1700 elts
[0] = const_binop (subcode
, elts
[0], elts
[i
]);
1701 if (elts
[0] == NULL_TREE
|| !CONSTANT_CLASS_P (elts
[0]))
1715 /* Create a sizetype INT_CST node with NUMBER sign extended. KIND
1716 indicates which particular sizetype to create. */
1719 size_int_kind (HOST_WIDE_INT number
, enum size_type_kind kind
)
1721 return build_int_cst (sizetype_tab
[(int) kind
], number
);
1724 /* Combine operands OP1 and OP2 with arithmetic operation CODE. CODE
1725 is a tree code. The type of the result is taken from the operands.
1726 Both must be equivalent integer types, ala int_binop_types_match_p.
1727 If the operands are constant, so is the result. */
1730 size_binop_loc (location_t loc
, enum tree_code code
, tree arg0
, tree arg1
)
1732 tree type
= TREE_TYPE (arg0
);
1734 if (arg0
== error_mark_node
|| arg1
== error_mark_node
)
1735 return error_mark_node
;
1737 gcc_assert (int_binop_types_match_p (code
, TREE_TYPE (arg0
),
1740 /* Handle the special case of two integer constants faster. */
1741 if (TREE_CODE (arg0
) == INTEGER_CST
&& TREE_CODE (arg1
) == INTEGER_CST
)
1743 /* And some specific cases even faster than that. */
1744 if (code
== PLUS_EXPR
)
1746 if (integer_zerop (arg0
) && !TREE_OVERFLOW (arg0
))
1748 if (integer_zerop (arg1
) && !TREE_OVERFLOW (arg1
))
1751 else if (code
== MINUS_EXPR
)
1753 if (integer_zerop (arg1
) && !TREE_OVERFLOW (arg1
))
1756 else if (code
== MULT_EXPR
)
1758 if (integer_onep (arg0
) && !TREE_OVERFLOW (arg0
))
1762 /* Handle general case of two integer constants. For sizetype
1763 constant calculations we always want to know about overflow,
1764 even in the unsigned case. */
1765 return int_const_binop_1 (code
, arg0
, arg1
, -1);
1768 return fold_build2_loc (loc
, code
, type
, arg0
, arg1
);
1771 /* Given two values, either both of sizetype or both of bitsizetype,
1772 compute the difference between the two values. Return the value
1773 in signed type corresponding to the type of the operands. */
1776 size_diffop_loc (location_t loc
, tree arg0
, tree arg1
)
1778 tree type
= TREE_TYPE (arg0
);
1781 gcc_assert (int_binop_types_match_p (MINUS_EXPR
, TREE_TYPE (arg0
),
1784 /* If the type is already signed, just do the simple thing. */
1785 if (!TYPE_UNSIGNED (type
))
1786 return size_binop_loc (loc
, MINUS_EXPR
, arg0
, arg1
);
1788 if (type
== sizetype
)
1790 else if (type
== bitsizetype
)
1791 ctype
= sbitsizetype
;
1793 ctype
= signed_type_for (type
);
1795 /* If either operand is not a constant, do the conversions to the signed
1796 type and subtract. The hardware will do the right thing with any
1797 overflow in the subtraction. */
1798 if (TREE_CODE (arg0
) != INTEGER_CST
|| TREE_CODE (arg1
) != INTEGER_CST
)
1799 return size_binop_loc (loc
, MINUS_EXPR
,
1800 fold_convert_loc (loc
, ctype
, arg0
),
1801 fold_convert_loc (loc
, ctype
, arg1
));
1803 /* If ARG0 is larger than ARG1, subtract and return the result in CTYPE.
1804 Otherwise, subtract the other way, convert to CTYPE (we know that can't
1805 overflow) and negate (which can't either). Special-case a result
1806 of zero while we're here. */
1807 if (tree_int_cst_equal (arg0
, arg1
))
1808 return build_int_cst (ctype
, 0);
1809 else if (tree_int_cst_lt (arg1
, arg0
))
1810 return fold_convert_loc (loc
, ctype
,
1811 size_binop_loc (loc
, MINUS_EXPR
, arg0
, arg1
));
1813 return size_binop_loc (loc
, MINUS_EXPR
, build_int_cst (ctype
, 0),
1814 fold_convert_loc (loc
, ctype
,
1815 size_binop_loc (loc
,
1820 /* A subroutine of fold_convert_const handling conversions of an
1821 INTEGER_CST to another integer type. */
1824 fold_convert_const_int_from_int (tree type
, const_tree arg1
)
1826 /* Given an integer constant, make new constant with new type,
1827 appropriately sign-extended or truncated. Use widest_int
1828 so that any extension is done according ARG1's type. */
1829 return force_fit_type (type
, wi::to_widest (arg1
),
1830 !POINTER_TYPE_P (TREE_TYPE (arg1
)),
1831 TREE_OVERFLOW (arg1
));
1834 /* A subroutine of fold_convert_const handling conversions a REAL_CST
1835 to an integer type. */
1838 fold_convert_const_int_from_real (enum tree_code code
, tree type
, const_tree arg1
)
1840 bool overflow
= false;
1843 /* The following code implements the floating point to integer
1844 conversion rules required by the Java Language Specification,
1845 that IEEE NaNs are mapped to zero and values that overflow
1846 the target precision saturate, i.e. values greater than
1847 INT_MAX are mapped to INT_MAX, and values less than INT_MIN
1848 are mapped to INT_MIN. These semantics are allowed by the
1849 C and C++ standards that simply state that the behavior of
1850 FP-to-integer conversion is unspecified upon overflow. */
1854 REAL_VALUE_TYPE x
= TREE_REAL_CST (arg1
);
1858 case FIX_TRUNC_EXPR
:
1859 real_trunc (&r
, VOIDmode
, &x
);
1866 /* If R is NaN, return zero and show we have an overflow. */
1867 if (REAL_VALUE_ISNAN (r
))
1870 val
= wi::zero (TYPE_PRECISION (type
));
1873 /* See if R is less than the lower bound or greater than the
1878 tree lt
= TYPE_MIN_VALUE (type
);
1879 REAL_VALUE_TYPE l
= real_value_from_int_cst (NULL_TREE
, lt
);
1880 if (REAL_VALUES_LESS (r
, l
))
1889 tree ut
= TYPE_MAX_VALUE (type
);
1892 REAL_VALUE_TYPE u
= real_value_from_int_cst (NULL_TREE
, ut
);
1893 if (REAL_VALUES_LESS (u
, r
))
1902 val
= real_to_integer (&r
, &overflow
, TYPE_PRECISION (type
));
1904 t
= force_fit_type (type
, val
, -1, overflow
| TREE_OVERFLOW (arg1
));
1908 /* A subroutine of fold_convert_const handling conversions of a
1909 FIXED_CST to an integer type. */
1912 fold_convert_const_int_from_fixed (tree type
, const_tree arg1
)
1915 double_int temp
, temp_trunc
;
1918 /* Right shift FIXED_CST to temp by fbit. */
1919 temp
= TREE_FIXED_CST (arg1
).data
;
1920 mode
= TREE_FIXED_CST (arg1
).mode
;
1921 if (GET_MODE_FBIT (mode
) < HOST_BITS_PER_DOUBLE_INT
)
1923 temp
= temp
.rshift (GET_MODE_FBIT (mode
),
1924 HOST_BITS_PER_DOUBLE_INT
,
1925 SIGNED_FIXED_POINT_MODE_P (mode
));
1927 /* Left shift temp to temp_trunc by fbit. */
1928 temp_trunc
= temp
.lshift (GET_MODE_FBIT (mode
),
1929 HOST_BITS_PER_DOUBLE_INT
,
1930 SIGNED_FIXED_POINT_MODE_P (mode
));
1934 temp
= double_int_zero
;
1935 temp_trunc
= double_int_zero
;
1938 /* If FIXED_CST is negative, we need to round the value toward 0.
1939 By checking if the fractional bits are not zero to add 1 to temp. */
1940 if (SIGNED_FIXED_POINT_MODE_P (mode
)
1941 && temp_trunc
.is_negative ()
1942 && TREE_FIXED_CST (arg1
).data
!= temp_trunc
)
1943 temp
+= double_int_one
;
1945 /* Given a fixed-point constant, make new constant with new type,
1946 appropriately sign-extended or truncated. */
1947 t
= force_fit_type (type
, temp
, -1,
1948 (temp
.is_negative ()
1949 && (TYPE_UNSIGNED (type
)
1950 < TYPE_UNSIGNED (TREE_TYPE (arg1
))))
1951 | TREE_OVERFLOW (arg1
));
1956 /* A subroutine of fold_convert_const handling conversions a REAL_CST
1957 to another floating point type. */
1960 fold_convert_const_real_from_real (tree type
, const_tree arg1
)
1962 REAL_VALUE_TYPE value
;
1965 real_convert (&value
, TYPE_MODE (type
), &TREE_REAL_CST (arg1
));
1966 t
= build_real (type
, value
);
1968 /* If converting an infinity or NAN to a representation that doesn't
1969 have one, set the overflow bit so that we can produce some kind of
1970 error message at the appropriate point if necessary. It's not the
1971 most user-friendly message, but it's better than nothing. */
1972 if (REAL_VALUE_ISINF (TREE_REAL_CST (arg1
))
1973 && !MODE_HAS_INFINITIES (TYPE_MODE (type
)))
1974 TREE_OVERFLOW (t
) = 1;
1975 else if (REAL_VALUE_ISNAN (TREE_REAL_CST (arg1
))
1976 && !MODE_HAS_NANS (TYPE_MODE (type
)))
1977 TREE_OVERFLOW (t
) = 1;
1978 /* Regular overflow, conversion produced an infinity in a mode that
1979 can't represent them. */
1980 else if (!MODE_HAS_INFINITIES (TYPE_MODE (type
))
1981 && REAL_VALUE_ISINF (value
)
1982 && !REAL_VALUE_ISINF (TREE_REAL_CST (arg1
)))
1983 TREE_OVERFLOW (t
) = 1;
1985 TREE_OVERFLOW (t
) = TREE_OVERFLOW (arg1
);
1989 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
1990 to a floating point type. */
1993 fold_convert_const_real_from_fixed (tree type
, const_tree arg1
)
1995 REAL_VALUE_TYPE value
;
1998 real_convert_from_fixed (&value
, TYPE_MODE (type
), &TREE_FIXED_CST (arg1
));
1999 t
= build_real (type
, value
);
2001 TREE_OVERFLOW (t
) = TREE_OVERFLOW (arg1
);
2005 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2006 to another fixed-point type. */
2009 fold_convert_const_fixed_from_fixed (tree type
, const_tree arg1
)
2011 FIXED_VALUE_TYPE value
;
2015 overflow_p
= fixed_convert (&value
, TYPE_MODE (type
), &TREE_FIXED_CST (arg1
),
2016 TYPE_SATURATING (type
));
2017 t
= build_fixed (type
, value
);
2019 /* Propagate overflow flags. */
2020 if (overflow_p
| TREE_OVERFLOW (arg1
))
2021 TREE_OVERFLOW (t
) = 1;
2025 /* A subroutine of fold_convert_const handling conversions an INTEGER_CST
2026 to a fixed-point type. */
2029 fold_convert_const_fixed_from_int (tree type
, const_tree arg1
)
2031 FIXED_VALUE_TYPE value
;
2036 gcc_assert (TREE_INT_CST_NUNITS (arg1
) <= 2);
2038 di
.low
= TREE_INT_CST_ELT (arg1
, 0);
2039 if (TREE_INT_CST_NUNITS (arg1
) == 1)
2040 di
.high
= (HOST_WIDE_INT
) di
.low
< 0 ? (HOST_WIDE_INT
) -1 : 0;
2042 di
.high
= TREE_INT_CST_ELT (arg1
, 1);
2044 overflow_p
= fixed_convert_from_int (&value
, TYPE_MODE (type
), di
,
2045 TYPE_UNSIGNED (TREE_TYPE (arg1
)),
2046 TYPE_SATURATING (type
));
2047 t
= build_fixed (type
, value
);
2049 /* Propagate overflow flags. */
2050 if (overflow_p
| TREE_OVERFLOW (arg1
))
2051 TREE_OVERFLOW (t
) = 1;
2055 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2056 to a fixed-point type. */
2059 fold_convert_const_fixed_from_real (tree type
, const_tree arg1
)
2061 FIXED_VALUE_TYPE value
;
2065 overflow_p
= fixed_convert_from_real (&value
, TYPE_MODE (type
),
2066 &TREE_REAL_CST (arg1
),
2067 TYPE_SATURATING (type
));
2068 t
= build_fixed (type
, value
);
2070 /* Propagate overflow flags. */
2071 if (overflow_p
| TREE_OVERFLOW (arg1
))
2072 TREE_OVERFLOW (t
) = 1;
2076 /* Attempt to fold type conversion operation CODE of expression ARG1 to
2077 type TYPE. If no simplification can be done return NULL_TREE. */
2080 fold_convert_const (enum tree_code code
, tree type
, tree arg1
)
2082 if (TREE_TYPE (arg1
) == type
)
2085 if (POINTER_TYPE_P (type
) || INTEGRAL_TYPE_P (type
)
2086 || TREE_CODE (type
) == OFFSET_TYPE
)
2088 if (TREE_CODE (arg1
) == INTEGER_CST
)
2089 return fold_convert_const_int_from_int (type
, arg1
);
2090 else if (TREE_CODE (arg1
) == REAL_CST
)
2091 return fold_convert_const_int_from_real (code
, type
, arg1
);
2092 else if (TREE_CODE (arg1
) == FIXED_CST
)
2093 return fold_convert_const_int_from_fixed (type
, arg1
);
2095 else if (TREE_CODE (type
) == REAL_TYPE
)
2097 if (TREE_CODE (arg1
) == INTEGER_CST
)
2098 return build_real_from_int_cst (type
, arg1
);
2099 else if (TREE_CODE (arg1
) == REAL_CST
)
2100 return fold_convert_const_real_from_real (type
, arg1
);
2101 else if (TREE_CODE (arg1
) == FIXED_CST
)
2102 return fold_convert_const_real_from_fixed (type
, arg1
);
2104 else if (TREE_CODE (type
) == FIXED_POINT_TYPE
)
2106 if (TREE_CODE (arg1
) == FIXED_CST
)
2107 return fold_convert_const_fixed_from_fixed (type
, arg1
);
2108 else if (TREE_CODE (arg1
) == INTEGER_CST
)
2109 return fold_convert_const_fixed_from_int (type
, arg1
);
2110 else if (TREE_CODE (arg1
) == REAL_CST
)
2111 return fold_convert_const_fixed_from_real (type
, arg1
);
2116 /* Construct a vector of zero elements of vector type TYPE. */
2119 build_zero_vector (tree type
)
2123 t
= fold_convert_const (NOP_EXPR
, TREE_TYPE (type
), integer_zero_node
);
2124 return build_vector_from_val (type
, t
);
2127 /* Returns true, if ARG is convertible to TYPE using a NOP_EXPR. */
2130 fold_convertible_p (const_tree type
, const_tree arg
)
2132 tree orig
= TREE_TYPE (arg
);
2137 if (TREE_CODE (arg
) == ERROR_MARK
2138 || TREE_CODE (type
) == ERROR_MARK
2139 || TREE_CODE (orig
) == ERROR_MARK
)
2142 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (orig
))
2145 switch (TREE_CODE (type
))
2147 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2148 case POINTER_TYPE
: case REFERENCE_TYPE
:
2150 if (INTEGRAL_TYPE_P (orig
) || POINTER_TYPE_P (orig
)
2151 || TREE_CODE (orig
) == OFFSET_TYPE
)
2153 return (TREE_CODE (orig
) == VECTOR_TYPE
2154 && tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (orig
)));
2157 case FIXED_POINT_TYPE
:
2161 return TREE_CODE (type
) == TREE_CODE (orig
);
2168 /* Convert expression ARG to type TYPE. Used by the middle-end for
2169 simple conversions in preference to calling the front-end's convert. */
2172 fold_convert_loc (location_t loc
, tree type
, tree arg
)
2174 tree orig
= TREE_TYPE (arg
);
2180 if (TREE_CODE (arg
) == ERROR_MARK
2181 || TREE_CODE (type
) == ERROR_MARK
2182 || TREE_CODE (orig
) == ERROR_MARK
)
2183 return error_mark_node
;
2185 switch (TREE_CODE (type
))
2188 case REFERENCE_TYPE
:
2189 /* Handle conversions between pointers to different address spaces. */
2190 if (POINTER_TYPE_P (orig
)
2191 && (TYPE_ADDR_SPACE (TREE_TYPE (type
))
2192 != TYPE_ADDR_SPACE (TREE_TYPE (orig
))))
2193 return fold_build1_loc (loc
, ADDR_SPACE_CONVERT_EXPR
, type
, arg
);
2196 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2198 if (TREE_CODE (arg
) == INTEGER_CST
)
2200 tem
= fold_convert_const (NOP_EXPR
, type
, arg
);
2201 if (tem
!= NULL_TREE
)
2204 if (INTEGRAL_TYPE_P (orig
) || POINTER_TYPE_P (orig
)
2205 || TREE_CODE (orig
) == OFFSET_TYPE
)
2206 return fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
2207 if (TREE_CODE (orig
) == COMPLEX_TYPE
)
2208 return fold_convert_loc (loc
, type
,
2209 fold_build1_loc (loc
, REALPART_EXPR
,
2210 TREE_TYPE (orig
), arg
));
2211 gcc_assert (TREE_CODE (orig
) == VECTOR_TYPE
2212 && tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (orig
)));
2213 return fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
2216 if (TREE_CODE (arg
) == INTEGER_CST
)
2218 tem
= fold_convert_const (FLOAT_EXPR
, type
, arg
);
2219 if (tem
!= NULL_TREE
)
2222 else if (TREE_CODE (arg
) == REAL_CST
)
2224 tem
= fold_convert_const (NOP_EXPR
, type
, arg
);
2225 if (tem
!= NULL_TREE
)
2228 else if (TREE_CODE (arg
) == FIXED_CST
)
2230 tem
= fold_convert_const (FIXED_CONVERT_EXPR
, type
, arg
);
2231 if (tem
!= NULL_TREE
)
2235 switch (TREE_CODE (orig
))
2238 case BOOLEAN_TYPE
: case ENUMERAL_TYPE
:
2239 case POINTER_TYPE
: case REFERENCE_TYPE
:
2240 return fold_build1_loc (loc
, FLOAT_EXPR
, type
, arg
);
2243 return fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
2245 case FIXED_POINT_TYPE
:
2246 return fold_build1_loc (loc
, FIXED_CONVERT_EXPR
, type
, arg
);
2249 tem
= fold_build1_loc (loc
, REALPART_EXPR
, TREE_TYPE (orig
), arg
);
2250 return fold_convert_loc (loc
, type
, tem
);
2256 case FIXED_POINT_TYPE
:
2257 if (TREE_CODE (arg
) == FIXED_CST
|| TREE_CODE (arg
) == INTEGER_CST
2258 || TREE_CODE (arg
) == REAL_CST
)
2260 tem
= fold_convert_const (FIXED_CONVERT_EXPR
, type
, arg
);
2261 if (tem
!= NULL_TREE
)
2262 goto fold_convert_exit
;
2265 switch (TREE_CODE (orig
))
2267 case FIXED_POINT_TYPE
:
2272 return fold_build1_loc (loc
, FIXED_CONVERT_EXPR
, type
, arg
);
2275 tem
= fold_build1_loc (loc
, REALPART_EXPR
, TREE_TYPE (orig
), arg
);
2276 return fold_convert_loc (loc
, type
, tem
);
2283 switch (TREE_CODE (orig
))
2286 case BOOLEAN_TYPE
: case ENUMERAL_TYPE
:
2287 case POINTER_TYPE
: case REFERENCE_TYPE
:
2289 case FIXED_POINT_TYPE
:
2290 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
2291 fold_convert_loc (loc
, TREE_TYPE (type
), arg
),
2292 fold_convert_loc (loc
, TREE_TYPE (type
),
2293 integer_zero_node
));
2298 if (TREE_CODE (arg
) == COMPLEX_EXPR
)
2300 rpart
= fold_convert_loc (loc
, TREE_TYPE (type
),
2301 TREE_OPERAND (arg
, 0));
2302 ipart
= fold_convert_loc (loc
, TREE_TYPE (type
),
2303 TREE_OPERAND (arg
, 1));
2304 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rpart
, ipart
);
2307 arg
= save_expr (arg
);
2308 rpart
= fold_build1_loc (loc
, REALPART_EXPR
, TREE_TYPE (orig
), arg
);
2309 ipart
= fold_build1_loc (loc
, IMAGPART_EXPR
, TREE_TYPE (orig
), arg
);
2310 rpart
= fold_convert_loc (loc
, TREE_TYPE (type
), rpart
);
2311 ipart
= fold_convert_loc (loc
, TREE_TYPE (type
), ipart
);
2312 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rpart
, ipart
);
2320 if (integer_zerop (arg
))
2321 return build_zero_vector (type
);
2322 gcc_assert (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (orig
)));
2323 gcc_assert (INTEGRAL_TYPE_P (orig
) || POINTER_TYPE_P (orig
)
2324 || TREE_CODE (orig
) == VECTOR_TYPE
);
2325 return fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, type
, arg
);
2328 tem
= fold_ignored_result (arg
);
2329 return fold_build1_loc (loc
, NOP_EXPR
, type
, tem
);
2332 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (orig
))
2333 return fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
2337 protected_set_expr_location_unshare (tem
, loc
);
2341 /* Return false if expr can be assumed not to be an lvalue, true
2345 maybe_lvalue_p (const_tree x
)
2347 /* We only need to wrap lvalue tree codes. */
2348 switch (TREE_CODE (x
))
2361 case ARRAY_RANGE_REF
:
2367 case PREINCREMENT_EXPR
:
2368 case PREDECREMENT_EXPR
:
2370 case TRY_CATCH_EXPR
:
2371 case WITH_CLEANUP_EXPR
:
2380 /* Assume the worst for front-end tree codes. */
2381 if ((int)TREE_CODE (x
) >= NUM_TREE_CODES
)
2389 /* Return an expr equal to X but certainly not valid as an lvalue. */
2392 non_lvalue_loc (location_t loc
, tree x
)
2394 /* While we are in GIMPLE, NON_LVALUE_EXPR doesn't mean anything to
2399 if (! maybe_lvalue_p (x
))
2401 return build1_loc (loc
, NON_LVALUE_EXPR
, TREE_TYPE (x
), x
);
2404 /* When pedantic, return an expr equal to X but certainly not valid as a
2405 pedantic lvalue. Otherwise, return X. */
2408 pedantic_non_lvalue_loc (location_t loc
, tree x
)
2410 return protected_set_expr_location_unshare (x
, loc
);
2413 /* Given a tree comparison code, return the code that is the logical inverse.
2414 It is generally not safe to do this for floating-point comparisons, except
2415 for EQ_EXPR, NE_EXPR, ORDERED_EXPR and UNORDERED_EXPR, so we return
2416 ERROR_MARK in this case. */
2419 invert_tree_comparison (enum tree_code code
, bool honor_nans
)
2421 if (honor_nans
&& flag_trapping_math
&& code
!= EQ_EXPR
&& code
!= NE_EXPR
2422 && code
!= ORDERED_EXPR
&& code
!= UNORDERED_EXPR
)
2432 return honor_nans
? UNLE_EXPR
: LE_EXPR
;
2434 return honor_nans
? UNLT_EXPR
: LT_EXPR
;
2436 return honor_nans
? UNGE_EXPR
: GE_EXPR
;
2438 return honor_nans
? UNGT_EXPR
: GT_EXPR
;
2452 return UNORDERED_EXPR
;
2453 case UNORDERED_EXPR
:
2454 return ORDERED_EXPR
;
2460 /* Similar, but return the comparison that results if the operands are
2461 swapped. This is safe for floating-point. */
2464 swap_tree_comparison (enum tree_code code
)
2471 case UNORDERED_EXPR
:
2497 /* Convert a comparison tree code from an enum tree_code representation
2498 into a compcode bit-based encoding. This function is the inverse of
2499 compcode_to_comparison. */
2501 static enum comparison_code
2502 comparison_to_compcode (enum tree_code code
)
2519 return COMPCODE_ORD
;
2520 case UNORDERED_EXPR
:
2521 return COMPCODE_UNORD
;
2523 return COMPCODE_UNLT
;
2525 return COMPCODE_UNEQ
;
2527 return COMPCODE_UNLE
;
2529 return COMPCODE_UNGT
;
2531 return COMPCODE_LTGT
;
2533 return COMPCODE_UNGE
;
2539 /* Convert a compcode bit-based encoding of a comparison operator back
2540 to GCC's enum tree_code representation. This function is the
2541 inverse of comparison_to_compcode. */
2543 static enum tree_code
2544 compcode_to_comparison (enum comparison_code code
)
2561 return ORDERED_EXPR
;
2562 case COMPCODE_UNORD
:
2563 return UNORDERED_EXPR
;
2581 /* Return a tree for the comparison which is the combination of
2582 doing the AND or OR (depending on CODE) of the two operations LCODE
2583 and RCODE on the identical operands LL_ARG and LR_ARG. Take into account
2584 the possibility of trapping if the mode has NaNs, and return NULL_TREE
2585 if this makes the transformation invalid. */
2588 combine_comparisons (location_t loc
,
2589 enum tree_code code
, enum tree_code lcode
,
2590 enum tree_code rcode
, tree truth_type
,
2591 tree ll_arg
, tree lr_arg
)
2593 bool honor_nans
= HONOR_NANS (ll_arg
);
2594 enum comparison_code lcompcode
= comparison_to_compcode (lcode
);
2595 enum comparison_code rcompcode
= comparison_to_compcode (rcode
);
2600 case TRUTH_AND_EXPR
: case TRUTH_ANDIF_EXPR
:
2601 compcode
= lcompcode
& rcompcode
;
2604 case TRUTH_OR_EXPR
: case TRUTH_ORIF_EXPR
:
2605 compcode
= lcompcode
| rcompcode
;
2614 /* Eliminate unordered comparisons, as well as LTGT and ORD
2615 which are not used unless the mode has NaNs. */
2616 compcode
&= ~COMPCODE_UNORD
;
2617 if (compcode
== COMPCODE_LTGT
)
2618 compcode
= COMPCODE_NE
;
2619 else if (compcode
== COMPCODE_ORD
)
2620 compcode
= COMPCODE_TRUE
;
2622 else if (flag_trapping_math
)
2624 /* Check that the original operation and the optimized ones will trap
2625 under the same condition. */
2626 bool ltrap
= (lcompcode
& COMPCODE_UNORD
) == 0
2627 && (lcompcode
!= COMPCODE_EQ
)
2628 && (lcompcode
!= COMPCODE_ORD
);
2629 bool rtrap
= (rcompcode
& COMPCODE_UNORD
) == 0
2630 && (rcompcode
!= COMPCODE_EQ
)
2631 && (rcompcode
!= COMPCODE_ORD
);
2632 bool trap
= (compcode
& COMPCODE_UNORD
) == 0
2633 && (compcode
!= COMPCODE_EQ
)
2634 && (compcode
!= COMPCODE_ORD
);
2636 /* In a short-circuited boolean expression the LHS might be
2637 such that the RHS, if evaluated, will never trap. For
2638 example, in ORD (x, y) && (x < y), we evaluate the RHS only
2639 if neither x nor y is NaN. (This is a mixed blessing: for
2640 example, the expression above will never trap, hence
2641 optimizing it to x < y would be invalid). */
2642 if ((code
== TRUTH_ORIF_EXPR
&& (lcompcode
& COMPCODE_UNORD
))
2643 || (code
== TRUTH_ANDIF_EXPR
&& !(lcompcode
& COMPCODE_UNORD
)))
2646 /* If the comparison was short-circuited, and only the RHS
2647 trapped, we may now generate a spurious trap. */
2649 && (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
))
2652 /* If we changed the conditions that cause a trap, we lose. */
2653 if ((ltrap
|| rtrap
) != trap
)
2657 if (compcode
== COMPCODE_TRUE
)
2658 return constant_boolean_node (true, truth_type
);
2659 else if (compcode
== COMPCODE_FALSE
)
2660 return constant_boolean_node (false, truth_type
);
2663 enum tree_code tcode
;
2665 tcode
= compcode_to_comparison ((enum comparison_code
) compcode
);
2666 return fold_build2_loc (loc
, tcode
, truth_type
, ll_arg
, lr_arg
);
2670 /* Return nonzero if two operands (typically of the same tree node)
2671 are necessarily equal. If either argument has side-effects this
2672 function returns zero. FLAGS modifies behavior as follows:
2674 If OEP_ONLY_CONST is set, only return nonzero for constants.
2675 This function tests whether the operands are indistinguishable;
2676 it does not test whether they are equal using C's == operation.
2677 The distinction is important for IEEE floating point, because
2678 (1) -0.0 and 0.0 are distinguishable, but -0.0==0.0, and
2679 (2) two NaNs may be indistinguishable, but NaN!=NaN.
2681 If OEP_ONLY_CONST is unset, a VAR_DECL is considered equal to itself
2682 even though it may hold multiple values during a function.
2683 This is because a GCC tree node guarantees that nothing else is
2684 executed between the evaluation of its "operands" (which may often
2685 be evaluated in arbitrary order). Hence if the operands themselves
2686 don't side-effect, the VAR_DECLs, PARM_DECLs etc... must hold the
2687 same value in each operand/subexpression. Hence leaving OEP_ONLY_CONST
2688 unset means assuming isochronic (or instantaneous) tree equivalence.
2689 Unless comparing arbitrary expression trees, such as from different
2690 statements, this flag can usually be left unset.
2692 If OEP_PURE_SAME is set, then pure functions with identical arguments
2693 are considered the same. It is used when the caller has other ways
2694 to ensure that global memory is unchanged in between. */
2697 operand_equal_p (const_tree arg0
, const_tree arg1
, unsigned int flags
)
2699 /* If either is ERROR_MARK, they aren't equal. */
2700 if (TREE_CODE (arg0
) == ERROR_MARK
|| TREE_CODE (arg1
) == ERROR_MARK
2701 || TREE_TYPE (arg0
) == error_mark_node
2702 || TREE_TYPE (arg1
) == error_mark_node
)
2705 /* Similar, if either does not have a type (like a released SSA name),
2706 they aren't equal. */
2707 if (!TREE_TYPE (arg0
) || !TREE_TYPE (arg1
))
2710 /* Check equality of integer constants before bailing out due to
2711 precision differences. */
2712 if (TREE_CODE (arg0
) == INTEGER_CST
&& TREE_CODE (arg1
) == INTEGER_CST
)
2713 return tree_int_cst_equal (arg0
, arg1
);
2715 /* If both types don't have the same signedness, then we can't consider
2716 them equal. We must check this before the STRIP_NOPS calls
2717 because they may change the signedness of the arguments. As pointers
2718 strictly don't have a signedness, require either two pointers or
2719 two non-pointers as well. */
2720 if (TYPE_UNSIGNED (TREE_TYPE (arg0
)) != TYPE_UNSIGNED (TREE_TYPE (arg1
))
2721 || POINTER_TYPE_P (TREE_TYPE (arg0
)) != POINTER_TYPE_P (TREE_TYPE (arg1
)))
2724 /* We cannot consider pointers to different address space equal. */
2725 if (POINTER_TYPE_P (TREE_TYPE (arg0
)) && POINTER_TYPE_P (TREE_TYPE (arg1
))
2726 && (TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (arg0
)))
2727 != TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (arg1
)))))
2730 /* If both types don't have the same precision, then it is not safe
2732 if (element_precision (TREE_TYPE (arg0
))
2733 != element_precision (TREE_TYPE (arg1
)))
2739 /* In case both args are comparisons but with different comparison
2740 code, try to swap the comparison operands of one arg to produce
2741 a match and compare that variant. */
2742 if (TREE_CODE (arg0
) != TREE_CODE (arg1
)
2743 && COMPARISON_CLASS_P (arg0
)
2744 && COMPARISON_CLASS_P (arg1
))
2746 enum tree_code swap_code
= swap_tree_comparison (TREE_CODE (arg1
));
2748 if (TREE_CODE (arg0
) == swap_code
)
2749 return operand_equal_p (TREE_OPERAND (arg0
, 0),
2750 TREE_OPERAND (arg1
, 1), flags
)
2751 && operand_equal_p (TREE_OPERAND (arg0
, 1),
2752 TREE_OPERAND (arg1
, 0), flags
);
2755 if (TREE_CODE (arg0
) != TREE_CODE (arg1
))
2757 /* NOP_EXPR and CONVERT_EXPR are considered equal. */
2758 if (CONVERT_EXPR_P (arg0
) && CONVERT_EXPR_P (arg1
))
2760 else if (flags
& OEP_ADDRESS_OF
)
2762 /* If we are interested in comparing addresses ignore
2763 MEM_REF wrappings of the base that can appear just for
2765 if (TREE_CODE (arg0
) == MEM_REF
2767 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == ADDR_EXPR
2768 && TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0) == arg1
2769 && integer_zerop (TREE_OPERAND (arg0
, 1)))
2771 else if (TREE_CODE (arg1
) == MEM_REF
2773 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == ADDR_EXPR
2774 && TREE_OPERAND (TREE_OPERAND (arg1
, 0), 0) == arg0
2775 && integer_zerop (TREE_OPERAND (arg1
, 1)))
2783 /* This is needed for conversions and for COMPONENT_REF.
2784 Might as well play it safe and always test this. */
2785 if (TREE_CODE (TREE_TYPE (arg0
)) == ERROR_MARK
2786 || TREE_CODE (TREE_TYPE (arg1
)) == ERROR_MARK
2787 || TYPE_MODE (TREE_TYPE (arg0
)) != TYPE_MODE (TREE_TYPE (arg1
)))
2790 /* If ARG0 and ARG1 are the same SAVE_EXPR, they are necessarily equal.
2791 We don't care about side effects in that case because the SAVE_EXPR
2792 takes care of that for us. In all other cases, two expressions are
2793 equal if they have no side effects. If we have two identical
2794 expressions with side effects that should be treated the same due
2795 to the only side effects being identical SAVE_EXPR's, that will
2796 be detected in the recursive calls below.
2797 If we are taking an invariant address of two identical objects
2798 they are necessarily equal as well. */
2799 if (arg0
== arg1
&& ! (flags
& OEP_ONLY_CONST
)
2800 && (TREE_CODE (arg0
) == SAVE_EXPR
2801 || (flags
& OEP_CONSTANT_ADDRESS_OF
)
2802 || (! TREE_SIDE_EFFECTS (arg0
) && ! TREE_SIDE_EFFECTS (arg1
))))
2805 /* Next handle constant cases, those for which we can return 1 even
2806 if ONLY_CONST is set. */
2807 if (TREE_CONSTANT (arg0
) && TREE_CONSTANT (arg1
))
2808 switch (TREE_CODE (arg0
))
2811 return tree_int_cst_equal (arg0
, arg1
);
2814 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (arg0
),
2815 TREE_FIXED_CST (arg1
));
2818 if (REAL_VALUES_IDENTICAL (TREE_REAL_CST (arg0
),
2819 TREE_REAL_CST (arg1
)))
2823 if (!HONOR_SIGNED_ZEROS (arg0
))
2825 /* If we do not distinguish between signed and unsigned zero,
2826 consider them equal. */
2827 if (real_zerop (arg0
) && real_zerop (arg1
))
2836 if (VECTOR_CST_NELTS (arg0
) != VECTOR_CST_NELTS (arg1
))
2839 for (i
= 0; i
< VECTOR_CST_NELTS (arg0
); ++i
)
2841 if (!operand_equal_p (VECTOR_CST_ELT (arg0
, i
),
2842 VECTOR_CST_ELT (arg1
, i
), flags
))
2849 return (operand_equal_p (TREE_REALPART (arg0
), TREE_REALPART (arg1
),
2851 && operand_equal_p (TREE_IMAGPART (arg0
), TREE_IMAGPART (arg1
),
2855 return (TREE_STRING_LENGTH (arg0
) == TREE_STRING_LENGTH (arg1
)
2856 && ! memcmp (TREE_STRING_POINTER (arg0
),
2857 TREE_STRING_POINTER (arg1
),
2858 TREE_STRING_LENGTH (arg0
)));
2861 return operand_equal_p (TREE_OPERAND (arg0
, 0), TREE_OPERAND (arg1
, 0),
2862 TREE_CONSTANT (arg0
) && TREE_CONSTANT (arg1
)
2863 ? OEP_CONSTANT_ADDRESS_OF
| OEP_ADDRESS_OF
: 0);
2868 if (flags
& OEP_ONLY_CONST
)
2871 /* Define macros to test an operand from arg0 and arg1 for equality and a
2872 variant that allows null and views null as being different from any
2873 non-null value. In the latter case, if either is null, the both
2874 must be; otherwise, do the normal comparison. */
2875 #define OP_SAME(N) operand_equal_p (TREE_OPERAND (arg0, N), \
2876 TREE_OPERAND (arg1, N), flags)
2878 #define OP_SAME_WITH_NULL(N) \
2879 ((!TREE_OPERAND (arg0, N) || !TREE_OPERAND (arg1, N)) \
2880 ? TREE_OPERAND (arg0, N) == TREE_OPERAND (arg1, N) : OP_SAME (N))
2882 switch (TREE_CODE_CLASS (TREE_CODE (arg0
)))
2885 /* Two conversions are equal only if signedness and modes match. */
2886 switch (TREE_CODE (arg0
))
2889 case FIX_TRUNC_EXPR
:
2890 if (TYPE_UNSIGNED (TREE_TYPE (arg0
))
2891 != TYPE_UNSIGNED (TREE_TYPE (arg1
)))
2901 case tcc_comparison
:
2903 if (OP_SAME (0) && OP_SAME (1))
2906 /* For commutative ops, allow the other order. */
2907 return (commutative_tree_code (TREE_CODE (arg0
))
2908 && operand_equal_p (TREE_OPERAND (arg0
, 0),
2909 TREE_OPERAND (arg1
, 1), flags
)
2910 && operand_equal_p (TREE_OPERAND (arg0
, 1),
2911 TREE_OPERAND (arg1
, 0), flags
));
2914 /* If either of the pointer (or reference) expressions we are
2915 dereferencing contain a side effect, these cannot be equal,
2916 but their addresses can be. */
2917 if ((flags
& OEP_CONSTANT_ADDRESS_OF
) == 0
2918 && (TREE_SIDE_EFFECTS (arg0
)
2919 || TREE_SIDE_EFFECTS (arg1
)))
2922 switch (TREE_CODE (arg0
))
2925 if (!(flags
& OEP_ADDRESS_OF
)
2926 && (TYPE_ALIGN (TREE_TYPE (arg0
))
2927 != TYPE_ALIGN (TREE_TYPE (arg1
))))
2929 flags
&= ~(OEP_CONSTANT_ADDRESS_OF
|OEP_ADDRESS_OF
);
2936 case TARGET_MEM_REF
:
2938 /* Require equal access sizes, and similar pointer types.
2939 We can have incomplete types for array references of
2940 variable-sized arrays from the Fortran frontend
2941 though. Also verify the types are compatible. */
2942 if (!((TYPE_SIZE (TREE_TYPE (arg0
)) == TYPE_SIZE (TREE_TYPE (arg1
))
2943 || (TYPE_SIZE (TREE_TYPE (arg0
))
2944 && TYPE_SIZE (TREE_TYPE (arg1
))
2945 && operand_equal_p (TYPE_SIZE (TREE_TYPE (arg0
)),
2946 TYPE_SIZE (TREE_TYPE (arg1
)), flags
)))
2947 && types_compatible_p (TREE_TYPE (arg0
), TREE_TYPE (arg1
))
2948 && ((flags
& OEP_ADDRESS_OF
)
2949 || (alias_ptr_types_compatible_p
2950 (TREE_TYPE (TREE_OPERAND (arg0
, 1)),
2951 TREE_TYPE (TREE_OPERAND (arg1
, 1)))
2952 && (MR_DEPENDENCE_CLIQUE (arg0
)
2953 == MR_DEPENDENCE_CLIQUE (arg1
))
2954 && (MR_DEPENDENCE_BASE (arg0
)
2955 == MR_DEPENDENCE_BASE (arg1
))
2956 && (TYPE_ALIGN (TREE_TYPE (arg0
))
2957 == TYPE_ALIGN (TREE_TYPE (arg1
)))))))
2959 flags
&= ~(OEP_CONSTANT_ADDRESS_OF
|OEP_ADDRESS_OF
);
2960 return (OP_SAME (0) && OP_SAME (1)
2961 /* TARGET_MEM_REF require equal extra operands. */
2962 && (TREE_CODE (arg0
) != TARGET_MEM_REF
2963 || (OP_SAME_WITH_NULL (2)
2964 && OP_SAME_WITH_NULL (3)
2965 && OP_SAME_WITH_NULL (4))));
2968 case ARRAY_RANGE_REF
:
2969 /* Operands 2 and 3 may be null.
2970 Compare the array index by value if it is constant first as we
2971 may have different types but same value here. */
2974 flags
&= ~(OEP_CONSTANT_ADDRESS_OF
|OEP_ADDRESS_OF
);
2975 return ((tree_int_cst_equal (TREE_OPERAND (arg0
, 1),
2976 TREE_OPERAND (arg1
, 1))
2978 && OP_SAME_WITH_NULL (2)
2979 && OP_SAME_WITH_NULL (3));
2982 /* Handle operand 2 the same as for ARRAY_REF. Operand 0
2983 may be NULL when we're called to compare MEM_EXPRs. */
2984 if (!OP_SAME_WITH_NULL (0)
2987 flags
&= ~(OEP_CONSTANT_ADDRESS_OF
|OEP_ADDRESS_OF
);
2988 return OP_SAME_WITH_NULL (2);
2993 flags
&= ~(OEP_CONSTANT_ADDRESS_OF
|OEP_ADDRESS_OF
);
2994 return OP_SAME (1) && OP_SAME (2);
3000 case tcc_expression
:
3001 switch (TREE_CODE (arg0
))
3004 return operand_equal_p (TREE_OPERAND (arg0
, 0),
3005 TREE_OPERAND (arg1
, 0),
3006 flags
| OEP_ADDRESS_OF
);
3008 case TRUTH_NOT_EXPR
:
3011 case TRUTH_ANDIF_EXPR
:
3012 case TRUTH_ORIF_EXPR
:
3013 return OP_SAME (0) && OP_SAME (1);
3016 case WIDEN_MULT_PLUS_EXPR
:
3017 case WIDEN_MULT_MINUS_EXPR
:
3020 /* The multiplcation operands are commutative. */
3023 case TRUTH_AND_EXPR
:
3025 case TRUTH_XOR_EXPR
:
3026 if (OP_SAME (0) && OP_SAME (1))
3029 /* Otherwise take into account this is a commutative operation. */
3030 return (operand_equal_p (TREE_OPERAND (arg0
, 0),
3031 TREE_OPERAND (arg1
, 1), flags
)
3032 && operand_equal_p (TREE_OPERAND (arg0
, 1),
3033 TREE_OPERAND (arg1
, 0), flags
));
3038 return OP_SAME (0) && OP_SAME (1) && OP_SAME (2);
3045 switch (TREE_CODE (arg0
))
3048 if ((CALL_EXPR_FN (arg0
) == NULL_TREE
)
3049 != (CALL_EXPR_FN (arg1
) == NULL_TREE
))
3050 /* If not both CALL_EXPRs are either internal or normal function
3051 functions, then they are not equal. */
3053 else if (CALL_EXPR_FN (arg0
) == NULL_TREE
)
3055 /* If the CALL_EXPRs call different internal functions, then they
3057 if (CALL_EXPR_IFN (arg0
) != CALL_EXPR_IFN (arg1
))
3062 /* If the CALL_EXPRs call different functions, then they are not
3064 if (! operand_equal_p (CALL_EXPR_FN (arg0
), CALL_EXPR_FN (arg1
),
3070 unsigned int cef
= call_expr_flags (arg0
);
3071 if (flags
& OEP_PURE_SAME
)
3072 cef
&= ECF_CONST
| ECF_PURE
;
3079 /* Now see if all the arguments are the same. */
3081 const_call_expr_arg_iterator iter0
, iter1
;
3083 for (a0
= first_const_call_expr_arg (arg0
, &iter0
),
3084 a1
= first_const_call_expr_arg (arg1
, &iter1
);
3086 a0
= next_const_call_expr_arg (&iter0
),
3087 a1
= next_const_call_expr_arg (&iter1
))
3088 if (! operand_equal_p (a0
, a1
, flags
))
3091 /* If we get here and both argument lists are exhausted
3092 then the CALL_EXPRs are equal. */
3093 return ! (a0
|| a1
);
3099 case tcc_declaration
:
3100 /* Consider __builtin_sqrt equal to sqrt. */
3101 return (TREE_CODE (arg0
) == FUNCTION_DECL
3102 && DECL_BUILT_IN (arg0
) && DECL_BUILT_IN (arg1
)
3103 && DECL_BUILT_IN_CLASS (arg0
) == DECL_BUILT_IN_CLASS (arg1
)
3104 && DECL_FUNCTION_CODE (arg0
) == DECL_FUNCTION_CODE (arg1
));
3111 #undef OP_SAME_WITH_NULL
3114 /* Similar to operand_equal_p, but see if ARG0 might have been made by
3115 shorten_compare from ARG1 when ARG1 was being compared with OTHER.
3117 When in doubt, return 0. */
3120 operand_equal_for_comparison_p (tree arg0
, tree arg1
, tree other
)
3122 int unsignedp1
, unsignedpo
;
3123 tree primarg0
, primarg1
, primother
;
3124 unsigned int correct_width
;
3126 if (operand_equal_p (arg0
, arg1
, 0))
3129 if (! INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
3130 || ! INTEGRAL_TYPE_P (TREE_TYPE (arg1
)))
3133 /* Discard any conversions that don't change the modes of ARG0 and ARG1
3134 and see if the inner values are the same. This removes any
3135 signedness comparison, which doesn't matter here. */
3136 primarg0
= arg0
, primarg1
= arg1
;
3137 STRIP_NOPS (primarg0
);
3138 STRIP_NOPS (primarg1
);
3139 if (operand_equal_p (primarg0
, primarg1
, 0))
3142 /* Duplicate what shorten_compare does to ARG1 and see if that gives the
3143 actual comparison operand, ARG0.
3145 First throw away any conversions to wider types
3146 already present in the operands. */
3148 primarg1
= get_narrower (arg1
, &unsignedp1
);
3149 primother
= get_narrower (other
, &unsignedpo
);
3151 correct_width
= TYPE_PRECISION (TREE_TYPE (arg1
));
3152 if (unsignedp1
== unsignedpo
3153 && TYPE_PRECISION (TREE_TYPE (primarg1
)) < correct_width
3154 && TYPE_PRECISION (TREE_TYPE (primother
)) < correct_width
)
3156 tree type
= TREE_TYPE (arg0
);
3158 /* Make sure shorter operand is extended the right way
3159 to match the longer operand. */
3160 primarg1
= fold_convert (signed_or_unsigned_type_for
3161 (unsignedp1
, TREE_TYPE (primarg1
)), primarg1
);
3163 if (operand_equal_p (arg0
, fold_convert (type
, primarg1
), 0))
3170 /* See if ARG is an expression that is either a comparison or is performing
3171 arithmetic on comparisons. The comparisons must only be comparing
3172 two different values, which will be stored in *CVAL1 and *CVAL2; if
3173 they are nonzero it means that some operands have already been found.
3174 No variables may be used anywhere else in the expression except in the
3175 comparisons. If SAVE_P is true it means we removed a SAVE_EXPR around
3176 the expression and save_expr needs to be called with CVAL1 and CVAL2.
3178 If this is true, return 1. Otherwise, return zero. */
3181 twoval_comparison_p (tree arg
, tree
*cval1
, tree
*cval2
, int *save_p
)
3183 enum tree_code code
= TREE_CODE (arg
);
3184 enum tree_code_class tclass
= TREE_CODE_CLASS (code
);
3186 /* We can handle some of the tcc_expression cases here. */
3187 if (tclass
== tcc_expression
&& code
== TRUTH_NOT_EXPR
)
3189 else if (tclass
== tcc_expression
3190 && (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
3191 || code
== COMPOUND_EXPR
))
3192 tclass
= tcc_binary
;
3194 else if (tclass
== tcc_expression
&& code
== SAVE_EXPR
3195 && ! TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
3197 /* If we've already found a CVAL1 or CVAL2, this expression is
3198 two complex to handle. */
3199 if (*cval1
|| *cval2
)
3209 return twoval_comparison_p (TREE_OPERAND (arg
, 0), cval1
, cval2
, save_p
);
3212 return (twoval_comparison_p (TREE_OPERAND (arg
, 0), cval1
, cval2
, save_p
)
3213 && twoval_comparison_p (TREE_OPERAND (arg
, 1),
3214 cval1
, cval2
, save_p
));
3219 case tcc_expression
:
3220 if (code
== COND_EXPR
)
3221 return (twoval_comparison_p (TREE_OPERAND (arg
, 0),
3222 cval1
, cval2
, save_p
)
3223 && twoval_comparison_p (TREE_OPERAND (arg
, 1),
3224 cval1
, cval2
, save_p
)
3225 && twoval_comparison_p (TREE_OPERAND (arg
, 2),
3226 cval1
, cval2
, save_p
));
3229 case tcc_comparison
:
3230 /* First see if we can handle the first operand, then the second. For
3231 the second operand, we know *CVAL1 can't be zero. It must be that
3232 one side of the comparison is each of the values; test for the
3233 case where this isn't true by failing if the two operands
3236 if (operand_equal_p (TREE_OPERAND (arg
, 0),
3237 TREE_OPERAND (arg
, 1), 0))
3241 *cval1
= TREE_OPERAND (arg
, 0);
3242 else if (operand_equal_p (*cval1
, TREE_OPERAND (arg
, 0), 0))
3244 else if (*cval2
== 0)
3245 *cval2
= TREE_OPERAND (arg
, 0);
3246 else if (operand_equal_p (*cval2
, TREE_OPERAND (arg
, 0), 0))
3251 if (operand_equal_p (*cval1
, TREE_OPERAND (arg
, 1), 0))
3253 else if (*cval2
== 0)
3254 *cval2
= TREE_OPERAND (arg
, 1);
3255 else if (operand_equal_p (*cval2
, TREE_OPERAND (arg
, 1), 0))
3267 /* ARG is a tree that is known to contain just arithmetic operations and
3268 comparisons. Evaluate the operations in the tree substituting NEW0 for
3269 any occurrence of OLD0 as an operand of a comparison and likewise for
3273 eval_subst (location_t loc
, tree arg
, tree old0
, tree new0
,
3274 tree old1
, tree new1
)
3276 tree type
= TREE_TYPE (arg
);
3277 enum tree_code code
= TREE_CODE (arg
);
3278 enum tree_code_class tclass
= TREE_CODE_CLASS (code
);
3280 /* We can handle some of the tcc_expression cases here. */
3281 if (tclass
== tcc_expression
&& code
== TRUTH_NOT_EXPR
)
3283 else if (tclass
== tcc_expression
3284 && (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
))
3285 tclass
= tcc_binary
;
3290 return fold_build1_loc (loc
, code
, type
,
3291 eval_subst (loc
, TREE_OPERAND (arg
, 0),
3292 old0
, new0
, old1
, new1
));
3295 return fold_build2_loc (loc
, code
, type
,
3296 eval_subst (loc
, TREE_OPERAND (arg
, 0),
3297 old0
, new0
, old1
, new1
),
3298 eval_subst (loc
, TREE_OPERAND (arg
, 1),
3299 old0
, new0
, old1
, new1
));
3301 case tcc_expression
:
3305 return eval_subst (loc
, TREE_OPERAND (arg
, 0), old0
, new0
,
3309 return eval_subst (loc
, TREE_OPERAND (arg
, 1), old0
, new0
,
3313 return fold_build3_loc (loc
, code
, type
,
3314 eval_subst (loc
, TREE_OPERAND (arg
, 0),
3315 old0
, new0
, old1
, new1
),
3316 eval_subst (loc
, TREE_OPERAND (arg
, 1),
3317 old0
, new0
, old1
, new1
),
3318 eval_subst (loc
, TREE_OPERAND (arg
, 2),
3319 old0
, new0
, old1
, new1
));
3323 /* Fall through - ??? */
3325 case tcc_comparison
:
3327 tree arg0
= TREE_OPERAND (arg
, 0);
3328 tree arg1
= TREE_OPERAND (arg
, 1);
3330 /* We need to check both for exact equality and tree equality. The
3331 former will be true if the operand has a side-effect. In that
3332 case, we know the operand occurred exactly once. */
3334 if (arg0
== old0
|| operand_equal_p (arg0
, old0
, 0))
3336 else if (arg0
== old1
|| operand_equal_p (arg0
, old1
, 0))
3339 if (arg1
== old0
|| operand_equal_p (arg1
, old0
, 0))
3341 else if (arg1
== old1
|| operand_equal_p (arg1
, old1
, 0))
3344 return fold_build2_loc (loc
, code
, type
, arg0
, arg1
);
3352 /* Return a tree for the case when the result of an expression is RESULT
3353 converted to TYPE and OMITTED was previously an operand of the expression
3354 but is now not needed (e.g., we folded OMITTED * 0).
3356 If OMITTED has side effects, we must evaluate it. Otherwise, just do
3357 the conversion of RESULT to TYPE. */
3360 omit_one_operand_loc (location_t loc
, tree type
, tree result
, tree omitted
)
3362 tree t
= fold_convert_loc (loc
, type
, result
);
3364 /* If the resulting operand is an empty statement, just return the omitted
3365 statement casted to void. */
3366 if (IS_EMPTY_STMT (t
) && TREE_SIDE_EFFECTS (omitted
))
3367 return build1_loc (loc
, NOP_EXPR
, void_type_node
,
3368 fold_ignored_result (omitted
));
3370 if (TREE_SIDE_EFFECTS (omitted
))
3371 return build2_loc (loc
, COMPOUND_EXPR
, type
,
3372 fold_ignored_result (omitted
), t
);
3374 return non_lvalue_loc (loc
, t
);
3377 /* Return a tree for the case when the result of an expression is RESULT
3378 converted to TYPE and OMITTED1 and OMITTED2 were previously operands
3379 of the expression but are now not needed.
3381 If OMITTED1 or OMITTED2 has side effects, they must be evaluated.
3382 If both OMITTED1 and OMITTED2 have side effects, OMITTED1 is
3383 evaluated before OMITTED2. Otherwise, if neither has side effects,
3384 just do the conversion of RESULT to TYPE. */
3387 omit_two_operands_loc (location_t loc
, tree type
, tree result
,
3388 tree omitted1
, tree omitted2
)
3390 tree t
= fold_convert_loc (loc
, type
, result
);
3392 if (TREE_SIDE_EFFECTS (omitted2
))
3393 t
= build2_loc (loc
, COMPOUND_EXPR
, type
, omitted2
, t
);
3394 if (TREE_SIDE_EFFECTS (omitted1
))
3395 t
= build2_loc (loc
, COMPOUND_EXPR
, type
, omitted1
, t
);
3397 return TREE_CODE (t
) != COMPOUND_EXPR
? non_lvalue_loc (loc
, t
) : t
;
3401 /* Return a simplified tree node for the truth-negation of ARG. This
3402 never alters ARG itself. We assume that ARG is an operation that
3403 returns a truth value (0 or 1).
3405 FIXME: one would think we would fold the result, but it causes
3406 problems with the dominator optimizer. */
3409 fold_truth_not_expr (location_t loc
, tree arg
)
3411 tree type
= TREE_TYPE (arg
);
3412 enum tree_code code
= TREE_CODE (arg
);
3413 location_t loc1
, loc2
;
3415 /* If this is a comparison, we can simply invert it, except for
3416 floating-point non-equality comparisons, in which case we just
3417 enclose a TRUTH_NOT_EXPR around what we have. */
3419 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
3421 tree op_type
= TREE_TYPE (TREE_OPERAND (arg
, 0));
3422 if (FLOAT_TYPE_P (op_type
)
3423 && flag_trapping_math
3424 && code
!= ORDERED_EXPR
&& code
!= UNORDERED_EXPR
3425 && code
!= NE_EXPR
&& code
!= EQ_EXPR
)
3428 code
= invert_tree_comparison (code
, HONOR_NANS (op_type
));
3429 if (code
== ERROR_MARK
)
3432 return build2_loc (loc
, code
, type
, TREE_OPERAND (arg
, 0),
3433 TREE_OPERAND (arg
, 1));
3439 return constant_boolean_node (integer_zerop (arg
), type
);
3441 case TRUTH_AND_EXPR
:
3442 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3443 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3444 return build2_loc (loc
, TRUTH_OR_EXPR
, type
,
3445 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
3446 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
3449 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3450 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3451 return build2_loc (loc
, TRUTH_AND_EXPR
, type
,
3452 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
3453 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
3455 case TRUTH_XOR_EXPR
:
3456 /* Here we can invert either operand. We invert the first operand
3457 unless the second operand is a TRUTH_NOT_EXPR in which case our
3458 result is the XOR of the first operand with the inside of the
3459 negation of the second operand. */
3461 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == TRUTH_NOT_EXPR
)
3462 return build2_loc (loc
, TRUTH_XOR_EXPR
, type
, TREE_OPERAND (arg
, 0),
3463 TREE_OPERAND (TREE_OPERAND (arg
, 1), 0));
3465 return build2_loc (loc
, TRUTH_XOR_EXPR
, type
,
3466 invert_truthvalue_loc (loc
, TREE_OPERAND (arg
, 0)),
3467 TREE_OPERAND (arg
, 1));
3469 case TRUTH_ANDIF_EXPR
:
3470 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3471 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3472 return build2_loc (loc
, TRUTH_ORIF_EXPR
, type
,
3473 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
3474 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
3476 case TRUTH_ORIF_EXPR
:
3477 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3478 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3479 return build2_loc (loc
, TRUTH_ANDIF_EXPR
, type
,
3480 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
3481 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
3483 case TRUTH_NOT_EXPR
:
3484 return TREE_OPERAND (arg
, 0);
3488 tree arg1
= TREE_OPERAND (arg
, 1);
3489 tree arg2
= TREE_OPERAND (arg
, 2);
3491 loc1
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3492 loc2
= expr_location_or (TREE_OPERAND (arg
, 2), loc
);
3494 /* A COND_EXPR may have a throw as one operand, which
3495 then has void type. Just leave void operands
3497 return build3_loc (loc
, COND_EXPR
, type
, TREE_OPERAND (arg
, 0),
3498 VOID_TYPE_P (TREE_TYPE (arg1
))
3499 ? arg1
: invert_truthvalue_loc (loc1
, arg1
),
3500 VOID_TYPE_P (TREE_TYPE (arg2
))
3501 ? arg2
: invert_truthvalue_loc (loc2
, arg2
));
3505 loc1
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3506 return build2_loc (loc
, COMPOUND_EXPR
, type
,
3507 TREE_OPERAND (arg
, 0),
3508 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 1)));
3510 case NON_LVALUE_EXPR
:
3511 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3512 return invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0));
3515 if (TREE_CODE (TREE_TYPE (arg
)) == BOOLEAN_TYPE
)
3516 return build1_loc (loc
, TRUTH_NOT_EXPR
, type
, arg
);
3518 /* ... fall through ... */
3521 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3522 return build1_loc (loc
, TREE_CODE (arg
), type
,
3523 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)));
3526 if (!integer_onep (TREE_OPERAND (arg
, 1)))
3528 return build2_loc (loc
, EQ_EXPR
, type
, arg
, build_int_cst (type
, 0));
3531 return build1_loc (loc
, TRUTH_NOT_EXPR
, type
, arg
);
3533 case CLEANUP_POINT_EXPR
:
3534 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3535 return build1_loc (loc
, CLEANUP_POINT_EXPR
, type
,
3536 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)));
3543 /* Fold the truth-negation of ARG. This never alters ARG itself. We
3544 assume that ARG is an operation that returns a truth value (0 or 1
3545 for scalars, 0 or -1 for vectors). Return the folded expression if
3546 folding is successful. Otherwise, return NULL_TREE. */
3549 fold_invert_truthvalue (location_t loc
, tree arg
)
3551 tree type
= TREE_TYPE (arg
);
3552 return fold_unary_loc (loc
, VECTOR_TYPE_P (type
)
3558 /* Return a simplified tree node for the truth-negation of ARG. This
3559 never alters ARG itself. We assume that ARG is an operation that
3560 returns a truth value (0 or 1 for scalars, 0 or -1 for vectors). */
3563 invert_truthvalue_loc (location_t loc
, tree arg
)
3565 if (TREE_CODE (arg
) == ERROR_MARK
)
3568 tree type
= TREE_TYPE (arg
);
3569 return fold_build1_loc (loc
, VECTOR_TYPE_P (type
)
3575 /* Knowing that ARG0 and ARG1 are both RDIV_EXPRs, simplify a binary operation
3576 with code CODE. This optimization is unsafe. */
3578 distribute_real_division (location_t loc
, enum tree_code code
, tree type
,
3579 tree arg0
, tree arg1
)
3581 bool mul0
= TREE_CODE (arg0
) == MULT_EXPR
;
3582 bool mul1
= TREE_CODE (arg1
) == MULT_EXPR
;
3584 /* (A / C) +- (B / C) -> (A +- B) / C. */
3586 && operand_equal_p (TREE_OPERAND (arg0
, 1),
3587 TREE_OPERAND (arg1
, 1), 0))
3588 return fold_build2_loc (loc
, mul0
? MULT_EXPR
: RDIV_EXPR
, type
,
3589 fold_build2_loc (loc
, code
, type
,
3590 TREE_OPERAND (arg0
, 0),
3591 TREE_OPERAND (arg1
, 0)),
3592 TREE_OPERAND (arg0
, 1));
3594 /* (A / C1) +- (A / C2) -> A * (1 / C1 +- 1 / C2). */
3595 if (operand_equal_p (TREE_OPERAND (arg0
, 0),
3596 TREE_OPERAND (arg1
, 0), 0)
3597 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == REAL_CST
3598 && TREE_CODE (TREE_OPERAND (arg1
, 1)) == REAL_CST
)
3600 REAL_VALUE_TYPE r0
, r1
;
3601 r0
= TREE_REAL_CST (TREE_OPERAND (arg0
, 1));
3602 r1
= TREE_REAL_CST (TREE_OPERAND (arg1
, 1));
3604 real_arithmetic (&r0
, RDIV_EXPR
, &dconst1
, &r0
);
3606 real_arithmetic (&r1
, RDIV_EXPR
, &dconst1
, &r1
);
3607 real_arithmetic (&r0
, code
, &r0
, &r1
);
3608 return fold_build2_loc (loc
, MULT_EXPR
, type
,
3609 TREE_OPERAND (arg0
, 0),
3610 build_real (type
, r0
));
3616 /* Return a BIT_FIELD_REF of type TYPE to refer to BITSIZE bits of INNER
3617 starting at BITPOS. The field is unsigned if UNSIGNEDP is nonzero. */
3620 make_bit_field_ref (location_t loc
, tree inner
, tree type
,
3621 HOST_WIDE_INT bitsize
, HOST_WIDE_INT bitpos
, int unsignedp
)
3623 tree result
, bftype
;
3627 tree size
= TYPE_SIZE (TREE_TYPE (inner
));
3628 if ((INTEGRAL_TYPE_P (TREE_TYPE (inner
))
3629 || POINTER_TYPE_P (TREE_TYPE (inner
)))
3630 && tree_fits_shwi_p (size
)
3631 && tree_to_shwi (size
) == bitsize
)
3632 return fold_convert_loc (loc
, type
, inner
);
3636 if (TYPE_PRECISION (bftype
) != bitsize
3637 || TYPE_UNSIGNED (bftype
) == !unsignedp
)
3638 bftype
= build_nonstandard_integer_type (bitsize
, 0);
3640 result
= build3_loc (loc
, BIT_FIELD_REF
, bftype
, inner
,
3641 size_int (bitsize
), bitsize_int (bitpos
));
3644 result
= fold_convert_loc (loc
, type
, result
);
3649 /* Optimize a bit-field compare.
3651 There are two cases: First is a compare against a constant and the
3652 second is a comparison of two items where the fields are at the same
3653 bit position relative to the start of a chunk (byte, halfword, word)
3654 large enough to contain it. In these cases we can avoid the shift
3655 implicit in bitfield extractions.
3657 For constants, we emit a compare of the shifted constant with the
3658 BIT_AND_EXPR of a mask and a byte, halfword, or word of the operand being
3659 compared. For two fields at the same position, we do the ANDs with the
3660 similar mask and compare the result of the ANDs.
3662 CODE is the comparison code, known to be either NE_EXPR or EQ_EXPR.
3663 COMPARE_TYPE is the type of the comparison, and LHS and RHS
3664 are the left and right operands of the comparison, respectively.
3666 If the optimization described above can be done, we return the resulting
3667 tree. Otherwise we return zero. */
3670 optimize_bit_field_compare (location_t loc
, enum tree_code code
,
3671 tree compare_type
, tree lhs
, tree rhs
)
3673 HOST_WIDE_INT lbitpos
, lbitsize
, rbitpos
, rbitsize
, nbitpos
, nbitsize
;
3674 tree type
= TREE_TYPE (lhs
);
3676 int const_p
= TREE_CODE (rhs
) == INTEGER_CST
;
3677 machine_mode lmode
, rmode
, nmode
;
3678 int lunsignedp
, runsignedp
;
3679 int lvolatilep
= 0, rvolatilep
= 0;
3680 tree linner
, rinner
= NULL_TREE
;
3684 /* Get all the information about the extractions being done. If the bit size
3685 if the same as the size of the underlying object, we aren't doing an
3686 extraction at all and so can do nothing. We also don't want to
3687 do anything if the inner expression is a PLACEHOLDER_EXPR since we
3688 then will no longer be able to replace it. */
3689 linner
= get_inner_reference (lhs
, &lbitsize
, &lbitpos
, &offset
, &lmode
,
3690 &lunsignedp
, &lvolatilep
, false);
3691 if (linner
== lhs
|| lbitsize
== GET_MODE_BITSIZE (lmode
) || lbitsize
< 0
3692 || offset
!= 0 || TREE_CODE (linner
) == PLACEHOLDER_EXPR
|| lvolatilep
)
3697 /* If this is not a constant, we can only do something if bit positions,
3698 sizes, and signedness are the same. */
3699 rinner
= get_inner_reference (rhs
, &rbitsize
, &rbitpos
, &offset
, &rmode
,
3700 &runsignedp
, &rvolatilep
, false);
3702 if (rinner
== rhs
|| lbitpos
!= rbitpos
|| lbitsize
!= rbitsize
3703 || lunsignedp
!= runsignedp
|| offset
!= 0
3704 || TREE_CODE (rinner
) == PLACEHOLDER_EXPR
|| rvolatilep
)
3708 /* See if we can find a mode to refer to this field. We should be able to,
3709 but fail if we can't. */
3710 nmode
= get_best_mode (lbitsize
, lbitpos
, 0, 0,
3711 const_p
? TYPE_ALIGN (TREE_TYPE (linner
))
3712 : MIN (TYPE_ALIGN (TREE_TYPE (linner
)),
3713 TYPE_ALIGN (TREE_TYPE (rinner
))),
3715 if (nmode
== VOIDmode
)
3718 /* Set signed and unsigned types of the precision of this mode for the
3720 unsigned_type
= lang_hooks
.types
.type_for_mode (nmode
, 1);
3722 /* Compute the bit position and size for the new reference and our offset
3723 within it. If the new reference is the same size as the original, we
3724 won't optimize anything, so return zero. */
3725 nbitsize
= GET_MODE_BITSIZE (nmode
);
3726 nbitpos
= lbitpos
& ~ (nbitsize
- 1);
3728 if (nbitsize
== lbitsize
)
3731 if (BYTES_BIG_ENDIAN
)
3732 lbitpos
= nbitsize
- lbitsize
- lbitpos
;
3734 /* Make the mask to be used against the extracted field. */
3735 mask
= build_int_cst_type (unsigned_type
, -1);
3736 mask
= const_binop (LSHIFT_EXPR
, mask
, size_int (nbitsize
- lbitsize
));
3737 mask
= const_binop (RSHIFT_EXPR
, mask
,
3738 size_int (nbitsize
- lbitsize
- lbitpos
));
3741 /* If not comparing with constant, just rework the comparison
3743 return fold_build2_loc (loc
, code
, compare_type
,
3744 fold_build2_loc (loc
, BIT_AND_EXPR
, unsigned_type
,
3745 make_bit_field_ref (loc
, linner
,
3750 fold_build2_loc (loc
, BIT_AND_EXPR
, unsigned_type
,
3751 make_bit_field_ref (loc
, rinner
,
3757 /* Otherwise, we are handling the constant case. See if the constant is too
3758 big for the field. Warn and return a tree of for 0 (false) if so. We do
3759 this not only for its own sake, but to avoid having to test for this
3760 error case below. If we didn't, we might generate wrong code.
3762 For unsigned fields, the constant shifted right by the field length should
3763 be all zero. For signed fields, the high-order bits should agree with
3768 if (wi::lrshift (rhs
, lbitsize
) != 0)
3770 warning (0, "comparison is always %d due to width of bit-field",
3772 return constant_boolean_node (code
== NE_EXPR
, compare_type
);
3777 wide_int tem
= wi::arshift (rhs
, lbitsize
- 1);
3778 if (tem
!= 0 && tem
!= -1)
3780 warning (0, "comparison is always %d due to width of bit-field",
3782 return constant_boolean_node (code
== NE_EXPR
, compare_type
);
3786 /* Single-bit compares should always be against zero. */
3787 if (lbitsize
== 1 && ! integer_zerop (rhs
))
3789 code
= code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
;
3790 rhs
= build_int_cst (type
, 0);
3793 /* Make a new bitfield reference, shift the constant over the
3794 appropriate number of bits and mask it with the computed mask
3795 (in case this was a signed field). If we changed it, make a new one. */
3796 lhs
= make_bit_field_ref (loc
, linner
, unsigned_type
, nbitsize
, nbitpos
, 1);
3798 rhs
= const_binop (BIT_AND_EXPR
,
3799 const_binop (LSHIFT_EXPR
,
3800 fold_convert_loc (loc
, unsigned_type
, rhs
),
3801 size_int (lbitpos
)),
3804 lhs
= build2_loc (loc
, code
, compare_type
,
3805 build2 (BIT_AND_EXPR
, unsigned_type
, lhs
, mask
), rhs
);
3809 /* Subroutine for fold_truth_andor_1: decode a field reference.
3811 If EXP is a comparison reference, we return the innermost reference.
3813 *PBITSIZE is set to the number of bits in the reference, *PBITPOS is
3814 set to the starting bit number.
3816 If the innermost field can be completely contained in a mode-sized
3817 unit, *PMODE is set to that mode. Otherwise, it is set to VOIDmode.
3819 *PVOLATILEP is set to 1 if the any expression encountered is volatile;
3820 otherwise it is not changed.
3822 *PUNSIGNEDP is set to the signedness of the field.
3824 *PMASK is set to the mask used. This is either contained in a
3825 BIT_AND_EXPR or derived from the width of the field.
3827 *PAND_MASK is set to the mask found in a BIT_AND_EXPR, if any.
3829 Return 0 if this is not a component reference or is one that we can't
3830 do anything with. */
3833 decode_field_reference (location_t loc
, tree exp
, HOST_WIDE_INT
*pbitsize
,
3834 HOST_WIDE_INT
*pbitpos
, machine_mode
*pmode
,
3835 int *punsignedp
, int *pvolatilep
,
3836 tree
*pmask
, tree
*pand_mask
)
3838 tree outer_type
= 0;
3840 tree mask
, inner
, offset
;
3842 unsigned int precision
;
3844 /* All the optimizations using this function assume integer fields.
3845 There are problems with FP fields since the type_for_size call
3846 below can fail for, e.g., XFmode. */
3847 if (! INTEGRAL_TYPE_P (TREE_TYPE (exp
)))
3850 /* We are interested in the bare arrangement of bits, so strip everything
3851 that doesn't affect the machine mode. However, record the type of the
3852 outermost expression if it may matter below. */
3853 if (CONVERT_EXPR_P (exp
)
3854 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
3855 outer_type
= TREE_TYPE (exp
);
3858 if (TREE_CODE (exp
) == BIT_AND_EXPR
)
3860 and_mask
= TREE_OPERAND (exp
, 1);
3861 exp
= TREE_OPERAND (exp
, 0);
3862 STRIP_NOPS (exp
); STRIP_NOPS (and_mask
);
3863 if (TREE_CODE (and_mask
) != INTEGER_CST
)
3867 inner
= get_inner_reference (exp
, pbitsize
, pbitpos
, &offset
, pmode
,
3868 punsignedp
, pvolatilep
, false);
3869 if ((inner
== exp
&& and_mask
== 0)
3870 || *pbitsize
< 0 || offset
!= 0
3871 || TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3874 /* If the number of bits in the reference is the same as the bitsize of
3875 the outer type, then the outer type gives the signedness. Otherwise
3876 (in case of a small bitfield) the signedness is unchanged. */
3877 if (outer_type
&& *pbitsize
== TYPE_PRECISION (outer_type
))
3878 *punsignedp
= TYPE_UNSIGNED (outer_type
);
3880 /* Compute the mask to access the bitfield. */
3881 unsigned_type
= lang_hooks
.types
.type_for_size (*pbitsize
, 1);
3882 precision
= TYPE_PRECISION (unsigned_type
);
3884 mask
= build_int_cst_type (unsigned_type
, -1);
3886 mask
= const_binop (LSHIFT_EXPR
, mask
, size_int (precision
- *pbitsize
));
3887 mask
= const_binop (RSHIFT_EXPR
, mask
, size_int (precision
- *pbitsize
));
3889 /* Merge it with the mask we found in the BIT_AND_EXPR, if any. */
3891 mask
= fold_build2_loc (loc
, BIT_AND_EXPR
, unsigned_type
,
3892 fold_convert_loc (loc
, unsigned_type
, and_mask
), mask
);
3895 *pand_mask
= and_mask
;
3899 /* Return nonzero if MASK represents a mask of SIZE ones in the low-order
3900 bit positions and MASK is SIGNED. */
3903 all_ones_mask_p (const_tree mask
, unsigned int size
)
3905 tree type
= TREE_TYPE (mask
);
3906 unsigned int precision
= TYPE_PRECISION (type
);
3908 /* If this function returns true when the type of the mask is
3909 UNSIGNED, then there will be errors. In particular see
3910 gcc.c-torture/execute/990326-1.c. There does not appear to be
3911 any documentation paper trail as to why this is so. But the pre
3912 wide-int worked with that restriction and it has been preserved
3914 if (size
> precision
|| TYPE_SIGN (type
) == UNSIGNED
)
3917 return wi::mask (size
, false, precision
) == mask
;
3920 /* Subroutine for fold: determine if VAL is the INTEGER_CONST that
3921 represents the sign bit of EXP's type. If EXP represents a sign
3922 or zero extension, also test VAL against the unextended type.
3923 The return value is the (sub)expression whose sign bit is VAL,
3924 or NULL_TREE otherwise. */
3927 sign_bit_p (tree exp
, const_tree val
)
3932 /* Tree EXP must have an integral type. */
3933 t
= TREE_TYPE (exp
);
3934 if (! INTEGRAL_TYPE_P (t
))
3937 /* Tree VAL must be an integer constant. */
3938 if (TREE_CODE (val
) != INTEGER_CST
3939 || TREE_OVERFLOW (val
))
3942 width
= TYPE_PRECISION (t
);
3943 if (wi::only_sign_bit_p (val
, width
))
3946 /* Handle extension from a narrower type. */
3947 if (TREE_CODE (exp
) == NOP_EXPR
3948 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp
, 0))) < width
)
3949 return sign_bit_p (TREE_OPERAND (exp
, 0), val
);
3954 /* Subroutine for fold_truth_andor_1: determine if an operand is simple enough
3955 to be evaluated unconditionally. */
3958 simple_operand_p (const_tree exp
)
3960 /* Strip any conversions that don't change the machine mode. */
3963 return (CONSTANT_CLASS_P (exp
)
3964 || TREE_CODE (exp
) == SSA_NAME
3966 && ! TREE_ADDRESSABLE (exp
)
3967 && ! TREE_THIS_VOLATILE (exp
)
3968 && ! DECL_NONLOCAL (exp
)
3969 /* Don't regard global variables as simple. They may be
3970 allocated in ways unknown to the compiler (shared memory,
3971 #pragma weak, etc). */
3972 && ! TREE_PUBLIC (exp
)
3973 && ! DECL_EXTERNAL (exp
)
3974 /* Weakrefs are not safe to be read, since they can be NULL.
3975 They are !TREE_PUBLIC && !DECL_EXTERNAL but still
3976 have DECL_WEAK flag set. */
3977 && (! VAR_OR_FUNCTION_DECL_P (exp
) || ! DECL_WEAK (exp
))
3978 /* Loading a static variable is unduly expensive, but global
3979 registers aren't expensive. */
3980 && (! TREE_STATIC (exp
) || DECL_REGISTER (exp
))));
3983 /* Subroutine for fold_truth_andor: determine if an operand is simple enough
3984 to be evaluated unconditionally.
3985 I addition to simple_operand_p, we assume that comparisons, conversions,
3986 and logic-not operations are simple, if their operands are simple, too. */
3989 simple_operand_p_2 (tree exp
)
3991 enum tree_code code
;
3993 if (TREE_SIDE_EFFECTS (exp
)
3994 || tree_could_trap_p (exp
))
3997 while (CONVERT_EXPR_P (exp
))
3998 exp
= TREE_OPERAND (exp
, 0);
4000 code
= TREE_CODE (exp
);
4002 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
4003 return (simple_operand_p (TREE_OPERAND (exp
, 0))
4004 && simple_operand_p (TREE_OPERAND (exp
, 1)));
4006 if (code
== TRUTH_NOT_EXPR
)
4007 return simple_operand_p_2 (TREE_OPERAND (exp
, 0));
4009 return simple_operand_p (exp
);
4013 /* The following functions are subroutines to fold_range_test and allow it to
4014 try to change a logical combination of comparisons into a range test.
4017 X == 2 || X == 3 || X == 4 || X == 5
4021 (unsigned) (X - 2) <= 3
4023 We describe each set of comparisons as being either inside or outside
4024 a range, using a variable named like IN_P, and then describe the
4025 range with a lower and upper bound. If one of the bounds is omitted,
4026 it represents either the highest or lowest value of the type.
4028 In the comments below, we represent a range by two numbers in brackets
4029 preceded by a "+" to designate being inside that range, or a "-" to
4030 designate being outside that range, so the condition can be inverted by
4031 flipping the prefix. An omitted bound is represented by a "-". For
4032 example, "- [-, 10]" means being outside the range starting at the lowest
4033 possible value and ending at 10, in other words, being greater than 10.
4034 The range "+ [-, -]" is always true and hence the range "- [-, -]" is
4037 We set up things so that the missing bounds are handled in a consistent
4038 manner so neither a missing bound nor "true" and "false" need to be
4039 handled using a special case. */
4041 /* Return the result of applying CODE to ARG0 and ARG1, but handle the case
4042 of ARG0 and/or ARG1 being omitted, meaning an unlimited range. UPPER0_P
4043 and UPPER1_P are nonzero if the respective argument is an upper bound
4044 and zero for a lower. TYPE, if nonzero, is the type of the result; it
4045 must be specified for a comparison. ARG1 will be converted to ARG0's
4046 type if both are specified. */
4049 range_binop (enum tree_code code
, tree type
, tree arg0
, int upper0_p
,
4050 tree arg1
, int upper1_p
)
4056 /* If neither arg represents infinity, do the normal operation.
4057 Else, if not a comparison, return infinity. Else handle the special
4058 comparison rules. Note that most of the cases below won't occur, but
4059 are handled for consistency. */
4061 if (arg0
!= 0 && arg1
!= 0)
4063 tem
= fold_build2 (code
, type
!= 0 ? type
: TREE_TYPE (arg0
),
4064 arg0
, fold_convert (TREE_TYPE (arg0
), arg1
));
4066 return TREE_CODE (tem
) == INTEGER_CST
? tem
: 0;
4069 if (TREE_CODE_CLASS (code
) != tcc_comparison
)
4072 /* Set SGN[01] to -1 if ARG[01] is a lower bound, 1 for upper, and 0
4073 for neither. In real maths, we cannot assume open ended ranges are
4074 the same. But, this is computer arithmetic, where numbers are finite.
4075 We can therefore make the transformation of any unbounded range with
4076 the value Z, Z being greater than any representable number. This permits
4077 us to treat unbounded ranges as equal. */
4078 sgn0
= arg0
!= 0 ? 0 : (upper0_p
? 1 : -1);
4079 sgn1
= arg1
!= 0 ? 0 : (upper1_p
? 1 : -1);
4083 result
= sgn0
== sgn1
;
4086 result
= sgn0
!= sgn1
;
4089 result
= sgn0
< sgn1
;
4092 result
= sgn0
<= sgn1
;
4095 result
= sgn0
> sgn1
;
4098 result
= sgn0
>= sgn1
;
4104 return constant_boolean_node (result
, type
);
4107 /* Helper routine for make_range. Perform one step for it, return
4108 new expression if the loop should continue or NULL_TREE if it should
4112 make_range_step (location_t loc
, enum tree_code code
, tree arg0
, tree arg1
,
4113 tree exp_type
, tree
*p_low
, tree
*p_high
, int *p_in_p
,
4114 bool *strict_overflow_p
)
4116 tree arg0_type
= TREE_TYPE (arg0
);
4117 tree n_low
, n_high
, low
= *p_low
, high
= *p_high
;
4118 int in_p
= *p_in_p
, n_in_p
;
4122 case TRUTH_NOT_EXPR
:
4123 /* We can only do something if the range is testing for zero. */
4124 if (low
== NULL_TREE
|| high
== NULL_TREE
4125 || ! integer_zerop (low
) || ! integer_zerop (high
))
4130 case EQ_EXPR
: case NE_EXPR
:
4131 case LT_EXPR
: case LE_EXPR
: case GE_EXPR
: case GT_EXPR
:
4132 /* We can only do something if the range is testing for zero
4133 and if the second operand is an integer constant. Note that
4134 saying something is "in" the range we make is done by
4135 complementing IN_P since it will set in the initial case of
4136 being not equal to zero; "out" is leaving it alone. */
4137 if (low
== NULL_TREE
|| high
== NULL_TREE
4138 || ! integer_zerop (low
) || ! integer_zerop (high
)
4139 || TREE_CODE (arg1
) != INTEGER_CST
)
4144 case NE_EXPR
: /* - [c, c] */
4147 case EQ_EXPR
: /* + [c, c] */
4148 in_p
= ! in_p
, low
= high
= arg1
;
4150 case GT_EXPR
: /* - [-, c] */
4151 low
= 0, high
= arg1
;
4153 case GE_EXPR
: /* + [c, -] */
4154 in_p
= ! in_p
, low
= arg1
, high
= 0;
4156 case LT_EXPR
: /* - [c, -] */
4157 low
= arg1
, high
= 0;
4159 case LE_EXPR
: /* + [-, c] */
4160 in_p
= ! in_p
, low
= 0, high
= arg1
;
4166 /* If this is an unsigned comparison, we also know that EXP is
4167 greater than or equal to zero. We base the range tests we make
4168 on that fact, so we record it here so we can parse existing
4169 range tests. We test arg0_type since often the return type
4170 of, e.g. EQ_EXPR, is boolean. */
4171 if (TYPE_UNSIGNED (arg0_type
) && (low
== 0 || high
== 0))
4173 if (! merge_ranges (&n_in_p
, &n_low
, &n_high
,
4175 build_int_cst (arg0_type
, 0),
4179 in_p
= n_in_p
, low
= n_low
, high
= n_high
;
4181 /* If the high bound is missing, but we have a nonzero low
4182 bound, reverse the range so it goes from zero to the low bound
4184 if (high
== 0 && low
&& ! integer_zerop (low
))
4187 high
= range_binop (MINUS_EXPR
, NULL_TREE
, low
, 0,
4188 build_int_cst (TREE_TYPE (low
), 1), 0);
4189 low
= build_int_cst (arg0_type
, 0);
4199 /* If flag_wrapv and ARG0_TYPE is signed, make sure
4200 low and high are non-NULL, then normalize will DTRT. */
4201 if (!TYPE_UNSIGNED (arg0_type
)
4202 && !TYPE_OVERFLOW_UNDEFINED (arg0_type
))
4204 if (low
== NULL_TREE
)
4205 low
= TYPE_MIN_VALUE (arg0_type
);
4206 if (high
== NULL_TREE
)
4207 high
= TYPE_MAX_VALUE (arg0_type
);
4210 /* (-x) IN [a,b] -> x in [-b, -a] */
4211 n_low
= range_binop (MINUS_EXPR
, exp_type
,
4212 build_int_cst (exp_type
, 0),
4214 n_high
= range_binop (MINUS_EXPR
, exp_type
,
4215 build_int_cst (exp_type
, 0),
4217 if (n_high
!= 0 && TREE_OVERFLOW (n_high
))
4223 return build2_loc (loc
, MINUS_EXPR
, exp_type
, negate_expr (arg0
),
4224 build_int_cst (exp_type
, 1));
4228 if (TREE_CODE (arg1
) != INTEGER_CST
)
4231 /* If flag_wrapv and ARG0_TYPE is signed, then we cannot
4232 move a constant to the other side. */
4233 if (!TYPE_UNSIGNED (arg0_type
)
4234 && !TYPE_OVERFLOW_UNDEFINED (arg0_type
))
4237 /* If EXP is signed, any overflow in the computation is undefined,
4238 so we don't worry about it so long as our computations on
4239 the bounds don't overflow. For unsigned, overflow is defined
4240 and this is exactly the right thing. */
4241 n_low
= range_binop (code
== MINUS_EXPR
? PLUS_EXPR
: MINUS_EXPR
,
4242 arg0_type
, low
, 0, arg1
, 0);
4243 n_high
= range_binop (code
== MINUS_EXPR
? PLUS_EXPR
: MINUS_EXPR
,
4244 arg0_type
, high
, 1, arg1
, 0);
4245 if ((n_low
!= 0 && TREE_OVERFLOW (n_low
))
4246 || (n_high
!= 0 && TREE_OVERFLOW (n_high
)))
4249 if (TYPE_OVERFLOW_UNDEFINED (arg0_type
))
4250 *strict_overflow_p
= true;
4253 /* Check for an unsigned range which has wrapped around the maximum
4254 value thus making n_high < n_low, and normalize it. */
4255 if (n_low
&& n_high
&& tree_int_cst_lt (n_high
, n_low
))
4257 low
= range_binop (PLUS_EXPR
, arg0_type
, n_high
, 0,
4258 build_int_cst (TREE_TYPE (n_high
), 1), 0);
4259 high
= range_binop (MINUS_EXPR
, arg0_type
, n_low
, 0,
4260 build_int_cst (TREE_TYPE (n_low
), 1), 0);
4262 /* If the range is of the form +/- [ x+1, x ], we won't
4263 be able to normalize it. But then, it represents the
4264 whole range or the empty set, so make it
4266 if (tree_int_cst_equal (n_low
, low
)
4267 && tree_int_cst_equal (n_high
, high
))
4273 low
= n_low
, high
= n_high
;
4281 case NON_LVALUE_EXPR
:
4282 if (TYPE_PRECISION (arg0_type
) > TYPE_PRECISION (exp_type
))
4285 if (! INTEGRAL_TYPE_P (arg0_type
)
4286 || (low
!= 0 && ! int_fits_type_p (low
, arg0_type
))
4287 || (high
!= 0 && ! int_fits_type_p (high
, arg0_type
)))
4290 n_low
= low
, n_high
= high
;
4293 n_low
= fold_convert_loc (loc
, arg0_type
, n_low
);
4296 n_high
= fold_convert_loc (loc
, arg0_type
, n_high
);
4298 /* If we're converting arg0 from an unsigned type, to exp,
4299 a signed type, we will be doing the comparison as unsigned.
4300 The tests above have already verified that LOW and HIGH
4303 So we have to ensure that we will handle large unsigned
4304 values the same way that the current signed bounds treat
4307 if (!TYPE_UNSIGNED (exp_type
) && TYPE_UNSIGNED (arg0_type
))
4311 /* For fixed-point modes, we need to pass the saturating flag
4312 as the 2nd parameter. */
4313 if (ALL_FIXED_POINT_MODE_P (TYPE_MODE (arg0_type
)))
4315 = lang_hooks
.types
.type_for_mode (TYPE_MODE (arg0_type
),
4316 TYPE_SATURATING (arg0_type
));
4319 = lang_hooks
.types
.type_for_mode (TYPE_MODE (arg0_type
), 1);
4321 /* A range without an upper bound is, naturally, unbounded.
4322 Since convert would have cropped a very large value, use
4323 the max value for the destination type. */
4325 = TYPE_MAX_VALUE (equiv_type
) ? TYPE_MAX_VALUE (equiv_type
)
4326 : TYPE_MAX_VALUE (arg0_type
);
4328 if (TYPE_PRECISION (exp_type
) == TYPE_PRECISION (arg0_type
))
4329 high_positive
= fold_build2_loc (loc
, RSHIFT_EXPR
, arg0_type
,
4330 fold_convert_loc (loc
, arg0_type
,
4332 build_int_cst (arg0_type
, 1));
4334 /* If the low bound is specified, "and" the range with the
4335 range for which the original unsigned value will be
4339 if (! merge_ranges (&n_in_p
, &n_low
, &n_high
, 1, n_low
, n_high
,
4340 1, fold_convert_loc (loc
, arg0_type
,
4345 in_p
= (n_in_p
== in_p
);
4349 /* Otherwise, "or" the range with the range of the input
4350 that will be interpreted as negative. */
4351 if (! merge_ranges (&n_in_p
, &n_low
, &n_high
, 0, n_low
, n_high
,
4352 1, fold_convert_loc (loc
, arg0_type
,
4357 in_p
= (in_p
!= n_in_p
);
4371 /* Given EXP, a logical expression, set the range it is testing into
4372 variables denoted by PIN_P, PLOW, and PHIGH. Return the expression
4373 actually being tested. *PLOW and *PHIGH will be made of the same
4374 type as the returned expression. If EXP is not a comparison, we
4375 will most likely not be returning a useful value and range. Set
4376 *STRICT_OVERFLOW_P to true if the return value is only valid
4377 because signed overflow is undefined; otherwise, do not change
4378 *STRICT_OVERFLOW_P. */
4381 make_range (tree exp
, int *pin_p
, tree
*plow
, tree
*phigh
,
4382 bool *strict_overflow_p
)
4384 enum tree_code code
;
4385 tree arg0
, arg1
= NULL_TREE
;
4386 tree exp_type
, nexp
;
4389 location_t loc
= EXPR_LOCATION (exp
);
4391 /* Start with simply saying "EXP != 0" and then look at the code of EXP
4392 and see if we can refine the range. Some of the cases below may not
4393 happen, but it doesn't seem worth worrying about this. We "continue"
4394 the outer loop when we've changed something; otherwise we "break"
4395 the switch, which will "break" the while. */
4398 low
= high
= build_int_cst (TREE_TYPE (exp
), 0);
4402 code
= TREE_CODE (exp
);
4403 exp_type
= TREE_TYPE (exp
);
4406 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
4408 if (TREE_OPERAND_LENGTH (exp
) > 0)
4409 arg0
= TREE_OPERAND (exp
, 0);
4410 if (TREE_CODE_CLASS (code
) == tcc_binary
4411 || TREE_CODE_CLASS (code
) == tcc_comparison
4412 || (TREE_CODE_CLASS (code
) == tcc_expression
4413 && TREE_OPERAND_LENGTH (exp
) > 1))
4414 arg1
= TREE_OPERAND (exp
, 1);
4416 if (arg0
== NULL_TREE
)
4419 nexp
= make_range_step (loc
, code
, arg0
, arg1
, exp_type
, &low
,
4420 &high
, &in_p
, strict_overflow_p
);
4421 if (nexp
== NULL_TREE
)
4426 /* If EXP is a constant, we can evaluate whether this is true or false. */
4427 if (TREE_CODE (exp
) == INTEGER_CST
)
4429 in_p
= in_p
== (integer_onep (range_binop (GE_EXPR
, integer_type_node
,
4431 && integer_onep (range_binop (LE_EXPR
, integer_type_node
,
4437 *pin_p
= in_p
, *plow
= low
, *phigh
= high
;
4441 /* Given a range, LOW, HIGH, and IN_P, an expression, EXP, and a result
4442 type, TYPE, return an expression to test if EXP is in (or out of, depending
4443 on IN_P) the range. Return 0 if the test couldn't be created. */
4446 build_range_check (location_t loc
, tree type
, tree exp
, int in_p
,
4447 tree low
, tree high
)
4449 tree etype
= TREE_TYPE (exp
), value
;
4451 /* Disable this optimization for function pointer expressions
4452 on targets that require function pointer canonicalization. */
4453 if (targetm
.have_canonicalize_funcptr_for_compare ()
4454 && TREE_CODE (etype
) == POINTER_TYPE
4455 && TREE_CODE (TREE_TYPE (etype
)) == FUNCTION_TYPE
)
4460 value
= build_range_check (loc
, type
, exp
, 1, low
, high
);
4462 return invert_truthvalue_loc (loc
, value
);
4467 if (low
== 0 && high
== 0)
4468 return omit_one_operand_loc (loc
, type
, build_int_cst (type
, 1), exp
);
4471 return fold_build2_loc (loc
, LE_EXPR
, type
, exp
,
4472 fold_convert_loc (loc
, etype
, high
));
4475 return fold_build2_loc (loc
, GE_EXPR
, type
, exp
,
4476 fold_convert_loc (loc
, etype
, low
));
4478 if (operand_equal_p (low
, high
, 0))
4479 return fold_build2_loc (loc
, EQ_EXPR
, type
, exp
,
4480 fold_convert_loc (loc
, etype
, low
));
4482 if (integer_zerop (low
))
4484 if (! TYPE_UNSIGNED (etype
))
4486 etype
= unsigned_type_for (etype
);
4487 high
= fold_convert_loc (loc
, etype
, high
);
4488 exp
= fold_convert_loc (loc
, etype
, exp
);
4490 return build_range_check (loc
, type
, exp
, 1, 0, high
);
4493 /* Optimize (c>=1) && (c<=127) into (signed char)c > 0. */
4494 if (integer_onep (low
) && TREE_CODE (high
) == INTEGER_CST
)
4496 int prec
= TYPE_PRECISION (etype
);
4498 if (wi::mask (prec
- 1, false, prec
) == high
)
4500 if (TYPE_UNSIGNED (etype
))
4502 tree signed_etype
= signed_type_for (etype
);
4503 if (TYPE_PRECISION (signed_etype
) != TYPE_PRECISION (etype
))
4505 = build_nonstandard_integer_type (TYPE_PRECISION (etype
), 0);
4507 etype
= signed_etype
;
4508 exp
= fold_convert_loc (loc
, etype
, exp
);
4510 return fold_build2_loc (loc
, GT_EXPR
, type
, exp
,
4511 build_int_cst (etype
, 0));
4515 /* Optimize (c>=low) && (c<=high) into (c-low>=0) && (c-low<=high-low).
4516 This requires wrap-around arithmetics for the type of the expression.
4517 First make sure that arithmetics in this type is valid, then make sure
4518 that it wraps around. */
4519 if (TREE_CODE (etype
) == ENUMERAL_TYPE
|| TREE_CODE (etype
) == BOOLEAN_TYPE
)
4520 etype
= lang_hooks
.types
.type_for_size (TYPE_PRECISION (etype
),
4521 TYPE_UNSIGNED (etype
));
4523 if (TREE_CODE (etype
) == INTEGER_TYPE
&& !TYPE_OVERFLOW_WRAPS (etype
))
4525 tree utype
, minv
, maxv
;
4527 /* Check if (unsigned) INT_MAX + 1 == (unsigned) INT_MIN
4528 for the type in question, as we rely on this here. */
4529 utype
= unsigned_type_for (etype
);
4530 maxv
= fold_convert_loc (loc
, utype
, TYPE_MAX_VALUE (etype
));
4531 maxv
= range_binop (PLUS_EXPR
, NULL_TREE
, maxv
, 1,
4532 build_int_cst (TREE_TYPE (maxv
), 1), 1);
4533 minv
= fold_convert_loc (loc
, utype
, TYPE_MIN_VALUE (etype
));
4535 if (integer_zerop (range_binop (NE_EXPR
, integer_type_node
,
4542 high
= fold_convert_loc (loc
, etype
, high
);
4543 low
= fold_convert_loc (loc
, etype
, low
);
4544 exp
= fold_convert_loc (loc
, etype
, exp
);
4546 value
= const_binop (MINUS_EXPR
, high
, low
);
4549 if (POINTER_TYPE_P (etype
))
4551 if (value
!= 0 && !TREE_OVERFLOW (value
))
4553 low
= fold_build1_loc (loc
, NEGATE_EXPR
, TREE_TYPE (low
), low
);
4554 return build_range_check (loc
, type
,
4555 fold_build_pointer_plus_loc (loc
, exp
, low
),
4556 1, build_int_cst (etype
, 0), value
);
4561 if (value
!= 0 && !TREE_OVERFLOW (value
))
4562 return build_range_check (loc
, type
,
4563 fold_build2_loc (loc
, MINUS_EXPR
, etype
, exp
, low
),
4564 1, build_int_cst (etype
, 0), value
);
4569 /* Return the predecessor of VAL in its type, handling the infinite case. */
4572 range_predecessor (tree val
)
4574 tree type
= TREE_TYPE (val
);
4576 if (INTEGRAL_TYPE_P (type
)
4577 && operand_equal_p (val
, TYPE_MIN_VALUE (type
), 0))
4580 return range_binop (MINUS_EXPR
, NULL_TREE
, val
, 0,
4581 build_int_cst (TREE_TYPE (val
), 1), 0);
4584 /* Return the successor of VAL in its type, handling the infinite case. */
4587 range_successor (tree val
)
4589 tree type
= TREE_TYPE (val
);
4591 if (INTEGRAL_TYPE_P (type
)
4592 && operand_equal_p (val
, TYPE_MAX_VALUE (type
), 0))
4595 return range_binop (PLUS_EXPR
, NULL_TREE
, val
, 0,
4596 build_int_cst (TREE_TYPE (val
), 1), 0);
4599 /* Given two ranges, see if we can merge them into one. Return 1 if we
4600 can, 0 if we can't. Set the output range into the specified parameters. */
4603 merge_ranges (int *pin_p
, tree
*plow
, tree
*phigh
, int in0_p
, tree low0
,
4604 tree high0
, int in1_p
, tree low1
, tree high1
)
4612 int lowequal
= ((low0
== 0 && low1
== 0)
4613 || integer_onep (range_binop (EQ_EXPR
, integer_type_node
,
4614 low0
, 0, low1
, 0)));
4615 int highequal
= ((high0
== 0 && high1
== 0)
4616 || integer_onep (range_binop (EQ_EXPR
, integer_type_node
,
4617 high0
, 1, high1
, 1)));
4619 /* Make range 0 be the range that starts first, or ends last if they
4620 start at the same value. Swap them if it isn't. */
4621 if (integer_onep (range_binop (GT_EXPR
, integer_type_node
,
4624 && integer_onep (range_binop (GT_EXPR
, integer_type_node
,
4625 high1
, 1, high0
, 1))))
4627 temp
= in0_p
, in0_p
= in1_p
, in1_p
= temp
;
4628 tem
= low0
, low0
= low1
, low1
= tem
;
4629 tem
= high0
, high0
= high1
, high1
= tem
;
4632 /* Now flag two cases, whether the ranges are disjoint or whether the
4633 second range is totally subsumed in the first. Note that the tests
4634 below are simplified by the ones above. */
4635 no_overlap
= integer_onep (range_binop (LT_EXPR
, integer_type_node
,
4636 high0
, 1, low1
, 0));
4637 subset
= integer_onep (range_binop (LE_EXPR
, integer_type_node
,
4638 high1
, 1, high0
, 1));
4640 /* We now have four cases, depending on whether we are including or
4641 excluding the two ranges. */
4644 /* If they don't overlap, the result is false. If the second range
4645 is a subset it is the result. Otherwise, the range is from the start
4646 of the second to the end of the first. */
4648 in_p
= 0, low
= high
= 0;
4650 in_p
= 1, low
= low1
, high
= high1
;
4652 in_p
= 1, low
= low1
, high
= high0
;
4655 else if (in0_p
&& ! in1_p
)
4657 /* If they don't overlap, the result is the first range. If they are
4658 equal, the result is false. If the second range is a subset of the
4659 first, and the ranges begin at the same place, we go from just after
4660 the end of the second range to the end of the first. If the second
4661 range is not a subset of the first, or if it is a subset and both
4662 ranges end at the same place, the range starts at the start of the
4663 first range and ends just before the second range.
4664 Otherwise, we can't describe this as a single range. */
4666 in_p
= 1, low
= low0
, high
= high0
;
4667 else if (lowequal
&& highequal
)
4668 in_p
= 0, low
= high
= 0;
4669 else if (subset
&& lowequal
)
4671 low
= range_successor (high1
);
4676 /* We are in the weird situation where high0 > high1 but
4677 high1 has no successor. Punt. */
4681 else if (! subset
|| highequal
)
4684 high
= range_predecessor (low1
);
4688 /* low0 < low1 but low1 has no predecessor. Punt. */
4696 else if (! in0_p
&& in1_p
)
4698 /* If they don't overlap, the result is the second range. If the second
4699 is a subset of the first, the result is false. Otherwise,
4700 the range starts just after the first range and ends at the
4701 end of the second. */
4703 in_p
= 1, low
= low1
, high
= high1
;
4704 else if (subset
|| highequal
)
4705 in_p
= 0, low
= high
= 0;
4708 low
= range_successor (high0
);
4713 /* high1 > high0 but high0 has no successor. Punt. */
4721 /* The case where we are excluding both ranges. Here the complex case
4722 is if they don't overlap. In that case, the only time we have a
4723 range is if they are adjacent. If the second is a subset of the
4724 first, the result is the first. Otherwise, the range to exclude
4725 starts at the beginning of the first range and ends at the end of the
4729 if (integer_onep (range_binop (EQ_EXPR
, integer_type_node
,
4730 range_successor (high0
),
4732 in_p
= 0, low
= low0
, high
= high1
;
4735 /* Canonicalize - [min, x] into - [-, x]. */
4736 if (low0
&& TREE_CODE (low0
) == INTEGER_CST
)
4737 switch (TREE_CODE (TREE_TYPE (low0
)))
4740 if (TYPE_PRECISION (TREE_TYPE (low0
))
4741 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (low0
))))
4745 if (tree_int_cst_equal (low0
,
4746 TYPE_MIN_VALUE (TREE_TYPE (low0
))))
4750 if (TYPE_UNSIGNED (TREE_TYPE (low0
))
4751 && integer_zerop (low0
))
4758 /* Canonicalize - [x, max] into - [x, -]. */
4759 if (high1
&& TREE_CODE (high1
) == INTEGER_CST
)
4760 switch (TREE_CODE (TREE_TYPE (high1
)))
4763 if (TYPE_PRECISION (TREE_TYPE (high1
))
4764 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (high1
))))
4768 if (tree_int_cst_equal (high1
,
4769 TYPE_MAX_VALUE (TREE_TYPE (high1
))))
4773 if (TYPE_UNSIGNED (TREE_TYPE (high1
))
4774 && integer_zerop (range_binop (PLUS_EXPR
, NULL_TREE
,
4776 build_int_cst (TREE_TYPE (high1
), 1),
4784 /* The ranges might be also adjacent between the maximum and
4785 minimum values of the given type. For
4786 - [{min,-}, x] and - [y, {max,-}] ranges where x + 1 < y
4787 return + [x + 1, y - 1]. */
4788 if (low0
== 0 && high1
== 0)
4790 low
= range_successor (high0
);
4791 high
= range_predecessor (low1
);
4792 if (low
== 0 || high
== 0)
4802 in_p
= 0, low
= low0
, high
= high0
;
4804 in_p
= 0, low
= low0
, high
= high1
;
4807 *pin_p
= in_p
, *plow
= low
, *phigh
= high
;
4812 /* Subroutine of fold, looking inside expressions of the form
4813 A op B ? A : C, where ARG0, ARG1 and ARG2 are the three operands
4814 of the COND_EXPR. This function is being used also to optimize
4815 A op B ? C : A, by reversing the comparison first.
4817 Return a folded expression whose code is not a COND_EXPR
4818 anymore, or NULL_TREE if no folding opportunity is found. */
4821 fold_cond_expr_with_comparison (location_t loc
, tree type
,
4822 tree arg0
, tree arg1
, tree arg2
)
4824 enum tree_code comp_code
= TREE_CODE (arg0
);
4825 tree arg00
= TREE_OPERAND (arg0
, 0);
4826 tree arg01
= TREE_OPERAND (arg0
, 1);
4827 tree arg1_type
= TREE_TYPE (arg1
);
4833 /* If we have A op 0 ? A : -A, consider applying the following
4836 A == 0? A : -A same as -A
4837 A != 0? A : -A same as A
4838 A >= 0? A : -A same as abs (A)
4839 A > 0? A : -A same as abs (A)
4840 A <= 0? A : -A same as -abs (A)
4841 A < 0? A : -A same as -abs (A)
4843 None of these transformations work for modes with signed
4844 zeros. If A is +/-0, the first two transformations will
4845 change the sign of the result (from +0 to -0, or vice
4846 versa). The last four will fix the sign of the result,
4847 even though the original expressions could be positive or
4848 negative, depending on the sign of A.
4850 Note that all these transformations are correct if A is
4851 NaN, since the two alternatives (A and -A) are also NaNs. */
4852 if (!HONOR_SIGNED_ZEROS (element_mode (type
))
4853 && (FLOAT_TYPE_P (TREE_TYPE (arg01
))
4854 ? real_zerop (arg01
)
4855 : integer_zerop (arg01
))
4856 && ((TREE_CODE (arg2
) == NEGATE_EXPR
4857 && operand_equal_p (TREE_OPERAND (arg2
, 0), arg1
, 0))
4858 /* In the case that A is of the form X-Y, '-A' (arg2) may
4859 have already been folded to Y-X, check for that. */
4860 || (TREE_CODE (arg1
) == MINUS_EXPR
4861 && TREE_CODE (arg2
) == MINUS_EXPR
4862 && operand_equal_p (TREE_OPERAND (arg1
, 0),
4863 TREE_OPERAND (arg2
, 1), 0)
4864 && operand_equal_p (TREE_OPERAND (arg1
, 1),
4865 TREE_OPERAND (arg2
, 0), 0))))
4870 tem
= fold_convert_loc (loc
, arg1_type
, arg1
);
4871 return pedantic_non_lvalue_loc (loc
,
4872 fold_convert_loc (loc
, type
,
4873 negate_expr (tem
)));
4876 return pedantic_non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg1
));
4879 if (flag_trapping_math
)
4884 if (TYPE_UNSIGNED (TREE_TYPE (arg1
)))
4885 arg1
= fold_convert_loc (loc
, signed_type_for
4886 (TREE_TYPE (arg1
)), arg1
);
4887 tem
= fold_build1_loc (loc
, ABS_EXPR
, TREE_TYPE (arg1
), arg1
);
4888 return pedantic_non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, tem
));
4891 if (flag_trapping_math
)
4895 if (TYPE_UNSIGNED (TREE_TYPE (arg1
)))
4896 arg1
= fold_convert_loc (loc
, signed_type_for
4897 (TREE_TYPE (arg1
)), arg1
);
4898 tem
= fold_build1_loc (loc
, ABS_EXPR
, TREE_TYPE (arg1
), arg1
);
4899 return negate_expr (fold_convert_loc (loc
, type
, tem
));
4901 gcc_assert (TREE_CODE_CLASS (comp_code
) == tcc_comparison
);
4905 /* A != 0 ? A : 0 is simply A, unless A is -0. Likewise
4906 A == 0 ? A : 0 is always 0 unless A is -0. Note that
4907 both transformations are correct when A is NaN: A != 0
4908 is then true, and A == 0 is false. */
4910 if (!HONOR_SIGNED_ZEROS (element_mode (type
))
4911 && integer_zerop (arg01
) && integer_zerop (arg2
))
4913 if (comp_code
== NE_EXPR
)
4914 return pedantic_non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg1
));
4915 else if (comp_code
== EQ_EXPR
)
4916 return build_zero_cst (type
);
4919 /* Try some transformations of A op B ? A : B.
4921 A == B? A : B same as B
4922 A != B? A : B same as A
4923 A >= B? A : B same as max (A, B)
4924 A > B? A : B same as max (B, A)
4925 A <= B? A : B same as min (A, B)
4926 A < B? A : B same as min (B, A)
4928 As above, these transformations don't work in the presence
4929 of signed zeros. For example, if A and B are zeros of
4930 opposite sign, the first two transformations will change
4931 the sign of the result. In the last four, the original
4932 expressions give different results for (A=+0, B=-0) and
4933 (A=-0, B=+0), but the transformed expressions do not.
4935 The first two transformations are correct if either A or B
4936 is a NaN. In the first transformation, the condition will
4937 be false, and B will indeed be chosen. In the case of the
4938 second transformation, the condition A != B will be true,
4939 and A will be chosen.
4941 The conversions to max() and min() are not correct if B is
4942 a number and A is not. The conditions in the original
4943 expressions will be false, so all four give B. The min()
4944 and max() versions would give a NaN instead. */
4945 if (!HONOR_SIGNED_ZEROS (element_mode (type
))
4946 && operand_equal_for_comparison_p (arg01
, arg2
, arg00
)
4947 /* Avoid these transformations if the COND_EXPR may be used
4948 as an lvalue in the C++ front-end. PR c++/19199. */
4950 || VECTOR_TYPE_P (type
)
4951 || (! lang_GNU_CXX ()
4952 && strcmp (lang_hooks
.name
, "GNU Objective-C++") != 0)
4953 || ! maybe_lvalue_p (arg1
)
4954 || ! maybe_lvalue_p (arg2
)))
4956 tree comp_op0
= arg00
;
4957 tree comp_op1
= arg01
;
4958 tree comp_type
= TREE_TYPE (comp_op0
);
4960 /* Avoid adding NOP_EXPRs in case this is an lvalue. */
4961 if (TYPE_MAIN_VARIANT (comp_type
) == TYPE_MAIN_VARIANT (type
))
4971 return pedantic_non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg2
));
4973 return pedantic_non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg1
));
4978 /* In C++ a ?: expression can be an lvalue, so put the
4979 operand which will be used if they are equal first
4980 so that we can convert this back to the
4981 corresponding COND_EXPR. */
4982 if (!HONOR_NANS (arg1
))
4984 comp_op0
= fold_convert_loc (loc
, comp_type
, comp_op0
);
4985 comp_op1
= fold_convert_loc (loc
, comp_type
, comp_op1
);
4986 tem
= (comp_code
== LE_EXPR
|| comp_code
== UNLE_EXPR
)
4987 ? fold_build2_loc (loc
, MIN_EXPR
, comp_type
, comp_op0
, comp_op1
)
4988 : fold_build2_loc (loc
, MIN_EXPR
, comp_type
,
4989 comp_op1
, comp_op0
);
4990 return pedantic_non_lvalue_loc (loc
,
4991 fold_convert_loc (loc
, type
, tem
));
4998 if (!HONOR_NANS (arg1
))
5000 comp_op0
= fold_convert_loc (loc
, comp_type
, comp_op0
);
5001 comp_op1
= fold_convert_loc (loc
, comp_type
, comp_op1
);
5002 tem
= (comp_code
== GE_EXPR
|| comp_code
== UNGE_EXPR
)
5003 ? fold_build2_loc (loc
, MAX_EXPR
, comp_type
, comp_op0
, comp_op1
)
5004 : fold_build2_loc (loc
, MAX_EXPR
, comp_type
,
5005 comp_op1
, comp_op0
);
5006 return pedantic_non_lvalue_loc (loc
,
5007 fold_convert_loc (loc
, type
, tem
));
5011 if (!HONOR_NANS (arg1
))
5012 return pedantic_non_lvalue_loc (loc
,
5013 fold_convert_loc (loc
, type
, arg2
));
5016 if (!HONOR_NANS (arg1
))
5017 return pedantic_non_lvalue_loc (loc
,
5018 fold_convert_loc (loc
, type
, arg1
));
5021 gcc_assert (TREE_CODE_CLASS (comp_code
) == tcc_comparison
);
5026 /* If this is A op C1 ? A : C2 with C1 and C2 constant integers,
5027 we might still be able to simplify this. For example,
5028 if C1 is one less or one more than C2, this might have started
5029 out as a MIN or MAX and been transformed by this function.
5030 Only good for INTEGER_TYPEs, because we need TYPE_MAX_VALUE. */
5032 if (INTEGRAL_TYPE_P (type
)
5033 && TREE_CODE (arg01
) == INTEGER_CST
5034 && TREE_CODE (arg2
) == INTEGER_CST
)
5038 if (TREE_CODE (arg1
) == INTEGER_CST
)
5040 /* We can replace A with C1 in this case. */
5041 arg1
= fold_convert_loc (loc
, type
, arg01
);
5042 return fold_build3_loc (loc
, COND_EXPR
, type
, arg0
, arg1
, arg2
);
5045 /* If C1 is C2 + 1, this is min(A, C2), but use ARG00's type for
5046 MIN_EXPR, to preserve the signedness of the comparison. */
5047 if (! operand_equal_p (arg2
, TYPE_MAX_VALUE (type
),
5049 && operand_equal_p (arg01
,
5050 const_binop (PLUS_EXPR
, arg2
,
5051 build_int_cst (type
, 1)),
5054 tem
= fold_build2_loc (loc
, MIN_EXPR
, TREE_TYPE (arg00
), arg00
,
5055 fold_convert_loc (loc
, TREE_TYPE (arg00
),
5057 return pedantic_non_lvalue_loc (loc
,
5058 fold_convert_loc (loc
, type
, tem
));
5063 /* If C1 is C2 - 1, this is min(A, C2), with the same care
5065 if (! operand_equal_p (arg2
, TYPE_MIN_VALUE (type
),
5067 && operand_equal_p (arg01
,
5068 const_binop (MINUS_EXPR
, arg2
,
5069 build_int_cst (type
, 1)),
5072 tem
= fold_build2_loc (loc
, MIN_EXPR
, TREE_TYPE (arg00
), arg00
,
5073 fold_convert_loc (loc
, TREE_TYPE (arg00
),
5075 return pedantic_non_lvalue_loc (loc
,
5076 fold_convert_loc (loc
, type
, tem
));
5081 /* If C1 is C2 - 1, this is max(A, C2), but use ARG00's type for
5082 MAX_EXPR, to preserve the signedness of the comparison. */
5083 if (! operand_equal_p (arg2
, TYPE_MIN_VALUE (type
),
5085 && operand_equal_p (arg01
,
5086 const_binop (MINUS_EXPR
, arg2
,
5087 build_int_cst (type
, 1)),
5090 tem
= fold_build2_loc (loc
, MAX_EXPR
, TREE_TYPE (arg00
), arg00
,
5091 fold_convert_loc (loc
, TREE_TYPE (arg00
),
5093 return pedantic_non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, tem
));
5098 /* If C1 is C2 + 1, this is max(A, C2), with the same care as above. */
5099 if (! operand_equal_p (arg2
, TYPE_MAX_VALUE (type
),
5101 && operand_equal_p (arg01
,
5102 const_binop (PLUS_EXPR
, arg2
,
5103 build_int_cst (type
, 1)),
5106 tem
= fold_build2_loc (loc
, MAX_EXPR
, TREE_TYPE (arg00
), arg00
,
5107 fold_convert_loc (loc
, TREE_TYPE (arg00
),
5109 return pedantic_non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, tem
));
5123 #ifndef LOGICAL_OP_NON_SHORT_CIRCUIT
5124 #define LOGICAL_OP_NON_SHORT_CIRCUIT \
5125 (BRANCH_COST (optimize_function_for_speed_p (cfun), \
5129 /* EXP is some logical combination of boolean tests. See if we can
5130 merge it into some range test. Return the new tree if so. */
5133 fold_range_test (location_t loc
, enum tree_code code
, tree type
,
5136 int or_op
= (code
== TRUTH_ORIF_EXPR
5137 || code
== TRUTH_OR_EXPR
);
5138 int in0_p
, in1_p
, in_p
;
5139 tree low0
, low1
, low
, high0
, high1
, high
;
5140 bool strict_overflow_p
= false;
5142 const char * const warnmsg
= G_("assuming signed overflow does not occur "
5143 "when simplifying range test");
5145 if (!INTEGRAL_TYPE_P (type
))
5148 lhs
= make_range (op0
, &in0_p
, &low0
, &high0
, &strict_overflow_p
);
5149 rhs
= make_range (op1
, &in1_p
, &low1
, &high1
, &strict_overflow_p
);
5151 /* If this is an OR operation, invert both sides; we will invert
5152 again at the end. */
5154 in0_p
= ! in0_p
, in1_p
= ! in1_p
;
5156 /* If both expressions are the same, if we can merge the ranges, and we
5157 can build the range test, return it or it inverted. If one of the
5158 ranges is always true or always false, consider it to be the same
5159 expression as the other. */
5160 if ((lhs
== 0 || rhs
== 0 || operand_equal_p (lhs
, rhs
, 0))
5161 && merge_ranges (&in_p
, &low
, &high
, in0_p
, low0
, high0
,
5163 && 0 != (tem
= (build_range_check (loc
, type
,
5165 : rhs
!= 0 ? rhs
: integer_zero_node
,
5168 if (strict_overflow_p
)
5169 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_COMPARISON
);
5170 return or_op
? invert_truthvalue_loc (loc
, tem
) : tem
;
5173 /* On machines where the branch cost is expensive, if this is a
5174 short-circuited branch and the underlying object on both sides
5175 is the same, make a non-short-circuit operation. */
5176 else if (LOGICAL_OP_NON_SHORT_CIRCUIT
5177 && lhs
!= 0 && rhs
!= 0
5178 && (code
== TRUTH_ANDIF_EXPR
5179 || code
== TRUTH_ORIF_EXPR
)
5180 && operand_equal_p (lhs
, rhs
, 0))
5182 /* If simple enough, just rewrite. Otherwise, make a SAVE_EXPR
5183 unless we are at top level or LHS contains a PLACEHOLDER_EXPR, in
5184 which cases we can't do this. */
5185 if (simple_operand_p (lhs
))
5186 return build2_loc (loc
, code
== TRUTH_ANDIF_EXPR
5187 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
,
5190 else if (!lang_hooks
.decls
.global_bindings_p ()
5191 && !CONTAINS_PLACEHOLDER_P (lhs
))
5193 tree common
= save_expr (lhs
);
5195 if (0 != (lhs
= build_range_check (loc
, type
, common
,
5196 or_op
? ! in0_p
: in0_p
,
5198 && (0 != (rhs
= build_range_check (loc
, type
, common
,
5199 or_op
? ! in1_p
: in1_p
,
5202 if (strict_overflow_p
)
5203 fold_overflow_warning (warnmsg
,
5204 WARN_STRICT_OVERFLOW_COMPARISON
);
5205 return build2_loc (loc
, code
== TRUTH_ANDIF_EXPR
5206 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
,
5215 /* Subroutine for fold_truth_andor_1: C is an INTEGER_CST interpreted as a P
5216 bit value. Arrange things so the extra bits will be set to zero if and
5217 only if C is signed-extended to its full width. If MASK is nonzero,
5218 it is an INTEGER_CST that should be AND'ed with the extra bits. */
5221 unextend (tree c
, int p
, int unsignedp
, tree mask
)
5223 tree type
= TREE_TYPE (c
);
5224 int modesize
= GET_MODE_BITSIZE (TYPE_MODE (type
));
5227 if (p
== modesize
|| unsignedp
)
5230 /* We work by getting just the sign bit into the low-order bit, then
5231 into the high-order bit, then sign-extend. We then XOR that value
5233 temp
= build_int_cst (TREE_TYPE (c
), wi::extract_uhwi (c
, p
- 1, 1));
5235 /* We must use a signed type in order to get an arithmetic right shift.
5236 However, we must also avoid introducing accidental overflows, so that
5237 a subsequent call to integer_zerop will work. Hence we must
5238 do the type conversion here. At this point, the constant is either
5239 zero or one, and the conversion to a signed type can never overflow.
5240 We could get an overflow if this conversion is done anywhere else. */
5241 if (TYPE_UNSIGNED (type
))
5242 temp
= fold_convert (signed_type_for (type
), temp
);
5244 temp
= const_binop (LSHIFT_EXPR
, temp
, size_int (modesize
- 1));
5245 temp
= const_binop (RSHIFT_EXPR
, temp
, size_int (modesize
- p
- 1));
5247 temp
= const_binop (BIT_AND_EXPR
, temp
,
5248 fold_convert (TREE_TYPE (c
), mask
));
5249 /* If necessary, convert the type back to match the type of C. */
5250 if (TYPE_UNSIGNED (type
))
5251 temp
= fold_convert (type
, temp
);
5253 return fold_convert (type
, const_binop (BIT_XOR_EXPR
, c
, temp
));
5256 /* For an expression that has the form
5260 we can drop one of the inner expressions and simplify to
5264 LOC is the location of the resulting expression. OP is the inner
5265 logical operation; the left-hand side in the examples above, while CMPOP
5266 is the right-hand side. RHS_ONLY is used to prevent us from accidentally
5267 removing a condition that guards another, as in
5268 (A != NULL && A->...) || A == NULL
5269 which we must not transform. If RHS_ONLY is true, only eliminate the
5270 right-most operand of the inner logical operation. */
5273 merge_truthop_with_opposite_arm (location_t loc
, tree op
, tree cmpop
,
5276 tree type
= TREE_TYPE (cmpop
);
5277 enum tree_code code
= TREE_CODE (cmpop
);
5278 enum tree_code truthop_code
= TREE_CODE (op
);
5279 tree lhs
= TREE_OPERAND (op
, 0);
5280 tree rhs
= TREE_OPERAND (op
, 1);
5281 tree orig_lhs
= lhs
, orig_rhs
= rhs
;
5282 enum tree_code rhs_code
= TREE_CODE (rhs
);
5283 enum tree_code lhs_code
= TREE_CODE (lhs
);
5284 enum tree_code inv_code
;
5286 if (TREE_SIDE_EFFECTS (op
) || TREE_SIDE_EFFECTS (cmpop
))
5289 if (TREE_CODE_CLASS (code
) != tcc_comparison
)
5292 if (rhs_code
== truthop_code
)
5294 tree newrhs
= merge_truthop_with_opposite_arm (loc
, rhs
, cmpop
, rhs_only
);
5295 if (newrhs
!= NULL_TREE
)
5298 rhs_code
= TREE_CODE (rhs
);
5301 if (lhs_code
== truthop_code
&& !rhs_only
)
5303 tree newlhs
= merge_truthop_with_opposite_arm (loc
, lhs
, cmpop
, false);
5304 if (newlhs
!= NULL_TREE
)
5307 lhs_code
= TREE_CODE (lhs
);
5311 inv_code
= invert_tree_comparison (code
, HONOR_NANS (type
));
5312 if (inv_code
== rhs_code
5313 && operand_equal_p (TREE_OPERAND (rhs
, 0), TREE_OPERAND (cmpop
, 0), 0)
5314 && operand_equal_p (TREE_OPERAND (rhs
, 1), TREE_OPERAND (cmpop
, 1), 0))
5316 if (!rhs_only
&& inv_code
== lhs_code
5317 && operand_equal_p (TREE_OPERAND (lhs
, 0), TREE_OPERAND (cmpop
, 0), 0)
5318 && operand_equal_p (TREE_OPERAND (lhs
, 1), TREE_OPERAND (cmpop
, 1), 0))
5320 if (rhs
!= orig_rhs
|| lhs
!= orig_lhs
)
5321 return fold_build2_loc (loc
, truthop_code
, TREE_TYPE (cmpop
),
5326 /* Find ways of folding logical expressions of LHS and RHS:
5327 Try to merge two comparisons to the same innermost item.
5328 Look for range tests like "ch >= '0' && ch <= '9'".
5329 Look for combinations of simple terms on machines with expensive branches
5330 and evaluate the RHS unconditionally.
5332 For example, if we have p->a == 2 && p->b == 4 and we can make an
5333 object large enough to span both A and B, we can do this with a comparison
5334 against the object ANDed with the a mask.
5336 If we have p->a == q->a && p->b == q->b, we may be able to use bit masking
5337 operations to do this with one comparison.
5339 We check for both normal comparisons and the BIT_AND_EXPRs made this by
5340 function and the one above.
5342 CODE is the logical operation being done. It can be TRUTH_ANDIF_EXPR,
5343 TRUTH_AND_EXPR, TRUTH_ORIF_EXPR, or TRUTH_OR_EXPR.
5345 TRUTH_TYPE is the type of the logical operand and LHS and RHS are its
5348 We return the simplified tree or 0 if no optimization is possible. */
5351 fold_truth_andor_1 (location_t loc
, enum tree_code code
, tree truth_type
,
5354 /* If this is the "or" of two comparisons, we can do something if
5355 the comparisons are NE_EXPR. If this is the "and", we can do something
5356 if the comparisons are EQ_EXPR. I.e.,
5357 (a->b == 2 && a->c == 4) can become (a->new == NEW).
5359 WANTED_CODE is this operation code. For single bit fields, we can
5360 convert EQ_EXPR to NE_EXPR so we need not reject the "wrong"
5361 comparison for one-bit fields. */
5363 enum tree_code wanted_code
;
5364 enum tree_code lcode
, rcode
;
5365 tree ll_arg
, lr_arg
, rl_arg
, rr_arg
;
5366 tree ll_inner
, lr_inner
, rl_inner
, rr_inner
;
5367 HOST_WIDE_INT ll_bitsize
, ll_bitpos
, lr_bitsize
, lr_bitpos
;
5368 HOST_WIDE_INT rl_bitsize
, rl_bitpos
, rr_bitsize
, rr_bitpos
;
5369 HOST_WIDE_INT xll_bitpos
, xlr_bitpos
, xrl_bitpos
, xrr_bitpos
;
5370 HOST_WIDE_INT lnbitsize
, lnbitpos
, rnbitsize
, rnbitpos
;
5371 int ll_unsignedp
, lr_unsignedp
, rl_unsignedp
, rr_unsignedp
;
5372 machine_mode ll_mode
, lr_mode
, rl_mode
, rr_mode
;
5373 machine_mode lnmode
, rnmode
;
5374 tree ll_mask
, lr_mask
, rl_mask
, rr_mask
;
5375 tree ll_and_mask
, lr_and_mask
, rl_and_mask
, rr_and_mask
;
5376 tree l_const
, r_const
;
5377 tree lntype
, rntype
, result
;
5378 HOST_WIDE_INT first_bit
, end_bit
;
5381 /* Start by getting the comparison codes. Fail if anything is volatile.
5382 If one operand is a BIT_AND_EXPR with the constant one, treat it as if
5383 it were surrounded with a NE_EXPR. */
5385 if (TREE_SIDE_EFFECTS (lhs
) || TREE_SIDE_EFFECTS (rhs
))
5388 lcode
= TREE_CODE (lhs
);
5389 rcode
= TREE_CODE (rhs
);
5391 if (lcode
== BIT_AND_EXPR
&& integer_onep (TREE_OPERAND (lhs
, 1)))
5393 lhs
= build2 (NE_EXPR
, truth_type
, lhs
,
5394 build_int_cst (TREE_TYPE (lhs
), 0));
5398 if (rcode
== BIT_AND_EXPR
&& integer_onep (TREE_OPERAND (rhs
, 1)))
5400 rhs
= build2 (NE_EXPR
, truth_type
, rhs
,
5401 build_int_cst (TREE_TYPE (rhs
), 0));
5405 if (TREE_CODE_CLASS (lcode
) != tcc_comparison
5406 || TREE_CODE_CLASS (rcode
) != tcc_comparison
)
5409 ll_arg
= TREE_OPERAND (lhs
, 0);
5410 lr_arg
= TREE_OPERAND (lhs
, 1);
5411 rl_arg
= TREE_OPERAND (rhs
, 0);
5412 rr_arg
= TREE_OPERAND (rhs
, 1);
5414 /* Simplify (x<y) && (x==y) into (x<=y) and related optimizations. */
5415 if (simple_operand_p (ll_arg
)
5416 && simple_operand_p (lr_arg
))
5418 if (operand_equal_p (ll_arg
, rl_arg
, 0)
5419 && operand_equal_p (lr_arg
, rr_arg
, 0))
5421 result
= combine_comparisons (loc
, code
, lcode
, rcode
,
5422 truth_type
, ll_arg
, lr_arg
);
5426 else if (operand_equal_p (ll_arg
, rr_arg
, 0)
5427 && operand_equal_p (lr_arg
, rl_arg
, 0))
5429 result
= combine_comparisons (loc
, code
, lcode
,
5430 swap_tree_comparison (rcode
),
5431 truth_type
, ll_arg
, lr_arg
);
5437 code
= ((code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
)
5438 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
);
5440 /* If the RHS can be evaluated unconditionally and its operands are
5441 simple, it wins to evaluate the RHS unconditionally on machines
5442 with expensive branches. In this case, this isn't a comparison
5443 that can be merged. */
5445 if (BRANCH_COST (optimize_function_for_speed_p (cfun
),
5447 && ! FLOAT_TYPE_P (TREE_TYPE (rl_arg
))
5448 && simple_operand_p (rl_arg
)
5449 && simple_operand_p (rr_arg
))
5451 /* Convert (a != 0) || (b != 0) into (a | b) != 0. */
5452 if (code
== TRUTH_OR_EXPR
5453 && lcode
== NE_EXPR
&& integer_zerop (lr_arg
)
5454 && rcode
== NE_EXPR
&& integer_zerop (rr_arg
)
5455 && TREE_TYPE (ll_arg
) == TREE_TYPE (rl_arg
)
5456 && INTEGRAL_TYPE_P (TREE_TYPE (ll_arg
)))
5457 return build2_loc (loc
, NE_EXPR
, truth_type
,
5458 build2 (BIT_IOR_EXPR
, TREE_TYPE (ll_arg
),
5460 build_int_cst (TREE_TYPE (ll_arg
), 0));
5462 /* Convert (a == 0) && (b == 0) into (a | b) == 0. */
5463 if (code
== TRUTH_AND_EXPR
5464 && lcode
== EQ_EXPR
&& integer_zerop (lr_arg
)
5465 && rcode
== EQ_EXPR
&& integer_zerop (rr_arg
)
5466 && TREE_TYPE (ll_arg
) == TREE_TYPE (rl_arg
)
5467 && INTEGRAL_TYPE_P (TREE_TYPE (ll_arg
)))
5468 return build2_loc (loc
, EQ_EXPR
, truth_type
,
5469 build2 (BIT_IOR_EXPR
, TREE_TYPE (ll_arg
),
5471 build_int_cst (TREE_TYPE (ll_arg
), 0));
5474 /* See if the comparisons can be merged. Then get all the parameters for
5477 if ((lcode
!= EQ_EXPR
&& lcode
!= NE_EXPR
)
5478 || (rcode
!= EQ_EXPR
&& rcode
!= NE_EXPR
))
5482 ll_inner
= decode_field_reference (loc
, ll_arg
,
5483 &ll_bitsize
, &ll_bitpos
, &ll_mode
,
5484 &ll_unsignedp
, &volatilep
, &ll_mask
,
5486 lr_inner
= decode_field_reference (loc
, lr_arg
,
5487 &lr_bitsize
, &lr_bitpos
, &lr_mode
,
5488 &lr_unsignedp
, &volatilep
, &lr_mask
,
5490 rl_inner
= decode_field_reference (loc
, rl_arg
,
5491 &rl_bitsize
, &rl_bitpos
, &rl_mode
,
5492 &rl_unsignedp
, &volatilep
, &rl_mask
,
5494 rr_inner
= decode_field_reference (loc
, rr_arg
,
5495 &rr_bitsize
, &rr_bitpos
, &rr_mode
,
5496 &rr_unsignedp
, &volatilep
, &rr_mask
,
5499 /* It must be true that the inner operation on the lhs of each
5500 comparison must be the same if we are to be able to do anything.
5501 Then see if we have constants. If not, the same must be true for
5503 if (volatilep
|| ll_inner
== 0 || rl_inner
== 0
5504 || ! operand_equal_p (ll_inner
, rl_inner
, 0))
5507 if (TREE_CODE (lr_arg
) == INTEGER_CST
5508 && TREE_CODE (rr_arg
) == INTEGER_CST
)
5509 l_const
= lr_arg
, r_const
= rr_arg
;
5510 else if (lr_inner
== 0 || rr_inner
== 0
5511 || ! operand_equal_p (lr_inner
, rr_inner
, 0))
5514 l_const
= r_const
= 0;
5516 /* If either comparison code is not correct for our logical operation,
5517 fail. However, we can convert a one-bit comparison against zero into
5518 the opposite comparison against that bit being set in the field. */
5520 wanted_code
= (code
== TRUTH_AND_EXPR
? EQ_EXPR
: NE_EXPR
);
5521 if (lcode
!= wanted_code
)
5523 if (l_const
&& integer_zerop (l_const
) && integer_pow2p (ll_mask
))
5525 /* Make the left operand unsigned, since we are only interested
5526 in the value of one bit. Otherwise we are doing the wrong
5535 /* This is analogous to the code for l_const above. */
5536 if (rcode
!= wanted_code
)
5538 if (r_const
&& integer_zerop (r_const
) && integer_pow2p (rl_mask
))
5547 /* See if we can find a mode that contains both fields being compared on
5548 the left. If we can't, fail. Otherwise, update all constants and masks
5549 to be relative to a field of that size. */
5550 first_bit
= MIN (ll_bitpos
, rl_bitpos
);
5551 end_bit
= MAX (ll_bitpos
+ ll_bitsize
, rl_bitpos
+ rl_bitsize
);
5552 lnmode
= get_best_mode (end_bit
- first_bit
, first_bit
, 0, 0,
5553 TYPE_ALIGN (TREE_TYPE (ll_inner
)), word_mode
,
5555 if (lnmode
== VOIDmode
)
5558 lnbitsize
= GET_MODE_BITSIZE (lnmode
);
5559 lnbitpos
= first_bit
& ~ (lnbitsize
- 1);
5560 lntype
= lang_hooks
.types
.type_for_size (lnbitsize
, 1);
5561 xll_bitpos
= ll_bitpos
- lnbitpos
, xrl_bitpos
= rl_bitpos
- lnbitpos
;
5563 if (BYTES_BIG_ENDIAN
)
5565 xll_bitpos
= lnbitsize
- xll_bitpos
- ll_bitsize
;
5566 xrl_bitpos
= lnbitsize
- xrl_bitpos
- rl_bitsize
;
5569 ll_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
, lntype
, ll_mask
),
5570 size_int (xll_bitpos
));
5571 rl_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
, lntype
, rl_mask
),
5572 size_int (xrl_bitpos
));
5576 l_const
= fold_convert_loc (loc
, lntype
, l_const
);
5577 l_const
= unextend (l_const
, ll_bitsize
, ll_unsignedp
, ll_and_mask
);
5578 l_const
= const_binop (LSHIFT_EXPR
, l_const
, size_int (xll_bitpos
));
5579 if (! integer_zerop (const_binop (BIT_AND_EXPR
, l_const
,
5580 fold_build1_loc (loc
, BIT_NOT_EXPR
,
5583 warning (0, "comparison is always %d", wanted_code
== NE_EXPR
);
5585 return constant_boolean_node (wanted_code
== NE_EXPR
, truth_type
);
5590 r_const
= fold_convert_loc (loc
, lntype
, r_const
);
5591 r_const
= unextend (r_const
, rl_bitsize
, rl_unsignedp
, rl_and_mask
);
5592 r_const
= const_binop (LSHIFT_EXPR
, r_const
, size_int (xrl_bitpos
));
5593 if (! integer_zerop (const_binop (BIT_AND_EXPR
, r_const
,
5594 fold_build1_loc (loc
, BIT_NOT_EXPR
,
5597 warning (0, "comparison is always %d", wanted_code
== NE_EXPR
);
5599 return constant_boolean_node (wanted_code
== NE_EXPR
, truth_type
);
5603 /* If the right sides are not constant, do the same for it. Also,
5604 disallow this optimization if a size or signedness mismatch occurs
5605 between the left and right sides. */
5608 if (ll_bitsize
!= lr_bitsize
|| rl_bitsize
!= rr_bitsize
5609 || ll_unsignedp
!= lr_unsignedp
|| rl_unsignedp
!= rr_unsignedp
5610 /* Make sure the two fields on the right
5611 correspond to the left without being swapped. */
5612 || ll_bitpos
- rl_bitpos
!= lr_bitpos
- rr_bitpos
)
5615 first_bit
= MIN (lr_bitpos
, rr_bitpos
);
5616 end_bit
= MAX (lr_bitpos
+ lr_bitsize
, rr_bitpos
+ rr_bitsize
);
5617 rnmode
= get_best_mode (end_bit
- first_bit
, first_bit
, 0, 0,
5618 TYPE_ALIGN (TREE_TYPE (lr_inner
)), word_mode
,
5620 if (rnmode
== VOIDmode
)
5623 rnbitsize
= GET_MODE_BITSIZE (rnmode
);
5624 rnbitpos
= first_bit
& ~ (rnbitsize
- 1);
5625 rntype
= lang_hooks
.types
.type_for_size (rnbitsize
, 1);
5626 xlr_bitpos
= lr_bitpos
- rnbitpos
, xrr_bitpos
= rr_bitpos
- rnbitpos
;
5628 if (BYTES_BIG_ENDIAN
)
5630 xlr_bitpos
= rnbitsize
- xlr_bitpos
- lr_bitsize
;
5631 xrr_bitpos
= rnbitsize
- xrr_bitpos
- rr_bitsize
;
5634 lr_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
,
5636 size_int (xlr_bitpos
));
5637 rr_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
,
5639 size_int (xrr_bitpos
));
5641 /* Make a mask that corresponds to both fields being compared.
5642 Do this for both items being compared. If the operands are the
5643 same size and the bits being compared are in the same position
5644 then we can do this by masking both and comparing the masked
5646 ll_mask
= const_binop (BIT_IOR_EXPR
, ll_mask
, rl_mask
);
5647 lr_mask
= const_binop (BIT_IOR_EXPR
, lr_mask
, rr_mask
);
5648 if (lnbitsize
== rnbitsize
&& xll_bitpos
== xlr_bitpos
)
5650 lhs
= make_bit_field_ref (loc
, ll_inner
, lntype
, lnbitsize
, lnbitpos
,
5651 ll_unsignedp
|| rl_unsignedp
);
5652 if (! all_ones_mask_p (ll_mask
, lnbitsize
))
5653 lhs
= build2 (BIT_AND_EXPR
, lntype
, lhs
, ll_mask
);
5655 rhs
= make_bit_field_ref (loc
, lr_inner
, rntype
, rnbitsize
, rnbitpos
,
5656 lr_unsignedp
|| rr_unsignedp
);
5657 if (! all_ones_mask_p (lr_mask
, rnbitsize
))
5658 rhs
= build2 (BIT_AND_EXPR
, rntype
, rhs
, lr_mask
);
5660 return build2_loc (loc
, wanted_code
, truth_type
, lhs
, rhs
);
5663 /* There is still another way we can do something: If both pairs of
5664 fields being compared are adjacent, we may be able to make a wider
5665 field containing them both.
5667 Note that we still must mask the lhs/rhs expressions. Furthermore,
5668 the mask must be shifted to account for the shift done by
5669 make_bit_field_ref. */
5670 if ((ll_bitsize
+ ll_bitpos
== rl_bitpos
5671 && lr_bitsize
+ lr_bitpos
== rr_bitpos
)
5672 || (ll_bitpos
== rl_bitpos
+ rl_bitsize
5673 && lr_bitpos
== rr_bitpos
+ rr_bitsize
))
5677 lhs
= make_bit_field_ref (loc
, ll_inner
, lntype
,
5678 ll_bitsize
+ rl_bitsize
,
5679 MIN (ll_bitpos
, rl_bitpos
), ll_unsignedp
);
5680 rhs
= make_bit_field_ref (loc
, lr_inner
, rntype
,
5681 lr_bitsize
+ rr_bitsize
,
5682 MIN (lr_bitpos
, rr_bitpos
), lr_unsignedp
);
5684 ll_mask
= const_binop (RSHIFT_EXPR
, ll_mask
,
5685 size_int (MIN (xll_bitpos
, xrl_bitpos
)));
5686 lr_mask
= const_binop (RSHIFT_EXPR
, lr_mask
,
5687 size_int (MIN (xlr_bitpos
, xrr_bitpos
)));
5689 /* Convert to the smaller type before masking out unwanted bits. */
5691 if (lntype
!= rntype
)
5693 if (lnbitsize
> rnbitsize
)
5695 lhs
= fold_convert_loc (loc
, rntype
, lhs
);
5696 ll_mask
= fold_convert_loc (loc
, rntype
, ll_mask
);
5699 else if (lnbitsize
< rnbitsize
)
5701 rhs
= fold_convert_loc (loc
, lntype
, rhs
);
5702 lr_mask
= fold_convert_loc (loc
, lntype
, lr_mask
);
5707 if (! all_ones_mask_p (ll_mask
, ll_bitsize
+ rl_bitsize
))
5708 lhs
= build2 (BIT_AND_EXPR
, type
, lhs
, ll_mask
);
5710 if (! all_ones_mask_p (lr_mask
, lr_bitsize
+ rr_bitsize
))
5711 rhs
= build2 (BIT_AND_EXPR
, type
, rhs
, lr_mask
);
5713 return build2_loc (loc
, wanted_code
, truth_type
, lhs
, rhs
);
5719 /* Handle the case of comparisons with constants. If there is something in
5720 common between the masks, those bits of the constants must be the same.
5721 If not, the condition is always false. Test for this to avoid generating
5722 incorrect code below. */
5723 result
= const_binop (BIT_AND_EXPR
, ll_mask
, rl_mask
);
5724 if (! integer_zerop (result
)
5725 && simple_cst_equal (const_binop (BIT_AND_EXPR
, result
, l_const
),
5726 const_binop (BIT_AND_EXPR
, result
, r_const
)) != 1)
5728 if (wanted_code
== NE_EXPR
)
5730 warning (0, "%<or%> of unmatched not-equal tests is always 1");
5731 return constant_boolean_node (true, truth_type
);
5735 warning (0, "%<and%> of mutually exclusive equal-tests is always 0");
5736 return constant_boolean_node (false, truth_type
);
5740 /* Construct the expression we will return. First get the component
5741 reference we will make. Unless the mask is all ones the width of
5742 that field, perform the mask operation. Then compare with the
5744 result
= make_bit_field_ref (loc
, ll_inner
, lntype
, lnbitsize
, lnbitpos
,
5745 ll_unsignedp
|| rl_unsignedp
);
5747 ll_mask
= const_binop (BIT_IOR_EXPR
, ll_mask
, rl_mask
);
5748 if (! all_ones_mask_p (ll_mask
, lnbitsize
))
5749 result
= build2_loc (loc
, BIT_AND_EXPR
, lntype
, result
, ll_mask
);
5751 return build2_loc (loc
, wanted_code
, truth_type
, result
,
5752 const_binop (BIT_IOR_EXPR
, l_const
, r_const
));
5755 /* Optimize T, which is a comparison of a MIN_EXPR or MAX_EXPR with a
5759 optimize_minmax_comparison (location_t loc
, enum tree_code code
, tree type
,
5763 enum tree_code op_code
;
5766 int consts_equal
, consts_lt
;
5769 STRIP_SIGN_NOPS (arg0
);
5771 op_code
= TREE_CODE (arg0
);
5772 minmax_const
= TREE_OPERAND (arg0
, 1);
5773 comp_const
= fold_convert_loc (loc
, TREE_TYPE (arg0
), op1
);
5774 consts_equal
= tree_int_cst_equal (minmax_const
, comp_const
);
5775 consts_lt
= tree_int_cst_lt (minmax_const
, comp_const
);
5776 inner
= TREE_OPERAND (arg0
, 0);
5778 /* If something does not permit us to optimize, return the original tree. */
5779 if ((op_code
!= MIN_EXPR
&& op_code
!= MAX_EXPR
)
5780 || TREE_CODE (comp_const
) != INTEGER_CST
5781 || TREE_OVERFLOW (comp_const
)
5782 || TREE_CODE (minmax_const
) != INTEGER_CST
5783 || TREE_OVERFLOW (minmax_const
))
5786 /* Now handle all the various comparison codes. We only handle EQ_EXPR
5787 and GT_EXPR, doing the rest with recursive calls using logical
5791 case NE_EXPR
: case LT_EXPR
: case LE_EXPR
:
5794 = optimize_minmax_comparison (loc
,
5795 invert_tree_comparison (code
, false),
5798 return invert_truthvalue_loc (loc
, tem
);
5804 fold_build2_loc (loc
, TRUTH_ORIF_EXPR
, type
,
5805 optimize_minmax_comparison
5806 (loc
, EQ_EXPR
, type
, arg0
, comp_const
),
5807 optimize_minmax_comparison
5808 (loc
, GT_EXPR
, type
, arg0
, comp_const
));
5811 if (op_code
== MAX_EXPR
&& consts_equal
)
5812 /* MAX (X, 0) == 0 -> X <= 0 */
5813 return fold_build2_loc (loc
, LE_EXPR
, type
, inner
, comp_const
);
5815 else if (op_code
== MAX_EXPR
&& consts_lt
)
5816 /* MAX (X, 0) == 5 -> X == 5 */
5817 return fold_build2_loc (loc
, EQ_EXPR
, type
, inner
, comp_const
);
5819 else if (op_code
== MAX_EXPR
)
5820 /* MAX (X, 0) == -1 -> false */
5821 return omit_one_operand_loc (loc
, type
, integer_zero_node
, inner
);
5823 else if (consts_equal
)
5824 /* MIN (X, 0) == 0 -> X >= 0 */
5825 return fold_build2_loc (loc
, GE_EXPR
, type
, inner
, comp_const
);
5828 /* MIN (X, 0) == 5 -> false */
5829 return omit_one_operand_loc (loc
, type
, integer_zero_node
, inner
);
5832 /* MIN (X, 0) == -1 -> X == -1 */
5833 return fold_build2_loc (loc
, EQ_EXPR
, type
, inner
, comp_const
);
5836 if (op_code
== MAX_EXPR
&& (consts_equal
|| consts_lt
))
5837 /* MAX (X, 0) > 0 -> X > 0
5838 MAX (X, 0) > 5 -> X > 5 */
5839 return fold_build2_loc (loc
, GT_EXPR
, type
, inner
, comp_const
);
5841 else if (op_code
== MAX_EXPR
)
5842 /* MAX (X, 0) > -1 -> true */
5843 return omit_one_operand_loc (loc
, type
, integer_one_node
, inner
);
5845 else if (op_code
== MIN_EXPR
&& (consts_equal
|| consts_lt
))
5846 /* MIN (X, 0) > 0 -> false
5847 MIN (X, 0) > 5 -> false */
5848 return omit_one_operand_loc (loc
, type
, integer_zero_node
, inner
);
5851 /* MIN (X, 0) > -1 -> X > -1 */
5852 return fold_build2_loc (loc
, GT_EXPR
, type
, inner
, comp_const
);
5859 /* T is an integer expression that is being multiplied, divided, or taken a
5860 modulus (CODE says which and what kind of divide or modulus) by a
5861 constant C. See if we can eliminate that operation by folding it with
5862 other operations already in T. WIDE_TYPE, if non-null, is a type that
5863 should be used for the computation if wider than our type.
5865 For example, if we are dividing (X * 8) + (Y * 16) by 4, we can return
5866 (X * 2) + (Y * 4). We must, however, be assured that either the original
5867 expression would not overflow or that overflow is undefined for the type
5868 in the language in question.
5870 If we return a non-null expression, it is an equivalent form of the
5871 original computation, but need not be in the original type.
5873 We set *STRICT_OVERFLOW_P to true if the return values depends on
5874 signed overflow being undefined. Otherwise we do not change
5875 *STRICT_OVERFLOW_P. */
5878 extract_muldiv (tree t
, tree c
, enum tree_code code
, tree wide_type
,
5879 bool *strict_overflow_p
)
5881 /* To avoid exponential search depth, refuse to allow recursion past
5882 three levels. Beyond that (1) it's highly unlikely that we'll find
5883 something interesting and (2) we've probably processed it before
5884 when we built the inner expression. */
5893 ret
= extract_muldiv_1 (t
, c
, code
, wide_type
, strict_overflow_p
);
5900 extract_muldiv_1 (tree t
, tree c
, enum tree_code code
, tree wide_type
,
5901 bool *strict_overflow_p
)
5903 tree type
= TREE_TYPE (t
);
5904 enum tree_code tcode
= TREE_CODE (t
);
5905 tree ctype
= (wide_type
!= 0 && (GET_MODE_SIZE (TYPE_MODE (wide_type
))
5906 > GET_MODE_SIZE (TYPE_MODE (type
)))
5907 ? wide_type
: type
);
5909 int same_p
= tcode
== code
;
5910 tree op0
= NULL_TREE
, op1
= NULL_TREE
;
5911 bool sub_strict_overflow_p
;
5913 /* Don't deal with constants of zero here; they confuse the code below. */
5914 if (integer_zerop (c
))
5917 if (TREE_CODE_CLASS (tcode
) == tcc_unary
)
5918 op0
= TREE_OPERAND (t
, 0);
5920 if (TREE_CODE_CLASS (tcode
) == tcc_binary
)
5921 op0
= TREE_OPERAND (t
, 0), op1
= TREE_OPERAND (t
, 1);
5923 /* Note that we need not handle conditional operations here since fold
5924 already handles those cases. So just do arithmetic here. */
5928 /* For a constant, we can always simplify if we are a multiply
5929 or (for divide and modulus) if it is a multiple of our constant. */
5930 if (code
== MULT_EXPR
5931 || wi::multiple_of_p (t
, c
, TYPE_SIGN (type
)))
5932 return const_binop (code
, fold_convert (ctype
, t
),
5933 fold_convert (ctype
, c
));
5936 CASE_CONVERT
: case NON_LVALUE_EXPR
:
5937 /* If op0 is an expression ... */
5938 if ((COMPARISON_CLASS_P (op0
)
5939 || UNARY_CLASS_P (op0
)
5940 || BINARY_CLASS_P (op0
)
5941 || VL_EXP_CLASS_P (op0
)
5942 || EXPRESSION_CLASS_P (op0
))
5943 /* ... and has wrapping overflow, and its type is smaller
5944 than ctype, then we cannot pass through as widening. */
5945 && (((ANY_INTEGRAL_TYPE_P (TREE_TYPE (op0
))
5946 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (op0
)))
5947 && (TYPE_PRECISION (ctype
)
5948 > TYPE_PRECISION (TREE_TYPE (op0
))))
5949 /* ... or this is a truncation (t is narrower than op0),
5950 then we cannot pass through this narrowing. */
5951 || (TYPE_PRECISION (type
)
5952 < TYPE_PRECISION (TREE_TYPE (op0
)))
5953 /* ... or signedness changes for division or modulus,
5954 then we cannot pass through this conversion. */
5955 || (code
!= MULT_EXPR
5956 && (TYPE_UNSIGNED (ctype
)
5957 != TYPE_UNSIGNED (TREE_TYPE (op0
))))
5958 /* ... or has undefined overflow while the converted to
5959 type has not, we cannot do the operation in the inner type
5960 as that would introduce undefined overflow. */
5961 || ((ANY_INTEGRAL_TYPE_P (TREE_TYPE (op0
))
5962 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (op0
)))
5963 && !TYPE_OVERFLOW_UNDEFINED (type
))))
5966 /* Pass the constant down and see if we can make a simplification. If
5967 we can, replace this expression with the inner simplification for
5968 possible later conversion to our or some other type. */
5969 if ((t2
= fold_convert (TREE_TYPE (op0
), c
)) != 0
5970 && TREE_CODE (t2
) == INTEGER_CST
5971 && !TREE_OVERFLOW (t2
)
5972 && (0 != (t1
= extract_muldiv (op0
, t2
, code
,
5974 ? ctype
: NULL_TREE
,
5975 strict_overflow_p
))))
5980 /* If widening the type changes it from signed to unsigned, then we
5981 must avoid building ABS_EXPR itself as unsigned. */
5982 if (TYPE_UNSIGNED (ctype
) && !TYPE_UNSIGNED (type
))
5984 tree cstype
= (*signed_type_for
) (ctype
);
5985 if ((t1
= extract_muldiv (op0
, c
, code
, cstype
, strict_overflow_p
))
5988 t1
= fold_build1 (tcode
, cstype
, fold_convert (cstype
, t1
));
5989 return fold_convert (ctype
, t1
);
5993 /* If the constant is negative, we cannot simplify this. */
5994 if (tree_int_cst_sgn (c
) == -1)
5998 /* For division and modulus, type can't be unsigned, as e.g.
5999 (-(x / 2U)) / 2U isn't equal to -((x / 2U) / 2U) for x >= 2.
6000 For signed types, even with wrapping overflow, this is fine. */
6001 if (code
!= MULT_EXPR
&& TYPE_UNSIGNED (type
))
6003 if ((t1
= extract_muldiv (op0
, c
, code
, wide_type
, strict_overflow_p
))
6005 return fold_build1 (tcode
, ctype
, fold_convert (ctype
, t1
));
6008 case MIN_EXPR
: case MAX_EXPR
:
6009 /* If widening the type changes the signedness, then we can't perform
6010 this optimization as that changes the result. */
6011 if (TYPE_UNSIGNED (ctype
) != TYPE_UNSIGNED (type
))
6014 /* MIN (a, b) / 5 -> MIN (a / 5, b / 5) */
6015 sub_strict_overflow_p
= false;
6016 if ((t1
= extract_muldiv (op0
, c
, code
, wide_type
,
6017 &sub_strict_overflow_p
)) != 0
6018 && (t2
= extract_muldiv (op1
, c
, code
, wide_type
,
6019 &sub_strict_overflow_p
)) != 0)
6021 if (tree_int_cst_sgn (c
) < 0)
6022 tcode
= (tcode
== MIN_EXPR
? MAX_EXPR
: MIN_EXPR
);
6023 if (sub_strict_overflow_p
)
6024 *strict_overflow_p
= true;
6025 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, t1
),
6026 fold_convert (ctype
, t2
));
6030 case LSHIFT_EXPR
: case RSHIFT_EXPR
:
6031 /* If the second operand is constant, this is a multiplication
6032 or floor division, by a power of two, so we can treat it that
6033 way unless the multiplier or divisor overflows. Signed
6034 left-shift overflow is implementation-defined rather than
6035 undefined in C90, so do not convert signed left shift into
6037 if (TREE_CODE (op1
) == INTEGER_CST
6038 && (tcode
== RSHIFT_EXPR
|| TYPE_UNSIGNED (TREE_TYPE (op0
)))
6039 /* const_binop may not detect overflow correctly,
6040 so check for it explicitly here. */
6041 && wi::gtu_p (TYPE_PRECISION (TREE_TYPE (size_one_node
)), op1
)
6042 && 0 != (t1
= fold_convert (ctype
,
6043 const_binop (LSHIFT_EXPR
,
6046 && !TREE_OVERFLOW (t1
))
6047 return extract_muldiv (build2 (tcode
== LSHIFT_EXPR
6048 ? MULT_EXPR
: FLOOR_DIV_EXPR
,
6050 fold_convert (ctype
, op0
),
6052 c
, code
, wide_type
, strict_overflow_p
);
6055 case PLUS_EXPR
: case MINUS_EXPR
:
6056 /* See if we can eliminate the operation on both sides. If we can, we
6057 can return a new PLUS or MINUS. If we can't, the only remaining
6058 cases where we can do anything are if the second operand is a
6060 sub_strict_overflow_p
= false;
6061 t1
= extract_muldiv (op0
, c
, code
, wide_type
, &sub_strict_overflow_p
);
6062 t2
= extract_muldiv (op1
, c
, code
, wide_type
, &sub_strict_overflow_p
);
6063 if (t1
!= 0 && t2
!= 0
6064 && (code
== MULT_EXPR
6065 /* If not multiplication, we can only do this if both operands
6066 are divisible by c. */
6067 || (multiple_of_p (ctype
, op0
, c
)
6068 && multiple_of_p (ctype
, op1
, c
))))
6070 if (sub_strict_overflow_p
)
6071 *strict_overflow_p
= true;
6072 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, t1
),
6073 fold_convert (ctype
, t2
));
6076 /* If this was a subtraction, negate OP1 and set it to be an addition.
6077 This simplifies the logic below. */
6078 if (tcode
== MINUS_EXPR
)
6080 tcode
= PLUS_EXPR
, op1
= negate_expr (op1
);
6081 /* If OP1 was not easily negatable, the constant may be OP0. */
6082 if (TREE_CODE (op0
) == INTEGER_CST
)
6084 std::swap (op0
, op1
);
6089 if (TREE_CODE (op1
) != INTEGER_CST
)
6092 /* If either OP1 or C are negative, this optimization is not safe for
6093 some of the division and remainder types while for others we need
6094 to change the code. */
6095 if (tree_int_cst_sgn (op1
) < 0 || tree_int_cst_sgn (c
) < 0)
6097 if (code
== CEIL_DIV_EXPR
)
6098 code
= FLOOR_DIV_EXPR
;
6099 else if (code
== FLOOR_DIV_EXPR
)
6100 code
= CEIL_DIV_EXPR
;
6101 else if (code
!= MULT_EXPR
6102 && code
!= CEIL_MOD_EXPR
&& code
!= FLOOR_MOD_EXPR
)
6106 /* If it's a multiply or a division/modulus operation of a multiple
6107 of our constant, do the operation and verify it doesn't overflow. */
6108 if (code
== MULT_EXPR
6109 || wi::multiple_of_p (op1
, c
, TYPE_SIGN (type
)))
6111 op1
= const_binop (code
, fold_convert (ctype
, op1
),
6112 fold_convert (ctype
, c
));
6113 /* We allow the constant to overflow with wrapping semantics. */
6115 || (TREE_OVERFLOW (op1
) && !TYPE_OVERFLOW_WRAPS (ctype
)))
6121 /* If we have an unsigned type, we cannot widen the operation since it
6122 will change the result if the original computation overflowed. */
6123 if (TYPE_UNSIGNED (ctype
) && ctype
!= type
)
6126 /* If we were able to eliminate our operation from the first side,
6127 apply our operation to the second side and reform the PLUS. */
6128 if (t1
!= 0 && (TREE_CODE (t1
) != code
|| code
== MULT_EXPR
))
6129 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, t1
), op1
);
6131 /* The last case is if we are a multiply. In that case, we can
6132 apply the distributive law to commute the multiply and addition
6133 if the multiplication of the constants doesn't overflow
6134 and overflow is defined. With undefined overflow
6135 op0 * c might overflow, while (op0 + orig_op1) * c doesn't. */
6136 if (code
== MULT_EXPR
&& TYPE_OVERFLOW_WRAPS (ctype
))
6137 return fold_build2 (tcode
, ctype
,
6138 fold_build2 (code
, ctype
,
6139 fold_convert (ctype
, op0
),
6140 fold_convert (ctype
, c
)),
6146 /* We have a special case here if we are doing something like
6147 (C * 8) % 4 since we know that's zero. */
6148 if ((code
== TRUNC_MOD_EXPR
|| code
== CEIL_MOD_EXPR
6149 || code
== FLOOR_MOD_EXPR
|| code
== ROUND_MOD_EXPR
)
6150 /* If the multiplication can overflow we cannot optimize this. */
6151 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (t
))
6152 && TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
6153 && wi::multiple_of_p (op1
, c
, TYPE_SIGN (type
)))
6155 *strict_overflow_p
= true;
6156 return omit_one_operand (type
, integer_zero_node
, op0
);
6159 /* ... fall through ... */
6161 case TRUNC_DIV_EXPR
: case CEIL_DIV_EXPR
: case FLOOR_DIV_EXPR
:
6162 case ROUND_DIV_EXPR
: case EXACT_DIV_EXPR
:
6163 /* If we can extract our operation from the LHS, do so and return a
6164 new operation. Likewise for the RHS from a MULT_EXPR. Otherwise,
6165 do something only if the second operand is a constant. */
6167 && (t1
= extract_muldiv (op0
, c
, code
, wide_type
,
6168 strict_overflow_p
)) != 0)
6169 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, t1
),
6170 fold_convert (ctype
, op1
));
6171 else if (tcode
== MULT_EXPR
&& code
== MULT_EXPR
6172 && (t1
= extract_muldiv (op1
, c
, code
, wide_type
,
6173 strict_overflow_p
)) != 0)
6174 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, op0
),
6175 fold_convert (ctype
, t1
));
6176 else if (TREE_CODE (op1
) != INTEGER_CST
)
6179 /* If these are the same operation types, we can associate them
6180 assuming no overflow. */
6183 bool overflow_p
= false;
6184 bool overflow_mul_p
;
6185 signop sign
= TYPE_SIGN (ctype
);
6186 wide_int mul
= wi::mul (op1
, c
, sign
, &overflow_mul_p
);
6187 overflow_p
= TREE_OVERFLOW (c
) | TREE_OVERFLOW (op1
);
6189 && ((sign
== UNSIGNED
&& tcode
!= MULT_EXPR
) || sign
== SIGNED
))
6193 mul
= wide_int::from (mul
, TYPE_PRECISION (ctype
),
6194 TYPE_SIGN (TREE_TYPE (op1
)));
6195 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, op0
),
6196 wide_int_to_tree (ctype
, mul
));
6200 /* If these operations "cancel" each other, we have the main
6201 optimizations of this pass, which occur when either constant is a
6202 multiple of the other, in which case we replace this with either an
6203 operation or CODE or TCODE.
6205 If we have an unsigned type, we cannot do this since it will change
6206 the result if the original computation overflowed. */
6207 if (TYPE_OVERFLOW_UNDEFINED (ctype
)
6208 && ((code
== MULT_EXPR
&& tcode
== EXACT_DIV_EXPR
)
6209 || (tcode
== MULT_EXPR
6210 && code
!= TRUNC_MOD_EXPR
&& code
!= CEIL_MOD_EXPR
6211 && code
!= FLOOR_MOD_EXPR
&& code
!= ROUND_MOD_EXPR
6212 && code
!= MULT_EXPR
)))
6214 if (wi::multiple_of_p (op1
, c
, TYPE_SIGN (type
)))
6216 if (TYPE_OVERFLOW_UNDEFINED (ctype
))
6217 *strict_overflow_p
= true;
6218 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, op0
),
6219 fold_convert (ctype
,
6220 const_binop (TRUNC_DIV_EXPR
,
6223 else if (wi::multiple_of_p (c
, op1
, TYPE_SIGN (type
)))
6225 if (TYPE_OVERFLOW_UNDEFINED (ctype
))
6226 *strict_overflow_p
= true;
6227 return fold_build2 (code
, ctype
, fold_convert (ctype
, op0
),
6228 fold_convert (ctype
,
6229 const_binop (TRUNC_DIV_EXPR
,
6242 /* Return a node which has the indicated constant VALUE (either 0 or
6243 1 for scalars or {-1,-1,..} or {0,0,...} for vectors),
6244 and is of the indicated TYPE. */
6247 constant_boolean_node (bool value
, tree type
)
6249 if (type
== integer_type_node
)
6250 return value
? integer_one_node
: integer_zero_node
;
6251 else if (type
== boolean_type_node
)
6252 return value
? boolean_true_node
: boolean_false_node
;
6253 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6254 return build_vector_from_val (type
,
6255 build_int_cst (TREE_TYPE (type
),
6258 return fold_convert (type
, value
? integer_one_node
: integer_zero_node
);
6262 /* Transform `a + (b ? x : y)' into `b ? (a + x) : (a + y)'.
6263 Transform, `a + (x < y)' into `(x < y) ? (a + 1) : (a + 0)'. Here
6264 CODE corresponds to the `+', COND to the `(b ? x : y)' or `(x < y)'
6265 expression, and ARG to `a'. If COND_FIRST_P is nonzero, then the
6266 COND is the first argument to CODE; otherwise (as in the example
6267 given here), it is the second argument. TYPE is the type of the
6268 original expression. Return NULL_TREE if no simplification is
6272 fold_binary_op_with_conditional_arg (location_t loc
,
6273 enum tree_code code
,
6274 tree type
, tree op0
, tree op1
,
6275 tree cond
, tree arg
, int cond_first_p
)
6277 tree cond_type
= cond_first_p
? TREE_TYPE (op0
) : TREE_TYPE (op1
);
6278 tree arg_type
= cond_first_p
? TREE_TYPE (op1
) : TREE_TYPE (op0
);
6279 tree test
, true_value
, false_value
;
6280 tree lhs
= NULL_TREE
;
6281 tree rhs
= NULL_TREE
;
6282 enum tree_code cond_code
= COND_EXPR
;
6284 if (TREE_CODE (cond
) == COND_EXPR
6285 || TREE_CODE (cond
) == VEC_COND_EXPR
)
6287 test
= TREE_OPERAND (cond
, 0);
6288 true_value
= TREE_OPERAND (cond
, 1);
6289 false_value
= TREE_OPERAND (cond
, 2);
6290 /* If this operand throws an expression, then it does not make
6291 sense to try to perform a logical or arithmetic operation
6293 if (VOID_TYPE_P (TREE_TYPE (true_value
)))
6295 if (VOID_TYPE_P (TREE_TYPE (false_value
)))
6300 tree testtype
= TREE_TYPE (cond
);
6302 true_value
= constant_boolean_node (true, testtype
);
6303 false_value
= constant_boolean_node (false, testtype
);
6306 if (TREE_CODE (TREE_TYPE (test
)) == VECTOR_TYPE
)
6307 cond_code
= VEC_COND_EXPR
;
6309 /* This transformation is only worthwhile if we don't have to wrap ARG
6310 in a SAVE_EXPR and the operation can be simplified without recursing
6311 on at least one of the branches once its pushed inside the COND_EXPR. */
6312 if (!TREE_CONSTANT (arg
)
6313 && (TREE_SIDE_EFFECTS (arg
)
6314 || TREE_CODE (arg
) == COND_EXPR
|| TREE_CODE (arg
) == VEC_COND_EXPR
6315 || TREE_CONSTANT (true_value
) || TREE_CONSTANT (false_value
)))
6318 arg
= fold_convert_loc (loc
, arg_type
, arg
);
6321 true_value
= fold_convert_loc (loc
, cond_type
, true_value
);
6323 lhs
= fold_build2_loc (loc
, code
, type
, true_value
, arg
);
6325 lhs
= fold_build2_loc (loc
, code
, type
, arg
, true_value
);
6329 false_value
= fold_convert_loc (loc
, cond_type
, false_value
);
6331 rhs
= fold_build2_loc (loc
, code
, type
, false_value
, arg
);
6333 rhs
= fold_build2_loc (loc
, code
, type
, arg
, false_value
);
6336 /* Check that we have simplified at least one of the branches. */
6337 if (!TREE_CONSTANT (arg
) && !TREE_CONSTANT (lhs
) && !TREE_CONSTANT (rhs
))
6340 return fold_build3_loc (loc
, cond_code
, type
, test
, lhs
, rhs
);
6344 /* Subroutine of fold() that checks for the addition of +/- 0.0.
6346 If !NEGATE, return true if ADDEND is +/-0.0 and, for all X of type
6347 TYPE, X + ADDEND is the same as X. If NEGATE, return true if X -
6348 ADDEND is the same as X.
6350 X + 0 and X - 0 both give X when X is NaN, infinite, or nonzero
6351 and finite. The problematic cases are when X is zero, and its mode
6352 has signed zeros. In the case of rounding towards -infinity,
6353 X - 0 is not the same as X because 0 - 0 is -0. In other rounding
6354 modes, X + 0 is not the same as X because -0 + 0 is 0. */
6357 fold_real_zero_addition_p (const_tree type
, const_tree addend
, int negate
)
6359 if (!real_zerop (addend
))
6362 /* Don't allow the fold with -fsignaling-nans. */
6363 if (HONOR_SNANS (element_mode (type
)))
6366 /* Allow the fold if zeros aren't signed, or their sign isn't important. */
6367 if (!HONOR_SIGNED_ZEROS (element_mode (type
)))
6370 /* In a vector or complex, we would need to check the sign of all zeros. */
6371 if (TREE_CODE (addend
) != REAL_CST
)
6374 /* Treat x + -0 as x - 0 and x - -0 as x + 0. */
6375 if (REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (addend
)))
6378 /* The mode has signed zeros, and we have to honor their sign.
6379 In this situation, there is only one case we can return true for.
6380 X - 0 is the same as X unless rounding towards -infinity is
6382 return negate
&& !HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
));
6385 /* Subroutine of fold() that optimizes comparisons of a division by
6386 a nonzero integer constant against an integer constant, i.e.
6389 CODE is the comparison operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR,
6390 GE_EXPR or LE_EXPR. TYPE is the type of the result and ARG0 and ARG1
6391 are the operands of the comparison. ARG1 must be a TREE_REAL_CST.
6393 The function returns the constant folded tree if a simplification
6394 can be made, and NULL_TREE otherwise. */
6397 fold_div_compare (location_t loc
,
6398 enum tree_code code
, tree type
, tree arg0
, tree arg1
)
6400 tree prod
, tmp
, hi
, lo
;
6401 tree arg00
= TREE_OPERAND (arg0
, 0);
6402 tree arg01
= TREE_OPERAND (arg0
, 1);
6403 signop sign
= TYPE_SIGN (TREE_TYPE (arg0
));
6404 bool neg_overflow
= false;
6407 /* We have to do this the hard way to detect unsigned overflow.
6408 prod = int_const_binop (MULT_EXPR, arg01, arg1); */
6409 wide_int val
= wi::mul (arg01
, arg1
, sign
, &overflow
);
6410 prod
= force_fit_type (TREE_TYPE (arg00
), val
, -1, overflow
);
6411 neg_overflow
= false;
6413 if (sign
== UNSIGNED
)
6415 tmp
= int_const_binop (MINUS_EXPR
, arg01
,
6416 build_int_cst (TREE_TYPE (arg01
), 1));
6419 /* Likewise hi = int_const_binop (PLUS_EXPR, prod, tmp). */
6420 val
= wi::add (prod
, tmp
, sign
, &overflow
);
6421 hi
= force_fit_type (TREE_TYPE (arg00
), val
,
6422 -1, overflow
| TREE_OVERFLOW (prod
));
6424 else if (tree_int_cst_sgn (arg01
) >= 0)
6426 tmp
= int_const_binop (MINUS_EXPR
, arg01
,
6427 build_int_cst (TREE_TYPE (arg01
), 1));
6428 switch (tree_int_cst_sgn (arg1
))
6431 neg_overflow
= true;
6432 lo
= int_const_binop (MINUS_EXPR
, prod
, tmp
);
6437 lo
= fold_negate_const (tmp
, TREE_TYPE (arg0
));
6442 hi
= int_const_binop (PLUS_EXPR
, prod
, tmp
);
6452 /* A negative divisor reverses the relational operators. */
6453 code
= swap_tree_comparison (code
);
6455 tmp
= int_const_binop (PLUS_EXPR
, arg01
,
6456 build_int_cst (TREE_TYPE (arg01
), 1));
6457 switch (tree_int_cst_sgn (arg1
))
6460 hi
= int_const_binop (MINUS_EXPR
, prod
, tmp
);
6465 hi
= fold_negate_const (tmp
, TREE_TYPE (arg0
));
6470 neg_overflow
= true;
6471 lo
= int_const_binop (PLUS_EXPR
, prod
, tmp
);
6483 if (TREE_OVERFLOW (lo
) && TREE_OVERFLOW (hi
))
6484 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg00
);
6485 if (TREE_OVERFLOW (hi
))
6486 return fold_build2_loc (loc
, GE_EXPR
, type
, arg00
, lo
);
6487 if (TREE_OVERFLOW (lo
))
6488 return fold_build2_loc (loc
, LE_EXPR
, type
, arg00
, hi
);
6489 return build_range_check (loc
, type
, arg00
, 1, lo
, hi
);
6492 if (TREE_OVERFLOW (lo
) && TREE_OVERFLOW (hi
))
6493 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg00
);
6494 if (TREE_OVERFLOW (hi
))
6495 return fold_build2_loc (loc
, LT_EXPR
, type
, arg00
, lo
);
6496 if (TREE_OVERFLOW (lo
))
6497 return fold_build2_loc (loc
, GT_EXPR
, type
, arg00
, hi
);
6498 return build_range_check (loc
, type
, arg00
, 0, lo
, hi
);
6501 if (TREE_OVERFLOW (lo
))
6503 tmp
= neg_overflow
? integer_zero_node
: integer_one_node
;
6504 return omit_one_operand_loc (loc
, type
, tmp
, arg00
);
6506 return fold_build2_loc (loc
, LT_EXPR
, type
, arg00
, lo
);
6509 if (TREE_OVERFLOW (hi
))
6511 tmp
= neg_overflow
? integer_zero_node
: integer_one_node
;
6512 return omit_one_operand_loc (loc
, type
, tmp
, arg00
);
6514 return fold_build2_loc (loc
, LE_EXPR
, type
, arg00
, hi
);
6517 if (TREE_OVERFLOW (hi
))
6519 tmp
= neg_overflow
? integer_one_node
: integer_zero_node
;
6520 return omit_one_operand_loc (loc
, type
, tmp
, arg00
);
6522 return fold_build2_loc (loc
, GT_EXPR
, type
, arg00
, hi
);
6525 if (TREE_OVERFLOW (lo
))
6527 tmp
= neg_overflow
? integer_one_node
: integer_zero_node
;
6528 return omit_one_operand_loc (loc
, type
, tmp
, arg00
);
6530 return fold_build2_loc (loc
, GE_EXPR
, type
, arg00
, lo
);
6540 /* If CODE with arguments ARG0 and ARG1 represents a single bit
6541 equality/inequality test, then return a simplified form of the test
6542 using a sign testing. Otherwise return NULL. TYPE is the desired
6546 fold_single_bit_test_into_sign_test (location_t loc
,
6547 enum tree_code code
, tree arg0
, tree arg1
,
6550 /* If this is testing a single bit, we can optimize the test. */
6551 if ((code
== NE_EXPR
|| code
== EQ_EXPR
)
6552 && TREE_CODE (arg0
) == BIT_AND_EXPR
&& integer_zerop (arg1
)
6553 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
6555 /* If we have (A & C) != 0 where C is the sign bit of A, convert
6556 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
6557 tree arg00
= sign_bit_p (TREE_OPERAND (arg0
, 0), TREE_OPERAND (arg0
, 1));
6559 if (arg00
!= NULL_TREE
6560 /* This is only a win if casting to a signed type is cheap,
6561 i.e. when arg00's type is not a partial mode. */
6562 && TYPE_PRECISION (TREE_TYPE (arg00
))
6563 == GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (arg00
))))
6565 tree stype
= signed_type_for (TREE_TYPE (arg00
));
6566 return fold_build2_loc (loc
, code
== EQ_EXPR
? GE_EXPR
: LT_EXPR
,
6568 fold_convert_loc (loc
, stype
, arg00
),
6569 build_int_cst (stype
, 0));
6576 /* If CODE with arguments ARG0 and ARG1 represents a single bit
6577 equality/inequality test, then return a simplified form of
6578 the test using shifts and logical operations. Otherwise return
6579 NULL. TYPE is the desired result type. */
6582 fold_single_bit_test (location_t loc
, enum tree_code code
,
6583 tree arg0
, tree arg1
, tree result_type
)
6585 /* If this is testing a single bit, we can optimize the test. */
6586 if ((code
== NE_EXPR
|| code
== EQ_EXPR
)
6587 && TREE_CODE (arg0
) == BIT_AND_EXPR
&& integer_zerop (arg1
)
6588 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
6590 tree inner
= TREE_OPERAND (arg0
, 0);
6591 tree type
= TREE_TYPE (arg0
);
6592 int bitnum
= tree_log2 (TREE_OPERAND (arg0
, 1));
6593 machine_mode operand_mode
= TYPE_MODE (type
);
6595 tree signed_type
, unsigned_type
, intermediate_type
;
6598 /* First, see if we can fold the single bit test into a sign-bit
6600 tem
= fold_single_bit_test_into_sign_test (loc
, code
, arg0
, arg1
,
6605 /* Otherwise we have (A & C) != 0 where C is a single bit,
6606 convert that into ((A >> C2) & 1). Where C2 = log2(C).
6607 Similarly for (A & C) == 0. */
6609 /* If INNER is a right shift of a constant and it plus BITNUM does
6610 not overflow, adjust BITNUM and INNER. */
6611 if (TREE_CODE (inner
) == RSHIFT_EXPR
6612 && TREE_CODE (TREE_OPERAND (inner
, 1)) == INTEGER_CST
6613 && bitnum
< TYPE_PRECISION (type
)
6614 && wi::ltu_p (TREE_OPERAND (inner
, 1),
6615 TYPE_PRECISION (type
) - bitnum
))
6617 bitnum
+= tree_to_uhwi (TREE_OPERAND (inner
, 1));
6618 inner
= TREE_OPERAND (inner
, 0);
6621 /* If we are going to be able to omit the AND below, we must do our
6622 operations as unsigned. If we must use the AND, we have a choice.
6623 Normally unsigned is faster, but for some machines signed is. */
6624 ops_unsigned
= (LOAD_EXTEND_OP (operand_mode
) == SIGN_EXTEND
6625 && !flag_syntax_only
) ? 0 : 1;
6627 signed_type
= lang_hooks
.types
.type_for_mode (operand_mode
, 0);
6628 unsigned_type
= lang_hooks
.types
.type_for_mode (operand_mode
, 1);
6629 intermediate_type
= ops_unsigned
? unsigned_type
: signed_type
;
6630 inner
= fold_convert_loc (loc
, intermediate_type
, inner
);
6633 inner
= build2 (RSHIFT_EXPR
, intermediate_type
,
6634 inner
, size_int (bitnum
));
6636 one
= build_int_cst (intermediate_type
, 1);
6638 if (code
== EQ_EXPR
)
6639 inner
= fold_build2_loc (loc
, BIT_XOR_EXPR
, intermediate_type
, inner
, one
);
6641 /* Put the AND last so it can combine with more things. */
6642 inner
= build2 (BIT_AND_EXPR
, intermediate_type
, inner
, one
);
6644 /* Make sure to return the proper type. */
6645 inner
= fold_convert_loc (loc
, result_type
, inner
);
6652 /* Check whether we are allowed to reorder operands arg0 and arg1,
6653 such that the evaluation of arg1 occurs before arg0. */
6656 reorder_operands_p (const_tree arg0
, const_tree arg1
)
6658 if (! flag_evaluation_order
)
6660 if (TREE_CONSTANT (arg0
) || TREE_CONSTANT (arg1
))
6662 return ! TREE_SIDE_EFFECTS (arg0
)
6663 && ! TREE_SIDE_EFFECTS (arg1
);
6666 /* Test whether it is preferable two swap two operands, ARG0 and
6667 ARG1, for example because ARG0 is an integer constant and ARG1
6668 isn't. If REORDER is true, only recommend swapping if we can
6669 evaluate the operands in reverse order. */
6672 tree_swap_operands_p (const_tree arg0
, const_tree arg1
, bool reorder
)
6674 if (CONSTANT_CLASS_P (arg1
))
6676 if (CONSTANT_CLASS_P (arg0
))
6682 if (TREE_CONSTANT (arg1
))
6684 if (TREE_CONSTANT (arg0
))
6687 if (reorder
&& flag_evaluation_order
6688 && (TREE_SIDE_EFFECTS (arg0
) || TREE_SIDE_EFFECTS (arg1
)))
6691 /* It is preferable to swap two SSA_NAME to ensure a canonical form
6692 for commutative and comparison operators. Ensuring a canonical
6693 form allows the optimizers to find additional redundancies without
6694 having to explicitly check for both orderings. */
6695 if (TREE_CODE (arg0
) == SSA_NAME
6696 && TREE_CODE (arg1
) == SSA_NAME
6697 && SSA_NAME_VERSION (arg0
) > SSA_NAME_VERSION (arg1
))
6700 /* Put SSA_NAMEs last. */
6701 if (TREE_CODE (arg1
) == SSA_NAME
)
6703 if (TREE_CODE (arg0
) == SSA_NAME
)
6706 /* Put variables last. */
6716 /* Fold A < X && A + 1 > Y to A < X && A >= Y. Normally A + 1 > Y
6717 means A >= Y && A != MAX, but in this case we know that
6718 A < X <= MAX. INEQ is A + 1 > Y, BOUND is A < X. */
6721 fold_to_nonsharp_ineq_using_bound (location_t loc
, tree ineq
, tree bound
)
6723 tree a
, typea
, type
= TREE_TYPE (ineq
), a1
, diff
, y
;
6725 if (TREE_CODE (bound
) == LT_EXPR
)
6726 a
= TREE_OPERAND (bound
, 0);
6727 else if (TREE_CODE (bound
) == GT_EXPR
)
6728 a
= TREE_OPERAND (bound
, 1);
6732 typea
= TREE_TYPE (a
);
6733 if (!INTEGRAL_TYPE_P (typea
)
6734 && !POINTER_TYPE_P (typea
))
6737 if (TREE_CODE (ineq
) == LT_EXPR
)
6739 a1
= TREE_OPERAND (ineq
, 1);
6740 y
= TREE_OPERAND (ineq
, 0);
6742 else if (TREE_CODE (ineq
) == GT_EXPR
)
6744 a1
= TREE_OPERAND (ineq
, 0);
6745 y
= TREE_OPERAND (ineq
, 1);
6750 if (TREE_TYPE (a1
) != typea
)
6753 if (POINTER_TYPE_P (typea
))
6755 /* Convert the pointer types into integer before taking the difference. */
6756 tree ta
= fold_convert_loc (loc
, ssizetype
, a
);
6757 tree ta1
= fold_convert_loc (loc
, ssizetype
, a1
);
6758 diff
= fold_binary_loc (loc
, MINUS_EXPR
, ssizetype
, ta1
, ta
);
6761 diff
= fold_binary_loc (loc
, MINUS_EXPR
, typea
, a1
, a
);
6763 if (!diff
|| !integer_onep (diff
))
6766 return fold_build2_loc (loc
, GE_EXPR
, type
, a
, y
);
6769 /* Fold a sum or difference of at least one multiplication.
6770 Returns the folded tree or NULL if no simplification could be made. */
6773 fold_plusminus_mult_expr (location_t loc
, enum tree_code code
, tree type
,
6774 tree arg0
, tree arg1
)
6776 tree arg00
, arg01
, arg10
, arg11
;
6777 tree alt0
= NULL_TREE
, alt1
= NULL_TREE
, same
;
6779 /* (A * C) +- (B * C) -> (A+-B) * C.
6780 (A * C) +- A -> A * (C+-1).
6781 We are most concerned about the case where C is a constant,
6782 but other combinations show up during loop reduction. Since
6783 it is not difficult, try all four possibilities. */
6785 if (TREE_CODE (arg0
) == MULT_EXPR
)
6787 arg00
= TREE_OPERAND (arg0
, 0);
6788 arg01
= TREE_OPERAND (arg0
, 1);
6790 else if (TREE_CODE (arg0
) == INTEGER_CST
)
6792 arg00
= build_one_cst (type
);
6797 /* We cannot generate constant 1 for fract. */
6798 if (ALL_FRACT_MODE_P (TYPE_MODE (type
)))
6801 arg01
= build_one_cst (type
);
6803 if (TREE_CODE (arg1
) == MULT_EXPR
)
6805 arg10
= TREE_OPERAND (arg1
, 0);
6806 arg11
= TREE_OPERAND (arg1
, 1);
6808 else if (TREE_CODE (arg1
) == INTEGER_CST
)
6810 arg10
= build_one_cst (type
);
6811 /* As we canonicalize A - 2 to A + -2 get rid of that sign for
6812 the purpose of this canonicalization. */
6813 if (wi::neg_p (arg1
, TYPE_SIGN (TREE_TYPE (arg1
)))
6814 && negate_expr_p (arg1
)
6815 && code
== PLUS_EXPR
)
6817 arg11
= negate_expr (arg1
);
6825 /* We cannot generate constant 1 for fract. */
6826 if (ALL_FRACT_MODE_P (TYPE_MODE (type
)))
6829 arg11
= build_one_cst (type
);
6833 if (operand_equal_p (arg01
, arg11
, 0))
6834 same
= arg01
, alt0
= arg00
, alt1
= arg10
;
6835 else if (operand_equal_p (arg00
, arg10
, 0))
6836 same
= arg00
, alt0
= arg01
, alt1
= arg11
;
6837 else if (operand_equal_p (arg00
, arg11
, 0))
6838 same
= arg00
, alt0
= arg01
, alt1
= arg10
;
6839 else if (operand_equal_p (arg01
, arg10
, 0))
6840 same
= arg01
, alt0
= arg00
, alt1
= arg11
;
6842 /* No identical multiplicands; see if we can find a common
6843 power-of-two factor in non-power-of-two multiplies. This
6844 can help in multi-dimensional array access. */
6845 else if (tree_fits_shwi_p (arg01
)
6846 && tree_fits_shwi_p (arg11
))
6848 HOST_WIDE_INT int01
, int11
, tmp
;
6851 int01
= tree_to_shwi (arg01
);
6852 int11
= tree_to_shwi (arg11
);
6854 /* Move min of absolute values to int11. */
6855 if (absu_hwi (int01
) < absu_hwi (int11
))
6857 tmp
= int01
, int01
= int11
, int11
= tmp
;
6858 alt0
= arg00
, arg00
= arg10
, arg10
= alt0
;
6865 if (exact_log2 (absu_hwi (int11
)) > 0 && int01
% int11
== 0
6866 /* The remainder should not be a constant, otherwise we
6867 end up folding i * 4 + 2 to (i * 2 + 1) * 2 which has
6868 increased the number of multiplications necessary. */
6869 && TREE_CODE (arg10
) != INTEGER_CST
)
6871 alt0
= fold_build2_loc (loc
, MULT_EXPR
, TREE_TYPE (arg00
), arg00
,
6872 build_int_cst (TREE_TYPE (arg00
),
6877 maybe_same
= alt0
, alt0
= alt1
, alt1
= maybe_same
;
6882 return fold_build2_loc (loc
, MULT_EXPR
, type
,
6883 fold_build2_loc (loc
, code
, type
,
6884 fold_convert_loc (loc
, type
, alt0
),
6885 fold_convert_loc (loc
, type
, alt1
)),
6886 fold_convert_loc (loc
, type
, same
));
6891 /* Subroutine of native_encode_expr. Encode the INTEGER_CST
6892 specified by EXPR into the buffer PTR of length LEN bytes.
6893 Return the number of bytes placed in the buffer, or zero
6897 native_encode_int (const_tree expr
, unsigned char *ptr
, int len
, int off
)
6899 tree type
= TREE_TYPE (expr
);
6900 int total_bytes
= GET_MODE_SIZE (TYPE_MODE (type
));
6901 int byte
, offset
, word
, words
;
6902 unsigned char value
;
6904 if ((off
== -1 && total_bytes
> len
)
6905 || off
>= total_bytes
)
6909 words
= total_bytes
/ UNITS_PER_WORD
;
6911 for (byte
= 0; byte
< total_bytes
; byte
++)
6913 int bitpos
= byte
* BITS_PER_UNIT
;
6914 /* Extend EXPR according to TYPE_SIGN if the precision isn't a whole
6916 value
= wi::extract_uhwi (wi::to_widest (expr
), bitpos
, BITS_PER_UNIT
);
6918 if (total_bytes
> UNITS_PER_WORD
)
6920 word
= byte
/ UNITS_PER_WORD
;
6921 if (WORDS_BIG_ENDIAN
)
6922 word
= (words
- 1) - word
;
6923 offset
= word
* UNITS_PER_WORD
;
6924 if (BYTES_BIG_ENDIAN
)
6925 offset
+= (UNITS_PER_WORD
- 1) - (byte
% UNITS_PER_WORD
);
6927 offset
+= byte
% UNITS_PER_WORD
;
6930 offset
= BYTES_BIG_ENDIAN
? (total_bytes
- 1) - byte
: byte
;
6932 && offset
- off
< len
)
6933 ptr
[offset
- off
] = value
;
6935 return MIN (len
, total_bytes
- off
);
6939 /* Subroutine of native_encode_expr. Encode the FIXED_CST
6940 specified by EXPR into the buffer PTR of length LEN bytes.
6941 Return the number of bytes placed in the buffer, or zero
6945 native_encode_fixed (const_tree expr
, unsigned char *ptr
, int len
, int off
)
6947 tree type
= TREE_TYPE (expr
);
6948 machine_mode mode
= TYPE_MODE (type
);
6949 int total_bytes
= GET_MODE_SIZE (mode
);
6950 FIXED_VALUE_TYPE value
;
6951 tree i_value
, i_type
;
6953 if (total_bytes
* BITS_PER_UNIT
> HOST_BITS_PER_DOUBLE_INT
)
6956 i_type
= lang_hooks
.types
.type_for_size (GET_MODE_BITSIZE (mode
), 1);
6958 if (NULL_TREE
== i_type
6959 || TYPE_PRECISION (i_type
) != total_bytes
)
6962 value
= TREE_FIXED_CST (expr
);
6963 i_value
= double_int_to_tree (i_type
, value
.data
);
6965 return native_encode_int (i_value
, ptr
, len
, off
);
6969 /* Subroutine of native_encode_expr. Encode the REAL_CST
6970 specified by EXPR into the buffer PTR of length LEN bytes.
6971 Return the number of bytes placed in the buffer, or zero
6975 native_encode_real (const_tree expr
, unsigned char *ptr
, int len
, int off
)
6977 tree type
= TREE_TYPE (expr
);
6978 int total_bytes
= GET_MODE_SIZE (TYPE_MODE (type
));
6979 int byte
, offset
, word
, words
, bitpos
;
6980 unsigned char value
;
6982 /* There are always 32 bits in each long, no matter the size of
6983 the hosts long. We handle floating point representations with
6987 if ((off
== -1 && total_bytes
> len
)
6988 || off
>= total_bytes
)
6992 words
= (32 / BITS_PER_UNIT
) / UNITS_PER_WORD
;
6994 real_to_target (tmp
, TREE_REAL_CST_PTR (expr
), TYPE_MODE (type
));
6996 for (bitpos
= 0; bitpos
< total_bytes
* BITS_PER_UNIT
;
6997 bitpos
+= BITS_PER_UNIT
)
6999 byte
= (bitpos
/ BITS_PER_UNIT
) & 3;
7000 value
= (unsigned char) (tmp
[bitpos
/ 32] >> (bitpos
& 31));
7002 if (UNITS_PER_WORD
< 4)
7004 word
= byte
/ UNITS_PER_WORD
;
7005 if (WORDS_BIG_ENDIAN
)
7006 word
= (words
- 1) - word
;
7007 offset
= word
* UNITS_PER_WORD
;
7008 if (BYTES_BIG_ENDIAN
)
7009 offset
+= (UNITS_PER_WORD
- 1) - (byte
% UNITS_PER_WORD
);
7011 offset
+= byte
% UNITS_PER_WORD
;
7014 offset
= BYTES_BIG_ENDIAN
? 3 - byte
: byte
;
7015 offset
= offset
+ ((bitpos
/ BITS_PER_UNIT
) & ~3);
7017 && offset
- off
< len
)
7018 ptr
[offset
- off
] = value
;
7020 return MIN (len
, total_bytes
- off
);
7023 /* Subroutine of native_encode_expr. Encode the COMPLEX_CST
7024 specified by EXPR into the buffer PTR of length LEN bytes.
7025 Return the number of bytes placed in the buffer, or zero
7029 native_encode_complex (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7034 part
= TREE_REALPART (expr
);
7035 rsize
= native_encode_expr (part
, ptr
, len
, off
);
7039 part
= TREE_IMAGPART (expr
);
7041 off
= MAX (0, off
- GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (part
))));
7042 isize
= native_encode_expr (part
, ptr
+rsize
, len
-rsize
, off
);
7046 return rsize
+ isize
;
7050 /* Subroutine of native_encode_expr. Encode the VECTOR_CST
7051 specified by EXPR into the buffer PTR of length LEN bytes.
7052 Return the number of bytes placed in the buffer, or zero
7056 native_encode_vector (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7063 count
= VECTOR_CST_NELTS (expr
);
7064 itype
= TREE_TYPE (TREE_TYPE (expr
));
7065 size
= GET_MODE_SIZE (TYPE_MODE (itype
));
7066 for (i
= 0; i
< count
; i
++)
7073 elem
= VECTOR_CST_ELT (expr
, i
);
7074 int res
= native_encode_expr (elem
, ptr
+offset
, len
-offset
, off
);
7075 if ((off
== -1 && res
!= size
)
7088 /* Subroutine of native_encode_expr. Encode the STRING_CST
7089 specified by EXPR into the buffer PTR of length LEN bytes.
7090 Return the number of bytes placed in the buffer, or zero
7094 native_encode_string (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7096 tree type
= TREE_TYPE (expr
);
7097 HOST_WIDE_INT total_bytes
;
7099 if (TREE_CODE (type
) != ARRAY_TYPE
7100 || TREE_CODE (TREE_TYPE (type
)) != INTEGER_TYPE
7101 || GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))) != BITS_PER_UNIT
7102 || !tree_fits_shwi_p (TYPE_SIZE_UNIT (type
)))
7104 total_bytes
= tree_to_shwi (TYPE_SIZE_UNIT (type
));
7105 if ((off
== -1 && total_bytes
> len
)
7106 || off
>= total_bytes
)
7110 if (TREE_STRING_LENGTH (expr
) - off
< MIN (total_bytes
, len
))
7113 if (off
< TREE_STRING_LENGTH (expr
))
7115 written
= MIN (len
, TREE_STRING_LENGTH (expr
) - off
);
7116 memcpy (ptr
, TREE_STRING_POINTER (expr
) + off
, written
);
7118 memset (ptr
+ written
, 0,
7119 MIN (total_bytes
- written
, len
- written
));
7122 memcpy (ptr
, TREE_STRING_POINTER (expr
) + off
, MIN (total_bytes
, len
));
7123 return MIN (total_bytes
- off
, len
);
7127 /* Subroutine of fold_view_convert_expr. Encode the INTEGER_CST,
7128 REAL_CST, COMPLEX_CST or VECTOR_CST specified by EXPR into the
7129 buffer PTR of length LEN bytes. If OFF is not -1 then start
7130 the encoding at byte offset OFF and encode at most LEN bytes.
7131 Return the number of bytes placed in the buffer, or zero upon failure. */
7134 native_encode_expr (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7136 /* We don't support starting at negative offset and -1 is special. */
7140 switch (TREE_CODE (expr
))
7143 return native_encode_int (expr
, ptr
, len
, off
);
7146 return native_encode_real (expr
, ptr
, len
, off
);
7149 return native_encode_fixed (expr
, ptr
, len
, off
);
7152 return native_encode_complex (expr
, ptr
, len
, off
);
7155 return native_encode_vector (expr
, ptr
, len
, off
);
7158 return native_encode_string (expr
, ptr
, len
, off
);
7166 /* Subroutine of native_interpret_expr. Interpret the contents of
7167 the buffer PTR of length LEN as an INTEGER_CST of type TYPE.
7168 If the buffer cannot be interpreted, return NULL_TREE. */
7171 native_interpret_int (tree type
, const unsigned char *ptr
, int len
)
7173 int total_bytes
= GET_MODE_SIZE (TYPE_MODE (type
));
7175 if (total_bytes
> len
7176 || total_bytes
* BITS_PER_UNIT
> HOST_BITS_PER_DOUBLE_INT
)
7179 wide_int result
= wi::from_buffer (ptr
, total_bytes
);
7181 return wide_int_to_tree (type
, result
);
7185 /* Subroutine of native_interpret_expr. Interpret the contents of
7186 the buffer PTR of length LEN as a FIXED_CST of type TYPE.
7187 If the buffer cannot be interpreted, return NULL_TREE. */
7190 native_interpret_fixed (tree type
, const unsigned char *ptr
, int len
)
7192 int total_bytes
= GET_MODE_SIZE (TYPE_MODE (type
));
7194 FIXED_VALUE_TYPE fixed_value
;
7196 if (total_bytes
> len
7197 || total_bytes
* BITS_PER_UNIT
> HOST_BITS_PER_DOUBLE_INT
)
7200 result
= double_int::from_buffer (ptr
, total_bytes
);
7201 fixed_value
= fixed_from_double_int (result
, TYPE_MODE (type
));
7203 return build_fixed (type
, fixed_value
);
7207 /* Subroutine of native_interpret_expr. Interpret the contents of
7208 the buffer PTR of length LEN as a REAL_CST of type TYPE.
7209 If the buffer cannot be interpreted, return NULL_TREE. */
7212 native_interpret_real (tree type
, const unsigned char *ptr
, int len
)
7214 machine_mode mode
= TYPE_MODE (type
);
7215 int total_bytes
= GET_MODE_SIZE (mode
);
7216 unsigned char value
;
7217 /* There are always 32 bits in each long, no matter the size of
7218 the hosts long. We handle floating point representations with
7223 total_bytes
= GET_MODE_SIZE (TYPE_MODE (type
));
7224 if (total_bytes
> len
|| total_bytes
> 24)
7226 int words
= (32 / BITS_PER_UNIT
) / UNITS_PER_WORD
;
7228 memset (tmp
, 0, sizeof (tmp
));
7229 for (int bitpos
= 0; bitpos
< total_bytes
* BITS_PER_UNIT
;
7230 bitpos
+= BITS_PER_UNIT
)
7232 /* Both OFFSET and BYTE index within a long;
7233 bitpos indexes the whole float. */
7234 int offset
, byte
= (bitpos
/ BITS_PER_UNIT
) & 3;
7235 if (UNITS_PER_WORD
< 4)
7237 int word
= byte
/ UNITS_PER_WORD
;
7238 if (WORDS_BIG_ENDIAN
)
7239 word
= (words
- 1) - word
;
7240 offset
= word
* UNITS_PER_WORD
;
7241 if (BYTES_BIG_ENDIAN
)
7242 offset
+= (UNITS_PER_WORD
- 1) - (byte
% UNITS_PER_WORD
);
7244 offset
+= byte
% UNITS_PER_WORD
;
7249 if (BYTES_BIG_ENDIAN
)
7251 /* Reverse bytes within each long, or within the entire float
7252 if it's smaller than a long (for HFmode). */
7253 offset
= MIN (3, total_bytes
- 1) - offset
;
7254 gcc_assert (offset
>= 0);
7257 value
= ptr
[offset
+ ((bitpos
/ BITS_PER_UNIT
) & ~3)];
7259 tmp
[bitpos
/ 32] |= (unsigned long)value
<< (bitpos
& 31);
7262 real_from_target (&r
, tmp
, mode
);
7263 return build_real (type
, r
);
7267 /* Subroutine of native_interpret_expr. Interpret the contents of
7268 the buffer PTR of length LEN as a COMPLEX_CST of type TYPE.
7269 If the buffer cannot be interpreted, return NULL_TREE. */
7272 native_interpret_complex (tree type
, const unsigned char *ptr
, int len
)
7274 tree etype
, rpart
, ipart
;
7277 etype
= TREE_TYPE (type
);
7278 size
= GET_MODE_SIZE (TYPE_MODE (etype
));
7281 rpart
= native_interpret_expr (etype
, ptr
, size
);
7284 ipart
= native_interpret_expr (etype
, ptr
+size
, size
);
7287 return build_complex (type
, rpart
, ipart
);
7291 /* Subroutine of native_interpret_expr. Interpret the contents of
7292 the buffer PTR of length LEN as a VECTOR_CST of type TYPE.
7293 If the buffer cannot be interpreted, return NULL_TREE. */
7296 native_interpret_vector (tree type
, const unsigned char *ptr
, int len
)
7302 etype
= TREE_TYPE (type
);
7303 size
= GET_MODE_SIZE (TYPE_MODE (etype
));
7304 count
= TYPE_VECTOR_SUBPARTS (type
);
7305 if (size
* count
> len
)
7308 elements
= XALLOCAVEC (tree
, count
);
7309 for (i
= count
- 1; i
>= 0; i
--)
7311 elem
= native_interpret_expr (etype
, ptr
+(i
*size
), size
);
7316 return build_vector (type
, elements
);
7320 /* Subroutine of fold_view_convert_expr. Interpret the contents of
7321 the buffer PTR of length LEN as a constant of type TYPE. For
7322 INTEGRAL_TYPE_P we return an INTEGER_CST, for SCALAR_FLOAT_TYPE_P
7323 we return a REAL_CST, etc... If the buffer cannot be interpreted,
7324 return NULL_TREE. */
7327 native_interpret_expr (tree type
, const unsigned char *ptr
, int len
)
7329 switch (TREE_CODE (type
))
7335 case REFERENCE_TYPE
:
7336 return native_interpret_int (type
, ptr
, len
);
7339 return native_interpret_real (type
, ptr
, len
);
7341 case FIXED_POINT_TYPE
:
7342 return native_interpret_fixed (type
, ptr
, len
);
7345 return native_interpret_complex (type
, ptr
, len
);
7348 return native_interpret_vector (type
, ptr
, len
);
7355 /* Returns true if we can interpret the contents of a native encoding
7359 can_native_interpret_type_p (tree type
)
7361 switch (TREE_CODE (type
))
7367 case REFERENCE_TYPE
:
7368 case FIXED_POINT_TYPE
:
7378 /* Fold a VIEW_CONVERT_EXPR of a constant expression EXPR to type
7379 TYPE at compile-time. If we're unable to perform the conversion
7380 return NULL_TREE. */
7383 fold_view_convert_expr (tree type
, tree expr
)
7385 /* We support up to 512-bit values (for V8DFmode). */
7386 unsigned char buffer
[64];
7389 /* Check that the host and target are sane. */
7390 if (CHAR_BIT
!= 8 || BITS_PER_UNIT
!= 8)
7393 len
= native_encode_expr (expr
, buffer
, sizeof (buffer
));
7397 return native_interpret_expr (type
, buffer
, len
);
7400 /* Build an expression for the address of T. Folds away INDIRECT_REF
7401 to avoid confusing the gimplify process. */
7404 build_fold_addr_expr_with_type_loc (location_t loc
, tree t
, tree ptrtype
)
7406 /* The size of the object is not relevant when talking about its address. */
7407 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
7408 t
= TREE_OPERAND (t
, 0);
7410 if (TREE_CODE (t
) == INDIRECT_REF
)
7412 t
= TREE_OPERAND (t
, 0);
7414 if (TREE_TYPE (t
) != ptrtype
)
7415 t
= build1_loc (loc
, NOP_EXPR
, ptrtype
, t
);
7417 else if (TREE_CODE (t
) == MEM_REF
7418 && integer_zerop (TREE_OPERAND (t
, 1)))
7419 return TREE_OPERAND (t
, 0);
7420 else if (TREE_CODE (t
) == MEM_REF
7421 && TREE_CODE (TREE_OPERAND (t
, 0)) == INTEGER_CST
)
7422 return fold_binary (POINTER_PLUS_EXPR
, ptrtype
,
7423 TREE_OPERAND (t
, 0),
7424 convert_to_ptrofftype (TREE_OPERAND (t
, 1)));
7425 else if (TREE_CODE (t
) == VIEW_CONVERT_EXPR
)
7427 t
= build_fold_addr_expr_loc (loc
, TREE_OPERAND (t
, 0));
7429 if (TREE_TYPE (t
) != ptrtype
)
7430 t
= fold_convert_loc (loc
, ptrtype
, t
);
7433 t
= build1_loc (loc
, ADDR_EXPR
, ptrtype
, t
);
7438 /* Build an expression for the address of T. */
7441 build_fold_addr_expr_loc (location_t loc
, tree t
)
7443 tree ptrtype
= build_pointer_type (TREE_TYPE (t
));
7445 return build_fold_addr_expr_with_type_loc (loc
, t
, ptrtype
);
7448 /* Fold a unary expression of code CODE and type TYPE with operand
7449 OP0. Return the folded expression if folding is successful.
7450 Otherwise, return NULL_TREE. */
7453 fold_unary_loc (location_t loc
, enum tree_code code
, tree type
, tree op0
)
7457 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
7459 gcc_assert (IS_EXPR_CODE_CLASS (kind
)
7460 && TREE_CODE_LENGTH (code
) == 1);
7465 if (CONVERT_EXPR_CODE_P (code
)
7466 || code
== FLOAT_EXPR
|| code
== ABS_EXPR
|| code
== NEGATE_EXPR
)
7468 /* Don't use STRIP_NOPS, because signedness of argument type
7470 STRIP_SIGN_NOPS (arg0
);
7474 /* Strip any conversions that don't change the mode. This
7475 is safe for every expression, except for a comparison
7476 expression because its signedness is derived from its
7479 Note that this is done as an internal manipulation within
7480 the constant folder, in order to find the simplest
7481 representation of the arguments so that their form can be
7482 studied. In any cases, the appropriate type conversions
7483 should be put back in the tree that will get out of the
7488 if (CONSTANT_CLASS_P (arg0
))
7490 tree tem
= const_unop (code
, type
, arg0
);
7493 if (TREE_TYPE (tem
) != type
)
7494 tem
= fold_convert_loc (loc
, type
, tem
);
7500 tem
= generic_simplify (loc
, code
, type
, op0
);
7504 if (TREE_CODE_CLASS (code
) == tcc_unary
)
7506 if (TREE_CODE (arg0
) == COMPOUND_EXPR
)
7507 return build2 (COMPOUND_EXPR
, type
, TREE_OPERAND (arg0
, 0),
7508 fold_build1_loc (loc
, code
, type
,
7509 fold_convert_loc (loc
, TREE_TYPE (op0
),
7510 TREE_OPERAND (arg0
, 1))));
7511 else if (TREE_CODE (arg0
) == COND_EXPR
)
7513 tree arg01
= TREE_OPERAND (arg0
, 1);
7514 tree arg02
= TREE_OPERAND (arg0
, 2);
7515 if (! VOID_TYPE_P (TREE_TYPE (arg01
)))
7516 arg01
= fold_build1_loc (loc
, code
, type
,
7517 fold_convert_loc (loc
,
7518 TREE_TYPE (op0
), arg01
));
7519 if (! VOID_TYPE_P (TREE_TYPE (arg02
)))
7520 arg02
= fold_build1_loc (loc
, code
, type
,
7521 fold_convert_loc (loc
,
7522 TREE_TYPE (op0
), arg02
));
7523 tem
= fold_build3_loc (loc
, COND_EXPR
, type
, TREE_OPERAND (arg0
, 0),
7526 /* If this was a conversion, and all we did was to move into
7527 inside the COND_EXPR, bring it back out. But leave it if
7528 it is a conversion from integer to integer and the
7529 result precision is no wider than a word since such a
7530 conversion is cheap and may be optimized away by combine,
7531 while it couldn't if it were outside the COND_EXPR. Then return
7532 so we don't get into an infinite recursion loop taking the
7533 conversion out and then back in. */
7535 if ((CONVERT_EXPR_CODE_P (code
)
7536 || code
== NON_LVALUE_EXPR
)
7537 && TREE_CODE (tem
) == COND_EXPR
7538 && TREE_CODE (TREE_OPERAND (tem
, 1)) == code
7539 && TREE_CODE (TREE_OPERAND (tem
, 2)) == code
7540 && ! VOID_TYPE_P (TREE_OPERAND (tem
, 1))
7541 && ! VOID_TYPE_P (TREE_OPERAND (tem
, 2))
7542 && (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem
, 1), 0))
7543 == TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem
, 2), 0)))
7544 && (! (INTEGRAL_TYPE_P (TREE_TYPE (tem
))
7546 (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem
, 1), 0))))
7547 && TYPE_PRECISION (TREE_TYPE (tem
)) <= BITS_PER_WORD
)
7548 || flag_syntax_only
))
7549 tem
= build1_loc (loc
, code
, type
,
7551 TREE_TYPE (TREE_OPERAND
7552 (TREE_OPERAND (tem
, 1), 0)),
7553 TREE_OPERAND (tem
, 0),
7554 TREE_OPERAND (TREE_OPERAND (tem
, 1), 0),
7555 TREE_OPERAND (TREE_OPERAND (tem
, 2),
7563 case NON_LVALUE_EXPR
:
7564 if (!maybe_lvalue_p (op0
))
7565 return fold_convert_loc (loc
, type
, op0
);
7570 case FIX_TRUNC_EXPR
:
7571 if (COMPARISON_CLASS_P (op0
))
7573 /* If we have (type) (a CMP b) and type is an integral type, return
7574 new expression involving the new type. Canonicalize
7575 (type) (a CMP b) to (a CMP b) ? (type) true : (type) false for
7577 Do not fold the result as that would not simplify further, also
7578 folding again results in recursions. */
7579 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
7580 return build2_loc (loc
, TREE_CODE (op0
), type
,
7581 TREE_OPERAND (op0
, 0),
7582 TREE_OPERAND (op0
, 1));
7583 else if (!INTEGRAL_TYPE_P (type
) && !VOID_TYPE_P (type
)
7584 && TREE_CODE (type
) != VECTOR_TYPE
)
7585 return build3_loc (loc
, COND_EXPR
, type
, op0
,
7586 constant_boolean_node (true, type
),
7587 constant_boolean_node (false, type
));
7590 /* Handle (T *)&A.B.C for A being of type T and B and C
7591 living at offset zero. This occurs frequently in
7592 C++ upcasting and then accessing the base. */
7593 if (TREE_CODE (op0
) == ADDR_EXPR
7594 && POINTER_TYPE_P (type
)
7595 && handled_component_p (TREE_OPERAND (op0
, 0)))
7597 HOST_WIDE_INT bitsize
, bitpos
;
7600 int unsignedp
, volatilep
;
7601 tree base
= TREE_OPERAND (op0
, 0);
7602 base
= get_inner_reference (base
, &bitsize
, &bitpos
, &offset
,
7603 &mode
, &unsignedp
, &volatilep
, false);
7604 /* If the reference was to a (constant) zero offset, we can use
7605 the address of the base if it has the same base type
7606 as the result type and the pointer type is unqualified. */
7607 if (! offset
&& bitpos
== 0
7608 && (TYPE_MAIN_VARIANT (TREE_TYPE (type
))
7609 == TYPE_MAIN_VARIANT (TREE_TYPE (base
)))
7610 && TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
7611 return fold_convert_loc (loc
, type
,
7612 build_fold_addr_expr_loc (loc
, base
));
7615 if (TREE_CODE (op0
) == MODIFY_EXPR
7616 && TREE_CONSTANT (TREE_OPERAND (op0
, 1))
7617 /* Detect assigning a bitfield. */
7618 && !(TREE_CODE (TREE_OPERAND (op0
, 0)) == COMPONENT_REF
7620 (TREE_OPERAND (TREE_OPERAND (op0
, 0), 1))))
7622 /* Don't leave an assignment inside a conversion
7623 unless assigning a bitfield. */
7624 tem
= fold_build1_loc (loc
, code
, type
, TREE_OPERAND (op0
, 1));
7625 /* First do the assignment, then return converted constant. */
7626 tem
= build2_loc (loc
, COMPOUND_EXPR
, TREE_TYPE (tem
), op0
, tem
);
7627 TREE_NO_WARNING (tem
) = 1;
7628 TREE_USED (tem
) = 1;
7632 /* Convert (T)(x & c) into (T)x & (T)c, if c is an integer
7633 constants (if x has signed type, the sign bit cannot be set
7634 in c). This folds extension into the BIT_AND_EXPR.
7635 ??? We don't do it for BOOLEAN_TYPE or ENUMERAL_TYPE because they
7636 very likely don't have maximal range for their precision and this
7637 transformation effectively doesn't preserve non-maximal ranges. */
7638 if (TREE_CODE (type
) == INTEGER_TYPE
7639 && TREE_CODE (op0
) == BIT_AND_EXPR
7640 && TREE_CODE (TREE_OPERAND (op0
, 1)) == INTEGER_CST
)
7642 tree and_expr
= op0
;
7643 tree and0
= TREE_OPERAND (and_expr
, 0);
7644 tree and1
= TREE_OPERAND (and_expr
, 1);
7647 if (TYPE_UNSIGNED (TREE_TYPE (and_expr
))
7648 || (TYPE_PRECISION (type
)
7649 <= TYPE_PRECISION (TREE_TYPE (and_expr
))))
7651 else if (TYPE_PRECISION (TREE_TYPE (and1
))
7652 <= HOST_BITS_PER_WIDE_INT
7653 && tree_fits_uhwi_p (and1
))
7655 unsigned HOST_WIDE_INT cst
;
7657 cst
= tree_to_uhwi (and1
);
7658 cst
&= HOST_WIDE_INT_M1U
7659 << (TYPE_PRECISION (TREE_TYPE (and1
)) - 1);
7660 change
= (cst
== 0);
7662 && !flag_syntax_only
7663 && (LOAD_EXTEND_OP (TYPE_MODE (TREE_TYPE (and0
)))
7666 tree uns
= unsigned_type_for (TREE_TYPE (and0
));
7667 and0
= fold_convert_loc (loc
, uns
, and0
);
7668 and1
= fold_convert_loc (loc
, uns
, and1
);
7673 tem
= force_fit_type (type
, wi::to_widest (and1
), 0,
7674 TREE_OVERFLOW (and1
));
7675 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
7676 fold_convert_loc (loc
, type
, and0
), tem
);
7680 /* Convert (T1)(X p+ Y) into ((T1)X p+ Y), for pointer type,
7681 when one of the new casts will fold away. Conservatively we assume
7682 that this happens when X or Y is NOP_EXPR or Y is INTEGER_CST. */
7683 if (POINTER_TYPE_P (type
)
7684 && TREE_CODE (arg0
) == POINTER_PLUS_EXPR
7685 && (!TYPE_RESTRICT (type
) || TYPE_RESTRICT (TREE_TYPE (arg0
)))
7686 && (TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
7687 || TREE_CODE (TREE_OPERAND (arg0
, 0)) == NOP_EXPR
7688 || TREE_CODE (TREE_OPERAND (arg0
, 1)) == NOP_EXPR
))
7690 tree arg00
= TREE_OPERAND (arg0
, 0);
7691 tree arg01
= TREE_OPERAND (arg0
, 1);
7693 return fold_build_pointer_plus_loc
7694 (loc
, fold_convert_loc (loc
, type
, arg00
), arg01
);
7697 /* Convert (T1)(~(T2)X) into ~(T1)X if T1 and T2 are integral types
7698 of the same precision, and X is an integer type not narrower than
7699 types T1 or T2, i.e. the cast (T2)X isn't an extension. */
7700 if (INTEGRAL_TYPE_P (type
)
7701 && TREE_CODE (op0
) == BIT_NOT_EXPR
7702 && INTEGRAL_TYPE_P (TREE_TYPE (op0
))
7703 && CONVERT_EXPR_P (TREE_OPERAND (op0
, 0))
7704 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (op0
)))
7706 tem
= TREE_OPERAND (TREE_OPERAND (op0
, 0), 0);
7707 if (INTEGRAL_TYPE_P (TREE_TYPE (tem
))
7708 && TYPE_PRECISION (type
) <= TYPE_PRECISION (TREE_TYPE (tem
)))
7709 return fold_build1_loc (loc
, BIT_NOT_EXPR
, type
,
7710 fold_convert_loc (loc
, type
, tem
));
7713 /* Convert (T1)(X * Y) into (T1)X * (T1)Y if T1 is narrower than the
7714 type of X and Y (integer types only). */
7715 if (INTEGRAL_TYPE_P (type
)
7716 && TREE_CODE (op0
) == MULT_EXPR
7717 && INTEGRAL_TYPE_P (TREE_TYPE (op0
))
7718 && TYPE_PRECISION (type
) < TYPE_PRECISION (TREE_TYPE (op0
)))
7720 /* Be careful not to introduce new overflows. */
7722 if (TYPE_OVERFLOW_WRAPS (type
))
7725 mult_type
= unsigned_type_for (type
);
7727 if (TYPE_PRECISION (mult_type
) < TYPE_PRECISION (TREE_TYPE (op0
)))
7729 tem
= fold_build2_loc (loc
, MULT_EXPR
, mult_type
,
7730 fold_convert_loc (loc
, mult_type
,
7731 TREE_OPERAND (op0
, 0)),
7732 fold_convert_loc (loc
, mult_type
,
7733 TREE_OPERAND (op0
, 1)));
7734 return fold_convert_loc (loc
, type
, tem
);
7740 case VIEW_CONVERT_EXPR
:
7741 if (TREE_CODE (op0
) == MEM_REF
)
7742 return fold_build2_loc (loc
, MEM_REF
, type
,
7743 TREE_OPERAND (op0
, 0), TREE_OPERAND (op0
, 1));
7748 tem
= fold_negate_expr (loc
, arg0
);
7750 return fold_convert_loc (loc
, type
, tem
);
7754 /* Convert fabs((double)float) into (double)fabsf(float). */
7755 if (TREE_CODE (arg0
) == NOP_EXPR
7756 && TREE_CODE (type
) == REAL_TYPE
)
7758 tree targ0
= strip_float_extensions (arg0
);
7760 return fold_convert_loc (loc
, type
,
7761 fold_build1_loc (loc
, ABS_EXPR
,
7766 /* Strip sign ops from argument. */
7767 if (TREE_CODE (type
) == REAL_TYPE
)
7769 tem
= fold_strip_sign_ops (arg0
);
7771 return fold_build1_loc (loc
, ABS_EXPR
, type
,
7772 fold_convert_loc (loc
, type
, tem
));
7777 /* Convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */
7778 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
7779 && (tem
= fold_unary_loc (loc
, BIT_NOT_EXPR
, type
,
7780 fold_convert_loc (loc
, type
,
7781 TREE_OPERAND (arg0
, 0)))))
7782 return fold_build2_loc (loc
, BIT_XOR_EXPR
, type
, tem
,
7783 fold_convert_loc (loc
, type
,
7784 TREE_OPERAND (arg0
, 1)));
7785 else if (TREE_CODE (arg0
) == BIT_XOR_EXPR
7786 && (tem
= fold_unary_loc (loc
, BIT_NOT_EXPR
, type
,
7787 fold_convert_loc (loc
, type
,
7788 TREE_OPERAND (arg0
, 1)))))
7789 return fold_build2_loc (loc
, BIT_XOR_EXPR
, type
,
7790 fold_convert_loc (loc
, type
,
7791 TREE_OPERAND (arg0
, 0)), tem
);
7795 case TRUTH_NOT_EXPR
:
7796 /* Note that the operand of this must be an int
7797 and its values must be 0 or 1.
7798 ("true" is a fixed value perhaps depending on the language,
7799 but we don't handle values other than 1 correctly yet.) */
7800 tem
= fold_truth_not_expr (loc
, arg0
);
7803 return fold_convert_loc (loc
, type
, tem
);
7806 /* Fold *&X to X if X is an lvalue. */
7807 if (TREE_CODE (op0
) == ADDR_EXPR
)
7809 tree op00
= TREE_OPERAND (op0
, 0);
7810 if ((TREE_CODE (op00
) == VAR_DECL
7811 || TREE_CODE (op00
) == PARM_DECL
7812 || TREE_CODE (op00
) == RESULT_DECL
)
7813 && !TREE_READONLY (op00
))
7820 } /* switch (code) */
7824 /* If the operation was a conversion do _not_ mark a resulting constant
7825 with TREE_OVERFLOW if the original constant was not. These conversions
7826 have implementation defined behavior and retaining the TREE_OVERFLOW
7827 flag here would confuse later passes such as VRP. */
7829 fold_unary_ignore_overflow_loc (location_t loc
, enum tree_code code
,
7830 tree type
, tree op0
)
7832 tree res
= fold_unary_loc (loc
, code
, type
, op0
);
7834 && TREE_CODE (res
) == INTEGER_CST
7835 && TREE_CODE (op0
) == INTEGER_CST
7836 && CONVERT_EXPR_CODE_P (code
))
7837 TREE_OVERFLOW (res
) = TREE_OVERFLOW (op0
);
7842 /* Fold a binary bitwise/truth expression of code CODE and type TYPE with
7843 operands OP0 and OP1. LOC is the location of the resulting expression.
7844 ARG0 and ARG1 are the NOP_STRIPed results of OP0 and OP1.
7845 Return the folded expression if folding is successful. Otherwise,
7846 return NULL_TREE. */
7848 fold_truth_andor (location_t loc
, enum tree_code code
, tree type
,
7849 tree arg0
, tree arg1
, tree op0
, tree op1
)
7853 /* We only do these simplifications if we are optimizing. */
7857 /* Check for things like (A || B) && (A || C). We can convert this
7858 to A || (B && C). Note that either operator can be any of the four
7859 truth and/or operations and the transformation will still be
7860 valid. Also note that we only care about order for the
7861 ANDIF and ORIF operators. If B contains side effects, this
7862 might change the truth-value of A. */
7863 if (TREE_CODE (arg0
) == TREE_CODE (arg1
)
7864 && (TREE_CODE (arg0
) == TRUTH_ANDIF_EXPR
7865 || TREE_CODE (arg0
) == TRUTH_ORIF_EXPR
7866 || TREE_CODE (arg0
) == TRUTH_AND_EXPR
7867 || TREE_CODE (arg0
) == TRUTH_OR_EXPR
)
7868 && ! TREE_SIDE_EFFECTS (TREE_OPERAND (arg0
, 1)))
7870 tree a00
= TREE_OPERAND (arg0
, 0);
7871 tree a01
= TREE_OPERAND (arg0
, 1);
7872 tree a10
= TREE_OPERAND (arg1
, 0);
7873 tree a11
= TREE_OPERAND (arg1
, 1);
7874 int commutative
= ((TREE_CODE (arg0
) == TRUTH_OR_EXPR
7875 || TREE_CODE (arg0
) == TRUTH_AND_EXPR
)
7876 && (code
== TRUTH_AND_EXPR
7877 || code
== TRUTH_OR_EXPR
));
7879 if (operand_equal_p (a00
, a10
, 0))
7880 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
, a00
,
7881 fold_build2_loc (loc
, code
, type
, a01
, a11
));
7882 else if (commutative
&& operand_equal_p (a00
, a11
, 0))
7883 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
, a00
,
7884 fold_build2_loc (loc
, code
, type
, a01
, a10
));
7885 else if (commutative
&& operand_equal_p (a01
, a10
, 0))
7886 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
, a01
,
7887 fold_build2_loc (loc
, code
, type
, a00
, a11
));
7889 /* This case if tricky because we must either have commutative
7890 operators or else A10 must not have side-effects. */
7892 else if ((commutative
|| ! TREE_SIDE_EFFECTS (a10
))
7893 && operand_equal_p (a01
, a11
, 0))
7894 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
,
7895 fold_build2_loc (loc
, code
, type
, a00
, a10
),
7899 /* See if we can build a range comparison. */
7900 if (0 != (tem
= fold_range_test (loc
, code
, type
, op0
, op1
)))
7903 if ((code
== TRUTH_ANDIF_EXPR
&& TREE_CODE (arg0
) == TRUTH_ORIF_EXPR
)
7904 || (code
== TRUTH_ORIF_EXPR
&& TREE_CODE (arg0
) == TRUTH_ANDIF_EXPR
))
7906 tem
= merge_truthop_with_opposite_arm (loc
, arg0
, arg1
, true);
7908 return fold_build2_loc (loc
, code
, type
, tem
, arg1
);
7911 if ((code
== TRUTH_ANDIF_EXPR
&& TREE_CODE (arg1
) == TRUTH_ORIF_EXPR
)
7912 || (code
== TRUTH_ORIF_EXPR
&& TREE_CODE (arg1
) == TRUTH_ANDIF_EXPR
))
7914 tem
= merge_truthop_with_opposite_arm (loc
, arg1
, arg0
, false);
7916 return fold_build2_loc (loc
, code
, type
, arg0
, tem
);
7919 /* Check for the possibility of merging component references. If our
7920 lhs is another similar operation, try to merge its rhs with our
7921 rhs. Then try to merge our lhs and rhs. */
7922 if (TREE_CODE (arg0
) == code
7923 && 0 != (tem
= fold_truth_andor_1 (loc
, code
, type
,
7924 TREE_OPERAND (arg0
, 1), arg1
)))
7925 return fold_build2_loc (loc
, code
, type
, TREE_OPERAND (arg0
, 0), tem
);
7927 if ((tem
= fold_truth_andor_1 (loc
, code
, type
, arg0
, arg1
)) != 0)
7930 if (LOGICAL_OP_NON_SHORT_CIRCUIT
7931 && (code
== TRUTH_AND_EXPR
7932 || code
== TRUTH_ANDIF_EXPR
7933 || code
== TRUTH_OR_EXPR
7934 || code
== TRUTH_ORIF_EXPR
))
7936 enum tree_code ncode
, icode
;
7938 ncode
= (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_AND_EXPR
)
7939 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
;
7940 icode
= ncode
== TRUTH_AND_EXPR
? TRUTH_ANDIF_EXPR
: TRUTH_ORIF_EXPR
;
7942 /* Transform ((A AND-IF B) AND[-IF] C) into (A AND-IF (B AND C)),
7943 or ((A OR-IF B) OR[-IF] C) into (A OR-IF (B OR C))
7944 We don't want to pack more than two leafs to a non-IF AND/OR
7946 If tree-code of left-hand operand isn't an AND/OR-IF code and not
7947 equal to IF-CODE, then we don't want to add right-hand operand.
7948 If the inner right-hand side of left-hand operand has
7949 side-effects, or isn't simple, then we can't add to it,
7950 as otherwise we might destroy if-sequence. */
7951 if (TREE_CODE (arg0
) == icode
7952 && simple_operand_p_2 (arg1
)
7953 /* Needed for sequence points to handle trappings, and
7955 && simple_operand_p_2 (TREE_OPERAND (arg0
, 1)))
7957 tem
= fold_build2_loc (loc
, ncode
, type
, TREE_OPERAND (arg0
, 1),
7959 return fold_build2_loc (loc
, icode
, type
, TREE_OPERAND (arg0
, 0),
7962 /* Same as abouve but for (A AND[-IF] (B AND-IF C)) -> ((A AND B) AND-IF C),
7963 or (A OR[-IF] (B OR-IF C) -> ((A OR B) OR-IF C). */
7964 else if (TREE_CODE (arg1
) == icode
7965 && simple_operand_p_2 (arg0
)
7966 /* Needed for sequence points to handle trappings, and
7968 && simple_operand_p_2 (TREE_OPERAND (arg1
, 0)))
7970 tem
= fold_build2_loc (loc
, ncode
, type
,
7971 arg0
, TREE_OPERAND (arg1
, 0));
7972 return fold_build2_loc (loc
, icode
, type
, tem
,
7973 TREE_OPERAND (arg1
, 1));
7975 /* Transform (A AND-IF B) into (A AND B), or (A OR-IF B)
7977 For sequence point consistancy, we need to check for trapping,
7978 and side-effects. */
7979 else if (code
== icode
&& simple_operand_p_2 (arg0
)
7980 && simple_operand_p_2 (arg1
))
7981 return fold_build2_loc (loc
, ncode
, type
, arg0
, arg1
);
7987 /* Fold a binary expression of code CODE and type TYPE with operands
7988 OP0 and OP1, containing either a MIN-MAX or a MAX-MIN combination.
7989 Return the folded expression if folding is successful. Otherwise,
7990 return NULL_TREE. */
7993 fold_minmax (location_t loc
, enum tree_code code
, tree type
, tree op0
, tree op1
)
7995 enum tree_code compl_code
;
7997 if (code
== MIN_EXPR
)
7998 compl_code
= MAX_EXPR
;
7999 else if (code
== MAX_EXPR
)
8000 compl_code
= MIN_EXPR
;
8004 /* MIN (MAX (a, b), b) == b. */
8005 if (TREE_CODE (op0
) == compl_code
8006 && operand_equal_p (TREE_OPERAND (op0
, 1), op1
, 0))
8007 return omit_one_operand_loc (loc
, type
, op1
, TREE_OPERAND (op0
, 0));
8009 /* MIN (MAX (b, a), b) == b. */
8010 if (TREE_CODE (op0
) == compl_code
8011 && operand_equal_p (TREE_OPERAND (op0
, 0), op1
, 0)
8012 && reorder_operands_p (TREE_OPERAND (op0
, 1), op1
))
8013 return omit_one_operand_loc (loc
, type
, op1
, TREE_OPERAND (op0
, 1));
8015 /* MIN (a, MAX (a, b)) == a. */
8016 if (TREE_CODE (op1
) == compl_code
8017 && operand_equal_p (op0
, TREE_OPERAND (op1
, 0), 0)
8018 && reorder_operands_p (op0
, TREE_OPERAND (op1
, 1)))
8019 return omit_one_operand_loc (loc
, type
, op0
, TREE_OPERAND (op1
, 1));
8021 /* MIN (a, MAX (b, a)) == a. */
8022 if (TREE_CODE (op1
) == compl_code
8023 && operand_equal_p (op0
, TREE_OPERAND (op1
, 1), 0)
8024 && reorder_operands_p (op0
, TREE_OPERAND (op1
, 0)))
8025 return omit_one_operand_loc (loc
, type
, op0
, TREE_OPERAND (op1
, 0));
8030 /* Helper that tries to canonicalize the comparison ARG0 CODE ARG1
8031 by changing CODE to reduce the magnitude of constants involved in
8032 ARG0 of the comparison.
8033 Returns a canonicalized comparison tree if a simplification was
8034 possible, otherwise returns NULL_TREE.
8035 Set *STRICT_OVERFLOW_P to true if the canonicalization is only
8036 valid if signed overflow is undefined. */
8039 maybe_canonicalize_comparison_1 (location_t loc
, enum tree_code code
, tree type
,
8040 tree arg0
, tree arg1
,
8041 bool *strict_overflow_p
)
8043 enum tree_code code0
= TREE_CODE (arg0
);
8044 tree t
, cst0
= NULL_TREE
;
8047 /* Match A +- CST code arg1. We can change this only if overflow
8049 if (!((ANY_INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
8050 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
)))
8051 /* In principle pointers also have undefined overflow behavior,
8052 but that causes problems elsewhere. */
8053 && !POINTER_TYPE_P (TREE_TYPE (arg0
))
8054 && (code0
== MINUS_EXPR
8055 || code0
== PLUS_EXPR
)
8056 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
))
8059 /* Identify the constant in arg0 and its sign. */
8060 cst0
= TREE_OPERAND (arg0
, 1);
8061 sgn0
= tree_int_cst_sgn (cst0
);
8063 /* Overflowed constants and zero will cause problems. */
8064 if (integer_zerop (cst0
)
8065 || TREE_OVERFLOW (cst0
))
8068 /* See if we can reduce the magnitude of the constant in
8069 arg0 by changing the comparison code. */
8070 /* A - CST < arg1 -> A - CST-1 <= arg1. */
8072 && code0
== ((sgn0
== -1) ? PLUS_EXPR
: MINUS_EXPR
))
8074 /* A + CST > arg1 -> A + CST-1 >= arg1. */
8075 else if (code
== GT_EXPR
8076 && code0
== ((sgn0
== -1) ? MINUS_EXPR
: PLUS_EXPR
))
8078 /* A + CST <= arg1 -> A + CST-1 < arg1. */
8079 else if (code
== LE_EXPR
8080 && code0
== ((sgn0
== -1) ? MINUS_EXPR
: PLUS_EXPR
))
8082 /* A - CST >= arg1 -> A - CST-1 > arg1. */
8083 else if (code
== GE_EXPR
8084 && code0
== ((sgn0
== -1) ? PLUS_EXPR
: MINUS_EXPR
))
8088 *strict_overflow_p
= true;
8090 /* Now build the constant reduced in magnitude. But not if that
8091 would produce one outside of its types range. */
8092 if (INTEGRAL_TYPE_P (TREE_TYPE (cst0
))
8094 && TYPE_MIN_VALUE (TREE_TYPE (cst0
))
8095 && tree_int_cst_equal (cst0
, TYPE_MIN_VALUE (TREE_TYPE (cst0
))))
8097 && TYPE_MAX_VALUE (TREE_TYPE (cst0
))
8098 && tree_int_cst_equal (cst0
, TYPE_MAX_VALUE (TREE_TYPE (cst0
))))))
8101 t
= int_const_binop (sgn0
== -1 ? PLUS_EXPR
: MINUS_EXPR
,
8102 cst0
, build_int_cst (TREE_TYPE (cst0
), 1));
8103 t
= fold_build2_loc (loc
, code0
, TREE_TYPE (arg0
), TREE_OPERAND (arg0
, 0), t
);
8104 t
= fold_convert (TREE_TYPE (arg1
), t
);
8106 return fold_build2_loc (loc
, code
, type
, t
, arg1
);
8109 /* Canonicalize the comparison ARG0 CODE ARG1 with type TYPE with undefined
8110 overflow further. Try to decrease the magnitude of constants involved
8111 by changing LE_EXPR and GE_EXPR to LT_EXPR and GT_EXPR or vice versa
8112 and put sole constants at the second argument position.
8113 Returns the canonicalized tree if changed, otherwise NULL_TREE. */
8116 maybe_canonicalize_comparison (location_t loc
, enum tree_code code
, tree type
,
8117 tree arg0
, tree arg1
)
8120 bool strict_overflow_p
;
8121 const char * const warnmsg
= G_("assuming signed overflow does not occur "
8122 "when reducing constant in comparison");
8124 /* Try canonicalization by simplifying arg0. */
8125 strict_overflow_p
= false;
8126 t
= maybe_canonicalize_comparison_1 (loc
, code
, type
, arg0
, arg1
,
8127 &strict_overflow_p
);
8130 if (strict_overflow_p
)
8131 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_MAGNITUDE
);
8135 /* Try canonicalization by simplifying arg1 using the swapped
8137 code
= swap_tree_comparison (code
);
8138 strict_overflow_p
= false;
8139 t
= maybe_canonicalize_comparison_1 (loc
, code
, type
, arg1
, arg0
,
8140 &strict_overflow_p
);
8141 if (t
&& strict_overflow_p
)
8142 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_MAGNITUDE
);
8146 /* Return whether BASE + OFFSET + BITPOS may wrap around the address
8147 space. This is used to avoid issuing overflow warnings for
8148 expressions like &p->x which can not wrap. */
8151 pointer_may_wrap_p (tree base
, tree offset
, HOST_WIDE_INT bitpos
)
8153 if (!POINTER_TYPE_P (TREE_TYPE (base
)))
8160 int precision
= TYPE_PRECISION (TREE_TYPE (base
));
8161 if (offset
== NULL_TREE
)
8162 wi_offset
= wi::zero (precision
);
8163 else if (TREE_CODE (offset
) != INTEGER_CST
|| TREE_OVERFLOW (offset
))
8169 wide_int units
= wi::shwi (bitpos
/ BITS_PER_UNIT
, precision
);
8170 wide_int total
= wi::add (wi_offset
, units
, UNSIGNED
, &overflow
);
8174 if (!wi::fits_uhwi_p (total
))
8177 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (TREE_TYPE (base
)));
8181 /* We can do slightly better for SIZE if we have an ADDR_EXPR of an
8183 if (TREE_CODE (base
) == ADDR_EXPR
)
8185 HOST_WIDE_INT base_size
;
8187 base_size
= int_size_in_bytes (TREE_TYPE (TREE_OPERAND (base
, 0)));
8188 if (base_size
> 0 && size
< base_size
)
8192 return total
.to_uhwi () > (unsigned HOST_WIDE_INT
) size
;
8195 /* Return the HOST_WIDE_INT least significant bits of T, a sizetype
8196 kind INTEGER_CST. This makes sure to properly sign-extend the
8199 static HOST_WIDE_INT
8200 size_low_cst (const_tree t
)
8202 HOST_WIDE_INT w
= TREE_INT_CST_ELT (t
, 0);
8203 int prec
= TYPE_PRECISION (TREE_TYPE (t
));
8204 if (prec
< HOST_BITS_PER_WIDE_INT
)
8205 return sext_hwi (w
, prec
);
8209 /* Subroutine of fold_binary. This routine performs all of the
8210 transformations that are common to the equality/inequality
8211 operators (EQ_EXPR and NE_EXPR) and the ordering operators
8212 (LT_EXPR, LE_EXPR, GE_EXPR and GT_EXPR). Callers other than
8213 fold_binary should call fold_binary. Fold a comparison with
8214 tree code CODE and type TYPE with operands OP0 and OP1. Return
8215 the folded comparison or NULL_TREE. */
8218 fold_comparison (location_t loc
, enum tree_code code
, tree type
,
8221 const bool equality_code
= (code
== EQ_EXPR
|| code
== NE_EXPR
);
8222 tree arg0
, arg1
, tem
;
8227 STRIP_SIGN_NOPS (arg0
);
8228 STRIP_SIGN_NOPS (arg1
);
8230 /* Transform comparisons of the form X +- C1 CMP C2 to X CMP C2 -+ C1. */
8231 if ((TREE_CODE (arg0
) == PLUS_EXPR
|| TREE_CODE (arg0
) == MINUS_EXPR
)
8233 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
8234 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
))))
8235 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
8236 && !TREE_OVERFLOW (TREE_OPERAND (arg0
, 1))
8237 && TREE_CODE (arg1
) == INTEGER_CST
8238 && !TREE_OVERFLOW (arg1
))
8240 const enum tree_code
8241 reverse_op
= TREE_CODE (arg0
) == PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
;
8242 tree const1
= TREE_OPERAND (arg0
, 1);
8243 tree const2
= fold_convert_loc (loc
, TREE_TYPE (const1
), arg1
);
8244 tree variable
= TREE_OPERAND (arg0
, 0);
8245 tree new_const
= int_const_binop (reverse_op
, const2
, const1
);
8247 /* If the constant operation overflowed this can be
8248 simplified as a comparison against INT_MAX/INT_MIN. */
8249 if (TREE_OVERFLOW (new_const
)
8250 && !TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg0
)))
8252 int const1_sgn
= tree_int_cst_sgn (const1
);
8253 enum tree_code code2
= code
;
8255 /* Get the sign of the constant on the lhs if the
8256 operation were VARIABLE + CONST1. */
8257 if (TREE_CODE (arg0
) == MINUS_EXPR
)
8258 const1_sgn
= -const1_sgn
;
8260 /* The sign of the constant determines if we overflowed
8261 INT_MAX (const1_sgn == -1) or INT_MIN (const1_sgn == 1).
8262 Canonicalize to the INT_MIN overflow by swapping the comparison
8264 if (const1_sgn
== -1)
8265 code2
= swap_tree_comparison (code
);
8267 /* We now can look at the canonicalized case
8268 VARIABLE + 1 CODE2 INT_MIN
8269 and decide on the result. */
8276 omit_one_operand_loc (loc
, type
, boolean_false_node
, variable
);
8282 omit_one_operand_loc (loc
, type
, boolean_true_node
, variable
);
8291 fold_overflow_warning ("assuming signed overflow does not occur "
8292 "when changing X +- C1 cmp C2 to "
8294 WARN_STRICT_OVERFLOW_COMPARISON
);
8295 return fold_build2_loc (loc
, code
, type
, variable
, new_const
);
8299 /* For comparisons of pointers we can decompose it to a compile time
8300 comparison of the base objects and the offsets into the object.
8301 This requires at least one operand being an ADDR_EXPR or a
8302 POINTER_PLUS_EXPR to do more than the operand_equal_p test below. */
8303 if (POINTER_TYPE_P (TREE_TYPE (arg0
))
8304 && (TREE_CODE (arg0
) == ADDR_EXPR
8305 || TREE_CODE (arg1
) == ADDR_EXPR
8306 || TREE_CODE (arg0
) == POINTER_PLUS_EXPR
8307 || TREE_CODE (arg1
) == POINTER_PLUS_EXPR
))
8309 tree base0
, base1
, offset0
= NULL_TREE
, offset1
= NULL_TREE
;
8310 HOST_WIDE_INT bitsize
, bitpos0
= 0, bitpos1
= 0;
8312 int volatilep
, unsignedp
;
8313 bool indirect_base0
= false, indirect_base1
= false;
8315 /* Get base and offset for the access. Strip ADDR_EXPR for
8316 get_inner_reference, but put it back by stripping INDIRECT_REF
8317 off the base object if possible. indirect_baseN will be true
8318 if baseN is not an address but refers to the object itself. */
8320 if (TREE_CODE (arg0
) == ADDR_EXPR
)
8322 base0
= get_inner_reference (TREE_OPERAND (arg0
, 0),
8323 &bitsize
, &bitpos0
, &offset0
, &mode
,
8324 &unsignedp
, &volatilep
, false);
8325 if (TREE_CODE (base0
) == INDIRECT_REF
)
8326 base0
= TREE_OPERAND (base0
, 0);
8328 indirect_base0
= true;
8330 else if (TREE_CODE (arg0
) == POINTER_PLUS_EXPR
)
8332 base0
= TREE_OPERAND (arg0
, 0);
8333 STRIP_SIGN_NOPS (base0
);
8334 if (TREE_CODE (base0
) == ADDR_EXPR
)
8336 base0
= TREE_OPERAND (base0
, 0);
8337 indirect_base0
= true;
8339 offset0
= TREE_OPERAND (arg0
, 1);
8340 if (tree_fits_shwi_p (offset0
))
8342 HOST_WIDE_INT off
= size_low_cst (offset0
);
8343 if ((HOST_WIDE_INT
) (((unsigned HOST_WIDE_INT
) off
)
8345 / BITS_PER_UNIT
== (HOST_WIDE_INT
) off
)
8347 bitpos0
= off
* BITS_PER_UNIT
;
8348 offset0
= NULL_TREE
;
8354 if (TREE_CODE (arg1
) == ADDR_EXPR
)
8356 base1
= get_inner_reference (TREE_OPERAND (arg1
, 0),
8357 &bitsize
, &bitpos1
, &offset1
, &mode
,
8358 &unsignedp
, &volatilep
, false);
8359 if (TREE_CODE (base1
) == INDIRECT_REF
)
8360 base1
= TREE_OPERAND (base1
, 0);
8362 indirect_base1
= true;
8364 else if (TREE_CODE (arg1
) == POINTER_PLUS_EXPR
)
8366 base1
= TREE_OPERAND (arg1
, 0);
8367 STRIP_SIGN_NOPS (base1
);
8368 if (TREE_CODE (base1
) == ADDR_EXPR
)
8370 base1
= TREE_OPERAND (base1
, 0);
8371 indirect_base1
= true;
8373 offset1
= TREE_OPERAND (arg1
, 1);
8374 if (tree_fits_shwi_p (offset1
))
8376 HOST_WIDE_INT off
= size_low_cst (offset1
);
8377 if ((HOST_WIDE_INT
) (((unsigned HOST_WIDE_INT
) off
)
8379 / BITS_PER_UNIT
== (HOST_WIDE_INT
) off
)
8381 bitpos1
= off
* BITS_PER_UNIT
;
8382 offset1
= NULL_TREE
;
8387 /* If we have equivalent bases we might be able to simplify. */
8388 if (indirect_base0
== indirect_base1
8389 && operand_equal_p (base0
, base1
, 0))
8391 /* We can fold this expression to a constant if the non-constant
8392 offset parts are equal. */
8393 if ((offset0
== offset1
8394 || (offset0
&& offset1
8395 && operand_equal_p (offset0
, offset1
, 0)))
8398 || (indirect_base0
&& DECL_P (base0
))
8399 || POINTER_TYPE_OVERFLOW_UNDEFINED
))
8403 && bitpos0
!= bitpos1
8404 && (pointer_may_wrap_p (base0
, offset0
, bitpos0
)
8405 || pointer_may_wrap_p (base1
, offset1
, bitpos1
)))
8406 fold_overflow_warning (("assuming pointer wraparound does not "
8407 "occur when comparing P +- C1 with "
8409 WARN_STRICT_OVERFLOW_CONDITIONAL
);
8414 return constant_boolean_node (bitpos0
== bitpos1
, type
);
8416 return constant_boolean_node (bitpos0
!= bitpos1
, type
);
8418 return constant_boolean_node (bitpos0
< bitpos1
, type
);
8420 return constant_boolean_node (bitpos0
<= bitpos1
, type
);
8422 return constant_boolean_node (bitpos0
>= bitpos1
, type
);
8424 return constant_boolean_node (bitpos0
> bitpos1
, type
);
8428 /* We can simplify the comparison to a comparison of the variable
8429 offset parts if the constant offset parts are equal.
8430 Be careful to use signed sizetype here because otherwise we
8431 mess with array offsets in the wrong way. This is possible
8432 because pointer arithmetic is restricted to retain within an
8433 object and overflow on pointer differences is undefined as of
8434 6.5.6/8 and /9 with respect to the signed ptrdiff_t. */
8435 else if (bitpos0
== bitpos1
8437 || (indirect_base0
&& DECL_P (base0
))
8438 || POINTER_TYPE_OVERFLOW_UNDEFINED
))
8440 /* By converting to signed sizetype we cover middle-end pointer
8441 arithmetic which operates on unsigned pointer types of size
8442 type size and ARRAY_REF offsets which are properly sign or
8443 zero extended from their type in case it is narrower than
8445 if (offset0
== NULL_TREE
)
8446 offset0
= build_int_cst (ssizetype
, 0);
8448 offset0
= fold_convert_loc (loc
, ssizetype
, offset0
);
8449 if (offset1
== NULL_TREE
)
8450 offset1
= build_int_cst (ssizetype
, 0);
8452 offset1
= fold_convert_loc (loc
, ssizetype
, offset1
);
8455 && (pointer_may_wrap_p (base0
, offset0
, bitpos0
)
8456 || pointer_may_wrap_p (base1
, offset1
, bitpos1
)))
8457 fold_overflow_warning (("assuming pointer wraparound does not "
8458 "occur when comparing P +- C1 with "
8460 WARN_STRICT_OVERFLOW_COMPARISON
);
8462 return fold_build2_loc (loc
, code
, type
, offset0
, offset1
);
8465 /* For equal offsets we can simplify to a comparison of the
8467 else if (bitpos0
== bitpos1
8469 ? base0
!= TREE_OPERAND (arg0
, 0) : base0
!= arg0
)
8471 ? base1
!= TREE_OPERAND (arg1
, 0) : base1
!= arg1
)
8472 && ((offset0
== offset1
)
8473 || (offset0
&& offset1
8474 && operand_equal_p (offset0
, offset1
, 0))))
8477 base0
= build_fold_addr_expr_loc (loc
, base0
);
8479 base1
= build_fold_addr_expr_loc (loc
, base1
);
8480 return fold_build2_loc (loc
, code
, type
, base0
, base1
);
8484 /* Transform comparisons of the form X +- C1 CMP Y +- C2 to
8485 X CMP Y +- C2 +- C1 for signed X, Y. This is valid if
8486 the resulting offset is smaller in absolute value than the
8487 original one and has the same sign. */
8488 if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
8489 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
))
8490 && (TREE_CODE (arg0
) == PLUS_EXPR
|| TREE_CODE (arg0
) == MINUS_EXPR
)
8491 && (TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
8492 && !TREE_OVERFLOW (TREE_OPERAND (arg0
, 1)))
8493 && (TREE_CODE (arg1
) == PLUS_EXPR
|| TREE_CODE (arg1
) == MINUS_EXPR
)
8494 && (TREE_CODE (TREE_OPERAND (arg1
, 1)) == INTEGER_CST
8495 && !TREE_OVERFLOW (TREE_OPERAND (arg1
, 1))))
8497 tree const1
= TREE_OPERAND (arg0
, 1);
8498 tree const2
= TREE_OPERAND (arg1
, 1);
8499 tree variable1
= TREE_OPERAND (arg0
, 0);
8500 tree variable2
= TREE_OPERAND (arg1
, 0);
8502 const char * const warnmsg
= G_("assuming signed overflow does not "
8503 "occur when combining constants around "
8506 /* Put the constant on the side where it doesn't overflow and is
8507 of lower absolute value and of same sign than before. */
8508 cst
= int_const_binop (TREE_CODE (arg0
) == TREE_CODE (arg1
)
8509 ? MINUS_EXPR
: PLUS_EXPR
,
8511 if (!TREE_OVERFLOW (cst
)
8512 && tree_int_cst_compare (const2
, cst
) == tree_int_cst_sgn (const2
)
8513 && tree_int_cst_sgn (cst
) == tree_int_cst_sgn (const2
))
8515 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_COMPARISON
);
8516 return fold_build2_loc (loc
, code
, type
,
8518 fold_build2_loc (loc
, TREE_CODE (arg1
),
8523 cst
= int_const_binop (TREE_CODE (arg0
) == TREE_CODE (arg1
)
8524 ? MINUS_EXPR
: PLUS_EXPR
,
8526 if (!TREE_OVERFLOW (cst
)
8527 && tree_int_cst_compare (const1
, cst
) == tree_int_cst_sgn (const1
)
8528 && tree_int_cst_sgn (cst
) == tree_int_cst_sgn (const1
))
8530 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_COMPARISON
);
8531 return fold_build2_loc (loc
, code
, type
,
8532 fold_build2_loc (loc
, TREE_CODE (arg0
),
8539 tem
= maybe_canonicalize_comparison (loc
, code
, type
, arg0
, arg1
);
8543 /* If this is comparing a constant with a MIN_EXPR or a MAX_EXPR of a
8544 constant, we can simplify it. */
8545 if (TREE_CODE (arg1
) == INTEGER_CST
8546 && (TREE_CODE (arg0
) == MIN_EXPR
8547 || TREE_CODE (arg0
) == MAX_EXPR
)
8548 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
8550 tem
= optimize_minmax_comparison (loc
, code
, type
, op0
, op1
);
8555 /* If we are comparing an expression that just has comparisons
8556 of two integer values, arithmetic expressions of those comparisons,
8557 and constants, we can simplify it. There are only three cases
8558 to check: the two values can either be equal, the first can be
8559 greater, or the second can be greater. Fold the expression for
8560 those three values. Since each value must be 0 or 1, we have
8561 eight possibilities, each of which corresponds to the constant 0
8562 or 1 or one of the six possible comparisons.
8564 This handles common cases like (a > b) == 0 but also handles
8565 expressions like ((x > y) - (y > x)) > 0, which supposedly
8566 occur in macroized code. */
8568 if (TREE_CODE (arg1
) == INTEGER_CST
&& TREE_CODE (arg0
) != INTEGER_CST
)
8570 tree cval1
= 0, cval2
= 0;
8573 if (twoval_comparison_p (arg0
, &cval1
, &cval2
, &save_p
)
8574 /* Don't handle degenerate cases here; they should already
8575 have been handled anyway. */
8576 && cval1
!= 0 && cval2
!= 0
8577 && ! (TREE_CONSTANT (cval1
) && TREE_CONSTANT (cval2
))
8578 && TREE_TYPE (cval1
) == TREE_TYPE (cval2
)
8579 && INTEGRAL_TYPE_P (TREE_TYPE (cval1
))
8580 && TYPE_MAX_VALUE (TREE_TYPE (cval1
))
8581 && TYPE_MAX_VALUE (TREE_TYPE (cval2
))
8582 && ! operand_equal_p (TYPE_MIN_VALUE (TREE_TYPE (cval1
)),
8583 TYPE_MAX_VALUE (TREE_TYPE (cval2
)), 0))
8585 tree maxval
= TYPE_MAX_VALUE (TREE_TYPE (cval1
));
8586 tree minval
= TYPE_MIN_VALUE (TREE_TYPE (cval1
));
8588 /* We can't just pass T to eval_subst in case cval1 or cval2
8589 was the same as ARG1. */
8592 = fold_build2_loc (loc
, code
, type
,
8593 eval_subst (loc
, arg0
, cval1
, maxval
,
8597 = fold_build2_loc (loc
, code
, type
,
8598 eval_subst (loc
, arg0
, cval1
, maxval
,
8602 = fold_build2_loc (loc
, code
, type
,
8603 eval_subst (loc
, arg0
, cval1
, minval
,
8607 /* All three of these results should be 0 or 1. Confirm they are.
8608 Then use those values to select the proper code to use. */
8610 if (TREE_CODE (high_result
) == INTEGER_CST
8611 && TREE_CODE (equal_result
) == INTEGER_CST
8612 && TREE_CODE (low_result
) == INTEGER_CST
)
8614 /* Make a 3-bit mask with the high-order bit being the
8615 value for `>', the next for '=', and the low for '<'. */
8616 switch ((integer_onep (high_result
) * 4)
8617 + (integer_onep (equal_result
) * 2)
8618 + integer_onep (low_result
))
8622 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
8643 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
8648 tem
= save_expr (build2 (code
, type
, cval1
, cval2
));
8649 SET_EXPR_LOCATION (tem
, loc
);
8652 return fold_build2_loc (loc
, code
, type
, cval1
, cval2
);
8657 /* We can fold X/C1 op C2 where C1 and C2 are integer constants
8658 into a single range test. */
8659 if ((TREE_CODE (arg0
) == TRUNC_DIV_EXPR
8660 || TREE_CODE (arg0
) == EXACT_DIV_EXPR
)
8661 && TREE_CODE (arg1
) == INTEGER_CST
8662 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
8663 && !integer_zerop (TREE_OPERAND (arg0
, 1))
8664 && !TREE_OVERFLOW (TREE_OPERAND (arg0
, 1))
8665 && !TREE_OVERFLOW (arg1
))
8667 tem
= fold_div_compare (loc
, code
, type
, arg0
, arg1
);
8668 if (tem
!= NULL_TREE
)
8676 /* Subroutine of fold_binary. Optimize complex multiplications of the
8677 form z * conj(z), as pow(realpart(z),2) + pow(imagpart(z),2). The
8678 argument EXPR represents the expression "z" of type TYPE. */
8681 fold_mult_zconjz (location_t loc
, tree type
, tree expr
)
8683 tree itype
= TREE_TYPE (type
);
8684 tree rpart
, ipart
, tem
;
8686 if (TREE_CODE (expr
) == COMPLEX_EXPR
)
8688 rpart
= TREE_OPERAND (expr
, 0);
8689 ipart
= TREE_OPERAND (expr
, 1);
8691 else if (TREE_CODE (expr
) == COMPLEX_CST
)
8693 rpart
= TREE_REALPART (expr
);
8694 ipart
= TREE_IMAGPART (expr
);
8698 expr
= save_expr (expr
);
8699 rpart
= fold_build1_loc (loc
, REALPART_EXPR
, itype
, expr
);
8700 ipart
= fold_build1_loc (loc
, IMAGPART_EXPR
, itype
, expr
);
8703 rpart
= save_expr (rpart
);
8704 ipart
= save_expr (ipart
);
8705 tem
= fold_build2_loc (loc
, PLUS_EXPR
, itype
,
8706 fold_build2_loc (loc
, MULT_EXPR
, itype
, rpart
, rpart
),
8707 fold_build2_loc (loc
, MULT_EXPR
, itype
, ipart
, ipart
));
8708 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, tem
,
8709 build_zero_cst (itype
));
8713 /* Helper function for fold_vec_perm. Store elements of VECTOR_CST or
8714 CONSTRUCTOR ARG into array ELTS and return true if successful. */
8717 vec_cst_ctor_to_array (tree arg
, tree
*elts
)
8719 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg
)), i
;
8721 if (TREE_CODE (arg
) == VECTOR_CST
)
8723 for (i
= 0; i
< VECTOR_CST_NELTS (arg
); ++i
)
8724 elts
[i
] = VECTOR_CST_ELT (arg
, i
);
8726 else if (TREE_CODE (arg
) == CONSTRUCTOR
)
8728 constructor_elt
*elt
;
8730 FOR_EACH_VEC_SAFE_ELT (CONSTRUCTOR_ELTS (arg
), i
, elt
)
8731 if (i
>= nelts
|| TREE_CODE (TREE_TYPE (elt
->value
)) == VECTOR_TYPE
)
8734 elts
[i
] = elt
->value
;
8738 for (; i
< nelts
; i
++)
8740 = fold_convert (TREE_TYPE (TREE_TYPE (arg
)), integer_zero_node
);
8744 /* Attempt to fold vector permutation of ARG0 and ARG1 vectors using SEL
8745 selector. Return the folded VECTOR_CST or CONSTRUCTOR if successful,
8746 NULL_TREE otherwise. */
8749 fold_vec_perm (tree type
, tree arg0
, tree arg1
, const unsigned char *sel
)
8751 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (type
), i
;
8753 bool need_ctor
= false;
8755 gcc_assert (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0
)) == nelts
8756 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg1
)) == nelts
);
8757 if (TREE_TYPE (TREE_TYPE (arg0
)) != TREE_TYPE (type
)
8758 || TREE_TYPE (TREE_TYPE (arg1
)) != TREE_TYPE (type
))
8761 elts
= XALLOCAVEC (tree
, nelts
* 3);
8762 if (!vec_cst_ctor_to_array (arg0
, elts
)
8763 || !vec_cst_ctor_to_array (arg1
, elts
+ nelts
))
8766 for (i
= 0; i
< nelts
; i
++)
8768 if (!CONSTANT_CLASS_P (elts
[sel
[i
]]))
8770 elts
[i
+ 2 * nelts
] = unshare_expr (elts
[sel
[i
]]);
8775 vec
<constructor_elt
, va_gc
> *v
;
8776 vec_alloc (v
, nelts
);
8777 for (i
= 0; i
< nelts
; i
++)
8778 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, elts
[2 * nelts
+ i
]);
8779 return build_constructor (type
, v
);
8782 return build_vector (type
, &elts
[2 * nelts
]);
8785 /* Try to fold a pointer difference of type TYPE two address expressions of
8786 array references AREF0 and AREF1 using location LOC. Return a
8787 simplified expression for the difference or NULL_TREE. */
8790 fold_addr_of_array_ref_difference (location_t loc
, tree type
,
8791 tree aref0
, tree aref1
)
8793 tree base0
= TREE_OPERAND (aref0
, 0);
8794 tree base1
= TREE_OPERAND (aref1
, 0);
8795 tree base_offset
= build_int_cst (type
, 0);
8797 /* If the bases are array references as well, recurse. If the bases
8798 are pointer indirections compute the difference of the pointers.
8799 If the bases are equal, we are set. */
8800 if ((TREE_CODE (base0
) == ARRAY_REF
8801 && TREE_CODE (base1
) == ARRAY_REF
8803 = fold_addr_of_array_ref_difference (loc
, type
, base0
, base1
)))
8804 || (INDIRECT_REF_P (base0
)
8805 && INDIRECT_REF_P (base1
)
8806 && (base_offset
= fold_binary_loc (loc
, MINUS_EXPR
, type
,
8807 TREE_OPERAND (base0
, 0),
8808 TREE_OPERAND (base1
, 0))))
8809 || operand_equal_p (base0
, base1
, 0))
8811 tree op0
= fold_convert_loc (loc
, type
, TREE_OPERAND (aref0
, 1));
8812 tree op1
= fold_convert_loc (loc
, type
, TREE_OPERAND (aref1
, 1));
8813 tree esz
= fold_convert_loc (loc
, type
, array_ref_element_size (aref0
));
8814 tree diff
= build2 (MINUS_EXPR
, type
, op0
, op1
);
8815 return fold_build2_loc (loc
, PLUS_EXPR
, type
,
8817 fold_build2_loc (loc
, MULT_EXPR
, type
,
8823 /* If the real or vector real constant CST of type TYPE has an exact
8824 inverse, return it, else return NULL. */
8827 exact_inverse (tree type
, tree cst
)
8830 tree unit_type
, *elts
;
8832 unsigned vec_nelts
, i
;
8834 switch (TREE_CODE (cst
))
8837 r
= TREE_REAL_CST (cst
);
8839 if (exact_real_inverse (TYPE_MODE (type
), &r
))
8840 return build_real (type
, r
);
8845 vec_nelts
= VECTOR_CST_NELTS (cst
);
8846 elts
= XALLOCAVEC (tree
, vec_nelts
);
8847 unit_type
= TREE_TYPE (type
);
8848 mode
= TYPE_MODE (unit_type
);
8850 for (i
= 0; i
< vec_nelts
; i
++)
8852 r
= TREE_REAL_CST (VECTOR_CST_ELT (cst
, i
));
8853 if (!exact_real_inverse (mode
, &r
))
8855 elts
[i
] = build_real (unit_type
, r
);
8858 return build_vector (type
, elts
);
8865 /* Mask out the tz least significant bits of X of type TYPE where
8866 tz is the number of trailing zeroes in Y. */
8868 mask_with_tz (tree type
, const wide_int
&x
, const wide_int
&y
)
8870 int tz
= wi::ctz (y
);
8872 return wi::mask (tz
, true, TYPE_PRECISION (type
)) & x
;
8876 /* Return true when T is an address and is known to be nonzero.
8877 For floating point we further ensure that T is not denormal.
8878 Similar logic is present in nonzero_address in rtlanal.h.
8880 If the return value is based on the assumption that signed overflow
8881 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
8882 change *STRICT_OVERFLOW_P. */
8885 tree_expr_nonzero_warnv_p (tree t
, bool *strict_overflow_p
)
8887 tree type
= TREE_TYPE (t
);
8888 enum tree_code code
;
8890 /* Doing something useful for floating point would need more work. */
8891 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
8894 code
= TREE_CODE (t
);
8895 switch (TREE_CODE_CLASS (code
))
8898 return tree_unary_nonzero_warnv_p (code
, type
, TREE_OPERAND (t
, 0),
8901 case tcc_comparison
:
8902 return tree_binary_nonzero_warnv_p (code
, type
,
8903 TREE_OPERAND (t
, 0),
8904 TREE_OPERAND (t
, 1),
8907 case tcc_declaration
:
8909 return tree_single_nonzero_warnv_p (t
, strict_overflow_p
);
8917 case TRUTH_NOT_EXPR
:
8918 return tree_unary_nonzero_warnv_p (code
, type
, TREE_OPERAND (t
, 0),
8921 case TRUTH_AND_EXPR
:
8923 case TRUTH_XOR_EXPR
:
8924 return tree_binary_nonzero_warnv_p (code
, type
,
8925 TREE_OPERAND (t
, 0),
8926 TREE_OPERAND (t
, 1),
8934 case WITH_SIZE_EXPR
:
8936 return tree_single_nonzero_warnv_p (t
, strict_overflow_p
);
8941 return tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 1),
8945 return tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 0),
8950 tree fndecl
= get_callee_fndecl (t
);
8951 if (!fndecl
) return false;
8952 if (flag_delete_null_pointer_checks
&& !flag_check_new
8953 && DECL_IS_OPERATOR_NEW (fndecl
)
8954 && !TREE_NOTHROW (fndecl
))
8956 if (flag_delete_null_pointer_checks
8957 && lookup_attribute ("returns_nonnull",
8958 TYPE_ATTRIBUTES (TREE_TYPE (fndecl
))))
8960 return alloca_call_p (t
);
8969 /* Return true when T is an address and is known to be nonzero.
8970 Handle warnings about undefined signed overflow. */
8973 tree_expr_nonzero_p (tree t
)
8975 bool ret
, strict_overflow_p
;
8977 strict_overflow_p
= false;
8978 ret
= tree_expr_nonzero_warnv_p (t
, &strict_overflow_p
);
8979 if (strict_overflow_p
)
8980 fold_overflow_warning (("assuming signed overflow does not occur when "
8981 "determining that expression is always "
8983 WARN_STRICT_OVERFLOW_MISC
);
8987 /* Fold a binary expression of code CODE and type TYPE with operands
8988 OP0 and OP1. LOC is the location of the resulting expression.
8989 Return the folded expression if folding is successful. Otherwise,
8990 return NULL_TREE. */
8993 fold_binary_loc (location_t loc
,
8994 enum tree_code code
, tree type
, tree op0
, tree op1
)
8996 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
8997 tree arg0
, arg1
, tem
;
8998 tree t1
= NULL_TREE
;
8999 bool strict_overflow_p
;
9002 gcc_assert (IS_EXPR_CODE_CLASS (kind
)
9003 && TREE_CODE_LENGTH (code
) == 2
9005 && op1
!= NULL_TREE
);
9010 /* Strip any conversions that don't change the mode. This is
9011 safe for every expression, except for a comparison expression
9012 because its signedness is derived from its operands. So, in
9013 the latter case, only strip conversions that don't change the
9014 signedness. MIN_EXPR/MAX_EXPR also need signedness of arguments
9017 Note that this is done as an internal manipulation within the
9018 constant folder, in order to find the simplest representation
9019 of the arguments so that their form can be studied. In any
9020 cases, the appropriate type conversions should be put back in
9021 the tree that will get out of the constant folder. */
9023 if (kind
== tcc_comparison
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
9025 STRIP_SIGN_NOPS (arg0
);
9026 STRIP_SIGN_NOPS (arg1
);
9034 /* Note that TREE_CONSTANT isn't enough: static var addresses are
9035 constant but we can't do arithmetic on them. */
9036 if (CONSTANT_CLASS_P (arg0
) && CONSTANT_CLASS_P (arg1
))
9038 tem
= const_binop (code
, type
, arg0
, arg1
);
9039 if (tem
!= NULL_TREE
)
9041 if (TREE_TYPE (tem
) != type
)
9042 tem
= fold_convert_loc (loc
, type
, tem
);
9047 /* If this is a commutative operation, and ARG0 is a constant, move it
9048 to ARG1 to reduce the number of tests below. */
9049 if (commutative_tree_code (code
)
9050 && tree_swap_operands_p (arg0
, arg1
, true))
9051 return fold_build2_loc (loc
, code
, type
, op1
, op0
);
9053 /* Likewise if this is a comparison, and ARG0 is a constant, move it
9054 to ARG1 to reduce the number of tests below. */
9055 if (kind
== tcc_comparison
9056 && tree_swap_operands_p (arg0
, arg1
, true))
9057 return fold_build2_loc (loc
, swap_tree_comparison (code
), type
, op1
, op0
);
9059 tem
= generic_simplify (loc
, code
, type
, op0
, op1
);
9063 /* ARG0 is the first operand of EXPR, and ARG1 is the second operand.
9065 First check for cases where an arithmetic operation is applied to a
9066 compound, conditional, or comparison operation. Push the arithmetic
9067 operation inside the compound or conditional to see if any folding
9068 can then be done. Convert comparison to conditional for this purpose.
9069 The also optimizes non-constant cases that used to be done in
9072 Before we do that, see if this is a BIT_AND_EXPR or a BIT_IOR_EXPR,
9073 one of the operands is a comparison and the other is a comparison, a
9074 BIT_AND_EXPR with the constant 1, or a truth value. In that case, the
9075 code below would make the expression more complex. Change it to a
9076 TRUTH_{AND,OR}_EXPR. Likewise, convert a similar NE_EXPR to
9077 TRUTH_XOR_EXPR and an EQ_EXPR to the inversion of a TRUTH_XOR_EXPR. */
9079 if ((code
== BIT_AND_EXPR
|| code
== BIT_IOR_EXPR
9080 || code
== EQ_EXPR
|| code
== NE_EXPR
)
9081 && TREE_CODE (type
) != VECTOR_TYPE
9082 && ((truth_value_p (TREE_CODE (arg0
))
9083 && (truth_value_p (TREE_CODE (arg1
))
9084 || (TREE_CODE (arg1
) == BIT_AND_EXPR
9085 && integer_onep (TREE_OPERAND (arg1
, 1)))))
9086 || (truth_value_p (TREE_CODE (arg1
))
9087 && (truth_value_p (TREE_CODE (arg0
))
9088 || (TREE_CODE (arg0
) == BIT_AND_EXPR
9089 && integer_onep (TREE_OPERAND (arg0
, 1)))))))
9091 tem
= fold_build2_loc (loc
, code
== BIT_AND_EXPR
? TRUTH_AND_EXPR
9092 : code
== BIT_IOR_EXPR
? TRUTH_OR_EXPR
9095 fold_convert_loc (loc
, boolean_type_node
, arg0
),
9096 fold_convert_loc (loc
, boolean_type_node
, arg1
));
9098 if (code
== EQ_EXPR
)
9099 tem
= invert_truthvalue_loc (loc
, tem
);
9101 return fold_convert_loc (loc
, type
, tem
);
9104 if (TREE_CODE_CLASS (code
) == tcc_binary
9105 || TREE_CODE_CLASS (code
) == tcc_comparison
)
9107 if (TREE_CODE (arg0
) == COMPOUND_EXPR
)
9109 tem
= fold_build2_loc (loc
, code
, type
,
9110 fold_convert_loc (loc
, TREE_TYPE (op0
),
9111 TREE_OPERAND (arg0
, 1)), op1
);
9112 return build2_loc (loc
, COMPOUND_EXPR
, type
, TREE_OPERAND (arg0
, 0),
9115 if (TREE_CODE (arg1
) == COMPOUND_EXPR
9116 && reorder_operands_p (arg0
, TREE_OPERAND (arg1
, 0)))
9118 tem
= fold_build2_loc (loc
, code
, type
, op0
,
9119 fold_convert_loc (loc
, TREE_TYPE (op1
),
9120 TREE_OPERAND (arg1
, 1)));
9121 return build2_loc (loc
, COMPOUND_EXPR
, type
, TREE_OPERAND (arg1
, 0),
9125 if (TREE_CODE (arg0
) == COND_EXPR
9126 || TREE_CODE (arg0
) == VEC_COND_EXPR
9127 || COMPARISON_CLASS_P (arg0
))
9129 tem
= fold_binary_op_with_conditional_arg (loc
, code
, type
, op0
, op1
,
9131 /*cond_first_p=*/1);
9132 if (tem
!= NULL_TREE
)
9136 if (TREE_CODE (arg1
) == COND_EXPR
9137 || TREE_CODE (arg1
) == VEC_COND_EXPR
9138 || COMPARISON_CLASS_P (arg1
))
9140 tem
= fold_binary_op_with_conditional_arg (loc
, code
, type
, op0
, op1
,
9142 /*cond_first_p=*/0);
9143 if (tem
!= NULL_TREE
)
9151 /* MEM[&MEM[p, CST1], CST2] -> MEM[p, CST1 + CST2]. */
9152 if (TREE_CODE (arg0
) == ADDR_EXPR
9153 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == MEM_REF
)
9155 tree iref
= TREE_OPERAND (arg0
, 0);
9156 return fold_build2 (MEM_REF
, type
,
9157 TREE_OPERAND (iref
, 0),
9158 int_const_binop (PLUS_EXPR
, arg1
,
9159 TREE_OPERAND (iref
, 1)));
9162 /* MEM[&a.b, CST2] -> MEM[&a, offsetof (a, b) + CST2]. */
9163 if (TREE_CODE (arg0
) == ADDR_EXPR
9164 && handled_component_p (TREE_OPERAND (arg0
, 0)))
9167 HOST_WIDE_INT coffset
;
9168 base
= get_addr_base_and_unit_offset (TREE_OPERAND (arg0
, 0),
9172 return fold_build2 (MEM_REF
, type
,
9173 build_fold_addr_expr (base
),
9174 int_const_binop (PLUS_EXPR
, arg1
,
9175 size_int (coffset
)));
9180 case POINTER_PLUS_EXPR
:
9181 /* INT +p INT -> (PTR)(INT + INT). Stripping types allows for this. */
9182 if (INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
9183 && INTEGRAL_TYPE_P (TREE_TYPE (arg0
)))
9184 return fold_convert_loc (loc
, type
,
9185 fold_build2_loc (loc
, PLUS_EXPR
, sizetype
,
9186 fold_convert_loc (loc
, sizetype
,
9188 fold_convert_loc (loc
, sizetype
,
9194 if (INTEGRAL_TYPE_P (type
) || VECTOR_INTEGER_TYPE_P (type
))
9196 /* X + (X / CST) * -CST is X % CST. */
9197 if (TREE_CODE (arg1
) == MULT_EXPR
9198 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == TRUNC_DIV_EXPR
9199 && operand_equal_p (arg0
,
9200 TREE_OPERAND (TREE_OPERAND (arg1
, 0), 0), 0))
9202 tree cst0
= TREE_OPERAND (TREE_OPERAND (arg1
, 0), 1);
9203 tree cst1
= TREE_OPERAND (arg1
, 1);
9204 tree sum
= fold_binary_loc (loc
, PLUS_EXPR
, TREE_TYPE (cst1
),
9206 if (sum
&& integer_zerop (sum
))
9207 return fold_convert_loc (loc
, type
,
9208 fold_build2_loc (loc
, TRUNC_MOD_EXPR
,
9209 TREE_TYPE (arg0
), arg0
,
9214 /* Handle (A1 * C1) + (A2 * C2) with A1, A2 or C1, C2 being the same or
9215 one. Make sure the type is not saturating and has the signedness of
9216 the stripped operands, as fold_plusminus_mult_expr will re-associate.
9217 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
9218 if ((TREE_CODE (arg0
) == MULT_EXPR
9219 || TREE_CODE (arg1
) == MULT_EXPR
)
9220 && !TYPE_SATURATING (type
)
9221 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg0
))
9222 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg1
))
9223 && (!FLOAT_TYPE_P (type
) || flag_associative_math
))
9225 tree tem
= fold_plusminus_mult_expr (loc
, code
, type
, arg0
, arg1
);
9230 if (! FLOAT_TYPE_P (type
))
9232 /* Reassociate (plus (plus (mult) (foo)) (mult)) as
9233 (plus (plus (mult) (mult)) (foo)) so that we can
9234 take advantage of the factoring cases below. */
9235 if (ANY_INTEGRAL_TYPE_P (type
)
9236 && TYPE_OVERFLOW_WRAPS (type
)
9237 && (((TREE_CODE (arg0
) == PLUS_EXPR
9238 || TREE_CODE (arg0
) == MINUS_EXPR
)
9239 && TREE_CODE (arg1
) == MULT_EXPR
)
9240 || ((TREE_CODE (arg1
) == PLUS_EXPR
9241 || TREE_CODE (arg1
) == MINUS_EXPR
)
9242 && TREE_CODE (arg0
) == MULT_EXPR
)))
9244 tree parg0
, parg1
, parg
, marg
;
9245 enum tree_code pcode
;
9247 if (TREE_CODE (arg1
) == MULT_EXPR
)
9248 parg
= arg0
, marg
= arg1
;
9250 parg
= arg1
, marg
= arg0
;
9251 pcode
= TREE_CODE (parg
);
9252 parg0
= TREE_OPERAND (parg
, 0);
9253 parg1
= TREE_OPERAND (parg
, 1);
9257 if (TREE_CODE (parg0
) == MULT_EXPR
9258 && TREE_CODE (parg1
) != MULT_EXPR
)
9259 return fold_build2_loc (loc
, pcode
, type
,
9260 fold_build2_loc (loc
, PLUS_EXPR
, type
,
9261 fold_convert_loc (loc
, type
,
9263 fold_convert_loc (loc
, type
,
9265 fold_convert_loc (loc
, type
, parg1
));
9266 if (TREE_CODE (parg0
) != MULT_EXPR
9267 && TREE_CODE (parg1
) == MULT_EXPR
)
9269 fold_build2_loc (loc
, PLUS_EXPR
, type
,
9270 fold_convert_loc (loc
, type
, parg0
),
9271 fold_build2_loc (loc
, pcode
, type
,
9272 fold_convert_loc (loc
, type
, marg
),
9273 fold_convert_loc (loc
, type
,
9279 /* Fold __complex__ ( x, 0 ) + __complex__ ( 0, y )
9280 to __complex__ ( x, y ). This is not the same for SNaNs or
9281 if signed zeros are involved. */
9282 if (!HONOR_SNANS (element_mode (arg0
))
9283 && !HONOR_SIGNED_ZEROS (element_mode (arg0
))
9284 && COMPLEX_FLOAT_TYPE_P (TREE_TYPE (arg0
)))
9286 tree rtype
= TREE_TYPE (TREE_TYPE (arg0
));
9287 tree arg0r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg0
);
9288 tree arg0i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg0
);
9289 bool arg0rz
= false, arg0iz
= false;
9290 if ((arg0r
&& (arg0rz
= real_zerop (arg0r
)))
9291 || (arg0i
&& (arg0iz
= real_zerop (arg0i
))))
9293 tree arg1r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg1
);
9294 tree arg1i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg1
);
9295 if (arg0rz
&& arg1i
&& real_zerop (arg1i
))
9297 tree rp
= arg1r
? arg1r
9298 : build1 (REALPART_EXPR
, rtype
, arg1
);
9299 tree ip
= arg0i
? arg0i
9300 : build1 (IMAGPART_EXPR
, rtype
, arg0
);
9301 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
9303 else if (arg0iz
&& arg1r
&& real_zerop (arg1r
))
9305 tree rp
= arg0r
? arg0r
9306 : build1 (REALPART_EXPR
, rtype
, arg0
);
9307 tree ip
= arg1i
? arg1i
9308 : build1 (IMAGPART_EXPR
, rtype
, arg1
);
9309 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
9314 if (flag_unsafe_math_optimizations
9315 && (TREE_CODE (arg0
) == RDIV_EXPR
|| TREE_CODE (arg0
) == MULT_EXPR
)
9316 && (TREE_CODE (arg1
) == RDIV_EXPR
|| TREE_CODE (arg1
) == MULT_EXPR
)
9317 && (tem
= distribute_real_division (loc
, code
, type
, arg0
, arg1
)))
9320 /* Convert a + (b*c + d*e) into (a + b*c) + d*e.
9321 We associate floats only if the user has specified
9322 -fassociative-math. */
9323 if (flag_associative_math
9324 && TREE_CODE (arg1
) == PLUS_EXPR
9325 && TREE_CODE (arg0
) != MULT_EXPR
)
9327 tree tree10
= TREE_OPERAND (arg1
, 0);
9328 tree tree11
= TREE_OPERAND (arg1
, 1);
9329 if (TREE_CODE (tree11
) == MULT_EXPR
9330 && TREE_CODE (tree10
) == MULT_EXPR
)
9333 tree0
= fold_build2_loc (loc
, PLUS_EXPR
, type
, arg0
, tree10
);
9334 return fold_build2_loc (loc
, PLUS_EXPR
, type
, tree0
, tree11
);
9337 /* Convert (b*c + d*e) + a into b*c + (d*e +a).
9338 We associate floats only if the user has specified
9339 -fassociative-math. */
9340 if (flag_associative_math
9341 && TREE_CODE (arg0
) == PLUS_EXPR
9342 && TREE_CODE (arg1
) != MULT_EXPR
)
9344 tree tree00
= TREE_OPERAND (arg0
, 0);
9345 tree tree01
= TREE_OPERAND (arg0
, 1);
9346 if (TREE_CODE (tree01
) == MULT_EXPR
9347 && TREE_CODE (tree00
) == MULT_EXPR
)
9350 tree0
= fold_build2_loc (loc
, PLUS_EXPR
, type
, tree01
, arg1
);
9351 return fold_build2_loc (loc
, PLUS_EXPR
, type
, tree00
, tree0
);
9357 /* (A << C1) + (A >> C2) if A is unsigned and C1+C2 is the size of A
9358 is a rotate of A by C1 bits. */
9359 /* (A << B) + (A >> (Z - B)) if A is unsigned and Z is the size of A
9360 is a rotate of A by B bits. */
9362 enum tree_code code0
, code1
;
9364 code0
= TREE_CODE (arg0
);
9365 code1
= TREE_CODE (arg1
);
9366 if (((code0
== RSHIFT_EXPR
&& code1
== LSHIFT_EXPR
)
9367 || (code1
== RSHIFT_EXPR
&& code0
== LSHIFT_EXPR
))
9368 && operand_equal_p (TREE_OPERAND (arg0
, 0),
9369 TREE_OPERAND (arg1
, 0), 0)
9370 && (rtype
= TREE_TYPE (TREE_OPERAND (arg0
, 0)),
9371 TYPE_UNSIGNED (rtype
))
9372 /* Only create rotates in complete modes. Other cases are not
9373 expanded properly. */
9374 && (element_precision (rtype
)
9375 == GET_MODE_UNIT_PRECISION (TYPE_MODE (rtype
))))
9377 tree tree01
, tree11
;
9378 enum tree_code code01
, code11
;
9380 tree01
= TREE_OPERAND (arg0
, 1);
9381 tree11
= TREE_OPERAND (arg1
, 1);
9382 STRIP_NOPS (tree01
);
9383 STRIP_NOPS (tree11
);
9384 code01
= TREE_CODE (tree01
);
9385 code11
= TREE_CODE (tree11
);
9386 if (code01
== INTEGER_CST
9387 && code11
== INTEGER_CST
9388 && (wi::to_widest (tree01
) + wi::to_widest (tree11
)
9389 == element_precision (TREE_TYPE (TREE_OPERAND (arg0
, 0)))))
9391 tem
= build2_loc (loc
, LROTATE_EXPR
,
9392 TREE_TYPE (TREE_OPERAND (arg0
, 0)),
9393 TREE_OPERAND (arg0
, 0),
9394 code0
== LSHIFT_EXPR
9395 ? TREE_OPERAND (arg0
, 1)
9396 : TREE_OPERAND (arg1
, 1));
9397 return fold_convert_loc (loc
, type
, tem
);
9399 else if (code11
== MINUS_EXPR
)
9401 tree tree110
, tree111
;
9402 tree110
= TREE_OPERAND (tree11
, 0);
9403 tree111
= TREE_OPERAND (tree11
, 1);
9404 STRIP_NOPS (tree110
);
9405 STRIP_NOPS (tree111
);
9406 if (TREE_CODE (tree110
) == INTEGER_CST
9407 && 0 == compare_tree_int (tree110
,
9409 (TREE_TYPE (TREE_OPERAND
9411 && operand_equal_p (tree01
, tree111
, 0))
9413 fold_convert_loc (loc
, type
,
9414 build2 ((code0
== LSHIFT_EXPR
9417 TREE_TYPE (TREE_OPERAND (arg0
, 0)),
9418 TREE_OPERAND (arg0
, 0),
9419 TREE_OPERAND (arg0
, 1)));
9421 else if (code01
== MINUS_EXPR
)
9423 tree tree010
, tree011
;
9424 tree010
= TREE_OPERAND (tree01
, 0);
9425 tree011
= TREE_OPERAND (tree01
, 1);
9426 STRIP_NOPS (tree010
);
9427 STRIP_NOPS (tree011
);
9428 if (TREE_CODE (tree010
) == INTEGER_CST
9429 && 0 == compare_tree_int (tree010
,
9431 (TREE_TYPE (TREE_OPERAND
9433 && operand_equal_p (tree11
, tree011
, 0))
9434 return fold_convert_loc
9436 build2 ((code0
!= LSHIFT_EXPR
9439 TREE_TYPE (TREE_OPERAND (arg0
, 0)),
9440 TREE_OPERAND (arg0
, 0), TREE_OPERAND (arg1
, 1)));
9446 /* In most languages, can't associate operations on floats through
9447 parentheses. Rather than remember where the parentheses were, we
9448 don't associate floats at all, unless the user has specified
9450 And, we need to make sure type is not saturating. */
9452 if ((! FLOAT_TYPE_P (type
) || flag_associative_math
)
9453 && !TYPE_SATURATING (type
))
9455 tree var0
, con0
, lit0
, minus_lit0
;
9456 tree var1
, con1
, lit1
, minus_lit1
;
9460 /* Split both trees into variables, constants, and literals. Then
9461 associate each group together, the constants with literals,
9462 then the result with variables. This increases the chances of
9463 literals being recombined later and of generating relocatable
9464 expressions for the sum of a constant and literal. */
9465 var0
= split_tree (arg0
, code
, &con0
, &lit0
, &minus_lit0
, 0);
9466 var1
= split_tree (arg1
, code
, &con1
, &lit1
, &minus_lit1
,
9467 code
== MINUS_EXPR
);
9469 /* Recombine MINUS_EXPR operands by using PLUS_EXPR. */
9470 if (code
== MINUS_EXPR
)
9473 /* With undefined overflow prefer doing association in a type
9474 which wraps on overflow, if that is one of the operand types. */
9475 if ((POINTER_TYPE_P (type
) && POINTER_TYPE_OVERFLOW_UNDEFINED
)
9476 || (INTEGRAL_TYPE_P (type
) && !TYPE_OVERFLOW_WRAPS (type
)))
9478 if (INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
9479 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg0
)))
9480 atype
= TREE_TYPE (arg0
);
9481 else if (INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
9482 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg1
)))
9483 atype
= TREE_TYPE (arg1
);
9484 gcc_assert (TYPE_PRECISION (atype
) == TYPE_PRECISION (type
));
9487 /* With undefined overflow we can only associate constants with one
9488 variable, and constants whose association doesn't overflow. */
9489 if ((POINTER_TYPE_P (atype
) && POINTER_TYPE_OVERFLOW_UNDEFINED
)
9490 || (INTEGRAL_TYPE_P (atype
) && !TYPE_OVERFLOW_WRAPS (atype
)))
9497 if (TREE_CODE (tmp0
) == NEGATE_EXPR
)
9498 tmp0
= TREE_OPERAND (tmp0
, 0);
9499 if (CONVERT_EXPR_P (tmp0
)
9500 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (tmp0
, 0)))
9501 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (tmp0
, 0)))
9502 <= TYPE_PRECISION (atype
)))
9503 tmp0
= TREE_OPERAND (tmp0
, 0);
9504 if (TREE_CODE (tmp1
) == NEGATE_EXPR
)
9505 tmp1
= TREE_OPERAND (tmp1
, 0);
9506 if (CONVERT_EXPR_P (tmp1
)
9507 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (tmp1
, 0)))
9508 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (tmp1
, 0)))
9509 <= TYPE_PRECISION (atype
)))
9510 tmp1
= TREE_OPERAND (tmp1
, 0);
9511 /* The only case we can still associate with two variables
9512 is if they are the same, modulo negation and bit-pattern
9513 preserving conversions. */
9514 if (!operand_equal_p (tmp0
, tmp1
, 0))
9519 /* Only do something if we found more than two objects. Otherwise,
9520 nothing has changed and we risk infinite recursion. */
9522 && (2 < ((var0
!= 0) + (var1
!= 0)
9523 + (con0
!= 0) + (con1
!= 0)
9524 + (lit0
!= 0) + (lit1
!= 0)
9525 + (minus_lit0
!= 0) + (minus_lit1
!= 0))))
9527 bool any_overflows
= false;
9528 if (lit0
) any_overflows
|= TREE_OVERFLOW (lit0
);
9529 if (lit1
) any_overflows
|= TREE_OVERFLOW (lit1
);
9530 if (minus_lit0
) any_overflows
|= TREE_OVERFLOW (minus_lit0
);
9531 if (minus_lit1
) any_overflows
|= TREE_OVERFLOW (minus_lit1
);
9532 var0
= associate_trees (loc
, var0
, var1
, code
, atype
);
9533 con0
= associate_trees (loc
, con0
, con1
, code
, atype
);
9534 lit0
= associate_trees (loc
, lit0
, lit1
, code
, atype
);
9535 minus_lit0
= associate_trees (loc
, minus_lit0
, minus_lit1
,
9538 /* Preserve the MINUS_EXPR if the negative part of the literal is
9539 greater than the positive part. Otherwise, the multiplicative
9540 folding code (i.e extract_muldiv) may be fooled in case
9541 unsigned constants are subtracted, like in the following
9542 example: ((X*2 + 4) - 8U)/2. */
9543 if (minus_lit0
&& lit0
)
9545 if (TREE_CODE (lit0
) == INTEGER_CST
9546 && TREE_CODE (minus_lit0
) == INTEGER_CST
9547 && tree_int_cst_lt (lit0
, minus_lit0
))
9549 minus_lit0
= associate_trees (loc
, minus_lit0
, lit0
,
9555 lit0
= associate_trees (loc
, lit0
, minus_lit0
,
9561 /* Don't introduce overflows through reassociation. */
9563 && ((lit0
&& TREE_OVERFLOW_P (lit0
))
9564 || (minus_lit0
&& TREE_OVERFLOW_P (minus_lit0
))))
9571 fold_convert_loc (loc
, type
,
9572 associate_trees (loc
, var0
, minus_lit0
,
9573 MINUS_EXPR
, atype
));
9576 con0
= associate_trees (loc
, con0
, minus_lit0
,
9579 fold_convert_loc (loc
, type
,
9580 associate_trees (loc
, var0
, con0
,
9585 con0
= associate_trees (loc
, con0
, lit0
, code
, atype
);
9587 fold_convert_loc (loc
, type
, associate_trees (loc
, var0
, con0
,
9595 /* Pointer simplifications for subtraction, simple reassociations. */
9596 if (POINTER_TYPE_P (TREE_TYPE (arg1
)) && POINTER_TYPE_P (TREE_TYPE (arg0
)))
9598 /* (PTR0 p+ A) - (PTR1 p+ B) -> (PTR0 - PTR1) + (A - B) */
9599 if (TREE_CODE (arg0
) == POINTER_PLUS_EXPR
9600 && TREE_CODE (arg1
) == POINTER_PLUS_EXPR
)
9602 tree arg00
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
9603 tree arg01
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 1));
9604 tree arg10
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 0));
9605 tree arg11
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 1));
9606 return fold_build2_loc (loc
, PLUS_EXPR
, type
,
9607 fold_build2_loc (loc
, MINUS_EXPR
, type
,
9609 fold_build2_loc (loc
, MINUS_EXPR
, type
,
9612 /* (PTR0 p+ A) - PTR1 -> (PTR0 - PTR1) + A, assuming PTR0 - PTR1 simplifies. */
9613 else if (TREE_CODE (arg0
) == POINTER_PLUS_EXPR
)
9615 tree arg00
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
9616 tree arg01
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 1));
9617 tree tmp
= fold_binary_loc (loc
, MINUS_EXPR
, type
, arg00
,
9618 fold_convert_loc (loc
, type
, arg1
));
9620 return fold_build2_loc (loc
, PLUS_EXPR
, type
, tmp
, arg01
);
9622 /* PTR0 - (PTR1 p+ A) -> (PTR0 - PTR1) - A, assuming PTR0 - PTR1
9624 else if (TREE_CODE (arg1
) == POINTER_PLUS_EXPR
)
9626 tree arg10
= fold_convert_loc (loc
, type
,
9627 TREE_OPERAND (arg1
, 0));
9628 tree arg11
= fold_convert_loc (loc
, type
,
9629 TREE_OPERAND (arg1
, 1));
9630 tree tmp
= fold_binary_loc (loc
, MINUS_EXPR
, type
,
9631 fold_convert_loc (loc
, type
, arg0
),
9634 return fold_build2_loc (loc
, MINUS_EXPR
, type
, tmp
, arg11
);
9637 /* (-A) - B -> (-B) - A where B is easily negated and we can swap. */
9638 if (TREE_CODE (arg0
) == NEGATE_EXPR
9639 && negate_expr_p (arg1
)
9640 && reorder_operands_p (arg0
, arg1
))
9641 return fold_build2_loc (loc
, MINUS_EXPR
, type
,
9642 fold_convert_loc (loc
, type
,
9643 negate_expr (arg1
)),
9644 fold_convert_loc (loc
, type
,
9645 TREE_OPERAND (arg0
, 0)));
9647 if (! FLOAT_TYPE_P (type
))
9649 /* Fold (A & ~B) - (A & B) into (A ^ B) - B, where B is
9650 any power of 2 minus 1. */
9651 if (TREE_CODE (arg0
) == BIT_AND_EXPR
9652 && TREE_CODE (arg1
) == BIT_AND_EXPR
9653 && operand_equal_p (TREE_OPERAND (arg0
, 0),
9654 TREE_OPERAND (arg1
, 0), 0))
9656 tree mask0
= TREE_OPERAND (arg0
, 1);
9657 tree mask1
= TREE_OPERAND (arg1
, 1);
9658 tree tem
= fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, mask0
);
9660 if (operand_equal_p (tem
, mask1
, 0))
9662 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, type
,
9663 TREE_OPERAND (arg0
, 0), mask1
);
9664 return fold_build2_loc (loc
, MINUS_EXPR
, type
, tem
, mask1
);
9669 /* Fold __complex__ ( x, 0 ) - __complex__ ( 0, y ) to
9670 __complex__ ( x, -y ). This is not the same for SNaNs or if
9671 signed zeros are involved. */
9672 if (!HONOR_SNANS (element_mode (arg0
))
9673 && !HONOR_SIGNED_ZEROS (element_mode (arg0
))
9674 && COMPLEX_FLOAT_TYPE_P (TREE_TYPE (arg0
)))
9676 tree rtype
= TREE_TYPE (TREE_TYPE (arg0
));
9677 tree arg0r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg0
);
9678 tree arg0i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg0
);
9679 bool arg0rz
= false, arg0iz
= false;
9680 if ((arg0r
&& (arg0rz
= real_zerop (arg0r
)))
9681 || (arg0i
&& (arg0iz
= real_zerop (arg0i
))))
9683 tree arg1r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg1
);
9684 tree arg1i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg1
);
9685 if (arg0rz
&& arg1i
&& real_zerop (arg1i
))
9687 tree rp
= fold_build1_loc (loc
, NEGATE_EXPR
, rtype
,
9689 : build1 (REALPART_EXPR
, rtype
, arg1
));
9690 tree ip
= arg0i
? arg0i
9691 : build1 (IMAGPART_EXPR
, rtype
, arg0
);
9692 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
9694 else if (arg0iz
&& arg1r
&& real_zerop (arg1r
))
9696 tree rp
= arg0r
? arg0r
9697 : build1 (REALPART_EXPR
, rtype
, arg0
);
9698 tree ip
= fold_build1_loc (loc
, NEGATE_EXPR
, rtype
,
9700 : build1 (IMAGPART_EXPR
, rtype
, arg1
));
9701 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
9706 /* A - B -> A + (-B) if B is easily negatable. */
9707 if (negate_expr_p (arg1
)
9708 && !TYPE_OVERFLOW_SANITIZED (type
)
9709 && ((FLOAT_TYPE_P (type
)
9710 /* Avoid this transformation if B is a positive REAL_CST. */
9711 && (TREE_CODE (arg1
) != REAL_CST
9712 || REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg1
))))
9713 || INTEGRAL_TYPE_P (type
)))
9714 return fold_build2_loc (loc
, PLUS_EXPR
, type
,
9715 fold_convert_loc (loc
, type
, arg0
),
9716 fold_convert_loc (loc
, type
,
9717 negate_expr (arg1
)));
9719 /* Fold &a[i] - &a[j] to i-j. */
9720 if (TREE_CODE (arg0
) == ADDR_EXPR
9721 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == ARRAY_REF
9722 && TREE_CODE (arg1
) == ADDR_EXPR
9723 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == ARRAY_REF
)
9725 tree tem
= fold_addr_of_array_ref_difference (loc
, type
,
9726 TREE_OPERAND (arg0
, 0),
9727 TREE_OPERAND (arg1
, 0));
9732 if (FLOAT_TYPE_P (type
)
9733 && flag_unsafe_math_optimizations
9734 && (TREE_CODE (arg0
) == RDIV_EXPR
|| TREE_CODE (arg0
) == MULT_EXPR
)
9735 && (TREE_CODE (arg1
) == RDIV_EXPR
|| TREE_CODE (arg1
) == MULT_EXPR
)
9736 && (tem
= distribute_real_division (loc
, code
, type
, arg0
, arg1
)))
9739 /* Handle (A1 * C1) - (A2 * C2) with A1, A2 or C1, C2 being the same or
9740 one. Make sure the type is not saturating and has the signedness of
9741 the stripped operands, as fold_plusminus_mult_expr will re-associate.
9742 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
9743 if ((TREE_CODE (arg0
) == MULT_EXPR
9744 || TREE_CODE (arg1
) == MULT_EXPR
)
9745 && !TYPE_SATURATING (type
)
9746 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg0
))
9747 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg1
))
9748 && (!FLOAT_TYPE_P (type
) || flag_associative_math
))
9750 tree tem
= fold_plusminus_mult_expr (loc
, code
, type
, arg0
, arg1
);
9758 /* (-A) * (-B) -> A * B */
9759 if (TREE_CODE (arg0
) == NEGATE_EXPR
&& negate_expr_p (arg1
))
9760 return fold_build2_loc (loc
, MULT_EXPR
, type
,
9761 fold_convert_loc (loc
, type
,
9762 TREE_OPERAND (arg0
, 0)),
9763 fold_convert_loc (loc
, type
,
9764 negate_expr (arg1
)));
9765 if (TREE_CODE (arg1
) == NEGATE_EXPR
&& negate_expr_p (arg0
))
9766 return fold_build2_loc (loc
, MULT_EXPR
, type
,
9767 fold_convert_loc (loc
, type
,
9768 negate_expr (arg0
)),
9769 fold_convert_loc (loc
, type
,
9770 TREE_OPERAND (arg1
, 0)));
9772 if (! FLOAT_TYPE_P (type
))
9774 /* Transform x * -C into -x * C if x is easily negatable. */
9775 if (TREE_CODE (arg1
) == INTEGER_CST
9776 && tree_int_cst_sgn (arg1
) == -1
9777 && negate_expr_p (arg0
)
9778 && (tem
= negate_expr (arg1
)) != arg1
9779 && !TREE_OVERFLOW (tem
))
9780 return fold_build2_loc (loc
, MULT_EXPR
, type
,
9781 fold_convert_loc (loc
, type
,
9782 negate_expr (arg0
)),
9785 /* (a * (1 << b)) is (a << b) */
9786 if (TREE_CODE (arg1
) == LSHIFT_EXPR
9787 && integer_onep (TREE_OPERAND (arg1
, 0)))
9788 return fold_build2_loc (loc
, LSHIFT_EXPR
, type
, op0
,
9789 TREE_OPERAND (arg1
, 1));
9790 if (TREE_CODE (arg0
) == LSHIFT_EXPR
9791 && integer_onep (TREE_OPERAND (arg0
, 0)))
9792 return fold_build2_loc (loc
, LSHIFT_EXPR
, type
, op1
,
9793 TREE_OPERAND (arg0
, 1));
9795 /* (A + A) * C -> A * 2 * C */
9796 if (TREE_CODE (arg0
) == PLUS_EXPR
9797 && TREE_CODE (arg1
) == INTEGER_CST
9798 && operand_equal_p (TREE_OPERAND (arg0
, 0),
9799 TREE_OPERAND (arg0
, 1), 0))
9800 return fold_build2_loc (loc
, MULT_EXPR
, type
,
9801 omit_one_operand_loc (loc
, type
,
9802 TREE_OPERAND (arg0
, 0),
9803 TREE_OPERAND (arg0
, 1)),
9804 fold_build2_loc (loc
, MULT_EXPR
, type
,
9805 build_int_cst (type
, 2) , arg1
));
9807 /* ((T) (X /[ex] C)) * C cancels out if the conversion is
9808 sign-changing only. */
9809 if (TREE_CODE (arg1
) == INTEGER_CST
9810 && TREE_CODE (arg0
) == EXACT_DIV_EXPR
9811 && operand_equal_p (arg1
, TREE_OPERAND (arg0
, 1), 0))
9812 return fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
9814 strict_overflow_p
= false;
9815 if (TREE_CODE (arg1
) == INTEGER_CST
9816 && 0 != (tem
= extract_muldiv (op0
, arg1
, code
, NULL_TREE
,
9817 &strict_overflow_p
)))
9819 if (strict_overflow_p
)
9820 fold_overflow_warning (("assuming signed overflow does not "
9821 "occur when simplifying "
9823 WARN_STRICT_OVERFLOW_MISC
);
9824 return fold_convert_loc (loc
, type
, tem
);
9827 /* Optimize z * conj(z) for integer complex numbers. */
9828 if (TREE_CODE (arg0
) == CONJ_EXPR
9829 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
9830 return fold_mult_zconjz (loc
, type
, arg1
);
9831 if (TREE_CODE (arg1
) == CONJ_EXPR
9832 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
9833 return fold_mult_zconjz (loc
, type
, arg0
);
9837 /* Convert (C1/X)*C2 into (C1*C2)/X. This transformation may change
9838 the result for floating point types due to rounding so it is applied
9839 only if -fassociative-math was specify. */
9840 if (flag_associative_math
9841 && TREE_CODE (arg0
) == RDIV_EXPR
9842 && TREE_CODE (arg1
) == REAL_CST
9843 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == REAL_CST
)
9845 tree tem
= const_binop (MULT_EXPR
, TREE_OPERAND (arg0
, 0),
9848 return fold_build2_loc (loc
, RDIV_EXPR
, type
, tem
,
9849 TREE_OPERAND (arg0
, 1));
9852 /* Strip sign operations from X in X*X, i.e. -Y*-Y -> Y*Y. */
9853 if (operand_equal_p (arg0
, arg1
, 0))
9855 tree tem
= fold_strip_sign_ops (arg0
);
9856 if (tem
!= NULL_TREE
)
9858 tem
= fold_convert_loc (loc
, type
, tem
);
9859 return fold_build2_loc (loc
, MULT_EXPR
, type
, tem
, tem
);
9863 /* Fold z * +-I to __complex__ (-+__imag z, +-__real z).
9864 This is not the same for NaNs or if signed zeros are
9866 if (!HONOR_NANS (arg0
)
9867 && !HONOR_SIGNED_ZEROS (element_mode (arg0
))
9868 && COMPLEX_FLOAT_TYPE_P (TREE_TYPE (arg0
))
9869 && TREE_CODE (arg1
) == COMPLEX_CST
9870 && real_zerop (TREE_REALPART (arg1
)))
9872 tree rtype
= TREE_TYPE (TREE_TYPE (arg0
));
9873 if (real_onep (TREE_IMAGPART (arg1
)))
9875 fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
9876 negate_expr (fold_build1_loc (loc
, IMAGPART_EXPR
,
9878 fold_build1_loc (loc
, REALPART_EXPR
, rtype
, arg0
));
9879 else if (real_minus_onep (TREE_IMAGPART (arg1
)))
9881 fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
9882 fold_build1_loc (loc
, IMAGPART_EXPR
, rtype
, arg0
),
9883 negate_expr (fold_build1_loc (loc
, REALPART_EXPR
,
9887 /* Optimize z * conj(z) for floating point complex numbers.
9888 Guarded by flag_unsafe_math_optimizations as non-finite
9889 imaginary components don't produce scalar results. */
9890 if (flag_unsafe_math_optimizations
9891 && TREE_CODE (arg0
) == CONJ_EXPR
9892 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
9893 return fold_mult_zconjz (loc
, type
, arg1
);
9894 if (flag_unsafe_math_optimizations
9895 && TREE_CODE (arg1
) == CONJ_EXPR
9896 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
9897 return fold_mult_zconjz (loc
, type
, arg0
);
9899 if (flag_unsafe_math_optimizations
)
9902 /* Canonicalize x*x as pow(x,2.0), which is expanded as x*x. */
9905 && operand_equal_p (arg0
, arg1
, 0))
9907 tree powfn
= mathfn_built_in (type
, BUILT_IN_POW
);
9911 tree arg
= build_real (type
, dconst2
);
9912 return build_call_expr_loc (loc
, powfn
, 2, arg0
, arg
);
9920 /* Canonicalize (X & C1) | C2. */
9921 if (TREE_CODE (arg0
) == BIT_AND_EXPR
9922 && TREE_CODE (arg1
) == INTEGER_CST
9923 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
9925 int width
= TYPE_PRECISION (type
), w
;
9926 wide_int c1
= TREE_OPERAND (arg0
, 1);
9929 /* If (C1&C2) == C1, then (X&C1)|C2 becomes (X,C2). */
9930 if ((c1
& c2
) == c1
)
9931 return omit_one_operand_loc (loc
, type
, arg1
,
9932 TREE_OPERAND (arg0
, 0));
9934 wide_int msk
= wi::mask (width
, false,
9935 TYPE_PRECISION (TREE_TYPE (arg1
)));
9937 /* If (C1|C2) == ~0 then (X&C1)|C2 becomes X|C2. */
9938 if (msk
.and_not (c1
| c2
) == 0)
9939 return fold_build2_loc (loc
, BIT_IOR_EXPR
, type
,
9940 TREE_OPERAND (arg0
, 0), arg1
);
9942 /* Minimize the number of bits set in C1, i.e. C1 := C1 & ~C2,
9943 unless (C1 & ~C2) | (C2 & C3) for some C3 is a mask of some
9944 mode which allows further optimizations. */
9947 wide_int c3
= c1
.and_not (c2
);
9948 for (w
= BITS_PER_UNIT
; w
<= width
; w
<<= 1)
9950 wide_int mask
= wi::mask (w
, false,
9951 TYPE_PRECISION (type
));
9952 if (((c1
| c2
) & mask
) == mask
&& c1
.and_not (mask
) == 0)
9960 return fold_build2_loc (loc
, BIT_IOR_EXPR
, type
,
9961 fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
9962 TREE_OPERAND (arg0
, 0),
9963 wide_int_to_tree (type
,
9968 /* (X & ~Y) | (~X & Y) is X ^ Y */
9969 if (TREE_CODE (arg0
) == BIT_AND_EXPR
9970 && TREE_CODE (arg1
) == BIT_AND_EXPR
)
9972 tree a0
, a1
, l0
, l1
, n0
, n1
;
9974 a0
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 0));
9975 a1
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 1));
9977 l0
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
9978 l1
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 1));
9980 n0
= fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, l0
);
9981 n1
= fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, l1
);
9983 if ((operand_equal_p (n0
, a0
, 0)
9984 && operand_equal_p (n1
, a1
, 0))
9985 || (operand_equal_p (n0
, a1
, 0)
9986 && operand_equal_p (n1
, a0
, 0)))
9987 return fold_build2_loc (loc
, BIT_XOR_EXPR
, type
, l0
, n1
);
9990 /* See if this can be simplified into a rotate first. If that
9991 is unsuccessful continue in the association code. */
9995 /* Fold (X & 1) ^ 1 as (X & 1) == 0. */
9996 if (TREE_CODE (arg0
) == BIT_AND_EXPR
9997 && INTEGRAL_TYPE_P (type
)
9998 && integer_onep (TREE_OPERAND (arg0
, 1))
9999 && integer_onep (arg1
))
10000 return fold_build2_loc (loc
, EQ_EXPR
, type
, arg0
,
10001 build_zero_cst (TREE_TYPE (arg0
)));
10003 /* See if this can be simplified into a rotate first. If that
10004 is unsuccessful continue in the association code. */
10008 /* ~X & X, (X == 0) & X, and !X & X are always zero. */
10009 if ((TREE_CODE (arg0
) == BIT_NOT_EXPR
10010 || TREE_CODE (arg0
) == TRUTH_NOT_EXPR
10011 || (TREE_CODE (arg0
) == EQ_EXPR
10012 && integer_zerop (TREE_OPERAND (arg0
, 1))))
10013 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
10014 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg1
);
10016 /* X & ~X , X & (X == 0), and X & !X are always zero. */
10017 if ((TREE_CODE (arg1
) == BIT_NOT_EXPR
10018 || TREE_CODE (arg1
) == TRUTH_NOT_EXPR
10019 || (TREE_CODE (arg1
) == EQ_EXPR
10020 && integer_zerop (TREE_OPERAND (arg1
, 1))))
10021 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10022 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
10024 /* Fold (X ^ 1) & 1 as (X & 1) == 0. */
10025 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
10026 && INTEGRAL_TYPE_P (type
)
10027 && integer_onep (TREE_OPERAND (arg0
, 1))
10028 && integer_onep (arg1
))
10031 tem
= TREE_OPERAND (arg0
, 0);
10032 tem2
= fold_convert_loc (loc
, TREE_TYPE (tem
), arg1
);
10033 tem2
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (tem
),
10035 return fold_build2_loc (loc
, EQ_EXPR
, type
, tem2
,
10036 build_zero_cst (TREE_TYPE (tem
)));
10038 /* Fold ~X & 1 as (X & 1) == 0. */
10039 if (TREE_CODE (arg0
) == BIT_NOT_EXPR
10040 && INTEGRAL_TYPE_P (type
)
10041 && integer_onep (arg1
))
10044 tem
= TREE_OPERAND (arg0
, 0);
10045 tem2
= fold_convert_loc (loc
, TREE_TYPE (tem
), arg1
);
10046 tem2
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (tem
),
10048 return fold_build2_loc (loc
, EQ_EXPR
, type
, tem2
,
10049 build_zero_cst (TREE_TYPE (tem
)));
10051 /* Fold !X & 1 as X == 0. */
10052 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
10053 && integer_onep (arg1
))
10055 tem
= TREE_OPERAND (arg0
, 0);
10056 return fold_build2_loc (loc
, EQ_EXPR
, type
, tem
,
10057 build_zero_cst (TREE_TYPE (tem
)));
10060 /* Fold (X ^ Y) & Y as ~X & Y. */
10061 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
10062 && operand_equal_p (TREE_OPERAND (arg0
, 1), arg1
, 0))
10064 tem
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10065 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
10066 fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, tem
),
10067 fold_convert_loc (loc
, type
, arg1
));
10069 /* Fold (X ^ Y) & X as ~Y & X. */
10070 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
10071 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0)
10072 && reorder_operands_p (TREE_OPERAND (arg0
, 1), arg1
))
10074 tem
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 1));
10075 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
10076 fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, tem
),
10077 fold_convert_loc (loc
, type
, arg1
));
10079 /* Fold X & (X ^ Y) as X & ~Y. */
10080 if (TREE_CODE (arg1
) == BIT_XOR_EXPR
10081 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10083 tem
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 1));
10084 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
10085 fold_convert_loc (loc
, type
, arg0
),
10086 fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, tem
));
10088 /* Fold X & (Y ^ X) as ~Y & X. */
10089 if (TREE_CODE (arg1
) == BIT_XOR_EXPR
10090 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 1), 0)
10091 && reorder_operands_p (arg0
, TREE_OPERAND (arg1
, 0)))
10093 tem
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 0));
10094 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
10095 fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, tem
),
10096 fold_convert_loc (loc
, type
, arg0
));
10099 /* Fold (X * Y) & -(1 << CST) to X * Y if Y is a constant
10100 multiple of 1 << CST. */
10101 if (TREE_CODE (arg1
) == INTEGER_CST
)
10103 wide_int cst1
= arg1
;
10104 wide_int ncst1
= -cst1
;
10105 if ((cst1
& ncst1
) == ncst1
10106 && multiple_of_p (type
, arg0
,
10107 wide_int_to_tree (TREE_TYPE (arg1
), ncst1
)))
10108 return fold_convert_loc (loc
, type
, arg0
);
10111 /* Fold (X * CST1) & CST2 to zero if we can, or drop known zero
10113 if (TREE_CODE (arg1
) == INTEGER_CST
10114 && TREE_CODE (arg0
) == MULT_EXPR
10115 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
10117 wide_int warg1
= arg1
;
10118 wide_int masked
= mask_with_tz (type
, warg1
, TREE_OPERAND (arg0
, 1));
10121 return omit_two_operands_loc (loc
, type
, build_zero_cst (type
),
10123 else if (masked
!= warg1
)
10125 /* Avoid the transform if arg1 is a mask of some
10126 mode which allows further optimizations. */
10127 int pop
= wi::popcount (warg1
);
10128 if (!(pop
>= BITS_PER_UNIT
10129 && exact_log2 (pop
) != -1
10130 && wi::mask (pop
, false, warg1
.get_precision ()) == warg1
))
10131 return fold_build2_loc (loc
, code
, type
, op0
,
10132 wide_int_to_tree (type
, masked
));
10136 /* For constants M and N, if M == (1LL << cst) - 1 && (N & M) == M,
10137 ((A & N) + B) & M -> (A + B) & M
10138 Similarly if (N & M) == 0,
10139 ((A | N) + B) & M -> (A + B) & M
10140 and for - instead of + (or unary - instead of +)
10141 and/or ^ instead of |.
10142 If B is constant and (B & M) == 0, fold into A & M. */
10143 if (TREE_CODE (arg1
) == INTEGER_CST
)
10145 wide_int cst1
= arg1
;
10146 if ((~cst1
!= 0) && (cst1
& (cst1
+ 1)) == 0
10147 && INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
10148 && (TREE_CODE (arg0
) == PLUS_EXPR
10149 || TREE_CODE (arg0
) == MINUS_EXPR
10150 || TREE_CODE (arg0
) == NEGATE_EXPR
)
10151 && (TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg0
))
10152 || TREE_CODE (TREE_TYPE (arg0
)) == INTEGER_TYPE
))
10158 /* Now we know that arg0 is (C + D) or (C - D) or
10159 -C and arg1 (M) is == (1LL << cst) - 1.
10160 Store C into PMOP[0] and D into PMOP[1]. */
10161 pmop
[0] = TREE_OPERAND (arg0
, 0);
10163 if (TREE_CODE (arg0
) != NEGATE_EXPR
)
10165 pmop
[1] = TREE_OPERAND (arg0
, 1);
10169 if ((wi::max_value (TREE_TYPE (arg0
)) & cst1
) != cst1
)
10172 for (; which
>= 0; which
--)
10173 switch (TREE_CODE (pmop
[which
]))
10178 if (TREE_CODE (TREE_OPERAND (pmop
[which
], 1))
10181 cst0
= TREE_OPERAND (pmop
[which
], 1);
10183 if (TREE_CODE (pmop
[which
]) == BIT_AND_EXPR
)
10188 else if (cst0
!= 0)
10190 /* If C or D is of the form (A & N) where
10191 (N & M) == M, or of the form (A | N) or
10192 (A ^ N) where (N & M) == 0, replace it with A. */
10193 pmop
[which
] = TREE_OPERAND (pmop
[which
], 0);
10196 /* If C or D is a N where (N & M) == 0, it can be
10197 omitted (assumed 0). */
10198 if ((TREE_CODE (arg0
) == PLUS_EXPR
10199 || (TREE_CODE (arg0
) == MINUS_EXPR
&& which
== 0))
10200 && (cst1
& pmop
[which
]) == 0)
10201 pmop
[which
] = NULL
;
10207 /* Only build anything new if we optimized one or both arguments
10209 if (pmop
[0] != TREE_OPERAND (arg0
, 0)
10210 || (TREE_CODE (arg0
) != NEGATE_EXPR
10211 && pmop
[1] != TREE_OPERAND (arg0
, 1)))
10213 tree utype
= TREE_TYPE (arg0
);
10214 if (! TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg0
)))
10216 /* Perform the operations in a type that has defined
10217 overflow behavior. */
10218 utype
= unsigned_type_for (TREE_TYPE (arg0
));
10219 if (pmop
[0] != NULL
)
10220 pmop
[0] = fold_convert_loc (loc
, utype
, pmop
[0]);
10221 if (pmop
[1] != NULL
)
10222 pmop
[1] = fold_convert_loc (loc
, utype
, pmop
[1]);
10225 if (TREE_CODE (arg0
) == NEGATE_EXPR
)
10226 tem
= fold_build1_loc (loc
, NEGATE_EXPR
, utype
, pmop
[0]);
10227 else if (TREE_CODE (arg0
) == PLUS_EXPR
)
10229 if (pmop
[0] != NULL
&& pmop
[1] != NULL
)
10230 tem
= fold_build2_loc (loc
, PLUS_EXPR
, utype
,
10232 else if (pmop
[0] != NULL
)
10234 else if (pmop
[1] != NULL
)
10237 return build_int_cst (type
, 0);
10239 else if (pmop
[0] == NULL
)
10240 tem
= fold_build1_loc (loc
, NEGATE_EXPR
, utype
, pmop
[1]);
10242 tem
= fold_build2_loc (loc
, MINUS_EXPR
, utype
,
10244 /* TEM is now the new binary +, - or unary - replacement. */
10245 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, utype
, tem
,
10246 fold_convert_loc (loc
, utype
, arg1
));
10247 return fold_convert_loc (loc
, type
, tem
);
10252 /* Simplify ((int)c & 0377) into (int)c, if c is unsigned char. */
10253 if (TREE_CODE (arg1
) == INTEGER_CST
&& TREE_CODE (arg0
) == NOP_EXPR
10254 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (arg0
, 0))))
10256 prec
= element_precision (TREE_TYPE (TREE_OPERAND (arg0
, 0)));
10258 wide_int mask
= wide_int::from (arg1
, prec
, UNSIGNED
);
10261 fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10267 /* Don't touch a floating-point divide by zero unless the mode
10268 of the constant can represent infinity. */
10269 if (TREE_CODE (arg1
) == REAL_CST
10270 && !MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (arg1
)))
10271 && real_zerop (arg1
))
10274 /* (-A) / (-B) -> A / B */
10275 if (TREE_CODE (arg0
) == NEGATE_EXPR
&& negate_expr_p (arg1
))
10276 return fold_build2_loc (loc
, RDIV_EXPR
, type
,
10277 TREE_OPERAND (arg0
, 0),
10278 negate_expr (arg1
));
10279 if (TREE_CODE (arg1
) == NEGATE_EXPR
&& negate_expr_p (arg0
))
10280 return fold_build2_loc (loc
, RDIV_EXPR
, type
,
10281 negate_expr (arg0
),
10282 TREE_OPERAND (arg1
, 0));
10284 /* Convert A/B/C to A/(B*C). */
10285 if (flag_reciprocal_math
10286 && TREE_CODE (arg0
) == RDIV_EXPR
)
10287 return fold_build2_loc (loc
, RDIV_EXPR
, type
, TREE_OPERAND (arg0
, 0),
10288 fold_build2_loc (loc
, MULT_EXPR
, type
,
10289 TREE_OPERAND (arg0
, 1), arg1
));
10291 /* Convert A/(B/C) to (A/B)*C. */
10292 if (flag_reciprocal_math
10293 && TREE_CODE (arg1
) == RDIV_EXPR
)
10294 return fold_build2_loc (loc
, MULT_EXPR
, type
,
10295 fold_build2_loc (loc
, RDIV_EXPR
, type
, arg0
,
10296 TREE_OPERAND (arg1
, 0)),
10297 TREE_OPERAND (arg1
, 1));
10299 /* Convert C1/(X*C2) into (C1/C2)/X. */
10300 if (flag_reciprocal_math
10301 && TREE_CODE (arg1
) == MULT_EXPR
10302 && TREE_CODE (arg0
) == REAL_CST
10303 && TREE_CODE (TREE_OPERAND (arg1
, 1)) == REAL_CST
)
10305 tree tem
= const_binop (RDIV_EXPR
, arg0
,
10306 TREE_OPERAND (arg1
, 1));
10308 return fold_build2_loc (loc
, RDIV_EXPR
, type
, tem
,
10309 TREE_OPERAND (arg1
, 0));
10314 case TRUNC_DIV_EXPR
:
10315 /* Optimize (X & (-A)) / A where A is a power of 2,
10317 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10318 && !TYPE_UNSIGNED (type
) && TREE_CODE (arg1
) == INTEGER_CST
10319 && integer_pow2p (arg1
) && tree_int_cst_sgn (arg1
) > 0)
10321 tree sum
= fold_binary_loc (loc
, PLUS_EXPR
, TREE_TYPE (arg1
),
10322 arg1
, TREE_OPERAND (arg0
, 1));
10323 if (sum
&& integer_zerop (sum
)) {
10324 tree pow2
= build_int_cst (integer_type_node
,
10325 wi::exact_log2 (arg1
));
10326 return fold_build2_loc (loc
, RSHIFT_EXPR
, type
,
10327 TREE_OPERAND (arg0
, 0), pow2
);
10333 case FLOOR_DIV_EXPR
:
10334 /* Simplify A / (B << N) where A and B are positive and B is
10335 a power of 2, to A >> (N + log2(B)). */
10336 strict_overflow_p
= false;
10337 if (TREE_CODE (arg1
) == LSHIFT_EXPR
10338 && (TYPE_UNSIGNED (type
)
10339 || tree_expr_nonnegative_warnv_p (op0
, &strict_overflow_p
)))
10341 tree sval
= TREE_OPERAND (arg1
, 0);
10342 if (integer_pow2p (sval
) && tree_int_cst_sgn (sval
) > 0)
10344 tree sh_cnt
= TREE_OPERAND (arg1
, 1);
10345 tree pow2
= build_int_cst (TREE_TYPE (sh_cnt
),
10346 wi::exact_log2 (sval
));
10348 if (strict_overflow_p
)
10349 fold_overflow_warning (("assuming signed overflow does not "
10350 "occur when simplifying A / (B << N)"),
10351 WARN_STRICT_OVERFLOW_MISC
);
10353 sh_cnt
= fold_build2_loc (loc
, PLUS_EXPR
, TREE_TYPE (sh_cnt
),
10355 return fold_build2_loc (loc
, RSHIFT_EXPR
, type
,
10356 fold_convert_loc (loc
, type
, arg0
), sh_cnt
);
10362 case ROUND_DIV_EXPR
:
10363 case CEIL_DIV_EXPR
:
10364 case EXACT_DIV_EXPR
:
10365 if (integer_zerop (arg1
))
10368 /* Convert -A / -B to A / B when the type is signed and overflow is
10370 if ((!INTEGRAL_TYPE_P (type
) || TYPE_OVERFLOW_UNDEFINED (type
))
10371 && TREE_CODE (arg0
) == NEGATE_EXPR
10372 && negate_expr_p (arg1
))
10374 if (INTEGRAL_TYPE_P (type
))
10375 fold_overflow_warning (("assuming signed overflow does not occur "
10376 "when distributing negation across "
10378 WARN_STRICT_OVERFLOW_MISC
);
10379 return fold_build2_loc (loc
, code
, type
,
10380 fold_convert_loc (loc
, type
,
10381 TREE_OPERAND (arg0
, 0)),
10382 fold_convert_loc (loc
, type
,
10383 negate_expr (arg1
)));
10385 if ((!INTEGRAL_TYPE_P (type
) || TYPE_OVERFLOW_UNDEFINED (type
))
10386 && TREE_CODE (arg1
) == NEGATE_EXPR
10387 && negate_expr_p (arg0
))
10389 if (INTEGRAL_TYPE_P (type
))
10390 fold_overflow_warning (("assuming signed overflow does not occur "
10391 "when distributing negation across "
10393 WARN_STRICT_OVERFLOW_MISC
);
10394 return fold_build2_loc (loc
, code
, type
,
10395 fold_convert_loc (loc
, type
,
10396 negate_expr (arg0
)),
10397 fold_convert_loc (loc
, type
,
10398 TREE_OPERAND (arg1
, 0)));
10401 /* If arg0 is a multiple of arg1, then rewrite to the fastest div
10402 operation, EXACT_DIV_EXPR.
10404 Note that only CEIL_DIV_EXPR and FLOOR_DIV_EXPR are rewritten now.
10405 At one time others generated faster code, it's not clear if they do
10406 after the last round to changes to the DIV code in expmed.c. */
10407 if ((code
== CEIL_DIV_EXPR
|| code
== FLOOR_DIV_EXPR
)
10408 && multiple_of_p (type
, arg0
, arg1
))
10409 return fold_build2_loc (loc
, EXACT_DIV_EXPR
, type
,
10410 fold_convert (type
, arg0
),
10411 fold_convert (type
, arg1
));
10413 strict_overflow_p
= false;
10414 if (TREE_CODE (arg1
) == INTEGER_CST
10415 && 0 != (tem
= extract_muldiv (op0
, arg1
, code
, NULL_TREE
,
10416 &strict_overflow_p
)))
10418 if (strict_overflow_p
)
10419 fold_overflow_warning (("assuming signed overflow does not occur "
10420 "when simplifying division"),
10421 WARN_STRICT_OVERFLOW_MISC
);
10422 return fold_convert_loc (loc
, type
, tem
);
10427 case CEIL_MOD_EXPR
:
10428 case FLOOR_MOD_EXPR
:
10429 case ROUND_MOD_EXPR
:
10430 case TRUNC_MOD_EXPR
:
10431 strict_overflow_p
= false;
10432 if (TREE_CODE (arg1
) == INTEGER_CST
10433 && 0 != (tem
= extract_muldiv (op0
, arg1
, code
, NULL_TREE
,
10434 &strict_overflow_p
)))
10436 if (strict_overflow_p
)
10437 fold_overflow_warning (("assuming signed overflow does not occur "
10438 "when simplifying modulus"),
10439 WARN_STRICT_OVERFLOW_MISC
);
10440 return fold_convert_loc (loc
, type
, tem
);
10449 /* Since negative shift count is not well-defined,
10450 don't try to compute it in the compiler. */
10451 if (TREE_CODE (arg1
) == INTEGER_CST
&& tree_int_cst_sgn (arg1
) < 0)
10454 prec
= element_precision (type
);
10456 /* If we have a rotate of a bit operation with the rotate count and
10457 the second operand of the bit operation both constant,
10458 permute the two operations. */
10459 if (code
== RROTATE_EXPR
&& TREE_CODE (arg1
) == INTEGER_CST
10460 && (TREE_CODE (arg0
) == BIT_AND_EXPR
10461 || TREE_CODE (arg0
) == BIT_IOR_EXPR
10462 || TREE_CODE (arg0
) == BIT_XOR_EXPR
)
10463 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
10464 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
,
10465 fold_build2_loc (loc
, code
, type
,
10466 TREE_OPERAND (arg0
, 0), arg1
),
10467 fold_build2_loc (loc
, code
, type
,
10468 TREE_OPERAND (arg0
, 1), arg1
));
10470 /* Two consecutive rotates adding up to the some integer
10471 multiple of the precision of the type can be ignored. */
10472 if (code
== RROTATE_EXPR
&& TREE_CODE (arg1
) == INTEGER_CST
10473 && TREE_CODE (arg0
) == RROTATE_EXPR
10474 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
10475 && wi::umod_trunc (wi::add (arg1
, TREE_OPERAND (arg0
, 1)),
10477 return TREE_OPERAND (arg0
, 0);
10482 tem
= fold_minmax (loc
, MIN_EXPR
, type
, arg0
, arg1
);
10488 tem
= fold_minmax (loc
, MAX_EXPR
, type
, arg0
, arg1
);
10493 case TRUTH_ANDIF_EXPR
:
10494 /* Note that the operands of this must be ints
10495 and their values must be 0 or 1.
10496 ("true" is a fixed value perhaps depending on the language.) */
10497 /* If first arg is constant zero, return it. */
10498 if (integer_zerop (arg0
))
10499 return fold_convert_loc (loc
, type
, arg0
);
10500 case TRUTH_AND_EXPR
:
10501 /* If either arg is constant true, drop it. */
10502 if (TREE_CODE (arg0
) == INTEGER_CST
&& ! integer_zerop (arg0
))
10503 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg1
));
10504 if (TREE_CODE (arg1
) == INTEGER_CST
&& ! integer_zerop (arg1
)
10505 /* Preserve sequence points. */
10506 && (code
!= TRUTH_ANDIF_EXPR
|| ! TREE_SIDE_EFFECTS (arg0
)))
10507 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
10508 /* If second arg is constant zero, result is zero, but first arg
10509 must be evaluated. */
10510 if (integer_zerop (arg1
))
10511 return omit_one_operand_loc (loc
, type
, arg1
, arg0
);
10512 /* Likewise for first arg, but note that only the TRUTH_AND_EXPR
10513 case will be handled here. */
10514 if (integer_zerop (arg0
))
10515 return omit_one_operand_loc (loc
, type
, arg0
, arg1
);
10517 /* !X && X is always false. */
10518 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
10519 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
10520 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg1
);
10521 /* X && !X is always false. */
10522 if (TREE_CODE (arg1
) == TRUTH_NOT_EXPR
10523 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10524 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
10526 /* A < X && A + 1 > Y ==> A < X && A >= Y. Normally A + 1 > Y
10527 means A >= Y && A != MAX, but in this case we know that
10530 if (!TREE_SIDE_EFFECTS (arg0
)
10531 && !TREE_SIDE_EFFECTS (arg1
))
10533 tem
= fold_to_nonsharp_ineq_using_bound (loc
, arg0
, arg1
);
10534 if (tem
&& !operand_equal_p (tem
, arg0
, 0))
10535 return fold_build2_loc (loc
, code
, type
, tem
, arg1
);
10537 tem
= fold_to_nonsharp_ineq_using_bound (loc
, arg1
, arg0
);
10538 if (tem
&& !operand_equal_p (tem
, arg1
, 0))
10539 return fold_build2_loc (loc
, code
, type
, arg0
, tem
);
10542 if ((tem
= fold_truth_andor (loc
, code
, type
, arg0
, arg1
, op0
, op1
))
10548 case TRUTH_ORIF_EXPR
:
10549 /* Note that the operands of this must be ints
10550 and their values must be 0 or true.
10551 ("true" is a fixed value perhaps depending on the language.) */
10552 /* If first arg is constant true, return it. */
10553 if (TREE_CODE (arg0
) == INTEGER_CST
&& ! integer_zerop (arg0
))
10554 return fold_convert_loc (loc
, type
, arg0
);
10555 case TRUTH_OR_EXPR
:
10556 /* If either arg is constant zero, drop it. */
10557 if (TREE_CODE (arg0
) == INTEGER_CST
&& integer_zerop (arg0
))
10558 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg1
));
10559 if (TREE_CODE (arg1
) == INTEGER_CST
&& integer_zerop (arg1
)
10560 /* Preserve sequence points. */
10561 && (code
!= TRUTH_ORIF_EXPR
|| ! TREE_SIDE_EFFECTS (arg0
)))
10562 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
10563 /* If second arg is constant true, result is true, but we must
10564 evaluate first arg. */
10565 if (TREE_CODE (arg1
) == INTEGER_CST
&& ! integer_zerop (arg1
))
10566 return omit_one_operand_loc (loc
, type
, arg1
, arg0
);
10567 /* Likewise for first arg, but note this only occurs here for
10569 if (TREE_CODE (arg0
) == INTEGER_CST
&& ! integer_zerop (arg0
))
10570 return omit_one_operand_loc (loc
, type
, arg0
, arg1
);
10572 /* !X || X is always true. */
10573 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
10574 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
10575 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg1
);
10576 /* X || !X is always true. */
10577 if (TREE_CODE (arg1
) == TRUTH_NOT_EXPR
10578 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10579 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
10581 /* (X && !Y) || (!X && Y) is X ^ Y */
10582 if (TREE_CODE (arg0
) == TRUTH_AND_EXPR
10583 && TREE_CODE (arg1
) == TRUTH_AND_EXPR
)
10585 tree a0
, a1
, l0
, l1
, n0
, n1
;
10587 a0
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 0));
10588 a1
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 1));
10590 l0
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10591 l1
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 1));
10593 n0
= fold_build1_loc (loc
, TRUTH_NOT_EXPR
, type
, l0
);
10594 n1
= fold_build1_loc (loc
, TRUTH_NOT_EXPR
, type
, l1
);
10596 if ((operand_equal_p (n0
, a0
, 0)
10597 && operand_equal_p (n1
, a1
, 0))
10598 || (operand_equal_p (n0
, a1
, 0)
10599 && operand_equal_p (n1
, a0
, 0)))
10600 return fold_build2_loc (loc
, TRUTH_XOR_EXPR
, type
, l0
, n1
);
10603 if ((tem
= fold_truth_andor (loc
, code
, type
, arg0
, arg1
, op0
, op1
))
10609 case TRUTH_XOR_EXPR
:
10610 /* If the second arg is constant zero, drop it. */
10611 if (integer_zerop (arg1
))
10612 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
10613 /* If the second arg is constant true, this is a logical inversion. */
10614 if (integer_onep (arg1
))
10616 tem
= invert_truthvalue_loc (loc
, arg0
);
10617 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, tem
));
10619 /* Identical arguments cancel to zero. */
10620 if (operand_equal_p (arg0
, arg1
, 0))
10621 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
10623 /* !X ^ X is always true. */
10624 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
10625 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
10626 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg1
);
10628 /* X ^ !X is always true. */
10629 if (TREE_CODE (arg1
) == TRUTH_NOT_EXPR
10630 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10631 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
10640 tem
= fold_comparison (loc
, code
, type
, op0
, op1
);
10641 if (tem
!= NULL_TREE
)
10644 /* bool_var != 1 becomes !bool_var. */
10645 if (TREE_CODE (TREE_TYPE (arg0
)) == BOOLEAN_TYPE
&& integer_onep (arg1
)
10646 && code
== NE_EXPR
)
10647 return fold_convert_loc (loc
, type
,
10648 fold_build1_loc (loc
, TRUTH_NOT_EXPR
,
10649 TREE_TYPE (arg0
), arg0
));
10651 /* bool_var == 0 becomes !bool_var. */
10652 if (TREE_CODE (TREE_TYPE (arg0
)) == BOOLEAN_TYPE
&& integer_zerop (arg1
)
10653 && code
== EQ_EXPR
)
10654 return fold_convert_loc (loc
, type
,
10655 fold_build1_loc (loc
, TRUTH_NOT_EXPR
,
10656 TREE_TYPE (arg0
), arg0
));
10658 /* !exp != 0 becomes !exp */
10659 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
&& integer_zerop (arg1
)
10660 && code
== NE_EXPR
)
10661 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
10663 /* Transform comparisons of the form X +- Y CMP X to Y CMP 0. */
10664 if ((TREE_CODE (arg0
) == PLUS_EXPR
10665 || TREE_CODE (arg0
) == POINTER_PLUS_EXPR
10666 || TREE_CODE (arg0
) == MINUS_EXPR
)
10667 && operand_equal_p (tree_strip_nop_conversions (TREE_OPERAND (arg0
,
10670 && (INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
10671 || POINTER_TYPE_P (TREE_TYPE (arg0
))))
10673 tree val
= TREE_OPERAND (arg0
, 1);
10674 return omit_two_operands_loc (loc
, type
,
10675 fold_build2_loc (loc
, code
, type
,
10677 build_int_cst (TREE_TYPE (val
),
10679 TREE_OPERAND (arg0
, 0), arg1
);
10682 /* Transform comparisons of the form C - X CMP X if C % 2 == 1. */
10683 if (TREE_CODE (arg0
) == MINUS_EXPR
10684 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == INTEGER_CST
10685 && operand_equal_p (tree_strip_nop_conversions (TREE_OPERAND (arg0
,
10688 && wi::extract_uhwi (TREE_OPERAND (arg0
, 0), 0, 1) == 1)
10690 return omit_two_operands_loc (loc
, type
,
10692 ? boolean_true_node
: boolean_false_node
,
10693 TREE_OPERAND (arg0
, 1), arg1
);
10696 /* If this is an EQ or NE comparison with zero and ARG0 is
10697 (1 << foo) & bar, convert it to (bar >> foo) & 1. Both require
10698 two operations, but the latter can be done in one less insn
10699 on machines that have only two-operand insns or on which a
10700 constant cannot be the first operand. */
10701 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10702 && integer_zerop (arg1
))
10704 tree arg00
= TREE_OPERAND (arg0
, 0);
10705 tree arg01
= TREE_OPERAND (arg0
, 1);
10706 if (TREE_CODE (arg00
) == LSHIFT_EXPR
10707 && integer_onep (TREE_OPERAND (arg00
, 0)))
10709 tree tem
= fold_build2_loc (loc
, RSHIFT_EXPR
, TREE_TYPE (arg00
),
10710 arg01
, TREE_OPERAND (arg00
, 1));
10711 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg0
), tem
,
10712 build_int_cst (TREE_TYPE (arg0
), 1));
10713 return fold_build2_loc (loc
, code
, type
,
10714 fold_convert_loc (loc
, TREE_TYPE (arg1
), tem
),
10717 else if (TREE_CODE (arg01
) == LSHIFT_EXPR
10718 && integer_onep (TREE_OPERAND (arg01
, 0)))
10720 tree tem
= fold_build2_loc (loc
, RSHIFT_EXPR
, TREE_TYPE (arg01
),
10721 arg00
, TREE_OPERAND (arg01
, 1));
10722 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg0
), tem
,
10723 build_int_cst (TREE_TYPE (arg0
), 1));
10724 return fold_build2_loc (loc
, code
, type
,
10725 fold_convert_loc (loc
, TREE_TYPE (arg1
), tem
),
10730 /* If this is an NE or EQ comparison of zero against the result of a
10731 signed MOD operation whose second operand is a power of 2, make
10732 the MOD operation unsigned since it is simpler and equivalent. */
10733 if (integer_zerop (arg1
)
10734 && !TYPE_UNSIGNED (TREE_TYPE (arg0
))
10735 && (TREE_CODE (arg0
) == TRUNC_MOD_EXPR
10736 || TREE_CODE (arg0
) == CEIL_MOD_EXPR
10737 || TREE_CODE (arg0
) == FLOOR_MOD_EXPR
10738 || TREE_CODE (arg0
) == ROUND_MOD_EXPR
)
10739 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
10741 tree newtype
= unsigned_type_for (TREE_TYPE (arg0
));
10742 tree newmod
= fold_build2_loc (loc
, TREE_CODE (arg0
), newtype
,
10743 fold_convert_loc (loc
, newtype
,
10744 TREE_OPERAND (arg0
, 0)),
10745 fold_convert_loc (loc
, newtype
,
10746 TREE_OPERAND (arg0
, 1)));
10748 return fold_build2_loc (loc
, code
, type
, newmod
,
10749 fold_convert_loc (loc
, newtype
, arg1
));
10752 /* Fold ((X >> C1) & C2) == 0 and ((X >> C1) & C2) != 0 where
10753 C1 is a valid shift constant, and C2 is a power of two, i.e.
10755 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10756 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == RSHIFT_EXPR
10757 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1))
10759 && integer_pow2p (TREE_OPERAND (arg0
, 1))
10760 && integer_zerop (arg1
))
10762 tree itype
= TREE_TYPE (arg0
);
10763 tree arg001
= TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1);
10764 prec
= TYPE_PRECISION (itype
);
10766 /* Check for a valid shift count. */
10767 if (wi::ltu_p (arg001
, prec
))
10769 tree arg01
= TREE_OPERAND (arg0
, 1);
10770 tree arg000
= TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0);
10771 unsigned HOST_WIDE_INT log2
= tree_log2 (arg01
);
10772 /* If (C2 << C1) doesn't overflow, then ((X >> C1) & C2) != 0
10773 can be rewritten as (X & (C2 << C1)) != 0. */
10774 if ((log2
+ TREE_INT_CST_LOW (arg001
)) < prec
)
10776 tem
= fold_build2_loc (loc
, LSHIFT_EXPR
, itype
, arg01
, arg001
);
10777 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, itype
, arg000
, tem
);
10778 return fold_build2_loc (loc
, code
, type
, tem
,
10779 fold_convert_loc (loc
, itype
, arg1
));
10781 /* Otherwise, for signed (arithmetic) shifts,
10782 ((X >> C1) & C2) != 0 is rewritten as X < 0, and
10783 ((X >> C1) & C2) == 0 is rewritten as X >= 0. */
10784 else if (!TYPE_UNSIGNED (itype
))
10785 return fold_build2_loc (loc
, code
== EQ_EXPR
? GE_EXPR
: LT_EXPR
, type
,
10786 arg000
, build_int_cst (itype
, 0));
10787 /* Otherwise, of unsigned (logical) shifts,
10788 ((X >> C1) & C2) != 0 is rewritten as (X,false), and
10789 ((X >> C1) & C2) == 0 is rewritten as (X,true). */
10791 return omit_one_operand_loc (loc
, type
,
10792 code
== EQ_EXPR
? integer_one_node
10793 : integer_zero_node
,
10798 /* If we have (A & C) == D where D & ~C != 0, convert this into 0.
10799 Similarly for NE_EXPR. */
10800 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10801 && TREE_CODE (arg1
) == INTEGER_CST
10802 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
10804 tree notc
= fold_build1_loc (loc
, BIT_NOT_EXPR
,
10805 TREE_TYPE (TREE_OPERAND (arg0
, 1)),
10806 TREE_OPERAND (arg0
, 1));
10808 = fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg0
),
10809 fold_convert_loc (loc
, TREE_TYPE (arg0
), arg1
),
10811 tree rslt
= code
== EQ_EXPR
? integer_zero_node
: integer_one_node
;
10812 if (integer_nonzerop (dandnotc
))
10813 return omit_one_operand_loc (loc
, type
, rslt
, arg0
);
10816 /* If this is a comparison of a field, we may be able to simplify it. */
10817 if ((TREE_CODE (arg0
) == COMPONENT_REF
10818 || TREE_CODE (arg0
) == BIT_FIELD_REF
)
10819 /* Handle the constant case even without -O
10820 to make sure the warnings are given. */
10821 && (optimize
|| TREE_CODE (arg1
) == INTEGER_CST
))
10823 t1
= optimize_bit_field_compare (loc
, code
, type
, arg0
, arg1
);
10828 /* Optimize comparisons of strlen vs zero to a compare of the
10829 first character of the string vs zero. To wit,
10830 strlen(ptr) == 0 => *ptr == 0
10831 strlen(ptr) != 0 => *ptr != 0
10832 Other cases should reduce to one of these two (or a constant)
10833 due to the return value of strlen being unsigned. */
10834 if (TREE_CODE (arg0
) == CALL_EXPR
10835 && integer_zerop (arg1
))
10837 tree fndecl
= get_callee_fndecl (arg0
);
10840 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
10841 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_STRLEN
10842 && call_expr_nargs (arg0
) == 1
10843 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (arg0
, 0))) == POINTER_TYPE
)
10845 tree iref
= build_fold_indirect_ref_loc (loc
,
10846 CALL_EXPR_ARG (arg0
, 0));
10847 return fold_build2_loc (loc
, code
, type
, iref
,
10848 build_int_cst (TREE_TYPE (iref
), 0));
10852 /* Fold (X >> C) != 0 into X < 0 if C is one less than the width
10853 of X. Similarly fold (X >> C) == 0 into X >= 0. */
10854 if (TREE_CODE (arg0
) == RSHIFT_EXPR
10855 && integer_zerop (arg1
)
10856 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
10858 tree arg00
= TREE_OPERAND (arg0
, 0);
10859 tree arg01
= TREE_OPERAND (arg0
, 1);
10860 tree itype
= TREE_TYPE (arg00
);
10861 if (wi::eq_p (arg01
, element_precision (itype
) - 1))
10863 if (TYPE_UNSIGNED (itype
))
10865 itype
= signed_type_for (itype
);
10866 arg00
= fold_convert_loc (loc
, itype
, arg00
);
10868 return fold_build2_loc (loc
, code
== EQ_EXPR
? GE_EXPR
: LT_EXPR
,
10869 type
, arg00
, build_zero_cst (itype
));
10873 /* Fold (~X & C) == 0 into (X & C) != 0 and (~X & C) != 0 into
10874 (X & C) == 0 when C is a single bit. */
10875 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10876 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_NOT_EXPR
10877 && integer_zerop (arg1
)
10878 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
10880 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg0
),
10881 TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0),
10882 TREE_OPERAND (arg0
, 1));
10883 return fold_build2_loc (loc
, code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
,
10885 fold_convert_loc (loc
, TREE_TYPE (arg0
),
10889 /* Fold ((X & C) ^ C) eq/ne 0 into (X & C) ne/eq 0, when the
10890 constant C is a power of two, i.e. a single bit. */
10891 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
10892 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_AND_EXPR
10893 && integer_zerop (arg1
)
10894 && integer_pow2p (TREE_OPERAND (arg0
, 1))
10895 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1),
10896 TREE_OPERAND (arg0
, 1), OEP_ONLY_CONST
))
10898 tree arg00
= TREE_OPERAND (arg0
, 0);
10899 return fold_build2_loc (loc
, code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
, type
,
10900 arg00
, build_int_cst (TREE_TYPE (arg00
), 0));
10903 /* Likewise, fold ((X ^ C) & C) eq/ne 0 into (X & C) ne/eq 0,
10904 when is C is a power of two, i.e. a single bit. */
10905 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10906 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_XOR_EXPR
10907 && integer_zerop (arg1
)
10908 && integer_pow2p (TREE_OPERAND (arg0
, 1))
10909 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1),
10910 TREE_OPERAND (arg0
, 1), OEP_ONLY_CONST
))
10912 tree arg000
= TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0);
10913 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg000
),
10914 arg000
, TREE_OPERAND (arg0
, 1));
10915 return fold_build2_loc (loc
, code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
, type
,
10916 tem
, build_int_cst (TREE_TYPE (tem
), 0));
10919 if (integer_zerop (arg1
)
10920 && tree_expr_nonzero_p (arg0
))
10922 tree res
= constant_boolean_node (code
==NE_EXPR
, type
);
10923 return omit_one_operand_loc (loc
, type
, res
, arg0
);
10926 /* Fold (X & C) op (Y & C) as (X ^ Y) & C op 0", and symmetries. */
10927 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10928 && TREE_CODE (arg1
) == BIT_AND_EXPR
)
10930 tree arg00
= TREE_OPERAND (arg0
, 0);
10931 tree arg01
= TREE_OPERAND (arg0
, 1);
10932 tree arg10
= TREE_OPERAND (arg1
, 0);
10933 tree arg11
= TREE_OPERAND (arg1
, 1);
10934 tree itype
= TREE_TYPE (arg0
);
10936 if (operand_equal_p (arg01
, arg11
, 0))
10937 return fold_build2_loc (loc
, code
, type
,
10938 fold_build2_loc (loc
, BIT_AND_EXPR
, itype
,
10939 fold_build2_loc (loc
,
10940 BIT_XOR_EXPR
, itype
,
10943 build_zero_cst (itype
));
10945 if (operand_equal_p (arg01
, arg10
, 0))
10946 return fold_build2_loc (loc
, code
, type
,
10947 fold_build2_loc (loc
, BIT_AND_EXPR
, itype
,
10948 fold_build2_loc (loc
,
10949 BIT_XOR_EXPR
, itype
,
10952 build_zero_cst (itype
));
10954 if (operand_equal_p (arg00
, arg11
, 0))
10955 return fold_build2_loc (loc
, code
, type
,
10956 fold_build2_loc (loc
, BIT_AND_EXPR
, itype
,
10957 fold_build2_loc (loc
,
10958 BIT_XOR_EXPR
, itype
,
10961 build_zero_cst (itype
));
10963 if (operand_equal_p (arg00
, arg10
, 0))
10964 return fold_build2_loc (loc
, code
, type
,
10965 fold_build2_loc (loc
, BIT_AND_EXPR
, itype
,
10966 fold_build2_loc (loc
,
10967 BIT_XOR_EXPR
, itype
,
10970 build_zero_cst (itype
));
10973 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
10974 && TREE_CODE (arg1
) == BIT_XOR_EXPR
)
10976 tree arg00
= TREE_OPERAND (arg0
, 0);
10977 tree arg01
= TREE_OPERAND (arg0
, 1);
10978 tree arg10
= TREE_OPERAND (arg1
, 0);
10979 tree arg11
= TREE_OPERAND (arg1
, 1);
10980 tree itype
= TREE_TYPE (arg0
);
10982 /* Optimize (X ^ Z) op (Y ^ Z) as X op Y, and symmetries.
10983 operand_equal_p guarantees no side-effects so we don't need
10984 to use omit_one_operand on Z. */
10985 if (operand_equal_p (arg01
, arg11
, 0))
10986 return fold_build2_loc (loc
, code
, type
, arg00
,
10987 fold_convert_loc (loc
, TREE_TYPE (arg00
),
10989 if (operand_equal_p (arg01
, arg10
, 0))
10990 return fold_build2_loc (loc
, code
, type
, arg00
,
10991 fold_convert_loc (loc
, TREE_TYPE (arg00
),
10993 if (operand_equal_p (arg00
, arg11
, 0))
10994 return fold_build2_loc (loc
, code
, type
, arg01
,
10995 fold_convert_loc (loc
, TREE_TYPE (arg01
),
10997 if (operand_equal_p (arg00
, arg10
, 0))
10998 return fold_build2_loc (loc
, code
, type
, arg01
,
10999 fold_convert_loc (loc
, TREE_TYPE (arg01
),
11002 /* Optimize (X ^ C1) op (Y ^ C2) as (X ^ (C1 ^ C2)) op Y. */
11003 if (TREE_CODE (arg01
) == INTEGER_CST
11004 && TREE_CODE (arg11
) == INTEGER_CST
)
11006 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg01
,
11007 fold_convert_loc (loc
, itype
, arg11
));
11008 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg00
, tem
);
11009 return fold_build2_loc (loc
, code
, type
, tem
,
11010 fold_convert_loc (loc
, itype
, arg10
));
11014 /* Attempt to simplify equality/inequality comparisons of complex
11015 values. Only lower the comparison if the result is known or
11016 can be simplified to a single scalar comparison. */
11017 if ((TREE_CODE (arg0
) == COMPLEX_EXPR
11018 || TREE_CODE (arg0
) == COMPLEX_CST
)
11019 && (TREE_CODE (arg1
) == COMPLEX_EXPR
11020 || TREE_CODE (arg1
) == COMPLEX_CST
))
11022 tree real0
, imag0
, real1
, imag1
;
11025 if (TREE_CODE (arg0
) == COMPLEX_EXPR
)
11027 real0
= TREE_OPERAND (arg0
, 0);
11028 imag0
= TREE_OPERAND (arg0
, 1);
11032 real0
= TREE_REALPART (arg0
);
11033 imag0
= TREE_IMAGPART (arg0
);
11036 if (TREE_CODE (arg1
) == COMPLEX_EXPR
)
11038 real1
= TREE_OPERAND (arg1
, 0);
11039 imag1
= TREE_OPERAND (arg1
, 1);
11043 real1
= TREE_REALPART (arg1
);
11044 imag1
= TREE_IMAGPART (arg1
);
11047 rcond
= fold_binary_loc (loc
, code
, type
, real0
, real1
);
11048 if (rcond
&& TREE_CODE (rcond
) == INTEGER_CST
)
11050 if (integer_zerop (rcond
))
11052 if (code
== EQ_EXPR
)
11053 return omit_two_operands_loc (loc
, type
, boolean_false_node
,
11055 return fold_build2_loc (loc
, NE_EXPR
, type
, imag0
, imag1
);
11059 if (code
== NE_EXPR
)
11060 return omit_two_operands_loc (loc
, type
, boolean_true_node
,
11062 return fold_build2_loc (loc
, EQ_EXPR
, type
, imag0
, imag1
);
11066 icond
= fold_binary_loc (loc
, code
, type
, imag0
, imag1
);
11067 if (icond
&& TREE_CODE (icond
) == INTEGER_CST
)
11069 if (integer_zerop (icond
))
11071 if (code
== EQ_EXPR
)
11072 return omit_two_operands_loc (loc
, type
, boolean_false_node
,
11074 return fold_build2_loc (loc
, NE_EXPR
, type
, real0
, real1
);
11078 if (code
== NE_EXPR
)
11079 return omit_two_operands_loc (loc
, type
, boolean_true_node
,
11081 return fold_build2_loc (loc
, EQ_EXPR
, type
, real0
, real1
);
11092 tem
= fold_comparison (loc
, code
, type
, op0
, op1
);
11093 if (tem
!= NULL_TREE
)
11096 /* Transform comparisons of the form X +- C CMP X. */
11097 if ((TREE_CODE (arg0
) == PLUS_EXPR
|| TREE_CODE (arg0
) == MINUS_EXPR
)
11098 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0)
11099 && ((TREE_CODE (TREE_OPERAND (arg0
, 1)) == REAL_CST
11100 && !HONOR_SNANS (arg0
))
11101 || (TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
11102 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))))
11104 tree arg01
= TREE_OPERAND (arg0
, 1);
11105 enum tree_code code0
= TREE_CODE (arg0
);
11108 if (TREE_CODE (arg01
) == REAL_CST
)
11109 is_positive
= REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg01
)) ? -1 : 1;
11111 is_positive
= tree_int_cst_sgn (arg01
);
11113 /* (X - c) > X becomes false. */
11114 if (code
== GT_EXPR
11115 && ((code0
== MINUS_EXPR
&& is_positive
>= 0)
11116 || (code0
== PLUS_EXPR
&& is_positive
<= 0)))
11118 if (TREE_CODE (arg01
) == INTEGER_CST
11119 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
11120 fold_overflow_warning (("assuming signed overflow does not "
11121 "occur when assuming that (X - c) > X "
11122 "is always false"),
11123 WARN_STRICT_OVERFLOW_ALL
);
11124 return constant_boolean_node (0, type
);
11127 /* Likewise (X + c) < X becomes false. */
11128 if (code
== LT_EXPR
11129 && ((code0
== PLUS_EXPR
&& is_positive
>= 0)
11130 || (code0
== MINUS_EXPR
&& is_positive
<= 0)))
11132 if (TREE_CODE (arg01
) == INTEGER_CST
11133 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
11134 fold_overflow_warning (("assuming signed overflow does not "
11135 "occur when assuming that "
11136 "(X + c) < X is always false"),
11137 WARN_STRICT_OVERFLOW_ALL
);
11138 return constant_boolean_node (0, type
);
11141 /* Convert (X - c) <= X to true. */
11142 if (!HONOR_NANS (arg1
)
11144 && ((code0
== MINUS_EXPR
&& is_positive
>= 0)
11145 || (code0
== PLUS_EXPR
&& is_positive
<= 0)))
11147 if (TREE_CODE (arg01
) == INTEGER_CST
11148 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
11149 fold_overflow_warning (("assuming signed overflow does not "
11150 "occur when assuming that "
11151 "(X - c) <= X is always true"),
11152 WARN_STRICT_OVERFLOW_ALL
);
11153 return constant_boolean_node (1, type
);
11156 /* Convert (X + c) >= X to true. */
11157 if (!HONOR_NANS (arg1
)
11159 && ((code0
== PLUS_EXPR
&& is_positive
>= 0)
11160 || (code0
== MINUS_EXPR
&& is_positive
<= 0)))
11162 if (TREE_CODE (arg01
) == INTEGER_CST
11163 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
11164 fold_overflow_warning (("assuming signed overflow does not "
11165 "occur when assuming that "
11166 "(X + c) >= X is always true"),
11167 WARN_STRICT_OVERFLOW_ALL
);
11168 return constant_boolean_node (1, type
);
11171 if (TREE_CODE (arg01
) == INTEGER_CST
)
11173 /* Convert X + c > X and X - c < X to true for integers. */
11174 if (code
== GT_EXPR
11175 && ((code0
== PLUS_EXPR
&& is_positive
> 0)
11176 || (code0
== MINUS_EXPR
&& is_positive
< 0)))
11178 if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
11179 fold_overflow_warning (("assuming signed overflow does "
11180 "not occur when assuming that "
11181 "(X + c) > X is always true"),
11182 WARN_STRICT_OVERFLOW_ALL
);
11183 return constant_boolean_node (1, type
);
11186 if (code
== LT_EXPR
11187 && ((code0
== MINUS_EXPR
&& is_positive
> 0)
11188 || (code0
== PLUS_EXPR
&& is_positive
< 0)))
11190 if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
11191 fold_overflow_warning (("assuming signed overflow does "
11192 "not occur when assuming that "
11193 "(X - c) < X is always true"),
11194 WARN_STRICT_OVERFLOW_ALL
);
11195 return constant_boolean_node (1, type
);
11198 /* Convert X + c <= X and X - c >= X to false for integers. */
11199 if (code
== LE_EXPR
11200 && ((code0
== PLUS_EXPR
&& is_positive
> 0)
11201 || (code0
== MINUS_EXPR
&& is_positive
< 0)))
11203 if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
11204 fold_overflow_warning (("assuming signed overflow does "
11205 "not occur when assuming that "
11206 "(X + c) <= X is always false"),
11207 WARN_STRICT_OVERFLOW_ALL
);
11208 return constant_boolean_node (0, type
);
11211 if (code
== GE_EXPR
11212 && ((code0
== MINUS_EXPR
&& is_positive
> 0)
11213 || (code0
== PLUS_EXPR
&& is_positive
< 0)))
11215 if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
11216 fold_overflow_warning (("assuming signed overflow does "
11217 "not occur when assuming that "
11218 "(X - c) >= X is always false"),
11219 WARN_STRICT_OVERFLOW_ALL
);
11220 return constant_boolean_node (0, type
);
11225 /* If we are comparing an ABS_EXPR with a constant, we can
11226 convert all the cases into explicit comparisons, but they may
11227 well not be faster than doing the ABS and one comparison.
11228 But ABS (X) <= C is a range comparison, which becomes a subtraction
11229 and a comparison, and is probably faster. */
11230 if (code
== LE_EXPR
11231 && TREE_CODE (arg1
) == INTEGER_CST
11232 && TREE_CODE (arg0
) == ABS_EXPR
11233 && ! TREE_SIDE_EFFECTS (arg0
)
11234 && (0 != (tem
= negate_expr (arg1
)))
11235 && TREE_CODE (tem
) == INTEGER_CST
11236 && !TREE_OVERFLOW (tem
))
11237 return fold_build2_loc (loc
, TRUTH_ANDIF_EXPR
, type
,
11238 build2 (GE_EXPR
, type
,
11239 TREE_OPERAND (arg0
, 0), tem
),
11240 build2 (LE_EXPR
, type
,
11241 TREE_OPERAND (arg0
, 0), arg1
));
11243 /* Convert ABS_EXPR<x> >= 0 to true. */
11244 strict_overflow_p
= false;
11245 if (code
== GE_EXPR
11246 && (integer_zerop (arg1
)
11247 || (! HONOR_NANS (arg0
)
11248 && real_zerop (arg1
)))
11249 && tree_expr_nonnegative_warnv_p (arg0
, &strict_overflow_p
))
11251 if (strict_overflow_p
)
11252 fold_overflow_warning (("assuming signed overflow does not occur "
11253 "when simplifying comparison of "
11254 "absolute value and zero"),
11255 WARN_STRICT_OVERFLOW_CONDITIONAL
);
11256 return omit_one_operand_loc (loc
, type
,
11257 constant_boolean_node (true, type
),
11261 /* Convert ABS_EXPR<x> < 0 to false. */
11262 strict_overflow_p
= false;
11263 if (code
== LT_EXPR
11264 && (integer_zerop (arg1
) || real_zerop (arg1
))
11265 && tree_expr_nonnegative_warnv_p (arg0
, &strict_overflow_p
))
11267 if (strict_overflow_p
)
11268 fold_overflow_warning (("assuming signed overflow does not occur "
11269 "when simplifying comparison of "
11270 "absolute value and zero"),
11271 WARN_STRICT_OVERFLOW_CONDITIONAL
);
11272 return omit_one_operand_loc (loc
, type
,
11273 constant_boolean_node (false, type
),
11277 /* If X is unsigned, convert X < (1 << Y) into X >> Y == 0
11278 and similarly for >= into !=. */
11279 if ((code
== LT_EXPR
|| code
== GE_EXPR
)
11280 && TYPE_UNSIGNED (TREE_TYPE (arg0
))
11281 && TREE_CODE (arg1
) == LSHIFT_EXPR
11282 && integer_onep (TREE_OPERAND (arg1
, 0)))
11283 return build2_loc (loc
, code
== LT_EXPR
? EQ_EXPR
: NE_EXPR
, type
,
11284 build2 (RSHIFT_EXPR
, TREE_TYPE (arg0
), arg0
,
11285 TREE_OPERAND (arg1
, 1)),
11286 build_zero_cst (TREE_TYPE (arg0
)));
11288 /* Similarly for X < (cast) (1 << Y). But cast can't be narrowing,
11289 otherwise Y might be >= # of bits in X's type and thus e.g.
11290 (unsigned char) (1 << Y) for Y 15 might be 0.
11291 If the cast is widening, then 1 << Y should have unsigned type,
11292 otherwise if Y is number of bits in the signed shift type minus 1,
11293 we can't optimize this. E.g. (unsigned long long) (1 << Y) for Y
11294 31 might be 0xffffffff80000000. */
11295 if ((code
== LT_EXPR
|| code
== GE_EXPR
)
11296 && TYPE_UNSIGNED (TREE_TYPE (arg0
))
11297 && CONVERT_EXPR_P (arg1
)
11298 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == LSHIFT_EXPR
11299 && (element_precision (TREE_TYPE (arg1
))
11300 >= element_precision (TREE_TYPE (TREE_OPERAND (arg1
, 0))))
11301 && (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
11302 || (element_precision (TREE_TYPE (arg1
))
11303 == element_precision (TREE_TYPE (TREE_OPERAND (arg1
, 0)))))
11304 && integer_onep (TREE_OPERAND (TREE_OPERAND (arg1
, 0), 0)))
11306 tem
= build2 (RSHIFT_EXPR
, TREE_TYPE (arg0
), arg0
,
11307 TREE_OPERAND (TREE_OPERAND (arg1
, 0), 1));
11308 return build2_loc (loc
, code
== LT_EXPR
? EQ_EXPR
: NE_EXPR
, type
,
11309 fold_convert_loc (loc
, TREE_TYPE (arg0
), tem
),
11310 build_zero_cst (TREE_TYPE (arg0
)));
11315 case UNORDERED_EXPR
:
11323 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
11325 tree targ0
= strip_float_extensions (arg0
);
11326 tree targ1
= strip_float_extensions (arg1
);
11327 tree newtype
= TREE_TYPE (targ0
);
11329 if (TYPE_PRECISION (TREE_TYPE (targ1
)) > TYPE_PRECISION (newtype
))
11330 newtype
= TREE_TYPE (targ1
);
11332 if (TYPE_PRECISION (newtype
) < TYPE_PRECISION (TREE_TYPE (arg0
)))
11333 return fold_build2_loc (loc
, code
, type
,
11334 fold_convert_loc (loc
, newtype
, targ0
),
11335 fold_convert_loc (loc
, newtype
, targ1
));
11340 case COMPOUND_EXPR
:
11341 /* When pedantic, a compound expression can be neither an lvalue
11342 nor an integer constant expression. */
11343 if (TREE_SIDE_EFFECTS (arg0
) || TREE_CONSTANT (arg1
))
11345 /* Don't let (0, 0) be null pointer constant. */
11346 tem
= integer_zerop (arg1
) ? build1 (NOP_EXPR
, type
, arg1
)
11347 : fold_convert_loc (loc
, type
, arg1
);
11348 return pedantic_non_lvalue_loc (loc
, tem
);
11351 /* An ASSERT_EXPR should never be passed to fold_binary. */
11352 gcc_unreachable ();
11356 } /* switch (code) */
11359 /* Callback for walk_tree, looking for LABEL_EXPR. Return *TP if it is
11360 a LABEL_EXPR; otherwise return NULL_TREE. Do not check the subtrees
11364 contains_label_1 (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
11366 switch (TREE_CODE (*tp
))
11372 *walk_subtrees
= 0;
11374 /* ... fall through ... */
11381 /* Return whether the sub-tree ST contains a label which is accessible from
11382 outside the sub-tree. */
11385 contains_label_p (tree st
)
11388 (walk_tree_without_duplicates (&st
, contains_label_1
, NULL
) != NULL_TREE
);
11391 /* Fold a ternary expression of code CODE and type TYPE with operands
11392 OP0, OP1, and OP2. Return the folded expression if folding is
11393 successful. Otherwise, return NULL_TREE. */
11396 fold_ternary_loc (location_t loc
, enum tree_code code
, tree type
,
11397 tree op0
, tree op1
, tree op2
)
11400 tree arg0
= NULL_TREE
, arg1
= NULL_TREE
, arg2
= NULL_TREE
;
11401 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
11403 gcc_assert (IS_EXPR_CODE_CLASS (kind
)
11404 && TREE_CODE_LENGTH (code
) == 3);
11406 /* If this is a commutative operation, and OP0 is a constant, move it
11407 to OP1 to reduce the number of tests below. */
11408 if (commutative_ternary_tree_code (code
)
11409 && tree_swap_operands_p (op0
, op1
, true))
11410 return fold_build3_loc (loc
, code
, type
, op1
, op0
, op2
);
11412 tem
= generic_simplify (loc
, code
, type
, op0
, op1
, op2
);
11416 /* Strip any conversions that don't change the mode. This is safe
11417 for every expression, except for a comparison expression because
11418 its signedness is derived from its operands. So, in the latter
11419 case, only strip conversions that don't change the signedness.
11421 Note that this is done as an internal manipulation within the
11422 constant folder, in order to find the simplest representation of
11423 the arguments so that their form can be studied. In any cases,
11424 the appropriate type conversions should be put back in the tree
11425 that will get out of the constant folder. */
11446 case COMPONENT_REF
:
11447 if (TREE_CODE (arg0
) == CONSTRUCTOR
11448 && ! type_contains_placeholder_p (TREE_TYPE (arg0
)))
11450 unsigned HOST_WIDE_INT idx
;
11452 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg0
), idx
, field
, value
)
11459 case VEC_COND_EXPR
:
11460 /* Pedantic ANSI C says that a conditional expression is never an lvalue,
11461 so all simple results must be passed through pedantic_non_lvalue. */
11462 if (TREE_CODE (arg0
) == INTEGER_CST
)
11464 tree unused_op
= integer_zerop (arg0
) ? op1
: op2
;
11465 tem
= integer_zerop (arg0
) ? op2
: op1
;
11466 /* Only optimize constant conditions when the selected branch
11467 has the same type as the COND_EXPR. This avoids optimizing
11468 away "c ? x : throw", where the throw has a void type.
11469 Avoid throwing away that operand which contains label. */
11470 if ((!TREE_SIDE_EFFECTS (unused_op
)
11471 || !contains_label_p (unused_op
))
11472 && (! VOID_TYPE_P (TREE_TYPE (tem
))
11473 || VOID_TYPE_P (type
)))
11474 return pedantic_non_lvalue_loc (loc
, tem
);
11477 else if (TREE_CODE (arg0
) == VECTOR_CST
)
11479 if ((TREE_CODE (arg1
) == VECTOR_CST
11480 || TREE_CODE (arg1
) == CONSTRUCTOR
)
11481 && (TREE_CODE (arg2
) == VECTOR_CST
11482 || TREE_CODE (arg2
) == CONSTRUCTOR
))
11484 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (type
), i
;
11485 unsigned char *sel
= XALLOCAVEC (unsigned char, nelts
);
11486 gcc_assert (nelts
== VECTOR_CST_NELTS (arg0
));
11487 for (i
= 0; i
< nelts
; i
++)
11489 tree val
= VECTOR_CST_ELT (arg0
, i
);
11490 if (integer_all_onesp (val
))
11492 else if (integer_zerop (val
))
11493 sel
[i
] = nelts
+ i
;
11494 else /* Currently unreachable. */
11497 tree t
= fold_vec_perm (type
, arg1
, arg2
, sel
);
11498 if (t
!= NULL_TREE
)
11503 /* If we have A op B ? A : C, we may be able to convert this to a
11504 simpler expression, depending on the operation and the values
11505 of B and C. Signed zeros prevent all of these transformations,
11506 for reasons given above each one.
11508 Also try swapping the arguments and inverting the conditional. */
11509 if (COMPARISON_CLASS_P (arg0
)
11510 && operand_equal_for_comparison_p (TREE_OPERAND (arg0
, 0),
11511 arg1
, TREE_OPERAND (arg0
, 1))
11512 && !HONOR_SIGNED_ZEROS (element_mode (arg1
)))
11514 tem
= fold_cond_expr_with_comparison (loc
, type
, arg0
, op1
, op2
);
11519 if (COMPARISON_CLASS_P (arg0
)
11520 && operand_equal_for_comparison_p (TREE_OPERAND (arg0
, 0),
11522 TREE_OPERAND (arg0
, 1))
11523 && !HONOR_SIGNED_ZEROS (element_mode (op2
)))
11525 location_t loc0
= expr_location_or (arg0
, loc
);
11526 tem
= fold_invert_truthvalue (loc0
, arg0
);
11527 if (tem
&& COMPARISON_CLASS_P (tem
))
11529 tem
= fold_cond_expr_with_comparison (loc
, type
, tem
, op2
, op1
);
11535 /* If the second operand is simpler than the third, swap them
11536 since that produces better jump optimization results. */
11537 if (truth_value_p (TREE_CODE (arg0
))
11538 && tree_swap_operands_p (op1
, op2
, false))
11540 location_t loc0
= expr_location_or (arg0
, loc
);
11541 /* See if this can be inverted. If it can't, possibly because
11542 it was a floating-point inequality comparison, don't do
11544 tem
= fold_invert_truthvalue (loc0
, arg0
);
11546 return fold_build3_loc (loc
, code
, type
, tem
, op2
, op1
);
11549 /* Convert A ? 1 : 0 to simply A. */
11550 if ((code
== VEC_COND_EXPR
? integer_all_onesp (op1
)
11551 : (integer_onep (op1
)
11552 && !VECTOR_TYPE_P (type
)))
11553 && integer_zerop (op2
)
11554 /* If we try to convert OP0 to our type, the
11555 call to fold will try to move the conversion inside
11556 a COND, which will recurse. In that case, the COND_EXPR
11557 is probably the best choice, so leave it alone. */
11558 && type
== TREE_TYPE (arg0
))
11559 return pedantic_non_lvalue_loc (loc
, arg0
);
11561 /* Convert A ? 0 : 1 to !A. This prefers the use of NOT_EXPR
11562 over COND_EXPR in cases such as floating point comparisons. */
11563 if (integer_zerop (op1
)
11564 && (code
== VEC_COND_EXPR
? integer_all_onesp (op2
)
11565 : (integer_onep (op2
)
11566 && !VECTOR_TYPE_P (type
)))
11567 && truth_value_p (TREE_CODE (arg0
)))
11568 return pedantic_non_lvalue_loc (loc
,
11569 fold_convert_loc (loc
, type
,
11570 invert_truthvalue_loc (loc
,
11573 /* A < 0 ? <sign bit of A> : 0 is simply (A & <sign bit of A>). */
11574 if (TREE_CODE (arg0
) == LT_EXPR
11575 && integer_zerop (TREE_OPERAND (arg0
, 1))
11576 && integer_zerop (op2
)
11577 && (tem
= sign_bit_p (TREE_OPERAND (arg0
, 0), arg1
)))
11579 /* sign_bit_p looks through both zero and sign extensions,
11580 but for this optimization only sign extensions are
11582 tree tem2
= TREE_OPERAND (arg0
, 0);
11583 while (tem
!= tem2
)
11585 if (TREE_CODE (tem2
) != NOP_EXPR
11586 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (tem2
, 0))))
11591 tem2
= TREE_OPERAND (tem2
, 0);
11593 /* sign_bit_p only checks ARG1 bits within A's precision.
11594 If <sign bit of A> has wider type than A, bits outside
11595 of A's precision in <sign bit of A> need to be checked.
11596 If they are all 0, this optimization needs to be done
11597 in unsigned A's type, if they are all 1 in signed A's type,
11598 otherwise this can't be done. */
11600 && TYPE_PRECISION (TREE_TYPE (tem
))
11601 < TYPE_PRECISION (TREE_TYPE (arg1
))
11602 && TYPE_PRECISION (TREE_TYPE (tem
))
11603 < TYPE_PRECISION (type
))
11605 int inner_width
, outer_width
;
11608 inner_width
= TYPE_PRECISION (TREE_TYPE (tem
));
11609 outer_width
= TYPE_PRECISION (TREE_TYPE (arg1
));
11610 if (outer_width
> TYPE_PRECISION (type
))
11611 outer_width
= TYPE_PRECISION (type
);
11613 wide_int mask
= wi::shifted_mask
11614 (inner_width
, outer_width
- inner_width
, false,
11615 TYPE_PRECISION (TREE_TYPE (arg1
)));
11617 wide_int common
= mask
& arg1
;
11618 if (common
== mask
)
11620 tem_type
= signed_type_for (TREE_TYPE (tem
));
11621 tem
= fold_convert_loc (loc
, tem_type
, tem
);
11623 else if (common
== 0)
11625 tem_type
= unsigned_type_for (TREE_TYPE (tem
));
11626 tem
= fold_convert_loc (loc
, tem_type
, tem
);
11634 fold_convert_loc (loc
, type
,
11635 fold_build2_loc (loc
, BIT_AND_EXPR
,
11636 TREE_TYPE (tem
), tem
,
11637 fold_convert_loc (loc
,
11642 /* (A >> N) & 1 ? (1 << N) : 0 is simply A & (1 << N). A & 1 was
11643 already handled above. */
11644 if (TREE_CODE (arg0
) == BIT_AND_EXPR
11645 && integer_onep (TREE_OPERAND (arg0
, 1))
11646 && integer_zerop (op2
)
11647 && integer_pow2p (arg1
))
11649 tree tem
= TREE_OPERAND (arg0
, 0);
11651 if (TREE_CODE (tem
) == RSHIFT_EXPR
11652 && tree_fits_uhwi_p (TREE_OPERAND (tem
, 1))
11653 && (unsigned HOST_WIDE_INT
) tree_log2 (arg1
) ==
11654 tree_to_uhwi (TREE_OPERAND (tem
, 1)))
11655 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
11656 TREE_OPERAND (tem
, 0), arg1
);
11659 /* A & N ? N : 0 is simply A & N if N is a power of two. This
11660 is probably obsolete because the first operand should be a
11661 truth value (that's why we have the two cases above), but let's
11662 leave it in until we can confirm this for all front-ends. */
11663 if (integer_zerop (op2
)
11664 && TREE_CODE (arg0
) == NE_EXPR
11665 && integer_zerop (TREE_OPERAND (arg0
, 1))
11666 && integer_pow2p (arg1
)
11667 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_AND_EXPR
11668 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1),
11669 arg1
, OEP_ONLY_CONST
))
11670 return pedantic_non_lvalue_loc (loc
,
11671 fold_convert_loc (loc
, type
,
11672 TREE_OPERAND (arg0
, 0)));
11674 /* Disable the transformations below for vectors, since
11675 fold_binary_op_with_conditional_arg may undo them immediately,
11676 yielding an infinite loop. */
11677 if (code
== VEC_COND_EXPR
)
11680 /* Convert A ? B : 0 into A && B if A and B are truth values. */
11681 if (integer_zerop (op2
)
11682 && truth_value_p (TREE_CODE (arg0
))
11683 && truth_value_p (TREE_CODE (arg1
))
11684 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
11685 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
? BIT_AND_EXPR
11686 : TRUTH_ANDIF_EXPR
,
11687 type
, fold_convert_loc (loc
, type
, arg0
), arg1
);
11689 /* Convert A ? B : 1 into !A || B if A and B are truth values. */
11690 if (code
== VEC_COND_EXPR
? integer_all_onesp (op2
) : integer_onep (op2
)
11691 && truth_value_p (TREE_CODE (arg0
))
11692 && truth_value_p (TREE_CODE (arg1
))
11693 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
11695 location_t loc0
= expr_location_or (arg0
, loc
);
11696 /* Only perform transformation if ARG0 is easily inverted. */
11697 tem
= fold_invert_truthvalue (loc0
, arg0
);
11699 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
11702 type
, fold_convert_loc (loc
, type
, tem
),
11706 /* Convert A ? 0 : B into !A && B if A and B are truth values. */
11707 if (integer_zerop (arg1
)
11708 && truth_value_p (TREE_CODE (arg0
))
11709 && truth_value_p (TREE_CODE (op2
))
11710 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
11712 location_t loc0
= expr_location_or (arg0
, loc
);
11713 /* Only perform transformation if ARG0 is easily inverted. */
11714 tem
= fold_invert_truthvalue (loc0
, arg0
);
11716 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
11717 ? BIT_AND_EXPR
: TRUTH_ANDIF_EXPR
,
11718 type
, fold_convert_loc (loc
, type
, tem
),
11722 /* Convert A ? 1 : B into A || B if A and B are truth values. */
11723 if (code
== VEC_COND_EXPR
? integer_all_onesp (arg1
) : integer_onep (arg1
)
11724 && truth_value_p (TREE_CODE (arg0
))
11725 && truth_value_p (TREE_CODE (op2
))
11726 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
11727 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
11728 ? BIT_IOR_EXPR
: TRUTH_ORIF_EXPR
,
11729 type
, fold_convert_loc (loc
, type
, arg0
), op2
);
11734 /* CALL_EXPRs used to be ternary exprs. Catch any mistaken uses
11735 of fold_ternary on them. */
11736 gcc_unreachable ();
11738 case BIT_FIELD_REF
:
11739 if ((TREE_CODE (arg0
) == VECTOR_CST
11740 || (TREE_CODE (arg0
) == CONSTRUCTOR
11741 && TREE_CODE (TREE_TYPE (arg0
)) == VECTOR_TYPE
))
11742 && (type
== TREE_TYPE (TREE_TYPE (arg0
))
11743 || (TREE_CODE (type
) == VECTOR_TYPE
11744 && TREE_TYPE (type
) == TREE_TYPE (TREE_TYPE (arg0
)))))
11746 tree eltype
= TREE_TYPE (TREE_TYPE (arg0
));
11747 unsigned HOST_WIDE_INT width
= tree_to_uhwi (TYPE_SIZE (eltype
));
11748 unsigned HOST_WIDE_INT n
= tree_to_uhwi (arg1
);
11749 unsigned HOST_WIDE_INT idx
= tree_to_uhwi (op2
);
11752 && (idx
% width
) == 0
11753 && (n
% width
) == 0
11754 && ((idx
+ n
) / width
) <= TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0
)))
11759 if (TREE_CODE (arg0
) == VECTOR_CST
)
11762 return VECTOR_CST_ELT (arg0
, idx
);
11764 tree
*vals
= XALLOCAVEC (tree
, n
);
11765 for (unsigned i
= 0; i
< n
; ++i
)
11766 vals
[i
] = VECTOR_CST_ELT (arg0
, idx
+ i
);
11767 return build_vector (type
, vals
);
11770 /* Constructor elements can be subvectors. */
11771 unsigned HOST_WIDE_INT k
= 1;
11772 if (CONSTRUCTOR_NELTS (arg0
) != 0)
11774 tree cons_elem
= TREE_TYPE (CONSTRUCTOR_ELT (arg0
, 0)->value
);
11775 if (TREE_CODE (cons_elem
) == VECTOR_TYPE
)
11776 k
= TYPE_VECTOR_SUBPARTS (cons_elem
);
11779 /* We keep an exact subset of the constructor elements. */
11780 if ((idx
% k
) == 0 && (n
% k
) == 0)
11782 if (CONSTRUCTOR_NELTS (arg0
) == 0)
11783 return build_constructor (type
, NULL
);
11788 if (idx
< CONSTRUCTOR_NELTS (arg0
))
11789 return CONSTRUCTOR_ELT (arg0
, idx
)->value
;
11790 return build_zero_cst (type
);
11793 vec
<constructor_elt
, va_gc
> *vals
;
11794 vec_alloc (vals
, n
);
11795 for (unsigned i
= 0;
11796 i
< n
&& idx
+ i
< CONSTRUCTOR_NELTS (arg0
);
11798 CONSTRUCTOR_APPEND_ELT (vals
, NULL_TREE
,
11800 (arg0
, idx
+ i
)->value
);
11801 return build_constructor (type
, vals
);
11803 /* The bitfield references a single constructor element. */
11804 else if (idx
+ n
<= (idx
/ k
+ 1) * k
)
11806 if (CONSTRUCTOR_NELTS (arg0
) <= idx
/ k
)
11807 return build_zero_cst (type
);
11809 return CONSTRUCTOR_ELT (arg0
, idx
/ k
)->value
;
11811 return fold_build3_loc (loc
, code
, type
,
11812 CONSTRUCTOR_ELT (arg0
, idx
/ k
)->value
, op1
,
11813 build_int_cst (TREE_TYPE (op2
), (idx
% k
) * width
));
11818 /* A bit-field-ref that referenced the full argument can be stripped. */
11819 if (INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
11820 && TYPE_PRECISION (TREE_TYPE (arg0
)) == tree_to_uhwi (arg1
)
11821 && integer_zerop (op2
))
11822 return fold_convert_loc (loc
, type
, arg0
);
11824 /* On constants we can use native encode/interpret to constant
11825 fold (nearly) all BIT_FIELD_REFs. */
11826 if (CONSTANT_CLASS_P (arg0
)
11827 && can_native_interpret_type_p (type
)
11828 && tree_fits_uhwi_p (TYPE_SIZE_UNIT (TREE_TYPE (arg0
)))
11829 /* This limitation should not be necessary, we just need to
11830 round this up to mode size. */
11831 && tree_to_uhwi (op1
) % BITS_PER_UNIT
== 0
11832 /* Need bit-shifting of the buffer to relax the following. */
11833 && tree_to_uhwi (op2
) % BITS_PER_UNIT
== 0)
11835 unsigned HOST_WIDE_INT bitpos
= tree_to_uhwi (op2
);
11836 unsigned HOST_WIDE_INT bitsize
= tree_to_uhwi (op1
);
11837 unsigned HOST_WIDE_INT clen
;
11838 clen
= tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (arg0
)));
11839 /* ??? We cannot tell native_encode_expr to start at
11840 some random byte only. So limit us to a reasonable amount
11844 unsigned char *b
= XALLOCAVEC (unsigned char, clen
);
11845 unsigned HOST_WIDE_INT len
= native_encode_expr (arg0
, b
, clen
);
11847 && len
* BITS_PER_UNIT
>= bitpos
+ bitsize
)
11849 tree v
= native_interpret_expr (type
,
11850 b
+ bitpos
/ BITS_PER_UNIT
,
11851 bitsize
/ BITS_PER_UNIT
);
11861 /* For integers we can decompose the FMA if possible. */
11862 if (TREE_CODE (arg0
) == INTEGER_CST
11863 && TREE_CODE (arg1
) == INTEGER_CST
)
11864 return fold_build2_loc (loc
, PLUS_EXPR
, type
,
11865 const_binop (MULT_EXPR
, arg0
, arg1
), arg2
);
11866 if (integer_zerop (arg2
))
11867 return fold_build2_loc (loc
, MULT_EXPR
, type
, arg0
, arg1
);
11869 return fold_fma (loc
, type
, arg0
, arg1
, arg2
);
11871 case VEC_PERM_EXPR
:
11872 if (TREE_CODE (arg2
) == VECTOR_CST
)
11874 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (type
), i
, mask
, mask2
;
11875 unsigned char *sel
= XALLOCAVEC (unsigned char, 2 * nelts
);
11876 unsigned char *sel2
= sel
+ nelts
;
11877 bool need_mask_canon
= false;
11878 bool need_mask_canon2
= false;
11879 bool all_in_vec0
= true;
11880 bool all_in_vec1
= true;
11881 bool maybe_identity
= true;
11882 bool single_arg
= (op0
== op1
);
11883 bool changed
= false;
11885 mask2
= 2 * nelts
- 1;
11886 mask
= single_arg
? (nelts
- 1) : mask2
;
11887 gcc_assert (nelts
== VECTOR_CST_NELTS (arg2
));
11888 for (i
= 0; i
< nelts
; i
++)
11890 tree val
= VECTOR_CST_ELT (arg2
, i
);
11891 if (TREE_CODE (val
) != INTEGER_CST
)
11894 /* Make sure that the perm value is in an acceptable
11897 need_mask_canon
|= wi::gtu_p (t
, mask
);
11898 need_mask_canon2
|= wi::gtu_p (t
, mask2
);
11899 sel
[i
] = t
.to_uhwi () & mask
;
11900 sel2
[i
] = t
.to_uhwi () & mask2
;
11902 if (sel
[i
] < nelts
)
11903 all_in_vec1
= false;
11905 all_in_vec0
= false;
11907 if ((sel
[i
] & (nelts
-1)) != i
)
11908 maybe_identity
= false;
11911 if (maybe_identity
)
11921 else if (all_in_vec1
)
11924 for (i
= 0; i
< nelts
; i
++)
11926 need_mask_canon
= true;
11929 if ((TREE_CODE (op0
) == VECTOR_CST
11930 || TREE_CODE (op0
) == CONSTRUCTOR
)
11931 && (TREE_CODE (op1
) == VECTOR_CST
11932 || TREE_CODE (op1
) == CONSTRUCTOR
))
11934 tree t
= fold_vec_perm (type
, op0
, op1
, sel
);
11935 if (t
!= NULL_TREE
)
11939 if (op0
== op1
&& !single_arg
)
11942 /* Some targets are deficient and fail to expand a single
11943 argument permutation while still allowing an equivalent
11944 2-argument version. */
11945 if (need_mask_canon
&& arg2
== op2
11946 && !can_vec_perm_p (TYPE_MODE (type
), false, sel
)
11947 && can_vec_perm_p (TYPE_MODE (type
), false, sel2
))
11949 need_mask_canon
= need_mask_canon2
;
11953 if (need_mask_canon
&& arg2
== op2
)
11955 tree
*tsel
= XALLOCAVEC (tree
, nelts
);
11956 tree eltype
= TREE_TYPE (TREE_TYPE (arg2
));
11957 for (i
= 0; i
< nelts
; i
++)
11958 tsel
[i
] = build_int_cst (eltype
, sel
[i
]);
11959 op2
= build_vector (TREE_TYPE (arg2
), tsel
);
11964 return build3_loc (loc
, VEC_PERM_EXPR
, type
, op0
, op1
, op2
);
11970 } /* switch (code) */
11973 /* Perform constant folding and related simplification of EXPR.
11974 The related simplifications include x*1 => x, x*0 => 0, etc.,
11975 and application of the associative law.
11976 NOP_EXPR conversions may be removed freely (as long as we
11977 are careful not to change the type of the overall expression).
11978 We cannot simplify through a CONVERT_EXPR, FIX_EXPR or FLOAT_EXPR,
11979 but we can constant-fold them if they have constant operands. */
11981 #ifdef ENABLE_FOLD_CHECKING
11982 # define fold(x) fold_1 (x)
11983 static tree
fold_1 (tree
);
11989 const tree t
= expr
;
11990 enum tree_code code
= TREE_CODE (t
);
11991 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
11993 location_t loc
= EXPR_LOCATION (expr
);
11995 /* Return right away if a constant. */
11996 if (kind
== tcc_constant
)
11999 /* CALL_EXPR-like objects with variable numbers of operands are
12000 treated specially. */
12001 if (kind
== tcc_vl_exp
)
12003 if (code
== CALL_EXPR
)
12005 tem
= fold_call_expr (loc
, expr
, false);
12006 return tem
? tem
: expr
;
12011 if (IS_EXPR_CODE_CLASS (kind
))
12013 tree type
= TREE_TYPE (t
);
12014 tree op0
, op1
, op2
;
12016 switch (TREE_CODE_LENGTH (code
))
12019 op0
= TREE_OPERAND (t
, 0);
12020 tem
= fold_unary_loc (loc
, code
, type
, op0
);
12021 return tem
? tem
: expr
;
12023 op0
= TREE_OPERAND (t
, 0);
12024 op1
= TREE_OPERAND (t
, 1);
12025 tem
= fold_binary_loc (loc
, code
, type
, op0
, op1
);
12026 return tem
? tem
: expr
;
12028 op0
= TREE_OPERAND (t
, 0);
12029 op1
= TREE_OPERAND (t
, 1);
12030 op2
= TREE_OPERAND (t
, 2);
12031 tem
= fold_ternary_loc (loc
, code
, type
, op0
, op1
, op2
);
12032 return tem
? tem
: expr
;
12042 tree op0
= TREE_OPERAND (t
, 0);
12043 tree op1
= TREE_OPERAND (t
, 1);
12045 if (TREE_CODE (op1
) == INTEGER_CST
12046 && TREE_CODE (op0
) == CONSTRUCTOR
12047 && ! type_contains_placeholder_p (TREE_TYPE (op0
)))
12049 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (op0
);
12050 unsigned HOST_WIDE_INT end
= vec_safe_length (elts
);
12051 unsigned HOST_WIDE_INT begin
= 0;
12053 /* Find a matching index by means of a binary search. */
12054 while (begin
!= end
)
12056 unsigned HOST_WIDE_INT middle
= (begin
+ end
) / 2;
12057 tree index
= (*elts
)[middle
].index
;
12059 if (TREE_CODE (index
) == INTEGER_CST
12060 && tree_int_cst_lt (index
, op1
))
12061 begin
= middle
+ 1;
12062 else if (TREE_CODE (index
) == INTEGER_CST
12063 && tree_int_cst_lt (op1
, index
))
12065 else if (TREE_CODE (index
) == RANGE_EXPR
12066 && tree_int_cst_lt (TREE_OPERAND (index
, 1), op1
))
12067 begin
= middle
+ 1;
12068 else if (TREE_CODE (index
) == RANGE_EXPR
12069 && tree_int_cst_lt (op1
, TREE_OPERAND (index
, 0)))
12072 return (*elts
)[middle
].value
;
12079 /* Return a VECTOR_CST if possible. */
12082 tree type
= TREE_TYPE (t
);
12083 if (TREE_CODE (type
) != VECTOR_TYPE
)
12086 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
12087 unsigned HOST_WIDE_INT idx
, pos
= 0;
12090 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (t
), idx
, value
)
12092 if (!CONSTANT_CLASS_P (value
))
12094 if (TREE_CODE (value
) == VECTOR_CST
)
12096 for (unsigned i
= 0; i
< VECTOR_CST_NELTS (value
); ++i
)
12097 vec
[pos
++] = VECTOR_CST_ELT (value
, i
);
12100 vec
[pos
++] = value
;
12102 for (; pos
< TYPE_VECTOR_SUBPARTS (type
); ++pos
)
12103 vec
[pos
] = build_zero_cst (TREE_TYPE (type
));
12105 return build_vector (type
, vec
);
12109 return fold (DECL_INITIAL (t
));
12113 } /* switch (code) */
12116 #ifdef ENABLE_FOLD_CHECKING
12119 static void fold_checksum_tree (const_tree
, struct md5_ctx
*,
12120 hash_table
<nofree_ptr_hash
<const tree_node
> > *);
12121 static void fold_check_failed (const_tree
, const_tree
);
12122 void print_fold_checksum (const_tree
);
12124 /* When --enable-checking=fold, compute a digest of expr before
12125 and after actual fold call to see if fold did not accidentally
12126 change original expr. */
12132 struct md5_ctx ctx
;
12133 unsigned char checksum_before
[16], checksum_after
[16];
12134 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12136 md5_init_ctx (&ctx
);
12137 fold_checksum_tree (expr
, &ctx
, &ht
);
12138 md5_finish_ctx (&ctx
, checksum_before
);
12141 ret
= fold_1 (expr
);
12143 md5_init_ctx (&ctx
);
12144 fold_checksum_tree (expr
, &ctx
, &ht
);
12145 md5_finish_ctx (&ctx
, checksum_after
);
12147 if (memcmp (checksum_before
, checksum_after
, 16))
12148 fold_check_failed (expr
, ret
);
12154 print_fold_checksum (const_tree expr
)
12156 struct md5_ctx ctx
;
12157 unsigned char checksum
[16], cnt
;
12158 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12160 md5_init_ctx (&ctx
);
12161 fold_checksum_tree (expr
, &ctx
, &ht
);
12162 md5_finish_ctx (&ctx
, checksum
);
12163 for (cnt
= 0; cnt
< 16; ++cnt
)
12164 fprintf (stderr
, "%02x", checksum
[cnt
]);
12165 putc ('\n', stderr
);
12169 fold_check_failed (const_tree expr ATTRIBUTE_UNUSED
, const_tree ret ATTRIBUTE_UNUSED
)
12171 internal_error ("fold check: original tree changed by fold");
12175 fold_checksum_tree (const_tree expr
, struct md5_ctx
*ctx
,
12176 hash_table
<nofree_ptr_hash
<const tree_node
> > *ht
)
12178 const tree_node
**slot
;
12179 enum tree_code code
;
12180 union tree_node buf
;
12186 slot
= ht
->find_slot (expr
, INSERT
);
12190 code
= TREE_CODE (expr
);
12191 if (TREE_CODE_CLASS (code
) == tcc_declaration
12192 && HAS_DECL_ASSEMBLER_NAME_P (expr
))
12194 /* Allow DECL_ASSEMBLER_NAME and symtab_node to be modified. */
12195 memcpy ((char *) &buf
, expr
, tree_size (expr
));
12196 SET_DECL_ASSEMBLER_NAME ((tree
)&buf
, NULL
);
12197 buf
.decl_with_vis
.symtab_node
= NULL
;
12198 expr
= (tree
) &buf
;
12200 else if (TREE_CODE_CLASS (code
) == tcc_type
12201 && (TYPE_POINTER_TO (expr
)
12202 || TYPE_REFERENCE_TO (expr
)
12203 || TYPE_CACHED_VALUES_P (expr
)
12204 || TYPE_CONTAINS_PLACEHOLDER_INTERNAL (expr
)
12205 || TYPE_NEXT_VARIANT (expr
)))
12207 /* Allow these fields to be modified. */
12209 memcpy ((char *) &buf
, expr
, tree_size (expr
));
12210 expr
= tmp
= (tree
) &buf
;
12211 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (tmp
) = 0;
12212 TYPE_POINTER_TO (tmp
) = NULL
;
12213 TYPE_REFERENCE_TO (tmp
) = NULL
;
12214 TYPE_NEXT_VARIANT (tmp
) = NULL
;
12215 if (TYPE_CACHED_VALUES_P (tmp
))
12217 TYPE_CACHED_VALUES_P (tmp
) = 0;
12218 TYPE_CACHED_VALUES (tmp
) = NULL
;
12221 md5_process_bytes (expr
, tree_size (expr
), ctx
);
12222 if (CODE_CONTAINS_STRUCT (code
, TS_TYPED
))
12223 fold_checksum_tree (TREE_TYPE (expr
), ctx
, ht
);
12224 if (TREE_CODE_CLASS (code
) != tcc_type
12225 && TREE_CODE_CLASS (code
) != tcc_declaration
12226 && code
!= TREE_LIST
12227 && code
!= SSA_NAME
12228 && CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
12229 fold_checksum_tree (TREE_CHAIN (expr
), ctx
, ht
);
12230 switch (TREE_CODE_CLASS (code
))
12236 md5_process_bytes (TREE_STRING_POINTER (expr
),
12237 TREE_STRING_LENGTH (expr
), ctx
);
12240 fold_checksum_tree (TREE_REALPART (expr
), ctx
, ht
);
12241 fold_checksum_tree (TREE_IMAGPART (expr
), ctx
, ht
);
12244 for (i
= 0; i
< (int) VECTOR_CST_NELTS (expr
); ++i
)
12245 fold_checksum_tree (VECTOR_CST_ELT (expr
, i
), ctx
, ht
);
12251 case tcc_exceptional
:
12255 fold_checksum_tree (TREE_PURPOSE (expr
), ctx
, ht
);
12256 fold_checksum_tree (TREE_VALUE (expr
), ctx
, ht
);
12257 expr
= TREE_CHAIN (expr
);
12258 goto recursive_label
;
12261 for (i
= 0; i
< TREE_VEC_LENGTH (expr
); ++i
)
12262 fold_checksum_tree (TREE_VEC_ELT (expr
, i
), ctx
, ht
);
12268 case tcc_expression
:
12269 case tcc_reference
:
12270 case tcc_comparison
:
12273 case tcc_statement
:
12275 len
= TREE_OPERAND_LENGTH (expr
);
12276 for (i
= 0; i
< len
; ++i
)
12277 fold_checksum_tree (TREE_OPERAND (expr
, i
), ctx
, ht
);
12279 case tcc_declaration
:
12280 fold_checksum_tree (DECL_NAME (expr
), ctx
, ht
);
12281 fold_checksum_tree (DECL_CONTEXT (expr
), ctx
, ht
);
12282 if (CODE_CONTAINS_STRUCT (TREE_CODE (expr
), TS_DECL_COMMON
))
12284 fold_checksum_tree (DECL_SIZE (expr
), ctx
, ht
);
12285 fold_checksum_tree (DECL_SIZE_UNIT (expr
), ctx
, ht
);
12286 fold_checksum_tree (DECL_INITIAL (expr
), ctx
, ht
);
12287 fold_checksum_tree (DECL_ABSTRACT_ORIGIN (expr
), ctx
, ht
);
12288 fold_checksum_tree (DECL_ATTRIBUTES (expr
), ctx
, ht
);
12291 if (CODE_CONTAINS_STRUCT (TREE_CODE (expr
), TS_DECL_NON_COMMON
))
12293 if (TREE_CODE (expr
) == FUNCTION_DECL
)
12295 fold_checksum_tree (DECL_VINDEX (expr
), ctx
, ht
);
12296 fold_checksum_tree (DECL_ARGUMENTS (expr
), ctx
, ht
);
12298 fold_checksum_tree (DECL_RESULT_FLD (expr
), ctx
, ht
);
12302 if (TREE_CODE (expr
) == ENUMERAL_TYPE
)
12303 fold_checksum_tree (TYPE_VALUES (expr
), ctx
, ht
);
12304 fold_checksum_tree (TYPE_SIZE (expr
), ctx
, ht
);
12305 fold_checksum_tree (TYPE_SIZE_UNIT (expr
), ctx
, ht
);
12306 fold_checksum_tree (TYPE_ATTRIBUTES (expr
), ctx
, ht
);
12307 fold_checksum_tree (TYPE_NAME (expr
), ctx
, ht
);
12308 if (INTEGRAL_TYPE_P (expr
)
12309 || SCALAR_FLOAT_TYPE_P (expr
))
12311 fold_checksum_tree (TYPE_MIN_VALUE (expr
), ctx
, ht
);
12312 fold_checksum_tree (TYPE_MAX_VALUE (expr
), ctx
, ht
);
12314 fold_checksum_tree (TYPE_MAIN_VARIANT (expr
), ctx
, ht
);
12315 if (TREE_CODE (expr
) == RECORD_TYPE
12316 || TREE_CODE (expr
) == UNION_TYPE
12317 || TREE_CODE (expr
) == QUAL_UNION_TYPE
)
12318 fold_checksum_tree (TYPE_BINFO (expr
), ctx
, ht
);
12319 fold_checksum_tree (TYPE_CONTEXT (expr
), ctx
, ht
);
12326 /* Helper function for outputting the checksum of a tree T. When
12327 debugging with gdb, you can "define mynext" to be "next" followed
12328 by "call debug_fold_checksum (op0)", then just trace down till the
12331 DEBUG_FUNCTION
void
12332 debug_fold_checksum (const_tree t
)
12335 unsigned char checksum
[16];
12336 struct md5_ctx ctx
;
12337 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12339 md5_init_ctx (&ctx
);
12340 fold_checksum_tree (t
, &ctx
, &ht
);
12341 md5_finish_ctx (&ctx
, checksum
);
12344 for (i
= 0; i
< 16; i
++)
12345 fprintf (stderr
, "%d ", checksum
[i
]);
12347 fprintf (stderr
, "\n");
12352 /* Fold a unary tree expression with code CODE of type TYPE with an
12353 operand OP0. LOC is the location of the resulting expression.
12354 Return a folded expression if successful. Otherwise, return a tree
12355 expression with code CODE of type TYPE with an operand OP0. */
12358 fold_build1_stat_loc (location_t loc
,
12359 enum tree_code code
, tree type
, tree op0 MEM_STAT_DECL
)
12362 #ifdef ENABLE_FOLD_CHECKING
12363 unsigned char checksum_before
[16], checksum_after
[16];
12364 struct md5_ctx ctx
;
12365 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12367 md5_init_ctx (&ctx
);
12368 fold_checksum_tree (op0
, &ctx
, &ht
);
12369 md5_finish_ctx (&ctx
, checksum_before
);
12373 tem
= fold_unary_loc (loc
, code
, type
, op0
);
12375 tem
= build1_stat_loc (loc
, code
, type
, op0 PASS_MEM_STAT
);
12377 #ifdef ENABLE_FOLD_CHECKING
12378 md5_init_ctx (&ctx
);
12379 fold_checksum_tree (op0
, &ctx
, &ht
);
12380 md5_finish_ctx (&ctx
, checksum_after
);
12382 if (memcmp (checksum_before
, checksum_after
, 16))
12383 fold_check_failed (op0
, tem
);
12388 /* Fold a binary tree expression with code CODE of type TYPE with
12389 operands OP0 and OP1. LOC is the location of the resulting
12390 expression. Return a folded expression if successful. Otherwise,
12391 return a tree expression with code CODE of type TYPE with operands
12395 fold_build2_stat_loc (location_t loc
,
12396 enum tree_code code
, tree type
, tree op0
, tree op1
12400 #ifdef ENABLE_FOLD_CHECKING
12401 unsigned char checksum_before_op0
[16],
12402 checksum_before_op1
[16],
12403 checksum_after_op0
[16],
12404 checksum_after_op1
[16];
12405 struct md5_ctx ctx
;
12406 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12408 md5_init_ctx (&ctx
);
12409 fold_checksum_tree (op0
, &ctx
, &ht
);
12410 md5_finish_ctx (&ctx
, checksum_before_op0
);
12413 md5_init_ctx (&ctx
);
12414 fold_checksum_tree (op1
, &ctx
, &ht
);
12415 md5_finish_ctx (&ctx
, checksum_before_op1
);
12419 tem
= fold_binary_loc (loc
, code
, type
, op0
, op1
);
12421 tem
= build2_stat_loc (loc
, code
, type
, op0
, op1 PASS_MEM_STAT
);
12423 #ifdef ENABLE_FOLD_CHECKING
12424 md5_init_ctx (&ctx
);
12425 fold_checksum_tree (op0
, &ctx
, &ht
);
12426 md5_finish_ctx (&ctx
, checksum_after_op0
);
12429 if (memcmp (checksum_before_op0
, checksum_after_op0
, 16))
12430 fold_check_failed (op0
, tem
);
12432 md5_init_ctx (&ctx
);
12433 fold_checksum_tree (op1
, &ctx
, &ht
);
12434 md5_finish_ctx (&ctx
, checksum_after_op1
);
12436 if (memcmp (checksum_before_op1
, checksum_after_op1
, 16))
12437 fold_check_failed (op1
, tem
);
12442 /* Fold a ternary tree expression with code CODE of type TYPE with
12443 operands OP0, OP1, and OP2. Return a folded expression if
12444 successful. Otherwise, return a tree expression with code CODE of
12445 type TYPE with operands OP0, OP1, and OP2. */
12448 fold_build3_stat_loc (location_t loc
, enum tree_code code
, tree type
,
12449 tree op0
, tree op1
, tree op2 MEM_STAT_DECL
)
12452 #ifdef ENABLE_FOLD_CHECKING
12453 unsigned char checksum_before_op0
[16],
12454 checksum_before_op1
[16],
12455 checksum_before_op2
[16],
12456 checksum_after_op0
[16],
12457 checksum_after_op1
[16],
12458 checksum_after_op2
[16];
12459 struct md5_ctx ctx
;
12460 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12462 md5_init_ctx (&ctx
);
12463 fold_checksum_tree (op0
, &ctx
, &ht
);
12464 md5_finish_ctx (&ctx
, checksum_before_op0
);
12467 md5_init_ctx (&ctx
);
12468 fold_checksum_tree (op1
, &ctx
, &ht
);
12469 md5_finish_ctx (&ctx
, checksum_before_op1
);
12472 md5_init_ctx (&ctx
);
12473 fold_checksum_tree (op2
, &ctx
, &ht
);
12474 md5_finish_ctx (&ctx
, checksum_before_op2
);
12478 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
12479 tem
= fold_ternary_loc (loc
, code
, type
, op0
, op1
, op2
);
12481 tem
= build3_stat_loc (loc
, code
, type
, op0
, op1
, op2 PASS_MEM_STAT
);
12483 #ifdef ENABLE_FOLD_CHECKING
12484 md5_init_ctx (&ctx
);
12485 fold_checksum_tree (op0
, &ctx
, &ht
);
12486 md5_finish_ctx (&ctx
, checksum_after_op0
);
12489 if (memcmp (checksum_before_op0
, checksum_after_op0
, 16))
12490 fold_check_failed (op0
, tem
);
12492 md5_init_ctx (&ctx
);
12493 fold_checksum_tree (op1
, &ctx
, &ht
);
12494 md5_finish_ctx (&ctx
, checksum_after_op1
);
12497 if (memcmp (checksum_before_op1
, checksum_after_op1
, 16))
12498 fold_check_failed (op1
, tem
);
12500 md5_init_ctx (&ctx
);
12501 fold_checksum_tree (op2
, &ctx
, &ht
);
12502 md5_finish_ctx (&ctx
, checksum_after_op2
);
12504 if (memcmp (checksum_before_op2
, checksum_after_op2
, 16))
12505 fold_check_failed (op2
, tem
);
12510 /* Fold a CALL_EXPR expression of type TYPE with operands FN and NARGS
12511 arguments in ARGARRAY, and a null static chain.
12512 Return a folded expression if successful. Otherwise, return a CALL_EXPR
12513 of type TYPE from the given operands as constructed by build_call_array. */
12516 fold_build_call_array_loc (location_t loc
, tree type
, tree fn
,
12517 int nargs
, tree
*argarray
)
12520 #ifdef ENABLE_FOLD_CHECKING
12521 unsigned char checksum_before_fn
[16],
12522 checksum_before_arglist
[16],
12523 checksum_after_fn
[16],
12524 checksum_after_arglist
[16];
12525 struct md5_ctx ctx
;
12526 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12529 md5_init_ctx (&ctx
);
12530 fold_checksum_tree (fn
, &ctx
, &ht
);
12531 md5_finish_ctx (&ctx
, checksum_before_fn
);
12534 md5_init_ctx (&ctx
);
12535 for (i
= 0; i
< nargs
; i
++)
12536 fold_checksum_tree (argarray
[i
], &ctx
, &ht
);
12537 md5_finish_ctx (&ctx
, checksum_before_arglist
);
12541 tem
= fold_builtin_call_array (loc
, type
, fn
, nargs
, argarray
);
12543 tem
= build_call_array_loc (loc
, type
, fn
, nargs
, argarray
);
12545 #ifdef ENABLE_FOLD_CHECKING
12546 md5_init_ctx (&ctx
);
12547 fold_checksum_tree (fn
, &ctx
, &ht
);
12548 md5_finish_ctx (&ctx
, checksum_after_fn
);
12551 if (memcmp (checksum_before_fn
, checksum_after_fn
, 16))
12552 fold_check_failed (fn
, tem
);
12554 md5_init_ctx (&ctx
);
12555 for (i
= 0; i
< nargs
; i
++)
12556 fold_checksum_tree (argarray
[i
], &ctx
, &ht
);
12557 md5_finish_ctx (&ctx
, checksum_after_arglist
);
12559 if (memcmp (checksum_before_arglist
, checksum_after_arglist
, 16))
12560 fold_check_failed (NULL_TREE
, tem
);
12565 /* Perform constant folding and related simplification of initializer
12566 expression EXPR. These behave identically to "fold_buildN" but ignore
12567 potential run-time traps and exceptions that fold must preserve. */
12569 #define START_FOLD_INIT \
12570 int saved_signaling_nans = flag_signaling_nans;\
12571 int saved_trapping_math = flag_trapping_math;\
12572 int saved_rounding_math = flag_rounding_math;\
12573 int saved_trapv = flag_trapv;\
12574 int saved_folding_initializer = folding_initializer;\
12575 flag_signaling_nans = 0;\
12576 flag_trapping_math = 0;\
12577 flag_rounding_math = 0;\
12579 folding_initializer = 1;
12581 #define END_FOLD_INIT \
12582 flag_signaling_nans = saved_signaling_nans;\
12583 flag_trapping_math = saved_trapping_math;\
12584 flag_rounding_math = saved_rounding_math;\
12585 flag_trapv = saved_trapv;\
12586 folding_initializer = saved_folding_initializer;
12589 fold_build1_initializer_loc (location_t loc
, enum tree_code code
,
12590 tree type
, tree op
)
12595 result
= fold_build1_loc (loc
, code
, type
, op
);
12602 fold_build2_initializer_loc (location_t loc
, enum tree_code code
,
12603 tree type
, tree op0
, tree op1
)
12608 result
= fold_build2_loc (loc
, code
, type
, op0
, op1
);
12615 fold_build_call_array_initializer_loc (location_t loc
, tree type
, tree fn
,
12616 int nargs
, tree
*argarray
)
12621 result
= fold_build_call_array_loc (loc
, type
, fn
, nargs
, argarray
);
12627 #undef START_FOLD_INIT
12628 #undef END_FOLD_INIT
12630 /* Determine if first argument is a multiple of second argument. Return 0 if
12631 it is not, or we cannot easily determined it to be.
12633 An example of the sort of thing we care about (at this point; this routine
12634 could surely be made more general, and expanded to do what the *_DIV_EXPR's
12635 fold cases do now) is discovering that
12637 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
12643 when we know that the two SAVE_EXPR (J * 8) nodes are the same node.
12645 This code also handles discovering that
12647 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
12649 is a multiple of 8 so we don't have to worry about dealing with a
12650 possible remainder.
12652 Note that we *look* inside a SAVE_EXPR only to determine how it was
12653 calculated; it is not safe for fold to do much of anything else with the
12654 internals of a SAVE_EXPR, since it cannot know when it will be evaluated
12655 at run time. For example, the latter example above *cannot* be implemented
12656 as SAVE_EXPR (I) * J or any variant thereof, since the value of J at
12657 evaluation time of the original SAVE_EXPR is not necessarily the same at
12658 the time the new expression is evaluated. The only optimization of this
12659 sort that would be valid is changing
12661 SAVE_EXPR (I) * SAVE_EXPR (SAVE_EXPR (J) * 8)
12665 SAVE_EXPR (I) * SAVE_EXPR (J)
12667 (where the same SAVE_EXPR (J) is used in the original and the
12668 transformed version). */
12671 multiple_of_p (tree type
, const_tree top
, const_tree bottom
)
12673 if (operand_equal_p (top
, bottom
, 0))
12676 if (TREE_CODE (type
) != INTEGER_TYPE
)
12679 switch (TREE_CODE (top
))
12682 /* Bitwise and provides a power of two multiple. If the mask is
12683 a multiple of BOTTOM then TOP is a multiple of BOTTOM. */
12684 if (!integer_pow2p (bottom
))
12689 return (multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
)
12690 || multiple_of_p (type
, TREE_OPERAND (top
, 1), bottom
));
12694 return (multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
)
12695 && multiple_of_p (type
, TREE_OPERAND (top
, 1), bottom
));
12698 if (TREE_CODE (TREE_OPERAND (top
, 1)) == INTEGER_CST
)
12702 op1
= TREE_OPERAND (top
, 1);
12703 /* const_binop may not detect overflow correctly,
12704 so check for it explicitly here. */
12705 if (wi::gtu_p (TYPE_PRECISION (TREE_TYPE (size_one_node
)), op1
)
12706 && 0 != (t1
= fold_convert (type
,
12707 const_binop (LSHIFT_EXPR
,
12710 && !TREE_OVERFLOW (t1
))
12711 return multiple_of_p (type
, t1
, bottom
);
12716 /* Can't handle conversions from non-integral or wider integral type. */
12717 if ((TREE_CODE (TREE_TYPE (TREE_OPERAND (top
, 0))) != INTEGER_TYPE
)
12718 || (TYPE_PRECISION (type
)
12719 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (top
, 0)))))
12722 /* .. fall through ... */
12725 return multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
);
12728 return (multiple_of_p (type
, TREE_OPERAND (top
, 1), bottom
)
12729 && multiple_of_p (type
, TREE_OPERAND (top
, 2), bottom
));
12732 if (TREE_CODE (bottom
) != INTEGER_CST
12733 || integer_zerop (bottom
)
12734 || (TYPE_UNSIGNED (type
)
12735 && (tree_int_cst_sgn (top
) < 0
12736 || tree_int_cst_sgn (bottom
) < 0)))
12738 return wi::multiple_of_p (wi::to_widest (top
), wi::to_widest (bottom
),
12746 /* Return true if CODE or TYPE is known to be non-negative. */
12749 tree_simple_nonnegative_warnv_p (enum tree_code code
, tree type
)
12751 if ((TYPE_PRECISION (type
) != 1 || TYPE_UNSIGNED (type
))
12752 && truth_value_p (code
))
12753 /* Truth values evaluate to 0 or 1, which is nonnegative unless we
12754 have a signed:1 type (where the value is -1 and 0). */
12759 /* Return true if (CODE OP0) is known to be non-negative. If the return
12760 value is based on the assumption that signed overflow is undefined,
12761 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12762 *STRICT_OVERFLOW_P. */
12765 tree_unary_nonnegative_warnv_p (enum tree_code code
, tree type
, tree op0
,
12766 bool *strict_overflow_p
)
12768 if (TYPE_UNSIGNED (type
))
12774 /* We can't return 1 if flag_wrapv is set because
12775 ABS_EXPR<INT_MIN> = INT_MIN. */
12776 if (!ANY_INTEGRAL_TYPE_P (type
))
12778 if (TYPE_OVERFLOW_UNDEFINED (type
))
12780 *strict_overflow_p
= true;
12785 case NON_LVALUE_EXPR
:
12787 case FIX_TRUNC_EXPR
:
12788 return tree_expr_nonnegative_warnv_p (op0
,
12789 strict_overflow_p
);
12793 tree inner_type
= TREE_TYPE (op0
);
12794 tree outer_type
= type
;
12796 if (TREE_CODE (outer_type
) == REAL_TYPE
)
12798 if (TREE_CODE (inner_type
) == REAL_TYPE
)
12799 return tree_expr_nonnegative_warnv_p (op0
,
12800 strict_overflow_p
);
12801 if (INTEGRAL_TYPE_P (inner_type
))
12803 if (TYPE_UNSIGNED (inner_type
))
12805 return tree_expr_nonnegative_warnv_p (op0
,
12806 strict_overflow_p
);
12809 else if (INTEGRAL_TYPE_P (outer_type
))
12811 if (TREE_CODE (inner_type
) == REAL_TYPE
)
12812 return tree_expr_nonnegative_warnv_p (op0
,
12813 strict_overflow_p
);
12814 if (INTEGRAL_TYPE_P (inner_type
))
12815 return TYPE_PRECISION (inner_type
) < TYPE_PRECISION (outer_type
)
12816 && TYPE_UNSIGNED (inner_type
);
12822 return tree_simple_nonnegative_warnv_p (code
, type
);
12825 /* We don't know sign of `t', so be conservative and return false. */
12829 /* Return true if (CODE OP0 OP1) is known to be non-negative. If the return
12830 value is based on the assumption that signed overflow is undefined,
12831 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12832 *STRICT_OVERFLOW_P. */
12835 tree_binary_nonnegative_warnv_p (enum tree_code code
, tree type
, tree op0
,
12836 tree op1
, bool *strict_overflow_p
)
12838 if (TYPE_UNSIGNED (type
))
12843 case POINTER_PLUS_EXPR
:
12845 if (FLOAT_TYPE_P (type
))
12846 return (tree_expr_nonnegative_warnv_p (op0
,
12848 && tree_expr_nonnegative_warnv_p (op1
,
12849 strict_overflow_p
));
12851 /* zero_extend(x) + zero_extend(y) is non-negative if x and y are
12852 both unsigned and at least 2 bits shorter than the result. */
12853 if (TREE_CODE (type
) == INTEGER_TYPE
12854 && TREE_CODE (op0
) == NOP_EXPR
12855 && TREE_CODE (op1
) == NOP_EXPR
)
12857 tree inner1
= TREE_TYPE (TREE_OPERAND (op0
, 0));
12858 tree inner2
= TREE_TYPE (TREE_OPERAND (op1
, 0));
12859 if (TREE_CODE (inner1
) == INTEGER_TYPE
&& TYPE_UNSIGNED (inner1
)
12860 && TREE_CODE (inner2
) == INTEGER_TYPE
&& TYPE_UNSIGNED (inner2
))
12862 unsigned int prec
= MAX (TYPE_PRECISION (inner1
),
12863 TYPE_PRECISION (inner2
)) + 1;
12864 return prec
< TYPE_PRECISION (type
);
12870 if (FLOAT_TYPE_P (type
) || TYPE_OVERFLOW_UNDEFINED (type
))
12872 /* x * x is always non-negative for floating point x
12873 or without overflow. */
12874 if (operand_equal_p (op0
, op1
, 0)
12875 || (tree_expr_nonnegative_warnv_p (op0
, strict_overflow_p
)
12876 && tree_expr_nonnegative_warnv_p (op1
, strict_overflow_p
)))
12878 if (ANY_INTEGRAL_TYPE_P (type
)
12879 && TYPE_OVERFLOW_UNDEFINED (type
))
12880 *strict_overflow_p
= true;
12885 /* zero_extend(x) * zero_extend(y) is non-negative if x and y are
12886 both unsigned and their total bits is shorter than the result. */
12887 if (TREE_CODE (type
) == INTEGER_TYPE
12888 && (TREE_CODE (op0
) == NOP_EXPR
|| TREE_CODE (op0
) == INTEGER_CST
)
12889 && (TREE_CODE (op1
) == NOP_EXPR
|| TREE_CODE (op1
) == INTEGER_CST
))
12891 tree inner0
= (TREE_CODE (op0
) == NOP_EXPR
)
12892 ? TREE_TYPE (TREE_OPERAND (op0
, 0))
12894 tree inner1
= (TREE_CODE (op1
) == NOP_EXPR
)
12895 ? TREE_TYPE (TREE_OPERAND (op1
, 0))
12898 bool unsigned0
= TYPE_UNSIGNED (inner0
);
12899 bool unsigned1
= TYPE_UNSIGNED (inner1
);
12901 if (TREE_CODE (op0
) == INTEGER_CST
)
12902 unsigned0
= unsigned0
|| tree_int_cst_sgn (op0
) >= 0;
12904 if (TREE_CODE (op1
) == INTEGER_CST
)
12905 unsigned1
= unsigned1
|| tree_int_cst_sgn (op1
) >= 0;
12907 if (TREE_CODE (inner0
) == INTEGER_TYPE
&& unsigned0
12908 && TREE_CODE (inner1
) == INTEGER_TYPE
&& unsigned1
)
12910 unsigned int precision0
= (TREE_CODE (op0
) == INTEGER_CST
)
12911 ? tree_int_cst_min_precision (op0
, UNSIGNED
)
12912 : TYPE_PRECISION (inner0
);
12914 unsigned int precision1
= (TREE_CODE (op1
) == INTEGER_CST
)
12915 ? tree_int_cst_min_precision (op1
, UNSIGNED
)
12916 : TYPE_PRECISION (inner1
);
12918 return precision0
+ precision1
< TYPE_PRECISION (type
);
12925 return (tree_expr_nonnegative_warnv_p (op0
,
12927 || tree_expr_nonnegative_warnv_p (op1
,
12928 strict_overflow_p
));
12934 case TRUNC_DIV_EXPR
:
12935 case CEIL_DIV_EXPR
:
12936 case FLOOR_DIV_EXPR
:
12937 case ROUND_DIV_EXPR
:
12938 return (tree_expr_nonnegative_warnv_p (op0
,
12940 && tree_expr_nonnegative_warnv_p (op1
,
12941 strict_overflow_p
));
12943 case TRUNC_MOD_EXPR
:
12944 case CEIL_MOD_EXPR
:
12945 case FLOOR_MOD_EXPR
:
12946 case ROUND_MOD_EXPR
:
12947 return tree_expr_nonnegative_warnv_p (op0
,
12948 strict_overflow_p
);
12950 return tree_simple_nonnegative_warnv_p (code
, type
);
12953 /* We don't know sign of `t', so be conservative and return false. */
12957 /* Return true if T is known to be non-negative. If the return
12958 value is based on the assumption that signed overflow is undefined,
12959 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12960 *STRICT_OVERFLOW_P. */
12963 tree_single_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
)
12965 if (TYPE_UNSIGNED (TREE_TYPE (t
)))
12968 switch (TREE_CODE (t
))
12971 return tree_int_cst_sgn (t
) >= 0;
12974 return ! REAL_VALUE_NEGATIVE (TREE_REAL_CST (t
));
12977 return ! FIXED_VALUE_NEGATIVE (TREE_FIXED_CST (t
));
12980 return (tree_expr_nonnegative_warnv_p (TREE_OPERAND (t
, 1),
12982 && tree_expr_nonnegative_warnv_p (TREE_OPERAND (t
, 2),
12983 strict_overflow_p
));
12985 return tree_simple_nonnegative_warnv_p (TREE_CODE (t
),
12988 /* We don't know sign of `t', so be conservative and return false. */
12992 /* Return true if T is known to be non-negative. If the return
12993 value is based on the assumption that signed overflow is undefined,
12994 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12995 *STRICT_OVERFLOW_P. */
12998 tree_call_nonnegative_warnv_p (tree type
, tree fndecl
,
12999 tree arg0
, tree arg1
, bool *strict_overflow_p
)
13001 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
13002 switch (DECL_FUNCTION_CODE (fndecl
))
13004 CASE_FLT_FN (BUILT_IN_ACOS
):
13005 CASE_FLT_FN (BUILT_IN_ACOSH
):
13006 CASE_FLT_FN (BUILT_IN_CABS
):
13007 CASE_FLT_FN (BUILT_IN_COSH
):
13008 CASE_FLT_FN (BUILT_IN_ERFC
):
13009 CASE_FLT_FN (BUILT_IN_EXP
):
13010 CASE_FLT_FN (BUILT_IN_EXP10
):
13011 CASE_FLT_FN (BUILT_IN_EXP2
):
13012 CASE_FLT_FN (BUILT_IN_FABS
):
13013 CASE_FLT_FN (BUILT_IN_FDIM
):
13014 CASE_FLT_FN (BUILT_IN_HYPOT
):
13015 CASE_FLT_FN (BUILT_IN_POW10
):
13016 CASE_INT_FN (BUILT_IN_FFS
):
13017 CASE_INT_FN (BUILT_IN_PARITY
):
13018 CASE_INT_FN (BUILT_IN_POPCOUNT
):
13019 CASE_INT_FN (BUILT_IN_CLZ
):
13020 CASE_INT_FN (BUILT_IN_CLRSB
):
13021 case BUILT_IN_BSWAP32
:
13022 case BUILT_IN_BSWAP64
:
13026 CASE_FLT_FN (BUILT_IN_SQRT
):
13027 /* sqrt(-0.0) is -0.0. */
13028 if (!HONOR_SIGNED_ZEROS (element_mode (type
)))
13030 return tree_expr_nonnegative_warnv_p (arg0
,
13031 strict_overflow_p
);
13033 CASE_FLT_FN (BUILT_IN_ASINH
):
13034 CASE_FLT_FN (BUILT_IN_ATAN
):
13035 CASE_FLT_FN (BUILT_IN_ATANH
):
13036 CASE_FLT_FN (BUILT_IN_CBRT
):
13037 CASE_FLT_FN (BUILT_IN_CEIL
):
13038 CASE_FLT_FN (BUILT_IN_ERF
):
13039 CASE_FLT_FN (BUILT_IN_EXPM1
):
13040 CASE_FLT_FN (BUILT_IN_FLOOR
):
13041 CASE_FLT_FN (BUILT_IN_FMOD
):
13042 CASE_FLT_FN (BUILT_IN_FREXP
):
13043 CASE_FLT_FN (BUILT_IN_ICEIL
):
13044 CASE_FLT_FN (BUILT_IN_IFLOOR
):
13045 CASE_FLT_FN (BUILT_IN_IRINT
):
13046 CASE_FLT_FN (BUILT_IN_IROUND
):
13047 CASE_FLT_FN (BUILT_IN_LCEIL
):
13048 CASE_FLT_FN (BUILT_IN_LDEXP
):
13049 CASE_FLT_FN (BUILT_IN_LFLOOR
):
13050 CASE_FLT_FN (BUILT_IN_LLCEIL
):
13051 CASE_FLT_FN (BUILT_IN_LLFLOOR
):
13052 CASE_FLT_FN (BUILT_IN_LLRINT
):
13053 CASE_FLT_FN (BUILT_IN_LLROUND
):
13054 CASE_FLT_FN (BUILT_IN_LRINT
):
13055 CASE_FLT_FN (BUILT_IN_LROUND
):
13056 CASE_FLT_FN (BUILT_IN_MODF
):
13057 CASE_FLT_FN (BUILT_IN_NEARBYINT
):
13058 CASE_FLT_FN (BUILT_IN_RINT
):
13059 CASE_FLT_FN (BUILT_IN_ROUND
):
13060 CASE_FLT_FN (BUILT_IN_SCALB
):
13061 CASE_FLT_FN (BUILT_IN_SCALBLN
):
13062 CASE_FLT_FN (BUILT_IN_SCALBN
):
13063 CASE_FLT_FN (BUILT_IN_SIGNBIT
):
13064 CASE_FLT_FN (BUILT_IN_SIGNIFICAND
):
13065 CASE_FLT_FN (BUILT_IN_SINH
):
13066 CASE_FLT_FN (BUILT_IN_TANH
):
13067 CASE_FLT_FN (BUILT_IN_TRUNC
):
13068 /* True if the 1st argument is nonnegative. */
13069 return tree_expr_nonnegative_warnv_p (arg0
,
13070 strict_overflow_p
);
13072 CASE_FLT_FN (BUILT_IN_FMAX
):
13073 /* True if the 1st OR 2nd arguments are nonnegative. */
13074 return (tree_expr_nonnegative_warnv_p (arg0
,
13076 || (tree_expr_nonnegative_warnv_p (arg1
,
13077 strict_overflow_p
)));
13079 CASE_FLT_FN (BUILT_IN_FMIN
):
13080 /* True if the 1st AND 2nd arguments are nonnegative. */
13081 return (tree_expr_nonnegative_warnv_p (arg0
,
13083 && (tree_expr_nonnegative_warnv_p (arg1
,
13084 strict_overflow_p
)));
13086 CASE_FLT_FN (BUILT_IN_COPYSIGN
):
13087 /* True if the 2nd argument is nonnegative. */
13088 return tree_expr_nonnegative_warnv_p (arg1
,
13089 strict_overflow_p
);
13091 CASE_FLT_FN (BUILT_IN_POWI
):
13092 /* True if the 1st argument is nonnegative or the second
13093 argument is an even integer. */
13094 if (TREE_CODE (arg1
) == INTEGER_CST
13095 && (TREE_INT_CST_LOW (arg1
) & 1) == 0)
13097 return tree_expr_nonnegative_warnv_p (arg0
,
13098 strict_overflow_p
);
13100 CASE_FLT_FN (BUILT_IN_POW
):
13101 /* True if the 1st argument is nonnegative or the second
13102 argument is an even integer valued real. */
13103 if (TREE_CODE (arg1
) == REAL_CST
)
13108 c
= TREE_REAL_CST (arg1
);
13109 n
= real_to_integer (&c
);
13112 REAL_VALUE_TYPE cint
;
13113 real_from_integer (&cint
, VOIDmode
, n
, SIGNED
);
13114 if (real_identical (&c
, &cint
))
13118 return tree_expr_nonnegative_warnv_p (arg0
,
13119 strict_overflow_p
);
13124 return tree_simple_nonnegative_warnv_p (CALL_EXPR
,
13128 /* Return true if T is known to be non-negative. If the return
13129 value is based on the assumption that signed overflow is undefined,
13130 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13131 *STRICT_OVERFLOW_P. */
13134 tree_invalid_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
)
13136 enum tree_code code
= TREE_CODE (t
);
13137 if (TYPE_UNSIGNED (TREE_TYPE (t
)))
13144 tree temp
= TARGET_EXPR_SLOT (t
);
13145 t
= TARGET_EXPR_INITIAL (t
);
13147 /* If the initializer is non-void, then it's a normal expression
13148 that will be assigned to the slot. */
13149 if (!VOID_TYPE_P (t
))
13150 return tree_expr_nonnegative_warnv_p (t
, strict_overflow_p
);
13152 /* Otherwise, the initializer sets the slot in some way. One common
13153 way is an assignment statement at the end of the initializer. */
13156 if (TREE_CODE (t
) == BIND_EXPR
)
13157 t
= expr_last (BIND_EXPR_BODY (t
));
13158 else if (TREE_CODE (t
) == TRY_FINALLY_EXPR
13159 || TREE_CODE (t
) == TRY_CATCH_EXPR
)
13160 t
= expr_last (TREE_OPERAND (t
, 0));
13161 else if (TREE_CODE (t
) == STATEMENT_LIST
)
13166 if (TREE_CODE (t
) == MODIFY_EXPR
13167 && TREE_OPERAND (t
, 0) == temp
)
13168 return tree_expr_nonnegative_warnv_p (TREE_OPERAND (t
, 1),
13169 strict_overflow_p
);
13176 tree arg0
= call_expr_nargs (t
) > 0 ? CALL_EXPR_ARG (t
, 0) : NULL_TREE
;
13177 tree arg1
= call_expr_nargs (t
) > 1 ? CALL_EXPR_ARG (t
, 1) : NULL_TREE
;
13179 return tree_call_nonnegative_warnv_p (TREE_TYPE (t
),
13180 get_callee_fndecl (t
),
13183 strict_overflow_p
);
13185 case COMPOUND_EXPR
:
13187 return tree_expr_nonnegative_warnv_p (TREE_OPERAND (t
, 1),
13188 strict_overflow_p
);
13190 return tree_expr_nonnegative_warnv_p (expr_last (TREE_OPERAND (t
, 1)),
13191 strict_overflow_p
);
13193 return tree_expr_nonnegative_warnv_p (TREE_OPERAND (t
, 0),
13194 strict_overflow_p
);
13197 return tree_simple_nonnegative_warnv_p (TREE_CODE (t
),
13201 /* We don't know sign of `t', so be conservative and return false. */
13205 /* Return true if T is known to be non-negative. If the return
13206 value is based on the assumption that signed overflow is undefined,
13207 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13208 *STRICT_OVERFLOW_P. */
13211 tree_expr_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
)
13213 enum tree_code code
;
13214 if (t
== error_mark_node
)
13217 code
= TREE_CODE (t
);
13218 switch (TREE_CODE_CLASS (code
))
13221 case tcc_comparison
:
13222 return tree_binary_nonnegative_warnv_p (TREE_CODE (t
),
13224 TREE_OPERAND (t
, 0),
13225 TREE_OPERAND (t
, 1),
13226 strict_overflow_p
);
13229 return tree_unary_nonnegative_warnv_p (TREE_CODE (t
),
13231 TREE_OPERAND (t
, 0),
13232 strict_overflow_p
);
13235 case tcc_declaration
:
13236 case tcc_reference
:
13237 return tree_single_nonnegative_warnv_p (t
, strict_overflow_p
);
13245 case TRUTH_AND_EXPR
:
13246 case TRUTH_OR_EXPR
:
13247 case TRUTH_XOR_EXPR
:
13248 return tree_binary_nonnegative_warnv_p (TREE_CODE (t
),
13250 TREE_OPERAND (t
, 0),
13251 TREE_OPERAND (t
, 1),
13252 strict_overflow_p
);
13253 case TRUTH_NOT_EXPR
:
13254 return tree_unary_nonnegative_warnv_p (TREE_CODE (t
),
13256 TREE_OPERAND (t
, 0),
13257 strict_overflow_p
);
13264 case WITH_SIZE_EXPR
:
13266 return tree_single_nonnegative_warnv_p (t
, strict_overflow_p
);
13269 return tree_invalid_nonnegative_warnv_p (t
, strict_overflow_p
);
13273 /* Return true if `t' is known to be non-negative. Handle warnings
13274 about undefined signed overflow. */
13277 tree_expr_nonnegative_p (tree t
)
13279 bool ret
, strict_overflow_p
;
13281 strict_overflow_p
= false;
13282 ret
= tree_expr_nonnegative_warnv_p (t
, &strict_overflow_p
);
13283 if (strict_overflow_p
)
13284 fold_overflow_warning (("assuming signed overflow does not occur when "
13285 "determining that expression is always "
13287 WARN_STRICT_OVERFLOW_MISC
);
13292 /* Return true when (CODE OP0) is an address and is known to be nonzero.
13293 For floating point we further ensure that T is not denormal.
13294 Similar logic is present in nonzero_address in rtlanal.h.
13296 If the return value is based on the assumption that signed overflow
13297 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13298 change *STRICT_OVERFLOW_P. */
13301 tree_unary_nonzero_warnv_p (enum tree_code code
, tree type
, tree op0
,
13302 bool *strict_overflow_p
)
13307 return tree_expr_nonzero_warnv_p (op0
,
13308 strict_overflow_p
);
13312 tree inner_type
= TREE_TYPE (op0
);
13313 tree outer_type
= type
;
13315 return (TYPE_PRECISION (outer_type
) >= TYPE_PRECISION (inner_type
)
13316 && tree_expr_nonzero_warnv_p (op0
,
13317 strict_overflow_p
));
13321 case NON_LVALUE_EXPR
:
13322 return tree_expr_nonzero_warnv_p (op0
,
13323 strict_overflow_p
);
13332 /* Return true when (CODE OP0 OP1) is an address and is known to be nonzero.
13333 For floating point we further ensure that T is not denormal.
13334 Similar logic is present in nonzero_address in rtlanal.h.
13336 If the return value is based on the assumption that signed overflow
13337 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13338 change *STRICT_OVERFLOW_P. */
13341 tree_binary_nonzero_warnv_p (enum tree_code code
,
13344 tree op1
, bool *strict_overflow_p
)
13346 bool sub_strict_overflow_p
;
13349 case POINTER_PLUS_EXPR
:
13351 if (ANY_INTEGRAL_TYPE_P (type
) && TYPE_OVERFLOW_UNDEFINED (type
))
13353 /* With the presence of negative values it is hard
13354 to say something. */
13355 sub_strict_overflow_p
= false;
13356 if (!tree_expr_nonnegative_warnv_p (op0
,
13357 &sub_strict_overflow_p
)
13358 || !tree_expr_nonnegative_warnv_p (op1
,
13359 &sub_strict_overflow_p
))
13361 /* One of operands must be positive and the other non-negative. */
13362 /* We don't set *STRICT_OVERFLOW_P here: even if this value
13363 overflows, on a twos-complement machine the sum of two
13364 nonnegative numbers can never be zero. */
13365 return (tree_expr_nonzero_warnv_p (op0
,
13367 || tree_expr_nonzero_warnv_p (op1
,
13368 strict_overflow_p
));
13373 if (TYPE_OVERFLOW_UNDEFINED (type
))
13375 if (tree_expr_nonzero_warnv_p (op0
,
13377 && tree_expr_nonzero_warnv_p (op1
,
13378 strict_overflow_p
))
13380 *strict_overflow_p
= true;
13387 sub_strict_overflow_p
= false;
13388 if (tree_expr_nonzero_warnv_p (op0
,
13389 &sub_strict_overflow_p
)
13390 && tree_expr_nonzero_warnv_p (op1
,
13391 &sub_strict_overflow_p
))
13393 if (sub_strict_overflow_p
)
13394 *strict_overflow_p
= true;
13399 sub_strict_overflow_p
= false;
13400 if (tree_expr_nonzero_warnv_p (op0
,
13401 &sub_strict_overflow_p
))
13403 if (sub_strict_overflow_p
)
13404 *strict_overflow_p
= true;
13406 /* When both operands are nonzero, then MAX must be too. */
13407 if (tree_expr_nonzero_warnv_p (op1
,
13408 strict_overflow_p
))
13411 /* MAX where operand 0 is positive is positive. */
13412 return tree_expr_nonnegative_warnv_p (op0
,
13413 strict_overflow_p
);
13415 /* MAX where operand 1 is positive is positive. */
13416 else if (tree_expr_nonzero_warnv_p (op1
,
13417 &sub_strict_overflow_p
)
13418 && tree_expr_nonnegative_warnv_p (op1
,
13419 &sub_strict_overflow_p
))
13421 if (sub_strict_overflow_p
)
13422 *strict_overflow_p
= true;
13428 return (tree_expr_nonzero_warnv_p (op1
,
13430 || tree_expr_nonzero_warnv_p (op0
,
13431 strict_overflow_p
));
13440 /* Return true when T is an address and is known to be nonzero.
13441 For floating point we further ensure that T is not denormal.
13442 Similar logic is present in nonzero_address in rtlanal.h.
13444 If the return value is based on the assumption that signed overflow
13445 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13446 change *STRICT_OVERFLOW_P. */
13449 tree_single_nonzero_warnv_p (tree t
, bool *strict_overflow_p
)
13451 bool sub_strict_overflow_p
;
13452 switch (TREE_CODE (t
))
13455 return !integer_zerop (t
);
13459 tree base
= TREE_OPERAND (t
, 0);
13461 if (!DECL_P (base
))
13462 base
= get_base_address (base
);
13467 /* For objects in symbol table check if we know they are non-zero.
13468 Don't do anything for variables and functions before symtab is built;
13469 it is quite possible that they will be declared weak later. */
13470 if (DECL_P (base
) && decl_in_symtab_p (base
))
13472 struct symtab_node
*symbol
;
13474 symbol
= symtab_node::get_create (base
);
13476 return symbol
->nonzero_address ();
13481 /* Function local objects are never NULL. */
13483 && (DECL_CONTEXT (base
)
13484 && TREE_CODE (DECL_CONTEXT (base
)) == FUNCTION_DECL
13485 && auto_var_in_fn_p (base
, DECL_CONTEXT (base
))))
13488 /* Constants are never weak. */
13489 if (CONSTANT_CLASS_P (base
))
13496 sub_strict_overflow_p
= false;
13497 if (tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 1),
13498 &sub_strict_overflow_p
)
13499 && tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 2),
13500 &sub_strict_overflow_p
))
13502 if (sub_strict_overflow_p
)
13503 *strict_overflow_p
= true;
13514 /* Given the components of a binary expression CODE, TYPE, OP0 and OP1,
13515 attempt to fold the expression to a constant without modifying TYPE,
13518 If the expression could be simplified to a constant, then return
13519 the constant. If the expression would not be simplified to a
13520 constant, then return NULL_TREE. */
13523 fold_binary_to_constant (enum tree_code code
, tree type
, tree op0
, tree op1
)
13525 tree tem
= fold_binary (code
, type
, op0
, op1
);
13526 return (tem
&& TREE_CONSTANT (tem
)) ? tem
: NULL_TREE
;
13529 /* Given the components of a unary expression CODE, TYPE and OP0,
13530 attempt to fold the expression to a constant without modifying
13533 If the expression could be simplified to a constant, then return
13534 the constant. If the expression would not be simplified to a
13535 constant, then return NULL_TREE. */
13538 fold_unary_to_constant (enum tree_code code
, tree type
, tree op0
)
13540 tree tem
= fold_unary (code
, type
, op0
);
13541 return (tem
&& TREE_CONSTANT (tem
)) ? tem
: NULL_TREE
;
13544 /* If EXP represents referencing an element in a constant string
13545 (either via pointer arithmetic or array indexing), return the
13546 tree representing the value accessed, otherwise return NULL. */
13549 fold_read_from_constant_string (tree exp
)
13551 if ((TREE_CODE (exp
) == INDIRECT_REF
13552 || TREE_CODE (exp
) == ARRAY_REF
)
13553 && TREE_CODE (TREE_TYPE (exp
)) == INTEGER_TYPE
)
13555 tree exp1
= TREE_OPERAND (exp
, 0);
13558 location_t loc
= EXPR_LOCATION (exp
);
13560 if (TREE_CODE (exp
) == INDIRECT_REF
)
13561 string
= string_constant (exp1
, &index
);
13564 tree low_bound
= array_ref_low_bound (exp
);
13565 index
= fold_convert_loc (loc
, sizetype
, TREE_OPERAND (exp
, 1));
13567 /* Optimize the special-case of a zero lower bound.
13569 We convert the low_bound to sizetype to avoid some problems
13570 with constant folding. (E.g. suppose the lower bound is 1,
13571 and its mode is QI. Without the conversion,l (ARRAY
13572 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
13573 +INDEX), which becomes (ARRAY+255+INDEX). Oops!) */
13574 if (! integer_zerop (low_bound
))
13575 index
= size_diffop_loc (loc
, index
,
13576 fold_convert_loc (loc
, sizetype
, low_bound
));
13582 && TYPE_MODE (TREE_TYPE (exp
)) == TYPE_MODE (TREE_TYPE (TREE_TYPE (string
)))
13583 && TREE_CODE (string
) == STRING_CST
13584 && TREE_CODE (index
) == INTEGER_CST
13585 && compare_tree_int (index
, TREE_STRING_LENGTH (string
)) < 0
13586 && (GET_MODE_CLASS (TYPE_MODE (TREE_TYPE (TREE_TYPE (string
))))
13588 && (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (string
)))) == 1))
13589 return build_int_cst_type (TREE_TYPE (exp
),
13590 (TREE_STRING_POINTER (string
)
13591 [TREE_INT_CST_LOW (index
)]));
13596 /* Return the tree for neg (ARG0) when ARG0 is known to be either
13597 an integer constant, real, or fixed-point constant.
13599 TYPE is the type of the result. */
13602 fold_negate_const (tree arg0
, tree type
)
13604 tree t
= NULL_TREE
;
13606 switch (TREE_CODE (arg0
))
13611 wide_int val
= wi::neg (arg0
, &overflow
);
13612 t
= force_fit_type (type
, val
, 1,
13613 (overflow
| TREE_OVERFLOW (arg0
))
13614 && !TYPE_UNSIGNED (type
));
13619 t
= build_real (type
, real_value_negate (&TREE_REAL_CST (arg0
)));
13624 FIXED_VALUE_TYPE f
;
13625 bool overflow_p
= fixed_arithmetic (&f
, NEGATE_EXPR
,
13626 &(TREE_FIXED_CST (arg0
)), NULL
,
13627 TYPE_SATURATING (type
));
13628 t
= build_fixed (type
, f
);
13629 /* Propagate overflow flags. */
13630 if (overflow_p
| TREE_OVERFLOW (arg0
))
13631 TREE_OVERFLOW (t
) = 1;
13636 gcc_unreachable ();
13642 /* Return the tree for abs (ARG0) when ARG0 is known to be either
13643 an integer constant or real constant.
13645 TYPE is the type of the result. */
13648 fold_abs_const (tree arg0
, tree type
)
13650 tree t
= NULL_TREE
;
13652 switch (TREE_CODE (arg0
))
13656 /* If the value is unsigned or non-negative, then the absolute value
13657 is the same as the ordinary value. */
13658 if (!wi::neg_p (arg0
, TYPE_SIGN (type
)))
13661 /* If the value is negative, then the absolute value is
13666 wide_int val
= wi::neg (arg0
, &overflow
);
13667 t
= force_fit_type (type
, val
, -1,
13668 overflow
| TREE_OVERFLOW (arg0
));
13674 if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg0
)))
13675 t
= build_real (type
, real_value_negate (&TREE_REAL_CST (arg0
)));
13681 gcc_unreachable ();
13687 /* Return the tree for not (ARG0) when ARG0 is known to be an integer
13688 constant. TYPE is the type of the result. */
13691 fold_not_const (const_tree arg0
, tree type
)
13693 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
);
13695 return force_fit_type (type
, wi::bit_not (arg0
), 0, TREE_OVERFLOW (arg0
));
13698 /* Given CODE, a relational operator, the target type, TYPE and two
13699 constant operands OP0 and OP1, return the result of the
13700 relational operation. If the result is not a compile time
13701 constant, then return NULL_TREE. */
13704 fold_relational_const (enum tree_code code
, tree type
, tree op0
, tree op1
)
13706 int result
, invert
;
13708 /* From here on, the only cases we handle are when the result is
13709 known to be a constant. */
13711 if (TREE_CODE (op0
) == REAL_CST
&& TREE_CODE (op1
) == REAL_CST
)
13713 const REAL_VALUE_TYPE
*c0
= TREE_REAL_CST_PTR (op0
);
13714 const REAL_VALUE_TYPE
*c1
= TREE_REAL_CST_PTR (op1
);
13716 /* Handle the cases where either operand is a NaN. */
13717 if (real_isnan (c0
) || real_isnan (c1
))
13727 case UNORDERED_EXPR
:
13741 if (flag_trapping_math
)
13747 gcc_unreachable ();
13750 return constant_boolean_node (result
, type
);
13753 return constant_boolean_node (real_compare (code
, c0
, c1
), type
);
13756 if (TREE_CODE (op0
) == FIXED_CST
&& TREE_CODE (op1
) == FIXED_CST
)
13758 const FIXED_VALUE_TYPE
*c0
= TREE_FIXED_CST_PTR (op0
);
13759 const FIXED_VALUE_TYPE
*c1
= TREE_FIXED_CST_PTR (op1
);
13760 return constant_boolean_node (fixed_compare (code
, c0
, c1
), type
);
13763 /* Handle equality/inequality of complex constants. */
13764 if (TREE_CODE (op0
) == COMPLEX_CST
&& TREE_CODE (op1
) == COMPLEX_CST
)
13766 tree rcond
= fold_relational_const (code
, type
,
13767 TREE_REALPART (op0
),
13768 TREE_REALPART (op1
));
13769 tree icond
= fold_relational_const (code
, type
,
13770 TREE_IMAGPART (op0
),
13771 TREE_IMAGPART (op1
));
13772 if (code
== EQ_EXPR
)
13773 return fold_build2 (TRUTH_ANDIF_EXPR
, type
, rcond
, icond
);
13774 else if (code
== NE_EXPR
)
13775 return fold_build2 (TRUTH_ORIF_EXPR
, type
, rcond
, icond
);
13780 if (TREE_CODE (op0
) == VECTOR_CST
&& TREE_CODE (op1
) == VECTOR_CST
)
13782 unsigned count
= VECTOR_CST_NELTS (op0
);
13783 tree
*elts
= XALLOCAVEC (tree
, count
);
13784 gcc_assert (VECTOR_CST_NELTS (op1
) == count
13785 && TYPE_VECTOR_SUBPARTS (type
) == count
);
13787 for (unsigned i
= 0; i
< count
; i
++)
13789 tree elem_type
= TREE_TYPE (type
);
13790 tree elem0
= VECTOR_CST_ELT (op0
, i
);
13791 tree elem1
= VECTOR_CST_ELT (op1
, i
);
13793 tree tem
= fold_relational_const (code
, elem_type
,
13796 if (tem
== NULL_TREE
)
13799 elts
[i
] = build_int_cst (elem_type
, integer_zerop (tem
) ? 0 : -1);
13802 return build_vector (type
, elts
);
13805 /* From here on we only handle LT, LE, GT, GE, EQ and NE.
13807 To compute GT, swap the arguments and do LT.
13808 To compute GE, do LT and invert the result.
13809 To compute LE, swap the arguments, do LT and invert the result.
13810 To compute NE, do EQ and invert the result.
13812 Therefore, the code below must handle only EQ and LT. */
13814 if (code
== LE_EXPR
|| code
== GT_EXPR
)
13816 std::swap (op0
, op1
);
13817 code
= swap_tree_comparison (code
);
13820 /* Note that it is safe to invert for real values here because we
13821 have already handled the one case that it matters. */
13824 if (code
== NE_EXPR
|| code
== GE_EXPR
)
13827 code
= invert_tree_comparison (code
, false);
13830 /* Compute a result for LT or EQ if args permit;
13831 Otherwise return T. */
13832 if (TREE_CODE (op0
) == INTEGER_CST
&& TREE_CODE (op1
) == INTEGER_CST
)
13834 if (code
== EQ_EXPR
)
13835 result
= tree_int_cst_equal (op0
, op1
);
13837 result
= tree_int_cst_lt (op0
, op1
);
13844 return constant_boolean_node (result
, type
);
13847 /* If necessary, return a CLEANUP_POINT_EXPR for EXPR with the
13848 indicated TYPE. If no CLEANUP_POINT_EXPR is necessary, return EXPR
13852 fold_build_cleanup_point_expr (tree type
, tree expr
)
13854 /* If the expression does not have side effects then we don't have to wrap
13855 it with a cleanup point expression. */
13856 if (!TREE_SIDE_EFFECTS (expr
))
13859 /* If the expression is a return, check to see if the expression inside the
13860 return has no side effects or the right hand side of the modify expression
13861 inside the return. If either don't have side effects set we don't need to
13862 wrap the expression in a cleanup point expression. Note we don't check the
13863 left hand side of the modify because it should always be a return decl. */
13864 if (TREE_CODE (expr
) == RETURN_EXPR
)
13866 tree op
= TREE_OPERAND (expr
, 0);
13867 if (!op
|| !TREE_SIDE_EFFECTS (op
))
13869 op
= TREE_OPERAND (op
, 1);
13870 if (!TREE_SIDE_EFFECTS (op
))
13874 return build1 (CLEANUP_POINT_EXPR
, type
, expr
);
13877 /* Given a pointer value OP0 and a type TYPE, return a simplified version
13878 of an indirection through OP0, or NULL_TREE if no simplification is
13882 fold_indirect_ref_1 (location_t loc
, tree type
, tree op0
)
13888 subtype
= TREE_TYPE (sub
);
13889 if (!POINTER_TYPE_P (subtype
))
13892 if (TREE_CODE (sub
) == ADDR_EXPR
)
13894 tree op
= TREE_OPERAND (sub
, 0);
13895 tree optype
= TREE_TYPE (op
);
13896 /* *&CONST_DECL -> to the value of the const decl. */
13897 if (TREE_CODE (op
) == CONST_DECL
)
13898 return DECL_INITIAL (op
);
13899 /* *&p => p; make sure to handle *&"str"[cst] here. */
13900 if (type
== optype
)
13902 tree fop
= fold_read_from_constant_string (op
);
13908 /* *(foo *)&fooarray => fooarray[0] */
13909 else if (TREE_CODE (optype
) == ARRAY_TYPE
13910 && type
== TREE_TYPE (optype
)
13911 && (!in_gimple_form
13912 || TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
))
13914 tree type_domain
= TYPE_DOMAIN (optype
);
13915 tree min_val
= size_zero_node
;
13916 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
13917 min_val
= TYPE_MIN_VALUE (type_domain
);
13919 && TREE_CODE (min_val
) != INTEGER_CST
)
13921 return build4_loc (loc
, ARRAY_REF
, type
, op
, min_val
,
13922 NULL_TREE
, NULL_TREE
);
13924 /* *(foo *)&complexfoo => __real__ complexfoo */
13925 else if (TREE_CODE (optype
) == COMPLEX_TYPE
13926 && type
== TREE_TYPE (optype
))
13927 return fold_build1_loc (loc
, REALPART_EXPR
, type
, op
);
13928 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
13929 else if (TREE_CODE (optype
) == VECTOR_TYPE
13930 && type
== TREE_TYPE (optype
))
13932 tree part_width
= TYPE_SIZE (type
);
13933 tree index
= bitsize_int (0);
13934 return fold_build3_loc (loc
, BIT_FIELD_REF
, type
, op
, part_width
, index
);
13938 if (TREE_CODE (sub
) == POINTER_PLUS_EXPR
13939 && TREE_CODE (TREE_OPERAND (sub
, 1)) == INTEGER_CST
)
13941 tree op00
= TREE_OPERAND (sub
, 0);
13942 tree op01
= TREE_OPERAND (sub
, 1);
13945 if (TREE_CODE (op00
) == ADDR_EXPR
)
13948 op00
= TREE_OPERAND (op00
, 0);
13949 op00type
= TREE_TYPE (op00
);
13951 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
13952 if (TREE_CODE (op00type
) == VECTOR_TYPE
13953 && type
== TREE_TYPE (op00type
))
13955 HOST_WIDE_INT offset
= tree_to_shwi (op01
);
13956 tree part_width
= TYPE_SIZE (type
);
13957 unsigned HOST_WIDE_INT part_widthi
= tree_to_shwi (part_width
)/BITS_PER_UNIT
;
13958 unsigned HOST_WIDE_INT indexi
= offset
* BITS_PER_UNIT
;
13959 tree index
= bitsize_int (indexi
);
13961 if (offset
/ part_widthi
< TYPE_VECTOR_SUBPARTS (op00type
))
13962 return fold_build3_loc (loc
,
13963 BIT_FIELD_REF
, type
, op00
,
13964 part_width
, index
);
13967 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
13968 else if (TREE_CODE (op00type
) == COMPLEX_TYPE
13969 && type
== TREE_TYPE (op00type
))
13971 tree size
= TYPE_SIZE_UNIT (type
);
13972 if (tree_int_cst_equal (size
, op01
))
13973 return fold_build1_loc (loc
, IMAGPART_EXPR
, type
, op00
);
13975 /* ((foo *)&fooarray)[1] => fooarray[1] */
13976 else if (TREE_CODE (op00type
) == ARRAY_TYPE
13977 && type
== TREE_TYPE (op00type
))
13979 tree type_domain
= TYPE_DOMAIN (op00type
);
13980 tree min_val
= size_zero_node
;
13981 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
13982 min_val
= TYPE_MIN_VALUE (type_domain
);
13983 op01
= size_binop_loc (loc
, EXACT_DIV_EXPR
, op01
,
13984 TYPE_SIZE_UNIT (type
));
13985 op01
= size_binop_loc (loc
, PLUS_EXPR
, op01
, min_val
);
13986 return build4_loc (loc
, ARRAY_REF
, type
, op00
, op01
,
13987 NULL_TREE
, NULL_TREE
);
13992 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
13993 if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
13994 && type
== TREE_TYPE (TREE_TYPE (subtype
))
13995 && (!in_gimple_form
13996 || TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
))
13999 tree min_val
= size_zero_node
;
14000 sub
= build_fold_indirect_ref_loc (loc
, sub
);
14001 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
14002 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
14003 min_val
= TYPE_MIN_VALUE (type_domain
);
14005 && TREE_CODE (min_val
) != INTEGER_CST
)
14007 return build4_loc (loc
, ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
,
14014 /* Builds an expression for an indirection through T, simplifying some
14018 build_fold_indirect_ref_loc (location_t loc
, tree t
)
14020 tree type
= TREE_TYPE (TREE_TYPE (t
));
14021 tree sub
= fold_indirect_ref_1 (loc
, type
, t
);
14026 return build1_loc (loc
, INDIRECT_REF
, type
, t
);
14029 /* Given an INDIRECT_REF T, return either T or a simplified version. */
14032 fold_indirect_ref_loc (location_t loc
, tree t
)
14034 tree sub
= fold_indirect_ref_1 (loc
, TREE_TYPE (t
), TREE_OPERAND (t
, 0));
14042 /* Strip non-trapping, non-side-effecting tree nodes from an expression
14043 whose result is ignored. The type of the returned tree need not be
14044 the same as the original expression. */
14047 fold_ignored_result (tree t
)
14049 if (!TREE_SIDE_EFFECTS (t
))
14050 return integer_zero_node
;
14053 switch (TREE_CODE_CLASS (TREE_CODE (t
)))
14056 t
= TREE_OPERAND (t
, 0);
14060 case tcc_comparison
:
14061 if (!TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 1)))
14062 t
= TREE_OPERAND (t
, 0);
14063 else if (!TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 0)))
14064 t
= TREE_OPERAND (t
, 1);
14069 case tcc_expression
:
14070 switch (TREE_CODE (t
))
14072 case COMPOUND_EXPR
:
14073 if (TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 1)))
14075 t
= TREE_OPERAND (t
, 0);
14079 if (TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 1))
14080 || TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 2)))
14082 t
= TREE_OPERAND (t
, 0);
14095 /* Return the value of VALUE, rounded up to a multiple of DIVISOR. */
14098 round_up_loc (location_t loc
, tree value
, unsigned int divisor
)
14100 tree div
= NULL_TREE
;
14105 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
14106 have to do anything. Only do this when we are not given a const,
14107 because in that case, this check is more expensive than just
14109 if (TREE_CODE (value
) != INTEGER_CST
)
14111 div
= build_int_cst (TREE_TYPE (value
), divisor
);
14113 if (multiple_of_p (TREE_TYPE (value
), value
, div
))
14117 /* If divisor is a power of two, simplify this to bit manipulation. */
14118 if (divisor
== (divisor
& -divisor
))
14120 if (TREE_CODE (value
) == INTEGER_CST
)
14122 wide_int val
= value
;
14125 if ((val
& (divisor
- 1)) == 0)
14128 overflow_p
= TREE_OVERFLOW (value
);
14129 val
+= divisor
- 1;
14130 val
&= - (int) divisor
;
14134 return force_fit_type (TREE_TYPE (value
), val
, -1, overflow_p
);
14140 t
= build_int_cst (TREE_TYPE (value
), divisor
- 1);
14141 value
= size_binop_loc (loc
, PLUS_EXPR
, value
, t
);
14142 t
= build_int_cst (TREE_TYPE (value
), - (int) divisor
);
14143 value
= size_binop_loc (loc
, BIT_AND_EXPR
, value
, t
);
14149 div
= build_int_cst (TREE_TYPE (value
), divisor
);
14150 value
= size_binop_loc (loc
, CEIL_DIV_EXPR
, value
, div
);
14151 value
= size_binop_loc (loc
, MULT_EXPR
, value
, div
);
14157 /* Likewise, but round down. */
14160 round_down_loc (location_t loc
, tree value
, int divisor
)
14162 tree div
= NULL_TREE
;
14164 gcc_assert (divisor
> 0);
14168 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
14169 have to do anything. Only do this when we are not given a const,
14170 because in that case, this check is more expensive than just
14172 if (TREE_CODE (value
) != INTEGER_CST
)
14174 div
= build_int_cst (TREE_TYPE (value
), divisor
);
14176 if (multiple_of_p (TREE_TYPE (value
), value
, div
))
14180 /* If divisor is a power of two, simplify this to bit manipulation. */
14181 if (divisor
== (divisor
& -divisor
))
14185 t
= build_int_cst (TREE_TYPE (value
), -divisor
);
14186 value
= size_binop_loc (loc
, BIT_AND_EXPR
, value
, t
);
14191 div
= build_int_cst (TREE_TYPE (value
), divisor
);
14192 value
= size_binop_loc (loc
, FLOOR_DIV_EXPR
, value
, div
);
14193 value
= size_binop_loc (loc
, MULT_EXPR
, value
, div
);
14199 /* Returns the pointer to the base of the object addressed by EXP and
14200 extracts the information about the offset of the access, storing it
14201 to PBITPOS and POFFSET. */
14204 split_address_to_core_and_offset (tree exp
,
14205 HOST_WIDE_INT
*pbitpos
, tree
*poffset
)
14209 int unsignedp
, volatilep
;
14210 HOST_WIDE_INT bitsize
;
14211 location_t loc
= EXPR_LOCATION (exp
);
14213 if (TREE_CODE (exp
) == ADDR_EXPR
)
14215 core
= get_inner_reference (TREE_OPERAND (exp
, 0), &bitsize
, pbitpos
,
14216 poffset
, &mode
, &unsignedp
, &volatilep
,
14218 core
= build_fold_addr_expr_loc (loc
, core
);
14224 *poffset
= NULL_TREE
;
14230 /* Returns true if addresses of E1 and E2 differ by a constant, false
14231 otherwise. If they do, E1 - E2 is stored in *DIFF. */
14234 ptr_difference_const (tree e1
, tree e2
, HOST_WIDE_INT
*diff
)
14237 HOST_WIDE_INT bitpos1
, bitpos2
;
14238 tree toffset1
, toffset2
, tdiff
, type
;
14240 core1
= split_address_to_core_and_offset (e1
, &bitpos1
, &toffset1
);
14241 core2
= split_address_to_core_and_offset (e2
, &bitpos2
, &toffset2
);
14243 if (bitpos1
% BITS_PER_UNIT
!= 0
14244 || bitpos2
% BITS_PER_UNIT
!= 0
14245 || !operand_equal_p (core1
, core2
, 0))
14248 if (toffset1
&& toffset2
)
14250 type
= TREE_TYPE (toffset1
);
14251 if (type
!= TREE_TYPE (toffset2
))
14252 toffset2
= fold_convert (type
, toffset2
);
14254 tdiff
= fold_build2 (MINUS_EXPR
, type
, toffset1
, toffset2
);
14255 if (!cst_and_fits_in_hwi (tdiff
))
14258 *diff
= int_cst_value (tdiff
);
14260 else if (toffset1
|| toffset2
)
14262 /* If only one of the offsets is non-constant, the difference cannot
14269 *diff
+= (bitpos1
- bitpos2
) / BITS_PER_UNIT
;
14273 /* Simplify the floating point expression EXP when the sign of the
14274 result is not significant. Return NULL_TREE if no simplification
14278 fold_strip_sign_ops (tree exp
)
14281 location_t loc
= EXPR_LOCATION (exp
);
14283 switch (TREE_CODE (exp
))
14287 arg0
= fold_strip_sign_ops (TREE_OPERAND (exp
, 0));
14288 return arg0
? arg0
: TREE_OPERAND (exp
, 0);
14292 if (HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (exp
)))
14294 arg0
= fold_strip_sign_ops (TREE_OPERAND (exp
, 0));
14295 arg1
= fold_strip_sign_ops (TREE_OPERAND (exp
, 1));
14296 if (arg0
!= NULL_TREE
|| arg1
!= NULL_TREE
)
14297 return fold_build2_loc (loc
, TREE_CODE (exp
), TREE_TYPE (exp
),
14298 arg0
? arg0
: TREE_OPERAND (exp
, 0),
14299 arg1
? arg1
: TREE_OPERAND (exp
, 1));
14302 case COMPOUND_EXPR
:
14303 arg0
= TREE_OPERAND (exp
, 0);
14304 arg1
= fold_strip_sign_ops (TREE_OPERAND (exp
, 1));
14306 return fold_build2_loc (loc
, COMPOUND_EXPR
, TREE_TYPE (exp
), arg0
, arg1
);
14310 arg0
= fold_strip_sign_ops (TREE_OPERAND (exp
, 1));
14311 arg1
= fold_strip_sign_ops (TREE_OPERAND (exp
, 2));
14313 return fold_build3_loc (loc
,
14314 COND_EXPR
, TREE_TYPE (exp
), TREE_OPERAND (exp
, 0),
14315 arg0
? arg0
: TREE_OPERAND (exp
, 1),
14316 arg1
? arg1
: TREE_OPERAND (exp
, 2));
14321 const enum built_in_function fcode
= builtin_mathfn_code (exp
);
14324 CASE_FLT_FN (BUILT_IN_COPYSIGN
):
14325 /* Strip copysign function call, return the 1st argument. */
14326 arg0
= CALL_EXPR_ARG (exp
, 0);
14327 arg1
= CALL_EXPR_ARG (exp
, 1);
14328 return omit_one_operand_loc (loc
, TREE_TYPE (exp
), arg0
, arg1
);
14331 /* Strip sign ops from the argument of "odd" math functions. */
14332 if (negate_mathfn_p (fcode
))
14334 arg0
= fold_strip_sign_ops (CALL_EXPR_ARG (exp
, 0));
14336 return build_call_expr_loc (loc
, get_callee_fndecl (exp
), 1, arg0
);
14349 /* Return OFF converted to a pointer offset type suitable as offset for
14350 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
14352 convert_to_ptrofftype_loc (location_t loc
, tree off
)
14354 return fold_convert_loc (loc
, sizetype
, off
);
14357 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
14359 fold_build_pointer_plus_loc (location_t loc
, tree ptr
, tree off
)
14361 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
14362 ptr
, convert_to_ptrofftype_loc (loc
, off
));
14365 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
14367 fold_build_pointer_plus_hwi_loc (location_t loc
, tree ptr
, HOST_WIDE_INT off
)
14369 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
14370 ptr
, size_int (off
));