1 /* Fold a constant sub-tree into a single node for C-compiler
2 Copyright (C) 1987-2016 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 "tree-ssa-operands.h"
54 #include "optabs-query.h"
56 #include "diagnostic-core.h"
59 #include "fold-const.h"
60 #include "fold-const-call.h"
61 #include "stor-layout.h"
63 #include "tree-iterator.h"
66 #include "langhooks.h"
71 #include "generic-match.h"
72 #include "gimple-fold.h"
74 #include "tree-into-ssa.h"
76 #include "case-cfn-macros.h"
77 #include "stringpool.h"
78 #include "tree-ssanames.h"
80 #ifndef LOAD_EXTEND_OP
81 #define LOAD_EXTEND_OP(M) UNKNOWN
84 /* Nonzero if we are folding constants inside an initializer; zero
86 int folding_initializer
= 0;
88 /* The following constants represent a bit based encoding of GCC's
89 comparison operators. This encoding simplifies transformations
90 on relational comparison operators, such as AND and OR. */
91 enum comparison_code
{
110 static bool negate_expr_p (tree
);
111 static tree
negate_expr (tree
);
112 static tree
split_tree (location_t
, tree
, tree
, enum tree_code
,
113 tree
*, tree
*, tree
*, int);
114 static tree
associate_trees (location_t
, tree
, tree
, enum tree_code
, tree
);
115 static enum comparison_code
comparison_to_compcode (enum tree_code
);
116 static enum tree_code
compcode_to_comparison (enum comparison_code
);
117 static int operand_equal_for_comparison_p (tree
, tree
, tree
);
118 static int twoval_comparison_p (tree
, tree
*, tree
*, int *);
119 static tree
eval_subst (location_t
, tree
, tree
, tree
, tree
, tree
);
120 static tree
make_bit_field_ref (location_t
, tree
, tree
,
121 HOST_WIDE_INT
, HOST_WIDE_INT
, int, int);
122 static tree
optimize_bit_field_compare (location_t
, enum tree_code
,
124 static tree
decode_field_reference (location_t
, tree
, HOST_WIDE_INT
*,
126 machine_mode
*, int *, int *, int *,
128 static int simple_operand_p (const_tree
);
129 static bool simple_operand_p_2 (tree
);
130 static tree
range_binop (enum tree_code
, tree
, tree
, int, tree
, int);
131 static tree
range_predecessor (tree
);
132 static tree
range_successor (tree
);
133 static tree
fold_range_test (location_t
, enum tree_code
, tree
, tree
, tree
);
134 static tree
fold_cond_expr_with_comparison (location_t
, tree
, tree
, tree
, tree
);
135 static tree
unextend (tree
, int, int, tree
);
136 static tree
optimize_minmax_comparison (location_t
, enum tree_code
,
138 static tree
extract_muldiv (tree
, tree
, enum tree_code
, tree
, bool *);
139 static tree
extract_muldiv_1 (tree
, tree
, enum tree_code
, tree
, bool *);
140 static tree
fold_binary_op_with_conditional_arg (location_t
,
141 enum tree_code
, tree
,
144 static tree
fold_div_compare (location_t
, enum tree_code
, tree
, tree
, tree
);
145 static bool reorder_operands_p (const_tree
, const_tree
);
146 static tree
fold_negate_const (tree
, tree
);
147 static tree
fold_not_const (const_tree
, tree
);
148 static tree
fold_relational_const (enum tree_code
, tree
, tree
, tree
);
149 static tree
fold_convert_const (enum tree_code
, tree
, tree
);
150 static tree
fold_view_convert_expr (tree
, tree
);
151 static bool vec_cst_ctor_to_array (tree
, tree
*);
154 /* Return EXPR_LOCATION of T if it is not UNKNOWN_LOCATION.
155 Otherwise, return LOC. */
158 expr_location_or (tree t
, location_t loc
)
160 location_t tloc
= EXPR_LOCATION (t
);
161 return tloc
== UNKNOWN_LOCATION
? loc
: tloc
;
164 /* Similar to protected_set_expr_location, but never modify x in place,
165 if location can and needs to be set, unshare it. */
168 protected_set_expr_location_unshare (tree x
, location_t loc
)
170 if (CAN_HAVE_LOCATION_P (x
)
171 && EXPR_LOCATION (x
) != loc
172 && !(TREE_CODE (x
) == SAVE_EXPR
173 || TREE_CODE (x
) == TARGET_EXPR
174 || TREE_CODE (x
) == BIND_EXPR
))
177 SET_EXPR_LOCATION (x
, loc
);
182 /* If ARG2 divides ARG1 with zero remainder, carries out the exact
183 division and returns the quotient. Otherwise returns
187 div_if_zero_remainder (const_tree arg1
, const_tree arg2
)
191 if (wi::multiple_of_p (wi::to_widest (arg1
), wi::to_widest (arg2
),
193 return wide_int_to_tree (TREE_TYPE (arg1
), quo
);
198 /* This is nonzero if we should defer warnings about undefined
199 overflow. This facility exists because these warnings are a
200 special case. The code to estimate loop iterations does not want
201 to issue any warnings, since it works with expressions which do not
202 occur in user code. Various bits of cleanup code call fold(), but
203 only use the result if it has certain characteristics (e.g., is a
204 constant); that code only wants to issue a warning if the result is
207 static int fold_deferring_overflow_warnings
;
209 /* If a warning about undefined overflow is deferred, this is the
210 warning. Note that this may cause us to turn two warnings into
211 one, but that is fine since it is sufficient to only give one
212 warning per expression. */
214 static const char* fold_deferred_overflow_warning
;
216 /* If a warning about undefined overflow is deferred, this is the
217 level at which the warning should be emitted. */
219 static enum warn_strict_overflow_code fold_deferred_overflow_code
;
221 /* Start deferring overflow warnings. We could use a stack here to
222 permit nested calls, but at present it is not necessary. */
225 fold_defer_overflow_warnings (void)
227 ++fold_deferring_overflow_warnings
;
230 /* Stop deferring overflow warnings. If there is a pending warning,
231 and ISSUE is true, then issue the warning if appropriate. STMT is
232 the statement with which the warning should be associated (used for
233 location information); STMT may be NULL. CODE is the level of the
234 warning--a warn_strict_overflow_code value. This function will use
235 the smaller of CODE and the deferred code when deciding whether to
236 issue the warning. CODE may be zero to mean to always use the
240 fold_undefer_overflow_warnings (bool issue
, const gimple
*stmt
, int code
)
245 gcc_assert (fold_deferring_overflow_warnings
> 0);
246 --fold_deferring_overflow_warnings
;
247 if (fold_deferring_overflow_warnings
> 0)
249 if (fold_deferred_overflow_warning
!= NULL
251 && code
< (int) fold_deferred_overflow_code
)
252 fold_deferred_overflow_code
= (enum warn_strict_overflow_code
) code
;
256 warnmsg
= fold_deferred_overflow_warning
;
257 fold_deferred_overflow_warning
= NULL
;
259 if (!issue
|| warnmsg
== NULL
)
262 if (gimple_no_warning_p (stmt
))
265 /* Use the smallest code level when deciding to issue the
267 if (code
== 0 || code
> (int) fold_deferred_overflow_code
)
268 code
= fold_deferred_overflow_code
;
270 if (!issue_strict_overflow_warning (code
))
274 locus
= input_location
;
276 locus
= gimple_location (stmt
);
277 warning_at (locus
, OPT_Wstrict_overflow
, "%s", warnmsg
);
280 /* Stop deferring overflow warnings, ignoring any deferred
284 fold_undefer_and_ignore_overflow_warnings (void)
286 fold_undefer_overflow_warnings (false, NULL
, 0);
289 /* Whether we are deferring overflow warnings. */
292 fold_deferring_overflow_warnings_p (void)
294 return fold_deferring_overflow_warnings
> 0;
297 /* This is called when we fold something based on the fact that signed
298 overflow is undefined. */
301 fold_overflow_warning (const char* gmsgid
, enum warn_strict_overflow_code wc
)
303 if (fold_deferring_overflow_warnings
> 0)
305 if (fold_deferred_overflow_warning
== NULL
306 || wc
< fold_deferred_overflow_code
)
308 fold_deferred_overflow_warning
= gmsgid
;
309 fold_deferred_overflow_code
= wc
;
312 else if (issue_strict_overflow_warning (wc
))
313 warning (OPT_Wstrict_overflow
, gmsgid
);
316 /* Return true if the built-in mathematical function specified by CODE
317 is odd, i.e. -f(x) == f(-x). */
320 negate_mathfn_p (combined_fn fn
)
353 return !flag_rounding_math
;
361 /* Check whether we may negate an integer constant T without causing
365 may_negate_without_overflow_p (const_tree t
)
369 gcc_assert (TREE_CODE (t
) == INTEGER_CST
);
371 type
= TREE_TYPE (t
);
372 if (TYPE_UNSIGNED (type
))
375 return !wi::only_sign_bit_p (t
);
378 /* Determine whether an expression T can be cheaply negated using
379 the function negate_expr without introducing undefined overflow. */
382 negate_expr_p (tree t
)
389 type
= TREE_TYPE (t
);
392 switch (TREE_CODE (t
))
395 if (INTEGRAL_TYPE_P (type
) && TYPE_OVERFLOW_WRAPS (type
))
398 /* Check that -CST will not overflow type. */
399 return may_negate_without_overflow_p (t
);
401 return (INTEGRAL_TYPE_P (type
)
402 && TYPE_OVERFLOW_WRAPS (type
));
408 return !TYPE_OVERFLOW_SANITIZED (type
);
411 /* We want to canonicalize to positive real constants. Pretend
412 that only negative ones can be easily negated. */
413 return REAL_VALUE_NEGATIVE (TREE_REAL_CST (t
));
416 return negate_expr_p (TREE_REALPART (t
))
417 && negate_expr_p (TREE_IMAGPART (t
));
421 if (FLOAT_TYPE_P (TREE_TYPE (type
)) || TYPE_OVERFLOW_WRAPS (type
))
424 int count
= TYPE_VECTOR_SUBPARTS (type
), i
;
426 for (i
= 0; i
< count
; i
++)
427 if (!negate_expr_p (VECTOR_CST_ELT (t
, i
)))
434 return negate_expr_p (TREE_OPERAND (t
, 0))
435 && negate_expr_p (TREE_OPERAND (t
, 1));
438 return negate_expr_p (TREE_OPERAND (t
, 0));
441 if (HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
442 || HONOR_SIGNED_ZEROS (element_mode (type
))
443 || (INTEGRAL_TYPE_P (type
)
444 && ! TYPE_OVERFLOW_WRAPS (type
)))
446 /* -(A + B) -> (-B) - A. */
447 if (negate_expr_p (TREE_OPERAND (t
, 1))
448 && reorder_operands_p (TREE_OPERAND (t
, 0),
449 TREE_OPERAND (t
, 1)))
451 /* -(A + B) -> (-A) - B. */
452 return negate_expr_p (TREE_OPERAND (t
, 0));
455 /* We can't turn -(A-B) into B-A when we honor signed zeros. */
456 return !HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
457 && !HONOR_SIGNED_ZEROS (element_mode (type
))
458 && (! INTEGRAL_TYPE_P (type
)
459 || TYPE_OVERFLOW_WRAPS (type
))
460 && reorder_operands_p (TREE_OPERAND (t
, 0),
461 TREE_OPERAND (t
, 1));
464 if (TYPE_UNSIGNED (type
))
466 /* INT_MIN/n * n doesn't overflow while negating one operand it does
467 if n is a power of two. */
468 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
469 && ! TYPE_OVERFLOW_WRAPS (TREE_TYPE (t
))
470 && ! ((TREE_CODE (TREE_OPERAND (t
, 0)) == INTEGER_CST
471 && ! integer_pow2p (TREE_OPERAND (t
, 0)))
472 || (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
473 && ! integer_pow2p (TREE_OPERAND (t
, 1)))))
479 if (! HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (TREE_TYPE (t
))))
480 return negate_expr_p (TREE_OPERAND (t
, 1))
481 || negate_expr_p (TREE_OPERAND (t
, 0));
487 if (TYPE_UNSIGNED (type
))
489 if (negate_expr_p (TREE_OPERAND (t
, 0)))
491 /* In general we can't negate B in A / B, because if A is INT_MIN and
492 B is 1, we may turn this into INT_MIN / -1 which is undefined
493 and actually traps on some architectures. */
494 if (! INTEGRAL_TYPE_P (TREE_TYPE (t
))
495 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (t
))
496 || (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
497 && ! integer_onep (TREE_OPERAND (t
, 1))))
498 return negate_expr_p (TREE_OPERAND (t
, 1));
502 /* Negate -((double)float) as (double)(-float). */
503 if (TREE_CODE (type
) == REAL_TYPE
)
505 tree tem
= strip_float_extensions (t
);
507 return negate_expr_p (tem
);
512 /* Negate -f(x) as f(-x). */
513 if (negate_mathfn_p (get_call_combined_fn (t
)))
514 return negate_expr_p (CALL_EXPR_ARG (t
, 0));
518 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
519 if (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
)
521 tree op1
= TREE_OPERAND (t
, 1);
522 if (wi::eq_p (op1
, TYPE_PRECISION (type
) - 1))
533 /* Given T, an expression, return a folded tree for -T or NULL_TREE, if no
534 simplification is possible.
535 If negate_expr_p would return true for T, NULL_TREE will never be
539 fold_negate_expr (location_t loc
, tree t
)
541 tree type
= TREE_TYPE (t
);
544 switch (TREE_CODE (t
))
546 /* Convert - (~A) to A + 1. */
548 if (INTEGRAL_TYPE_P (type
))
549 return fold_build2_loc (loc
, PLUS_EXPR
, type
, TREE_OPERAND (t
, 0),
550 build_one_cst (type
));
554 tem
= fold_negate_const (t
, type
);
555 if (TREE_OVERFLOW (tem
) == TREE_OVERFLOW (t
)
556 || (ANY_INTEGRAL_TYPE_P (type
)
557 && !TYPE_OVERFLOW_TRAPS (type
)
558 && TYPE_OVERFLOW_WRAPS (type
))
559 || (flag_sanitize
& SANITIZE_SI_OVERFLOW
) == 0)
564 tem
= fold_negate_const (t
, type
);
568 tem
= fold_negate_const (t
, type
);
573 tree rpart
= fold_negate_expr (loc
, TREE_REALPART (t
));
574 tree ipart
= fold_negate_expr (loc
, TREE_IMAGPART (t
));
576 return build_complex (type
, rpart
, ipart
);
582 int count
= TYPE_VECTOR_SUBPARTS (type
), i
;
583 tree
*elts
= XALLOCAVEC (tree
, count
);
585 for (i
= 0; i
< count
; i
++)
587 elts
[i
] = fold_negate_expr (loc
, VECTOR_CST_ELT (t
, i
));
588 if (elts
[i
] == NULL_TREE
)
592 return build_vector (type
, elts
);
596 if (negate_expr_p (t
))
597 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
598 fold_negate_expr (loc
, TREE_OPERAND (t
, 0)),
599 fold_negate_expr (loc
, TREE_OPERAND (t
, 1)));
603 if (negate_expr_p (t
))
604 return fold_build1_loc (loc
, CONJ_EXPR
, type
,
605 fold_negate_expr (loc
, TREE_OPERAND (t
, 0)));
609 if (!TYPE_OVERFLOW_SANITIZED (type
))
610 return TREE_OPERAND (t
, 0);
614 if (!HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
615 && !HONOR_SIGNED_ZEROS (element_mode (type
)))
617 /* -(A + B) -> (-B) - A. */
618 if (negate_expr_p (TREE_OPERAND (t
, 1))
619 && reorder_operands_p (TREE_OPERAND (t
, 0),
620 TREE_OPERAND (t
, 1)))
622 tem
= negate_expr (TREE_OPERAND (t
, 1));
623 return fold_build2_loc (loc
, MINUS_EXPR
, type
,
624 tem
, TREE_OPERAND (t
, 0));
627 /* -(A + B) -> (-A) - B. */
628 if (negate_expr_p (TREE_OPERAND (t
, 0)))
630 tem
= negate_expr (TREE_OPERAND (t
, 0));
631 return fold_build2_loc (loc
, MINUS_EXPR
, type
,
632 tem
, TREE_OPERAND (t
, 1));
638 /* - (A - B) -> B - A */
639 if (!HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
640 && !HONOR_SIGNED_ZEROS (element_mode (type
))
641 && reorder_operands_p (TREE_OPERAND (t
, 0), TREE_OPERAND (t
, 1)))
642 return fold_build2_loc (loc
, MINUS_EXPR
, type
,
643 TREE_OPERAND (t
, 1), TREE_OPERAND (t
, 0));
647 if (TYPE_UNSIGNED (type
))
653 if (! HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
)))
655 tem
= TREE_OPERAND (t
, 1);
656 if (negate_expr_p (tem
))
657 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
658 TREE_OPERAND (t
, 0), negate_expr (tem
));
659 tem
= TREE_OPERAND (t
, 0);
660 if (negate_expr_p (tem
))
661 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
662 negate_expr (tem
), TREE_OPERAND (t
, 1));
669 if (TYPE_UNSIGNED (type
))
671 if (negate_expr_p (TREE_OPERAND (t
, 0)))
672 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
673 negate_expr (TREE_OPERAND (t
, 0)),
674 TREE_OPERAND (t
, 1));
675 /* In general we can't negate B in A / B, because if A is INT_MIN and
676 B is 1, we may turn this into INT_MIN / -1 which is undefined
677 and actually traps on some architectures. */
678 if ((! INTEGRAL_TYPE_P (TREE_TYPE (t
))
679 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (t
))
680 || (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
681 && ! integer_onep (TREE_OPERAND (t
, 1))))
682 && negate_expr_p (TREE_OPERAND (t
, 1)))
683 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
685 negate_expr (TREE_OPERAND (t
, 1)));
689 /* Convert -((double)float) into (double)(-float). */
690 if (TREE_CODE (type
) == REAL_TYPE
)
692 tem
= strip_float_extensions (t
);
693 if (tem
!= t
&& negate_expr_p (tem
))
694 return fold_convert_loc (loc
, type
, negate_expr (tem
));
699 /* Negate -f(x) as f(-x). */
700 if (negate_mathfn_p (get_call_combined_fn (t
))
701 && negate_expr_p (CALL_EXPR_ARG (t
, 0)))
705 fndecl
= get_callee_fndecl (t
);
706 arg
= negate_expr (CALL_EXPR_ARG (t
, 0));
707 return build_call_expr_loc (loc
, fndecl
, 1, arg
);
712 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
713 if (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
)
715 tree op1
= TREE_OPERAND (t
, 1);
716 if (wi::eq_p (op1
, TYPE_PRECISION (type
) - 1))
718 tree ntype
= TYPE_UNSIGNED (type
)
719 ? signed_type_for (type
)
720 : unsigned_type_for (type
);
721 tree temp
= fold_convert_loc (loc
, ntype
, TREE_OPERAND (t
, 0));
722 temp
= fold_build2_loc (loc
, RSHIFT_EXPR
, ntype
, temp
, op1
);
723 return fold_convert_loc (loc
, type
, temp
);
735 /* Like fold_negate_expr, but return a NEGATE_EXPR tree, if T can not be
736 negated in a simpler way. Also allow for T to be NULL_TREE, in which case
748 loc
= EXPR_LOCATION (t
);
749 type
= TREE_TYPE (t
);
752 tem
= fold_negate_expr (loc
, t
);
754 tem
= build1_loc (loc
, NEGATE_EXPR
, TREE_TYPE (t
), t
);
755 return fold_convert_loc (loc
, type
, tem
);
758 /* Split a tree IN into a constant, literal and variable parts that could be
759 combined with CODE to make IN. "constant" means an expression with
760 TREE_CONSTANT but that isn't an actual constant. CODE must be a
761 commutative arithmetic operation. Store the constant part into *CONP,
762 the literal in *LITP and return the variable part. If a part isn't
763 present, set it to null. If the tree does not decompose in this way,
764 return the entire tree as the variable part and the other parts as null.
766 If CODE is PLUS_EXPR we also split trees that use MINUS_EXPR. In that
767 case, we negate an operand that was subtracted. Except if it is a
768 literal for which we use *MINUS_LITP instead.
770 If NEGATE_P is true, we are negating all of IN, again except a literal
771 for which we use *MINUS_LITP instead. If a variable part is of pointer
772 type, it is negated after converting to TYPE. This prevents us from
773 generating illegal MINUS pointer expression. LOC is the location of
774 the converted variable part.
776 If IN is itself a literal or constant, return it as appropriate.
778 Note that we do not guarantee that any of the three values will be the
779 same type as IN, but they will have the same signedness and mode. */
782 split_tree (location_t loc
, tree in
, tree type
, enum tree_code code
,
783 tree
*conp
, tree
*litp
, tree
*minus_litp
, int negate_p
)
791 /* Strip any conversions that don't change the machine mode or signedness. */
792 STRIP_SIGN_NOPS (in
);
794 if (TREE_CODE (in
) == INTEGER_CST
|| TREE_CODE (in
) == REAL_CST
795 || TREE_CODE (in
) == FIXED_CST
)
797 else if (TREE_CODE (in
) == code
798 || ((! FLOAT_TYPE_P (TREE_TYPE (in
)) || flag_associative_math
)
799 && ! SAT_FIXED_POINT_TYPE_P (TREE_TYPE (in
))
800 /* We can associate addition and subtraction together (even
801 though the C standard doesn't say so) for integers because
802 the value is not affected. For reals, the value might be
803 affected, so we can't. */
804 && ((code
== PLUS_EXPR
&& TREE_CODE (in
) == MINUS_EXPR
)
805 || (code
== MINUS_EXPR
&& TREE_CODE (in
) == PLUS_EXPR
))))
807 tree op0
= TREE_OPERAND (in
, 0);
808 tree op1
= TREE_OPERAND (in
, 1);
809 int neg1_p
= TREE_CODE (in
) == MINUS_EXPR
;
810 int neg_litp_p
= 0, neg_conp_p
= 0, neg_var_p
= 0;
812 /* First see if either of the operands is a literal, then a constant. */
813 if (TREE_CODE (op0
) == INTEGER_CST
|| TREE_CODE (op0
) == REAL_CST
814 || TREE_CODE (op0
) == FIXED_CST
)
815 *litp
= op0
, op0
= 0;
816 else if (TREE_CODE (op1
) == INTEGER_CST
|| TREE_CODE (op1
) == REAL_CST
817 || TREE_CODE (op1
) == FIXED_CST
)
818 *litp
= op1
, neg_litp_p
= neg1_p
, op1
= 0;
820 if (op0
!= 0 && TREE_CONSTANT (op0
))
821 *conp
= op0
, op0
= 0;
822 else if (op1
!= 0 && TREE_CONSTANT (op1
))
823 *conp
= op1
, neg_conp_p
= neg1_p
, op1
= 0;
825 /* If we haven't dealt with either operand, this is not a case we can
826 decompose. Otherwise, VAR is either of the ones remaining, if any. */
827 if (op0
!= 0 && op1
!= 0)
832 var
= op1
, neg_var_p
= neg1_p
;
834 /* Now do any needed negations. */
836 *minus_litp
= *litp
, *litp
= 0;
838 *conp
= negate_expr (*conp
);
841 /* Convert to TYPE before negating a pointer type expr. */
842 if (var
&& POINTER_TYPE_P (TREE_TYPE (var
)))
843 var
= fold_convert_loc (loc
, type
, var
);
844 var
= negate_expr (var
);
847 else if (TREE_CODE (in
) == BIT_NOT_EXPR
848 && code
== PLUS_EXPR
)
850 /* -X - 1 is folded to ~X, undo that here. */
851 *minus_litp
= build_one_cst (TREE_TYPE (in
));
852 var
= negate_expr (TREE_OPERAND (in
, 0));
854 else if (TREE_CONSTANT (in
))
862 *minus_litp
= *litp
, *litp
= 0;
863 else if (*minus_litp
)
864 *litp
= *minus_litp
, *minus_litp
= 0;
865 *conp
= negate_expr (*conp
);
866 /* Convert to TYPE before negating a pointer type expr. */
867 if (var
&& POINTER_TYPE_P (TREE_TYPE (var
)))
868 var
= fold_convert_loc (loc
, type
, var
);
869 var
= negate_expr (var
);
875 /* Re-associate trees split by the above function. T1 and T2 are
876 either expressions to associate or null. Return the new
877 expression, if any. LOC is the location of the new expression. If
878 we build an operation, do it in TYPE and with CODE. */
881 associate_trees (location_t loc
, tree t1
, tree t2
, enum tree_code code
, tree type
)
888 /* If either input is CODE, a PLUS_EXPR, or a MINUS_EXPR, don't
889 try to fold this since we will have infinite recursion. But do
890 deal with any NEGATE_EXPRs. */
891 if (TREE_CODE (t1
) == code
|| TREE_CODE (t2
) == code
892 || TREE_CODE (t1
) == MINUS_EXPR
|| TREE_CODE (t2
) == MINUS_EXPR
)
894 if (code
== PLUS_EXPR
)
896 if (TREE_CODE (t1
) == NEGATE_EXPR
)
897 return build2_loc (loc
, MINUS_EXPR
, type
,
898 fold_convert_loc (loc
, type
, t2
),
899 fold_convert_loc (loc
, type
,
900 TREE_OPERAND (t1
, 0)));
901 else if (TREE_CODE (t2
) == NEGATE_EXPR
)
902 return build2_loc (loc
, MINUS_EXPR
, type
,
903 fold_convert_loc (loc
, type
, t1
),
904 fold_convert_loc (loc
, type
,
905 TREE_OPERAND (t2
, 0)));
906 else if (integer_zerop (t2
))
907 return fold_convert_loc (loc
, type
, t1
);
909 else if (code
== MINUS_EXPR
)
911 if (integer_zerop (t2
))
912 return fold_convert_loc (loc
, type
, t1
);
915 return build2_loc (loc
, code
, type
, fold_convert_loc (loc
, type
, t1
),
916 fold_convert_loc (loc
, type
, t2
));
919 return fold_build2_loc (loc
, code
, type
, fold_convert_loc (loc
, type
, t1
),
920 fold_convert_loc (loc
, type
, t2
));
923 /* Check whether TYPE1 and TYPE2 are equivalent integer types, suitable
924 for use in int_const_binop, size_binop and size_diffop. */
927 int_binop_types_match_p (enum tree_code code
, const_tree type1
, const_tree type2
)
929 if (!INTEGRAL_TYPE_P (type1
) && !POINTER_TYPE_P (type1
))
931 if (!INTEGRAL_TYPE_P (type2
) && !POINTER_TYPE_P (type2
))
946 return TYPE_UNSIGNED (type1
) == TYPE_UNSIGNED (type2
)
947 && TYPE_PRECISION (type1
) == TYPE_PRECISION (type2
)
948 && TYPE_MODE (type1
) == TYPE_MODE (type2
);
952 /* Combine two integer constants ARG1 and ARG2 under operation CODE
953 to produce a new constant. Return NULL_TREE if we don't know how
954 to evaluate CODE at compile-time. */
957 int_const_binop_1 (enum tree_code code
, const_tree arg1
, const_tree parg2
,
962 tree type
= TREE_TYPE (arg1
);
963 signop sign
= TYPE_SIGN (type
);
964 bool overflow
= false;
966 wide_int arg2
= wide_int::from (parg2
, TYPE_PRECISION (type
),
967 TYPE_SIGN (TREE_TYPE (parg2
)));
972 res
= wi::bit_or (arg1
, arg2
);
976 res
= wi::bit_xor (arg1
, arg2
);
980 res
= wi::bit_and (arg1
, arg2
);
985 if (wi::neg_p (arg2
))
988 if (code
== RSHIFT_EXPR
)
994 if (code
== RSHIFT_EXPR
)
995 /* It's unclear from the C standard whether shifts can overflow.
996 The following code ignores overflow; perhaps a C standard
997 interpretation ruling is needed. */
998 res
= wi::rshift (arg1
, arg2
, sign
);
1000 res
= wi::lshift (arg1
, arg2
);
1005 if (wi::neg_p (arg2
))
1008 if (code
== RROTATE_EXPR
)
1009 code
= LROTATE_EXPR
;
1011 code
= RROTATE_EXPR
;
1014 if (code
== RROTATE_EXPR
)
1015 res
= wi::rrotate (arg1
, arg2
);
1017 res
= wi::lrotate (arg1
, arg2
);
1021 res
= wi::add (arg1
, arg2
, sign
, &overflow
);
1025 res
= wi::sub (arg1
, arg2
, sign
, &overflow
);
1029 res
= wi::mul (arg1
, arg2
, sign
, &overflow
);
1032 case MULT_HIGHPART_EXPR
:
1033 res
= wi::mul_high (arg1
, arg2
, sign
);
1036 case TRUNC_DIV_EXPR
:
1037 case EXACT_DIV_EXPR
:
1040 res
= wi::div_trunc (arg1
, arg2
, sign
, &overflow
);
1043 case FLOOR_DIV_EXPR
:
1046 res
= wi::div_floor (arg1
, arg2
, sign
, &overflow
);
1052 res
= wi::div_ceil (arg1
, arg2
, sign
, &overflow
);
1055 case ROUND_DIV_EXPR
:
1058 res
= wi::div_round (arg1
, arg2
, sign
, &overflow
);
1061 case TRUNC_MOD_EXPR
:
1064 res
= wi::mod_trunc (arg1
, arg2
, sign
, &overflow
);
1067 case FLOOR_MOD_EXPR
:
1070 res
= wi::mod_floor (arg1
, arg2
, sign
, &overflow
);
1076 res
= wi::mod_ceil (arg1
, arg2
, sign
, &overflow
);
1079 case ROUND_MOD_EXPR
:
1082 res
= wi::mod_round (arg1
, arg2
, sign
, &overflow
);
1086 res
= wi::min (arg1
, arg2
, sign
);
1090 res
= wi::max (arg1
, arg2
, sign
);
1097 t
= force_fit_type (type
, res
, overflowable
,
1098 (((sign
== SIGNED
|| overflowable
== -1)
1100 | TREE_OVERFLOW (arg1
) | TREE_OVERFLOW (parg2
)));
1106 int_const_binop (enum tree_code code
, const_tree arg1
, const_tree arg2
)
1108 return int_const_binop_1 (code
, arg1
, arg2
, 1);
1111 /* Combine two constants ARG1 and ARG2 under operation CODE to produce a new
1112 constant. We assume ARG1 and ARG2 have the same data type, or at least
1113 are the same kind of constant and the same machine mode. Return zero if
1114 combining the constants is not allowed in the current operating mode. */
1117 const_binop (enum tree_code code
, tree arg1
, tree arg2
)
1119 /* Sanity check for the recursive cases. */
1126 if (TREE_CODE (arg1
) == INTEGER_CST
&& TREE_CODE (arg2
) == INTEGER_CST
)
1128 if (code
== POINTER_PLUS_EXPR
)
1129 return int_const_binop (PLUS_EXPR
,
1130 arg1
, fold_convert (TREE_TYPE (arg1
), arg2
));
1132 return int_const_binop (code
, arg1
, arg2
);
1135 if (TREE_CODE (arg1
) == REAL_CST
&& TREE_CODE (arg2
) == REAL_CST
)
1140 REAL_VALUE_TYPE value
;
1141 REAL_VALUE_TYPE result
;
1145 /* The following codes are handled by real_arithmetic. */
1160 d1
= TREE_REAL_CST (arg1
);
1161 d2
= TREE_REAL_CST (arg2
);
1163 type
= TREE_TYPE (arg1
);
1164 mode
= TYPE_MODE (type
);
1166 /* Don't perform operation if we honor signaling NaNs and
1167 either operand is a signaling NaN. */
1168 if (HONOR_SNANS (mode
)
1169 && (REAL_VALUE_ISSIGNALING_NAN (d1
)
1170 || REAL_VALUE_ISSIGNALING_NAN (d2
)))
1173 /* Don't perform operation if it would raise a division
1174 by zero exception. */
1175 if (code
== RDIV_EXPR
1176 && real_equal (&d2
, &dconst0
)
1177 && (flag_trapping_math
|| ! MODE_HAS_INFINITIES (mode
)))
1180 /* If either operand is a NaN, just return it. Otherwise, set up
1181 for floating-point trap; we return an overflow. */
1182 if (REAL_VALUE_ISNAN (d1
))
1184 /* Make resulting NaN value to be qNaN when flag_signaling_nans
1187 t
= build_real (type
, d1
);
1190 else if (REAL_VALUE_ISNAN (d2
))
1192 /* Make resulting NaN value to be qNaN when flag_signaling_nans
1195 t
= build_real (type
, d2
);
1199 inexact
= real_arithmetic (&value
, code
, &d1
, &d2
);
1200 real_convert (&result
, mode
, &value
);
1202 /* Don't constant fold this floating point operation if
1203 the result has overflowed and flag_trapping_math. */
1204 if (flag_trapping_math
1205 && MODE_HAS_INFINITIES (mode
)
1206 && REAL_VALUE_ISINF (result
)
1207 && !REAL_VALUE_ISINF (d1
)
1208 && !REAL_VALUE_ISINF (d2
))
1211 /* Don't constant fold this floating point operation if the
1212 result may dependent upon the run-time rounding mode and
1213 flag_rounding_math is set, or if GCC's software emulation
1214 is unable to accurately represent the result. */
1215 if ((flag_rounding_math
1216 || (MODE_COMPOSITE_P (mode
) && !flag_unsafe_math_optimizations
))
1217 && (inexact
|| !real_identical (&result
, &value
)))
1220 t
= build_real (type
, result
);
1222 TREE_OVERFLOW (t
) = TREE_OVERFLOW (arg1
) | TREE_OVERFLOW (arg2
);
1226 if (TREE_CODE (arg1
) == FIXED_CST
)
1228 FIXED_VALUE_TYPE f1
;
1229 FIXED_VALUE_TYPE f2
;
1230 FIXED_VALUE_TYPE result
;
1235 /* The following codes are handled by fixed_arithmetic. */
1241 case TRUNC_DIV_EXPR
:
1242 if (TREE_CODE (arg2
) != FIXED_CST
)
1244 f2
= TREE_FIXED_CST (arg2
);
1250 if (TREE_CODE (arg2
) != INTEGER_CST
)
1253 f2
.data
.high
= w2
.elt (1);
1254 f2
.data
.low
= w2
.elt (0);
1263 f1
= TREE_FIXED_CST (arg1
);
1264 type
= TREE_TYPE (arg1
);
1265 sat_p
= TYPE_SATURATING (type
);
1266 overflow_p
= fixed_arithmetic (&result
, code
, &f1
, &f2
, sat_p
);
1267 t
= build_fixed (type
, result
);
1268 /* Propagate overflow flags. */
1269 if (overflow_p
| TREE_OVERFLOW (arg1
) | TREE_OVERFLOW (arg2
))
1270 TREE_OVERFLOW (t
) = 1;
1274 if (TREE_CODE (arg1
) == COMPLEX_CST
&& TREE_CODE (arg2
) == COMPLEX_CST
)
1276 tree type
= TREE_TYPE (arg1
);
1277 tree r1
= TREE_REALPART (arg1
);
1278 tree i1
= TREE_IMAGPART (arg1
);
1279 tree r2
= TREE_REALPART (arg2
);
1280 tree i2
= TREE_IMAGPART (arg2
);
1287 real
= const_binop (code
, r1
, r2
);
1288 imag
= const_binop (code
, i1
, i2
);
1292 if (COMPLEX_FLOAT_TYPE_P (type
))
1293 return do_mpc_arg2 (arg1
, arg2
, type
,
1294 /* do_nonfinite= */ folding_initializer
,
1297 real
= const_binop (MINUS_EXPR
,
1298 const_binop (MULT_EXPR
, r1
, r2
),
1299 const_binop (MULT_EXPR
, i1
, i2
));
1300 imag
= const_binop (PLUS_EXPR
,
1301 const_binop (MULT_EXPR
, r1
, i2
),
1302 const_binop (MULT_EXPR
, i1
, r2
));
1306 if (COMPLEX_FLOAT_TYPE_P (type
))
1307 return do_mpc_arg2 (arg1
, arg2
, type
,
1308 /* do_nonfinite= */ folding_initializer
,
1311 case TRUNC_DIV_EXPR
:
1313 case FLOOR_DIV_EXPR
:
1314 case ROUND_DIV_EXPR
:
1315 if (flag_complex_method
== 0)
1317 /* Keep this algorithm in sync with
1318 tree-complex.c:expand_complex_div_straight().
1320 Expand complex division to scalars, straightforward algorithm.
1321 a / b = ((ar*br + ai*bi)/t) + i((ai*br - ar*bi)/t)
1325 = const_binop (PLUS_EXPR
,
1326 const_binop (MULT_EXPR
, r2
, r2
),
1327 const_binop (MULT_EXPR
, i2
, i2
));
1329 = const_binop (PLUS_EXPR
,
1330 const_binop (MULT_EXPR
, r1
, r2
),
1331 const_binop (MULT_EXPR
, i1
, i2
));
1333 = const_binop (MINUS_EXPR
,
1334 const_binop (MULT_EXPR
, i1
, r2
),
1335 const_binop (MULT_EXPR
, r1
, i2
));
1337 real
= const_binop (code
, t1
, magsquared
);
1338 imag
= const_binop (code
, t2
, magsquared
);
1342 /* Keep this algorithm in sync with
1343 tree-complex.c:expand_complex_div_wide().
1345 Expand complex division to scalars, modified algorithm to minimize
1346 overflow with wide input ranges. */
1347 tree compare
= fold_build2 (LT_EXPR
, boolean_type_node
,
1348 fold_abs_const (r2
, TREE_TYPE (type
)),
1349 fold_abs_const (i2
, TREE_TYPE (type
)));
1351 if (integer_nonzerop (compare
))
1353 /* In the TRUE branch, we compute
1355 div = (br * ratio) + bi;
1356 tr = (ar * ratio) + ai;
1357 ti = (ai * ratio) - ar;
1360 tree ratio
= const_binop (code
, r2
, i2
);
1361 tree div
= const_binop (PLUS_EXPR
, i2
,
1362 const_binop (MULT_EXPR
, r2
, ratio
));
1363 real
= const_binop (MULT_EXPR
, r1
, ratio
);
1364 real
= const_binop (PLUS_EXPR
, real
, i1
);
1365 real
= const_binop (code
, real
, div
);
1367 imag
= const_binop (MULT_EXPR
, i1
, ratio
);
1368 imag
= const_binop (MINUS_EXPR
, imag
, r1
);
1369 imag
= const_binop (code
, imag
, div
);
1373 /* In the FALSE branch, we compute
1375 divisor = (d * ratio) + c;
1376 tr = (b * ratio) + a;
1377 ti = b - (a * ratio);
1380 tree ratio
= const_binop (code
, i2
, r2
);
1381 tree div
= const_binop (PLUS_EXPR
, r2
,
1382 const_binop (MULT_EXPR
, i2
, ratio
));
1384 real
= const_binop (MULT_EXPR
, i1
, ratio
);
1385 real
= const_binop (PLUS_EXPR
, real
, r1
);
1386 real
= const_binop (code
, real
, div
);
1388 imag
= const_binop (MULT_EXPR
, r1
, ratio
);
1389 imag
= const_binop (MINUS_EXPR
, i1
, imag
);
1390 imag
= const_binop (code
, imag
, div
);
1400 return build_complex (type
, real
, imag
);
1403 if (TREE_CODE (arg1
) == VECTOR_CST
1404 && TREE_CODE (arg2
) == VECTOR_CST
)
1406 tree type
= TREE_TYPE (arg1
);
1407 int count
= TYPE_VECTOR_SUBPARTS (type
), i
;
1408 tree
*elts
= XALLOCAVEC (tree
, count
);
1410 for (i
= 0; i
< count
; i
++)
1412 tree elem1
= VECTOR_CST_ELT (arg1
, i
);
1413 tree elem2
= VECTOR_CST_ELT (arg2
, i
);
1415 elts
[i
] = const_binop (code
, elem1
, elem2
);
1417 /* It is possible that const_binop cannot handle the given
1418 code and return NULL_TREE */
1419 if (elts
[i
] == NULL_TREE
)
1423 return build_vector (type
, elts
);
1426 /* Shifts allow a scalar offset for a vector. */
1427 if (TREE_CODE (arg1
) == VECTOR_CST
1428 && TREE_CODE (arg2
) == INTEGER_CST
)
1430 tree type
= TREE_TYPE (arg1
);
1431 int count
= TYPE_VECTOR_SUBPARTS (type
), i
;
1432 tree
*elts
= XALLOCAVEC (tree
, count
);
1434 for (i
= 0; i
< count
; i
++)
1436 tree elem1
= VECTOR_CST_ELT (arg1
, i
);
1438 elts
[i
] = const_binop (code
, elem1
, arg2
);
1440 /* It is possible that const_binop cannot handle the given
1441 code and return NULL_TREE. */
1442 if (elts
[i
] == NULL_TREE
)
1446 return build_vector (type
, elts
);
1451 /* Overload that adds a TYPE parameter to be able to dispatch
1452 to fold_relational_const. */
1455 const_binop (enum tree_code code
, tree type
, tree arg1
, tree arg2
)
1457 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
1458 return fold_relational_const (code
, type
, arg1
, arg2
);
1460 /* ??? Until we make the const_binop worker take the type of the
1461 result as argument put those cases that need it here. */
1465 if ((TREE_CODE (arg1
) == REAL_CST
1466 && TREE_CODE (arg2
) == REAL_CST
)
1467 || (TREE_CODE (arg1
) == INTEGER_CST
1468 && TREE_CODE (arg2
) == INTEGER_CST
))
1469 return build_complex (type
, arg1
, arg2
);
1472 case VEC_PACK_TRUNC_EXPR
:
1473 case VEC_PACK_FIX_TRUNC_EXPR
:
1475 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (type
), i
;
1478 gcc_assert (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg1
)) == nelts
/ 2
1479 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg2
)) == nelts
/ 2);
1480 if (TREE_CODE (arg1
) != VECTOR_CST
1481 || TREE_CODE (arg2
) != VECTOR_CST
)
1484 elts
= XALLOCAVEC (tree
, nelts
);
1485 if (!vec_cst_ctor_to_array (arg1
, elts
)
1486 || !vec_cst_ctor_to_array (arg2
, elts
+ nelts
/ 2))
1489 for (i
= 0; i
< nelts
; i
++)
1491 elts
[i
] = fold_convert_const (code
== VEC_PACK_TRUNC_EXPR
1492 ? NOP_EXPR
: FIX_TRUNC_EXPR
,
1493 TREE_TYPE (type
), elts
[i
]);
1494 if (elts
[i
] == NULL_TREE
|| !CONSTANT_CLASS_P (elts
[i
]))
1498 return build_vector (type
, elts
);
1501 case VEC_WIDEN_MULT_LO_EXPR
:
1502 case VEC_WIDEN_MULT_HI_EXPR
:
1503 case VEC_WIDEN_MULT_EVEN_EXPR
:
1504 case VEC_WIDEN_MULT_ODD_EXPR
:
1506 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (type
);
1507 unsigned int out
, ofs
, scale
;
1510 gcc_assert (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg1
)) == nelts
* 2
1511 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg2
)) == nelts
* 2);
1512 if (TREE_CODE (arg1
) != VECTOR_CST
|| TREE_CODE (arg2
) != VECTOR_CST
)
1515 elts
= XALLOCAVEC (tree
, nelts
* 4);
1516 if (!vec_cst_ctor_to_array (arg1
, elts
)
1517 || !vec_cst_ctor_to_array (arg2
, elts
+ nelts
* 2))
1520 if (code
== VEC_WIDEN_MULT_LO_EXPR
)
1521 scale
= 0, ofs
= BYTES_BIG_ENDIAN
? nelts
: 0;
1522 else if (code
== VEC_WIDEN_MULT_HI_EXPR
)
1523 scale
= 0, ofs
= BYTES_BIG_ENDIAN
? 0 : nelts
;
1524 else if (code
== VEC_WIDEN_MULT_EVEN_EXPR
)
1526 else /* if (code == VEC_WIDEN_MULT_ODD_EXPR) */
1529 for (out
= 0; out
< nelts
; out
++)
1531 unsigned int in1
= (out
<< scale
) + ofs
;
1532 unsigned int in2
= in1
+ nelts
* 2;
1535 t1
= fold_convert_const (NOP_EXPR
, TREE_TYPE (type
), elts
[in1
]);
1536 t2
= fold_convert_const (NOP_EXPR
, TREE_TYPE (type
), elts
[in2
]);
1538 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
1540 elts
[out
] = const_binop (MULT_EXPR
, t1
, t2
);
1541 if (elts
[out
] == NULL_TREE
|| !CONSTANT_CLASS_P (elts
[out
]))
1545 return build_vector (type
, elts
);
1551 if (TREE_CODE_CLASS (code
) != tcc_binary
)
1554 /* Make sure type and arg0 have the same saturating flag. */
1555 gcc_checking_assert (TYPE_SATURATING (type
)
1556 == TYPE_SATURATING (TREE_TYPE (arg1
)));
1558 return const_binop (code
, arg1
, arg2
);
1561 /* Compute CODE ARG1 with resulting type TYPE with ARG1 being constant.
1562 Return zero if computing the constants is not possible. */
1565 const_unop (enum tree_code code
, tree type
, tree arg0
)
1567 /* Don't perform the operation, other than NEGATE and ABS, if
1568 flag_signaling_nans is on and the operand is a signaling NaN. */
1569 if (TREE_CODE (arg0
) == REAL_CST
1570 && HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg0
)))
1571 && REAL_VALUE_ISSIGNALING_NAN (TREE_REAL_CST (arg0
))
1572 && code
!= NEGATE_EXPR
1573 && code
!= ABS_EXPR
)
1580 case FIX_TRUNC_EXPR
:
1581 case FIXED_CONVERT_EXPR
:
1582 return fold_convert_const (code
, type
, arg0
);
1584 case ADDR_SPACE_CONVERT_EXPR
:
1585 /* If the source address is 0, and the source address space
1586 cannot have a valid object at 0, fold to dest type null. */
1587 if (integer_zerop (arg0
)
1588 && !(targetm
.addr_space
.zero_address_valid
1589 (TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (arg0
))))))
1590 return fold_convert_const (code
, type
, arg0
);
1593 case VIEW_CONVERT_EXPR
:
1594 return fold_view_convert_expr (type
, arg0
);
1598 /* Can't call fold_negate_const directly here as that doesn't
1599 handle all cases and we might not be able to negate some
1601 tree tem
= fold_negate_expr (UNKNOWN_LOCATION
, arg0
);
1602 if (tem
&& CONSTANT_CLASS_P (tem
))
1608 if (TREE_CODE (arg0
) == INTEGER_CST
|| TREE_CODE (arg0
) == REAL_CST
)
1609 return fold_abs_const (arg0
, type
);
1613 if (TREE_CODE (arg0
) == COMPLEX_CST
)
1615 tree ipart
= fold_negate_const (TREE_IMAGPART (arg0
),
1617 return build_complex (type
, TREE_REALPART (arg0
), ipart
);
1622 if (TREE_CODE (arg0
) == INTEGER_CST
)
1623 return fold_not_const (arg0
, type
);
1624 /* Perform BIT_NOT_EXPR on each element individually. */
1625 else if (TREE_CODE (arg0
) == VECTOR_CST
)
1629 unsigned count
= VECTOR_CST_NELTS (arg0
), i
;
1631 elements
= XALLOCAVEC (tree
, count
);
1632 for (i
= 0; i
< count
; i
++)
1634 elem
= VECTOR_CST_ELT (arg0
, i
);
1635 elem
= const_unop (BIT_NOT_EXPR
, TREE_TYPE (type
), elem
);
1636 if (elem
== NULL_TREE
)
1641 return build_vector (type
, elements
);
1645 case TRUTH_NOT_EXPR
:
1646 if (TREE_CODE (arg0
) == INTEGER_CST
)
1647 return constant_boolean_node (integer_zerop (arg0
), type
);
1651 if (TREE_CODE (arg0
) == COMPLEX_CST
)
1652 return fold_convert (type
, TREE_REALPART (arg0
));
1656 if (TREE_CODE (arg0
) == COMPLEX_CST
)
1657 return fold_convert (type
, TREE_IMAGPART (arg0
));
1660 case VEC_UNPACK_LO_EXPR
:
1661 case VEC_UNPACK_HI_EXPR
:
1662 case VEC_UNPACK_FLOAT_LO_EXPR
:
1663 case VEC_UNPACK_FLOAT_HI_EXPR
:
1665 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (type
), i
;
1667 enum tree_code subcode
;
1669 gcc_assert (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0
)) == nelts
* 2);
1670 if (TREE_CODE (arg0
) != VECTOR_CST
)
1673 elts
= XALLOCAVEC (tree
, nelts
* 2);
1674 if (!vec_cst_ctor_to_array (arg0
, elts
))
1677 if ((!BYTES_BIG_ENDIAN
) ^ (code
== VEC_UNPACK_LO_EXPR
1678 || code
== VEC_UNPACK_FLOAT_LO_EXPR
))
1681 if (code
== VEC_UNPACK_LO_EXPR
|| code
== VEC_UNPACK_HI_EXPR
)
1684 subcode
= FLOAT_EXPR
;
1686 for (i
= 0; i
< nelts
; i
++)
1688 elts
[i
] = fold_convert_const (subcode
, TREE_TYPE (type
), elts
[i
]);
1689 if (elts
[i
] == NULL_TREE
|| !CONSTANT_CLASS_P (elts
[i
]))
1693 return build_vector (type
, elts
);
1696 case REDUC_MIN_EXPR
:
1697 case REDUC_MAX_EXPR
:
1698 case REDUC_PLUS_EXPR
:
1700 unsigned int nelts
, i
;
1702 enum tree_code subcode
;
1704 if (TREE_CODE (arg0
) != VECTOR_CST
)
1706 nelts
= TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0
));
1708 elts
= XALLOCAVEC (tree
, nelts
);
1709 if (!vec_cst_ctor_to_array (arg0
, elts
))
1714 case REDUC_MIN_EXPR
: subcode
= MIN_EXPR
; break;
1715 case REDUC_MAX_EXPR
: subcode
= MAX_EXPR
; break;
1716 case REDUC_PLUS_EXPR
: subcode
= PLUS_EXPR
; break;
1717 default: gcc_unreachable ();
1720 for (i
= 1; i
< nelts
; i
++)
1722 elts
[0] = const_binop (subcode
, elts
[0], elts
[i
]);
1723 if (elts
[0] == NULL_TREE
|| !CONSTANT_CLASS_P (elts
[0]))
1737 /* Create a sizetype INT_CST node with NUMBER sign extended. KIND
1738 indicates which particular sizetype to create. */
1741 size_int_kind (HOST_WIDE_INT number
, enum size_type_kind kind
)
1743 return build_int_cst (sizetype_tab
[(int) kind
], number
);
1746 /* Combine operands OP1 and OP2 with arithmetic operation CODE. CODE
1747 is a tree code. The type of the result is taken from the operands.
1748 Both must be equivalent integer types, ala int_binop_types_match_p.
1749 If the operands are constant, so is the result. */
1752 size_binop_loc (location_t loc
, enum tree_code code
, tree arg0
, tree arg1
)
1754 tree type
= TREE_TYPE (arg0
);
1756 if (arg0
== error_mark_node
|| arg1
== error_mark_node
)
1757 return error_mark_node
;
1759 gcc_assert (int_binop_types_match_p (code
, TREE_TYPE (arg0
),
1762 /* Handle the special case of two integer constants faster. */
1763 if (TREE_CODE (arg0
) == INTEGER_CST
&& TREE_CODE (arg1
) == INTEGER_CST
)
1765 /* And some specific cases even faster than that. */
1766 if (code
== PLUS_EXPR
)
1768 if (integer_zerop (arg0
) && !TREE_OVERFLOW (arg0
))
1770 if (integer_zerop (arg1
) && !TREE_OVERFLOW (arg1
))
1773 else if (code
== MINUS_EXPR
)
1775 if (integer_zerop (arg1
) && !TREE_OVERFLOW (arg1
))
1778 else if (code
== MULT_EXPR
)
1780 if (integer_onep (arg0
) && !TREE_OVERFLOW (arg0
))
1784 /* Handle general case of two integer constants. For sizetype
1785 constant calculations we always want to know about overflow,
1786 even in the unsigned case. */
1787 return int_const_binop_1 (code
, arg0
, arg1
, -1);
1790 return fold_build2_loc (loc
, code
, type
, arg0
, arg1
);
1793 /* Given two values, either both of sizetype or both of bitsizetype,
1794 compute the difference between the two values. Return the value
1795 in signed type corresponding to the type of the operands. */
1798 size_diffop_loc (location_t loc
, tree arg0
, tree arg1
)
1800 tree type
= TREE_TYPE (arg0
);
1803 gcc_assert (int_binop_types_match_p (MINUS_EXPR
, TREE_TYPE (arg0
),
1806 /* If the type is already signed, just do the simple thing. */
1807 if (!TYPE_UNSIGNED (type
))
1808 return size_binop_loc (loc
, MINUS_EXPR
, arg0
, arg1
);
1810 if (type
== sizetype
)
1812 else if (type
== bitsizetype
)
1813 ctype
= sbitsizetype
;
1815 ctype
= signed_type_for (type
);
1817 /* If either operand is not a constant, do the conversions to the signed
1818 type and subtract. The hardware will do the right thing with any
1819 overflow in the subtraction. */
1820 if (TREE_CODE (arg0
) != INTEGER_CST
|| TREE_CODE (arg1
) != INTEGER_CST
)
1821 return size_binop_loc (loc
, MINUS_EXPR
,
1822 fold_convert_loc (loc
, ctype
, arg0
),
1823 fold_convert_loc (loc
, ctype
, arg1
));
1825 /* If ARG0 is larger than ARG1, subtract and return the result in CTYPE.
1826 Otherwise, subtract the other way, convert to CTYPE (we know that can't
1827 overflow) and negate (which can't either). Special-case a result
1828 of zero while we're here. */
1829 if (tree_int_cst_equal (arg0
, arg1
))
1830 return build_int_cst (ctype
, 0);
1831 else if (tree_int_cst_lt (arg1
, arg0
))
1832 return fold_convert_loc (loc
, ctype
,
1833 size_binop_loc (loc
, MINUS_EXPR
, arg0
, arg1
));
1835 return size_binop_loc (loc
, MINUS_EXPR
, build_int_cst (ctype
, 0),
1836 fold_convert_loc (loc
, ctype
,
1837 size_binop_loc (loc
,
1842 /* A subroutine of fold_convert_const handling conversions of an
1843 INTEGER_CST to another integer type. */
1846 fold_convert_const_int_from_int (tree type
, const_tree arg1
)
1848 /* Given an integer constant, make new constant with new type,
1849 appropriately sign-extended or truncated. Use widest_int
1850 so that any extension is done according ARG1's type. */
1851 return force_fit_type (type
, wi::to_widest (arg1
),
1852 !POINTER_TYPE_P (TREE_TYPE (arg1
)),
1853 TREE_OVERFLOW (arg1
));
1856 /* A subroutine of fold_convert_const handling conversions a REAL_CST
1857 to an integer type. */
1860 fold_convert_const_int_from_real (enum tree_code code
, tree type
, const_tree arg1
)
1862 bool overflow
= false;
1865 /* The following code implements the floating point to integer
1866 conversion rules required by the Java Language Specification,
1867 that IEEE NaNs are mapped to zero and values that overflow
1868 the target precision saturate, i.e. values greater than
1869 INT_MAX are mapped to INT_MAX, and values less than INT_MIN
1870 are mapped to INT_MIN. These semantics are allowed by the
1871 C and C++ standards that simply state that the behavior of
1872 FP-to-integer conversion is unspecified upon overflow. */
1876 REAL_VALUE_TYPE x
= TREE_REAL_CST (arg1
);
1880 case FIX_TRUNC_EXPR
:
1881 real_trunc (&r
, VOIDmode
, &x
);
1888 /* If R is NaN, return zero and show we have an overflow. */
1889 if (REAL_VALUE_ISNAN (r
))
1892 val
= wi::zero (TYPE_PRECISION (type
));
1895 /* See if R is less than the lower bound or greater than the
1900 tree lt
= TYPE_MIN_VALUE (type
);
1901 REAL_VALUE_TYPE l
= real_value_from_int_cst (NULL_TREE
, lt
);
1902 if (real_less (&r
, &l
))
1911 tree ut
= TYPE_MAX_VALUE (type
);
1914 REAL_VALUE_TYPE u
= real_value_from_int_cst (NULL_TREE
, ut
);
1915 if (real_less (&u
, &r
))
1924 val
= real_to_integer (&r
, &overflow
, TYPE_PRECISION (type
));
1926 t
= force_fit_type (type
, val
, -1, overflow
| TREE_OVERFLOW (arg1
));
1930 /* A subroutine of fold_convert_const handling conversions of a
1931 FIXED_CST to an integer type. */
1934 fold_convert_const_int_from_fixed (tree type
, const_tree arg1
)
1937 double_int temp
, temp_trunc
;
1940 /* Right shift FIXED_CST to temp by fbit. */
1941 temp
= TREE_FIXED_CST (arg1
).data
;
1942 mode
= TREE_FIXED_CST (arg1
).mode
;
1943 if (GET_MODE_FBIT (mode
) < HOST_BITS_PER_DOUBLE_INT
)
1945 temp
= temp
.rshift (GET_MODE_FBIT (mode
),
1946 HOST_BITS_PER_DOUBLE_INT
,
1947 SIGNED_FIXED_POINT_MODE_P (mode
));
1949 /* Left shift temp to temp_trunc by fbit. */
1950 temp_trunc
= temp
.lshift (GET_MODE_FBIT (mode
),
1951 HOST_BITS_PER_DOUBLE_INT
,
1952 SIGNED_FIXED_POINT_MODE_P (mode
));
1956 temp
= double_int_zero
;
1957 temp_trunc
= double_int_zero
;
1960 /* If FIXED_CST is negative, we need to round the value toward 0.
1961 By checking if the fractional bits are not zero to add 1 to temp. */
1962 if (SIGNED_FIXED_POINT_MODE_P (mode
)
1963 && temp_trunc
.is_negative ()
1964 && TREE_FIXED_CST (arg1
).data
!= temp_trunc
)
1965 temp
+= double_int_one
;
1967 /* Given a fixed-point constant, make new constant with new type,
1968 appropriately sign-extended or truncated. */
1969 t
= force_fit_type (type
, temp
, -1,
1970 (temp
.is_negative ()
1971 && (TYPE_UNSIGNED (type
)
1972 < TYPE_UNSIGNED (TREE_TYPE (arg1
))))
1973 | TREE_OVERFLOW (arg1
));
1978 /* A subroutine of fold_convert_const handling conversions a REAL_CST
1979 to another floating point type. */
1982 fold_convert_const_real_from_real (tree type
, const_tree arg1
)
1984 REAL_VALUE_TYPE value
;
1987 /* Don't perform the operation if flag_signaling_nans is on
1988 and the operand is a signaling NaN. */
1989 if (HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg1
)))
1990 && REAL_VALUE_ISSIGNALING_NAN (TREE_REAL_CST (arg1
)))
1993 real_convert (&value
, TYPE_MODE (type
), &TREE_REAL_CST (arg1
));
1994 t
= build_real (type
, value
);
1996 /* If converting an infinity or NAN to a representation that doesn't
1997 have one, set the overflow bit so that we can produce some kind of
1998 error message at the appropriate point if necessary. It's not the
1999 most user-friendly message, but it's better than nothing. */
2000 if (REAL_VALUE_ISINF (TREE_REAL_CST (arg1
))
2001 && !MODE_HAS_INFINITIES (TYPE_MODE (type
)))
2002 TREE_OVERFLOW (t
) = 1;
2003 else if (REAL_VALUE_ISNAN (TREE_REAL_CST (arg1
))
2004 && !MODE_HAS_NANS (TYPE_MODE (type
)))
2005 TREE_OVERFLOW (t
) = 1;
2006 /* Regular overflow, conversion produced an infinity in a mode that
2007 can't represent them. */
2008 else if (!MODE_HAS_INFINITIES (TYPE_MODE (type
))
2009 && REAL_VALUE_ISINF (value
)
2010 && !REAL_VALUE_ISINF (TREE_REAL_CST (arg1
)))
2011 TREE_OVERFLOW (t
) = 1;
2013 TREE_OVERFLOW (t
) = TREE_OVERFLOW (arg1
);
2017 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2018 to a floating point type. */
2021 fold_convert_const_real_from_fixed (tree type
, const_tree arg1
)
2023 REAL_VALUE_TYPE value
;
2026 real_convert_from_fixed (&value
, TYPE_MODE (type
), &TREE_FIXED_CST (arg1
));
2027 t
= build_real (type
, value
);
2029 TREE_OVERFLOW (t
) = TREE_OVERFLOW (arg1
);
2033 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2034 to another fixed-point type. */
2037 fold_convert_const_fixed_from_fixed (tree type
, const_tree arg1
)
2039 FIXED_VALUE_TYPE value
;
2043 overflow_p
= fixed_convert (&value
, TYPE_MODE (type
), &TREE_FIXED_CST (arg1
),
2044 TYPE_SATURATING (type
));
2045 t
= build_fixed (type
, value
);
2047 /* Propagate overflow flags. */
2048 if (overflow_p
| TREE_OVERFLOW (arg1
))
2049 TREE_OVERFLOW (t
) = 1;
2053 /* A subroutine of fold_convert_const handling conversions an INTEGER_CST
2054 to a fixed-point type. */
2057 fold_convert_const_fixed_from_int (tree type
, const_tree arg1
)
2059 FIXED_VALUE_TYPE value
;
2064 gcc_assert (TREE_INT_CST_NUNITS (arg1
) <= 2);
2066 di
.low
= TREE_INT_CST_ELT (arg1
, 0);
2067 if (TREE_INT_CST_NUNITS (arg1
) == 1)
2068 di
.high
= (HOST_WIDE_INT
) di
.low
< 0 ? (HOST_WIDE_INT
) -1 : 0;
2070 di
.high
= TREE_INT_CST_ELT (arg1
, 1);
2072 overflow_p
= fixed_convert_from_int (&value
, TYPE_MODE (type
), di
,
2073 TYPE_UNSIGNED (TREE_TYPE (arg1
)),
2074 TYPE_SATURATING (type
));
2075 t
= build_fixed (type
, value
);
2077 /* Propagate overflow flags. */
2078 if (overflow_p
| TREE_OVERFLOW (arg1
))
2079 TREE_OVERFLOW (t
) = 1;
2083 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2084 to a fixed-point type. */
2087 fold_convert_const_fixed_from_real (tree type
, const_tree arg1
)
2089 FIXED_VALUE_TYPE value
;
2093 overflow_p
= fixed_convert_from_real (&value
, TYPE_MODE (type
),
2094 &TREE_REAL_CST (arg1
),
2095 TYPE_SATURATING (type
));
2096 t
= build_fixed (type
, value
);
2098 /* Propagate overflow flags. */
2099 if (overflow_p
| TREE_OVERFLOW (arg1
))
2100 TREE_OVERFLOW (t
) = 1;
2104 /* Attempt to fold type conversion operation CODE of expression ARG1 to
2105 type TYPE. If no simplification can be done return NULL_TREE. */
2108 fold_convert_const (enum tree_code code
, tree type
, tree arg1
)
2110 if (TREE_TYPE (arg1
) == type
)
2113 if (POINTER_TYPE_P (type
) || INTEGRAL_TYPE_P (type
)
2114 || TREE_CODE (type
) == OFFSET_TYPE
)
2116 if (TREE_CODE (arg1
) == INTEGER_CST
)
2117 return fold_convert_const_int_from_int (type
, arg1
);
2118 else if (TREE_CODE (arg1
) == REAL_CST
)
2119 return fold_convert_const_int_from_real (code
, type
, arg1
);
2120 else if (TREE_CODE (arg1
) == FIXED_CST
)
2121 return fold_convert_const_int_from_fixed (type
, arg1
);
2123 else if (TREE_CODE (type
) == REAL_TYPE
)
2125 if (TREE_CODE (arg1
) == INTEGER_CST
)
2126 return build_real_from_int_cst (type
, arg1
);
2127 else if (TREE_CODE (arg1
) == REAL_CST
)
2128 return fold_convert_const_real_from_real (type
, arg1
);
2129 else if (TREE_CODE (arg1
) == FIXED_CST
)
2130 return fold_convert_const_real_from_fixed (type
, arg1
);
2132 else if (TREE_CODE (type
) == FIXED_POINT_TYPE
)
2134 if (TREE_CODE (arg1
) == FIXED_CST
)
2135 return fold_convert_const_fixed_from_fixed (type
, arg1
);
2136 else if (TREE_CODE (arg1
) == INTEGER_CST
)
2137 return fold_convert_const_fixed_from_int (type
, arg1
);
2138 else if (TREE_CODE (arg1
) == REAL_CST
)
2139 return fold_convert_const_fixed_from_real (type
, arg1
);
2141 else if (TREE_CODE (type
) == VECTOR_TYPE
)
2143 if (TREE_CODE (arg1
) == VECTOR_CST
2144 && TYPE_VECTOR_SUBPARTS (type
) == VECTOR_CST_NELTS (arg1
))
2146 int len
= TYPE_VECTOR_SUBPARTS (type
);
2147 tree elttype
= TREE_TYPE (type
);
2148 tree
*v
= XALLOCAVEC (tree
, len
);
2149 for (int i
= 0; i
< len
; ++i
)
2151 tree elt
= VECTOR_CST_ELT (arg1
, i
);
2152 tree cvt
= fold_convert_const (code
, elttype
, elt
);
2153 if (cvt
== NULL_TREE
)
2157 return build_vector (type
, v
);
2163 /* Construct a vector of zero elements of vector type TYPE. */
2166 build_zero_vector (tree type
)
2170 t
= fold_convert_const (NOP_EXPR
, TREE_TYPE (type
), integer_zero_node
);
2171 return build_vector_from_val (type
, t
);
2174 /* Returns true, if ARG is convertible to TYPE using a NOP_EXPR. */
2177 fold_convertible_p (const_tree type
, const_tree arg
)
2179 tree orig
= TREE_TYPE (arg
);
2184 if (TREE_CODE (arg
) == ERROR_MARK
2185 || TREE_CODE (type
) == ERROR_MARK
2186 || TREE_CODE (orig
) == ERROR_MARK
)
2189 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (orig
))
2192 switch (TREE_CODE (type
))
2194 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2195 case POINTER_TYPE
: case REFERENCE_TYPE
:
2197 return (INTEGRAL_TYPE_P (orig
) || POINTER_TYPE_P (orig
)
2198 || TREE_CODE (orig
) == OFFSET_TYPE
);
2201 case FIXED_POINT_TYPE
:
2205 return TREE_CODE (type
) == TREE_CODE (orig
);
2212 /* Convert expression ARG to type TYPE. Used by the middle-end for
2213 simple conversions in preference to calling the front-end's convert. */
2216 fold_convert_loc (location_t loc
, tree type
, tree arg
)
2218 tree orig
= TREE_TYPE (arg
);
2224 if (TREE_CODE (arg
) == ERROR_MARK
2225 || TREE_CODE (type
) == ERROR_MARK
2226 || TREE_CODE (orig
) == ERROR_MARK
)
2227 return error_mark_node
;
2229 switch (TREE_CODE (type
))
2232 case REFERENCE_TYPE
:
2233 /* Handle conversions between pointers to different address spaces. */
2234 if (POINTER_TYPE_P (orig
)
2235 && (TYPE_ADDR_SPACE (TREE_TYPE (type
))
2236 != TYPE_ADDR_SPACE (TREE_TYPE (orig
))))
2237 return fold_build1_loc (loc
, ADDR_SPACE_CONVERT_EXPR
, type
, arg
);
2240 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2242 if (TREE_CODE (arg
) == INTEGER_CST
)
2244 tem
= fold_convert_const (NOP_EXPR
, type
, arg
);
2245 if (tem
!= NULL_TREE
)
2248 if (INTEGRAL_TYPE_P (orig
) || POINTER_TYPE_P (orig
)
2249 || TREE_CODE (orig
) == OFFSET_TYPE
)
2250 return fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
2251 if (TREE_CODE (orig
) == COMPLEX_TYPE
)
2252 return fold_convert_loc (loc
, type
,
2253 fold_build1_loc (loc
, REALPART_EXPR
,
2254 TREE_TYPE (orig
), arg
));
2255 gcc_assert (TREE_CODE (orig
) == VECTOR_TYPE
2256 && tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (orig
)));
2257 return fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, type
, arg
);
2260 if (TREE_CODE (arg
) == INTEGER_CST
)
2262 tem
= fold_convert_const (FLOAT_EXPR
, type
, arg
);
2263 if (tem
!= NULL_TREE
)
2266 else if (TREE_CODE (arg
) == REAL_CST
)
2268 tem
= fold_convert_const (NOP_EXPR
, type
, arg
);
2269 if (tem
!= NULL_TREE
)
2272 else if (TREE_CODE (arg
) == FIXED_CST
)
2274 tem
= fold_convert_const (FIXED_CONVERT_EXPR
, type
, arg
);
2275 if (tem
!= NULL_TREE
)
2279 switch (TREE_CODE (orig
))
2282 case BOOLEAN_TYPE
: case ENUMERAL_TYPE
:
2283 case POINTER_TYPE
: case REFERENCE_TYPE
:
2284 return fold_build1_loc (loc
, FLOAT_EXPR
, type
, arg
);
2287 return fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
2289 case FIXED_POINT_TYPE
:
2290 return fold_build1_loc (loc
, FIXED_CONVERT_EXPR
, type
, arg
);
2293 tem
= fold_build1_loc (loc
, REALPART_EXPR
, TREE_TYPE (orig
), arg
);
2294 return fold_convert_loc (loc
, type
, tem
);
2300 case FIXED_POINT_TYPE
:
2301 if (TREE_CODE (arg
) == FIXED_CST
|| TREE_CODE (arg
) == INTEGER_CST
2302 || TREE_CODE (arg
) == REAL_CST
)
2304 tem
= fold_convert_const (FIXED_CONVERT_EXPR
, type
, arg
);
2305 if (tem
!= NULL_TREE
)
2306 goto fold_convert_exit
;
2309 switch (TREE_CODE (orig
))
2311 case FIXED_POINT_TYPE
:
2316 return fold_build1_loc (loc
, FIXED_CONVERT_EXPR
, type
, arg
);
2319 tem
= fold_build1_loc (loc
, REALPART_EXPR
, TREE_TYPE (orig
), arg
);
2320 return fold_convert_loc (loc
, type
, tem
);
2327 switch (TREE_CODE (orig
))
2330 case BOOLEAN_TYPE
: case ENUMERAL_TYPE
:
2331 case POINTER_TYPE
: case REFERENCE_TYPE
:
2333 case FIXED_POINT_TYPE
:
2334 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
2335 fold_convert_loc (loc
, TREE_TYPE (type
), arg
),
2336 fold_convert_loc (loc
, TREE_TYPE (type
),
2337 integer_zero_node
));
2342 if (TREE_CODE (arg
) == COMPLEX_EXPR
)
2344 rpart
= fold_convert_loc (loc
, TREE_TYPE (type
),
2345 TREE_OPERAND (arg
, 0));
2346 ipart
= fold_convert_loc (loc
, TREE_TYPE (type
),
2347 TREE_OPERAND (arg
, 1));
2348 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rpart
, ipart
);
2351 arg
= save_expr (arg
);
2352 rpart
= fold_build1_loc (loc
, REALPART_EXPR
, TREE_TYPE (orig
), arg
);
2353 ipart
= fold_build1_loc (loc
, IMAGPART_EXPR
, TREE_TYPE (orig
), arg
);
2354 rpart
= fold_convert_loc (loc
, TREE_TYPE (type
), rpart
);
2355 ipart
= fold_convert_loc (loc
, TREE_TYPE (type
), ipart
);
2356 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rpart
, ipart
);
2364 if (integer_zerop (arg
))
2365 return build_zero_vector (type
);
2366 gcc_assert (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (orig
)));
2367 gcc_assert (INTEGRAL_TYPE_P (orig
) || POINTER_TYPE_P (orig
)
2368 || TREE_CODE (orig
) == VECTOR_TYPE
);
2369 return fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, type
, arg
);
2372 tem
= fold_ignored_result (arg
);
2373 return fold_build1_loc (loc
, NOP_EXPR
, type
, tem
);
2376 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (orig
))
2377 return fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
2381 protected_set_expr_location_unshare (tem
, loc
);
2385 /* Return false if expr can be assumed not to be an lvalue, true
2389 maybe_lvalue_p (const_tree x
)
2391 /* We only need to wrap lvalue tree codes. */
2392 switch (TREE_CODE (x
))
2405 case ARRAY_RANGE_REF
:
2411 case PREINCREMENT_EXPR
:
2412 case PREDECREMENT_EXPR
:
2414 case TRY_CATCH_EXPR
:
2415 case WITH_CLEANUP_EXPR
:
2424 /* Assume the worst for front-end tree codes. */
2425 if ((int)TREE_CODE (x
) >= NUM_TREE_CODES
)
2433 /* Return an expr equal to X but certainly not valid as an lvalue. */
2436 non_lvalue_loc (location_t loc
, tree x
)
2438 /* While we are in GIMPLE, NON_LVALUE_EXPR doesn't mean anything to
2443 if (! maybe_lvalue_p (x
))
2445 return build1_loc (loc
, NON_LVALUE_EXPR
, TREE_TYPE (x
), x
);
2448 /* When pedantic, return an expr equal to X but certainly not valid as a
2449 pedantic lvalue. Otherwise, return X. */
2452 pedantic_non_lvalue_loc (location_t loc
, tree x
)
2454 return protected_set_expr_location_unshare (x
, loc
);
2457 /* Given a tree comparison code, return the code that is the logical inverse.
2458 It is generally not safe to do this for floating-point comparisons, except
2459 for EQ_EXPR, NE_EXPR, ORDERED_EXPR and UNORDERED_EXPR, so we return
2460 ERROR_MARK in this case. */
2463 invert_tree_comparison (enum tree_code code
, bool honor_nans
)
2465 if (honor_nans
&& flag_trapping_math
&& code
!= EQ_EXPR
&& code
!= NE_EXPR
2466 && code
!= ORDERED_EXPR
&& code
!= UNORDERED_EXPR
)
2476 return honor_nans
? UNLE_EXPR
: LE_EXPR
;
2478 return honor_nans
? UNLT_EXPR
: LT_EXPR
;
2480 return honor_nans
? UNGE_EXPR
: GE_EXPR
;
2482 return honor_nans
? UNGT_EXPR
: GT_EXPR
;
2496 return UNORDERED_EXPR
;
2497 case UNORDERED_EXPR
:
2498 return ORDERED_EXPR
;
2504 /* Similar, but return the comparison that results if the operands are
2505 swapped. This is safe for floating-point. */
2508 swap_tree_comparison (enum tree_code code
)
2515 case UNORDERED_EXPR
:
2541 /* Convert a comparison tree code from an enum tree_code representation
2542 into a compcode bit-based encoding. This function is the inverse of
2543 compcode_to_comparison. */
2545 static enum comparison_code
2546 comparison_to_compcode (enum tree_code code
)
2563 return COMPCODE_ORD
;
2564 case UNORDERED_EXPR
:
2565 return COMPCODE_UNORD
;
2567 return COMPCODE_UNLT
;
2569 return COMPCODE_UNEQ
;
2571 return COMPCODE_UNLE
;
2573 return COMPCODE_UNGT
;
2575 return COMPCODE_LTGT
;
2577 return COMPCODE_UNGE
;
2583 /* Convert a compcode bit-based encoding of a comparison operator back
2584 to GCC's enum tree_code representation. This function is the
2585 inverse of comparison_to_compcode. */
2587 static enum tree_code
2588 compcode_to_comparison (enum comparison_code code
)
2605 return ORDERED_EXPR
;
2606 case COMPCODE_UNORD
:
2607 return UNORDERED_EXPR
;
2625 /* Return a tree for the comparison which is the combination of
2626 doing the AND or OR (depending on CODE) of the two operations LCODE
2627 and RCODE on the identical operands LL_ARG and LR_ARG. Take into account
2628 the possibility of trapping if the mode has NaNs, and return NULL_TREE
2629 if this makes the transformation invalid. */
2632 combine_comparisons (location_t loc
,
2633 enum tree_code code
, enum tree_code lcode
,
2634 enum tree_code rcode
, tree truth_type
,
2635 tree ll_arg
, tree lr_arg
)
2637 bool honor_nans
= HONOR_NANS (ll_arg
);
2638 enum comparison_code lcompcode
= comparison_to_compcode (lcode
);
2639 enum comparison_code rcompcode
= comparison_to_compcode (rcode
);
2644 case TRUTH_AND_EXPR
: case TRUTH_ANDIF_EXPR
:
2645 compcode
= lcompcode
& rcompcode
;
2648 case TRUTH_OR_EXPR
: case TRUTH_ORIF_EXPR
:
2649 compcode
= lcompcode
| rcompcode
;
2658 /* Eliminate unordered comparisons, as well as LTGT and ORD
2659 which are not used unless the mode has NaNs. */
2660 compcode
&= ~COMPCODE_UNORD
;
2661 if (compcode
== COMPCODE_LTGT
)
2662 compcode
= COMPCODE_NE
;
2663 else if (compcode
== COMPCODE_ORD
)
2664 compcode
= COMPCODE_TRUE
;
2666 else if (flag_trapping_math
)
2668 /* Check that the original operation and the optimized ones will trap
2669 under the same condition. */
2670 bool ltrap
= (lcompcode
& COMPCODE_UNORD
) == 0
2671 && (lcompcode
!= COMPCODE_EQ
)
2672 && (lcompcode
!= COMPCODE_ORD
);
2673 bool rtrap
= (rcompcode
& COMPCODE_UNORD
) == 0
2674 && (rcompcode
!= COMPCODE_EQ
)
2675 && (rcompcode
!= COMPCODE_ORD
);
2676 bool trap
= (compcode
& COMPCODE_UNORD
) == 0
2677 && (compcode
!= COMPCODE_EQ
)
2678 && (compcode
!= COMPCODE_ORD
);
2680 /* In a short-circuited boolean expression the LHS might be
2681 such that the RHS, if evaluated, will never trap. For
2682 example, in ORD (x, y) && (x < y), we evaluate the RHS only
2683 if neither x nor y is NaN. (This is a mixed blessing: for
2684 example, the expression above will never trap, hence
2685 optimizing it to x < y would be invalid). */
2686 if ((code
== TRUTH_ORIF_EXPR
&& (lcompcode
& COMPCODE_UNORD
))
2687 || (code
== TRUTH_ANDIF_EXPR
&& !(lcompcode
& COMPCODE_UNORD
)))
2690 /* If the comparison was short-circuited, and only the RHS
2691 trapped, we may now generate a spurious trap. */
2693 && (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
))
2696 /* If we changed the conditions that cause a trap, we lose. */
2697 if ((ltrap
|| rtrap
) != trap
)
2701 if (compcode
== COMPCODE_TRUE
)
2702 return constant_boolean_node (true, truth_type
);
2703 else if (compcode
== COMPCODE_FALSE
)
2704 return constant_boolean_node (false, truth_type
);
2707 enum tree_code tcode
;
2709 tcode
= compcode_to_comparison ((enum comparison_code
) compcode
);
2710 return fold_build2_loc (loc
, tcode
, truth_type
, ll_arg
, lr_arg
);
2714 /* Return nonzero if two operands (typically of the same tree node)
2715 are necessarily equal. FLAGS modifies behavior as follows:
2717 If OEP_ONLY_CONST is set, only return nonzero for constants.
2718 This function tests whether the operands are indistinguishable;
2719 it does not test whether they are equal using C's == operation.
2720 The distinction is important for IEEE floating point, because
2721 (1) -0.0 and 0.0 are distinguishable, but -0.0==0.0, and
2722 (2) two NaNs may be indistinguishable, but NaN!=NaN.
2724 If OEP_ONLY_CONST is unset, a VAR_DECL is considered equal to itself
2725 even though it may hold multiple values during a function.
2726 This is because a GCC tree node guarantees that nothing else is
2727 executed between the evaluation of its "operands" (which may often
2728 be evaluated in arbitrary order). Hence if the operands themselves
2729 don't side-effect, the VAR_DECLs, PARM_DECLs etc... must hold the
2730 same value in each operand/subexpression. Hence leaving OEP_ONLY_CONST
2731 unset means assuming isochronic (or instantaneous) tree equivalence.
2732 Unless comparing arbitrary expression trees, such as from different
2733 statements, this flag can usually be left unset.
2735 If OEP_PURE_SAME is set, then pure functions with identical arguments
2736 are considered the same. It is used when the caller has other ways
2737 to ensure that global memory is unchanged in between.
2739 If OEP_ADDRESS_OF is set, we are actually comparing addresses of objects,
2740 not values of expressions.
2742 Unless OEP_MATCH_SIDE_EFFECTS is set, the function returns false on
2743 any operand with side effect. This is unnecesarily conservative in the
2744 case we know that arg0 and arg1 are in disjoint code paths (such as in
2745 ?: operator). In addition OEP_MATCH_SIDE_EFFECTS is used when comparing
2746 addresses with TREE_CONSTANT flag set so we know that &var == &var
2747 even if var is volatile. */
2750 operand_equal_p (const_tree arg0
, const_tree arg1
, unsigned int flags
)
2752 /* If either is ERROR_MARK, they aren't equal. */
2753 if (TREE_CODE (arg0
) == ERROR_MARK
|| TREE_CODE (arg1
) == ERROR_MARK
2754 || TREE_TYPE (arg0
) == error_mark_node
2755 || TREE_TYPE (arg1
) == error_mark_node
)
2758 /* Similar, if either does not have a type (like a released SSA name),
2759 they aren't equal. */
2760 if (!TREE_TYPE (arg0
) || !TREE_TYPE (arg1
))
2763 /* We cannot consider pointers to different address space equal. */
2764 if (POINTER_TYPE_P (TREE_TYPE (arg0
))
2765 && POINTER_TYPE_P (TREE_TYPE (arg1
))
2766 && (TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (arg0
)))
2767 != TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (arg1
)))))
2770 /* Check equality of integer constants before bailing out due to
2771 precision differences. */
2772 if (TREE_CODE (arg0
) == INTEGER_CST
&& TREE_CODE (arg1
) == INTEGER_CST
)
2774 /* Address of INTEGER_CST is not defined; check that we did not forget
2775 to drop the OEP_ADDRESS_OF flags. */
2776 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
2777 return tree_int_cst_equal (arg0
, arg1
);
2780 if (!(flags
& OEP_ADDRESS_OF
))
2782 /* If both types don't have the same signedness, then we can't consider
2783 them equal. We must check this before the STRIP_NOPS calls
2784 because they may change the signedness of the arguments. As pointers
2785 strictly don't have a signedness, require either two pointers or
2786 two non-pointers as well. */
2787 if (TYPE_UNSIGNED (TREE_TYPE (arg0
)) != TYPE_UNSIGNED (TREE_TYPE (arg1
))
2788 || POINTER_TYPE_P (TREE_TYPE (arg0
))
2789 != POINTER_TYPE_P (TREE_TYPE (arg1
)))
2792 /* If both types don't have the same precision, then it is not safe
2794 if (element_precision (TREE_TYPE (arg0
))
2795 != element_precision (TREE_TYPE (arg1
)))
2802 /* FIXME: Fortran FE currently produce ADDR_EXPR of NOP_EXPR. Enable the
2803 sanity check once the issue is solved. */
2805 /* Addresses of conversions and SSA_NAMEs (and many other things)
2806 are not defined. Check that we did not forget to drop the
2807 OEP_ADDRESS_OF/OEP_CONSTANT_ADDRESS_OF flags. */
2808 gcc_checking_assert (!CONVERT_EXPR_P (arg0
) && !CONVERT_EXPR_P (arg1
)
2809 && TREE_CODE (arg0
) != SSA_NAME
);
2812 /* In case both args are comparisons but with different comparison
2813 code, try to swap the comparison operands of one arg to produce
2814 a match and compare that variant. */
2815 if (TREE_CODE (arg0
) != TREE_CODE (arg1
)
2816 && COMPARISON_CLASS_P (arg0
)
2817 && COMPARISON_CLASS_P (arg1
))
2819 enum tree_code swap_code
= swap_tree_comparison (TREE_CODE (arg1
));
2821 if (TREE_CODE (arg0
) == swap_code
)
2822 return operand_equal_p (TREE_OPERAND (arg0
, 0),
2823 TREE_OPERAND (arg1
, 1), flags
)
2824 && operand_equal_p (TREE_OPERAND (arg0
, 1),
2825 TREE_OPERAND (arg1
, 0), flags
);
2828 if (TREE_CODE (arg0
) != TREE_CODE (arg1
))
2830 /* NOP_EXPR and CONVERT_EXPR are considered equal. */
2831 if (CONVERT_EXPR_P (arg0
) && CONVERT_EXPR_P (arg1
))
2833 else if (flags
& OEP_ADDRESS_OF
)
2835 /* If we are interested in comparing addresses ignore
2836 MEM_REF wrappings of the base that can appear just for
2838 if (TREE_CODE (arg0
) == MEM_REF
2840 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == ADDR_EXPR
2841 && TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0) == arg1
2842 && integer_zerop (TREE_OPERAND (arg0
, 1)))
2844 else if (TREE_CODE (arg1
) == MEM_REF
2846 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == ADDR_EXPR
2847 && TREE_OPERAND (TREE_OPERAND (arg1
, 0), 0) == arg0
2848 && integer_zerop (TREE_OPERAND (arg1
, 1)))
2856 /* When not checking adddresses, this is needed for conversions and for
2857 COMPONENT_REF. Might as well play it safe and always test this. */
2858 if (TREE_CODE (TREE_TYPE (arg0
)) == ERROR_MARK
2859 || TREE_CODE (TREE_TYPE (arg1
)) == ERROR_MARK
2860 || (TYPE_MODE (TREE_TYPE (arg0
)) != TYPE_MODE (TREE_TYPE (arg1
))
2861 && !(flags
& OEP_ADDRESS_OF
)))
2864 /* If ARG0 and ARG1 are the same SAVE_EXPR, they are necessarily equal.
2865 We don't care about side effects in that case because the SAVE_EXPR
2866 takes care of that for us. In all other cases, two expressions are
2867 equal if they have no side effects. If we have two identical
2868 expressions with side effects that should be treated the same due
2869 to the only side effects being identical SAVE_EXPR's, that will
2870 be detected in the recursive calls below.
2871 If we are taking an invariant address of two identical objects
2872 they are necessarily equal as well. */
2873 if (arg0
== arg1
&& ! (flags
& OEP_ONLY_CONST
)
2874 && (TREE_CODE (arg0
) == SAVE_EXPR
2875 || (flags
& OEP_MATCH_SIDE_EFFECTS
)
2876 || (! TREE_SIDE_EFFECTS (arg0
) && ! TREE_SIDE_EFFECTS (arg1
))))
2879 /* Next handle constant cases, those for which we can return 1 even
2880 if ONLY_CONST is set. */
2881 if (TREE_CONSTANT (arg0
) && TREE_CONSTANT (arg1
))
2882 switch (TREE_CODE (arg0
))
2885 return tree_int_cst_equal (arg0
, arg1
);
2888 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (arg0
),
2889 TREE_FIXED_CST (arg1
));
2892 if (real_identical (&TREE_REAL_CST (arg0
), &TREE_REAL_CST (arg1
)))
2896 if (!HONOR_SIGNED_ZEROS (arg0
))
2898 /* If we do not distinguish between signed and unsigned zero,
2899 consider them equal. */
2900 if (real_zerop (arg0
) && real_zerop (arg1
))
2909 if (VECTOR_CST_NELTS (arg0
) != VECTOR_CST_NELTS (arg1
))
2912 for (i
= 0; i
< VECTOR_CST_NELTS (arg0
); ++i
)
2914 if (!operand_equal_p (VECTOR_CST_ELT (arg0
, i
),
2915 VECTOR_CST_ELT (arg1
, i
), flags
))
2922 return (operand_equal_p (TREE_REALPART (arg0
), TREE_REALPART (arg1
),
2924 && operand_equal_p (TREE_IMAGPART (arg0
), TREE_IMAGPART (arg1
),
2928 return (TREE_STRING_LENGTH (arg0
) == TREE_STRING_LENGTH (arg1
)
2929 && ! memcmp (TREE_STRING_POINTER (arg0
),
2930 TREE_STRING_POINTER (arg1
),
2931 TREE_STRING_LENGTH (arg0
)));
2934 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
2935 return operand_equal_p (TREE_OPERAND (arg0
, 0), TREE_OPERAND (arg1
, 0),
2936 flags
| OEP_ADDRESS_OF
2937 | OEP_MATCH_SIDE_EFFECTS
);
2939 /* In GIMPLE empty constructors are allowed in initializers of
2941 return (!vec_safe_length (CONSTRUCTOR_ELTS (arg0
))
2942 && !vec_safe_length (CONSTRUCTOR_ELTS (arg1
)));
2947 if (flags
& OEP_ONLY_CONST
)
2950 /* Define macros to test an operand from arg0 and arg1 for equality and a
2951 variant that allows null and views null as being different from any
2952 non-null value. In the latter case, if either is null, the both
2953 must be; otherwise, do the normal comparison. */
2954 #define OP_SAME(N) operand_equal_p (TREE_OPERAND (arg0, N), \
2955 TREE_OPERAND (arg1, N), flags)
2957 #define OP_SAME_WITH_NULL(N) \
2958 ((!TREE_OPERAND (arg0, N) || !TREE_OPERAND (arg1, N)) \
2959 ? TREE_OPERAND (arg0, N) == TREE_OPERAND (arg1, N) : OP_SAME (N))
2961 switch (TREE_CODE_CLASS (TREE_CODE (arg0
)))
2964 /* Two conversions are equal only if signedness and modes match. */
2965 switch (TREE_CODE (arg0
))
2968 case FIX_TRUNC_EXPR
:
2969 if (TYPE_UNSIGNED (TREE_TYPE (arg0
))
2970 != TYPE_UNSIGNED (TREE_TYPE (arg1
)))
2980 case tcc_comparison
:
2982 if (OP_SAME (0) && OP_SAME (1))
2985 /* For commutative ops, allow the other order. */
2986 return (commutative_tree_code (TREE_CODE (arg0
))
2987 && operand_equal_p (TREE_OPERAND (arg0
, 0),
2988 TREE_OPERAND (arg1
, 1), flags
)
2989 && operand_equal_p (TREE_OPERAND (arg0
, 1),
2990 TREE_OPERAND (arg1
, 0), flags
));
2993 /* If either of the pointer (or reference) expressions we are
2994 dereferencing contain a side effect, these cannot be equal,
2995 but their addresses can be. */
2996 if ((flags
& OEP_MATCH_SIDE_EFFECTS
) == 0
2997 && (TREE_SIDE_EFFECTS (arg0
)
2998 || TREE_SIDE_EFFECTS (arg1
)))
3001 switch (TREE_CODE (arg0
))
3004 if (!(flags
& OEP_ADDRESS_OF
)
3005 && (TYPE_ALIGN (TREE_TYPE (arg0
))
3006 != TYPE_ALIGN (TREE_TYPE (arg1
))))
3008 flags
&= ~OEP_ADDRESS_OF
;
3012 /* Require the same offset. */
3013 if (!operand_equal_p (TYPE_SIZE (TREE_TYPE (arg0
)),
3014 TYPE_SIZE (TREE_TYPE (arg1
)),
3015 flags
& ~OEP_ADDRESS_OF
))
3020 case VIEW_CONVERT_EXPR
:
3023 case TARGET_MEM_REF
:
3025 if (!(flags
& OEP_ADDRESS_OF
))
3027 /* Require equal access sizes */
3028 if (TYPE_SIZE (TREE_TYPE (arg0
)) != TYPE_SIZE (TREE_TYPE (arg1
))
3029 && (!TYPE_SIZE (TREE_TYPE (arg0
))
3030 || !TYPE_SIZE (TREE_TYPE (arg1
))
3031 || !operand_equal_p (TYPE_SIZE (TREE_TYPE (arg0
)),
3032 TYPE_SIZE (TREE_TYPE (arg1
)),
3035 /* Verify that accesses are TBAA compatible. */
3036 if (!alias_ptr_types_compatible_p
3037 (TREE_TYPE (TREE_OPERAND (arg0
, 1)),
3038 TREE_TYPE (TREE_OPERAND (arg1
, 1)))
3039 || (MR_DEPENDENCE_CLIQUE (arg0
)
3040 != MR_DEPENDENCE_CLIQUE (arg1
))
3041 || (MR_DEPENDENCE_BASE (arg0
)
3042 != MR_DEPENDENCE_BASE (arg1
)))
3044 /* Verify that alignment is compatible. */
3045 if (TYPE_ALIGN (TREE_TYPE (arg0
))
3046 != TYPE_ALIGN (TREE_TYPE (arg1
)))
3049 flags
&= ~OEP_ADDRESS_OF
;
3050 return (OP_SAME (0) && OP_SAME (1)
3051 /* TARGET_MEM_REF require equal extra operands. */
3052 && (TREE_CODE (arg0
) != TARGET_MEM_REF
3053 || (OP_SAME_WITH_NULL (2)
3054 && OP_SAME_WITH_NULL (3)
3055 && OP_SAME_WITH_NULL (4))));
3058 case ARRAY_RANGE_REF
:
3061 flags
&= ~OEP_ADDRESS_OF
;
3062 /* Compare the array index by value if it is constant first as we
3063 may have different types but same value here. */
3064 return ((tree_int_cst_equal (TREE_OPERAND (arg0
, 1),
3065 TREE_OPERAND (arg1
, 1))
3067 && OP_SAME_WITH_NULL (2)
3068 && OP_SAME_WITH_NULL (3)
3069 /* Compare low bound and element size as with OEP_ADDRESS_OF
3070 we have to account for the offset of the ref. */
3071 && (TREE_TYPE (TREE_OPERAND (arg0
, 0))
3072 == TREE_TYPE (TREE_OPERAND (arg1
, 0))
3073 || (operand_equal_p (array_ref_low_bound
3074 (CONST_CAST_TREE (arg0
)),
3076 (CONST_CAST_TREE (arg1
)), flags
)
3077 && operand_equal_p (array_ref_element_size
3078 (CONST_CAST_TREE (arg0
)),
3079 array_ref_element_size
3080 (CONST_CAST_TREE (arg1
)),
3084 /* Handle operand 2 the same as for ARRAY_REF. Operand 0
3085 may be NULL when we're called to compare MEM_EXPRs. */
3086 if (!OP_SAME_WITH_NULL (0)
3089 flags
&= ~OEP_ADDRESS_OF
;
3090 return OP_SAME_WITH_NULL (2);
3095 flags
&= ~OEP_ADDRESS_OF
;
3096 return OP_SAME (1) && OP_SAME (2);
3102 case tcc_expression
:
3103 switch (TREE_CODE (arg0
))
3106 /* Be sure we pass right ADDRESS_OF flag. */
3107 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
3108 return operand_equal_p (TREE_OPERAND (arg0
, 0),
3109 TREE_OPERAND (arg1
, 0),
3110 flags
| OEP_ADDRESS_OF
);
3112 case TRUTH_NOT_EXPR
:
3115 case TRUTH_ANDIF_EXPR
:
3116 case TRUTH_ORIF_EXPR
:
3117 return OP_SAME (0) && OP_SAME (1);
3120 case WIDEN_MULT_PLUS_EXPR
:
3121 case WIDEN_MULT_MINUS_EXPR
:
3124 /* The multiplcation operands are commutative. */
3127 case TRUTH_AND_EXPR
:
3129 case TRUTH_XOR_EXPR
:
3130 if (OP_SAME (0) && OP_SAME (1))
3133 /* Otherwise take into account this is a commutative operation. */
3134 return (operand_equal_p (TREE_OPERAND (arg0
, 0),
3135 TREE_OPERAND (arg1
, 1), flags
)
3136 && operand_equal_p (TREE_OPERAND (arg0
, 1),
3137 TREE_OPERAND (arg1
, 0), flags
));
3140 if (! OP_SAME (1) || ! OP_SAME (2))
3142 flags
&= ~OEP_ADDRESS_OF
;
3147 return OP_SAME (0) && OP_SAME (1) && OP_SAME (2);
3154 switch (TREE_CODE (arg0
))
3157 if ((CALL_EXPR_FN (arg0
) == NULL_TREE
)
3158 != (CALL_EXPR_FN (arg1
) == NULL_TREE
))
3159 /* If not both CALL_EXPRs are either internal or normal function
3160 functions, then they are not equal. */
3162 else if (CALL_EXPR_FN (arg0
) == NULL_TREE
)
3164 /* If the CALL_EXPRs call different internal functions, then they
3166 if (CALL_EXPR_IFN (arg0
) != CALL_EXPR_IFN (arg1
))
3171 /* If the CALL_EXPRs call different functions, then they are not
3173 if (! operand_equal_p (CALL_EXPR_FN (arg0
), CALL_EXPR_FN (arg1
),
3178 /* FIXME: We could skip this test for OEP_MATCH_SIDE_EFFECTS. */
3180 unsigned int cef
= call_expr_flags (arg0
);
3181 if (flags
& OEP_PURE_SAME
)
3182 cef
&= ECF_CONST
| ECF_PURE
;
3189 /* Now see if all the arguments are the same. */
3191 const_call_expr_arg_iterator iter0
, iter1
;
3193 for (a0
= first_const_call_expr_arg (arg0
, &iter0
),
3194 a1
= first_const_call_expr_arg (arg1
, &iter1
);
3196 a0
= next_const_call_expr_arg (&iter0
),
3197 a1
= next_const_call_expr_arg (&iter1
))
3198 if (! operand_equal_p (a0
, a1
, flags
))
3201 /* If we get here and both argument lists are exhausted
3202 then the CALL_EXPRs are equal. */
3203 return ! (a0
|| a1
);
3209 case tcc_declaration
:
3210 /* Consider __builtin_sqrt equal to sqrt. */
3211 return (TREE_CODE (arg0
) == FUNCTION_DECL
3212 && DECL_BUILT_IN (arg0
) && DECL_BUILT_IN (arg1
)
3213 && DECL_BUILT_IN_CLASS (arg0
) == DECL_BUILT_IN_CLASS (arg1
)
3214 && DECL_FUNCTION_CODE (arg0
) == DECL_FUNCTION_CODE (arg1
));
3216 case tcc_exceptional
:
3217 if (TREE_CODE (arg0
) == CONSTRUCTOR
)
3219 /* In GIMPLE constructors are used only to build vectors from
3220 elements. Individual elements in the constructor must be
3221 indexed in increasing order and form an initial sequence.
3223 We make no effort to compare constructors in generic.
3224 (see sem_variable::equals in ipa-icf which can do so for
3226 if (!VECTOR_TYPE_P (TREE_TYPE (arg0
))
3227 || !VECTOR_TYPE_P (TREE_TYPE (arg1
)))
3230 /* Be sure that vectors constructed have the same representation.
3231 We only tested element precision and modes to match.
3232 Vectors may be BLKmode and thus also check that the number of
3234 if (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0
))
3235 != TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg1
)))
3238 vec
<constructor_elt
, va_gc
> *v0
= CONSTRUCTOR_ELTS (arg0
);
3239 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (arg1
);
3240 unsigned int len
= vec_safe_length (v0
);
3242 if (len
!= vec_safe_length (v1
))
3245 for (unsigned int i
= 0; i
< len
; i
++)
3247 constructor_elt
*c0
= &(*v0
)[i
];
3248 constructor_elt
*c1
= &(*v1
)[i
];
3250 if (!operand_equal_p (c0
->value
, c1
->value
, flags
)
3251 /* In GIMPLE the indexes can be either NULL or matching i.
3252 Double check this so we won't get false
3253 positives for GENERIC. */
3255 && (TREE_CODE (c0
->index
) != INTEGER_CST
3256 || !compare_tree_int (c0
->index
, i
)))
3258 && (TREE_CODE (c1
->index
) != INTEGER_CST
3259 || !compare_tree_int (c1
->index
, i
))))
3271 #undef OP_SAME_WITH_NULL
3274 /* Similar to operand_equal_p, but see if ARG0 might have been made by
3275 shorten_compare from ARG1 when ARG1 was being compared with OTHER.
3277 When in doubt, return 0. */
3280 operand_equal_for_comparison_p (tree arg0
, tree arg1
, tree other
)
3282 int unsignedp1
, unsignedpo
;
3283 tree primarg0
, primarg1
, primother
;
3284 unsigned int correct_width
;
3286 if (operand_equal_p (arg0
, arg1
, 0))
3289 if (! INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
3290 || ! INTEGRAL_TYPE_P (TREE_TYPE (arg1
)))
3293 /* Discard any conversions that don't change the modes of ARG0 and ARG1
3294 and see if the inner values are the same. This removes any
3295 signedness comparison, which doesn't matter here. */
3296 primarg0
= arg0
, primarg1
= arg1
;
3297 STRIP_NOPS (primarg0
);
3298 STRIP_NOPS (primarg1
);
3299 if (operand_equal_p (primarg0
, primarg1
, 0))
3302 /* Duplicate what shorten_compare does to ARG1 and see if that gives the
3303 actual comparison operand, ARG0.
3305 First throw away any conversions to wider types
3306 already present in the operands. */
3308 primarg1
= get_narrower (arg1
, &unsignedp1
);
3309 primother
= get_narrower (other
, &unsignedpo
);
3311 correct_width
= TYPE_PRECISION (TREE_TYPE (arg1
));
3312 if (unsignedp1
== unsignedpo
3313 && TYPE_PRECISION (TREE_TYPE (primarg1
)) < correct_width
3314 && TYPE_PRECISION (TREE_TYPE (primother
)) < correct_width
)
3316 tree type
= TREE_TYPE (arg0
);
3318 /* Make sure shorter operand is extended the right way
3319 to match the longer operand. */
3320 primarg1
= fold_convert (signed_or_unsigned_type_for
3321 (unsignedp1
, TREE_TYPE (primarg1
)), primarg1
);
3323 if (operand_equal_p (arg0
, fold_convert (type
, primarg1
), 0))
3330 /* See if ARG is an expression that is either a comparison or is performing
3331 arithmetic on comparisons. The comparisons must only be comparing
3332 two different values, which will be stored in *CVAL1 and *CVAL2; if
3333 they are nonzero it means that some operands have already been found.
3334 No variables may be used anywhere else in the expression except in the
3335 comparisons. If SAVE_P is true it means we removed a SAVE_EXPR around
3336 the expression and save_expr needs to be called with CVAL1 and CVAL2.
3338 If this is true, return 1. Otherwise, return zero. */
3341 twoval_comparison_p (tree arg
, tree
*cval1
, tree
*cval2
, int *save_p
)
3343 enum tree_code code
= TREE_CODE (arg
);
3344 enum tree_code_class tclass
= TREE_CODE_CLASS (code
);
3346 /* We can handle some of the tcc_expression cases here. */
3347 if (tclass
== tcc_expression
&& code
== TRUTH_NOT_EXPR
)
3349 else if (tclass
== tcc_expression
3350 && (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
3351 || code
== COMPOUND_EXPR
))
3352 tclass
= tcc_binary
;
3354 else if (tclass
== tcc_expression
&& code
== SAVE_EXPR
3355 && ! TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
3357 /* If we've already found a CVAL1 or CVAL2, this expression is
3358 two complex to handle. */
3359 if (*cval1
|| *cval2
)
3369 return twoval_comparison_p (TREE_OPERAND (arg
, 0), cval1
, cval2
, save_p
);
3372 return (twoval_comparison_p (TREE_OPERAND (arg
, 0), cval1
, cval2
, save_p
)
3373 && twoval_comparison_p (TREE_OPERAND (arg
, 1),
3374 cval1
, cval2
, save_p
));
3379 case tcc_expression
:
3380 if (code
== COND_EXPR
)
3381 return (twoval_comparison_p (TREE_OPERAND (arg
, 0),
3382 cval1
, cval2
, save_p
)
3383 && twoval_comparison_p (TREE_OPERAND (arg
, 1),
3384 cval1
, cval2
, save_p
)
3385 && twoval_comparison_p (TREE_OPERAND (arg
, 2),
3386 cval1
, cval2
, save_p
));
3389 case tcc_comparison
:
3390 /* First see if we can handle the first operand, then the second. For
3391 the second operand, we know *CVAL1 can't be zero. It must be that
3392 one side of the comparison is each of the values; test for the
3393 case where this isn't true by failing if the two operands
3396 if (operand_equal_p (TREE_OPERAND (arg
, 0),
3397 TREE_OPERAND (arg
, 1), 0))
3401 *cval1
= TREE_OPERAND (arg
, 0);
3402 else if (operand_equal_p (*cval1
, TREE_OPERAND (arg
, 0), 0))
3404 else if (*cval2
== 0)
3405 *cval2
= TREE_OPERAND (arg
, 0);
3406 else if (operand_equal_p (*cval2
, TREE_OPERAND (arg
, 0), 0))
3411 if (operand_equal_p (*cval1
, TREE_OPERAND (arg
, 1), 0))
3413 else if (*cval2
== 0)
3414 *cval2
= TREE_OPERAND (arg
, 1);
3415 else if (operand_equal_p (*cval2
, TREE_OPERAND (arg
, 1), 0))
3427 /* ARG is a tree that is known to contain just arithmetic operations and
3428 comparisons. Evaluate the operations in the tree substituting NEW0 for
3429 any occurrence of OLD0 as an operand of a comparison and likewise for
3433 eval_subst (location_t loc
, tree arg
, tree old0
, tree new0
,
3434 tree old1
, tree new1
)
3436 tree type
= TREE_TYPE (arg
);
3437 enum tree_code code
= TREE_CODE (arg
);
3438 enum tree_code_class tclass
= TREE_CODE_CLASS (code
);
3440 /* We can handle some of the tcc_expression cases here. */
3441 if (tclass
== tcc_expression
&& code
== TRUTH_NOT_EXPR
)
3443 else if (tclass
== tcc_expression
3444 && (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
))
3445 tclass
= tcc_binary
;
3450 return fold_build1_loc (loc
, code
, type
,
3451 eval_subst (loc
, TREE_OPERAND (arg
, 0),
3452 old0
, new0
, old1
, new1
));
3455 return fold_build2_loc (loc
, code
, type
,
3456 eval_subst (loc
, TREE_OPERAND (arg
, 0),
3457 old0
, new0
, old1
, new1
),
3458 eval_subst (loc
, TREE_OPERAND (arg
, 1),
3459 old0
, new0
, old1
, new1
));
3461 case tcc_expression
:
3465 return eval_subst (loc
, TREE_OPERAND (arg
, 0), old0
, new0
,
3469 return eval_subst (loc
, TREE_OPERAND (arg
, 1), old0
, new0
,
3473 return fold_build3_loc (loc
, code
, type
,
3474 eval_subst (loc
, TREE_OPERAND (arg
, 0),
3475 old0
, new0
, old1
, new1
),
3476 eval_subst (loc
, TREE_OPERAND (arg
, 1),
3477 old0
, new0
, old1
, new1
),
3478 eval_subst (loc
, TREE_OPERAND (arg
, 2),
3479 old0
, new0
, old1
, new1
));
3483 /* Fall through - ??? */
3485 case tcc_comparison
:
3487 tree arg0
= TREE_OPERAND (arg
, 0);
3488 tree arg1
= TREE_OPERAND (arg
, 1);
3490 /* We need to check both for exact equality and tree equality. The
3491 former will be true if the operand has a side-effect. In that
3492 case, we know the operand occurred exactly once. */
3494 if (arg0
== old0
|| operand_equal_p (arg0
, old0
, 0))
3496 else if (arg0
== old1
|| operand_equal_p (arg0
, old1
, 0))
3499 if (arg1
== old0
|| operand_equal_p (arg1
, old0
, 0))
3501 else if (arg1
== old1
|| operand_equal_p (arg1
, old1
, 0))
3504 return fold_build2_loc (loc
, code
, type
, arg0
, arg1
);
3512 /* Return a tree for the case when the result of an expression is RESULT
3513 converted to TYPE and OMITTED was previously an operand of the expression
3514 but is now not needed (e.g., we folded OMITTED * 0).
3516 If OMITTED has side effects, we must evaluate it. Otherwise, just do
3517 the conversion of RESULT to TYPE. */
3520 omit_one_operand_loc (location_t loc
, tree type
, tree result
, tree omitted
)
3522 tree t
= fold_convert_loc (loc
, type
, result
);
3524 /* If the resulting operand is an empty statement, just return the omitted
3525 statement casted to void. */
3526 if (IS_EMPTY_STMT (t
) && TREE_SIDE_EFFECTS (omitted
))
3527 return build1_loc (loc
, NOP_EXPR
, void_type_node
,
3528 fold_ignored_result (omitted
));
3530 if (TREE_SIDE_EFFECTS (omitted
))
3531 return build2_loc (loc
, COMPOUND_EXPR
, type
,
3532 fold_ignored_result (omitted
), t
);
3534 return non_lvalue_loc (loc
, t
);
3537 /* Return a tree for the case when the result of an expression is RESULT
3538 converted to TYPE and OMITTED1 and OMITTED2 were previously operands
3539 of the expression but are now not needed.
3541 If OMITTED1 or OMITTED2 has side effects, they must be evaluated.
3542 If both OMITTED1 and OMITTED2 have side effects, OMITTED1 is
3543 evaluated before OMITTED2. Otherwise, if neither has side effects,
3544 just do the conversion of RESULT to TYPE. */
3547 omit_two_operands_loc (location_t loc
, tree type
, tree result
,
3548 tree omitted1
, tree omitted2
)
3550 tree t
= fold_convert_loc (loc
, type
, result
);
3552 if (TREE_SIDE_EFFECTS (omitted2
))
3553 t
= build2_loc (loc
, COMPOUND_EXPR
, type
, omitted2
, t
);
3554 if (TREE_SIDE_EFFECTS (omitted1
))
3555 t
= build2_loc (loc
, COMPOUND_EXPR
, type
, omitted1
, t
);
3557 return TREE_CODE (t
) != COMPOUND_EXPR
? non_lvalue_loc (loc
, t
) : t
;
3561 /* Return a simplified tree node for the truth-negation of ARG. This
3562 never alters ARG itself. We assume that ARG is an operation that
3563 returns a truth value (0 or 1).
3565 FIXME: one would think we would fold the result, but it causes
3566 problems with the dominator optimizer. */
3569 fold_truth_not_expr (location_t loc
, tree arg
)
3571 tree type
= TREE_TYPE (arg
);
3572 enum tree_code code
= TREE_CODE (arg
);
3573 location_t loc1
, loc2
;
3575 /* If this is a comparison, we can simply invert it, except for
3576 floating-point non-equality comparisons, in which case we just
3577 enclose a TRUTH_NOT_EXPR around what we have. */
3579 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
3581 tree op_type
= TREE_TYPE (TREE_OPERAND (arg
, 0));
3582 if (FLOAT_TYPE_P (op_type
)
3583 && flag_trapping_math
3584 && code
!= ORDERED_EXPR
&& code
!= UNORDERED_EXPR
3585 && code
!= NE_EXPR
&& code
!= EQ_EXPR
)
3588 code
= invert_tree_comparison (code
, HONOR_NANS (op_type
));
3589 if (code
== ERROR_MARK
)
3592 return build2_loc (loc
, code
, type
, TREE_OPERAND (arg
, 0),
3593 TREE_OPERAND (arg
, 1));
3599 return constant_boolean_node (integer_zerop (arg
), type
);
3601 case TRUTH_AND_EXPR
:
3602 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3603 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3604 return build2_loc (loc
, TRUTH_OR_EXPR
, type
,
3605 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
3606 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
3609 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3610 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3611 return build2_loc (loc
, TRUTH_AND_EXPR
, type
,
3612 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
3613 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
3615 case TRUTH_XOR_EXPR
:
3616 /* Here we can invert either operand. We invert the first operand
3617 unless the second operand is a TRUTH_NOT_EXPR in which case our
3618 result is the XOR of the first operand with the inside of the
3619 negation of the second operand. */
3621 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == TRUTH_NOT_EXPR
)
3622 return build2_loc (loc
, TRUTH_XOR_EXPR
, type
, TREE_OPERAND (arg
, 0),
3623 TREE_OPERAND (TREE_OPERAND (arg
, 1), 0));
3625 return build2_loc (loc
, TRUTH_XOR_EXPR
, type
,
3626 invert_truthvalue_loc (loc
, TREE_OPERAND (arg
, 0)),
3627 TREE_OPERAND (arg
, 1));
3629 case TRUTH_ANDIF_EXPR
:
3630 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3631 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3632 return build2_loc (loc
, TRUTH_ORIF_EXPR
, type
,
3633 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
3634 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
3636 case TRUTH_ORIF_EXPR
:
3637 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3638 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3639 return build2_loc (loc
, TRUTH_ANDIF_EXPR
, type
,
3640 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
3641 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
3643 case TRUTH_NOT_EXPR
:
3644 return TREE_OPERAND (arg
, 0);
3648 tree arg1
= TREE_OPERAND (arg
, 1);
3649 tree arg2
= TREE_OPERAND (arg
, 2);
3651 loc1
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3652 loc2
= expr_location_or (TREE_OPERAND (arg
, 2), loc
);
3654 /* A COND_EXPR may have a throw as one operand, which
3655 then has void type. Just leave void operands
3657 return build3_loc (loc
, COND_EXPR
, type
, TREE_OPERAND (arg
, 0),
3658 VOID_TYPE_P (TREE_TYPE (arg1
))
3659 ? arg1
: invert_truthvalue_loc (loc1
, arg1
),
3660 VOID_TYPE_P (TREE_TYPE (arg2
))
3661 ? arg2
: invert_truthvalue_loc (loc2
, arg2
));
3665 loc1
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3666 return build2_loc (loc
, COMPOUND_EXPR
, type
,
3667 TREE_OPERAND (arg
, 0),
3668 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 1)));
3670 case NON_LVALUE_EXPR
:
3671 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3672 return invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0));
3675 if (TREE_CODE (TREE_TYPE (arg
)) == BOOLEAN_TYPE
)
3676 return build1_loc (loc
, TRUTH_NOT_EXPR
, type
, arg
);
3678 /* ... fall through ... */
3681 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3682 return build1_loc (loc
, TREE_CODE (arg
), type
,
3683 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)));
3686 if (!integer_onep (TREE_OPERAND (arg
, 1)))
3688 return build2_loc (loc
, EQ_EXPR
, type
, arg
, build_int_cst (type
, 0));
3691 return build1_loc (loc
, TRUTH_NOT_EXPR
, type
, arg
);
3693 case CLEANUP_POINT_EXPR
:
3694 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3695 return build1_loc (loc
, CLEANUP_POINT_EXPR
, type
,
3696 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)));
3703 /* Fold the truth-negation of ARG. This never alters ARG itself. We
3704 assume that ARG is an operation that returns a truth value (0 or 1
3705 for scalars, 0 or -1 for vectors). Return the folded expression if
3706 folding is successful. Otherwise, return NULL_TREE. */
3709 fold_invert_truthvalue (location_t loc
, tree arg
)
3711 tree type
= TREE_TYPE (arg
);
3712 return fold_unary_loc (loc
, VECTOR_TYPE_P (type
)
3718 /* Return a simplified tree node for the truth-negation of ARG. This
3719 never alters ARG itself. We assume that ARG is an operation that
3720 returns a truth value (0 or 1 for scalars, 0 or -1 for vectors). */
3723 invert_truthvalue_loc (location_t loc
, tree arg
)
3725 if (TREE_CODE (arg
) == ERROR_MARK
)
3728 tree type
= TREE_TYPE (arg
);
3729 return fold_build1_loc (loc
, VECTOR_TYPE_P (type
)
3735 /* Knowing that ARG0 and ARG1 are both RDIV_EXPRs, simplify a binary operation
3736 with code CODE. This optimization is unsafe. */
3738 distribute_real_division (location_t loc
, enum tree_code code
, tree type
,
3739 tree arg0
, tree arg1
)
3741 bool mul0
= TREE_CODE (arg0
) == MULT_EXPR
;
3742 bool mul1
= TREE_CODE (arg1
) == MULT_EXPR
;
3744 /* (A / C) +- (B / C) -> (A +- B) / C. */
3746 && operand_equal_p (TREE_OPERAND (arg0
, 1),
3747 TREE_OPERAND (arg1
, 1), 0))
3748 return fold_build2_loc (loc
, mul0
? MULT_EXPR
: RDIV_EXPR
, type
,
3749 fold_build2_loc (loc
, code
, type
,
3750 TREE_OPERAND (arg0
, 0),
3751 TREE_OPERAND (arg1
, 0)),
3752 TREE_OPERAND (arg0
, 1));
3754 /* (A / C1) +- (A / C2) -> A * (1 / C1 +- 1 / C2). */
3755 if (operand_equal_p (TREE_OPERAND (arg0
, 0),
3756 TREE_OPERAND (arg1
, 0), 0)
3757 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == REAL_CST
3758 && TREE_CODE (TREE_OPERAND (arg1
, 1)) == REAL_CST
)
3760 REAL_VALUE_TYPE r0
, r1
;
3761 r0
= TREE_REAL_CST (TREE_OPERAND (arg0
, 1));
3762 r1
= TREE_REAL_CST (TREE_OPERAND (arg1
, 1));
3764 real_arithmetic (&r0
, RDIV_EXPR
, &dconst1
, &r0
);
3766 real_arithmetic (&r1
, RDIV_EXPR
, &dconst1
, &r1
);
3767 real_arithmetic (&r0
, code
, &r0
, &r1
);
3768 return fold_build2_loc (loc
, MULT_EXPR
, type
,
3769 TREE_OPERAND (arg0
, 0),
3770 build_real (type
, r0
));
3776 /* Return a BIT_FIELD_REF of type TYPE to refer to BITSIZE bits of INNER
3777 starting at BITPOS. The field is unsigned if UNSIGNEDP is nonzero
3778 and uses reverse storage order if REVERSEP is nonzero. */
3781 make_bit_field_ref (location_t loc
, tree inner
, tree type
,
3782 HOST_WIDE_INT bitsize
, HOST_WIDE_INT bitpos
,
3783 int unsignedp
, int reversep
)
3785 tree result
, bftype
;
3787 if (bitpos
== 0 && !reversep
)
3789 tree size
= TYPE_SIZE (TREE_TYPE (inner
));
3790 if ((INTEGRAL_TYPE_P (TREE_TYPE (inner
))
3791 || POINTER_TYPE_P (TREE_TYPE (inner
)))
3792 && tree_fits_shwi_p (size
)
3793 && tree_to_shwi (size
) == bitsize
)
3794 return fold_convert_loc (loc
, type
, inner
);
3798 if (TYPE_PRECISION (bftype
) != bitsize
3799 || TYPE_UNSIGNED (bftype
) == !unsignedp
)
3800 bftype
= build_nonstandard_integer_type (bitsize
, 0);
3802 result
= build3_loc (loc
, BIT_FIELD_REF
, bftype
, inner
,
3803 size_int (bitsize
), bitsize_int (bitpos
));
3804 REF_REVERSE_STORAGE_ORDER (result
) = reversep
;
3807 result
= fold_convert_loc (loc
, type
, result
);
3812 /* Optimize a bit-field compare.
3814 There are two cases: First is a compare against a constant and the
3815 second is a comparison of two items where the fields are at the same
3816 bit position relative to the start of a chunk (byte, halfword, word)
3817 large enough to contain it. In these cases we can avoid the shift
3818 implicit in bitfield extractions.
3820 For constants, we emit a compare of the shifted constant with the
3821 BIT_AND_EXPR of a mask and a byte, halfword, or word of the operand being
3822 compared. For two fields at the same position, we do the ANDs with the
3823 similar mask and compare the result of the ANDs.
3825 CODE is the comparison code, known to be either NE_EXPR or EQ_EXPR.
3826 COMPARE_TYPE is the type of the comparison, and LHS and RHS
3827 are the left and right operands of the comparison, respectively.
3829 If the optimization described above can be done, we return the resulting
3830 tree. Otherwise we return zero. */
3833 optimize_bit_field_compare (location_t loc
, enum tree_code code
,
3834 tree compare_type
, tree lhs
, tree rhs
)
3836 HOST_WIDE_INT lbitpos
, lbitsize
, rbitpos
, rbitsize
, nbitpos
, nbitsize
;
3837 tree type
= TREE_TYPE (lhs
);
3839 int const_p
= TREE_CODE (rhs
) == INTEGER_CST
;
3840 machine_mode lmode
, rmode
, nmode
;
3841 int lunsignedp
, runsignedp
;
3842 int lreversep
, rreversep
;
3843 int lvolatilep
= 0, rvolatilep
= 0;
3844 tree linner
, rinner
= NULL_TREE
;
3848 /* Get all the information about the extractions being done. If the bit size
3849 if the same as the size of the underlying object, we aren't doing an
3850 extraction at all and so can do nothing. We also don't want to
3851 do anything if the inner expression is a PLACEHOLDER_EXPR since we
3852 then will no longer be able to replace it. */
3853 linner
= get_inner_reference (lhs
, &lbitsize
, &lbitpos
, &offset
, &lmode
,
3854 &lunsignedp
, &lreversep
, &lvolatilep
, false);
3855 if (linner
== lhs
|| lbitsize
== GET_MODE_BITSIZE (lmode
) || lbitsize
< 0
3856 || offset
!= 0 || TREE_CODE (linner
) == PLACEHOLDER_EXPR
|| lvolatilep
)
3860 rreversep
= lreversep
;
3863 /* If this is not a constant, we can only do something if bit positions,
3864 sizes, signedness and storage order are the same. */
3866 = get_inner_reference (rhs
, &rbitsize
, &rbitpos
, &offset
, &rmode
,
3867 &runsignedp
, &rreversep
, &rvolatilep
, false);
3869 if (rinner
== rhs
|| lbitpos
!= rbitpos
|| lbitsize
!= rbitsize
3870 || lunsignedp
!= runsignedp
|| lreversep
!= rreversep
|| offset
!= 0
3871 || TREE_CODE (rinner
) == PLACEHOLDER_EXPR
|| rvolatilep
)
3875 /* See if we can find a mode to refer to this field. We should be able to,
3876 but fail if we can't. */
3877 nmode
= get_best_mode (lbitsize
, lbitpos
, 0, 0,
3878 const_p
? TYPE_ALIGN (TREE_TYPE (linner
))
3879 : MIN (TYPE_ALIGN (TREE_TYPE (linner
)),
3880 TYPE_ALIGN (TREE_TYPE (rinner
))),
3882 if (nmode
== VOIDmode
)
3885 /* Set signed and unsigned types of the precision of this mode for the
3887 unsigned_type
= lang_hooks
.types
.type_for_mode (nmode
, 1);
3889 /* Compute the bit position and size for the new reference and our offset
3890 within it. If the new reference is the same size as the original, we
3891 won't optimize anything, so return zero. */
3892 nbitsize
= GET_MODE_BITSIZE (nmode
);
3893 nbitpos
= lbitpos
& ~ (nbitsize
- 1);
3895 if (nbitsize
== lbitsize
)
3898 if (lreversep
? !BYTES_BIG_ENDIAN
: BYTES_BIG_ENDIAN
)
3899 lbitpos
= nbitsize
- lbitsize
- lbitpos
;
3901 /* Make the mask to be used against the extracted field. */
3902 mask
= build_int_cst_type (unsigned_type
, -1);
3903 mask
= const_binop (LSHIFT_EXPR
, mask
, size_int (nbitsize
- lbitsize
));
3904 mask
= const_binop (RSHIFT_EXPR
, mask
,
3905 size_int (nbitsize
- lbitsize
- lbitpos
));
3908 /* If not comparing with constant, just rework the comparison
3910 return fold_build2_loc (loc
, code
, compare_type
,
3911 fold_build2_loc (loc
, BIT_AND_EXPR
, unsigned_type
,
3912 make_bit_field_ref (loc
, linner
,
3917 fold_build2_loc (loc
, BIT_AND_EXPR
, unsigned_type
,
3918 make_bit_field_ref (loc
, rinner
,
3924 /* Otherwise, we are handling the constant case. See if the constant is too
3925 big for the field. Warn and return a tree for 0 (false) if so. We do
3926 this not only for its own sake, but to avoid having to test for this
3927 error case below. If we didn't, we might generate wrong code.
3929 For unsigned fields, the constant shifted right by the field length should
3930 be all zero. For signed fields, the high-order bits should agree with
3935 if (wi::lrshift (rhs
, lbitsize
) != 0)
3937 warning (0, "comparison is always %d due to width of bit-field",
3939 return constant_boolean_node (code
== NE_EXPR
, compare_type
);
3944 wide_int tem
= wi::arshift (rhs
, lbitsize
- 1);
3945 if (tem
!= 0 && tem
!= -1)
3947 warning (0, "comparison is always %d due to width of bit-field",
3949 return constant_boolean_node (code
== NE_EXPR
, compare_type
);
3953 /* Single-bit compares should always be against zero. */
3954 if (lbitsize
== 1 && ! integer_zerop (rhs
))
3956 code
= code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
;
3957 rhs
= build_int_cst (type
, 0);
3960 /* Make a new bitfield reference, shift the constant over the
3961 appropriate number of bits and mask it with the computed mask
3962 (in case this was a signed field). If we changed it, make a new one. */
3963 lhs
= make_bit_field_ref (loc
, linner
, unsigned_type
, nbitsize
, nbitpos
, 1,
3966 rhs
= const_binop (BIT_AND_EXPR
,
3967 const_binop (LSHIFT_EXPR
,
3968 fold_convert_loc (loc
, unsigned_type
, rhs
),
3969 size_int (lbitpos
)),
3972 lhs
= build2_loc (loc
, code
, compare_type
,
3973 build2 (BIT_AND_EXPR
, unsigned_type
, lhs
, mask
), rhs
);
3977 /* Subroutine for fold_truth_andor_1: decode a field reference.
3979 If EXP is a comparison reference, we return the innermost reference.
3981 *PBITSIZE is set to the number of bits in the reference, *PBITPOS is
3982 set to the starting bit number.
3984 If the innermost field can be completely contained in a mode-sized
3985 unit, *PMODE is set to that mode. Otherwise, it is set to VOIDmode.
3987 *PVOLATILEP is set to 1 if the any expression encountered is volatile;
3988 otherwise it is not changed.
3990 *PUNSIGNEDP is set to the signedness of the field.
3992 *PREVERSEP is set to the storage order of the field.
3994 *PMASK is set to the mask used. This is either contained in a
3995 BIT_AND_EXPR or derived from the width of the field.
3997 *PAND_MASK is set to the mask found in a BIT_AND_EXPR, if any.
3999 Return 0 if this is not a component reference or is one that we can't
4000 do anything with. */
4003 decode_field_reference (location_t loc
, tree exp
, HOST_WIDE_INT
*pbitsize
,
4004 HOST_WIDE_INT
*pbitpos
, machine_mode
*pmode
,
4005 int *punsignedp
, int *preversep
, int *pvolatilep
,
4006 tree
*pmask
, tree
*pand_mask
)
4008 tree outer_type
= 0;
4010 tree mask
, inner
, offset
;
4012 unsigned int precision
;
4014 /* All the optimizations using this function assume integer fields.
4015 There are problems with FP fields since the type_for_size call
4016 below can fail for, e.g., XFmode. */
4017 if (! INTEGRAL_TYPE_P (TREE_TYPE (exp
)))
4020 /* We are interested in the bare arrangement of bits, so strip everything
4021 that doesn't affect the machine mode. However, record the type of the
4022 outermost expression if it may matter below. */
4023 if (CONVERT_EXPR_P (exp
)
4024 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4025 outer_type
= TREE_TYPE (exp
);
4028 if (TREE_CODE (exp
) == BIT_AND_EXPR
)
4030 and_mask
= TREE_OPERAND (exp
, 1);
4031 exp
= TREE_OPERAND (exp
, 0);
4032 STRIP_NOPS (exp
); STRIP_NOPS (and_mask
);
4033 if (TREE_CODE (and_mask
) != INTEGER_CST
)
4037 inner
= get_inner_reference (exp
, pbitsize
, pbitpos
, &offset
, pmode
,
4038 punsignedp
, preversep
, pvolatilep
, false);
4039 if ((inner
== exp
&& and_mask
== 0)
4040 || *pbitsize
< 0 || offset
!= 0
4041 || TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
4044 /* If the number of bits in the reference is the same as the bitsize of
4045 the outer type, then the outer type gives the signedness. Otherwise
4046 (in case of a small bitfield) the signedness is unchanged. */
4047 if (outer_type
&& *pbitsize
== TYPE_PRECISION (outer_type
))
4048 *punsignedp
= TYPE_UNSIGNED (outer_type
);
4050 /* Compute the mask to access the bitfield. */
4051 unsigned_type
= lang_hooks
.types
.type_for_size (*pbitsize
, 1);
4052 precision
= TYPE_PRECISION (unsigned_type
);
4054 mask
= build_int_cst_type (unsigned_type
, -1);
4056 mask
= const_binop (LSHIFT_EXPR
, mask
, size_int (precision
- *pbitsize
));
4057 mask
= const_binop (RSHIFT_EXPR
, mask
, size_int (precision
- *pbitsize
));
4059 /* Merge it with the mask we found in the BIT_AND_EXPR, if any. */
4061 mask
= fold_build2_loc (loc
, BIT_AND_EXPR
, unsigned_type
,
4062 fold_convert_loc (loc
, unsigned_type
, and_mask
), mask
);
4065 *pand_mask
= and_mask
;
4069 /* Return nonzero if MASK represents a mask of SIZE ones in the low-order
4070 bit positions and MASK is SIGNED. */
4073 all_ones_mask_p (const_tree mask
, unsigned int size
)
4075 tree type
= TREE_TYPE (mask
);
4076 unsigned int precision
= TYPE_PRECISION (type
);
4078 /* If this function returns true when the type of the mask is
4079 UNSIGNED, then there will be errors. In particular see
4080 gcc.c-torture/execute/990326-1.c. There does not appear to be
4081 any documentation paper trail as to why this is so. But the pre
4082 wide-int worked with that restriction and it has been preserved
4084 if (size
> precision
|| TYPE_SIGN (type
) == UNSIGNED
)
4087 return wi::mask (size
, false, precision
) == mask
;
4090 /* Subroutine for fold: determine if VAL is the INTEGER_CONST that
4091 represents the sign bit of EXP's type. If EXP represents a sign
4092 or zero extension, also test VAL against the unextended type.
4093 The return value is the (sub)expression whose sign bit is VAL,
4094 or NULL_TREE otherwise. */
4097 sign_bit_p (tree exp
, const_tree val
)
4102 /* Tree EXP must have an integral type. */
4103 t
= TREE_TYPE (exp
);
4104 if (! INTEGRAL_TYPE_P (t
))
4107 /* Tree VAL must be an integer constant. */
4108 if (TREE_CODE (val
) != INTEGER_CST
4109 || TREE_OVERFLOW (val
))
4112 width
= TYPE_PRECISION (t
);
4113 if (wi::only_sign_bit_p (val
, width
))
4116 /* Handle extension from a narrower type. */
4117 if (TREE_CODE (exp
) == NOP_EXPR
4118 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp
, 0))) < width
)
4119 return sign_bit_p (TREE_OPERAND (exp
, 0), val
);
4124 /* Subroutine for fold_truth_andor_1: determine if an operand is simple enough
4125 to be evaluated unconditionally. */
4128 simple_operand_p (const_tree exp
)
4130 /* Strip any conversions that don't change the machine mode. */
4133 return (CONSTANT_CLASS_P (exp
)
4134 || TREE_CODE (exp
) == SSA_NAME
4136 && ! TREE_ADDRESSABLE (exp
)
4137 && ! TREE_THIS_VOLATILE (exp
)
4138 && ! DECL_NONLOCAL (exp
)
4139 /* Don't regard global variables as simple. They may be
4140 allocated in ways unknown to the compiler (shared memory,
4141 #pragma weak, etc). */
4142 && ! TREE_PUBLIC (exp
)
4143 && ! DECL_EXTERNAL (exp
)
4144 /* Weakrefs are not safe to be read, since they can be NULL.
4145 They are !TREE_PUBLIC && !DECL_EXTERNAL but still
4146 have DECL_WEAK flag set. */
4147 && (! VAR_OR_FUNCTION_DECL_P (exp
) || ! DECL_WEAK (exp
))
4148 /* Loading a static variable is unduly expensive, but global
4149 registers aren't expensive. */
4150 && (! TREE_STATIC (exp
) || DECL_REGISTER (exp
))));
4153 /* Subroutine for fold_truth_andor: determine if an operand is simple enough
4154 to be evaluated unconditionally.
4155 I addition to simple_operand_p, we assume that comparisons, conversions,
4156 and logic-not operations are simple, if their operands are simple, too. */
4159 simple_operand_p_2 (tree exp
)
4161 enum tree_code code
;
4163 if (TREE_SIDE_EFFECTS (exp
)
4164 || tree_could_trap_p (exp
))
4167 while (CONVERT_EXPR_P (exp
))
4168 exp
= TREE_OPERAND (exp
, 0);
4170 code
= TREE_CODE (exp
);
4172 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
4173 return (simple_operand_p (TREE_OPERAND (exp
, 0))
4174 && simple_operand_p (TREE_OPERAND (exp
, 1)));
4176 if (code
== TRUTH_NOT_EXPR
)
4177 return simple_operand_p_2 (TREE_OPERAND (exp
, 0));
4179 return simple_operand_p (exp
);
4183 /* The following functions are subroutines to fold_range_test and allow it to
4184 try to change a logical combination of comparisons into a range test.
4187 X == 2 || X == 3 || X == 4 || X == 5
4191 (unsigned) (X - 2) <= 3
4193 We describe each set of comparisons as being either inside or outside
4194 a range, using a variable named like IN_P, and then describe the
4195 range with a lower and upper bound. If one of the bounds is omitted,
4196 it represents either the highest or lowest value of the type.
4198 In the comments below, we represent a range by two numbers in brackets
4199 preceded by a "+" to designate being inside that range, or a "-" to
4200 designate being outside that range, so the condition can be inverted by
4201 flipping the prefix. An omitted bound is represented by a "-". For
4202 example, "- [-, 10]" means being outside the range starting at the lowest
4203 possible value and ending at 10, in other words, being greater than 10.
4204 The range "+ [-, -]" is always true and hence the range "- [-, -]" is
4207 We set up things so that the missing bounds are handled in a consistent
4208 manner so neither a missing bound nor "true" and "false" need to be
4209 handled using a special case. */
4211 /* Return the result of applying CODE to ARG0 and ARG1, but handle the case
4212 of ARG0 and/or ARG1 being omitted, meaning an unlimited range. UPPER0_P
4213 and UPPER1_P are nonzero if the respective argument is an upper bound
4214 and zero for a lower. TYPE, if nonzero, is the type of the result; it
4215 must be specified for a comparison. ARG1 will be converted to ARG0's
4216 type if both are specified. */
4219 range_binop (enum tree_code code
, tree type
, tree arg0
, int upper0_p
,
4220 tree arg1
, int upper1_p
)
4226 /* If neither arg represents infinity, do the normal operation.
4227 Else, if not a comparison, return infinity. Else handle the special
4228 comparison rules. Note that most of the cases below won't occur, but
4229 are handled for consistency. */
4231 if (arg0
!= 0 && arg1
!= 0)
4233 tem
= fold_build2 (code
, type
!= 0 ? type
: TREE_TYPE (arg0
),
4234 arg0
, fold_convert (TREE_TYPE (arg0
), arg1
));
4236 return TREE_CODE (tem
) == INTEGER_CST
? tem
: 0;
4239 if (TREE_CODE_CLASS (code
) != tcc_comparison
)
4242 /* Set SGN[01] to -1 if ARG[01] is a lower bound, 1 for upper, and 0
4243 for neither. In real maths, we cannot assume open ended ranges are
4244 the same. But, this is computer arithmetic, where numbers are finite.
4245 We can therefore make the transformation of any unbounded range with
4246 the value Z, Z being greater than any representable number. This permits
4247 us to treat unbounded ranges as equal. */
4248 sgn0
= arg0
!= 0 ? 0 : (upper0_p
? 1 : -1);
4249 sgn1
= arg1
!= 0 ? 0 : (upper1_p
? 1 : -1);
4253 result
= sgn0
== sgn1
;
4256 result
= sgn0
!= sgn1
;
4259 result
= sgn0
< sgn1
;
4262 result
= sgn0
<= sgn1
;
4265 result
= sgn0
> sgn1
;
4268 result
= sgn0
>= sgn1
;
4274 return constant_boolean_node (result
, type
);
4277 /* Helper routine for make_range. Perform one step for it, return
4278 new expression if the loop should continue or NULL_TREE if it should
4282 make_range_step (location_t loc
, enum tree_code code
, tree arg0
, tree arg1
,
4283 tree exp_type
, tree
*p_low
, tree
*p_high
, int *p_in_p
,
4284 bool *strict_overflow_p
)
4286 tree arg0_type
= TREE_TYPE (arg0
);
4287 tree n_low
, n_high
, low
= *p_low
, high
= *p_high
;
4288 int in_p
= *p_in_p
, n_in_p
;
4292 case TRUTH_NOT_EXPR
:
4293 /* We can only do something if the range is testing for zero. */
4294 if (low
== NULL_TREE
|| high
== NULL_TREE
4295 || ! integer_zerop (low
) || ! integer_zerop (high
))
4300 case EQ_EXPR
: case NE_EXPR
:
4301 case LT_EXPR
: case LE_EXPR
: case GE_EXPR
: case GT_EXPR
:
4302 /* We can only do something if the range is testing for zero
4303 and if the second operand is an integer constant. Note that
4304 saying something is "in" the range we make is done by
4305 complementing IN_P since it will set in the initial case of
4306 being not equal to zero; "out" is leaving it alone. */
4307 if (low
== NULL_TREE
|| high
== NULL_TREE
4308 || ! integer_zerop (low
) || ! integer_zerop (high
)
4309 || TREE_CODE (arg1
) != INTEGER_CST
)
4314 case NE_EXPR
: /* - [c, c] */
4317 case EQ_EXPR
: /* + [c, c] */
4318 in_p
= ! in_p
, low
= high
= arg1
;
4320 case GT_EXPR
: /* - [-, c] */
4321 low
= 0, high
= arg1
;
4323 case GE_EXPR
: /* + [c, -] */
4324 in_p
= ! in_p
, low
= arg1
, high
= 0;
4326 case LT_EXPR
: /* - [c, -] */
4327 low
= arg1
, high
= 0;
4329 case LE_EXPR
: /* + [-, c] */
4330 in_p
= ! in_p
, low
= 0, high
= arg1
;
4336 /* If this is an unsigned comparison, we also know that EXP is
4337 greater than or equal to zero. We base the range tests we make
4338 on that fact, so we record it here so we can parse existing
4339 range tests. We test arg0_type since often the return type
4340 of, e.g. EQ_EXPR, is boolean. */
4341 if (TYPE_UNSIGNED (arg0_type
) && (low
== 0 || high
== 0))
4343 if (! merge_ranges (&n_in_p
, &n_low
, &n_high
,
4345 build_int_cst (arg0_type
, 0),
4349 in_p
= n_in_p
, low
= n_low
, high
= n_high
;
4351 /* If the high bound is missing, but we have a nonzero low
4352 bound, reverse the range so it goes from zero to the low bound
4354 if (high
== 0 && low
&& ! integer_zerop (low
))
4357 high
= range_binop (MINUS_EXPR
, NULL_TREE
, low
, 0,
4358 build_int_cst (TREE_TYPE (low
), 1), 0);
4359 low
= build_int_cst (arg0_type
, 0);
4369 /* If flag_wrapv and ARG0_TYPE is signed, make sure
4370 low and high are non-NULL, then normalize will DTRT. */
4371 if (!TYPE_UNSIGNED (arg0_type
)
4372 && !TYPE_OVERFLOW_UNDEFINED (arg0_type
))
4374 if (low
== NULL_TREE
)
4375 low
= TYPE_MIN_VALUE (arg0_type
);
4376 if (high
== NULL_TREE
)
4377 high
= TYPE_MAX_VALUE (arg0_type
);
4380 /* (-x) IN [a,b] -> x in [-b, -a] */
4381 n_low
= range_binop (MINUS_EXPR
, exp_type
,
4382 build_int_cst (exp_type
, 0),
4384 n_high
= range_binop (MINUS_EXPR
, exp_type
,
4385 build_int_cst (exp_type
, 0),
4387 if (n_high
!= 0 && TREE_OVERFLOW (n_high
))
4393 return build2_loc (loc
, MINUS_EXPR
, exp_type
, negate_expr (arg0
),
4394 build_int_cst (exp_type
, 1));
4398 if (TREE_CODE (arg1
) != INTEGER_CST
)
4401 /* If flag_wrapv and ARG0_TYPE is signed, then we cannot
4402 move a constant to the other side. */
4403 if (!TYPE_UNSIGNED (arg0_type
)
4404 && !TYPE_OVERFLOW_UNDEFINED (arg0_type
))
4407 /* If EXP is signed, any overflow in the computation is undefined,
4408 so we don't worry about it so long as our computations on
4409 the bounds don't overflow. For unsigned, overflow is defined
4410 and this is exactly the right thing. */
4411 n_low
= range_binop (code
== MINUS_EXPR
? PLUS_EXPR
: MINUS_EXPR
,
4412 arg0_type
, low
, 0, arg1
, 0);
4413 n_high
= range_binop (code
== MINUS_EXPR
? PLUS_EXPR
: MINUS_EXPR
,
4414 arg0_type
, high
, 1, arg1
, 0);
4415 if ((n_low
!= 0 && TREE_OVERFLOW (n_low
))
4416 || (n_high
!= 0 && TREE_OVERFLOW (n_high
)))
4419 if (TYPE_OVERFLOW_UNDEFINED (arg0_type
))
4420 *strict_overflow_p
= true;
4423 /* Check for an unsigned range which has wrapped around the maximum
4424 value thus making n_high < n_low, and normalize it. */
4425 if (n_low
&& n_high
&& tree_int_cst_lt (n_high
, n_low
))
4427 low
= range_binop (PLUS_EXPR
, arg0_type
, n_high
, 0,
4428 build_int_cst (TREE_TYPE (n_high
), 1), 0);
4429 high
= range_binop (MINUS_EXPR
, arg0_type
, n_low
, 0,
4430 build_int_cst (TREE_TYPE (n_low
), 1), 0);
4432 /* If the range is of the form +/- [ x+1, x ], we won't
4433 be able to normalize it. But then, it represents the
4434 whole range or the empty set, so make it
4436 if (tree_int_cst_equal (n_low
, low
)
4437 && tree_int_cst_equal (n_high
, high
))
4443 low
= n_low
, high
= n_high
;
4451 case NON_LVALUE_EXPR
:
4452 if (TYPE_PRECISION (arg0_type
) > TYPE_PRECISION (exp_type
))
4455 if (! INTEGRAL_TYPE_P (arg0_type
)
4456 || (low
!= 0 && ! int_fits_type_p (low
, arg0_type
))
4457 || (high
!= 0 && ! int_fits_type_p (high
, arg0_type
)))
4460 n_low
= low
, n_high
= high
;
4463 n_low
= fold_convert_loc (loc
, arg0_type
, n_low
);
4466 n_high
= fold_convert_loc (loc
, arg0_type
, n_high
);
4468 /* If we're converting arg0 from an unsigned type, to exp,
4469 a signed type, we will be doing the comparison as unsigned.
4470 The tests above have already verified that LOW and HIGH
4473 So we have to ensure that we will handle large unsigned
4474 values the same way that the current signed bounds treat
4477 if (!TYPE_UNSIGNED (exp_type
) && TYPE_UNSIGNED (arg0_type
))
4481 /* For fixed-point modes, we need to pass the saturating flag
4482 as the 2nd parameter. */
4483 if (ALL_FIXED_POINT_MODE_P (TYPE_MODE (arg0_type
)))
4485 = lang_hooks
.types
.type_for_mode (TYPE_MODE (arg0_type
),
4486 TYPE_SATURATING (arg0_type
));
4489 = lang_hooks
.types
.type_for_mode (TYPE_MODE (arg0_type
), 1);
4491 /* A range without an upper bound is, naturally, unbounded.
4492 Since convert would have cropped a very large value, use
4493 the max value for the destination type. */
4495 = TYPE_MAX_VALUE (equiv_type
) ? TYPE_MAX_VALUE (equiv_type
)
4496 : TYPE_MAX_VALUE (arg0_type
);
4498 if (TYPE_PRECISION (exp_type
) == TYPE_PRECISION (arg0_type
))
4499 high_positive
= fold_build2_loc (loc
, RSHIFT_EXPR
, arg0_type
,
4500 fold_convert_loc (loc
, arg0_type
,
4502 build_int_cst (arg0_type
, 1));
4504 /* If the low bound is specified, "and" the range with the
4505 range for which the original unsigned value will be
4509 if (! merge_ranges (&n_in_p
, &n_low
, &n_high
, 1, n_low
, n_high
,
4510 1, fold_convert_loc (loc
, arg0_type
,
4515 in_p
= (n_in_p
== in_p
);
4519 /* Otherwise, "or" the range with the range of the input
4520 that will be interpreted as negative. */
4521 if (! merge_ranges (&n_in_p
, &n_low
, &n_high
, 0, n_low
, n_high
,
4522 1, fold_convert_loc (loc
, arg0_type
,
4527 in_p
= (in_p
!= n_in_p
);
4541 /* Given EXP, a logical expression, set the range it is testing into
4542 variables denoted by PIN_P, PLOW, and PHIGH. Return the expression
4543 actually being tested. *PLOW and *PHIGH will be made of the same
4544 type as the returned expression. If EXP is not a comparison, we
4545 will most likely not be returning a useful value and range. Set
4546 *STRICT_OVERFLOW_P to true if the return value is only valid
4547 because signed overflow is undefined; otherwise, do not change
4548 *STRICT_OVERFLOW_P. */
4551 make_range (tree exp
, int *pin_p
, tree
*plow
, tree
*phigh
,
4552 bool *strict_overflow_p
)
4554 enum tree_code code
;
4555 tree arg0
, arg1
= NULL_TREE
;
4556 tree exp_type
, nexp
;
4559 location_t loc
= EXPR_LOCATION (exp
);
4561 /* Start with simply saying "EXP != 0" and then look at the code of EXP
4562 and see if we can refine the range. Some of the cases below may not
4563 happen, but it doesn't seem worth worrying about this. We "continue"
4564 the outer loop when we've changed something; otherwise we "break"
4565 the switch, which will "break" the while. */
4568 low
= high
= build_int_cst (TREE_TYPE (exp
), 0);
4572 code
= TREE_CODE (exp
);
4573 exp_type
= TREE_TYPE (exp
);
4576 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
4578 if (TREE_OPERAND_LENGTH (exp
) > 0)
4579 arg0
= TREE_OPERAND (exp
, 0);
4580 if (TREE_CODE_CLASS (code
) == tcc_binary
4581 || TREE_CODE_CLASS (code
) == tcc_comparison
4582 || (TREE_CODE_CLASS (code
) == tcc_expression
4583 && TREE_OPERAND_LENGTH (exp
) > 1))
4584 arg1
= TREE_OPERAND (exp
, 1);
4586 if (arg0
== NULL_TREE
)
4589 nexp
= make_range_step (loc
, code
, arg0
, arg1
, exp_type
, &low
,
4590 &high
, &in_p
, strict_overflow_p
);
4591 if (nexp
== NULL_TREE
)
4596 /* If EXP is a constant, we can evaluate whether this is true or false. */
4597 if (TREE_CODE (exp
) == INTEGER_CST
)
4599 in_p
= in_p
== (integer_onep (range_binop (GE_EXPR
, integer_type_node
,
4601 && integer_onep (range_binop (LE_EXPR
, integer_type_node
,
4607 *pin_p
= in_p
, *plow
= low
, *phigh
= high
;
4611 /* Given a range, LOW, HIGH, and IN_P, an expression, EXP, and a result
4612 type, TYPE, return an expression to test if EXP is in (or out of, depending
4613 on IN_P) the range. Return 0 if the test couldn't be created. */
4616 build_range_check (location_t loc
, tree type
, tree exp
, int in_p
,
4617 tree low
, tree high
)
4619 tree etype
= TREE_TYPE (exp
), value
;
4621 /* Disable this optimization for function pointer expressions
4622 on targets that require function pointer canonicalization. */
4623 if (targetm
.have_canonicalize_funcptr_for_compare ()
4624 && TREE_CODE (etype
) == POINTER_TYPE
4625 && TREE_CODE (TREE_TYPE (etype
)) == FUNCTION_TYPE
)
4630 value
= build_range_check (loc
, type
, exp
, 1, low
, high
);
4632 return invert_truthvalue_loc (loc
, value
);
4637 if (low
== 0 && high
== 0)
4638 return omit_one_operand_loc (loc
, type
, build_int_cst (type
, 1), exp
);
4641 return fold_build2_loc (loc
, LE_EXPR
, type
, exp
,
4642 fold_convert_loc (loc
, etype
, high
));
4645 return fold_build2_loc (loc
, GE_EXPR
, type
, exp
,
4646 fold_convert_loc (loc
, etype
, low
));
4648 if (operand_equal_p (low
, high
, 0))
4649 return fold_build2_loc (loc
, EQ_EXPR
, type
, exp
,
4650 fold_convert_loc (loc
, etype
, low
));
4652 if (integer_zerop (low
))
4654 if (! TYPE_UNSIGNED (etype
))
4656 etype
= unsigned_type_for (etype
);
4657 high
= fold_convert_loc (loc
, etype
, high
);
4658 exp
= fold_convert_loc (loc
, etype
, exp
);
4660 return build_range_check (loc
, type
, exp
, 1, 0, high
);
4663 /* Optimize (c>=1) && (c<=127) into (signed char)c > 0. */
4664 if (integer_onep (low
) && TREE_CODE (high
) == INTEGER_CST
)
4666 int prec
= TYPE_PRECISION (etype
);
4668 if (wi::mask (prec
- 1, false, prec
) == high
)
4670 if (TYPE_UNSIGNED (etype
))
4672 tree signed_etype
= signed_type_for (etype
);
4673 if (TYPE_PRECISION (signed_etype
) != TYPE_PRECISION (etype
))
4675 = build_nonstandard_integer_type (TYPE_PRECISION (etype
), 0);
4677 etype
= signed_etype
;
4678 exp
= fold_convert_loc (loc
, etype
, exp
);
4680 return fold_build2_loc (loc
, GT_EXPR
, type
, exp
,
4681 build_int_cst (etype
, 0));
4685 /* Optimize (c>=low) && (c<=high) into (c-low>=0) && (c-low<=high-low).
4686 This requires wrap-around arithmetics for the type of the expression.
4687 First make sure that arithmetics in this type is valid, then make sure
4688 that it wraps around. */
4689 if (TREE_CODE (etype
) == ENUMERAL_TYPE
|| TREE_CODE (etype
) == BOOLEAN_TYPE
)
4690 etype
= lang_hooks
.types
.type_for_size (TYPE_PRECISION (etype
),
4691 TYPE_UNSIGNED (etype
));
4693 if (TREE_CODE (etype
) == INTEGER_TYPE
&& !TYPE_OVERFLOW_WRAPS (etype
))
4695 tree utype
, minv
, maxv
;
4697 /* Check if (unsigned) INT_MAX + 1 == (unsigned) INT_MIN
4698 for the type in question, as we rely on this here. */
4699 utype
= unsigned_type_for (etype
);
4700 maxv
= fold_convert_loc (loc
, utype
, TYPE_MAX_VALUE (etype
));
4701 maxv
= range_binop (PLUS_EXPR
, NULL_TREE
, maxv
, 1,
4702 build_int_cst (TREE_TYPE (maxv
), 1), 1);
4703 minv
= fold_convert_loc (loc
, utype
, TYPE_MIN_VALUE (etype
));
4705 if (integer_zerop (range_binop (NE_EXPR
, integer_type_node
,
4712 high
= fold_convert_loc (loc
, etype
, high
);
4713 low
= fold_convert_loc (loc
, etype
, low
);
4714 exp
= fold_convert_loc (loc
, etype
, exp
);
4716 value
= const_binop (MINUS_EXPR
, high
, low
);
4719 if (POINTER_TYPE_P (etype
))
4721 if (value
!= 0 && !TREE_OVERFLOW (value
))
4723 low
= fold_build1_loc (loc
, NEGATE_EXPR
, TREE_TYPE (low
), low
);
4724 return build_range_check (loc
, type
,
4725 fold_build_pointer_plus_loc (loc
, exp
, low
),
4726 1, build_int_cst (etype
, 0), value
);
4731 if (value
!= 0 && !TREE_OVERFLOW (value
))
4732 return build_range_check (loc
, type
,
4733 fold_build2_loc (loc
, MINUS_EXPR
, etype
, exp
, low
),
4734 1, build_int_cst (etype
, 0), value
);
4739 /* Return the predecessor of VAL in its type, handling the infinite case. */
4742 range_predecessor (tree val
)
4744 tree type
= TREE_TYPE (val
);
4746 if (INTEGRAL_TYPE_P (type
)
4747 && operand_equal_p (val
, TYPE_MIN_VALUE (type
), 0))
4750 return range_binop (MINUS_EXPR
, NULL_TREE
, val
, 0,
4751 build_int_cst (TREE_TYPE (val
), 1), 0);
4754 /* Return the successor of VAL in its type, handling the infinite case. */
4757 range_successor (tree val
)
4759 tree type
= TREE_TYPE (val
);
4761 if (INTEGRAL_TYPE_P (type
)
4762 && operand_equal_p (val
, TYPE_MAX_VALUE (type
), 0))
4765 return range_binop (PLUS_EXPR
, NULL_TREE
, val
, 0,
4766 build_int_cst (TREE_TYPE (val
), 1), 0);
4769 /* Given two ranges, see if we can merge them into one. Return 1 if we
4770 can, 0 if we can't. Set the output range into the specified parameters. */
4773 merge_ranges (int *pin_p
, tree
*plow
, tree
*phigh
, int in0_p
, tree low0
,
4774 tree high0
, int in1_p
, tree low1
, tree high1
)
4782 int lowequal
= ((low0
== 0 && low1
== 0)
4783 || integer_onep (range_binop (EQ_EXPR
, integer_type_node
,
4784 low0
, 0, low1
, 0)));
4785 int highequal
= ((high0
== 0 && high1
== 0)
4786 || integer_onep (range_binop (EQ_EXPR
, integer_type_node
,
4787 high0
, 1, high1
, 1)));
4789 /* Make range 0 be the range that starts first, or ends last if they
4790 start at the same value. Swap them if it isn't. */
4791 if (integer_onep (range_binop (GT_EXPR
, integer_type_node
,
4794 && integer_onep (range_binop (GT_EXPR
, integer_type_node
,
4795 high1
, 1, high0
, 1))))
4797 temp
= in0_p
, in0_p
= in1_p
, in1_p
= temp
;
4798 tem
= low0
, low0
= low1
, low1
= tem
;
4799 tem
= high0
, high0
= high1
, high1
= tem
;
4802 /* Now flag two cases, whether the ranges are disjoint or whether the
4803 second range is totally subsumed in the first. Note that the tests
4804 below are simplified by the ones above. */
4805 no_overlap
= integer_onep (range_binop (LT_EXPR
, integer_type_node
,
4806 high0
, 1, low1
, 0));
4807 subset
= integer_onep (range_binop (LE_EXPR
, integer_type_node
,
4808 high1
, 1, high0
, 1));
4810 /* We now have four cases, depending on whether we are including or
4811 excluding the two ranges. */
4814 /* If they don't overlap, the result is false. If the second range
4815 is a subset it is the result. Otherwise, the range is from the start
4816 of the second to the end of the first. */
4818 in_p
= 0, low
= high
= 0;
4820 in_p
= 1, low
= low1
, high
= high1
;
4822 in_p
= 1, low
= low1
, high
= high0
;
4825 else if (in0_p
&& ! in1_p
)
4827 /* If they don't overlap, the result is the first range. If they are
4828 equal, the result is false. If the second range is a subset of the
4829 first, and the ranges begin at the same place, we go from just after
4830 the end of the second range to the end of the first. If the second
4831 range is not a subset of the first, or if it is a subset and both
4832 ranges end at the same place, the range starts at the start of the
4833 first range and ends just before the second range.
4834 Otherwise, we can't describe this as a single range. */
4836 in_p
= 1, low
= low0
, high
= high0
;
4837 else if (lowequal
&& highequal
)
4838 in_p
= 0, low
= high
= 0;
4839 else if (subset
&& lowequal
)
4841 low
= range_successor (high1
);
4846 /* We are in the weird situation where high0 > high1 but
4847 high1 has no successor. Punt. */
4851 else if (! subset
|| highequal
)
4854 high
= range_predecessor (low1
);
4858 /* low0 < low1 but low1 has no predecessor. Punt. */
4866 else if (! in0_p
&& in1_p
)
4868 /* If they don't overlap, the result is the second range. If the second
4869 is a subset of the first, the result is false. Otherwise,
4870 the range starts just after the first range and ends at the
4871 end of the second. */
4873 in_p
= 1, low
= low1
, high
= high1
;
4874 else if (subset
|| highequal
)
4875 in_p
= 0, low
= high
= 0;
4878 low
= range_successor (high0
);
4883 /* high1 > high0 but high0 has no successor. Punt. */
4891 /* The case where we are excluding both ranges. Here the complex case
4892 is if they don't overlap. In that case, the only time we have a
4893 range is if they are adjacent. If the second is a subset of the
4894 first, the result is the first. Otherwise, the range to exclude
4895 starts at the beginning of the first range and ends at the end of the
4899 if (integer_onep (range_binop (EQ_EXPR
, integer_type_node
,
4900 range_successor (high0
),
4902 in_p
= 0, low
= low0
, high
= high1
;
4905 /* Canonicalize - [min, x] into - [-, x]. */
4906 if (low0
&& TREE_CODE (low0
) == INTEGER_CST
)
4907 switch (TREE_CODE (TREE_TYPE (low0
)))
4910 if (TYPE_PRECISION (TREE_TYPE (low0
))
4911 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (low0
))))
4915 if (tree_int_cst_equal (low0
,
4916 TYPE_MIN_VALUE (TREE_TYPE (low0
))))
4920 if (TYPE_UNSIGNED (TREE_TYPE (low0
))
4921 && integer_zerop (low0
))
4928 /* Canonicalize - [x, max] into - [x, -]. */
4929 if (high1
&& TREE_CODE (high1
) == INTEGER_CST
)
4930 switch (TREE_CODE (TREE_TYPE (high1
)))
4933 if (TYPE_PRECISION (TREE_TYPE (high1
))
4934 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (high1
))))
4938 if (tree_int_cst_equal (high1
,
4939 TYPE_MAX_VALUE (TREE_TYPE (high1
))))
4943 if (TYPE_UNSIGNED (TREE_TYPE (high1
))
4944 && integer_zerop (range_binop (PLUS_EXPR
, NULL_TREE
,
4946 build_int_cst (TREE_TYPE (high1
), 1),
4954 /* The ranges might be also adjacent between the maximum and
4955 minimum values of the given type. For
4956 - [{min,-}, x] and - [y, {max,-}] ranges where x + 1 < y
4957 return + [x + 1, y - 1]. */
4958 if (low0
== 0 && high1
== 0)
4960 low
= range_successor (high0
);
4961 high
= range_predecessor (low1
);
4962 if (low
== 0 || high
== 0)
4972 in_p
= 0, low
= low0
, high
= high0
;
4974 in_p
= 0, low
= low0
, high
= high1
;
4977 *pin_p
= in_p
, *plow
= low
, *phigh
= high
;
4982 /* Subroutine of fold, looking inside expressions of the form
4983 A op B ? A : C, where ARG0, ARG1 and ARG2 are the three operands
4984 of the COND_EXPR. This function is being used also to optimize
4985 A op B ? C : A, by reversing the comparison first.
4987 Return a folded expression whose code is not a COND_EXPR
4988 anymore, or NULL_TREE if no folding opportunity is found. */
4991 fold_cond_expr_with_comparison (location_t loc
, tree type
,
4992 tree arg0
, tree arg1
, tree arg2
)
4994 enum tree_code comp_code
= TREE_CODE (arg0
);
4995 tree arg00
= TREE_OPERAND (arg0
, 0);
4996 tree arg01
= TREE_OPERAND (arg0
, 1);
4997 tree arg1_type
= TREE_TYPE (arg1
);
5003 /* If we have A op 0 ? A : -A, consider applying the following
5006 A == 0? A : -A same as -A
5007 A != 0? A : -A same as A
5008 A >= 0? A : -A same as abs (A)
5009 A > 0? A : -A same as abs (A)
5010 A <= 0? A : -A same as -abs (A)
5011 A < 0? A : -A same as -abs (A)
5013 None of these transformations work for modes with signed
5014 zeros. If A is +/-0, the first two transformations will
5015 change the sign of the result (from +0 to -0, or vice
5016 versa). The last four will fix the sign of the result,
5017 even though the original expressions could be positive or
5018 negative, depending on the sign of A.
5020 Note that all these transformations are correct if A is
5021 NaN, since the two alternatives (A and -A) are also NaNs. */
5022 if (!HONOR_SIGNED_ZEROS (element_mode (type
))
5023 && (FLOAT_TYPE_P (TREE_TYPE (arg01
))
5024 ? real_zerop (arg01
)
5025 : integer_zerop (arg01
))
5026 && ((TREE_CODE (arg2
) == NEGATE_EXPR
5027 && operand_equal_p (TREE_OPERAND (arg2
, 0), arg1
, 0))
5028 /* In the case that A is of the form X-Y, '-A' (arg2) may
5029 have already been folded to Y-X, check for that. */
5030 || (TREE_CODE (arg1
) == MINUS_EXPR
5031 && TREE_CODE (arg2
) == MINUS_EXPR
5032 && operand_equal_p (TREE_OPERAND (arg1
, 0),
5033 TREE_OPERAND (arg2
, 1), 0)
5034 && operand_equal_p (TREE_OPERAND (arg1
, 1),
5035 TREE_OPERAND (arg2
, 0), 0))))
5040 tem
= fold_convert_loc (loc
, arg1_type
, arg1
);
5041 return pedantic_non_lvalue_loc (loc
,
5042 fold_convert_loc (loc
, type
,
5043 negate_expr (tem
)));
5046 return pedantic_non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg1
));
5049 if (flag_trapping_math
)
5054 if (TYPE_UNSIGNED (TREE_TYPE (arg1
)))
5056 tem
= fold_build1_loc (loc
, ABS_EXPR
, TREE_TYPE (arg1
), arg1
);
5057 return pedantic_non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, tem
));
5060 if (flag_trapping_math
)
5064 if (TYPE_UNSIGNED (TREE_TYPE (arg1
)))
5066 tem
= fold_build1_loc (loc
, ABS_EXPR
, TREE_TYPE (arg1
), arg1
);
5067 return negate_expr (fold_convert_loc (loc
, type
, tem
));
5069 gcc_assert (TREE_CODE_CLASS (comp_code
) == tcc_comparison
);
5073 /* A != 0 ? A : 0 is simply A, unless A is -0. Likewise
5074 A == 0 ? A : 0 is always 0 unless A is -0. Note that
5075 both transformations are correct when A is NaN: A != 0
5076 is then true, and A == 0 is false. */
5078 if (!HONOR_SIGNED_ZEROS (element_mode (type
))
5079 && integer_zerop (arg01
) && integer_zerop (arg2
))
5081 if (comp_code
== NE_EXPR
)
5082 return pedantic_non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg1
));
5083 else if (comp_code
== EQ_EXPR
)
5084 return build_zero_cst (type
);
5087 /* Try some transformations of A op B ? A : B.
5089 A == B? A : B same as B
5090 A != B? A : B same as A
5091 A >= B? A : B same as max (A, B)
5092 A > B? A : B same as max (B, A)
5093 A <= B? A : B same as min (A, B)
5094 A < B? A : B same as min (B, A)
5096 As above, these transformations don't work in the presence
5097 of signed zeros. For example, if A and B are zeros of
5098 opposite sign, the first two transformations will change
5099 the sign of the result. In the last four, the original
5100 expressions give different results for (A=+0, B=-0) and
5101 (A=-0, B=+0), but the transformed expressions do not.
5103 The first two transformations are correct if either A or B
5104 is a NaN. In the first transformation, the condition will
5105 be false, and B will indeed be chosen. In the case of the
5106 second transformation, the condition A != B will be true,
5107 and A will be chosen.
5109 The conversions to max() and min() are not correct if B is
5110 a number and A is not. The conditions in the original
5111 expressions will be false, so all four give B. The min()
5112 and max() versions would give a NaN instead. */
5113 if (!HONOR_SIGNED_ZEROS (element_mode (type
))
5114 && operand_equal_for_comparison_p (arg01
, arg2
, arg00
)
5115 /* Avoid these transformations if the COND_EXPR may be used
5116 as an lvalue in the C++ front-end. PR c++/19199. */
5118 || VECTOR_TYPE_P (type
)
5119 || (! lang_GNU_CXX ()
5120 && strcmp (lang_hooks
.name
, "GNU Objective-C++") != 0)
5121 || ! maybe_lvalue_p (arg1
)
5122 || ! maybe_lvalue_p (arg2
)))
5124 tree comp_op0
= arg00
;
5125 tree comp_op1
= arg01
;
5126 tree comp_type
= TREE_TYPE (comp_op0
);
5128 /* Avoid adding NOP_EXPRs in case this is an lvalue. */
5129 if (TYPE_MAIN_VARIANT (comp_type
) == TYPE_MAIN_VARIANT (type
))
5139 return pedantic_non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg2
));
5141 return pedantic_non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg1
));
5146 /* In C++ a ?: expression can be an lvalue, so put the
5147 operand which will be used if they are equal first
5148 so that we can convert this back to the
5149 corresponding COND_EXPR. */
5150 if (!HONOR_NANS (arg1
))
5152 comp_op0
= fold_convert_loc (loc
, comp_type
, comp_op0
);
5153 comp_op1
= fold_convert_loc (loc
, comp_type
, comp_op1
);
5154 tem
= (comp_code
== LE_EXPR
|| comp_code
== UNLE_EXPR
)
5155 ? fold_build2_loc (loc
, MIN_EXPR
, comp_type
, comp_op0
, comp_op1
)
5156 : fold_build2_loc (loc
, MIN_EXPR
, comp_type
,
5157 comp_op1
, comp_op0
);
5158 return pedantic_non_lvalue_loc (loc
,
5159 fold_convert_loc (loc
, type
, tem
));
5166 if (!HONOR_NANS (arg1
))
5168 comp_op0
= fold_convert_loc (loc
, comp_type
, comp_op0
);
5169 comp_op1
= fold_convert_loc (loc
, comp_type
, comp_op1
);
5170 tem
= (comp_code
== GE_EXPR
|| comp_code
== UNGE_EXPR
)
5171 ? fold_build2_loc (loc
, MAX_EXPR
, comp_type
, comp_op0
, comp_op1
)
5172 : fold_build2_loc (loc
, MAX_EXPR
, comp_type
,
5173 comp_op1
, comp_op0
);
5174 return pedantic_non_lvalue_loc (loc
,
5175 fold_convert_loc (loc
, type
, tem
));
5179 if (!HONOR_NANS (arg1
))
5180 return pedantic_non_lvalue_loc (loc
,
5181 fold_convert_loc (loc
, type
, arg2
));
5184 if (!HONOR_NANS (arg1
))
5185 return pedantic_non_lvalue_loc (loc
,
5186 fold_convert_loc (loc
, type
, arg1
));
5189 gcc_assert (TREE_CODE_CLASS (comp_code
) == tcc_comparison
);
5194 /* If this is A op C1 ? A : C2 with C1 and C2 constant integers,
5195 we might still be able to simplify this. For example,
5196 if C1 is one less or one more than C2, this might have started
5197 out as a MIN or MAX and been transformed by this function.
5198 Only good for INTEGER_TYPEs, because we need TYPE_MAX_VALUE. */
5200 if (INTEGRAL_TYPE_P (type
)
5201 && TREE_CODE (arg01
) == INTEGER_CST
5202 && TREE_CODE (arg2
) == INTEGER_CST
)
5206 if (TREE_CODE (arg1
) == INTEGER_CST
)
5208 /* We can replace A with C1 in this case. */
5209 arg1
= fold_convert_loc (loc
, type
, arg01
);
5210 return fold_build3_loc (loc
, COND_EXPR
, type
, arg0
, arg1
, arg2
);
5213 /* If C1 is C2 + 1, this is min(A, C2), but use ARG00's type for
5214 MIN_EXPR, to preserve the signedness of the comparison. */
5215 if (! operand_equal_p (arg2
, TYPE_MAX_VALUE (type
),
5217 && operand_equal_p (arg01
,
5218 const_binop (PLUS_EXPR
, arg2
,
5219 build_int_cst (type
, 1)),
5222 tem
= fold_build2_loc (loc
, MIN_EXPR
, TREE_TYPE (arg00
), arg00
,
5223 fold_convert_loc (loc
, TREE_TYPE (arg00
),
5225 return pedantic_non_lvalue_loc (loc
,
5226 fold_convert_loc (loc
, type
, tem
));
5231 /* If C1 is C2 - 1, this is min(A, C2), with the same care
5233 if (! operand_equal_p (arg2
, TYPE_MIN_VALUE (type
),
5235 && operand_equal_p (arg01
,
5236 const_binop (MINUS_EXPR
, arg2
,
5237 build_int_cst (type
, 1)),
5240 tem
= fold_build2_loc (loc
, MIN_EXPR
, TREE_TYPE (arg00
), arg00
,
5241 fold_convert_loc (loc
, TREE_TYPE (arg00
),
5243 return pedantic_non_lvalue_loc (loc
,
5244 fold_convert_loc (loc
, type
, tem
));
5249 /* If C1 is C2 - 1, this is max(A, C2), but use ARG00's type for
5250 MAX_EXPR, to preserve the signedness of the comparison. */
5251 if (! operand_equal_p (arg2
, TYPE_MIN_VALUE (type
),
5253 && operand_equal_p (arg01
,
5254 const_binop (MINUS_EXPR
, arg2
,
5255 build_int_cst (type
, 1)),
5258 tem
= fold_build2_loc (loc
, MAX_EXPR
, TREE_TYPE (arg00
), arg00
,
5259 fold_convert_loc (loc
, TREE_TYPE (arg00
),
5261 return pedantic_non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, tem
));
5266 /* If C1 is C2 + 1, this is max(A, C2), with the same care as above. */
5267 if (! operand_equal_p (arg2
, TYPE_MAX_VALUE (type
),
5269 && operand_equal_p (arg01
,
5270 const_binop (PLUS_EXPR
, arg2
,
5271 build_int_cst (type
, 1)),
5274 tem
= fold_build2_loc (loc
, MAX_EXPR
, TREE_TYPE (arg00
), arg00
,
5275 fold_convert_loc (loc
, TREE_TYPE (arg00
),
5277 return pedantic_non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, tem
));
5291 #ifndef LOGICAL_OP_NON_SHORT_CIRCUIT
5292 #define LOGICAL_OP_NON_SHORT_CIRCUIT \
5293 (BRANCH_COST (optimize_function_for_speed_p (cfun), \
5297 /* EXP is some logical combination of boolean tests. See if we can
5298 merge it into some range test. Return the new tree if so. */
5301 fold_range_test (location_t loc
, enum tree_code code
, tree type
,
5304 int or_op
= (code
== TRUTH_ORIF_EXPR
5305 || code
== TRUTH_OR_EXPR
);
5306 int in0_p
, in1_p
, in_p
;
5307 tree low0
, low1
, low
, high0
, high1
, high
;
5308 bool strict_overflow_p
= false;
5310 const char * const warnmsg
= G_("assuming signed overflow does not occur "
5311 "when simplifying range test");
5313 if (!INTEGRAL_TYPE_P (type
))
5316 lhs
= make_range (op0
, &in0_p
, &low0
, &high0
, &strict_overflow_p
);
5317 rhs
= make_range (op1
, &in1_p
, &low1
, &high1
, &strict_overflow_p
);
5319 /* If this is an OR operation, invert both sides; we will invert
5320 again at the end. */
5322 in0_p
= ! in0_p
, in1_p
= ! in1_p
;
5324 /* If both expressions are the same, if we can merge the ranges, and we
5325 can build the range test, return it or it inverted. If one of the
5326 ranges is always true or always false, consider it to be the same
5327 expression as the other. */
5328 if ((lhs
== 0 || rhs
== 0 || operand_equal_p (lhs
, rhs
, 0))
5329 && merge_ranges (&in_p
, &low
, &high
, in0_p
, low0
, high0
,
5331 && 0 != (tem
= (build_range_check (loc
, type
,
5333 : rhs
!= 0 ? rhs
: integer_zero_node
,
5336 if (strict_overflow_p
)
5337 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_COMPARISON
);
5338 return or_op
? invert_truthvalue_loc (loc
, tem
) : tem
;
5341 /* On machines where the branch cost is expensive, if this is a
5342 short-circuited branch and the underlying object on both sides
5343 is the same, make a non-short-circuit operation. */
5344 else if (LOGICAL_OP_NON_SHORT_CIRCUIT
5345 && lhs
!= 0 && rhs
!= 0
5346 && (code
== TRUTH_ANDIF_EXPR
5347 || code
== TRUTH_ORIF_EXPR
)
5348 && operand_equal_p (lhs
, rhs
, 0))
5350 /* If simple enough, just rewrite. Otherwise, make a SAVE_EXPR
5351 unless we are at top level or LHS contains a PLACEHOLDER_EXPR, in
5352 which cases we can't do this. */
5353 if (simple_operand_p (lhs
))
5354 return build2_loc (loc
, code
== TRUTH_ANDIF_EXPR
5355 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
,
5358 else if (!lang_hooks
.decls
.global_bindings_p ()
5359 && !CONTAINS_PLACEHOLDER_P (lhs
))
5361 tree common
= save_expr (lhs
);
5363 if (0 != (lhs
= build_range_check (loc
, type
, common
,
5364 or_op
? ! in0_p
: in0_p
,
5366 && (0 != (rhs
= build_range_check (loc
, type
, common
,
5367 or_op
? ! in1_p
: in1_p
,
5370 if (strict_overflow_p
)
5371 fold_overflow_warning (warnmsg
,
5372 WARN_STRICT_OVERFLOW_COMPARISON
);
5373 return build2_loc (loc
, code
== TRUTH_ANDIF_EXPR
5374 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
,
5383 /* Subroutine for fold_truth_andor_1: C is an INTEGER_CST interpreted as a P
5384 bit value. Arrange things so the extra bits will be set to zero if and
5385 only if C is signed-extended to its full width. If MASK is nonzero,
5386 it is an INTEGER_CST that should be AND'ed with the extra bits. */
5389 unextend (tree c
, int p
, int unsignedp
, tree mask
)
5391 tree type
= TREE_TYPE (c
);
5392 int modesize
= GET_MODE_BITSIZE (TYPE_MODE (type
));
5395 if (p
== modesize
|| unsignedp
)
5398 /* We work by getting just the sign bit into the low-order bit, then
5399 into the high-order bit, then sign-extend. We then XOR that value
5401 temp
= build_int_cst (TREE_TYPE (c
), wi::extract_uhwi (c
, p
- 1, 1));
5403 /* We must use a signed type in order to get an arithmetic right shift.
5404 However, we must also avoid introducing accidental overflows, so that
5405 a subsequent call to integer_zerop will work. Hence we must
5406 do the type conversion here. At this point, the constant is either
5407 zero or one, and the conversion to a signed type can never overflow.
5408 We could get an overflow if this conversion is done anywhere else. */
5409 if (TYPE_UNSIGNED (type
))
5410 temp
= fold_convert (signed_type_for (type
), temp
);
5412 temp
= const_binop (LSHIFT_EXPR
, temp
, size_int (modesize
- 1));
5413 temp
= const_binop (RSHIFT_EXPR
, temp
, size_int (modesize
- p
- 1));
5415 temp
= const_binop (BIT_AND_EXPR
, temp
,
5416 fold_convert (TREE_TYPE (c
), mask
));
5417 /* If necessary, convert the type back to match the type of C. */
5418 if (TYPE_UNSIGNED (type
))
5419 temp
= fold_convert (type
, temp
);
5421 return fold_convert (type
, const_binop (BIT_XOR_EXPR
, c
, temp
));
5424 /* For an expression that has the form
5428 we can drop one of the inner expressions and simplify to
5432 LOC is the location of the resulting expression. OP is the inner
5433 logical operation; the left-hand side in the examples above, while CMPOP
5434 is the right-hand side. RHS_ONLY is used to prevent us from accidentally
5435 removing a condition that guards another, as in
5436 (A != NULL && A->...) || A == NULL
5437 which we must not transform. If RHS_ONLY is true, only eliminate the
5438 right-most operand of the inner logical operation. */
5441 merge_truthop_with_opposite_arm (location_t loc
, tree op
, tree cmpop
,
5444 tree type
= TREE_TYPE (cmpop
);
5445 enum tree_code code
= TREE_CODE (cmpop
);
5446 enum tree_code truthop_code
= TREE_CODE (op
);
5447 tree lhs
= TREE_OPERAND (op
, 0);
5448 tree rhs
= TREE_OPERAND (op
, 1);
5449 tree orig_lhs
= lhs
, orig_rhs
= rhs
;
5450 enum tree_code rhs_code
= TREE_CODE (rhs
);
5451 enum tree_code lhs_code
= TREE_CODE (lhs
);
5452 enum tree_code inv_code
;
5454 if (TREE_SIDE_EFFECTS (op
) || TREE_SIDE_EFFECTS (cmpop
))
5457 if (TREE_CODE_CLASS (code
) != tcc_comparison
)
5460 if (rhs_code
== truthop_code
)
5462 tree newrhs
= merge_truthop_with_opposite_arm (loc
, rhs
, cmpop
, rhs_only
);
5463 if (newrhs
!= NULL_TREE
)
5466 rhs_code
= TREE_CODE (rhs
);
5469 if (lhs_code
== truthop_code
&& !rhs_only
)
5471 tree newlhs
= merge_truthop_with_opposite_arm (loc
, lhs
, cmpop
, false);
5472 if (newlhs
!= NULL_TREE
)
5475 lhs_code
= TREE_CODE (lhs
);
5479 inv_code
= invert_tree_comparison (code
, HONOR_NANS (type
));
5480 if (inv_code
== rhs_code
5481 && operand_equal_p (TREE_OPERAND (rhs
, 0), TREE_OPERAND (cmpop
, 0), 0)
5482 && operand_equal_p (TREE_OPERAND (rhs
, 1), TREE_OPERAND (cmpop
, 1), 0))
5484 if (!rhs_only
&& inv_code
== lhs_code
5485 && operand_equal_p (TREE_OPERAND (lhs
, 0), TREE_OPERAND (cmpop
, 0), 0)
5486 && operand_equal_p (TREE_OPERAND (lhs
, 1), TREE_OPERAND (cmpop
, 1), 0))
5488 if (rhs
!= orig_rhs
|| lhs
!= orig_lhs
)
5489 return fold_build2_loc (loc
, truthop_code
, TREE_TYPE (cmpop
),
5494 /* Find ways of folding logical expressions of LHS and RHS:
5495 Try to merge two comparisons to the same innermost item.
5496 Look for range tests like "ch >= '0' && ch <= '9'".
5497 Look for combinations of simple terms on machines with expensive branches
5498 and evaluate the RHS unconditionally.
5500 For example, if we have p->a == 2 && p->b == 4 and we can make an
5501 object large enough to span both A and B, we can do this with a comparison
5502 against the object ANDed with the a mask.
5504 If we have p->a == q->a && p->b == q->b, we may be able to use bit masking
5505 operations to do this with one comparison.
5507 We check for both normal comparisons and the BIT_AND_EXPRs made this by
5508 function and the one above.
5510 CODE is the logical operation being done. It can be TRUTH_ANDIF_EXPR,
5511 TRUTH_AND_EXPR, TRUTH_ORIF_EXPR, or TRUTH_OR_EXPR.
5513 TRUTH_TYPE is the type of the logical operand and LHS and RHS are its
5516 We return the simplified tree or 0 if no optimization is possible. */
5519 fold_truth_andor_1 (location_t loc
, enum tree_code code
, tree truth_type
,
5522 /* If this is the "or" of two comparisons, we can do something if
5523 the comparisons are NE_EXPR. If this is the "and", we can do something
5524 if the comparisons are EQ_EXPR. I.e.,
5525 (a->b == 2 && a->c == 4) can become (a->new == NEW).
5527 WANTED_CODE is this operation code. For single bit fields, we can
5528 convert EQ_EXPR to NE_EXPR so we need not reject the "wrong"
5529 comparison for one-bit fields. */
5531 enum tree_code wanted_code
;
5532 enum tree_code lcode
, rcode
;
5533 tree ll_arg
, lr_arg
, rl_arg
, rr_arg
;
5534 tree ll_inner
, lr_inner
, rl_inner
, rr_inner
;
5535 HOST_WIDE_INT ll_bitsize
, ll_bitpos
, lr_bitsize
, lr_bitpos
;
5536 HOST_WIDE_INT rl_bitsize
, rl_bitpos
, rr_bitsize
, rr_bitpos
;
5537 HOST_WIDE_INT xll_bitpos
, xlr_bitpos
, xrl_bitpos
, xrr_bitpos
;
5538 HOST_WIDE_INT lnbitsize
, lnbitpos
, rnbitsize
, rnbitpos
;
5539 int ll_unsignedp
, lr_unsignedp
, rl_unsignedp
, rr_unsignedp
;
5540 int ll_reversep
, lr_reversep
, rl_reversep
, rr_reversep
;
5541 machine_mode ll_mode
, lr_mode
, rl_mode
, rr_mode
;
5542 machine_mode lnmode
, rnmode
;
5543 tree ll_mask
, lr_mask
, rl_mask
, rr_mask
;
5544 tree ll_and_mask
, lr_and_mask
, rl_and_mask
, rr_and_mask
;
5545 tree l_const
, r_const
;
5546 tree lntype
, rntype
, result
;
5547 HOST_WIDE_INT first_bit
, end_bit
;
5550 /* Start by getting the comparison codes. Fail if anything is volatile.
5551 If one operand is a BIT_AND_EXPR with the constant one, treat it as if
5552 it were surrounded with a NE_EXPR. */
5554 if (TREE_SIDE_EFFECTS (lhs
) || TREE_SIDE_EFFECTS (rhs
))
5557 lcode
= TREE_CODE (lhs
);
5558 rcode
= TREE_CODE (rhs
);
5560 if (lcode
== BIT_AND_EXPR
&& integer_onep (TREE_OPERAND (lhs
, 1)))
5562 lhs
= build2 (NE_EXPR
, truth_type
, lhs
,
5563 build_int_cst (TREE_TYPE (lhs
), 0));
5567 if (rcode
== BIT_AND_EXPR
&& integer_onep (TREE_OPERAND (rhs
, 1)))
5569 rhs
= build2 (NE_EXPR
, truth_type
, rhs
,
5570 build_int_cst (TREE_TYPE (rhs
), 0));
5574 if (TREE_CODE_CLASS (lcode
) != tcc_comparison
5575 || TREE_CODE_CLASS (rcode
) != tcc_comparison
)
5578 ll_arg
= TREE_OPERAND (lhs
, 0);
5579 lr_arg
= TREE_OPERAND (lhs
, 1);
5580 rl_arg
= TREE_OPERAND (rhs
, 0);
5581 rr_arg
= TREE_OPERAND (rhs
, 1);
5583 /* Simplify (x<y) && (x==y) into (x<=y) and related optimizations. */
5584 if (simple_operand_p (ll_arg
)
5585 && simple_operand_p (lr_arg
))
5587 if (operand_equal_p (ll_arg
, rl_arg
, 0)
5588 && operand_equal_p (lr_arg
, rr_arg
, 0))
5590 result
= combine_comparisons (loc
, code
, lcode
, rcode
,
5591 truth_type
, ll_arg
, lr_arg
);
5595 else if (operand_equal_p (ll_arg
, rr_arg
, 0)
5596 && operand_equal_p (lr_arg
, rl_arg
, 0))
5598 result
= combine_comparisons (loc
, code
, lcode
,
5599 swap_tree_comparison (rcode
),
5600 truth_type
, ll_arg
, lr_arg
);
5606 code
= ((code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
)
5607 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
);
5609 /* If the RHS can be evaluated unconditionally and its operands are
5610 simple, it wins to evaluate the RHS unconditionally on machines
5611 with expensive branches. In this case, this isn't a comparison
5612 that can be merged. */
5614 if (BRANCH_COST (optimize_function_for_speed_p (cfun
),
5616 && ! FLOAT_TYPE_P (TREE_TYPE (rl_arg
))
5617 && simple_operand_p (rl_arg
)
5618 && simple_operand_p (rr_arg
))
5620 /* Convert (a != 0) || (b != 0) into (a | b) != 0. */
5621 if (code
== TRUTH_OR_EXPR
5622 && lcode
== NE_EXPR
&& integer_zerop (lr_arg
)
5623 && rcode
== NE_EXPR
&& integer_zerop (rr_arg
)
5624 && TREE_TYPE (ll_arg
) == TREE_TYPE (rl_arg
)
5625 && INTEGRAL_TYPE_P (TREE_TYPE (ll_arg
)))
5626 return build2_loc (loc
, NE_EXPR
, truth_type
,
5627 build2 (BIT_IOR_EXPR
, TREE_TYPE (ll_arg
),
5629 build_int_cst (TREE_TYPE (ll_arg
), 0));
5631 /* Convert (a == 0) && (b == 0) into (a | b) == 0. */
5632 if (code
== TRUTH_AND_EXPR
5633 && lcode
== EQ_EXPR
&& integer_zerop (lr_arg
)
5634 && rcode
== EQ_EXPR
&& integer_zerop (rr_arg
)
5635 && TREE_TYPE (ll_arg
) == TREE_TYPE (rl_arg
)
5636 && INTEGRAL_TYPE_P (TREE_TYPE (ll_arg
)))
5637 return build2_loc (loc
, EQ_EXPR
, truth_type
,
5638 build2 (BIT_IOR_EXPR
, TREE_TYPE (ll_arg
),
5640 build_int_cst (TREE_TYPE (ll_arg
), 0));
5643 /* See if the comparisons can be merged. Then get all the parameters for
5646 if ((lcode
!= EQ_EXPR
&& lcode
!= NE_EXPR
)
5647 || (rcode
!= EQ_EXPR
&& rcode
!= NE_EXPR
))
5650 ll_reversep
= lr_reversep
= rl_reversep
= rr_reversep
= 0;
5652 ll_inner
= decode_field_reference (loc
, ll_arg
,
5653 &ll_bitsize
, &ll_bitpos
, &ll_mode
,
5654 &ll_unsignedp
, &ll_reversep
, &volatilep
,
5655 &ll_mask
, &ll_and_mask
);
5656 lr_inner
= decode_field_reference (loc
, lr_arg
,
5657 &lr_bitsize
, &lr_bitpos
, &lr_mode
,
5658 &lr_unsignedp
, &lr_reversep
, &volatilep
,
5659 &lr_mask
, &lr_and_mask
);
5660 rl_inner
= decode_field_reference (loc
, rl_arg
,
5661 &rl_bitsize
, &rl_bitpos
, &rl_mode
,
5662 &rl_unsignedp
, &rl_reversep
, &volatilep
,
5663 &rl_mask
, &rl_and_mask
);
5664 rr_inner
= decode_field_reference (loc
, rr_arg
,
5665 &rr_bitsize
, &rr_bitpos
, &rr_mode
,
5666 &rr_unsignedp
, &rr_reversep
, &volatilep
,
5667 &rr_mask
, &rr_and_mask
);
5669 /* It must be true that the inner operation on the lhs of each
5670 comparison must be the same if we are to be able to do anything.
5671 Then see if we have constants. If not, the same must be true for
5674 || ll_reversep
!= rl_reversep
5675 || ll_inner
== 0 || rl_inner
== 0
5676 || ! operand_equal_p (ll_inner
, rl_inner
, 0))
5679 if (TREE_CODE (lr_arg
) == INTEGER_CST
5680 && TREE_CODE (rr_arg
) == INTEGER_CST
)
5682 l_const
= lr_arg
, r_const
= rr_arg
;
5683 lr_reversep
= ll_reversep
;
5685 else if (lr_reversep
!= rr_reversep
5686 || lr_inner
== 0 || rr_inner
== 0
5687 || ! operand_equal_p (lr_inner
, rr_inner
, 0))
5690 l_const
= r_const
= 0;
5692 /* If either comparison code is not correct for our logical operation,
5693 fail. However, we can convert a one-bit comparison against zero into
5694 the opposite comparison against that bit being set in the field. */
5696 wanted_code
= (code
== TRUTH_AND_EXPR
? EQ_EXPR
: NE_EXPR
);
5697 if (lcode
!= wanted_code
)
5699 if (l_const
&& integer_zerop (l_const
) && integer_pow2p (ll_mask
))
5701 /* Make the left operand unsigned, since we are only interested
5702 in the value of one bit. Otherwise we are doing the wrong
5711 /* This is analogous to the code for l_const above. */
5712 if (rcode
!= wanted_code
)
5714 if (r_const
&& integer_zerop (r_const
) && integer_pow2p (rl_mask
))
5723 /* See if we can find a mode that contains both fields being compared on
5724 the left. If we can't, fail. Otherwise, update all constants and masks
5725 to be relative to a field of that size. */
5726 first_bit
= MIN (ll_bitpos
, rl_bitpos
);
5727 end_bit
= MAX (ll_bitpos
+ ll_bitsize
, rl_bitpos
+ rl_bitsize
);
5728 lnmode
= get_best_mode (end_bit
- first_bit
, first_bit
, 0, 0,
5729 TYPE_ALIGN (TREE_TYPE (ll_inner
)), word_mode
,
5731 if (lnmode
== VOIDmode
)
5734 lnbitsize
= GET_MODE_BITSIZE (lnmode
);
5735 lnbitpos
= first_bit
& ~ (lnbitsize
- 1);
5736 lntype
= lang_hooks
.types
.type_for_size (lnbitsize
, 1);
5737 xll_bitpos
= ll_bitpos
- lnbitpos
, xrl_bitpos
= rl_bitpos
- lnbitpos
;
5739 if (ll_reversep
? !BYTES_BIG_ENDIAN
: BYTES_BIG_ENDIAN
)
5741 xll_bitpos
= lnbitsize
- xll_bitpos
- ll_bitsize
;
5742 xrl_bitpos
= lnbitsize
- xrl_bitpos
- rl_bitsize
;
5745 ll_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
, lntype
, ll_mask
),
5746 size_int (xll_bitpos
));
5747 rl_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
, lntype
, rl_mask
),
5748 size_int (xrl_bitpos
));
5752 l_const
= fold_convert_loc (loc
, lntype
, l_const
);
5753 l_const
= unextend (l_const
, ll_bitsize
, ll_unsignedp
, ll_and_mask
);
5754 l_const
= const_binop (LSHIFT_EXPR
, l_const
, size_int (xll_bitpos
));
5755 if (! integer_zerop (const_binop (BIT_AND_EXPR
, l_const
,
5756 fold_build1_loc (loc
, BIT_NOT_EXPR
,
5759 warning (0, "comparison is always %d", wanted_code
== NE_EXPR
);
5761 return constant_boolean_node (wanted_code
== NE_EXPR
, truth_type
);
5766 r_const
= fold_convert_loc (loc
, lntype
, r_const
);
5767 r_const
= unextend (r_const
, rl_bitsize
, rl_unsignedp
, rl_and_mask
);
5768 r_const
= const_binop (LSHIFT_EXPR
, r_const
, size_int (xrl_bitpos
));
5769 if (! integer_zerop (const_binop (BIT_AND_EXPR
, r_const
,
5770 fold_build1_loc (loc
, BIT_NOT_EXPR
,
5773 warning (0, "comparison is always %d", wanted_code
== NE_EXPR
);
5775 return constant_boolean_node (wanted_code
== NE_EXPR
, truth_type
);
5779 /* If the right sides are not constant, do the same for it. Also,
5780 disallow this optimization if a size or signedness mismatch occurs
5781 between the left and right sides. */
5784 if (ll_bitsize
!= lr_bitsize
|| rl_bitsize
!= rr_bitsize
5785 || ll_unsignedp
!= lr_unsignedp
|| rl_unsignedp
!= rr_unsignedp
5786 /* Make sure the two fields on the right
5787 correspond to the left without being swapped. */
5788 || ll_bitpos
- rl_bitpos
!= lr_bitpos
- rr_bitpos
)
5791 first_bit
= MIN (lr_bitpos
, rr_bitpos
);
5792 end_bit
= MAX (lr_bitpos
+ lr_bitsize
, rr_bitpos
+ rr_bitsize
);
5793 rnmode
= get_best_mode (end_bit
- first_bit
, first_bit
, 0, 0,
5794 TYPE_ALIGN (TREE_TYPE (lr_inner
)), word_mode
,
5796 if (rnmode
== VOIDmode
)
5799 rnbitsize
= GET_MODE_BITSIZE (rnmode
);
5800 rnbitpos
= first_bit
& ~ (rnbitsize
- 1);
5801 rntype
= lang_hooks
.types
.type_for_size (rnbitsize
, 1);
5802 xlr_bitpos
= lr_bitpos
- rnbitpos
, xrr_bitpos
= rr_bitpos
- rnbitpos
;
5804 if (lr_reversep
? !BYTES_BIG_ENDIAN
: BYTES_BIG_ENDIAN
)
5806 xlr_bitpos
= rnbitsize
- xlr_bitpos
- lr_bitsize
;
5807 xrr_bitpos
= rnbitsize
- xrr_bitpos
- rr_bitsize
;
5810 lr_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
,
5812 size_int (xlr_bitpos
));
5813 rr_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
,
5815 size_int (xrr_bitpos
));
5817 /* Make a mask that corresponds to both fields being compared.
5818 Do this for both items being compared. If the operands are the
5819 same size and the bits being compared are in the same position
5820 then we can do this by masking both and comparing the masked
5822 ll_mask
= const_binop (BIT_IOR_EXPR
, ll_mask
, rl_mask
);
5823 lr_mask
= const_binop (BIT_IOR_EXPR
, lr_mask
, rr_mask
);
5824 if (lnbitsize
== rnbitsize
&& xll_bitpos
== xlr_bitpos
)
5826 lhs
= make_bit_field_ref (loc
, ll_inner
, lntype
, lnbitsize
, lnbitpos
,
5827 ll_unsignedp
|| rl_unsignedp
, ll_reversep
);
5828 if (! all_ones_mask_p (ll_mask
, lnbitsize
))
5829 lhs
= build2 (BIT_AND_EXPR
, lntype
, lhs
, ll_mask
);
5831 rhs
= make_bit_field_ref (loc
, lr_inner
, rntype
, rnbitsize
, rnbitpos
,
5832 lr_unsignedp
|| rr_unsignedp
, lr_reversep
);
5833 if (! all_ones_mask_p (lr_mask
, rnbitsize
))
5834 rhs
= build2 (BIT_AND_EXPR
, rntype
, rhs
, lr_mask
);
5836 return build2_loc (loc
, wanted_code
, truth_type
, lhs
, rhs
);
5839 /* There is still another way we can do something: If both pairs of
5840 fields being compared are adjacent, we may be able to make a wider
5841 field containing them both.
5843 Note that we still must mask the lhs/rhs expressions. Furthermore,
5844 the mask must be shifted to account for the shift done by
5845 make_bit_field_ref. */
5846 if ((ll_bitsize
+ ll_bitpos
== rl_bitpos
5847 && lr_bitsize
+ lr_bitpos
== rr_bitpos
)
5848 || (ll_bitpos
== rl_bitpos
+ rl_bitsize
5849 && lr_bitpos
== rr_bitpos
+ rr_bitsize
))
5853 lhs
= make_bit_field_ref (loc
, ll_inner
, lntype
,
5854 ll_bitsize
+ rl_bitsize
,
5855 MIN (ll_bitpos
, rl_bitpos
),
5856 ll_unsignedp
, ll_reversep
);
5857 rhs
= make_bit_field_ref (loc
, lr_inner
, rntype
,
5858 lr_bitsize
+ rr_bitsize
,
5859 MIN (lr_bitpos
, rr_bitpos
),
5860 lr_unsignedp
, lr_reversep
);
5862 ll_mask
= const_binop (RSHIFT_EXPR
, ll_mask
,
5863 size_int (MIN (xll_bitpos
, xrl_bitpos
)));
5864 lr_mask
= const_binop (RSHIFT_EXPR
, lr_mask
,
5865 size_int (MIN (xlr_bitpos
, xrr_bitpos
)));
5867 /* Convert to the smaller type before masking out unwanted bits. */
5869 if (lntype
!= rntype
)
5871 if (lnbitsize
> rnbitsize
)
5873 lhs
= fold_convert_loc (loc
, rntype
, lhs
);
5874 ll_mask
= fold_convert_loc (loc
, rntype
, ll_mask
);
5877 else if (lnbitsize
< rnbitsize
)
5879 rhs
= fold_convert_loc (loc
, lntype
, rhs
);
5880 lr_mask
= fold_convert_loc (loc
, lntype
, lr_mask
);
5885 if (! all_ones_mask_p (ll_mask
, ll_bitsize
+ rl_bitsize
))
5886 lhs
= build2 (BIT_AND_EXPR
, type
, lhs
, ll_mask
);
5888 if (! all_ones_mask_p (lr_mask
, lr_bitsize
+ rr_bitsize
))
5889 rhs
= build2 (BIT_AND_EXPR
, type
, rhs
, lr_mask
);
5891 return build2_loc (loc
, wanted_code
, truth_type
, lhs
, rhs
);
5897 /* Handle the case of comparisons with constants. If there is something in
5898 common between the masks, those bits of the constants must be the same.
5899 If not, the condition is always false. Test for this to avoid generating
5900 incorrect code below. */
5901 result
= const_binop (BIT_AND_EXPR
, ll_mask
, rl_mask
);
5902 if (! integer_zerop (result
)
5903 && simple_cst_equal (const_binop (BIT_AND_EXPR
, result
, l_const
),
5904 const_binop (BIT_AND_EXPR
, result
, r_const
)) != 1)
5906 if (wanted_code
== NE_EXPR
)
5908 warning (0, "%<or%> of unmatched not-equal tests is always 1");
5909 return constant_boolean_node (true, truth_type
);
5913 warning (0, "%<and%> of mutually exclusive equal-tests is always 0");
5914 return constant_boolean_node (false, truth_type
);
5918 /* Construct the expression we will return. First get the component
5919 reference we will make. Unless the mask is all ones the width of
5920 that field, perform the mask operation. Then compare with the
5922 result
= make_bit_field_ref (loc
, ll_inner
, lntype
, lnbitsize
, lnbitpos
,
5923 ll_unsignedp
|| rl_unsignedp
, ll_reversep
);
5925 ll_mask
= const_binop (BIT_IOR_EXPR
, ll_mask
, rl_mask
);
5926 if (! all_ones_mask_p (ll_mask
, lnbitsize
))
5927 result
= build2_loc (loc
, BIT_AND_EXPR
, lntype
, result
, ll_mask
);
5929 return build2_loc (loc
, wanted_code
, truth_type
, result
,
5930 const_binop (BIT_IOR_EXPR
, l_const
, r_const
));
5933 /* Optimize T, which is a comparison of a MIN_EXPR or MAX_EXPR with a
5937 optimize_minmax_comparison (location_t loc
, enum tree_code code
, tree type
,
5941 enum tree_code op_code
;
5944 int consts_equal
, consts_lt
;
5947 STRIP_SIGN_NOPS (arg0
);
5949 op_code
= TREE_CODE (arg0
);
5950 minmax_const
= TREE_OPERAND (arg0
, 1);
5951 comp_const
= fold_convert_loc (loc
, TREE_TYPE (arg0
), op1
);
5952 consts_equal
= tree_int_cst_equal (minmax_const
, comp_const
);
5953 consts_lt
= tree_int_cst_lt (minmax_const
, comp_const
);
5954 inner
= TREE_OPERAND (arg0
, 0);
5956 /* If something does not permit us to optimize, return the original tree. */
5957 if ((op_code
!= MIN_EXPR
&& op_code
!= MAX_EXPR
)
5958 || TREE_CODE (comp_const
) != INTEGER_CST
5959 || TREE_OVERFLOW (comp_const
)
5960 || TREE_CODE (minmax_const
) != INTEGER_CST
5961 || TREE_OVERFLOW (minmax_const
))
5964 /* Now handle all the various comparison codes. We only handle EQ_EXPR
5965 and GT_EXPR, doing the rest with recursive calls using logical
5969 case NE_EXPR
: case LT_EXPR
: case LE_EXPR
:
5972 = optimize_minmax_comparison (loc
,
5973 invert_tree_comparison (code
, false),
5976 return invert_truthvalue_loc (loc
, tem
);
5982 fold_build2_loc (loc
, TRUTH_ORIF_EXPR
, type
,
5983 optimize_minmax_comparison
5984 (loc
, EQ_EXPR
, type
, arg0
, comp_const
),
5985 optimize_minmax_comparison
5986 (loc
, GT_EXPR
, type
, arg0
, comp_const
));
5989 if (op_code
== MAX_EXPR
&& consts_equal
)
5990 /* MAX (X, 0) == 0 -> X <= 0 */
5991 return fold_build2_loc (loc
, LE_EXPR
, type
, inner
, comp_const
);
5993 else if (op_code
== MAX_EXPR
&& consts_lt
)
5994 /* MAX (X, 0) == 5 -> X == 5 */
5995 return fold_build2_loc (loc
, EQ_EXPR
, type
, inner
, comp_const
);
5997 else if (op_code
== MAX_EXPR
)
5998 /* MAX (X, 0) == -1 -> false */
5999 return omit_one_operand_loc (loc
, type
, integer_zero_node
, inner
);
6001 else if (consts_equal
)
6002 /* MIN (X, 0) == 0 -> X >= 0 */
6003 return fold_build2_loc (loc
, GE_EXPR
, type
, inner
, comp_const
);
6006 /* MIN (X, 0) == 5 -> false */
6007 return omit_one_operand_loc (loc
, type
, integer_zero_node
, inner
);
6010 /* MIN (X, 0) == -1 -> X == -1 */
6011 return fold_build2_loc (loc
, EQ_EXPR
, type
, inner
, comp_const
);
6014 if (op_code
== MAX_EXPR
&& (consts_equal
|| consts_lt
))
6015 /* MAX (X, 0) > 0 -> X > 0
6016 MAX (X, 0) > 5 -> X > 5 */
6017 return fold_build2_loc (loc
, GT_EXPR
, type
, inner
, comp_const
);
6019 else if (op_code
== MAX_EXPR
)
6020 /* MAX (X, 0) > -1 -> true */
6021 return omit_one_operand_loc (loc
, type
, integer_one_node
, inner
);
6023 else if (op_code
== MIN_EXPR
&& (consts_equal
|| consts_lt
))
6024 /* MIN (X, 0) > 0 -> false
6025 MIN (X, 0) > 5 -> false */
6026 return omit_one_operand_loc (loc
, type
, integer_zero_node
, inner
);
6029 /* MIN (X, 0) > -1 -> X > -1 */
6030 return fold_build2_loc (loc
, GT_EXPR
, type
, inner
, comp_const
);
6037 /* T is an integer expression that is being multiplied, divided, or taken a
6038 modulus (CODE says which and what kind of divide or modulus) by a
6039 constant C. See if we can eliminate that operation by folding it with
6040 other operations already in T. WIDE_TYPE, if non-null, is a type that
6041 should be used for the computation if wider than our type.
6043 For example, if we are dividing (X * 8) + (Y * 16) by 4, we can return
6044 (X * 2) + (Y * 4). We must, however, be assured that either the original
6045 expression would not overflow or that overflow is undefined for the type
6046 in the language in question.
6048 If we return a non-null expression, it is an equivalent form of the
6049 original computation, but need not be in the original type.
6051 We set *STRICT_OVERFLOW_P to true if the return values depends on
6052 signed overflow being undefined. Otherwise we do not change
6053 *STRICT_OVERFLOW_P. */
6056 extract_muldiv (tree t
, tree c
, enum tree_code code
, tree wide_type
,
6057 bool *strict_overflow_p
)
6059 /* To avoid exponential search depth, refuse to allow recursion past
6060 three levels. Beyond that (1) it's highly unlikely that we'll find
6061 something interesting and (2) we've probably processed it before
6062 when we built the inner expression. */
6071 ret
= extract_muldiv_1 (t
, c
, code
, wide_type
, strict_overflow_p
);
6078 extract_muldiv_1 (tree t
, tree c
, enum tree_code code
, tree wide_type
,
6079 bool *strict_overflow_p
)
6081 tree type
= TREE_TYPE (t
);
6082 enum tree_code tcode
= TREE_CODE (t
);
6083 tree ctype
= (wide_type
!= 0 && (GET_MODE_SIZE (TYPE_MODE (wide_type
))
6084 > GET_MODE_SIZE (TYPE_MODE (type
)))
6085 ? wide_type
: type
);
6087 int same_p
= tcode
== code
;
6088 tree op0
= NULL_TREE
, op1
= NULL_TREE
;
6089 bool sub_strict_overflow_p
;
6091 /* Don't deal with constants of zero here; they confuse the code below. */
6092 if (integer_zerop (c
))
6095 if (TREE_CODE_CLASS (tcode
) == tcc_unary
)
6096 op0
= TREE_OPERAND (t
, 0);
6098 if (TREE_CODE_CLASS (tcode
) == tcc_binary
)
6099 op0
= TREE_OPERAND (t
, 0), op1
= TREE_OPERAND (t
, 1);
6101 /* Note that we need not handle conditional operations here since fold
6102 already handles those cases. So just do arithmetic here. */
6106 /* For a constant, we can always simplify if we are a multiply
6107 or (for divide and modulus) if it is a multiple of our constant. */
6108 if (code
== MULT_EXPR
6109 || wi::multiple_of_p (t
, c
, TYPE_SIGN (type
)))
6111 tree tem
= const_binop (code
, fold_convert (ctype
, t
),
6112 fold_convert (ctype
, c
));
6113 /* If the multiplication overflowed to INT_MIN then we lost sign
6114 information on it and a subsequent multiplication might
6115 spuriously overflow. See PR68142. */
6116 if (TREE_OVERFLOW (tem
)
6117 && wi::eq_p (tem
, wi::min_value (TYPE_PRECISION (ctype
), SIGNED
)))
6123 CASE_CONVERT
: case NON_LVALUE_EXPR
:
6124 /* If op0 is an expression ... */
6125 if ((COMPARISON_CLASS_P (op0
)
6126 || UNARY_CLASS_P (op0
)
6127 || BINARY_CLASS_P (op0
)
6128 || VL_EXP_CLASS_P (op0
)
6129 || EXPRESSION_CLASS_P (op0
))
6130 /* ... and has wrapping overflow, and its type is smaller
6131 than ctype, then we cannot pass through as widening. */
6132 && (((ANY_INTEGRAL_TYPE_P (TREE_TYPE (op0
))
6133 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (op0
)))
6134 && (TYPE_PRECISION (ctype
)
6135 > TYPE_PRECISION (TREE_TYPE (op0
))))
6136 /* ... or this is a truncation (t is narrower than op0),
6137 then we cannot pass through this narrowing. */
6138 || (TYPE_PRECISION (type
)
6139 < TYPE_PRECISION (TREE_TYPE (op0
)))
6140 /* ... or signedness changes for division or modulus,
6141 then we cannot pass through this conversion. */
6142 || (code
!= MULT_EXPR
6143 && (TYPE_UNSIGNED (ctype
)
6144 != TYPE_UNSIGNED (TREE_TYPE (op0
))))
6145 /* ... or has undefined overflow while the converted to
6146 type has not, we cannot do the operation in the inner type
6147 as that would introduce undefined overflow. */
6148 || ((ANY_INTEGRAL_TYPE_P (TREE_TYPE (op0
))
6149 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (op0
)))
6150 && !TYPE_OVERFLOW_UNDEFINED (type
))))
6153 /* Pass the constant down and see if we can make a simplification. If
6154 we can, replace this expression with the inner simplification for
6155 possible later conversion to our or some other type. */
6156 if ((t2
= fold_convert (TREE_TYPE (op0
), c
)) != 0
6157 && TREE_CODE (t2
) == INTEGER_CST
6158 && !TREE_OVERFLOW (t2
)
6159 && (0 != (t1
= extract_muldiv (op0
, t2
, code
,
6161 ? ctype
: NULL_TREE
,
6162 strict_overflow_p
))))
6167 /* If widening the type changes it from signed to unsigned, then we
6168 must avoid building ABS_EXPR itself as unsigned. */
6169 if (TYPE_UNSIGNED (ctype
) && !TYPE_UNSIGNED (type
))
6171 tree cstype
= (*signed_type_for
) (ctype
);
6172 if ((t1
= extract_muldiv (op0
, c
, code
, cstype
, strict_overflow_p
))
6175 t1
= fold_build1 (tcode
, cstype
, fold_convert (cstype
, t1
));
6176 return fold_convert (ctype
, t1
);
6180 /* If the constant is negative, we cannot simplify this. */
6181 if (tree_int_cst_sgn (c
) == -1)
6185 /* For division and modulus, type can't be unsigned, as e.g.
6186 (-(x / 2U)) / 2U isn't equal to -((x / 2U) / 2U) for x >= 2.
6187 For signed types, even with wrapping overflow, this is fine. */
6188 if (code
!= MULT_EXPR
&& TYPE_UNSIGNED (type
))
6190 if ((t1
= extract_muldiv (op0
, c
, code
, wide_type
, strict_overflow_p
))
6192 return fold_build1 (tcode
, ctype
, fold_convert (ctype
, t1
));
6195 case MIN_EXPR
: case MAX_EXPR
:
6196 /* If widening the type changes the signedness, then we can't perform
6197 this optimization as that changes the result. */
6198 if (TYPE_UNSIGNED (ctype
) != TYPE_UNSIGNED (type
))
6201 /* MIN (a, b) / 5 -> MIN (a / 5, b / 5) */
6202 sub_strict_overflow_p
= false;
6203 if ((t1
= extract_muldiv (op0
, c
, code
, wide_type
,
6204 &sub_strict_overflow_p
)) != 0
6205 && (t2
= extract_muldiv (op1
, c
, code
, wide_type
,
6206 &sub_strict_overflow_p
)) != 0)
6208 if (tree_int_cst_sgn (c
) < 0)
6209 tcode
= (tcode
== MIN_EXPR
? MAX_EXPR
: MIN_EXPR
);
6210 if (sub_strict_overflow_p
)
6211 *strict_overflow_p
= true;
6212 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, t1
),
6213 fold_convert (ctype
, t2
));
6217 case LSHIFT_EXPR
: case RSHIFT_EXPR
:
6218 /* If the second operand is constant, this is a multiplication
6219 or floor division, by a power of two, so we can treat it that
6220 way unless the multiplier or divisor overflows. Signed
6221 left-shift overflow is implementation-defined rather than
6222 undefined in C90, so do not convert signed left shift into
6224 if (TREE_CODE (op1
) == INTEGER_CST
6225 && (tcode
== RSHIFT_EXPR
|| TYPE_UNSIGNED (TREE_TYPE (op0
)))
6226 /* const_binop may not detect overflow correctly,
6227 so check for it explicitly here. */
6228 && wi::gtu_p (TYPE_PRECISION (TREE_TYPE (size_one_node
)), op1
)
6229 && 0 != (t1
= fold_convert (ctype
,
6230 const_binop (LSHIFT_EXPR
,
6233 && !TREE_OVERFLOW (t1
))
6234 return extract_muldiv (build2 (tcode
== LSHIFT_EXPR
6235 ? MULT_EXPR
: FLOOR_DIV_EXPR
,
6237 fold_convert (ctype
, op0
),
6239 c
, code
, wide_type
, strict_overflow_p
);
6242 case PLUS_EXPR
: case MINUS_EXPR
:
6243 /* See if we can eliminate the operation on both sides. If we can, we
6244 can return a new PLUS or MINUS. If we can't, the only remaining
6245 cases where we can do anything are if the second operand is a
6247 sub_strict_overflow_p
= false;
6248 t1
= extract_muldiv (op0
, c
, code
, wide_type
, &sub_strict_overflow_p
);
6249 t2
= extract_muldiv (op1
, c
, code
, wide_type
, &sub_strict_overflow_p
);
6250 if (t1
!= 0 && t2
!= 0
6251 && (code
== MULT_EXPR
6252 /* If not multiplication, we can only do this if both operands
6253 are divisible by c. */
6254 || (multiple_of_p (ctype
, op0
, c
)
6255 && multiple_of_p (ctype
, op1
, c
))))
6257 if (sub_strict_overflow_p
)
6258 *strict_overflow_p
= true;
6259 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, t1
),
6260 fold_convert (ctype
, t2
));
6263 /* If this was a subtraction, negate OP1 and set it to be an addition.
6264 This simplifies the logic below. */
6265 if (tcode
== MINUS_EXPR
)
6267 tcode
= PLUS_EXPR
, op1
= negate_expr (op1
);
6268 /* If OP1 was not easily negatable, the constant may be OP0. */
6269 if (TREE_CODE (op0
) == INTEGER_CST
)
6271 std::swap (op0
, op1
);
6276 if (TREE_CODE (op1
) != INTEGER_CST
)
6279 /* If either OP1 or C are negative, this optimization is not safe for
6280 some of the division and remainder types while for others we need
6281 to change the code. */
6282 if (tree_int_cst_sgn (op1
) < 0 || tree_int_cst_sgn (c
) < 0)
6284 if (code
== CEIL_DIV_EXPR
)
6285 code
= FLOOR_DIV_EXPR
;
6286 else if (code
== FLOOR_DIV_EXPR
)
6287 code
= CEIL_DIV_EXPR
;
6288 else if (code
!= MULT_EXPR
6289 && code
!= CEIL_MOD_EXPR
&& code
!= FLOOR_MOD_EXPR
)
6293 /* If it's a multiply or a division/modulus operation of a multiple
6294 of our constant, do the operation and verify it doesn't overflow. */
6295 if (code
== MULT_EXPR
6296 || wi::multiple_of_p (op1
, c
, TYPE_SIGN (type
)))
6298 op1
= const_binop (code
, fold_convert (ctype
, op1
),
6299 fold_convert (ctype
, c
));
6300 /* We allow the constant to overflow with wrapping semantics. */
6302 || (TREE_OVERFLOW (op1
) && !TYPE_OVERFLOW_WRAPS (ctype
)))
6308 /* If we have an unsigned type, we cannot widen the operation since it
6309 will change the result if the original computation overflowed. */
6310 if (TYPE_UNSIGNED (ctype
) && ctype
!= type
)
6313 /* If we were able to eliminate our operation from the first side,
6314 apply our operation to the second side and reform the PLUS. */
6315 if (t1
!= 0 && (TREE_CODE (t1
) != code
|| code
== MULT_EXPR
))
6316 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, t1
), op1
);
6318 /* The last case is if we are a multiply. In that case, we can
6319 apply the distributive law to commute the multiply and addition
6320 if the multiplication of the constants doesn't overflow
6321 and overflow is defined. With undefined overflow
6322 op0 * c might overflow, while (op0 + orig_op1) * c doesn't. */
6323 if (code
== MULT_EXPR
&& TYPE_OVERFLOW_WRAPS (ctype
))
6324 return fold_build2 (tcode
, ctype
,
6325 fold_build2 (code
, ctype
,
6326 fold_convert (ctype
, op0
),
6327 fold_convert (ctype
, c
)),
6333 /* We have a special case here if we are doing something like
6334 (C * 8) % 4 since we know that's zero. */
6335 if ((code
== TRUNC_MOD_EXPR
|| code
== CEIL_MOD_EXPR
6336 || code
== FLOOR_MOD_EXPR
|| code
== ROUND_MOD_EXPR
)
6337 /* If the multiplication can overflow we cannot optimize this. */
6338 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (t
))
6339 && TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
6340 && wi::multiple_of_p (op1
, c
, TYPE_SIGN (type
)))
6342 *strict_overflow_p
= true;
6343 return omit_one_operand (type
, integer_zero_node
, op0
);
6346 /* ... fall through ... */
6348 case TRUNC_DIV_EXPR
: case CEIL_DIV_EXPR
: case FLOOR_DIV_EXPR
:
6349 case ROUND_DIV_EXPR
: case EXACT_DIV_EXPR
:
6350 /* If we can extract our operation from the LHS, do so and return a
6351 new operation. Likewise for the RHS from a MULT_EXPR. Otherwise,
6352 do something only if the second operand is a constant. */
6354 && (t1
= extract_muldiv (op0
, c
, code
, wide_type
,
6355 strict_overflow_p
)) != 0)
6356 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, t1
),
6357 fold_convert (ctype
, op1
));
6358 else if (tcode
== MULT_EXPR
&& code
== MULT_EXPR
6359 && (t1
= extract_muldiv (op1
, c
, code
, wide_type
,
6360 strict_overflow_p
)) != 0)
6361 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, op0
),
6362 fold_convert (ctype
, t1
));
6363 else if (TREE_CODE (op1
) != INTEGER_CST
)
6366 /* If these are the same operation types, we can associate them
6367 assuming no overflow. */
6370 bool overflow_p
= false;
6371 bool overflow_mul_p
;
6372 signop sign
= TYPE_SIGN (ctype
);
6373 wide_int mul
= wi::mul (op1
, c
, sign
, &overflow_mul_p
);
6374 overflow_p
= TREE_OVERFLOW (c
) | TREE_OVERFLOW (op1
);
6376 && ((sign
== UNSIGNED
&& tcode
!= MULT_EXPR
) || sign
== SIGNED
))
6380 mul
= wide_int::from (mul
, TYPE_PRECISION (ctype
),
6381 TYPE_SIGN (TREE_TYPE (op1
)));
6382 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, op0
),
6383 wide_int_to_tree (ctype
, mul
));
6387 /* If these operations "cancel" each other, we have the main
6388 optimizations of this pass, which occur when either constant is a
6389 multiple of the other, in which case we replace this with either an
6390 operation or CODE or TCODE.
6392 If we have an unsigned type, we cannot do this since it will change
6393 the result if the original computation overflowed. */
6394 if (TYPE_OVERFLOW_UNDEFINED (ctype
)
6395 && ((code
== MULT_EXPR
&& tcode
== EXACT_DIV_EXPR
)
6396 || (tcode
== MULT_EXPR
6397 && code
!= TRUNC_MOD_EXPR
&& code
!= CEIL_MOD_EXPR
6398 && code
!= FLOOR_MOD_EXPR
&& code
!= ROUND_MOD_EXPR
6399 && code
!= MULT_EXPR
)))
6401 if (wi::multiple_of_p (op1
, c
, TYPE_SIGN (type
)))
6403 if (TYPE_OVERFLOW_UNDEFINED (ctype
))
6404 *strict_overflow_p
= true;
6405 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, op0
),
6406 fold_convert (ctype
,
6407 const_binop (TRUNC_DIV_EXPR
,
6410 else if (wi::multiple_of_p (c
, op1
, TYPE_SIGN (type
)))
6412 if (TYPE_OVERFLOW_UNDEFINED (ctype
))
6413 *strict_overflow_p
= true;
6414 return fold_build2 (code
, ctype
, fold_convert (ctype
, op0
),
6415 fold_convert (ctype
,
6416 const_binop (TRUNC_DIV_EXPR
,
6429 /* Return a node which has the indicated constant VALUE (either 0 or
6430 1 for scalars or {-1,-1,..} or {0,0,...} for vectors),
6431 and is of the indicated TYPE. */
6434 constant_boolean_node (bool value
, tree type
)
6436 if (type
== integer_type_node
)
6437 return value
? integer_one_node
: integer_zero_node
;
6438 else if (type
== boolean_type_node
)
6439 return value
? boolean_true_node
: boolean_false_node
;
6440 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6441 return build_vector_from_val (type
,
6442 build_int_cst (TREE_TYPE (type
),
6445 return fold_convert (type
, value
? integer_one_node
: integer_zero_node
);
6449 /* Transform `a + (b ? x : y)' into `b ? (a + x) : (a + y)'.
6450 Transform, `a + (x < y)' into `(x < y) ? (a + 1) : (a + 0)'. Here
6451 CODE corresponds to the `+', COND to the `(b ? x : y)' or `(x < y)'
6452 expression, and ARG to `a'. If COND_FIRST_P is nonzero, then the
6453 COND is the first argument to CODE; otherwise (as in the example
6454 given here), it is the second argument. TYPE is the type of the
6455 original expression. Return NULL_TREE if no simplification is
6459 fold_binary_op_with_conditional_arg (location_t loc
,
6460 enum tree_code code
,
6461 tree type
, tree op0
, tree op1
,
6462 tree cond
, tree arg
, int cond_first_p
)
6464 tree cond_type
= cond_first_p
? TREE_TYPE (op0
) : TREE_TYPE (op1
);
6465 tree arg_type
= cond_first_p
? TREE_TYPE (op1
) : TREE_TYPE (op0
);
6466 tree test
, true_value
, false_value
;
6467 tree lhs
= NULL_TREE
;
6468 tree rhs
= NULL_TREE
;
6469 enum tree_code cond_code
= COND_EXPR
;
6471 if (TREE_CODE (cond
) == COND_EXPR
6472 || TREE_CODE (cond
) == VEC_COND_EXPR
)
6474 test
= TREE_OPERAND (cond
, 0);
6475 true_value
= TREE_OPERAND (cond
, 1);
6476 false_value
= TREE_OPERAND (cond
, 2);
6477 /* If this operand throws an expression, then it does not make
6478 sense to try to perform a logical or arithmetic operation
6480 if (VOID_TYPE_P (TREE_TYPE (true_value
)))
6482 if (VOID_TYPE_P (TREE_TYPE (false_value
)))
6485 else if (!(TREE_CODE (type
) != VECTOR_TYPE
6486 && TREE_CODE (TREE_TYPE (cond
)) == VECTOR_TYPE
))
6488 tree testtype
= TREE_TYPE (cond
);
6490 true_value
= constant_boolean_node (true, testtype
);
6491 false_value
= constant_boolean_node (false, testtype
);
6494 /* Detect the case of mixing vector and scalar types - bail out. */
6497 if (TREE_CODE (TREE_TYPE (test
)) == VECTOR_TYPE
)
6498 cond_code
= VEC_COND_EXPR
;
6500 /* This transformation is only worthwhile if we don't have to wrap ARG
6501 in a SAVE_EXPR and the operation can be simplified without recursing
6502 on at least one of the branches once its pushed inside the COND_EXPR. */
6503 if (!TREE_CONSTANT (arg
)
6504 && (TREE_SIDE_EFFECTS (arg
)
6505 || TREE_CODE (arg
) == COND_EXPR
|| TREE_CODE (arg
) == VEC_COND_EXPR
6506 || TREE_CONSTANT (true_value
) || TREE_CONSTANT (false_value
)))
6509 arg
= fold_convert_loc (loc
, arg_type
, arg
);
6512 true_value
= fold_convert_loc (loc
, cond_type
, true_value
);
6514 lhs
= fold_build2_loc (loc
, code
, type
, true_value
, arg
);
6516 lhs
= fold_build2_loc (loc
, code
, type
, arg
, true_value
);
6520 false_value
= fold_convert_loc (loc
, cond_type
, false_value
);
6522 rhs
= fold_build2_loc (loc
, code
, type
, false_value
, arg
);
6524 rhs
= fold_build2_loc (loc
, code
, type
, arg
, false_value
);
6527 /* Check that we have simplified at least one of the branches. */
6528 if (!TREE_CONSTANT (arg
) && !TREE_CONSTANT (lhs
) && !TREE_CONSTANT (rhs
))
6531 return fold_build3_loc (loc
, cond_code
, type
, test
, lhs
, rhs
);
6535 /* Subroutine of fold() that checks for the addition of +/- 0.0.
6537 If !NEGATE, return true if ADDEND is +/-0.0 and, for all X of type
6538 TYPE, X + ADDEND is the same as X. If NEGATE, return true if X -
6539 ADDEND is the same as X.
6541 X + 0 and X - 0 both give X when X is NaN, infinite, or nonzero
6542 and finite. The problematic cases are when X is zero, and its mode
6543 has signed zeros. In the case of rounding towards -infinity,
6544 X - 0 is not the same as X because 0 - 0 is -0. In other rounding
6545 modes, X + 0 is not the same as X because -0 + 0 is 0. */
6548 fold_real_zero_addition_p (const_tree type
, const_tree addend
, int negate
)
6550 if (!real_zerop (addend
))
6553 /* Don't allow the fold with -fsignaling-nans. */
6554 if (HONOR_SNANS (element_mode (type
)))
6557 /* Allow the fold if zeros aren't signed, or their sign isn't important. */
6558 if (!HONOR_SIGNED_ZEROS (element_mode (type
)))
6561 /* In a vector or complex, we would need to check the sign of all zeros. */
6562 if (TREE_CODE (addend
) != REAL_CST
)
6565 /* Treat x + -0 as x - 0 and x - -0 as x + 0. */
6566 if (REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (addend
)))
6569 /* The mode has signed zeros, and we have to honor their sign.
6570 In this situation, there is only one case we can return true for.
6571 X - 0 is the same as X unless rounding towards -infinity is
6573 return negate
&& !HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
));
6576 /* Subroutine of fold() that optimizes comparisons of a division by
6577 a nonzero integer constant against an integer constant, i.e.
6580 CODE is the comparison operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR,
6581 GE_EXPR or LE_EXPR. TYPE is the type of the result and ARG0 and ARG1
6582 are the operands of the comparison. ARG1 must be a TREE_REAL_CST.
6584 The function returns the constant folded tree if a simplification
6585 can be made, and NULL_TREE otherwise. */
6588 fold_div_compare (location_t loc
,
6589 enum tree_code code
, tree type
, tree arg0
, tree arg1
)
6591 tree prod
, tmp
, hi
, lo
;
6592 tree arg00
= TREE_OPERAND (arg0
, 0);
6593 tree arg01
= TREE_OPERAND (arg0
, 1);
6594 signop sign
= TYPE_SIGN (TREE_TYPE (arg0
));
6595 bool neg_overflow
= false;
6598 /* We have to do this the hard way to detect unsigned overflow.
6599 prod = int_const_binop (MULT_EXPR, arg01, arg1); */
6600 wide_int val
= wi::mul (arg01
, arg1
, sign
, &overflow
);
6601 prod
= force_fit_type (TREE_TYPE (arg00
), val
, -1, overflow
);
6602 neg_overflow
= false;
6604 if (sign
== UNSIGNED
)
6606 tmp
= int_const_binop (MINUS_EXPR
, arg01
,
6607 build_int_cst (TREE_TYPE (arg01
), 1));
6610 /* Likewise hi = int_const_binop (PLUS_EXPR, prod, tmp). */
6611 val
= wi::add (prod
, tmp
, sign
, &overflow
);
6612 hi
= force_fit_type (TREE_TYPE (arg00
), val
,
6613 -1, overflow
| TREE_OVERFLOW (prod
));
6615 else if (tree_int_cst_sgn (arg01
) >= 0)
6617 tmp
= int_const_binop (MINUS_EXPR
, arg01
,
6618 build_int_cst (TREE_TYPE (arg01
), 1));
6619 switch (tree_int_cst_sgn (arg1
))
6622 neg_overflow
= true;
6623 lo
= int_const_binop (MINUS_EXPR
, prod
, tmp
);
6628 lo
= fold_negate_const (tmp
, TREE_TYPE (arg0
));
6633 hi
= int_const_binop (PLUS_EXPR
, prod
, tmp
);
6643 /* A negative divisor reverses the relational operators. */
6644 code
= swap_tree_comparison (code
);
6646 tmp
= int_const_binop (PLUS_EXPR
, arg01
,
6647 build_int_cst (TREE_TYPE (arg01
), 1));
6648 switch (tree_int_cst_sgn (arg1
))
6651 hi
= int_const_binop (MINUS_EXPR
, prod
, tmp
);
6656 hi
= fold_negate_const (tmp
, TREE_TYPE (arg0
));
6661 neg_overflow
= true;
6662 lo
= int_const_binop (PLUS_EXPR
, prod
, tmp
);
6674 if (TREE_OVERFLOW (lo
) && TREE_OVERFLOW (hi
))
6675 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg00
);
6676 if (TREE_OVERFLOW (hi
))
6677 return fold_build2_loc (loc
, GE_EXPR
, type
, arg00
, lo
);
6678 if (TREE_OVERFLOW (lo
))
6679 return fold_build2_loc (loc
, LE_EXPR
, type
, arg00
, hi
);
6680 return build_range_check (loc
, type
, arg00
, 1, lo
, hi
);
6683 if (TREE_OVERFLOW (lo
) && TREE_OVERFLOW (hi
))
6684 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg00
);
6685 if (TREE_OVERFLOW (hi
))
6686 return fold_build2_loc (loc
, LT_EXPR
, type
, arg00
, lo
);
6687 if (TREE_OVERFLOW (lo
))
6688 return fold_build2_loc (loc
, GT_EXPR
, type
, arg00
, hi
);
6689 return build_range_check (loc
, type
, arg00
, 0, lo
, hi
);
6692 if (TREE_OVERFLOW (lo
))
6694 tmp
= neg_overflow
? integer_zero_node
: integer_one_node
;
6695 return omit_one_operand_loc (loc
, type
, tmp
, arg00
);
6697 return fold_build2_loc (loc
, LT_EXPR
, type
, arg00
, lo
);
6700 if (TREE_OVERFLOW (hi
))
6702 tmp
= neg_overflow
? integer_zero_node
: integer_one_node
;
6703 return omit_one_operand_loc (loc
, type
, tmp
, arg00
);
6705 return fold_build2_loc (loc
, LE_EXPR
, type
, arg00
, hi
);
6708 if (TREE_OVERFLOW (hi
))
6710 tmp
= neg_overflow
? integer_one_node
: integer_zero_node
;
6711 return omit_one_operand_loc (loc
, type
, tmp
, arg00
);
6713 return fold_build2_loc (loc
, GT_EXPR
, type
, arg00
, hi
);
6716 if (TREE_OVERFLOW (lo
))
6718 tmp
= neg_overflow
? integer_one_node
: integer_zero_node
;
6719 return omit_one_operand_loc (loc
, type
, tmp
, arg00
);
6721 return fold_build2_loc (loc
, GE_EXPR
, type
, arg00
, lo
);
6731 /* If CODE with arguments ARG0 and ARG1 represents a single bit
6732 equality/inequality test, then return a simplified form of the test
6733 using a sign testing. Otherwise return NULL. TYPE is the desired
6737 fold_single_bit_test_into_sign_test (location_t loc
,
6738 enum tree_code code
, tree arg0
, tree arg1
,
6741 /* If this is testing a single bit, we can optimize the test. */
6742 if ((code
== NE_EXPR
|| code
== EQ_EXPR
)
6743 && TREE_CODE (arg0
) == BIT_AND_EXPR
&& integer_zerop (arg1
)
6744 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
6746 /* If we have (A & C) != 0 where C is the sign bit of A, convert
6747 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
6748 tree arg00
= sign_bit_p (TREE_OPERAND (arg0
, 0), TREE_OPERAND (arg0
, 1));
6750 if (arg00
!= NULL_TREE
6751 /* This is only a win if casting to a signed type is cheap,
6752 i.e. when arg00's type is not a partial mode. */
6753 && TYPE_PRECISION (TREE_TYPE (arg00
))
6754 == GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (arg00
))))
6756 tree stype
= signed_type_for (TREE_TYPE (arg00
));
6757 return fold_build2_loc (loc
, code
== EQ_EXPR
? GE_EXPR
: LT_EXPR
,
6759 fold_convert_loc (loc
, stype
, arg00
),
6760 build_int_cst (stype
, 0));
6767 /* If CODE with arguments ARG0 and ARG1 represents a single bit
6768 equality/inequality test, then return a simplified form of
6769 the test using shifts and logical operations. Otherwise return
6770 NULL. TYPE is the desired result type. */
6773 fold_single_bit_test (location_t loc
, enum tree_code code
,
6774 tree arg0
, tree arg1
, tree result_type
)
6776 /* If this is testing a single bit, we can optimize the test. */
6777 if ((code
== NE_EXPR
|| code
== EQ_EXPR
)
6778 && TREE_CODE (arg0
) == BIT_AND_EXPR
&& integer_zerop (arg1
)
6779 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
6781 tree inner
= TREE_OPERAND (arg0
, 0);
6782 tree type
= TREE_TYPE (arg0
);
6783 int bitnum
= tree_log2 (TREE_OPERAND (arg0
, 1));
6784 machine_mode operand_mode
= TYPE_MODE (type
);
6786 tree signed_type
, unsigned_type
, intermediate_type
;
6789 /* First, see if we can fold the single bit test into a sign-bit
6791 tem
= fold_single_bit_test_into_sign_test (loc
, code
, arg0
, arg1
,
6796 /* Otherwise we have (A & C) != 0 where C is a single bit,
6797 convert that into ((A >> C2) & 1). Where C2 = log2(C).
6798 Similarly for (A & C) == 0. */
6800 /* If INNER is a right shift of a constant and it plus BITNUM does
6801 not overflow, adjust BITNUM and INNER. */
6802 if (TREE_CODE (inner
) == RSHIFT_EXPR
6803 && TREE_CODE (TREE_OPERAND (inner
, 1)) == INTEGER_CST
6804 && bitnum
< TYPE_PRECISION (type
)
6805 && wi::ltu_p (TREE_OPERAND (inner
, 1),
6806 TYPE_PRECISION (type
) - bitnum
))
6808 bitnum
+= tree_to_uhwi (TREE_OPERAND (inner
, 1));
6809 inner
= TREE_OPERAND (inner
, 0);
6812 /* If we are going to be able to omit the AND below, we must do our
6813 operations as unsigned. If we must use the AND, we have a choice.
6814 Normally unsigned is faster, but for some machines signed is. */
6815 ops_unsigned
= (LOAD_EXTEND_OP (operand_mode
) == SIGN_EXTEND
6816 && !flag_syntax_only
) ? 0 : 1;
6818 signed_type
= lang_hooks
.types
.type_for_mode (operand_mode
, 0);
6819 unsigned_type
= lang_hooks
.types
.type_for_mode (operand_mode
, 1);
6820 intermediate_type
= ops_unsigned
? unsigned_type
: signed_type
;
6821 inner
= fold_convert_loc (loc
, intermediate_type
, inner
);
6824 inner
= build2 (RSHIFT_EXPR
, intermediate_type
,
6825 inner
, size_int (bitnum
));
6827 one
= build_int_cst (intermediate_type
, 1);
6829 if (code
== EQ_EXPR
)
6830 inner
= fold_build2_loc (loc
, BIT_XOR_EXPR
, intermediate_type
, inner
, one
);
6832 /* Put the AND last so it can combine with more things. */
6833 inner
= build2 (BIT_AND_EXPR
, intermediate_type
, inner
, one
);
6835 /* Make sure to return the proper type. */
6836 inner
= fold_convert_loc (loc
, result_type
, inner
);
6843 /* Check whether we are allowed to reorder operands arg0 and arg1,
6844 such that the evaluation of arg1 occurs before arg0. */
6847 reorder_operands_p (const_tree arg0
, const_tree arg1
)
6849 if (! flag_evaluation_order
)
6851 if (TREE_CONSTANT (arg0
) || TREE_CONSTANT (arg1
))
6853 return ! TREE_SIDE_EFFECTS (arg0
)
6854 && ! TREE_SIDE_EFFECTS (arg1
);
6857 /* Test whether it is preferable two swap two operands, ARG0 and
6858 ARG1, for example because ARG0 is an integer constant and ARG1
6859 isn't. If REORDER is true, only recommend swapping if we can
6860 evaluate the operands in reverse order. */
6863 tree_swap_operands_p (const_tree arg0
, const_tree arg1
, bool reorder
)
6865 if (CONSTANT_CLASS_P (arg1
))
6867 if (CONSTANT_CLASS_P (arg0
))
6873 if (TREE_CONSTANT (arg1
))
6875 if (TREE_CONSTANT (arg0
))
6878 if (reorder
&& flag_evaluation_order
6879 && (TREE_SIDE_EFFECTS (arg0
) || TREE_SIDE_EFFECTS (arg1
)))
6882 /* It is preferable to swap two SSA_NAME to ensure a canonical form
6883 for commutative and comparison operators. Ensuring a canonical
6884 form allows the optimizers to find additional redundancies without
6885 having to explicitly check for both orderings. */
6886 if (TREE_CODE (arg0
) == SSA_NAME
6887 && TREE_CODE (arg1
) == SSA_NAME
6888 && SSA_NAME_VERSION (arg0
) > SSA_NAME_VERSION (arg1
))
6891 /* Put SSA_NAMEs last. */
6892 if (TREE_CODE (arg1
) == SSA_NAME
)
6894 if (TREE_CODE (arg0
) == SSA_NAME
)
6897 /* Put variables last. */
6907 /* Fold A < X && A + 1 > Y to A < X && A >= Y. Normally A + 1 > Y
6908 means A >= Y && A != MAX, but in this case we know that
6909 A < X <= MAX. INEQ is A + 1 > Y, BOUND is A < X. */
6912 fold_to_nonsharp_ineq_using_bound (location_t loc
, tree ineq
, tree bound
)
6914 tree a
, typea
, type
= TREE_TYPE (ineq
), a1
, diff
, y
;
6916 if (TREE_CODE (bound
) == LT_EXPR
)
6917 a
= TREE_OPERAND (bound
, 0);
6918 else if (TREE_CODE (bound
) == GT_EXPR
)
6919 a
= TREE_OPERAND (bound
, 1);
6923 typea
= TREE_TYPE (a
);
6924 if (!INTEGRAL_TYPE_P (typea
)
6925 && !POINTER_TYPE_P (typea
))
6928 if (TREE_CODE (ineq
) == LT_EXPR
)
6930 a1
= TREE_OPERAND (ineq
, 1);
6931 y
= TREE_OPERAND (ineq
, 0);
6933 else if (TREE_CODE (ineq
) == GT_EXPR
)
6935 a1
= TREE_OPERAND (ineq
, 0);
6936 y
= TREE_OPERAND (ineq
, 1);
6941 if (TREE_TYPE (a1
) != typea
)
6944 if (POINTER_TYPE_P (typea
))
6946 /* Convert the pointer types into integer before taking the difference. */
6947 tree ta
= fold_convert_loc (loc
, ssizetype
, a
);
6948 tree ta1
= fold_convert_loc (loc
, ssizetype
, a1
);
6949 diff
= fold_binary_loc (loc
, MINUS_EXPR
, ssizetype
, ta1
, ta
);
6952 diff
= fold_binary_loc (loc
, MINUS_EXPR
, typea
, a1
, a
);
6954 if (!diff
|| !integer_onep (diff
))
6957 return fold_build2_loc (loc
, GE_EXPR
, type
, a
, y
);
6960 /* Fold a sum or difference of at least one multiplication.
6961 Returns the folded tree or NULL if no simplification could be made. */
6964 fold_plusminus_mult_expr (location_t loc
, enum tree_code code
, tree type
,
6965 tree arg0
, tree arg1
)
6967 tree arg00
, arg01
, arg10
, arg11
;
6968 tree alt0
= NULL_TREE
, alt1
= NULL_TREE
, same
;
6970 /* (A * C) +- (B * C) -> (A+-B) * C.
6971 (A * C) +- A -> A * (C+-1).
6972 We are most concerned about the case where C is a constant,
6973 but other combinations show up during loop reduction. Since
6974 it is not difficult, try all four possibilities. */
6976 if (TREE_CODE (arg0
) == MULT_EXPR
)
6978 arg00
= TREE_OPERAND (arg0
, 0);
6979 arg01
= TREE_OPERAND (arg0
, 1);
6981 else if (TREE_CODE (arg0
) == INTEGER_CST
)
6983 arg00
= build_one_cst (type
);
6988 /* We cannot generate constant 1 for fract. */
6989 if (ALL_FRACT_MODE_P (TYPE_MODE (type
)))
6992 arg01
= build_one_cst (type
);
6994 if (TREE_CODE (arg1
) == MULT_EXPR
)
6996 arg10
= TREE_OPERAND (arg1
, 0);
6997 arg11
= TREE_OPERAND (arg1
, 1);
6999 else if (TREE_CODE (arg1
) == INTEGER_CST
)
7001 arg10
= build_one_cst (type
);
7002 /* As we canonicalize A - 2 to A + -2 get rid of that sign for
7003 the purpose of this canonicalization. */
7004 if (wi::neg_p (arg1
, TYPE_SIGN (TREE_TYPE (arg1
)))
7005 && negate_expr_p (arg1
)
7006 && code
== PLUS_EXPR
)
7008 arg11
= negate_expr (arg1
);
7016 /* We cannot generate constant 1 for fract. */
7017 if (ALL_FRACT_MODE_P (TYPE_MODE (type
)))
7020 arg11
= build_one_cst (type
);
7024 if (operand_equal_p (arg01
, arg11
, 0))
7025 same
= arg01
, alt0
= arg00
, alt1
= arg10
;
7026 else if (operand_equal_p (arg00
, arg10
, 0))
7027 same
= arg00
, alt0
= arg01
, alt1
= arg11
;
7028 else if (operand_equal_p (arg00
, arg11
, 0))
7029 same
= arg00
, alt0
= arg01
, alt1
= arg10
;
7030 else if (operand_equal_p (arg01
, arg10
, 0))
7031 same
= arg01
, alt0
= arg00
, alt1
= arg11
;
7033 /* No identical multiplicands; see if we can find a common
7034 power-of-two factor in non-power-of-two multiplies. This
7035 can help in multi-dimensional array access. */
7036 else if (tree_fits_shwi_p (arg01
)
7037 && tree_fits_shwi_p (arg11
))
7039 HOST_WIDE_INT int01
, int11
, tmp
;
7042 int01
= tree_to_shwi (arg01
);
7043 int11
= tree_to_shwi (arg11
);
7045 /* Move min of absolute values to int11. */
7046 if (absu_hwi (int01
) < absu_hwi (int11
))
7048 tmp
= int01
, int01
= int11
, int11
= tmp
;
7049 alt0
= arg00
, arg00
= arg10
, arg10
= alt0
;
7056 if (exact_log2 (absu_hwi (int11
)) > 0 && int01
% int11
== 0
7057 /* The remainder should not be a constant, otherwise we
7058 end up folding i * 4 + 2 to (i * 2 + 1) * 2 which has
7059 increased the number of multiplications necessary. */
7060 && TREE_CODE (arg10
) != INTEGER_CST
)
7062 alt0
= fold_build2_loc (loc
, MULT_EXPR
, TREE_TYPE (arg00
), arg00
,
7063 build_int_cst (TREE_TYPE (arg00
),
7068 maybe_same
= alt0
, alt0
= alt1
, alt1
= maybe_same
;
7073 return fold_build2_loc (loc
, MULT_EXPR
, type
,
7074 fold_build2_loc (loc
, code
, type
,
7075 fold_convert_loc (loc
, type
, alt0
),
7076 fold_convert_loc (loc
, type
, alt1
)),
7077 fold_convert_loc (loc
, type
, same
));
7082 /* Subroutine of native_encode_expr. Encode the INTEGER_CST
7083 specified by EXPR into the buffer PTR of length LEN bytes.
7084 Return the number of bytes placed in the buffer, or zero
7088 native_encode_int (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7090 tree type
= TREE_TYPE (expr
);
7091 int total_bytes
= GET_MODE_SIZE (TYPE_MODE (type
));
7092 int byte
, offset
, word
, words
;
7093 unsigned char value
;
7095 if ((off
== -1 && total_bytes
> len
)
7096 || off
>= total_bytes
)
7100 words
= total_bytes
/ UNITS_PER_WORD
;
7102 for (byte
= 0; byte
< total_bytes
; byte
++)
7104 int bitpos
= byte
* BITS_PER_UNIT
;
7105 /* Extend EXPR according to TYPE_SIGN if the precision isn't a whole
7107 value
= wi::extract_uhwi (wi::to_widest (expr
), bitpos
, BITS_PER_UNIT
);
7109 if (total_bytes
> UNITS_PER_WORD
)
7111 word
= byte
/ UNITS_PER_WORD
;
7112 if (WORDS_BIG_ENDIAN
)
7113 word
= (words
- 1) - word
;
7114 offset
= word
* UNITS_PER_WORD
;
7115 if (BYTES_BIG_ENDIAN
)
7116 offset
+= (UNITS_PER_WORD
- 1) - (byte
% UNITS_PER_WORD
);
7118 offset
+= byte
% UNITS_PER_WORD
;
7121 offset
= BYTES_BIG_ENDIAN
? (total_bytes
- 1) - byte
: byte
;
7123 && offset
- off
< len
)
7124 ptr
[offset
- off
] = value
;
7126 return MIN (len
, total_bytes
- off
);
7130 /* Subroutine of native_encode_expr. Encode the FIXED_CST
7131 specified by EXPR into the buffer PTR of length LEN bytes.
7132 Return the number of bytes placed in the buffer, or zero
7136 native_encode_fixed (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7138 tree type
= TREE_TYPE (expr
);
7139 machine_mode mode
= TYPE_MODE (type
);
7140 int total_bytes
= GET_MODE_SIZE (mode
);
7141 FIXED_VALUE_TYPE value
;
7142 tree i_value
, i_type
;
7144 if (total_bytes
* BITS_PER_UNIT
> HOST_BITS_PER_DOUBLE_INT
)
7147 i_type
= lang_hooks
.types
.type_for_size (GET_MODE_BITSIZE (mode
), 1);
7149 if (NULL_TREE
== i_type
7150 || TYPE_PRECISION (i_type
) != total_bytes
)
7153 value
= TREE_FIXED_CST (expr
);
7154 i_value
= double_int_to_tree (i_type
, value
.data
);
7156 return native_encode_int (i_value
, ptr
, len
, off
);
7160 /* Subroutine of native_encode_expr. Encode the REAL_CST
7161 specified by EXPR into the buffer PTR of length LEN bytes.
7162 Return the number of bytes placed in the buffer, or zero
7166 native_encode_real (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7168 tree type
= TREE_TYPE (expr
);
7169 int total_bytes
= GET_MODE_SIZE (TYPE_MODE (type
));
7170 int byte
, offset
, word
, words
, bitpos
;
7171 unsigned char value
;
7173 /* There are always 32 bits in each long, no matter the size of
7174 the hosts long. We handle floating point representations with
7178 if ((off
== -1 && total_bytes
> len
)
7179 || off
>= total_bytes
)
7183 words
= (32 / BITS_PER_UNIT
) / UNITS_PER_WORD
;
7185 real_to_target (tmp
, TREE_REAL_CST_PTR (expr
), TYPE_MODE (type
));
7187 for (bitpos
= 0; bitpos
< total_bytes
* BITS_PER_UNIT
;
7188 bitpos
+= BITS_PER_UNIT
)
7190 byte
= (bitpos
/ BITS_PER_UNIT
) & 3;
7191 value
= (unsigned char) (tmp
[bitpos
/ 32] >> (bitpos
& 31));
7193 if (UNITS_PER_WORD
< 4)
7195 word
= byte
/ UNITS_PER_WORD
;
7196 if (WORDS_BIG_ENDIAN
)
7197 word
= (words
- 1) - word
;
7198 offset
= word
* UNITS_PER_WORD
;
7199 if (BYTES_BIG_ENDIAN
)
7200 offset
+= (UNITS_PER_WORD
- 1) - (byte
% UNITS_PER_WORD
);
7202 offset
+= byte
% UNITS_PER_WORD
;
7205 offset
= BYTES_BIG_ENDIAN
? 3 - byte
: byte
;
7206 offset
= offset
+ ((bitpos
/ BITS_PER_UNIT
) & ~3);
7208 && offset
- off
< len
)
7209 ptr
[offset
- off
] = value
;
7211 return MIN (len
, total_bytes
- off
);
7214 /* Subroutine of native_encode_expr. Encode the COMPLEX_CST
7215 specified by EXPR into the buffer PTR of length LEN bytes.
7216 Return the number of bytes placed in the buffer, or zero
7220 native_encode_complex (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7225 part
= TREE_REALPART (expr
);
7226 rsize
= native_encode_expr (part
, ptr
, len
, off
);
7230 part
= TREE_IMAGPART (expr
);
7232 off
= MAX (0, off
- GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (part
))));
7233 isize
= native_encode_expr (part
, ptr
+rsize
, len
-rsize
, off
);
7237 return rsize
+ isize
;
7241 /* Subroutine of native_encode_expr. Encode the VECTOR_CST
7242 specified by EXPR into the buffer PTR of length LEN bytes.
7243 Return the number of bytes placed in the buffer, or zero
7247 native_encode_vector (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7254 count
= VECTOR_CST_NELTS (expr
);
7255 itype
= TREE_TYPE (TREE_TYPE (expr
));
7256 size
= GET_MODE_SIZE (TYPE_MODE (itype
));
7257 for (i
= 0; i
< count
; i
++)
7264 elem
= VECTOR_CST_ELT (expr
, i
);
7265 int res
= native_encode_expr (elem
, ptr
+offset
, len
-offset
, off
);
7266 if ((off
== -1 && res
!= size
)
7279 /* Subroutine of native_encode_expr. Encode the STRING_CST
7280 specified by EXPR into the buffer PTR of length LEN bytes.
7281 Return the number of bytes placed in the buffer, or zero
7285 native_encode_string (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7287 tree type
= TREE_TYPE (expr
);
7288 HOST_WIDE_INT total_bytes
;
7290 if (TREE_CODE (type
) != ARRAY_TYPE
7291 || TREE_CODE (TREE_TYPE (type
)) != INTEGER_TYPE
7292 || GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))) != BITS_PER_UNIT
7293 || !tree_fits_shwi_p (TYPE_SIZE_UNIT (type
)))
7295 total_bytes
= tree_to_shwi (TYPE_SIZE_UNIT (type
));
7296 if ((off
== -1 && total_bytes
> len
)
7297 || off
>= total_bytes
)
7301 if (TREE_STRING_LENGTH (expr
) - off
< MIN (total_bytes
, len
))
7304 if (off
< TREE_STRING_LENGTH (expr
))
7306 written
= MIN (len
, TREE_STRING_LENGTH (expr
) - off
);
7307 memcpy (ptr
, TREE_STRING_POINTER (expr
) + off
, written
);
7309 memset (ptr
+ written
, 0,
7310 MIN (total_bytes
- written
, len
- written
));
7313 memcpy (ptr
, TREE_STRING_POINTER (expr
) + off
, MIN (total_bytes
, len
));
7314 return MIN (total_bytes
- off
, len
);
7318 /* Subroutine of fold_view_convert_expr. Encode the INTEGER_CST,
7319 REAL_CST, COMPLEX_CST or VECTOR_CST specified by EXPR into the
7320 buffer PTR of length LEN bytes. If OFF is not -1 then start
7321 the encoding at byte offset OFF and encode at most LEN bytes.
7322 Return the number of bytes placed in the buffer, or zero upon failure. */
7325 native_encode_expr (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7327 /* We don't support starting at negative offset and -1 is special. */
7331 switch (TREE_CODE (expr
))
7334 return native_encode_int (expr
, ptr
, len
, off
);
7337 return native_encode_real (expr
, ptr
, len
, off
);
7340 return native_encode_fixed (expr
, ptr
, len
, off
);
7343 return native_encode_complex (expr
, ptr
, len
, off
);
7346 return native_encode_vector (expr
, ptr
, len
, off
);
7349 return native_encode_string (expr
, ptr
, len
, off
);
7357 /* Subroutine of native_interpret_expr. Interpret the contents of
7358 the buffer PTR of length LEN as an INTEGER_CST of type TYPE.
7359 If the buffer cannot be interpreted, return NULL_TREE. */
7362 native_interpret_int (tree type
, const unsigned char *ptr
, int len
)
7364 int total_bytes
= GET_MODE_SIZE (TYPE_MODE (type
));
7366 if (total_bytes
> len
7367 || total_bytes
* BITS_PER_UNIT
> HOST_BITS_PER_DOUBLE_INT
)
7370 wide_int result
= wi::from_buffer (ptr
, total_bytes
);
7372 return wide_int_to_tree (type
, result
);
7376 /* Subroutine of native_interpret_expr. Interpret the contents of
7377 the buffer PTR of length LEN as a FIXED_CST of type TYPE.
7378 If the buffer cannot be interpreted, return NULL_TREE. */
7381 native_interpret_fixed (tree type
, const unsigned char *ptr
, int len
)
7383 int total_bytes
= GET_MODE_SIZE (TYPE_MODE (type
));
7385 FIXED_VALUE_TYPE fixed_value
;
7387 if (total_bytes
> len
7388 || total_bytes
* BITS_PER_UNIT
> HOST_BITS_PER_DOUBLE_INT
)
7391 result
= double_int::from_buffer (ptr
, total_bytes
);
7392 fixed_value
= fixed_from_double_int (result
, TYPE_MODE (type
));
7394 return build_fixed (type
, fixed_value
);
7398 /* Subroutine of native_interpret_expr. Interpret the contents of
7399 the buffer PTR of length LEN as a REAL_CST of type TYPE.
7400 If the buffer cannot be interpreted, return NULL_TREE. */
7403 native_interpret_real (tree type
, const unsigned char *ptr
, int len
)
7405 machine_mode mode
= TYPE_MODE (type
);
7406 int total_bytes
= GET_MODE_SIZE (mode
);
7407 unsigned char value
;
7408 /* There are always 32 bits in each long, no matter the size of
7409 the hosts long. We handle floating point representations with
7414 total_bytes
= GET_MODE_SIZE (TYPE_MODE (type
));
7415 if (total_bytes
> len
|| total_bytes
> 24)
7417 int words
= (32 / BITS_PER_UNIT
) / UNITS_PER_WORD
;
7419 memset (tmp
, 0, sizeof (tmp
));
7420 for (int bitpos
= 0; bitpos
< total_bytes
* BITS_PER_UNIT
;
7421 bitpos
+= BITS_PER_UNIT
)
7423 /* Both OFFSET and BYTE index within a long;
7424 bitpos indexes the whole float. */
7425 int offset
, byte
= (bitpos
/ BITS_PER_UNIT
) & 3;
7426 if (UNITS_PER_WORD
< 4)
7428 int word
= byte
/ UNITS_PER_WORD
;
7429 if (WORDS_BIG_ENDIAN
)
7430 word
= (words
- 1) - word
;
7431 offset
= word
* UNITS_PER_WORD
;
7432 if (BYTES_BIG_ENDIAN
)
7433 offset
+= (UNITS_PER_WORD
- 1) - (byte
% UNITS_PER_WORD
);
7435 offset
+= byte
% UNITS_PER_WORD
;
7440 if (BYTES_BIG_ENDIAN
)
7442 /* Reverse bytes within each long, or within the entire float
7443 if it's smaller than a long (for HFmode). */
7444 offset
= MIN (3, total_bytes
- 1) - offset
;
7445 gcc_assert (offset
>= 0);
7448 value
= ptr
[offset
+ ((bitpos
/ BITS_PER_UNIT
) & ~3)];
7450 tmp
[bitpos
/ 32] |= (unsigned long)value
<< (bitpos
& 31);
7453 real_from_target (&r
, tmp
, mode
);
7454 return build_real (type
, r
);
7458 /* Subroutine of native_interpret_expr. Interpret the contents of
7459 the buffer PTR of length LEN as a COMPLEX_CST of type TYPE.
7460 If the buffer cannot be interpreted, return NULL_TREE. */
7463 native_interpret_complex (tree type
, const unsigned char *ptr
, int len
)
7465 tree etype
, rpart
, ipart
;
7468 etype
= TREE_TYPE (type
);
7469 size
= GET_MODE_SIZE (TYPE_MODE (etype
));
7472 rpart
= native_interpret_expr (etype
, ptr
, size
);
7475 ipart
= native_interpret_expr (etype
, ptr
+size
, size
);
7478 return build_complex (type
, rpart
, ipart
);
7482 /* Subroutine of native_interpret_expr. Interpret the contents of
7483 the buffer PTR of length LEN as a VECTOR_CST of type TYPE.
7484 If the buffer cannot be interpreted, return NULL_TREE. */
7487 native_interpret_vector (tree type
, const unsigned char *ptr
, int len
)
7493 etype
= TREE_TYPE (type
);
7494 size
= GET_MODE_SIZE (TYPE_MODE (etype
));
7495 count
= TYPE_VECTOR_SUBPARTS (type
);
7496 if (size
* count
> len
)
7499 elements
= XALLOCAVEC (tree
, count
);
7500 for (i
= count
- 1; i
>= 0; i
--)
7502 elem
= native_interpret_expr (etype
, ptr
+(i
*size
), size
);
7507 return build_vector (type
, elements
);
7511 /* Subroutine of fold_view_convert_expr. Interpret the contents of
7512 the buffer PTR of length LEN as a constant of type TYPE. For
7513 INTEGRAL_TYPE_P we return an INTEGER_CST, for SCALAR_FLOAT_TYPE_P
7514 we return a REAL_CST, etc... If the buffer cannot be interpreted,
7515 return NULL_TREE. */
7518 native_interpret_expr (tree type
, const unsigned char *ptr
, int len
)
7520 switch (TREE_CODE (type
))
7526 case REFERENCE_TYPE
:
7527 return native_interpret_int (type
, ptr
, len
);
7530 return native_interpret_real (type
, ptr
, len
);
7532 case FIXED_POINT_TYPE
:
7533 return native_interpret_fixed (type
, ptr
, len
);
7536 return native_interpret_complex (type
, ptr
, len
);
7539 return native_interpret_vector (type
, ptr
, len
);
7546 /* Returns true if we can interpret the contents of a native encoding
7550 can_native_interpret_type_p (tree type
)
7552 switch (TREE_CODE (type
))
7558 case REFERENCE_TYPE
:
7559 case FIXED_POINT_TYPE
:
7569 /* Fold a VIEW_CONVERT_EXPR of a constant expression EXPR to type
7570 TYPE at compile-time. If we're unable to perform the conversion
7571 return NULL_TREE. */
7574 fold_view_convert_expr (tree type
, tree expr
)
7576 /* We support up to 512-bit values (for V8DFmode). */
7577 unsigned char buffer
[64];
7580 /* Check that the host and target are sane. */
7581 if (CHAR_BIT
!= 8 || BITS_PER_UNIT
!= 8)
7584 len
= native_encode_expr (expr
, buffer
, sizeof (buffer
));
7588 return native_interpret_expr (type
, buffer
, len
);
7591 /* Build an expression for the address of T. Folds away INDIRECT_REF
7592 to avoid confusing the gimplify process. */
7595 build_fold_addr_expr_with_type_loc (location_t loc
, tree t
, tree ptrtype
)
7597 /* The size of the object is not relevant when talking about its address. */
7598 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
7599 t
= TREE_OPERAND (t
, 0);
7601 if (TREE_CODE (t
) == INDIRECT_REF
)
7603 t
= TREE_OPERAND (t
, 0);
7605 if (TREE_TYPE (t
) != ptrtype
)
7606 t
= build1_loc (loc
, NOP_EXPR
, ptrtype
, t
);
7608 else if (TREE_CODE (t
) == MEM_REF
7609 && integer_zerop (TREE_OPERAND (t
, 1)))
7610 return TREE_OPERAND (t
, 0);
7611 else if (TREE_CODE (t
) == MEM_REF
7612 && TREE_CODE (TREE_OPERAND (t
, 0)) == INTEGER_CST
)
7613 return fold_binary (POINTER_PLUS_EXPR
, ptrtype
,
7614 TREE_OPERAND (t
, 0),
7615 convert_to_ptrofftype (TREE_OPERAND (t
, 1)));
7616 else if (TREE_CODE (t
) == VIEW_CONVERT_EXPR
)
7618 t
= build_fold_addr_expr_loc (loc
, TREE_OPERAND (t
, 0));
7620 if (TREE_TYPE (t
) != ptrtype
)
7621 t
= fold_convert_loc (loc
, ptrtype
, t
);
7624 t
= build1_loc (loc
, ADDR_EXPR
, ptrtype
, t
);
7629 /* Build an expression for the address of T. */
7632 build_fold_addr_expr_loc (location_t loc
, tree t
)
7634 tree ptrtype
= build_pointer_type (TREE_TYPE (t
));
7636 return build_fold_addr_expr_with_type_loc (loc
, t
, ptrtype
);
7639 /* Fold a unary expression of code CODE and type TYPE with operand
7640 OP0. Return the folded expression if folding is successful.
7641 Otherwise, return NULL_TREE. */
7644 fold_unary_loc (location_t loc
, enum tree_code code
, tree type
, tree op0
)
7648 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
7650 gcc_assert (IS_EXPR_CODE_CLASS (kind
)
7651 && TREE_CODE_LENGTH (code
) == 1);
7656 if (CONVERT_EXPR_CODE_P (code
)
7657 || code
== FLOAT_EXPR
|| code
== ABS_EXPR
|| code
== NEGATE_EXPR
)
7659 /* Don't use STRIP_NOPS, because signedness of argument type
7661 STRIP_SIGN_NOPS (arg0
);
7665 /* Strip any conversions that don't change the mode. This
7666 is safe for every expression, except for a comparison
7667 expression because its signedness is derived from its
7670 Note that this is done as an internal manipulation within
7671 the constant folder, in order to find the simplest
7672 representation of the arguments so that their form can be
7673 studied. In any cases, the appropriate type conversions
7674 should be put back in the tree that will get out of the
7679 if (CONSTANT_CLASS_P (arg0
))
7681 tree tem
= const_unop (code
, type
, arg0
);
7684 if (TREE_TYPE (tem
) != type
)
7685 tem
= fold_convert_loc (loc
, type
, tem
);
7691 tem
= generic_simplify (loc
, code
, type
, op0
);
7695 if (TREE_CODE_CLASS (code
) == tcc_unary
)
7697 if (TREE_CODE (arg0
) == COMPOUND_EXPR
)
7698 return build2 (COMPOUND_EXPR
, type
, TREE_OPERAND (arg0
, 0),
7699 fold_build1_loc (loc
, code
, type
,
7700 fold_convert_loc (loc
, TREE_TYPE (op0
),
7701 TREE_OPERAND (arg0
, 1))));
7702 else if (TREE_CODE (arg0
) == COND_EXPR
)
7704 tree arg01
= TREE_OPERAND (arg0
, 1);
7705 tree arg02
= TREE_OPERAND (arg0
, 2);
7706 if (! VOID_TYPE_P (TREE_TYPE (arg01
)))
7707 arg01
= fold_build1_loc (loc
, code
, type
,
7708 fold_convert_loc (loc
,
7709 TREE_TYPE (op0
), arg01
));
7710 if (! VOID_TYPE_P (TREE_TYPE (arg02
)))
7711 arg02
= fold_build1_loc (loc
, code
, type
,
7712 fold_convert_loc (loc
,
7713 TREE_TYPE (op0
), arg02
));
7714 tem
= fold_build3_loc (loc
, COND_EXPR
, type
, TREE_OPERAND (arg0
, 0),
7717 /* If this was a conversion, and all we did was to move into
7718 inside the COND_EXPR, bring it back out. But leave it if
7719 it is a conversion from integer to integer and the
7720 result precision is no wider than a word since such a
7721 conversion is cheap and may be optimized away by combine,
7722 while it couldn't if it were outside the COND_EXPR. Then return
7723 so we don't get into an infinite recursion loop taking the
7724 conversion out and then back in. */
7726 if ((CONVERT_EXPR_CODE_P (code
)
7727 || code
== NON_LVALUE_EXPR
)
7728 && TREE_CODE (tem
) == COND_EXPR
7729 && TREE_CODE (TREE_OPERAND (tem
, 1)) == code
7730 && TREE_CODE (TREE_OPERAND (tem
, 2)) == code
7731 && ! VOID_TYPE_P (TREE_OPERAND (tem
, 1))
7732 && ! VOID_TYPE_P (TREE_OPERAND (tem
, 2))
7733 && (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem
, 1), 0))
7734 == TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem
, 2), 0)))
7735 && (! (INTEGRAL_TYPE_P (TREE_TYPE (tem
))
7737 (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem
, 1), 0))))
7738 && TYPE_PRECISION (TREE_TYPE (tem
)) <= BITS_PER_WORD
)
7739 || flag_syntax_only
))
7740 tem
= build1_loc (loc
, code
, type
,
7742 TREE_TYPE (TREE_OPERAND
7743 (TREE_OPERAND (tem
, 1), 0)),
7744 TREE_OPERAND (tem
, 0),
7745 TREE_OPERAND (TREE_OPERAND (tem
, 1), 0),
7746 TREE_OPERAND (TREE_OPERAND (tem
, 2),
7754 case NON_LVALUE_EXPR
:
7755 if (!maybe_lvalue_p (op0
))
7756 return fold_convert_loc (loc
, type
, op0
);
7761 case FIX_TRUNC_EXPR
:
7762 if (COMPARISON_CLASS_P (op0
))
7764 /* If we have (type) (a CMP b) and type is an integral type, return
7765 new expression involving the new type. Canonicalize
7766 (type) (a CMP b) to (a CMP b) ? (type) true : (type) false for
7768 Do not fold the result as that would not simplify further, also
7769 folding again results in recursions. */
7770 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
7771 return build2_loc (loc
, TREE_CODE (op0
), type
,
7772 TREE_OPERAND (op0
, 0),
7773 TREE_OPERAND (op0
, 1));
7774 else if (!INTEGRAL_TYPE_P (type
) && !VOID_TYPE_P (type
)
7775 && TREE_CODE (type
) != VECTOR_TYPE
)
7776 return build3_loc (loc
, COND_EXPR
, type
, op0
,
7777 constant_boolean_node (true, type
),
7778 constant_boolean_node (false, type
));
7781 /* Handle (T *)&A.B.C for A being of type T and B and C
7782 living at offset zero. This occurs frequently in
7783 C++ upcasting and then accessing the base. */
7784 if (TREE_CODE (op0
) == ADDR_EXPR
7785 && POINTER_TYPE_P (type
)
7786 && handled_component_p (TREE_OPERAND (op0
, 0)))
7788 HOST_WIDE_INT bitsize
, bitpos
;
7791 int unsignedp
, reversep
, volatilep
;
7793 = get_inner_reference (TREE_OPERAND (op0
, 0), &bitsize
, &bitpos
,
7794 &offset
, &mode
, &unsignedp
, &reversep
,
7796 /* If the reference was to a (constant) zero offset, we can use
7797 the address of the base if it has the same base type
7798 as the result type and the pointer type is unqualified. */
7799 if (! offset
&& bitpos
== 0
7800 && (TYPE_MAIN_VARIANT (TREE_TYPE (type
))
7801 == TYPE_MAIN_VARIANT (TREE_TYPE (base
)))
7802 && TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
7803 return fold_convert_loc (loc
, type
,
7804 build_fold_addr_expr_loc (loc
, base
));
7807 if (TREE_CODE (op0
) == MODIFY_EXPR
7808 && TREE_CONSTANT (TREE_OPERAND (op0
, 1))
7809 /* Detect assigning a bitfield. */
7810 && !(TREE_CODE (TREE_OPERAND (op0
, 0)) == COMPONENT_REF
7812 (TREE_OPERAND (TREE_OPERAND (op0
, 0), 1))))
7814 /* Don't leave an assignment inside a conversion
7815 unless assigning a bitfield. */
7816 tem
= fold_build1_loc (loc
, code
, type
, TREE_OPERAND (op0
, 1));
7817 /* First do the assignment, then return converted constant. */
7818 tem
= build2_loc (loc
, COMPOUND_EXPR
, TREE_TYPE (tem
), op0
, tem
);
7819 TREE_NO_WARNING (tem
) = 1;
7820 TREE_USED (tem
) = 1;
7824 /* Convert (T)(x & c) into (T)x & (T)c, if c is an integer
7825 constants (if x has signed type, the sign bit cannot be set
7826 in c). This folds extension into the BIT_AND_EXPR.
7827 ??? We don't do it for BOOLEAN_TYPE or ENUMERAL_TYPE because they
7828 very likely don't have maximal range for their precision and this
7829 transformation effectively doesn't preserve non-maximal ranges. */
7830 if (TREE_CODE (type
) == INTEGER_TYPE
7831 && TREE_CODE (op0
) == BIT_AND_EXPR
7832 && TREE_CODE (TREE_OPERAND (op0
, 1)) == INTEGER_CST
)
7834 tree and_expr
= op0
;
7835 tree and0
= TREE_OPERAND (and_expr
, 0);
7836 tree and1
= TREE_OPERAND (and_expr
, 1);
7839 if (TYPE_UNSIGNED (TREE_TYPE (and_expr
))
7840 || (TYPE_PRECISION (type
)
7841 <= TYPE_PRECISION (TREE_TYPE (and_expr
))))
7843 else if (TYPE_PRECISION (TREE_TYPE (and1
))
7844 <= HOST_BITS_PER_WIDE_INT
7845 && tree_fits_uhwi_p (and1
))
7847 unsigned HOST_WIDE_INT cst
;
7849 cst
= tree_to_uhwi (and1
);
7850 cst
&= HOST_WIDE_INT_M1U
7851 << (TYPE_PRECISION (TREE_TYPE (and1
)) - 1);
7852 change
= (cst
== 0);
7854 && !flag_syntax_only
7855 && (LOAD_EXTEND_OP (TYPE_MODE (TREE_TYPE (and0
)))
7858 tree uns
= unsigned_type_for (TREE_TYPE (and0
));
7859 and0
= fold_convert_loc (loc
, uns
, and0
);
7860 and1
= fold_convert_loc (loc
, uns
, and1
);
7865 tem
= force_fit_type (type
, wi::to_widest (and1
), 0,
7866 TREE_OVERFLOW (and1
));
7867 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
7868 fold_convert_loc (loc
, type
, and0
), tem
);
7872 /* Convert (T1)(X p+ Y) into ((T1)X p+ Y), for pointer type, when the new
7873 cast (T1)X will fold away. We assume that this happens when X itself
7875 if (POINTER_TYPE_P (type
)
7876 && TREE_CODE (arg0
) == POINTER_PLUS_EXPR
7877 && CONVERT_EXPR_P (TREE_OPERAND (arg0
, 0)))
7879 tree arg00
= TREE_OPERAND (arg0
, 0);
7880 tree arg01
= TREE_OPERAND (arg0
, 1);
7882 return fold_build_pointer_plus_loc
7883 (loc
, fold_convert_loc (loc
, type
, arg00
), arg01
);
7886 /* Convert (T1)(~(T2)X) into ~(T1)X if T1 and T2 are integral types
7887 of the same precision, and X is an integer type not narrower than
7888 types T1 or T2, i.e. the cast (T2)X isn't an extension. */
7889 if (INTEGRAL_TYPE_P (type
)
7890 && TREE_CODE (op0
) == BIT_NOT_EXPR
7891 && INTEGRAL_TYPE_P (TREE_TYPE (op0
))
7892 && CONVERT_EXPR_P (TREE_OPERAND (op0
, 0))
7893 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (op0
)))
7895 tem
= TREE_OPERAND (TREE_OPERAND (op0
, 0), 0);
7896 if (INTEGRAL_TYPE_P (TREE_TYPE (tem
))
7897 && TYPE_PRECISION (type
) <= TYPE_PRECISION (TREE_TYPE (tem
)))
7898 return fold_build1_loc (loc
, BIT_NOT_EXPR
, type
,
7899 fold_convert_loc (loc
, type
, tem
));
7902 /* Convert (T1)(X * Y) into (T1)X * (T1)Y if T1 is narrower than the
7903 type of X and Y (integer types only). */
7904 if (INTEGRAL_TYPE_P (type
)
7905 && TREE_CODE (op0
) == MULT_EXPR
7906 && INTEGRAL_TYPE_P (TREE_TYPE (op0
))
7907 && TYPE_PRECISION (type
) < TYPE_PRECISION (TREE_TYPE (op0
)))
7909 /* Be careful not to introduce new overflows. */
7911 if (TYPE_OVERFLOW_WRAPS (type
))
7914 mult_type
= unsigned_type_for (type
);
7916 if (TYPE_PRECISION (mult_type
) < TYPE_PRECISION (TREE_TYPE (op0
)))
7918 tem
= fold_build2_loc (loc
, MULT_EXPR
, mult_type
,
7919 fold_convert_loc (loc
, mult_type
,
7920 TREE_OPERAND (op0
, 0)),
7921 fold_convert_loc (loc
, mult_type
,
7922 TREE_OPERAND (op0
, 1)));
7923 return fold_convert_loc (loc
, type
, tem
);
7929 case VIEW_CONVERT_EXPR
:
7930 if (TREE_CODE (op0
) == MEM_REF
)
7932 tem
= fold_build2_loc (loc
, MEM_REF
, type
,
7933 TREE_OPERAND (op0
, 0), TREE_OPERAND (op0
, 1));
7934 REF_REVERSE_STORAGE_ORDER (tem
) = REF_REVERSE_STORAGE_ORDER (op0
);
7941 tem
= fold_negate_expr (loc
, arg0
);
7943 return fold_convert_loc (loc
, type
, tem
);
7947 /* Convert fabs((double)float) into (double)fabsf(float). */
7948 if (TREE_CODE (arg0
) == NOP_EXPR
7949 && TREE_CODE (type
) == REAL_TYPE
)
7951 tree targ0
= strip_float_extensions (arg0
);
7953 return fold_convert_loc (loc
, type
,
7954 fold_build1_loc (loc
, ABS_EXPR
,
7961 /* Convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */
7962 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
7963 && (tem
= fold_unary_loc (loc
, BIT_NOT_EXPR
, type
,
7964 fold_convert_loc (loc
, type
,
7965 TREE_OPERAND (arg0
, 0)))))
7966 return fold_build2_loc (loc
, BIT_XOR_EXPR
, type
, tem
,
7967 fold_convert_loc (loc
, type
,
7968 TREE_OPERAND (arg0
, 1)));
7969 else if (TREE_CODE (arg0
) == BIT_XOR_EXPR
7970 && (tem
= fold_unary_loc (loc
, BIT_NOT_EXPR
, type
,
7971 fold_convert_loc (loc
, type
,
7972 TREE_OPERAND (arg0
, 1)))))
7973 return fold_build2_loc (loc
, BIT_XOR_EXPR
, type
,
7974 fold_convert_loc (loc
, type
,
7975 TREE_OPERAND (arg0
, 0)), tem
);
7979 case TRUTH_NOT_EXPR
:
7980 /* Note that the operand of this must be an int
7981 and its values must be 0 or 1.
7982 ("true" is a fixed value perhaps depending on the language,
7983 but we don't handle values other than 1 correctly yet.) */
7984 tem
= fold_truth_not_expr (loc
, arg0
);
7987 return fold_convert_loc (loc
, type
, tem
);
7990 /* Fold *&X to X if X is an lvalue. */
7991 if (TREE_CODE (op0
) == ADDR_EXPR
)
7993 tree op00
= TREE_OPERAND (op0
, 0);
7994 if ((TREE_CODE (op00
) == VAR_DECL
7995 || TREE_CODE (op00
) == PARM_DECL
7996 || TREE_CODE (op00
) == RESULT_DECL
)
7997 && !TREE_READONLY (op00
))
8004 } /* switch (code) */
8008 /* If the operation was a conversion do _not_ mark a resulting constant
8009 with TREE_OVERFLOW if the original constant was not. These conversions
8010 have implementation defined behavior and retaining the TREE_OVERFLOW
8011 flag here would confuse later passes such as VRP. */
8013 fold_unary_ignore_overflow_loc (location_t loc
, enum tree_code code
,
8014 tree type
, tree op0
)
8016 tree res
= fold_unary_loc (loc
, code
, type
, op0
);
8018 && TREE_CODE (res
) == INTEGER_CST
8019 && TREE_CODE (op0
) == INTEGER_CST
8020 && CONVERT_EXPR_CODE_P (code
))
8021 TREE_OVERFLOW (res
) = TREE_OVERFLOW (op0
);
8026 /* Fold a binary bitwise/truth expression of code CODE and type TYPE with
8027 operands OP0 and OP1. LOC is the location of the resulting expression.
8028 ARG0 and ARG1 are the NOP_STRIPed results of OP0 and OP1.
8029 Return the folded expression if folding is successful. Otherwise,
8030 return NULL_TREE. */
8032 fold_truth_andor (location_t loc
, enum tree_code code
, tree type
,
8033 tree arg0
, tree arg1
, tree op0
, tree op1
)
8037 /* We only do these simplifications if we are optimizing. */
8041 /* Check for things like (A || B) && (A || C). We can convert this
8042 to A || (B && C). Note that either operator can be any of the four
8043 truth and/or operations and the transformation will still be
8044 valid. Also note that we only care about order for the
8045 ANDIF and ORIF operators. If B contains side effects, this
8046 might change the truth-value of A. */
8047 if (TREE_CODE (arg0
) == TREE_CODE (arg1
)
8048 && (TREE_CODE (arg0
) == TRUTH_ANDIF_EXPR
8049 || TREE_CODE (arg0
) == TRUTH_ORIF_EXPR
8050 || TREE_CODE (arg0
) == TRUTH_AND_EXPR
8051 || TREE_CODE (arg0
) == TRUTH_OR_EXPR
)
8052 && ! TREE_SIDE_EFFECTS (TREE_OPERAND (arg0
, 1)))
8054 tree a00
= TREE_OPERAND (arg0
, 0);
8055 tree a01
= TREE_OPERAND (arg0
, 1);
8056 tree a10
= TREE_OPERAND (arg1
, 0);
8057 tree a11
= TREE_OPERAND (arg1
, 1);
8058 int commutative
= ((TREE_CODE (arg0
) == TRUTH_OR_EXPR
8059 || TREE_CODE (arg0
) == TRUTH_AND_EXPR
)
8060 && (code
== TRUTH_AND_EXPR
8061 || code
== TRUTH_OR_EXPR
));
8063 if (operand_equal_p (a00
, a10
, 0))
8064 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
, a00
,
8065 fold_build2_loc (loc
, code
, type
, a01
, a11
));
8066 else if (commutative
&& operand_equal_p (a00
, a11
, 0))
8067 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
, a00
,
8068 fold_build2_loc (loc
, code
, type
, a01
, a10
));
8069 else if (commutative
&& operand_equal_p (a01
, a10
, 0))
8070 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
, a01
,
8071 fold_build2_loc (loc
, code
, type
, a00
, a11
));
8073 /* This case if tricky because we must either have commutative
8074 operators or else A10 must not have side-effects. */
8076 else if ((commutative
|| ! TREE_SIDE_EFFECTS (a10
))
8077 && operand_equal_p (a01
, a11
, 0))
8078 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
,
8079 fold_build2_loc (loc
, code
, type
, a00
, a10
),
8083 /* See if we can build a range comparison. */
8084 if (0 != (tem
= fold_range_test (loc
, code
, type
, op0
, op1
)))
8087 if ((code
== TRUTH_ANDIF_EXPR
&& TREE_CODE (arg0
) == TRUTH_ORIF_EXPR
)
8088 || (code
== TRUTH_ORIF_EXPR
&& TREE_CODE (arg0
) == TRUTH_ANDIF_EXPR
))
8090 tem
= merge_truthop_with_opposite_arm (loc
, arg0
, arg1
, true);
8092 return fold_build2_loc (loc
, code
, type
, tem
, arg1
);
8095 if ((code
== TRUTH_ANDIF_EXPR
&& TREE_CODE (arg1
) == TRUTH_ORIF_EXPR
)
8096 || (code
== TRUTH_ORIF_EXPR
&& TREE_CODE (arg1
) == TRUTH_ANDIF_EXPR
))
8098 tem
= merge_truthop_with_opposite_arm (loc
, arg1
, arg0
, false);
8100 return fold_build2_loc (loc
, code
, type
, arg0
, tem
);
8103 /* Check for the possibility of merging component references. If our
8104 lhs is another similar operation, try to merge its rhs with our
8105 rhs. Then try to merge our lhs and rhs. */
8106 if (TREE_CODE (arg0
) == code
8107 && 0 != (tem
= fold_truth_andor_1 (loc
, code
, type
,
8108 TREE_OPERAND (arg0
, 1), arg1
)))
8109 return fold_build2_loc (loc
, code
, type
, TREE_OPERAND (arg0
, 0), tem
);
8111 if ((tem
= fold_truth_andor_1 (loc
, code
, type
, arg0
, arg1
)) != 0)
8114 if (LOGICAL_OP_NON_SHORT_CIRCUIT
8115 && (code
== TRUTH_AND_EXPR
8116 || code
== TRUTH_ANDIF_EXPR
8117 || code
== TRUTH_OR_EXPR
8118 || code
== TRUTH_ORIF_EXPR
))
8120 enum tree_code ncode
, icode
;
8122 ncode
= (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_AND_EXPR
)
8123 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
;
8124 icode
= ncode
== TRUTH_AND_EXPR
? TRUTH_ANDIF_EXPR
: TRUTH_ORIF_EXPR
;
8126 /* Transform ((A AND-IF B) AND[-IF] C) into (A AND-IF (B AND C)),
8127 or ((A OR-IF B) OR[-IF] C) into (A OR-IF (B OR C))
8128 We don't want to pack more than two leafs to a non-IF AND/OR
8130 If tree-code of left-hand operand isn't an AND/OR-IF code and not
8131 equal to IF-CODE, then we don't want to add right-hand operand.
8132 If the inner right-hand side of left-hand operand has
8133 side-effects, or isn't simple, then we can't add to it,
8134 as otherwise we might destroy if-sequence. */
8135 if (TREE_CODE (arg0
) == icode
8136 && simple_operand_p_2 (arg1
)
8137 /* Needed for sequence points to handle trappings, and
8139 && simple_operand_p_2 (TREE_OPERAND (arg0
, 1)))
8141 tem
= fold_build2_loc (loc
, ncode
, type
, TREE_OPERAND (arg0
, 1),
8143 return fold_build2_loc (loc
, icode
, type
, TREE_OPERAND (arg0
, 0),
8146 /* Same as abouve but for (A AND[-IF] (B AND-IF C)) -> ((A AND B) AND-IF C),
8147 or (A OR[-IF] (B OR-IF C) -> ((A OR B) OR-IF C). */
8148 else if (TREE_CODE (arg1
) == icode
8149 && simple_operand_p_2 (arg0
)
8150 /* Needed for sequence points to handle trappings, and
8152 && simple_operand_p_2 (TREE_OPERAND (arg1
, 0)))
8154 tem
= fold_build2_loc (loc
, ncode
, type
,
8155 arg0
, TREE_OPERAND (arg1
, 0));
8156 return fold_build2_loc (loc
, icode
, type
, tem
,
8157 TREE_OPERAND (arg1
, 1));
8159 /* Transform (A AND-IF B) into (A AND B), or (A OR-IF B)
8161 For sequence point consistancy, we need to check for trapping,
8162 and side-effects. */
8163 else if (code
== icode
&& simple_operand_p_2 (arg0
)
8164 && simple_operand_p_2 (arg1
))
8165 return fold_build2_loc (loc
, ncode
, type
, arg0
, arg1
);
8171 /* Helper that tries to canonicalize the comparison ARG0 CODE ARG1
8172 by changing CODE to reduce the magnitude of constants involved in
8173 ARG0 of the comparison.
8174 Returns a canonicalized comparison tree if a simplification was
8175 possible, otherwise returns NULL_TREE.
8176 Set *STRICT_OVERFLOW_P to true if the canonicalization is only
8177 valid if signed overflow is undefined. */
8180 maybe_canonicalize_comparison_1 (location_t loc
, enum tree_code code
, tree type
,
8181 tree arg0
, tree arg1
,
8182 bool *strict_overflow_p
)
8184 enum tree_code code0
= TREE_CODE (arg0
);
8185 tree t
, cst0
= NULL_TREE
;
8188 /* Match A +- CST code arg1. We can change this only if overflow
8190 if (!((ANY_INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
8191 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
)))
8192 /* In principle pointers also have undefined overflow behavior,
8193 but that causes problems elsewhere. */
8194 && !POINTER_TYPE_P (TREE_TYPE (arg0
))
8195 && (code0
== MINUS_EXPR
8196 || code0
== PLUS_EXPR
)
8197 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
))
8200 /* Identify the constant in arg0 and its sign. */
8201 cst0
= TREE_OPERAND (arg0
, 1);
8202 sgn0
= tree_int_cst_sgn (cst0
);
8204 /* Overflowed constants and zero will cause problems. */
8205 if (integer_zerop (cst0
)
8206 || TREE_OVERFLOW (cst0
))
8209 /* See if we can reduce the magnitude of the constant in
8210 arg0 by changing the comparison code. */
8211 /* A - CST < arg1 -> A - CST-1 <= arg1. */
8213 && code0
== ((sgn0
== -1) ? PLUS_EXPR
: MINUS_EXPR
))
8215 /* A + CST > arg1 -> A + CST-1 >= arg1. */
8216 else if (code
== GT_EXPR
8217 && code0
== ((sgn0
== -1) ? MINUS_EXPR
: PLUS_EXPR
))
8219 /* A + CST <= arg1 -> A + CST-1 < arg1. */
8220 else if (code
== LE_EXPR
8221 && code0
== ((sgn0
== -1) ? MINUS_EXPR
: PLUS_EXPR
))
8223 /* A - CST >= arg1 -> A - CST-1 > arg1. */
8224 else if (code
== GE_EXPR
8225 && code0
== ((sgn0
== -1) ? PLUS_EXPR
: MINUS_EXPR
))
8229 *strict_overflow_p
= true;
8231 /* Now build the constant reduced in magnitude. But not if that
8232 would produce one outside of its types range. */
8233 if (INTEGRAL_TYPE_P (TREE_TYPE (cst0
))
8235 && TYPE_MIN_VALUE (TREE_TYPE (cst0
))
8236 && tree_int_cst_equal (cst0
, TYPE_MIN_VALUE (TREE_TYPE (cst0
))))
8238 && TYPE_MAX_VALUE (TREE_TYPE (cst0
))
8239 && tree_int_cst_equal (cst0
, TYPE_MAX_VALUE (TREE_TYPE (cst0
))))))
8242 t
= int_const_binop (sgn0
== -1 ? PLUS_EXPR
: MINUS_EXPR
,
8243 cst0
, build_int_cst (TREE_TYPE (cst0
), 1));
8244 t
= fold_build2_loc (loc
, code0
, TREE_TYPE (arg0
), TREE_OPERAND (arg0
, 0), t
);
8245 t
= fold_convert (TREE_TYPE (arg1
), t
);
8247 return fold_build2_loc (loc
, code
, type
, t
, arg1
);
8250 /* Canonicalize the comparison ARG0 CODE ARG1 with type TYPE with undefined
8251 overflow further. Try to decrease the magnitude of constants involved
8252 by changing LE_EXPR and GE_EXPR to LT_EXPR and GT_EXPR or vice versa
8253 and put sole constants at the second argument position.
8254 Returns the canonicalized tree if changed, otherwise NULL_TREE. */
8257 maybe_canonicalize_comparison (location_t loc
, enum tree_code code
, tree type
,
8258 tree arg0
, tree arg1
)
8261 bool strict_overflow_p
;
8262 const char * const warnmsg
= G_("assuming signed overflow does not occur "
8263 "when reducing constant in comparison");
8265 /* Try canonicalization by simplifying arg0. */
8266 strict_overflow_p
= false;
8267 t
= maybe_canonicalize_comparison_1 (loc
, code
, type
, arg0
, arg1
,
8268 &strict_overflow_p
);
8271 if (strict_overflow_p
)
8272 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_MAGNITUDE
);
8276 /* Try canonicalization by simplifying arg1 using the swapped
8278 code
= swap_tree_comparison (code
);
8279 strict_overflow_p
= false;
8280 t
= maybe_canonicalize_comparison_1 (loc
, code
, type
, arg1
, arg0
,
8281 &strict_overflow_p
);
8282 if (t
&& strict_overflow_p
)
8283 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_MAGNITUDE
);
8287 /* Return whether BASE + OFFSET + BITPOS may wrap around the address
8288 space. This is used to avoid issuing overflow warnings for
8289 expressions like &p->x which can not wrap. */
8292 pointer_may_wrap_p (tree base
, tree offset
, HOST_WIDE_INT bitpos
)
8294 if (!POINTER_TYPE_P (TREE_TYPE (base
)))
8301 int precision
= TYPE_PRECISION (TREE_TYPE (base
));
8302 if (offset
== NULL_TREE
)
8303 wi_offset
= wi::zero (precision
);
8304 else if (TREE_CODE (offset
) != INTEGER_CST
|| TREE_OVERFLOW (offset
))
8310 wide_int units
= wi::shwi (bitpos
/ BITS_PER_UNIT
, precision
);
8311 wide_int total
= wi::add (wi_offset
, units
, UNSIGNED
, &overflow
);
8315 if (!wi::fits_uhwi_p (total
))
8318 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (TREE_TYPE (base
)));
8322 /* We can do slightly better for SIZE if we have an ADDR_EXPR of an
8324 if (TREE_CODE (base
) == ADDR_EXPR
)
8326 HOST_WIDE_INT base_size
;
8328 base_size
= int_size_in_bytes (TREE_TYPE (TREE_OPERAND (base
, 0)));
8329 if (base_size
> 0 && size
< base_size
)
8333 return total
.to_uhwi () > (unsigned HOST_WIDE_INT
) size
;
8336 /* Subroutine of fold_binary. This routine performs all of the
8337 transformations that are common to the equality/inequality
8338 operators (EQ_EXPR and NE_EXPR) and the ordering operators
8339 (LT_EXPR, LE_EXPR, GE_EXPR and GT_EXPR). Callers other than
8340 fold_binary should call fold_binary. Fold a comparison with
8341 tree code CODE and type TYPE with operands OP0 and OP1. Return
8342 the folded comparison or NULL_TREE. */
8345 fold_comparison (location_t loc
, enum tree_code code
, tree type
,
8348 const bool equality_code
= (code
== EQ_EXPR
|| code
== NE_EXPR
);
8349 tree arg0
, arg1
, tem
;
8354 STRIP_SIGN_NOPS (arg0
);
8355 STRIP_SIGN_NOPS (arg1
);
8357 /* Transform comparisons of the form X +- C1 CMP C2 to X CMP C2 -+ C1. */
8358 if ((TREE_CODE (arg0
) == PLUS_EXPR
|| TREE_CODE (arg0
) == MINUS_EXPR
)
8360 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
8361 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
))))
8362 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
8363 && !TREE_OVERFLOW (TREE_OPERAND (arg0
, 1))
8364 && TREE_CODE (arg1
) == INTEGER_CST
8365 && !TREE_OVERFLOW (arg1
))
8367 const enum tree_code
8368 reverse_op
= TREE_CODE (arg0
) == PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
;
8369 tree const1
= TREE_OPERAND (arg0
, 1);
8370 tree const2
= fold_convert_loc (loc
, TREE_TYPE (const1
), arg1
);
8371 tree variable
= TREE_OPERAND (arg0
, 0);
8372 tree new_const
= int_const_binop (reverse_op
, const2
, const1
);
8374 /* If the constant operation overflowed this can be
8375 simplified as a comparison against INT_MAX/INT_MIN. */
8376 if (TREE_OVERFLOW (new_const
)
8377 && !TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg0
)))
8379 int const1_sgn
= tree_int_cst_sgn (const1
);
8380 enum tree_code code2
= code
;
8382 /* Get the sign of the constant on the lhs if the
8383 operation were VARIABLE + CONST1. */
8384 if (TREE_CODE (arg0
) == MINUS_EXPR
)
8385 const1_sgn
= -const1_sgn
;
8387 /* The sign of the constant determines if we overflowed
8388 INT_MAX (const1_sgn == -1) or INT_MIN (const1_sgn == 1).
8389 Canonicalize to the INT_MIN overflow by swapping the comparison
8391 if (const1_sgn
== -1)
8392 code2
= swap_tree_comparison (code
);
8394 /* We now can look at the canonicalized case
8395 VARIABLE + 1 CODE2 INT_MIN
8396 and decide on the result. */
8403 omit_one_operand_loc (loc
, type
, boolean_false_node
, variable
);
8409 omit_one_operand_loc (loc
, type
, boolean_true_node
, variable
);
8418 fold_overflow_warning ("assuming signed overflow does not occur "
8419 "when changing X +- C1 cmp C2 to "
8421 WARN_STRICT_OVERFLOW_COMPARISON
);
8422 return fold_build2_loc (loc
, code
, type
, variable
, new_const
);
8426 /* For comparisons of pointers we can decompose it to a compile time
8427 comparison of the base objects and the offsets into the object.
8428 This requires at least one operand being an ADDR_EXPR or a
8429 POINTER_PLUS_EXPR to do more than the operand_equal_p test below. */
8430 if (POINTER_TYPE_P (TREE_TYPE (arg0
))
8431 && (TREE_CODE (arg0
) == ADDR_EXPR
8432 || TREE_CODE (arg1
) == ADDR_EXPR
8433 || TREE_CODE (arg0
) == POINTER_PLUS_EXPR
8434 || TREE_CODE (arg1
) == POINTER_PLUS_EXPR
))
8436 tree base0
, base1
, offset0
= NULL_TREE
, offset1
= NULL_TREE
;
8437 HOST_WIDE_INT bitsize
, bitpos0
= 0, bitpos1
= 0;
8439 int volatilep
, reversep
, unsignedp
;
8440 bool indirect_base0
= false, indirect_base1
= false;
8442 /* Get base and offset for the access. Strip ADDR_EXPR for
8443 get_inner_reference, but put it back by stripping INDIRECT_REF
8444 off the base object if possible. indirect_baseN will be true
8445 if baseN is not an address but refers to the object itself. */
8447 if (TREE_CODE (arg0
) == ADDR_EXPR
)
8450 = get_inner_reference (TREE_OPERAND (arg0
, 0),
8451 &bitsize
, &bitpos0
, &offset0
, &mode
,
8452 &unsignedp
, &reversep
, &volatilep
, false);
8453 if (TREE_CODE (base0
) == INDIRECT_REF
)
8454 base0
= TREE_OPERAND (base0
, 0);
8456 indirect_base0
= true;
8458 else if (TREE_CODE (arg0
) == POINTER_PLUS_EXPR
)
8460 base0
= TREE_OPERAND (arg0
, 0);
8461 STRIP_SIGN_NOPS (base0
);
8462 if (TREE_CODE (base0
) == ADDR_EXPR
)
8465 = get_inner_reference (TREE_OPERAND (base0
, 0),
8466 &bitsize
, &bitpos0
, &offset0
, &mode
,
8467 &unsignedp
, &reversep
, &volatilep
,
8469 if (TREE_CODE (base0
) == INDIRECT_REF
)
8470 base0
= TREE_OPERAND (base0
, 0);
8472 indirect_base0
= true;
8474 if (offset0
== NULL_TREE
|| integer_zerop (offset0
))
8475 offset0
= TREE_OPERAND (arg0
, 1);
8477 offset0
= size_binop (PLUS_EXPR
, offset0
,
8478 TREE_OPERAND (arg0
, 1));
8479 if (TREE_CODE (offset0
) == INTEGER_CST
)
8481 offset_int tem
= wi::sext (wi::to_offset (offset0
),
8482 TYPE_PRECISION (sizetype
));
8483 tem
= wi::lshift (tem
, LOG2_BITS_PER_UNIT
);
8485 if (wi::fits_shwi_p (tem
))
8487 bitpos0
= tem
.to_shwi ();
8488 offset0
= NULL_TREE
;
8494 if (TREE_CODE (arg1
) == ADDR_EXPR
)
8497 = get_inner_reference (TREE_OPERAND (arg1
, 0),
8498 &bitsize
, &bitpos1
, &offset1
, &mode
,
8499 &unsignedp
, &reversep
, &volatilep
, false);
8500 if (TREE_CODE (base1
) == INDIRECT_REF
)
8501 base1
= TREE_OPERAND (base1
, 0);
8503 indirect_base1
= true;
8505 else if (TREE_CODE (arg1
) == POINTER_PLUS_EXPR
)
8507 base1
= TREE_OPERAND (arg1
, 0);
8508 STRIP_SIGN_NOPS (base1
);
8509 if (TREE_CODE (base1
) == ADDR_EXPR
)
8512 = get_inner_reference (TREE_OPERAND (base1
, 0),
8513 &bitsize
, &bitpos1
, &offset1
, &mode
,
8514 &unsignedp
, &reversep
, &volatilep
,
8516 if (TREE_CODE (base1
) == INDIRECT_REF
)
8517 base1
= TREE_OPERAND (base1
, 0);
8519 indirect_base1
= true;
8521 if (offset1
== NULL_TREE
|| integer_zerop (offset1
))
8522 offset1
= TREE_OPERAND (arg1
, 1);
8524 offset1
= size_binop (PLUS_EXPR
, offset1
,
8525 TREE_OPERAND (arg1
, 1));
8526 if (TREE_CODE (offset1
) == INTEGER_CST
)
8528 offset_int tem
= wi::sext (wi::to_offset (offset1
),
8529 TYPE_PRECISION (sizetype
));
8530 tem
= wi::lshift (tem
, LOG2_BITS_PER_UNIT
);
8532 if (wi::fits_shwi_p (tem
))
8534 bitpos1
= tem
.to_shwi ();
8535 offset1
= NULL_TREE
;
8540 /* If we have equivalent bases we might be able to simplify. */
8541 if (indirect_base0
== indirect_base1
8542 && operand_equal_p (base0
, base1
,
8543 indirect_base0
? OEP_ADDRESS_OF
: 0))
8545 /* We can fold this expression to a constant if the non-constant
8546 offset parts are equal. */
8547 if ((offset0
== offset1
8548 || (offset0
&& offset1
8549 && operand_equal_p (offset0
, offset1
, 0)))
8552 || (indirect_base0
&& DECL_P (base0
))
8553 || POINTER_TYPE_OVERFLOW_UNDEFINED
))
8557 && bitpos0
!= bitpos1
8558 && (pointer_may_wrap_p (base0
, offset0
, bitpos0
)
8559 || pointer_may_wrap_p (base1
, offset1
, bitpos1
)))
8560 fold_overflow_warning (("assuming pointer wraparound does not "
8561 "occur when comparing P +- C1 with "
8563 WARN_STRICT_OVERFLOW_CONDITIONAL
);
8568 return constant_boolean_node (bitpos0
== bitpos1
, type
);
8570 return constant_boolean_node (bitpos0
!= bitpos1
, type
);
8572 return constant_boolean_node (bitpos0
< bitpos1
, type
);
8574 return constant_boolean_node (bitpos0
<= bitpos1
, type
);
8576 return constant_boolean_node (bitpos0
>= bitpos1
, type
);
8578 return constant_boolean_node (bitpos0
> bitpos1
, type
);
8582 /* We can simplify the comparison to a comparison of the variable
8583 offset parts if the constant offset parts are equal.
8584 Be careful to use signed sizetype here because otherwise we
8585 mess with array offsets in the wrong way. This is possible
8586 because pointer arithmetic is restricted to retain within an
8587 object and overflow on pointer differences is undefined as of
8588 6.5.6/8 and /9 with respect to the signed ptrdiff_t. */
8589 else if (bitpos0
== bitpos1
8591 || (indirect_base0
&& DECL_P (base0
))
8592 || POINTER_TYPE_OVERFLOW_UNDEFINED
))
8594 /* By converting to signed sizetype we cover middle-end pointer
8595 arithmetic which operates on unsigned pointer types of size
8596 type size and ARRAY_REF offsets which are properly sign or
8597 zero extended from their type in case it is narrower than
8599 if (offset0
== NULL_TREE
)
8600 offset0
= build_int_cst (ssizetype
, 0);
8602 offset0
= fold_convert_loc (loc
, ssizetype
, offset0
);
8603 if (offset1
== NULL_TREE
)
8604 offset1
= build_int_cst (ssizetype
, 0);
8606 offset1
= fold_convert_loc (loc
, ssizetype
, offset1
);
8609 && (pointer_may_wrap_p (base0
, offset0
, bitpos0
)
8610 || pointer_may_wrap_p (base1
, offset1
, bitpos1
)))
8611 fold_overflow_warning (("assuming pointer wraparound does not "
8612 "occur when comparing P +- C1 with "
8614 WARN_STRICT_OVERFLOW_COMPARISON
);
8616 return fold_build2_loc (loc
, code
, type
, offset0
, offset1
);
8619 /* For equal offsets we can simplify to a comparison of the
8621 else if (bitpos0
== bitpos1
8623 ? base0
!= TREE_OPERAND (arg0
, 0) : base0
!= arg0
)
8625 ? base1
!= TREE_OPERAND (arg1
, 0) : base1
!= arg1
)
8626 && ((offset0
== offset1
)
8627 || (offset0
&& offset1
8628 && operand_equal_p (offset0
, offset1
, 0))))
8631 base0
= build_fold_addr_expr_loc (loc
, base0
);
8633 base1
= build_fold_addr_expr_loc (loc
, base1
);
8634 return fold_build2_loc (loc
, code
, type
, base0
, base1
);
8638 /* Transform comparisons of the form X +- C1 CMP Y +- C2 to
8639 X CMP Y +- C2 +- C1 for signed X, Y. This is valid if
8640 the resulting offset is smaller in absolute value than the
8641 original one and has the same sign. */
8642 if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
8643 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
))
8644 && (TREE_CODE (arg0
) == PLUS_EXPR
|| TREE_CODE (arg0
) == MINUS_EXPR
)
8645 && (TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
8646 && !TREE_OVERFLOW (TREE_OPERAND (arg0
, 1)))
8647 && (TREE_CODE (arg1
) == PLUS_EXPR
|| TREE_CODE (arg1
) == MINUS_EXPR
)
8648 && (TREE_CODE (TREE_OPERAND (arg1
, 1)) == INTEGER_CST
8649 && !TREE_OVERFLOW (TREE_OPERAND (arg1
, 1))))
8651 tree const1
= TREE_OPERAND (arg0
, 1);
8652 tree const2
= TREE_OPERAND (arg1
, 1);
8653 tree variable1
= TREE_OPERAND (arg0
, 0);
8654 tree variable2
= TREE_OPERAND (arg1
, 0);
8656 const char * const warnmsg
= G_("assuming signed overflow does not "
8657 "occur when combining constants around "
8660 /* Put the constant on the side where it doesn't overflow and is
8661 of lower absolute value and of same sign than before. */
8662 cst
= int_const_binop (TREE_CODE (arg0
) == TREE_CODE (arg1
)
8663 ? MINUS_EXPR
: PLUS_EXPR
,
8665 if (!TREE_OVERFLOW (cst
)
8666 && tree_int_cst_compare (const2
, cst
) == tree_int_cst_sgn (const2
)
8667 && tree_int_cst_sgn (cst
) == tree_int_cst_sgn (const2
))
8669 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_COMPARISON
);
8670 return fold_build2_loc (loc
, code
, type
,
8672 fold_build2_loc (loc
, TREE_CODE (arg1
),
8677 cst
= int_const_binop (TREE_CODE (arg0
) == TREE_CODE (arg1
)
8678 ? MINUS_EXPR
: PLUS_EXPR
,
8680 if (!TREE_OVERFLOW (cst
)
8681 && tree_int_cst_compare (const1
, cst
) == tree_int_cst_sgn (const1
)
8682 && tree_int_cst_sgn (cst
) == tree_int_cst_sgn (const1
))
8684 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_COMPARISON
);
8685 return fold_build2_loc (loc
, code
, type
,
8686 fold_build2_loc (loc
, TREE_CODE (arg0
),
8693 tem
= maybe_canonicalize_comparison (loc
, code
, type
, arg0
, arg1
);
8697 /* If this is comparing a constant with a MIN_EXPR or a MAX_EXPR of a
8698 constant, we can simplify it. */
8699 if (TREE_CODE (arg1
) == INTEGER_CST
8700 && (TREE_CODE (arg0
) == MIN_EXPR
8701 || TREE_CODE (arg0
) == MAX_EXPR
)
8702 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
8704 tem
= optimize_minmax_comparison (loc
, code
, type
, op0
, op1
);
8709 /* If we are comparing an expression that just has comparisons
8710 of two integer values, arithmetic expressions of those comparisons,
8711 and constants, we can simplify it. There are only three cases
8712 to check: the two values can either be equal, the first can be
8713 greater, or the second can be greater. Fold the expression for
8714 those three values. Since each value must be 0 or 1, we have
8715 eight possibilities, each of which corresponds to the constant 0
8716 or 1 or one of the six possible comparisons.
8718 This handles common cases like (a > b) == 0 but also handles
8719 expressions like ((x > y) - (y > x)) > 0, which supposedly
8720 occur in macroized code. */
8722 if (TREE_CODE (arg1
) == INTEGER_CST
&& TREE_CODE (arg0
) != INTEGER_CST
)
8724 tree cval1
= 0, cval2
= 0;
8727 if (twoval_comparison_p (arg0
, &cval1
, &cval2
, &save_p
)
8728 /* Don't handle degenerate cases here; they should already
8729 have been handled anyway. */
8730 && cval1
!= 0 && cval2
!= 0
8731 && ! (TREE_CONSTANT (cval1
) && TREE_CONSTANT (cval2
))
8732 && TREE_TYPE (cval1
) == TREE_TYPE (cval2
)
8733 && INTEGRAL_TYPE_P (TREE_TYPE (cval1
))
8734 && TYPE_MAX_VALUE (TREE_TYPE (cval1
))
8735 && TYPE_MAX_VALUE (TREE_TYPE (cval2
))
8736 && ! operand_equal_p (TYPE_MIN_VALUE (TREE_TYPE (cval1
)),
8737 TYPE_MAX_VALUE (TREE_TYPE (cval2
)), 0))
8739 tree maxval
= TYPE_MAX_VALUE (TREE_TYPE (cval1
));
8740 tree minval
= TYPE_MIN_VALUE (TREE_TYPE (cval1
));
8742 /* We can't just pass T to eval_subst in case cval1 or cval2
8743 was the same as ARG1. */
8746 = fold_build2_loc (loc
, code
, type
,
8747 eval_subst (loc
, arg0
, cval1
, maxval
,
8751 = fold_build2_loc (loc
, code
, type
,
8752 eval_subst (loc
, arg0
, cval1
, maxval
,
8756 = fold_build2_loc (loc
, code
, type
,
8757 eval_subst (loc
, arg0
, cval1
, minval
,
8761 /* All three of these results should be 0 or 1. Confirm they are.
8762 Then use those values to select the proper code to use. */
8764 if (TREE_CODE (high_result
) == INTEGER_CST
8765 && TREE_CODE (equal_result
) == INTEGER_CST
8766 && TREE_CODE (low_result
) == INTEGER_CST
)
8768 /* Make a 3-bit mask with the high-order bit being the
8769 value for `>', the next for '=', and the low for '<'. */
8770 switch ((integer_onep (high_result
) * 4)
8771 + (integer_onep (equal_result
) * 2)
8772 + integer_onep (low_result
))
8776 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
8797 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
8802 tem
= save_expr (build2 (code
, type
, cval1
, cval2
));
8803 SET_EXPR_LOCATION (tem
, loc
);
8806 return fold_build2_loc (loc
, code
, type
, cval1
, cval2
);
8811 /* We can fold X/C1 op C2 where C1 and C2 are integer constants
8812 into a single range test. */
8813 if ((TREE_CODE (arg0
) == TRUNC_DIV_EXPR
8814 || TREE_CODE (arg0
) == EXACT_DIV_EXPR
)
8815 && TREE_CODE (arg1
) == INTEGER_CST
8816 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
8817 && !integer_zerop (TREE_OPERAND (arg0
, 1))
8818 && !TREE_OVERFLOW (TREE_OPERAND (arg0
, 1))
8819 && !TREE_OVERFLOW (arg1
))
8821 tem
= fold_div_compare (loc
, code
, type
, arg0
, arg1
);
8822 if (tem
!= NULL_TREE
)
8830 /* Subroutine of fold_binary. Optimize complex multiplications of the
8831 form z * conj(z), as pow(realpart(z),2) + pow(imagpart(z),2). The
8832 argument EXPR represents the expression "z" of type TYPE. */
8835 fold_mult_zconjz (location_t loc
, tree type
, tree expr
)
8837 tree itype
= TREE_TYPE (type
);
8838 tree rpart
, ipart
, tem
;
8840 if (TREE_CODE (expr
) == COMPLEX_EXPR
)
8842 rpart
= TREE_OPERAND (expr
, 0);
8843 ipart
= TREE_OPERAND (expr
, 1);
8845 else if (TREE_CODE (expr
) == COMPLEX_CST
)
8847 rpart
= TREE_REALPART (expr
);
8848 ipart
= TREE_IMAGPART (expr
);
8852 expr
= save_expr (expr
);
8853 rpart
= fold_build1_loc (loc
, REALPART_EXPR
, itype
, expr
);
8854 ipart
= fold_build1_loc (loc
, IMAGPART_EXPR
, itype
, expr
);
8857 rpart
= save_expr (rpart
);
8858 ipart
= save_expr (ipart
);
8859 tem
= fold_build2_loc (loc
, PLUS_EXPR
, itype
,
8860 fold_build2_loc (loc
, MULT_EXPR
, itype
, rpart
, rpart
),
8861 fold_build2_loc (loc
, MULT_EXPR
, itype
, ipart
, ipart
));
8862 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, tem
,
8863 build_zero_cst (itype
));
8867 /* Helper function for fold_vec_perm. Store elements of VECTOR_CST or
8868 CONSTRUCTOR ARG into array ELTS and return true if successful. */
8871 vec_cst_ctor_to_array (tree arg
, tree
*elts
)
8873 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg
)), i
;
8875 if (TREE_CODE (arg
) == VECTOR_CST
)
8877 for (i
= 0; i
< VECTOR_CST_NELTS (arg
); ++i
)
8878 elts
[i
] = VECTOR_CST_ELT (arg
, i
);
8880 else if (TREE_CODE (arg
) == CONSTRUCTOR
)
8882 constructor_elt
*elt
;
8884 FOR_EACH_VEC_SAFE_ELT (CONSTRUCTOR_ELTS (arg
), i
, elt
)
8885 if (i
>= nelts
|| TREE_CODE (TREE_TYPE (elt
->value
)) == VECTOR_TYPE
)
8888 elts
[i
] = elt
->value
;
8892 for (; i
< nelts
; i
++)
8894 = fold_convert (TREE_TYPE (TREE_TYPE (arg
)), integer_zero_node
);
8898 /* Attempt to fold vector permutation of ARG0 and ARG1 vectors using SEL
8899 selector. Return the folded VECTOR_CST or CONSTRUCTOR if successful,
8900 NULL_TREE otherwise. */
8903 fold_vec_perm (tree type
, tree arg0
, tree arg1
, const unsigned char *sel
)
8905 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (type
), i
;
8907 bool need_ctor
= false;
8909 gcc_assert (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0
)) == nelts
8910 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg1
)) == nelts
);
8911 if (TREE_TYPE (TREE_TYPE (arg0
)) != TREE_TYPE (type
)
8912 || TREE_TYPE (TREE_TYPE (arg1
)) != TREE_TYPE (type
))
8915 elts
= XALLOCAVEC (tree
, nelts
* 3);
8916 if (!vec_cst_ctor_to_array (arg0
, elts
)
8917 || !vec_cst_ctor_to_array (arg1
, elts
+ nelts
))
8920 for (i
= 0; i
< nelts
; i
++)
8922 if (!CONSTANT_CLASS_P (elts
[sel
[i
]]))
8924 elts
[i
+ 2 * nelts
] = unshare_expr (elts
[sel
[i
]]);
8929 vec
<constructor_elt
, va_gc
> *v
;
8930 vec_alloc (v
, nelts
);
8931 for (i
= 0; i
< nelts
; i
++)
8932 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, elts
[2 * nelts
+ i
]);
8933 return build_constructor (type
, v
);
8936 return build_vector (type
, &elts
[2 * nelts
]);
8939 /* Try to fold a pointer difference of type TYPE two address expressions of
8940 array references AREF0 and AREF1 using location LOC. Return a
8941 simplified expression for the difference or NULL_TREE. */
8944 fold_addr_of_array_ref_difference (location_t loc
, tree type
,
8945 tree aref0
, tree aref1
)
8947 tree base0
= TREE_OPERAND (aref0
, 0);
8948 tree base1
= TREE_OPERAND (aref1
, 0);
8949 tree base_offset
= build_int_cst (type
, 0);
8951 /* If the bases are array references as well, recurse. If the bases
8952 are pointer indirections compute the difference of the pointers.
8953 If the bases are equal, we are set. */
8954 if ((TREE_CODE (base0
) == ARRAY_REF
8955 && TREE_CODE (base1
) == ARRAY_REF
8957 = fold_addr_of_array_ref_difference (loc
, type
, base0
, base1
)))
8958 || (INDIRECT_REF_P (base0
)
8959 && INDIRECT_REF_P (base1
)
8961 = fold_binary_loc (loc
, MINUS_EXPR
, type
,
8962 fold_convert (type
, TREE_OPERAND (base0
, 0)),
8964 TREE_OPERAND (base1
, 0)))))
8965 || operand_equal_p (base0
, base1
, OEP_ADDRESS_OF
))
8967 tree op0
= fold_convert_loc (loc
, type
, TREE_OPERAND (aref0
, 1));
8968 tree op1
= fold_convert_loc (loc
, type
, TREE_OPERAND (aref1
, 1));
8969 tree esz
= fold_convert_loc (loc
, type
, array_ref_element_size (aref0
));
8970 tree diff
= build2 (MINUS_EXPR
, type
, op0
, op1
);
8971 return fold_build2_loc (loc
, PLUS_EXPR
, type
,
8973 fold_build2_loc (loc
, MULT_EXPR
, type
,
8979 /* If the real or vector real constant CST of type TYPE has an exact
8980 inverse, return it, else return NULL. */
8983 exact_inverse (tree type
, tree cst
)
8986 tree unit_type
, *elts
;
8988 unsigned vec_nelts
, i
;
8990 switch (TREE_CODE (cst
))
8993 r
= TREE_REAL_CST (cst
);
8995 if (exact_real_inverse (TYPE_MODE (type
), &r
))
8996 return build_real (type
, r
);
9001 vec_nelts
= VECTOR_CST_NELTS (cst
);
9002 elts
= XALLOCAVEC (tree
, vec_nelts
);
9003 unit_type
= TREE_TYPE (type
);
9004 mode
= TYPE_MODE (unit_type
);
9006 for (i
= 0; i
< vec_nelts
; i
++)
9008 r
= TREE_REAL_CST (VECTOR_CST_ELT (cst
, i
));
9009 if (!exact_real_inverse (mode
, &r
))
9011 elts
[i
] = build_real (unit_type
, r
);
9014 return build_vector (type
, elts
);
9021 /* Mask out the tz least significant bits of X of type TYPE where
9022 tz is the number of trailing zeroes in Y. */
9024 mask_with_tz (tree type
, const wide_int
&x
, const wide_int
&y
)
9026 int tz
= wi::ctz (y
);
9028 return wi::mask (tz
, true, TYPE_PRECISION (type
)) & x
;
9032 /* Return true when T is an address and is known to be nonzero.
9033 For floating point we further ensure that T is not denormal.
9034 Similar logic is present in nonzero_address in rtlanal.h.
9036 If the return value is based on the assumption that signed overflow
9037 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
9038 change *STRICT_OVERFLOW_P. */
9041 tree_expr_nonzero_warnv_p (tree t
, bool *strict_overflow_p
)
9043 tree type
= TREE_TYPE (t
);
9044 enum tree_code code
;
9046 /* Doing something useful for floating point would need more work. */
9047 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
9050 code
= TREE_CODE (t
);
9051 switch (TREE_CODE_CLASS (code
))
9054 return tree_unary_nonzero_warnv_p (code
, type
, TREE_OPERAND (t
, 0),
9057 case tcc_comparison
:
9058 return tree_binary_nonzero_warnv_p (code
, type
,
9059 TREE_OPERAND (t
, 0),
9060 TREE_OPERAND (t
, 1),
9063 case tcc_declaration
:
9065 return tree_single_nonzero_warnv_p (t
, strict_overflow_p
);
9073 case TRUTH_NOT_EXPR
:
9074 return tree_unary_nonzero_warnv_p (code
, type
, TREE_OPERAND (t
, 0),
9077 case TRUTH_AND_EXPR
:
9079 case TRUTH_XOR_EXPR
:
9080 return tree_binary_nonzero_warnv_p (code
, type
,
9081 TREE_OPERAND (t
, 0),
9082 TREE_OPERAND (t
, 1),
9090 case WITH_SIZE_EXPR
:
9092 return tree_single_nonzero_warnv_p (t
, strict_overflow_p
);
9097 return tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 1),
9101 return tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 0),
9106 tree fndecl
= get_callee_fndecl (t
);
9107 if (!fndecl
) return false;
9108 if (flag_delete_null_pointer_checks
&& !flag_check_new
9109 && DECL_IS_OPERATOR_NEW (fndecl
)
9110 && !TREE_NOTHROW (fndecl
))
9112 if (flag_delete_null_pointer_checks
9113 && lookup_attribute ("returns_nonnull",
9114 TYPE_ATTRIBUTES (TREE_TYPE (fndecl
))))
9116 return alloca_call_p (t
);
9125 /* Return true when T is an address and is known to be nonzero.
9126 Handle warnings about undefined signed overflow. */
9129 tree_expr_nonzero_p (tree t
)
9131 bool ret
, strict_overflow_p
;
9133 strict_overflow_p
= false;
9134 ret
= tree_expr_nonzero_warnv_p (t
, &strict_overflow_p
);
9135 if (strict_overflow_p
)
9136 fold_overflow_warning (("assuming signed overflow does not occur when "
9137 "determining that expression is always "
9139 WARN_STRICT_OVERFLOW_MISC
);
9143 /* Return true if T is known not to be equal to an integer W. */
9146 expr_not_equal_to (tree t
, const wide_int
&w
)
9148 wide_int min
, max
, nz
;
9149 value_range_type rtype
;
9150 switch (TREE_CODE (t
))
9153 return wi::ne_p (t
, w
);
9156 if (!INTEGRAL_TYPE_P (TREE_TYPE (t
)))
9158 rtype
= get_range_info (t
, &min
, &max
);
9159 if (rtype
== VR_RANGE
)
9161 if (wi::lt_p (max
, w
, TYPE_SIGN (TREE_TYPE (t
))))
9163 if (wi::lt_p (w
, min
, TYPE_SIGN (TREE_TYPE (t
))))
9166 else if (rtype
== VR_ANTI_RANGE
9167 && wi::le_p (min
, w
, TYPE_SIGN (TREE_TYPE (t
)))
9168 && wi::le_p (w
, max
, TYPE_SIGN (TREE_TYPE (t
))))
9170 /* If T has some known zero bits and W has any of those bits set,
9171 then T is known not to be equal to W. */
9172 if (wi::ne_p (wi::zext (wi::bit_and_not (w
, get_nonzero_bits (t
)),
9173 TYPE_PRECISION (TREE_TYPE (t
))), 0))
9182 /* Fold a binary expression of code CODE and type TYPE with operands
9183 OP0 and OP1. LOC is the location of the resulting expression.
9184 Return the folded expression if folding is successful. Otherwise,
9185 return NULL_TREE. */
9188 fold_binary_loc (location_t loc
,
9189 enum tree_code code
, tree type
, tree op0
, tree op1
)
9191 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
9192 tree arg0
, arg1
, tem
;
9193 tree t1
= NULL_TREE
;
9194 bool strict_overflow_p
;
9197 gcc_assert (IS_EXPR_CODE_CLASS (kind
)
9198 && TREE_CODE_LENGTH (code
) == 2
9200 && op1
!= NULL_TREE
);
9205 /* Strip any conversions that don't change the mode. This is
9206 safe for every expression, except for a comparison expression
9207 because its signedness is derived from its operands. So, in
9208 the latter case, only strip conversions that don't change the
9209 signedness. MIN_EXPR/MAX_EXPR also need signedness of arguments
9212 Note that this is done as an internal manipulation within the
9213 constant folder, in order to find the simplest representation
9214 of the arguments so that their form can be studied. In any
9215 cases, the appropriate type conversions should be put back in
9216 the tree that will get out of the constant folder. */
9218 if (kind
== tcc_comparison
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
9220 STRIP_SIGN_NOPS (arg0
);
9221 STRIP_SIGN_NOPS (arg1
);
9229 /* Note that TREE_CONSTANT isn't enough: static var addresses are
9230 constant but we can't do arithmetic on them. */
9231 if (CONSTANT_CLASS_P (arg0
) && CONSTANT_CLASS_P (arg1
))
9233 tem
= const_binop (code
, type
, arg0
, arg1
);
9234 if (tem
!= NULL_TREE
)
9236 if (TREE_TYPE (tem
) != type
)
9237 tem
= fold_convert_loc (loc
, type
, tem
);
9242 /* If this is a commutative operation, and ARG0 is a constant, move it
9243 to ARG1 to reduce the number of tests below. */
9244 if (commutative_tree_code (code
)
9245 && tree_swap_operands_p (arg0
, arg1
, true))
9246 return fold_build2_loc (loc
, code
, type
, op1
, op0
);
9248 /* Likewise if this is a comparison, and ARG0 is a constant, move it
9249 to ARG1 to reduce the number of tests below. */
9250 if (kind
== tcc_comparison
9251 && tree_swap_operands_p (arg0
, arg1
, true))
9252 return fold_build2_loc (loc
, swap_tree_comparison (code
), type
, op1
, op0
);
9254 tem
= generic_simplify (loc
, code
, type
, op0
, op1
);
9258 /* ARG0 is the first operand of EXPR, and ARG1 is the second operand.
9260 First check for cases where an arithmetic operation is applied to a
9261 compound, conditional, or comparison operation. Push the arithmetic
9262 operation inside the compound or conditional to see if any folding
9263 can then be done. Convert comparison to conditional for this purpose.
9264 The also optimizes non-constant cases that used to be done in
9267 Before we do that, see if this is a BIT_AND_EXPR or a BIT_IOR_EXPR,
9268 one of the operands is a comparison and the other is a comparison, a
9269 BIT_AND_EXPR with the constant 1, or a truth value. In that case, the
9270 code below would make the expression more complex. Change it to a
9271 TRUTH_{AND,OR}_EXPR. Likewise, convert a similar NE_EXPR to
9272 TRUTH_XOR_EXPR and an EQ_EXPR to the inversion of a TRUTH_XOR_EXPR. */
9274 if ((code
== BIT_AND_EXPR
|| code
== BIT_IOR_EXPR
9275 || code
== EQ_EXPR
|| code
== NE_EXPR
)
9276 && TREE_CODE (type
) != VECTOR_TYPE
9277 && ((truth_value_p (TREE_CODE (arg0
))
9278 && (truth_value_p (TREE_CODE (arg1
))
9279 || (TREE_CODE (arg1
) == BIT_AND_EXPR
9280 && integer_onep (TREE_OPERAND (arg1
, 1)))))
9281 || (truth_value_p (TREE_CODE (arg1
))
9282 && (truth_value_p (TREE_CODE (arg0
))
9283 || (TREE_CODE (arg0
) == BIT_AND_EXPR
9284 && integer_onep (TREE_OPERAND (arg0
, 1)))))))
9286 tem
= fold_build2_loc (loc
, code
== BIT_AND_EXPR
? TRUTH_AND_EXPR
9287 : code
== BIT_IOR_EXPR
? TRUTH_OR_EXPR
9290 fold_convert_loc (loc
, boolean_type_node
, arg0
),
9291 fold_convert_loc (loc
, boolean_type_node
, arg1
));
9293 if (code
== EQ_EXPR
)
9294 tem
= invert_truthvalue_loc (loc
, tem
);
9296 return fold_convert_loc (loc
, type
, tem
);
9299 if (TREE_CODE_CLASS (code
) == tcc_binary
9300 || TREE_CODE_CLASS (code
) == tcc_comparison
)
9302 if (TREE_CODE (arg0
) == COMPOUND_EXPR
)
9304 tem
= fold_build2_loc (loc
, code
, type
,
9305 fold_convert_loc (loc
, TREE_TYPE (op0
),
9306 TREE_OPERAND (arg0
, 1)), op1
);
9307 return build2_loc (loc
, COMPOUND_EXPR
, type
, TREE_OPERAND (arg0
, 0),
9310 if (TREE_CODE (arg1
) == COMPOUND_EXPR
9311 && reorder_operands_p (arg0
, TREE_OPERAND (arg1
, 0)))
9313 tem
= fold_build2_loc (loc
, code
, type
, op0
,
9314 fold_convert_loc (loc
, TREE_TYPE (op1
),
9315 TREE_OPERAND (arg1
, 1)));
9316 return build2_loc (loc
, COMPOUND_EXPR
, type
, TREE_OPERAND (arg1
, 0),
9320 if (TREE_CODE (arg0
) == COND_EXPR
9321 || TREE_CODE (arg0
) == VEC_COND_EXPR
9322 || COMPARISON_CLASS_P (arg0
))
9324 tem
= fold_binary_op_with_conditional_arg (loc
, code
, type
, op0
, op1
,
9326 /*cond_first_p=*/1);
9327 if (tem
!= NULL_TREE
)
9331 if (TREE_CODE (arg1
) == COND_EXPR
9332 || TREE_CODE (arg1
) == VEC_COND_EXPR
9333 || COMPARISON_CLASS_P (arg1
))
9335 tem
= fold_binary_op_with_conditional_arg (loc
, code
, type
, op0
, op1
,
9337 /*cond_first_p=*/0);
9338 if (tem
!= NULL_TREE
)
9346 /* MEM[&MEM[p, CST1], CST2] -> MEM[p, CST1 + CST2]. */
9347 if (TREE_CODE (arg0
) == ADDR_EXPR
9348 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == MEM_REF
)
9350 tree iref
= TREE_OPERAND (arg0
, 0);
9351 return fold_build2 (MEM_REF
, type
,
9352 TREE_OPERAND (iref
, 0),
9353 int_const_binop (PLUS_EXPR
, arg1
,
9354 TREE_OPERAND (iref
, 1)));
9357 /* MEM[&a.b, CST2] -> MEM[&a, offsetof (a, b) + CST2]. */
9358 if (TREE_CODE (arg0
) == ADDR_EXPR
9359 && handled_component_p (TREE_OPERAND (arg0
, 0)))
9362 HOST_WIDE_INT coffset
;
9363 base
= get_addr_base_and_unit_offset (TREE_OPERAND (arg0
, 0),
9367 return fold_build2 (MEM_REF
, type
,
9368 build_fold_addr_expr (base
),
9369 int_const_binop (PLUS_EXPR
, arg1
,
9370 size_int (coffset
)));
9375 case POINTER_PLUS_EXPR
:
9376 /* INT +p INT -> (PTR)(INT + INT). Stripping types allows for this. */
9377 if (INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
9378 && INTEGRAL_TYPE_P (TREE_TYPE (arg0
)))
9379 return fold_convert_loc (loc
, type
,
9380 fold_build2_loc (loc
, PLUS_EXPR
, sizetype
,
9381 fold_convert_loc (loc
, sizetype
,
9383 fold_convert_loc (loc
, sizetype
,
9389 if (INTEGRAL_TYPE_P (type
) || VECTOR_INTEGER_TYPE_P (type
))
9391 /* X + (X / CST) * -CST is X % CST. */
9392 if (TREE_CODE (arg1
) == MULT_EXPR
9393 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == TRUNC_DIV_EXPR
9394 && operand_equal_p (arg0
,
9395 TREE_OPERAND (TREE_OPERAND (arg1
, 0), 0), 0))
9397 tree cst0
= TREE_OPERAND (TREE_OPERAND (arg1
, 0), 1);
9398 tree cst1
= TREE_OPERAND (arg1
, 1);
9399 tree sum
= fold_binary_loc (loc
, PLUS_EXPR
, TREE_TYPE (cst1
),
9401 if (sum
&& integer_zerop (sum
))
9402 return fold_convert_loc (loc
, type
,
9403 fold_build2_loc (loc
, TRUNC_MOD_EXPR
,
9404 TREE_TYPE (arg0
), arg0
,
9409 /* Handle (A1 * C1) + (A2 * C2) with A1, A2 or C1, C2 being the same or
9410 one. Make sure the type is not saturating and has the signedness of
9411 the stripped operands, as fold_plusminus_mult_expr will re-associate.
9412 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
9413 if ((TREE_CODE (arg0
) == MULT_EXPR
9414 || TREE_CODE (arg1
) == MULT_EXPR
)
9415 && !TYPE_SATURATING (type
)
9416 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg0
))
9417 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg1
))
9418 && (!FLOAT_TYPE_P (type
) || flag_associative_math
))
9420 tree tem
= fold_plusminus_mult_expr (loc
, code
, type
, arg0
, arg1
);
9425 if (! FLOAT_TYPE_P (type
))
9427 /* Reassociate (plus (plus (mult) (foo)) (mult)) as
9428 (plus (plus (mult) (mult)) (foo)) so that we can
9429 take advantage of the factoring cases below. */
9430 if (ANY_INTEGRAL_TYPE_P (type
)
9431 && TYPE_OVERFLOW_WRAPS (type
)
9432 && (((TREE_CODE (arg0
) == PLUS_EXPR
9433 || TREE_CODE (arg0
) == MINUS_EXPR
)
9434 && TREE_CODE (arg1
) == MULT_EXPR
)
9435 || ((TREE_CODE (arg1
) == PLUS_EXPR
9436 || TREE_CODE (arg1
) == MINUS_EXPR
)
9437 && TREE_CODE (arg0
) == MULT_EXPR
)))
9439 tree parg0
, parg1
, parg
, marg
;
9440 enum tree_code pcode
;
9442 if (TREE_CODE (arg1
) == MULT_EXPR
)
9443 parg
= arg0
, marg
= arg1
;
9445 parg
= arg1
, marg
= arg0
;
9446 pcode
= TREE_CODE (parg
);
9447 parg0
= TREE_OPERAND (parg
, 0);
9448 parg1
= TREE_OPERAND (parg
, 1);
9452 if (TREE_CODE (parg0
) == MULT_EXPR
9453 && TREE_CODE (parg1
) != MULT_EXPR
)
9454 return fold_build2_loc (loc
, pcode
, type
,
9455 fold_build2_loc (loc
, PLUS_EXPR
, type
,
9456 fold_convert_loc (loc
, type
,
9458 fold_convert_loc (loc
, type
,
9460 fold_convert_loc (loc
, type
, parg1
));
9461 if (TREE_CODE (parg0
) != MULT_EXPR
9462 && TREE_CODE (parg1
) == MULT_EXPR
)
9464 fold_build2_loc (loc
, PLUS_EXPR
, type
,
9465 fold_convert_loc (loc
, type
, parg0
),
9466 fold_build2_loc (loc
, pcode
, type
,
9467 fold_convert_loc (loc
, type
, marg
),
9468 fold_convert_loc (loc
, type
,
9474 /* Fold __complex__ ( x, 0 ) + __complex__ ( 0, y )
9475 to __complex__ ( x, y ). This is not the same for SNaNs or
9476 if signed zeros are involved. */
9477 if (!HONOR_SNANS (element_mode (arg0
))
9478 && !HONOR_SIGNED_ZEROS (element_mode (arg0
))
9479 && COMPLEX_FLOAT_TYPE_P (TREE_TYPE (arg0
)))
9481 tree rtype
= TREE_TYPE (TREE_TYPE (arg0
));
9482 tree arg0r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg0
);
9483 tree arg0i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg0
);
9484 bool arg0rz
= false, arg0iz
= false;
9485 if ((arg0r
&& (arg0rz
= real_zerop (arg0r
)))
9486 || (arg0i
&& (arg0iz
= real_zerop (arg0i
))))
9488 tree arg1r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg1
);
9489 tree arg1i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg1
);
9490 if (arg0rz
&& arg1i
&& real_zerop (arg1i
))
9492 tree rp
= arg1r
? arg1r
9493 : build1 (REALPART_EXPR
, rtype
, arg1
);
9494 tree ip
= arg0i
? arg0i
9495 : build1 (IMAGPART_EXPR
, rtype
, arg0
);
9496 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
9498 else if (arg0iz
&& arg1r
&& real_zerop (arg1r
))
9500 tree rp
= arg0r
? arg0r
9501 : build1 (REALPART_EXPR
, rtype
, arg0
);
9502 tree ip
= arg1i
? arg1i
9503 : build1 (IMAGPART_EXPR
, rtype
, arg1
);
9504 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
9509 if (flag_unsafe_math_optimizations
9510 && (TREE_CODE (arg0
) == RDIV_EXPR
|| TREE_CODE (arg0
) == MULT_EXPR
)
9511 && (TREE_CODE (arg1
) == RDIV_EXPR
|| TREE_CODE (arg1
) == MULT_EXPR
)
9512 && (tem
= distribute_real_division (loc
, code
, type
, arg0
, arg1
)))
9515 /* Convert a + (b*c + d*e) into (a + b*c) + d*e.
9516 We associate floats only if the user has specified
9517 -fassociative-math. */
9518 if (flag_associative_math
9519 && TREE_CODE (arg1
) == PLUS_EXPR
9520 && TREE_CODE (arg0
) != MULT_EXPR
)
9522 tree tree10
= TREE_OPERAND (arg1
, 0);
9523 tree tree11
= TREE_OPERAND (arg1
, 1);
9524 if (TREE_CODE (tree11
) == MULT_EXPR
9525 && TREE_CODE (tree10
) == MULT_EXPR
)
9528 tree0
= fold_build2_loc (loc
, PLUS_EXPR
, type
, arg0
, tree10
);
9529 return fold_build2_loc (loc
, PLUS_EXPR
, type
, tree0
, tree11
);
9532 /* Convert (b*c + d*e) + a into b*c + (d*e +a).
9533 We associate floats only if the user has specified
9534 -fassociative-math. */
9535 if (flag_associative_math
9536 && TREE_CODE (arg0
) == PLUS_EXPR
9537 && TREE_CODE (arg1
) != MULT_EXPR
)
9539 tree tree00
= TREE_OPERAND (arg0
, 0);
9540 tree tree01
= TREE_OPERAND (arg0
, 1);
9541 if (TREE_CODE (tree01
) == MULT_EXPR
9542 && TREE_CODE (tree00
) == MULT_EXPR
)
9545 tree0
= fold_build2_loc (loc
, PLUS_EXPR
, type
, tree01
, arg1
);
9546 return fold_build2_loc (loc
, PLUS_EXPR
, type
, tree00
, tree0
);
9552 /* (A << C1) + (A >> C2) if A is unsigned and C1+C2 is the size of A
9553 is a rotate of A by C1 bits. */
9554 /* (A << B) + (A >> (Z - B)) if A is unsigned and Z is the size of A
9555 is a rotate of A by B bits. */
9557 enum tree_code code0
, code1
;
9559 code0
= TREE_CODE (arg0
);
9560 code1
= TREE_CODE (arg1
);
9561 if (((code0
== RSHIFT_EXPR
&& code1
== LSHIFT_EXPR
)
9562 || (code1
== RSHIFT_EXPR
&& code0
== LSHIFT_EXPR
))
9563 && operand_equal_p (TREE_OPERAND (arg0
, 0),
9564 TREE_OPERAND (arg1
, 0), 0)
9565 && (rtype
= TREE_TYPE (TREE_OPERAND (arg0
, 0)),
9566 TYPE_UNSIGNED (rtype
))
9567 /* Only create rotates in complete modes. Other cases are not
9568 expanded properly. */
9569 && (element_precision (rtype
)
9570 == GET_MODE_UNIT_PRECISION (TYPE_MODE (rtype
))))
9572 tree tree01
, tree11
;
9573 enum tree_code code01
, code11
;
9575 tree01
= TREE_OPERAND (arg0
, 1);
9576 tree11
= TREE_OPERAND (arg1
, 1);
9577 STRIP_NOPS (tree01
);
9578 STRIP_NOPS (tree11
);
9579 code01
= TREE_CODE (tree01
);
9580 code11
= TREE_CODE (tree11
);
9581 if (code01
== INTEGER_CST
9582 && code11
== INTEGER_CST
9583 && (wi::to_widest (tree01
) + wi::to_widest (tree11
)
9584 == element_precision (TREE_TYPE (TREE_OPERAND (arg0
, 0)))))
9586 tem
= build2_loc (loc
, LROTATE_EXPR
,
9587 TREE_TYPE (TREE_OPERAND (arg0
, 0)),
9588 TREE_OPERAND (arg0
, 0),
9589 code0
== LSHIFT_EXPR
9590 ? TREE_OPERAND (arg0
, 1)
9591 : TREE_OPERAND (arg1
, 1));
9592 return fold_convert_loc (loc
, type
, tem
);
9594 else if (code11
== MINUS_EXPR
)
9596 tree tree110
, tree111
;
9597 tree110
= TREE_OPERAND (tree11
, 0);
9598 tree111
= TREE_OPERAND (tree11
, 1);
9599 STRIP_NOPS (tree110
);
9600 STRIP_NOPS (tree111
);
9601 if (TREE_CODE (tree110
) == INTEGER_CST
9602 && 0 == compare_tree_int (tree110
,
9604 (TREE_TYPE (TREE_OPERAND
9606 && operand_equal_p (tree01
, tree111
, 0))
9608 fold_convert_loc (loc
, type
,
9609 build2 ((code0
== LSHIFT_EXPR
9612 TREE_TYPE (TREE_OPERAND (arg0
, 0)),
9613 TREE_OPERAND (arg0
, 0),
9614 TREE_OPERAND (arg0
, 1)));
9616 else if (code01
== MINUS_EXPR
)
9618 tree tree010
, tree011
;
9619 tree010
= TREE_OPERAND (tree01
, 0);
9620 tree011
= TREE_OPERAND (tree01
, 1);
9621 STRIP_NOPS (tree010
);
9622 STRIP_NOPS (tree011
);
9623 if (TREE_CODE (tree010
) == INTEGER_CST
9624 && 0 == compare_tree_int (tree010
,
9626 (TREE_TYPE (TREE_OPERAND
9628 && operand_equal_p (tree11
, tree011
, 0))
9629 return fold_convert_loc
9631 build2 ((code0
!= LSHIFT_EXPR
9634 TREE_TYPE (TREE_OPERAND (arg0
, 0)),
9635 TREE_OPERAND (arg0
, 0), TREE_OPERAND (arg1
, 1)));
9641 /* In most languages, can't associate operations on floats through
9642 parentheses. Rather than remember where the parentheses were, we
9643 don't associate floats at all, unless the user has specified
9645 And, we need to make sure type is not saturating. */
9647 if ((! FLOAT_TYPE_P (type
) || flag_associative_math
)
9648 && !TYPE_SATURATING (type
))
9650 tree var0
, con0
, lit0
, minus_lit0
;
9651 tree var1
, con1
, lit1
, minus_lit1
;
9655 /* Split both trees into variables, constants, and literals. Then
9656 associate each group together, the constants with literals,
9657 then the result with variables. This increases the chances of
9658 literals being recombined later and of generating relocatable
9659 expressions for the sum of a constant and literal. */
9660 var0
= split_tree (loc
, arg0
, type
, code
,
9661 &con0
, &lit0
, &minus_lit0
, 0);
9662 var1
= split_tree (loc
, arg1
, type
, code
,
9663 &con1
, &lit1
, &minus_lit1
, code
== MINUS_EXPR
);
9665 /* Recombine MINUS_EXPR operands by using PLUS_EXPR. */
9666 if (code
== MINUS_EXPR
)
9669 /* With undefined overflow prefer doing association in a type
9670 which wraps on overflow, if that is one of the operand types. */
9671 if ((POINTER_TYPE_P (type
) && POINTER_TYPE_OVERFLOW_UNDEFINED
)
9672 || (INTEGRAL_TYPE_P (type
) && !TYPE_OVERFLOW_WRAPS (type
)))
9674 if (INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
9675 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg0
)))
9676 atype
= TREE_TYPE (arg0
);
9677 else if (INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
9678 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg1
)))
9679 atype
= TREE_TYPE (arg1
);
9680 gcc_assert (TYPE_PRECISION (atype
) == TYPE_PRECISION (type
));
9683 /* With undefined overflow we can only associate constants with one
9684 variable, and constants whose association doesn't overflow. */
9685 if ((POINTER_TYPE_P (atype
) && POINTER_TYPE_OVERFLOW_UNDEFINED
)
9686 || (INTEGRAL_TYPE_P (atype
) && !TYPE_OVERFLOW_WRAPS (atype
)))
9692 bool one_neg
= false;
9694 if (TREE_CODE (tmp0
) == NEGATE_EXPR
)
9696 tmp0
= TREE_OPERAND (tmp0
, 0);
9699 if (CONVERT_EXPR_P (tmp0
)
9700 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (tmp0
, 0)))
9701 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (tmp0
, 0)))
9702 <= TYPE_PRECISION (atype
)))
9703 tmp0
= TREE_OPERAND (tmp0
, 0);
9704 if (TREE_CODE (tmp1
) == NEGATE_EXPR
)
9706 tmp1
= TREE_OPERAND (tmp1
, 0);
9709 if (CONVERT_EXPR_P (tmp1
)
9710 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (tmp1
, 0)))
9711 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (tmp1
, 0)))
9712 <= TYPE_PRECISION (atype
)))
9713 tmp1
= TREE_OPERAND (tmp1
, 0);
9714 /* The only case we can still associate with two variables
9715 is if they cancel out. */
9717 || !operand_equal_p (tmp0
, tmp1
, 0))
9722 /* Only do something if we found more than two objects. Otherwise,
9723 nothing has changed and we risk infinite recursion. */
9725 && (2 < ((var0
!= 0) + (var1
!= 0)
9726 + (con0
!= 0) + (con1
!= 0)
9727 + (lit0
!= 0) + (lit1
!= 0)
9728 + (minus_lit0
!= 0) + (minus_lit1
!= 0))))
9730 bool any_overflows
= false;
9731 if (lit0
) any_overflows
|= TREE_OVERFLOW (lit0
);
9732 if (lit1
) any_overflows
|= TREE_OVERFLOW (lit1
);
9733 if (minus_lit0
) any_overflows
|= TREE_OVERFLOW (minus_lit0
);
9734 if (minus_lit1
) any_overflows
|= TREE_OVERFLOW (minus_lit1
);
9735 var0
= associate_trees (loc
, var0
, var1
, code
, atype
);
9736 con0
= associate_trees (loc
, con0
, con1
, code
, atype
);
9737 lit0
= associate_trees (loc
, lit0
, lit1
, code
, atype
);
9738 minus_lit0
= associate_trees (loc
, minus_lit0
, minus_lit1
,
9741 /* Preserve the MINUS_EXPR if the negative part of the literal is
9742 greater than the positive part. Otherwise, the multiplicative
9743 folding code (i.e extract_muldiv) may be fooled in case
9744 unsigned constants are subtracted, like in the following
9745 example: ((X*2 + 4) - 8U)/2. */
9746 if (minus_lit0
&& lit0
)
9748 if (TREE_CODE (lit0
) == INTEGER_CST
9749 && TREE_CODE (minus_lit0
) == INTEGER_CST
9750 && tree_int_cst_lt (lit0
, minus_lit0
))
9752 minus_lit0
= associate_trees (loc
, minus_lit0
, lit0
,
9758 lit0
= associate_trees (loc
, lit0
, minus_lit0
,
9764 /* Don't introduce overflows through reassociation. */
9766 && ((lit0
&& TREE_OVERFLOW_P (lit0
))
9767 || (minus_lit0
&& TREE_OVERFLOW_P (minus_lit0
))))
9774 fold_convert_loc (loc
, type
,
9775 associate_trees (loc
, var0
, minus_lit0
,
9776 MINUS_EXPR
, atype
));
9779 con0
= associate_trees (loc
, con0
, minus_lit0
,
9782 fold_convert_loc (loc
, type
,
9783 associate_trees (loc
, var0
, con0
,
9788 con0
= associate_trees (loc
, con0
, lit0
, code
, atype
);
9790 fold_convert_loc (loc
, type
, associate_trees (loc
, var0
, con0
,
9798 /* (-A) - B -> (-B) - A where B is easily negated and we can swap. */
9799 if (TREE_CODE (arg0
) == NEGATE_EXPR
9800 && negate_expr_p (op1
)
9801 && reorder_operands_p (arg0
, arg1
))
9802 return fold_build2_loc (loc
, MINUS_EXPR
, type
,
9804 fold_convert_loc (loc
, type
,
9805 TREE_OPERAND (arg0
, 0)));
9807 /* Fold __complex__ ( x, 0 ) - __complex__ ( 0, y ) to
9808 __complex__ ( x, -y ). This is not the same for SNaNs or if
9809 signed zeros are involved. */
9810 if (!HONOR_SNANS (element_mode (arg0
))
9811 && !HONOR_SIGNED_ZEROS (element_mode (arg0
))
9812 && COMPLEX_FLOAT_TYPE_P (TREE_TYPE (arg0
)))
9814 tree rtype
= TREE_TYPE (TREE_TYPE (arg0
));
9815 tree arg0r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg0
);
9816 tree arg0i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg0
);
9817 bool arg0rz
= false, arg0iz
= false;
9818 if ((arg0r
&& (arg0rz
= real_zerop (arg0r
)))
9819 || (arg0i
&& (arg0iz
= real_zerop (arg0i
))))
9821 tree arg1r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg1
);
9822 tree arg1i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg1
);
9823 if (arg0rz
&& arg1i
&& real_zerop (arg1i
))
9825 tree rp
= fold_build1_loc (loc
, NEGATE_EXPR
, rtype
,
9827 : build1 (REALPART_EXPR
, rtype
, arg1
));
9828 tree ip
= arg0i
? arg0i
9829 : build1 (IMAGPART_EXPR
, rtype
, arg0
);
9830 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
9832 else if (arg0iz
&& arg1r
&& real_zerop (arg1r
))
9834 tree rp
= arg0r
? arg0r
9835 : build1 (REALPART_EXPR
, rtype
, arg0
);
9836 tree ip
= fold_build1_loc (loc
, NEGATE_EXPR
, rtype
,
9838 : build1 (IMAGPART_EXPR
, rtype
, arg1
));
9839 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
9844 /* A - B -> A + (-B) if B is easily negatable. */
9845 if (negate_expr_p (op1
)
9846 && ! TYPE_OVERFLOW_SANITIZED (type
)
9847 && ((FLOAT_TYPE_P (type
)
9848 /* Avoid this transformation if B is a positive REAL_CST. */
9849 && (TREE_CODE (op1
) != REAL_CST
9850 || REAL_VALUE_NEGATIVE (TREE_REAL_CST (op1
))))
9851 || INTEGRAL_TYPE_P (type
)))
9852 return fold_build2_loc (loc
, PLUS_EXPR
, type
,
9853 fold_convert_loc (loc
, type
, arg0
),
9856 /* Fold &a[i] - &a[j] to i-j. */
9857 if (TREE_CODE (arg0
) == ADDR_EXPR
9858 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == ARRAY_REF
9859 && TREE_CODE (arg1
) == ADDR_EXPR
9860 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == ARRAY_REF
)
9862 tree tem
= fold_addr_of_array_ref_difference (loc
, type
,
9863 TREE_OPERAND (arg0
, 0),
9864 TREE_OPERAND (arg1
, 0));
9869 if (FLOAT_TYPE_P (type
)
9870 && flag_unsafe_math_optimizations
9871 && (TREE_CODE (arg0
) == RDIV_EXPR
|| TREE_CODE (arg0
) == MULT_EXPR
)
9872 && (TREE_CODE (arg1
) == RDIV_EXPR
|| TREE_CODE (arg1
) == MULT_EXPR
)
9873 && (tem
= distribute_real_division (loc
, code
, type
, arg0
, arg1
)))
9876 /* Handle (A1 * C1) - (A2 * C2) with A1, A2 or C1, C2 being the same or
9877 one. Make sure the type is not saturating and has the signedness of
9878 the stripped operands, as fold_plusminus_mult_expr will re-associate.
9879 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
9880 if ((TREE_CODE (arg0
) == MULT_EXPR
9881 || TREE_CODE (arg1
) == MULT_EXPR
)
9882 && !TYPE_SATURATING (type
)
9883 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg0
))
9884 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg1
))
9885 && (!FLOAT_TYPE_P (type
) || flag_associative_math
))
9887 tree tem
= fold_plusminus_mult_expr (loc
, code
, type
, arg0
, arg1
);
9895 if (! FLOAT_TYPE_P (type
))
9897 /* Transform x * -C into -x * C if x is easily negatable. */
9898 if (TREE_CODE (op1
) == INTEGER_CST
9899 && tree_int_cst_sgn (op1
) == -1
9900 && negate_expr_p (op0
)
9901 && (tem
= negate_expr (op1
)) != op1
9902 && ! TREE_OVERFLOW (tem
))
9903 return fold_build2_loc (loc
, MULT_EXPR
, type
,
9904 fold_convert_loc (loc
, type
,
9905 negate_expr (op0
)), tem
);
9907 /* (A + A) * C -> A * 2 * C */
9908 if (TREE_CODE (arg0
) == PLUS_EXPR
9909 && TREE_CODE (arg1
) == INTEGER_CST
9910 && operand_equal_p (TREE_OPERAND (arg0
, 0),
9911 TREE_OPERAND (arg0
, 1), 0))
9912 return fold_build2_loc (loc
, MULT_EXPR
, type
,
9913 omit_one_operand_loc (loc
, type
,
9914 TREE_OPERAND (arg0
, 0),
9915 TREE_OPERAND (arg0
, 1)),
9916 fold_build2_loc (loc
, MULT_EXPR
, type
,
9917 build_int_cst (type
, 2) , arg1
));
9919 /* ((T) (X /[ex] C)) * C cancels out if the conversion is
9920 sign-changing only. */
9921 if (TREE_CODE (arg1
) == INTEGER_CST
9922 && TREE_CODE (arg0
) == EXACT_DIV_EXPR
9923 && operand_equal_p (arg1
, TREE_OPERAND (arg0
, 1), 0))
9924 return fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
9926 strict_overflow_p
= false;
9927 if (TREE_CODE (arg1
) == INTEGER_CST
9928 && 0 != (tem
= extract_muldiv (op0
, arg1
, code
, NULL_TREE
,
9929 &strict_overflow_p
)))
9931 if (strict_overflow_p
)
9932 fold_overflow_warning (("assuming signed overflow does not "
9933 "occur when simplifying "
9935 WARN_STRICT_OVERFLOW_MISC
);
9936 return fold_convert_loc (loc
, type
, tem
);
9939 /* Optimize z * conj(z) for integer complex numbers. */
9940 if (TREE_CODE (arg0
) == CONJ_EXPR
9941 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
9942 return fold_mult_zconjz (loc
, type
, arg1
);
9943 if (TREE_CODE (arg1
) == CONJ_EXPR
9944 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
9945 return fold_mult_zconjz (loc
, type
, arg0
);
9949 /* Fold z * +-I to __complex__ (-+__imag z, +-__real z).
9950 This is not the same for NaNs or if signed zeros are
9952 if (!HONOR_NANS (arg0
)
9953 && !HONOR_SIGNED_ZEROS (element_mode (arg0
))
9954 && COMPLEX_FLOAT_TYPE_P (TREE_TYPE (arg0
))
9955 && TREE_CODE (arg1
) == COMPLEX_CST
9956 && real_zerop (TREE_REALPART (arg1
)))
9958 tree rtype
= TREE_TYPE (TREE_TYPE (arg0
));
9959 if (real_onep (TREE_IMAGPART (arg1
)))
9961 fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
9962 negate_expr (fold_build1_loc (loc
, IMAGPART_EXPR
,
9964 fold_build1_loc (loc
, REALPART_EXPR
, rtype
, arg0
));
9965 else if (real_minus_onep (TREE_IMAGPART (arg1
)))
9967 fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
9968 fold_build1_loc (loc
, IMAGPART_EXPR
, rtype
, arg0
),
9969 negate_expr (fold_build1_loc (loc
, REALPART_EXPR
,
9973 /* Optimize z * conj(z) for floating point complex numbers.
9974 Guarded by flag_unsafe_math_optimizations as non-finite
9975 imaginary components don't produce scalar results. */
9976 if (flag_unsafe_math_optimizations
9977 && TREE_CODE (arg0
) == CONJ_EXPR
9978 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
9979 return fold_mult_zconjz (loc
, type
, arg1
);
9980 if (flag_unsafe_math_optimizations
9981 && TREE_CODE (arg1
) == CONJ_EXPR
9982 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
9983 return fold_mult_zconjz (loc
, type
, arg0
);
9985 if (flag_unsafe_math_optimizations
)
9988 /* Canonicalize x*x as pow(x,2.0), which is expanded as x*x. */
9991 && operand_equal_p (arg0
, arg1
, 0))
9993 tree powfn
= mathfn_built_in (type
, BUILT_IN_POW
);
9997 tree arg
= build_real (type
, dconst2
);
9998 return build_call_expr_loc (loc
, powfn
, 2, arg0
, arg
);
10006 /* Canonicalize (X & C1) | C2. */
10007 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10008 && TREE_CODE (arg1
) == INTEGER_CST
10009 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
10011 int width
= TYPE_PRECISION (type
), w
;
10012 wide_int c1
= TREE_OPERAND (arg0
, 1);
10013 wide_int c2
= arg1
;
10015 /* If (C1&C2) == C1, then (X&C1)|C2 becomes (X,C2). */
10016 if ((c1
& c2
) == c1
)
10017 return omit_one_operand_loc (loc
, type
, arg1
,
10018 TREE_OPERAND (arg0
, 0));
10020 wide_int msk
= wi::mask (width
, false,
10021 TYPE_PRECISION (TREE_TYPE (arg1
)));
10023 /* If (C1|C2) == ~0 then (X&C1)|C2 becomes X|C2. */
10024 if (msk
.and_not (c1
| c2
) == 0)
10025 return fold_build2_loc (loc
, BIT_IOR_EXPR
, type
,
10026 TREE_OPERAND (arg0
, 0), arg1
);
10028 /* Minimize the number of bits set in C1, i.e. C1 := C1 & ~C2,
10029 unless (C1 & ~C2) | (C2 & C3) for some C3 is a mask of some
10030 mode which allows further optimizations. */
10033 wide_int c3
= c1
.and_not (c2
);
10034 for (w
= BITS_PER_UNIT
; w
<= width
; w
<<= 1)
10036 wide_int mask
= wi::mask (w
, false,
10037 TYPE_PRECISION (type
));
10038 if (((c1
| c2
) & mask
) == mask
&& c1
.and_not (mask
) == 0)
10046 return fold_build2_loc (loc
, BIT_IOR_EXPR
, type
,
10047 fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
10048 TREE_OPERAND (arg0
, 0),
10049 wide_int_to_tree (type
,
10054 /* See if this can be simplified into a rotate first. If that
10055 is unsuccessful continue in the association code. */
10059 /* Fold (X & 1) ^ 1 as (X & 1) == 0. */
10060 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10061 && INTEGRAL_TYPE_P (type
)
10062 && integer_onep (TREE_OPERAND (arg0
, 1))
10063 && integer_onep (arg1
))
10064 return fold_build2_loc (loc
, EQ_EXPR
, type
, arg0
,
10065 build_zero_cst (TREE_TYPE (arg0
)));
10067 /* See if this can be simplified into a rotate first. If that
10068 is unsuccessful continue in the association code. */
10072 /* Fold (X ^ 1) & 1 as (X & 1) == 0. */
10073 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
10074 && INTEGRAL_TYPE_P (type
)
10075 && integer_onep (TREE_OPERAND (arg0
, 1))
10076 && integer_onep (arg1
))
10079 tem
= TREE_OPERAND (arg0
, 0);
10080 tem2
= fold_convert_loc (loc
, TREE_TYPE (tem
), arg1
);
10081 tem2
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (tem
),
10083 return fold_build2_loc (loc
, EQ_EXPR
, type
, tem2
,
10084 build_zero_cst (TREE_TYPE (tem
)));
10086 /* Fold ~X & 1 as (X & 1) == 0. */
10087 if (TREE_CODE (arg0
) == BIT_NOT_EXPR
10088 && INTEGRAL_TYPE_P (type
)
10089 && integer_onep (arg1
))
10092 tem
= TREE_OPERAND (arg0
, 0);
10093 tem2
= fold_convert_loc (loc
, TREE_TYPE (tem
), arg1
);
10094 tem2
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (tem
),
10096 return fold_build2_loc (loc
, EQ_EXPR
, type
, tem2
,
10097 build_zero_cst (TREE_TYPE (tem
)));
10099 /* Fold !X & 1 as X == 0. */
10100 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
10101 && integer_onep (arg1
))
10103 tem
= TREE_OPERAND (arg0
, 0);
10104 return fold_build2_loc (loc
, EQ_EXPR
, type
, tem
,
10105 build_zero_cst (TREE_TYPE (tem
)));
10108 /* Fold (X ^ Y) & Y as ~X & Y. */
10109 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
10110 && operand_equal_p (TREE_OPERAND (arg0
, 1), arg1
, 0))
10112 tem
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10113 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
10114 fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, tem
),
10115 fold_convert_loc (loc
, type
, arg1
));
10117 /* Fold (X ^ Y) & X as ~Y & X. */
10118 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
10119 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0)
10120 && reorder_operands_p (TREE_OPERAND (arg0
, 1), arg1
))
10122 tem
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 1));
10123 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
10124 fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, tem
),
10125 fold_convert_loc (loc
, type
, arg1
));
10127 /* Fold X & (X ^ Y) as X & ~Y. */
10128 if (TREE_CODE (arg1
) == BIT_XOR_EXPR
10129 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10131 tem
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 1));
10132 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
10133 fold_convert_loc (loc
, type
, arg0
),
10134 fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, tem
));
10136 /* Fold X & (Y ^ X) as ~Y & X. */
10137 if (TREE_CODE (arg1
) == BIT_XOR_EXPR
10138 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 1), 0)
10139 && reorder_operands_p (arg0
, TREE_OPERAND (arg1
, 0)))
10141 tem
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 0));
10142 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
10143 fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, tem
),
10144 fold_convert_loc (loc
, type
, arg0
));
10147 /* Fold (X * Y) & -(1 << CST) to X * Y if Y is a constant
10148 multiple of 1 << CST. */
10149 if (TREE_CODE (arg1
) == INTEGER_CST
)
10151 wide_int cst1
= arg1
;
10152 wide_int ncst1
= -cst1
;
10153 if ((cst1
& ncst1
) == ncst1
10154 && multiple_of_p (type
, arg0
,
10155 wide_int_to_tree (TREE_TYPE (arg1
), ncst1
)))
10156 return fold_convert_loc (loc
, type
, arg0
);
10159 /* Fold (X * CST1) & CST2 to zero if we can, or drop known zero
10161 if (TREE_CODE (arg1
) == INTEGER_CST
10162 && TREE_CODE (arg0
) == MULT_EXPR
10163 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
10165 wide_int warg1
= arg1
;
10166 wide_int masked
= mask_with_tz (type
, warg1
, TREE_OPERAND (arg0
, 1));
10169 return omit_two_operands_loc (loc
, type
, build_zero_cst (type
),
10171 else if (masked
!= warg1
)
10173 /* Avoid the transform if arg1 is a mask of some
10174 mode which allows further optimizations. */
10175 int pop
= wi::popcount (warg1
);
10176 if (!(pop
>= BITS_PER_UNIT
10177 && exact_log2 (pop
) != -1
10178 && wi::mask (pop
, false, warg1
.get_precision ()) == warg1
))
10179 return fold_build2_loc (loc
, code
, type
, op0
,
10180 wide_int_to_tree (type
, masked
));
10184 /* For constants M and N, if M == (1LL << cst) - 1 && (N & M) == M,
10185 ((A & N) + B) & M -> (A + B) & M
10186 Similarly if (N & M) == 0,
10187 ((A | N) + B) & M -> (A + B) & M
10188 and for - instead of + (or unary - instead of +)
10189 and/or ^ instead of |.
10190 If B is constant and (B & M) == 0, fold into A & M. */
10191 if (TREE_CODE (arg1
) == INTEGER_CST
)
10193 wide_int cst1
= arg1
;
10194 if ((~cst1
!= 0) && (cst1
& (cst1
+ 1)) == 0
10195 && INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
10196 && (TREE_CODE (arg0
) == PLUS_EXPR
10197 || TREE_CODE (arg0
) == MINUS_EXPR
10198 || TREE_CODE (arg0
) == NEGATE_EXPR
)
10199 && (TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg0
))
10200 || TREE_CODE (TREE_TYPE (arg0
)) == INTEGER_TYPE
))
10206 /* Now we know that arg0 is (C + D) or (C - D) or
10207 -C and arg1 (M) is == (1LL << cst) - 1.
10208 Store C into PMOP[0] and D into PMOP[1]. */
10209 pmop
[0] = TREE_OPERAND (arg0
, 0);
10211 if (TREE_CODE (arg0
) != NEGATE_EXPR
)
10213 pmop
[1] = TREE_OPERAND (arg0
, 1);
10217 if ((wi::max_value (TREE_TYPE (arg0
)) & cst1
) != cst1
)
10220 for (; which
>= 0; which
--)
10221 switch (TREE_CODE (pmop
[which
]))
10226 if (TREE_CODE (TREE_OPERAND (pmop
[which
], 1))
10229 cst0
= TREE_OPERAND (pmop
[which
], 1);
10231 if (TREE_CODE (pmop
[which
]) == BIT_AND_EXPR
)
10236 else if (cst0
!= 0)
10238 /* If C or D is of the form (A & N) where
10239 (N & M) == M, or of the form (A | N) or
10240 (A ^ N) where (N & M) == 0, replace it with A. */
10241 pmop
[which
] = TREE_OPERAND (pmop
[which
], 0);
10244 /* If C or D is a N where (N & M) == 0, it can be
10245 omitted (assumed 0). */
10246 if ((TREE_CODE (arg0
) == PLUS_EXPR
10247 || (TREE_CODE (arg0
) == MINUS_EXPR
&& which
== 0))
10248 && (cst1
& pmop
[which
]) == 0)
10249 pmop
[which
] = NULL
;
10255 /* Only build anything new if we optimized one or both arguments
10257 if (pmop
[0] != TREE_OPERAND (arg0
, 0)
10258 || (TREE_CODE (arg0
) != NEGATE_EXPR
10259 && pmop
[1] != TREE_OPERAND (arg0
, 1)))
10261 tree utype
= TREE_TYPE (arg0
);
10262 if (! TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg0
)))
10264 /* Perform the operations in a type that has defined
10265 overflow behavior. */
10266 utype
= unsigned_type_for (TREE_TYPE (arg0
));
10267 if (pmop
[0] != NULL
)
10268 pmop
[0] = fold_convert_loc (loc
, utype
, pmop
[0]);
10269 if (pmop
[1] != NULL
)
10270 pmop
[1] = fold_convert_loc (loc
, utype
, pmop
[1]);
10273 if (TREE_CODE (arg0
) == NEGATE_EXPR
)
10274 tem
= fold_build1_loc (loc
, NEGATE_EXPR
, utype
, pmop
[0]);
10275 else if (TREE_CODE (arg0
) == PLUS_EXPR
)
10277 if (pmop
[0] != NULL
&& pmop
[1] != NULL
)
10278 tem
= fold_build2_loc (loc
, PLUS_EXPR
, utype
,
10280 else if (pmop
[0] != NULL
)
10282 else if (pmop
[1] != NULL
)
10285 return build_int_cst (type
, 0);
10287 else if (pmop
[0] == NULL
)
10288 tem
= fold_build1_loc (loc
, NEGATE_EXPR
, utype
, pmop
[1]);
10290 tem
= fold_build2_loc (loc
, MINUS_EXPR
, utype
,
10292 /* TEM is now the new binary +, - or unary - replacement. */
10293 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, utype
, tem
,
10294 fold_convert_loc (loc
, utype
, arg1
));
10295 return fold_convert_loc (loc
, type
, tem
);
10300 /* Simplify ((int)c & 0377) into (int)c, if c is unsigned char. */
10301 if (TREE_CODE (arg1
) == INTEGER_CST
&& TREE_CODE (arg0
) == NOP_EXPR
10302 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (arg0
, 0))))
10304 prec
= element_precision (TREE_TYPE (TREE_OPERAND (arg0
, 0)));
10306 wide_int mask
= wide_int::from (arg1
, prec
, UNSIGNED
);
10309 fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10315 /* Don't touch a floating-point divide by zero unless the mode
10316 of the constant can represent infinity. */
10317 if (TREE_CODE (arg1
) == REAL_CST
10318 && !MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (arg1
)))
10319 && real_zerop (arg1
))
10322 /* (-A) / (-B) -> A / B */
10323 if (TREE_CODE (arg0
) == NEGATE_EXPR
&& negate_expr_p (arg1
))
10324 return fold_build2_loc (loc
, RDIV_EXPR
, type
,
10325 TREE_OPERAND (arg0
, 0),
10326 negate_expr (arg1
));
10327 if (TREE_CODE (arg1
) == NEGATE_EXPR
&& negate_expr_p (arg0
))
10328 return fold_build2_loc (loc
, RDIV_EXPR
, type
,
10329 negate_expr (arg0
),
10330 TREE_OPERAND (arg1
, 0));
10333 case TRUNC_DIV_EXPR
:
10336 case FLOOR_DIV_EXPR
:
10337 /* Simplify A / (B << N) where A and B are positive and B is
10338 a power of 2, to A >> (N + log2(B)). */
10339 strict_overflow_p
= false;
10340 if (TREE_CODE (arg1
) == LSHIFT_EXPR
10341 && (TYPE_UNSIGNED (type
)
10342 || tree_expr_nonnegative_warnv_p (op0
, &strict_overflow_p
)))
10344 tree sval
= TREE_OPERAND (arg1
, 0);
10345 if (integer_pow2p (sval
) && tree_int_cst_sgn (sval
) > 0)
10347 tree sh_cnt
= TREE_OPERAND (arg1
, 1);
10348 tree pow2
= build_int_cst (TREE_TYPE (sh_cnt
),
10349 wi::exact_log2 (sval
));
10351 if (strict_overflow_p
)
10352 fold_overflow_warning (("assuming signed overflow does not "
10353 "occur when simplifying A / (B << N)"),
10354 WARN_STRICT_OVERFLOW_MISC
);
10356 sh_cnt
= fold_build2_loc (loc
, PLUS_EXPR
, TREE_TYPE (sh_cnt
),
10358 return fold_build2_loc (loc
, RSHIFT_EXPR
, type
,
10359 fold_convert_loc (loc
, type
, arg0
), sh_cnt
);
10365 case ROUND_DIV_EXPR
:
10366 case CEIL_DIV_EXPR
:
10367 case EXACT_DIV_EXPR
:
10368 if (integer_zerop (arg1
))
10371 /* Convert -A / -B to A / B when the type is signed and overflow is
10373 if ((!INTEGRAL_TYPE_P (type
) || TYPE_OVERFLOW_UNDEFINED (type
))
10374 && TREE_CODE (arg0
) == NEGATE_EXPR
10375 && negate_expr_p (op1
))
10377 if (INTEGRAL_TYPE_P (type
))
10378 fold_overflow_warning (("assuming signed overflow does not occur "
10379 "when distributing negation across "
10381 WARN_STRICT_OVERFLOW_MISC
);
10382 return fold_build2_loc (loc
, code
, type
,
10383 fold_convert_loc (loc
, type
,
10384 TREE_OPERAND (arg0
, 0)),
10385 negate_expr (op1
));
10387 if ((!INTEGRAL_TYPE_P (type
) || TYPE_OVERFLOW_UNDEFINED (type
))
10388 && TREE_CODE (arg1
) == NEGATE_EXPR
10389 && negate_expr_p (op0
))
10391 if (INTEGRAL_TYPE_P (type
))
10392 fold_overflow_warning (("assuming signed overflow does not occur "
10393 "when distributing negation across "
10395 WARN_STRICT_OVERFLOW_MISC
);
10396 return fold_build2_loc (loc
, code
, type
,
10398 fold_convert_loc (loc
, type
,
10399 TREE_OPERAND (arg1
, 0)));
10402 /* If arg0 is a multiple of arg1, then rewrite to the fastest div
10403 operation, EXACT_DIV_EXPR.
10405 Note that only CEIL_DIV_EXPR and FLOOR_DIV_EXPR are rewritten now.
10406 At one time others generated faster code, it's not clear if they do
10407 after the last round to changes to the DIV code in expmed.c. */
10408 if ((code
== CEIL_DIV_EXPR
|| code
== FLOOR_DIV_EXPR
)
10409 && multiple_of_p (type
, arg0
, arg1
))
10410 return fold_build2_loc (loc
, EXACT_DIV_EXPR
, type
,
10411 fold_convert (type
, arg0
),
10412 fold_convert (type
, arg1
));
10414 strict_overflow_p
= false;
10415 if (TREE_CODE (arg1
) == INTEGER_CST
10416 && 0 != (tem
= extract_muldiv (op0
, arg1
, code
, NULL_TREE
,
10417 &strict_overflow_p
)))
10419 if (strict_overflow_p
)
10420 fold_overflow_warning (("assuming signed overflow does not occur "
10421 "when simplifying division"),
10422 WARN_STRICT_OVERFLOW_MISC
);
10423 return fold_convert_loc (loc
, type
, tem
);
10428 case CEIL_MOD_EXPR
:
10429 case FLOOR_MOD_EXPR
:
10430 case ROUND_MOD_EXPR
:
10431 case TRUNC_MOD_EXPR
:
10432 strict_overflow_p
= false;
10433 if (TREE_CODE (arg1
) == INTEGER_CST
10434 && 0 != (tem
= extract_muldiv (op0
, arg1
, code
, NULL_TREE
,
10435 &strict_overflow_p
)))
10437 if (strict_overflow_p
)
10438 fold_overflow_warning (("assuming signed overflow does not occur "
10439 "when simplifying modulus"),
10440 WARN_STRICT_OVERFLOW_MISC
);
10441 return fold_convert_loc (loc
, type
, tem
);
10450 /* Since negative shift count is not well-defined,
10451 don't try to compute it in the compiler. */
10452 if (TREE_CODE (arg1
) == INTEGER_CST
&& tree_int_cst_sgn (arg1
) < 0)
10455 prec
= element_precision (type
);
10457 /* If we have a rotate of a bit operation with the rotate count and
10458 the second operand of the bit operation both constant,
10459 permute the two operations. */
10460 if (code
== RROTATE_EXPR
&& TREE_CODE (arg1
) == INTEGER_CST
10461 && (TREE_CODE (arg0
) == BIT_AND_EXPR
10462 || TREE_CODE (arg0
) == BIT_IOR_EXPR
10463 || TREE_CODE (arg0
) == BIT_XOR_EXPR
)
10464 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
10465 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
,
10466 fold_build2_loc (loc
, code
, type
,
10467 TREE_OPERAND (arg0
, 0), arg1
),
10468 fold_build2_loc (loc
, code
, type
,
10469 TREE_OPERAND (arg0
, 1), arg1
));
10471 /* Two consecutive rotates adding up to the some integer
10472 multiple of the precision of the type can be ignored. */
10473 if (code
== RROTATE_EXPR
&& TREE_CODE (arg1
) == INTEGER_CST
10474 && TREE_CODE (arg0
) == RROTATE_EXPR
10475 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
10476 && wi::umod_trunc (wi::add (arg1
, TREE_OPERAND (arg0
, 1)),
10478 return TREE_OPERAND (arg0
, 0);
10486 case TRUTH_ANDIF_EXPR
:
10487 /* Note that the operands of this must be ints
10488 and their values must be 0 or 1.
10489 ("true" is a fixed value perhaps depending on the language.) */
10490 /* If first arg is constant zero, return it. */
10491 if (integer_zerop (arg0
))
10492 return fold_convert_loc (loc
, type
, arg0
);
10493 case TRUTH_AND_EXPR
:
10494 /* If either arg is constant true, drop it. */
10495 if (TREE_CODE (arg0
) == INTEGER_CST
&& ! integer_zerop (arg0
))
10496 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg1
));
10497 if (TREE_CODE (arg1
) == INTEGER_CST
&& ! integer_zerop (arg1
)
10498 /* Preserve sequence points. */
10499 && (code
!= TRUTH_ANDIF_EXPR
|| ! TREE_SIDE_EFFECTS (arg0
)))
10500 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
10501 /* If second arg is constant zero, result is zero, but first arg
10502 must be evaluated. */
10503 if (integer_zerop (arg1
))
10504 return omit_one_operand_loc (loc
, type
, arg1
, arg0
);
10505 /* Likewise for first arg, but note that only the TRUTH_AND_EXPR
10506 case will be handled here. */
10507 if (integer_zerop (arg0
))
10508 return omit_one_operand_loc (loc
, type
, arg0
, arg1
);
10510 /* !X && X is always false. */
10511 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
10512 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
10513 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg1
);
10514 /* X && !X is always false. */
10515 if (TREE_CODE (arg1
) == TRUTH_NOT_EXPR
10516 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10517 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
10519 /* A < X && A + 1 > Y ==> A < X && A >= Y. Normally A + 1 > Y
10520 means A >= Y && A != MAX, but in this case we know that
10523 if (!TREE_SIDE_EFFECTS (arg0
)
10524 && !TREE_SIDE_EFFECTS (arg1
))
10526 tem
= fold_to_nonsharp_ineq_using_bound (loc
, arg0
, arg1
);
10527 if (tem
&& !operand_equal_p (tem
, arg0
, 0))
10528 return fold_build2_loc (loc
, code
, type
, tem
, arg1
);
10530 tem
= fold_to_nonsharp_ineq_using_bound (loc
, arg1
, arg0
);
10531 if (tem
&& !operand_equal_p (tem
, arg1
, 0))
10532 return fold_build2_loc (loc
, code
, type
, arg0
, tem
);
10535 if ((tem
= fold_truth_andor (loc
, code
, type
, arg0
, arg1
, op0
, op1
))
10541 case TRUTH_ORIF_EXPR
:
10542 /* Note that the operands of this must be ints
10543 and their values must be 0 or true.
10544 ("true" is a fixed value perhaps depending on the language.) */
10545 /* If first arg is constant true, return it. */
10546 if (TREE_CODE (arg0
) == INTEGER_CST
&& ! integer_zerop (arg0
))
10547 return fold_convert_loc (loc
, type
, arg0
);
10548 case TRUTH_OR_EXPR
:
10549 /* If either arg is constant zero, drop it. */
10550 if (TREE_CODE (arg0
) == INTEGER_CST
&& integer_zerop (arg0
))
10551 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg1
));
10552 if (TREE_CODE (arg1
) == INTEGER_CST
&& integer_zerop (arg1
)
10553 /* Preserve sequence points. */
10554 && (code
!= TRUTH_ORIF_EXPR
|| ! TREE_SIDE_EFFECTS (arg0
)))
10555 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
10556 /* If second arg is constant true, result is true, but we must
10557 evaluate first arg. */
10558 if (TREE_CODE (arg1
) == INTEGER_CST
&& ! integer_zerop (arg1
))
10559 return omit_one_operand_loc (loc
, type
, arg1
, arg0
);
10560 /* Likewise for first arg, but note this only occurs here for
10562 if (TREE_CODE (arg0
) == INTEGER_CST
&& ! integer_zerop (arg0
))
10563 return omit_one_operand_loc (loc
, type
, arg0
, arg1
);
10565 /* !X || X is always true. */
10566 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
10567 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
10568 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg1
);
10569 /* X || !X is always true. */
10570 if (TREE_CODE (arg1
) == TRUTH_NOT_EXPR
10571 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10572 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
10574 /* (X && !Y) || (!X && Y) is X ^ Y */
10575 if (TREE_CODE (arg0
) == TRUTH_AND_EXPR
10576 && TREE_CODE (arg1
) == TRUTH_AND_EXPR
)
10578 tree a0
, a1
, l0
, l1
, n0
, n1
;
10580 a0
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 0));
10581 a1
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 1));
10583 l0
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10584 l1
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 1));
10586 n0
= fold_build1_loc (loc
, TRUTH_NOT_EXPR
, type
, l0
);
10587 n1
= fold_build1_loc (loc
, TRUTH_NOT_EXPR
, type
, l1
);
10589 if ((operand_equal_p (n0
, a0
, 0)
10590 && operand_equal_p (n1
, a1
, 0))
10591 || (operand_equal_p (n0
, a1
, 0)
10592 && operand_equal_p (n1
, a0
, 0)))
10593 return fold_build2_loc (loc
, TRUTH_XOR_EXPR
, type
, l0
, n1
);
10596 if ((tem
= fold_truth_andor (loc
, code
, type
, arg0
, arg1
, op0
, op1
))
10602 case TRUTH_XOR_EXPR
:
10603 /* If the second arg is constant zero, drop it. */
10604 if (integer_zerop (arg1
))
10605 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
10606 /* If the second arg is constant true, this is a logical inversion. */
10607 if (integer_onep (arg1
))
10609 tem
= invert_truthvalue_loc (loc
, arg0
);
10610 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, tem
));
10612 /* Identical arguments cancel to zero. */
10613 if (operand_equal_p (arg0
, arg1
, 0))
10614 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
10616 /* !X ^ X is always true. */
10617 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
10618 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
10619 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg1
);
10621 /* X ^ !X is always true. */
10622 if (TREE_CODE (arg1
) == TRUTH_NOT_EXPR
10623 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10624 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
10633 tem
= fold_comparison (loc
, code
, type
, op0
, op1
);
10634 if (tem
!= NULL_TREE
)
10637 /* bool_var != 1 becomes !bool_var. */
10638 if (TREE_CODE (TREE_TYPE (arg0
)) == BOOLEAN_TYPE
&& integer_onep (arg1
)
10639 && code
== NE_EXPR
)
10640 return fold_convert_loc (loc
, type
,
10641 fold_build1_loc (loc
, TRUTH_NOT_EXPR
,
10642 TREE_TYPE (arg0
), arg0
));
10644 /* bool_var == 0 becomes !bool_var. */
10645 if (TREE_CODE (TREE_TYPE (arg0
)) == BOOLEAN_TYPE
&& integer_zerop (arg1
)
10646 && code
== EQ_EXPR
)
10647 return fold_convert_loc (loc
, type
,
10648 fold_build1_loc (loc
, TRUTH_NOT_EXPR
,
10649 TREE_TYPE (arg0
), arg0
));
10651 /* !exp != 0 becomes !exp */
10652 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
&& integer_zerop (arg1
)
10653 && code
== NE_EXPR
)
10654 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
10656 /* Transform comparisons of the form X +- Y CMP X to Y CMP 0. */
10657 if ((TREE_CODE (arg0
) == PLUS_EXPR
10658 || TREE_CODE (arg0
) == POINTER_PLUS_EXPR
10659 || TREE_CODE (arg0
) == MINUS_EXPR
)
10660 && operand_equal_p (tree_strip_nop_conversions (TREE_OPERAND (arg0
,
10663 && (INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
10664 || POINTER_TYPE_P (TREE_TYPE (arg0
))))
10666 tree val
= TREE_OPERAND (arg0
, 1);
10667 val
= fold_build2_loc (loc
, code
, type
, val
,
10668 build_int_cst (TREE_TYPE (val
), 0));
10669 return omit_two_operands_loc (loc
, type
, val
,
10670 TREE_OPERAND (arg0
, 0), arg1
);
10673 /* Transform comparisons of the form X CMP X +- Y to Y CMP 0. */
10674 if ((TREE_CODE (arg1
) == PLUS_EXPR
10675 || TREE_CODE (arg1
) == POINTER_PLUS_EXPR
10676 || TREE_CODE (arg1
) == MINUS_EXPR
)
10677 && operand_equal_p (tree_strip_nop_conversions (TREE_OPERAND (arg1
,
10680 && (INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
10681 || POINTER_TYPE_P (TREE_TYPE (arg1
))))
10683 tree val
= TREE_OPERAND (arg1
, 1);
10684 val
= fold_build2_loc (loc
, code
, type
, val
,
10685 build_int_cst (TREE_TYPE (val
), 0));
10686 return omit_two_operands_loc (loc
, type
, val
,
10687 TREE_OPERAND (arg1
, 0), arg0
);
10690 /* Transform comparisons of the form C - X CMP X if C % 2 == 1. */
10691 if (TREE_CODE (arg0
) == MINUS_EXPR
10692 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == INTEGER_CST
10693 && operand_equal_p (tree_strip_nop_conversions (TREE_OPERAND (arg0
,
10696 && wi::extract_uhwi (TREE_OPERAND (arg0
, 0), 0, 1) == 1)
10697 return omit_two_operands_loc (loc
, type
,
10699 ? boolean_true_node
: boolean_false_node
,
10700 TREE_OPERAND (arg0
, 1), arg1
);
10702 /* Transform comparisons of the form X CMP C - X if C % 2 == 1. */
10703 if (TREE_CODE (arg1
) == MINUS_EXPR
10704 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == INTEGER_CST
10705 && operand_equal_p (tree_strip_nop_conversions (TREE_OPERAND (arg1
,
10708 && wi::extract_uhwi (TREE_OPERAND (arg1
, 0), 0, 1) == 1)
10709 return omit_two_operands_loc (loc
, type
,
10711 ? boolean_true_node
: boolean_false_node
,
10712 TREE_OPERAND (arg1
, 1), arg0
);
10714 /* If this is an EQ or NE comparison with zero and ARG0 is
10715 (1 << foo) & bar, convert it to (bar >> foo) & 1. Both require
10716 two operations, but the latter can be done in one less insn
10717 on machines that have only two-operand insns or on which a
10718 constant cannot be the first operand. */
10719 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10720 && integer_zerop (arg1
))
10722 tree arg00
= TREE_OPERAND (arg0
, 0);
10723 tree arg01
= TREE_OPERAND (arg0
, 1);
10724 if (TREE_CODE (arg00
) == LSHIFT_EXPR
10725 && integer_onep (TREE_OPERAND (arg00
, 0)))
10727 tree tem
= fold_build2_loc (loc
, RSHIFT_EXPR
, TREE_TYPE (arg00
),
10728 arg01
, TREE_OPERAND (arg00
, 1));
10729 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg0
), tem
,
10730 build_int_cst (TREE_TYPE (arg0
), 1));
10731 return fold_build2_loc (loc
, code
, type
,
10732 fold_convert_loc (loc
, TREE_TYPE (arg1
), tem
),
10735 else if (TREE_CODE (arg01
) == LSHIFT_EXPR
10736 && integer_onep (TREE_OPERAND (arg01
, 0)))
10738 tree tem
= fold_build2_loc (loc
, RSHIFT_EXPR
, TREE_TYPE (arg01
),
10739 arg00
, TREE_OPERAND (arg01
, 1));
10740 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg0
), tem
,
10741 build_int_cst (TREE_TYPE (arg0
), 1));
10742 return fold_build2_loc (loc
, code
, type
,
10743 fold_convert_loc (loc
, TREE_TYPE (arg1
), tem
),
10748 /* If this is an NE or EQ comparison of zero against the result of a
10749 signed MOD operation whose second operand is a power of 2, make
10750 the MOD operation unsigned since it is simpler and equivalent. */
10751 if (integer_zerop (arg1
)
10752 && !TYPE_UNSIGNED (TREE_TYPE (arg0
))
10753 && (TREE_CODE (arg0
) == TRUNC_MOD_EXPR
10754 || TREE_CODE (arg0
) == CEIL_MOD_EXPR
10755 || TREE_CODE (arg0
) == FLOOR_MOD_EXPR
10756 || TREE_CODE (arg0
) == ROUND_MOD_EXPR
)
10757 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
10759 tree newtype
= unsigned_type_for (TREE_TYPE (arg0
));
10760 tree newmod
= fold_build2_loc (loc
, TREE_CODE (arg0
), newtype
,
10761 fold_convert_loc (loc
, newtype
,
10762 TREE_OPERAND (arg0
, 0)),
10763 fold_convert_loc (loc
, newtype
,
10764 TREE_OPERAND (arg0
, 1)));
10766 return fold_build2_loc (loc
, code
, type
, newmod
,
10767 fold_convert_loc (loc
, newtype
, arg1
));
10770 /* Fold ((X >> C1) & C2) == 0 and ((X >> C1) & C2) != 0 where
10771 C1 is a valid shift constant, and C2 is a power of two, i.e.
10773 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10774 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == RSHIFT_EXPR
10775 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1))
10777 && integer_pow2p (TREE_OPERAND (arg0
, 1))
10778 && integer_zerop (arg1
))
10780 tree itype
= TREE_TYPE (arg0
);
10781 tree arg001
= TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1);
10782 prec
= TYPE_PRECISION (itype
);
10784 /* Check for a valid shift count. */
10785 if (wi::ltu_p (arg001
, prec
))
10787 tree arg01
= TREE_OPERAND (arg0
, 1);
10788 tree arg000
= TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0);
10789 unsigned HOST_WIDE_INT log2
= tree_log2 (arg01
);
10790 /* If (C2 << C1) doesn't overflow, then ((X >> C1) & C2) != 0
10791 can be rewritten as (X & (C2 << C1)) != 0. */
10792 if ((log2
+ TREE_INT_CST_LOW (arg001
)) < prec
)
10794 tem
= fold_build2_loc (loc
, LSHIFT_EXPR
, itype
, arg01
, arg001
);
10795 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, itype
, arg000
, tem
);
10796 return fold_build2_loc (loc
, code
, type
, tem
,
10797 fold_convert_loc (loc
, itype
, arg1
));
10799 /* Otherwise, for signed (arithmetic) shifts,
10800 ((X >> C1) & C2) != 0 is rewritten as X < 0, and
10801 ((X >> C1) & C2) == 0 is rewritten as X >= 0. */
10802 else if (!TYPE_UNSIGNED (itype
))
10803 return fold_build2_loc (loc
, code
== EQ_EXPR
? GE_EXPR
: LT_EXPR
, type
,
10804 arg000
, build_int_cst (itype
, 0));
10805 /* Otherwise, of unsigned (logical) shifts,
10806 ((X >> C1) & C2) != 0 is rewritten as (X,false), and
10807 ((X >> C1) & C2) == 0 is rewritten as (X,true). */
10809 return omit_one_operand_loc (loc
, type
,
10810 code
== EQ_EXPR
? integer_one_node
10811 : integer_zero_node
,
10816 /* If we have (A & C) == D where D & ~C != 0, convert this into 0.
10817 Similarly for NE_EXPR. */
10818 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10819 && TREE_CODE (arg1
) == INTEGER_CST
10820 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
10822 tree notc
= fold_build1_loc (loc
, BIT_NOT_EXPR
,
10823 TREE_TYPE (TREE_OPERAND (arg0
, 1)),
10824 TREE_OPERAND (arg0
, 1));
10826 = fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg0
),
10827 fold_convert_loc (loc
, TREE_TYPE (arg0
), arg1
),
10829 tree rslt
= code
== EQ_EXPR
? integer_zero_node
: integer_one_node
;
10830 if (integer_nonzerop (dandnotc
))
10831 return omit_one_operand_loc (loc
, type
, rslt
, arg0
);
10834 /* If this is a comparison of a field, we may be able to simplify it. */
10835 if ((TREE_CODE (arg0
) == COMPONENT_REF
10836 || TREE_CODE (arg0
) == BIT_FIELD_REF
)
10837 /* Handle the constant case even without -O
10838 to make sure the warnings are given. */
10839 && (optimize
|| TREE_CODE (arg1
) == INTEGER_CST
))
10841 t1
= optimize_bit_field_compare (loc
, code
, type
, arg0
, arg1
);
10846 /* Optimize comparisons of strlen vs zero to a compare of the
10847 first character of the string vs zero. To wit,
10848 strlen(ptr) == 0 => *ptr == 0
10849 strlen(ptr) != 0 => *ptr != 0
10850 Other cases should reduce to one of these two (or a constant)
10851 due to the return value of strlen being unsigned. */
10852 if (TREE_CODE (arg0
) == CALL_EXPR
10853 && integer_zerop (arg1
))
10855 tree fndecl
= get_callee_fndecl (arg0
);
10858 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
10859 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_STRLEN
10860 && call_expr_nargs (arg0
) == 1
10861 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (arg0
, 0))) == POINTER_TYPE
)
10863 tree iref
= build_fold_indirect_ref_loc (loc
,
10864 CALL_EXPR_ARG (arg0
, 0));
10865 return fold_build2_loc (loc
, code
, type
, iref
,
10866 build_int_cst (TREE_TYPE (iref
), 0));
10870 /* Fold (X >> C) != 0 into X < 0 if C is one less than the width
10871 of X. Similarly fold (X >> C) == 0 into X >= 0. */
10872 if (TREE_CODE (arg0
) == RSHIFT_EXPR
10873 && integer_zerop (arg1
)
10874 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
10876 tree arg00
= TREE_OPERAND (arg0
, 0);
10877 tree arg01
= TREE_OPERAND (arg0
, 1);
10878 tree itype
= TREE_TYPE (arg00
);
10879 if (wi::eq_p (arg01
, element_precision (itype
) - 1))
10881 if (TYPE_UNSIGNED (itype
))
10883 itype
= signed_type_for (itype
);
10884 arg00
= fold_convert_loc (loc
, itype
, arg00
);
10886 return fold_build2_loc (loc
, code
== EQ_EXPR
? GE_EXPR
: LT_EXPR
,
10887 type
, arg00
, build_zero_cst (itype
));
10891 /* Fold (~X & C) == 0 into (X & C) != 0 and (~X & C) != 0 into
10892 (X & C) == 0 when C is a single bit. */
10893 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10894 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_NOT_EXPR
10895 && integer_zerop (arg1
)
10896 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
10898 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg0
),
10899 TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0),
10900 TREE_OPERAND (arg0
, 1));
10901 return fold_build2_loc (loc
, code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
,
10903 fold_convert_loc (loc
, TREE_TYPE (arg0
),
10907 /* Fold ((X & C) ^ C) eq/ne 0 into (X & C) ne/eq 0, when the
10908 constant C is a power of two, i.e. a single bit. */
10909 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
10910 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_AND_EXPR
10911 && integer_zerop (arg1
)
10912 && integer_pow2p (TREE_OPERAND (arg0
, 1))
10913 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1),
10914 TREE_OPERAND (arg0
, 1), OEP_ONLY_CONST
))
10916 tree arg00
= TREE_OPERAND (arg0
, 0);
10917 return fold_build2_loc (loc
, code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
, type
,
10918 arg00
, build_int_cst (TREE_TYPE (arg00
), 0));
10921 /* Likewise, fold ((X ^ C) & C) eq/ne 0 into (X & C) ne/eq 0,
10922 when is C is a power of two, i.e. a single bit. */
10923 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10924 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_XOR_EXPR
10925 && integer_zerop (arg1
)
10926 && integer_pow2p (TREE_OPERAND (arg0
, 1))
10927 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1),
10928 TREE_OPERAND (arg0
, 1), OEP_ONLY_CONST
))
10930 tree arg000
= TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0);
10931 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg000
),
10932 arg000
, TREE_OPERAND (arg0
, 1));
10933 return fold_build2_loc (loc
, code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
, type
,
10934 tem
, build_int_cst (TREE_TYPE (tem
), 0));
10937 if (integer_zerop (arg1
)
10938 && tree_expr_nonzero_p (arg0
))
10940 tree res
= constant_boolean_node (code
==NE_EXPR
, type
);
10941 return omit_one_operand_loc (loc
, type
, res
, arg0
);
10944 /* Fold (X & C) op (Y & C) as (X ^ Y) & C op 0", and symmetries. */
10945 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10946 && TREE_CODE (arg1
) == BIT_AND_EXPR
)
10948 tree arg00
= TREE_OPERAND (arg0
, 0);
10949 tree arg01
= TREE_OPERAND (arg0
, 1);
10950 tree arg10
= TREE_OPERAND (arg1
, 0);
10951 tree arg11
= TREE_OPERAND (arg1
, 1);
10952 tree itype
= TREE_TYPE (arg0
);
10954 if (operand_equal_p (arg01
, 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 (arg01
, 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
));
10972 if (operand_equal_p (arg00
, arg11
, 0))
10973 return fold_build2_loc (loc
, code
, type
,
10974 fold_build2_loc (loc
, BIT_AND_EXPR
, itype
,
10975 fold_build2_loc (loc
,
10976 BIT_XOR_EXPR
, itype
,
10979 build_zero_cst (itype
));
10981 if (operand_equal_p (arg00
, arg10
, 0))
10982 return fold_build2_loc (loc
, code
, type
,
10983 fold_build2_loc (loc
, BIT_AND_EXPR
, itype
,
10984 fold_build2_loc (loc
,
10985 BIT_XOR_EXPR
, itype
,
10988 build_zero_cst (itype
));
10991 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
10992 && TREE_CODE (arg1
) == BIT_XOR_EXPR
)
10994 tree arg00
= TREE_OPERAND (arg0
, 0);
10995 tree arg01
= TREE_OPERAND (arg0
, 1);
10996 tree arg10
= TREE_OPERAND (arg1
, 0);
10997 tree arg11
= TREE_OPERAND (arg1
, 1);
10998 tree itype
= TREE_TYPE (arg0
);
11000 /* Optimize (X ^ Z) op (Y ^ Z) as X op Y, and symmetries.
11001 operand_equal_p guarantees no side-effects so we don't need
11002 to use omit_one_operand on Z. */
11003 if (operand_equal_p (arg01
, arg11
, 0))
11004 return fold_build2_loc (loc
, code
, type
, arg00
,
11005 fold_convert_loc (loc
, TREE_TYPE (arg00
),
11007 if (operand_equal_p (arg01
, arg10
, 0))
11008 return fold_build2_loc (loc
, code
, type
, arg00
,
11009 fold_convert_loc (loc
, TREE_TYPE (arg00
),
11011 if (operand_equal_p (arg00
, arg11
, 0))
11012 return fold_build2_loc (loc
, code
, type
, arg01
,
11013 fold_convert_loc (loc
, TREE_TYPE (arg01
),
11015 if (operand_equal_p (arg00
, arg10
, 0))
11016 return fold_build2_loc (loc
, code
, type
, arg01
,
11017 fold_convert_loc (loc
, TREE_TYPE (arg01
),
11020 /* Optimize (X ^ C1) op (Y ^ C2) as (X ^ (C1 ^ C2)) op Y. */
11021 if (TREE_CODE (arg01
) == INTEGER_CST
11022 && TREE_CODE (arg11
) == INTEGER_CST
)
11024 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg01
,
11025 fold_convert_loc (loc
, itype
, arg11
));
11026 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg00
, tem
);
11027 return fold_build2_loc (loc
, code
, type
, tem
,
11028 fold_convert_loc (loc
, itype
, arg10
));
11032 /* Attempt to simplify equality/inequality comparisons of complex
11033 values. Only lower the comparison if the result is known or
11034 can be simplified to a single scalar comparison. */
11035 if ((TREE_CODE (arg0
) == COMPLEX_EXPR
11036 || TREE_CODE (arg0
) == COMPLEX_CST
)
11037 && (TREE_CODE (arg1
) == COMPLEX_EXPR
11038 || TREE_CODE (arg1
) == COMPLEX_CST
))
11040 tree real0
, imag0
, real1
, imag1
;
11043 if (TREE_CODE (arg0
) == COMPLEX_EXPR
)
11045 real0
= TREE_OPERAND (arg0
, 0);
11046 imag0
= TREE_OPERAND (arg0
, 1);
11050 real0
= TREE_REALPART (arg0
);
11051 imag0
= TREE_IMAGPART (arg0
);
11054 if (TREE_CODE (arg1
) == COMPLEX_EXPR
)
11056 real1
= TREE_OPERAND (arg1
, 0);
11057 imag1
= TREE_OPERAND (arg1
, 1);
11061 real1
= TREE_REALPART (arg1
);
11062 imag1
= TREE_IMAGPART (arg1
);
11065 rcond
= fold_binary_loc (loc
, code
, type
, real0
, real1
);
11066 if (rcond
&& TREE_CODE (rcond
) == INTEGER_CST
)
11068 if (integer_zerop (rcond
))
11070 if (code
== EQ_EXPR
)
11071 return omit_two_operands_loc (loc
, type
, boolean_false_node
,
11073 return fold_build2_loc (loc
, NE_EXPR
, type
, imag0
, imag1
);
11077 if (code
== NE_EXPR
)
11078 return omit_two_operands_loc (loc
, type
, boolean_true_node
,
11080 return fold_build2_loc (loc
, EQ_EXPR
, type
, imag0
, imag1
);
11084 icond
= fold_binary_loc (loc
, code
, type
, imag0
, imag1
);
11085 if (icond
&& TREE_CODE (icond
) == INTEGER_CST
)
11087 if (integer_zerop (icond
))
11089 if (code
== EQ_EXPR
)
11090 return omit_two_operands_loc (loc
, type
, boolean_false_node
,
11092 return fold_build2_loc (loc
, NE_EXPR
, type
, real0
, real1
);
11096 if (code
== NE_EXPR
)
11097 return omit_two_operands_loc (loc
, type
, boolean_true_node
,
11099 return fold_build2_loc (loc
, EQ_EXPR
, type
, real0
, real1
);
11110 tem
= fold_comparison (loc
, code
, type
, op0
, op1
);
11111 if (tem
!= NULL_TREE
)
11114 /* Transform comparisons of the form X +- C CMP X. */
11115 if ((TREE_CODE (arg0
) == PLUS_EXPR
|| TREE_CODE (arg0
) == MINUS_EXPR
)
11116 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0)
11117 && ((TREE_CODE (TREE_OPERAND (arg0
, 1)) == REAL_CST
11118 && !HONOR_SNANS (arg0
))
11119 || (TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
11120 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))))
11122 tree arg01
= TREE_OPERAND (arg0
, 1);
11123 enum tree_code code0
= TREE_CODE (arg0
);
11126 if (TREE_CODE (arg01
) == REAL_CST
)
11127 is_positive
= REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg01
)) ? -1 : 1;
11129 is_positive
= tree_int_cst_sgn (arg01
);
11131 /* (X - c) > X becomes false. */
11132 if (code
== GT_EXPR
11133 && ((code0
== MINUS_EXPR
&& is_positive
>= 0)
11134 || (code0
== PLUS_EXPR
&& is_positive
<= 0)))
11136 if (TREE_CODE (arg01
) == INTEGER_CST
11137 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
11138 fold_overflow_warning (("assuming signed overflow does not "
11139 "occur when assuming that (X - c) > X "
11140 "is always false"),
11141 WARN_STRICT_OVERFLOW_ALL
);
11142 return constant_boolean_node (0, type
);
11145 /* Likewise (X + c) < X becomes false. */
11146 if (code
== LT_EXPR
11147 && ((code0
== PLUS_EXPR
&& is_positive
>= 0)
11148 || (code0
== MINUS_EXPR
&& is_positive
<= 0)))
11150 if (TREE_CODE (arg01
) == INTEGER_CST
11151 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
11152 fold_overflow_warning (("assuming signed overflow does not "
11153 "occur when assuming that "
11154 "(X + c) < X is always false"),
11155 WARN_STRICT_OVERFLOW_ALL
);
11156 return constant_boolean_node (0, type
);
11159 /* Convert (X - c) <= X to true. */
11160 if (!HONOR_NANS (arg1
)
11162 && ((code0
== MINUS_EXPR
&& is_positive
>= 0)
11163 || (code0
== PLUS_EXPR
&& is_positive
<= 0)))
11165 if (TREE_CODE (arg01
) == INTEGER_CST
11166 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
11167 fold_overflow_warning (("assuming signed overflow does not "
11168 "occur when assuming that "
11169 "(X - c) <= X is always true"),
11170 WARN_STRICT_OVERFLOW_ALL
);
11171 return constant_boolean_node (1, type
);
11174 /* Convert (X + c) >= X to true. */
11175 if (!HONOR_NANS (arg1
)
11177 && ((code0
== PLUS_EXPR
&& is_positive
>= 0)
11178 || (code0
== MINUS_EXPR
&& is_positive
<= 0)))
11180 if (TREE_CODE (arg01
) == INTEGER_CST
11181 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
11182 fold_overflow_warning (("assuming signed overflow does not "
11183 "occur when assuming that "
11184 "(X + c) >= X is always true"),
11185 WARN_STRICT_OVERFLOW_ALL
);
11186 return constant_boolean_node (1, type
);
11189 if (TREE_CODE (arg01
) == INTEGER_CST
)
11191 /* Convert X + c > X and X - c < X to true for integers. */
11192 if (code
== GT_EXPR
11193 && ((code0
== PLUS_EXPR
&& is_positive
> 0)
11194 || (code0
== MINUS_EXPR
&& is_positive
< 0)))
11196 if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
11197 fold_overflow_warning (("assuming signed overflow does "
11198 "not occur when assuming that "
11199 "(X + c) > X is always true"),
11200 WARN_STRICT_OVERFLOW_ALL
);
11201 return constant_boolean_node (1, type
);
11204 if (code
== LT_EXPR
11205 && ((code0
== MINUS_EXPR
&& is_positive
> 0)
11206 || (code0
== PLUS_EXPR
&& is_positive
< 0)))
11208 if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
11209 fold_overflow_warning (("assuming signed overflow does "
11210 "not occur when assuming that "
11211 "(X - c) < X is always true"),
11212 WARN_STRICT_OVERFLOW_ALL
);
11213 return constant_boolean_node (1, type
);
11216 /* Convert X + c <= X and X - c >= X to false for integers. */
11217 if (code
== LE_EXPR
11218 && ((code0
== PLUS_EXPR
&& is_positive
> 0)
11219 || (code0
== MINUS_EXPR
&& is_positive
< 0)))
11221 if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
11222 fold_overflow_warning (("assuming signed overflow does "
11223 "not occur when assuming that "
11224 "(X + c) <= X is always false"),
11225 WARN_STRICT_OVERFLOW_ALL
);
11226 return constant_boolean_node (0, type
);
11229 if (code
== GE_EXPR
11230 && ((code0
== MINUS_EXPR
&& is_positive
> 0)
11231 || (code0
== PLUS_EXPR
&& is_positive
< 0)))
11233 if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
11234 fold_overflow_warning (("assuming signed overflow does "
11235 "not occur when assuming that "
11236 "(X - c) >= X is always false"),
11237 WARN_STRICT_OVERFLOW_ALL
);
11238 return constant_boolean_node (0, type
);
11243 /* If we are comparing an ABS_EXPR with a constant, we can
11244 convert all the cases into explicit comparisons, but they may
11245 well not be faster than doing the ABS and one comparison.
11246 But ABS (X) <= C is a range comparison, which becomes a subtraction
11247 and a comparison, and is probably faster. */
11248 if (code
== LE_EXPR
11249 && TREE_CODE (arg1
) == INTEGER_CST
11250 && TREE_CODE (arg0
) == ABS_EXPR
11251 && ! TREE_SIDE_EFFECTS (arg0
)
11252 && (0 != (tem
= negate_expr (arg1
)))
11253 && TREE_CODE (tem
) == INTEGER_CST
11254 && !TREE_OVERFLOW (tem
))
11255 return fold_build2_loc (loc
, TRUTH_ANDIF_EXPR
, type
,
11256 build2 (GE_EXPR
, type
,
11257 TREE_OPERAND (arg0
, 0), tem
),
11258 build2 (LE_EXPR
, type
,
11259 TREE_OPERAND (arg0
, 0), arg1
));
11261 /* Convert ABS_EXPR<x> >= 0 to true. */
11262 strict_overflow_p
= false;
11263 if (code
== GE_EXPR
11264 && (integer_zerop (arg1
)
11265 || (! HONOR_NANS (arg0
)
11266 && real_zerop (arg1
)))
11267 && tree_expr_nonnegative_warnv_p (arg0
, &strict_overflow_p
))
11269 if (strict_overflow_p
)
11270 fold_overflow_warning (("assuming signed overflow does not occur "
11271 "when simplifying comparison of "
11272 "absolute value and zero"),
11273 WARN_STRICT_OVERFLOW_CONDITIONAL
);
11274 return omit_one_operand_loc (loc
, type
,
11275 constant_boolean_node (true, type
),
11279 /* Convert ABS_EXPR<x> < 0 to false. */
11280 strict_overflow_p
= false;
11281 if (code
== LT_EXPR
11282 && (integer_zerop (arg1
) || real_zerop (arg1
))
11283 && tree_expr_nonnegative_warnv_p (arg0
, &strict_overflow_p
))
11285 if (strict_overflow_p
)
11286 fold_overflow_warning (("assuming signed overflow does not occur "
11287 "when simplifying comparison of "
11288 "absolute value and zero"),
11289 WARN_STRICT_OVERFLOW_CONDITIONAL
);
11290 return omit_one_operand_loc (loc
, type
,
11291 constant_boolean_node (false, type
),
11295 /* If X is unsigned, convert X < (1 << Y) into X >> Y == 0
11296 and similarly for >= into !=. */
11297 if ((code
== LT_EXPR
|| code
== GE_EXPR
)
11298 && TYPE_UNSIGNED (TREE_TYPE (arg0
))
11299 && TREE_CODE (arg1
) == LSHIFT_EXPR
11300 && integer_onep (TREE_OPERAND (arg1
, 0)))
11301 return build2_loc (loc
, code
== LT_EXPR
? EQ_EXPR
: NE_EXPR
, type
,
11302 build2 (RSHIFT_EXPR
, TREE_TYPE (arg0
), arg0
,
11303 TREE_OPERAND (arg1
, 1)),
11304 build_zero_cst (TREE_TYPE (arg0
)));
11306 /* Similarly for X < (cast) (1 << Y). But cast can't be narrowing,
11307 otherwise Y might be >= # of bits in X's type and thus e.g.
11308 (unsigned char) (1 << Y) for Y 15 might be 0.
11309 If the cast is widening, then 1 << Y should have unsigned type,
11310 otherwise if Y is number of bits in the signed shift type minus 1,
11311 we can't optimize this. E.g. (unsigned long long) (1 << Y) for Y
11312 31 might be 0xffffffff80000000. */
11313 if ((code
== LT_EXPR
|| code
== GE_EXPR
)
11314 && TYPE_UNSIGNED (TREE_TYPE (arg0
))
11315 && CONVERT_EXPR_P (arg1
)
11316 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == LSHIFT_EXPR
11317 && (element_precision (TREE_TYPE (arg1
))
11318 >= element_precision (TREE_TYPE (TREE_OPERAND (arg1
, 0))))
11319 && (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
11320 || (element_precision (TREE_TYPE (arg1
))
11321 == element_precision (TREE_TYPE (TREE_OPERAND (arg1
, 0)))))
11322 && integer_onep (TREE_OPERAND (TREE_OPERAND (arg1
, 0), 0)))
11324 tem
= build2 (RSHIFT_EXPR
, TREE_TYPE (arg0
), arg0
,
11325 TREE_OPERAND (TREE_OPERAND (arg1
, 0), 1));
11326 return build2_loc (loc
, code
== LT_EXPR
? EQ_EXPR
: NE_EXPR
, type
,
11327 fold_convert_loc (loc
, TREE_TYPE (arg0
), tem
),
11328 build_zero_cst (TREE_TYPE (arg0
)));
11333 case UNORDERED_EXPR
:
11341 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
11343 tree targ0
= strip_float_extensions (arg0
);
11344 tree targ1
= strip_float_extensions (arg1
);
11345 tree newtype
= TREE_TYPE (targ0
);
11347 if (TYPE_PRECISION (TREE_TYPE (targ1
)) > TYPE_PRECISION (newtype
))
11348 newtype
= TREE_TYPE (targ1
);
11350 if (TYPE_PRECISION (newtype
) < TYPE_PRECISION (TREE_TYPE (arg0
)))
11351 return fold_build2_loc (loc
, code
, type
,
11352 fold_convert_loc (loc
, newtype
, targ0
),
11353 fold_convert_loc (loc
, newtype
, targ1
));
11358 case COMPOUND_EXPR
:
11359 /* When pedantic, a compound expression can be neither an lvalue
11360 nor an integer constant expression. */
11361 if (TREE_SIDE_EFFECTS (arg0
) || TREE_CONSTANT (arg1
))
11363 /* Don't let (0, 0) be null pointer constant. */
11364 tem
= integer_zerop (arg1
) ? build1 (NOP_EXPR
, type
, arg1
)
11365 : fold_convert_loc (loc
, type
, arg1
);
11366 return pedantic_non_lvalue_loc (loc
, tem
);
11369 /* An ASSERT_EXPR should never be passed to fold_binary. */
11370 gcc_unreachable ();
11374 } /* switch (code) */
11377 /* Callback for walk_tree, looking for LABEL_EXPR. Return *TP if it is
11378 a LABEL_EXPR; otherwise return NULL_TREE. Do not check the subtrees
11382 contains_label_1 (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
11384 switch (TREE_CODE (*tp
))
11390 *walk_subtrees
= 0;
11392 /* ... fall through ... */
11399 /* Return whether the sub-tree ST contains a label which is accessible from
11400 outside the sub-tree. */
11403 contains_label_p (tree st
)
11406 (walk_tree_without_duplicates (&st
, contains_label_1
, NULL
) != NULL_TREE
);
11409 /* Fold a ternary expression of code CODE and type TYPE with operands
11410 OP0, OP1, and OP2. Return the folded expression if folding is
11411 successful. Otherwise, return NULL_TREE. */
11414 fold_ternary_loc (location_t loc
, enum tree_code code
, tree type
,
11415 tree op0
, tree op1
, tree op2
)
11418 tree arg0
= NULL_TREE
, arg1
= NULL_TREE
, arg2
= NULL_TREE
;
11419 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
11421 gcc_assert (IS_EXPR_CODE_CLASS (kind
)
11422 && TREE_CODE_LENGTH (code
) == 3);
11424 /* If this is a commutative operation, and OP0 is a constant, move it
11425 to OP1 to reduce the number of tests below. */
11426 if (commutative_ternary_tree_code (code
)
11427 && tree_swap_operands_p (op0
, op1
, true))
11428 return fold_build3_loc (loc
, code
, type
, op1
, op0
, op2
);
11430 tem
= generic_simplify (loc
, code
, type
, op0
, op1
, op2
);
11434 /* Strip any conversions that don't change the mode. This is safe
11435 for every expression, except for a comparison expression because
11436 its signedness is derived from its operands. So, in the latter
11437 case, only strip conversions that don't change the signedness.
11439 Note that this is done as an internal manipulation within the
11440 constant folder, in order to find the simplest representation of
11441 the arguments so that their form can be studied. In any cases,
11442 the appropriate type conversions should be put back in the tree
11443 that will get out of the constant folder. */
11464 case COMPONENT_REF
:
11465 if (TREE_CODE (arg0
) == CONSTRUCTOR
11466 && ! type_contains_placeholder_p (TREE_TYPE (arg0
)))
11468 unsigned HOST_WIDE_INT idx
;
11470 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg0
), idx
, field
, value
)
11477 case VEC_COND_EXPR
:
11478 /* Pedantic ANSI C says that a conditional expression is never an lvalue,
11479 so all simple results must be passed through pedantic_non_lvalue. */
11480 if (TREE_CODE (arg0
) == INTEGER_CST
)
11482 tree unused_op
= integer_zerop (arg0
) ? op1
: op2
;
11483 tem
= integer_zerop (arg0
) ? op2
: op1
;
11484 /* Only optimize constant conditions when the selected branch
11485 has the same type as the COND_EXPR. This avoids optimizing
11486 away "c ? x : throw", where the throw has a void type.
11487 Avoid throwing away that operand which contains label. */
11488 if ((!TREE_SIDE_EFFECTS (unused_op
)
11489 || !contains_label_p (unused_op
))
11490 && (! VOID_TYPE_P (TREE_TYPE (tem
))
11491 || VOID_TYPE_P (type
)))
11492 return pedantic_non_lvalue_loc (loc
, tem
);
11495 else if (TREE_CODE (arg0
) == VECTOR_CST
)
11497 if ((TREE_CODE (arg1
) == VECTOR_CST
11498 || TREE_CODE (arg1
) == CONSTRUCTOR
)
11499 && (TREE_CODE (arg2
) == VECTOR_CST
11500 || TREE_CODE (arg2
) == CONSTRUCTOR
))
11502 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (type
), i
;
11503 unsigned char *sel
= XALLOCAVEC (unsigned char, nelts
);
11504 gcc_assert (nelts
== VECTOR_CST_NELTS (arg0
));
11505 for (i
= 0; i
< nelts
; i
++)
11507 tree val
= VECTOR_CST_ELT (arg0
, i
);
11508 if (integer_all_onesp (val
))
11510 else if (integer_zerop (val
))
11511 sel
[i
] = nelts
+ i
;
11512 else /* Currently unreachable. */
11515 tree t
= fold_vec_perm (type
, arg1
, arg2
, sel
);
11516 if (t
!= NULL_TREE
)
11521 /* If we have A op B ? A : C, we may be able to convert this to a
11522 simpler expression, depending on the operation and the values
11523 of B and C. Signed zeros prevent all of these transformations,
11524 for reasons given above each one.
11526 Also try swapping the arguments and inverting the conditional. */
11527 if (COMPARISON_CLASS_P (arg0
)
11528 && operand_equal_for_comparison_p (TREE_OPERAND (arg0
, 0),
11529 arg1
, TREE_OPERAND (arg0
, 1))
11530 && !HONOR_SIGNED_ZEROS (element_mode (arg1
)))
11532 tem
= fold_cond_expr_with_comparison (loc
, type
, arg0
, op1
, op2
);
11537 if (COMPARISON_CLASS_P (arg0
)
11538 && operand_equal_for_comparison_p (TREE_OPERAND (arg0
, 0),
11540 TREE_OPERAND (arg0
, 1))
11541 && !HONOR_SIGNED_ZEROS (element_mode (op2
)))
11543 location_t loc0
= expr_location_or (arg0
, loc
);
11544 tem
= fold_invert_truthvalue (loc0
, arg0
);
11545 if (tem
&& COMPARISON_CLASS_P (tem
))
11547 tem
= fold_cond_expr_with_comparison (loc
, type
, tem
, op2
, op1
);
11553 /* If the second operand is simpler than the third, swap them
11554 since that produces better jump optimization results. */
11555 if (truth_value_p (TREE_CODE (arg0
))
11556 && tree_swap_operands_p (op1
, op2
, false))
11558 location_t loc0
= expr_location_or (arg0
, loc
);
11559 /* See if this can be inverted. If it can't, possibly because
11560 it was a floating-point inequality comparison, don't do
11562 tem
= fold_invert_truthvalue (loc0
, arg0
);
11564 return fold_build3_loc (loc
, code
, type
, tem
, op2
, op1
);
11567 /* Convert A ? 1 : 0 to simply A. */
11568 if ((code
== VEC_COND_EXPR
? integer_all_onesp (op1
)
11569 : (integer_onep (op1
)
11570 && !VECTOR_TYPE_P (type
)))
11571 && integer_zerop (op2
)
11572 /* If we try to convert OP0 to our type, the
11573 call to fold will try to move the conversion inside
11574 a COND, which will recurse. In that case, the COND_EXPR
11575 is probably the best choice, so leave it alone. */
11576 && type
== TREE_TYPE (arg0
))
11577 return pedantic_non_lvalue_loc (loc
, arg0
);
11579 /* Convert A ? 0 : 1 to !A. This prefers the use of NOT_EXPR
11580 over COND_EXPR in cases such as floating point comparisons. */
11581 if (integer_zerop (op1
)
11582 && (code
== VEC_COND_EXPR
? integer_all_onesp (op2
)
11583 : (integer_onep (op2
)
11584 && !VECTOR_TYPE_P (type
)))
11585 && truth_value_p (TREE_CODE (arg0
)))
11586 return pedantic_non_lvalue_loc (loc
,
11587 fold_convert_loc (loc
, type
,
11588 invert_truthvalue_loc (loc
,
11591 /* A < 0 ? <sign bit of A> : 0 is simply (A & <sign bit of A>). */
11592 if (TREE_CODE (arg0
) == LT_EXPR
11593 && integer_zerop (TREE_OPERAND (arg0
, 1))
11594 && integer_zerop (op2
)
11595 && (tem
= sign_bit_p (TREE_OPERAND (arg0
, 0), arg1
)))
11597 /* sign_bit_p looks through both zero and sign extensions,
11598 but for this optimization only sign extensions are
11600 tree tem2
= TREE_OPERAND (arg0
, 0);
11601 while (tem
!= tem2
)
11603 if (TREE_CODE (tem2
) != NOP_EXPR
11604 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (tem2
, 0))))
11609 tem2
= TREE_OPERAND (tem2
, 0);
11611 /* sign_bit_p only checks ARG1 bits within A's precision.
11612 If <sign bit of A> has wider type than A, bits outside
11613 of A's precision in <sign bit of A> need to be checked.
11614 If they are all 0, this optimization needs to be done
11615 in unsigned A's type, if they are all 1 in signed A's type,
11616 otherwise this can't be done. */
11618 && TYPE_PRECISION (TREE_TYPE (tem
))
11619 < TYPE_PRECISION (TREE_TYPE (arg1
))
11620 && TYPE_PRECISION (TREE_TYPE (tem
))
11621 < TYPE_PRECISION (type
))
11623 int inner_width
, outer_width
;
11626 inner_width
= TYPE_PRECISION (TREE_TYPE (tem
));
11627 outer_width
= TYPE_PRECISION (TREE_TYPE (arg1
));
11628 if (outer_width
> TYPE_PRECISION (type
))
11629 outer_width
= TYPE_PRECISION (type
);
11631 wide_int mask
= wi::shifted_mask
11632 (inner_width
, outer_width
- inner_width
, false,
11633 TYPE_PRECISION (TREE_TYPE (arg1
)));
11635 wide_int common
= mask
& arg1
;
11636 if (common
== mask
)
11638 tem_type
= signed_type_for (TREE_TYPE (tem
));
11639 tem
= fold_convert_loc (loc
, tem_type
, tem
);
11641 else if (common
== 0)
11643 tem_type
= unsigned_type_for (TREE_TYPE (tem
));
11644 tem
= fold_convert_loc (loc
, tem_type
, tem
);
11652 fold_convert_loc (loc
, type
,
11653 fold_build2_loc (loc
, BIT_AND_EXPR
,
11654 TREE_TYPE (tem
), tem
,
11655 fold_convert_loc (loc
,
11660 /* (A >> N) & 1 ? (1 << N) : 0 is simply A & (1 << N). A & 1 was
11661 already handled above. */
11662 if (TREE_CODE (arg0
) == BIT_AND_EXPR
11663 && integer_onep (TREE_OPERAND (arg0
, 1))
11664 && integer_zerop (op2
)
11665 && integer_pow2p (arg1
))
11667 tree tem
= TREE_OPERAND (arg0
, 0);
11669 if (TREE_CODE (tem
) == RSHIFT_EXPR
11670 && tree_fits_uhwi_p (TREE_OPERAND (tem
, 1))
11671 && (unsigned HOST_WIDE_INT
) tree_log2 (arg1
) ==
11672 tree_to_uhwi (TREE_OPERAND (tem
, 1)))
11673 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
11674 TREE_OPERAND (tem
, 0), arg1
);
11677 /* A & N ? N : 0 is simply A & N if N is a power of two. This
11678 is probably obsolete because the first operand should be a
11679 truth value (that's why we have the two cases above), but let's
11680 leave it in until we can confirm this for all front-ends. */
11681 if (integer_zerop (op2
)
11682 && TREE_CODE (arg0
) == NE_EXPR
11683 && integer_zerop (TREE_OPERAND (arg0
, 1))
11684 && integer_pow2p (arg1
)
11685 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_AND_EXPR
11686 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1),
11687 arg1
, OEP_ONLY_CONST
))
11688 return pedantic_non_lvalue_loc (loc
,
11689 fold_convert_loc (loc
, type
,
11690 TREE_OPERAND (arg0
, 0)));
11692 /* Disable the transformations below for vectors, since
11693 fold_binary_op_with_conditional_arg may undo them immediately,
11694 yielding an infinite loop. */
11695 if (code
== VEC_COND_EXPR
)
11698 /* Convert A ? B : 0 into A && B if A and B are truth values. */
11699 if (integer_zerop (op2
)
11700 && truth_value_p (TREE_CODE (arg0
))
11701 && truth_value_p (TREE_CODE (arg1
))
11702 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
11703 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
? BIT_AND_EXPR
11704 : TRUTH_ANDIF_EXPR
,
11705 type
, fold_convert_loc (loc
, type
, arg0
), arg1
);
11707 /* Convert A ? B : 1 into !A || B if A and B are truth values. */
11708 if (code
== VEC_COND_EXPR
? integer_all_onesp (op2
) : integer_onep (op2
)
11709 && truth_value_p (TREE_CODE (arg0
))
11710 && truth_value_p (TREE_CODE (arg1
))
11711 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
11713 location_t loc0
= expr_location_or (arg0
, loc
);
11714 /* Only perform transformation if ARG0 is easily inverted. */
11715 tem
= fold_invert_truthvalue (loc0
, arg0
);
11717 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
11720 type
, fold_convert_loc (loc
, type
, tem
),
11724 /* Convert A ? 0 : B into !A && B if A and B are truth values. */
11725 if (integer_zerop (arg1
)
11726 && truth_value_p (TREE_CODE (arg0
))
11727 && truth_value_p (TREE_CODE (op2
))
11728 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
11730 location_t loc0
= expr_location_or (arg0
, loc
);
11731 /* Only perform transformation if ARG0 is easily inverted. */
11732 tem
= fold_invert_truthvalue (loc0
, arg0
);
11734 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
11735 ? BIT_AND_EXPR
: TRUTH_ANDIF_EXPR
,
11736 type
, fold_convert_loc (loc
, type
, tem
),
11740 /* Convert A ? 1 : B into A || B if A and B are truth values. */
11741 if (code
== VEC_COND_EXPR
? integer_all_onesp (arg1
) : integer_onep (arg1
)
11742 && truth_value_p (TREE_CODE (arg0
))
11743 && truth_value_p (TREE_CODE (op2
))
11744 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
11745 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
11746 ? BIT_IOR_EXPR
: TRUTH_ORIF_EXPR
,
11747 type
, fold_convert_loc (loc
, type
, arg0
), op2
);
11752 /* CALL_EXPRs used to be ternary exprs. Catch any mistaken uses
11753 of fold_ternary on them. */
11754 gcc_unreachable ();
11756 case BIT_FIELD_REF
:
11757 if ((TREE_CODE (arg0
) == VECTOR_CST
11758 || (TREE_CODE (arg0
) == CONSTRUCTOR
11759 && TREE_CODE (TREE_TYPE (arg0
)) == VECTOR_TYPE
))
11760 && (type
== TREE_TYPE (TREE_TYPE (arg0
))
11761 || (TREE_CODE (type
) == VECTOR_TYPE
11762 && TREE_TYPE (type
) == TREE_TYPE (TREE_TYPE (arg0
)))))
11764 tree eltype
= TREE_TYPE (TREE_TYPE (arg0
));
11765 unsigned HOST_WIDE_INT width
= tree_to_uhwi (TYPE_SIZE (eltype
));
11766 unsigned HOST_WIDE_INT n
= tree_to_uhwi (arg1
);
11767 unsigned HOST_WIDE_INT idx
= tree_to_uhwi (op2
);
11770 && (idx
% width
) == 0
11771 && (n
% width
) == 0
11772 && ((idx
+ n
) / width
) <= TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0
)))
11777 if (TREE_CODE (arg0
) == VECTOR_CST
)
11780 return VECTOR_CST_ELT (arg0
, idx
);
11782 tree
*vals
= XALLOCAVEC (tree
, n
);
11783 for (unsigned i
= 0; i
< n
; ++i
)
11784 vals
[i
] = VECTOR_CST_ELT (arg0
, idx
+ i
);
11785 return build_vector (type
, vals
);
11788 /* Constructor elements can be subvectors. */
11789 unsigned HOST_WIDE_INT k
= 1;
11790 if (CONSTRUCTOR_NELTS (arg0
) != 0)
11792 tree cons_elem
= TREE_TYPE (CONSTRUCTOR_ELT (arg0
, 0)->value
);
11793 if (TREE_CODE (cons_elem
) == VECTOR_TYPE
)
11794 k
= TYPE_VECTOR_SUBPARTS (cons_elem
);
11797 /* We keep an exact subset of the constructor elements. */
11798 if ((idx
% k
) == 0 && (n
% k
) == 0)
11800 if (CONSTRUCTOR_NELTS (arg0
) == 0)
11801 return build_constructor (type
, NULL
);
11806 if (idx
< CONSTRUCTOR_NELTS (arg0
))
11807 return CONSTRUCTOR_ELT (arg0
, idx
)->value
;
11808 return build_zero_cst (type
);
11811 vec
<constructor_elt
, va_gc
> *vals
;
11812 vec_alloc (vals
, n
);
11813 for (unsigned i
= 0;
11814 i
< n
&& idx
+ i
< CONSTRUCTOR_NELTS (arg0
);
11816 CONSTRUCTOR_APPEND_ELT (vals
, NULL_TREE
,
11818 (arg0
, idx
+ i
)->value
);
11819 return build_constructor (type
, vals
);
11821 /* The bitfield references a single constructor element. */
11822 else if (idx
+ n
<= (idx
/ k
+ 1) * k
)
11824 if (CONSTRUCTOR_NELTS (arg0
) <= idx
/ k
)
11825 return build_zero_cst (type
);
11827 return CONSTRUCTOR_ELT (arg0
, idx
/ k
)->value
;
11829 return fold_build3_loc (loc
, code
, type
,
11830 CONSTRUCTOR_ELT (arg0
, idx
/ k
)->value
, op1
,
11831 build_int_cst (TREE_TYPE (op2
), (idx
% k
) * width
));
11836 /* A bit-field-ref that referenced the full argument can be stripped. */
11837 if (INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
11838 && TYPE_PRECISION (TREE_TYPE (arg0
)) == tree_to_uhwi (arg1
)
11839 && integer_zerop (op2
))
11840 return fold_convert_loc (loc
, type
, arg0
);
11842 /* On constants we can use native encode/interpret to constant
11843 fold (nearly) all BIT_FIELD_REFs. */
11844 if (CONSTANT_CLASS_P (arg0
)
11845 && can_native_interpret_type_p (type
)
11846 && tree_fits_uhwi_p (TYPE_SIZE_UNIT (TREE_TYPE (arg0
)))
11847 /* This limitation should not be necessary, we just need to
11848 round this up to mode size. */
11849 && tree_to_uhwi (op1
) % BITS_PER_UNIT
== 0
11850 /* Need bit-shifting of the buffer to relax the following. */
11851 && tree_to_uhwi (op2
) % BITS_PER_UNIT
== 0)
11853 unsigned HOST_WIDE_INT bitpos
= tree_to_uhwi (op2
);
11854 unsigned HOST_WIDE_INT bitsize
= tree_to_uhwi (op1
);
11855 unsigned HOST_WIDE_INT clen
;
11856 clen
= tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (arg0
)));
11857 /* ??? We cannot tell native_encode_expr to start at
11858 some random byte only. So limit us to a reasonable amount
11862 unsigned char *b
= XALLOCAVEC (unsigned char, clen
);
11863 unsigned HOST_WIDE_INT len
= native_encode_expr (arg0
, b
, clen
);
11865 && len
* BITS_PER_UNIT
>= bitpos
+ bitsize
)
11867 tree v
= native_interpret_expr (type
,
11868 b
+ bitpos
/ BITS_PER_UNIT
,
11869 bitsize
/ BITS_PER_UNIT
);
11879 /* For integers we can decompose the FMA if possible. */
11880 if (TREE_CODE (arg0
) == INTEGER_CST
11881 && TREE_CODE (arg1
) == INTEGER_CST
)
11882 return fold_build2_loc (loc
, PLUS_EXPR
, type
,
11883 const_binop (MULT_EXPR
, arg0
, arg1
), arg2
);
11884 if (integer_zerop (arg2
))
11885 return fold_build2_loc (loc
, MULT_EXPR
, type
, arg0
, arg1
);
11887 return fold_fma (loc
, type
, arg0
, arg1
, arg2
);
11889 case VEC_PERM_EXPR
:
11890 if (TREE_CODE (arg2
) == VECTOR_CST
)
11892 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (type
), i
, mask
, mask2
;
11893 unsigned char *sel
= XALLOCAVEC (unsigned char, 2 * nelts
);
11894 unsigned char *sel2
= sel
+ nelts
;
11895 bool need_mask_canon
= false;
11896 bool need_mask_canon2
= false;
11897 bool all_in_vec0
= true;
11898 bool all_in_vec1
= true;
11899 bool maybe_identity
= true;
11900 bool single_arg
= (op0
== op1
);
11901 bool changed
= false;
11903 mask2
= 2 * nelts
- 1;
11904 mask
= single_arg
? (nelts
- 1) : mask2
;
11905 gcc_assert (nelts
== VECTOR_CST_NELTS (arg2
));
11906 for (i
= 0; i
< nelts
; i
++)
11908 tree val
= VECTOR_CST_ELT (arg2
, i
);
11909 if (TREE_CODE (val
) != INTEGER_CST
)
11912 /* Make sure that the perm value is in an acceptable
11915 need_mask_canon
|= wi::gtu_p (t
, mask
);
11916 need_mask_canon2
|= wi::gtu_p (t
, mask2
);
11917 sel
[i
] = t
.to_uhwi () & mask
;
11918 sel2
[i
] = t
.to_uhwi () & mask2
;
11920 if (sel
[i
] < nelts
)
11921 all_in_vec1
= false;
11923 all_in_vec0
= false;
11925 if ((sel
[i
] & (nelts
-1)) != i
)
11926 maybe_identity
= false;
11929 if (maybe_identity
)
11939 else if (all_in_vec1
)
11942 for (i
= 0; i
< nelts
; i
++)
11944 need_mask_canon
= true;
11947 if ((TREE_CODE (op0
) == VECTOR_CST
11948 || TREE_CODE (op0
) == CONSTRUCTOR
)
11949 && (TREE_CODE (op1
) == VECTOR_CST
11950 || TREE_CODE (op1
) == CONSTRUCTOR
))
11952 tree t
= fold_vec_perm (type
, op0
, op1
, sel
);
11953 if (t
!= NULL_TREE
)
11957 if (op0
== op1
&& !single_arg
)
11960 /* Some targets are deficient and fail to expand a single
11961 argument permutation while still allowing an equivalent
11962 2-argument version. */
11963 if (need_mask_canon
&& arg2
== op2
11964 && !can_vec_perm_p (TYPE_MODE (type
), false, sel
)
11965 && can_vec_perm_p (TYPE_MODE (type
), false, sel2
))
11967 need_mask_canon
= need_mask_canon2
;
11971 if (need_mask_canon
&& arg2
== op2
)
11973 tree
*tsel
= XALLOCAVEC (tree
, nelts
);
11974 tree eltype
= TREE_TYPE (TREE_TYPE (arg2
));
11975 for (i
= 0; i
< nelts
; i
++)
11976 tsel
[i
] = build_int_cst (eltype
, sel
[i
]);
11977 op2
= build_vector (TREE_TYPE (arg2
), tsel
);
11982 return build3_loc (loc
, VEC_PERM_EXPR
, type
, op0
, op1
, op2
);
11988 } /* switch (code) */
11991 /* Gets the element ACCESS_INDEX from CTOR, which must be a CONSTRUCTOR
11992 of an array (or vector). */
11995 get_array_ctor_element_at_index (tree ctor
, offset_int access_index
)
11997 tree index_type
= NULL_TREE
;
11998 offset_int low_bound
= 0;
12000 if (TREE_CODE (TREE_TYPE (ctor
)) == ARRAY_TYPE
)
12002 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ctor
));
12003 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
12005 /* Static constructors for variably sized objects makes no sense. */
12006 gcc_assert (TREE_CODE (TYPE_MIN_VALUE (domain_type
)) == INTEGER_CST
);
12007 index_type
= TREE_TYPE (TYPE_MIN_VALUE (domain_type
));
12008 low_bound
= wi::to_offset (TYPE_MIN_VALUE (domain_type
));
12013 access_index
= wi::ext (access_index
, TYPE_PRECISION (index_type
),
12014 TYPE_SIGN (index_type
));
12016 offset_int index
= low_bound
- 1;
12018 index
= wi::ext (index
, TYPE_PRECISION (index_type
),
12019 TYPE_SIGN (index_type
));
12021 offset_int max_index
;
12022 unsigned HOST_WIDE_INT cnt
;
12025 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor
), cnt
, cfield
, cval
)
12027 /* Array constructor might explicitly set index, or specify a range,
12028 or leave index NULL meaning that it is next index after previous
12032 if (TREE_CODE (cfield
) == INTEGER_CST
)
12033 max_index
= index
= wi::to_offset (cfield
);
12036 gcc_assert (TREE_CODE (cfield
) == RANGE_EXPR
);
12037 index
= wi::to_offset (TREE_OPERAND (cfield
, 0));
12038 max_index
= wi::to_offset (TREE_OPERAND (cfield
, 1));
12045 index
= wi::ext (index
, TYPE_PRECISION (index_type
),
12046 TYPE_SIGN (index_type
));
12050 /* Do we have match? */
12051 if (wi::cmpu (access_index
, index
) >= 0
12052 && wi::cmpu (access_index
, max_index
) <= 0)
12058 /* Perform constant folding and related simplification of EXPR.
12059 The related simplifications include x*1 => x, x*0 => 0, etc.,
12060 and application of the associative law.
12061 NOP_EXPR conversions may be removed freely (as long as we
12062 are careful not to change the type of the overall expression).
12063 We cannot simplify through a CONVERT_EXPR, FIX_EXPR or FLOAT_EXPR,
12064 but we can constant-fold them if they have constant operands. */
12066 #ifdef ENABLE_FOLD_CHECKING
12067 # define fold(x) fold_1 (x)
12068 static tree
fold_1 (tree
);
12074 const tree t
= expr
;
12075 enum tree_code code
= TREE_CODE (t
);
12076 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
12078 location_t loc
= EXPR_LOCATION (expr
);
12080 /* Return right away if a constant. */
12081 if (kind
== tcc_constant
)
12084 /* CALL_EXPR-like objects with variable numbers of operands are
12085 treated specially. */
12086 if (kind
== tcc_vl_exp
)
12088 if (code
== CALL_EXPR
)
12090 tem
= fold_call_expr (loc
, expr
, false);
12091 return tem
? tem
: expr
;
12096 if (IS_EXPR_CODE_CLASS (kind
))
12098 tree type
= TREE_TYPE (t
);
12099 tree op0
, op1
, op2
;
12101 switch (TREE_CODE_LENGTH (code
))
12104 op0
= TREE_OPERAND (t
, 0);
12105 tem
= fold_unary_loc (loc
, code
, type
, op0
);
12106 return tem
? tem
: expr
;
12108 op0
= TREE_OPERAND (t
, 0);
12109 op1
= TREE_OPERAND (t
, 1);
12110 tem
= fold_binary_loc (loc
, code
, type
, op0
, op1
);
12111 return tem
? tem
: expr
;
12113 op0
= TREE_OPERAND (t
, 0);
12114 op1
= TREE_OPERAND (t
, 1);
12115 op2
= TREE_OPERAND (t
, 2);
12116 tem
= fold_ternary_loc (loc
, code
, type
, op0
, op1
, op2
);
12117 return tem
? tem
: expr
;
12127 tree op0
= TREE_OPERAND (t
, 0);
12128 tree op1
= TREE_OPERAND (t
, 1);
12130 if (TREE_CODE (op1
) == INTEGER_CST
12131 && TREE_CODE (op0
) == CONSTRUCTOR
12132 && ! type_contains_placeholder_p (TREE_TYPE (op0
)))
12134 tree val
= get_array_ctor_element_at_index (op0
,
12135 wi::to_offset (op1
));
12143 /* Return a VECTOR_CST if possible. */
12146 tree type
= TREE_TYPE (t
);
12147 if (TREE_CODE (type
) != VECTOR_TYPE
)
12152 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (t
), i
, val
)
12153 if (! CONSTANT_CLASS_P (val
))
12156 return build_vector_from_ctor (type
, CONSTRUCTOR_ELTS (t
));
12160 return fold (DECL_INITIAL (t
));
12164 } /* switch (code) */
12167 #ifdef ENABLE_FOLD_CHECKING
12170 static void fold_checksum_tree (const_tree
, struct md5_ctx
*,
12171 hash_table
<nofree_ptr_hash
<const tree_node
> > *);
12172 static void fold_check_failed (const_tree
, const_tree
);
12173 void print_fold_checksum (const_tree
);
12175 /* When --enable-checking=fold, compute a digest of expr before
12176 and after actual fold call to see if fold did not accidentally
12177 change original expr. */
12183 struct md5_ctx ctx
;
12184 unsigned char checksum_before
[16], checksum_after
[16];
12185 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12187 md5_init_ctx (&ctx
);
12188 fold_checksum_tree (expr
, &ctx
, &ht
);
12189 md5_finish_ctx (&ctx
, checksum_before
);
12192 ret
= fold_1 (expr
);
12194 md5_init_ctx (&ctx
);
12195 fold_checksum_tree (expr
, &ctx
, &ht
);
12196 md5_finish_ctx (&ctx
, checksum_after
);
12198 if (memcmp (checksum_before
, checksum_after
, 16))
12199 fold_check_failed (expr
, ret
);
12205 print_fold_checksum (const_tree expr
)
12207 struct md5_ctx ctx
;
12208 unsigned char checksum
[16], cnt
;
12209 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12211 md5_init_ctx (&ctx
);
12212 fold_checksum_tree (expr
, &ctx
, &ht
);
12213 md5_finish_ctx (&ctx
, checksum
);
12214 for (cnt
= 0; cnt
< 16; ++cnt
)
12215 fprintf (stderr
, "%02x", checksum
[cnt
]);
12216 putc ('\n', stderr
);
12220 fold_check_failed (const_tree expr ATTRIBUTE_UNUSED
, const_tree ret ATTRIBUTE_UNUSED
)
12222 internal_error ("fold check: original tree changed by fold");
12226 fold_checksum_tree (const_tree expr
, struct md5_ctx
*ctx
,
12227 hash_table
<nofree_ptr_hash
<const tree_node
> > *ht
)
12229 const tree_node
**slot
;
12230 enum tree_code code
;
12231 union tree_node buf
;
12237 slot
= ht
->find_slot (expr
, INSERT
);
12241 code
= TREE_CODE (expr
);
12242 if (TREE_CODE_CLASS (code
) == tcc_declaration
12243 && HAS_DECL_ASSEMBLER_NAME_P (expr
))
12245 /* Allow DECL_ASSEMBLER_NAME and symtab_node to be modified. */
12246 memcpy ((char *) &buf
, expr
, tree_size (expr
));
12247 SET_DECL_ASSEMBLER_NAME ((tree
)&buf
, NULL
);
12248 buf
.decl_with_vis
.symtab_node
= NULL
;
12249 expr
= (tree
) &buf
;
12251 else if (TREE_CODE_CLASS (code
) == tcc_type
12252 && (TYPE_POINTER_TO (expr
)
12253 || TYPE_REFERENCE_TO (expr
)
12254 || TYPE_CACHED_VALUES_P (expr
)
12255 || TYPE_CONTAINS_PLACEHOLDER_INTERNAL (expr
)
12256 || TYPE_NEXT_VARIANT (expr
)))
12258 /* Allow these fields to be modified. */
12260 memcpy ((char *) &buf
, expr
, tree_size (expr
));
12261 expr
= tmp
= (tree
) &buf
;
12262 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (tmp
) = 0;
12263 TYPE_POINTER_TO (tmp
) = NULL
;
12264 TYPE_REFERENCE_TO (tmp
) = NULL
;
12265 TYPE_NEXT_VARIANT (tmp
) = NULL
;
12266 if (TYPE_CACHED_VALUES_P (tmp
))
12268 TYPE_CACHED_VALUES_P (tmp
) = 0;
12269 TYPE_CACHED_VALUES (tmp
) = NULL
;
12272 md5_process_bytes (expr
, tree_size (expr
), ctx
);
12273 if (CODE_CONTAINS_STRUCT (code
, TS_TYPED
))
12274 fold_checksum_tree (TREE_TYPE (expr
), ctx
, ht
);
12275 if (TREE_CODE_CLASS (code
) != tcc_type
12276 && TREE_CODE_CLASS (code
) != tcc_declaration
12277 && code
!= TREE_LIST
12278 && code
!= SSA_NAME
12279 && CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
12280 fold_checksum_tree (TREE_CHAIN (expr
), ctx
, ht
);
12281 switch (TREE_CODE_CLASS (code
))
12287 md5_process_bytes (TREE_STRING_POINTER (expr
),
12288 TREE_STRING_LENGTH (expr
), ctx
);
12291 fold_checksum_tree (TREE_REALPART (expr
), ctx
, ht
);
12292 fold_checksum_tree (TREE_IMAGPART (expr
), ctx
, ht
);
12295 for (i
= 0; i
< (int) VECTOR_CST_NELTS (expr
); ++i
)
12296 fold_checksum_tree (VECTOR_CST_ELT (expr
, i
), ctx
, ht
);
12302 case tcc_exceptional
:
12306 fold_checksum_tree (TREE_PURPOSE (expr
), ctx
, ht
);
12307 fold_checksum_tree (TREE_VALUE (expr
), ctx
, ht
);
12308 expr
= TREE_CHAIN (expr
);
12309 goto recursive_label
;
12312 for (i
= 0; i
< TREE_VEC_LENGTH (expr
); ++i
)
12313 fold_checksum_tree (TREE_VEC_ELT (expr
, i
), ctx
, ht
);
12319 case tcc_expression
:
12320 case tcc_reference
:
12321 case tcc_comparison
:
12324 case tcc_statement
:
12326 len
= TREE_OPERAND_LENGTH (expr
);
12327 for (i
= 0; i
< len
; ++i
)
12328 fold_checksum_tree (TREE_OPERAND (expr
, i
), ctx
, ht
);
12330 case tcc_declaration
:
12331 fold_checksum_tree (DECL_NAME (expr
), ctx
, ht
);
12332 fold_checksum_tree (DECL_CONTEXT (expr
), ctx
, ht
);
12333 if (CODE_CONTAINS_STRUCT (TREE_CODE (expr
), TS_DECL_COMMON
))
12335 fold_checksum_tree (DECL_SIZE (expr
), ctx
, ht
);
12336 fold_checksum_tree (DECL_SIZE_UNIT (expr
), ctx
, ht
);
12337 fold_checksum_tree (DECL_INITIAL (expr
), ctx
, ht
);
12338 fold_checksum_tree (DECL_ABSTRACT_ORIGIN (expr
), ctx
, ht
);
12339 fold_checksum_tree (DECL_ATTRIBUTES (expr
), ctx
, ht
);
12342 if (CODE_CONTAINS_STRUCT (TREE_CODE (expr
), TS_DECL_NON_COMMON
))
12344 if (TREE_CODE (expr
) == FUNCTION_DECL
)
12346 fold_checksum_tree (DECL_VINDEX (expr
), ctx
, ht
);
12347 fold_checksum_tree (DECL_ARGUMENTS (expr
), ctx
, ht
);
12349 fold_checksum_tree (DECL_RESULT_FLD (expr
), ctx
, ht
);
12353 if (TREE_CODE (expr
) == ENUMERAL_TYPE
)
12354 fold_checksum_tree (TYPE_VALUES (expr
), ctx
, ht
);
12355 fold_checksum_tree (TYPE_SIZE (expr
), ctx
, ht
);
12356 fold_checksum_tree (TYPE_SIZE_UNIT (expr
), ctx
, ht
);
12357 fold_checksum_tree (TYPE_ATTRIBUTES (expr
), ctx
, ht
);
12358 fold_checksum_tree (TYPE_NAME (expr
), ctx
, ht
);
12359 if (INTEGRAL_TYPE_P (expr
)
12360 || SCALAR_FLOAT_TYPE_P (expr
))
12362 fold_checksum_tree (TYPE_MIN_VALUE (expr
), ctx
, ht
);
12363 fold_checksum_tree (TYPE_MAX_VALUE (expr
), ctx
, ht
);
12365 fold_checksum_tree (TYPE_MAIN_VARIANT (expr
), ctx
, ht
);
12366 if (TREE_CODE (expr
) == RECORD_TYPE
12367 || TREE_CODE (expr
) == UNION_TYPE
12368 || TREE_CODE (expr
) == QUAL_UNION_TYPE
)
12369 fold_checksum_tree (TYPE_BINFO (expr
), ctx
, ht
);
12370 fold_checksum_tree (TYPE_CONTEXT (expr
), ctx
, ht
);
12377 /* Helper function for outputting the checksum of a tree T. When
12378 debugging with gdb, you can "define mynext" to be "next" followed
12379 by "call debug_fold_checksum (op0)", then just trace down till the
12382 DEBUG_FUNCTION
void
12383 debug_fold_checksum (const_tree t
)
12386 unsigned char checksum
[16];
12387 struct md5_ctx ctx
;
12388 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12390 md5_init_ctx (&ctx
);
12391 fold_checksum_tree (t
, &ctx
, &ht
);
12392 md5_finish_ctx (&ctx
, checksum
);
12395 for (i
= 0; i
< 16; i
++)
12396 fprintf (stderr
, "%d ", checksum
[i
]);
12398 fprintf (stderr
, "\n");
12403 /* Fold a unary tree expression with code CODE of type TYPE with an
12404 operand OP0. LOC is the location of the resulting expression.
12405 Return a folded expression if successful. Otherwise, return a tree
12406 expression with code CODE of type TYPE with an operand OP0. */
12409 fold_build1_stat_loc (location_t loc
,
12410 enum tree_code code
, tree type
, tree op0 MEM_STAT_DECL
)
12413 #ifdef ENABLE_FOLD_CHECKING
12414 unsigned char checksum_before
[16], checksum_after
[16];
12415 struct md5_ctx ctx
;
12416 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12418 md5_init_ctx (&ctx
);
12419 fold_checksum_tree (op0
, &ctx
, &ht
);
12420 md5_finish_ctx (&ctx
, checksum_before
);
12424 tem
= fold_unary_loc (loc
, code
, type
, op0
);
12426 tem
= build1_stat_loc (loc
, code
, type
, op0 PASS_MEM_STAT
);
12428 #ifdef ENABLE_FOLD_CHECKING
12429 md5_init_ctx (&ctx
);
12430 fold_checksum_tree (op0
, &ctx
, &ht
);
12431 md5_finish_ctx (&ctx
, checksum_after
);
12433 if (memcmp (checksum_before
, checksum_after
, 16))
12434 fold_check_failed (op0
, tem
);
12439 /* Fold a binary tree expression with code CODE of type TYPE with
12440 operands OP0 and OP1. LOC is the location of the resulting
12441 expression. Return a folded expression if successful. Otherwise,
12442 return a tree expression with code CODE of type TYPE with operands
12446 fold_build2_stat_loc (location_t loc
,
12447 enum tree_code code
, tree type
, tree op0
, tree op1
12451 #ifdef ENABLE_FOLD_CHECKING
12452 unsigned char checksum_before_op0
[16],
12453 checksum_before_op1
[16],
12454 checksum_after_op0
[16],
12455 checksum_after_op1
[16];
12456 struct md5_ctx ctx
;
12457 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12459 md5_init_ctx (&ctx
);
12460 fold_checksum_tree (op0
, &ctx
, &ht
);
12461 md5_finish_ctx (&ctx
, checksum_before_op0
);
12464 md5_init_ctx (&ctx
);
12465 fold_checksum_tree (op1
, &ctx
, &ht
);
12466 md5_finish_ctx (&ctx
, checksum_before_op1
);
12470 tem
= fold_binary_loc (loc
, code
, type
, op0
, op1
);
12472 tem
= build2_stat_loc (loc
, code
, type
, op0
, op1 PASS_MEM_STAT
);
12474 #ifdef ENABLE_FOLD_CHECKING
12475 md5_init_ctx (&ctx
);
12476 fold_checksum_tree (op0
, &ctx
, &ht
);
12477 md5_finish_ctx (&ctx
, checksum_after_op0
);
12480 if (memcmp (checksum_before_op0
, checksum_after_op0
, 16))
12481 fold_check_failed (op0
, tem
);
12483 md5_init_ctx (&ctx
);
12484 fold_checksum_tree (op1
, &ctx
, &ht
);
12485 md5_finish_ctx (&ctx
, checksum_after_op1
);
12487 if (memcmp (checksum_before_op1
, checksum_after_op1
, 16))
12488 fold_check_failed (op1
, tem
);
12493 /* Fold a ternary tree expression with code CODE of type TYPE with
12494 operands OP0, OP1, and OP2. Return a folded expression if
12495 successful. Otherwise, return a tree expression with code CODE of
12496 type TYPE with operands OP0, OP1, and OP2. */
12499 fold_build3_stat_loc (location_t loc
, enum tree_code code
, tree type
,
12500 tree op0
, tree op1
, tree op2 MEM_STAT_DECL
)
12503 #ifdef ENABLE_FOLD_CHECKING
12504 unsigned char checksum_before_op0
[16],
12505 checksum_before_op1
[16],
12506 checksum_before_op2
[16],
12507 checksum_after_op0
[16],
12508 checksum_after_op1
[16],
12509 checksum_after_op2
[16];
12510 struct md5_ctx ctx
;
12511 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12513 md5_init_ctx (&ctx
);
12514 fold_checksum_tree (op0
, &ctx
, &ht
);
12515 md5_finish_ctx (&ctx
, checksum_before_op0
);
12518 md5_init_ctx (&ctx
);
12519 fold_checksum_tree (op1
, &ctx
, &ht
);
12520 md5_finish_ctx (&ctx
, checksum_before_op1
);
12523 md5_init_ctx (&ctx
);
12524 fold_checksum_tree (op2
, &ctx
, &ht
);
12525 md5_finish_ctx (&ctx
, checksum_before_op2
);
12529 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
12530 tem
= fold_ternary_loc (loc
, code
, type
, op0
, op1
, op2
);
12532 tem
= build3_stat_loc (loc
, code
, type
, op0
, op1
, op2 PASS_MEM_STAT
);
12534 #ifdef ENABLE_FOLD_CHECKING
12535 md5_init_ctx (&ctx
);
12536 fold_checksum_tree (op0
, &ctx
, &ht
);
12537 md5_finish_ctx (&ctx
, checksum_after_op0
);
12540 if (memcmp (checksum_before_op0
, checksum_after_op0
, 16))
12541 fold_check_failed (op0
, tem
);
12543 md5_init_ctx (&ctx
);
12544 fold_checksum_tree (op1
, &ctx
, &ht
);
12545 md5_finish_ctx (&ctx
, checksum_after_op1
);
12548 if (memcmp (checksum_before_op1
, checksum_after_op1
, 16))
12549 fold_check_failed (op1
, tem
);
12551 md5_init_ctx (&ctx
);
12552 fold_checksum_tree (op2
, &ctx
, &ht
);
12553 md5_finish_ctx (&ctx
, checksum_after_op2
);
12555 if (memcmp (checksum_before_op2
, checksum_after_op2
, 16))
12556 fold_check_failed (op2
, tem
);
12561 /* Fold a CALL_EXPR expression of type TYPE with operands FN and NARGS
12562 arguments in ARGARRAY, and a null static chain.
12563 Return a folded expression if successful. Otherwise, return a CALL_EXPR
12564 of type TYPE from the given operands as constructed by build_call_array. */
12567 fold_build_call_array_loc (location_t loc
, tree type
, tree fn
,
12568 int nargs
, tree
*argarray
)
12571 #ifdef ENABLE_FOLD_CHECKING
12572 unsigned char checksum_before_fn
[16],
12573 checksum_before_arglist
[16],
12574 checksum_after_fn
[16],
12575 checksum_after_arglist
[16];
12576 struct md5_ctx ctx
;
12577 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12580 md5_init_ctx (&ctx
);
12581 fold_checksum_tree (fn
, &ctx
, &ht
);
12582 md5_finish_ctx (&ctx
, checksum_before_fn
);
12585 md5_init_ctx (&ctx
);
12586 for (i
= 0; i
< nargs
; i
++)
12587 fold_checksum_tree (argarray
[i
], &ctx
, &ht
);
12588 md5_finish_ctx (&ctx
, checksum_before_arglist
);
12592 tem
= fold_builtin_call_array (loc
, type
, fn
, nargs
, argarray
);
12594 tem
= build_call_array_loc (loc
, type
, fn
, nargs
, argarray
);
12596 #ifdef ENABLE_FOLD_CHECKING
12597 md5_init_ctx (&ctx
);
12598 fold_checksum_tree (fn
, &ctx
, &ht
);
12599 md5_finish_ctx (&ctx
, checksum_after_fn
);
12602 if (memcmp (checksum_before_fn
, checksum_after_fn
, 16))
12603 fold_check_failed (fn
, tem
);
12605 md5_init_ctx (&ctx
);
12606 for (i
= 0; i
< nargs
; i
++)
12607 fold_checksum_tree (argarray
[i
], &ctx
, &ht
);
12608 md5_finish_ctx (&ctx
, checksum_after_arglist
);
12610 if (memcmp (checksum_before_arglist
, checksum_after_arglist
, 16))
12611 fold_check_failed (NULL_TREE
, tem
);
12616 /* Perform constant folding and related simplification of initializer
12617 expression EXPR. These behave identically to "fold_buildN" but ignore
12618 potential run-time traps and exceptions that fold must preserve. */
12620 #define START_FOLD_INIT \
12621 int saved_signaling_nans = flag_signaling_nans;\
12622 int saved_trapping_math = flag_trapping_math;\
12623 int saved_rounding_math = flag_rounding_math;\
12624 int saved_trapv = flag_trapv;\
12625 int saved_folding_initializer = folding_initializer;\
12626 flag_signaling_nans = 0;\
12627 flag_trapping_math = 0;\
12628 flag_rounding_math = 0;\
12630 folding_initializer = 1;
12632 #define END_FOLD_INIT \
12633 flag_signaling_nans = saved_signaling_nans;\
12634 flag_trapping_math = saved_trapping_math;\
12635 flag_rounding_math = saved_rounding_math;\
12636 flag_trapv = saved_trapv;\
12637 folding_initializer = saved_folding_initializer;
12640 fold_build1_initializer_loc (location_t loc
, enum tree_code code
,
12641 tree type
, tree op
)
12646 result
= fold_build1_loc (loc
, code
, type
, op
);
12653 fold_build2_initializer_loc (location_t loc
, enum tree_code code
,
12654 tree type
, tree op0
, tree op1
)
12659 result
= fold_build2_loc (loc
, code
, type
, op0
, op1
);
12666 fold_build_call_array_initializer_loc (location_t loc
, tree type
, tree fn
,
12667 int nargs
, tree
*argarray
)
12672 result
= fold_build_call_array_loc (loc
, type
, fn
, nargs
, argarray
);
12678 #undef START_FOLD_INIT
12679 #undef END_FOLD_INIT
12681 /* Determine if first argument is a multiple of second argument. Return 0 if
12682 it is not, or we cannot easily determined it to be.
12684 An example of the sort of thing we care about (at this point; this routine
12685 could surely be made more general, and expanded to do what the *_DIV_EXPR's
12686 fold cases do now) is discovering that
12688 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
12694 when we know that the two SAVE_EXPR (J * 8) nodes are the same node.
12696 This code also handles discovering that
12698 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
12700 is a multiple of 8 so we don't have to worry about dealing with a
12701 possible remainder.
12703 Note that we *look* inside a SAVE_EXPR only to determine how it was
12704 calculated; it is not safe for fold to do much of anything else with the
12705 internals of a SAVE_EXPR, since it cannot know when it will be evaluated
12706 at run time. For example, the latter example above *cannot* be implemented
12707 as SAVE_EXPR (I) * J or any variant thereof, since the value of J at
12708 evaluation time of the original SAVE_EXPR is not necessarily the same at
12709 the time the new expression is evaluated. The only optimization of this
12710 sort that would be valid is changing
12712 SAVE_EXPR (I) * SAVE_EXPR (SAVE_EXPR (J) * 8)
12716 SAVE_EXPR (I) * SAVE_EXPR (J)
12718 (where the same SAVE_EXPR (J) is used in the original and the
12719 transformed version). */
12722 multiple_of_p (tree type
, const_tree top
, const_tree bottom
)
12724 if (operand_equal_p (top
, bottom
, 0))
12727 if (TREE_CODE (type
) != INTEGER_TYPE
)
12730 switch (TREE_CODE (top
))
12733 /* Bitwise and provides a power of two multiple. If the mask is
12734 a multiple of BOTTOM then TOP is a multiple of BOTTOM. */
12735 if (!integer_pow2p (bottom
))
12740 return (multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
)
12741 || multiple_of_p (type
, TREE_OPERAND (top
, 1), bottom
));
12745 return (multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
)
12746 && multiple_of_p (type
, TREE_OPERAND (top
, 1), bottom
));
12749 if (TREE_CODE (TREE_OPERAND (top
, 1)) == INTEGER_CST
)
12753 op1
= TREE_OPERAND (top
, 1);
12754 /* const_binop may not detect overflow correctly,
12755 so check for it explicitly here. */
12756 if (wi::gtu_p (TYPE_PRECISION (TREE_TYPE (size_one_node
)), op1
)
12757 && 0 != (t1
= fold_convert (type
,
12758 const_binop (LSHIFT_EXPR
,
12761 && !TREE_OVERFLOW (t1
))
12762 return multiple_of_p (type
, t1
, bottom
);
12767 /* Can't handle conversions from non-integral or wider integral type. */
12768 if ((TREE_CODE (TREE_TYPE (TREE_OPERAND (top
, 0))) != INTEGER_TYPE
)
12769 || (TYPE_PRECISION (type
)
12770 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (top
, 0)))))
12773 /* .. fall through ... */
12776 return multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
);
12779 return (multiple_of_p (type
, TREE_OPERAND (top
, 1), bottom
)
12780 && multiple_of_p (type
, TREE_OPERAND (top
, 2), bottom
));
12783 if (TREE_CODE (bottom
) != INTEGER_CST
12784 || integer_zerop (bottom
)
12785 || (TYPE_UNSIGNED (type
)
12786 && (tree_int_cst_sgn (top
) < 0
12787 || tree_int_cst_sgn (bottom
) < 0)))
12789 return wi::multiple_of_p (wi::to_widest (top
), wi::to_widest (bottom
),
12797 #define tree_expr_nonnegative_warnv_p(X, Y) \
12798 _Pragma ("GCC error \"Use RECURSE for recursive calls\"") 0
12800 #define RECURSE(X) \
12801 ((tree_expr_nonnegative_warnv_p) (X, strict_overflow_p, depth + 1))
12803 /* Return true if CODE or TYPE is known to be non-negative. */
12806 tree_simple_nonnegative_warnv_p (enum tree_code code
, tree type
)
12808 if ((TYPE_PRECISION (type
) != 1 || TYPE_UNSIGNED (type
))
12809 && truth_value_p (code
))
12810 /* Truth values evaluate to 0 or 1, which is nonnegative unless we
12811 have a signed:1 type (where the value is -1 and 0). */
12816 /* Return true if (CODE OP0) is known to be non-negative. If the return
12817 value is based on the assumption that signed overflow is undefined,
12818 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12819 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12822 tree_unary_nonnegative_warnv_p (enum tree_code code
, tree type
, tree op0
,
12823 bool *strict_overflow_p
, int depth
)
12825 if (TYPE_UNSIGNED (type
))
12831 /* We can't return 1 if flag_wrapv is set because
12832 ABS_EXPR<INT_MIN> = INT_MIN. */
12833 if (!ANY_INTEGRAL_TYPE_P (type
))
12835 if (TYPE_OVERFLOW_UNDEFINED (type
))
12837 *strict_overflow_p
= true;
12842 case NON_LVALUE_EXPR
:
12844 case FIX_TRUNC_EXPR
:
12845 return RECURSE (op0
);
12849 tree inner_type
= TREE_TYPE (op0
);
12850 tree outer_type
= type
;
12852 if (TREE_CODE (outer_type
) == REAL_TYPE
)
12854 if (TREE_CODE (inner_type
) == REAL_TYPE
)
12855 return RECURSE (op0
);
12856 if (INTEGRAL_TYPE_P (inner_type
))
12858 if (TYPE_UNSIGNED (inner_type
))
12860 return RECURSE (op0
);
12863 else if (INTEGRAL_TYPE_P (outer_type
))
12865 if (TREE_CODE (inner_type
) == REAL_TYPE
)
12866 return RECURSE (op0
);
12867 if (INTEGRAL_TYPE_P (inner_type
))
12868 return TYPE_PRECISION (inner_type
) < TYPE_PRECISION (outer_type
)
12869 && TYPE_UNSIGNED (inner_type
);
12875 return tree_simple_nonnegative_warnv_p (code
, type
);
12878 /* We don't know sign of `t', so be conservative and return false. */
12882 /* Return true if (CODE OP0 OP1) is known to be non-negative. If the return
12883 value is based on the assumption that signed overflow is undefined,
12884 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12885 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12888 tree_binary_nonnegative_warnv_p (enum tree_code code
, tree type
, tree op0
,
12889 tree op1
, bool *strict_overflow_p
,
12892 if (TYPE_UNSIGNED (type
))
12897 case POINTER_PLUS_EXPR
:
12899 if (FLOAT_TYPE_P (type
))
12900 return RECURSE (op0
) && RECURSE (op1
);
12902 /* zero_extend(x) + zero_extend(y) is non-negative if x and y are
12903 both unsigned and at least 2 bits shorter than the result. */
12904 if (TREE_CODE (type
) == INTEGER_TYPE
12905 && TREE_CODE (op0
) == NOP_EXPR
12906 && TREE_CODE (op1
) == NOP_EXPR
)
12908 tree inner1
= TREE_TYPE (TREE_OPERAND (op0
, 0));
12909 tree inner2
= TREE_TYPE (TREE_OPERAND (op1
, 0));
12910 if (TREE_CODE (inner1
) == INTEGER_TYPE
&& TYPE_UNSIGNED (inner1
)
12911 && TREE_CODE (inner2
) == INTEGER_TYPE
&& TYPE_UNSIGNED (inner2
))
12913 unsigned int prec
= MAX (TYPE_PRECISION (inner1
),
12914 TYPE_PRECISION (inner2
)) + 1;
12915 return prec
< TYPE_PRECISION (type
);
12921 if (FLOAT_TYPE_P (type
) || TYPE_OVERFLOW_UNDEFINED (type
))
12923 /* x * x is always non-negative for floating point x
12924 or without overflow. */
12925 if (operand_equal_p (op0
, op1
, 0)
12926 || (RECURSE (op0
) && RECURSE (op1
)))
12928 if (ANY_INTEGRAL_TYPE_P (type
)
12929 && TYPE_OVERFLOW_UNDEFINED (type
))
12930 *strict_overflow_p
= true;
12935 /* zero_extend(x) * zero_extend(y) is non-negative if x and y are
12936 both unsigned and their total bits is shorter than the result. */
12937 if (TREE_CODE (type
) == INTEGER_TYPE
12938 && (TREE_CODE (op0
) == NOP_EXPR
|| TREE_CODE (op0
) == INTEGER_CST
)
12939 && (TREE_CODE (op1
) == NOP_EXPR
|| TREE_CODE (op1
) == INTEGER_CST
))
12941 tree inner0
= (TREE_CODE (op0
) == NOP_EXPR
)
12942 ? TREE_TYPE (TREE_OPERAND (op0
, 0))
12944 tree inner1
= (TREE_CODE (op1
) == NOP_EXPR
)
12945 ? TREE_TYPE (TREE_OPERAND (op1
, 0))
12948 bool unsigned0
= TYPE_UNSIGNED (inner0
);
12949 bool unsigned1
= TYPE_UNSIGNED (inner1
);
12951 if (TREE_CODE (op0
) == INTEGER_CST
)
12952 unsigned0
= unsigned0
|| tree_int_cst_sgn (op0
) >= 0;
12954 if (TREE_CODE (op1
) == INTEGER_CST
)
12955 unsigned1
= unsigned1
|| tree_int_cst_sgn (op1
) >= 0;
12957 if (TREE_CODE (inner0
) == INTEGER_TYPE
&& unsigned0
12958 && TREE_CODE (inner1
) == INTEGER_TYPE
&& unsigned1
)
12960 unsigned int precision0
= (TREE_CODE (op0
) == INTEGER_CST
)
12961 ? tree_int_cst_min_precision (op0
, UNSIGNED
)
12962 : TYPE_PRECISION (inner0
);
12964 unsigned int precision1
= (TREE_CODE (op1
) == INTEGER_CST
)
12965 ? tree_int_cst_min_precision (op1
, UNSIGNED
)
12966 : TYPE_PRECISION (inner1
);
12968 return precision0
+ precision1
< TYPE_PRECISION (type
);
12975 return RECURSE (op0
) || RECURSE (op1
);
12981 case TRUNC_DIV_EXPR
:
12982 case CEIL_DIV_EXPR
:
12983 case FLOOR_DIV_EXPR
:
12984 case ROUND_DIV_EXPR
:
12985 return RECURSE (op0
) && RECURSE (op1
);
12987 case TRUNC_MOD_EXPR
:
12988 return RECURSE (op0
);
12990 case FLOOR_MOD_EXPR
:
12991 return RECURSE (op1
);
12993 case CEIL_MOD_EXPR
:
12994 case ROUND_MOD_EXPR
:
12996 return tree_simple_nonnegative_warnv_p (code
, type
);
12999 /* We don't know sign of `t', so be conservative and return false. */
13003 /* Return true if T is known to be non-negative. If the return
13004 value is based on the assumption that signed overflow is undefined,
13005 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13006 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13009 tree_single_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
, int depth
)
13011 if (TYPE_UNSIGNED (TREE_TYPE (t
)))
13014 switch (TREE_CODE (t
))
13017 return tree_int_cst_sgn (t
) >= 0;
13020 return ! REAL_VALUE_NEGATIVE (TREE_REAL_CST (t
));
13023 return ! FIXED_VALUE_NEGATIVE (TREE_FIXED_CST (t
));
13026 return RECURSE (TREE_OPERAND (t
, 1)) && RECURSE (TREE_OPERAND (t
, 2));
13029 /* Limit the depth of recursion to avoid quadratic behavior.
13030 This is expected to catch almost all occurrences in practice.
13031 If this code misses important cases that unbounded recursion
13032 would not, passes that need this information could be revised
13033 to provide it through dataflow propagation. */
13034 return (!name_registered_for_update_p (t
)
13035 && depth
< PARAM_VALUE (PARAM_MAX_SSA_NAME_QUERY_DEPTH
)
13036 && gimple_stmt_nonnegative_warnv_p (SSA_NAME_DEF_STMT (t
),
13037 strict_overflow_p
, depth
));
13040 return tree_simple_nonnegative_warnv_p (TREE_CODE (t
), TREE_TYPE (t
));
13044 /* Return true if T is known to be non-negative. If the return
13045 value is based on the assumption that signed overflow is undefined,
13046 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13047 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13050 tree_call_nonnegative_warnv_p (tree type
, combined_fn fn
, tree arg0
, tree arg1
,
13051 bool *strict_overflow_p
, int depth
)
13072 case CFN_BUILT_IN_BSWAP32
:
13073 case CFN_BUILT_IN_BSWAP64
:
13078 /* sqrt(-0.0) is -0.0. */
13079 if (!HONOR_SIGNED_ZEROS (element_mode (type
)))
13081 return RECURSE (arg0
);
13107 CASE_CFN_NEARBYINT
:
13114 CASE_CFN_SIGNIFICAND
:
13118 /* True if the 1st argument is nonnegative. */
13119 return RECURSE (arg0
);
13122 /* True if the 1st OR 2nd arguments are nonnegative. */
13123 return RECURSE (arg0
) || RECURSE (arg1
);
13126 /* True if the 1st AND 2nd arguments are nonnegative. */
13127 return RECURSE (arg0
) && RECURSE (arg1
);
13130 /* True if the 2nd argument is nonnegative. */
13131 return RECURSE (arg1
);
13134 /* True if the 1st argument is nonnegative or the second
13135 argument is an even integer. */
13136 if (TREE_CODE (arg1
) == INTEGER_CST
13137 && (TREE_INT_CST_LOW (arg1
) & 1) == 0)
13139 return RECURSE (arg0
);
13142 /* True if the 1st argument is nonnegative or the second
13143 argument is an even integer valued real. */
13144 if (TREE_CODE (arg1
) == REAL_CST
)
13149 c
= TREE_REAL_CST (arg1
);
13150 n
= real_to_integer (&c
);
13153 REAL_VALUE_TYPE cint
;
13154 real_from_integer (&cint
, VOIDmode
, n
, SIGNED
);
13155 if (real_identical (&c
, &cint
))
13159 return RECURSE (arg0
);
13164 return tree_simple_nonnegative_warnv_p (CALL_EXPR
, type
);
13167 /* Return true if T is known to be non-negative. If the return
13168 value is based on the assumption that signed overflow is undefined,
13169 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13170 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13173 tree_invalid_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
, int depth
)
13175 enum tree_code code
= TREE_CODE (t
);
13176 if (TYPE_UNSIGNED (TREE_TYPE (t
)))
13183 tree temp
= TARGET_EXPR_SLOT (t
);
13184 t
= TARGET_EXPR_INITIAL (t
);
13186 /* If the initializer is non-void, then it's a normal expression
13187 that will be assigned to the slot. */
13188 if (!VOID_TYPE_P (t
))
13189 return RECURSE (t
);
13191 /* Otherwise, the initializer sets the slot in some way. One common
13192 way is an assignment statement at the end of the initializer. */
13195 if (TREE_CODE (t
) == BIND_EXPR
)
13196 t
= expr_last (BIND_EXPR_BODY (t
));
13197 else if (TREE_CODE (t
) == TRY_FINALLY_EXPR
13198 || TREE_CODE (t
) == TRY_CATCH_EXPR
)
13199 t
= expr_last (TREE_OPERAND (t
, 0));
13200 else if (TREE_CODE (t
) == STATEMENT_LIST
)
13205 if (TREE_CODE (t
) == MODIFY_EXPR
13206 && TREE_OPERAND (t
, 0) == temp
)
13207 return RECURSE (TREE_OPERAND (t
, 1));
13214 tree arg0
= call_expr_nargs (t
) > 0 ? CALL_EXPR_ARG (t
, 0) : NULL_TREE
;
13215 tree arg1
= call_expr_nargs (t
) > 1 ? CALL_EXPR_ARG (t
, 1) : NULL_TREE
;
13217 return tree_call_nonnegative_warnv_p (TREE_TYPE (t
),
13218 get_call_combined_fn (t
),
13221 strict_overflow_p
, depth
);
13223 case COMPOUND_EXPR
:
13225 return RECURSE (TREE_OPERAND (t
, 1));
13228 return RECURSE (expr_last (TREE_OPERAND (t
, 1)));
13231 return RECURSE (TREE_OPERAND (t
, 0));
13234 return tree_simple_nonnegative_warnv_p (TREE_CODE (t
), TREE_TYPE (t
));
13239 #undef tree_expr_nonnegative_warnv_p
13241 /* Return true if T is known to be non-negative. If the return
13242 value is based on the assumption that signed overflow is undefined,
13243 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13244 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13247 tree_expr_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
, int depth
)
13249 enum tree_code code
;
13250 if (t
== error_mark_node
)
13253 code
= TREE_CODE (t
);
13254 switch (TREE_CODE_CLASS (code
))
13257 case tcc_comparison
:
13258 return tree_binary_nonnegative_warnv_p (TREE_CODE (t
),
13260 TREE_OPERAND (t
, 0),
13261 TREE_OPERAND (t
, 1),
13262 strict_overflow_p
, depth
);
13265 return tree_unary_nonnegative_warnv_p (TREE_CODE (t
),
13267 TREE_OPERAND (t
, 0),
13268 strict_overflow_p
, depth
);
13271 case tcc_declaration
:
13272 case tcc_reference
:
13273 return tree_single_nonnegative_warnv_p (t
, strict_overflow_p
, depth
);
13281 case TRUTH_AND_EXPR
:
13282 case TRUTH_OR_EXPR
:
13283 case TRUTH_XOR_EXPR
:
13284 return tree_binary_nonnegative_warnv_p (TREE_CODE (t
),
13286 TREE_OPERAND (t
, 0),
13287 TREE_OPERAND (t
, 1),
13288 strict_overflow_p
, depth
);
13289 case TRUTH_NOT_EXPR
:
13290 return tree_unary_nonnegative_warnv_p (TREE_CODE (t
),
13292 TREE_OPERAND (t
, 0),
13293 strict_overflow_p
, depth
);
13300 case WITH_SIZE_EXPR
:
13302 return tree_single_nonnegative_warnv_p (t
, strict_overflow_p
, depth
);
13305 return tree_invalid_nonnegative_warnv_p (t
, strict_overflow_p
, depth
);
13309 /* Return true if `t' is known to be non-negative. Handle warnings
13310 about undefined signed overflow. */
13313 tree_expr_nonnegative_p (tree t
)
13315 bool ret
, strict_overflow_p
;
13317 strict_overflow_p
= false;
13318 ret
= tree_expr_nonnegative_warnv_p (t
, &strict_overflow_p
);
13319 if (strict_overflow_p
)
13320 fold_overflow_warning (("assuming signed overflow does not occur when "
13321 "determining that expression is always "
13323 WARN_STRICT_OVERFLOW_MISC
);
13328 /* Return true when (CODE OP0) is an address and is known to be nonzero.
13329 For floating point we further ensure that T is not denormal.
13330 Similar logic is present in nonzero_address in rtlanal.h.
13332 If the return value is based on the assumption that signed overflow
13333 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13334 change *STRICT_OVERFLOW_P. */
13337 tree_unary_nonzero_warnv_p (enum tree_code code
, tree type
, tree op0
,
13338 bool *strict_overflow_p
)
13343 return tree_expr_nonzero_warnv_p (op0
,
13344 strict_overflow_p
);
13348 tree inner_type
= TREE_TYPE (op0
);
13349 tree outer_type
= type
;
13351 return (TYPE_PRECISION (outer_type
) >= TYPE_PRECISION (inner_type
)
13352 && tree_expr_nonzero_warnv_p (op0
,
13353 strict_overflow_p
));
13357 case NON_LVALUE_EXPR
:
13358 return tree_expr_nonzero_warnv_p (op0
,
13359 strict_overflow_p
);
13368 /* Return true when (CODE OP0 OP1) is an address and is known to be nonzero.
13369 For floating point we further ensure that T is not denormal.
13370 Similar logic is present in nonzero_address in rtlanal.h.
13372 If the return value is based on the assumption that signed overflow
13373 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13374 change *STRICT_OVERFLOW_P. */
13377 tree_binary_nonzero_warnv_p (enum tree_code code
,
13380 tree op1
, bool *strict_overflow_p
)
13382 bool sub_strict_overflow_p
;
13385 case POINTER_PLUS_EXPR
:
13387 if (ANY_INTEGRAL_TYPE_P (type
) && TYPE_OVERFLOW_UNDEFINED (type
))
13389 /* With the presence of negative values it is hard
13390 to say something. */
13391 sub_strict_overflow_p
= false;
13392 if (!tree_expr_nonnegative_warnv_p (op0
,
13393 &sub_strict_overflow_p
)
13394 || !tree_expr_nonnegative_warnv_p (op1
,
13395 &sub_strict_overflow_p
))
13397 /* One of operands must be positive and the other non-negative. */
13398 /* We don't set *STRICT_OVERFLOW_P here: even if this value
13399 overflows, on a twos-complement machine the sum of two
13400 nonnegative numbers can never be zero. */
13401 return (tree_expr_nonzero_warnv_p (op0
,
13403 || tree_expr_nonzero_warnv_p (op1
,
13404 strict_overflow_p
));
13409 if (TYPE_OVERFLOW_UNDEFINED (type
))
13411 if (tree_expr_nonzero_warnv_p (op0
,
13413 && tree_expr_nonzero_warnv_p (op1
,
13414 strict_overflow_p
))
13416 *strict_overflow_p
= true;
13423 sub_strict_overflow_p
= false;
13424 if (tree_expr_nonzero_warnv_p (op0
,
13425 &sub_strict_overflow_p
)
13426 && tree_expr_nonzero_warnv_p (op1
,
13427 &sub_strict_overflow_p
))
13429 if (sub_strict_overflow_p
)
13430 *strict_overflow_p
= true;
13435 sub_strict_overflow_p
= false;
13436 if (tree_expr_nonzero_warnv_p (op0
,
13437 &sub_strict_overflow_p
))
13439 if (sub_strict_overflow_p
)
13440 *strict_overflow_p
= true;
13442 /* When both operands are nonzero, then MAX must be too. */
13443 if (tree_expr_nonzero_warnv_p (op1
,
13444 strict_overflow_p
))
13447 /* MAX where operand 0 is positive is positive. */
13448 return tree_expr_nonnegative_warnv_p (op0
,
13449 strict_overflow_p
);
13451 /* MAX where operand 1 is positive is positive. */
13452 else if (tree_expr_nonzero_warnv_p (op1
,
13453 &sub_strict_overflow_p
)
13454 && tree_expr_nonnegative_warnv_p (op1
,
13455 &sub_strict_overflow_p
))
13457 if (sub_strict_overflow_p
)
13458 *strict_overflow_p
= true;
13464 return (tree_expr_nonzero_warnv_p (op1
,
13466 || tree_expr_nonzero_warnv_p (op0
,
13467 strict_overflow_p
));
13476 /* Return true when T is an address and is known to be nonzero.
13477 For floating point we further ensure that T is not denormal.
13478 Similar logic is present in nonzero_address in rtlanal.h.
13480 If the return value is based on the assumption that signed overflow
13481 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13482 change *STRICT_OVERFLOW_P. */
13485 tree_single_nonzero_warnv_p (tree t
, bool *strict_overflow_p
)
13487 bool sub_strict_overflow_p
;
13488 switch (TREE_CODE (t
))
13491 return !integer_zerop (t
);
13495 tree base
= TREE_OPERAND (t
, 0);
13497 if (!DECL_P (base
))
13498 base
= get_base_address (base
);
13503 /* For objects in symbol table check if we know they are non-zero.
13504 Don't do anything for variables and functions before symtab is built;
13505 it is quite possible that they will be declared weak later. */
13506 if (DECL_P (base
) && decl_in_symtab_p (base
))
13508 struct symtab_node
*symbol
;
13510 symbol
= symtab_node::get_create (base
);
13512 return symbol
->nonzero_address ();
13517 /* Function local objects are never NULL. */
13519 && (DECL_CONTEXT (base
)
13520 && TREE_CODE (DECL_CONTEXT (base
)) == FUNCTION_DECL
13521 && auto_var_in_fn_p (base
, DECL_CONTEXT (base
))))
13524 /* Constants are never weak. */
13525 if (CONSTANT_CLASS_P (base
))
13532 sub_strict_overflow_p
= false;
13533 if (tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 1),
13534 &sub_strict_overflow_p
)
13535 && tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 2),
13536 &sub_strict_overflow_p
))
13538 if (sub_strict_overflow_p
)
13539 *strict_overflow_p
= true;
13550 #define integer_valued_real_p(X) \
13551 _Pragma ("GCC error \"Use RECURSE for recursive calls\"") 0
13553 #define RECURSE(X) \
13554 ((integer_valued_real_p) (X, depth + 1))
13556 /* Return true if the floating point result of (CODE OP0) has an
13557 integer value. We also allow +Inf, -Inf and NaN to be considered
13558 integer values. Return false for signaling NaN.
13560 DEPTH is the current nesting depth of the query. */
13563 integer_valued_real_unary_p (tree_code code
, tree op0
, int depth
)
13571 return RECURSE (op0
);
13575 tree type
= TREE_TYPE (op0
);
13576 if (TREE_CODE (type
) == INTEGER_TYPE
)
13578 if (TREE_CODE (type
) == REAL_TYPE
)
13579 return RECURSE (op0
);
13589 /* Return true if the floating point result of (CODE OP0 OP1) has an
13590 integer value. We also allow +Inf, -Inf and NaN to be considered
13591 integer values. Return false for signaling NaN.
13593 DEPTH is the current nesting depth of the query. */
13596 integer_valued_real_binary_p (tree_code code
, tree op0
, tree op1
, int depth
)
13605 return RECURSE (op0
) && RECURSE (op1
);
13613 /* Return true if the floating point result of calling FNDECL with arguments
13614 ARG0 and ARG1 has an integer value. We also allow +Inf, -Inf and NaN to be
13615 considered integer values. Return false for signaling NaN. If FNDECL
13616 takes fewer than 2 arguments, the remaining ARGn are null.
13618 DEPTH is the current nesting depth of the query. */
13621 integer_valued_real_call_p (combined_fn fn
, tree arg0
, tree arg1
, int depth
)
13627 CASE_CFN_NEARBYINT
:
13635 return RECURSE (arg0
) && RECURSE (arg1
);
13643 /* Return true if the floating point expression T (a GIMPLE_SINGLE_RHS)
13644 has an integer value. We also allow +Inf, -Inf and NaN to be
13645 considered integer values. Return false for signaling NaN.
13647 DEPTH is the current nesting depth of the query. */
13650 integer_valued_real_single_p (tree t
, int depth
)
13652 switch (TREE_CODE (t
))
13655 return real_isinteger (TREE_REAL_CST_PTR (t
), TYPE_MODE (TREE_TYPE (t
)));
13658 return RECURSE (TREE_OPERAND (t
, 1)) && RECURSE (TREE_OPERAND (t
, 2));
13661 /* Limit the depth of recursion to avoid quadratic behavior.
13662 This is expected to catch almost all occurrences in practice.
13663 If this code misses important cases that unbounded recursion
13664 would not, passes that need this information could be revised
13665 to provide it through dataflow propagation. */
13666 return (!name_registered_for_update_p (t
)
13667 && depth
< PARAM_VALUE (PARAM_MAX_SSA_NAME_QUERY_DEPTH
)
13668 && gimple_stmt_integer_valued_real_p (SSA_NAME_DEF_STMT (t
),
13677 /* Return true if the floating point expression T (a GIMPLE_INVALID_RHS)
13678 has an integer value. We also allow +Inf, -Inf and NaN to be
13679 considered integer values. Return false for signaling NaN.
13681 DEPTH is the current nesting depth of the query. */
13684 integer_valued_real_invalid_p (tree t
, int depth
)
13686 switch (TREE_CODE (t
))
13688 case COMPOUND_EXPR
:
13691 return RECURSE (TREE_OPERAND (t
, 1));
13694 return RECURSE (TREE_OPERAND (t
, 0));
13703 #undef integer_valued_real_p
13705 /* Return true if the floating point expression T has an integer value.
13706 We also allow +Inf, -Inf and NaN to be considered integer values.
13707 Return false for signaling NaN.
13709 DEPTH is the current nesting depth of the query. */
13712 integer_valued_real_p (tree t
, int depth
)
13714 if (t
== error_mark_node
)
13717 tree_code code
= TREE_CODE (t
);
13718 switch (TREE_CODE_CLASS (code
))
13721 case tcc_comparison
:
13722 return integer_valued_real_binary_p (code
, TREE_OPERAND (t
, 0),
13723 TREE_OPERAND (t
, 1), depth
);
13726 return integer_valued_real_unary_p (code
, TREE_OPERAND (t
, 0), depth
);
13729 case tcc_declaration
:
13730 case tcc_reference
:
13731 return integer_valued_real_single_p (t
, depth
);
13741 return integer_valued_real_single_p (t
, depth
);
13745 tree arg0
= (call_expr_nargs (t
) > 0
13746 ? CALL_EXPR_ARG (t
, 0)
13748 tree arg1
= (call_expr_nargs (t
) > 1
13749 ? CALL_EXPR_ARG (t
, 1)
13751 return integer_valued_real_call_p (get_call_combined_fn (t
),
13752 arg0
, arg1
, depth
);
13756 return integer_valued_real_invalid_p (t
, depth
);
13760 /* Given the components of a binary expression CODE, TYPE, OP0 and OP1,
13761 attempt to fold the expression to a constant without modifying TYPE,
13764 If the expression could be simplified to a constant, then return
13765 the constant. If the expression would not be simplified to a
13766 constant, then return NULL_TREE. */
13769 fold_binary_to_constant (enum tree_code code
, tree type
, tree op0
, tree op1
)
13771 tree tem
= fold_binary (code
, type
, op0
, op1
);
13772 return (tem
&& TREE_CONSTANT (tem
)) ? tem
: NULL_TREE
;
13775 /* Given the components of a unary expression CODE, TYPE and OP0,
13776 attempt to fold the expression to a constant without modifying
13779 If the expression could be simplified to a constant, then return
13780 the constant. If the expression would not be simplified to a
13781 constant, then return NULL_TREE. */
13784 fold_unary_to_constant (enum tree_code code
, tree type
, tree op0
)
13786 tree tem
= fold_unary (code
, type
, op0
);
13787 return (tem
&& TREE_CONSTANT (tem
)) ? tem
: NULL_TREE
;
13790 /* If EXP represents referencing an element in a constant string
13791 (either via pointer arithmetic or array indexing), return the
13792 tree representing the value accessed, otherwise return NULL. */
13795 fold_read_from_constant_string (tree exp
)
13797 if ((TREE_CODE (exp
) == INDIRECT_REF
13798 || TREE_CODE (exp
) == ARRAY_REF
)
13799 && TREE_CODE (TREE_TYPE (exp
)) == INTEGER_TYPE
)
13801 tree exp1
= TREE_OPERAND (exp
, 0);
13804 location_t loc
= EXPR_LOCATION (exp
);
13806 if (TREE_CODE (exp
) == INDIRECT_REF
)
13807 string
= string_constant (exp1
, &index
);
13810 tree low_bound
= array_ref_low_bound (exp
);
13811 index
= fold_convert_loc (loc
, sizetype
, TREE_OPERAND (exp
, 1));
13813 /* Optimize the special-case of a zero lower bound.
13815 We convert the low_bound to sizetype to avoid some problems
13816 with constant folding. (E.g. suppose the lower bound is 1,
13817 and its mode is QI. Without the conversion,l (ARRAY
13818 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
13819 +INDEX), which becomes (ARRAY+255+INDEX). Oops!) */
13820 if (! integer_zerop (low_bound
))
13821 index
= size_diffop_loc (loc
, index
,
13822 fold_convert_loc (loc
, sizetype
, low_bound
));
13828 && TYPE_MODE (TREE_TYPE (exp
)) == TYPE_MODE (TREE_TYPE (TREE_TYPE (string
)))
13829 && TREE_CODE (string
) == STRING_CST
13830 && TREE_CODE (index
) == INTEGER_CST
13831 && compare_tree_int (index
, TREE_STRING_LENGTH (string
)) < 0
13832 && (GET_MODE_CLASS (TYPE_MODE (TREE_TYPE (TREE_TYPE (string
))))
13834 && (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (string
)))) == 1))
13835 return build_int_cst_type (TREE_TYPE (exp
),
13836 (TREE_STRING_POINTER (string
)
13837 [TREE_INT_CST_LOW (index
)]));
13842 /* Return the tree for neg (ARG0) when ARG0 is known to be either
13843 an integer constant, real, or fixed-point constant.
13845 TYPE is the type of the result. */
13848 fold_negate_const (tree arg0
, tree type
)
13850 tree t
= NULL_TREE
;
13852 switch (TREE_CODE (arg0
))
13857 wide_int val
= wi::neg (arg0
, &overflow
);
13858 t
= force_fit_type (type
, val
, 1,
13859 (overflow
| TREE_OVERFLOW (arg0
))
13860 && !TYPE_UNSIGNED (type
));
13865 t
= build_real (type
, real_value_negate (&TREE_REAL_CST (arg0
)));
13870 FIXED_VALUE_TYPE f
;
13871 bool overflow_p
= fixed_arithmetic (&f
, NEGATE_EXPR
,
13872 &(TREE_FIXED_CST (arg0
)), NULL
,
13873 TYPE_SATURATING (type
));
13874 t
= build_fixed (type
, f
);
13875 /* Propagate overflow flags. */
13876 if (overflow_p
| TREE_OVERFLOW (arg0
))
13877 TREE_OVERFLOW (t
) = 1;
13882 gcc_unreachable ();
13888 /* Return the tree for abs (ARG0) when ARG0 is known to be either
13889 an integer constant or real constant.
13891 TYPE is the type of the result. */
13894 fold_abs_const (tree arg0
, tree type
)
13896 tree t
= NULL_TREE
;
13898 switch (TREE_CODE (arg0
))
13902 /* If the value is unsigned or non-negative, then the absolute value
13903 is the same as the ordinary value. */
13904 if (!wi::neg_p (arg0
, TYPE_SIGN (type
)))
13907 /* If the value is negative, then the absolute value is
13912 wide_int val
= wi::neg (arg0
, &overflow
);
13913 t
= force_fit_type (type
, val
, -1,
13914 overflow
| TREE_OVERFLOW (arg0
));
13920 if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg0
)))
13921 t
= build_real (type
, real_value_negate (&TREE_REAL_CST (arg0
)));
13927 gcc_unreachable ();
13933 /* Return the tree for not (ARG0) when ARG0 is known to be an integer
13934 constant. TYPE is the type of the result. */
13937 fold_not_const (const_tree arg0
, tree type
)
13939 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
);
13941 return force_fit_type (type
, wi::bit_not (arg0
), 0, TREE_OVERFLOW (arg0
));
13944 /* Given CODE, a relational operator, the target type, TYPE and two
13945 constant operands OP0 and OP1, return the result of the
13946 relational operation. If the result is not a compile time
13947 constant, then return NULL_TREE. */
13950 fold_relational_const (enum tree_code code
, tree type
, tree op0
, tree op1
)
13952 int result
, invert
;
13954 /* From here on, the only cases we handle are when the result is
13955 known to be a constant. */
13957 if (TREE_CODE (op0
) == REAL_CST
&& TREE_CODE (op1
) == REAL_CST
)
13959 const REAL_VALUE_TYPE
*c0
= TREE_REAL_CST_PTR (op0
);
13960 const REAL_VALUE_TYPE
*c1
= TREE_REAL_CST_PTR (op1
);
13962 /* Handle the cases where either operand is a NaN. */
13963 if (real_isnan (c0
) || real_isnan (c1
))
13973 case UNORDERED_EXPR
:
13987 if (flag_trapping_math
)
13993 gcc_unreachable ();
13996 return constant_boolean_node (result
, type
);
13999 return constant_boolean_node (real_compare (code
, c0
, c1
), type
);
14002 if (TREE_CODE (op0
) == FIXED_CST
&& TREE_CODE (op1
) == FIXED_CST
)
14004 const FIXED_VALUE_TYPE
*c0
= TREE_FIXED_CST_PTR (op0
);
14005 const FIXED_VALUE_TYPE
*c1
= TREE_FIXED_CST_PTR (op1
);
14006 return constant_boolean_node (fixed_compare (code
, c0
, c1
), type
);
14009 /* Handle equality/inequality of complex constants. */
14010 if (TREE_CODE (op0
) == COMPLEX_CST
&& TREE_CODE (op1
) == COMPLEX_CST
)
14012 tree rcond
= fold_relational_const (code
, type
,
14013 TREE_REALPART (op0
),
14014 TREE_REALPART (op1
));
14015 tree icond
= fold_relational_const (code
, type
,
14016 TREE_IMAGPART (op0
),
14017 TREE_IMAGPART (op1
));
14018 if (code
== EQ_EXPR
)
14019 return fold_build2 (TRUTH_ANDIF_EXPR
, type
, rcond
, icond
);
14020 else if (code
== NE_EXPR
)
14021 return fold_build2 (TRUTH_ORIF_EXPR
, type
, rcond
, icond
);
14026 if (TREE_CODE (op0
) == VECTOR_CST
&& TREE_CODE (op1
) == VECTOR_CST
)
14028 if (!VECTOR_TYPE_P (type
))
14030 /* Have vector comparison with scalar boolean result. */
14031 bool result
= true;
14032 gcc_assert ((code
== EQ_EXPR
|| code
== NE_EXPR
)
14033 && VECTOR_CST_NELTS (op0
) == VECTOR_CST_NELTS (op1
));
14034 for (unsigned i
= 0; i
< VECTOR_CST_NELTS (op0
); i
++)
14036 tree elem0
= VECTOR_CST_ELT (op0
, i
);
14037 tree elem1
= VECTOR_CST_ELT (op1
, i
);
14038 tree tmp
= fold_relational_const (code
, type
, elem0
, elem1
);
14039 result
&= integer_onep (tmp
);
14041 if (code
== NE_EXPR
)
14043 return constant_boolean_node (result
, type
);
14045 unsigned count
= VECTOR_CST_NELTS (op0
);
14046 tree
*elts
= XALLOCAVEC (tree
, count
);
14047 gcc_assert (VECTOR_CST_NELTS (op1
) == count
14048 && TYPE_VECTOR_SUBPARTS (type
) == count
);
14050 for (unsigned i
= 0; i
< count
; i
++)
14052 tree elem_type
= TREE_TYPE (type
);
14053 tree elem0
= VECTOR_CST_ELT (op0
, i
);
14054 tree elem1
= VECTOR_CST_ELT (op1
, i
);
14056 tree tem
= fold_relational_const (code
, elem_type
,
14059 if (tem
== NULL_TREE
)
14062 elts
[i
] = build_int_cst (elem_type
, integer_zerop (tem
) ? 0 : -1);
14065 return build_vector (type
, elts
);
14068 /* From here on we only handle LT, LE, GT, GE, EQ and NE.
14070 To compute GT, swap the arguments and do LT.
14071 To compute GE, do LT and invert the result.
14072 To compute LE, swap the arguments, do LT and invert the result.
14073 To compute NE, do EQ and invert the result.
14075 Therefore, the code below must handle only EQ and LT. */
14077 if (code
== LE_EXPR
|| code
== GT_EXPR
)
14079 std::swap (op0
, op1
);
14080 code
= swap_tree_comparison (code
);
14083 /* Note that it is safe to invert for real values here because we
14084 have already handled the one case that it matters. */
14087 if (code
== NE_EXPR
|| code
== GE_EXPR
)
14090 code
= invert_tree_comparison (code
, false);
14093 /* Compute a result for LT or EQ if args permit;
14094 Otherwise return T. */
14095 if (TREE_CODE (op0
) == INTEGER_CST
&& TREE_CODE (op1
) == INTEGER_CST
)
14097 if (code
== EQ_EXPR
)
14098 result
= tree_int_cst_equal (op0
, op1
);
14100 result
= tree_int_cst_lt (op0
, op1
);
14107 return constant_boolean_node (result
, type
);
14110 /* If necessary, return a CLEANUP_POINT_EXPR for EXPR with the
14111 indicated TYPE. If no CLEANUP_POINT_EXPR is necessary, return EXPR
14115 fold_build_cleanup_point_expr (tree type
, tree expr
)
14117 /* If the expression does not have side effects then we don't have to wrap
14118 it with a cleanup point expression. */
14119 if (!TREE_SIDE_EFFECTS (expr
))
14122 /* If the expression is a return, check to see if the expression inside the
14123 return has no side effects or the right hand side of the modify expression
14124 inside the return. If either don't have side effects set we don't need to
14125 wrap the expression in a cleanup point expression. Note we don't check the
14126 left hand side of the modify because it should always be a return decl. */
14127 if (TREE_CODE (expr
) == RETURN_EXPR
)
14129 tree op
= TREE_OPERAND (expr
, 0);
14130 if (!op
|| !TREE_SIDE_EFFECTS (op
))
14132 op
= TREE_OPERAND (op
, 1);
14133 if (!TREE_SIDE_EFFECTS (op
))
14137 return build1 (CLEANUP_POINT_EXPR
, type
, expr
);
14140 /* Given a pointer value OP0 and a type TYPE, return a simplified version
14141 of an indirection through OP0, or NULL_TREE if no simplification is
14145 fold_indirect_ref_1 (location_t loc
, tree type
, tree op0
)
14151 subtype
= TREE_TYPE (sub
);
14152 if (!POINTER_TYPE_P (subtype
))
14155 if (TREE_CODE (sub
) == ADDR_EXPR
)
14157 tree op
= TREE_OPERAND (sub
, 0);
14158 tree optype
= TREE_TYPE (op
);
14159 /* *&CONST_DECL -> to the value of the const decl. */
14160 if (TREE_CODE (op
) == CONST_DECL
)
14161 return DECL_INITIAL (op
);
14162 /* *&p => p; make sure to handle *&"str"[cst] here. */
14163 if (type
== optype
)
14165 tree fop
= fold_read_from_constant_string (op
);
14171 /* *(foo *)&fooarray => fooarray[0] */
14172 else if (TREE_CODE (optype
) == ARRAY_TYPE
14173 && type
== TREE_TYPE (optype
)
14174 && (!in_gimple_form
14175 || TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
))
14177 tree type_domain
= TYPE_DOMAIN (optype
);
14178 tree min_val
= size_zero_node
;
14179 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
14180 min_val
= TYPE_MIN_VALUE (type_domain
);
14182 && TREE_CODE (min_val
) != INTEGER_CST
)
14184 return build4_loc (loc
, ARRAY_REF
, type
, op
, min_val
,
14185 NULL_TREE
, NULL_TREE
);
14187 /* *(foo *)&complexfoo => __real__ complexfoo */
14188 else if (TREE_CODE (optype
) == COMPLEX_TYPE
14189 && type
== TREE_TYPE (optype
))
14190 return fold_build1_loc (loc
, REALPART_EXPR
, type
, op
);
14191 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
14192 else if (TREE_CODE (optype
) == VECTOR_TYPE
14193 && type
== TREE_TYPE (optype
))
14195 tree part_width
= TYPE_SIZE (type
);
14196 tree index
= bitsize_int (0);
14197 return fold_build3_loc (loc
, BIT_FIELD_REF
, type
, op
, part_width
, index
);
14201 if (TREE_CODE (sub
) == POINTER_PLUS_EXPR
14202 && TREE_CODE (TREE_OPERAND (sub
, 1)) == INTEGER_CST
)
14204 tree op00
= TREE_OPERAND (sub
, 0);
14205 tree op01
= TREE_OPERAND (sub
, 1);
14208 if (TREE_CODE (op00
) == ADDR_EXPR
)
14211 op00
= TREE_OPERAND (op00
, 0);
14212 op00type
= TREE_TYPE (op00
);
14214 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
14215 if (TREE_CODE (op00type
) == VECTOR_TYPE
14216 && type
== TREE_TYPE (op00type
))
14218 HOST_WIDE_INT offset
= tree_to_shwi (op01
);
14219 tree part_width
= TYPE_SIZE (type
);
14220 unsigned HOST_WIDE_INT part_widthi
= tree_to_shwi (part_width
)/BITS_PER_UNIT
;
14221 unsigned HOST_WIDE_INT indexi
= offset
* BITS_PER_UNIT
;
14222 tree index
= bitsize_int (indexi
);
14224 if (offset
/ part_widthi
< TYPE_VECTOR_SUBPARTS (op00type
))
14225 return fold_build3_loc (loc
,
14226 BIT_FIELD_REF
, type
, op00
,
14227 part_width
, index
);
14230 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
14231 else if (TREE_CODE (op00type
) == COMPLEX_TYPE
14232 && type
== TREE_TYPE (op00type
))
14234 tree size
= TYPE_SIZE_UNIT (type
);
14235 if (tree_int_cst_equal (size
, op01
))
14236 return fold_build1_loc (loc
, IMAGPART_EXPR
, type
, op00
);
14238 /* ((foo *)&fooarray)[1] => fooarray[1] */
14239 else if (TREE_CODE (op00type
) == ARRAY_TYPE
14240 && type
== TREE_TYPE (op00type
))
14242 tree type_domain
= TYPE_DOMAIN (op00type
);
14243 tree min_val
= size_zero_node
;
14244 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
14245 min_val
= TYPE_MIN_VALUE (type_domain
);
14246 op01
= size_binop_loc (loc
, EXACT_DIV_EXPR
, op01
,
14247 TYPE_SIZE_UNIT (type
));
14248 op01
= size_binop_loc (loc
, PLUS_EXPR
, op01
, min_val
);
14249 return build4_loc (loc
, ARRAY_REF
, type
, op00
, op01
,
14250 NULL_TREE
, NULL_TREE
);
14255 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
14256 if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
14257 && type
== TREE_TYPE (TREE_TYPE (subtype
))
14258 && (!in_gimple_form
14259 || TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
))
14262 tree min_val
= size_zero_node
;
14263 sub
= build_fold_indirect_ref_loc (loc
, sub
);
14264 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
14265 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
14266 min_val
= TYPE_MIN_VALUE (type_domain
);
14268 && TREE_CODE (min_val
) != INTEGER_CST
)
14270 return build4_loc (loc
, ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
,
14277 /* Builds an expression for an indirection through T, simplifying some
14281 build_fold_indirect_ref_loc (location_t loc
, tree t
)
14283 tree type
= TREE_TYPE (TREE_TYPE (t
));
14284 tree sub
= fold_indirect_ref_1 (loc
, type
, t
);
14289 return build1_loc (loc
, INDIRECT_REF
, type
, t
);
14292 /* Given an INDIRECT_REF T, return either T or a simplified version. */
14295 fold_indirect_ref_loc (location_t loc
, tree t
)
14297 tree sub
= fold_indirect_ref_1 (loc
, TREE_TYPE (t
), TREE_OPERAND (t
, 0));
14305 /* Strip non-trapping, non-side-effecting tree nodes from an expression
14306 whose result is ignored. The type of the returned tree need not be
14307 the same as the original expression. */
14310 fold_ignored_result (tree t
)
14312 if (!TREE_SIDE_EFFECTS (t
))
14313 return integer_zero_node
;
14316 switch (TREE_CODE_CLASS (TREE_CODE (t
)))
14319 t
= TREE_OPERAND (t
, 0);
14323 case tcc_comparison
:
14324 if (!TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 1)))
14325 t
= TREE_OPERAND (t
, 0);
14326 else if (!TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 0)))
14327 t
= TREE_OPERAND (t
, 1);
14332 case tcc_expression
:
14333 switch (TREE_CODE (t
))
14335 case COMPOUND_EXPR
:
14336 if (TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 1)))
14338 t
= TREE_OPERAND (t
, 0);
14342 if (TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 1))
14343 || TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 2)))
14345 t
= TREE_OPERAND (t
, 0);
14358 /* Return the value of VALUE, rounded up to a multiple of DIVISOR. */
14361 round_up_loc (location_t loc
, tree value
, unsigned int divisor
)
14363 tree div
= NULL_TREE
;
14368 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
14369 have to do anything. Only do this when we are not given a const,
14370 because in that case, this check is more expensive than just
14372 if (TREE_CODE (value
) != INTEGER_CST
)
14374 div
= build_int_cst (TREE_TYPE (value
), divisor
);
14376 if (multiple_of_p (TREE_TYPE (value
), value
, div
))
14380 /* If divisor is a power of two, simplify this to bit manipulation. */
14381 if (divisor
== (divisor
& -divisor
))
14383 if (TREE_CODE (value
) == INTEGER_CST
)
14385 wide_int val
= value
;
14388 if ((val
& (divisor
- 1)) == 0)
14391 overflow_p
= TREE_OVERFLOW (value
);
14392 val
+= divisor
- 1;
14393 val
&= - (int) divisor
;
14397 return force_fit_type (TREE_TYPE (value
), val
, -1, overflow_p
);
14403 t
= build_int_cst (TREE_TYPE (value
), divisor
- 1);
14404 value
= size_binop_loc (loc
, PLUS_EXPR
, value
, t
);
14405 t
= build_int_cst (TREE_TYPE (value
), - (int) divisor
);
14406 value
= size_binop_loc (loc
, BIT_AND_EXPR
, value
, t
);
14412 div
= build_int_cst (TREE_TYPE (value
), divisor
);
14413 value
= size_binop_loc (loc
, CEIL_DIV_EXPR
, value
, div
);
14414 value
= size_binop_loc (loc
, MULT_EXPR
, value
, div
);
14420 /* Likewise, but round down. */
14423 round_down_loc (location_t loc
, tree value
, int divisor
)
14425 tree div
= NULL_TREE
;
14427 gcc_assert (divisor
> 0);
14431 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
14432 have to do anything. Only do this when we are not given a const,
14433 because in that case, this check is more expensive than just
14435 if (TREE_CODE (value
) != INTEGER_CST
)
14437 div
= build_int_cst (TREE_TYPE (value
), divisor
);
14439 if (multiple_of_p (TREE_TYPE (value
), value
, div
))
14443 /* If divisor is a power of two, simplify this to bit manipulation. */
14444 if (divisor
== (divisor
& -divisor
))
14448 t
= build_int_cst (TREE_TYPE (value
), -divisor
);
14449 value
= size_binop_loc (loc
, BIT_AND_EXPR
, value
, t
);
14454 div
= build_int_cst (TREE_TYPE (value
), divisor
);
14455 value
= size_binop_loc (loc
, FLOOR_DIV_EXPR
, value
, div
);
14456 value
= size_binop_loc (loc
, MULT_EXPR
, value
, div
);
14462 /* Returns the pointer to the base of the object addressed by EXP and
14463 extracts the information about the offset of the access, storing it
14464 to PBITPOS and POFFSET. */
14467 split_address_to_core_and_offset (tree exp
,
14468 HOST_WIDE_INT
*pbitpos
, tree
*poffset
)
14472 int unsignedp
, reversep
, volatilep
;
14473 HOST_WIDE_INT bitsize
;
14474 location_t loc
= EXPR_LOCATION (exp
);
14476 if (TREE_CODE (exp
) == ADDR_EXPR
)
14478 core
= get_inner_reference (TREE_OPERAND (exp
, 0), &bitsize
, pbitpos
,
14479 poffset
, &mode
, &unsignedp
, &reversep
,
14480 &volatilep
, false);
14481 core
= build_fold_addr_expr_loc (loc
, core
);
14487 *poffset
= NULL_TREE
;
14493 /* Returns true if addresses of E1 and E2 differ by a constant, false
14494 otherwise. If they do, E1 - E2 is stored in *DIFF. */
14497 ptr_difference_const (tree e1
, tree e2
, HOST_WIDE_INT
*diff
)
14500 HOST_WIDE_INT bitpos1
, bitpos2
;
14501 tree toffset1
, toffset2
, tdiff
, type
;
14503 core1
= split_address_to_core_and_offset (e1
, &bitpos1
, &toffset1
);
14504 core2
= split_address_to_core_and_offset (e2
, &bitpos2
, &toffset2
);
14506 if (bitpos1
% BITS_PER_UNIT
!= 0
14507 || bitpos2
% BITS_PER_UNIT
!= 0
14508 || !operand_equal_p (core1
, core2
, 0))
14511 if (toffset1
&& toffset2
)
14513 type
= TREE_TYPE (toffset1
);
14514 if (type
!= TREE_TYPE (toffset2
))
14515 toffset2
= fold_convert (type
, toffset2
);
14517 tdiff
= fold_build2 (MINUS_EXPR
, type
, toffset1
, toffset2
);
14518 if (!cst_and_fits_in_hwi (tdiff
))
14521 *diff
= int_cst_value (tdiff
);
14523 else if (toffset1
|| toffset2
)
14525 /* If only one of the offsets is non-constant, the difference cannot
14532 *diff
+= (bitpos1
- bitpos2
) / BITS_PER_UNIT
;
14536 /* Return OFF converted to a pointer offset type suitable as offset for
14537 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
14539 convert_to_ptrofftype_loc (location_t loc
, tree off
)
14541 return fold_convert_loc (loc
, sizetype
, off
);
14544 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
14546 fold_build_pointer_plus_loc (location_t loc
, tree ptr
, tree off
)
14548 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
14549 ptr
, convert_to_ptrofftype_loc (loc
, off
));
14552 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
14554 fold_build_pointer_plus_hwi_loc (location_t loc
, tree ptr
, HOST_WIDE_INT off
)
14556 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
14557 ptr
, size_int (off
));
14560 /* Return a char pointer for a C string if it is a string constant
14561 or sum of string constant and integer constant. */
14564 c_getstr (tree src
)
14568 src
= string_constant (src
, &offset_node
);
14572 if (offset_node
== 0)
14573 return TREE_STRING_POINTER (src
);
14574 else if (!tree_fits_uhwi_p (offset_node
)
14575 || compare_tree_int (offset_node
, TREE_STRING_LENGTH (src
) - 1) > 0)
14578 return TREE_STRING_POINTER (src
) + tree_to_uhwi (offset_node
);