1 /* Fold a constant sub-tree into a single node for C-compiler
2 Copyright (C) 1987-2019 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"
54 #include "tree-ssa-operands.h"
55 #include "optabs-query.h"
57 #include "diagnostic-core.h"
60 #include "fold-const.h"
61 #include "fold-const-call.h"
62 #include "stor-layout.h"
64 #include "tree-iterator.h"
67 #include "langhooks.h"
72 #include "generic-match.h"
73 #include "gimple-fold.h"
75 #include "tree-into-ssa.h"
77 #include "case-cfn-macros.h"
78 #include "stringpool.h"
80 #include "tree-ssanames.h"
82 #include "stringpool.h"
84 #include "tree-vector-builder.h"
85 #include "vec-perm-indices.h"
87 /* Nonzero if we are folding constants inside an initializer; zero
89 int folding_initializer
= 0;
91 /* The following constants represent a bit based encoding of GCC's
92 comparison operators. This encoding simplifies transformations
93 on relational comparison operators, such as AND and OR. */
94 enum comparison_code
{
113 static bool negate_expr_p (tree
);
114 static tree
negate_expr (tree
);
115 static tree
associate_trees (location_t
, tree
, tree
, enum tree_code
, tree
);
116 static enum comparison_code
comparison_to_compcode (enum tree_code
);
117 static enum tree_code
compcode_to_comparison (enum comparison_code
);
118 static bool twoval_comparison_p (tree
, tree
*, tree
*);
119 static tree
eval_subst (location_t
, tree
, tree
, tree
, tree
, tree
);
120 static tree
optimize_bit_field_compare (location_t
, enum tree_code
,
122 static bool simple_operand_p (const_tree
);
123 static bool simple_operand_p_2 (tree
);
124 static tree
range_binop (enum tree_code
, tree
, tree
, int, tree
, int);
125 static tree
range_predecessor (tree
);
126 static tree
range_successor (tree
);
127 static tree
fold_range_test (location_t
, enum tree_code
, tree
, tree
, tree
);
128 static tree
fold_cond_expr_with_comparison (location_t
, tree
, tree
, tree
, tree
);
129 static tree
unextend (tree
, int, int, tree
);
130 static tree
extract_muldiv (tree
, tree
, enum tree_code
, tree
, bool *);
131 static tree
extract_muldiv_1 (tree
, tree
, enum tree_code
, tree
, bool *);
132 static tree
fold_binary_op_with_conditional_arg (location_t
,
133 enum tree_code
, tree
,
136 static tree
fold_negate_const (tree
, tree
);
137 static tree
fold_not_const (const_tree
, tree
);
138 static tree
fold_relational_const (enum tree_code
, tree
, tree
, tree
);
139 static tree
fold_convert_const (enum tree_code
, tree
, tree
);
140 static tree
fold_view_convert_expr (tree
, tree
);
141 static tree
fold_negate_expr (location_t
, tree
);
144 /* Return EXPR_LOCATION of T if it is not UNKNOWN_LOCATION.
145 Otherwise, return LOC. */
148 expr_location_or (tree t
, location_t loc
)
150 location_t tloc
= EXPR_LOCATION (t
);
151 return tloc
== UNKNOWN_LOCATION
? loc
: tloc
;
154 /* Similar to protected_set_expr_location, but never modify x in place,
155 if location can and needs to be set, unshare it. */
158 protected_set_expr_location_unshare (tree x
, location_t loc
)
160 if (CAN_HAVE_LOCATION_P (x
)
161 && EXPR_LOCATION (x
) != loc
162 && !(TREE_CODE (x
) == SAVE_EXPR
163 || TREE_CODE (x
) == TARGET_EXPR
164 || TREE_CODE (x
) == BIND_EXPR
))
167 SET_EXPR_LOCATION (x
, loc
);
172 /* If ARG2 divides ARG1 with zero remainder, carries out the exact
173 division and returns the quotient. Otherwise returns
177 div_if_zero_remainder (const_tree arg1
, const_tree arg2
)
181 if (wi::multiple_of_p (wi::to_widest (arg1
), wi::to_widest (arg2
),
183 return wide_int_to_tree (TREE_TYPE (arg1
), quo
);
188 /* This is nonzero if we should defer warnings about undefined
189 overflow. This facility exists because these warnings are a
190 special case. The code to estimate loop iterations does not want
191 to issue any warnings, since it works with expressions which do not
192 occur in user code. Various bits of cleanup code call fold(), but
193 only use the result if it has certain characteristics (e.g., is a
194 constant); that code only wants to issue a warning if the result is
197 static int fold_deferring_overflow_warnings
;
199 /* If a warning about undefined overflow is deferred, this is the
200 warning. Note that this may cause us to turn two warnings into
201 one, but that is fine since it is sufficient to only give one
202 warning per expression. */
204 static const char* fold_deferred_overflow_warning
;
206 /* If a warning about undefined overflow is deferred, this is the
207 level at which the warning should be emitted. */
209 static enum warn_strict_overflow_code fold_deferred_overflow_code
;
211 /* Start deferring overflow warnings. We could use a stack here to
212 permit nested calls, but at present it is not necessary. */
215 fold_defer_overflow_warnings (void)
217 ++fold_deferring_overflow_warnings
;
220 /* Stop deferring overflow warnings. If there is a pending warning,
221 and ISSUE is true, then issue the warning if appropriate. STMT is
222 the statement with which the warning should be associated (used for
223 location information); STMT may be NULL. CODE is the level of the
224 warning--a warn_strict_overflow_code value. This function will use
225 the smaller of CODE and the deferred code when deciding whether to
226 issue the warning. CODE may be zero to mean to always use the
230 fold_undefer_overflow_warnings (bool issue
, const gimple
*stmt
, int code
)
235 gcc_assert (fold_deferring_overflow_warnings
> 0);
236 --fold_deferring_overflow_warnings
;
237 if (fold_deferring_overflow_warnings
> 0)
239 if (fold_deferred_overflow_warning
!= NULL
241 && code
< (int) fold_deferred_overflow_code
)
242 fold_deferred_overflow_code
= (enum warn_strict_overflow_code
) code
;
246 warnmsg
= fold_deferred_overflow_warning
;
247 fold_deferred_overflow_warning
= NULL
;
249 if (!issue
|| warnmsg
== NULL
)
252 if (gimple_no_warning_p (stmt
))
255 /* Use the smallest code level when deciding to issue the
257 if (code
== 0 || code
> (int) fold_deferred_overflow_code
)
258 code
= fold_deferred_overflow_code
;
260 if (!issue_strict_overflow_warning (code
))
264 locus
= input_location
;
266 locus
= gimple_location (stmt
);
267 warning_at (locus
, OPT_Wstrict_overflow
, "%s", warnmsg
);
270 /* Stop deferring overflow warnings, ignoring any deferred
274 fold_undefer_and_ignore_overflow_warnings (void)
276 fold_undefer_overflow_warnings (false, NULL
, 0);
279 /* Whether we are deferring overflow warnings. */
282 fold_deferring_overflow_warnings_p (void)
284 return fold_deferring_overflow_warnings
> 0;
287 /* This is called when we fold something based on the fact that signed
288 overflow is undefined. */
291 fold_overflow_warning (const char* gmsgid
, enum warn_strict_overflow_code wc
)
293 if (fold_deferring_overflow_warnings
> 0)
295 if (fold_deferred_overflow_warning
== NULL
296 || wc
< fold_deferred_overflow_code
)
298 fold_deferred_overflow_warning
= gmsgid
;
299 fold_deferred_overflow_code
= wc
;
302 else if (issue_strict_overflow_warning (wc
))
303 warning (OPT_Wstrict_overflow
, gmsgid
);
306 /* Return true if the built-in mathematical function specified by CODE
307 is odd, i.e. -f(x) == f(-x). */
310 negate_mathfn_p (combined_fn fn
)
333 CASE_CFN_ROUNDEVEN_FN
:
345 return !flag_rounding_math
;
353 /* Check whether we may negate an integer constant T without causing
357 may_negate_without_overflow_p (const_tree t
)
361 gcc_assert (TREE_CODE (t
) == INTEGER_CST
);
363 type
= TREE_TYPE (t
);
364 if (TYPE_UNSIGNED (type
))
367 return !wi::only_sign_bit_p (wi::to_wide (t
));
370 /* Determine whether an expression T can be cheaply negated using
371 the function negate_expr without introducing undefined overflow. */
374 negate_expr_p (tree t
)
381 type
= TREE_TYPE (t
);
384 switch (TREE_CODE (t
))
387 if (INTEGRAL_TYPE_P (type
) && TYPE_UNSIGNED (type
))
390 /* Check that -CST will not overflow type. */
391 return may_negate_without_overflow_p (t
);
393 return (INTEGRAL_TYPE_P (type
)
394 && TYPE_OVERFLOW_WRAPS (type
));
400 return !TYPE_OVERFLOW_SANITIZED (type
);
403 /* We want to canonicalize to positive real constants. Pretend
404 that only negative ones can be easily negated. */
405 return REAL_VALUE_NEGATIVE (TREE_REAL_CST (t
));
408 return negate_expr_p (TREE_REALPART (t
))
409 && negate_expr_p (TREE_IMAGPART (t
));
413 if (FLOAT_TYPE_P (TREE_TYPE (type
)) || TYPE_OVERFLOW_WRAPS (type
))
416 /* Steps don't prevent negation. */
417 unsigned int count
= vector_cst_encoded_nelts (t
);
418 for (unsigned int i
= 0; i
< count
; ++i
)
419 if (!negate_expr_p (VECTOR_CST_ENCODED_ELT (t
, i
)))
426 return negate_expr_p (TREE_OPERAND (t
, 0))
427 && negate_expr_p (TREE_OPERAND (t
, 1));
430 return negate_expr_p (TREE_OPERAND (t
, 0));
433 if (HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
434 || HONOR_SIGNED_ZEROS (element_mode (type
))
435 || (ANY_INTEGRAL_TYPE_P (type
)
436 && ! TYPE_OVERFLOW_WRAPS (type
)))
438 /* -(A + B) -> (-B) - A. */
439 if (negate_expr_p (TREE_OPERAND (t
, 1)))
441 /* -(A + B) -> (-A) - B. */
442 return negate_expr_p (TREE_OPERAND (t
, 0));
445 /* We can't turn -(A-B) into B-A when we honor signed zeros. */
446 return !HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
447 && !HONOR_SIGNED_ZEROS (element_mode (type
))
448 && (! ANY_INTEGRAL_TYPE_P (type
)
449 || TYPE_OVERFLOW_WRAPS (type
));
452 if (TYPE_UNSIGNED (type
))
454 /* INT_MIN/n * n doesn't overflow while negating one operand it does
455 if n is a (negative) power of two. */
456 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
457 && ! TYPE_OVERFLOW_WRAPS (TREE_TYPE (t
))
458 && ! ((TREE_CODE (TREE_OPERAND (t
, 0)) == INTEGER_CST
460 (wi::abs (wi::to_wide (TREE_OPERAND (t
, 0))))) != 1)
461 || (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
463 (wi::abs (wi::to_wide (TREE_OPERAND (t
, 1))))) != 1)))
469 if (! HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (TREE_TYPE (t
))))
470 return negate_expr_p (TREE_OPERAND (t
, 1))
471 || negate_expr_p (TREE_OPERAND (t
, 0));
477 if (TYPE_UNSIGNED (type
))
479 /* In general we can't negate A in A / B, because if A is INT_MIN and
480 B is not 1 we change the sign of the result. */
481 if (TREE_CODE (TREE_OPERAND (t
, 0)) == INTEGER_CST
482 && negate_expr_p (TREE_OPERAND (t
, 0)))
484 /* In general we can't negate B in A / B, because if A is INT_MIN and
485 B is 1, we may turn this into INT_MIN / -1 which is undefined
486 and actually traps on some architectures. */
487 if (! ANY_INTEGRAL_TYPE_P (TREE_TYPE (t
))
488 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (t
))
489 || (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
490 && ! integer_onep (TREE_OPERAND (t
, 1))))
491 return negate_expr_p (TREE_OPERAND (t
, 1));
495 /* Negate -((double)float) as (double)(-float). */
496 if (TREE_CODE (type
) == REAL_TYPE
)
498 tree tem
= strip_float_extensions (t
);
500 return negate_expr_p (tem
);
505 /* Negate -f(x) as f(-x). */
506 if (negate_mathfn_p (get_call_combined_fn (t
)))
507 return negate_expr_p (CALL_EXPR_ARG (t
, 0));
511 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
512 if (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
)
514 tree op1
= TREE_OPERAND (t
, 1);
515 if (wi::to_wide (op1
) == TYPE_PRECISION (type
) - 1)
526 /* Given T, an expression, return a folded tree for -T or NULL_TREE, if no
527 simplification is possible.
528 If negate_expr_p would return true for T, NULL_TREE will never be
532 fold_negate_expr_1 (location_t loc
, tree t
)
534 tree type
= TREE_TYPE (t
);
537 switch (TREE_CODE (t
))
539 /* Convert - (~A) to A + 1. */
541 if (INTEGRAL_TYPE_P (type
))
542 return fold_build2_loc (loc
, PLUS_EXPR
, type
, TREE_OPERAND (t
, 0),
543 build_one_cst (type
));
547 tem
= fold_negate_const (t
, type
);
548 if (TREE_OVERFLOW (tem
) == TREE_OVERFLOW (t
)
549 || (ANY_INTEGRAL_TYPE_P (type
)
550 && !TYPE_OVERFLOW_TRAPS (type
)
551 && TYPE_OVERFLOW_WRAPS (type
))
552 || (flag_sanitize
& SANITIZE_SI_OVERFLOW
) == 0)
559 tem
= fold_negate_const (t
, type
);
564 tree rpart
= fold_negate_expr (loc
, TREE_REALPART (t
));
565 tree ipart
= fold_negate_expr (loc
, TREE_IMAGPART (t
));
567 return build_complex (type
, rpart
, ipart
);
573 tree_vector_builder elts
;
574 elts
.new_unary_operation (type
, t
, true);
575 unsigned int count
= elts
.encoded_nelts ();
576 for (unsigned int i
= 0; i
< count
; ++i
)
578 tree elt
= fold_negate_expr (loc
, VECTOR_CST_ELT (t
, i
));
579 if (elt
== NULL_TREE
)
581 elts
.quick_push (elt
);
584 return elts
.build ();
588 if (negate_expr_p (t
))
589 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
590 fold_negate_expr (loc
, TREE_OPERAND (t
, 0)),
591 fold_negate_expr (loc
, TREE_OPERAND (t
, 1)));
595 if (negate_expr_p (t
))
596 return fold_build1_loc (loc
, CONJ_EXPR
, type
,
597 fold_negate_expr (loc
, TREE_OPERAND (t
, 0)));
601 if (!TYPE_OVERFLOW_SANITIZED (type
))
602 return TREE_OPERAND (t
, 0);
606 if (!HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
607 && !HONOR_SIGNED_ZEROS (element_mode (type
)))
609 /* -(A + B) -> (-B) - A. */
610 if (negate_expr_p (TREE_OPERAND (t
, 1)))
612 tem
= negate_expr (TREE_OPERAND (t
, 1));
613 return fold_build2_loc (loc
, MINUS_EXPR
, type
,
614 tem
, TREE_OPERAND (t
, 0));
617 /* -(A + B) -> (-A) - B. */
618 if (negate_expr_p (TREE_OPERAND (t
, 0)))
620 tem
= negate_expr (TREE_OPERAND (t
, 0));
621 return fold_build2_loc (loc
, MINUS_EXPR
, type
,
622 tem
, TREE_OPERAND (t
, 1));
628 /* - (A - B) -> B - A */
629 if (!HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
630 && !HONOR_SIGNED_ZEROS (element_mode (type
)))
631 return fold_build2_loc (loc
, MINUS_EXPR
, type
,
632 TREE_OPERAND (t
, 1), TREE_OPERAND (t
, 0));
636 if (TYPE_UNSIGNED (type
))
642 if (! HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
)))
644 tem
= TREE_OPERAND (t
, 1);
645 if (negate_expr_p (tem
))
646 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
647 TREE_OPERAND (t
, 0), negate_expr (tem
));
648 tem
= TREE_OPERAND (t
, 0);
649 if (negate_expr_p (tem
))
650 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
651 negate_expr (tem
), TREE_OPERAND (t
, 1));
658 if (TYPE_UNSIGNED (type
))
660 /* In general we can't negate A in A / B, because if A is INT_MIN and
661 B is not 1 we change the sign of the result. */
662 if (TREE_CODE (TREE_OPERAND (t
, 0)) == INTEGER_CST
663 && negate_expr_p (TREE_OPERAND (t
, 0)))
664 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
665 negate_expr (TREE_OPERAND (t
, 0)),
666 TREE_OPERAND (t
, 1));
667 /* In general we can't negate B in A / B, because if A is INT_MIN and
668 B is 1, we may turn this into INT_MIN / -1 which is undefined
669 and actually traps on some architectures. */
670 if ((! ANY_INTEGRAL_TYPE_P (TREE_TYPE (t
))
671 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (t
))
672 || (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
673 && ! integer_onep (TREE_OPERAND (t
, 1))))
674 && negate_expr_p (TREE_OPERAND (t
, 1)))
675 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
677 negate_expr (TREE_OPERAND (t
, 1)));
681 /* Convert -((double)float) into (double)(-float). */
682 if (TREE_CODE (type
) == REAL_TYPE
)
684 tem
= strip_float_extensions (t
);
685 if (tem
!= t
&& negate_expr_p (tem
))
686 return fold_convert_loc (loc
, type
, negate_expr (tem
));
691 /* Negate -f(x) as f(-x). */
692 if (negate_mathfn_p (get_call_combined_fn (t
))
693 && negate_expr_p (CALL_EXPR_ARG (t
, 0)))
697 fndecl
= get_callee_fndecl (t
);
698 arg
= negate_expr (CALL_EXPR_ARG (t
, 0));
699 return build_call_expr_loc (loc
, fndecl
, 1, arg
);
704 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
705 if (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
)
707 tree op1
= TREE_OPERAND (t
, 1);
708 if (wi::to_wide (op1
) == TYPE_PRECISION (type
) - 1)
710 tree ntype
= TYPE_UNSIGNED (type
)
711 ? signed_type_for (type
)
712 : unsigned_type_for (type
);
713 tree temp
= fold_convert_loc (loc
, ntype
, TREE_OPERAND (t
, 0));
714 temp
= fold_build2_loc (loc
, RSHIFT_EXPR
, ntype
, temp
, op1
);
715 return fold_convert_loc (loc
, type
, temp
);
727 /* A wrapper for fold_negate_expr_1. */
730 fold_negate_expr (location_t loc
, tree t
)
732 tree type
= TREE_TYPE (t
);
734 tree tem
= fold_negate_expr_1 (loc
, t
);
735 if (tem
== NULL_TREE
)
737 return fold_convert_loc (loc
, type
, tem
);
740 /* Like fold_negate_expr, but return a NEGATE_EXPR tree, if T cannot be
741 negated in a simpler way. Also allow for T to be NULL_TREE, in which case
753 loc
= EXPR_LOCATION (t
);
754 type
= TREE_TYPE (t
);
757 tem
= fold_negate_expr (loc
, t
);
759 tem
= build1_loc (loc
, NEGATE_EXPR
, TREE_TYPE (t
), t
);
760 return fold_convert_loc (loc
, type
, tem
);
763 /* Split a tree IN into a constant, literal and variable parts that could be
764 combined with CODE to make IN. "constant" means an expression with
765 TREE_CONSTANT but that isn't an actual constant. CODE must be a
766 commutative arithmetic operation. Store the constant part into *CONP,
767 the literal in *LITP and return the variable part. If a part isn't
768 present, set it to null. If the tree does not decompose in this way,
769 return the entire tree as the variable part and the other parts as null.
771 If CODE is PLUS_EXPR we also split trees that use MINUS_EXPR. In that
772 case, we negate an operand that was subtracted. Except if it is a
773 literal for which we use *MINUS_LITP instead.
775 If NEGATE_P is true, we are negating all of IN, again except a literal
776 for which we use *MINUS_LITP instead. If a variable part is of pointer
777 type, it is negated after converting to TYPE. This prevents us from
778 generating illegal MINUS pointer expression. LOC is the location of
779 the converted variable part.
781 If IN is itself a literal or constant, return it as appropriate.
783 Note that we do not guarantee that any of the three values will be the
784 same type as IN, but they will have the same signedness and mode. */
787 split_tree (tree in
, tree type
, enum tree_code code
,
788 tree
*minus_varp
, tree
*conp
, tree
*minus_conp
,
789 tree
*litp
, tree
*minus_litp
, int negate_p
)
798 /* Strip any conversions that don't change the machine mode or signedness. */
799 STRIP_SIGN_NOPS (in
);
801 if (TREE_CODE (in
) == INTEGER_CST
|| TREE_CODE (in
) == REAL_CST
802 || TREE_CODE (in
) == FIXED_CST
)
804 else if (TREE_CODE (in
) == code
805 || ((! FLOAT_TYPE_P (TREE_TYPE (in
)) || flag_associative_math
)
806 && ! SAT_FIXED_POINT_TYPE_P (TREE_TYPE (in
))
807 /* We can associate addition and subtraction together (even
808 though the C standard doesn't say so) for integers because
809 the value is not affected. For reals, the value might be
810 affected, so we can't. */
811 && ((code
== PLUS_EXPR
&& TREE_CODE (in
) == POINTER_PLUS_EXPR
)
812 || (code
== PLUS_EXPR
&& TREE_CODE (in
) == MINUS_EXPR
)
813 || (code
== MINUS_EXPR
814 && (TREE_CODE (in
) == PLUS_EXPR
815 || TREE_CODE (in
) == POINTER_PLUS_EXPR
)))))
817 tree op0
= TREE_OPERAND (in
, 0);
818 tree op1
= TREE_OPERAND (in
, 1);
819 int neg1_p
= TREE_CODE (in
) == MINUS_EXPR
;
820 int neg_litp_p
= 0, neg_conp_p
= 0, neg_var_p
= 0;
822 /* First see if either of the operands is a literal, then a constant. */
823 if (TREE_CODE (op0
) == INTEGER_CST
|| TREE_CODE (op0
) == REAL_CST
824 || TREE_CODE (op0
) == FIXED_CST
)
825 *litp
= op0
, op0
= 0;
826 else if (TREE_CODE (op1
) == INTEGER_CST
|| TREE_CODE (op1
) == REAL_CST
827 || TREE_CODE (op1
) == FIXED_CST
)
828 *litp
= op1
, neg_litp_p
= neg1_p
, op1
= 0;
830 if (op0
!= 0 && TREE_CONSTANT (op0
))
831 *conp
= op0
, op0
= 0;
832 else if (op1
!= 0 && TREE_CONSTANT (op1
))
833 *conp
= op1
, neg_conp_p
= neg1_p
, op1
= 0;
835 /* If we haven't dealt with either operand, this is not a case we can
836 decompose. Otherwise, VAR is either of the ones remaining, if any. */
837 if (op0
!= 0 && op1
!= 0)
842 var
= op1
, neg_var_p
= neg1_p
;
844 /* Now do any needed negations. */
846 *minus_litp
= *litp
, *litp
= 0;
847 if (neg_conp_p
&& *conp
)
848 *minus_conp
= *conp
, *conp
= 0;
849 if (neg_var_p
&& var
)
850 *minus_varp
= var
, var
= 0;
852 else if (TREE_CONSTANT (in
))
854 else if (TREE_CODE (in
) == BIT_NOT_EXPR
855 && code
== PLUS_EXPR
)
857 /* -1 - X is folded to ~X, undo that here. Do _not_ do this
858 when IN is constant. */
859 *litp
= build_minus_one_cst (type
);
860 *minus_varp
= TREE_OPERAND (in
, 0);
868 *minus_litp
= *litp
, *litp
= 0;
869 else if (*minus_litp
)
870 *litp
= *minus_litp
, *minus_litp
= 0;
872 *minus_conp
= *conp
, *conp
= 0;
873 else if (*minus_conp
)
874 *conp
= *minus_conp
, *minus_conp
= 0;
876 *minus_varp
= var
, var
= 0;
877 else if (*minus_varp
)
878 var
= *minus_varp
, *minus_varp
= 0;
882 && TREE_OVERFLOW_P (*litp
))
883 *litp
= drop_tree_overflow (*litp
);
885 && TREE_OVERFLOW_P (*minus_litp
))
886 *minus_litp
= drop_tree_overflow (*minus_litp
);
891 /* Re-associate trees split by the above function. T1 and T2 are
892 either expressions to associate or null. Return the new
893 expression, if any. LOC is the location of the new expression. If
894 we build an operation, do it in TYPE and with CODE. */
897 associate_trees (location_t loc
, tree t1
, tree t2
, enum tree_code code
, tree type
)
901 gcc_assert (t2
== 0 || code
!= MINUS_EXPR
);
907 /* If either input is CODE, a PLUS_EXPR, or a MINUS_EXPR, don't
908 try to fold this since we will have infinite recursion. But do
909 deal with any NEGATE_EXPRs. */
910 if (TREE_CODE (t1
) == code
|| TREE_CODE (t2
) == code
911 || TREE_CODE (t1
) == PLUS_EXPR
|| TREE_CODE (t2
) == PLUS_EXPR
912 || TREE_CODE (t1
) == MINUS_EXPR
|| TREE_CODE (t2
) == MINUS_EXPR
)
914 if (code
== PLUS_EXPR
)
916 if (TREE_CODE (t1
) == NEGATE_EXPR
)
917 return build2_loc (loc
, MINUS_EXPR
, type
,
918 fold_convert_loc (loc
, type
, t2
),
919 fold_convert_loc (loc
, type
,
920 TREE_OPERAND (t1
, 0)));
921 else if (TREE_CODE (t2
) == NEGATE_EXPR
)
922 return build2_loc (loc
, MINUS_EXPR
, type
,
923 fold_convert_loc (loc
, type
, t1
),
924 fold_convert_loc (loc
, type
,
925 TREE_OPERAND (t2
, 0)));
926 else if (integer_zerop (t2
))
927 return fold_convert_loc (loc
, type
, t1
);
929 else if (code
== MINUS_EXPR
)
931 if (integer_zerop (t2
))
932 return fold_convert_loc (loc
, type
, t1
);
935 return build2_loc (loc
, code
, type
, fold_convert_loc (loc
, type
, t1
),
936 fold_convert_loc (loc
, type
, t2
));
939 return fold_build2_loc (loc
, code
, type
, fold_convert_loc (loc
, type
, t1
),
940 fold_convert_loc (loc
, type
, t2
));
943 /* Check whether TYPE1 and TYPE2 are equivalent integer types, suitable
944 for use in int_const_binop, size_binop and size_diffop. */
947 int_binop_types_match_p (enum tree_code code
, const_tree type1
, const_tree type2
)
949 if (!INTEGRAL_TYPE_P (type1
) && !POINTER_TYPE_P (type1
))
951 if (!INTEGRAL_TYPE_P (type2
) && !POINTER_TYPE_P (type2
))
966 return TYPE_UNSIGNED (type1
) == TYPE_UNSIGNED (type2
)
967 && TYPE_PRECISION (type1
) == TYPE_PRECISION (type2
)
968 && TYPE_MODE (type1
) == TYPE_MODE (type2
);
971 /* Combine two wide ints ARG1 and ARG2 under operation CODE to produce
972 a new constant in RES. Return FALSE if we don't know how to
973 evaluate CODE at compile-time. */
976 wide_int_binop (wide_int
&res
,
977 enum tree_code code
, const wide_int
&arg1
, const wide_int
&arg2
,
978 signop sign
, wi::overflow_type
*overflow
)
981 *overflow
= wi::OVF_NONE
;
985 res
= wi::bit_or (arg1
, arg2
);
989 res
= wi::bit_xor (arg1
, arg2
);
993 res
= wi::bit_and (arg1
, arg2
);
998 if (wi::neg_p (arg2
))
1001 if (code
== RSHIFT_EXPR
)
1009 if (code
== RSHIFT_EXPR
)
1010 /* It's unclear from the C standard whether shifts can overflow.
1011 The following code ignores overflow; perhaps a C standard
1012 interpretation ruling is needed. */
1013 res
= wi::rshift (arg1
, tmp
, sign
);
1015 res
= wi::lshift (arg1
, tmp
);
1020 if (wi::neg_p (arg2
))
1023 if (code
== RROTATE_EXPR
)
1024 code
= LROTATE_EXPR
;
1026 code
= RROTATE_EXPR
;
1031 if (code
== RROTATE_EXPR
)
1032 res
= wi::rrotate (arg1
, tmp
);
1034 res
= wi::lrotate (arg1
, tmp
);
1038 res
= wi::add (arg1
, arg2
, sign
, overflow
);
1042 res
= wi::sub (arg1
, arg2
, sign
, overflow
);
1046 res
= wi::mul (arg1
, arg2
, sign
, overflow
);
1049 case MULT_HIGHPART_EXPR
:
1050 res
= wi::mul_high (arg1
, arg2
, sign
);
1053 case TRUNC_DIV_EXPR
:
1054 case EXACT_DIV_EXPR
:
1057 res
= wi::div_trunc (arg1
, arg2
, sign
, overflow
);
1060 case FLOOR_DIV_EXPR
:
1063 res
= wi::div_floor (arg1
, arg2
, sign
, overflow
);
1069 res
= wi::div_ceil (arg1
, arg2
, sign
, overflow
);
1072 case ROUND_DIV_EXPR
:
1075 res
= wi::div_round (arg1
, arg2
, sign
, overflow
);
1078 case TRUNC_MOD_EXPR
:
1081 res
= wi::mod_trunc (arg1
, arg2
, sign
, overflow
);
1084 case FLOOR_MOD_EXPR
:
1087 res
= wi::mod_floor (arg1
, arg2
, sign
, overflow
);
1093 res
= wi::mod_ceil (arg1
, arg2
, sign
, overflow
);
1096 case ROUND_MOD_EXPR
:
1099 res
= wi::mod_round (arg1
, arg2
, sign
, overflow
);
1103 res
= wi::min (arg1
, arg2
, sign
);
1107 res
= wi::max (arg1
, arg2
, sign
);
1116 /* Combine two poly int's ARG1 and ARG2 under operation CODE to
1117 produce a new constant in RES. Return FALSE if we don't know how
1118 to evaluate CODE at compile-time. */
1121 poly_int_binop (poly_wide_int
&res
, enum tree_code code
,
1122 const_tree arg1
, const_tree arg2
,
1123 signop sign
, wi::overflow_type
*overflow
)
1125 gcc_assert (NUM_POLY_INT_COEFFS
!= 1);
1126 gcc_assert (poly_int_tree_p (arg1
) && poly_int_tree_p (arg2
));
1130 res
= wi::add (wi::to_poly_wide (arg1
),
1131 wi::to_poly_wide (arg2
), sign
, overflow
);
1135 res
= wi::sub (wi::to_poly_wide (arg1
),
1136 wi::to_poly_wide (arg2
), sign
, overflow
);
1140 if (TREE_CODE (arg2
) == INTEGER_CST
)
1141 res
= wi::mul (wi::to_poly_wide (arg1
),
1142 wi::to_wide (arg2
), sign
, overflow
);
1143 else if (TREE_CODE (arg1
) == INTEGER_CST
)
1144 res
= wi::mul (wi::to_poly_wide (arg2
),
1145 wi::to_wide (arg1
), sign
, overflow
);
1151 if (TREE_CODE (arg2
) == INTEGER_CST
)
1152 res
= wi::to_poly_wide (arg1
) << wi::to_wide (arg2
);
1158 if (TREE_CODE (arg2
) != INTEGER_CST
1159 || !can_ior_p (wi::to_poly_wide (arg1
), wi::to_wide (arg2
),
1170 /* Combine two integer constants ARG1 and ARG2 under operation CODE to
1171 produce a new constant. Return NULL_TREE if we don't know how to
1172 evaluate CODE at compile-time. */
1175 int_const_binop (enum tree_code code
, const_tree arg1
, const_tree arg2
,
1178 poly_wide_int poly_res
;
1179 tree type
= TREE_TYPE (arg1
);
1180 signop sign
= TYPE_SIGN (type
);
1181 wi::overflow_type overflow
= wi::OVF_NONE
;
1183 if (TREE_CODE (arg1
) == INTEGER_CST
&& TREE_CODE (arg2
) == INTEGER_CST
)
1185 wide_int warg1
= wi::to_wide (arg1
), res
;
1186 wide_int warg2
= wi::to_wide (arg2
, TYPE_PRECISION (type
));
1187 if (!wide_int_binop (res
, code
, warg1
, warg2
, sign
, &overflow
))
1191 else if (!poly_int_tree_p (arg1
)
1192 || !poly_int_tree_p (arg2
)
1193 || !poly_int_binop (poly_res
, code
, arg1
, arg2
, sign
, &overflow
))
1195 return force_fit_type (type
, poly_res
, overflowable
,
1196 (((sign
== SIGNED
|| overflowable
== -1)
1198 | TREE_OVERFLOW (arg1
) | TREE_OVERFLOW (arg2
)));
1201 /* Return true if binary operation OP distributes over addition in operand
1202 OPNO, with the other operand being held constant. OPNO counts from 1. */
1205 distributes_over_addition_p (tree_code op
, int opno
)
1222 /* Combine two constants ARG1 and ARG2 under operation CODE to produce a new
1223 constant. We assume ARG1 and ARG2 have the same data type, or at least
1224 are the same kind of constant and the same machine mode. Return zero if
1225 combining the constants is not allowed in the current operating mode. */
1228 const_binop (enum tree_code code
, tree arg1
, tree arg2
)
1230 /* Sanity check for the recursive cases. */
1237 if (poly_int_tree_p (arg1
) && poly_int_tree_p (arg2
))
1239 if (code
== POINTER_PLUS_EXPR
)
1240 return int_const_binop (PLUS_EXPR
,
1241 arg1
, fold_convert (TREE_TYPE (arg1
), arg2
));
1243 return int_const_binop (code
, arg1
, arg2
);
1246 if (TREE_CODE (arg1
) == REAL_CST
&& TREE_CODE (arg2
) == REAL_CST
)
1251 REAL_VALUE_TYPE value
;
1252 REAL_VALUE_TYPE result
;
1256 /* The following codes are handled by real_arithmetic. */
1271 d1
= TREE_REAL_CST (arg1
);
1272 d2
= TREE_REAL_CST (arg2
);
1274 type
= TREE_TYPE (arg1
);
1275 mode
= TYPE_MODE (type
);
1277 /* Don't perform operation if we honor signaling NaNs and
1278 either operand is a signaling NaN. */
1279 if (HONOR_SNANS (mode
)
1280 && (REAL_VALUE_ISSIGNALING_NAN (d1
)
1281 || REAL_VALUE_ISSIGNALING_NAN (d2
)))
1284 /* Don't perform operation if it would raise a division
1285 by zero exception. */
1286 if (code
== RDIV_EXPR
1287 && real_equal (&d2
, &dconst0
)
1288 && (flag_trapping_math
|| ! MODE_HAS_INFINITIES (mode
)))
1291 /* If either operand is a NaN, just return it. Otherwise, set up
1292 for floating-point trap; we return an overflow. */
1293 if (REAL_VALUE_ISNAN (d1
))
1295 /* Make resulting NaN value to be qNaN when flag_signaling_nans
1298 t
= build_real (type
, d1
);
1301 else if (REAL_VALUE_ISNAN (d2
))
1303 /* Make resulting NaN value to be qNaN when flag_signaling_nans
1306 t
= build_real (type
, d2
);
1310 inexact
= real_arithmetic (&value
, code
, &d1
, &d2
);
1311 real_convert (&result
, mode
, &value
);
1313 /* Don't constant fold this floating point operation if
1314 the result has overflowed and flag_trapping_math. */
1315 if (flag_trapping_math
1316 && MODE_HAS_INFINITIES (mode
)
1317 && REAL_VALUE_ISINF (result
)
1318 && !REAL_VALUE_ISINF (d1
)
1319 && !REAL_VALUE_ISINF (d2
))
1322 /* Don't constant fold this floating point operation if the
1323 result may dependent upon the run-time rounding mode and
1324 flag_rounding_math is set, or if GCC's software emulation
1325 is unable to accurately represent the result. */
1326 if ((flag_rounding_math
1327 || (MODE_COMPOSITE_P (mode
) && !flag_unsafe_math_optimizations
))
1328 && (inexact
|| !real_identical (&result
, &value
)))
1331 t
= build_real (type
, result
);
1333 TREE_OVERFLOW (t
) = TREE_OVERFLOW (arg1
) | TREE_OVERFLOW (arg2
);
1337 if (TREE_CODE (arg1
) == FIXED_CST
)
1339 FIXED_VALUE_TYPE f1
;
1340 FIXED_VALUE_TYPE f2
;
1341 FIXED_VALUE_TYPE result
;
1346 /* The following codes are handled by fixed_arithmetic. */
1352 case TRUNC_DIV_EXPR
:
1353 if (TREE_CODE (arg2
) != FIXED_CST
)
1355 f2
= TREE_FIXED_CST (arg2
);
1361 if (TREE_CODE (arg2
) != INTEGER_CST
)
1363 wi::tree_to_wide_ref w2
= wi::to_wide (arg2
);
1364 f2
.data
.high
= w2
.elt (1);
1365 f2
.data
.low
= w2
.ulow ();
1374 f1
= TREE_FIXED_CST (arg1
);
1375 type
= TREE_TYPE (arg1
);
1376 sat_p
= TYPE_SATURATING (type
);
1377 overflow_p
= fixed_arithmetic (&result
, code
, &f1
, &f2
, sat_p
);
1378 t
= build_fixed (type
, result
);
1379 /* Propagate overflow flags. */
1380 if (overflow_p
| TREE_OVERFLOW (arg1
) | TREE_OVERFLOW (arg2
))
1381 TREE_OVERFLOW (t
) = 1;
1385 if (TREE_CODE (arg1
) == COMPLEX_CST
&& TREE_CODE (arg2
) == COMPLEX_CST
)
1387 tree type
= TREE_TYPE (arg1
);
1388 tree r1
= TREE_REALPART (arg1
);
1389 tree i1
= TREE_IMAGPART (arg1
);
1390 tree r2
= TREE_REALPART (arg2
);
1391 tree i2
= TREE_IMAGPART (arg2
);
1398 real
= const_binop (code
, r1
, r2
);
1399 imag
= const_binop (code
, i1
, i2
);
1403 if (COMPLEX_FLOAT_TYPE_P (type
))
1404 return do_mpc_arg2 (arg1
, arg2
, type
,
1405 /* do_nonfinite= */ folding_initializer
,
1408 real
= const_binop (MINUS_EXPR
,
1409 const_binop (MULT_EXPR
, r1
, r2
),
1410 const_binop (MULT_EXPR
, i1
, i2
));
1411 imag
= const_binop (PLUS_EXPR
,
1412 const_binop (MULT_EXPR
, r1
, i2
),
1413 const_binop (MULT_EXPR
, i1
, r2
));
1417 if (COMPLEX_FLOAT_TYPE_P (type
))
1418 return do_mpc_arg2 (arg1
, arg2
, type
,
1419 /* do_nonfinite= */ folding_initializer
,
1422 case TRUNC_DIV_EXPR
:
1424 case FLOOR_DIV_EXPR
:
1425 case ROUND_DIV_EXPR
:
1426 if (flag_complex_method
== 0)
1428 /* Keep this algorithm in sync with
1429 tree-complex.c:expand_complex_div_straight().
1431 Expand complex division to scalars, straightforward algorithm.
1432 a / b = ((ar*br + ai*bi)/t) + i((ai*br - ar*bi)/t)
1436 = const_binop (PLUS_EXPR
,
1437 const_binop (MULT_EXPR
, r2
, r2
),
1438 const_binop (MULT_EXPR
, i2
, i2
));
1440 = const_binop (PLUS_EXPR
,
1441 const_binop (MULT_EXPR
, r1
, r2
),
1442 const_binop (MULT_EXPR
, i1
, i2
));
1444 = const_binop (MINUS_EXPR
,
1445 const_binop (MULT_EXPR
, i1
, r2
),
1446 const_binop (MULT_EXPR
, r1
, i2
));
1448 real
= const_binop (code
, t1
, magsquared
);
1449 imag
= const_binop (code
, t2
, magsquared
);
1453 /* Keep this algorithm in sync with
1454 tree-complex.c:expand_complex_div_wide().
1456 Expand complex division to scalars, modified algorithm to minimize
1457 overflow with wide input ranges. */
1458 tree compare
= fold_build2 (LT_EXPR
, boolean_type_node
,
1459 fold_abs_const (r2
, TREE_TYPE (type
)),
1460 fold_abs_const (i2
, TREE_TYPE (type
)));
1462 if (integer_nonzerop (compare
))
1464 /* In the TRUE branch, we compute
1466 div = (br * ratio) + bi;
1467 tr = (ar * ratio) + ai;
1468 ti = (ai * ratio) - ar;
1471 tree ratio
= const_binop (code
, r2
, i2
);
1472 tree div
= const_binop (PLUS_EXPR
, i2
,
1473 const_binop (MULT_EXPR
, r2
, ratio
));
1474 real
= const_binop (MULT_EXPR
, r1
, ratio
);
1475 real
= const_binop (PLUS_EXPR
, real
, i1
);
1476 real
= const_binop (code
, real
, div
);
1478 imag
= const_binop (MULT_EXPR
, i1
, ratio
);
1479 imag
= const_binop (MINUS_EXPR
, imag
, r1
);
1480 imag
= const_binop (code
, imag
, div
);
1484 /* In the FALSE branch, we compute
1486 divisor = (d * ratio) + c;
1487 tr = (b * ratio) + a;
1488 ti = b - (a * ratio);
1491 tree ratio
= const_binop (code
, i2
, r2
);
1492 tree div
= const_binop (PLUS_EXPR
, r2
,
1493 const_binop (MULT_EXPR
, i2
, ratio
));
1495 real
= const_binop (MULT_EXPR
, i1
, ratio
);
1496 real
= const_binop (PLUS_EXPR
, real
, r1
);
1497 real
= const_binop (code
, real
, div
);
1499 imag
= const_binop (MULT_EXPR
, r1
, ratio
);
1500 imag
= const_binop (MINUS_EXPR
, i1
, imag
);
1501 imag
= const_binop (code
, imag
, div
);
1511 return build_complex (type
, real
, imag
);
1514 if (TREE_CODE (arg1
) == VECTOR_CST
1515 && TREE_CODE (arg2
) == VECTOR_CST
1516 && known_eq (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg1
)),
1517 TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg2
))))
1519 tree type
= TREE_TYPE (arg1
);
1521 if (VECTOR_CST_STEPPED_P (arg1
)
1522 && VECTOR_CST_STEPPED_P (arg2
))
1523 /* We can operate directly on the encoding if:
1525 a3 - a2 == a2 - a1 && b3 - b2 == b2 - b1
1527 (a3 op b3) - (a2 op b2) == (a2 op b2) - (a1 op b1)
1529 Addition and subtraction are the supported operators
1530 for which this is true. */
1531 step_ok_p
= (code
== PLUS_EXPR
|| code
== MINUS_EXPR
);
1532 else if (VECTOR_CST_STEPPED_P (arg1
))
1533 /* We can operate directly on stepped encodings if:
1537 (a3 op c) - (a2 op c) == (a2 op c) - (a1 op c)
1539 which is true if (x -> x op c) distributes over addition. */
1540 step_ok_p
= distributes_over_addition_p (code
, 1);
1542 /* Similarly in reverse. */
1543 step_ok_p
= distributes_over_addition_p (code
, 2);
1544 tree_vector_builder elts
;
1545 if (!elts
.new_binary_operation (type
, arg1
, arg2
, step_ok_p
))
1547 unsigned int count
= elts
.encoded_nelts ();
1548 for (unsigned int i
= 0; i
< count
; ++i
)
1550 tree elem1
= VECTOR_CST_ELT (arg1
, i
);
1551 tree elem2
= VECTOR_CST_ELT (arg2
, i
);
1553 tree elt
= const_binop (code
, elem1
, elem2
);
1555 /* It is possible that const_binop cannot handle the given
1556 code and return NULL_TREE */
1557 if (elt
== NULL_TREE
)
1559 elts
.quick_push (elt
);
1562 return elts
.build ();
1565 /* Shifts allow a scalar offset for a vector. */
1566 if (TREE_CODE (arg1
) == VECTOR_CST
1567 && TREE_CODE (arg2
) == INTEGER_CST
)
1569 tree type
= TREE_TYPE (arg1
);
1570 bool step_ok_p
= distributes_over_addition_p (code
, 1);
1571 tree_vector_builder elts
;
1572 if (!elts
.new_unary_operation (type
, arg1
, step_ok_p
))
1574 unsigned int count
= elts
.encoded_nelts ();
1575 for (unsigned int i
= 0; i
< count
; ++i
)
1577 tree elem1
= VECTOR_CST_ELT (arg1
, i
);
1579 tree elt
= const_binop (code
, elem1
, arg2
);
1581 /* It is possible that const_binop cannot handle the given
1582 code and return NULL_TREE. */
1583 if (elt
== NULL_TREE
)
1585 elts
.quick_push (elt
);
1588 return elts
.build ();
1593 /* Overload that adds a TYPE parameter to be able to dispatch
1594 to fold_relational_const. */
1597 const_binop (enum tree_code code
, tree type
, tree arg1
, tree arg2
)
1599 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
1600 return fold_relational_const (code
, type
, arg1
, arg2
);
1602 /* ??? Until we make the const_binop worker take the type of the
1603 result as argument put those cases that need it here. */
1606 case VEC_SERIES_EXPR
:
1607 if (CONSTANT_CLASS_P (arg1
)
1608 && CONSTANT_CLASS_P (arg2
))
1609 return build_vec_series (type
, arg1
, arg2
);
1613 if ((TREE_CODE (arg1
) == REAL_CST
1614 && TREE_CODE (arg2
) == REAL_CST
)
1615 || (TREE_CODE (arg1
) == INTEGER_CST
1616 && TREE_CODE (arg2
) == INTEGER_CST
))
1617 return build_complex (type
, arg1
, arg2
);
1620 case POINTER_DIFF_EXPR
:
1621 if (poly_int_tree_p (arg1
) && poly_int_tree_p (arg2
))
1623 poly_offset_int res
= (wi::to_poly_offset (arg1
)
1624 - wi::to_poly_offset (arg2
));
1625 return force_fit_type (type
, res
, 1,
1626 TREE_OVERFLOW (arg1
) | TREE_OVERFLOW (arg2
));
1630 case VEC_PACK_TRUNC_EXPR
:
1631 case VEC_PACK_FIX_TRUNC_EXPR
:
1632 case VEC_PACK_FLOAT_EXPR
:
1634 unsigned int HOST_WIDE_INT out_nelts
, in_nelts
, i
;
1636 if (TREE_CODE (arg1
) != VECTOR_CST
1637 || TREE_CODE (arg2
) != VECTOR_CST
)
1640 if (!VECTOR_CST_NELTS (arg1
).is_constant (&in_nelts
))
1643 out_nelts
= in_nelts
* 2;
1644 gcc_assert (known_eq (in_nelts
, VECTOR_CST_NELTS (arg2
))
1645 && known_eq (out_nelts
, TYPE_VECTOR_SUBPARTS (type
)));
1647 tree_vector_builder
elts (type
, out_nelts
, 1);
1648 for (i
= 0; i
< out_nelts
; i
++)
1650 tree elt
= (i
< in_nelts
1651 ? VECTOR_CST_ELT (arg1
, i
)
1652 : VECTOR_CST_ELT (arg2
, i
- in_nelts
));
1653 elt
= fold_convert_const (code
== VEC_PACK_TRUNC_EXPR
1655 : code
== VEC_PACK_FLOAT_EXPR
1656 ? FLOAT_EXPR
: FIX_TRUNC_EXPR
,
1657 TREE_TYPE (type
), elt
);
1658 if (elt
== NULL_TREE
|| !CONSTANT_CLASS_P (elt
))
1660 elts
.quick_push (elt
);
1663 return elts
.build ();
1666 case VEC_WIDEN_MULT_LO_EXPR
:
1667 case VEC_WIDEN_MULT_HI_EXPR
:
1668 case VEC_WIDEN_MULT_EVEN_EXPR
:
1669 case VEC_WIDEN_MULT_ODD_EXPR
:
1671 unsigned HOST_WIDE_INT out_nelts
, in_nelts
, out
, ofs
, scale
;
1673 if (TREE_CODE (arg1
) != VECTOR_CST
|| TREE_CODE (arg2
) != VECTOR_CST
)
1676 if (!VECTOR_CST_NELTS (arg1
).is_constant (&in_nelts
))
1678 out_nelts
= in_nelts
/ 2;
1679 gcc_assert (known_eq (in_nelts
, VECTOR_CST_NELTS (arg2
))
1680 && known_eq (out_nelts
, TYPE_VECTOR_SUBPARTS (type
)));
1682 if (code
== VEC_WIDEN_MULT_LO_EXPR
)
1683 scale
= 0, ofs
= BYTES_BIG_ENDIAN
? out_nelts
: 0;
1684 else if (code
== VEC_WIDEN_MULT_HI_EXPR
)
1685 scale
= 0, ofs
= BYTES_BIG_ENDIAN
? 0 : out_nelts
;
1686 else if (code
== VEC_WIDEN_MULT_EVEN_EXPR
)
1688 else /* if (code == VEC_WIDEN_MULT_ODD_EXPR) */
1691 tree_vector_builder
elts (type
, out_nelts
, 1);
1692 for (out
= 0; out
< out_nelts
; out
++)
1694 unsigned int in
= (out
<< scale
) + ofs
;
1695 tree t1
= fold_convert_const (NOP_EXPR
, TREE_TYPE (type
),
1696 VECTOR_CST_ELT (arg1
, in
));
1697 tree t2
= fold_convert_const (NOP_EXPR
, TREE_TYPE (type
),
1698 VECTOR_CST_ELT (arg2
, in
));
1700 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
1702 tree elt
= const_binop (MULT_EXPR
, t1
, t2
);
1703 if (elt
== NULL_TREE
|| !CONSTANT_CLASS_P (elt
))
1705 elts
.quick_push (elt
);
1708 return elts
.build ();
1714 if (TREE_CODE_CLASS (code
) != tcc_binary
)
1717 /* Make sure type and arg0 have the same saturating flag. */
1718 gcc_checking_assert (TYPE_SATURATING (type
)
1719 == TYPE_SATURATING (TREE_TYPE (arg1
)));
1721 return const_binop (code
, arg1
, arg2
);
1724 /* Compute CODE ARG1 with resulting type TYPE with ARG1 being constant.
1725 Return zero if computing the constants is not possible. */
1728 const_unop (enum tree_code code
, tree type
, tree arg0
)
1730 /* Don't perform the operation, other than NEGATE and ABS, if
1731 flag_signaling_nans is on and the operand is a signaling NaN. */
1732 if (TREE_CODE (arg0
) == REAL_CST
1733 && HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg0
)))
1734 && REAL_VALUE_ISSIGNALING_NAN (TREE_REAL_CST (arg0
))
1735 && code
!= NEGATE_EXPR
1737 && code
!= ABSU_EXPR
)
1744 case FIX_TRUNC_EXPR
:
1745 case FIXED_CONVERT_EXPR
:
1746 return fold_convert_const (code
, type
, arg0
);
1748 case ADDR_SPACE_CONVERT_EXPR
:
1749 /* If the source address is 0, and the source address space
1750 cannot have a valid object at 0, fold to dest type null. */
1751 if (integer_zerop (arg0
)
1752 && !(targetm
.addr_space
.zero_address_valid
1753 (TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (arg0
))))))
1754 return fold_convert_const (code
, type
, arg0
);
1757 case VIEW_CONVERT_EXPR
:
1758 return fold_view_convert_expr (type
, arg0
);
1762 /* Can't call fold_negate_const directly here as that doesn't
1763 handle all cases and we might not be able to negate some
1765 tree tem
= fold_negate_expr (UNKNOWN_LOCATION
, arg0
);
1766 if (tem
&& CONSTANT_CLASS_P (tem
))
1773 if (TREE_CODE (arg0
) == INTEGER_CST
|| TREE_CODE (arg0
) == REAL_CST
)
1774 return fold_abs_const (arg0
, type
);
1778 if (TREE_CODE (arg0
) == COMPLEX_CST
)
1780 tree ipart
= fold_negate_const (TREE_IMAGPART (arg0
),
1782 return build_complex (type
, TREE_REALPART (arg0
), ipart
);
1787 if (TREE_CODE (arg0
) == INTEGER_CST
)
1788 return fold_not_const (arg0
, type
);
1789 else if (POLY_INT_CST_P (arg0
))
1790 return wide_int_to_tree (type
, -poly_int_cst_value (arg0
));
1791 /* Perform BIT_NOT_EXPR on each element individually. */
1792 else if (TREE_CODE (arg0
) == VECTOR_CST
)
1796 /* This can cope with stepped encodings because ~x == -1 - x. */
1797 tree_vector_builder elements
;
1798 elements
.new_unary_operation (type
, arg0
, true);
1799 unsigned int i
, count
= elements
.encoded_nelts ();
1800 for (i
= 0; i
< count
; ++i
)
1802 elem
= VECTOR_CST_ELT (arg0
, i
);
1803 elem
= const_unop (BIT_NOT_EXPR
, TREE_TYPE (type
), elem
);
1804 if (elem
== NULL_TREE
)
1806 elements
.quick_push (elem
);
1809 return elements
.build ();
1813 case TRUTH_NOT_EXPR
:
1814 if (TREE_CODE (arg0
) == INTEGER_CST
)
1815 return constant_boolean_node (integer_zerop (arg0
), type
);
1819 if (TREE_CODE (arg0
) == COMPLEX_CST
)
1820 return fold_convert (type
, TREE_REALPART (arg0
));
1824 if (TREE_CODE (arg0
) == COMPLEX_CST
)
1825 return fold_convert (type
, TREE_IMAGPART (arg0
));
1828 case VEC_UNPACK_LO_EXPR
:
1829 case VEC_UNPACK_HI_EXPR
:
1830 case VEC_UNPACK_FLOAT_LO_EXPR
:
1831 case VEC_UNPACK_FLOAT_HI_EXPR
:
1832 case VEC_UNPACK_FIX_TRUNC_LO_EXPR
:
1833 case VEC_UNPACK_FIX_TRUNC_HI_EXPR
:
1835 unsigned HOST_WIDE_INT out_nelts
, in_nelts
, i
;
1836 enum tree_code subcode
;
1838 if (TREE_CODE (arg0
) != VECTOR_CST
)
1841 if (!VECTOR_CST_NELTS (arg0
).is_constant (&in_nelts
))
1843 out_nelts
= in_nelts
/ 2;
1844 gcc_assert (known_eq (out_nelts
, TYPE_VECTOR_SUBPARTS (type
)));
1846 unsigned int offset
= 0;
1847 if ((!BYTES_BIG_ENDIAN
) ^ (code
== VEC_UNPACK_LO_EXPR
1848 || code
== VEC_UNPACK_FLOAT_LO_EXPR
1849 || code
== VEC_UNPACK_FIX_TRUNC_LO_EXPR
))
1852 if (code
== VEC_UNPACK_LO_EXPR
|| code
== VEC_UNPACK_HI_EXPR
)
1854 else if (code
== VEC_UNPACK_FLOAT_LO_EXPR
1855 || code
== VEC_UNPACK_FLOAT_HI_EXPR
)
1856 subcode
= FLOAT_EXPR
;
1858 subcode
= FIX_TRUNC_EXPR
;
1860 tree_vector_builder
elts (type
, out_nelts
, 1);
1861 for (i
= 0; i
< out_nelts
; i
++)
1863 tree elt
= fold_convert_const (subcode
, TREE_TYPE (type
),
1864 VECTOR_CST_ELT (arg0
, i
+ offset
));
1865 if (elt
== NULL_TREE
|| !CONSTANT_CLASS_P (elt
))
1867 elts
.quick_push (elt
);
1870 return elts
.build ();
1873 case VEC_DUPLICATE_EXPR
:
1874 if (CONSTANT_CLASS_P (arg0
))
1875 return build_vector_from_val (type
, arg0
);
1885 /* Create a sizetype INT_CST node with NUMBER sign extended. KIND
1886 indicates which particular sizetype to create. */
1889 size_int_kind (poly_int64 number
, enum size_type_kind kind
)
1891 return build_int_cst (sizetype_tab
[(int) kind
], number
);
1894 /* Combine operands OP1 and OP2 with arithmetic operation CODE. CODE
1895 is a tree code. The type of the result is taken from the operands.
1896 Both must be equivalent integer types, ala int_binop_types_match_p.
1897 If the operands are constant, so is the result. */
1900 size_binop_loc (location_t loc
, enum tree_code code
, tree arg0
, tree arg1
)
1902 tree type
= TREE_TYPE (arg0
);
1904 if (arg0
== error_mark_node
|| arg1
== error_mark_node
)
1905 return error_mark_node
;
1907 gcc_assert (int_binop_types_match_p (code
, TREE_TYPE (arg0
),
1910 /* Handle the special case of two poly_int constants faster. */
1911 if (poly_int_tree_p (arg0
) && poly_int_tree_p (arg1
))
1913 /* And some specific cases even faster than that. */
1914 if (code
== PLUS_EXPR
)
1916 if (integer_zerop (arg0
)
1917 && !TREE_OVERFLOW (tree_strip_any_location_wrapper (arg0
)))
1919 if (integer_zerop (arg1
)
1920 && !TREE_OVERFLOW (tree_strip_any_location_wrapper (arg1
)))
1923 else if (code
== MINUS_EXPR
)
1925 if (integer_zerop (arg1
)
1926 && !TREE_OVERFLOW (tree_strip_any_location_wrapper (arg1
)))
1929 else if (code
== MULT_EXPR
)
1931 if (integer_onep (arg0
)
1932 && !TREE_OVERFLOW (tree_strip_any_location_wrapper (arg0
)))
1936 /* Handle general case of two integer constants. For sizetype
1937 constant calculations we always want to know about overflow,
1938 even in the unsigned case. */
1939 tree res
= int_const_binop (code
, arg0
, arg1
, -1);
1940 if (res
!= NULL_TREE
)
1944 return fold_build2_loc (loc
, code
, type
, arg0
, arg1
);
1947 /* Given two values, either both of sizetype or both of bitsizetype,
1948 compute the difference between the two values. Return the value
1949 in signed type corresponding to the type of the operands. */
1952 size_diffop_loc (location_t loc
, tree arg0
, tree arg1
)
1954 tree type
= TREE_TYPE (arg0
);
1957 gcc_assert (int_binop_types_match_p (MINUS_EXPR
, TREE_TYPE (arg0
),
1960 /* If the type is already signed, just do the simple thing. */
1961 if (!TYPE_UNSIGNED (type
))
1962 return size_binop_loc (loc
, MINUS_EXPR
, arg0
, arg1
);
1964 if (type
== sizetype
)
1966 else if (type
== bitsizetype
)
1967 ctype
= sbitsizetype
;
1969 ctype
= signed_type_for (type
);
1971 /* If either operand is not a constant, do the conversions to the signed
1972 type and subtract. The hardware will do the right thing with any
1973 overflow in the subtraction. */
1974 if (TREE_CODE (arg0
) != INTEGER_CST
|| TREE_CODE (arg1
) != INTEGER_CST
)
1975 return size_binop_loc (loc
, MINUS_EXPR
,
1976 fold_convert_loc (loc
, ctype
, arg0
),
1977 fold_convert_loc (loc
, ctype
, arg1
));
1979 /* If ARG0 is larger than ARG1, subtract and return the result in CTYPE.
1980 Otherwise, subtract the other way, convert to CTYPE (we know that can't
1981 overflow) and negate (which can't either). Special-case a result
1982 of zero while we're here. */
1983 if (tree_int_cst_equal (arg0
, arg1
))
1984 return build_int_cst (ctype
, 0);
1985 else if (tree_int_cst_lt (arg1
, arg0
))
1986 return fold_convert_loc (loc
, ctype
,
1987 size_binop_loc (loc
, MINUS_EXPR
, arg0
, arg1
));
1989 return size_binop_loc (loc
, MINUS_EXPR
, build_int_cst (ctype
, 0),
1990 fold_convert_loc (loc
, ctype
,
1991 size_binop_loc (loc
,
1996 /* A subroutine of fold_convert_const handling conversions of an
1997 INTEGER_CST to another integer type. */
2000 fold_convert_const_int_from_int (tree type
, const_tree arg1
)
2002 /* Given an integer constant, make new constant with new type,
2003 appropriately sign-extended or truncated. Use widest_int
2004 so that any extension is done according ARG1's type. */
2005 return force_fit_type (type
, wi::to_widest (arg1
),
2006 !POINTER_TYPE_P (TREE_TYPE (arg1
)),
2007 TREE_OVERFLOW (arg1
));
2010 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2011 to an integer type. */
2014 fold_convert_const_int_from_real (enum tree_code code
, tree type
, const_tree arg1
)
2016 bool overflow
= false;
2019 /* The following code implements the floating point to integer
2020 conversion rules required by the Java Language Specification,
2021 that IEEE NaNs are mapped to zero and values that overflow
2022 the target precision saturate, i.e. values greater than
2023 INT_MAX are mapped to INT_MAX, and values less than INT_MIN
2024 are mapped to INT_MIN. These semantics are allowed by the
2025 C and C++ standards that simply state that the behavior of
2026 FP-to-integer conversion is unspecified upon overflow. */
2030 REAL_VALUE_TYPE x
= TREE_REAL_CST (arg1
);
2034 case FIX_TRUNC_EXPR
:
2035 real_trunc (&r
, VOIDmode
, &x
);
2042 /* If R is NaN, return zero and show we have an overflow. */
2043 if (REAL_VALUE_ISNAN (r
))
2046 val
= wi::zero (TYPE_PRECISION (type
));
2049 /* See if R is less than the lower bound or greater than the
2054 tree lt
= TYPE_MIN_VALUE (type
);
2055 REAL_VALUE_TYPE l
= real_value_from_int_cst (NULL_TREE
, lt
);
2056 if (real_less (&r
, &l
))
2059 val
= wi::to_wide (lt
);
2065 tree ut
= TYPE_MAX_VALUE (type
);
2068 REAL_VALUE_TYPE u
= real_value_from_int_cst (NULL_TREE
, ut
);
2069 if (real_less (&u
, &r
))
2072 val
= wi::to_wide (ut
);
2078 val
= real_to_integer (&r
, &overflow
, TYPE_PRECISION (type
));
2080 t
= force_fit_type (type
, val
, -1, overflow
| TREE_OVERFLOW (arg1
));
2084 /* A subroutine of fold_convert_const handling conversions of a
2085 FIXED_CST to an integer type. */
2088 fold_convert_const_int_from_fixed (tree type
, const_tree arg1
)
2091 double_int temp
, temp_trunc
;
2094 /* Right shift FIXED_CST to temp by fbit. */
2095 temp
= TREE_FIXED_CST (arg1
).data
;
2096 mode
= TREE_FIXED_CST (arg1
).mode
;
2097 if (GET_MODE_FBIT (mode
) < HOST_BITS_PER_DOUBLE_INT
)
2099 temp
= temp
.rshift (GET_MODE_FBIT (mode
),
2100 HOST_BITS_PER_DOUBLE_INT
,
2101 SIGNED_FIXED_POINT_MODE_P (mode
));
2103 /* Left shift temp to temp_trunc by fbit. */
2104 temp_trunc
= temp
.lshift (GET_MODE_FBIT (mode
),
2105 HOST_BITS_PER_DOUBLE_INT
,
2106 SIGNED_FIXED_POINT_MODE_P (mode
));
2110 temp
= double_int_zero
;
2111 temp_trunc
= double_int_zero
;
2114 /* If FIXED_CST is negative, we need to round the value toward 0.
2115 By checking if the fractional bits are not zero to add 1 to temp. */
2116 if (SIGNED_FIXED_POINT_MODE_P (mode
)
2117 && temp_trunc
.is_negative ()
2118 && TREE_FIXED_CST (arg1
).data
!= temp_trunc
)
2119 temp
+= double_int_one
;
2121 /* Given a fixed-point constant, make new constant with new type,
2122 appropriately sign-extended or truncated. */
2123 t
= force_fit_type (type
, temp
, -1,
2124 (temp
.is_negative ()
2125 && (TYPE_UNSIGNED (type
)
2126 < TYPE_UNSIGNED (TREE_TYPE (arg1
))))
2127 | TREE_OVERFLOW (arg1
));
2132 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2133 to another floating point type. */
2136 fold_convert_const_real_from_real (tree type
, const_tree arg1
)
2138 REAL_VALUE_TYPE value
;
2141 /* Don't perform the operation if flag_signaling_nans is on
2142 and the operand is a signaling NaN. */
2143 if (HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg1
)))
2144 && REAL_VALUE_ISSIGNALING_NAN (TREE_REAL_CST (arg1
)))
2147 real_convert (&value
, TYPE_MODE (type
), &TREE_REAL_CST (arg1
));
2148 t
= build_real (type
, value
);
2150 /* If converting an infinity or NAN to a representation that doesn't
2151 have one, set the overflow bit so that we can produce some kind of
2152 error message at the appropriate point if necessary. It's not the
2153 most user-friendly message, but it's better than nothing. */
2154 if (REAL_VALUE_ISINF (TREE_REAL_CST (arg1
))
2155 && !MODE_HAS_INFINITIES (TYPE_MODE (type
)))
2156 TREE_OVERFLOW (t
) = 1;
2157 else if (REAL_VALUE_ISNAN (TREE_REAL_CST (arg1
))
2158 && !MODE_HAS_NANS (TYPE_MODE (type
)))
2159 TREE_OVERFLOW (t
) = 1;
2160 /* Regular overflow, conversion produced an infinity in a mode that
2161 can't represent them. */
2162 else if (!MODE_HAS_INFINITIES (TYPE_MODE (type
))
2163 && REAL_VALUE_ISINF (value
)
2164 && !REAL_VALUE_ISINF (TREE_REAL_CST (arg1
)))
2165 TREE_OVERFLOW (t
) = 1;
2167 TREE_OVERFLOW (t
) = TREE_OVERFLOW (arg1
);
2171 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2172 to a floating point type. */
2175 fold_convert_const_real_from_fixed (tree type
, const_tree arg1
)
2177 REAL_VALUE_TYPE value
;
2180 real_convert_from_fixed (&value
, SCALAR_FLOAT_TYPE_MODE (type
),
2181 &TREE_FIXED_CST (arg1
));
2182 t
= build_real (type
, value
);
2184 TREE_OVERFLOW (t
) = TREE_OVERFLOW (arg1
);
2188 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2189 to another fixed-point type. */
2192 fold_convert_const_fixed_from_fixed (tree type
, const_tree arg1
)
2194 FIXED_VALUE_TYPE value
;
2198 overflow_p
= fixed_convert (&value
, SCALAR_TYPE_MODE (type
),
2199 &TREE_FIXED_CST (arg1
), TYPE_SATURATING (type
));
2200 t
= build_fixed (type
, value
);
2202 /* Propagate overflow flags. */
2203 if (overflow_p
| TREE_OVERFLOW (arg1
))
2204 TREE_OVERFLOW (t
) = 1;
2208 /* A subroutine of fold_convert_const handling conversions an INTEGER_CST
2209 to a fixed-point type. */
2212 fold_convert_const_fixed_from_int (tree type
, const_tree arg1
)
2214 FIXED_VALUE_TYPE value
;
2219 gcc_assert (TREE_INT_CST_NUNITS (arg1
) <= 2);
2221 di
.low
= TREE_INT_CST_ELT (arg1
, 0);
2222 if (TREE_INT_CST_NUNITS (arg1
) == 1)
2223 di
.high
= (HOST_WIDE_INT
) di
.low
< 0 ? HOST_WIDE_INT_M1
: 0;
2225 di
.high
= TREE_INT_CST_ELT (arg1
, 1);
2227 overflow_p
= fixed_convert_from_int (&value
, SCALAR_TYPE_MODE (type
), di
,
2228 TYPE_UNSIGNED (TREE_TYPE (arg1
)),
2229 TYPE_SATURATING (type
));
2230 t
= build_fixed (type
, value
);
2232 /* Propagate overflow flags. */
2233 if (overflow_p
| TREE_OVERFLOW (arg1
))
2234 TREE_OVERFLOW (t
) = 1;
2238 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2239 to a fixed-point type. */
2242 fold_convert_const_fixed_from_real (tree type
, const_tree arg1
)
2244 FIXED_VALUE_TYPE value
;
2248 overflow_p
= fixed_convert_from_real (&value
, SCALAR_TYPE_MODE (type
),
2249 &TREE_REAL_CST (arg1
),
2250 TYPE_SATURATING (type
));
2251 t
= build_fixed (type
, value
);
2253 /* Propagate overflow flags. */
2254 if (overflow_p
| TREE_OVERFLOW (arg1
))
2255 TREE_OVERFLOW (t
) = 1;
2259 /* Attempt to fold type conversion operation CODE of expression ARG1 to
2260 type TYPE. If no simplification can be done return NULL_TREE. */
2263 fold_convert_const (enum tree_code code
, tree type
, tree arg1
)
2265 tree arg_type
= TREE_TYPE (arg1
);
2266 if (arg_type
== type
)
2269 /* We can't widen types, since the runtime value could overflow the
2270 original type before being extended to the new type. */
2271 if (POLY_INT_CST_P (arg1
)
2272 && (POINTER_TYPE_P (type
) || INTEGRAL_TYPE_P (type
))
2273 && TYPE_PRECISION (type
) <= TYPE_PRECISION (arg_type
))
2274 return build_poly_int_cst (type
,
2275 poly_wide_int::from (poly_int_cst_value (arg1
),
2276 TYPE_PRECISION (type
),
2277 TYPE_SIGN (arg_type
)));
2279 if (POINTER_TYPE_P (type
) || INTEGRAL_TYPE_P (type
)
2280 || TREE_CODE (type
) == OFFSET_TYPE
)
2282 if (TREE_CODE (arg1
) == INTEGER_CST
)
2283 return fold_convert_const_int_from_int (type
, arg1
);
2284 else if (TREE_CODE (arg1
) == REAL_CST
)
2285 return fold_convert_const_int_from_real (code
, type
, arg1
);
2286 else if (TREE_CODE (arg1
) == FIXED_CST
)
2287 return fold_convert_const_int_from_fixed (type
, arg1
);
2289 else if (TREE_CODE (type
) == REAL_TYPE
)
2291 if (TREE_CODE (arg1
) == INTEGER_CST
)
2292 return build_real_from_int_cst (type
, arg1
);
2293 else if (TREE_CODE (arg1
) == REAL_CST
)
2294 return fold_convert_const_real_from_real (type
, arg1
);
2295 else if (TREE_CODE (arg1
) == FIXED_CST
)
2296 return fold_convert_const_real_from_fixed (type
, arg1
);
2298 else if (TREE_CODE (type
) == FIXED_POINT_TYPE
)
2300 if (TREE_CODE (arg1
) == FIXED_CST
)
2301 return fold_convert_const_fixed_from_fixed (type
, arg1
);
2302 else if (TREE_CODE (arg1
) == INTEGER_CST
)
2303 return fold_convert_const_fixed_from_int (type
, arg1
);
2304 else if (TREE_CODE (arg1
) == REAL_CST
)
2305 return fold_convert_const_fixed_from_real (type
, arg1
);
2307 else if (TREE_CODE (type
) == VECTOR_TYPE
)
2309 if (TREE_CODE (arg1
) == VECTOR_CST
2310 && known_eq (TYPE_VECTOR_SUBPARTS (type
), VECTOR_CST_NELTS (arg1
)))
2312 tree elttype
= TREE_TYPE (type
);
2313 tree arg1_elttype
= TREE_TYPE (TREE_TYPE (arg1
));
2314 /* We can't handle steps directly when extending, since the
2315 values need to wrap at the original precision first. */
2317 = (INTEGRAL_TYPE_P (elttype
)
2318 && INTEGRAL_TYPE_P (arg1_elttype
)
2319 && TYPE_PRECISION (elttype
) <= TYPE_PRECISION (arg1_elttype
));
2320 tree_vector_builder v
;
2321 if (!v
.new_unary_operation (type
, arg1
, step_ok_p
))
2323 unsigned int len
= v
.encoded_nelts ();
2324 for (unsigned int i
= 0; i
< len
; ++i
)
2326 tree elt
= VECTOR_CST_ELT (arg1
, i
);
2327 tree cvt
= fold_convert_const (code
, elttype
, elt
);
2328 if (cvt
== NULL_TREE
)
2338 /* Construct a vector of zero elements of vector type TYPE. */
2341 build_zero_vector (tree type
)
2345 t
= fold_convert_const (NOP_EXPR
, TREE_TYPE (type
), integer_zero_node
);
2346 return build_vector_from_val (type
, t
);
2349 /* Returns true, if ARG is convertible to TYPE using a NOP_EXPR. */
2352 fold_convertible_p (const_tree type
, const_tree arg
)
2354 tree orig
= TREE_TYPE (arg
);
2359 if (TREE_CODE (arg
) == ERROR_MARK
2360 || TREE_CODE (type
) == ERROR_MARK
2361 || TREE_CODE (orig
) == ERROR_MARK
)
2364 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (orig
))
2367 switch (TREE_CODE (type
))
2369 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2370 case POINTER_TYPE
: case REFERENCE_TYPE
:
2372 return (INTEGRAL_TYPE_P (orig
)
2373 || (POINTER_TYPE_P (orig
)
2374 && TYPE_PRECISION (type
) <= TYPE_PRECISION (orig
))
2375 || TREE_CODE (orig
) == OFFSET_TYPE
);
2378 case FIXED_POINT_TYPE
:
2381 return TREE_CODE (type
) == TREE_CODE (orig
);
2388 /* Convert expression ARG to type TYPE. Used by the middle-end for
2389 simple conversions in preference to calling the front-end's convert. */
2392 fold_convert_loc (location_t loc
, tree type
, tree arg
)
2394 tree orig
= TREE_TYPE (arg
);
2400 if (TREE_CODE (arg
) == ERROR_MARK
2401 || TREE_CODE (type
) == ERROR_MARK
2402 || TREE_CODE (orig
) == ERROR_MARK
)
2403 return error_mark_node
;
2405 switch (TREE_CODE (type
))
2408 case REFERENCE_TYPE
:
2409 /* Handle conversions between pointers to different address spaces. */
2410 if (POINTER_TYPE_P (orig
)
2411 && (TYPE_ADDR_SPACE (TREE_TYPE (type
))
2412 != TYPE_ADDR_SPACE (TREE_TYPE (orig
))))
2413 return fold_build1_loc (loc
, ADDR_SPACE_CONVERT_EXPR
, type
, arg
);
2416 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2418 if (TREE_CODE (arg
) == INTEGER_CST
)
2420 tem
= fold_convert_const (NOP_EXPR
, type
, arg
);
2421 if (tem
!= NULL_TREE
)
2424 if (INTEGRAL_TYPE_P (orig
) || POINTER_TYPE_P (orig
)
2425 || TREE_CODE (orig
) == OFFSET_TYPE
)
2426 return fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
2427 if (TREE_CODE (orig
) == COMPLEX_TYPE
)
2428 return fold_convert_loc (loc
, type
,
2429 fold_build1_loc (loc
, REALPART_EXPR
,
2430 TREE_TYPE (orig
), arg
));
2431 gcc_assert (TREE_CODE (orig
) == VECTOR_TYPE
2432 && tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (orig
)));
2433 return fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, type
, arg
);
2436 if (TREE_CODE (arg
) == INTEGER_CST
)
2438 tem
= fold_convert_const (FLOAT_EXPR
, type
, arg
);
2439 if (tem
!= NULL_TREE
)
2442 else if (TREE_CODE (arg
) == REAL_CST
)
2444 tem
= fold_convert_const (NOP_EXPR
, type
, arg
);
2445 if (tem
!= NULL_TREE
)
2448 else if (TREE_CODE (arg
) == FIXED_CST
)
2450 tem
= fold_convert_const (FIXED_CONVERT_EXPR
, type
, arg
);
2451 if (tem
!= NULL_TREE
)
2455 switch (TREE_CODE (orig
))
2458 case BOOLEAN_TYPE
: case ENUMERAL_TYPE
:
2459 case POINTER_TYPE
: case REFERENCE_TYPE
:
2460 return fold_build1_loc (loc
, FLOAT_EXPR
, type
, arg
);
2463 return fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
2465 case FIXED_POINT_TYPE
:
2466 return fold_build1_loc (loc
, FIXED_CONVERT_EXPR
, type
, arg
);
2469 tem
= fold_build1_loc (loc
, REALPART_EXPR
, TREE_TYPE (orig
), arg
);
2470 return fold_convert_loc (loc
, type
, tem
);
2476 case FIXED_POINT_TYPE
:
2477 if (TREE_CODE (arg
) == FIXED_CST
|| TREE_CODE (arg
) == INTEGER_CST
2478 || TREE_CODE (arg
) == REAL_CST
)
2480 tem
= fold_convert_const (FIXED_CONVERT_EXPR
, type
, arg
);
2481 if (tem
!= NULL_TREE
)
2482 goto fold_convert_exit
;
2485 switch (TREE_CODE (orig
))
2487 case FIXED_POINT_TYPE
:
2492 return fold_build1_loc (loc
, FIXED_CONVERT_EXPR
, type
, arg
);
2495 tem
= fold_build1_loc (loc
, REALPART_EXPR
, TREE_TYPE (orig
), arg
);
2496 return fold_convert_loc (loc
, type
, tem
);
2503 switch (TREE_CODE (orig
))
2506 case BOOLEAN_TYPE
: case ENUMERAL_TYPE
:
2507 case POINTER_TYPE
: case REFERENCE_TYPE
:
2509 case FIXED_POINT_TYPE
:
2510 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
2511 fold_convert_loc (loc
, TREE_TYPE (type
), arg
),
2512 fold_convert_loc (loc
, TREE_TYPE (type
),
2513 integer_zero_node
));
2518 if (TREE_CODE (arg
) == COMPLEX_EXPR
)
2520 rpart
= fold_convert_loc (loc
, TREE_TYPE (type
),
2521 TREE_OPERAND (arg
, 0));
2522 ipart
= fold_convert_loc (loc
, TREE_TYPE (type
),
2523 TREE_OPERAND (arg
, 1));
2524 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rpart
, ipart
);
2527 arg
= save_expr (arg
);
2528 rpart
= fold_build1_loc (loc
, REALPART_EXPR
, TREE_TYPE (orig
), arg
);
2529 ipart
= fold_build1_loc (loc
, IMAGPART_EXPR
, TREE_TYPE (orig
), arg
);
2530 rpart
= fold_convert_loc (loc
, TREE_TYPE (type
), rpart
);
2531 ipart
= fold_convert_loc (loc
, TREE_TYPE (type
), ipart
);
2532 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rpart
, ipart
);
2540 if (integer_zerop (arg
))
2541 return build_zero_vector (type
);
2542 gcc_assert (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (orig
)));
2543 gcc_assert (INTEGRAL_TYPE_P (orig
) || POINTER_TYPE_P (orig
)
2544 || TREE_CODE (orig
) == VECTOR_TYPE
);
2545 return fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, type
, arg
);
2548 tem
= fold_ignored_result (arg
);
2549 return fold_build1_loc (loc
, NOP_EXPR
, type
, tem
);
2552 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (orig
))
2553 return fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
2557 protected_set_expr_location_unshare (tem
, loc
);
2561 /* Return false if expr can be assumed not to be an lvalue, true
2565 maybe_lvalue_p (const_tree x
)
2567 /* We only need to wrap lvalue tree codes. */
2568 switch (TREE_CODE (x
))
2581 case ARRAY_RANGE_REF
:
2587 case PREINCREMENT_EXPR
:
2588 case PREDECREMENT_EXPR
:
2590 case TRY_CATCH_EXPR
:
2591 case WITH_CLEANUP_EXPR
:
2600 /* Assume the worst for front-end tree codes. */
2601 if ((int)TREE_CODE (x
) >= NUM_TREE_CODES
)
2609 /* Return an expr equal to X but certainly not valid as an lvalue. */
2612 non_lvalue_loc (location_t loc
, tree x
)
2614 /* While we are in GIMPLE, NON_LVALUE_EXPR doesn't mean anything to
2619 if (! maybe_lvalue_p (x
))
2621 return build1_loc (loc
, NON_LVALUE_EXPR
, TREE_TYPE (x
), x
);
2624 /* When pedantic, return an expr equal to X but certainly not valid as a
2625 pedantic lvalue. Otherwise, return X. */
2628 pedantic_non_lvalue_loc (location_t loc
, tree x
)
2630 return protected_set_expr_location_unshare (x
, loc
);
2633 /* Given a tree comparison code, return the code that is the logical inverse.
2634 It is generally not safe to do this for floating-point comparisons, except
2635 for EQ_EXPR, NE_EXPR, ORDERED_EXPR and UNORDERED_EXPR, so we return
2636 ERROR_MARK in this case. */
2639 invert_tree_comparison (enum tree_code code
, bool honor_nans
)
2641 if (honor_nans
&& flag_trapping_math
&& code
!= EQ_EXPR
&& code
!= NE_EXPR
2642 && code
!= ORDERED_EXPR
&& code
!= UNORDERED_EXPR
)
2652 return honor_nans
? UNLE_EXPR
: LE_EXPR
;
2654 return honor_nans
? UNLT_EXPR
: LT_EXPR
;
2656 return honor_nans
? UNGE_EXPR
: GE_EXPR
;
2658 return honor_nans
? UNGT_EXPR
: GT_EXPR
;
2672 return UNORDERED_EXPR
;
2673 case UNORDERED_EXPR
:
2674 return ORDERED_EXPR
;
2680 /* Similar, but return the comparison that results if the operands are
2681 swapped. This is safe for floating-point. */
2684 swap_tree_comparison (enum tree_code code
)
2691 case UNORDERED_EXPR
:
2717 /* Convert a comparison tree code from an enum tree_code representation
2718 into a compcode bit-based encoding. This function is the inverse of
2719 compcode_to_comparison. */
2721 static enum comparison_code
2722 comparison_to_compcode (enum tree_code code
)
2739 return COMPCODE_ORD
;
2740 case UNORDERED_EXPR
:
2741 return COMPCODE_UNORD
;
2743 return COMPCODE_UNLT
;
2745 return COMPCODE_UNEQ
;
2747 return COMPCODE_UNLE
;
2749 return COMPCODE_UNGT
;
2751 return COMPCODE_LTGT
;
2753 return COMPCODE_UNGE
;
2759 /* Convert a compcode bit-based encoding of a comparison operator back
2760 to GCC's enum tree_code representation. This function is the
2761 inverse of comparison_to_compcode. */
2763 static enum tree_code
2764 compcode_to_comparison (enum comparison_code code
)
2781 return ORDERED_EXPR
;
2782 case COMPCODE_UNORD
:
2783 return UNORDERED_EXPR
;
2801 /* Return true if COND1 tests the opposite condition of COND2. */
2804 inverse_conditions_p (const_tree cond1
, const_tree cond2
)
2806 return (COMPARISON_CLASS_P (cond1
)
2807 && COMPARISON_CLASS_P (cond2
)
2808 && (invert_tree_comparison
2810 HONOR_NANS (TREE_OPERAND (cond1
, 0))) == TREE_CODE (cond2
))
2811 && operand_equal_p (TREE_OPERAND (cond1
, 0),
2812 TREE_OPERAND (cond2
, 0), 0)
2813 && operand_equal_p (TREE_OPERAND (cond1
, 1),
2814 TREE_OPERAND (cond2
, 1), 0));
2817 /* Return a tree for the comparison which is the combination of
2818 doing the AND or OR (depending on CODE) of the two operations LCODE
2819 and RCODE on the identical operands LL_ARG and LR_ARG. Take into account
2820 the possibility of trapping if the mode has NaNs, and return NULL_TREE
2821 if this makes the transformation invalid. */
2824 combine_comparisons (location_t loc
,
2825 enum tree_code code
, enum tree_code lcode
,
2826 enum tree_code rcode
, tree truth_type
,
2827 tree ll_arg
, tree lr_arg
)
2829 bool honor_nans
= HONOR_NANS (ll_arg
);
2830 enum comparison_code lcompcode
= comparison_to_compcode (lcode
);
2831 enum comparison_code rcompcode
= comparison_to_compcode (rcode
);
2836 case TRUTH_AND_EXPR
: case TRUTH_ANDIF_EXPR
:
2837 compcode
= lcompcode
& rcompcode
;
2840 case TRUTH_OR_EXPR
: case TRUTH_ORIF_EXPR
:
2841 compcode
= lcompcode
| rcompcode
;
2850 /* Eliminate unordered comparisons, as well as LTGT and ORD
2851 which are not used unless the mode has NaNs. */
2852 compcode
&= ~COMPCODE_UNORD
;
2853 if (compcode
== COMPCODE_LTGT
)
2854 compcode
= COMPCODE_NE
;
2855 else if (compcode
== COMPCODE_ORD
)
2856 compcode
= COMPCODE_TRUE
;
2858 else if (flag_trapping_math
)
2860 /* Check that the original operation and the optimized ones will trap
2861 under the same condition. */
2862 bool ltrap
= (lcompcode
& COMPCODE_UNORD
) == 0
2863 && (lcompcode
!= COMPCODE_EQ
)
2864 && (lcompcode
!= COMPCODE_ORD
);
2865 bool rtrap
= (rcompcode
& COMPCODE_UNORD
) == 0
2866 && (rcompcode
!= COMPCODE_EQ
)
2867 && (rcompcode
!= COMPCODE_ORD
);
2868 bool trap
= (compcode
& COMPCODE_UNORD
) == 0
2869 && (compcode
!= COMPCODE_EQ
)
2870 && (compcode
!= COMPCODE_ORD
);
2872 /* In a short-circuited boolean expression the LHS might be
2873 such that the RHS, if evaluated, will never trap. For
2874 example, in ORD (x, y) && (x < y), we evaluate the RHS only
2875 if neither x nor y is NaN. (This is a mixed blessing: for
2876 example, the expression above will never trap, hence
2877 optimizing it to x < y would be invalid). */
2878 if ((code
== TRUTH_ORIF_EXPR
&& (lcompcode
& COMPCODE_UNORD
))
2879 || (code
== TRUTH_ANDIF_EXPR
&& !(lcompcode
& COMPCODE_UNORD
)))
2882 /* If the comparison was short-circuited, and only the RHS
2883 trapped, we may now generate a spurious trap. */
2885 && (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
))
2888 /* If we changed the conditions that cause a trap, we lose. */
2889 if ((ltrap
|| rtrap
) != trap
)
2893 if (compcode
== COMPCODE_TRUE
)
2894 return constant_boolean_node (true, truth_type
);
2895 else if (compcode
== COMPCODE_FALSE
)
2896 return constant_boolean_node (false, truth_type
);
2899 enum tree_code tcode
;
2901 tcode
= compcode_to_comparison ((enum comparison_code
) compcode
);
2902 return fold_build2_loc (loc
, tcode
, truth_type
, ll_arg
, lr_arg
);
2906 /* Return nonzero if two operands (typically of the same tree node)
2907 are necessarily equal. FLAGS modifies behavior as follows:
2909 If OEP_ONLY_CONST is set, only return nonzero for constants.
2910 This function tests whether the operands are indistinguishable;
2911 it does not test whether they are equal using C's == operation.
2912 The distinction is important for IEEE floating point, because
2913 (1) -0.0 and 0.0 are distinguishable, but -0.0==0.0, and
2914 (2) two NaNs may be indistinguishable, but NaN!=NaN.
2916 If OEP_ONLY_CONST is unset, a VAR_DECL is considered equal to itself
2917 even though it may hold multiple values during a function.
2918 This is because a GCC tree node guarantees that nothing else is
2919 executed between the evaluation of its "operands" (which may often
2920 be evaluated in arbitrary order). Hence if the operands themselves
2921 don't side-effect, the VAR_DECLs, PARM_DECLs etc... must hold the
2922 same value in each operand/subexpression. Hence leaving OEP_ONLY_CONST
2923 unset means assuming isochronic (or instantaneous) tree equivalence.
2924 Unless comparing arbitrary expression trees, such as from different
2925 statements, this flag can usually be left unset.
2927 If OEP_PURE_SAME is set, then pure functions with identical arguments
2928 are considered the same. It is used when the caller has other ways
2929 to ensure that global memory is unchanged in between.
2931 If OEP_ADDRESS_OF is set, we are actually comparing addresses of objects,
2932 not values of expressions.
2934 If OEP_LEXICOGRAPHIC is set, then also handle expressions with side-effects
2935 such as MODIFY_EXPR, RETURN_EXPR, as well as STATEMENT_LISTs.
2937 Unless OEP_MATCH_SIDE_EFFECTS is set, the function returns false on
2938 any operand with side effect. This is unnecesarily conservative in the
2939 case we know that arg0 and arg1 are in disjoint code paths (such as in
2940 ?: operator). In addition OEP_MATCH_SIDE_EFFECTS is used when comparing
2941 addresses with TREE_CONSTANT flag set so we know that &var == &var
2942 even if var is volatile. */
2945 operand_compare::operand_equal_p (const_tree arg0
, const_tree arg1
,
2949 if (verify_hash_value (arg0
, arg1
, flags
, &r
))
2952 STRIP_ANY_LOCATION_WRAPPER (arg0
);
2953 STRIP_ANY_LOCATION_WRAPPER (arg1
);
2955 /* If either is ERROR_MARK, they aren't equal. */
2956 if (TREE_CODE (arg0
) == ERROR_MARK
|| TREE_CODE (arg1
) == ERROR_MARK
2957 || TREE_TYPE (arg0
) == error_mark_node
2958 || TREE_TYPE (arg1
) == error_mark_node
)
2961 /* Similar, if either does not have a type (like a template id),
2962 they aren't equal. */
2963 if (!TREE_TYPE (arg0
) || !TREE_TYPE (arg1
))
2966 /* We cannot consider pointers to different address space equal. */
2967 if (POINTER_TYPE_P (TREE_TYPE (arg0
))
2968 && POINTER_TYPE_P (TREE_TYPE (arg1
))
2969 && (TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (arg0
)))
2970 != TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (arg1
)))))
2973 /* Check equality of integer constants before bailing out due to
2974 precision differences. */
2975 if (TREE_CODE (arg0
) == INTEGER_CST
&& TREE_CODE (arg1
) == INTEGER_CST
)
2977 /* Address of INTEGER_CST is not defined; check that we did not forget
2978 to drop the OEP_ADDRESS_OF flags. */
2979 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
2980 return tree_int_cst_equal (arg0
, arg1
);
2983 if (!(flags
& OEP_ADDRESS_OF
))
2985 /* If both types don't have the same signedness, then we can't consider
2986 them equal. We must check this before the STRIP_NOPS calls
2987 because they may change the signedness of the arguments. As pointers
2988 strictly don't have a signedness, require either two pointers or
2989 two non-pointers as well. */
2990 if (TYPE_UNSIGNED (TREE_TYPE (arg0
)) != TYPE_UNSIGNED (TREE_TYPE (arg1
))
2991 || POINTER_TYPE_P (TREE_TYPE (arg0
))
2992 != POINTER_TYPE_P (TREE_TYPE (arg1
)))
2995 /* If both types don't have the same precision, then it is not safe
2997 if (element_precision (TREE_TYPE (arg0
))
2998 != element_precision (TREE_TYPE (arg1
)))
3005 /* FIXME: Fortran FE currently produce ADDR_EXPR of NOP_EXPR. Enable the
3006 sanity check once the issue is solved. */
3008 /* Addresses of conversions and SSA_NAMEs (and many other things)
3009 are not defined. Check that we did not forget to drop the
3010 OEP_ADDRESS_OF/OEP_CONSTANT_ADDRESS_OF flags. */
3011 gcc_checking_assert (!CONVERT_EXPR_P (arg0
) && !CONVERT_EXPR_P (arg1
)
3012 && TREE_CODE (arg0
) != SSA_NAME
);
3015 /* In case both args are comparisons but with different comparison
3016 code, try to swap the comparison operands of one arg to produce
3017 a match and compare that variant. */
3018 if (TREE_CODE (arg0
) != TREE_CODE (arg1
)
3019 && COMPARISON_CLASS_P (arg0
)
3020 && COMPARISON_CLASS_P (arg1
))
3022 enum tree_code swap_code
= swap_tree_comparison (TREE_CODE (arg1
));
3024 if (TREE_CODE (arg0
) == swap_code
)
3025 return operand_equal_p (TREE_OPERAND (arg0
, 0),
3026 TREE_OPERAND (arg1
, 1), flags
)
3027 && operand_equal_p (TREE_OPERAND (arg0
, 1),
3028 TREE_OPERAND (arg1
, 0), flags
);
3031 if (TREE_CODE (arg0
) != TREE_CODE (arg1
))
3033 /* NOP_EXPR and CONVERT_EXPR are considered equal. */
3034 if (CONVERT_EXPR_P (arg0
) && CONVERT_EXPR_P (arg1
))
3036 else if (flags
& OEP_ADDRESS_OF
)
3038 /* If we are interested in comparing addresses ignore
3039 MEM_REF wrappings of the base that can appear just for
3041 if (TREE_CODE (arg0
) == MEM_REF
3043 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == ADDR_EXPR
3044 && TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0) == arg1
3045 && integer_zerop (TREE_OPERAND (arg0
, 1)))
3047 else if (TREE_CODE (arg1
) == MEM_REF
3049 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == ADDR_EXPR
3050 && TREE_OPERAND (TREE_OPERAND (arg1
, 0), 0) == arg0
3051 && integer_zerop (TREE_OPERAND (arg1
, 1)))
3059 /* When not checking adddresses, this is needed for conversions and for
3060 COMPONENT_REF. Might as well play it safe and always test this. */
3061 if (TREE_CODE (TREE_TYPE (arg0
)) == ERROR_MARK
3062 || TREE_CODE (TREE_TYPE (arg1
)) == ERROR_MARK
3063 || (TYPE_MODE (TREE_TYPE (arg0
)) != TYPE_MODE (TREE_TYPE (arg1
))
3064 && !(flags
& OEP_ADDRESS_OF
)))
3067 /* If ARG0 and ARG1 are the same SAVE_EXPR, they are necessarily equal.
3068 We don't care about side effects in that case because the SAVE_EXPR
3069 takes care of that for us. In all other cases, two expressions are
3070 equal if they have no side effects. If we have two identical
3071 expressions with side effects that should be treated the same due
3072 to the only side effects being identical SAVE_EXPR's, that will
3073 be detected in the recursive calls below.
3074 If we are taking an invariant address of two identical objects
3075 they are necessarily equal as well. */
3076 if (arg0
== arg1
&& ! (flags
& OEP_ONLY_CONST
)
3077 && (TREE_CODE (arg0
) == SAVE_EXPR
3078 || (flags
& OEP_MATCH_SIDE_EFFECTS
)
3079 || (! TREE_SIDE_EFFECTS (arg0
) && ! TREE_SIDE_EFFECTS (arg1
))))
3082 /* Next handle constant cases, those for which we can return 1 even
3083 if ONLY_CONST is set. */
3084 if (TREE_CONSTANT (arg0
) && TREE_CONSTANT (arg1
))
3085 switch (TREE_CODE (arg0
))
3088 return tree_int_cst_equal (arg0
, arg1
);
3091 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (arg0
),
3092 TREE_FIXED_CST (arg1
));
3095 if (real_identical (&TREE_REAL_CST (arg0
), &TREE_REAL_CST (arg1
)))
3099 if (!HONOR_SIGNED_ZEROS (arg0
))
3101 /* If we do not distinguish between signed and unsigned zero,
3102 consider them equal. */
3103 if (real_zerop (arg0
) && real_zerop (arg1
))
3110 if (VECTOR_CST_LOG2_NPATTERNS (arg0
)
3111 != VECTOR_CST_LOG2_NPATTERNS (arg1
))
3114 if (VECTOR_CST_NELTS_PER_PATTERN (arg0
)
3115 != VECTOR_CST_NELTS_PER_PATTERN (arg1
))
3118 unsigned int count
= vector_cst_encoded_nelts (arg0
);
3119 for (unsigned int i
= 0; i
< count
; ++i
)
3120 if (!operand_equal_p (VECTOR_CST_ENCODED_ELT (arg0
, i
),
3121 VECTOR_CST_ENCODED_ELT (arg1
, i
), flags
))
3127 return (operand_equal_p (TREE_REALPART (arg0
), TREE_REALPART (arg1
),
3129 && operand_equal_p (TREE_IMAGPART (arg0
), TREE_IMAGPART (arg1
),
3133 return (TREE_STRING_LENGTH (arg0
) == TREE_STRING_LENGTH (arg1
)
3134 && ! memcmp (TREE_STRING_POINTER (arg0
),
3135 TREE_STRING_POINTER (arg1
),
3136 TREE_STRING_LENGTH (arg0
)));
3139 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
3140 return operand_equal_p (TREE_OPERAND (arg0
, 0), TREE_OPERAND (arg1
, 0),
3141 flags
| OEP_ADDRESS_OF
3142 | OEP_MATCH_SIDE_EFFECTS
);
3144 /* In GIMPLE empty constructors are allowed in initializers of
3146 return !CONSTRUCTOR_NELTS (arg0
) && !CONSTRUCTOR_NELTS (arg1
);
3151 if (flags
& OEP_ONLY_CONST
)
3154 /* Define macros to test an operand from arg0 and arg1 for equality and a
3155 variant that allows null and views null as being different from any
3156 non-null value. In the latter case, if either is null, the both
3157 must be; otherwise, do the normal comparison. */
3158 #define OP_SAME(N) operand_equal_p (TREE_OPERAND (arg0, N), \
3159 TREE_OPERAND (arg1, N), flags)
3161 #define OP_SAME_WITH_NULL(N) \
3162 ((!TREE_OPERAND (arg0, N) || !TREE_OPERAND (arg1, N)) \
3163 ? TREE_OPERAND (arg0, N) == TREE_OPERAND (arg1, N) : OP_SAME (N))
3165 switch (TREE_CODE_CLASS (TREE_CODE (arg0
)))
3168 /* Two conversions are equal only if signedness and modes match. */
3169 switch (TREE_CODE (arg0
))
3172 case FIX_TRUNC_EXPR
:
3173 if (TYPE_UNSIGNED (TREE_TYPE (arg0
))
3174 != TYPE_UNSIGNED (TREE_TYPE (arg1
)))
3184 case tcc_comparison
:
3186 if (OP_SAME (0) && OP_SAME (1))
3189 /* For commutative ops, allow the other order. */
3190 return (commutative_tree_code (TREE_CODE (arg0
))
3191 && operand_equal_p (TREE_OPERAND (arg0
, 0),
3192 TREE_OPERAND (arg1
, 1), flags
)
3193 && operand_equal_p (TREE_OPERAND (arg0
, 1),
3194 TREE_OPERAND (arg1
, 0), flags
));
3197 /* If either of the pointer (or reference) expressions we are
3198 dereferencing contain a side effect, these cannot be equal,
3199 but their addresses can be. */
3200 if ((flags
& OEP_MATCH_SIDE_EFFECTS
) == 0
3201 && (TREE_SIDE_EFFECTS (arg0
)
3202 || TREE_SIDE_EFFECTS (arg1
)))
3205 switch (TREE_CODE (arg0
))
3208 if (!(flags
& OEP_ADDRESS_OF
))
3210 if (TYPE_ALIGN (TREE_TYPE (arg0
))
3211 != TYPE_ALIGN (TREE_TYPE (arg1
)))
3213 /* Verify that the access types are compatible. */
3214 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg0
))
3215 != TYPE_MAIN_VARIANT (TREE_TYPE (arg1
)))
3218 flags
&= ~OEP_ADDRESS_OF
;
3222 /* Require the same offset. */
3223 if (!operand_equal_p (TYPE_SIZE (TREE_TYPE (arg0
)),
3224 TYPE_SIZE (TREE_TYPE (arg1
)),
3225 flags
& ~OEP_ADDRESS_OF
))
3230 case VIEW_CONVERT_EXPR
:
3233 case TARGET_MEM_REF
:
3235 if (!(flags
& OEP_ADDRESS_OF
))
3237 /* Require equal access sizes */
3238 if (TYPE_SIZE (TREE_TYPE (arg0
)) != TYPE_SIZE (TREE_TYPE (arg1
))
3239 && (!TYPE_SIZE (TREE_TYPE (arg0
))
3240 || !TYPE_SIZE (TREE_TYPE (arg1
))
3241 || !operand_equal_p (TYPE_SIZE (TREE_TYPE (arg0
)),
3242 TYPE_SIZE (TREE_TYPE (arg1
)),
3245 /* Verify that access happens in similar types. */
3246 if (!types_compatible_p (TREE_TYPE (arg0
), TREE_TYPE (arg1
)))
3248 /* Verify that accesses are TBAA compatible. */
3249 if (!alias_ptr_types_compatible_p
3250 (TREE_TYPE (TREE_OPERAND (arg0
, 1)),
3251 TREE_TYPE (TREE_OPERAND (arg1
, 1)))
3252 || (MR_DEPENDENCE_CLIQUE (arg0
)
3253 != MR_DEPENDENCE_CLIQUE (arg1
))
3254 || (MR_DEPENDENCE_BASE (arg0
)
3255 != MR_DEPENDENCE_BASE (arg1
)))
3257 /* Verify that alignment is compatible. */
3258 if (TYPE_ALIGN (TREE_TYPE (arg0
))
3259 != TYPE_ALIGN (TREE_TYPE (arg1
)))
3262 flags
&= ~OEP_ADDRESS_OF
;
3263 return (OP_SAME (0) && OP_SAME (1)
3264 /* TARGET_MEM_REF require equal extra operands. */
3265 && (TREE_CODE (arg0
) != TARGET_MEM_REF
3266 || (OP_SAME_WITH_NULL (2)
3267 && OP_SAME_WITH_NULL (3)
3268 && OP_SAME_WITH_NULL (4))));
3271 case ARRAY_RANGE_REF
:
3274 flags
&= ~OEP_ADDRESS_OF
;
3275 /* Compare the array index by value if it is constant first as we
3276 may have different types but same value here. */
3277 return ((tree_int_cst_equal (TREE_OPERAND (arg0
, 1),
3278 TREE_OPERAND (arg1
, 1))
3280 && OP_SAME_WITH_NULL (2)
3281 && OP_SAME_WITH_NULL (3)
3282 /* Compare low bound and element size as with OEP_ADDRESS_OF
3283 we have to account for the offset of the ref. */
3284 && (TREE_TYPE (TREE_OPERAND (arg0
, 0))
3285 == TREE_TYPE (TREE_OPERAND (arg1
, 0))
3286 || (operand_equal_p (array_ref_low_bound
3287 (CONST_CAST_TREE (arg0
)),
3289 (CONST_CAST_TREE (arg1
)), flags
)
3290 && operand_equal_p (array_ref_element_size
3291 (CONST_CAST_TREE (arg0
)),
3292 array_ref_element_size
3293 (CONST_CAST_TREE (arg1
)),
3297 /* Handle operand 2 the same as for ARRAY_REF. Operand 0
3298 may be NULL when we're called to compare MEM_EXPRs. */
3299 if (!OP_SAME_WITH_NULL (0)
3302 flags
&= ~OEP_ADDRESS_OF
;
3303 return OP_SAME_WITH_NULL (2);
3308 flags
&= ~OEP_ADDRESS_OF
;
3309 return OP_SAME (1) && OP_SAME (2);
3311 /* Virtual table call. */
3314 if (!operand_equal_p (OBJ_TYPE_REF_EXPR (arg0
),
3315 OBJ_TYPE_REF_EXPR (arg1
), flags
))
3317 if (tree_to_uhwi (OBJ_TYPE_REF_TOKEN (arg0
))
3318 != tree_to_uhwi (OBJ_TYPE_REF_TOKEN (arg1
)))
3320 if (!operand_equal_p (OBJ_TYPE_REF_OBJECT (arg0
),
3321 OBJ_TYPE_REF_OBJECT (arg1
), flags
))
3323 if (!types_same_for_odr (obj_type_ref_class (arg0
),
3324 obj_type_ref_class (arg1
)))
3333 case tcc_expression
:
3334 switch (TREE_CODE (arg0
))
3337 /* Be sure we pass right ADDRESS_OF flag. */
3338 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
3339 return operand_equal_p (TREE_OPERAND (arg0
, 0),
3340 TREE_OPERAND (arg1
, 0),
3341 flags
| OEP_ADDRESS_OF
);
3343 case TRUTH_NOT_EXPR
:
3346 case TRUTH_ANDIF_EXPR
:
3347 case TRUTH_ORIF_EXPR
:
3348 return OP_SAME (0) && OP_SAME (1);
3350 case WIDEN_MULT_PLUS_EXPR
:
3351 case WIDEN_MULT_MINUS_EXPR
:
3354 /* The multiplcation operands are commutative. */
3357 case TRUTH_AND_EXPR
:
3359 case TRUTH_XOR_EXPR
:
3360 if (OP_SAME (0) && OP_SAME (1))
3363 /* Otherwise take into account this is a commutative operation. */
3364 return (operand_equal_p (TREE_OPERAND (arg0
, 0),
3365 TREE_OPERAND (arg1
, 1), flags
)
3366 && operand_equal_p (TREE_OPERAND (arg0
, 1),
3367 TREE_OPERAND (arg1
, 0), flags
));
3370 if (! OP_SAME (1) || ! OP_SAME_WITH_NULL (2))
3372 flags
&= ~OEP_ADDRESS_OF
;
3375 case BIT_INSERT_EXPR
:
3376 /* BIT_INSERT_EXPR has an implict operand as the type precision
3377 of op1. Need to check to make sure they are the same. */
3378 if (TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
3379 && TREE_CODE (TREE_OPERAND (arg1
, 1)) == INTEGER_CST
3380 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg0
, 1)))
3381 != TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg1
, 1))))
3387 return OP_SAME (0) && OP_SAME (1) && OP_SAME (2);
3392 case PREDECREMENT_EXPR
:
3393 case PREINCREMENT_EXPR
:
3394 case POSTDECREMENT_EXPR
:
3395 case POSTINCREMENT_EXPR
:
3396 if (flags
& OEP_LEXICOGRAPHIC
)
3397 return OP_SAME (0) && OP_SAME (1);
3400 case CLEANUP_POINT_EXPR
:
3403 if (flags
& OEP_LEXICOGRAPHIC
)
3412 switch (TREE_CODE (arg0
))
3415 if ((CALL_EXPR_FN (arg0
) == NULL_TREE
)
3416 != (CALL_EXPR_FN (arg1
) == NULL_TREE
))
3417 /* If not both CALL_EXPRs are either internal or normal function
3418 functions, then they are not equal. */
3420 else if (CALL_EXPR_FN (arg0
) == NULL_TREE
)
3422 /* If the CALL_EXPRs call different internal functions, then they
3424 if (CALL_EXPR_IFN (arg0
) != CALL_EXPR_IFN (arg1
))
3429 /* If the CALL_EXPRs call different functions, then they are not
3431 if (! operand_equal_p (CALL_EXPR_FN (arg0
), CALL_EXPR_FN (arg1
),
3436 /* FIXME: We could skip this test for OEP_MATCH_SIDE_EFFECTS. */
3438 unsigned int cef
= call_expr_flags (arg0
);
3439 if (flags
& OEP_PURE_SAME
)
3440 cef
&= ECF_CONST
| ECF_PURE
;
3443 if (!cef
&& !(flags
& OEP_LEXICOGRAPHIC
))
3447 /* Now see if all the arguments are the same. */
3449 const_call_expr_arg_iterator iter0
, iter1
;
3451 for (a0
= first_const_call_expr_arg (arg0
, &iter0
),
3452 a1
= first_const_call_expr_arg (arg1
, &iter1
);
3454 a0
= next_const_call_expr_arg (&iter0
),
3455 a1
= next_const_call_expr_arg (&iter1
))
3456 if (! operand_equal_p (a0
, a1
, flags
))
3459 /* If we get here and both argument lists are exhausted
3460 then the CALL_EXPRs are equal. */
3461 return ! (a0
|| a1
);
3467 case tcc_declaration
:
3468 /* Consider __builtin_sqrt equal to sqrt. */
3469 return (TREE_CODE (arg0
) == FUNCTION_DECL
3470 && fndecl_built_in_p (arg0
) && fndecl_built_in_p (arg1
)
3471 && DECL_BUILT_IN_CLASS (arg0
) == DECL_BUILT_IN_CLASS (arg1
)
3472 && (DECL_UNCHECKED_FUNCTION_CODE (arg0
)
3473 == DECL_UNCHECKED_FUNCTION_CODE (arg1
)));
3475 case tcc_exceptional
:
3476 if (TREE_CODE (arg0
) == CONSTRUCTOR
)
3478 /* In GIMPLE constructors are used only to build vectors from
3479 elements. Individual elements in the constructor must be
3480 indexed in increasing order and form an initial sequence.
3482 We make no effort to compare constructors in generic.
3483 (see sem_variable::equals in ipa-icf which can do so for
3485 if (!VECTOR_TYPE_P (TREE_TYPE (arg0
))
3486 || !VECTOR_TYPE_P (TREE_TYPE (arg1
)))
3489 /* Be sure that vectors constructed have the same representation.
3490 We only tested element precision and modes to match.
3491 Vectors may be BLKmode and thus also check that the number of
3493 if (maybe_ne (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0
)),
3494 TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg1
))))
3497 vec
<constructor_elt
, va_gc
> *v0
= CONSTRUCTOR_ELTS (arg0
);
3498 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (arg1
);
3499 unsigned int len
= vec_safe_length (v0
);
3501 if (len
!= vec_safe_length (v1
))
3504 for (unsigned int i
= 0; i
< len
; i
++)
3506 constructor_elt
*c0
= &(*v0
)[i
];
3507 constructor_elt
*c1
= &(*v1
)[i
];
3509 if (!operand_equal_p (c0
->value
, c1
->value
, flags
)
3510 /* In GIMPLE the indexes can be either NULL or matching i.
3511 Double check this so we won't get false
3512 positives for GENERIC. */
3514 && (TREE_CODE (c0
->index
) != INTEGER_CST
3515 || compare_tree_int (c0
->index
, i
)))
3517 && (TREE_CODE (c1
->index
) != INTEGER_CST
3518 || compare_tree_int (c1
->index
, i
))))
3523 else if (TREE_CODE (arg0
) == STATEMENT_LIST
3524 && (flags
& OEP_LEXICOGRAPHIC
))
3526 /* Compare the STATEMENT_LISTs. */
3527 tree_stmt_iterator tsi1
, tsi2
;
3528 tree body1
= CONST_CAST_TREE (arg0
);
3529 tree body2
= CONST_CAST_TREE (arg1
);
3530 for (tsi1
= tsi_start (body1
), tsi2
= tsi_start (body2
); ;
3531 tsi_next (&tsi1
), tsi_next (&tsi2
))
3533 /* The lists don't have the same number of statements. */
3534 if (tsi_end_p (tsi1
) ^ tsi_end_p (tsi2
))
3536 if (tsi_end_p (tsi1
) && tsi_end_p (tsi2
))
3538 if (!operand_equal_p (tsi_stmt (tsi1
), tsi_stmt (tsi2
),
3539 flags
& (OEP_LEXICOGRAPHIC
3540 | OEP_NO_HASH_CHECK
)))
3547 switch (TREE_CODE (arg0
))
3550 if (flags
& OEP_LEXICOGRAPHIC
)
3551 return OP_SAME_WITH_NULL (0);
3553 case DEBUG_BEGIN_STMT
:
3554 if (flags
& OEP_LEXICOGRAPHIC
)
3566 #undef OP_SAME_WITH_NULL
3569 /* Generate a hash value for an expression. This can be used iteratively
3570 by passing a previous result as the HSTATE argument. */
3573 operand_compare::hash_operand (const_tree t
, inchash::hash
&hstate
,
3577 enum tree_code code
;
3578 enum tree_code_class tclass
;
3580 if (t
== NULL_TREE
|| t
== error_mark_node
)
3582 hstate
.merge_hash (0);
3586 STRIP_ANY_LOCATION_WRAPPER (t
);
3588 if (!(flags
& OEP_ADDRESS_OF
))
3591 code
= TREE_CODE (t
);
3595 /* Alas, constants aren't shared, so we can't rely on pointer
3598 hstate
.merge_hash (0);
3601 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
3602 for (i
= 0; i
< TREE_INT_CST_EXT_NUNITS (t
); i
++)
3603 hstate
.add_hwi (TREE_INT_CST_ELT (t
, i
));
3608 if (!HONOR_SIGNED_ZEROS (t
) && real_zerop (t
))
3611 val2
= real_hash (TREE_REAL_CST_PTR (t
));
3612 hstate
.merge_hash (val2
);
3617 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
3618 hstate
.merge_hash (val2
);
3622 hstate
.add ((const void *) TREE_STRING_POINTER (t
),
3623 TREE_STRING_LENGTH (t
));
3626 hash_operand (TREE_REALPART (t
), hstate
, flags
);
3627 hash_operand (TREE_IMAGPART (t
), hstate
, flags
);
3631 hstate
.add_int (VECTOR_CST_NPATTERNS (t
));
3632 hstate
.add_int (VECTOR_CST_NELTS_PER_PATTERN (t
));
3633 unsigned int count
= vector_cst_encoded_nelts (t
);
3634 for (unsigned int i
= 0; i
< count
; ++i
)
3635 hash_operand (VECTOR_CST_ENCODED_ELT (t
, i
), hstate
, flags
);
3639 /* We can just compare by pointer. */
3640 hstate
.add_hwi (SSA_NAME_VERSION (t
));
3642 case PLACEHOLDER_EXPR
:
3643 /* The node itself doesn't matter. */
3650 /* A list of expressions, for a CALL_EXPR or as the elements of a
3652 for (; t
; t
= TREE_CHAIN (t
))
3653 hash_operand (TREE_VALUE (t
), hstate
, flags
);
3657 unsigned HOST_WIDE_INT idx
;
3659 flags
&= ~OEP_ADDRESS_OF
;
3660 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
3662 hash_operand (field
, hstate
, flags
);
3663 hash_operand (value
, hstate
, flags
);
3667 case STATEMENT_LIST
:
3669 tree_stmt_iterator i
;
3670 for (i
= tsi_start (CONST_CAST_TREE (t
));
3671 !tsi_end_p (i
); tsi_next (&i
))
3672 hash_operand (tsi_stmt (i
), hstate
, flags
);
3676 for (i
= 0; i
< TREE_VEC_LENGTH (t
); ++i
)
3677 hash_operand (TREE_VEC_ELT (t
, i
), hstate
, flags
);
3679 case IDENTIFIER_NODE
:
3680 hstate
.add_object (IDENTIFIER_HASH_VALUE (t
));
3683 inchash::add_expr (DECL_FIELD_OFFSET (t
), hstate
, flags
);
3684 inchash::add_expr (DECL_FIELD_BIT_OFFSET (t
), hstate
, flags
);
3687 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
3688 Otherwise nodes that compare equal according to operand_equal_p might
3689 get different hash codes. However, don't do this for machine specific
3690 or front end builtins, since the function code is overloaded in those
3692 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
3693 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
3695 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
3696 code
= TREE_CODE (t
);
3700 if (POLY_INT_CST_P (t
))
3702 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
3703 hstate
.add_wide_int (wi::to_wide (POLY_INT_CST_COEFF (t
, i
)));
3706 tclass
= TREE_CODE_CLASS (code
);
3708 if (tclass
== tcc_declaration
)
3710 /* DECL's have a unique ID */
3711 hstate
.add_hwi (DECL_UID (t
));
3713 else if (tclass
== tcc_comparison
&& !commutative_tree_code (code
))
3715 /* For comparisons that can be swapped, use the lower
3717 enum tree_code ccode
= swap_tree_comparison (code
);
3720 hstate
.add_object (ccode
);
3721 hash_operand (TREE_OPERAND (t
, ccode
!= code
), hstate
, flags
);
3722 hash_operand (TREE_OPERAND (t
, ccode
== code
), hstate
, flags
);
3724 else if (CONVERT_EXPR_CODE_P (code
))
3726 /* NOP_EXPR and CONVERT_EXPR are considered equal by
3728 enum tree_code ccode
= NOP_EXPR
;
3729 hstate
.add_object (ccode
);
3731 /* Don't hash the type, that can lead to having nodes which
3732 compare equal according to operand_equal_p, but which
3733 have different hash codes. Make sure to include signedness
3734 in the hash computation. */
3735 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
3736 hash_operand (TREE_OPERAND (t
, 0), hstate
, flags
);
3738 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
3739 else if (code
== MEM_REF
3740 && (flags
& OEP_ADDRESS_OF
) != 0
3741 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
3742 && DECL_P (TREE_OPERAND (TREE_OPERAND (t
, 0), 0))
3743 && integer_zerop (TREE_OPERAND (t
, 1)))
3744 hash_operand (TREE_OPERAND (TREE_OPERAND (t
, 0), 0),
3746 /* Don't ICE on FE specific trees, or their arguments etc.
3747 during operand_equal_p hash verification. */
3748 else if (!IS_EXPR_CODE_CLASS (tclass
))
3749 gcc_assert (flags
& OEP_HASH_CHECK
);
3752 unsigned int sflags
= flags
;
3754 hstate
.add_object (code
);
3759 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
3760 flags
|= OEP_ADDRESS_OF
;
3766 case TARGET_MEM_REF
:
3767 flags
&= ~OEP_ADDRESS_OF
;
3772 case ARRAY_RANGE_REF
:
3775 sflags
&= ~OEP_ADDRESS_OF
;
3779 flags
&= ~OEP_ADDRESS_OF
;
3782 case WIDEN_MULT_PLUS_EXPR
:
3783 case WIDEN_MULT_MINUS_EXPR
:
3785 /* The multiplication operands are commutative. */
3786 inchash::hash one
, two
;
3787 hash_operand (TREE_OPERAND (t
, 0), one
, flags
);
3788 hash_operand (TREE_OPERAND (t
, 1), two
, flags
);
3789 hstate
.add_commutative (one
, two
);
3790 hash_operand (TREE_OPERAND (t
, 2), two
, flags
);
3795 if (CALL_EXPR_FN (t
) == NULL_TREE
)
3796 hstate
.add_int (CALL_EXPR_IFN (t
));
3800 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
3801 Usually different TARGET_EXPRs just should use
3802 different temporaries in their slots. */
3803 hash_operand (TARGET_EXPR_SLOT (t
), hstate
, flags
);
3806 /* Virtual table call. */
3808 inchash::add_expr (OBJ_TYPE_REF_EXPR (t
), hstate
, flags
);
3809 inchash::add_expr (OBJ_TYPE_REF_TOKEN (t
), hstate
, flags
);
3810 inchash::add_expr (OBJ_TYPE_REF_OBJECT (t
), hstate
, flags
);
3816 /* Don't hash the type, that can lead to having nodes which
3817 compare equal according to operand_equal_p, but which
3818 have different hash codes. */
3819 if (code
== NON_LVALUE_EXPR
)
3821 /* Make sure to include signness in the hash computation. */
3822 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
3823 hash_operand (TREE_OPERAND (t
, 0), hstate
, flags
);
3826 else if (commutative_tree_code (code
))
3828 /* It's a commutative expression. We want to hash it the same
3829 however it appears. We do this by first hashing both operands
3830 and then rehashing based on the order of their independent
3832 inchash::hash one
, two
;
3833 hash_operand (TREE_OPERAND (t
, 0), one
, flags
);
3834 hash_operand (TREE_OPERAND (t
, 1), two
, flags
);
3835 hstate
.add_commutative (one
, two
);
3838 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
3839 hash_operand (TREE_OPERAND (t
, i
), hstate
,
3840 i
== 0 ? flags
: sflags
);
3847 operand_compare::verify_hash_value (const_tree arg0
, const_tree arg1
,
3848 unsigned int flags
, bool *ret
)
3850 /* When checking, verify at the outermost operand_equal_p call that
3851 if operand_equal_p returns non-zero then ARG0 and ARG1 has the same
3853 if (flag_checking
&& !(flags
& OEP_NO_HASH_CHECK
))
3855 if (operand_equal_p (arg0
, arg1
, flags
| OEP_NO_HASH_CHECK
))
3859 inchash::hash
hstate0 (0), hstate1 (0);
3860 hash_operand (arg0
, hstate0
, flags
| OEP_HASH_CHECK
);
3861 hash_operand (arg1
, hstate1
, flags
| OEP_HASH_CHECK
);
3862 hashval_t h0
= hstate0
.end ();
3863 hashval_t h1
= hstate1
.end ();
3864 gcc_assert (h0
== h1
);
3878 static operand_compare default_compare_instance
;
3880 /* Conveinece wrapper around operand_compare class because usually we do
3881 not need to play with the valueizer. */
3884 operand_equal_p (const_tree arg0
, const_tree arg1
, unsigned int flags
)
3886 return default_compare_instance
.operand_equal_p (arg0
, arg1
, flags
);
3892 /* Generate a hash value for an expression. This can be used iteratively
3893 by passing a previous result as the HSTATE argument.
3895 This function is intended to produce the same hash for expressions which
3896 would compare equal using operand_equal_p. */
3898 add_expr (const_tree t
, inchash::hash
&hstate
, unsigned int flags
)
3900 default_compare_instance
.hash_operand (t
, hstate
, flags
);
3905 /* Similar to operand_equal_p, but see if ARG0 might be a variant of ARG1
3906 with a different signedness or a narrower precision. */
3909 operand_equal_for_comparison_p (tree arg0
, tree arg1
)
3911 if (operand_equal_p (arg0
, arg1
, 0))
3914 if (! INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
3915 || ! INTEGRAL_TYPE_P (TREE_TYPE (arg1
)))
3918 /* Discard any conversions that don't change the modes of ARG0 and ARG1
3919 and see if the inner values are the same. This removes any
3920 signedness comparison, which doesn't matter here. */
3925 if (operand_equal_p (op0
, op1
, 0))
3928 /* Discard a single widening conversion from ARG1 and see if the inner
3929 value is the same as ARG0. */
3930 if (CONVERT_EXPR_P (arg1
)
3931 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
3932 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
3933 < TYPE_PRECISION (TREE_TYPE (arg1
))
3934 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
3940 /* See if ARG is an expression that is either a comparison or is performing
3941 arithmetic on comparisons. The comparisons must only be comparing
3942 two different values, which will be stored in *CVAL1 and *CVAL2; if
3943 they are nonzero it means that some operands have already been found.
3944 No variables may be used anywhere else in the expression except in the
3947 If this is true, return 1. Otherwise, return zero. */
3950 twoval_comparison_p (tree arg
, tree
*cval1
, tree
*cval2
)
3952 enum tree_code code
= TREE_CODE (arg
);
3953 enum tree_code_class tclass
= TREE_CODE_CLASS (code
);
3955 /* We can handle some of the tcc_expression cases here. */
3956 if (tclass
== tcc_expression
&& code
== TRUTH_NOT_EXPR
)
3958 else if (tclass
== tcc_expression
3959 && (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
3960 || code
== COMPOUND_EXPR
))
3961 tclass
= tcc_binary
;
3966 return twoval_comparison_p (TREE_OPERAND (arg
, 0), cval1
, cval2
);
3969 return (twoval_comparison_p (TREE_OPERAND (arg
, 0), cval1
, cval2
)
3970 && twoval_comparison_p (TREE_OPERAND (arg
, 1), cval1
, cval2
));
3975 case tcc_expression
:
3976 if (code
== COND_EXPR
)
3977 return (twoval_comparison_p (TREE_OPERAND (arg
, 0), cval1
, cval2
)
3978 && twoval_comparison_p (TREE_OPERAND (arg
, 1), cval1
, cval2
)
3979 && twoval_comparison_p (TREE_OPERAND (arg
, 2), cval1
, cval2
));
3982 case tcc_comparison
:
3983 /* First see if we can handle the first operand, then the second. For
3984 the second operand, we know *CVAL1 can't be zero. It must be that
3985 one side of the comparison is each of the values; test for the
3986 case where this isn't true by failing if the two operands
3989 if (operand_equal_p (TREE_OPERAND (arg
, 0),
3990 TREE_OPERAND (arg
, 1), 0))
3994 *cval1
= TREE_OPERAND (arg
, 0);
3995 else if (operand_equal_p (*cval1
, TREE_OPERAND (arg
, 0), 0))
3997 else if (*cval2
== 0)
3998 *cval2
= TREE_OPERAND (arg
, 0);
3999 else if (operand_equal_p (*cval2
, TREE_OPERAND (arg
, 0), 0))
4004 if (operand_equal_p (*cval1
, TREE_OPERAND (arg
, 1), 0))
4006 else if (*cval2
== 0)
4007 *cval2
= TREE_OPERAND (arg
, 1);
4008 else if (operand_equal_p (*cval2
, TREE_OPERAND (arg
, 1), 0))
4020 /* ARG is a tree that is known to contain just arithmetic operations and
4021 comparisons. Evaluate the operations in the tree substituting NEW0 for
4022 any occurrence of OLD0 as an operand of a comparison and likewise for
4026 eval_subst (location_t loc
, tree arg
, tree old0
, tree new0
,
4027 tree old1
, tree new1
)
4029 tree type
= TREE_TYPE (arg
);
4030 enum tree_code code
= TREE_CODE (arg
);
4031 enum tree_code_class tclass
= TREE_CODE_CLASS (code
);
4033 /* We can handle some of the tcc_expression cases here. */
4034 if (tclass
== tcc_expression
&& code
== TRUTH_NOT_EXPR
)
4036 else if (tclass
== tcc_expression
4037 && (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
))
4038 tclass
= tcc_binary
;
4043 return fold_build1_loc (loc
, code
, type
,
4044 eval_subst (loc
, TREE_OPERAND (arg
, 0),
4045 old0
, new0
, old1
, new1
));
4048 return fold_build2_loc (loc
, code
, type
,
4049 eval_subst (loc
, TREE_OPERAND (arg
, 0),
4050 old0
, new0
, old1
, new1
),
4051 eval_subst (loc
, TREE_OPERAND (arg
, 1),
4052 old0
, new0
, old1
, new1
));
4054 case tcc_expression
:
4058 return eval_subst (loc
, TREE_OPERAND (arg
, 0), old0
, new0
,
4062 return eval_subst (loc
, TREE_OPERAND (arg
, 1), old0
, new0
,
4066 return fold_build3_loc (loc
, code
, type
,
4067 eval_subst (loc
, TREE_OPERAND (arg
, 0),
4068 old0
, new0
, old1
, new1
),
4069 eval_subst (loc
, TREE_OPERAND (arg
, 1),
4070 old0
, new0
, old1
, new1
),
4071 eval_subst (loc
, TREE_OPERAND (arg
, 2),
4072 old0
, new0
, old1
, new1
));
4076 /* Fall through - ??? */
4078 case tcc_comparison
:
4080 tree arg0
= TREE_OPERAND (arg
, 0);
4081 tree arg1
= TREE_OPERAND (arg
, 1);
4083 /* We need to check both for exact equality and tree equality. The
4084 former will be true if the operand has a side-effect. In that
4085 case, we know the operand occurred exactly once. */
4087 if (arg0
== old0
|| operand_equal_p (arg0
, old0
, 0))
4089 else if (arg0
== old1
|| operand_equal_p (arg0
, old1
, 0))
4092 if (arg1
== old0
|| operand_equal_p (arg1
, old0
, 0))
4094 else if (arg1
== old1
|| operand_equal_p (arg1
, old1
, 0))
4097 return fold_build2_loc (loc
, code
, type
, arg0
, arg1
);
4105 /* Return a tree for the case when the result of an expression is RESULT
4106 converted to TYPE and OMITTED was previously an operand of the expression
4107 but is now not needed (e.g., we folded OMITTED * 0).
4109 If OMITTED has side effects, we must evaluate it. Otherwise, just do
4110 the conversion of RESULT to TYPE. */
4113 omit_one_operand_loc (location_t loc
, tree type
, tree result
, tree omitted
)
4115 tree t
= fold_convert_loc (loc
, type
, result
);
4117 /* If the resulting operand is an empty statement, just return the omitted
4118 statement casted to void. */
4119 if (IS_EMPTY_STMT (t
) && TREE_SIDE_EFFECTS (omitted
))
4120 return build1_loc (loc
, NOP_EXPR
, void_type_node
,
4121 fold_ignored_result (omitted
));
4123 if (TREE_SIDE_EFFECTS (omitted
))
4124 return build2_loc (loc
, COMPOUND_EXPR
, type
,
4125 fold_ignored_result (omitted
), t
);
4127 return non_lvalue_loc (loc
, t
);
4130 /* Return a tree for the case when the result of an expression is RESULT
4131 converted to TYPE and OMITTED1 and OMITTED2 were previously operands
4132 of the expression but are now not needed.
4134 If OMITTED1 or OMITTED2 has side effects, they must be evaluated.
4135 If both OMITTED1 and OMITTED2 have side effects, OMITTED1 is
4136 evaluated before OMITTED2. Otherwise, if neither has side effects,
4137 just do the conversion of RESULT to TYPE. */
4140 omit_two_operands_loc (location_t loc
, tree type
, tree result
,
4141 tree omitted1
, tree omitted2
)
4143 tree t
= fold_convert_loc (loc
, type
, result
);
4145 if (TREE_SIDE_EFFECTS (omitted2
))
4146 t
= build2_loc (loc
, COMPOUND_EXPR
, type
, omitted2
, t
);
4147 if (TREE_SIDE_EFFECTS (omitted1
))
4148 t
= build2_loc (loc
, COMPOUND_EXPR
, type
, omitted1
, t
);
4150 return TREE_CODE (t
) != COMPOUND_EXPR
? non_lvalue_loc (loc
, t
) : t
;
4154 /* Return a simplified tree node for the truth-negation of ARG. This
4155 never alters ARG itself. We assume that ARG is an operation that
4156 returns a truth value (0 or 1).
4158 FIXME: one would think we would fold the result, but it causes
4159 problems with the dominator optimizer. */
4162 fold_truth_not_expr (location_t loc
, tree arg
)
4164 tree type
= TREE_TYPE (arg
);
4165 enum tree_code code
= TREE_CODE (arg
);
4166 location_t loc1
, loc2
;
4168 /* If this is a comparison, we can simply invert it, except for
4169 floating-point non-equality comparisons, in which case we just
4170 enclose a TRUTH_NOT_EXPR around what we have. */
4172 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
4174 tree op_type
= TREE_TYPE (TREE_OPERAND (arg
, 0));
4175 if (FLOAT_TYPE_P (op_type
)
4176 && flag_trapping_math
4177 && code
!= ORDERED_EXPR
&& code
!= UNORDERED_EXPR
4178 && code
!= NE_EXPR
&& code
!= EQ_EXPR
)
4181 code
= invert_tree_comparison (code
, HONOR_NANS (op_type
));
4182 if (code
== ERROR_MARK
)
4185 tree ret
= build2_loc (loc
, code
, type
, TREE_OPERAND (arg
, 0),
4186 TREE_OPERAND (arg
, 1));
4187 if (TREE_NO_WARNING (arg
))
4188 TREE_NO_WARNING (ret
) = 1;
4195 return constant_boolean_node (integer_zerop (arg
), type
);
4197 case TRUTH_AND_EXPR
:
4198 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
4199 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
4200 return build2_loc (loc
, TRUTH_OR_EXPR
, type
,
4201 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
4202 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
4205 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
4206 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
4207 return build2_loc (loc
, TRUTH_AND_EXPR
, type
,
4208 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
4209 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
4211 case TRUTH_XOR_EXPR
:
4212 /* Here we can invert either operand. We invert the first operand
4213 unless the second operand is a TRUTH_NOT_EXPR in which case our
4214 result is the XOR of the first operand with the inside of the
4215 negation of the second operand. */
4217 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == TRUTH_NOT_EXPR
)
4218 return build2_loc (loc
, TRUTH_XOR_EXPR
, type
, TREE_OPERAND (arg
, 0),
4219 TREE_OPERAND (TREE_OPERAND (arg
, 1), 0));
4221 return build2_loc (loc
, TRUTH_XOR_EXPR
, type
,
4222 invert_truthvalue_loc (loc
, TREE_OPERAND (arg
, 0)),
4223 TREE_OPERAND (arg
, 1));
4225 case TRUTH_ANDIF_EXPR
:
4226 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
4227 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
4228 return build2_loc (loc
, TRUTH_ORIF_EXPR
, type
,
4229 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
4230 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
4232 case TRUTH_ORIF_EXPR
:
4233 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
4234 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
4235 return build2_loc (loc
, TRUTH_ANDIF_EXPR
, type
,
4236 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
4237 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
4239 case TRUTH_NOT_EXPR
:
4240 return TREE_OPERAND (arg
, 0);
4244 tree arg1
= TREE_OPERAND (arg
, 1);
4245 tree arg2
= TREE_OPERAND (arg
, 2);
4247 loc1
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
4248 loc2
= expr_location_or (TREE_OPERAND (arg
, 2), loc
);
4250 /* A COND_EXPR may have a throw as one operand, which
4251 then has void type. Just leave void operands
4253 return build3_loc (loc
, COND_EXPR
, type
, TREE_OPERAND (arg
, 0),
4254 VOID_TYPE_P (TREE_TYPE (arg1
))
4255 ? arg1
: invert_truthvalue_loc (loc1
, arg1
),
4256 VOID_TYPE_P (TREE_TYPE (arg2
))
4257 ? arg2
: invert_truthvalue_loc (loc2
, arg2
));
4261 loc1
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
4262 return build2_loc (loc
, COMPOUND_EXPR
, type
,
4263 TREE_OPERAND (arg
, 0),
4264 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 1)));
4266 case NON_LVALUE_EXPR
:
4267 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
4268 return invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0));
4271 if (TREE_CODE (TREE_TYPE (arg
)) == BOOLEAN_TYPE
)
4272 return build1_loc (loc
, TRUTH_NOT_EXPR
, type
, arg
);
4277 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
4278 return build1_loc (loc
, TREE_CODE (arg
), type
,
4279 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)));
4282 if (!integer_onep (TREE_OPERAND (arg
, 1)))
4284 return build2_loc (loc
, EQ_EXPR
, type
, arg
, build_int_cst (type
, 0));
4287 return build1_loc (loc
, TRUTH_NOT_EXPR
, type
, arg
);
4289 case CLEANUP_POINT_EXPR
:
4290 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
4291 return build1_loc (loc
, CLEANUP_POINT_EXPR
, type
,
4292 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)));
4299 /* Fold the truth-negation of ARG. This never alters ARG itself. We
4300 assume that ARG is an operation that returns a truth value (0 or 1
4301 for scalars, 0 or -1 for vectors). Return the folded expression if
4302 folding is successful. Otherwise, return NULL_TREE. */
4305 fold_invert_truthvalue (location_t loc
, tree arg
)
4307 tree type
= TREE_TYPE (arg
);
4308 return fold_unary_loc (loc
, VECTOR_TYPE_P (type
)
4314 /* Return a simplified tree node for the truth-negation of ARG. This
4315 never alters ARG itself. We assume that ARG is an operation that
4316 returns a truth value (0 or 1 for scalars, 0 or -1 for vectors). */
4319 invert_truthvalue_loc (location_t loc
, tree arg
)
4321 if (TREE_CODE (arg
) == ERROR_MARK
)
4324 tree type
= TREE_TYPE (arg
);
4325 return fold_build1_loc (loc
, VECTOR_TYPE_P (type
)
4331 /* Return a BIT_FIELD_REF of type TYPE to refer to BITSIZE bits of INNER
4332 starting at BITPOS. The field is unsigned if UNSIGNEDP is nonzero
4333 and uses reverse storage order if REVERSEP is nonzero. ORIG_INNER
4334 is the original memory reference used to preserve the alias set of
4338 make_bit_field_ref (location_t loc
, tree inner
, tree orig_inner
, tree type
,
4339 HOST_WIDE_INT bitsize
, poly_int64 bitpos
,
4340 int unsignedp
, int reversep
)
4342 tree result
, bftype
;
4344 /* Attempt not to lose the access path if possible. */
4345 if (TREE_CODE (orig_inner
) == COMPONENT_REF
)
4347 tree ninner
= TREE_OPERAND (orig_inner
, 0);
4349 poly_int64 nbitsize
, nbitpos
;
4351 int nunsignedp
, nreversep
, nvolatilep
= 0;
4352 tree base
= get_inner_reference (ninner
, &nbitsize
, &nbitpos
,
4353 &noffset
, &nmode
, &nunsignedp
,
4354 &nreversep
, &nvolatilep
);
4356 && noffset
== NULL_TREE
4357 && known_subrange_p (bitpos
, bitsize
, nbitpos
, nbitsize
)
4367 alias_set_type iset
= get_alias_set (orig_inner
);
4368 if (iset
== 0 && get_alias_set (inner
) != iset
)
4369 inner
= fold_build2 (MEM_REF
, TREE_TYPE (inner
),
4370 build_fold_addr_expr (inner
),
4371 build_int_cst (ptr_type_node
, 0));
4373 if (known_eq (bitpos
, 0) && !reversep
)
4375 tree size
= TYPE_SIZE (TREE_TYPE (inner
));
4376 if ((INTEGRAL_TYPE_P (TREE_TYPE (inner
))
4377 || POINTER_TYPE_P (TREE_TYPE (inner
)))
4378 && tree_fits_shwi_p (size
)
4379 && tree_to_shwi (size
) == bitsize
)
4380 return fold_convert_loc (loc
, type
, inner
);
4384 if (TYPE_PRECISION (bftype
) != bitsize
4385 || TYPE_UNSIGNED (bftype
) == !unsignedp
)
4386 bftype
= build_nonstandard_integer_type (bitsize
, 0);
4388 result
= build3_loc (loc
, BIT_FIELD_REF
, bftype
, inner
,
4389 bitsize_int (bitsize
), bitsize_int (bitpos
));
4390 REF_REVERSE_STORAGE_ORDER (result
) = reversep
;
4393 result
= fold_convert_loc (loc
, type
, result
);
4398 /* Optimize a bit-field compare.
4400 There are two cases: First is a compare against a constant and the
4401 second is a comparison of two items where the fields are at the same
4402 bit position relative to the start of a chunk (byte, halfword, word)
4403 large enough to contain it. In these cases we can avoid the shift
4404 implicit in bitfield extractions.
4406 For constants, we emit a compare of the shifted constant with the
4407 BIT_AND_EXPR of a mask and a byte, halfword, or word of the operand being
4408 compared. For two fields at the same position, we do the ANDs with the
4409 similar mask and compare the result of the ANDs.
4411 CODE is the comparison code, known to be either NE_EXPR or EQ_EXPR.
4412 COMPARE_TYPE is the type of the comparison, and LHS and RHS
4413 are the left and right operands of the comparison, respectively.
4415 If the optimization described above can be done, we return the resulting
4416 tree. Otherwise we return zero. */
4419 optimize_bit_field_compare (location_t loc
, enum tree_code code
,
4420 tree compare_type
, tree lhs
, tree rhs
)
4422 poly_int64 plbitpos
, plbitsize
, rbitpos
, rbitsize
;
4423 HOST_WIDE_INT lbitpos
, lbitsize
, nbitpos
, nbitsize
;
4424 tree type
= TREE_TYPE (lhs
);
4426 int const_p
= TREE_CODE (rhs
) == INTEGER_CST
;
4427 machine_mode lmode
, rmode
;
4428 scalar_int_mode nmode
;
4429 int lunsignedp
, runsignedp
;
4430 int lreversep
, rreversep
;
4431 int lvolatilep
= 0, rvolatilep
= 0;
4432 tree linner
, rinner
= NULL_TREE
;
4436 /* Get all the information about the extractions being done. If the bit size
4437 is the same as the size of the underlying object, we aren't doing an
4438 extraction at all and so can do nothing. We also don't want to
4439 do anything if the inner expression is a PLACEHOLDER_EXPR since we
4440 then will no longer be able to replace it. */
4441 linner
= get_inner_reference (lhs
, &plbitsize
, &plbitpos
, &offset
, &lmode
,
4442 &lunsignedp
, &lreversep
, &lvolatilep
);
4444 || !known_size_p (plbitsize
)
4445 || !plbitsize
.is_constant (&lbitsize
)
4446 || !plbitpos
.is_constant (&lbitpos
)
4447 || known_eq (lbitsize
, GET_MODE_BITSIZE (lmode
))
4449 || TREE_CODE (linner
) == PLACEHOLDER_EXPR
4454 rreversep
= lreversep
;
4457 /* If this is not a constant, we can only do something if bit positions,
4458 sizes, signedness and storage order are the same. */
4460 = get_inner_reference (rhs
, &rbitsize
, &rbitpos
, &offset
, &rmode
,
4461 &runsignedp
, &rreversep
, &rvolatilep
);
4464 || maybe_ne (lbitpos
, rbitpos
)
4465 || maybe_ne (lbitsize
, rbitsize
)
4466 || lunsignedp
!= runsignedp
4467 || lreversep
!= rreversep
4469 || TREE_CODE (rinner
) == PLACEHOLDER_EXPR
4474 /* Honor the C++ memory model and mimic what RTL expansion does. */
4475 poly_uint64 bitstart
= 0;
4476 poly_uint64 bitend
= 0;
4477 if (TREE_CODE (lhs
) == COMPONENT_REF
)
4479 get_bit_range (&bitstart
, &bitend
, lhs
, &plbitpos
, &offset
);
4480 if (!plbitpos
.is_constant (&lbitpos
) || offset
!= NULL_TREE
)
4484 /* See if we can find a mode to refer to this field. We should be able to,
4485 but fail if we can't. */
4486 if (!get_best_mode (lbitsize
, lbitpos
, bitstart
, bitend
,
4487 const_p
? TYPE_ALIGN (TREE_TYPE (linner
))
4488 : MIN (TYPE_ALIGN (TREE_TYPE (linner
)),
4489 TYPE_ALIGN (TREE_TYPE (rinner
))),
4490 BITS_PER_WORD
, false, &nmode
))
4493 /* Set signed and unsigned types of the precision of this mode for the
4495 unsigned_type
= lang_hooks
.types
.type_for_mode (nmode
, 1);
4497 /* Compute the bit position and size for the new reference and our offset
4498 within it. If the new reference is the same size as the original, we
4499 won't optimize anything, so return zero. */
4500 nbitsize
= GET_MODE_BITSIZE (nmode
);
4501 nbitpos
= lbitpos
& ~ (nbitsize
- 1);
4503 if (nbitsize
== lbitsize
)
4506 if (lreversep
? !BYTES_BIG_ENDIAN
: BYTES_BIG_ENDIAN
)
4507 lbitpos
= nbitsize
- lbitsize
- lbitpos
;
4509 /* Make the mask to be used against the extracted field. */
4510 mask
= build_int_cst_type (unsigned_type
, -1);
4511 mask
= const_binop (LSHIFT_EXPR
, mask
, size_int (nbitsize
- lbitsize
));
4512 mask
= const_binop (RSHIFT_EXPR
, mask
,
4513 size_int (nbitsize
- lbitsize
- lbitpos
));
4520 /* If not comparing with constant, just rework the comparison
4522 tree t1
= make_bit_field_ref (loc
, linner
, lhs
, unsigned_type
,
4523 nbitsize
, nbitpos
, 1, lreversep
);
4524 t1
= fold_build2_loc (loc
, BIT_AND_EXPR
, unsigned_type
, t1
, mask
);
4525 tree t2
= make_bit_field_ref (loc
, rinner
, rhs
, unsigned_type
,
4526 nbitsize
, nbitpos
, 1, rreversep
);
4527 t2
= fold_build2_loc (loc
, BIT_AND_EXPR
, unsigned_type
, t2
, mask
);
4528 return fold_build2_loc (loc
, code
, compare_type
, t1
, t2
);
4531 /* Otherwise, we are handling the constant case. See if the constant is too
4532 big for the field. Warn and return a tree for 0 (false) if so. We do
4533 this not only for its own sake, but to avoid having to test for this
4534 error case below. If we didn't, we might generate wrong code.
4536 For unsigned fields, the constant shifted right by the field length should
4537 be all zero. For signed fields, the high-order bits should agree with
4542 if (wi::lrshift (wi::to_wide (rhs
), lbitsize
) != 0)
4544 warning (0, "comparison is always %d due to width of bit-field",
4546 return constant_boolean_node (code
== NE_EXPR
, compare_type
);
4551 wide_int tem
= wi::arshift (wi::to_wide (rhs
), lbitsize
- 1);
4552 if (tem
!= 0 && tem
!= -1)
4554 warning (0, "comparison is always %d due to width of bit-field",
4556 return constant_boolean_node (code
== NE_EXPR
, compare_type
);
4563 /* Single-bit compares should always be against zero. */
4564 if (lbitsize
== 1 && ! integer_zerop (rhs
))
4566 code
= code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
;
4567 rhs
= build_int_cst (type
, 0);
4570 /* Make a new bitfield reference, shift the constant over the
4571 appropriate number of bits and mask it with the computed mask
4572 (in case this was a signed field). If we changed it, make a new one. */
4573 lhs
= make_bit_field_ref (loc
, linner
, lhs
, unsigned_type
,
4574 nbitsize
, nbitpos
, 1, lreversep
);
4576 rhs
= const_binop (BIT_AND_EXPR
,
4577 const_binop (LSHIFT_EXPR
,
4578 fold_convert_loc (loc
, unsigned_type
, rhs
),
4579 size_int (lbitpos
)),
4582 lhs
= build2_loc (loc
, code
, compare_type
,
4583 build2 (BIT_AND_EXPR
, unsigned_type
, lhs
, mask
), rhs
);
4587 /* Subroutine for fold_truth_andor_1: decode a field reference.
4589 If EXP is a comparison reference, we return the innermost reference.
4591 *PBITSIZE is set to the number of bits in the reference, *PBITPOS is
4592 set to the starting bit number.
4594 If the innermost field can be completely contained in a mode-sized
4595 unit, *PMODE is set to that mode. Otherwise, it is set to VOIDmode.
4597 *PVOLATILEP is set to 1 if the any expression encountered is volatile;
4598 otherwise it is not changed.
4600 *PUNSIGNEDP is set to the signedness of the field.
4602 *PREVERSEP is set to the storage order of the field.
4604 *PMASK is set to the mask used. This is either contained in a
4605 BIT_AND_EXPR or derived from the width of the field.
4607 *PAND_MASK is set to the mask found in a BIT_AND_EXPR, if any.
4609 Return 0 if this is not a component reference or is one that we can't
4610 do anything with. */
4613 decode_field_reference (location_t loc
, tree
*exp_
, HOST_WIDE_INT
*pbitsize
,
4614 HOST_WIDE_INT
*pbitpos
, machine_mode
*pmode
,
4615 int *punsignedp
, int *preversep
, int *pvolatilep
,
4616 tree
*pmask
, tree
*pand_mask
)
4619 tree outer_type
= 0;
4621 tree mask
, inner
, offset
;
4623 unsigned int precision
;
4625 /* All the optimizations using this function assume integer fields.
4626 There are problems with FP fields since the type_for_size call
4627 below can fail for, e.g., XFmode. */
4628 if (! INTEGRAL_TYPE_P (TREE_TYPE (exp
)))
4631 /* We are interested in the bare arrangement of bits, so strip everything
4632 that doesn't affect the machine mode. However, record the type of the
4633 outermost expression if it may matter below. */
4634 if (CONVERT_EXPR_P (exp
)
4635 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4636 outer_type
= TREE_TYPE (exp
);
4639 if (TREE_CODE (exp
) == BIT_AND_EXPR
)
4641 and_mask
= TREE_OPERAND (exp
, 1);
4642 exp
= TREE_OPERAND (exp
, 0);
4643 STRIP_NOPS (exp
); STRIP_NOPS (and_mask
);
4644 if (TREE_CODE (and_mask
) != INTEGER_CST
)
4648 poly_int64 poly_bitsize
, poly_bitpos
;
4649 inner
= get_inner_reference (exp
, &poly_bitsize
, &poly_bitpos
, &offset
,
4650 pmode
, punsignedp
, preversep
, pvolatilep
);
4651 if ((inner
== exp
&& and_mask
== 0)
4652 || !poly_bitsize
.is_constant (pbitsize
)
4653 || !poly_bitpos
.is_constant (pbitpos
)
4656 || TREE_CODE (inner
) == PLACEHOLDER_EXPR
4657 /* Reject out-of-bound accesses (PR79731). */
4658 || (! AGGREGATE_TYPE_P (TREE_TYPE (inner
))
4659 && compare_tree_int (TYPE_SIZE (TREE_TYPE (inner
)),
4660 *pbitpos
+ *pbitsize
) < 0))
4663 unsigned_type
= lang_hooks
.types
.type_for_size (*pbitsize
, 1);
4664 if (unsigned_type
== NULL_TREE
)
4669 /* If the number of bits in the reference is the same as the bitsize of
4670 the outer type, then the outer type gives the signedness. Otherwise
4671 (in case of a small bitfield) the signedness is unchanged. */
4672 if (outer_type
&& *pbitsize
== TYPE_PRECISION (outer_type
))
4673 *punsignedp
= TYPE_UNSIGNED (outer_type
);
4675 /* Compute the mask to access the bitfield. */
4676 precision
= TYPE_PRECISION (unsigned_type
);
4678 mask
= build_int_cst_type (unsigned_type
, -1);
4680 mask
= const_binop (LSHIFT_EXPR
, mask
, size_int (precision
- *pbitsize
));
4681 mask
= const_binop (RSHIFT_EXPR
, mask
, size_int (precision
- *pbitsize
));
4683 /* Merge it with the mask we found in the BIT_AND_EXPR, if any. */
4685 mask
= fold_build2_loc (loc
, BIT_AND_EXPR
, unsigned_type
,
4686 fold_convert_loc (loc
, unsigned_type
, and_mask
), mask
);
4689 *pand_mask
= and_mask
;
4693 /* Return nonzero if MASK represents a mask of SIZE ones in the low-order
4694 bit positions and MASK is SIGNED. */
4697 all_ones_mask_p (const_tree mask
, unsigned int size
)
4699 tree type
= TREE_TYPE (mask
);
4700 unsigned int precision
= TYPE_PRECISION (type
);
4702 /* If this function returns true when the type of the mask is
4703 UNSIGNED, then there will be errors. In particular see
4704 gcc.c-torture/execute/990326-1.c. There does not appear to be
4705 any documentation paper trail as to why this is so. But the pre
4706 wide-int worked with that restriction and it has been preserved
4708 if (size
> precision
|| TYPE_SIGN (type
) == UNSIGNED
)
4711 return wi::mask (size
, false, precision
) == wi::to_wide (mask
);
4714 /* Subroutine for fold: determine if VAL is the INTEGER_CONST that
4715 represents the sign bit of EXP's type. If EXP represents a sign
4716 or zero extension, also test VAL against the unextended type.
4717 The return value is the (sub)expression whose sign bit is VAL,
4718 or NULL_TREE otherwise. */
4721 sign_bit_p (tree exp
, const_tree val
)
4726 /* Tree EXP must have an integral type. */
4727 t
= TREE_TYPE (exp
);
4728 if (! INTEGRAL_TYPE_P (t
))
4731 /* Tree VAL must be an integer constant. */
4732 if (TREE_CODE (val
) != INTEGER_CST
4733 || TREE_OVERFLOW (val
))
4736 width
= TYPE_PRECISION (t
);
4737 if (wi::only_sign_bit_p (wi::to_wide (val
), width
))
4740 /* Handle extension from a narrower type. */
4741 if (TREE_CODE (exp
) == NOP_EXPR
4742 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp
, 0))) < width
)
4743 return sign_bit_p (TREE_OPERAND (exp
, 0), val
);
4748 /* Subroutine for fold_truth_andor_1: determine if an operand is simple enough
4749 to be evaluated unconditionally. */
4752 simple_operand_p (const_tree exp
)
4754 /* Strip any conversions that don't change the machine mode. */
4757 return (CONSTANT_CLASS_P (exp
)
4758 || TREE_CODE (exp
) == SSA_NAME
4760 && ! TREE_ADDRESSABLE (exp
)
4761 && ! TREE_THIS_VOLATILE (exp
)
4762 && ! DECL_NONLOCAL (exp
)
4763 /* Don't regard global variables as simple. They may be
4764 allocated in ways unknown to the compiler (shared memory,
4765 #pragma weak, etc). */
4766 && ! TREE_PUBLIC (exp
)
4767 && ! DECL_EXTERNAL (exp
)
4768 /* Weakrefs are not safe to be read, since they can be NULL.
4769 They are !TREE_PUBLIC && !DECL_EXTERNAL but still
4770 have DECL_WEAK flag set. */
4771 && (! VAR_OR_FUNCTION_DECL_P (exp
) || ! DECL_WEAK (exp
))
4772 /* Loading a static variable is unduly expensive, but global
4773 registers aren't expensive. */
4774 && (! TREE_STATIC (exp
) || DECL_REGISTER (exp
))));
4777 /* Subroutine for fold_truth_andor: determine if an operand is simple enough
4778 to be evaluated unconditionally.
4779 I addition to simple_operand_p, we assume that comparisons, conversions,
4780 and logic-not operations are simple, if their operands are simple, too. */
4783 simple_operand_p_2 (tree exp
)
4785 enum tree_code code
;
4787 if (TREE_SIDE_EFFECTS (exp
) || generic_expr_could_trap_p (exp
))
4790 while (CONVERT_EXPR_P (exp
))
4791 exp
= TREE_OPERAND (exp
, 0);
4793 code
= TREE_CODE (exp
);
4795 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
4796 return (simple_operand_p (TREE_OPERAND (exp
, 0))
4797 && simple_operand_p (TREE_OPERAND (exp
, 1)));
4799 if (code
== TRUTH_NOT_EXPR
)
4800 return simple_operand_p_2 (TREE_OPERAND (exp
, 0));
4802 return simple_operand_p (exp
);
4806 /* The following functions are subroutines to fold_range_test and allow it to
4807 try to change a logical combination of comparisons into a range test.
4810 X == 2 || X == 3 || X == 4 || X == 5
4814 (unsigned) (X - 2) <= 3
4816 We describe each set of comparisons as being either inside or outside
4817 a range, using a variable named like IN_P, and then describe the
4818 range with a lower and upper bound. If one of the bounds is omitted,
4819 it represents either the highest or lowest value of the type.
4821 In the comments below, we represent a range by two numbers in brackets
4822 preceded by a "+" to designate being inside that range, or a "-" to
4823 designate being outside that range, so the condition can be inverted by
4824 flipping the prefix. An omitted bound is represented by a "-". For
4825 example, "- [-, 10]" means being outside the range starting at the lowest
4826 possible value and ending at 10, in other words, being greater than 10.
4827 The range "+ [-, -]" is always true and hence the range "- [-, -]" is
4830 We set up things so that the missing bounds are handled in a consistent
4831 manner so neither a missing bound nor "true" and "false" need to be
4832 handled using a special case. */
4834 /* Return the result of applying CODE to ARG0 and ARG1, but handle the case
4835 of ARG0 and/or ARG1 being omitted, meaning an unlimited range. UPPER0_P
4836 and UPPER1_P are nonzero if the respective argument is an upper bound
4837 and zero for a lower. TYPE, if nonzero, is the type of the result; it
4838 must be specified for a comparison. ARG1 will be converted to ARG0's
4839 type if both are specified. */
4842 range_binop (enum tree_code code
, tree type
, tree arg0
, int upper0_p
,
4843 tree arg1
, int upper1_p
)
4849 /* If neither arg represents infinity, do the normal operation.
4850 Else, if not a comparison, return infinity. Else handle the special
4851 comparison rules. Note that most of the cases below won't occur, but
4852 are handled for consistency. */
4854 if (arg0
!= 0 && arg1
!= 0)
4856 tem
= fold_build2 (code
, type
!= 0 ? type
: TREE_TYPE (arg0
),
4857 arg0
, fold_convert (TREE_TYPE (arg0
), arg1
));
4859 return TREE_CODE (tem
) == INTEGER_CST
? tem
: 0;
4862 if (TREE_CODE_CLASS (code
) != tcc_comparison
)
4865 /* Set SGN[01] to -1 if ARG[01] is a lower bound, 1 for upper, and 0
4866 for neither. In real maths, we cannot assume open ended ranges are
4867 the same. But, this is computer arithmetic, where numbers are finite.
4868 We can therefore make the transformation of any unbounded range with
4869 the value Z, Z being greater than any representable number. This permits
4870 us to treat unbounded ranges as equal. */
4871 sgn0
= arg0
!= 0 ? 0 : (upper0_p
? 1 : -1);
4872 sgn1
= arg1
!= 0 ? 0 : (upper1_p
? 1 : -1);
4876 result
= sgn0
== sgn1
;
4879 result
= sgn0
!= sgn1
;
4882 result
= sgn0
< sgn1
;
4885 result
= sgn0
<= sgn1
;
4888 result
= sgn0
> sgn1
;
4891 result
= sgn0
>= sgn1
;
4897 return constant_boolean_node (result
, type
);
4900 /* Helper routine for make_range. Perform one step for it, return
4901 new expression if the loop should continue or NULL_TREE if it should
4905 make_range_step (location_t loc
, enum tree_code code
, tree arg0
, tree arg1
,
4906 tree exp_type
, tree
*p_low
, tree
*p_high
, int *p_in_p
,
4907 bool *strict_overflow_p
)
4909 tree arg0_type
= TREE_TYPE (arg0
);
4910 tree n_low
, n_high
, low
= *p_low
, high
= *p_high
;
4911 int in_p
= *p_in_p
, n_in_p
;
4915 case TRUTH_NOT_EXPR
:
4916 /* We can only do something if the range is testing for zero. */
4917 if (low
== NULL_TREE
|| high
== NULL_TREE
4918 || ! integer_zerop (low
) || ! integer_zerop (high
))
4923 case EQ_EXPR
: case NE_EXPR
:
4924 case LT_EXPR
: case LE_EXPR
: case GE_EXPR
: case GT_EXPR
:
4925 /* We can only do something if the range is testing for zero
4926 and if the second operand is an integer constant. Note that
4927 saying something is "in" the range we make is done by
4928 complementing IN_P since it will set in the initial case of
4929 being not equal to zero; "out" is leaving it alone. */
4930 if (low
== NULL_TREE
|| high
== NULL_TREE
4931 || ! integer_zerop (low
) || ! integer_zerop (high
)
4932 || TREE_CODE (arg1
) != INTEGER_CST
)
4937 case NE_EXPR
: /* - [c, c] */
4940 case EQ_EXPR
: /* + [c, c] */
4941 in_p
= ! in_p
, low
= high
= arg1
;
4943 case GT_EXPR
: /* - [-, c] */
4944 low
= 0, high
= arg1
;
4946 case GE_EXPR
: /* + [c, -] */
4947 in_p
= ! in_p
, low
= arg1
, high
= 0;
4949 case LT_EXPR
: /* - [c, -] */
4950 low
= arg1
, high
= 0;
4952 case LE_EXPR
: /* + [-, c] */
4953 in_p
= ! in_p
, low
= 0, high
= arg1
;
4959 /* If this is an unsigned comparison, we also know that EXP is
4960 greater than or equal to zero. We base the range tests we make
4961 on that fact, so we record it here so we can parse existing
4962 range tests. We test arg0_type since often the return type
4963 of, e.g. EQ_EXPR, is boolean. */
4964 if (TYPE_UNSIGNED (arg0_type
) && (low
== 0 || high
== 0))
4966 if (! merge_ranges (&n_in_p
, &n_low
, &n_high
,
4968 build_int_cst (arg0_type
, 0),
4972 in_p
= n_in_p
, low
= n_low
, high
= n_high
;
4974 /* If the high bound is missing, but we have a nonzero low
4975 bound, reverse the range so it goes from zero to the low bound
4977 if (high
== 0 && low
&& ! integer_zerop (low
))
4980 high
= range_binop (MINUS_EXPR
, NULL_TREE
, low
, 0,
4981 build_int_cst (TREE_TYPE (low
), 1), 0);
4982 low
= build_int_cst (arg0_type
, 0);
4992 /* If flag_wrapv and ARG0_TYPE is signed, make sure
4993 low and high are non-NULL, then normalize will DTRT. */
4994 if (!TYPE_UNSIGNED (arg0_type
)
4995 && !TYPE_OVERFLOW_UNDEFINED (arg0_type
))
4997 if (low
== NULL_TREE
)
4998 low
= TYPE_MIN_VALUE (arg0_type
);
4999 if (high
== NULL_TREE
)
5000 high
= TYPE_MAX_VALUE (arg0_type
);
5003 /* (-x) IN [a,b] -> x in [-b, -a] */
5004 n_low
= range_binop (MINUS_EXPR
, exp_type
,
5005 build_int_cst (exp_type
, 0),
5007 n_high
= range_binop (MINUS_EXPR
, exp_type
,
5008 build_int_cst (exp_type
, 0),
5010 if (n_high
!= 0 && TREE_OVERFLOW (n_high
))
5016 return build2_loc (loc
, MINUS_EXPR
, exp_type
, negate_expr (arg0
),
5017 build_int_cst (exp_type
, 1));
5021 if (TREE_CODE (arg1
) != INTEGER_CST
)
5024 /* If flag_wrapv and ARG0_TYPE is signed, then we cannot
5025 move a constant to the other side. */
5026 if (!TYPE_UNSIGNED (arg0_type
)
5027 && !TYPE_OVERFLOW_UNDEFINED (arg0_type
))
5030 /* If EXP is signed, any overflow in the computation is undefined,
5031 so we don't worry about it so long as our computations on
5032 the bounds don't overflow. For unsigned, overflow is defined
5033 and this is exactly the right thing. */
5034 n_low
= range_binop (code
== MINUS_EXPR
? PLUS_EXPR
: MINUS_EXPR
,
5035 arg0_type
, low
, 0, arg1
, 0);
5036 n_high
= range_binop (code
== MINUS_EXPR
? PLUS_EXPR
: MINUS_EXPR
,
5037 arg0_type
, high
, 1, arg1
, 0);
5038 if ((n_low
!= 0 && TREE_OVERFLOW (n_low
))
5039 || (n_high
!= 0 && TREE_OVERFLOW (n_high
)))
5042 if (TYPE_OVERFLOW_UNDEFINED (arg0_type
))
5043 *strict_overflow_p
= true;
5046 /* Check for an unsigned range which has wrapped around the maximum
5047 value thus making n_high < n_low, and normalize it. */
5048 if (n_low
&& n_high
&& tree_int_cst_lt (n_high
, n_low
))
5050 low
= range_binop (PLUS_EXPR
, arg0_type
, n_high
, 0,
5051 build_int_cst (TREE_TYPE (n_high
), 1), 0);
5052 high
= range_binop (MINUS_EXPR
, arg0_type
, n_low
, 0,
5053 build_int_cst (TREE_TYPE (n_low
), 1), 0);
5055 /* If the range is of the form +/- [ x+1, x ], we won't
5056 be able to normalize it. But then, it represents the
5057 whole range or the empty set, so make it
5059 if (tree_int_cst_equal (n_low
, low
)
5060 && tree_int_cst_equal (n_high
, high
))
5066 low
= n_low
, high
= n_high
;
5074 case NON_LVALUE_EXPR
:
5075 if (TYPE_PRECISION (arg0_type
) > TYPE_PRECISION (exp_type
))
5078 if (! INTEGRAL_TYPE_P (arg0_type
)
5079 || (low
!= 0 && ! int_fits_type_p (low
, arg0_type
))
5080 || (high
!= 0 && ! int_fits_type_p (high
, arg0_type
)))
5083 n_low
= low
, n_high
= high
;
5086 n_low
= fold_convert_loc (loc
, arg0_type
, n_low
);
5089 n_high
= fold_convert_loc (loc
, arg0_type
, n_high
);
5091 /* If we're converting arg0 from an unsigned type, to exp,
5092 a signed type, we will be doing the comparison as unsigned.
5093 The tests above have already verified that LOW and HIGH
5096 So we have to ensure that we will handle large unsigned
5097 values the same way that the current signed bounds treat
5100 if (!TYPE_UNSIGNED (exp_type
) && TYPE_UNSIGNED (arg0_type
))
5104 /* For fixed-point modes, we need to pass the saturating flag
5105 as the 2nd parameter. */
5106 if (ALL_FIXED_POINT_MODE_P (TYPE_MODE (arg0_type
)))
5108 = lang_hooks
.types
.type_for_mode (TYPE_MODE (arg0_type
),
5109 TYPE_SATURATING (arg0_type
));
5112 = lang_hooks
.types
.type_for_mode (TYPE_MODE (arg0_type
), 1);
5114 /* A range without an upper bound is, naturally, unbounded.
5115 Since convert would have cropped a very large value, use
5116 the max value for the destination type. */
5118 = TYPE_MAX_VALUE (equiv_type
) ? TYPE_MAX_VALUE (equiv_type
)
5119 : TYPE_MAX_VALUE (arg0_type
);
5121 if (TYPE_PRECISION (exp_type
) == TYPE_PRECISION (arg0_type
))
5122 high_positive
= fold_build2_loc (loc
, RSHIFT_EXPR
, arg0_type
,
5123 fold_convert_loc (loc
, arg0_type
,
5125 build_int_cst (arg0_type
, 1));
5127 /* If the low bound is specified, "and" the range with the
5128 range for which the original unsigned value will be
5132 if (! merge_ranges (&n_in_p
, &n_low
, &n_high
, 1, n_low
, n_high
,
5133 1, fold_convert_loc (loc
, arg0_type
,
5138 in_p
= (n_in_p
== in_p
);
5142 /* Otherwise, "or" the range with the range of the input
5143 that will be interpreted as negative. */
5144 if (! merge_ranges (&n_in_p
, &n_low
, &n_high
, 0, n_low
, n_high
,
5145 1, fold_convert_loc (loc
, arg0_type
,
5150 in_p
= (in_p
!= n_in_p
);
5164 /* Given EXP, a logical expression, set the range it is testing into
5165 variables denoted by PIN_P, PLOW, and PHIGH. Return the expression
5166 actually being tested. *PLOW and *PHIGH will be made of the same
5167 type as the returned expression. If EXP is not a comparison, we
5168 will most likely not be returning a useful value and range. Set
5169 *STRICT_OVERFLOW_P to true if the return value is only valid
5170 because signed overflow is undefined; otherwise, do not change
5171 *STRICT_OVERFLOW_P. */
5174 make_range (tree exp
, int *pin_p
, tree
*plow
, tree
*phigh
,
5175 bool *strict_overflow_p
)
5177 enum tree_code code
;
5178 tree arg0
, arg1
= NULL_TREE
;
5179 tree exp_type
, nexp
;
5182 location_t loc
= EXPR_LOCATION (exp
);
5184 /* Start with simply saying "EXP != 0" and then look at the code of EXP
5185 and see if we can refine the range. Some of the cases below may not
5186 happen, but it doesn't seem worth worrying about this. We "continue"
5187 the outer loop when we've changed something; otherwise we "break"
5188 the switch, which will "break" the while. */
5191 low
= high
= build_int_cst (TREE_TYPE (exp
), 0);
5195 code
= TREE_CODE (exp
);
5196 exp_type
= TREE_TYPE (exp
);
5199 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
5201 if (TREE_OPERAND_LENGTH (exp
) > 0)
5202 arg0
= TREE_OPERAND (exp
, 0);
5203 if (TREE_CODE_CLASS (code
) == tcc_binary
5204 || TREE_CODE_CLASS (code
) == tcc_comparison
5205 || (TREE_CODE_CLASS (code
) == tcc_expression
5206 && TREE_OPERAND_LENGTH (exp
) > 1))
5207 arg1
= TREE_OPERAND (exp
, 1);
5209 if (arg0
== NULL_TREE
)
5212 nexp
= make_range_step (loc
, code
, arg0
, arg1
, exp_type
, &low
,
5213 &high
, &in_p
, strict_overflow_p
);
5214 if (nexp
== NULL_TREE
)
5219 /* If EXP is a constant, we can evaluate whether this is true or false. */
5220 if (TREE_CODE (exp
) == INTEGER_CST
)
5222 in_p
= in_p
== (integer_onep (range_binop (GE_EXPR
, integer_type_node
,
5224 && integer_onep (range_binop (LE_EXPR
, integer_type_node
,
5230 *pin_p
= in_p
, *plow
= low
, *phigh
= high
;
5234 /* Returns TRUE if [LOW, HIGH] range check can be optimized to
5235 a bitwise check i.e. when
5236 LOW == 0xXX...X00...0
5237 HIGH == 0xXX...X11...1
5238 Return corresponding mask in MASK and stem in VALUE. */
5241 maskable_range_p (const_tree low
, const_tree high
, tree type
, tree
*mask
,
5244 if (TREE_CODE (low
) != INTEGER_CST
5245 || TREE_CODE (high
) != INTEGER_CST
)
5248 unsigned prec
= TYPE_PRECISION (type
);
5249 wide_int lo
= wi::to_wide (low
, prec
);
5250 wide_int hi
= wi::to_wide (high
, prec
);
5252 wide_int end_mask
= lo
^ hi
;
5253 if ((end_mask
& (end_mask
+ 1)) != 0
5254 || (lo
& end_mask
) != 0)
5257 wide_int stem_mask
= ~end_mask
;
5258 wide_int stem
= lo
& stem_mask
;
5259 if (stem
!= (hi
& stem_mask
))
5262 *mask
= wide_int_to_tree (type
, stem_mask
);
5263 *value
= wide_int_to_tree (type
, stem
);
5268 /* Helper routine for build_range_check and match.pd. Return the type to
5269 perform the check or NULL if it shouldn't be optimized. */
5272 range_check_type (tree etype
)
5274 /* First make sure that arithmetics in this type is valid, then make sure
5275 that it wraps around. */
5276 if (TREE_CODE (etype
) == ENUMERAL_TYPE
|| TREE_CODE (etype
) == BOOLEAN_TYPE
)
5277 etype
= lang_hooks
.types
.type_for_size (TYPE_PRECISION (etype
), 1);
5279 if (TREE_CODE (etype
) == INTEGER_TYPE
&& !TYPE_UNSIGNED (etype
))
5281 tree utype
, minv
, maxv
;
5283 /* Check if (unsigned) INT_MAX + 1 == (unsigned) INT_MIN
5284 for the type in question, as we rely on this here. */
5285 utype
= unsigned_type_for (etype
);
5286 maxv
= fold_convert (utype
, TYPE_MAX_VALUE (etype
));
5287 maxv
= range_binop (PLUS_EXPR
, NULL_TREE
, maxv
, 1,
5288 build_int_cst (TREE_TYPE (maxv
), 1), 1);
5289 minv
= fold_convert (utype
, TYPE_MIN_VALUE (etype
));
5291 if (integer_zerop (range_binop (NE_EXPR
, integer_type_node
,
5297 else if (POINTER_TYPE_P (etype
))
5298 etype
= unsigned_type_for (etype
);
5302 /* Given a range, LOW, HIGH, and IN_P, an expression, EXP, and a result
5303 type, TYPE, return an expression to test if EXP is in (or out of, depending
5304 on IN_P) the range. Return 0 if the test couldn't be created. */
5307 build_range_check (location_t loc
, tree type
, tree exp
, int in_p
,
5308 tree low
, tree high
)
5310 tree etype
= TREE_TYPE (exp
), mask
, value
;
5312 /* Disable this optimization for function pointer expressions
5313 on targets that require function pointer canonicalization. */
5314 if (targetm
.have_canonicalize_funcptr_for_compare ()
5315 && POINTER_TYPE_P (etype
)
5316 && FUNC_OR_METHOD_TYPE_P (TREE_TYPE (etype
)))
5321 value
= build_range_check (loc
, type
, exp
, 1, low
, high
);
5323 return invert_truthvalue_loc (loc
, value
);
5328 if (low
== 0 && high
== 0)
5329 return omit_one_operand_loc (loc
, type
, build_int_cst (type
, 1), exp
);
5332 return fold_build2_loc (loc
, LE_EXPR
, type
, exp
,
5333 fold_convert_loc (loc
, etype
, high
));
5336 return fold_build2_loc (loc
, GE_EXPR
, type
, exp
,
5337 fold_convert_loc (loc
, etype
, low
));
5339 if (operand_equal_p (low
, high
, 0))
5340 return fold_build2_loc (loc
, EQ_EXPR
, type
, exp
,
5341 fold_convert_loc (loc
, etype
, low
));
5343 if (TREE_CODE (exp
) == BIT_AND_EXPR
5344 && maskable_range_p (low
, high
, etype
, &mask
, &value
))
5345 return fold_build2_loc (loc
, EQ_EXPR
, type
,
5346 fold_build2_loc (loc
, BIT_AND_EXPR
, etype
,
5350 if (integer_zerop (low
))
5352 if (! TYPE_UNSIGNED (etype
))
5354 etype
= unsigned_type_for (etype
);
5355 high
= fold_convert_loc (loc
, etype
, high
);
5356 exp
= fold_convert_loc (loc
, etype
, exp
);
5358 return build_range_check (loc
, type
, exp
, 1, 0, high
);
5361 /* Optimize (c>=1) && (c<=127) into (signed char)c > 0. */
5362 if (integer_onep (low
) && TREE_CODE (high
) == INTEGER_CST
)
5364 int prec
= TYPE_PRECISION (etype
);
5366 if (wi::mask
<widest_int
> (prec
- 1, false) == wi::to_widest (high
))
5368 if (TYPE_UNSIGNED (etype
))
5370 tree signed_etype
= signed_type_for (etype
);
5371 if (TYPE_PRECISION (signed_etype
) != TYPE_PRECISION (etype
))
5373 = build_nonstandard_integer_type (TYPE_PRECISION (etype
), 0);
5375 etype
= signed_etype
;
5376 exp
= fold_convert_loc (loc
, etype
, exp
);
5378 return fold_build2_loc (loc
, GT_EXPR
, type
, exp
,
5379 build_int_cst (etype
, 0));
5383 /* Optimize (c>=low) && (c<=high) into (c-low>=0) && (c-low<=high-low).
5384 This requires wrap-around arithmetics for the type of the expression. */
5385 etype
= range_check_type (etype
);
5386 if (etype
== NULL_TREE
)
5389 high
= fold_convert_loc (loc
, etype
, high
);
5390 low
= fold_convert_loc (loc
, etype
, low
);
5391 exp
= fold_convert_loc (loc
, etype
, exp
);
5393 value
= const_binop (MINUS_EXPR
, high
, low
);
5395 if (value
!= 0 && !TREE_OVERFLOW (value
))
5396 return build_range_check (loc
, type
,
5397 fold_build2_loc (loc
, MINUS_EXPR
, etype
, exp
, low
),
5398 1, build_int_cst (etype
, 0), value
);
5403 /* Return the predecessor of VAL in its type, handling the infinite case. */
5406 range_predecessor (tree val
)
5408 tree type
= TREE_TYPE (val
);
5410 if (INTEGRAL_TYPE_P (type
)
5411 && operand_equal_p (val
, TYPE_MIN_VALUE (type
), 0))
5414 return range_binop (MINUS_EXPR
, NULL_TREE
, val
, 0,
5415 build_int_cst (TREE_TYPE (val
), 1), 0);
5418 /* Return the successor of VAL in its type, handling the infinite case. */
5421 range_successor (tree val
)
5423 tree type
= TREE_TYPE (val
);
5425 if (INTEGRAL_TYPE_P (type
)
5426 && operand_equal_p (val
, TYPE_MAX_VALUE (type
), 0))
5429 return range_binop (PLUS_EXPR
, NULL_TREE
, val
, 0,
5430 build_int_cst (TREE_TYPE (val
), 1), 0);
5433 /* Given two ranges, see if we can merge them into one. Return 1 if we
5434 can, 0 if we can't. Set the output range into the specified parameters. */
5437 merge_ranges (int *pin_p
, tree
*plow
, tree
*phigh
, int in0_p
, tree low0
,
5438 tree high0
, int in1_p
, tree low1
, tree high1
)
5446 int lowequal
= ((low0
== 0 && low1
== 0)
5447 || integer_onep (range_binop (EQ_EXPR
, integer_type_node
,
5448 low0
, 0, low1
, 0)));
5449 int highequal
= ((high0
== 0 && high1
== 0)
5450 || integer_onep (range_binop (EQ_EXPR
, integer_type_node
,
5451 high0
, 1, high1
, 1)));
5453 /* Make range 0 be the range that starts first, or ends last if they
5454 start at the same value. Swap them if it isn't. */
5455 if (integer_onep (range_binop (GT_EXPR
, integer_type_node
,
5458 && integer_onep (range_binop (GT_EXPR
, integer_type_node
,
5459 high1
, 1, high0
, 1))))
5461 temp
= in0_p
, in0_p
= in1_p
, in1_p
= temp
;
5462 tem
= low0
, low0
= low1
, low1
= tem
;
5463 tem
= high0
, high0
= high1
, high1
= tem
;
5466 /* If the second range is != high1 where high1 is the type maximum of
5467 the type, try first merging with < high1 range. */
5470 && TREE_CODE (low1
) == INTEGER_CST
5471 && (TREE_CODE (TREE_TYPE (low1
)) == INTEGER_TYPE
5472 || (TREE_CODE (TREE_TYPE (low1
)) == ENUMERAL_TYPE
5473 && known_eq (TYPE_PRECISION (TREE_TYPE (low1
)),
5474 GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (low1
))))))
5475 && operand_equal_p (low1
, high1
, 0))
5477 if (tree_int_cst_equal (low1
, TYPE_MAX_VALUE (TREE_TYPE (low1
)))
5478 && merge_ranges (pin_p
, plow
, phigh
, in0_p
, low0
, high0
,
5479 !in1_p
, NULL_TREE
, range_predecessor (low1
)))
5481 /* Similarly for the second range != low1 where low1 is the type minimum
5482 of the type, try first merging with > low1 range. */
5483 if (tree_int_cst_equal (low1
, TYPE_MIN_VALUE (TREE_TYPE (low1
)))
5484 && merge_ranges (pin_p
, plow
, phigh
, in0_p
, low0
, high0
,
5485 !in1_p
, range_successor (low1
), NULL_TREE
))
5489 /* Now flag two cases, whether the ranges are disjoint or whether the
5490 second range is totally subsumed in the first. Note that the tests
5491 below are simplified by the ones above. */
5492 no_overlap
= integer_onep (range_binop (LT_EXPR
, integer_type_node
,
5493 high0
, 1, low1
, 0));
5494 subset
= integer_onep (range_binop (LE_EXPR
, integer_type_node
,
5495 high1
, 1, high0
, 1));
5497 /* We now have four cases, depending on whether we are including or
5498 excluding the two ranges. */
5501 /* If they don't overlap, the result is false. If the second range
5502 is a subset it is the result. Otherwise, the range is from the start
5503 of the second to the end of the first. */
5505 in_p
= 0, low
= high
= 0;
5507 in_p
= 1, low
= low1
, high
= high1
;
5509 in_p
= 1, low
= low1
, high
= high0
;
5512 else if (in0_p
&& ! in1_p
)
5514 /* If they don't overlap, the result is the first range. If they are
5515 equal, the result is false. If the second range is a subset of the
5516 first, and the ranges begin at the same place, we go from just after
5517 the end of the second range to the end of the first. If the second
5518 range is not a subset of the first, or if it is a subset and both
5519 ranges end at the same place, the range starts at the start of the
5520 first range and ends just before the second range.
5521 Otherwise, we can't describe this as a single range. */
5523 in_p
= 1, low
= low0
, high
= high0
;
5524 else if (lowequal
&& highequal
)
5525 in_p
= 0, low
= high
= 0;
5526 else if (subset
&& lowequal
)
5528 low
= range_successor (high1
);
5533 /* We are in the weird situation where high0 > high1 but
5534 high1 has no successor. Punt. */
5538 else if (! subset
|| highequal
)
5541 high
= range_predecessor (low1
);
5545 /* low0 < low1 but low1 has no predecessor. Punt. */
5553 else if (! in0_p
&& in1_p
)
5555 /* If they don't overlap, the result is the second range. If the second
5556 is a subset of the first, the result is false. Otherwise,
5557 the range starts just after the first range and ends at the
5558 end of the second. */
5560 in_p
= 1, low
= low1
, high
= high1
;
5561 else if (subset
|| highequal
)
5562 in_p
= 0, low
= high
= 0;
5565 low
= range_successor (high0
);
5570 /* high1 > high0 but high0 has no successor. Punt. */
5578 /* The case where we are excluding both ranges. Here the complex case
5579 is if they don't overlap. In that case, the only time we have a
5580 range is if they are adjacent. If the second is a subset of the
5581 first, the result is the first. Otherwise, the range to exclude
5582 starts at the beginning of the first range and ends at the end of the
5586 if (integer_onep (range_binop (EQ_EXPR
, integer_type_node
,
5587 range_successor (high0
),
5589 in_p
= 0, low
= low0
, high
= high1
;
5592 /* Canonicalize - [min, x] into - [-, x]. */
5593 if (low0
&& TREE_CODE (low0
) == INTEGER_CST
)
5594 switch (TREE_CODE (TREE_TYPE (low0
)))
5597 if (maybe_ne (TYPE_PRECISION (TREE_TYPE (low0
)),
5599 (TYPE_MODE (TREE_TYPE (low0
)))))
5603 if (tree_int_cst_equal (low0
,
5604 TYPE_MIN_VALUE (TREE_TYPE (low0
))))
5608 if (TYPE_UNSIGNED (TREE_TYPE (low0
))
5609 && integer_zerop (low0
))
5616 /* Canonicalize - [x, max] into - [x, -]. */
5617 if (high1
&& TREE_CODE (high1
) == INTEGER_CST
)
5618 switch (TREE_CODE (TREE_TYPE (high1
)))
5621 if (maybe_ne (TYPE_PRECISION (TREE_TYPE (high1
)),
5623 (TYPE_MODE (TREE_TYPE (high1
)))))
5627 if (tree_int_cst_equal (high1
,
5628 TYPE_MAX_VALUE (TREE_TYPE (high1
))))
5632 if (TYPE_UNSIGNED (TREE_TYPE (high1
))
5633 && integer_zerop (range_binop (PLUS_EXPR
, NULL_TREE
,
5635 build_int_cst (TREE_TYPE (high1
), 1),
5643 /* The ranges might be also adjacent between the maximum and
5644 minimum values of the given type. For
5645 - [{min,-}, x] and - [y, {max,-}] ranges where x + 1 < y
5646 return + [x + 1, y - 1]. */
5647 if (low0
== 0 && high1
== 0)
5649 low
= range_successor (high0
);
5650 high
= range_predecessor (low1
);
5651 if (low
== 0 || high
== 0)
5661 in_p
= 0, low
= low0
, high
= high0
;
5663 in_p
= 0, low
= low0
, high
= high1
;
5666 *pin_p
= in_p
, *plow
= low
, *phigh
= high
;
5671 /* Subroutine of fold, looking inside expressions of the form
5672 A op B ? A : C, where ARG0, ARG1 and ARG2 are the three operands
5673 of the COND_EXPR. This function is being used also to optimize
5674 A op B ? C : A, by reversing the comparison first.
5676 Return a folded expression whose code is not a COND_EXPR
5677 anymore, or NULL_TREE if no folding opportunity is found. */
5680 fold_cond_expr_with_comparison (location_t loc
, tree type
,
5681 tree arg0
, tree arg1
, tree arg2
)
5683 enum tree_code comp_code
= TREE_CODE (arg0
);
5684 tree arg00
= TREE_OPERAND (arg0
, 0);
5685 tree arg01
= TREE_OPERAND (arg0
, 1);
5686 tree arg1_type
= TREE_TYPE (arg1
);
5692 /* If we have A op 0 ? A : -A, consider applying the following
5695 A == 0? A : -A same as -A
5696 A != 0? A : -A same as A
5697 A >= 0? A : -A same as abs (A)
5698 A > 0? A : -A same as abs (A)
5699 A <= 0? A : -A same as -abs (A)
5700 A < 0? A : -A same as -abs (A)
5702 None of these transformations work for modes with signed
5703 zeros. If A is +/-0, the first two transformations will
5704 change the sign of the result (from +0 to -0, or vice
5705 versa). The last four will fix the sign of the result,
5706 even though the original expressions could be positive or
5707 negative, depending on the sign of A.
5709 Note that all these transformations are correct if A is
5710 NaN, since the two alternatives (A and -A) are also NaNs. */
5711 if (!HONOR_SIGNED_ZEROS (element_mode (type
))
5712 && (FLOAT_TYPE_P (TREE_TYPE (arg01
))
5713 ? real_zerop (arg01
)
5714 : integer_zerop (arg01
))
5715 && ((TREE_CODE (arg2
) == NEGATE_EXPR
5716 && operand_equal_p (TREE_OPERAND (arg2
, 0), arg1
, 0))
5717 /* In the case that A is of the form X-Y, '-A' (arg2) may
5718 have already been folded to Y-X, check for that. */
5719 || (TREE_CODE (arg1
) == MINUS_EXPR
5720 && TREE_CODE (arg2
) == MINUS_EXPR
5721 && operand_equal_p (TREE_OPERAND (arg1
, 0),
5722 TREE_OPERAND (arg2
, 1), 0)
5723 && operand_equal_p (TREE_OPERAND (arg1
, 1),
5724 TREE_OPERAND (arg2
, 0), 0))))
5729 tem
= fold_convert_loc (loc
, arg1_type
, arg1
);
5730 return fold_convert_loc (loc
, type
, negate_expr (tem
));
5733 return fold_convert_loc (loc
, type
, arg1
);
5736 if (flag_trapping_math
)
5741 if (TYPE_UNSIGNED (TREE_TYPE (arg1
)))
5743 tem
= fold_build1_loc (loc
, ABS_EXPR
, TREE_TYPE (arg1
), arg1
);
5744 return fold_convert_loc (loc
, type
, tem
);
5747 if (flag_trapping_math
)
5752 if (TYPE_UNSIGNED (TREE_TYPE (arg1
)))
5754 tem
= fold_build1_loc (loc
, ABS_EXPR
, TREE_TYPE (arg1
), arg1
);
5755 return negate_expr (fold_convert_loc (loc
, type
, tem
));
5757 gcc_assert (TREE_CODE_CLASS (comp_code
) == tcc_comparison
);
5761 /* A != 0 ? A : 0 is simply A, unless A is -0. Likewise
5762 A == 0 ? A : 0 is always 0 unless A is -0. Note that
5763 both transformations are correct when A is NaN: A != 0
5764 is then true, and A == 0 is false. */
5766 if (!HONOR_SIGNED_ZEROS (element_mode (type
))
5767 && integer_zerop (arg01
) && integer_zerop (arg2
))
5769 if (comp_code
== NE_EXPR
)
5770 return fold_convert_loc (loc
, type
, arg1
);
5771 else if (comp_code
== EQ_EXPR
)
5772 return build_zero_cst (type
);
5775 /* Try some transformations of A op B ? A : B.
5777 A == B? A : B same as B
5778 A != B? A : B same as A
5779 A >= B? A : B same as max (A, B)
5780 A > B? A : B same as max (B, A)
5781 A <= B? A : B same as min (A, B)
5782 A < B? A : B same as min (B, A)
5784 As above, these transformations don't work in the presence
5785 of signed zeros. For example, if A and B are zeros of
5786 opposite sign, the first two transformations will change
5787 the sign of the result. In the last four, the original
5788 expressions give different results for (A=+0, B=-0) and
5789 (A=-0, B=+0), but the transformed expressions do not.
5791 The first two transformations are correct if either A or B
5792 is a NaN. In the first transformation, the condition will
5793 be false, and B will indeed be chosen. In the case of the
5794 second transformation, the condition A != B will be true,
5795 and A will be chosen.
5797 The conversions to max() and min() are not correct if B is
5798 a number and A is not. The conditions in the original
5799 expressions will be false, so all four give B. The min()
5800 and max() versions would give a NaN instead. */
5801 if (!HONOR_SIGNED_ZEROS (element_mode (type
))
5802 && operand_equal_for_comparison_p (arg01
, arg2
)
5803 /* Avoid these transformations if the COND_EXPR may be used
5804 as an lvalue in the C++ front-end. PR c++/19199. */
5806 || VECTOR_TYPE_P (type
)
5807 || (! lang_GNU_CXX ()
5808 && strcmp (lang_hooks
.name
, "GNU Objective-C++") != 0)
5809 || ! maybe_lvalue_p (arg1
)
5810 || ! maybe_lvalue_p (arg2
)))
5812 tree comp_op0
= arg00
;
5813 tree comp_op1
= arg01
;
5814 tree comp_type
= TREE_TYPE (comp_op0
);
5819 return fold_convert_loc (loc
, type
, arg2
);
5821 return fold_convert_loc (loc
, type
, arg1
);
5826 /* In C++ a ?: expression can be an lvalue, so put the
5827 operand which will be used if they are equal first
5828 so that we can convert this back to the
5829 corresponding COND_EXPR. */
5830 if (!HONOR_NANS (arg1
))
5832 comp_op0
= fold_convert_loc (loc
, comp_type
, comp_op0
);
5833 comp_op1
= fold_convert_loc (loc
, comp_type
, comp_op1
);
5834 tem
= (comp_code
== LE_EXPR
|| comp_code
== UNLE_EXPR
)
5835 ? fold_build2_loc (loc
, MIN_EXPR
, comp_type
, comp_op0
, comp_op1
)
5836 : fold_build2_loc (loc
, MIN_EXPR
, comp_type
,
5837 comp_op1
, comp_op0
);
5838 return fold_convert_loc (loc
, type
, tem
);
5845 if (!HONOR_NANS (arg1
))
5847 comp_op0
= fold_convert_loc (loc
, comp_type
, comp_op0
);
5848 comp_op1
= fold_convert_loc (loc
, comp_type
, comp_op1
);
5849 tem
= (comp_code
== GE_EXPR
|| comp_code
== UNGE_EXPR
)
5850 ? fold_build2_loc (loc
, MAX_EXPR
, comp_type
, comp_op0
, comp_op1
)
5851 : fold_build2_loc (loc
, MAX_EXPR
, comp_type
,
5852 comp_op1
, comp_op0
);
5853 return fold_convert_loc (loc
, type
, tem
);
5857 if (!HONOR_NANS (arg1
))
5858 return fold_convert_loc (loc
, type
, arg2
);
5861 if (!HONOR_NANS (arg1
))
5862 return fold_convert_loc (loc
, type
, arg1
);
5865 gcc_assert (TREE_CODE_CLASS (comp_code
) == tcc_comparison
);
5875 #ifndef LOGICAL_OP_NON_SHORT_CIRCUIT
5876 #define LOGICAL_OP_NON_SHORT_CIRCUIT \
5877 (BRANCH_COST (optimize_function_for_speed_p (cfun), \
5881 /* EXP is some logical combination of boolean tests. See if we can
5882 merge it into some range test. Return the new tree if so. */
5885 fold_range_test (location_t loc
, enum tree_code code
, tree type
,
5888 int or_op
= (code
== TRUTH_ORIF_EXPR
5889 || code
== TRUTH_OR_EXPR
);
5890 int in0_p
, in1_p
, in_p
;
5891 tree low0
, low1
, low
, high0
, high1
, high
;
5892 bool strict_overflow_p
= false;
5894 const char * const warnmsg
= G_("assuming signed overflow does not occur "
5895 "when simplifying range test");
5897 if (!INTEGRAL_TYPE_P (type
))
5900 lhs
= make_range (op0
, &in0_p
, &low0
, &high0
, &strict_overflow_p
);
5901 rhs
= make_range (op1
, &in1_p
, &low1
, &high1
, &strict_overflow_p
);
5903 /* If this is an OR operation, invert both sides; we will invert
5904 again at the end. */
5906 in0_p
= ! in0_p
, in1_p
= ! in1_p
;
5908 /* If both expressions are the same, if we can merge the ranges, and we
5909 can build the range test, return it or it inverted. If one of the
5910 ranges is always true or always false, consider it to be the same
5911 expression as the other. */
5912 if ((lhs
== 0 || rhs
== 0 || operand_equal_p (lhs
, rhs
, 0))
5913 && merge_ranges (&in_p
, &low
, &high
, in0_p
, low0
, high0
,
5915 && (tem
= (build_range_check (loc
, type
,
5917 : rhs
!= 0 ? rhs
: integer_zero_node
,
5918 in_p
, low
, high
))) != 0)
5920 if (strict_overflow_p
)
5921 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_COMPARISON
);
5922 return or_op
? invert_truthvalue_loc (loc
, tem
) : tem
;
5925 /* On machines where the branch cost is expensive, if this is a
5926 short-circuited branch and the underlying object on both sides
5927 is the same, make a non-short-circuit operation. */
5928 bool logical_op_non_short_circuit
= LOGICAL_OP_NON_SHORT_CIRCUIT
;
5929 if (PARAM_VALUE (PARAM_LOGICAL_OP_NON_SHORT_CIRCUIT
) != -1)
5930 logical_op_non_short_circuit
5931 = PARAM_VALUE (PARAM_LOGICAL_OP_NON_SHORT_CIRCUIT
);
5932 if (logical_op_non_short_circuit
5933 && !flag_sanitize_coverage
5934 && lhs
!= 0 && rhs
!= 0
5935 && (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
)
5936 && operand_equal_p (lhs
, rhs
, 0))
5938 /* If simple enough, just rewrite. Otherwise, make a SAVE_EXPR
5939 unless we are at top level or LHS contains a PLACEHOLDER_EXPR, in
5940 which cases we can't do this. */
5941 if (simple_operand_p (lhs
))
5942 return build2_loc (loc
, code
== TRUTH_ANDIF_EXPR
5943 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
,
5946 else if (!lang_hooks
.decls
.global_bindings_p ()
5947 && !CONTAINS_PLACEHOLDER_P (lhs
))
5949 tree common
= save_expr (lhs
);
5951 if ((lhs
= build_range_check (loc
, type
, common
,
5952 or_op
? ! in0_p
: in0_p
,
5954 && (rhs
= build_range_check (loc
, type
, common
,
5955 or_op
? ! in1_p
: in1_p
,
5958 if (strict_overflow_p
)
5959 fold_overflow_warning (warnmsg
,
5960 WARN_STRICT_OVERFLOW_COMPARISON
);
5961 return build2_loc (loc
, code
== TRUTH_ANDIF_EXPR
5962 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
,
5971 /* Subroutine for fold_truth_andor_1: C is an INTEGER_CST interpreted as a P
5972 bit value. Arrange things so the extra bits will be set to zero if and
5973 only if C is signed-extended to its full width. If MASK is nonzero,
5974 it is an INTEGER_CST that should be AND'ed with the extra bits. */
5977 unextend (tree c
, int p
, int unsignedp
, tree mask
)
5979 tree type
= TREE_TYPE (c
);
5980 int modesize
= GET_MODE_BITSIZE (SCALAR_INT_TYPE_MODE (type
));
5983 if (p
== modesize
|| unsignedp
)
5986 /* We work by getting just the sign bit into the low-order bit, then
5987 into the high-order bit, then sign-extend. We then XOR that value
5989 temp
= build_int_cst (TREE_TYPE (c
),
5990 wi::extract_uhwi (wi::to_wide (c
), p
- 1, 1));
5992 /* We must use a signed type in order to get an arithmetic right shift.
5993 However, we must also avoid introducing accidental overflows, so that
5994 a subsequent call to integer_zerop will work. Hence we must
5995 do the type conversion here. At this point, the constant is either
5996 zero or one, and the conversion to a signed type can never overflow.
5997 We could get an overflow if this conversion is done anywhere else. */
5998 if (TYPE_UNSIGNED (type
))
5999 temp
= fold_convert (signed_type_for (type
), temp
);
6001 temp
= const_binop (LSHIFT_EXPR
, temp
, size_int (modesize
- 1));
6002 temp
= const_binop (RSHIFT_EXPR
, temp
, size_int (modesize
- p
- 1));
6004 temp
= const_binop (BIT_AND_EXPR
, temp
,
6005 fold_convert (TREE_TYPE (c
), mask
));
6006 /* If necessary, convert the type back to match the type of C. */
6007 if (TYPE_UNSIGNED (type
))
6008 temp
= fold_convert (type
, temp
);
6010 return fold_convert (type
, const_binop (BIT_XOR_EXPR
, c
, temp
));
6013 /* For an expression that has the form
6017 we can drop one of the inner expressions and simplify to
6021 LOC is the location of the resulting expression. OP is the inner
6022 logical operation; the left-hand side in the examples above, while CMPOP
6023 is the right-hand side. RHS_ONLY is used to prevent us from accidentally
6024 removing a condition that guards another, as in
6025 (A != NULL && A->...) || A == NULL
6026 which we must not transform. If RHS_ONLY is true, only eliminate the
6027 right-most operand of the inner logical operation. */
6030 merge_truthop_with_opposite_arm (location_t loc
, tree op
, tree cmpop
,
6033 tree type
= TREE_TYPE (cmpop
);
6034 enum tree_code code
= TREE_CODE (cmpop
);
6035 enum tree_code truthop_code
= TREE_CODE (op
);
6036 tree lhs
= TREE_OPERAND (op
, 0);
6037 tree rhs
= TREE_OPERAND (op
, 1);
6038 tree orig_lhs
= lhs
, orig_rhs
= rhs
;
6039 enum tree_code rhs_code
= TREE_CODE (rhs
);
6040 enum tree_code lhs_code
= TREE_CODE (lhs
);
6041 enum tree_code inv_code
;
6043 if (TREE_SIDE_EFFECTS (op
) || TREE_SIDE_EFFECTS (cmpop
))
6046 if (TREE_CODE_CLASS (code
) != tcc_comparison
)
6049 if (rhs_code
== truthop_code
)
6051 tree newrhs
= merge_truthop_with_opposite_arm (loc
, rhs
, cmpop
, rhs_only
);
6052 if (newrhs
!= NULL_TREE
)
6055 rhs_code
= TREE_CODE (rhs
);
6058 if (lhs_code
== truthop_code
&& !rhs_only
)
6060 tree newlhs
= merge_truthop_with_opposite_arm (loc
, lhs
, cmpop
, false);
6061 if (newlhs
!= NULL_TREE
)
6064 lhs_code
= TREE_CODE (lhs
);
6068 inv_code
= invert_tree_comparison (code
, HONOR_NANS (type
));
6069 if (inv_code
== rhs_code
6070 && operand_equal_p (TREE_OPERAND (rhs
, 0), TREE_OPERAND (cmpop
, 0), 0)
6071 && operand_equal_p (TREE_OPERAND (rhs
, 1), TREE_OPERAND (cmpop
, 1), 0))
6073 if (!rhs_only
&& inv_code
== lhs_code
6074 && operand_equal_p (TREE_OPERAND (lhs
, 0), TREE_OPERAND (cmpop
, 0), 0)
6075 && operand_equal_p (TREE_OPERAND (lhs
, 1), TREE_OPERAND (cmpop
, 1), 0))
6077 if (rhs
!= orig_rhs
|| lhs
!= orig_lhs
)
6078 return fold_build2_loc (loc
, truthop_code
, TREE_TYPE (cmpop
),
6083 /* Find ways of folding logical expressions of LHS and RHS:
6084 Try to merge two comparisons to the same innermost item.
6085 Look for range tests like "ch >= '0' && ch <= '9'".
6086 Look for combinations of simple terms on machines with expensive branches
6087 and evaluate the RHS unconditionally.
6089 For example, if we have p->a == 2 && p->b == 4 and we can make an
6090 object large enough to span both A and B, we can do this with a comparison
6091 against the object ANDed with the a mask.
6093 If we have p->a == q->a && p->b == q->b, we may be able to use bit masking
6094 operations to do this with one comparison.
6096 We check for both normal comparisons and the BIT_AND_EXPRs made this by
6097 function and the one above.
6099 CODE is the logical operation being done. It can be TRUTH_ANDIF_EXPR,
6100 TRUTH_AND_EXPR, TRUTH_ORIF_EXPR, or TRUTH_OR_EXPR.
6102 TRUTH_TYPE is the type of the logical operand and LHS and RHS are its
6105 We return the simplified tree or 0 if no optimization is possible. */
6108 fold_truth_andor_1 (location_t loc
, enum tree_code code
, tree truth_type
,
6111 /* If this is the "or" of two comparisons, we can do something if
6112 the comparisons are NE_EXPR. If this is the "and", we can do something
6113 if the comparisons are EQ_EXPR. I.e.,
6114 (a->b == 2 && a->c == 4) can become (a->new == NEW).
6116 WANTED_CODE is this operation code. For single bit fields, we can
6117 convert EQ_EXPR to NE_EXPR so we need not reject the "wrong"
6118 comparison for one-bit fields. */
6120 enum tree_code wanted_code
;
6121 enum tree_code lcode
, rcode
;
6122 tree ll_arg
, lr_arg
, rl_arg
, rr_arg
;
6123 tree ll_inner
, lr_inner
, rl_inner
, rr_inner
;
6124 HOST_WIDE_INT ll_bitsize
, ll_bitpos
, lr_bitsize
, lr_bitpos
;
6125 HOST_WIDE_INT rl_bitsize
, rl_bitpos
, rr_bitsize
, rr_bitpos
;
6126 HOST_WIDE_INT xll_bitpos
, xlr_bitpos
, xrl_bitpos
, xrr_bitpos
;
6127 HOST_WIDE_INT lnbitsize
, lnbitpos
, rnbitsize
, rnbitpos
;
6128 int ll_unsignedp
, lr_unsignedp
, rl_unsignedp
, rr_unsignedp
;
6129 int ll_reversep
, lr_reversep
, rl_reversep
, rr_reversep
;
6130 machine_mode ll_mode
, lr_mode
, rl_mode
, rr_mode
;
6131 scalar_int_mode lnmode
, rnmode
;
6132 tree ll_mask
, lr_mask
, rl_mask
, rr_mask
;
6133 tree ll_and_mask
, lr_and_mask
, rl_and_mask
, rr_and_mask
;
6134 tree l_const
, r_const
;
6135 tree lntype
, rntype
, result
;
6136 HOST_WIDE_INT first_bit
, end_bit
;
6139 /* Start by getting the comparison codes. Fail if anything is volatile.
6140 If one operand is a BIT_AND_EXPR with the constant one, treat it as if
6141 it were surrounded with a NE_EXPR. */
6143 if (TREE_SIDE_EFFECTS (lhs
) || TREE_SIDE_EFFECTS (rhs
))
6146 lcode
= TREE_CODE (lhs
);
6147 rcode
= TREE_CODE (rhs
);
6149 if (lcode
== BIT_AND_EXPR
&& integer_onep (TREE_OPERAND (lhs
, 1)))
6151 lhs
= build2 (NE_EXPR
, truth_type
, lhs
,
6152 build_int_cst (TREE_TYPE (lhs
), 0));
6156 if (rcode
== BIT_AND_EXPR
&& integer_onep (TREE_OPERAND (rhs
, 1)))
6158 rhs
= build2 (NE_EXPR
, truth_type
, rhs
,
6159 build_int_cst (TREE_TYPE (rhs
), 0));
6163 if (TREE_CODE_CLASS (lcode
) != tcc_comparison
6164 || TREE_CODE_CLASS (rcode
) != tcc_comparison
)
6167 ll_arg
= TREE_OPERAND (lhs
, 0);
6168 lr_arg
= TREE_OPERAND (lhs
, 1);
6169 rl_arg
= TREE_OPERAND (rhs
, 0);
6170 rr_arg
= TREE_OPERAND (rhs
, 1);
6172 /* Simplify (x<y) && (x==y) into (x<=y) and related optimizations. */
6173 if (simple_operand_p (ll_arg
)
6174 && simple_operand_p (lr_arg
))
6176 if (operand_equal_p (ll_arg
, rl_arg
, 0)
6177 && operand_equal_p (lr_arg
, rr_arg
, 0))
6179 result
= combine_comparisons (loc
, code
, lcode
, rcode
,
6180 truth_type
, ll_arg
, lr_arg
);
6184 else if (operand_equal_p (ll_arg
, rr_arg
, 0)
6185 && operand_equal_p (lr_arg
, rl_arg
, 0))
6187 result
= combine_comparisons (loc
, code
, lcode
,
6188 swap_tree_comparison (rcode
),
6189 truth_type
, ll_arg
, lr_arg
);
6195 code
= ((code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
)
6196 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
);
6198 /* If the RHS can be evaluated unconditionally and its operands are
6199 simple, it wins to evaluate the RHS unconditionally on machines
6200 with expensive branches. In this case, this isn't a comparison
6201 that can be merged. */
6203 if (BRANCH_COST (optimize_function_for_speed_p (cfun
),
6205 && ! FLOAT_TYPE_P (TREE_TYPE (rl_arg
))
6206 && simple_operand_p (rl_arg
)
6207 && simple_operand_p (rr_arg
))
6209 /* Convert (a != 0) || (b != 0) into (a | b) != 0. */
6210 if (code
== TRUTH_OR_EXPR
6211 && lcode
== NE_EXPR
&& integer_zerop (lr_arg
)
6212 && rcode
== NE_EXPR
&& integer_zerop (rr_arg
)
6213 && TREE_TYPE (ll_arg
) == TREE_TYPE (rl_arg
)
6214 && INTEGRAL_TYPE_P (TREE_TYPE (ll_arg
)))
6215 return build2_loc (loc
, NE_EXPR
, truth_type
,
6216 build2 (BIT_IOR_EXPR
, TREE_TYPE (ll_arg
),
6218 build_int_cst (TREE_TYPE (ll_arg
), 0));
6220 /* Convert (a == 0) && (b == 0) into (a | b) == 0. */
6221 if (code
== TRUTH_AND_EXPR
6222 && lcode
== EQ_EXPR
&& integer_zerop (lr_arg
)
6223 && rcode
== EQ_EXPR
&& integer_zerop (rr_arg
)
6224 && TREE_TYPE (ll_arg
) == TREE_TYPE (rl_arg
)
6225 && INTEGRAL_TYPE_P (TREE_TYPE (ll_arg
)))
6226 return build2_loc (loc
, EQ_EXPR
, truth_type
,
6227 build2 (BIT_IOR_EXPR
, TREE_TYPE (ll_arg
),
6229 build_int_cst (TREE_TYPE (ll_arg
), 0));
6232 /* See if the comparisons can be merged. Then get all the parameters for
6235 if ((lcode
!= EQ_EXPR
&& lcode
!= NE_EXPR
)
6236 || (rcode
!= EQ_EXPR
&& rcode
!= NE_EXPR
))
6239 ll_reversep
= lr_reversep
= rl_reversep
= rr_reversep
= 0;
6241 ll_inner
= decode_field_reference (loc
, &ll_arg
,
6242 &ll_bitsize
, &ll_bitpos
, &ll_mode
,
6243 &ll_unsignedp
, &ll_reversep
, &volatilep
,
6244 &ll_mask
, &ll_and_mask
);
6245 lr_inner
= decode_field_reference (loc
, &lr_arg
,
6246 &lr_bitsize
, &lr_bitpos
, &lr_mode
,
6247 &lr_unsignedp
, &lr_reversep
, &volatilep
,
6248 &lr_mask
, &lr_and_mask
);
6249 rl_inner
= decode_field_reference (loc
, &rl_arg
,
6250 &rl_bitsize
, &rl_bitpos
, &rl_mode
,
6251 &rl_unsignedp
, &rl_reversep
, &volatilep
,
6252 &rl_mask
, &rl_and_mask
);
6253 rr_inner
= decode_field_reference (loc
, &rr_arg
,
6254 &rr_bitsize
, &rr_bitpos
, &rr_mode
,
6255 &rr_unsignedp
, &rr_reversep
, &volatilep
,
6256 &rr_mask
, &rr_and_mask
);
6258 /* It must be true that the inner operation on the lhs of each
6259 comparison must be the same if we are to be able to do anything.
6260 Then see if we have constants. If not, the same must be true for
6263 || ll_reversep
!= rl_reversep
6264 || ll_inner
== 0 || rl_inner
== 0
6265 || ! operand_equal_p (ll_inner
, rl_inner
, 0))
6268 if (TREE_CODE (lr_arg
) == INTEGER_CST
6269 && TREE_CODE (rr_arg
) == INTEGER_CST
)
6271 l_const
= lr_arg
, r_const
= rr_arg
;
6272 lr_reversep
= ll_reversep
;
6274 else if (lr_reversep
!= rr_reversep
6275 || lr_inner
== 0 || rr_inner
== 0
6276 || ! operand_equal_p (lr_inner
, rr_inner
, 0))
6279 l_const
= r_const
= 0;
6281 /* If either comparison code is not correct for our logical operation,
6282 fail. However, we can convert a one-bit comparison against zero into
6283 the opposite comparison against that bit being set in the field. */
6285 wanted_code
= (code
== TRUTH_AND_EXPR
? EQ_EXPR
: NE_EXPR
);
6286 if (lcode
!= wanted_code
)
6288 if (l_const
&& integer_zerop (l_const
) && integer_pow2p (ll_mask
))
6290 /* Make the left operand unsigned, since we are only interested
6291 in the value of one bit. Otherwise we are doing the wrong
6300 /* This is analogous to the code for l_const above. */
6301 if (rcode
!= wanted_code
)
6303 if (r_const
&& integer_zerop (r_const
) && integer_pow2p (rl_mask
))
6312 /* See if we can find a mode that contains both fields being compared on
6313 the left. If we can't, fail. Otherwise, update all constants and masks
6314 to be relative to a field of that size. */
6315 first_bit
= MIN (ll_bitpos
, rl_bitpos
);
6316 end_bit
= MAX (ll_bitpos
+ ll_bitsize
, rl_bitpos
+ rl_bitsize
);
6317 if (!get_best_mode (end_bit
- first_bit
, first_bit
, 0, 0,
6318 TYPE_ALIGN (TREE_TYPE (ll_inner
)), BITS_PER_WORD
,
6319 volatilep
, &lnmode
))
6322 lnbitsize
= GET_MODE_BITSIZE (lnmode
);
6323 lnbitpos
= first_bit
& ~ (lnbitsize
- 1);
6324 lntype
= lang_hooks
.types
.type_for_size (lnbitsize
, 1);
6325 xll_bitpos
= ll_bitpos
- lnbitpos
, xrl_bitpos
= rl_bitpos
- lnbitpos
;
6327 if (ll_reversep
? !BYTES_BIG_ENDIAN
: BYTES_BIG_ENDIAN
)
6329 xll_bitpos
= lnbitsize
- xll_bitpos
- ll_bitsize
;
6330 xrl_bitpos
= lnbitsize
- xrl_bitpos
- rl_bitsize
;
6333 ll_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
, lntype
, ll_mask
),
6334 size_int (xll_bitpos
));
6335 rl_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
, lntype
, rl_mask
),
6336 size_int (xrl_bitpos
));
6340 l_const
= fold_convert_loc (loc
, lntype
, l_const
);
6341 l_const
= unextend (l_const
, ll_bitsize
, ll_unsignedp
, ll_and_mask
);
6342 l_const
= const_binop (LSHIFT_EXPR
, l_const
, size_int (xll_bitpos
));
6343 if (! integer_zerop (const_binop (BIT_AND_EXPR
, l_const
,
6344 fold_build1_loc (loc
, BIT_NOT_EXPR
,
6347 warning (0, "comparison is always %d", wanted_code
== NE_EXPR
);
6349 return constant_boolean_node (wanted_code
== NE_EXPR
, truth_type
);
6354 r_const
= fold_convert_loc (loc
, lntype
, r_const
);
6355 r_const
= unextend (r_const
, rl_bitsize
, rl_unsignedp
, rl_and_mask
);
6356 r_const
= const_binop (LSHIFT_EXPR
, r_const
, size_int (xrl_bitpos
));
6357 if (! integer_zerop (const_binop (BIT_AND_EXPR
, r_const
,
6358 fold_build1_loc (loc
, BIT_NOT_EXPR
,
6361 warning (0, "comparison is always %d", wanted_code
== NE_EXPR
);
6363 return constant_boolean_node (wanted_code
== NE_EXPR
, truth_type
);
6367 /* If the right sides are not constant, do the same for it. Also,
6368 disallow this optimization if a size, signedness or storage order
6369 mismatch occurs between the left and right sides. */
6372 if (ll_bitsize
!= lr_bitsize
|| rl_bitsize
!= rr_bitsize
6373 || ll_unsignedp
!= lr_unsignedp
|| rl_unsignedp
!= rr_unsignedp
6374 || ll_reversep
!= lr_reversep
6375 /* Make sure the two fields on the right
6376 correspond to the left without being swapped. */
6377 || ll_bitpos
- rl_bitpos
!= lr_bitpos
- rr_bitpos
)
6380 first_bit
= MIN (lr_bitpos
, rr_bitpos
);
6381 end_bit
= MAX (lr_bitpos
+ lr_bitsize
, rr_bitpos
+ rr_bitsize
);
6382 if (!get_best_mode (end_bit
- first_bit
, first_bit
, 0, 0,
6383 TYPE_ALIGN (TREE_TYPE (lr_inner
)), BITS_PER_WORD
,
6384 volatilep
, &rnmode
))
6387 rnbitsize
= GET_MODE_BITSIZE (rnmode
);
6388 rnbitpos
= first_bit
& ~ (rnbitsize
- 1);
6389 rntype
= lang_hooks
.types
.type_for_size (rnbitsize
, 1);
6390 xlr_bitpos
= lr_bitpos
- rnbitpos
, xrr_bitpos
= rr_bitpos
- rnbitpos
;
6392 if (lr_reversep
? !BYTES_BIG_ENDIAN
: BYTES_BIG_ENDIAN
)
6394 xlr_bitpos
= rnbitsize
- xlr_bitpos
- lr_bitsize
;
6395 xrr_bitpos
= rnbitsize
- xrr_bitpos
- rr_bitsize
;
6398 lr_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
,
6400 size_int (xlr_bitpos
));
6401 rr_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
,
6403 size_int (xrr_bitpos
));
6405 /* Make a mask that corresponds to both fields being compared.
6406 Do this for both items being compared. If the operands are the
6407 same size and the bits being compared are in the same position
6408 then we can do this by masking both and comparing the masked
6410 ll_mask
= const_binop (BIT_IOR_EXPR
, ll_mask
, rl_mask
);
6411 lr_mask
= const_binop (BIT_IOR_EXPR
, lr_mask
, rr_mask
);
6412 if (lnbitsize
== rnbitsize
6413 && xll_bitpos
== xlr_bitpos
6417 lhs
= make_bit_field_ref (loc
, ll_inner
, ll_arg
,
6418 lntype
, lnbitsize
, lnbitpos
,
6419 ll_unsignedp
|| rl_unsignedp
, ll_reversep
);
6420 if (! all_ones_mask_p (ll_mask
, lnbitsize
))
6421 lhs
= build2 (BIT_AND_EXPR
, lntype
, lhs
, ll_mask
);
6423 rhs
= make_bit_field_ref (loc
, lr_inner
, lr_arg
,
6424 rntype
, rnbitsize
, rnbitpos
,
6425 lr_unsignedp
|| rr_unsignedp
, lr_reversep
);
6426 if (! all_ones_mask_p (lr_mask
, rnbitsize
))
6427 rhs
= build2 (BIT_AND_EXPR
, rntype
, rhs
, lr_mask
);
6429 return build2_loc (loc
, wanted_code
, truth_type
, lhs
, rhs
);
6432 /* There is still another way we can do something: If both pairs of
6433 fields being compared are adjacent, we may be able to make a wider
6434 field containing them both.
6436 Note that we still must mask the lhs/rhs expressions. Furthermore,
6437 the mask must be shifted to account for the shift done by
6438 make_bit_field_ref. */
6439 if (((ll_bitsize
+ ll_bitpos
== rl_bitpos
6440 && lr_bitsize
+ lr_bitpos
== rr_bitpos
)
6441 || (ll_bitpos
== rl_bitpos
+ rl_bitsize
6442 && lr_bitpos
== rr_bitpos
+ rr_bitsize
))
6450 lhs
= make_bit_field_ref (loc
, ll_inner
, ll_arg
, lntype
,
6451 ll_bitsize
+ rl_bitsize
,
6452 MIN (ll_bitpos
, rl_bitpos
),
6453 ll_unsignedp
, ll_reversep
);
6454 rhs
= make_bit_field_ref (loc
, lr_inner
, lr_arg
, rntype
,
6455 lr_bitsize
+ rr_bitsize
,
6456 MIN (lr_bitpos
, rr_bitpos
),
6457 lr_unsignedp
, lr_reversep
);
6459 ll_mask
= const_binop (RSHIFT_EXPR
, ll_mask
,
6460 size_int (MIN (xll_bitpos
, xrl_bitpos
)));
6461 lr_mask
= const_binop (RSHIFT_EXPR
, lr_mask
,
6462 size_int (MIN (xlr_bitpos
, xrr_bitpos
)));
6464 /* Convert to the smaller type before masking out unwanted bits. */
6466 if (lntype
!= rntype
)
6468 if (lnbitsize
> rnbitsize
)
6470 lhs
= fold_convert_loc (loc
, rntype
, lhs
);
6471 ll_mask
= fold_convert_loc (loc
, rntype
, ll_mask
);
6474 else if (lnbitsize
< rnbitsize
)
6476 rhs
= fold_convert_loc (loc
, lntype
, rhs
);
6477 lr_mask
= fold_convert_loc (loc
, lntype
, lr_mask
);
6482 if (! all_ones_mask_p (ll_mask
, ll_bitsize
+ rl_bitsize
))
6483 lhs
= build2 (BIT_AND_EXPR
, type
, lhs
, ll_mask
);
6485 if (! all_ones_mask_p (lr_mask
, lr_bitsize
+ rr_bitsize
))
6486 rhs
= build2 (BIT_AND_EXPR
, type
, rhs
, lr_mask
);
6488 return build2_loc (loc
, wanted_code
, truth_type
, lhs
, rhs
);
6494 /* Handle the case of comparisons with constants. If there is something in
6495 common between the masks, those bits of the constants must be the same.
6496 If not, the condition is always false. Test for this to avoid generating
6497 incorrect code below. */
6498 result
= const_binop (BIT_AND_EXPR
, ll_mask
, rl_mask
);
6499 if (! integer_zerop (result
)
6500 && simple_cst_equal (const_binop (BIT_AND_EXPR
, result
, l_const
),
6501 const_binop (BIT_AND_EXPR
, result
, r_const
)) != 1)
6503 if (wanted_code
== NE_EXPR
)
6505 warning (0, "%<or%> of unmatched not-equal tests is always 1");
6506 return constant_boolean_node (true, truth_type
);
6510 warning (0, "%<and%> of mutually exclusive equal-tests is always 0");
6511 return constant_boolean_node (false, truth_type
);
6518 /* Construct the expression we will return. First get the component
6519 reference we will make. Unless the mask is all ones the width of
6520 that field, perform the mask operation. Then compare with the
6522 result
= make_bit_field_ref (loc
, ll_inner
, ll_arg
,
6523 lntype
, lnbitsize
, lnbitpos
,
6524 ll_unsignedp
|| rl_unsignedp
, ll_reversep
);
6526 ll_mask
= const_binop (BIT_IOR_EXPR
, ll_mask
, rl_mask
);
6527 if (! all_ones_mask_p (ll_mask
, lnbitsize
))
6528 result
= build2_loc (loc
, BIT_AND_EXPR
, lntype
, result
, ll_mask
);
6530 return build2_loc (loc
, wanted_code
, truth_type
, result
,
6531 const_binop (BIT_IOR_EXPR
, l_const
, r_const
));
6534 /* T is an integer expression that is being multiplied, divided, or taken a
6535 modulus (CODE says which and what kind of divide or modulus) by a
6536 constant C. See if we can eliminate that operation by folding it with
6537 other operations already in T. WIDE_TYPE, if non-null, is a type that
6538 should be used for the computation if wider than our type.
6540 For example, if we are dividing (X * 8) + (Y * 16) by 4, we can return
6541 (X * 2) + (Y * 4). We must, however, be assured that either the original
6542 expression would not overflow or that overflow is undefined for the type
6543 in the language in question.
6545 If we return a non-null expression, it is an equivalent form of the
6546 original computation, but need not be in the original type.
6548 We set *STRICT_OVERFLOW_P to true if the return values depends on
6549 signed overflow being undefined. Otherwise we do not change
6550 *STRICT_OVERFLOW_P. */
6553 extract_muldiv (tree t
, tree c
, enum tree_code code
, tree wide_type
,
6554 bool *strict_overflow_p
)
6556 /* To avoid exponential search depth, refuse to allow recursion past
6557 three levels. Beyond that (1) it's highly unlikely that we'll find
6558 something interesting and (2) we've probably processed it before
6559 when we built the inner expression. */
6568 ret
= extract_muldiv_1 (t
, c
, code
, wide_type
, strict_overflow_p
);
6575 extract_muldiv_1 (tree t
, tree c
, enum tree_code code
, tree wide_type
,
6576 bool *strict_overflow_p
)
6578 tree type
= TREE_TYPE (t
);
6579 enum tree_code tcode
= TREE_CODE (t
);
6580 tree ctype
= (wide_type
!= 0
6581 && (GET_MODE_SIZE (SCALAR_INT_TYPE_MODE (wide_type
))
6582 > GET_MODE_SIZE (SCALAR_INT_TYPE_MODE (type
)))
6583 ? wide_type
: type
);
6585 int same_p
= tcode
== code
;
6586 tree op0
= NULL_TREE
, op1
= NULL_TREE
;
6587 bool sub_strict_overflow_p
;
6589 /* Don't deal with constants of zero here; they confuse the code below. */
6590 if (integer_zerop (c
))
6593 if (TREE_CODE_CLASS (tcode
) == tcc_unary
)
6594 op0
= TREE_OPERAND (t
, 0);
6596 if (TREE_CODE_CLASS (tcode
) == tcc_binary
)
6597 op0
= TREE_OPERAND (t
, 0), op1
= TREE_OPERAND (t
, 1);
6599 /* Note that we need not handle conditional operations here since fold
6600 already handles those cases. So just do arithmetic here. */
6604 /* For a constant, we can always simplify if we are a multiply
6605 or (for divide and modulus) if it is a multiple of our constant. */
6606 if (code
== MULT_EXPR
6607 || wi::multiple_of_p (wi::to_wide (t
), wi::to_wide (c
),
6610 tree tem
= const_binop (code
, fold_convert (ctype
, t
),
6611 fold_convert (ctype
, c
));
6612 /* If the multiplication overflowed, we lost information on it.
6613 See PR68142 and PR69845. */
6614 if (TREE_OVERFLOW (tem
))
6620 CASE_CONVERT
: case NON_LVALUE_EXPR
:
6621 /* If op0 is an expression ... */
6622 if ((COMPARISON_CLASS_P (op0
)
6623 || UNARY_CLASS_P (op0
)
6624 || BINARY_CLASS_P (op0
)
6625 || VL_EXP_CLASS_P (op0
)
6626 || EXPRESSION_CLASS_P (op0
))
6627 /* ... and has wrapping overflow, and its type is smaller
6628 than ctype, then we cannot pass through as widening. */
6629 && (((ANY_INTEGRAL_TYPE_P (TREE_TYPE (op0
))
6630 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (op0
)))
6631 && (TYPE_PRECISION (ctype
)
6632 > TYPE_PRECISION (TREE_TYPE (op0
))))
6633 /* ... or this is a truncation (t is narrower than op0),
6634 then we cannot pass through this narrowing. */
6635 || (TYPE_PRECISION (type
)
6636 < TYPE_PRECISION (TREE_TYPE (op0
)))
6637 /* ... or signedness changes for division or modulus,
6638 then we cannot pass through this conversion. */
6639 || (code
!= MULT_EXPR
6640 && (TYPE_UNSIGNED (ctype
)
6641 != TYPE_UNSIGNED (TREE_TYPE (op0
))))
6642 /* ... or has undefined overflow while the converted to
6643 type has not, we cannot do the operation in the inner type
6644 as that would introduce undefined overflow. */
6645 || ((ANY_INTEGRAL_TYPE_P (TREE_TYPE (op0
))
6646 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (op0
)))
6647 && !TYPE_OVERFLOW_UNDEFINED (type
))))
6650 /* Pass the constant down and see if we can make a simplification. If
6651 we can, replace this expression with the inner simplification for
6652 possible later conversion to our or some other type. */
6653 if ((t2
= fold_convert (TREE_TYPE (op0
), c
)) != 0
6654 && TREE_CODE (t2
) == INTEGER_CST
6655 && !TREE_OVERFLOW (t2
)
6656 && (t1
= extract_muldiv (op0
, t2
, code
,
6657 code
== MULT_EXPR
? ctype
: NULL_TREE
,
6658 strict_overflow_p
)) != 0)
6663 /* If widening the type changes it from signed to unsigned, then we
6664 must avoid building ABS_EXPR itself as unsigned. */
6665 if (TYPE_UNSIGNED (ctype
) && !TYPE_UNSIGNED (type
))
6667 tree cstype
= (*signed_type_for
) (ctype
);
6668 if ((t1
= extract_muldiv (op0
, c
, code
, cstype
, strict_overflow_p
))
6671 t1
= fold_build1 (tcode
, cstype
, fold_convert (cstype
, t1
));
6672 return fold_convert (ctype
, t1
);
6676 /* If the constant is negative, we cannot simplify this. */
6677 if (tree_int_cst_sgn (c
) == -1)
6681 /* For division and modulus, type can't be unsigned, as e.g.
6682 (-(x / 2U)) / 2U isn't equal to -((x / 2U) / 2U) for x >= 2.
6683 For signed types, even with wrapping overflow, this is fine. */
6684 if (code
!= MULT_EXPR
&& TYPE_UNSIGNED (type
))
6686 if ((t1
= extract_muldiv (op0
, c
, code
, wide_type
, strict_overflow_p
))
6688 return fold_build1 (tcode
, ctype
, fold_convert (ctype
, t1
));
6691 case MIN_EXPR
: case MAX_EXPR
:
6692 /* If widening the type changes the signedness, then we can't perform
6693 this optimization as that changes the result. */
6694 if (TYPE_UNSIGNED (ctype
) != TYPE_UNSIGNED (type
))
6697 /* MIN (a, b) / 5 -> MIN (a / 5, b / 5) */
6698 sub_strict_overflow_p
= false;
6699 if ((t1
= extract_muldiv (op0
, c
, code
, wide_type
,
6700 &sub_strict_overflow_p
)) != 0
6701 && (t2
= extract_muldiv (op1
, c
, code
, wide_type
,
6702 &sub_strict_overflow_p
)) != 0)
6704 if (tree_int_cst_sgn (c
) < 0)
6705 tcode
= (tcode
== MIN_EXPR
? MAX_EXPR
: MIN_EXPR
);
6706 if (sub_strict_overflow_p
)
6707 *strict_overflow_p
= true;
6708 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, t1
),
6709 fold_convert (ctype
, t2
));
6713 case LSHIFT_EXPR
: case RSHIFT_EXPR
:
6714 /* If the second operand is constant, this is a multiplication
6715 or floor division, by a power of two, so we can treat it that
6716 way unless the multiplier or divisor overflows. Signed
6717 left-shift overflow is implementation-defined rather than
6718 undefined in C90, so do not convert signed left shift into
6720 if (TREE_CODE (op1
) == INTEGER_CST
6721 && (tcode
== RSHIFT_EXPR
|| TYPE_UNSIGNED (TREE_TYPE (op0
)))
6722 /* const_binop may not detect overflow correctly,
6723 so check for it explicitly here. */
6724 && wi::gtu_p (TYPE_PRECISION (TREE_TYPE (size_one_node
)),
6726 && (t1
= fold_convert (ctype
,
6727 const_binop (LSHIFT_EXPR
, size_one_node
,
6729 && !TREE_OVERFLOW (t1
))
6730 return extract_muldiv (build2 (tcode
== LSHIFT_EXPR
6731 ? MULT_EXPR
: FLOOR_DIV_EXPR
,
6733 fold_convert (ctype
, op0
),
6735 c
, code
, wide_type
, strict_overflow_p
);
6738 case PLUS_EXPR
: case MINUS_EXPR
:
6739 /* See if we can eliminate the operation on both sides. If we can, we
6740 can return a new PLUS or MINUS. If we can't, the only remaining
6741 cases where we can do anything are if the second operand is a
6743 sub_strict_overflow_p
= false;
6744 t1
= extract_muldiv (op0
, c
, code
, wide_type
, &sub_strict_overflow_p
);
6745 t2
= extract_muldiv (op1
, c
, code
, wide_type
, &sub_strict_overflow_p
);
6746 if (t1
!= 0 && t2
!= 0
6747 && TYPE_OVERFLOW_WRAPS (ctype
)
6748 && (code
== MULT_EXPR
6749 /* If not multiplication, we can only do this if both operands
6750 are divisible by c. */
6751 || (multiple_of_p (ctype
, op0
, c
)
6752 && multiple_of_p (ctype
, op1
, c
))))
6754 if (sub_strict_overflow_p
)
6755 *strict_overflow_p
= true;
6756 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, t1
),
6757 fold_convert (ctype
, t2
));
6760 /* If this was a subtraction, negate OP1 and set it to be an addition.
6761 This simplifies the logic below. */
6762 if (tcode
== MINUS_EXPR
)
6764 tcode
= PLUS_EXPR
, op1
= negate_expr (op1
);
6765 /* If OP1 was not easily negatable, the constant may be OP0. */
6766 if (TREE_CODE (op0
) == INTEGER_CST
)
6768 std::swap (op0
, op1
);
6773 if (TREE_CODE (op1
) != INTEGER_CST
)
6776 /* If either OP1 or C are negative, this optimization is not safe for
6777 some of the division and remainder types while for others we need
6778 to change the code. */
6779 if (tree_int_cst_sgn (op1
) < 0 || tree_int_cst_sgn (c
) < 0)
6781 if (code
== CEIL_DIV_EXPR
)
6782 code
= FLOOR_DIV_EXPR
;
6783 else if (code
== FLOOR_DIV_EXPR
)
6784 code
= CEIL_DIV_EXPR
;
6785 else if (code
!= MULT_EXPR
6786 && code
!= CEIL_MOD_EXPR
&& code
!= FLOOR_MOD_EXPR
)
6790 /* If it's a multiply or a division/modulus operation of a multiple
6791 of our constant, do the operation and verify it doesn't overflow. */
6792 if (code
== MULT_EXPR
6793 || wi::multiple_of_p (wi::to_wide (op1
), wi::to_wide (c
),
6796 op1
= const_binop (code
, fold_convert (ctype
, op1
),
6797 fold_convert (ctype
, c
));
6798 /* We allow the constant to overflow with wrapping semantics. */
6800 || (TREE_OVERFLOW (op1
) && !TYPE_OVERFLOW_WRAPS (ctype
)))
6806 /* If we have an unsigned type, we cannot widen the operation since it
6807 will change the result if the original computation overflowed. */
6808 if (TYPE_UNSIGNED (ctype
) && ctype
!= type
)
6811 /* The last case is if we are a multiply. In that case, we can
6812 apply the distributive law to commute the multiply and addition
6813 if the multiplication of the constants doesn't overflow
6814 and overflow is defined. With undefined overflow
6815 op0 * c might overflow, while (op0 + orig_op1) * c doesn't.
6816 But fold_plusminus_mult_expr would factor back any power-of-two
6817 value so do not distribute in the first place in this case. */
6818 if (code
== MULT_EXPR
6819 && TYPE_OVERFLOW_WRAPS (ctype
)
6820 && !(tree_fits_shwi_p (c
) && pow2p_hwi (absu_hwi (tree_to_shwi (c
)))))
6821 return fold_build2 (tcode
, ctype
,
6822 fold_build2 (code
, ctype
,
6823 fold_convert (ctype
, op0
),
6824 fold_convert (ctype
, c
)),
6830 /* We have a special case here if we are doing something like
6831 (C * 8) % 4 since we know that's zero. */
6832 if ((code
== TRUNC_MOD_EXPR
|| code
== CEIL_MOD_EXPR
6833 || code
== FLOOR_MOD_EXPR
|| code
== ROUND_MOD_EXPR
)
6834 /* If the multiplication can overflow we cannot optimize this. */
6835 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (t
))
6836 && TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
6837 && wi::multiple_of_p (wi::to_wide (op1
), wi::to_wide (c
),
6840 *strict_overflow_p
= true;
6841 return omit_one_operand (type
, integer_zero_node
, op0
);
6844 /* ... fall through ... */
6846 case TRUNC_DIV_EXPR
: case CEIL_DIV_EXPR
: case FLOOR_DIV_EXPR
:
6847 case ROUND_DIV_EXPR
: case EXACT_DIV_EXPR
:
6848 /* If we can extract our operation from the LHS, do so and return a
6849 new operation. Likewise for the RHS from a MULT_EXPR. Otherwise,
6850 do something only if the second operand is a constant. */
6852 && TYPE_OVERFLOW_WRAPS (ctype
)
6853 && (t1
= extract_muldiv (op0
, c
, code
, wide_type
,
6854 strict_overflow_p
)) != 0)
6855 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, t1
),
6856 fold_convert (ctype
, op1
));
6857 else if (tcode
== MULT_EXPR
&& code
== MULT_EXPR
6858 && TYPE_OVERFLOW_WRAPS (ctype
)
6859 && (t1
= extract_muldiv (op1
, c
, code
, wide_type
,
6860 strict_overflow_p
)) != 0)
6861 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, op0
),
6862 fold_convert (ctype
, t1
));
6863 else if (TREE_CODE (op1
) != INTEGER_CST
)
6866 /* If these are the same operation types, we can associate them
6867 assuming no overflow. */
6870 bool overflow_p
= false;
6871 wi::overflow_type overflow_mul
;
6872 signop sign
= TYPE_SIGN (ctype
);
6873 unsigned prec
= TYPE_PRECISION (ctype
);
6874 wide_int mul
= wi::mul (wi::to_wide (op1
, prec
),
6875 wi::to_wide (c
, prec
),
6876 sign
, &overflow_mul
);
6877 overflow_p
= TREE_OVERFLOW (c
) | TREE_OVERFLOW (op1
);
6879 && ((sign
== UNSIGNED
&& tcode
!= MULT_EXPR
) || sign
== SIGNED
))
6882 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, op0
),
6883 wide_int_to_tree (ctype
, mul
));
6886 /* If these operations "cancel" each other, we have the main
6887 optimizations of this pass, which occur when either constant is a
6888 multiple of the other, in which case we replace this with either an
6889 operation or CODE or TCODE.
6891 If we have an unsigned type, we cannot do this since it will change
6892 the result if the original computation overflowed. */
6893 if (TYPE_OVERFLOW_UNDEFINED (ctype
)
6894 && ((code
== MULT_EXPR
&& tcode
== EXACT_DIV_EXPR
)
6895 || (tcode
== MULT_EXPR
6896 && code
!= TRUNC_MOD_EXPR
&& code
!= CEIL_MOD_EXPR
6897 && code
!= FLOOR_MOD_EXPR
&& code
!= ROUND_MOD_EXPR
6898 && code
!= MULT_EXPR
)))
6900 if (wi::multiple_of_p (wi::to_wide (op1
), wi::to_wide (c
),
6903 if (TYPE_OVERFLOW_UNDEFINED (ctype
))
6904 *strict_overflow_p
= true;
6905 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, op0
),
6906 fold_convert (ctype
,
6907 const_binop (TRUNC_DIV_EXPR
,
6910 else if (wi::multiple_of_p (wi::to_wide (c
), wi::to_wide (op1
),
6913 if (TYPE_OVERFLOW_UNDEFINED (ctype
))
6914 *strict_overflow_p
= true;
6915 return fold_build2 (code
, ctype
, fold_convert (ctype
, op0
),
6916 fold_convert (ctype
,
6917 const_binop (TRUNC_DIV_EXPR
,
6930 /* Return a node which has the indicated constant VALUE (either 0 or
6931 1 for scalars or {-1,-1,..} or {0,0,...} for vectors),
6932 and is of the indicated TYPE. */
6935 constant_boolean_node (bool value
, tree type
)
6937 if (type
== integer_type_node
)
6938 return value
? integer_one_node
: integer_zero_node
;
6939 else if (type
== boolean_type_node
)
6940 return value
? boolean_true_node
: boolean_false_node
;
6941 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6942 return build_vector_from_val (type
,
6943 build_int_cst (TREE_TYPE (type
),
6946 return fold_convert (type
, value
? integer_one_node
: integer_zero_node
);
6950 /* Transform `a + (b ? x : y)' into `b ? (a + x) : (a + y)'.
6951 Transform, `a + (x < y)' into `(x < y) ? (a + 1) : (a + 0)'. Here
6952 CODE corresponds to the `+', COND to the `(b ? x : y)' or `(x < y)'
6953 expression, and ARG to `a'. If COND_FIRST_P is nonzero, then the
6954 COND is the first argument to CODE; otherwise (as in the example
6955 given here), it is the second argument. TYPE is the type of the
6956 original expression. Return NULL_TREE if no simplification is
6960 fold_binary_op_with_conditional_arg (location_t loc
,
6961 enum tree_code code
,
6962 tree type
, tree op0
, tree op1
,
6963 tree cond
, tree arg
, int cond_first_p
)
6965 tree cond_type
= cond_first_p
? TREE_TYPE (op0
) : TREE_TYPE (op1
);
6966 tree arg_type
= cond_first_p
? TREE_TYPE (op1
) : TREE_TYPE (op0
);
6967 tree test
, true_value
, false_value
;
6968 tree lhs
= NULL_TREE
;
6969 tree rhs
= NULL_TREE
;
6970 enum tree_code cond_code
= COND_EXPR
;
6972 /* Do not move possibly trapping operations into the conditional as this
6973 pessimizes code and causes gimplification issues when applied late. */
6974 if (operation_could_trap_p (code
, FLOAT_TYPE_P (type
),
6975 ANY_INTEGRAL_TYPE_P (type
)
6976 && TYPE_OVERFLOW_TRAPS (type
), op1
))
6979 if (TREE_CODE (cond
) == COND_EXPR
6980 || TREE_CODE (cond
) == VEC_COND_EXPR
)
6982 test
= TREE_OPERAND (cond
, 0);
6983 true_value
= TREE_OPERAND (cond
, 1);
6984 false_value
= TREE_OPERAND (cond
, 2);
6985 /* If this operand throws an expression, then it does not make
6986 sense to try to perform a logical or arithmetic operation
6988 if (VOID_TYPE_P (TREE_TYPE (true_value
)))
6990 if (VOID_TYPE_P (TREE_TYPE (false_value
)))
6993 else if (!(TREE_CODE (type
) != VECTOR_TYPE
6994 && TREE_CODE (TREE_TYPE (cond
)) == VECTOR_TYPE
))
6996 tree testtype
= TREE_TYPE (cond
);
6998 true_value
= constant_boolean_node (true, testtype
);
6999 false_value
= constant_boolean_node (false, testtype
);
7002 /* Detect the case of mixing vector and scalar types - bail out. */
7005 if (TREE_CODE (TREE_TYPE (test
)) == VECTOR_TYPE
)
7006 cond_code
= VEC_COND_EXPR
;
7008 /* This transformation is only worthwhile if we don't have to wrap ARG
7009 in a SAVE_EXPR and the operation can be simplified without recursing
7010 on at least one of the branches once its pushed inside the COND_EXPR. */
7011 if (!TREE_CONSTANT (arg
)
7012 && (TREE_SIDE_EFFECTS (arg
)
7013 || TREE_CODE (arg
) == COND_EXPR
|| TREE_CODE (arg
) == VEC_COND_EXPR
7014 || TREE_CONSTANT (true_value
) || TREE_CONSTANT (false_value
)))
7017 arg
= fold_convert_loc (loc
, arg_type
, arg
);
7020 true_value
= fold_convert_loc (loc
, cond_type
, true_value
);
7022 lhs
= fold_build2_loc (loc
, code
, type
, true_value
, arg
);
7024 lhs
= fold_build2_loc (loc
, code
, type
, arg
, true_value
);
7028 false_value
= fold_convert_loc (loc
, cond_type
, false_value
);
7030 rhs
= fold_build2_loc (loc
, code
, type
, false_value
, arg
);
7032 rhs
= fold_build2_loc (loc
, code
, type
, arg
, false_value
);
7035 /* Check that we have simplified at least one of the branches. */
7036 if (!TREE_CONSTANT (arg
) && !TREE_CONSTANT (lhs
) && !TREE_CONSTANT (rhs
))
7039 return fold_build3_loc (loc
, cond_code
, type
, test
, lhs
, rhs
);
7043 /* Subroutine of fold() that checks for the addition of +/- 0.0.
7045 If !NEGATE, return true if ADDEND is +/-0.0 and, for all X of type
7046 TYPE, X + ADDEND is the same as X. If NEGATE, return true if X -
7047 ADDEND is the same as X.
7049 X + 0 and X - 0 both give X when X is NaN, infinite, or nonzero
7050 and finite. The problematic cases are when X is zero, and its mode
7051 has signed zeros. In the case of rounding towards -infinity,
7052 X - 0 is not the same as X because 0 - 0 is -0. In other rounding
7053 modes, X + 0 is not the same as X because -0 + 0 is 0. */
7056 fold_real_zero_addition_p (const_tree type
, const_tree addend
, int negate
)
7058 if (!real_zerop (addend
))
7061 /* Don't allow the fold with -fsignaling-nans. */
7062 if (HONOR_SNANS (type
))
7065 /* Allow the fold if zeros aren't signed, or their sign isn't important. */
7066 if (!HONOR_SIGNED_ZEROS (type
))
7069 /* There is no case that is safe for all rounding modes. */
7070 if (HONOR_SIGN_DEPENDENT_ROUNDING (type
))
7073 /* In a vector or complex, we would need to check the sign of all zeros. */
7074 if (TREE_CODE (addend
) == VECTOR_CST
)
7075 addend
= uniform_vector_p (addend
);
7076 if (!addend
|| TREE_CODE (addend
) != REAL_CST
)
7079 /* Treat x + -0 as x - 0 and x - -0 as x + 0. */
7080 if (REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (addend
)))
7083 /* The mode has signed zeros, and we have to honor their sign.
7084 In this situation, there is only one case we can return true for.
7085 X - 0 is the same as X with default rounding. */
7089 /* Subroutine of match.pd that optimizes comparisons of a division by
7090 a nonzero integer constant against an integer constant, i.e.
7093 CODE is the comparison operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR,
7094 GE_EXPR or LE_EXPR. ARG01 and ARG1 must be a INTEGER_CST. */
7097 fold_div_compare (enum tree_code code
, tree c1
, tree c2
, tree
*lo
,
7098 tree
*hi
, bool *neg_overflow
)
7100 tree prod
, tmp
, type
= TREE_TYPE (c1
);
7101 signop sign
= TYPE_SIGN (type
);
7102 wi::overflow_type overflow
;
7104 /* We have to do this the hard way to detect unsigned overflow.
7105 prod = int_const_binop (MULT_EXPR, c1, c2); */
7106 wide_int val
= wi::mul (wi::to_wide (c1
), wi::to_wide (c2
), sign
, &overflow
);
7107 prod
= force_fit_type (type
, val
, -1, overflow
);
7108 *neg_overflow
= false;
7110 if (sign
== UNSIGNED
)
7112 tmp
= int_const_binop (MINUS_EXPR
, c1
, build_int_cst (type
, 1));
7115 /* Likewise *hi = int_const_binop (PLUS_EXPR, prod, tmp). */
7116 val
= wi::add (wi::to_wide (prod
), wi::to_wide (tmp
), sign
, &overflow
);
7117 *hi
= force_fit_type (type
, val
, -1, overflow
| TREE_OVERFLOW (prod
));
7119 else if (tree_int_cst_sgn (c1
) >= 0)
7121 tmp
= int_const_binop (MINUS_EXPR
, c1
, build_int_cst (type
, 1));
7122 switch (tree_int_cst_sgn (c2
))
7125 *neg_overflow
= true;
7126 *lo
= int_const_binop (MINUS_EXPR
, prod
, tmp
);
7131 *lo
= fold_negate_const (tmp
, type
);
7136 *hi
= int_const_binop (PLUS_EXPR
, prod
, tmp
);
7146 /* A negative divisor reverses the relational operators. */
7147 code
= swap_tree_comparison (code
);
7149 tmp
= int_const_binop (PLUS_EXPR
, c1
, build_int_cst (type
, 1));
7150 switch (tree_int_cst_sgn (c2
))
7153 *hi
= int_const_binop (MINUS_EXPR
, prod
, tmp
);
7158 *hi
= fold_negate_const (tmp
, type
);
7163 *neg_overflow
= true;
7164 *lo
= int_const_binop (PLUS_EXPR
, prod
, tmp
);
7173 if (code
!= EQ_EXPR
&& code
!= NE_EXPR
)
7176 if (TREE_OVERFLOW (*lo
)
7177 || operand_equal_p (*lo
, TYPE_MIN_VALUE (type
), 0))
7179 if (TREE_OVERFLOW (*hi
)
7180 || operand_equal_p (*hi
, TYPE_MAX_VALUE (type
), 0))
7187 /* If CODE with arguments ARG0 and ARG1 represents a single bit
7188 equality/inequality test, then return a simplified form of the test
7189 using a sign testing. Otherwise return NULL. TYPE is the desired
7193 fold_single_bit_test_into_sign_test (location_t loc
,
7194 enum tree_code code
, tree arg0
, tree arg1
,
7197 /* If this is testing a single bit, we can optimize the test. */
7198 if ((code
== NE_EXPR
|| code
== EQ_EXPR
)
7199 && TREE_CODE (arg0
) == BIT_AND_EXPR
&& integer_zerop (arg1
)
7200 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
7202 /* If we have (A & C) != 0 where C is the sign bit of A, convert
7203 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
7204 tree arg00
= sign_bit_p (TREE_OPERAND (arg0
, 0), TREE_OPERAND (arg0
, 1));
7206 if (arg00
!= NULL_TREE
7207 /* This is only a win if casting to a signed type is cheap,
7208 i.e. when arg00's type is not a partial mode. */
7209 && type_has_mode_precision_p (TREE_TYPE (arg00
)))
7211 tree stype
= signed_type_for (TREE_TYPE (arg00
));
7212 return fold_build2_loc (loc
, code
== EQ_EXPR
? GE_EXPR
: LT_EXPR
,
7214 fold_convert_loc (loc
, stype
, arg00
),
7215 build_int_cst (stype
, 0));
7222 /* If CODE with arguments ARG0 and ARG1 represents a single bit
7223 equality/inequality test, then return a simplified form of
7224 the test using shifts and logical operations. Otherwise return
7225 NULL. TYPE is the desired result type. */
7228 fold_single_bit_test (location_t loc
, enum tree_code code
,
7229 tree arg0
, tree arg1
, tree result_type
)
7231 /* If this is testing a single bit, we can optimize the test. */
7232 if ((code
== NE_EXPR
|| code
== EQ_EXPR
)
7233 && TREE_CODE (arg0
) == BIT_AND_EXPR
&& integer_zerop (arg1
)
7234 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
7236 tree inner
= TREE_OPERAND (arg0
, 0);
7237 tree type
= TREE_TYPE (arg0
);
7238 int bitnum
= tree_log2 (TREE_OPERAND (arg0
, 1));
7239 scalar_int_mode operand_mode
= SCALAR_INT_TYPE_MODE (type
);
7241 tree signed_type
, unsigned_type
, intermediate_type
;
7244 /* First, see if we can fold the single bit test into a sign-bit
7246 tem
= fold_single_bit_test_into_sign_test (loc
, code
, arg0
, arg1
,
7251 /* Otherwise we have (A & C) != 0 where C is a single bit,
7252 convert that into ((A >> C2) & 1). Where C2 = log2(C).
7253 Similarly for (A & C) == 0. */
7255 /* If INNER is a right shift of a constant and it plus BITNUM does
7256 not overflow, adjust BITNUM and INNER. */
7257 if (TREE_CODE (inner
) == RSHIFT_EXPR
7258 && TREE_CODE (TREE_OPERAND (inner
, 1)) == INTEGER_CST
7259 && bitnum
< TYPE_PRECISION (type
)
7260 && wi::ltu_p (wi::to_wide (TREE_OPERAND (inner
, 1)),
7261 TYPE_PRECISION (type
) - bitnum
))
7263 bitnum
+= tree_to_uhwi (TREE_OPERAND (inner
, 1));
7264 inner
= TREE_OPERAND (inner
, 0);
7267 /* If we are going to be able to omit the AND below, we must do our
7268 operations as unsigned. If we must use the AND, we have a choice.
7269 Normally unsigned is faster, but for some machines signed is. */
7270 ops_unsigned
= (load_extend_op (operand_mode
) == SIGN_EXTEND
7271 && !flag_syntax_only
) ? 0 : 1;
7273 signed_type
= lang_hooks
.types
.type_for_mode (operand_mode
, 0);
7274 unsigned_type
= lang_hooks
.types
.type_for_mode (operand_mode
, 1);
7275 intermediate_type
= ops_unsigned
? unsigned_type
: signed_type
;
7276 inner
= fold_convert_loc (loc
, intermediate_type
, inner
);
7279 inner
= build2 (RSHIFT_EXPR
, intermediate_type
,
7280 inner
, size_int (bitnum
));
7282 one
= build_int_cst (intermediate_type
, 1);
7284 if (code
== EQ_EXPR
)
7285 inner
= fold_build2_loc (loc
, BIT_XOR_EXPR
, intermediate_type
, inner
, one
);
7287 /* Put the AND last so it can combine with more things. */
7288 inner
= build2 (BIT_AND_EXPR
, intermediate_type
, inner
, one
);
7290 /* Make sure to return the proper type. */
7291 inner
= fold_convert_loc (loc
, result_type
, inner
);
7298 /* Test whether it is preferable two swap two operands, ARG0 and
7299 ARG1, for example because ARG0 is an integer constant and ARG1
7303 tree_swap_operands_p (const_tree arg0
, const_tree arg1
)
7305 if (CONSTANT_CLASS_P (arg1
))
7307 if (CONSTANT_CLASS_P (arg0
))
7313 if (TREE_CONSTANT (arg1
))
7315 if (TREE_CONSTANT (arg0
))
7318 /* It is preferable to swap two SSA_NAME to ensure a canonical form
7319 for commutative and comparison operators. Ensuring a canonical
7320 form allows the optimizers to find additional redundancies without
7321 having to explicitly check for both orderings. */
7322 if (TREE_CODE (arg0
) == SSA_NAME
7323 && TREE_CODE (arg1
) == SSA_NAME
7324 && SSA_NAME_VERSION (arg0
) > SSA_NAME_VERSION (arg1
))
7327 /* Put SSA_NAMEs last. */
7328 if (TREE_CODE (arg1
) == SSA_NAME
)
7330 if (TREE_CODE (arg0
) == SSA_NAME
)
7333 /* Put variables last. */
7343 /* Fold A < X && A + 1 > Y to A < X && A >= Y. Normally A + 1 > Y
7344 means A >= Y && A != MAX, but in this case we know that
7345 A < X <= MAX. INEQ is A + 1 > Y, BOUND is A < X. */
7348 fold_to_nonsharp_ineq_using_bound (location_t loc
, tree ineq
, tree bound
)
7350 tree a
, typea
, type
= TREE_TYPE (ineq
), a1
, diff
, y
;
7352 if (TREE_CODE (bound
) == LT_EXPR
)
7353 a
= TREE_OPERAND (bound
, 0);
7354 else if (TREE_CODE (bound
) == GT_EXPR
)
7355 a
= TREE_OPERAND (bound
, 1);
7359 typea
= TREE_TYPE (a
);
7360 if (!INTEGRAL_TYPE_P (typea
)
7361 && !POINTER_TYPE_P (typea
))
7364 if (TREE_CODE (ineq
) == LT_EXPR
)
7366 a1
= TREE_OPERAND (ineq
, 1);
7367 y
= TREE_OPERAND (ineq
, 0);
7369 else if (TREE_CODE (ineq
) == GT_EXPR
)
7371 a1
= TREE_OPERAND (ineq
, 0);
7372 y
= TREE_OPERAND (ineq
, 1);
7377 if (TREE_TYPE (a1
) != typea
)
7380 if (POINTER_TYPE_P (typea
))
7382 /* Convert the pointer types into integer before taking the difference. */
7383 tree ta
= fold_convert_loc (loc
, ssizetype
, a
);
7384 tree ta1
= fold_convert_loc (loc
, ssizetype
, a1
);
7385 diff
= fold_binary_loc (loc
, MINUS_EXPR
, ssizetype
, ta1
, ta
);
7388 diff
= fold_binary_loc (loc
, MINUS_EXPR
, typea
, a1
, a
);
7390 if (!diff
|| !integer_onep (diff
))
7393 return fold_build2_loc (loc
, GE_EXPR
, type
, a
, y
);
7396 /* Fold a sum or difference of at least one multiplication.
7397 Returns the folded tree or NULL if no simplification could be made. */
7400 fold_plusminus_mult_expr (location_t loc
, enum tree_code code
, tree type
,
7401 tree arg0
, tree arg1
)
7403 tree arg00
, arg01
, arg10
, arg11
;
7404 tree alt0
= NULL_TREE
, alt1
= NULL_TREE
, same
;
7406 /* (A * C) +- (B * C) -> (A+-B) * C.
7407 (A * C) +- A -> A * (C+-1).
7408 We are most concerned about the case where C is a constant,
7409 but other combinations show up during loop reduction. Since
7410 it is not difficult, try all four possibilities. */
7412 if (TREE_CODE (arg0
) == MULT_EXPR
)
7414 arg00
= TREE_OPERAND (arg0
, 0);
7415 arg01
= TREE_OPERAND (arg0
, 1);
7417 else if (TREE_CODE (arg0
) == INTEGER_CST
)
7419 arg00
= build_one_cst (type
);
7424 /* We cannot generate constant 1 for fract. */
7425 if (ALL_FRACT_MODE_P (TYPE_MODE (type
)))
7428 arg01
= build_one_cst (type
);
7430 if (TREE_CODE (arg1
) == MULT_EXPR
)
7432 arg10
= TREE_OPERAND (arg1
, 0);
7433 arg11
= TREE_OPERAND (arg1
, 1);
7435 else if (TREE_CODE (arg1
) == INTEGER_CST
)
7437 arg10
= build_one_cst (type
);
7438 /* As we canonicalize A - 2 to A + -2 get rid of that sign for
7439 the purpose of this canonicalization. */
7440 if (wi::neg_p (wi::to_wide (arg1
), TYPE_SIGN (TREE_TYPE (arg1
)))
7441 && negate_expr_p (arg1
)
7442 && code
== PLUS_EXPR
)
7444 arg11
= negate_expr (arg1
);
7452 /* We cannot generate constant 1 for fract. */
7453 if (ALL_FRACT_MODE_P (TYPE_MODE (type
)))
7456 arg11
= build_one_cst (type
);
7460 /* Prefer factoring a common non-constant. */
7461 if (operand_equal_p (arg00
, arg10
, 0))
7462 same
= arg00
, alt0
= arg01
, alt1
= arg11
;
7463 else if (operand_equal_p (arg01
, arg11
, 0))
7464 same
= arg01
, alt0
= arg00
, alt1
= arg10
;
7465 else if (operand_equal_p (arg00
, arg11
, 0))
7466 same
= arg00
, alt0
= arg01
, alt1
= arg10
;
7467 else if (operand_equal_p (arg01
, arg10
, 0))
7468 same
= arg01
, alt0
= arg00
, alt1
= arg11
;
7470 /* No identical multiplicands; see if we can find a common
7471 power-of-two factor in non-power-of-two multiplies. This
7472 can help in multi-dimensional array access. */
7473 else if (tree_fits_shwi_p (arg01
) && tree_fits_shwi_p (arg11
))
7475 HOST_WIDE_INT int01
= tree_to_shwi (arg01
);
7476 HOST_WIDE_INT int11
= tree_to_shwi (arg11
);
7481 /* Move min of absolute values to int11. */
7482 if (absu_hwi (int01
) < absu_hwi (int11
))
7484 tmp
= int01
, int01
= int11
, int11
= tmp
;
7485 alt0
= arg00
, arg00
= arg10
, arg10
= alt0
;
7492 const unsigned HOST_WIDE_INT factor
= absu_hwi (int11
);
7494 && pow2p_hwi (factor
)
7495 && (int01
& (factor
- 1)) == 0
7496 /* The remainder should not be a constant, otherwise we
7497 end up folding i * 4 + 2 to (i * 2 + 1) * 2 which has
7498 increased the number of multiplications necessary. */
7499 && TREE_CODE (arg10
) != INTEGER_CST
)
7501 alt0
= fold_build2_loc (loc
, MULT_EXPR
, TREE_TYPE (arg00
), arg00
,
7502 build_int_cst (TREE_TYPE (arg00
),
7507 maybe_same
= alt0
, alt0
= alt1
, alt1
= maybe_same
;
7514 if (! ANY_INTEGRAL_TYPE_P (type
)
7515 || TYPE_OVERFLOW_WRAPS (type
)
7516 /* We are neither factoring zero nor minus one. */
7517 || TREE_CODE (same
) == INTEGER_CST
)
7518 return fold_build2_loc (loc
, MULT_EXPR
, type
,
7519 fold_build2_loc (loc
, code
, type
,
7520 fold_convert_loc (loc
, type
, alt0
),
7521 fold_convert_loc (loc
, type
, alt1
)),
7522 fold_convert_loc (loc
, type
, same
));
7524 /* Same may be zero and thus the operation 'code' may overflow. Likewise
7525 same may be minus one and thus the multiplication may overflow. Perform
7526 the sum operation in an unsigned type. */
7527 tree utype
= unsigned_type_for (type
);
7528 tree tem
= fold_build2_loc (loc
, code
, utype
,
7529 fold_convert_loc (loc
, utype
, alt0
),
7530 fold_convert_loc (loc
, utype
, alt1
));
7531 /* If the sum evaluated to a constant that is not -INF the multiplication
7533 if (TREE_CODE (tem
) == INTEGER_CST
7534 && (wi::to_wide (tem
)
7535 != wi::min_value (TYPE_PRECISION (utype
), SIGNED
)))
7536 return fold_build2_loc (loc
, MULT_EXPR
, type
,
7537 fold_convert (type
, tem
), same
);
7539 /* Do not resort to unsigned multiplication because
7540 we lose the no-overflow property of the expression. */
7544 /* Subroutine of native_encode_expr. Encode the INTEGER_CST
7545 specified by EXPR into the buffer PTR of length LEN bytes.
7546 Return the number of bytes placed in the buffer, or zero
7550 native_encode_int (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7552 tree type
= TREE_TYPE (expr
);
7553 int total_bytes
= GET_MODE_SIZE (SCALAR_INT_TYPE_MODE (type
));
7554 int byte
, offset
, word
, words
;
7555 unsigned char value
;
7557 if ((off
== -1 && total_bytes
> len
) || off
>= total_bytes
)
7564 return MIN (len
, total_bytes
- off
);
7566 words
= total_bytes
/ UNITS_PER_WORD
;
7568 for (byte
= 0; byte
< total_bytes
; byte
++)
7570 int bitpos
= byte
* BITS_PER_UNIT
;
7571 /* Extend EXPR according to TYPE_SIGN if the precision isn't a whole
7573 value
= wi::extract_uhwi (wi::to_widest (expr
), bitpos
, BITS_PER_UNIT
);
7575 if (total_bytes
> UNITS_PER_WORD
)
7577 word
= byte
/ UNITS_PER_WORD
;
7578 if (WORDS_BIG_ENDIAN
)
7579 word
= (words
- 1) - word
;
7580 offset
= word
* UNITS_PER_WORD
;
7581 if (BYTES_BIG_ENDIAN
)
7582 offset
+= (UNITS_PER_WORD
- 1) - (byte
% UNITS_PER_WORD
);
7584 offset
+= byte
% UNITS_PER_WORD
;
7587 offset
= BYTES_BIG_ENDIAN
? (total_bytes
- 1) - byte
: byte
;
7588 if (offset
>= off
&& offset
- off
< len
)
7589 ptr
[offset
- off
] = value
;
7591 return MIN (len
, total_bytes
- off
);
7595 /* Subroutine of native_encode_expr. Encode the FIXED_CST
7596 specified by EXPR into the buffer PTR of length LEN bytes.
7597 Return the number of bytes placed in the buffer, or zero
7601 native_encode_fixed (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7603 tree type
= TREE_TYPE (expr
);
7604 scalar_mode mode
= SCALAR_TYPE_MODE (type
);
7605 int total_bytes
= GET_MODE_SIZE (mode
);
7606 FIXED_VALUE_TYPE value
;
7607 tree i_value
, i_type
;
7609 if (total_bytes
* BITS_PER_UNIT
> HOST_BITS_PER_DOUBLE_INT
)
7612 i_type
= lang_hooks
.types
.type_for_size (GET_MODE_BITSIZE (mode
), 1);
7614 if (NULL_TREE
== i_type
|| TYPE_PRECISION (i_type
) != total_bytes
)
7617 value
= TREE_FIXED_CST (expr
);
7618 i_value
= double_int_to_tree (i_type
, value
.data
);
7620 return native_encode_int (i_value
, ptr
, len
, off
);
7624 /* Subroutine of native_encode_expr. Encode the REAL_CST
7625 specified by EXPR into the buffer PTR of length LEN bytes.
7626 Return the number of bytes placed in the buffer, or zero
7630 native_encode_real (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7632 tree type
= TREE_TYPE (expr
);
7633 int total_bytes
= GET_MODE_SIZE (SCALAR_FLOAT_TYPE_MODE (type
));
7634 int byte
, offset
, word
, words
, bitpos
;
7635 unsigned char value
;
7637 /* There are always 32 bits in each long, no matter the size of
7638 the hosts long. We handle floating point representations with
7642 if ((off
== -1 && total_bytes
> len
) || off
>= total_bytes
)
7649 return MIN (len
, total_bytes
- off
);
7651 words
= (32 / BITS_PER_UNIT
) / UNITS_PER_WORD
;
7653 real_to_target (tmp
, TREE_REAL_CST_PTR (expr
), TYPE_MODE (type
));
7655 for (bitpos
= 0; bitpos
< total_bytes
* BITS_PER_UNIT
;
7656 bitpos
+= BITS_PER_UNIT
)
7658 byte
= (bitpos
/ BITS_PER_UNIT
) & 3;
7659 value
= (unsigned char) (tmp
[bitpos
/ 32] >> (bitpos
& 31));
7661 if (UNITS_PER_WORD
< 4)
7663 word
= byte
/ UNITS_PER_WORD
;
7664 if (WORDS_BIG_ENDIAN
)
7665 word
= (words
- 1) - word
;
7666 offset
= word
* UNITS_PER_WORD
;
7667 if (BYTES_BIG_ENDIAN
)
7668 offset
+= (UNITS_PER_WORD
- 1) - (byte
% UNITS_PER_WORD
);
7670 offset
+= byte
% UNITS_PER_WORD
;
7675 if (BYTES_BIG_ENDIAN
)
7677 /* Reverse bytes within each long, or within the entire float
7678 if it's smaller than a long (for HFmode). */
7679 offset
= MIN (3, total_bytes
- 1) - offset
;
7680 gcc_assert (offset
>= 0);
7683 offset
= offset
+ ((bitpos
/ BITS_PER_UNIT
) & ~3);
7685 && offset
- off
< len
)
7686 ptr
[offset
- off
] = value
;
7688 return MIN (len
, total_bytes
- off
);
7691 /* Subroutine of native_encode_expr. Encode the COMPLEX_CST
7692 specified by EXPR into the buffer PTR of length LEN bytes.
7693 Return the number of bytes placed in the buffer, or zero
7697 native_encode_complex (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7702 part
= TREE_REALPART (expr
);
7703 rsize
= native_encode_expr (part
, ptr
, len
, off
);
7704 if (off
== -1 && rsize
== 0)
7706 part
= TREE_IMAGPART (expr
);
7708 off
= MAX (0, off
- GET_MODE_SIZE (SCALAR_TYPE_MODE (TREE_TYPE (part
))));
7709 isize
= native_encode_expr (part
, ptr
? ptr
+ rsize
: NULL
,
7711 if (off
== -1 && isize
!= rsize
)
7713 return rsize
+ isize
;
7717 /* Subroutine of native_encode_expr. Encode the VECTOR_CST
7718 specified by EXPR into the buffer PTR of length LEN bytes.
7719 Return the number of bytes placed in the buffer, or zero
7723 native_encode_vector (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7725 unsigned HOST_WIDE_INT i
, count
;
7730 if (!VECTOR_CST_NELTS (expr
).is_constant (&count
))
7732 itype
= TREE_TYPE (TREE_TYPE (expr
));
7733 size
= GET_MODE_SIZE (SCALAR_TYPE_MODE (itype
));
7734 for (i
= 0; i
< count
; i
++)
7741 elem
= VECTOR_CST_ELT (expr
, i
);
7742 int res
= native_encode_expr (elem
, ptr
? ptr
+ offset
: NULL
,
7744 if ((off
== -1 && res
!= size
) || res
== 0)
7748 return (off
== -1 && i
< count
- 1) ? 0 : offset
;
7756 /* Subroutine of native_encode_expr. Encode the STRING_CST
7757 specified by EXPR into the buffer PTR of length LEN bytes.
7758 Return the number of bytes placed in the buffer, or zero
7762 native_encode_string (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7764 tree type
= TREE_TYPE (expr
);
7766 /* Wide-char strings are encoded in target byte-order so native
7767 encoding them is trivial. */
7768 if (BITS_PER_UNIT
!= CHAR_BIT
7769 || TREE_CODE (type
) != ARRAY_TYPE
7770 || TREE_CODE (TREE_TYPE (type
)) != INTEGER_TYPE
7771 || !tree_fits_shwi_p (TYPE_SIZE_UNIT (type
)))
7774 HOST_WIDE_INT total_bytes
= tree_to_shwi (TYPE_SIZE_UNIT (TREE_TYPE (expr
)));
7775 if ((off
== -1 && total_bytes
> len
) || off
>= total_bytes
)
7781 else if (TREE_STRING_LENGTH (expr
) - off
< MIN (total_bytes
, len
))
7784 if (off
< TREE_STRING_LENGTH (expr
))
7786 written
= MIN (len
, TREE_STRING_LENGTH (expr
) - off
);
7787 memcpy (ptr
, TREE_STRING_POINTER (expr
) + off
, written
);
7789 memset (ptr
+ written
, 0,
7790 MIN (total_bytes
- written
, len
- written
));
7793 memcpy (ptr
, TREE_STRING_POINTER (expr
) + off
, MIN (total_bytes
, len
));
7794 return MIN (total_bytes
- off
, len
);
7798 /* Subroutine of fold_view_convert_expr. Encode the INTEGER_CST,
7799 REAL_CST, COMPLEX_CST or VECTOR_CST specified by EXPR into the
7800 buffer PTR of length LEN bytes. If PTR is NULL, don't actually store
7801 anything, just do a dry run. If OFF is not -1 then start
7802 the encoding at byte offset OFF and encode at most LEN bytes.
7803 Return the number of bytes placed in the buffer, or zero upon failure. */
7806 native_encode_expr (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7808 /* We don't support starting at negative offset and -1 is special. */
7812 switch (TREE_CODE (expr
))
7815 return native_encode_int (expr
, ptr
, len
, off
);
7818 return native_encode_real (expr
, ptr
, len
, off
);
7821 return native_encode_fixed (expr
, ptr
, len
, off
);
7824 return native_encode_complex (expr
, ptr
, len
, off
);
7827 return native_encode_vector (expr
, ptr
, len
, off
);
7830 return native_encode_string (expr
, ptr
, len
, off
);
7838 /* Subroutine of native_interpret_expr. Interpret the contents of
7839 the buffer PTR of length LEN as an INTEGER_CST of type TYPE.
7840 If the buffer cannot be interpreted, return NULL_TREE. */
7843 native_interpret_int (tree type
, const unsigned char *ptr
, int len
)
7845 int total_bytes
= GET_MODE_SIZE (SCALAR_INT_TYPE_MODE (type
));
7847 if (total_bytes
> len
7848 || total_bytes
* BITS_PER_UNIT
> HOST_BITS_PER_DOUBLE_INT
)
7851 wide_int result
= wi::from_buffer (ptr
, total_bytes
);
7853 return wide_int_to_tree (type
, result
);
7857 /* Subroutine of native_interpret_expr. Interpret the contents of
7858 the buffer PTR of length LEN as a FIXED_CST of type TYPE.
7859 If the buffer cannot be interpreted, return NULL_TREE. */
7862 native_interpret_fixed (tree type
, const unsigned char *ptr
, int len
)
7864 scalar_mode mode
= SCALAR_TYPE_MODE (type
);
7865 int total_bytes
= GET_MODE_SIZE (mode
);
7867 FIXED_VALUE_TYPE fixed_value
;
7869 if (total_bytes
> len
7870 || total_bytes
* BITS_PER_UNIT
> HOST_BITS_PER_DOUBLE_INT
)
7873 result
= double_int::from_buffer (ptr
, total_bytes
);
7874 fixed_value
= fixed_from_double_int (result
, mode
);
7876 return build_fixed (type
, fixed_value
);
7880 /* Subroutine of native_interpret_expr. Interpret the contents of
7881 the buffer PTR of length LEN as a REAL_CST of type TYPE.
7882 If the buffer cannot be interpreted, return NULL_TREE. */
7885 native_interpret_real (tree type
, const unsigned char *ptr
, int len
)
7887 scalar_float_mode mode
= SCALAR_FLOAT_TYPE_MODE (type
);
7888 int total_bytes
= GET_MODE_SIZE (mode
);
7889 unsigned char value
;
7890 /* There are always 32 bits in each long, no matter the size of
7891 the hosts long. We handle floating point representations with
7896 if (total_bytes
> len
|| total_bytes
> 24)
7898 int words
= (32 / BITS_PER_UNIT
) / UNITS_PER_WORD
;
7900 memset (tmp
, 0, sizeof (tmp
));
7901 for (int bitpos
= 0; bitpos
< total_bytes
* BITS_PER_UNIT
;
7902 bitpos
+= BITS_PER_UNIT
)
7904 /* Both OFFSET and BYTE index within a long;
7905 bitpos indexes the whole float. */
7906 int offset
, byte
= (bitpos
/ BITS_PER_UNIT
) & 3;
7907 if (UNITS_PER_WORD
< 4)
7909 int word
= byte
/ UNITS_PER_WORD
;
7910 if (WORDS_BIG_ENDIAN
)
7911 word
= (words
- 1) - word
;
7912 offset
= word
* UNITS_PER_WORD
;
7913 if (BYTES_BIG_ENDIAN
)
7914 offset
+= (UNITS_PER_WORD
- 1) - (byte
% UNITS_PER_WORD
);
7916 offset
+= byte
% UNITS_PER_WORD
;
7921 if (BYTES_BIG_ENDIAN
)
7923 /* Reverse bytes within each long, or within the entire float
7924 if it's smaller than a long (for HFmode). */
7925 offset
= MIN (3, total_bytes
- 1) - offset
;
7926 gcc_assert (offset
>= 0);
7929 value
= ptr
[offset
+ ((bitpos
/ BITS_PER_UNIT
) & ~3)];
7931 tmp
[bitpos
/ 32] |= (unsigned long)value
<< (bitpos
& 31);
7934 real_from_target (&r
, tmp
, mode
);
7935 return build_real (type
, r
);
7939 /* Subroutine of native_interpret_expr. Interpret the contents of
7940 the buffer PTR of length LEN as a COMPLEX_CST of type TYPE.
7941 If the buffer cannot be interpreted, return NULL_TREE. */
7944 native_interpret_complex (tree type
, const unsigned char *ptr
, int len
)
7946 tree etype
, rpart
, ipart
;
7949 etype
= TREE_TYPE (type
);
7950 size
= GET_MODE_SIZE (SCALAR_TYPE_MODE (etype
));
7953 rpart
= native_interpret_expr (etype
, ptr
, size
);
7956 ipart
= native_interpret_expr (etype
, ptr
+size
, size
);
7959 return build_complex (type
, rpart
, ipart
);
7963 /* Subroutine of native_interpret_expr. Interpret the contents of
7964 the buffer PTR of length LEN as a VECTOR_CST of type TYPE.
7965 If the buffer cannot be interpreted, return NULL_TREE. */
7968 native_interpret_vector (tree type
, const unsigned char *ptr
, unsigned int len
)
7971 unsigned int i
, size
;
7972 unsigned HOST_WIDE_INT count
;
7974 etype
= TREE_TYPE (type
);
7975 size
= GET_MODE_SIZE (SCALAR_TYPE_MODE (etype
));
7976 if (!TYPE_VECTOR_SUBPARTS (type
).is_constant (&count
)
7977 || size
* count
> len
)
7980 tree_vector_builder
elements (type
, count
, 1);
7981 for (i
= 0; i
< count
; ++i
)
7983 elem
= native_interpret_expr (etype
, ptr
+(i
*size
), size
);
7986 elements
.quick_push (elem
);
7988 return elements
.build ();
7992 /* Subroutine of fold_view_convert_expr. Interpret the contents of
7993 the buffer PTR of length LEN as a constant of type TYPE. For
7994 INTEGRAL_TYPE_P we return an INTEGER_CST, for SCALAR_FLOAT_TYPE_P
7995 we return a REAL_CST, etc... If the buffer cannot be interpreted,
7996 return NULL_TREE. */
7999 native_interpret_expr (tree type
, const unsigned char *ptr
, int len
)
8001 switch (TREE_CODE (type
))
8007 case REFERENCE_TYPE
:
8008 return native_interpret_int (type
, ptr
, len
);
8011 return native_interpret_real (type
, ptr
, len
);
8013 case FIXED_POINT_TYPE
:
8014 return native_interpret_fixed (type
, ptr
, len
);
8017 return native_interpret_complex (type
, ptr
, len
);
8020 return native_interpret_vector (type
, ptr
, len
);
8027 /* Returns true if we can interpret the contents of a native encoding
8031 can_native_interpret_type_p (tree type
)
8033 switch (TREE_CODE (type
))
8039 case REFERENCE_TYPE
:
8040 case FIXED_POINT_TYPE
:
8051 /* Fold a VIEW_CONVERT_EXPR of a constant expression EXPR to type
8052 TYPE at compile-time. If we're unable to perform the conversion
8053 return NULL_TREE. */
8056 fold_view_convert_expr (tree type
, tree expr
)
8058 /* We support up to 512-bit values (for V8DFmode). */
8059 unsigned char buffer
[64];
8062 /* Check that the host and target are sane. */
8063 if (CHAR_BIT
!= 8 || BITS_PER_UNIT
!= 8)
8066 len
= native_encode_expr (expr
, buffer
, sizeof (buffer
));
8070 return native_interpret_expr (type
, buffer
, len
);
8073 /* Build an expression for the address of T. Folds away INDIRECT_REF
8074 to avoid confusing the gimplify process. */
8077 build_fold_addr_expr_with_type_loc (location_t loc
, tree t
, tree ptrtype
)
8079 /* The size of the object is not relevant when talking about its address. */
8080 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
8081 t
= TREE_OPERAND (t
, 0);
8083 if (TREE_CODE (t
) == INDIRECT_REF
)
8085 t
= TREE_OPERAND (t
, 0);
8087 if (TREE_TYPE (t
) != ptrtype
)
8088 t
= build1_loc (loc
, NOP_EXPR
, ptrtype
, t
);
8090 else if (TREE_CODE (t
) == MEM_REF
8091 && integer_zerop (TREE_OPERAND (t
, 1)))
8092 return TREE_OPERAND (t
, 0);
8093 else if (TREE_CODE (t
) == MEM_REF
8094 && TREE_CODE (TREE_OPERAND (t
, 0)) == INTEGER_CST
)
8095 return fold_binary (POINTER_PLUS_EXPR
, ptrtype
,
8096 TREE_OPERAND (t
, 0),
8097 convert_to_ptrofftype (TREE_OPERAND (t
, 1)));
8098 else if (TREE_CODE (t
) == VIEW_CONVERT_EXPR
)
8100 t
= build_fold_addr_expr_loc (loc
, TREE_OPERAND (t
, 0));
8102 if (TREE_TYPE (t
) != ptrtype
)
8103 t
= fold_convert_loc (loc
, ptrtype
, t
);
8106 t
= build1_loc (loc
, ADDR_EXPR
, ptrtype
, t
);
8111 /* Build an expression for the address of T. */
8114 build_fold_addr_expr_loc (location_t loc
, tree t
)
8116 tree ptrtype
= build_pointer_type (TREE_TYPE (t
));
8118 return build_fold_addr_expr_with_type_loc (loc
, t
, ptrtype
);
8121 /* Fold a unary expression of code CODE and type TYPE with operand
8122 OP0. Return the folded expression if folding is successful.
8123 Otherwise, return NULL_TREE. */
8126 fold_unary_loc (location_t loc
, enum tree_code code
, tree type
, tree op0
)
8130 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
8132 gcc_assert (IS_EXPR_CODE_CLASS (kind
)
8133 && TREE_CODE_LENGTH (code
) == 1);
8138 if (CONVERT_EXPR_CODE_P (code
)
8139 || code
== FLOAT_EXPR
|| code
== ABS_EXPR
|| code
== NEGATE_EXPR
)
8141 /* Don't use STRIP_NOPS, because signedness of argument type
8143 STRIP_SIGN_NOPS (arg0
);
8147 /* Strip any conversions that don't change the mode. This
8148 is safe for every expression, except for a comparison
8149 expression because its signedness is derived from its
8152 Note that this is done as an internal manipulation within
8153 the constant folder, in order to find the simplest
8154 representation of the arguments so that their form can be
8155 studied. In any cases, the appropriate type conversions
8156 should be put back in the tree that will get out of the
8161 if (CONSTANT_CLASS_P (arg0
))
8163 tree tem
= const_unop (code
, type
, arg0
);
8166 if (TREE_TYPE (tem
) != type
)
8167 tem
= fold_convert_loc (loc
, type
, tem
);
8173 tem
= generic_simplify (loc
, code
, type
, op0
);
8177 if (TREE_CODE_CLASS (code
) == tcc_unary
)
8179 if (TREE_CODE (arg0
) == COMPOUND_EXPR
)
8180 return build2 (COMPOUND_EXPR
, type
, TREE_OPERAND (arg0
, 0),
8181 fold_build1_loc (loc
, code
, type
,
8182 fold_convert_loc (loc
, TREE_TYPE (op0
),
8183 TREE_OPERAND (arg0
, 1))));
8184 else if (TREE_CODE (arg0
) == COND_EXPR
)
8186 tree arg01
= TREE_OPERAND (arg0
, 1);
8187 tree arg02
= TREE_OPERAND (arg0
, 2);
8188 if (! VOID_TYPE_P (TREE_TYPE (arg01
)))
8189 arg01
= fold_build1_loc (loc
, code
, type
,
8190 fold_convert_loc (loc
,
8191 TREE_TYPE (op0
), arg01
));
8192 if (! VOID_TYPE_P (TREE_TYPE (arg02
)))
8193 arg02
= fold_build1_loc (loc
, code
, type
,
8194 fold_convert_loc (loc
,
8195 TREE_TYPE (op0
), arg02
));
8196 tem
= fold_build3_loc (loc
, COND_EXPR
, type
, TREE_OPERAND (arg0
, 0),
8199 /* If this was a conversion, and all we did was to move into
8200 inside the COND_EXPR, bring it back out. But leave it if
8201 it is a conversion from integer to integer and the
8202 result precision is no wider than a word since such a
8203 conversion is cheap and may be optimized away by combine,
8204 while it couldn't if it were outside the COND_EXPR. Then return
8205 so we don't get into an infinite recursion loop taking the
8206 conversion out and then back in. */
8208 if ((CONVERT_EXPR_CODE_P (code
)
8209 || code
== NON_LVALUE_EXPR
)
8210 && TREE_CODE (tem
) == COND_EXPR
8211 && TREE_CODE (TREE_OPERAND (tem
, 1)) == code
8212 && TREE_CODE (TREE_OPERAND (tem
, 2)) == code
8213 && ! VOID_TYPE_P (TREE_OPERAND (tem
, 1))
8214 && ! VOID_TYPE_P (TREE_OPERAND (tem
, 2))
8215 && (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem
, 1), 0))
8216 == TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem
, 2), 0)))
8217 && (! (INTEGRAL_TYPE_P (TREE_TYPE (tem
))
8219 (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem
, 1), 0))))
8220 && TYPE_PRECISION (TREE_TYPE (tem
)) <= BITS_PER_WORD
)
8221 || flag_syntax_only
))
8222 tem
= build1_loc (loc
, code
, type
,
8224 TREE_TYPE (TREE_OPERAND
8225 (TREE_OPERAND (tem
, 1), 0)),
8226 TREE_OPERAND (tem
, 0),
8227 TREE_OPERAND (TREE_OPERAND (tem
, 1), 0),
8228 TREE_OPERAND (TREE_OPERAND (tem
, 2),
8236 case NON_LVALUE_EXPR
:
8237 if (!maybe_lvalue_p (op0
))
8238 return fold_convert_loc (loc
, type
, op0
);
8243 case FIX_TRUNC_EXPR
:
8244 if (COMPARISON_CLASS_P (op0
))
8246 /* If we have (type) (a CMP b) and type is an integral type, return
8247 new expression involving the new type. Canonicalize
8248 (type) (a CMP b) to (a CMP b) ? (type) true : (type) false for
8250 Do not fold the result as that would not simplify further, also
8251 folding again results in recursions. */
8252 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
8253 return build2_loc (loc
, TREE_CODE (op0
), type
,
8254 TREE_OPERAND (op0
, 0),
8255 TREE_OPERAND (op0
, 1));
8256 else if (!INTEGRAL_TYPE_P (type
) && !VOID_TYPE_P (type
)
8257 && TREE_CODE (type
) != VECTOR_TYPE
)
8258 return build3_loc (loc
, COND_EXPR
, type
, op0
,
8259 constant_boolean_node (true, type
),
8260 constant_boolean_node (false, type
));
8263 /* Handle (T *)&A.B.C for A being of type T and B and C
8264 living at offset zero. This occurs frequently in
8265 C++ upcasting and then accessing the base. */
8266 if (TREE_CODE (op0
) == ADDR_EXPR
8267 && POINTER_TYPE_P (type
)
8268 && handled_component_p (TREE_OPERAND (op0
, 0)))
8270 poly_int64 bitsize
, bitpos
;
8273 int unsignedp
, reversep
, volatilep
;
8275 = get_inner_reference (TREE_OPERAND (op0
, 0), &bitsize
, &bitpos
,
8276 &offset
, &mode
, &unsignedp
, &reversep
,
8278 /* If the reference was to a (constant) zero offset, we can use
8279 the address of the base if it has the same base type
8280 as the result type and the pointer type is unqualified. */
8282 && known_eq (bitpos
, 0)
8283 && (TYPE_MAIN_VARIANT (TREE_TYPE (type
))
8284 == TYPE_MAIN_VARIANT (TREE_TYPE (base
)))
8285 && TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
8286 return fold_convert_loc (loc
, type
,
8287 build_fold_addr_expr_loc (loc
, base
));
8290 if (TREE_CODE (op0
) == MODIFY_EXPR
8291 && TREE_CONSTANT (TREE_OPERAND (op0
, 1))
8292 /* Detect assigning a bitfield. */
8293 && !(TREE_CODE (TREE_OPERAND (op0
, 0)) == COMPONENT_REF
8295 (TREE_OPERAND (TREE_OPERAND (op0
, 0), 1))))
8297 /* Don't leave an assignment inside a conversion
8298 unless assigning a bitfield. */
8299 tem
= fold_build1_loc (loc
, code
, type
, TREE_OPERAND (op0
, 1));
8300 /* First do the assignment, then return converted constant. */
8301 tem
= build2_loc (loc
, COMPOUND_EXPR
, TREE_TYPE (tem
), op0
, tem
);
8302 TREE_NO_WARNING (tem
) = 1;
8303 TREE_USED (tem
) = 1;
8307 /* Convert (T)(x & c) into (T)x & (T)c, if c is an integer
8308 constants (if x has signed type, the sign bit cannot be set
8309 in c). This folds extension into the BIT_AND_EXPR.
8310 ??? We don't do it for BOOLEAN_TYPE or ENUMERAL_TYPE because they
8311 very likely don't have maximal range for their precision and this
8312 transformation effectively doesn't preserve non-maximal ranges. */
8313 if (TREE_CODE (type
) == INTEGER_TYPE
8314 && TREE_CODE (op0
) == BIT_AND_EXPR
8315 && TREE_CODE (TREE_OPERAND (op0
, 1)) == INTEGER_CST
)
8317 tree and_expr
= op0
;
8318 tree and0
= TREE_OPERAND (and_expr
, 0);
8319 tree and1
= TREE_OPERAND (and_expr
, 1);
8322 if (TYPE_UNSIGNED (TREE_TYPE (and_expr
))
8323 || (TYPE_PRECISION (type
)
8324 <= TYPE_PRECISION (TREE_TYPE (and_expr
))))
8326 else if (TYPE_PRECISION (TREE_TYPE (and1
))
8327 <= HOST_BITS_PER_WIDE_INT
8328 && tree_fits_uhwi_p (and1
))
8330 unsigned HOST_WIDE_INT cst
;
8332 cst
= tree_to_uhwi (and1
);
8333 cst
&= HOST_WIDE_INT_M1U
8334 << (TYPE_PRECISION (TREE_TYPE (and1
)) - 1);
8335 change
= (cst
== 0);
8337 && !flag_syntax_only
8338 && (load_extend_op (TYPE_MODE (TREE_TYPE (and0
)))
8341 tree uns
= unsigned_type_for (TREE_TYPE (and0
));
8342 and0
= fold_convert_loc (loc
, uns
, and0
);
8343 and1
= fold_convert_loc (loc
, uns
, and1
);
8348 tem
= force_fit_type (type
, wi::to_widest (and1
), 0,
8349 TREE_OVERFLOW (and1
));
8350 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
8351 fold_convert_loc (loc
, type
, and0
), tem
);
8355 /* Convert (T1)(X p+ Y) into ((T1)X p+ Y), for pointer type, when the new
8356 cast (T1)X will fold away. We assume that this happens when X itself
8358 if (POINTER_TYPE_P (type
)
8359 && TREE_CODE (arg0
) == POINTER_PLUS_EXPR
8360 && CONVERT_EXPR_P (TREE_OPERAND (arg0
, 0)))
8362 tree arg00
= TREE_OPERAND (arg0
, 0);
8363 tree arg01
= TREE_OPERAND (arg0
, 1);
8365 return fold_build_pointer_plus_loc
8366 (loc
, fold_convert_loc (loc
, type
, arg00
), arg01
);
8369 /* Convert (T1)(~(T2)X) into ~(T1)X if T1 and T2 are integral types
8370 of the same precision, and X is an integer type not narrower than
8371 types T1 or T2, i.e. the cast (T2)X isn't an extension. */
8372 if (INTEGRAL_TYPE_P (type
)
8373 && TREE_CODE (op0
) == BIT_NOT_EXPR
8374 && INTEGRAL_TYPE_P (TREE_TYPE (op0
))
8375 && CONVERT_EXPR_P (TREE_OPERAND (op0
, 0))
8376 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (op0
)))
8378 tem
= TREE_OPERAND (TREE_OPERAND (op0
, 0), 0);
8379 if (INTEGRAL_TYPE_P (TREE_TYPE (tem
))
8380 && TYPE_PRECISION (type
) <= TYPE_PRECISION (TREE_TYPE (tem
)))
8381 return fold_build1_loc (loc
, BIT_NOT_EXPR
, type
,
8382 fold_convert_loc (loc
, type
, tem
));
8385 /* Convert (T1)(X * Y) into (T1)X * (T1)Y if T1 is narrower than the
8386 type of X and Y (integer types only). */
8387 if (INTEGRAL_TYPE_P (type
)
8388 && TREE_CODE (op0
) == MULT_EXPR
8389 && INTEGRAL_TYPE_P (TREE_TYPE (op0
))
8390 && TYPE_PRECISION (type
) < TYPE_PRECISION (TREE_TYPE (op0
)))
8392 /* Be careful not to introduce new overflows. */
8394 if (TYPE_OVERFLOW_WRAPS (type
))
8397 mult_type
= unsigned_type_for (type
);
8399 if (TYPE_PRECISION (mult_type
) < TYPE_PRECISION (TREE_TYPE (op0
)))
8401 tem
= fold_build2_loc (loc
, MULT_EXPR
, mult_type
,
8402 fold_convert_loc (loc
, mult_type
,
8403 TREE_OPERAND (op0
, 0)),
8404 fold_convert_loc (loc
, mult_type
,
8405 TREE_OPERAND (op0
, 1)));
8406 return fold_convert_loc (loc
, type
, tem
);
8412 case VIEW_CONVERT_EXPR
:
8413 if (TREE_CODE (op0
) == MEM_REF
)
8415 if (TYPE_ALIGN (TREE_TYPE (op0
)) != TYPE_ALIGN (type
))
8416 type
= build_aligned_type (type
, TYPE_ALIGN (TREE_TYPE (op0
)));
8417 tem
= fold_build2_loc (loc
, MEM_REF
, type
,
8418 TREE_OPERAND (op0
, 0), TREE_OPERAND (op0
, 1));
8419 REF_REVERSE_STORAGE_ORDER (tem
) = REF_REVERSE_STORAGE_ORDER (op0
);
8426 tem
= fold_negate_expr (loc
, arg0
);
8428 return fold_convert_loc (loc
, type
, tem
);
8432 /* Convert fabs((double)float) into (double)fabsf(float). */
8433 if (TREE_CODE (arg0
) == NOP_EXPR
8434 && TREE_CODE (type
) == REAL_TYPE
)
8436 tree targ0
= strip_float_extensions (arg0
);
8438 return fold_convert_loc (loc
, type
,
8439 fold_build1_loc (loc
, ABS_EXPR
,
8446 /* Convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */
8447 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
8448 && (tem
= fold_unary_loc (loc
, BIT_NOT_EXPR
, type
,
8449 fold_convert_loc (loc
, type
,
8450 TREE_OPERAND (arg0
, 0)))))
8451 return fold_build2_loc (loc
, BIT_XOR_EXPR
, type
, tem
,
8452 fold_convert_loc (loc
, type
,
8453 TREE_OPERAND (arg0
, 1)));
8454 else if (TREE_CODE (arg0
) == BIT_XOR_EXPR
8455 && (tem
= fold_unary_loc (loc
, BIT_NOT_EXPR
, type
,
8456 fold_convert_loc (loc
, type
,
8457 TREE_OPERAND (arg0
, 1)))))
8458 return fold_build2_loc (loc
, BIT_XOR_EXPR
, type
,
8459 fold_convert_loc (loc
, type
,
8460 TREE_OPERAND (arg0
, 0)), tem
);
8464 case TRUTH_NOT_EXPR
:
8465 /* Note that the operand of this must be an int
8466 and its values must be 0 or 1.
8467 ("true" is a fixed value perhaps depending on the language,
8468 but we don't handle values other than 1 correctly yet.) */
8469 tem
= fold_truth_not_expr (loc
, arg0
);
8472 return fold_convert_loc (loc
, type
, tem
);
8475 /* Fold *&X to X if X is an lvalue. */
8476 if (TREE_CODE (op0
) == ADDR_EXPR
)
8478 tree op00
= TREE_OPERAND (op0
, 0);
8480 || TREE_CODE (op00
) == PARM_DECL
8481 || TREE_CODE (op00
) == RESULT_DECL
)
8482 && !TREE_READONLY (op00
))
8489 } /* switch (code) */
8493 /* If the operation was a conversion do _not_ mark a resulting constant
8494 with TREE_OVERFLOW if the original constant was not. These conversions
8495 have implementation defined behavior and retaining the TREE_OVERFLOW
8496 flag here would confuse later passes such as VRP. */
8498 fold_unary_ignore_overflow_loc (location_t loc
, enum tree_code code
,
8499 tree type
, tree op0
)
8501 tree res
= fold_unary_loc (loc
, code
, type
, op0
);
8503 && TREE_CODE (res
) == INTEGER_CST
8504 && TREE_CODE (op0
) == INTEGER_CST
8505 && CONVERT_EXPR_CODE_P (code
))
8506 TREE_OVERFLOW (res
) = TREE_OVERFLOW (op0
);
8511 /* Fold a binary bitwise/truth expression of code CODE and type TYPE with
8512 operands OP0 and OP1. LOC is the location of the resulting expression.
8513 ARG0 and ARG1 are the NOP_STRIPed results of OP0 and OP1.
8514 Return the folded expression if folding is successful. Otherwise,
8515 return NULL_TREE. */
8517 fold_truth_andor (location_t loc
, enum tree_code code
, tree type
,
8518 tree arg0
, tree arg1
, tree op0
, tree op1
)
8522 /* We only do these simplifications if we are optimizing. */
8526 /* Check for things like (A || B) && (A || C). We can convert this
8527 to A || (B && C). Note that either operator can be any of the four
8528 truth and/or operations and the transformation will still be
8529 valid. Also note that we only care about order for the
8530 ANDIF and ORIF operators. If B contains side effects, this
8531 might change the truth-value of A. */
8532 if (TREE_CODE (arg0
) == TREE_CODE (arg1
)
8533 && (TREE_CODE (arg0
) == TRUTH_ANDIF_EXPR
8534 || TREE_CODE (arg0
) == TRUTH_ORIF_EXPR
8535 || TREE_CODE (arg0
) == TRUTH_AND_EXPR
8536 || TREE_CODE (arg0
) == TRUTH_OR_EXPR
)
8537 && ! TREE_SIDE_EFFECTS (TREE_OPERAND (arg0
, 1)))
8539 tree a00
= TREE_OPERAND (arg0
, 0);
8540 tree a01
= TREE_OPERAND (arg0
, 1);
8541 tree a10
= TREE_OPERAND (arg1
, 0);
8542 tree a11
= TREE_OPERAND (arg1
, 1);
8543 int commutative
= ((TREE_CODE (arg0
) == TRUTH_OR_EXPR
8544 || TREE_CODE (arg0
) == TRUTH_AND_EXPR
)
8545 && (code
== TRUTH_AND_EXPR
8546 || code
== TRUTH_OR_EXPR
));
8548 if (operand_equal_p (a00
, a10
, 0))
8549 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
, a00
,
8550 fold_build2_loc (loc
, code
, type
, a01
, a11
));
8551 else if (commutative
&& operand_equal_p (a00
, a11
, 0))
8552 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
, a00
,
8553 fold_build2_loc (loc
, code
, type
, a01
, a10
));
8554 else if (commutative
&& operand_equal_p (a01
, a10
, 0))
8555 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
, a01
,
8556 fold_build2_loc (loc
, code
, type
, a00
, a11
));
8558 /* This case if tricky because we must either have commutative
8559 operators or else A10 must not have side-effects. */
8561 else if ((commutative
|| ! TREE_SIDE_EFFECTS (a10
))
8562 && operand_equal_p (a01
, a11
, 0))
8563 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
,
8564 fold_build2_loc (loc
, code
, type
, a00
, a10
),
8568 /* See if we can build a range comparison. */
8569 if ((tem
= fold_range_test (loc
, code
, type
, op0
, op1
)) != 0)
8572 if ((code
== TRUTH_ANDIF_EXPR
&& TREE_CODE (arg0
) == TRUTH_ORIF_EXPR
)
8573 || (code
== TRUTH_ORIF_EXPR
&& TREE_CODE (arg0
) == TRUTH_ANDIF_EXPR
))
8575 tem
= merge_truthop_with_opposite_arm (loc
, arg0
, arg1
, true);
8577 return fold_build2_loc (loc
, code
, type
, tem
, arg1
);
8580 if ((code
== TRUTH_ANDIF_EXPR
&& TREE_CODE (arg1
) == TRUTH_ORIF_EXPR
)
8581 || (code
== TRUTH_ORIF_EXPR
&& TREE_CODE (arg1
) == TRUTH_ANDIF_EXPR
))
8583 tem
= merge_truthop_with_opposite_arm (loc
, arg1
, arg0
, false);
8585 return fold_build2_loc (loc
, code
, type
, arg0
, tem
);
8588 /* Check for the possibility of merging component references. If our
8589 lhs is another similar operation, try to merge its rhs with our
8590 rhs. Then try to merge our lhs and rhs. */
8591 if (TREE_CODE (arg0
) == code
8592 && (tem
= fold_truth_andor_1 (loc
, code
, type
,
8593 TREE_OPERAND (arg0
, 1), arg1
)) != 0)
8594 return fold_build2_loc (loc
, code
, type
, TREE_OPERAND (arg0
, 0), tem
);
8596 if ((tem
= fold_truth_andor_1 (loc
, code
, type
, arg0
, arg1
)) != 0)
8599 bool logical_op_non_short_circuit
= LOGICAL_OP_NON_SHORT_CIRCUIT
;
8600 if (PARAM_VALUE (PARAM_LOGICAL_OP_NON_SHORT_CIRCUIT
) != -1)
8601 logical_op_non_short_circuit
8602 = PARAM_VALUE (PARAM_LOGICAL_OP_NON_SHORT_CIRCUIT
);
8603 if (logical_op_non_short_circuit
8604 && !flag_sanitize_coverage
8605 && (code
== TRUTH_AND_EXPR
8606 || code
== TRUTH_ANDIF_EXPR
8607 || code
== TRUTH_OR_EXPR
8608 || code
== TRUTH_ORIF_EXPR
))
8610 enum tree_code ncode
, icode
;
8612 ncode
= (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_AND_EXPR
)
8613 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
;
8614 icode
= ncode
== TRUTH_AND_EXPR
? TRUTH_ANDIF_EXPR
: TRUTH_ORIF_EXPR
;
8616 /* Transform ((A AND-IF B) AND[-IF] C) into (A AND-IF (B AND C)),
8617 or ((A OR-IF B) OR[-IF] C) into (A OR-IF (B OR C))
8618 We don't want to pack more than two leafs to a non-IF AND/OR
8620 If tree-code of left-hand operand isn't an AND/OR-IF code and not
8621 equal to IF-CODE, then we don't want to add right-hand operand.
8622 If the inner right-hand side of left-hand operand has
8623 side-effects, or isn't simple, then we can't add to it,
8624 as otherwise we might destroy if-sequence. */
8625 if (TREE_CODE (arg0
) == icode
8626 && simple_operand_p_2 (arg1
)
8627 /* Needed for sequence points to handle trappings, and
8629 && simple_operand_p_2 (TREE_OPERAND (arg0
, 1)))
8631 tem
= fold_build2_loc (loc
, ncode
, type
, TREE_OPERAND (arg0
, 1),
8633 return fold_build2_loc (loc
, icode
, type
, TREE_OPERAND (arg0
, 0),
8636 /* Same as above but for (A AND[-IF] (B AND-IF C)) -> ((A AND B) AND-IF C),
8637 or (A OR[-IF] (B OR-IF C) -> ((A OR B) OR-IF C). */
8638 else if (TREE_CODE (arg1
) == icode
8639 && simple_operand_p_2 (arg0
)
8640 /* Needed for sequence points to handle trappings, and
8642 && simple_operand_p_2 (TREE_OPERAND (arg1
, 0)))
8644 tem
= fold_build2_loc (loc
, ncode
, type
,
8645 arg0
, TREE_OPERAND (arg1
, 0));
8646 return fold_build2_loc (loc
, icode
, type
, tem
,
8647 TREE_OPERAND (arg1
, 1));
8649 /* Transform (A AND-IF B) into (A AND B), or (A OR-IF B)
8651 For sequence point consistancy, we need to check for trapping,
8652 and side-effects. */
8653 else if (code
== icode
&& simple_operand_p_2 (arg0
)
8654 && simple_operand_p_2 (arg1
))
8655 return fold_build2_loc (loc
, ncode
, type
, arg0
, arg1
);
8661 /* Helper that tries to canonicalize the comparison ARG0 CODE ARG1
8662 by changing CODE to reduce the magnitude of constants involved in
8663 ARG0 of the comparison.
8664 Returns a canonicalized comparison tree if a simplification was
8665 possible, otherwise returns NULL_TREE.
8666 Set *STRICT_OVERFLOW_P to true if the canonicalization is only
8667 valid if signed overflow is undefined. */
8670 maybe_canonicalize_comparison_1 (location_t loc
, enum tree_code code
, tree type
,
8671 tree arg0
, tree arg1
,
8672 bool *strict_overflow_p
)
8674 enum tree_code code0
= TREE_CODE (arg0
);
8675 tree t
, cst0
= NULL_TREE
;
8678 /* Match A +- CST code arg1. We can change this only if overflow
8680 if (!((ANY_INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
8681 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
)))
8682 /* In principle pointers also have undefined overflow behavior,
8683 but that causes problems elsewhere. */
8684 && !POINTER_TYPE_P (TREE_TYPE (arg0
))
8685 && (code0
== MINUS_EXPR
8686 || code0
== PLUS_EXPR
)
8687 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
))
8690 /* Identify the constant in arg0 and its sign. */
8691 cst0
= TREE_OPERAND (arg0
, 1);
8692 sgn0
= tree_int_cst_sgn (cst0
);
8694 /* Overflowed constants and zero will cause problems. */
8695 if (integer_zerop (cst0
)
8696 || TREE_OVERFLOW (cst0
))
8699 /* See if we can reduce the magnitude of the constant in
8700 arg0 by changing the comparison code. */
8701 /* A - CST < arg1 -> A - CST-1 <= arg1. */
8703 && code0
== ((sgn0
== -1) ? PLUS_EXPR
: MINUS_EXPR
))
8705 /* A + CST > arg1 -> A + CST-1 >= arg1. */
8706 else if (code
== GT_EXPR
8707 && code0
== ((sgn0
== -1) ? MINUS_EXPR
: PLUS_EXPR
))
8709 /* A + CST <= arg1 -> A + CST-1 < arg1. */
8710 else if (code
== LE_EXPR
8711 && code0
== ((sgn0
== -1) ? MINUS_EXPR
: PLUS_EXPR
))
8713 /* A - CST >= arg1 -> A - CST-1 > arg1. */
8714 else if (code
== GE_EXPR
8715 && code0
== ((sgn0
== -1) ? PLUS_EXPR
: MINUS_EXPR
))
8719 *strict_overflow_p
= true;
8721 /* Now build the constant reduced in magnitude. But not if that
8722 would produce one outside of its types range. */
8723 if (INTEGRAL_TYPE_P (TREE_TYPE (cst0
))
8725 && TYPE_MIN_VALUE (TREE_TYPE (cst0
))
8726 && tree_int_cst_equal (cst0
, TYPE_MIN_VALUE (TREE_TYPE (cst0
))))
8728 && TYPE_MAX_VALUE (TREE_TYPE (cst0
))
8729 && tree_int_cst_equal (cst0
, TYPE_MAX_VALUE (TREE_TYPE (cst0
))))))
8732 t
= int_const_binop (sgn0
== -1 ? PLUS_EXPR
: MINUS_EXPR
,
8733 cst0
, build_int_cst (TREE_TYPE (cst0
), 1));
8734 t
= fold_build2_loc (loc
, code0
, TREE_TYPE (arg0
), TREE_OPERAND (arg0
, 0), t
);
8735 t
= fold_convert (TREE_TYPE (arg1
), t
);
8737 return fold_build2_loc (loc
, code
, type
, t
, arg1
);
8740 /* Canonicalize the comparison ARG0 CODE ARG1 with type TYPE with undefined
8741 overflow further. Try to decrease the magnitude of constants involved
8742 by changing LE_EXPR and GE_EXPR to LT_EXPR and GT_EXPR or vice versa
8743 and put sole constants at the second argument position.
8744 Returns the canonicalized tree if changed, otherwise NULL_TREE. */
8747 maybe_canonicalize_comparison (location_t loc
, enum tree_code code
, tree type
,
8748 tree arg0
, tree arg1
)
8751 bool strict_overflow_p
;
8752 const char * const warnmsg
= G_("assuming signed overflow does not occur "
8753 "when reducing constant in comparison");
8755 /* Try canonicalization by simplifying arg0. */
8756 strict_overflow_p
= false;
8757 t
= maybe_canonicalize_comparison_1 (loc
, code
, type
, arg0
, arg1
,
8758 &strict_overflow_p
);
8761 if (strict_overflow_p
)
8762 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_MAGNITUDE
);
8766 /* Try canonicalization by simplifying arg1 using the swapped
8768 code
= swap_tree_comparison (code
);
8769 strict_overflow_p
= false;
8770 t
= maybe_canonicalize_comparison_1 (loc
, code
, type
, arg1
, arg0
,
8771 &strict_overflow_p
);
8772 if (t
&& strict_overflow_p
)
8773 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_MAGNITUDE
);
8777 /* Return whether BASE + OFFSET + BITPOS may wrap around the address
8778 space. This is used to avoid issuing overflow warnings for
8779 expressions like &p->x which cannot wrap. */
8782 pointer_may_wrap_p (tree base
, tree offset
, poly_int64 bitpos
)
8784 if (!POINTER_TYPE_P (TREE_TYPE (base
)))
8787 if (maybe_lt (bitpos
, 0))
8790 poly_wide_int wi_offset
;
8791 int precision
= TYPE_PRECISION (TREE_TYPE (base
));
8792 if (offset
== NULL_TREE
)
8793 wi_offset
= wi::zero (precision
);
8794 else if (!poly_int_tree_p (offset
) || TREE_OVERFLOW (offset
))
8797 wi_offset
= wi::to_poly_wide (offset
);
8799 wi::overflow_type overflow
;
8800 poly_wide_int units
= wi::shwi (bits_to_bytes_round_down (bitpos
),
8802 poly_wide_int total
= wi::add (wi_offset
, units
, UNSIGNED
, &overflow
);
8806 poly_uint64 total_hwi
, size
;
8807 if (!total
.to_uhwi (&total_hwi
)
8808 || !poly_int_tree_p (TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (base
))),
8810 || known_eq (size
, 0U))
8813 if (known_le (total_hwi
, size
))
8816 /* We can do slightly better for SIZE if we have an ADDR_EXPR of an
8818 if (TREE_CODE (base
) == ADDR_EXPR
8819 && poly_int_tree_p (TYPE_SIZE_UNIT (TREE_TYPE (TREE_OPERAND (base
, 0))),
8821 && maybe_ne (size
, 0U)
8822 && known_le (total_hwi
, size
))
8828 /* Return a positive integer when the symbol DECL is known to have
8829 a nonzero address, zero when it's known not to (e.g., it's a weak
8830 symbol), and a negative integer when the symbol is not yet in the
8831 symbol table and so whether or not its address is zero is unknown.
8832 For function local objects always return positive integer. */
8834 maybe_nonzero_address (tree decl
)
8836 if (DECL_P (decl
) && decl_in_symtab_p (decl
))
8837 if (struct symtab_node
*symbol
= symtab_node::get_create (decl
))
8838 return symbol
->nonzero_address ();
8840 /* Function local objects are never NULL. */
8842 && (DECL_CONTEXT (decl
)
8843 && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
8844 && auto_var_in_fn_p (decl
, DECL_CONTEXT (decl
))))
8850 /* Subroutine of fold_binary. This routine performs all of the
8851 transformations that are common to the equality/inequality
8852 operators (EQ_EXPR and NE_EXPR) and the ordering operators
8853 (LT_EXPR, LE_EXPR, GE_EXPR and GT_EXPR). Callers other than
8854 fold_binary should call fold_binary. Fold a comparison with
8855 tree code CODE and type TYPE with operands OP0 and OP1. Return
8856 the folded comparison or NULL_TREE. */
8859 fold_comparison (location_t loc
, enum tree_code code
, tree type
,
8862 const bool equality_code
= (code
== EQ_EXPR
|| code
== NE_EXPR
);
8863 tree arg0
, arg1
, tem
;
8868 STRIP_SIGN_NOPS (arg0
);
8869 STRIP_SIGN_NOPS (arg1
);
8871 /* For comparisons of pointers we can decompose it to a compile time
8872 comparison of the base objects and the offsets into the object.
8873 This requires at least one operand being an ADDR_EXPR or a
8874 POINTER_PLUS_EXPR to do more than the operand_equal_p test below. */
8875 if (POINTER_TYPE_P (TREE_TYPE (arg0
))
8876 && (TREE_CODE (arg0
) == ADDR_EXPR
8877 || TREE_CODE (arg1
) == ADDR_EXPR
8878 || TREE_CODE (arg0
) == POINTER_PLUS_EXPR
8879 || TREE_CODE (arg1
) == POINTER_PLUS_EXPR
))
8881 tree base0
, base1
, offset0
= NULL_TREE
, offset1
= NULL_TREE
;
8882 poly_int64 bitsize
, bitpos0
= 0, bitpos1
= 0;
8884 int volatilep
, reversep
, unsignedp
;
8885 bool indirect_base0
= false, indirect_base1
= false;
8887 /* Get base and offset for the access. Strip ADDR_EXPR for
8888 get_inner_reference, but put it back by stripping INDIRECT_REF
8889 off the base object if possible. indirect_baseN will be true
8890 if baseN is not an address but refers to the object itself. */
8892 if (TREE_CODE (arg0
) == ADDR_EXPR
)
8895 = get_inner_reference (TREE_OPERAND (arg0
, 0),
8896 &bitsize
, &bitpos0
, &offset0
, &mode
,
8897 &unsignedp
, &reversep
, &volatilep
);
8898 if (TREE_CODE (base0
) == INDIRECT_REF
)
8899 base0
= TREE_OPERAND (base0
, 0);
8901 indirect_base0
= true;
8903 else if (TREE_CODE (arg0
) == POINTER_PLUS_EXPR
)
8905 base0
= TREE_OPERAND (arg0
, 0);
8906 STRIP_SIGN_NOPS (base0
);
8907 if (TREE_CODE (base0
) == ADDR_EXPR
)
8910 = get_inner_reference (TREE_OPERAND (base0
, 0),
8911 &bitsize
, &bitpos0
, &offset0
, &mode
,
8912 &unsignedp
, &reversep
, &volatilep
);
8913 if (TREE_CODE (base0
) == INDIRECT_REF
)
8914 base0
= TREE_OPERAND (base0
, 0);
8916 indirect_base0
= true;
8918 if (offset0
== NULL_TREE
|| integer_zerop (offset0
))
8919 offset0
= TREE_OPERAND (arg0
, 1);
8921 offset0
= size_binop (PLUS_EXPR
, offset0
,
8922 TREE_OPERAND (arg0
, 1));
8923 if (poly_int_tree_p (offset0
))
8925 poly_offset_int tem
= wi::sext (wi::to_poly_offset (offset0
),
8926 TYPE_PRECISION (sizetype
));
8927 tem
<<= LOG2_BITS_PER_UNIT
;
8929 if (tem
.to_shwi (&bitpos0
))
8930 offset0
= NULL_TREE
;
8935 if (TREE_CODE (arg1
) == ADDR_EXPR
)
8938 = get_inner_reference (TREE_OPERAND (arg1
, 0),
8939 &bitsize
, &bitpos1
, &offset1
, &mode
,
8940 &unsignedp
, &reversep
, &volatilep
);
8941 if (TREE_CODE (base1
) == INDIRECT_REF
)
8942 base1
= TREE_OPERAND (base1
, 0);
8944 indirect_base1
= true;
8946 else if (TREE_CODE (arg1
) == POINTER_PLUS_EXPR
)
8948 base1
= TREE_OPERAND (arg1
, 0);
8949 STRIP_SIGN_NOPS (base1
);
8950 if (TREE_CODE (base1
) == ADDR_EXPR
)
8953 = get_inner_reference (TREE_OPERAND (base1
, 0),
8954 &bitsize
, &bitpos1
, &offset1
, &mode
,
8955 &unsignedp
, &reversep
, &volatilep
);
8956 if (TREE_CODE (base1
) == INDIRECT_REF
)
8957 base1
= TREE_OPERAND (base1
, 0);
8959 indirect_base1
= true;
8961 if (offset1
== NULL_TREE
|| integer_zerop (offset1
))
8962 offset1
= TREE_OPERAND (arg1
, 1);
8964 offset1
= size_binop (PLUS_EXPR
, offset1
,
8965 TREE_OPERAND (arg1
, 1));
8966 if (poly_int_tree_p (offset1
))
8968 poly_offset_int tem
= wi::sext (wi::to_poly_offset (offset1
),
8969 TYPE_PRECISION (sizetype
));
8970 tem
<<= LOG2_BITS_PER_UNIT
;
8972 if (tem
.to_shwi (&bitpos1
))
8973 offset1
= NULL_TREE
;
8977 /* If we have equivalent bases we might be able to simplify. */
8978 if (indirect_base0
== indirect_base1
8979 && operand_equal_p (base0
, base1
,
8980 indirect_base0
? OEP_ADDRESS_OF
: 0))
8982 /* We can fold this expression to a constant if the non-constant
8983 offset parts are equal. */
8984 if ((offset0
== offset1
8985 || (offset0
&& offset1
8986 && operand_equal_p (offset0
, offset1
, 0)))
8989 && (DECL_P (base0
) || CONSTANT_CLASS_P (base0
)))
8990 || TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
))))
8993 && maybe_ne (bitpos0
, bitpos1
)
8994 && (pointer_may_wrap_p (base0
, offset0
, bitpos0
)
8995 || pointer_may_wrap_p (base1
, offset1
, bitpos1
)))
8996 fold_overflow_warning (("assuming pointer wraparound does not "
8997 "occur when comparing P +- C1 with "
8999 WARN_STRICT_OVERFLOW_CONDITIONAL
);
9004 if (known_eq (bitpos0
, bitpos1
))
9005 return constant_boolean_node (true, type
);
9006 if (known_ne (bitpos0
, bitpos1
))
9007 return constant_boolean_node (false, type
);
9010 if (known_ne (bitpos0
, bitpos1
))
9011 return constant_boolean_node (true, type
);
9012 if (known_eq (bitpos0
, bitpos1
))
9013 return constant_boolean_node (false, type
);
9016 if (known_lt (bitpos0
, bitpos1
))
9017 return constant_boolean_node (true, type
);
9018 if (known_ge (bitpos0
, bitpos1
))
9019 return constant_boolean_node (false, type
);
9022 if (known_le (bitpos0
, bitpos1
))
9023 return constant_boolean_node (true, type
);
9024 if (known_gt (bitpos0
, bitpos1
))
9025 return constant_boolean_node (false, type
);
9028 if (known_ge (bitpos0
, bitpos1
))
9029 return constant_boolean_node (true, type
);
9030 if (known_lt (bitpos0
, bitpos1
))
9031 return constant_boolean_node (false, type
);
9034 if (known_gt (bitpos0
, bitpos1
))
9035 return constant_boolean_node (true, type
);
9036 if (known_le (bitpos0
, bitpos1
))
9037 return constant_boolean_node (false, type
);
9042 /* We can simplify the comparison to a comparison of the variable
9043 offset parts if the constant offset parts are equal.
9044 Be careful to use signed sizetype here because otherwise we
9045 mess with array offsets in the wrong way. This is possible
9046 because pointer arithmetic is restricted to retain within an
9047 object and overflow on pointer differences is undefined as of
9048 6.5.6/8 and /9 with respect to the signed ptrdiff_t. */
9049 else if (known_eq (bitpos0
, bitpos1
)
9052 && (DECL_P (base0
) || CONSTANT_CLASS_P (base0
)))
9053 || TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
))))
9055 /* By converting to signed sizetype we cover middle-end pointer
9056 arithmetic which operates on unsigned pointer types of size
9057 type size and ARRAY_REF offsets which are properly sign or
9058 zero extended from their type in case it is narrower than
9060 if (offset0
== NULL_TREE
)
9061 offset0
= build_int_cst (ssizetype
, 0);
9063 offset0
= fold_convert_loc (loc
, ssizetype
, offset0
);
9064 if (offset1
== NULL_TREE
)
9065 offset1
= build_int_cst (ssizetype
, 0);
9067 offset1
= fold_convert_loc (loc
, ssizetype
, offset1
);
9070 && (pointer_may_wrap_p (base0
, offset0
, bitpos0
)
9071 || pointer_may_wrap_p (base1
, offset1
, bitpos1
)))
9072 fold_overflow_warning (("assuming pointer wraparound does not "
9073 "occur when comparing P +- C1 with "
9075 WARN_STRICT_OVERFLOW_COMPARISON
);
9077 return fold_build2_loc (loc
, code
, type
, offset0
, offset1
);
9080 /* For equal offsets we can simplify to a comparison of the
9082 else if (known_eq (bitpos0
, bitpos1
)
9084 ? base0
!= TREE_OPERAND (arg0
, 0) : base0
!= arg0
)
9086 ? base1
!= TREE_OPERAND (arg1
, 0) : base1
!= arg1
)
9087 && ((offset0
== offset1
)
9088 || (offset0
&& offset1
9089 && operand_equal_p (offset0
, offset1
, 0))))
9092 base0
= build_fold_addr_expr_loc (loc
, base0
);
9094 base1
= build_fold_addr_expr_loc (loc
, base1
);
9095 return fold_build2_loc (loc
, code
, type
, base0
, base1
);
9097 /* Comparison between an ordinary (non-weak) symbol and a null
9098 pointer can be eliminated since such symbols must have a non
9099 null address. In C, relational expressions between pointers
9100 to objects and null pointers are undefined. The results
9101 below follow the C++ rules with the additional property that
9102 every object pointer compares greater than a null pointer.
9104 else if (((DECL_P (base0
)
9105 && maybe_nonzero_address (base0
) > 0
9106 /* Avoid folding references to struct members at offset 0 to
9107 prevent tests like '&ptr->firstmember == 0' from getting
9108 eliminated. When ptr is null, although the -> expression
9109 is strictly speaking invalid, GCC retains it as a matter
9110 of QoI. See PR c/44555. */
9111 && (offset0
== NULL_TREE
&& known_ne (bitpos0
, 0)))
9112 || CONSTANT_CLASS_P (base0
))
9114 /* The caller guarantees that when one of the arguments is
9115 constant (i.e., null in this case) it is second. */
9116 && integer_zerop (arg1
))
9123 return constant_boolean_node (false, type
);
9127 return constant_boolean_node (true, type
);
9134 /* Transform comparisons of the form X +- C1 CMP Y +- C2 to
9135 X CMP Y +- C2 +- C1 for signed X, Y. This is valid if
9136 the resulting offset is smaller in absolute value than the
9137 original one and has the same sign. */
9138 if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
9139 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
))
9140 && (TREE_CODE (arg0
) == PLUS_EXPR
|| TREE_CODE (arg0
) == MINUS_EXPR
)
9141 && (TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
9142 && !TREE_OVERFLOW (TREE_OPERAND (arg0
, 1)))
9143 && (TREE_CODE (arg1
) == PLUS_EXPR
|| TREE_CODE (arg1
) == MINUS_EXPR
)
9144 && (TREE_CODE (TREE_OPERAND (arg1
, 1)) == INTEGER_CST
9145 && !TREE_OVERFLOW (TREE_OPERAND (arg1
, 1))))
9147 tree const1
= TREE_OPERAND (arg0
, 1);
9148 tree const2
= TREE_OPERAND (arg1
, 1);
9149 tree variable1
= TREE_OPERAND (arg0
, 0);
9150 tree variable2
= TREE_OPERAND (arg1
, 0);
9152 const char * const warnmsg
= G_("assuming signed overflow does not "
9153 "occur when combining constants around "
9156 /* Put the constant on the side where it doesn't overflow and is
9157 of lower absolute value and of same sign than before. */
9158 cst
= int_const_binop (TREE_CODE (arg0
) == TREE_CODE (arg1
)
9159 ? MINUS_EXPR
: PLUS_EXPR
,
9161 if (!TREE_OVERFLOW (cst
)
9162 && tree_int_cst_compare (const2
, cst
) == tree_int_cst_sgn (const2
)
9163 && tree_int_cst_sgn (cst
) == tree_int_cst_sgn (const2
))
9165 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_COMPARISON
);
9166 return fold_build2_loc (loc
, code
, type
,
9168 fold_build2_loc (loc
, TREE_CODE (arg1
),
9173 cst
= int_const_binop (TREE_CODE (arg0
) == TREE_CODE (arg1
)
9174 ? MINUS_EXPR
: PLUS_EXPR
,
9176 if (!TREE_OVERFLOW (cst
)
9177 && tree_int_cst_compare (const1
, cst
) == tree_int_cst_sgn (const1
)
9178 && tree_int_cst_sgn (cst
) == tree_int_cst_sgn (const1
))
9180 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_COMPARISON
);
9181 return fold_build2_loc (loc
, code
, type
,
9182 fold_build2_loc (loc
, TREE_CODE (arg0
),
9189 tem
= maybe_canonicalize_comparison (loc
, code
, type
, arg0
, arg1
);
9193 /* If we are comparing an expression that just has comparisons
9194 of two integer values, arithmetic expressions of those comparisons,
9195 and constants, we can simplify it. There are only three cases
9196 to check: the two values can either be equal, the first can be
9197 greater, or the second can be greater. Fold the expression for
9198 those three values. Since each value must be 0 or 1, we have
9199 eight possibilities, each of which corresponds to the constant 0
9200 or 1 or one of the six possible comparisons.
9202 This handles common cases like (a > b) == 0 but also handles
9203 expressions like ((x > y) - (y > x)) > 0, which supposedly
9204 occur in macroized code. */
9206 if (TREE_CODE (arg1
) == INTEGER_CST
&& TREE_CODE (arg0
) != INTEGER_CST
)
9208 tree cval1
= 0, cval2
= 0;
9210 if (twoval_comparison_p (arg0
, &cval1
, &cval2
)
9211 /* Don't handle degenerate cases here; they should already
9212 have been handled anyway. */
9213 && cval1
!= 0 && cval2
!= 0
9214 && ! (TREE_CONSTANT (cval1
) && TREE_CONSTANT (cval2
))
9215 && TREE_TYPE (cval1
) == TREE_TYPE (cval2
)
9216 && INTEGRAL_TYPE_P (TREE_TYPE (cval1
))
9217 && TYPE_MAX_VALUE (TREE_TYPE (cval1
))
9218 && TYPE_MAX_VALUE (TREE_TYPE (cval2
))
9219 && ! operand_equal_p (TYPE_MIN_VALUE (TREE_TYPE (cval1
)),
9220 TYPE_MAX_VALUE (TREE_TYPE (cval2
)), 0))
9222 tree maxval
= TYPE_MAX_VALUE (TREE_TYPE (cval1
));
9223 tree minval
= TYPE_MIN_VALUE (TREE_TYPE (cval1
));
9225 /* We can't just pass T to eval_subst in case cval1 or cval2
9226 was the same as ARG1. */
9229 = fold_build2_loc (loc
, code
, type
,
9230 eval_subst (loc
, arg0
, cval1
, maxval
,
9234 = fold_build2_loc (loc
, code
, type
,
9235 eval_subst (loc
, arg0
, cval1
, maxval
,
9239 = fold_build2_loc (loc
, code
, type
,
9240 eval_subst (loc
, arg0
, cval1
, minval
,
9244 /* All three of these results should be 0 or 1. Confirm they are.
9245 Then use those values to select the proper code to use. */
9247 if (TREE_CODE (high_result
) == INTEGER_CST
9248 && TREE_CODE (equal_result
) == INTEGER_CST
9249 && TREE_CODE (low_result
) == INTEGER_CST
)
9251 /* Make a 3-bit mask with the high-order bit being the
9252 value for `>', the next for '=', and the low for '<'. */
9253 switch ((integer_onep (high_result
) * 4)
9254 + (integer_onep (equal_result
) * 2)
9255 + integer_onep (low_result
))
9259 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
9280 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
9283 return fold_build2_loc (loc
, code
, type
, cval1
, cval2
);
9292 /* Subroutine of fold_binary. Optimize complex multiplications of the
9293 form z * conj(z), as pow(realpart(z),2) + pow(imagpart(z),2). The
9294 argument EXPR represents the expression "z" of type TYPE. */
9297 fold_mult_zconjz (location_t loc
, tree type
, tree expr
)
9299 tree itype
= TREE_TYPE (type
);
9300 tree rpart
, ipart
, tem
;
9302 if (TREE_CODE (expr
) == COMPLEX_EXPR
)
9304 rpart
= TREE_OPERAND (expr
, 0);
9305 ipart
= TREE_OPERAND (expr
, 1);
9307 else if (TREE_CODE (expr
) == COMPLEX_CST
)
9309 rpart
= TREE_REALPART (expr
);
9310 ipart
= TREE_IMAGPART (expr
);
9314 expr
= save_expr (expr
);
9315 rpart
= fold_build1_loc (loc
, REALPART_EXPR
, itype
, expr
);
9316 ipart
= fold_build1_loc (loc
, IMAGPART_EXPR
, itype
, expr
);
9319 rpart
= save_expr (rpart
);
9320 ipart
= save_expr (ipart
);
9321 tem
= fold_build2_loc (loc
, PLUS_EXPR
, itype
,
9322 fold_build2_loc (loc
, MULT_EXPR
, itype
, rpart
, rpart
),
9323 fold_build2_loc (loc
, MULT_EXPR
, itype
, ipart
, ipart
));
9324 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, tem
,
9325 build_zero_cst (itype
));
9329 /* Helper function for fold_vec_perm. Store elements of VECTOR_CST or
9330 CONSTRUCTOR ARG into array ELTS, which has NELTS elements, and return
9331 true if successful. */
9334 vec_cst_ctor_to_array (tree arg
, unsigned int nelts
, tree
*elts
)
9336 unsigned HOST_WIDE_INT i
, nunits
;
9338 if (TREE_CODE (arg
) == VECTOR_CST
9339 && VECTOR_CST_NELTS (arg
).is_constant (&nunits
))
9341 for (i
= 0; i
< nunits
; ++i
)
9342 elts
[i
] = VECTOR_CST_ELT (arg
, i
);
9344 else if (TREE_CODE (arg
) == CONSTRUCTOR
)
9346 constructor_elt
*elt
;
9348 FOR_EACH_VEC_SAFE_ELT (CONSTRUCTOR_ELTS (arg
), i
, elt
)
9349 if (i
>= nelts
|| TREE_CODE (TREE_TYPE (elt
->value
)) == VECTOR_TYPE
)
9352 elts
[i
] = elt
->value
;
9356 for (; i
< nelts
; i
++)
9358 = fold_convert (TREE_TYPE (TREE_TYPE (arg
)), integer_zero_node
);
9362 /* Attempt to fold vector permutation of ARG0 and ARG1 vectors using SEL
9363 selector. Return the folded VECTOR_CST or CONSTRUCTOR if successful,
9364 NULL_TREE otherwise. */
9367 fold_vec_perm (tree type
, tree arg0
, tree arg1
, const vec_perm_indices
&sel
)
9370 unsigned HOST_WIDE_INT nelts
;
9371 bool need_ctor
= false;
9373 if (!sel
.length ().is_constant (&nelts
))
9375 gcc_assert (known_eq (TYPE_VECTOR_SUBPARTS (type
), nelts
)
9376 && known_eq (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0
)), nelts
)
9377 && known_eq (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg1
)), nelts
));
9378 if (TREE_TYPE (TREE_TYPE (arg0
)) != TREE_TYPE (type
)
9379 || TREE_TYPE (TREE_TYPE (arg1
)) != TREE_TYPE (type
))
9382 tree
*in_elts
= XALLOCAVEC (tree
, nelts
* 2);
9383 if (!vec_cst_ctor_to_array (arg0
, nelts
, in_elts
)
9384 || !vec_cst_ctor_to_array (arg1
, nelts
, in_elts
+ nelts
))
9387 tree_vector_builder
out_elts (type
, nelts
, 1);
9388 for (i
= 0; i
< nelts
; i
++)
9390 HOST_WIDE_INT index
;
9391 if (!sel
[i
].is_constant (&index
))
9393 if (!CONSTANT_CLASS_P (in_elts
[index
]))
9395 out_elts
.quick_push (unshare_expr (in_elts
[index
]));
9400 vec
<constructor_elt
, va_gc
> *v
;
9401 vec_alloc (v
, nelts
);
9402 for (i
= 0; i
< nelts
; i
++)
9403 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, out_elts
[i
]);
9404 return build_constructor (type
, v
);
9407 return out_elts
.build ();
9410 /* Try to fold a pointer difference of type TYPE two address expressions of
9411 array references AREF0 and AREF1 using location LOC. Return a
9412 simplified expression for the difference or NULL_TREE. */
9415 fold_addr_of_array_ref_difference (location_t loc
, tree type
,
9416 tree aref0
, tree aref1
,
9417 bool use_pointer_diff
)
9419 tree base0
= TREE_OPERAND (aref0
, 0);
9420 tree base1
= TREE_OPERAND (aref1
, 0);
9421 tree base_offset
= build_int_cst (type
, 0);
9423 /* If the bases are array references as well, recurse. If the bases
9424 are pointer indirections compute the difference of the pointers.
9425 If the bases are equal, we are set. */
9426 if ((TREE_CODE (base0
) == ARRAY_REF
9427 && TREE_CODE (base1
) == ARRAY_REF
9429 = fold_addr_of_array_ref_difference (loc
, type
, base0
, base1
,
9431 || (INDIRECT_REF_P (base0
)
9432 && INDIRECT_REF_P (base1
)
9435 ? fold_binary_loc (loc
, POINTER_DIFF_EXPR
, type
,
9436 TREE_OPERAND (base0
, 0),
9437 TREE_OPERAND (base1
, 0))
9438 : fold_binary_loc (loc
, MINUS_EXPR
, type
,
9440 TREE_OPERAND (base0
, 0)),
9442 TREE_OPERAND (base1
, 0)))))
9443 || operand_equal_p (base0
, base1
, OEP_ADDRESS_OF
))
9445 tree op0
= fold_convert_loc (loc
, type
, TREE_OPERAND (aref0
, 1));
9446 tree op1
= fold_convert_loc (loc
, type
, TREE_OPERAND (aref1
, 1));
9447 tree esz
= fold_convert_loc (loc
, type
, array_ref_element_size (aref0
));
9448 tree diff
= fold_build2_loc (loc
, MINUS_EXPR
, type
, op0
, op1
);
9449 return fold_build2_loc (loc
, PLUS_EXPR
, type
,
9451 fold_build2_loc (loc
, MULT_EXPR
, type
,
9457 /* If the real or vector real constant CST of type TYPE has an exact
9458 inverse, return it, else return NULL. */
9461 exact_inverse (tree type
, tree cst
)
9467 switch (TREE_CODE (cst
))
9470 r
= TREE_REAL_CST (cst
);
9472 if (exact_real_inverse (TYPE_MODE (type
), &r
))
9473 return build_real (type
, r
);
9479 unit_type
= TREE_TYPE (type
);
9480 mode
= TYPE_MODE (unit_type
);
9482 tree_vector_builder elts
;
9483 if (!elts
.new_unary_operation (type
, cst
, false))
9485 unsigned int count
= elts
.encoded_nelts ();
9486 for (unsigned int i
= 0; i
< count
; ++i
)
9488 r
= TREE_REAL_CST (VECTOR_CST_ELT (cst
, i
));
9489 if (!exact_real_inverse (mode
, &r
))
9491 elts
.quick_push (build_real (unit_type
, r
));
9494 return elts
.build ();
9502 /* Mask out the tz least significant bits of X of type TYPE where
9503 tz is the number of trailing zeroes in Y. */
9505 mask_with_tz (tree type
, const wide_int
&x
, const wide_int
&y
)
9507 int tz
= wi::ctz (y
);
9509 return wi::mask (tz
, true, TYPE_PRECISION (type
)) & x
;
9513 /* Return true when T is an address and is known to be nonzero.
9514 For floating point we further ensure that T is not denormal.
9515 Similar logic is present in nonzero_address in rtlanal.h.
9517 If the return value is based on the assumption that signed overflow
9518 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
9519 change *STRICT_OVERFLOW_P. */
9522 tree_expr_nonzero_warnv_p (tree t
, bool *strict_overflow_p
)
9524 tree type
= TREE_TYPE (t
);
9525 enum tree_code code
;
9527 /* Doing something useful for floating point would need more work. */
9528 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
9531 code
= TREE_CODE (t
);
9532 switch (TREE_CODE_CLASS (code
))
9535 return tree_unary_nonzero_warnv_p (code
, type
, TREE_OPERAND (t
, 0),
9538 case tcc_comparison
:
9539 return tree_binary_nonzero_warnv_p (code
, type
,
9540 TREE_OPERAND (t
, 0),
9541 TREE_OPERAND (t
, 1),
9544 case tcc_declaration
:
9546 return tree_single_nonzero_warnv_p (t
, strict_overflow_p
);
9554 case TRUTH_NOT_EXPR
:
9555 return tree_unary_nonzero_warnv_p (code
, type
, TREE_OPERAND (t
, 0),
9558 case TRUTH_AND_EXPR
:
9560 case TRUTH_XOR_EXPR
:
9561 return tree_binary_nonzero_warnv_p (code
, type
,
9562 TREE_OPERAND (t
, 0),
9563 TREE_OPERAND (t
, 1),
9571 case WITH_SIZE_EXPR
:
9573 return tree_single_nonzero_warnv_p (t
, strict_overflow_p
);
9578 return tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 1),
9582 return tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 0),
9587 tree fndecl
= get_callee_fndecl (t
);
9588 if (!fndecl
) return false;
9589 if (flag_delete_null_pointer_checks
&& !flag_check_new
9590 && DECL_IS_OPERATOR_NEW_P (fndecl
)
9591 && !TREE_NOTHROW (fndecl
))
9593 if (flag_delete_null_pointer_checks
9594 && lookup_attribute ("returns_nonnull",
9595 TYPE_ATTRIBUTES (TREE_TYPE (fndecl
))))
9597 return alloca_call_p (t
);
9606 /* Return true when T is an address and is known to be nonzero.
9607 Handle warnings about undefined signed overflow. */
9610 tree_expr_nonzero_p (tree t
)
9612 bool ret
, strict_overflow_p
;
9614 strict_overflow_p
= false;
9615 ret
= tree_expr_nonzero_warnv_p (t
, &strict_overflow_p
);
9616 if (strict_overflow_p
)
9617 fold_overflow_warning (("assuming signed overflow does not occur when "
9618 "determining that expression is always "
9620 WARN_STRICT_OVERFLOW_MISC
);
9624 /* Return true if T is known not to be equal to an integer W. */
9627 expr_not_equal_to (tree t
, const wide_int
&w
)
9629 wide_int min
, max
, nz
;
9630 value_range_kind rtype
;
9631 switch (TREE_CODE (t
))
9634 return wi::to_wide (t
) != w
;
9637 if (!INTEGRAL_TYPE_P (TREE_TYPE (t
)))
9639 rtype
= get_range_info (t
, &min
, &max
);
9640 if (rtype
== VR_RANGE
)
9642 if (wi::lt_p (max
, w
, TYPE_SIGN (TREE_TYPE (t
))))
9644 if (wi::lt_p (w
, min
, TYPE_SIGN (TREE_TYPE (t
))))
9647 else if (rtype
== VR_ANTI_RANGE
9648 && wi::le_p (min
, w
, TYPE_SIGN (TREE_TYPE (t
)))
9649 && wi::le_p (w
, max
, TYPE_SIGN (TREE_TYPE (t
))))
9651 /* If T has some known zero bits and W has any of those bits set,
9652 then T is known not to be equal to W. */
9653 if (wi::ne_p (wi::zext (wi::bit_and_not (w
, get_nonzero_bits (t
)),
9654 TYPE_PRECISION (TREE_TYPE (t
))), 0))
9663 /* Fold a binary expression of code CODE and type TYPE with operands
9664 OP0 and OP1. LOC is the location of the resulting expression.
9665 Return the folded expression if folding is successful. Otherwise,
9666 return NULL_TREE. */
9669 fold_binary_loc (location_t loc
, enum tree_code code
, tree type
,
9672 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
9673 tree arg0
, arg1
, tem
;
9674 tree t1
= NULL_TREE
;
9675 bool strict_overflow_p
;
9678 gcc_assert (IS_EXPR_CODE_CLASS (kind
)
9679 && TREE_CODE_LENGTH (code
) == 2
9681 && op1
!= NULL_TREE
);
9686 /* Strip any conversions that don't change the mode. This is
9687 safe for every expression, except for a comparison expression
9688 because its signedness is derived from its operands. So, in
9689 the latter case, only strip conversions that don't change the
9690 signedness. MIN_EXPR/MAX_EXPR also need signedness of arguments
9693 Note that this is done as an internal manipulation within the
9694 constant folder, in order to find the simplest representation
9695 of the arguments so that their form can be studied. In any
9696 cases, the appropriate type conversions should be put back in
9697 the tree that will get out of the constant folder. */
9699 if (kind
== tcc_comparison
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
9701 STRIP_SIGN_NOPS (arg0
);
9702 STRIP_SIGN_NOPS (arg1
);
9710 /* Note that TREE_CONSTANT isn't enough: static var addresses are
9711 constant but we can't do arithmetic on them. */
9712 if (CONSTANT_CLASS_P (arg0
) && CONSTANT_CLASS_P (arg1
))
9714 tem
= const_binop (code
, type
, arg0
, arg1
);
9715 if (tem
!= NULL_TREE
)
9717 if (TREE_TYPE (tem
) != type
)
9718 tem
= fold_convert_loc (loc
, type
, tem
);
9723 /* If this is a commutative operation, and ARG0 is a constant, move it
9724 to ARG1 to reduce the number of tests below. */
9725 if (commutative_tree_code (code
)
9726 && tree_swap_operands_p (arg0
, arg1
))
9727 return fold_build2_loc (loc
, code
, type
, op1
, op0
);
9729 /* Likewise if this is a comparison, and ARG0 is a constant, move it
9730 to ARG1 to reduce the number of tests below. */
9731 if (kind
== tcc_comparison
9732 && tree_swap_operands_p (arg0
, arg1
))
9733 return fold_build2_loc (loc
, swap_tree_comparison (code
), type
, op1
, op0
);
9735 tem
= generic_simplify (loc
, code
, type
, op0
, op1
);
9739 /* ARG0 is the first operand of EXPR, and ARG1 is the second operand.
9741 First check for cases where an arithmetic operation is applied to a
9742 compound, conditional, or comparison operation. Push the arithmetic
9743 operation inside the compound or conditional to see if any folding
9744 can then be done. Convert comparison to conditional for this purpose.
9745 The also optimizes non-constant cases that used to be done in
9748 Before we do that, see if this is a BIT_AND_EXPR or a BIT_IOR_EXPR,
9749 one of the operands is a comparison and the other is a comparison, a
9750 BIT_AND_EXPR with the constant 1, or a truth value. In that case, the
9751 code below would make the expression more complex. Change it to a
9752 TRUTH_{AND,OR}_EXPR. Likewise, convert a similar NE_EXPR to
9753 TRUTH_XOR_EXPR and an EQ_EXPR to the inversion of a TRUTH_XOR_EXPR. */
9755 if ((code
== BIT_AND_EXPR
|| code
== BIT_IOR_EXPR
9756 || code
== EQ_EXPR
|| code
== NE_EXPR
)
9757 && !VECTOR_TYPE_P (TREE_TYPE (arg0
))
9758 && ((truth_value_p (TREE_CODE (arg0
))
9759 && (truth_value_p (TREE_CODE (arg1
))
9760 || (TREE_CODE (arg1
) == BIT_AND_EXPR
9761 && integer_onep (TREE_OPERAND (arg1
, 1)))))
9762 || (truth_value_p (TREE_CODE (arg1
))
9763 && (truth_value_p (TREE_CODE (arg0
))
9764 || (TREE_CODE (arg0
) == BIT_AND_EXPR
9765 && integer_onep (TREE_OPERAND (arg0
, 1)))))))
9767 tem
= fold_build2_loc (loc
, code
== BIT_AND_EXPR
? TRUTH_AND_EXPR
9768 : code
== BIT_IOR_EXPR
? TRUTH_OR_EXPR
9771 fold_convert_loc (loc
, boolean_type_node
, arg0
),
9772 fold_convert_loc (loc
, boolean_type_node
, arg1
));
9774 if (code
== EQ_EXPR
)
9775 tem
= invert_truthvalue_loc (loc
, tem
);
9777 return fold_convert_loc (loc
, type
, tem
);
9780 if (TREE_CODE_CLASS (code
) == tcc_binary
9781 || TREE_CODE_CLASS (code
) == tcc_comparison
)
9783 if (TREE_CODE (arg0
) == COMPOUND_EXPR
)
9785 tem
= fold_build2_loc (loc
, code
, type
,
9786 fold_convert_loc (loc
, TREE_TYPE (op0
),
9787 TREE_OPERAND (arg0
, 1)), op1
);
9788 return build2_loc (loc
, COMPOUND_EXPR
, type
, TREE_OPERAND (arg0
, 0),
9791 if (TREE_CODE (arg1
) == COMPOUND_EXPR
)
9793 tem
= fold_build2_loc (loc
, code
, type
, op0
,
9794 fold_convert_loc (loc
, TREE_TYPE (op1
),
9795 TREE_OPERAND (arg1
, 1)));
9796 return build2_loc (loc
, COMPOUND_EXPR
, type
, TREE_OPERAND (arg1
, 0),
9800 if (TREE_CODE (arg0
) == COND_EXPR
9801 || TREE_CODE (arg0
) == VEC_COND_EXPR
9802 || COMPARISON_CLASS_P (arg0
))
9804 tem
= fold_binary_op_with_conditional_arg (loc
, code
, type
, op0
, op1
,
9806 /*cond_first_p=*/1);
9807 if (tem
!= NULL_TREE
)
9811 if (TREE_CODE (arg1
) == COND_EXPR
9812 || TREE_CODE (arg1
) == VEC_COND_EXPR
9813 || COMPARISON_CLASS_P (arg1
))
9815 tem
= fold_binary_op_with_conditional_arg (loc
, code
, type
, op0
, op1
,
9817 /*cond_first_p=*/0);
9818 if (tem
!= NULL_TREE
)
9826 /* MEM[&MEM[p, CST1], CST2] -> MEM[p, CST1 + CST2]. */
9827 if (TREE_CODE (arg0
) == ADDR_EXPR
9828 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == MEM_REF
)
9830 tree iref
= TREE_OPERAND (arg0
, 0);
9831 return fold_build2 (MEM_REF
, type
,
9832 TREE_OPERAND (iref
, 0),
9833 int_const_binop (PLUS_EXPR
, arg1
,
9834 TREE_OPERAND (iref
, 1)));
9837 /* MEM[&a.b, CST2] -> MEM[&a, offsetof (a, b) + CST2]. */
9838 if (TREE_CODE (arg0
) == ADDR_EXPR
9839 && handled_component_p (TREE_OPERAND (arg0
, 0)))
9843 base
= get_addr_base_and_unit_offset (TREE_OPERAND (arg0
, 0),
9847 return fold_build2 (MEM_REF
, type
,
9848 build_fold_addr_expr (base
),
9849 int_const_binop (PLUS_EXPR
, arg1
,
9850 size_int (coffset
)));
9855 case POINTER_PLUS_EXPR
:
9856 /* INT +p INT -> (PTR)(INT + INT). Stripping types allows for this. */
9857 if (INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
9858 && INTEGRAL_TYPE_P (TREE_TYPE (arg0
)))
9859 return fold_convert_loc (loc
, type
,
9860 fold_build2_loc (loc
, PLUS_EXPR
, sizetype
,
9861 fold_convert_loc (loc
, sizetype
,
9863 fold_convert_loc (loc
, sizetype
,
9869 if (INTEGRAL_TYPE_P (type
) || VECTOR_INTEGER_TYPE_P (type
))
9871 /* X + (X / CST) * -CST is X % CST. */
9872 if (TREE_CODE (arg1
) == MULT_EXPR
9873 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == TRUNC_DIV_EXPR
9874 && operand_equal_p (arg0
,
9875 TREE_OPERAND (TREE_OPERAND (arg1
, 0), 0), 0))
9877 tree cst0
= TREE_OPERAND (TREE_OPERAND (arg1
, 0), 1);
9878 tree cst1
= TREE_OPERAND (arg1
, 1);
9879 tree sum
= fold_binary_loc (loc
, PLUS_EXPR
, TREE_TYPE (cst1
),
9881 if (sum
&& integer_zerop (sum
))
9882 return fold_convert_loc (loc
, type
,
9883 fold_build2_loc (loc
, TRUNC_MOD_EXPR
,
9884 TREE_TYPE (arg0
), arg0
,
9889 /* Handle (A1 * C1) + (A2 * C2) with A1, A2 or C1, C2 being the same or
9890 one. Make sure the type is not saturating and has the signedness of
9891 the stripped operands, as fold_plusminus_mult_expr will re-associate.
9892 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
9893 if ((TREE_CODE (arg0
) == MULT_EXPR
9894 || TREE_CODE (arg1
) == MULT_EXPR
)
9895 && !TYPE_SATURATING (type
)
9896 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg0
))
9897 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg1
))
9898 && (!FLOAT_TYPE_P (type
) || flag_associative_math
))
9900 tree tem
= fold_plusminus_mult_expr (loc
, code
, type
, arg0
, arg1
);
9905 if (! FLOAT_TYPE_P (type
))
9907 /* Reassociate (plus (plus (mult) (foo)) (mult)) as
9908 (plus (plus (mult) (mult)) (foo)) so that we can
9909 take advantage of the factoring cases below. */
9910 if (ANY_INTEGRAL_TYPE_P (type
)
9911 && TYPE_OVERFLOW_WRAPS (type
)
9912 && (((TREE_CODE (arg0
) == PLUS_EXPR
9913 || TREE_CODE (arg0
) == MINUS_EXPR
)
9914 && TREE_CODE (arg1
) == MULT_EXPR
)
9915 || ((TREE_CODE (arg1
) == PLUS_EXPR
9916 || TREE_CODE (arg1
) == MINUS_EXPR
)
9917 && TREE_CODE (arg0
) == MULT_EXPR
)))
9919 tree parg0
, parg1
, parg
, marg
;
9920 enum tree_code pcode
;
9922 if (TREE_CODE (arg1
) == MULT_EXPR
)
9923 parg
= arg0
, marg
= arg1
;
9925 parg
= arg1
, marg
= arg0
;
9926 pcode
= TREE_CODE (parg
);
9927 parg0
= TREE_OPERAND (parg
, 0);
9928 parg1
= TREE_OPERAND (parg
, 1);
9932 if (TREE_CODE (parg0
) == MULT_EXPR
9933 && TREE_CODE (parg1
) != MULT_EXPR
)
9934 return fold_build2_loc (loc
, pcode
, type
,
9935 fold_build2_loc (loc
, PLUS_EXPR
, type
,
9936 fold_convert_loc (loc
, type
,
9938 fold_convert_loc (loc
, type
,
9940 fold_convert_loc (loc
, type
, parg1
));
9941 if (TREE_CODE (parg0
) != MULT_EXPR
9942 && TREE_CODE (parg1
) == MULT_EXPR
)
9944 fold_build2_loc (loc
, PLUS_EXPR
, type
,
9945 fold_convert_loc (loc
, type
, parg0
),
9946 fold_build2_loc (loc
, pcode
, type
,
9947 fold_convert_loc (loc
, type
, marg
),
9948 fold_convert_loc (loc
, type
,
9954 /* Fold __complex__ ( x, 0 ) + __complex__ ( 0, y )
9955 to __complex__ ( x, y ). This is not the same for SNaNs or
9956 if signed zeros are involved. */
9957 if (!HONOR_SNANS (element_mode (arg0
))
9958 && !HONOR_SIGNED_ZEROS (element_mode (arg0
))
9959 && COMPLEX_FLOAT_TYPE_P (TREE_TYPE (arg0
)))
9961 tree rtype
= TREE_TYPE (TREE_TYPE (arg0
));
9962 tree arg0r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg0
);
9963 tree arg0i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg0
);
9964 bool arg0rz
= false, arg0iz
= false;
9965 if ((arg0r
&& (arg0rz
= real_zerop (arg0r
)))
9966 || (arg0i
&& (arg0iz
= real_zerop (arg0i
))))
9968 tree arg1r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg1
);
9969 tree arg1i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg1
);
9970 if (arg0rz
&& arg1i
&& real_zerop (arg1i
))
9972 tree rp
= arg1r
? arg1r
9973 : build1 (REALPART_EXPR
, rtype
, arg1
);
9974 tree ip
= arg0i
? arg0i
9975 : build1 (IMAGPART_EXPR
, rtype
, arg0
);
9976 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
9978 else if (arg0iz
&& arg1r
&& real_zerop (arg1r
))
9980 tree rp
= arg0r
? arg0r
9981 : build1 (REALPART_EXPR
, rtype
, arg0
);
9982 tree ip
= arg1i
? arg1i
9983 : build1 (IMAGPART_EXPR
, rtype
, arg1
);
9984 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
9989 /* Convert a + (b*c + d*e) into (a + b*c) + d*e.
9990 We associate floats only if the user has specified
9991 -fassociative-math. */
9992 if (flag_associative_math
9993 && TREE_CODE (arg1
) == PLUS_EXPR
9994 && TREE_CODE (arg0
) != MULT_EXPR
)
9996 tree tree10
= TREE_OPERAND (arg1
, 0);
9997 tree tree11
= TREE_OPERAND (arg1
, 1);
9998 if (TREE_CODE (tree11
) == MULT_EXPR
9999 && TREE_CODE (tree10
) == MULT_EXPR
)
10002 tree0
= fold_build2_loc (loc
, PLUS_EXPR
, type
, arg0
, tree10
);
10003 return fold_build2_loc (loc
, PLUS_EXPR
, type
, tree0
, tree11
);
10006 /* Convert (b*c + d*e) + a into b*c + (d*e +a).
10007 We associate floats only if the user has specified
10008 -fassociative-math. */
10009 if (flag_associative_math
10010 && TREE_CODE (arg0
) == PLUS_EXPR
10011 && TREE_CODE (arg1
) != MULT_EXPR
)
10013 tree tree00
= TREE_OPERAND (arg0
, 0);
10014 tree tree01
= TREE_OPERAND (arg0
, 1);
10015 if (TREE_CODE (tree01
) == MULT_EXPR
10016 && TREE_CODE (tree00
) == MULT_EXPR
)
10019 tree0
= fold_build2_loc (loc
, PLUS_EXPR
, type
, tree01
, arg1
);
10020 return fold_build2_loc (loc
, PLUS_EXPR
, type
, tree00
, tree0
);
10026 /* (A << C1) + (A >> C2) if A is unsigned and C1+C2 is the size of A
10027 is a rotate of A by C1 bits. */
10028 /* (A << B) + (A >> (Z - B)) if A is unsigned and Z is the size of A
10029 is a rotate of A by B bits.
10030 Similarly for (A << B) | (A >> (-B & C3)) where C3 is Z-1,
10031 though in this case CODE must be | and not + or ^, otherwise
10032 it doesn't return A when B is 0. */
10034 enum tree_code code0
, code1
;
10036 code0
= TREE_CODE (arg0
);
10037 code1
= TREE_CODE (arg1
);
10038 if (((code0
== RSHIFT_EXPR
&& code1
== LSHIFT_EXPR
)
10039 || (code1
== RSHIFT_EXPR
&& code0
== LSHIFT_EXPR
))
10040 && operand_equal_p (TREE_OPERAND (arg0
, 0),
10041 TREE_OPERAND (arg1
, 0), 0)
10042 && (rtype
= TREE_TYPE (TREE_OPERAND (arg0
, 0)),
10043 TYPE_UNSIGNED (rtype
))
10044 /* Only create rotates in complete modes. Other cases are not
10045 expanded properly. */
10046 && (element_precision (rtype
)
10047 == GET_MODE_UNIT_PRECISION (TYPE_MODE (rtype
))))
10049 tree tree01
, tree11
;
10050 tree orig_tree01
, orig_tree11
;
10051 enum tree_code code01
, code11
;
10053 tree01
= orig_tree01
= TREE_OPERAND (arg0
, 1);
10054 tree11
= orig_tree11
= TREE_OPERAND (arg1
, 1);
10055 STRIP_NOPS (tree01
);
10056 STRIP_NOPS (tree11
);
10057 code01
= TREE_CODE (tree01
);
10058 code11
= TREE_CODE (tree11
);
10059 if (code11
!= MINUS_EXPR
10060 && (code01
== MINUS_EXPR
|| code01
== BIT_AND_EXPR
))
10062 std::swap (code0
, code1
);
10063 std::swap (code01
, code11
);
10064 std::swap (tree01
, tree11
);
10065 std::swap (orig_tree01
, orig_tree11
);
10067 if (code01
== INTEGER_CST
10068 && code11
== INTEGER_CST
10069 && (wi::to_widest (tree01
) + wi::to_widest (tree11
)
10070 == element_precision (rtype
)))
10072 tem
= build2_loc (loc
, LROTATE_EXPR
,
10073 rtype
, TREE_OPERAND (arg0
, 0),
10074 code0
== LSHIFT_EXPR
10075 ? orig_tree01
: orig_tree11
);
10076 return fold_convert_loc (loc
, type
, tem
);
10078 else if (code11
== MINUS_EXPR
)
10080 tree tree110
, tree111
;
10081 tree110
= TREE_OPERAND (tree11
, 0);
10082 tree111
= TREE_OPERAND (tree11
, 1);
10083 STRIP_NOPS (tree110
);
10084 STRIP_NOPS (tree111
);
10085 if (TREE_CODE (tree110
) == INTEGER_CST
10086 && compare_tree_int (tree110
,
10087 element_precision (rtype
)) == 0
10088 && operand_equal_p (tree01
, tree111
, 0))
10090 tem
= build2_loc (loc
, (code0
== LSHIFT_EXPR
10091 ? LROTATE_EXPR
: RROTATE_EXPR
),
10092 rtype
, TREE_OPERAND (arg0
, 0),
10094 return fold_convert_loc (loc
, type
, tem
);
10097 else if (code
== BIT_IOR_EXPR
10098 && code11
== BIT_AND_EXPR
10099 && pow2p_hwi (element_precision (rtype
)))
10101 tree tree110
, tree111
;
10102 tree110
= TREE_OPERAND (tree11
, 0);
10103 tree111
= TREE_OPERAND (tree11
, 1);
10104 STRIP_NOPS (tree110
);
10105 STRIP_NOPS (tree111
);
10106 if (TREE_CODE (tree110
) == NEGATE_EXPR
10107 && TREE_CODE (tree111
) == INTEGER_CST
10108 && compare_tree_int (tree111
,
10109 element_precision (rtype
) - 1) == 0
10110 && operand_equal_p (tree01
, TREE_OPERAND (tree110
, 0), 0))
10112 tem
= build2_loc (loc
, (code0
== LSHIFT_EXPR
10113 ? LROTATE_EXPR
: RROTATE_EXPR
),
10114 rtype
, TREE_OPERAND (arg0
, 0),
10116 return fold_convert_loc (loc
, type
, tem
);
10123 /* In most languages, can't associate operations on floats through
10124 parentheses. Rather than remember where the parentheses were, we
10125 don't associate floats at all, unless the user has specified
10126 -fassociative-math.
10127 And, we need to make sure type is not saturating. */
10129 if ((! FLOAT_TYPE_P (type
) || flag_associative_math
)
10130 && !TYPE_SATURATING (type
))
10132 tree var0
, minus_var0
, con0
, minus_con0
, lit0
, minus_lit0
;
10133 tree var1
, minus_var1
, con1
, minus_con1
, lit1
, minus_lit1
;
10137 /* Split both trees into variables, constants, and literals. Then
10138 associate each group together, the constants with literals,
10139 then the result with variables. This increases the chances of
10140 literals being recombined later and of generating relocatable
10141 expressions for the sum of a constant and literal. */
10142 var0
= split_tree (arg0
, type
, code
,
10143 &minus_var0
, &con0
, &minus_con0
,
10144 &lit0
, &minus_lit0
, 0);
10145 var1
= split_tree (arg1
, type
, code
,
10146 &minus_var1
, &con1
, &minus_con1
,
10147 &lit1
, &minus_lit1
, code
== MINUS_EXPR
);
10149 /* Recombine MINUS_EXPR operands by using PLUS_EXPR. */
10150 if (code
== MINUS_EXPR
)
10153 /* With undefined overflow prefer doing association in a type
10154 which wraps on overflow, if that is one of the operand types. */
10155 if ((POINTER_TYPE_P (type
) || INTEGRAL_TYPE_P (type
))
10156 && !TYPE_OVERFLOW_WRAPS (type
))
10158 if (INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
10159 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg0
)))
10160 atype
= TREE_TYPE (arg0
);
10161 else if (INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
10162 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg1
)))
10163 atype
= TREE_TYPE (arg1
);
10164 gcc_assert (TYPE_PRECISION (atype
) == TYPE_PRECISION (type
));
10167 /* With undefined overflow we can only associate constants with one
10168 variable, and constants whose association doesn't overflow. */
10169 if ((POINTER_TYPE_P (atype
) || INTEGRAL_TYPE_P (atype
))
10170 && !TYPE_OVERFLOW_WRAPS (atype
))
10172 if ((var0
&& var1
) || (minus_var0
&& minus_var1
))
10174 /* ??? If split_tree would handle NEGATE_EXPR we could
10175 simply reject these cases and the allowed cases would
10176 be the var0/minus_var1 ones. */
10177 tree tmp0
= var0
? var0
: minus_var0
;
10178 tree tmp1
= var1
? var1
: minus_var1
;
10179 bool one_neg
= false;
10181 if (TREE_CODE (tmp0
) == NEGATE_EXPR
)
10183 tmp0
= TREE_OPERAND (tmp0
, 0);
10184 one_neg
= !one_neg
;
10186 if (CONVERT_EXPR_P (tmp0
)
10187 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (tmp0
, 0)))
10188 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (tmp0
, 0)))
10189 <= TYPE_PRECISION (atype
)))
10190 tmp0
= TREE_OPERAND (tmp0
, 0);
10191 if (TREE_CODE (tmp1
) == NEGATE_EXPR
)
10193 tmp1
= TREE_OPERAND (tmp1
, 0);
10194 one_neg
= !one_neg
;
10196 if (CONVERT_EXPR_P (tmp1
)
10197 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (tmp1
, 0)))
10198 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (tmp1
, 0)))
10199 <= TYPE_PRECISION (atype
)))
10200 tmp1
= TREE_OPERAND (tmp1
, 0);
10201 /* The only case we can still associate with two variables
10202 is if they cancel out. */
10204 || !operand_equal_p (tmp0
, tmp1
, 0))
10207 else if ((var0
&& minus_var1
10208 && ! operand_equal_p (var0
, minus_var1
, 0))
10209 || (minus_var0
&& var1
10210 && ! operand_equal_p (minus_var0
, var1
, 0)))
10214 /* Only do something if we found more than two objects. Otherwise,
10215 nothing has changed and we risk infinite recursion. */
10217 && ((var0
!= 0) + (var1
!= 0)
10218 + (minus_var0
!= 0) + (minus_var1
!= 0)
10219 + (con0
!= 0) + (con1
!= 0)
10220 + (minus_con0
!= 0) + (minus_con1
!= 0)
10221 + (lit0
!= 0) + (lit1
!= 0)
10222 + (minus_lit0
!= 0) + (minus_lit1
!= 0)) > 2)
10224 var0
= associate_trees (loc
, var0
, var1
, code
, atype
);
10225 minus_var0
= associate_trees (loc
, minus_var0
, minus_var1
,
10227 con0
= associate_trees (loc
, con0
, con1
, code
, atype
);
10228 minus_con0
= associate_trees (loc
, minus_con0
, minus_con1
,
10230 lit0
= associate_trees (loc
, lit0
, lit1
, code
, atype
);
10231 minus_lit0
= associate_trees (loc
, minus_lit0
, minus_lit1
,
10234 if (minus_var0
&& var0
)
10236 var0
= associate_trees (loc
, var0
, minus_var0
,
10237 MINUS_EXPR
, atype
);
10240 if (minus_con0
&& con0
)
10242 con0
= associate_trees (loc
, con0
, minus_con0
,
10243 MINUS_EXPR
, atype
);
10247 /* Preserve the MINUS_EXPR if the negative part of the literal is
10248 greater than the positive part. Otherwise, the multiplicative
10249 folding code (i.e extract_muldiv) may be fooled in case
10250 unsigned constants are subtracted, like in the following
10251 example: ((X*2 + 4) - 8U)/2. */
10252 if (minus_lit0
&& lit0
)
10254 if (TREE_CODE (lit0
) == INTEGER_CST
10255 && TREE_CODE (minus_lit0
) == INTEGER_CST
10256 && tree_int_cst_lt (lit0
, minus_lit0
)
10257 /* But avoid ending up with only negated parts. */
10260 minus_lit0
= associate_trees (loc
, minus_lit0
, lit0
,
10261 MINUS_EXPR
, atype
);
10266 lit0
= associate_trees (loc
, lit0
, minus_lit0
,
10267 MINUS_EXPR
, atype
);
10272 /* Don't introduce overflows through reassociation. */
10273 if ((lit0
&& TREE_OVERFLOW_P (lit0
))
10274 || (minus_lit0
&& TREE_OVERFLOW_P (minus_lit0
)))
10277 /* Eliminate lit0 and minus_lit0 to con0 and minus_con0. */
10278 con0
= associate_trees (loc
, con0
, lit0
, code
, atype
);
10280 minus_con0
= associate_trees (loc
, minus_con0
, minus_lit0
,
10284 /* Eliminate minus_con0. */
10288 con0
= associate_trees (loc
, con0
, minus_con0
,
10289 MINUS_EXPR
, atype
);
10291 var0
= associate_trees (loc
, var0
, minus_con0
,
10292 MINUS_EXPR
, atype
);
10294 gcc_unreachable ();
10298 /* Eliminate minus_var0. */
10302 con0
= associate_trees (loc
, con0
, minus_var0
,
10303 MINUS_EXPR
, atype
);
10305 gcc_unreachable ();
10310 fold_convert_loc (loc
, type
, associate_trees (loc
, var0
, con0
,
10317 case POINTER_DIFF_EXPR
:
10319 /* Fold &a[i] - &a[j] to i-j. */
10320 if (TREE_CODE (arg0
) == ADDR_EXPR
10321 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == ARRAY_REF
10322 && TREE_CODE (arg1
) == ADDR_EXPR
10323 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == ARRAY_REF
)
10325 tree tem
= fold_addr_of_array_ref_difference (loc
, type
,
10326 TREE_OPERAND (arg0
, 0),
10327 TREE_OPERAND (arg1
, 0),
10329 == POINTER_DIFF_EXPR
);
10334 /* Further transformations are not for pointers. */
10335 if (code
== POINTER_DIFF_EXPR
)
10338 /* (-A) - B -> (-B) - A where B is easily negated and we can swap. */
10339 if (TREE_CODE (arg0
) == NEGATE_EXPR
10340 && negate_expr_p (op1
)
10341 /* If arg0 is e.g. unsigned int and type is int, then this could
10342 introduce UB, because if A is INT_MIN at runtime, the original
10343 expression can be well defined while the latter is not.
10345 && !(ANY_INTEGRAL_TYPE_P (type
)
10346 && TYPE_OVERFLOW_UNDEFINED (type
)
10347 && ANY_INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
10348 && !TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
))))
10349 return fold_build2_loc (loc
, MINUS_EXPR
, type
, negate_expr (op1
),
10350 fold_convert_loc (loc
, type
,
10351 TREE_OPERAND (arg0
, 0)));
10353 /* Fold __complex__ ( x, 0 ) - __complex__ ( 0, y ) to
10354 __complex__ ( x, -y ). This is not the same for SNaNs or if
10355 signed zeros are involved. */
10356 if (!HONOR_SNANS (element_mode (arg0
))
10357 && !HONOR_SIGNED_ZEROS (element_mode (arg0
))
10358 && COMPLEX_FLOAT_TYPE_P (TREE_TYPE (arg0
)))
10360 tree rtype
= TREE_TYPE (TREE_TYPE (arg0
));
10361 tree arg0r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg0
);
10362 tree arg0i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg0
);
10363 bool arg0rz
= false, arg0iz
= false;
10364 if ((arg0r
&& (arg0rz
= real_zerop (arg0r
)))
10365 || (arg0i
&& (arg0iz
= real_zerop (arg0i
))))
10367 tree arg1r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg1
);
10368 tree arg1i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg1
);
10369 if (arg0rz
&& arg1i
&& real_zerop (arg1i
))
10371 tree rp
= fold_build1_loc (loc
, NEGATE_EXPR
, rtype
,
10373 : build1 (REALPART_EXPR
, rtype
, arg1
));
10374 tree ip
= arg0i
? arg0i
10375 : build1 (IMAGPART_EXPR
, rtype
, arg0
);
10376 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
10378 else if (arg0iz
&& arg1r
&& real_zerop (arg1r
))
10380 tree rp
= arg0r
? arg0r
10381 : build1 (REALPART_EXPR
, rtype
, arg0
);
10382 tree ip
= fold_build1_loc (loc
, NEGATE_EXPR
, rtype
,
10384 : build1 (IMAGPART_EXPR
, rtype
, arg1
));
10385 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
10390 /* A - B -> A + (-B) if B is easily negatable. */
10391 if (negate_expr_p (op1
)
10392 && ! TYPE_OVERFLOW_SANITIZED (type
)
10393 && ((FLOAT_TYPE_P (type
)
10394 /* Avoid this transformation if B is a positive REAL_CST. */
10395 && (TREE_CODE (op1
) != REAL_CST
10396 || REAL_VALUE_NEGATIVE (TREE_REAL_CST (op1
))))
10397 || INTEGRAL_TYPE_P (type
)))
10398 return fold_build2_loc (loc
, PLUS_EXPR
, type
,
10399 fold_convert_loc (loc
, type
, arg0
),
10400 negate_expr (op1
));
10402 /* Handle (A1 * C1) - (A2 * C2) with A1, A2 or C1, C2 being the same or
10403 one. Make sure the type is not saturating and has the signedness of
10404 the stripped operands, as fold_plusminus_mult_expr will re-associate.
10405 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
10406 if ((TREE_CODE (arg0
) == MULT_EXPR
10407 || TREE_CODE (arg1
) == MULT_EXPR
)
10408 && !TYPE_SATURATING (type
)
10409 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg0
))
10410 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg1
))
10411 && (!FLOAT_TYPE_P (type
) || flag_associative_math
))
10413 tree tem
= fold_plusminus_mult_expr (loc
, code
, type
, arg0
, arg1
);
10421 if (! FLOAT_TYPE_P (type
))
10423 /* Transform x * -C into -x * C if x is easily negatable. */
10424 if (TREE_CODE (op1
) == INTEGER_CST
10425 && tree_int_cst_sgn (op1
) == -1
10426 && negate_expr_p (op0
)
10427 && negate_expr_p (op1
)
10428 && (tem
= negate_expr (op1
)) != op1
10429 && ! TREE_OVERFLOW (tem
))
10430 return fold_build2_loc (loc
, MULT_EXPR
, type
,
10431 fold_convert_loc (loc
, type
,
10432 negate_expr (op0
)), tem
);
10434 strict_overflow_p
= false;
10435 if (TREE_CODE (arg1
) == INTEGER_CST
10436 && (tem
= extract_muldiv (op0
, arg1
, code
, NULL_TREE
,
10437 &strict_overflow_p
)) != 0)
10439 if (strict_overflow_p
)
10440 fold_overflow_warning (("assuming signed overflow does not "
10441 "occur when simplifying "
10443 WARN_STRICT_OVERFLOW_MISC
);
10444 return fold_convert_loc (loc
, type
, tem
);
10447 /* Optimize z * conj(z) for integer complex numbers. */
10448 if (TREE_CODE (arg0
) == CONJ_EXPR
10449 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
10450 return fold_mult_zconjz (loc
, type
, arg1
);
10451 if (TREE_CODE (arg1
) == CONJ_EXPR
10452 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10453 return fold_mult_zconjz (loc
, type
, arg0
);
10457 /* Fold z * +-I to __complex__ (-+__imag z, +-__real z).
10458 This is not the same for NaNs or if signed zeros are
10460 if (!HONOR_NANS (arg0
)
10461 && !HONOR_SIGNED_ZEROS (element_mode (arg0
))
10462 && COMPLEX_FLOAT_TYPE_P (TREE_TYPE (arg0
))
10463 && TREE_CODE (arg1
) == COMPLEX_CST
10464 && real_zerop (TREE_REALPART (arg1
)))
10466 tree rtype
= TREE_TYPE (TREE_TYPE (arg0
));
10467 if (real_onep (TREE_IMAGPART (arg1
)))
10469 fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
10470 negate_expr (fold_build1_loc (loc
, IMAGPART_EXPR
,
10472 fold_build1_loc (loc
, REALPART_EXPR
, rtype
, arg0
));
10473 else if (real_minus_onep (TREE_IMAGPART (arg1
)))
10475 fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
10476 fold_build1_loc (loc
, IMAGPART_EXPR
, rtype
, arg0
),
10477 negate_expr (fold_build1_loc (loc
, REALPART_EXPR
,
10481 /* Optimize z * conj(z) for floating point complex numbers.
10482 Guarded by flag_unsafe_math_optimizations as non-finite
10483 imaginary components don't produce scalar results. */
10484 if (flag_unsafe_math_optimizations
10485 && TREE_CODE (arg0
) == CONJ_EXPR
10486 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
10487 return fold_mult_zconjz (loc
, type
, arg1
);
10488 if (flag_unsafe_math_optimizations
10489 && TREE_CODE (arg1
) == CONJ_EXPR
10490 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10491 return fold_mult_zconjz (loc
, type
, arg0
);
10496 /* Canonicalize (X & C1) | C2. */
10497 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10498 && TREE_CODE (arg1
) == INTEGER_CST
10499 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
10501 int width
= TYPE_PRECISION (type
), w
;
10502 wide_int c1
= wi::to_wide (TREE_OPERAND (arg0
, 1));
10503 wide_int c2
= wi::to_wide (arg1
);
10505 /* If (C1&C2) == C1, then (X&C1)|C2 becomes (X,C2). */
10506 if ((c1
& c2
) == c1
)
10507 return omit_one_operand_loc (loc
, type
, arg1
,
10508 TREE_OPERAND (arg0
, 0));
10510 wide_int msk
= wi::mask (width
, false,
10511 TYPE_PRECISION (TREE_TYPE (arg1
)));
10513 /* If (C1|C2) == ~0 then (X&C1)|C2 becomes X|C2. */
10514 if (wi::bit_and_not (msk
, c1
| c2
) == 0)
10516 tem
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10517 return fold_build2_loc (loc
, BIT_IOR_EXPR
, type
, tem
, arg1
);
10520 /* Minimize the number of bits set in C1, i.e. C1 := C1 & ~C2,
10521 unless (C1 & ~C2) | (C2 & C3) for some C3 is a mask of some
10522 mode which allows further optimizations. */
10525 wide_int c3
= wi::bit_and_not (c1
, c2
);
10526 for (w
= BITS_PER_UNIT
; w
<= width
; w
<<= 1)
10528 wide_int mask
= wi::mask (w
, false,
10529 TYPE_PRECISION (type
));
10530 if (((c1
| c2
) & mask
) == mask
10531 && wi::bit_and_not (c1
, mask
) == 0)
10540 tem
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10541 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, type
, tem
,
10542 wide_int_to_tree (type
, c3
));
10543 return fold_build2_loc (loc
, BIT_IOR_EXPR
, type
, tem
, arg1
);
10547 /* See if this can be simplified into a rotate first. If that
10548 is unsuccessful continue in the association code. */
10552 /* Fold (X & 1) ^ 1 as (X & 1) == 0. */
10553 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10554 && INTEGRAL_TYPE_P (type
)
10555 && integer_onep (TREE_OPERAND (arg0
, 1))
10556 && integer_onep (arg1
))
10557 return fold_build2_loc (loc
, EQ_EXPR
, type
, arg0
,
10558 build_zero_cst (TREE_TYPE (arg0
)));
10560 /* See if this can be simplified into a rotate first. If that
10561 is unsuccessful continue in the association code. */
10565 /* Fold (X ^ 1) & 1 as (X & 1) == 0. */
10566 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
10567 && INTEGRAL_TYPE_P (type
)
10568 && integer_onep (TREE_OPERAND (arg0
, 1))
10569 && integer_onep (arg1
))
10572 tem
= TREE_OPERAND (arg0
, 0);
10573 tem2
= fold_convert_loc (loc
, TREE_TYPE (tem
), arg1
);
10574 tem2
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (tem
),
10576 return fold_build2_loc (loc
, EQ_EXPR
, type
, tem2
,
10577 build_zero_cst (TREE_TYPE (tem
)));
10579 /* Fold ~X & 1 as (X & 1) == 0. */
10580 if (TREE_CODE (arg0
) == BIT_NOT_EXPR
10581 && INTEGRAL_TYPE_P (type
)
10582 && integer_onep (arg1
))
10585 tem
= TREE_OPERAND (arg0
, 0);
10586 tem2
= fold_convert_loc (loc
, TREE_TYPE (tem
), arg1
);
10587 tem2
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (tem
),
10589 return fold_build2_loc (loc
, EQ_EXPR
, type
, tem2
,
10590 build_zero_cst (TREE_TYPE (tem
)));
10592 /* Fold !X & 1 as X == 0. */
10593 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
10594 && integer_onep (arg1
))
10596 tem
= TREE_OPERAND (arg0
, 0);
10597 return fold_build2_loc (loc
, EQ_EXPR
, type
, tem
,
10598 build_zero_cst (TREE_TYPE (tem
)));
10601 /* Fold (X * Y) & -(1 << CST) to X * Y if Y is a constant
10602 multiple of 1 << CST. */
10603 if (TREE_CODE (arg1
) == INTEGER_CST
)
10605 wi::tree_to_wide_ref cst1
= wi::to_wide (arg1
);
10606 wide_int ncst1
= -cst1
;
10607 if ((cst1
& ncst1
) == ncst1
10608 && multiple_of_p (type
, arg0
,
10609 wide_int_to_tree (TREE_TYPE (arg1
), ncst1
)))
10610 return fold_convert_loc (loc
, type
, arg0
);
10613 /* Fold (X * CST1) & CST2 to zero if we can, or drop known zero
10615 if (TREE_CODE (arg1
) == INTEGER_CST
10616 && TREE_CODE (arg0
) == MULT_EXPR
10617 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
10619 wi::tree_to_wide_ref warg1
= wi::to_wide (arg1
);
10621 = mask_with_tz (type
, warg1
, wi::to_wide (TREE_OPERAND (arg0
, 1)));
10624 return omit_two_operands_loc (loc
, type
, build_zero_cst (type
),
10626 else if (masked
!= warg1
)
10628 /* Avoid the transform if arg1 is a mask of some
10629 mode which allows further optimizations. */
10630 int pop
= wi::popcount (warg1
);
10631 if (!(pop
>= BITS_PER_UNIT
10633 && wi::mask (pop
, false, warg1
.get_precision ()) == warg1
))
10634 return fold_build2_loc (loc
, code
, type
, op0
,
10635 wide_int_to_tree (type
, masked
));
10639 /* Simplify ((int)c & 0377) into (int)c, if c is unsigned char. */
10640 if (TREE_CODE (arg1
) == INTEGER_CST
&& TREE_CODE (arg0
) == NOP_EXPR
10641 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (arg0
, 0))))
10643 prec
= element_precision (TREE_TYPE (TREE_OPERAND (arg0
, 0)));
10645 wide_int mask
= wide_int::from (wi::to_wide (arg1
), prec
, UNSIGNED
);
10648 fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10654 /* Don't touch a floating-point divide by zero unless the mode
10655 of the constant can represent infinity. */
10656 if (TREE_CODE (arg1
) == REAL_CST
10657 && !MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (arg1
)))
10658 && real_zerop (arg1
))
10661 /* (-A) / (-B) -> A / B */
10662 if (TREE_CODE (arg0
) == NEGATE_EXPR
&& negate_expr_p (arg1
))
10663 return fold_build2_loc (loc
, RDIV_EXPR
, type
,
10664 TREE_OPERAND (arg0
, 0),
10665 negate_expr (arg1
));
10666 if (TREE_CODE (arg1
) == NEGATE_EXPR
&& negate_expr_p (arg0
))
10667 return fold_build2_loc (loc
, RDIV_EXPR
, type
,
10668 negate_expr (arg0
),
10669 TREE_OPERAND (arg1
, 0));
10672 case TRUNC_DIV_EXPR
:
10675 case FLOOR_DIV_EXPR
:
10676 /* Simplify A / (B << N) where A and B are positive and B is
10677 a power of 2, to A >> (N + log2(B)). */
10678 strict_overflow_p
= false;
10679 if (TREE_CODE (arg1
) == LSHIFT_EXPR
10680 && (TYPE_UNSIGNED (type
)
10681 || tree_expr_nonnegative_warnv_p (op0
, &strict_overflow_p
)))
10683 tree sval
= TREE_OPERAND (arg1
, 0);
10684 if (integer_pow2p (sval
) && tree_int_cst_sgn (sval
) > 0)
10686 tree sh_cnt
= TREE_OPERAND (arg1
, 1);
10687 tree pow2
= build_int_cst (TREE_TYPE (sh_cnt
),
10688 wi::exact_log2 (wi::to_wide (sval
)));
10690 if (strict_overflow_p
)
10691 fold_overflow_warning (("assuming signed overflow does not "
10692 "occur when simplifying A / (B << N)"),
10693 WARN_STRICT_OVERFLOW_MISC
);
10695 sh_cnt
= fold_build2_loc (loc
, PLUS_EXPR
, TREE_TYPE (sh_cnt
),
10697 return fold_build2_loc (loc
, RSHIFT_EXPR
, type
,
10698 fold_convert_loc (loc
, type
, arg0
), sh_cnt
);
10704 case ROUND_DIV_EXPR
:
10705 case CEIL_DIV_EXPR
:
10706 case EXACT_DIV_EXPR
:
10707 if (integer_zerop (arg1
))
10710 /* Convert -A / -B to A / B when the type is signed and overflow is
10712 if ((!INTEGRAL_TYPE_P (type
) || TYPE_OVERFLOW_UNDEFINED (type
))
10713 && TREE_CODE (op0
) == NEGATE_EXPR
10714 && negate_expr_p (op1
))
10716 if (INTEGRAL_TYPE_P (type
))
10717 fold_overflow_warning (("assuming signed overflow does not occur "
10718 "when distributing negation across "
10720 WARN_STRICT_OVERFLOW_MISC
);
10721 return fold_build2_loc (loc
, code
, type
,
10722 fold_convert_loc (loc
, type
,
10723 TREE_OPERAND (arg0
, 0)),
10724 negate_expr (op1
));
10726 if ((!INTEGRAL_TYPE_P (type
) || TYPE_OVERFLOW_UNDEFINED (type
))
10727 && TREE_CODE (arg1
) == NEGATE_EXPR
10728 && negate_expr_p (op0
))
10730 if (INTEGRAL_TYPE_P (type
))
10731 fold_overflow_warning (("assuming signed overflow does not occur "
10732 "when distributing negation across "
10734 WARN_STRICT_OVERFLOW_MISC
);
10735 return fold_build2_loc (loc
, code
, type
,
10737 fold_convert_loc (loc
, type
,
10738 TREE_OPERAND (arg1
, 0)));
10741 /* If arg0 is a multiple of arg1, then rewrite to the fastest div
10742 operation, EXACT_DIV_EXPR.
10744 Note that only CEIL_DIV_EXPR and FLOOR_DIV_EXPR are rewritten now.
10745 At one time others generated faster code, it's not clear if they do
10746 after the last round to changes to the DIV code in expmed.c. */
10747 if ((code
== CEIL_DIV_EXPR
|| code
== FLOOR_DIV_EXPR
)
10748 && multiple_of_p (type
, arg0
, arg1
))
10749 return fold_build2_loc (loc
, EXACT_DIV_EXPR
, type
,
10750 fold_convert (type
, arg0
),
10751 fold_convert (type
, arg1
));
10753 strict_overflow_p
= false;
10754 if (TREE_CODE (arg1
) == INTEGER_CST
10755 && (tem
= extract_muldiv (op0
, arg1
, code
, NULL_TREE
,
10756 &strict_overflow_p
)) != 0)
10758 if (strict_overflow_p
)
10759 fold_overflow_warning (("assuming signed overflow does not occur "
10760 "when simplifying division"),
10761 WARN_STRICT_OVERFLOW_MISC
);
10762 return fold_convert_loc (loc
, type
, tem
);
10767 case CEIL_MOD_EXPR
:
10768 case FLOOR_MOD_EXPR
:
10769 case ROUND_MOD_EXPR
:
10770 case TRUNC_MOD_EXPR
:
10771 strict_overflow_p
= false;
10772 if (TREE_CODE (arg1
) == INTEGER_CST
10773 && (tem
= extract_muldiv (op0
, arg1
, code
, NULL_TREE
,
10774 &strict_overflow_p
)) != 0)
10776 if (strict_overflow_p
)
10777 fold_overflow_warning (("assuming signed overflow does not occur "
10778 "when simplifying modulus"),
10779 WARN_STRICT_OVERFLOW_MISC
);
10780 return fold_convert_loc (loc
, type
, tem
);
10789 /* Since negative shift count is not well-defined,
10790 don't try to compute it in the compiler. */
10791 if (TREE_CODE (arg1
) == INTEGER_CST
&& tree_int_cst_sgn (arg1
) < 0)
10794 prec
= element_precision (type
);
10796 /* If we have a rotate of a bit operation with the rotate count and
10797 the second operand of the bit operation both constant,
10798 permute the two operations. */
10799 if (code
== RROTATE_EXPR
&& TREE_CODE (arg1
) == INTEGER_CST
10800 && (TREE_CODE (arg0
) == BIT_AND_EXPR
10801 || TREE_CODE (arg0
) == BIT_IOR_EXPR
10802 || TREE_CODE (arg0
) == BIT_XOR_EXPR
)
10803 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
10805 tree arg00
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10806 tree arg01
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 1));
10807 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
,
10808 fold_build2_loc (loc
, code
, type
,
10810 fold_build2_loc (loc
, code
, type
,
10814 /* Two consecutive rotates adding up to the some integer
10815 multiple of the precision of the type can be ignored. */
10816 if (code
== RROTATE_EXPR
&& TREE_CODE (arg1
) == INTEGER_CST
10817 && TREE_CODE (arg0
) == RROTATE_EXPR
10818 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
10819 && wi::umod_trunc (wi::to_wide (arg1
)
10820 + wi::to_wide (TREE_OPERAND (arg0
, 1)),
10822 return fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10830 case TRUTH_ANDIF_EXPR
:
10831 /* Note that the operands of this must be ints
10832 and their values must be 0 or 1.
10833 ("true" is a fixed value perhaps depending on the language.) */
10834 /* If first arg is constant zero, return it. */
10835 if (integer_zerop (arg0
))
10836 return fold_convert_loc (loc
, type
, arg0
);
10838 case TRUTH_AND_EXPR
:
10839 /* If either arg is constant true, drop it. */
10840 if (TREE_CODE (arg0
) == INTEGER_CST
&& ! integer_zerop (arg0
))
10841 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg1
));
10842 if (TREE_CODE (arg1
) == INTEGER_CST
&& ! integer_zerop (arg1
)
10843 /* Preserve sequence points. */
10844 && (code
!= TRUTH_ANDIF_EXPR
|| ! TREE_SIDE_EFFECTS (arg0
)))
10845 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
10846 /* If second arg is constant zero, result is zero, but first arg
10847 must be evaluated. */
10848 if (integer_zerop (arg1
))
10849 return omit_one_operand_loc (loc
, type
, arg1
, arg0
);
10850 /* Likewise for first arg, but note that only the TRUTH_AND_EXPR
10851 case will be handled here. */
10852 if (integer_zerop (arg0
))
10853 return omit_one_operand_loc (loc
, type
, arg0
, arg1
);
10855 /* !X && X is always false. */
10856 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
10857 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
10858 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg1
);
10859 /* X && !X is always false. */
10860 if (TREE_CODE (arg1
) == TRUTH_NOT_EXPR
10861 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10862 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
10864 /* A < X && A + 1 > Y ==> A < X && A >= Y. Normally A + 1 > Y
10865 means A >= Y && A != MAX, but in this case we know that
10868 if (!TREE_SIDE_EFFECTS (arg0
)
10869 && !TREE_SIDE_EFFECTS (arg1
))
10871 tem
= fold_to_nonsharp_ineq_using_bound (loc
, arg0
, arg1
);
10872 if (tem
&& !operand_equal_p (tem
, arg0
, 0))
10873 return fold_build2_loc (loc
, code
, type
, tem
, arg1
);
10875 tem
= fold_to_nonsharp_ineq_using_bound (loc
, arg1
, arg0
);
10876 if (tem
&& !operand_equal_p (tem
, arg1
, 0))
10877 return fold_build2_loc (loc
, code
, type
, arg0
, tem
);
10880 if ((tem
= fold_truth_andor (loc
, code
, type
, arg0
, arg1
, op0
, op1
))
10886 case TRUTH_ORIF_EXPR
:
10887 /* Note that the operands of this must be ints
10888 and their values must be 0 or true.
10889 ("true" is a fixed value perhaps depending on the language.) */
10890 /* If first arg is constant true, return it. */
10891 if (TREE_CODE (arg0
) == INTEGER_CST
&& ! integer_zerop (arg0
))
10892 return fold_convert_loc (loc
, type
, arg0
);
10894 case TRUTH_OR_EXPR
:
10895 /* If either arg is constant zero, drop it. */
10896 if (TREE_CODE (arg0
) == INTEGER_CST
&& integer_zerop (arg0
))
10897 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg1
));
10898 if (TREE_CODE (arg1
) == INTEGER_CST
&& integer_zerop (arg1
)
10899 /* Preserve sequence points. */
10900 && (code
!= TRUTH_ORIF_EXPR
|| ! TREE_SIDE_EFFECTS (arg0
)))
10901 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
10902 /* If second arg is constant true, result is true, but we must
10903 evaluate first arg. */
10904 if (TREE_CODE (arg1
) == INTEGER_CST
&& ! integer_zerop (arg1
))
10905 return omit_one_operand_loc (loc
, type
, arg1
, arg0
);
10906 /* Likewise for first arg, but note this only occurs here for
10908 if (TREE_CODE (arg0
) == INTEGER_CST
&& ! integer_zerop (arg0
))
10909 return omit_one_operand_loc (loc
, type
, arg0
, arg1
);
10911 /* !X || X is always true. */
10912 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
10913 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
10914 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg1
);
10915 /* X || !X is always true. */
10916 if (TREE_CODE (arg1
) == TRUTH_NOT_EXPR
10917 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10918 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
10920 /* (X && !Y) || (!X && Y) is X ^ Y */
10921 if (TREE_CODE (arg0
) == TRUTH_AND_EXPR
10922 && TREE_CODE (arg1
) == TRUTH_AND_EXPR
)
10924 tree a0
, a1
, l0
, l1
, n0
, n1
;
10926 a0
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 0));
10927 a1
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 1));
10929 l0
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10930 l1
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 1));
10932 n0
= fold_build1_loc (loc
, TRUTH_NOT_EXPR
, type
, l0
);
10933 n1
= fold_build1_loc (loc
, TRUTH_NOT_EXPR
, type
, l1
);
10935 if ((operand_equal_p (n0
, a0
, 0)
10936 && operand_equal_p (n1
, a1
, 0))
10937 || (operand_equal_p (n0
, a1
, 0)
10938 && operand_equal_p (n1
, a0
, 0)))
10939 return fold_build2_loc (loc
, TRUTH_XOR_EXPR
, type
, l0
, n1
);
10942 if ((tem
= fold_truth_andor (loc
, code
, type
, arg0
, arg1
, op0
, op1
))
10948 case TRUTH_XOR_EXPR
:
10949 /* If the second arg is constant zero, drop it. */
10950 if (integer_zerop (arg1
))
10951 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
10952 /* If the second arg is constant true, this is a logical inversion. */
10953 if (integer_onep (arg1
))
10955 tem
= invert_truthvalue_loc (loc
, arg0
);
10956 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, tem
));
10958 /* Identical arguments cancel to zero. */
10959 if (operand_equal_p (arg0
, arg1
, 0))
10960 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
10962 /* !X ^ X is always true. */
10963 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
10964 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
10965 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg1
);
10967 /* X ^ !X is always true. */
10968 if (TREE_CODE (arg1
) == TRUTH_NOT_EXPR
10969 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10970 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
10979 tem
= fold_comparison (loc
, code
, type
, op0
, op1
);
10980 if (tem
!= NULL_TREE
)
10983 /* bool_var != 1 becomes !bool_var. */
10984 if (TREE_CODE (TREE_TYPE (arg0
)) == BOOLEAN_TYPE
&& integer_onep (arg1
)
10985 && code
== NE_EXPR
)
10986 return fold_convert_loc (loc
, type
,
10987 fold_build1_loc (loc
, TRUTH_NOT_EXPR
,
10988 TREE_TYPE (arg0
), arg0
));
10990 /* bool_var == 0 becomes !bool_var. */
10991 if (TREE_CODE (TREE_TYPE (arg0
)) == BOOLEAN_TYPE
&& integer_zerop (arg1
)
10992 && code
== EQ_EXPR
)
10993 return fold_convert_loc (loc
, type
,
10994 fold_build1_loc (loc
, TRUTH_NOT_EXPR
,
10995 TREE_TYPE (arg0
), arg0
));
10997 /* !exp != 0 becomes !exp */
10998 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
&& integer_zerop (arg1
)
10999 && code
== NE_EXPR
)
11000 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
11002 /* If this is an EQ or NE comparison with zero and ARG0 is
11003 (1 << foo) & bar, convert it to (bar >> foo) & 1. Both require
11004 two operations, but the latter can be done in one less insn
11005 on machines that have only two-operand insns or on which a
11006 constant cannot be the first operand. */
11007 if (TREE_CODE (arg0
) == BIT_AND_EXPR
11008 && integer_zerop (arg1
))
11010 tree arg00
= TREE_OPERAND (arg0
, 0);
11011 tree arg01
= TREE_OPERAND (arg0
, 1);
11012 if (TREE_CODE (arg00
) == LSHIFT_EXPR
11013 && integer_onep (TREE_OPERAND (arg00
, 0)))
11015 tree tem
= fold_build2_loc (loc
, RSHIFT_EXPR
, TREE_TYPE (arg00
),
11016 arg01
, TREE_OPERAND (arg00
, 1));
11017 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg0
), tem
,
11018 build_int_cst (TREE_TYPE (arg0
), 1));
11019 return fold_build2_loc (loc
, code
, type
,
11020 fold_convert_loc (loc
, TREE_TYPE (arg1
), tem
),
11023 else if (TREE_CODE (arg01
) == LSHIFT_EXPR
11024 && integer_onep (TREE_OPERAND (arg01
, 0)))
11026 tree tem
= fold_build2_loc (loc
, RSHIFT_EXPR
, TREE_TYPE (arg01
),
11027 arg00
, TREE_OPERAND (arg01
, 1));
11028 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg0
), tem
,
11029 build_int_cst (TREE_TYPE (arg0
), 1));
11030 return fold_build2_loc (loc
, code
, type
,
11031 fold_convert_loc (loc
, TREE_TYPE (arg1
), tem
),
11036 /* Fold ((X >> C1) & C2) == 0 and ((X >> C1) & C2) != 0 where
11037 C1 is a valid shift constant, and C2 is a power of two, i.e.
11039 if (TREE_CODE (arg0
) == BIT_AND_EXPR
11040 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == RSHIFT_EXPR
11041 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1))
11043 && integer_pow2p (TREE_OPERAND (arg0
, 1))
11044 && integer_zerop (arg1
))
11046 tree itype
= TREE_TYPE (arg0
);
11047 tree arg001
= TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1);
11048 prec
= TYPE_PRECISION (itype
);
11050 /* Check for a valid shift count. */
11051 if (wi::ltu_p (wi::to_wide (arg001
), prec
))
11053 tree arg01
= TREE_OPERAND (arg0
, 1);
11054 tree arg000
= TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0);
11055 unsigned HOST_WIDE_INT log2
= tree_log2 (arg01
);
11056 /* If (C2 << C1) doesn't overflow, then ((X >> C1) & C2) != 0
11057 can be rewritten as (X & (C2 << C1)) != 0. */
11058 if ((log2
+ TREE_INT_CST_LOW (arg001
)) < prec
)
11060 tem
= fold_build2_loc (loc
, LSHIFT_EXPR
, itype
, arg01
, arg001
);
11061 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, itype
, arg000
, tem
);
11062 return fold_build2_loc (loc
, code
, type
, tem
,
11063 fold_convert_loc (loc
, itype
, arg1
));
11065 /* Otherwise, for signed (arithmetic) shifts,
11066 ((X >> C1) & C2) != 0 is rewritten as X < 0, and
11067 ((X >> C1) & C2) == 0 is rewritten as X >= 0. */
11068 else if (!TYPE_UNSIGNED (itype
))
11069 return fold_build2_loc (loc
, code
== EQ_EXPR
? GE_EXPR
: LT_EXPR
, type
,
11070 arg000
, build_int_cst (itype
, 0));
11071 /* Otherwise, of unsigned (logical) shifts,
11072 ((X >> C1) & C2) != 0 is rewritten as (X,false), and
11073 ((X >> C1) & C2) == 0 is rewritten as (X,true). */
11075 return omit_one_operand_loc (loc
, type
,
11076 code
== EQ_EXPR
? integer_one_node
11077 : integer_zero_node
,
11082 /* If this is a comparison of a field, we may be able to simplify it. */
11083 if ((TREE_CODE (arg0
) == COMPONENT_REF
11084 || TREE_CODE (arg0
) == BIT_FIELD_REF
)
11085 /* Handle the constant case even without -O
11086 to make sure the warnings are given. */
11087 && (optimize
|| TREE_CODE (arg1
) == INTEGER_CST
))
11089 t1
= optimize_bit_field_compare (loc
, code
, type
, arg0
, arg1
);
11094 /* Optimize comparisons of strlen vs zero to a compare of the
11095 first character of the string vs zero. To wit,
11096 strlen(ptr) == 0 => *ptr == 0
11097 strlen(ptr) != 0 => *ptr != 0
11098 Other cases should reduce to one of these two (or a constant)
11099 due to the return value of strlen being unsigned. */
11100 if (TREE_CODE (arg0
) == CALL_EXPR
&& integer_zerop (arg1
))
11102 tree fndecl
= get_callee_fndecl (arg0
);
11105 && fndecl_built_in_p (fndecl
, BUILT_IN_STRLEN
)
11106 && call_expr_nargs (arg0
) == 1
11107 && (TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (arg0
, 0)))
11111 = build_pointer_type (build_qualified_type (char_type_node
,
11113 tree ptr
= fold_convert_loc (loc
, ptrtype
,
11114 CALL_EXPR_ARG (arg0
, 0));
11115 tree iref
= build_fold_indirect_ref_loc (loc
, ptr
);
11116 return fold_build2_loc (loc
, code
, type
, iref
,
11117 build_int_cst (TREE_TYPE (iref
), 0));
11121 /* Fold (X >> C) != 0 into X < 0 if C is one less than the width
11122 of X. Similarly fold (X >> C) == 0 into X >= 0. */
11123 if (TREE_CODE (arg0
) == RSHIFT_EXPR
11124 && integer_zerop (arg1
)
11125 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
11127 tree arg00
= TREE_OPERAND (arg0
, 0);
11128 tree arg01
= TREE_OPERAND (arg0
, 1);
11129 tree itype
= TREE_TYPE (arg00
);
11130 if (wi::to_wide (arg01
) == element_precision (itype
) - 1)
11132 if (TYPE_UNSIGNED (itype
))
11134 itype
= signed_type_for (itype
);
11135 arg00
= fold_convert_loc (loc
, itype
, arg00
);
11137 return fold_build2_loc (loc
, code
== EQ_EXPR
? GE_EXPR
: LT_EXPR
,
11138 type
, arg00
, build_zero_cst (itype
));
11142 /* Fold (~X & C) == 0 into (X & C) != 0 and (~X & C) != 0 into
11143 (X & C) == 0 when C is a single bit. */
11144 if (TREE_CODE (arg0
) == BIT_AND_EXPR
11145 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_NOT_EXPR
11146 && integer_zerop (arg1
)
11147 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
11149 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg0
),
11150 TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0),
11151 TREE_OPERAND (arg0
, 1));
11152 return fold_build2_loc (loc
, code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
,
11154 fold_convert_loc (loc
, TREE_TYPE (arg0
),
11158 /* Fold ((X & C) ^ C) eq/ne 0 into (X & C) ne/eq 0, when the
11159 constant C is a power of two, i.e. a single bit. */
11160 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
11161 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_AND_EXPR
11162 && integer_zerop (arg1
)
11163 && integer_pow2p (TREE_OPERAND (arg0
, 1))
11164 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1),
11165 TREE_OPERAND (arg0
, 1), OEP_ONLY_CONST
))
11167 tree arg00
= TREE_OPERAND (arg0
, 0);
11168 return fold_build2_loc (loc
, code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
, type
,
11169 arg00
, build_int_cst (TREE_TYPE (arg00
), 0));
11172 /* Likewise, fold ((X ^ C) & C) eq/ne 0 into (X & C) ne/eq 0,
11173 when is C is a power of two, i.e. a single bit. */
11174 if (TREE_CODE (arg0
) == BIT_AND_EXPR
11175 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_XOR_EXPR
11176 && integer_zerop (arg1
)
11177 && integer_pow2p (TREE_OPERAND (arg0
, 1))
11178 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1),
11179 TREE_OPERAND (arg0
, 1), OEP_ONLY_CONST
))
11181 tree arg000
= TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0);
11182 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg000
),
11183 arg000
, TREE_OPERAND (arg0
, 1));
11184 return fold_build2_loc (loc
, code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
, type
,
11185 tem
, build_int_cst (TREE_TYPE (tem
), 0));
11188 if (integer_zerop (arg1
)
11189 && tree_expr_nonzero_p (arg0
))
11191 tree res
= constant_boolean_node (code
==NE_EXPR
, type
);
11192 return omit_one_operand_loc (loc
, type
, res
, arg0
);
11195 /* Fold (X & C) op (Y & C) as (X ^ Y) & C op 0", and symmetries. */
11196 if (TREE_CODE (arg0
) == BIT_AND_EXPR
11197 && TREE_CODE (arg1
) == BIT_AND_EXPR
)
11199 tree arg00
= TREE_OPERAND (arg0
, 0);
11200 tree arg01
= TREE_OPERAND (arg0
, 1);
11201 tree arg10
= TREE_OPERAND (arg1
, 0);
11202 tree arg11
= TREE_OPERAND (arg1
, 1);
11203 tree itype
= TREE_TYPE (arg0
);
11205 if (operand_equal_p (arg01
, arg11
, 0))
11207 tem
= fold_convert_loc (loc
, itype
, arg10
);
11208 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg00
, tem
);
11209 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, itype
, tem
, arg01
);
11210 return fold_build2_loc (loc
, code
, type
, tem
,
11211 build_zero_cst (itype
));
11213 if (operand_equal_p (arg01
, arg10
, 0))
11215 tem
= fold_convert_loc (loc
, itype
, arg11
);
11216 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg00
, tem
);
11217 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, itype
, tem
, arg01
);
11218 return fold_build2_loc (loc
, code
, type
, tem
,
11219 build_zero_cst (itype
));
11221 if (operand_equal_p (arg00
, arg11
, 0))
11223 tem
= fold_convert_loc (loc
, itype
, arg10
);
11224 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg01
, tem
);
11225 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, itype
, tem
, arg00
);
11226 return fold_build2_loc (loc
, code
, type
, tem
,
11227 build_zero_cst (itype
));
11229 if (operand_equal_p (arg00
, arg10
, 0))
11231 tem
= fold_convert_loc (loc
, itype
, arg11
);
11232 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg01
, tem
);
11233 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, itype
, tem
, arg00
);
11234 return fold_build2_loc (loc
, code
, type
, tem
,
11235 build_zero_cst (itype
));
11239 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
11240 && TREE_CODE (arg1
) == BIT_XOR_EXPR
)
11242 tree arg00
= TREE_OPERAND (arg0
, 0);
11243 tree arg01
= TREE_OPERAND (arg0
, 1);
11244 tree arg10
= TREE_OPERAND (arg1
, 0);
11245 tree arg11
= TREE_OPERAND (arg1
, 1);
11246 tree itype
= TREE_TYPE (arg0
);
11248 /* Optimize (X ^ Z) op (Y ^ Z) as X op Y, and symmetries.
11249 operand_equal_p guarantees no side-effects so we don't need
11250 to use omit_one_operand on Z. */
11251 if (operand_equal_p (arg01
, arg11
, 0))
11252 return fold_build2_loc (loc
, code
, type
, arg00
,
11253 fold_convert_loc (loc
, TREE_TYPE (arg00
),
11255 if (operand_equal_p (arg01
, arg10
, 0))
11256 return fold_build2_loc (loc
, code
, type
, arg00
,
11257 fold_convert_loc (loc
, TREE_TYPE (arg00
),
11259 if (operand_equal_p (arg00
, arg11
, 0))
11260 return fold_build2_loc (loc
, code
, type
, arg01
,
11261 fold_convert_loc (loc
, TREE_TYPE (arg01
),
11263 if (operand_equal_p (arg00
, arg10
, 0))
11264 return fold_build2_loc (loc
, code
, type
, arg01
,
11265 fold_convert_loc (loc
, TREE_TYPE (arg01
),
11268 /* Optimize (X ^ C1) op (Y ^ C2) as (X ^ (C1 ^ C2)) op Y. */
11269 if (TREE_CODE (arg01
) == INTEGER_CST
11270 && TREE_CODE (arg11
) == INTEGER_CST
)
11272 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg01
,
11273 fold_convert_loc (loc
, itype
, arg11
));
11274 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg00
, tem
);
11275 return fold_build2_loc (loc
, code
, type
, tem
,
11276 fold_convert_loc (loc
, itype
, arg10
));
11280 /* Attempt to simplify equality/inequality comparisons of complex
11281 values. Only lower the comparison if the result is known or
11282 can be simplified to a single scalar comparison. */
11283 if ((TREE_CODE (arg0
) == COMPLEX_EXPR
11284 || TREE_CODE (arg0
) == COMPLEX_CST
)
11285 && (TREE_CODE (arg1
) == COMPLEX_EXPR
11286 || TREE_CODE (arg1
) == COMPLEX_CST
))
11288 tree real0
, imag0
, real1
, imag1
;
11291 if (TREE_CODE (arg0
) == COMPLEX_EXPR
)
11293 real0
= TREE_OPERAND (arg0
, 0);
11294 imag0
= TREE_OPERAND (arg0
, 1);
11298 real0
= TREE_REALPART (arg0
);
11299 imag0
= TREE_IMAGPART (arg0
);
11302 if (TREE_CODE (arg1
) == COMPLEX_EXPR
)
11304 real1
= TREE_OPERAND (arg1
, 0);
11305 imag1
= TREE_OPERAND (arg1
, 1);
11309 real1
= TREE_REALPART (arg1
);
11310 imag1
= TREE_IMAGPART (arg1
);
11313 rcond
= fold_binary_loc (loc
, code
, type
, real0
, real1
);
11314 if (rcond
&& TREE_CODE (rcond
) == INTEGER_CST
)
11316 if (integer_zerop (rcond
))
11318 if (code
== EQ_EXPR
)
11319 return omit_two_operands_loc (loc
, type
, boolean_false_node
,
11321 return fold_build2_loc (loc
, NE_EXPR
, type
, imag0
, imag1
);
11325 if (code
== NE_EXPR
)
11326 return omit_two_operands_loc (loc
, type
, boolean_true_node
,
11328 return fold_build2_loc (loc
, EQ_EXPR
, type
, imag0
, imag1
);
11332 icond
= fold_binary_loc (loc
, code
, type
, imag0
, imag1
);
11333 if (icond
&& TREE_CODE (icond
) == INTEGER_CST
)
11335 if (integer_zerop (icond
))
11337 if (code
== EQ_EXPR
)
11338 return omit_two_operands_loc (loc
, type
, boolean_false_node
,
11340 return fold_build2_loc (loc
, NE_EXPR
, type
, real0
, real1
);
11344 if (code
== NE_EXPR
)
11345 return omit_two_operands_loc (loc
, type
, boolean_true_node
,
11347 return fold_build2_loc (loc
, EQ_EXPR
, type
, real0
, real1
);
11358 tem
= fold_comparison (loc
, code
, type
, op0
, op1
);
11359 if (tem
!= NULL_TREE
)
11362 /* Transform comparisons of the form X +- C CMP X. */
11363 if ((TREE_CODE (arg0
) == PLUS_EXPR
|| TREE_CODE (arg0
) == MINUS_EXPR
)
11364 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0)
11365 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == REAL_CST
11366 && !HONOR_SNANS (arg0
))
11368 tree arg01
= TREE_OPERAND (arg0
, 1);
11369 enum tree_code code0
= TREE_CODE (arg0
);
11370 int is_positive
= REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg01
)) ? -1 : 1;
11372 /* (X - c) > X becomes false. */
11373 if (code
== GT_EXPR
11374 && ((code0
== MINUS_EXPR
&& is_positive
>= 0)
11375 || (code0
== PLUS_EXPR
&& is_positive
<= 0)))
11376 return constant_boolean_node (0, type
);
11378 /* Likewise (X + c) < X becomes false. */
11379 if (code
== LT_EXPR
11380 && ((code0
== PLUS_EXPR
&& is_positive
>= 0)
11381 || (code0
== MINUS_EXPR
&& is_positive
<= 0)))
11382 return constant_boolean_node (0, type
);
11384 /* Convert (X - c) <= X to true. */
11385 if (!HONOR_NANS (arg1
)
11387 && ((code0
== MINUS_EXPR
&& is_positive
>= 0)
11388 || (code0
== PLUS_EXPR
&& is_positive
<= 0)))
11389 return constant_boolean_node (1, type
);
11391 /* Convert (X + c) >= X to true. */
11392 if (!HONOR_NANS (arg1
)
11394 && ((code0
== PLUS_EXPR
&& is_positive
>= 0)
11395 || (code0
== MINUS_EXPR
&& is_positive
<= 0)))
11396 return constant_boolean_node (1, type
);
11399 /* If we are comparing an ABS_EXPR with a constant, we can
11400 convert all the cases into explicit comparisons, but they may
11401 well not be faster than doing the ABS and one comparison.
11402 But ABS (X) <= C is a range comparison, which becomes a subtraction
11403 and a comparison, and is probably faster. */
11404 if (code
== LE_EXPR
11405 && TREE_CODE (arg1
) == INTEGER_CST
11406 && TREE_CODE (arg0
) == ABS_EXPR
11407 && ! TREE_SIDE_EFFECTS (arg0
)
11408 && (tem
= negate_expr (arg1
)) != 0
11409 && TREE_CODE (tem
) == INTEGER_CST
11410 && !TREE_OVERFLOW (tem
))
11411 return fold_build2_loc (loc
, TRUTH_ANDIF_EXPR
, type
,
11412 build2 (GE_EXPR
, type
,
11413 TREE_OPERAND (arg0
, 0), tem
),
11414 build2 (LE_EXPR
, type
,
11415 TREE_OPERAND (arg0
, 0), arg1
));
11417 /* Convert ABS_EXPR<x> >= 0 to true. */
11418 strict_overflow_p
= false;
11419 if (code
== GE_EXPR
11420 && (integer_zerop (arg1
)
11421 || (! HONOR_NANS (arg0
)
11422 && real_zerop (arg1
)))
11423 && tree_expr_nonnegative_warnv_p (arg0
, &strict_overflow_p
))
11425 if (strict_overflow_p
)
11426 fold_overflow_warning (("assuming signed overflow does not occur "
11427 "when simplifying comparison of "
11428 "absolute value and zero"),
11429 WARN_STRICT_OVERFLOW_CONDITIONAL
);
11430 return omit_one_operand_loc (loc
, type
,
11431 constant_boolean_node (true, type
),
11435 /* Convert ABS_EXPR<x> < 0 to false. */
11436 strict_overflow_p
= false;
11437 if (code
== LT_EXPR
11438 && (integer_zerop (arg1
) || real_zerop (arg1
))
11439 && tree_expr_nonnegative_warnv_p (arg0
, &strict_overflow_p
))
11441 if (strict_overflow_p
)
11442 fold_overflow_warning (("assuming signed overflow does not occur "
11443 "when simplifying comparison of "
11444 "absolute value and zero"),
11445 WARN_STRICT_OVERFLOW_CONDITIONAL
);
11446 return omit_one_operand_loc (loc
, type
,
11447 constant_boolean_node (false, type
),
11451 /* If X is unsigned, convert X < (1 << Y) into X >> Y == 0
11452 and similarly for >= into !=. */
11453 if ((code
== LT_EXPR
|| code
== GE_EXPR
)
11454 && TYPE_UNSIGNED (TREE_TYPE (arg0
))
11455 && TREE_CODE (arg1
) == LSHIFT_EXPR
11456 && integer_onep (TREE_OPERAND (arg1
, 0)))
11457 return build2_loc (loc
, code
== LT_EXPR
? EQ_EXPR
: NE_EXPR
, type
,
11458 build2 (RSHIFT_EXPR
, TREE_TYPE (arg0
), arg0
,
11459 TREE_OPERAND (arg1
, 1)),
11460 build_zero_cst (TREE_TYPE (arg0
)));
11462 /* Similarly for X < (cast) (1 << Y). But cast can't be narrowing,
11463 otherwise Y might be >= # of bits in X's type and thus e.g.
11464 (unsigned char) (1 << Y) for Y 15 might be 0.
11465 If the cast is widening, then 1 << Y should have unsigned type,
11466 otherwise if Y is number of bits in the signed shift type minus 1,
11467 we can't optimize this. E.g. (unsigned long long) (1 << Y) for Y
11468 31 might be 0xffffffff80000000. */
11469 if ((code
== LT_EXPR
|| code
== GE_EXPR
)
11470 && TYPE_UNSIGNED (TREE_TYPE (arg0
))
11471 && CONVERT_EXPR_P (arg1
)
11472 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == LSHIFT_EXPR
11473 && (element_precision (TREE_TYPE (arg1
))
11474 >= element_precision (TREE_TYPE (TREE_OPERAND (arg1
, 0))))
11475 && (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
11476 || (element_precision (TREE_TYPE (arg1
))
11477 == element_precision (TREE_TYPE (TREE_OPERAND (arg1
, 0)))))
11478 && integer_onep (TREE_OPERAND (TREE_OPERAND (arg1
, 0), 0)))
11480 tem
= build2 (RSHIFT_EXPR
, TREE_TYPE (arg0
), arg0
,
11481 TREE_OPERAND (TREE_OPERAND (arg1
, 0), 1));
11482 return build2_loc (loc
, code
== LT_EXPR
? EQ_EXPR
: NE_EXPR
, type
,
11483 fold_convert_loc (loc
, TREE_TYPE (arg0
), tem
),
11484 build_zero_cst (TREE_TYPE (arg0
)));
11489 case UNORDERED_EXPR
:
11497 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
11499 tree targ0
= strip_float_extensions (arg0
);
11500 tree targ1
= strip_float_extensions (arg1
);
11501 tree newtype
= TREE_TYPE (targ0
);
11503 if (TYPE_PRECISION (TREE_TYPE (targ1
)) > TYPE_PRECISION (newtype
))
11504 newtype
= TREE_TYPE (targ1
);
11506 if (TYPE_PRECISION (newtype
) < TYPE_PRECISION (TREE_TYPE (arg0
)))
11507 return fold_build2_loc (loc
, code
, type
,
11508 fold_convert_loc (loc
, newtype
, targ0
),
11509 fold_convert_loc (loc
, newtype
, targ1
));
11514 case COMPOUND_EXPR
:
11515 /* When pedantic, a compound expression can be neither an lvalue
11516 nor an integer constant expression. */
11517 if (TREE_SIDE_EFFECTS (arg0
) || TREE_CONSTANT (arg1
))
11519 /* Don't let (0, 0) be null pointer constant. */
11520 tem
= integer_zerop (arg1
) ? build1 (NOP_EXPR
, type
, arg1
)
11521 : fold_convert_loc (loc
, type
, arg1
);
11522 return pedantic_non_lvalue_loc (loc
, tem
);
11525 /* An ASSERT_EXPR should never be passed to fold_binary. */
11526 gcc_unreachable ();
11530 } /* switch (code) */
11533 /* For constants M and N, if M == (1LL << cst) - 1 && (N & M) == M,
11534 ((A & N) + B) & M -> (A + B) & M
11535 Similarly if (N & M) == 0,
11536 ((A | N) + B) & M -> (A + B) & M
11537 and for - instead of + (or unary - instead of +)
11538 and/or ^ instead of |.
11539 If B is constant and (B & M) == 0, fold into A & M.
11541 This function is a helper for match.pd patterns. Return non-NULL
11542 type in which the simplified operation should be performed only
11543 if any optimization is possible.
11545 ARG1 is M above, ARG00 is left operand of +/-, if CODE00 is BIT_*_EXPR,
11546 then ARG00{0,1} are operands of that bitop, otherwise CODE00 is ERROR_MARK.
11547 Similarly for ARG01, CODE01 and ARG01{0,1}, just for the right operand of
11550 fold_bit_and_mask (tree type
, tree arg1
, enum tree_code code
,
11551 tree arg00
, enum tree_code code00
, tree arg000
, tree arg001
,
11552 tree arg01
, enum tree_code code01
, tree arg010
, tree arg011
,
11555 gcc_assert (TREE_CODE (arg1
) == INTEGER_CST
);
11556 gcc_assert (code
== PLUS_EXPR
|| code
== MINUS_EXPR
|| code
== NEGATE_EXPR
);
11557 wi::tree_to_wide_ref cst1
= wi::to_wide (arg1
);
11559 || (cst1
& (cst1
+ 1)) != 0
11560 || !INTEGRAL_TYPE_P (type
)
11561 || (!TYPE_OVERFLOW_WRAPS (type
)
11562 && TREE_CODE (type
) != INTEGER_TYPE
)
11563 || (wi::max_value (type
) & cst1
) != cst1
)
11566 enum tree_code codes
[2] = { code00
, code01
};
11567 tree arg0xx
[4] = { arg000
, arg001
, arg010
, arg011
};
11571 /* Now we know that arg0 is (C + D) or (C - D) or -C and
11572 arg1 (M) is == (1LL << cst) - 1.
11573 Store C into PMOP[0] and D into PMOP[1]. */
11576 which
= code
!= NEGATE_EXPR
;
11578 for (; which
>= 0; which
--)
11579 switch (codes
[which
])
11584 gcc_assert (TREE_CODE (arg0xx
[2 * which
+ 1]) == INTEGER_CST
);
11585 cst0
= wi::to_wide (arg0xx
[2 * which
+ 1]) & cst1
;
11586 if (codes
[which
] == BIT_AND_EXPR
)
11591 else if (cst0
!= 0)
11593 /* If C or D is of the form (A & N) where
11594 (N & M) == M, or of the form (A | N) or
11595 (A ^ N) where (N & M) == 0, replace it with A. */
11596 pmop
[which
] = arg0xx
[2 * which
];
11599 if (TREE_CODE (pmop
[which
]) != INTEGER_CST
)
11601 /* If C or D is a N where (N & M) == 0, it can be
11602 omitted (replaced with 0). */
11603 if ((code
== PLUS_EXPR
11604 || (code
== MINUS_EXPR
&& which
== 0))
11605 && (cst1
& wi::to_wide (pmop
[which
])) == 0)
11606 pmop
[which
] = build_int_cst (type
, 0);
11607 /* Similarly, with C - N where (-N & M) == 0. */
11608 if (code
== MINUS_EXPR
11610 && (cst1
& -wi::to_wide (pmop
[which
])) == 0)
11611 pmop
[which
] = build_int_cst (type
, 0);
11614 gcc_unreachable ();
11617 /* Only build anything new if we optimized one or both arguments above. */
11618 if (pmop
[0] == arg00
&& pmop
[1] == arg01
)
11621 if (TYPE_OVERFLOW_WRAPS (type
))
11624 return unsigned_type_for (type
);
11627 /* Used by contains_label_[p1]. */
11629 struct contains_label_data
11631 hash_set
<tree
> *pset
;
11632 bool inside_switch_p
;
11635 /* Callback for walk_tree, looking for LABEL_EXPR. Return *TP if it is
11636 a LABEL_EXPR or CASE_LABEL_EXPR not inside of another SWITCH_EXPR; otherwise
11637 return NULL_TREE. Do not check the subtrees of GOTO_EXPR. */
11640 contains_label_1 (tree
*tp
, int *walk_subtrees
, void *data
)
11642 contains_label_data
*d
= (contains_label_data
*) data
;
11643 switch (TREE_CODE (*tp
))
11648 case CASE_LABEL_EXPR
:
11649 if (!d
->inside_switch_p
)
11654 if (!d
->inside_switch_p
)
11656 if (walk_tree (&SWITCH_COND (*tp
), contains_label_1
, data
, d
->pset
))
11658 d
->inside_switch_p
= true;
11659 if (walk_tree (&SWITCH_BODY (*tp
), contains_label_1
, data
, d
->pset
))
11661 d
->inside_switch_p
= false;
11662 *walk_subtrees
= 0;
11667 *walk_subtrees
= 0;
11675 /* Return whether the sub-tree ST contains a label which is accessible from
11676 outside the sub-tree. */
11679 contains_label_p (tree st
)
11681 hash_set
<tree
> pset
;
11682 contains_label_data data
= { &pset
, false };
11683 return walk_tree (&st
, contains_label_1
, &data
, &pset
) != NULL_TREE
;
11686 /* Fold a ternary expression of code CODE and type TYPE with operands
11687 OP0, OP1, and OP2. Return the folded expression if folding is
11688 successful. Otherwise, return NULL_TREE. */
11691 fold_ternary_loc (location_t loc
, enum tree_code code
, tree type
,
11692 tree op0
, tree op1
, tree op2
)
11695 tree arg0
= NULL_TREE
, arg1
= NULL_TREE
, arg2
= NULL_TREE
;
11696 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
11698 gcc_assert (IS_EXPR_CODE_CLASS (kind
)
11699 && TREE_CODE_LENGTH (code
) == 3);
11701 /* If this is a commutative operation, and OP0 is a constant, move it
11702 to OP1 to reduce the number of tests below. */
11703 if (commutative_ternary_tree_code (code
)
11704 && tree_swap_operands_p (op0
, op1
))
11705 return fold_build3_loc (loc
, code
, type
, op1
, op0
, op2
);
11707 tem
= generic_simplify (loc
, code
, type
, op0
, op1
, op2
);
11711 /* Strip any conversions that don't change the mode. This is safe
11712 for every expression, except for a comparison expression because
11713 its signedness is derived from its operands. So, in the latter
11714 case, only strip conversions that don't change the signedness.
11716 Note that this is done as an internal manipulation within the
11717 constant folder, in order to find the simplest representation of
11718 the arguments so that their form can be studied. In any cases,
11719 the appropriate type conversions should be put back in the tree
11720 that will get out of the constant folder. */
11741 case COMPONENT_REF
:
11742 if (TREE_CODE (arg0
) == CONSTRUCTOR
11743 && ! type_contains_placeholder_p (TREE_TYPE (arg0
)))
11745 unsigned HOST_WIDE_INT idx
;
11747 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg0
), idx
, field
, value
)
11754 case VEC_COND_EXPR
:
11755 /* Pedantic ANSI C says that a conditional expression is never an lvalue,
11756 so all simple results must be passed through pedantic_non_lvalue. */
11757 if (TREE_CODE (arg0
) == INTEGER_CST
)
11759 tree unused_op
= integer_zerop (arg0
) ? op1
: op2
;
11760 tem
= integer_zerop (arg0
) ? op2
: op1
;
11761 /* Only optimize constant conditions when the selected branch
11762 has the same type as the COND_EXPR. This avoids optimizing
11763 away "c ? x : throw", where the throw has a void type.
11764 Avoid throwing away that operand which contains label. */
11765 if ((!TREE_SIDE_EFFECTS (unused_op
)
11766 || !contains_label_p (unused_op
))
11767 && (! VOID_TYPE_P (TREE_TYPE (tem
))
11768 || VOID_TYPE_P (type
)))
11769 return pedantic_non_lvalue_loc (loc
, tem
);
11772 else if (TREE_CODE (arg0
) == VECTOR_CST
)
11774 unsigned HOST_WIDE_INT nelts
;
11775 if ((TREE_CODE (arg1
) == VECTOR_CST
11776 || TREE_CODE (arg1
) == CONSTRUCTOR
)
11777 && (TREE_CODE (arg2
) == VECTOR_CST
11778 || TREE_CODE (arg2
) == CONSTRUCTOR
)
11779 && TYPE_VECTOR_SUBPARTS (type
).is_constant (&nelts
))
11781 vec_perm_builder
sel (nelts
, nelts
, 1);
11782 for (unsigned int i
= 0; i
< nelts
; i
++)
11784 tree val
= VECTOR_CST_ELT (arg0
, i
);
11785 if (integer_all_onesp (val
))
11786 sel
.quick_push (i
);
11787 else if (integer_zerop (val
))
11788 sel
.quick_push (nelts
+ i
);
11789 else /* Currently unreachable. */
11792 vec_perm_indices
indices (sel
, 2, nelts
);
11793 tree t
= fold_vec_perm (type
, arg1
, arg2
, indices
);
11794 if (t
!= NULL_TREE
)
11799 /* If we have A op B ? A : C, we may be able to convert this to a
11800 simpler expression, depending on the operation and the values
11801 of B and C. Signed zeros prevent all of these transformations,
11802 for reasons given above each one.
11804 Also try swapping the arguments and inverting the conditional. */
11805 if (COMPARISON_CLASS_P (arg0
)
11806 && operand_equal_for_comparison_p (TREE_OPERAND (arg0
, 0), op1
)
11807 && !HONOR_SIGNED_ZEROS (element_mode (op1
)))
11809 tem
= fold_cond_expr_with_comparison (loc
, type
, arg0
, op1
, op2
);
11814 if (COMPARISON_CLASS_P (arg0
)
11815 && operand_equal_for_comparison_p (TREE_OPERAND (arg0
, 0), op2
)
11816 && !HONOR_SIGNED_ZEROS (element_mode (op2
)))
11818 location_t loc0
= expr_location_or (arg0
, loc
);
11819 tem
= fold_invert_truthvalue (loc0
, arg0
);
11820 if (tem
&& COMPARISON_CLASS_P (tem
))
11822 tem
= fold_cond_expr_with_comparison (loc
, type
, tem
, op2
, op1
);
11828 /* If the second operand is simpler than the third, swap them
11829 since that produces better jump optimization results. */
11830 if (truth_value_p (TREE_CODE (arg0
))
11831 && tree_swap_operands_p (op1
, op2
))
11833 location_t loc0
= expr_location_or (arg0
, loc
);
11834 /* See if this can be inverted. If it can't, possibly because
11835 it was a floating-point inequality comparison, don't do
11837 tem
= fold_invert_truthvalue (loc0
, arg0
);
11839 return fold_build3_loc (loc
, code
, type
, tem
, op2
, op1
);
11842 /* Convert A ? 1 : 0 to simply A. */
11843 if ((code
== VEC_COND_EXPR
? integer_all_onesp (op1
)
11844 : (integer_onep (op1
)
11845 && !VECTOR_TYPE_P (type
)))
11846 && integer_zerop (op2
)
11847 /* If we try to convert OP0 to our type, the
11848 call to fold will try to move the conversion inside
11849 a COND, which will recurse. In that case, the COND_EXPR
11850 is probably the best choice, so leave it alone. */
11851 && type
== TREE_TYPE (arg0
))
11852 return pedantic_non_lvalue_loc (loc
, arg0
);
11854 /* Convert A ? 0 : 1 to !A. This prefers the use of NOT_EXPR
11855 over COND_EXPR in cases such as floating point comparisons. */
11856 if (integer_zerop (op1
)
11857 && code
== COND_EXPR
11858 && integer_onep (op2
)
11859 && !VECTOR_TYPE_P (type
)
11860 && truth_value_p (TREE_CODE (arg0
)))
11861 return pedantic_non_lvalue_loc (loc
,
11862 fold_convert_loc (loc
, type
,
11863 invert_truthvalue_loc (loc
,
11866 /* A < 0 ? <sign bit of A> : 0 is simply (A & <sign bit of A>). */
11867 if (TREE_CODE (arg0
) == LT_EXPR
11868 && integer_zerop (TREE_OPERAND (arg0
, 1))
11869 && integer_zerop (op2
)
11870 && (tem
= sign_bit_p (TREE_OPERAND (arg0
, 0), arg1
)))
11872 /* sign_bit_p looks through both zero and sign extensions,
11873 but for this optimization only sign extensions are
11875 tree tem2
= TREE_OPERAND (arg0
, 0);
11876 while (tem
!= tem2
)
11878 if (TREE_CODE (tem2
) != NOP_EXPR
11879 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (tem2
, 0))))
11884 tem2
= TREE_OPERAND (tem2
, 0);
11886 /* sign_bit_p only checks ARG1 bits within A's precision.
11887 If <sign bit of A> has wider type than A, bits outside
11888 of A's precision in <sign bit of A> need to be checked.
11889 If they are all 0, this optimization needs to be done
11890 in unsigned A's type, if they are all 1 in signed A's type,
11891 otherwise this can't be done. */
11893 && TYPE_PRECISION (TREE_TYPE (tem
))
11894 < TYPE_PRECISION (TREE_TYPE (arg1
))
11895 && TYPE_PRECISION (TREE_TYPE (tem
))
11896 < TYPE_PRECISION (type
))
11898 int inner_width
, outer_width
;
11901 inner_width
= TYPE_PRECISION (TREE_TYPE (tem
));
11902 outer_width
= TYPE_PRECISION (TREE_TYPE (arg1
));
11903 if (outer_width
> TYPE_PRECISION (type
))
11904 outer_width
= TYPE_PRECISION (type
);
11906 wide_int mask
= wi::shifted_mask
11907 (inner_width
, outer_width
- inner_width
, false,
11908 TYPE_PRECISION (TREE_TYPE (arg1
)));
11910 wide_int common
= mask
& wi::to_wide (arg1
);
11911 if (common
== mask
)
11913 tem_type
= signed_type_for (TREE_TYPE (tem
));
11914 tem
= fold_convert_loc (loc
, tem_type
, tem
);
11916 else if (common
== 0)
11918 tem_type
= unsigned_type_for (TREE_TYPE (tem
));
11919 tem
= fold_convert_loc (loc
, tem_type
, tem
);
11927 fold_convert_loc (loc
, type
,
11928 fold_build2_loc (loc
, BIT_AND_EXPR
,
11929 TREE_TYPE (tem
), tem
,
11930 fold_convert_loc (loc
,
11935 /* (A >> N) & 1 ? (1 << N) : 0 is simply A & (1 << N). A & 1 was
11936 already handled above. */
11937 if (TREE_CODE (arg0
) == BIT_AND_EXPR
11938 && integer_onep (TREE_OPERAND (arg0
, 1))
11939 && integer_zerop (op2
)
11940 && integer_pow2p (arg1
))
11942 tree tem
= TREE_OPERAND (arg0
, 0);
11944 if (TREE_CODE (tem
) == RSHIFT_EXPR
11945 && tree_fits_uhwi_p (TREE_OPERAND (tem
, 1))
11946 && (unsigned HOST_WIDE_INT
) tree_log2 (arg1
)
11947 == tree_to_uhwi (TREE_OPERAND (tem
, 1)))
11948 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
11949 fold_convert_loc (loc
, type
,
11950 TREE_OPERAND (tem
, 0)),
11954 /* A & N ? N : 0 is simply A & N if N is a power of two. This
11955 is probably obsolete because the first operand should be a
11956 truth value (that's why we have the two cases above), but let's
11957 leave it in until we can confirm this for all front-ends. */
11958 if (integer_zerop (op2
)
11959 && TREE_CODE (arg0
) == NE_EXPR
11960 && integer_zerop (TREE_OPERAND (arg0
, 1))
11961 && integer_pow2p (arg1
)
11962 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_AND_EXPR
11963 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1),
11964 arg1
, OEP_ONLY_CONST
)
11965 /* operand_equal_p compares just value, not precision, so e.g.
11966 arg1 could be 8-bit -128 and be power of two, but BIT_AND_EXPR
11967 second operand 32-bit -128, which is not a power of two (or vice
11969 && integer_pow2p (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1)))
11970 return pedantic_non_lvalue_loc (loc
,
11971 fold_convert_loc (loc
, type
,
11972 TREE_OPERAND (arg0
,
11975 /* Disable the transformations below for vectors, since
11976 fold_binary_op_with_conditional_arg may undo them immediately,
11977 yielding an infinite loop. */
11978 if (code
== VEC_COND_EXPR
)
11981 /* Convert A ? B : 0 into A && B if A and B are truth values. */
11982 if (integer_zerop (op2
)
11983 && truth_value_p (TREE_CODE (arg0
))
11984 && truth_value_p (TREE_CODE (arg1
))
11985 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
11986 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
? BIT_AND_EXPR
11987 : TRUTH_ANDIF_EXPR
,
11988 type
, fold_convert_loc (loc
, type
, arg0
), op1
);
11990 /* Convert A ? B : 1 into !A || B if A and B are truth values. */
11991 if (code
== VEC_COND_EXPR
? integer_all_onesp (op2
) : integer_onep (op2
)
11992 && truth_value_p (TREE_CODE (arg0
))
11993 && truth_value_p (TREE_CODE (arg1
))
11994 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
11996 location_t loc0
= expr_location_or (arg0
, loc
);
11997 /* Only perform transformation if ARG0 is easily inverted. */
11998 tem
= fold_invert_truthvalue (loc0
, arg0
);
12000 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
12003 type
, fold_convert_loc (loc
, type
, tem
),
12007 /* Convert A ? 0 : B into !A && B if A and B are truth values. */
12008 if (integer_zerop (arg1
)
12009 && truth_value_p (TREE_CODE (arg0
))
12010 && truth_value_p (TREE_CODE (op2
))
12011 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
12013 location_t loc0
= expr_location_or (arg0
, loc
);
12014 /* Only perform transformation if ARG0 is easily inverted. */
12015 tem
= fold_invert_truthvalue (loc0
, arg0
);
12017 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
12018 ? BIT_AND_EXPR
: TRUTH_ANDIF_EXPR
,
12019 type
, fold_convert_loc (loc
, type
, tem
),
12023 /* Convert A ? 1 : B into A || B if A and B are truth values. */
12024 if (code
== VEC_COND_EXPR
? integer_all_onesp (arg1
) : integer_onep (arg1
)
12025 && truth_value_p (TREE_CODE (arg0
))
12026 && truth_value_p (TREE_CODE (op2
))
12027 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
12028 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
12029 ? BIT_IOR_EXPR
: TRUTH_ORIF_EXPR
,
12030 type
, fold_convert_loc (loc
, type
, arg0
), op2
);
12035 /* CALL_EXPRs used to be ternary exprs. Catch any mistaken uses
12036 of fold_ternary on them. */
12037 gcc_unreachable ();
12039 case BIT_FIELD_REF
:
12040 if (TREE_CODE (arg0
) == VECTOR_CST
12041 && (type
== TREE_TYPE (TREE_TYPE (arg0
))
12042 || (VECTOR_TYPE_P (type
)
12043 && TREE_TYPE (type
) == TREE_TYPE (TREE_TYPE (arg0
))))
12044 && tree_fits_uhwi_p (op1
)
12045 && tree_fits_uhwi_p (op2
))
12047 tree eltype
= TREE_TYPE (TREE_TYPE (arg0
));
12048 unsigned HOST_WIDE_INT width
= tree_to_uhwi (TYPE_SIZE (eltype
));
12049 unsigned HOST_WIDE_INT n
= tree_to_uhwi (arg1
);
12050 unsigned HOST_WIDE_INT idx
= tree_to_uhwi (op2
);
12053 && (idx
% width
) == 0
12054 && (n
% width
) == 0
12055 && known_le ((idx
+ n
) / width
,
12056 TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0
))))
12061 if (TREE_CODE (arg0
) == VECTOR_CST
)
12065 tem
= VECTOR_CST_ELT (arg0
, idx
);
12066 if (VECTOR_TYPE_P (type
))
12067 tem
= fold_build1 (VIEW_CONVERT_EXPR
, type
, tem
);
12071 tree_vector_builder
vals (type
, n
, 1);
12072 for (unsigned i
= 0; i
< n
; ++i
)
12073 vals
.quick_push (VECTOR_CST_ELT (arg0
, idx
+ i
));
12074 return vals
.build ();
12079 /* On constants we can use native encode/interpret to constant
12080 fold (nearly) all BIT_FIELD_REFs. */
12081 if (CONSTANT_CLASS_P (arg0
)
12082 && can_native_interpret_type_p (type
)
12083 && BITS_PER_UNIT
== 8
12084 && tree_fits_uhwi_p (op1
)
12085 && tree_fits_uhwi_p (op2
))
12087 unsigned HOST_WIDE_INT bitpos
= tree_to_uhwi (op2
);
12088 unsigned HOST_WIDE_INT bitsize
= tree_to_uhwi (op1
);
12089 /* Limit us to a reasonable amount of work. To relax the
12090 other limitations we need bit-shifting of the buffer
12091 and rounding up the size. */
12092 if (bitpos
% BITS_PER_UNIT
== 0
12093 && bitsize
% BITS_PER_UNIT
== 0
12094 && bitsize
<= MAX_BITSIZE_MODE_ANY_MODE
)
12096 unsigned char b
[MAX_BITSIZE_MODE_ANY_MODE
/ BITS_PER_UNIT
];
12097 unsigned HOST_WIDE_INT len
12098 = native_encode_expr (arg0
, b
, bitsize
/ BITS_PER_UNIT
,
12099 bitpos
/ BITS_PER_UNIT
);
12101 && len
* BITS_PER_UNIT
>= bitsize
)
12103 tree v
= native_interpret_expr (type
, b
,
12104 bitsize
/ BITS_PER_UNIT
);
12113 case VEC_PERM_EXPR
:
12114 /* Perform constant folding of BIT_INSERT_EXPR. */
12115 if (TREE_CODE (arg2
) == VECTOR_CST
12116 && TREE_CODE (op0
) == VECTOR_CST
12117 && TREE_CODE (op1
) == VECTOR_CST
)
12119 /* Build a vector of integers from the tree mask. */
12120 vec_perm_builder builder
;
12121 if (!tree_to_vec_perm_builder (&builder
, arg2
))
12124 /* Create a vec_perm_indices for the integer vector. */
12125 poly_uint64 nelts
= TYPE_VECTOR_SUBPARTS (type
);
12126 bool single_arg
= (op0
== op1
);
12127 vec_perm_indices
sel (builder
, single_arg
? 1 : 2, nelts
);
12128 return fold_vec_perm (type
, op0
, op1
, sel
);
12132 case BIT_INSERT_EXPR
:
12133 /* Perform (partial) constant folding of BIT_INSERT_EXPR. */
12134 if (TREE_CODE (arg0
) == INTEGER_CST
12135 && TREE_CODE (arg1
) == INTEGER_CST
)
12137 unsigned HOST_WIDE_INT bitpos
= tree_to_uhwi (op2
);
12138 unsigned bitsize
= TYPE_PRECISION (TREE_TYPE (arg1
));
12139 wide_int tem
= (wi::to_wide (arg0
)
12140 & wi::shifted_mask (bitpos
, bitsize
, true,
12141 TYPE_PRECISION (type
)));
12143 = wi::lshift (wi::zext (wi::to_wide (arg1
, TYPE_PRECISION (type
)),
12145 return wide_int_to_tree (type
, wi::bit_or (tem
, tem2
));
12147 else if (TREE_CODE (arg0
) == VECTOR_CST
12148 && CONSTANT_CLASS_P (arg1
)
12149 && types_compatible_p (TREE_TYPE (TREE_TYPE (arg0
)),
12152 unsigned HOST_WIDE_INT bitpos
= tree_to_uhwi (op2
);
12153 unsigned HOST_WIDE_INT elsize
12154 = tree_to_uhwi (TYPE_SIZE (TREE_TYPE (arg1
)));
12155 if (bitpos
% elsize
== 0)
12157 unsigned k
= bitpos
/ elsize
;
12158 unsigned HOST_WIDE_INT nelts
;
12159 if (operand_equal_p (VECTOR_CST_ELT (arg0
, k
), arg1
, 0))
12161 else if (VECTOR_CST_NELTS (arg0
).is_constant (&nelts
))
12163 tree_vector_builder
elts (type
, nelts
, 1);
12164 elts
.quick_grow (nelts
);
12165 for (unsigned HOST_WIDE_INT i
= 0; i
< nelts
; ++i
)
12166 elts
[i
] = (i
== k
? arg1
: VECTOR_CST_ELT (arg0
, i
));
12167 return elts
.build ();
12175 } /* switch (code) */
12178 /* Gets the element ACCESS_INDEX from CTOR, which must be a CONSTRUCTOR
12179 of an array (or vector). *CTOR_IDX if non-NULL is updated with the
12180 constructor element index of the value returned. If the element is
12181 not found NULL_TREE is returned and *CTOR_IDX is updated to
12182 the index of the element after the ACCESS_INDEX position (which
12183 may be outside of the CTOR array). */
12186 get_array_ctor_element_at_index (tree ctor
, offset_int access_index
,
12187 unsigned *ctor_idx
)
12189 tree index_type
= NULL_TREE
;
12190 signop index_sgn
= UNSIGNED
;
12191 offset_int low_bound
= 0;
12193 if (TREE_CODE (TREE_TYPE (ctor
)) == ARRAY_TYPE
)
12195 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ctor
));
12196 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
12198 /* Static constructors for variably sized objects makes no sense. */
12199 gcc_assert (TREE_CODE (TYPE_MIN_VALUE (domain_type
)) == INTEGER_CST
);
12200 index_type
= TREE_TYPE (TYPE_MIN_VALUE (domain_type
));
12201 /* ??? When it is obvious that the range is signed, treat it so. */
12202 if (TYPE_UNSIGNED (index_type
)
12203 && TYPE_MAX_VALUE (domain_type
)
12204 && tree_int_cst_lt (TYPE_MAX_VALUE (domain_type
),
12205 TYPE_MIN_VALUE (domain_type
)))
12207 index_sgn
= SIGNED
;
12209 = offset_int::from (wi::to_wide (TYPE_MIN_VALUE (domain_type
)),
12214 index_sgn
= TYPE_SIGN (index_type
);
12215 low_bound
= wi::to_offset (TYPE_MIN_VALUE (domain_type
));
12221 access_index
= wi::ext (access_index
, TYPE_PRECISION (index_type
),
12224 offset_int index
= low_bound
;
12226 index
= wi::ext (index
, TYPE_PRECISION (index_type
), index_sgn
);
12228 offset_int max_index
= index
;
12231 bool first_p
= true;
12233 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor
), cnt
, cfield
, cval
)
12235 /* Array constructor might explicitly set index, or specify a range,
12236 or leave index NULL meaning that it is next index after previous
12240 if (TREE_CODE (cfield
) == INTEGER_CST
)
12242 = offset_int::from (wi::to_wide (cfield
), index_sgn
);
12245 gcc_assert (TREE_CODE (cfield
) == RANGE_EXPR
);
12246 index
= offset_int::from (wi::to_wide (TREE_OPERAND (cfield
, 0)),
12249 = offset_int::from (wi::to_wide (TREE_OPERAND (cfield
, 1)),
12251 gcc_checking_assert (wi::le_p (index
, max_index
, index_sgn
));
12256 index
= max_index
+ 1;
12258 index
= wi::ext (index
, TYPE_PRECISION (index_type
), index_sgn
);
12259 gcc_checking_assert (wi::gt_p (index
, max_index
, index_sgn
));
12265 /* Do we have match? */
12266 if (wi::cmp (access_index
, index
, index_sgn
) >= 0)
12268 if (wi::cmp (access_index
, max_index
, index_sgn
) <= 0)
12275 else if (in_gimple_form
)
12276 /* We're past the element we search for. Note during parsing
12277 the elements might not be sorted.
12278 ??? We should use a binary search and a flag on the
12279 CONSTRUCTOR as to whether elements are sorted in declaration
12288 /* Perform constant folding and related simplification of EXPR.
12289 The related simplifications include x*1 => x, x*0 => 0, etc.,
12290 and application of the associative law.
12291 NOP_EXPR conversions may be removed freely (as long as we
12292 are careful not to change the type of the overall expression).
12293 We cannot simplify through a CONVERT_EXPR, FIX_EXPR or FLOAT_EXPR,
12294 but we can constant-fold them if they have constant operands. */
12296 #ifdef ENABLE_FOLD_CHECKING
12297 # define fold(x) fold_1 (x)
12298 static tree
fold_1 (tree
);
12304 const tree t
= expr
;
12305 enum tree_code code
= TREE_CODE (t
);
12306 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
12308 location_t loc
= EXPR_LOCATION (expr
);
12310 /* Return right away if a constant. */
12311 if (kind
== tcc_constant
)
12314 /* CALL_EXPR-like objects with variable numbers of operands are
12315 treated specially. */
12316 if (kind
== tcc_vl_exp
)
12318 if (code
== CALL_EXPR
)
12320 tem
= fold_call_expr (loc
, expr
, false);
12321 return tem
? tem
: expr
;
12326 if (IS_EXPR_CODE_CLASS (kind
))
12328 tree type
= TREE_TYPE (t
);
12329 tree op0
, op1
, op2
;
12331 switch (TREE_CODE_LENGTH (code
))
12334 op0
= TREE_OPERAND (t
, 0);
12335 tem
= fold_unary_loc (loc
, code
, type
, op0
);
12336 return tem
? tem
: expr
;
12338 op0
= TREE_OPERAND (t
, 0);
12339 op1
= TREE_OPERAND (t
, 1);
12340 tem
= fold_binary_loc (loc
, code
, type
, op0
, op1
);
12341 return tem
? tem
: expr
;
12343 op0
= TREE_OPERAND (t
, 0);
12344 op1
= TREE_OPERAND (t
, 1);
12345 op2
= TREE_OPERAND (t
, 2);
12346 tem
= fold_ternary_loc (loc
, code
, type
, op0
, op1
, op2
);
12347 return tem
? tem
: expr
;
12357 tree op0
= TREE_OPERAND (t
, 0);
12358 tree op1
= TREE_OPERAND (t
, 1);
12360 if (TREE_CODE (op1
) == INTEGER_CST
12361 && TREE_CODE (op0
) == CONSTRUCTOR
12362 && ! type_contains_placeholder_p (TREE_TYPE (op0
)))
12364 tree val
= get_array_ctor_element_at_index (op0
,
12365 wi::to_offset (op1
));
12373 /* Return a VECTOR_CST if possible. */
12376 tree type
= TREE_TYPE (t
);
12377 if (TREE_CODE (type
) != VECTOR_TYPE
)
12382 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (t
), i
, val
)
12383 if (! CONSTANT_CLASS_P (val
))
12386 return build_vector_from_ctor (type
, CONSTRUCTOR_ELTS (t
));
12390 return fold (DECL_INITIAL (t
));
12394 } /* switch (code) */
12397 #ifdef ENABLE_FOLD_CHECKING
12400 static void fold_checksum_tree (const_tree
, struct md5_ctx
*,
12401 hash_table
<nofree_ptr_hash
<const tree_node
> > *);
12402 static void fold_check_failed (const_tree
, const_tree
);
12403 void print_fold_checksum (const_tree
);
12405 /* When --enable-checking=fold, compute a digest of expr before
12406 and after actual fold call to see if fold did not accidentally
12407 change original expr. */
12413 struct md5_ctx ctx
;
12414 unsigned char checksum_before
[16], checksum_after
[16];
12415 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12417 md5_init_ctx (&ctx
);
12418 fold_checksum_tree (expr
, &ctx
, &ht
);
12419 md5_finish_ctx (&ctx
, checksum_before
);
12422 ret
= fold_1 (expr
);
12424 md5_init_ctx (&ctx
);
12425 fold_checksum_tree (expr
, &ctx
, &ht
);
12426 md5_finish_ctx (&ctx
, checksum_after
);
12428 if (memcmp (checksum_before
, checksum_after
, 16))
12429 fold_check_failed (expr
, ret
);
12435 print_fold_checksum (const_tree expr
)
12437 struct md5_ctx ctx
;
12438 unsigned char checksum
[16], cnt
;
12439 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12441 md5_init_ctx (&ctx
);
12442 fold_checksum_tree (expr
, &ctx
, &ht
);
12443 md5_finish_ctx (&ctx
, checksum
);
12444 for (cnt
= 0; cnt
< 16; ++cnt
)
12445 fprintf (stderr
, "%02x", checksum
[cnt
]);
12446 putc ('\n', stderr
);
12450 fold_check_failed (const_tree expr ATTRIBUTE_UNUSED
, const_tree ret ATTRIBUTE_UNUSED
)
12452 internal_error ("fold check: original tree changed by fold");
12456 fold_checksum_tree (const_tree expr
, struct md5_ctx
*ctx
,
12457 hash_table
<nofree_ptr_hash
<const tree_node
> > *ht
)
12459 const tree_node
**slot
;
12460 enum tree_code code
;
12461 union tree_node
*buf
;
12467 slot
= ht
->find_slot (expr
, INSERT
);
12471 code
= TREE_CODE (expr
);
12472 if (TREE_CODE_CLASS (code
) == tcc_declaration
12473 && HAS_DECL_ASSEMBLER_NAME_P (expr
))
12475 /* Allow DECL_ASSEMBLER_NAME and symtab_node to be modified. */
12476 size_t sz
= tree_size (expr
);
12477 buf
= XALLOCAVAR (union tree_node
, sz
);
12478 memcpy ((char *) buf
, expr
, sz
);
12479 SET_DECL_ASSEMBLER_NAME ((tree
) buf
, NULL
);
12480 buf
->decl_with_vis
.symtab_node
= NULL
;
12481 buf
->base
.nowarning_flag
= 0;
12484 else if (TREE_CODE_CLASS (code
) == tcc_type
12485 && (TYPE_POINTER_TO (expr
)
12486 || TYPE_REFERENCE_TO (expr
)
12487 || TYPE_CACHED_VALUES_P (expr
)
12488 || TYPE_CONTAINS_PLACEHOLDER_INTERNAL (expr
)
12489 || TYPE_NEXT_VARIANT (expr
)
12490 || TYPE_ALIAS_SET_KNOWN_P (expr
)))
12492 /* Allow these fields to be modified. */
12494 size_t sz
= tree_size (expr
);
12495 buf
= XALLOCAVAR (union tree_node
, sz
);
12496 memcpy ((char *) buf
, expr
, sz
);
12497 expr
= tmp
= (tree
) buf
;
12498 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (tmp
) = 0;
12499 TYPE_POINTER_TO (tmp
) = NULL
;
12500 TYPE_REFERENCE_TO (tmp
) = NULL
;
12501 TYPE_NEXT_VARIANT (tmp
) = NULL
;
12502 TYPE_ALIAS_SET (tmp
) = -1;
12503 if (TYPE_CACHED_VALUES_P (tmp
))
12505 TYPE_CACHED_VALUES_P (tmp
) = 0;
12506 TYPE_CACHED_VALUES (tmp
) = NULL
;
12509 else if (TREE_NO_WARNING (expr
) && (DECL_P (expr
) || EXPR_P (expr
)))
12511 /* Allow TREE_NO_WARNING to be set. Perhaps we shouldn't allow that
12512 and change builtins.c etc. instead - see PR89543. */
12513 size_t sz
= tree_size (expr
);
12514 buf
= XALLOCAVAR (union tree_node
, sz
);
12515 memcpy ((char *) buf
, expr
, sz
);
12516 buf
->base
.nowarning_flag
= 0;
12519 md5_process_bytes (expr
, tree_size (expr
), ctx
);
12520 if (CODE_CONTAINS_STRUCT (code
, TS_TYPED
))
12521 fold_checksum_tree (TREE_TYPE (expr
), ctx
, ht
);
12522 if (TREE_CODE_CLASS (code
) != tcc_type
12523 && TREE_CODE_CLASS (code
) != tcc_declaration
12524 && code
!= TREE_LIST
12525 && code
!= SSA_NAME
12526 && CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
12527 fold_checksum_tree (TREE_CHAIN (expr
), ctx
, ht
);
12528 switch (TREE_CODE_CLASS (code
))
12534 md5_process_bytes (TREE_STRING_POINTER (expr
),
12535 TREE_STRING_LENGTH (expr
), ctx
);
12538 fold_checksum_tree (TREE_REALPART (expr
), ctx
, ht
);
12539 fold_checksum_tree (TREE_IMAGPART (expr
), ctx
, ht
);
12542 len
= vector_cst_encoded_nelts (expr
);
12543 for (i
= 0; i
< len
; ++i
)
12544 fold_checksum_tree (VECTOR_CST_ENCODED_ELT (expr
, i
), ctx
, ht
);
12550 case tcc_exceptional
:
12554 fold_checksum_tree (TREE_PURPOSE (expr
), ctx
, ht
);
12555 fold_checksum_tree (TREE_VALUE (expr
), ctx
, ht
);
12556 expr
= TREE_CHAIN (expr
);
12557 goto recursive_label
;
12560 for (i
= 0; i
< TREE_VEC_LENGTH (expr
); ++i
)
12561 fold_checksum_tree (TREE_VEC_ELT (expr
, i
), ctx
, ht
);
12567 case tcc_expression
:
12568 case tcc_reference
:
12569 case tcc_comparison
:
12572 case tcc_statement
:
12574 len
= TREE_OPERAND_LENGTH (expr
);
12575 for (i
= 0; i
< len
; ++i
)
12576 fold_checksum_tree (TREE_OPERAND (expr
, i
), ctx
, ht
);
12578 case tcc_declaration
:
12579 fold_checksum_tree (DECL_NAME (expr
), ctx
, ht
);
12580 fold_checksum_tree (DECL_CONTEXT (expr
), ctx
, ht
);
12581 if (CODE_CONTAINS_STRUCT (TREE_CODE (expr
), TS_DECL_COMMON
))
12583 fold_checksum_tree (DECL_SIZE (expr
), ctx
, ht
);
12584 fold_checksum_tree (DECL_SIZE_UNIT (expr
), ctx
, ht
);
12585 fold_checksum_tree (DECL_INITIAL (expr
), ctx
, ht
);
12586 fold_checksum_tree (DECL_ABSTRACT_ORIGIN (expr
), ctx
, ht
);
12587 fold_checksum_tree (DECL_ATTRIBUTES (expr
), ctx
, ht
);
12590 if (CODE_CONTAINS_STRUCT (TREE_CODE (expr
), TS_DECL_NON_COMMON
))
12592 if (TREE_CODE (expr
) == FUNCTION_DECL
)
12594 fold_checksum_tree (DECL_VINDEX (expr
), ctx
, ht
);
12595 fold_checksum_tree (DECL_ARGUMENTS (expr
), ctx
, ht
);
12597 fold_checksum_tree (DECL_RESULT_FLD (expr
), ctx
, ht
);
12601 if (TREE_CODE (expr
) == ENUMERAL_TYPE
)
12602 fold_checksum_tree (TYPE_VALUES (expr
), ctx
, ht
);
12603 fold_checksum_tree (TYPE_SIZE (expr
), ctx
, ht
);
12604 fold_checksum_tree (TYPE_SIZE_UNIT (expr
), ctx
, ht
);
12605 fold_checksum_tree (TYPE_ATTRIBUTES (expr
), ctx
, ht
);
12606 fold_checksum_tree (TYPE_NAME (expr
), ctx
, ht
);
12607 if (INTEGRAL_TYPE_P (expr
)
12608 || SCALAR_FLOAT_TYPE_P (expr
))
12610 fold_checksum_tree (TYPE_MIN_VALUE (expr
), ctx
, ht
);
12611 fold_checksum_tree (TYPE_MAX_VALUE (expr
), ctx
, ht
);
12613 fold_checksum_tree (TYPE_MAIN_VARIANT (expr
), ctx
, ht
);
12614 if (TREE_CODE (expr
) == RECORD_TYPE
12615 || TREE_CODE (expr
) == UNION_TYPE
12616 || TREE_CODE (expr
) == QUAL_UNION_TYPE
)
12617 fold_checksum_tree (TYPE_BINFO (expr
), ctx
, ht
);
12618 fold_checksum_tree (TYPE_CONTEXT (expr
), ctx
, ht
);
12625 /* Helper function for outputting the checksum of a tree T. When
12626 debugging with gdb, you can "define mynext" to be "next" followed
12627 by "call debug_fold_checksum (op0)", then just trace down till the
12630 DEBUG_FUNCTION
void
12631 debug_fold_checksum (const_tree t
)
12634 unsigned char checksum
[16];
12635 struct md5_ctx ctx
;
12636 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12638 md5_init_ctx (&ctx
);
12639 fold_checksum_tree (t
, &ctx
, &ht
);
12640 md5_finish_ctx (&ctx
, checksum
);
12643 for (i
= 0; i
< 16; i
++)
12644 fprintf (stderr
, "%d ", checksum
[i
]);
12646 fprintf (stderr
, "\n");
12651 /* Fold a unary tree expression with code CODE of type TYPE with an
12652 operand OP0. LOC is the location of the resulting expression.
12653 Return a folded expression if successful. Otherwise, return a tree
12654 expression with code CODE of type TYPE with an operand OP0. */
12657 fold_build1_loc (location_t loc
,
12658 enum tree_code code
, tree type
, tree op0 MEM_STAT_DECL
)
12661 #ifdef ENABLE_FOLD_CHECKING
12662 unsigned char checksum_before
[16], checksum_after
[16];
12663 struct md5_ctx ctx
;
12664 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12666 md5_init_ctx (&ctx
);
12667 fold_checksum_tree (op0
, &ctx
, &ht
);
12668 md5_finish_ctx (&ctx
, checksum_before
);
12672 tem
= fold_unary_loc (loc
, code
, type
, op0
);
12674 tem
= build1_loc (loc
, code
, type
, op0 PASS_MEM_STAT
);
12676 #ifdef ENABLE_FOLD_CHECKING
12677 md5_init_ctx (&ctx
);
12678 fold_checksum_tree (op0
, &ctx
, &ht
);
12679 md5_finish_ctx (&ctx
, checksum_after
);
12681 if (memcmp (checksum_before
, checksum_after
, 16))
12682 fold_check_failed (op0
, tem
);
12687 /* Fold a binary tree expression with code CODE of type TYPE with
12688 operands OP0 and OP1. LOC is the location of the resulting
12689 expression. Return a folded expression if successful. Otherwise,
12690 return a tree expression with code CODE of type TYPE with operands
12694 fold_build2_loc (location_t loc
,
12695 enum tree_code code
, tree type
, tree op0
, tree op1
12699 #ifdef ENABLE_FOLD_CHECKING
12700 unsigned char checksum_before_op0
[16],
12701 checksum_before_op1
[16],
12702 checksum_after_op0
[16],
12703 checksum_after_op1
[16];
12704 struct md5_ctx ctx
;
12705 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12707 md5_init_ctx (&ctx
);
12708 fold_checksum_tree (op0
, &ctx
, &ht
);
12709 md5_finish_ctx (&ctx
, checksum_before_op0
);
12712 md5_init_ctx (&ctx
);
12713 fold_checksum_tree (op1
, &ctx
, &ht
);
12714 md5_finish_ctx (&ctx
, checksum_before_op1
);
12718 tem
= fold_binary_loc (loc
, code
, type
, op0
, op1
);
12720 tem
= build2_loc (loc
, code
, type
, op0
, op1 PASS_MEM_STAT
);
12722 #ifdef ENABLE_FOLD_CHECKING
12723 md5_init_ctx (&ctx
);
12724 fold_checksum_tree (op0
, &ctx
, &ht
);
12725 md5_finish_ctx (&ctx
, checksum_after_op0
);
12728 if (memcmp (checksum_before_op0
, checksum_after_op0
, 16))
12729 fold_check_failed (op0
, tem
);
12731 md5_init_ctx (&ctx
);
12732 fold_checksum_tree (op1
, &ctx
, &ht
);
12733 md5_finish_ctx (&ctx
, checksum_after_op1
);
12735 if (memcmp (checksum_before_op1
, checksum_after_op1
, 16))
12736 fold_check_failed (op1
, tem
);
12741 /* Fold a ternary tree expression with code CODE of type TYPE with
12742 operands OP0, OP1, and OP2. Return a folded expression if
12743 successful. Otherwise, return a tree expression with code CODE of
12744 type TYPE with operands OP0, OP1, and OP2. */
12747 fold_build3_loc (location_t loc
, enum tree_code code
, tree type
,
12748 tree op0
, tree op1
, tree op2 MEM_STAT_DECL
)
12751 #ifdef ENABLE_FOLD_CHECKING
12752 unsigned char checksum_before_op0
[16],
12753 checksum_before_op1
[16],
12754 checksum_before_op2
[16],
12755 checksum_after_op0
[16],
12756 checksum_after_op1
[16],
12757 checksum_after_op2
[16];
12758 struct md5_ctx ctx
;
12759 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12761 md5_init_ctx (&ctx
);
12762 fold_checksum_tree (op0
, &ctx
, &ht
);
12763 md5_finish_ctx (&ctx
, checksum_before_op0
);
12766 md5_init_ctx (&ctx
);
12767 fold_checksum_tree (op1
, &ctx
, &ht
);
12768 md5_finish_ctx (&ctx
, checksum_before_op1
);
12771 md5_init_ctx (&ctx
);
12772 fold_checksum_tree (op2
, &ctx
, &ht
);
12773 md5_finish_ctx (&ctx
, checksum_before_op2
);
12777 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
12778 tem
= fold_ternary_loc (loc
, code
, type
, op0
, op1
, op2
);
12780 tem
= build3_loc (loc
, code
, type
, op0
, op1
, op2 PASS_MEM_STAT
);
12782 #ifdef ENABLE_FOLD_CHECKING
12783 md5_init_ctx (&ctx
);
12784 fold_checksum_tree (op0
, &ctx
, &ht
);
12785 md5_finish_ctx (&ctx
, checksum_after_op0
);
12788 if (memcmp (checksum_before_op0
, checksum_after_op0
, 16))
12789 fold_check_failed (op0
, tem
);
12791 md5_init_ctx (&ctx
);
12792 fold_checksum_tree (op1
, &ctx
, &ht
);
12793 md5_finish_ctx (&ctx
, checksum_after_op1
);
12796 if (memcmp (checksum_before_op1
, checksum_after_op1
, 16))
12797 fold_check_failed (op1
, tem
);
12799 md5_init_ctx (&ctx
);
12800 fold_checksum_tree (op2
, &ctx
, &ht
);
12801 md5_finish_ctx (&ctx
, checksum_after_op2
);
12803 if (memcmp (checksum_before_op2
, checksum_after_op2
, 16))
12804 fold_check_failed (op2
, tem
);
12809 /* Fold a CALL_EXPR expression of type TYPE with operands FN and NARGS
12810 arguments in ARGARRAY, and a null static chain.
12811 Return a folded expression if successful. Otherwise, return a CALL_EXPR
12812 of type TYPE from the given operands as constructed by build_call_array. */
12815 fold_build_call_array_loc (location_t loc
, tree type
, tree fn
,
12816 int nargs
, tree
*argarray
)
12819 #ifdef ENABLE_FOLD_CHECKING
12820 unsigned char checksum_before_fn
[16],
12821 checksum_before_arglist
[16],
12822 checksum_after_fn
[16],
12823 checksum_after_arglist
[16];
12824 struct md5_ctx ctx
;
12825 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12828 md5_init_ctx (&ctx
);
12829 fold_checksum_tree (fn
, &ctx
, &ht
);
12830 md5_finish_ctx (&ctx
, checksum_before_fn
);
12833 md5_init_ctx (&ctx
);
12834 for (i
= 0; i
< nargs
; i
++)
12835 fold_checksum_tree (argarray
[i
], &ctx
, &ht
);
12836 md5_finish_ctx (&ctx
, checksum_before_arglist
);
12840 tem
= fold_builtin_call_array (loc
, type
, fn
, nargs
, argarray
);
12842 tem
= build_call_array_loc (loc
, type
, fn
, nargs
, argarray
);
12844 #ifdef ENABLE_FOLD_CHECKING
12845 md5_init_ctx (&ctx
);
12846 fold_checksum_tree (fn
, &ctx
, &ht
);
12847 md5_finish_ctx (&ctx
, checksum_after_fn
);
12850 if (memcmp (checksum_before_fn
, checksum_after_fn
, 16))
12851 fold_check_failed (fn
, tem
);
12853 md5_init_ctx (&ctx
);
12854 for (i
= 0; i
< nargs
; i
++)
12855 fold_checksum_tree (argarray
[i
], &ctx
, &ht
);
12856 md5_finish_ctx (&ctx
, checksum_after_arglist
);
12858 if (memcmp (checksum_before_arglist
, checksum_after_arglist
, 16))
12859 fold_check_failed (NULL_TREE
, tem
);
12864 /* Perform constant folding and related simplification of initializer
12865 expression EXPR. These behave identically to "fold_buildN" but ignore
12866 potential run-time traps and exceptions that fold must preserve. */
12868 #define START_FOLD_INIT \
12869 int saved_signaling_nans = flag_signaling_nans;\
12870 int saved_trapping_math = flag_trapping_math;\
12871 int saved_rounding_math = flag_rounding_math;\
12872 int saved_trapv = flag_trapv;\
12873 int saved_folding_initializer = folding_initializer;\
12874 flag_signaling_nans = 0;\
12875 flag_trapping_math = 0;\
12876 flag_rounding_math = 0;\
12878 folding_initializer = 1;
12880 #define END_FOLD_INIT \
12881 flag_signaling_nans = saved_signaling_nans;\
12882 flag_trapping_math = saved_trapping_math;\
12883 flag_rounding_math = saved_rounding_math;\
12884 flag_trapv = saved_trapv;\
12885 folding_initializer = saved_folding_initializer;
12888 fold_build1_initializer_loc (location_t loc
, enum tree_code code
,
12889 tree type
, tree op
)
12894 result
= fold_build1_loc (loc
, code
, type
, op
);
12901 fold_build2_initializer_loc (location_t loc
, enum tree_code code
,
12902 tree type
, tree op0
, tree op1
)
12907 result
= fold_build2_loc (loc
, code
, type
, op0
, op1
);
12914 fold_build_call_array_initializer_loc (location_t loc
, tree type
, tree fn
,
12915 int nargs
, tree
*argarray
)
12920 result
= fold_build_call_array_loc (loc
, type
, fn
, nargs
, argarray
);
12926 #undef START_FOLD_INIT
12927 #undef END_FOLD_INIT
12929 /* Determine if first argument is a multiple of second argument. Return 0 if
12930 it is not, or we cannot easily determined it to be.
12932 An example of the sort of thing we care about (at this point; this routine
12933 could surely be made more general, and expanded to do what the *_DIV_EXPR's
12934 fold cases do now) is discovering that
12936 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
12942 when we know that the two SAVE_EXPR (J * 8) nodes are the same node.
12944 This code also handles discovering that
12946 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
12948 is a multiple of 8 so we don't have to worry about dealing with a
12949 possible remainder.
12951 Note that we *look* inside a SAVE_EXPR only to determine how it was
12952 calculated; it is not safe for fold to do much of anything else with the
12953 internals of a SAVE_EXPR, since it cannot know when it will be evaluated
12954 at run time. For example, the latter example above *cannot* be implemented
12955 as SAVE_EXPR (I) * J or any variant thereof, since the value of J at
12956 evaluation time of the original SAVE_EXPR is not necessarily the same at
12957 the time the new expression is evaluated. The only optimization of this
12958 sort that would be valid is changing
12960 SAVE_EXPR (I) * SAVE_EXPR (SAVE_EXPR (J) * 8)
12964 SAVE_EXPR (I) * SAVE_EXPR (J)
12966 (where the same SAVE_EXPR (J) is used in the original and the
12967 transformed version). */
12970 multiple_of_p (tree type
, const_tree top
, const_tree bottom
)
12975 if (operand_equal_p (top
, bottom
, 0))
12978 if (TREE_CODE (type
) != INTEGER_TYPE
)
12981 switch (TREE_CODE (top
))
12984 /* Bitwise and provides a power of two multiple. If the mask is
12985 a multiple of BOTTOM then TOP is a multiple of BOTTOM. */
12986 if (!integer_pow2p (bottom
))
12988 return (multiple_of_p (type
, TREE_OPERAND (top
, 1), bottom
)
12989 || multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
));
12992 if (TREE_CODE (bottom
) == INTEGER_CST
)
12994 op1
= TREE_OPERAND (top
, 0);
12995 op2
= TREE_OPERAND (top
, 1);
12996 if (TREE_CODE (op1
) == INTEGER_CST
)
12997 std::swap (op1
, op2
);
12998 if (TREE_CODE (op2
) == INTEGER_CST
)
13000 if (multiple_of_p (type
, op2
, bottom
))
13002 /* Handle multiple_of_p ((x * 2 + 2) * 4, 8). */
13003 if (multiple_of_p (type
, bottom
, op2
))
13005 widest_int w
= wi::sdiv_trunc (wi::to_widest (bottom
),
13006 wi::to_widest (op2
));
13007 if (wi::fits_to_tree_p (w
, TREE_TYPE (bottom
)))
13009 op2
= wide_int_to_tree (TREE_TYPE (bottom
), w
);
13010 return multiple_of_p (type
, op1
, op2
);
13013 return multiple_of_p (type
, op1
, bottom
);
13016 return (multiple_of_p (type
, TREE_OPERAND (top
, 1), bottom
)
13017 || multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
));
13020 /* It is impossible to prove if op0 - op1 is multiple of bottom
13021 precisely, so be conservative here checking if both op0 and op1
13022 are multiple of bottom. Note we check the second operand first
13023 since it's usually simpler. */
13024 return (multiple_of_p (type
, TREE_OPERAND (top
, 1), bottom
)
13025 && multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
));
13028 /* The same as MINUS_EXPR, but handle cases like op0 + 0xfffffffd
13029 as op0 - 3 if the expression has unsigned type. For example,
13030 (X / 3) + 0xfffffffd is multiple of 3, but 0xfffffffd is not. */
13031 op1
= TREE_OPERAND (top
, 1);
13032 if (TYPE_UNSIGNED (type
)
13033 && TREE_CODE (op1
) == INTEGER_CST
&& tree_int_cst_sign_bit (op1
))
13034 op1
= fold_build1 (NEGATE_EXPR
, type
, op1
);
13035 return (multiple_of_p (type
, op1
, bottom
)
13036 && multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
));
13039 if (TREE_CODE (TREE_OPERAND (top
, 1)) == INTEGER_CST
)
13041 op1
= TREE_OPERAND (top
, 1);
13042 /* const_binop may not detect overflow correctly,
13043 so check for it explicitly here. */
13044 if (wi::gtu_p (TYPE_PRECISION (TREE_TYPE (size_one_node
)),
13046 && (t1
= fold_convert (type
,
13047 const_binop (LSHIFT_EXPR
, size_one_node
,
13049 && !TREE_OVERFLOW (t1
))
13050 return multiple_of_p (type
, t1
, bottom
);
13055 /* Can't handle conversions from non-integral or wider integral type. */
13056 if ((TREE_CODE (TREE_TYPE (TREE_OPERAND (top
, 0))) != INTEGER_TYPE
)
13057 || (TYPE_PRECISION (type
)
13058 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (top
, 0)))))
13064 return multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
);
13067 return (multiple_of_p (type
, TREE_OPERAND (top
, 1), bottom
)
13068 && multiple_of_p (type
, TREE_OPERAND (top
, 2), bottom
));
13071 if (TREE_CODE (bottom
) != INTEGER_CST
13072 || integer_zerop (bottom
)
13073 || (TYPE_UNSIGNED (type
)
13074 && (tree_int_cst_sgn (top
) < 0
13075 || tree_int_cst_sgn (bottom
) < 0)))
13077 return wi::multiple_of_p (wi::to_widest (top
), wi::to_widest (bottom
),
13081 if (TREE_CODE (bottom
) == INTEGER_CST
13082 && (stmt
= SSA_NAME_DEF_STMT (top
)) != NULL
13083 && gimple_code (stmt
) == GIMPLE_ASSIGN
)
13085 enum tree_code code
= gimple_assign_rhs_code (stmt
);
13087 /* Check for special cases to see if top is defined as multiple
13090 top = (X & ~(bottom - 1) ; bottom is power of 2
13096 if (code
== BIT_AND_EXPR
13097 && (op2
= gimple_assign_rhs2 (stmt
)) != NULL_TREE
13098 && TREE_CODE (op2
) == INTEGER_CST
13099 && integer_pow2p (bottom
)
13100 && wi::multiple_of_p (wi::to_widest (op2
),
13101 wi::to_widest (bottom
), UNSIGNED
))
13104 op1
= gimple_assign_rhs1 (stmt
);
13105 if (code
== MINUS_EXPR
13106 && (op2
= gimple_assign_rhs2 (stmt
)) != NULL_TREE
13107 && TREE_CODE (op2
) == SSA_NAME
13108 && (stmt
= SSA_NAME_DEF_STMT (op2
)) != NULL
13109 && gimple_code (stmt
) == GIMPLE_ASSIGN
13110 && (code
= gimple_assign_rhs_code (stmt
)) == TRUNC_MOD_EXPR
13111 && operand_equal_p (op1
, gimple_assign_rhs1 (stmt
), 0)
13112 && operand_equal_p (bottom
, gimple_assign_rhs2 (stmt
), 0))
13119 if (POLY_INT_CST_P (top
) && poly_int_tree_p (bottom
))
13120 return multiple_p (wi::to_poly_widest (top
),
13121 wi::to_poly_widest (bottom
));
13127 #define tree_expr_nonnegative_warnv_p(X, Y) \
13128 _Pragma ("GCC error \"Use RECURSE for recursive calls\"") 0
13130 #define RECURSE(X) \
13131 ((tree_expr_nonnegative_warnv_p) (X, strict_overflow_p, depth + 1))
13133 /* Return true if CODE or TYPE is known to be non-negative. */
13136 tree_simple_nonnegative_warnv_p (enum tree_code code
, tree type
)
13138 if ((TYPE_PRECISION (type
) != 1 || TYPE_UNSIGNED (type
))
13139 && truth_value_p (code
))
13140 /* Truth values evaluate to 0 or 1, which is nonnegative unless we
13141 have a signed:1 type (where the value is -1 and 0). */
13146 /* Return true if (CODE OP0) is known to be non-negative. If the return
13147 value is based on the assumption that signed overflow is undefined,
13148 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13149 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13152 tree_unary_nonnegative_warnv_p (enum tree_code code
, tree type
, tree op0
,
13153 bool *strict_overflow_p
, int depth
)
13155 if (TYPE_UNSIGNED (type
))
13161 /* We can't return 1 if flag_wrapv is set because
13162 ABS_EXPR<INT_MIN> = INT_MIN. */
13163 if (!ANY_INTEGRAL_TYPE_P (type
))
13165 if (TYPE_OVERFLOW_UNDEFINED (type
))
13167 *strict_overflow_p
= true;
13172 case NON_LVALUE_EXPR
:
13174 case FIX_TRUNC_EXPR
:
13175 return RECURSE (op0
);
13179 tree inner_type
= TREE_TYPE (op0
);
13180 tree outer_type
= type
;
13182 if (TREE_CODE (outer_type
) == REAL_TYPE
)
13184 if (TREE_CODE (inner_type
) == REAL_TYPE
)
13185 return RECURSE (op0
);
13186 if (INTEGRAL_TYPE_P (inner_type
))
13188 if (TYPE_UNSIGNED (inner_type
))
13190 return RECURSE (op0
);
13193 else if (INTEGRAL_TYPE_P (outer_type
))
13195 if (TREE_CODE (inner_type
) == REAL_TYPE
)
13196 return RECURSE (op0
);
13197 if (INTEGRAL_TYPE_P (inner_type
))
13198 return TYPE_PRECISION (inner_type
) < TYPE_PRECISION (outer_type
)
13199 && TYPE_UNSIGNED (inner_type
);
13205 return tree_simple_nonnegative_warnv_p (code
, type
);
13208 /* We don't know sign of `t', so be conservative and return false. */
13212 /* Return true if (CODE OP0 OP1) is known to be non-negative. If the return
13213 value is based on the assumption that signed overflow is undefined,
13214 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13215 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13218 tree_binary_nonnegative_warnv_p (enum tree_code code
, tree type
, tree op0
,
13219 tree op1
, bool *strict_overflow_p
,
13222 if (TYPE_UNSIGNED (type
))
13227 case POINTER_PLUS_EXPR
:
13229 if (FLOAT_TYPE_P (type
))
13230 return RECURSE (op0
) && RECURSE (op1
);
13232 /* zero_extend(x) + zero_extend(y) is non-negative if x and y are
13233 both unsigned and at least 2 bits shorter than the result. */
13234 if (TREE_CODE (type
) == INTEGER_TYPE
13235 && TREE_CODE (op0
) == NOP_EXPR
13236 && TREE_CODE (op1
) == NOP_EXPR
)
13238 tree inner1
= TREE_TYPE (TREE_OPERAND (op0
, 0));
13239 tree inner2
= TREE_TYPE (TREE_OPERAND (op1
, 0));
13240 if (TREE_CODE (inner1
) == INTEGER_TYPE
&& TYPE_UNSIGNED (inner1
)
13241 && TREE_CODE (inner2
) == INTEGER_TYPE
&& TYPE_UNSIGNED (inner2
))
13243 unsigned int prec
= MAX (TYPE_PRECISION (inner1
),
13244 TYPE_PRECISION (inner2
)) + 1;
13245 return prec
< TYPE_PRECISION (type
);
13251 if (FLOAT_TYPE_P (type
) || TYPE_OVERFLOW_UNDEFINED (type
))
13253 /* x * x is always non-negative for floating point x
13254 or without overflow. */
13255 if (operand_equal_p (op0
, op1
, 0)
13256 || (RECURSE (op0
) && RECURSE (op1
)))
13258 if (ANY_INTEGRAL_TYPE_P (type
)
13259 && TYPE_OVERFLOW_UNDEFINED (type
))
13260 *strict_overflow_p
= true;
13265 /* zero_extend(x) * zero_extend(y) is non-negative if x and y are
13266 both unsigned and their total bits is shorter than the result. */
13267 if (TREE_CODE (type
) == INTEGER_TYPE
13268 && (TREE_CODE (op0
) == NOP_EXPR
|| TREE_CODE (op0
) == INTEGER_CST
)
13269 && (TREE_CODE (op1
) == NOP_EXPR
|| TREE_CODE (op1
) == INTEGER_CST
))
13271 tree inner0
= (TREE_CODE (op0
) == NOP_EXPR
)
13272 ? TREE_TYPE (TREE_OPERAND (op0
, 0))
13274 tree inner1
= (TREE_CODE (op1
) == NOP_EXPR
)
13275 ? TREE_TYPE (TREE_OPERAND (op1
, 0))
13278 bool unsigned0
= TYPE_UNSIGNED (inner0
);
13279 bool unsigned1
= TYPE_UNSIGNED (inner1
);
13281 if (TREE_CODE (op0
) == INTEGER_CST
)
13282 unsigned0
= unsigned0
|| tree_int_cst_sgn (op0
) >= 0;
13284 if (TREE_CODE (op1
) == INTEGER_CST
)
13285 unsigned1
= unsigned1
|| tree_int_cst_sgn (op1
) >= 0;
13287 if (TREE_CODE (inner0
) == INTEGER_TYPE
&& unsigned0
13288 && TREE_CODE (inner1
) == INTEGER_TYPE
&& unsigned1
)
13290 unsigned int precision0
= (TREE_CODE (op0
) == INTEGER_CST
)
13291 ? tree_int_cst_min_precision (op0
, UNSIGNED
)
13292 : TYPE_PRECISION (inner0
);
13294 unsigned int precision1
= (TREE_CODE (op1
) == INTEGER_CST
)
13295 ? tree_int_cst_min_precision (op1
, UNSIGNED
)
13296 : TYPE_PRECISION (inner1
);
13298 return precision0
+ precision1
< TYPE_PRECISION (type
);
13305 return RECURSE (op0
) || RECURSE (op1
);
13311 case TRUNC_DIV_EXPR
:
13312 case CEIL_DIV_EXPR
:
13313 case FLOOR_DIV_EXPR
:
13314 case ROUND_DIV_EXPR
:
13315 return RECURSE (op0
) && RECURSE (op1
);
13317 case TRUNC_MOD_EXPR
:
13318 return RECURSE (op0
);
13320 case FLOOR_MOD_EXPR
:
13321 return RECURSE (op1
);
13323 case CEIL_MOD_EXPR
:
13324 case ROUND_MOD_EXPR
:
13326 return tree_simple_nonnegative_warnv_p (code
, type
);
13329 /* We don't know sign of `t', so be conservative and return false. */
13333 /* Return true if T is known to be non-negative. If the return
13334 value is based on the assumption that signed overflow is undefined,
13335 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13336 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13339 tree_single_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
, int depth
)
13341 if (TYPE_UNSIGNED (TREE_TYPE (t
)))
13344 switch (TREE_CODE (t
))
13347 return tree_int_cst_sgn (t
) >= 0;
13350 return ! REAL_VALUE_NEGATIVE (TREE_REAL_CST (t
));
13353 return ! FIXED_VALUE_NEGATIVE (TREE_FIXED_CST (t
));
13356 return RECURSE (TREE_OPERAND (t
, 1)) && RECURSE (TREE_OPERAND (t
, 2));
13359 /* Limit the depth of recursion to avoid quadratic behavior.
13360 This is expected to catch almost all occurrences in practice.
13361 If this code misses important cases that unbounded recursion
13362 would not, passes that need this information could be revised
13363 to provide it through dataflow propagation. */
13364 return (!name_registered_for_update_p (t
)
13365 && depth
< PARAM_VALUE (PARAM_MAX_SSA_NAME_QUERY_DEPTH
)
13366 && gimple_stmt_nonnegative_warnv_p (SSA_NAME_DEF_STMT (t
),
13367 strict_overflow_p
, depth
));
13370 return tree_simple_nonnegative_warnv_p (TREE_CODE (t
), TREE_TYPE (t
));
13374 /* Return true if T is known to be non-negative. If the return
13375 value is based on the assumption that signed overflow is undefined,
13376 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13377 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13380 tree_call_nonnegative_warnv_p (tree type
, combined_fn fn
, tree arg0
, tree arg1
,
13381 bool *strict_overflow_p
, int depth
)
13402 case CFN_BUILT_IN_BSWAP32
:
13403 case CFN_BUILT_IN_BSWAP64
:
13409 /* sqrt(-0.0) is -0.0. */
13410 if (!HONOR_SIGNED_ZEROS (element_mode (type
)))
13412 return RECURSE (arg0
);
13440 CASE_CFN_NEARBYINT
:
13441 CASE_CFN_NEARBYINT_FN
:
13446 CASE_CFN_ROUNDEVEN
:
13447 CASE_CFN_ROUNDEVEN_FN
:
13452 CASE_CFN_SIGNIFICAND
:
13457 /* True if the 1st argument is nonnegative. */
13458 return RECURSE (arg0
);
13462 /* True if the 1st OR 2nd arguments are nonnegative. */
13463 return RECURSE (arg0
) || RECURSE (arg1
);
13467 /* True if the 1st AND 2nd arguments are nonnegative. */
13468 return RECURSE (arg0
) && RECURSE (arg1
);
13471 CASE_CFN_COPYSIGN_FN
:
13472 /* True if the 2nd argument is nonnegative. */
13473 return RECURSE (arg1
);
13476 /* True if the 1st argument is nonnegative or the second
13477 argument is an even integer. */
13478 if (TREE_CODE (arg1
) == INTEGER_CST
13479 && (TREE_INT_CST_LOW (arg1
) & 1) == 0)
13481 return RECURSE (arg0
);
13484 /* True if the 1st argument is nonnegative or the second
13485 argument is an even integer valued real. */
13486 if (TREE_CODE (arg1
) == REAL_CST
)
13491 c
= TREE_REAL_CST (arg1
);
13492 n
= real_to_integer (&c
);
13495 REAL_VALUE_TYPE cint
;
13496 real_from_integer (&cint
, VOIDmode
, n
, SIGNED
);
13497 if (real_identical (&c
, &cint
))
13501 return RECURSE (arg0
);
13506 return tree_simple_nonnegative_warnv_p (CALL_EXPR
, type
);
13509 /* Return true if T is known to be non-negative. If the return
13510 value is based on the assumption that signed overflow is undefined,
13511 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13512 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13515 tree_invalid_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
, int depth
)
13517 enum tree_code code
= TREE_CODE (t
);
13518 if (TYPE_UNSIGNED (TREE_TYPE (t
)))
13525 tree temp
= TARGET_EXPR_SLOT (t
);
13526 t
= TARGET_EXPR_INITIAL (t
);
13528 /* If the initializer is non-void, then it's a normal expression
13529 that will be assigned to the slot. */
13530 if (!VOID_TYPE_P (t
))
13531 return RECURSE (t
);
13533 /* Otherwise, the initializer sets the slot in some way. One common
13534 way is an assignment statement at the end of the initializer. */
13537 if (TREE_CODE (t
) == BIND_EXPR
)
13538 t
= expr_last (BIND_EXPR_BODY (t
));
13539 else if (TREE_CODE (t
) == TRY_FINALLY_EXPR
13540 || TREE_CODE (t
) == TRY_CATCH_EXPR
)
13541 t
= expr_last (TREE_OPERAND (t
, 0));
13542 else if (TREE_CODE (t
) == STATEMENT_LIST
)
13547 if (TREE_CODE (t
) == MODIFY_EXPR
13548 && TREE_OPERAND (t
, 0) == temp
)
13549 return RECURSE (TREE_OPERAND (t
, 1));
13556 tree arg0
= call_expr_nargs (t
) > 0 ? CALL_EXPR_ARG (t
, 0) : NULL_TREE
;
13557 tree arg1
= call_expr_nargs (t
) > 1 ? CALL_EXPR_ARG (t
, 1) : NULL_TREE
;
13559 return tree_call_nonnegative_warnv_p (TREE_TYPE (t
),
13560 get_call_combined_fn (t
),
13563 strict_overflow_p
, depth
);
13565 case COMPOUND_EXPR
:
13567 return RECURSE (TREE_OPERAND (t
, 1));
13570 return RECURSE (expr_last (TREE_OPERAND (t
, 1)));
13573 return RECURSE (TREE_OPERAND (t
, 0));
13576 return tree_simple_nonnegative_warnv_p (TREE_CODE (t
), TREE_TYPE (t
));
13581 #undef tree_expr_nonnegative_warnv_p
13583 /* Return true if T is known to be non-negative. If the return
13584 value is based on the assumption that signed overflow is undefined,
13585 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13586 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13589 tree_expr_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
, int depth
)
13591 enum tree_code code
;
13592 if (t
== error_mark_node
)
13595 code
= TREE_CODE (t
);
13596 switch (TREE_CODE_CLASS (code
))
13599 case tcc_comparison
:
13600 return tree_binary_nonnegative_warnv_p (TREE_CODE (t
),
13602 TREE_OPERAND (t
, 0),
13603 TREE_OPERAND (t
, 1),
13604 strict_overflow_p
, depth
);
13607 return tree_unary_nonnegative_warnv_p (TREE_CODE (t
),
13609 TREE_OPERAND (t
, 0),
13610 strict_overflow_p
, depth
);
13613 case tcc_declaration
:
13614 case tcc_reference
:
13615 return tree_single_nonnegative_warnv_p (t
, strict_overflow_p
, depth
);
13623 case TRUTH_AND_EXPR
:
13624 case TRUTH_OR_EXPR
:
13625 case TRUTH_XOR_EXPR
:
13626 return tree_binary_nonnegative_warnv_p (TREE_CODE (t
),
13628 TREE_OPERAND (t
, 0),
13629 TREE_OPERAND (t
, 1),
13630 strict_overflow_p
, depth
);
13631 case TRUTH_NOT_EXPR
:
13632 return tree_unary_nonnegative_warnv_p (TREE_CODE (t
),
13634 TREE_OPERAND (t
, 0),
13635 strict_overflow_p
, depth
);
13642 case WITH_SIZE_EXPR
:
13644 return tree_single_nonnegative_warnv_p (t
, strict_overflow_p
, depth
);
13647 return tree_invalid_nonnegative_warnv_p (t
, strict_overflow_p
, depth
);
13651 /* Return true if `t' is known to be non-negative. Handle warnings
13652 about undefined signed overflow. */
13655 tree_expr_nonnegative_p (tree t
)
13657 bool ret
, strict_overflow_p
;
13659 strict_overflow_p
= false;
13660 ret
= tree_expr_nonnegative_warnv_p (t
, &strict_overflow_p
);
13661 if (strict_overflow_p
)
13662 fold_overflow_warning (("assuming signed overflow does not occur when "
13663 "determining that expression is always "
13665 WARN_STRICT_OVERFLOW_MISC
);
13670 /* Return true when (CODE OP0) is an address and is known to be nonzero.
13671 For floating point we further ensure that T is not denormal.
13672 Similar logic is present in nonzero_address in rtlanal.h.
13674 If the return value is based on the assumption that signed overflow
13675 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13676 change *STRICT_OVERFLOW_P. */
13679 tree_unary_nonzero_warnv_p (enum tree_code code
, tree type
, tree op0
,
13680 bool *strict_overflow_p
)
13685 return tree_expr_nonzero_warnv_p (op0
,
13686 strict_overflow_p
);
13690 tree inner_type
= TREE_TYPE (op0
);
13691 tree outer_type
= type
;
13693 return (TYPE_PRECISION (outer_type
) >= TYPE_PRECISION (inner_type
)
13694 && tree_expr_nonzero_warnv_p (op0
,
13695 strict_overflow_p
));
13699 case NON_LVALUE_EXPR
:
13700 return tree_expr_nonzero_warnv_p (op0
,
13701 strict_overflow_p
);
13710 /* Return true when (CODE OP0 OP1) is an address and is known to be nonzero.
13711 For floating point we further ensure that T is not denormal.
13712 Similar logic is present in nonzero_address in rtlanal.h.
13714 If the return value is based on the assumption that signed overflow
13715 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13716 change *STRICT_OVERFLOW_P. */
13719 tree_binary_nonzero_warnv_p (enum tree_code code
,
13722 tree op1
, bool *strict_overflow_p
)
13724 bool sub_strict_overflow_p
;
13727 case POINTER_PLUS_EXPR
:
13729 if (ANY_INTEGRAL_TYPE_P (type
) && TYPE_OVERFLOW_UNDEFINED (type
))
13731 /* With the presence of negative values it is hard
13732 to say something. */
13733 sub_strict_overflow_p
= false;
13734 if (!tree_expr_nonnegative_warnv_p (op0
,
13735 &sub_strict_overflow_p
)
13736 || !tree_expr_nonnegative_warnv_p (op1
,
13737 &sub_strict_overflow_p
))
13739 /* One of operands must be positive and the other non-negative. */
13740 /* We don't set *STRICT_OVERFLOW_P here: even if this value
13741 overflows, on a twos-complement machine the sum of two
13742 nonnegative numbers can never be zero. */
13743 return (tree_expr_nonzero_warnv_p (op0
,
13745 || tree_expr_nonzero_warnv_p (op1
,
13746 strict_overflow_p
));
13751 if (TYPE_OVERFLOW_UNDEFINED (type
))
13753 if (tree_expr_nonzero_warnv_p (op0
,
13755 && tree_expr_nonzero_warnv_p (op1
,
13756 strict_overflow_p
))
13758 *strict_overflow_p
= true;
13765 sub_strict_overflow_p
= false;
13766 if (tree_expr_nonzero_warnv_p (op0
,
13767 &sub_strict_overflow_p
)
13768 && tree_expr_nonzero_warnv_p (op1
,
13769 &sub_strict_overflow_p
))
13771 if (sub_strict_overflow_p
)
13772 *strict_overflow_p
= true;
13777 sub_strict_overflow_p
= false;
13778 if (tree_expr_nonzero_warnv_p (op0
,
13779 &sub_strict_overflow_p
))
13781 if (sub_strict_overflow_p
)
13782 *strict_overflow_p
= true;
13784 /* When both operands are nonzero, then MAX must be too. */
13785 if (tree_expr_nonzero_warnv_p (op1
,
13786 strict_overflow_p
))
13789 /* MAX where operand 0 is positive is positive. */
13790 return tree_expr_nonnegative_warnv_p (op0
,
13791 strict_overflow_p
);
13793 /* MAX where operand 1 is positive is positive. */
13794 else if (tree_expr_nonzero_warnv_p (op1
,
13795 &sub_strict_overflow_p
)
13796 && tree_expr_nonnegative_warnv_p (op1
,
13797 &sub_strict_overflow_p
))
13799 if (sub_strict_overflow_p
)
13800 *strict_overflow_p
= true;
13806 return (tree_expr_nonzero_warnv_p (op1
,
13808 || tree_expr_nonzero_warnv_p (op0
,
13809 strict_overflow_p
));
13818 /* Return true when T is an address and is known to be nonzero.
13819 For floating point we further ensure that T is not denormal.
13820 Similar logic is present in nonzero_address in rtlanal.h.
13822 If the return value is based on the assumption that signed overflow
13823 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13824 change *STRICT_OVERFLOW_P. */
13827 tree_single_nonzero_warnv_p (tree t
, bool *strict_overflow_p
)
13829 bool sub_strict_overflow_p
;
13830 switch (TREE_CODE (t
))
13833 return !integer_zerop (t
);
13837 tree base
= TREE_OPERAND (t
, 0);
13839 if (!DECL_P (base
))
13840 base
= get_base_address (base
);
13842 if (base
&& TREE_CODE (base
) == TARGET_EXPR
)
13843 base
= TARGET_EXPR_SLOT (base
);
13848 /* For objects in symbol table check if we know they are non-zero.
13849 Don't do anything for variables and functions before symtab is built;
13850 it is quite possible that they will be declared weak later. */
13851 int nonzero_addr
= maybe_nonzero_address (base
);
13852 if (nonzero_addr
>= 0)
13853 return nonzero_addr
;
13855 /* Constants are never weak. */
13856 if (CONSTANT_CLASS_P (base
))
13863 sub_strict_overflow_p
= false;
13864 if (tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 1),
13865 &sub_strict_overflow_p
)
13866 && tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 2),
13867 &sub_strict_overflow_p
))
13869 if (sub_strict_overflow_p
)
13870 *strict_overflow_p
= true;
13876 if (!INTEGRAL_TYPE_P (TREE_TYPE (t
)))
13878 return expr_not_equal_to (t
, wi::zero (TYPE_PRECISION (TREE_TYPE (t
))));
13886 #define integer_valued_real_p(X) \
13887 _Pragma ("GCC error \"Use RECURSE for recursive calls\"") 0
13889 #define RECURSE(X) \
13890 ((integer_valued_real_p) (X, depth + 1))
13892 /* Return true if the floating point result of (CODE OP0) has an
13893 integer value. We also allow +Inf, -Inf and NaN to be considered
13894 integer values. Return false for signaling NaN.
13896 DEPTH is the current nesting depth of the query. */
13899 integer_valued_real_unary_p (tree_code code
, tree op0
, int depth
)
13907 return RECURSE (op0
);
13911 tree type
= TREE_TYPE (op0
);
13912 if (TREE_CODE (type
) == INTEGER_TYPE
)
13914 if (TREE_CODE (type
) == REAL_TYPE
)
13915 return RECURSE (op0
);
13925 /* Return true if the floating point result of (CODE OP0 OP1) has an
13926 integer value. We also allow +Inf, -Inf and NaN to be considered
13927 integer values. Return false for signaling NaN.
13929 DEPTH is the current nesting depth of the query. */
13932 integer_valued_real_binary_p (tree_code code
, tree op0
, tree op1
, int depth
)
13941 return RECURSE (op0
) && RECURSE (op1
);
13949 /* Return true if the floating point result of calling FNDECL with arguments
13950 ARG0 and ARG1 has an integer value. We also allow +Inf, -Inf and NaN to be
13951 considered integer values. Return false for signaling NaN. If FNDECL
13952 takes fewer than 2 arguments, the remaining ARGn are null.
13954 DEPTH is the current nesting depth of the query. */
13957 integer_valued_real_call_p (combined_fn fn
, tree arg0
, tree arg1
, int depth
)
13965 CASE_CFN_NEARBYINT
:
13966 CASE_CFN_NEARBYINT_FN
:
13971 CASE_CFN_ROUNDEVEN
:
13972 CASE_CFN_ROUNDEVEN_FN
:
13981 return RECURSE (arg0
) && RECURSE (arg1
);
13989 /* Return true if the floating point expression T (a GIMPLE_SINGLE_RHS)
13990 has an integer value. We also allow +Inf, -Inf and NaN to be
13991 considered integer values. Return false for signaling NaN.
13993 DEPTH is the current nesting depth of the query. */
13996 integer_valued_real_single_p (tree t
, int depth
)
13998 switch (TREE_CODE (t
))
14001 return real_isinteger (TREE_REAL_CST_PTR (t
), TYPE_MODE (TREE_TYPE (t
)));
14004 return RECURSE (TREE_OPERAND (t
, 1)) && RECURSE (TREE_OPERAND (t
, 2));
14007 /* Limit the depth of recursion to avoid quadratic behavior.
14008 This is expected to catch almost all occurrences in practice.
14009 If this code misses important cases that unbounded recursion
14010 would not, passes that need this information could be revised
14011 to provide it through dataflow propagation. */
14012 return (!name_registered_for_update_p (t
)
14013 && depth
< PARAM_VALUE (PARAM_MAX_SSA_NAME_QUERY_DEPTH
)
14014 && gimple_stmt_integer_valued_real_p (SSA_NAME_DEF_STMT (t
),
14023 /* Return true if the floating point expression T (a GIMPLE_INVALID_RHS)
14024 has an integer value. We also allow +Inf, -Inf and NaN to be
14025 considered integer values. Return false for signaling NaN.
14027 DEPTH is the current nesting depth of the query. */
14030 integer_valued_real_invalid_p (tree t
, int depth
)
14032 switch (TREE_CODE (t
))
14034 case COMPOUND_EXPR
:
14037 return RECURSE (TREE_OPERAND (t
, 1));
14040 return RECURSE (TREE_OPERAND (t
, 0));
14049 #undef integer_valued_real_p
14051 /* Return true if the floating point expression T has an integer value.
14052 We also allow +Inf, -Inf and NaN to be considered integer values.
14053 Return false for signaling NaN.
14055 DEPTH is the current nesting depth of the query. */
14058 integer_valued_real_p (tree t
, int depth
)
14060 if (t
== error_mark_node
)
14063 STRIP_ANY_LOCATION_WRAPPER (t
);
14065 tree_code code
= TREE_CODE (t
);
14066 switch (TREE_CODE_CLASS (code
))
14069 case tcc_comparison
:
14070 return integer_valued_real_binary_p (code
, TREE_OPERAND (t
, 0),
14071 TREE_OPERAND (t
, 1), depth
);
14074 return integer_valued_real_unary_p (code
, TREE_OPERAND (t
, 0), depth
);
14077 case tcc_declaration
:
14078 case tcc_reference
:
14079 return integer_valued_real_single_p (t
, depth
);
14089 return integer_valued_real_single_p (t
, depth
);
14093 tree arg0
= (call_expr_nargs (t
) > 0
14094 ? CALL_EXPR_ARG (t
, 0)
14096 tree arg1
= (call_expr_nargs (t
) > 1
14097 ? CALL_EXPR_ARG (t
, 1)
14099 return integer_valued_real_call_p (get_call_combined_fn (t
),
14100 arg0
, arg1
, depth
);
14104 return integer_valued_real_invalid_p (t
, depth
);
14108 /* Given the components of a binary expression CODE, TYPE, OP0 and OP1,
14109 attempt to fold the expression to a constant without modifying TYPE,
14112 If the expression could be simplified to a constant, then return
14113 the constant. If the expression would not be simplified to a
14114 constant, then return NULL_TREE. */
14117 fold_binary_to_constant (enum tree_code code
, tree type
, tree op0
, tree op1
)
14119 tree tem
= fold_binary (code
, type
, op0
, op1
);
14120 return (tem
&& TREE_CONSTANT (tem
)) ? tem
: NULL_TREE
;
14123 /* Given the components of a unary expression CODE, TYPE and OP0,
14124 attempt to fold the expression to a constant without modifying
14127 If the expression could be simplified to a constant, then return
14128 the constant. If the expression would not be simplified to a
14129 constant, then return NULL_TREE. */
14132 fold_unary_to_constant (enum tree_code code
, tree type
, tree op0
)
14134 tree tem
= fold_unary (code
, type
, op0
);
14135 return (tem
&& TREE_CONSTANT (tem
)) ? tem
: NULL_TREE
;
14138 /* If EXP represents referencing an element in a constant string
14139 (either via pointer arithmetic or array indexing), return the
14140 tree representing the value accessed, otherwise return NULL. */
14143 fold_read_from_constant_string (tree exp
)
14145 if ((TREE_CODE (exp
) == INDIRECT_REF
14146 || TREE_CODE (exp
) == ARRAY_REF
)
14147 && TREE_CODE (TREE_TYPE (exp
)) == INTEGER_TYPE
)
14149 tree exp1
= TREE_OPERAND (exp
, 0);
14152 location_t loc
= EXPR_LOCATION (exp
);
14154 if (TREE_CODE (exp
) == INDIRECT_REF
)
14155 string
= string_constant (exp1
, &index
, NULL
, NULL
);
14158 tree low_bound
= array_ref_low_bound (exp
);
14159 index
= fold_convert_loc (loc
, sizetype
, TREE_OPERAND (exp
, 1));
14161 /* Optimize the special-case of a zero lower bound.
14163 We convert the low_bound to sizetype to avoid some problems
14164 with constant folding. (E.g. suppose the lower bound is 1,
14165 and its mode is QI. Without the conversion,l (ARRAY
14166 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
14167 +INDEX), which becomes (ARRAY+255+INDEX). Oops!) */
14168 if (! integer_zerop (low_bound
))
14169 index
= size_diffop_loc (loc
, index
,
14170 fold_convert_loc (loc
, sizetype
, low_bound
));
14175 scalar_int_mode char_mode
;
14177 && TYPE_MODE (TREE_TYPE (exp
)) == TYPE_MODE (TREE_TYPE (TREE_TYPE (string
)))
14178 && TREE_CODE (string
) == STRING_CST
14179 && TREE_CODE (index
) == INTEGER_CST
14180 && compare_tree_int (index
, TREE_STRING_LENGTH (string
)) < 0
14181 && is_int_mode (TYPE_MODE (TREE_TYPE (TREE_TYPE (string
))),
14183 && GET_MODE_SIZE (char_mode
) == 1)
14184 return build_int_cst_type (TREE_TYPE (exp
),
14185 (TREE_STRING_POINTER (string
)
14186 [TREE_INT_CST_LOW (index
)]));
14191 /* Folds a read from vector element at IDX of vector ARG. */
14194 fold_read_from_vector (tree arg
, poly_uint64 idx
)
14196 unsigned HOST_WIDE_INT i
;
14197 if (known_lt (idx
, TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg
)))
14198 && known_ge (idx
, 0u)
14199 && idx
.is_constant (&i
))
14201 if (TREE_CODE (arg
) == VECTOR_CST
)
14202 return VECTOR_CST_ELT (arg
, i
);
14203 else if (TREE_CODE (arg
) == CONSTRUCTOR
)
14205 if (i
>= CONSTRUCTOR_NELTS (arg
))
14206 return build_zero_cst (TREE_TYPE (TREE_TYPE (arg
)));
14207 return CONSTRUCTOR_ELT (arg
, i
)->value
;
14213 /* Return the tree for neg (ARG0) when ARG0 is known to be either
14214 an integer constant, real, or fixed-point constant.
14216 TYPE is the type of the result. */
14219 fold_negate_const (tree arg0
, tree type
)
14221 tree t
= NULL_TREE
;
14223 switch (TREE_CODE (arg0
))
14226 t
= build_real (type
, real_value_negate (&TREE_REAL_CST (arg0
)));
14231 FIXED_VALUE_TYPE f
;
14232 bool overflow_p
= fixed_arithmetic (&f
, NEGATE_EXPR
,
14233 &(TREE_FIXED_CST (arg0
)), NULL
,
14234 TYPE_SATURATING (type
));
14235 t
= build_fixed (type
, f
);
14236 /* Propagate overflow flags. */
14237 if (overflow_p
| TREE_OVERFLOW (arg0
))
14238 TREE_OVERFLOW (t
) = 1;
14243 if (poly_int_tree_p (arg0
))
14245 wi::overflow_type overflow
;
14246 poly_wide_int res
= wi::neg (wi::to_poly_wide (arg0
), &overflow
);
14247 t
= force_fit_type (type
, res
, 1,
14248 (overflow
&& ! TYPE_UNSIGNED (type
))
14249 || TREE_OVERFLOW (arg0
));
14253 gcc_unreachable ();
14259 /* Return the tree for abs (ARG0) when ARG0 is known to be either
14260 an integer constant or real constant.
14262 TYPE is the type of the result. */
14265 fold_abs_const (tree arg0
, tree type
)
14267 tree t
= NULL_TREE
;
14269 switch (TREE_CODE (arg0
))
14273 /* If the value is unsigned or non-negative, then the absolute value
14274 is the same as the ordinary value. */
14275 wide_int val
= wi::to_wide (arg0
);
14276 wi::overflow_type overflow
= wi::OVF_NONE
;
14277 if (!wi::neg_p (val
, TYPE_SIGN (TREE_TYPE (arg0
))))
14280 /* If the value is negative, then the absolute value is
14283 val
= wi::neg (val
, &overflow
);
14285 /* Force to the destination type, set TREE_OVERFLOW for signed
14287 t
= force_fit_type (type
, val
, 1, overflow
| TREE_OVERFLOW (arg0
));
14292 if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg0
)))
14293 t
= build_real (type
, real_value_negate (&TREE_REAL_CST (arg0
)));
14299 gcc_unreachable ();
14305 /* Return the tree for not (ARG0) when ARG0 is known to be an integer
14306 constant. TYPE is the type of the result. */
14309 fold_not_const (const_tree arg0
, tree type
)
14311 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
);
14313 return force_fit_type (type
, ~wi::to_wide (arg0
), 0, TREE_OVERFLOW (arg0
));
14316 /* Given CODE, a relational operator, the target type, TYPE and two
14317 constant operands OP0 and OP1, return the result of the
14318 relational operation. If the result is not a compile time
14319 constant, then return NULL_TREE. */
14322 fold_relational_const (enum tree_code code
, tree type
, tree op0
, tree op1
)
14324 int result
, invert
;
14326 /* From here on, the only cases we handle are when the result is
14327 known to be a constant. */
14329 if (TREE_CODE (op0
) == REAL_CST
&& TREE_CODE (op1
) == REAL_CST
)
14331 const REAL_VALUE_TYPE
*c0
= TREE_REAL_CST_PTR (op0
);
14332 const REAL_VALUE_TYPE
*c1
= TREE_REAL_CST_PTR (op1
);
14334 /* Handle the cases where either operand is a NaN. */
14335 if (real_isnan (c0
) || real_isnan (c1
))
14345 case UNORDERED_EXPR
:
14359 if (flag_trapping_math
)
14365 gcc_unreachable ();
14368 return constant_boolean_node (result
, type
);
14371 return constant_boolean_node (real_compare (code
, c0
, c1
), type
);
14374 if (TREE_CODE (op0
) == FIXED_CST
&& TREE_CODE (op1
) == FIXED_CST
)
14376 const FIXED_VALUE_TYPE
*c0
= TREE_FIXED_CST_PTR (op0
);
14377 const FIXED_VALUE_TYPE
*c1
= TREE_FIXED_CST_PTR (op1
);
14378 return constant_boolean_node (fixed_compare (code
, c0
, c1
), type
);
14381 /* Handle equality/inequality of complex constants. */
14382 if (TREE_CODE (op0
) == COMPLEX_CST
&& TREE_CODE (op1
) == COMPLEX_CST
)
14384 tree rcond
= fold_relational_const (code
, type
,
14385 TREE_REALPART (op0
),
14386 TREE_REALPART (op1
));
14387 tree icond
= fold_relational_const (code
, type
,
14388 TREE_IMAGPART (op0
),
14389 TREE_IMAGPART (op1
));
14390 if (code
== EQ_EXPR
)
14391 return fold_build2 (TRUTH_ANDIF_EXPR
, type
, rcond
, icond
);
14392 else if (code
== NE_EXPR
)
14393 return fold_build2 (TRUTH_ORIF_EXPR
, type
, rcond
, icond
);
14398 if (TREE_CODE (op0
) == VECTOR_CST
&& TREE_CODE (op1
) == VECTOR_CST
)
14400 if (!VECTOR_TYPE_P (type
))
14402 /* Have vector comparison with scalar boolean result. */
14403 gcc_assert ((code
== EQ_EXPR
|| code
== NE_EXPR
)
14404 && known_eq (VECTOR_CST_NELTS (op0
),
14405 VECTOR_CST_NELTS (op1
)));
14406 unsigned HOST_WIDE_INT nunits
;
14407 if (!VECTOR_CST_NELTS (op0
).is_constant (&nunits
))
14409 for (unsigned i
= 0; i
< nunits
; i
++)
14411 tree elem0
= VECTOR_CST_ELT (op0
, i
);
14412 tree elem1
= VECTOR_CST_ELT (op1
, i
);
14413 tree tmp
= fold_relational_const (EQ_EXPR
, type
, elem0
, elem1
);
14414 if (tmp
== NULL_TREE
)
14416 if (integer_zerop (tmp
))
14417 return constant_boolean_node (code
== NE_EXPR
, type
);
14419 return constant_boolean_node (code
== EQ_EXPR
, type
);
14421 tree_vector_builder elts
;
14422 if (!elts
.new_binary_operation (type
, op0
, op1
, false))
14424 unsigned int count
= elts
.encoded_nelts ();
14425 for (unsigned i
= 0; i
< count
; i
++)
14427 tree elem_type
= TREE_TYPE (type
);
14428 tree elem0
= VECTOR_CST_ELT (op0
, i
);
14429 tree elem1
= VECTOR_CST_ELT (op1
, i
);
14431 tree tem
= fold_relational_const (code
, elem_type
,
14434 if (tem
== NULL_TREE
)
14437 elts
.quick_push (build_int_cst (elem_type
,
14438 integer_zerop (tem
) ? 0 : -1));
14441 return elts
.build ();
14444 /* From here on we only handle LT, LE, GT, GE, EQ and NE.
14446 To compute GT, swap the arguments and do LT.
14447 To compute GE, do LT and invert the result.
14448 To compute LE, swap the arguments, do LT and invert the result.
14449 To compute NE, do EQ and invert the result.
14451 Therefore, the code below must handle only EQ and LT. */
14453 if (code
== LE_EXPR
|| code
== GT_EXPR
)
14455 std::swap (op0
, op1
);
14456 code
= swap_tree_comparison (code
);
14459 /* Note that it is safe to invert for real values here because we
14460 have already handled the one case that it matters. */
14463 if (code
== NE_EXPR
|| code
== GE_EXPR
)
14466 code
= invert_tree_comparison (code
, false);
14469 /* Compute a result for LT or EQ if args permit;
14470 Otherwise return T. */
14471 if (TREE_CODE (op0
) == INTEGER_CST
&& TREE_CODE (op1
) == INTEGER_CST
)
14473 if (code
== EQ_EXPR
)
14474 result
= tree_int_cst_equal (op0
, op1
);
14476 result
= tree_int_cst_lt (op0
, op1
);
14483 return constant_boolean_node (result
, type
);
14486 /* If necessary, return a CLEANUP_POINT_EXPR for EXPR with the
14487 indicated TYPE. If no CLEANUP_POINT_EXPR is necessary, return EXPR
14491 fold_build_cleanup_point_expr (tree type
, tree expr
)
14493 /* If the expression does not have side effects then we don't have to wrap
14494 it with a cleanup point expression. */
14495 if (!TREE_SIDE_EFFECTS (expr
))
14498 /* If the expression is a return, check to see if the expression inside the
14499 return has no side effects or the right hand side of the modify expression
14500 inside the return. If either don't have side effects set we don't need to
14501 wrap the expression in a cleanup point expression. Note we don't check the
14502 left hand side of the modify because it should always be a return decl. */
14503 if (TREE_CODE (expr
) == RETURN_EXPR
)
14505 tree op
= TREE_OPERAND (expr
, 0);
14506 if (!op
|| !TREE_SIDE_EFFECTS (op
))
14508 op
= TREE_OPERAND (op
, 1);
14509 if (!TREE_SIDE_EFFECTS (op
))
14513 return build1_loc (EXPR_LOCATION (expr
), CLEANUP_POINT_EXPR
, type
, expr
);
14516 /* Given a pointer value OP0 and a type TYPE, return a simplified version
14517 of an indirection through OP0, or NULL_TREE if no simplification is
14521 fold_indirect_ref_1 (location_t loc
, tree type
, tree op0
)
14525 poly_uint64 const_op01
;
14528 subtype
= TREE_TYPE (sub
);
14529 if (!POINTER_TYPE_P (subtype
)
14530 || TYPE_REF_CAN_ALIAS_ALL (TREE_TYPE (op0
)))
14533 if (TREE_CODE (sub
) == ADDR_EXPR
)
14535 tree op
= TREE_OPERAND (sub
, 0);
14536 tree optype
= TREE_TYPE (op
);
14538 /* *&CONST_DECL -> to the value of the const decl. */
14539 if (TREE_CODE (op
) == CONST_DECL
)
14540 return DECL_INITIAL (op
);
14541 /* *&p => p; make sure to handle *&"str"[cst] here. */
14542 if (type
== optype
)
14544 tree fop
= fold_read_from_constant_string (op
);
14550 /* *(foo *)&fooarray => fooarray[0] */
14551 else if (TREE_CODE (optype
) == ARRAY_TYPE
14552 && type
== TREE_TYPE (optype
)
14553 && (!in_gimple_form
14554 || TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
))
14556 tree type_domain
= TYPE_DOMAIN (optype
);
14557 tree min_val
= size_zero_node
;
14558 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
14559 min_val
= TYPE_MIN_VALUE (type_domain
);
14561 && TREE_CODE (min_val
) != INTEGER_CST
)
14563 return build4_loc (loc
, ARRAY_REF
, type
, op
, min_val
,
14564 NULL_TREE
, NULL_TREE
);
14566 /* *(foo *)&complexfoo => __real__ complexfoo */
14567 else if (TREE_CODE (optype
) == COMPLEX_TYPE
14568 && type
== TREE_TYPE (optype
))
14569 return fold_build1_loc (loc
, REALPART_EXPR
, type
, op
);
14570 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
14571 else if (VECTOR_TYPE_P (optype
)
14572 && type
== TREE_TYPE (optype
))
14574 tree part_width
= TYPE_SIZE (type
);
14575 tree index
= bitsize_int (0);
14576 return fold_build3_loc (loc
, BIT_FIELD_REF
, type
, op
, part_width
,
14581 if (TREE_CODE (sub
) == POINTER_PLUS_EXPR
14582 && poly_int_tree_p (TREE_OPERAND (sub
, 1), &const_op01
))
14584 tree op00
= TREE_OPERAND (sub
, 0);
14585 tree op01
= TREE_OPERAND (sub
, 1);
14588 if (TREE_CODE (op00
) == ADDR_EXPR
)
14591 op00
= TREE_OPERAND (op00
, 0);
14592 op00type
= TREE_TYPE (op00
);
14594 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
14595 if (VECTOR_TYPE_P (op00type
)
14596 && type
== TREE_TYPE (op00type
)
14597 /* POINTER_PLUS_EXPR second operand is sizetype, unsigned,
14598 but we want to treat offsets with MSB set as negative.
14599 For the code below negative offsets are invalid and
14600 TYPE_SIZE of the element is something unsigned, so
14601 check whether op01 fits into poly_int64, which implies
14602 it is from 0 to INTTYPE_MAXIMUM (HOST_WIDE_INT), and
14603 then just use poly_uint64 because we want to treat the
14604 value as unsigned. */
14605 && tree_fits_poly_int64_p (op01
))
14607 tree part_width
= TYPE_SIZE (type
);
14608 poly_uint64 max_offset
14609 = (tree_to_uhwi (part_width
) / BITS_PER_UNIT
14610 * TYPE_VECTOR_SUBPARTS (op00type
));
14611 if (known_lt (const_op01
, max_offset
))
14613 tree index
= bitsize_int (const_op01
* BITS_PER_UNIT
);
14614 return fold_build3_loc (loc
,
14615 BIT_FIELD_REF
, type
, op00
,
14616 part_width
, index
);
14619 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
14620 else if (TREE_CODE (op00type
) == COMPLEX_TYPE
14621 && type
== TREE_TYPE (op00type
))
14623 if (known_eq (wi::to_poly_offset (TYPE_SIZE_UNIT (type
)),
14625 return fold_build1_loc (loc
, IMAGPART_EXPR
, type
, op00
);
14627 /* ((foo *)&fooarray)[1] => fooarray[1] */
14628 else if (TREE_CODE (op00type
) == ARRAY_TYPE
14629 && type
== TREE_TYPE (op00type
))
14631 tree type_domain
= TYPE_DOMAIN (op00type
);
14632 tree min_val
= size_zero_node
;
14633 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
14634 min_val
= TYPE_MIN_VALUE (type_domain
);
14635 poly_uint64 type_size
, index
;
14636 if (poly_int_tree_p (min_val
)
14637 && poly_int_tree_p (TYPE_SIZE_UNIT (type
), &type_size
)
14638 && multiple_p (const_op01
, type_size
, &index
))
14640 poly_offset_int off
= index
+ wi::to_poly_offset (min_val
);
14641 op01
= wide_int_to_tree (sizetype
, off
);
14642 return build4_loc (loc
, ARRAY_REF
, type
, op00
, op01
,
14643 NULL_TREE
, NULL_TREE
);
14649 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
14650 if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
14651 && type
== TREE_TYPE (TREE_TYPE (subtype
))
14652 && (!in_gimple_form
14653 || TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
))
14656 tree min_val
= size_zero_node
;
14657 sub
= build_fold_indirect_ref_loc (loc
, sub
);
14658 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
14659 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
14660 min_val
= TYPE_MIN_VALUE (type_domain
);
14662 && TREE_CODE (min_val
) != INTEGER_CST
)
14664 return build4_loc (loc
, ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
,
14671 /* Builds an expression for an indirection through T, simplifying some
14675 build_fold_indirect_ref_loc (location_t loc
, tree t
)
14677 tree type
= TREE_TYPE (TREE_TYPE (t
));
14678 tree sub
= fold_indirect_ref_1 (loc
, type
, t
);
14683 return build1_loc (loc
, INDIRECT_REF
, type
, t
);
14686 /* Given an INDIRECT_REF T, return either T or a simplified version. */
14689 fold_indirect_ref_loc (location_t loc
, tree t
)
14691 tree sub
= fold_indirect_ref_1 (loc
, TREE_TYPE (t
), TREE_OPERAND (t
, 0));
14699 /* Strip non-trapping, non-side-effecting tree nodes from an expression
14700 whose result is ignored. The type of the returned tree need not be
14701 the same as the original expression. */
14704 fold_ignored_result (tree t
)
14706 if (!TREE_SIDE_EFFECTS (t
))
14707 return integer_zero_node
;
14710 switch (TREE_CODE_CLASS (TREE_CODE (t
)))
14713 t
= TREE_OPERAND (t
, 0);
14717 case tcc_comparison
:
14718 if (!TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 1)))
14719 t
= TREE_OPERAND (t
, 0);
14720 else if (!TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 0)))
14721 t
= TREE_OPERAND (t
, 1);
14726 case tcc_expression
:
14727 switch (TREE_CODE (t
))
14729 case COMPOUND_EXPR
:
14730 if (TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 1)))
14732 t
= TREE_OPERAND (t
, 0);
14736 if (TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 1))
14737 || TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 2)))
14739 t
= TREE_OPERAND (t
, 0);
14752 /* Return the value of VALUE, rounded up to a multiple of DIVISOR. */
14755 round_up_loc (location_t loc
, tree value
, unsigned int divisor
)
14757 tree div
= NULL_TREE
;
14762 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
14763 have to do anything. Only do this when we are not given a const,
14764 because in that case, this check is more expensive than just
14766 if (TREE_CODE (value
) != INTEGER_CST
)
14768 div
= build_int_cst (TREE_TYPE (value
), divisor
);
14770 if (multiple_of_p (TREE_TYPE (value
), value
, div
))
14774 /* If divisor is a power of two, simplify this to bit manipulation. */
14775 if (pow2_or_zerop (divisor
))
14777 if (TREE_CODE (value
) == INTEGER_CST
)
14779 wide_int val
= wi::to_wide (value
);
14782 if ((val
& (divisor
- 1)) == 0)
14785 overflow_p
= TREE_OVERFLOW (value
);
14786 val
+= divisor
- 1;
14787 val
&= (int) -divisor
;
14791 return force_fit_type (TREE_TYPE (value
), val
, -1, overflow_p
);
14797 t
= build_int_cst (TREE_TYPE (value
), divisor
- 1);
14798 value
= size_binop_loc (loc
, PLUS_EXPR
, value
, t
);
14799 t
= build_int_cst (TREE_TYPE (value
), - (int) divisor
);
14800 value
= size_binop_loc (loc
, BIT_AND_EXPR
, value
, t
);
14806 div
= build_int_cst (TREE_TYPE (value
), divisor
);
14807 value
= size_binop_loc (loc
, CEIL_DIV_EXPR
, value
, div
);
14808 value
= size_binop_loc (loc
, MULT_EXPR
, value
, div
);
14814 /* Likewise, but round down. */
14817 round_down_loc (location_t loc
, tree value
, int divisor
)
14819 tree div
= NULL_TREE
;
14821 gcc_assert (divisor
> 0);
14825 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
14826 have to do anything. Only do this when we are not given a const,
14827 because in that case, this check is more expensive than just
14829 if (TREE_CODE (value
) != INTEGER_CST
)
14831 div
= build_int_cst (TREE_TYPE (value
), divisor
);
14833 if (multiple_of_p (TREE_TYPE (value
), value
, div
))
14837 /* If divisor is a power of two, simplify this to bit manipulation. */
14838 if (pow2_or_zerop (divisor
))
14842 t
= build_int_cst (TREE_TYPE (value
), -divisor
);
14843 value
= size_binop_loc (loc
, BIT_AND_EXPR
, value
, t
);
14848 div
= build_int_cst (TREE_TYPE (value
), divisor
);
14849 value
= size_binop_loc (loc
, FLOOR_DIV_EXPR
, value
, div
);
14850 value
= size_binop_loc (loc
, MULT_EXPR
, value
, div
);
14856 /* Returns the pointer to the base of the object addressed by EXP and
14857 extracts the information about the offset of the access, storing it
14858 to PBITPOS and POFFSET. */
14861 split_address_to_core_and_offset (tree exp
,
14862 poly_int64_pod
*pbitpos
, tree
*poffset
)
14866 int unsignedp
, reversep
, volatilep
;
14867 poly_int64 bitsize
;
14868 location_t loc
= EXPR_LOCATION (exp
);
14870 if (TREE_CODE (exp
) == ADDR_EXPR
)
14872 core
= get_inner_reference (TREE_OPERAND (exp
, 0), &bitsize
, pbitpos
,
14873 poffset
, &mode
, &unsignedp
, &reversep
,
14875 core
= build_fold_addr_expr_loc (loc
, core
);
14877 else if (TREE_CODE (exp
) == POINTER_PLUS_EXPR
)
14879 core
= TREE_OPERAND (exp
, 0);
14882 *poffset
= TREE_OPERAND (exp
, 1);
14883 if (poly_int_tree_p (*poffset
))
14885 poly_offset_int tem
14886 = wi::sext (wi::to_poly_offset (*poffset
),
14887 TYPE_PRECISION (TREE_TYPE (*poffset
)));
14888 tem
<<= LOG2_BITS_PER_UNIT
;
14889 if (tem
.to_shwi (pbitpos
))
14890 *poffset
= NULL_TREE
;
14897 *poffset
= NULL_TREE
;
14903 /* Returns true if addresses of E1 and E2 differ by a constant, false
14904 otherwise. If they do, E1 - E2 is stored in *DIFF. */
14907 ptr_difference_const (tree e1
, tree e2
, poly_int64_pod
*diff
)
14910 poly_int64 bitpos1
, bitpos2
;
14911 tree toffset1
, toffset2
, tdiff
, type
;
14913 core1
= split_address_to_core_and_offset (e1
, &bitpos1
, &toffset1
);
14914 core2
= split_address_to_core_and_offset (e2
, &bitpos2
, &toffset2
);
14916 poly_int64 bytepos1
, bytepos2
;
14917 if (!multiple_p (bitpos1
, BITS_PER_UNIT
, &bytepos1
)
14918 || !multiple_p (bitpos2
, BITS_PER_UNIT
, &bytepos2
)
14919 || !operand_equal_p (core1
, core2
, 0))
14922 if (toffset1
&& toffset2
)
14924 type
= TREE_TYPE (toffset1
);
14925 if (type
!= TREE_TYPE (toffset2
))
14926 toffset2
= fold_convert (type
, toffset2
);
14928 tdiff
= fold_build2 (MINUS_EXPR
, type
, toffset1
, toffset2
);
14929 if (!cst_and_fits_in_hwi (tdiff
))
14932 *diff
= int_cst_value (tdiff
);
14934 else if (toffset1
|| toffset2
)
14936 /* If only one of the offsets is non-constant, the difference cannot
14943 *diff
+= bytepos1
- bytepos2
;
14947 /* Return OFF converted to a pointer offset type suitable as offset for
14948 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
14950 convert_to_ptrofftype_loc (location_t loc
, tree off
)
14952 return fold_convert_loc (loc
, sizetype
, off
);
14955 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
14957 fold_build_pointer_plus_loc (location_t loc
, tree ptr
, tree off
)
14959 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
14960 ptr
, convert_to_ptrofftype_loc (loc
, off
));
14963 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
14965 fold_build_pointer_plus_hwi_loc (location_t loc
, tree ptr
, HOST_WIDE_INT off
)
14967 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
14968 ptr
, size_int (off
));
14971 /* Return a pointer P to a NUL-terminated string representing the sequence
14972 of constant characters referred to by SRC (or a subsequence of such
14973 characters within it if SRC is a reference to a string plus some
14974 constant offset). If STRLEN is non-null, store the number of bytes
14975 in the string constant including the terminating NUL char. *STRLEN is
14976 typically strlen(P) + 1 in the absence of embedded NUL characters. */
14979 c_getstr (tree src
, unsigned HOST_WIDE_INT
*strlen
/* = NULL */)
14987 src
= string_constant (src
, &offset_node
, &mem_size
, NULL
);
14991 unsigned HOST_WIDE_INT offset
= 0;
14992 if (offset_node
!= NULL_TREE
)
14994 if (!tree_fits_uhwi_p (offset_node
))
14997 offset
= tree_to_uhwi (offset_node
);
15000 if (!tree_fits_uhwi_p (mem_size
))
15003 /* STRING_LENGTH is the size of the string literal, including any
15004 embedded NULs. STRING_SIZE is the size of the array the string
15005 literal is stored in. */
15006 unsigned HOST_WIDE_INT string_length
= TREE_STRING_LENGTH (src
);
15007 unsigned HOST_WIDE_INT string_size
= tree_to_uhwi (mem_size
);
15009 /* Ideally this would turn into a gcc_checking_assert over time. */
15010 if (string_length
> string_size
)
15011 string_length
= string_size
;
15013 const char *string
= TREE_STRING_POINTER (src
);
15015 /* Ideally this would turn into a gcc_checking_assert over time. */
15016 if (string_length
> string_size
)
15017 string_length
= string_size
;
15019 if (string_length
== 0
15020 || offset
>= string_size
)
15025 /* Compute and store the length of the substring at OFFSET.
15026 All offsets past the initial length refer to null strings. */
15027 if (offset
< string_length
)
15028 *strlen
= string_length
- offset
;
15034 tree eltype
= TREE_TYPE (TREE_TYPE (src
));
15035 /* Support only properly NUL-terminated single byte strings. */
15036 if (tree_to_uhwi (TYPE_SIZE_UNIT (eltype
)) != 1)
15038 if (string
[string_length
- 1] != '\0')
15042 return offset
< string_length
? string
+ offset
: "";
15045 /* Given a tree T, compute which bits in T may be nonzero. */
15048 tree_nonzero_bits (const_tree t
)
15050 switch (TREE_CODE (t
))
15053 return wi::to_wide (t
);
15055 return get_nonzero_bits (t
);
15056 case NON_LVALUE_EXPR
:
15058 return tree_nonzero_bits (TREE_OPERAND (t
, 0));
15060 return wi::bit_and (tree_nonzero_bits (TREE_OPERAND (t
, 0)),
15061 tree_nonzero_bits (TREE_OPERAND (t
, 1)));
15064 return wi::bit_or (tree_nonzero_bits (TREE_OPERAND (t
, 0)),
15065 tree_nonzero_bits (TREE_OPERAND (t
, 1)));
15067 return wi::bit_or (tree_nonzero_bits (TREE_OPERAND (t
, 1)),
15068 tree_nonzero_bits (TREE_OPERAND (t
, 2)));
15070 return wide_int::from (tree_nonzero_bits (TREE_OPERAND (t
, 0)),
15071 TYPE_PRECISION (TREE_TYPE (t
)),
15072 TYPE_SIGN (TREE_TYPE (TREE_OPERAND (t
, 0))));
15074 if (INTEGRAL_TYPE_P (TREE_TYPE (t
)))
15076 wide_int nzbits1
= tree_nonzero_bits (TREE_OPERAND (t
, 0));
15077 wide_int nzbits2
= tree_nonzero_bits (TREE_OPERAND (t
, 1));
15078 if (wi::bit_and (nzbits1
, nzbits2
) == 0)
15079 return wi::bit_or (nzbits1
, nzbits2
);
15083 if (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
)
15085 tree type
= TREE_TYPE (t
);
15086 wide_int nzbits
= tree_nonzero_bits (TREE_OPERAND (t
, 0));
15087 wide_int arg1
= wi::to_wide (TREE_OPERAND (t
, 1),
15088 TYPE_PRECISION (type
));
15089 return wi::neg_p (arg1
)
15090 ? wi::rshift (nzbits
, -arg1
, TYPE_SIGN (type
))
15091 : wi::lshift (nzbits
, arg1
);
15095 if (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
)
15097 tree type
= TREE_TYPE (t
);
15098 wide_int nzbits
= tree_nonzero_bits (TREE_OPERAND (t
, 0));
15099 wide_int arg1
= wi::to_wide (TREE_OPERAND (t
, 1),
15100 TYPE_PRECISION (type
));
15101 return wi::neg_p (arg1
)
15102 ? wi::lshift (nzbits
, -arg1
)
15103 : wi::rshift (nzbits
, arg1
, TYPE_SIGN (type
));
15110 return wi::shwi (-1, TYPE_PRECISION (TREE_TYPE (t
)));
15115 namespace selftest
{
15117 /* Helper functions for writing tests of folding trees. */
15119 /* Verify that the binary op (LHS CODE RHS) folds to CONSTANT. */
15122 assert_binop_folds_to_const (tree lhs
, enum tree_code code
, tree rhs
,
15125 ASSERT_EQ (constant
, fold_build2 (code
, TREE_TYPE (lhs
), lhs
, rhs
));
15128 /* Verify that the binary op (LHS CODE RHS) folds to an NON_LVALUE_EXPR
15129 wrapping WRAPPED_EXPR. */
15132 assert_binop_folds_to_nonlvalue (tree lhs
, enum tree_code code
, tree rhs
,
15135 tree result
= fold_build2 (code
, TREE_TYPE (lhs
), lhs
, rhs
);
15136 ASSERT_NE (wrapped_expr
, result
);
15137 ASSERT_EQ (NON_LVALUE_EXPR
, TREE_CODE (result
));
15138 ASSERT_EQ (wrapped_expr
, TREE_OPERAND (result
, 0));
15141 /* Verify that various arithmetic binary operations are folded
15145 test_arithmetic_folding ()
15147 tree type
= integer_type_node
;
15148 tree x
= create_tmp_var_raw (type
, "x");
15149 tree zero
= build_zero_cst (type
);
15150 tree one
= build_int_cst (type
, 1);
15153 /* 1 <-- (0 + 1) */
15154 assert_binop_folds_to_const (zero
, PLUS_EXPR
, one
,
15156 assert_binop_folds_to_const (one
, PLUS_EXPR
, zero
,
15159 /* (nonlvalue)x <-- (x + 0) */
15160 assert_binop_folds_to_nonlvalue (x
, PLUS_EXPR
, zero
,
15164 /* 0 <-- (x - x) */
15165 assert_binop_folds_to_const (x
, MINUS_EXPR
, x
,
15167 assert_binop_folds_to_nonlvalue (x
, MINUS_EXPR
, zero
,
15170 /* Multiplication. */
15171 /* 0 <-- (x * 0) */
15172 assert_binop_folds_to_const (x
, MULT_EXPR
, zero
,
15175 /* (nonlvalue)x <-- (x * 1) */
15176 assert_binop_folds_to_nonlvalue (x
, MULT_EXPR
, one
,
15180 /* Verify that various binary operations on vectors are folded
15184 test_vector_folding ()
15186 tree inner_type
= integer_type_node
;
15187 tree type
= build_vector_type (inner_type
, 4);
15188 tree zero
= build_zero_cst (type
);
15189 tree one
= build_one_cst (type
);
15190 tree index
= build_index_vector (type
, 0, 1);
15192 /* Verify equality tests that return a scalar boolean result. */
15193 tree res_type
= boolean_type_node
;
15194 ASSERT_FALSE (integer_nonzerop (fold_build2 (EQ_EXPR
, res_type
, zero
, one
)));
15195 ASSERT_TRUE (integer_nonzerop (fold_build2 (EQ_EXPR
, res_type
, zero
, zero
)));
15196 ASSERT_TRUE (integer_nonzerop (fold_build2 (NE_EXPR
, res_type
, zero
, one
)));
15197 ASSERT_FALSE (integer_nonzerop (fold_build2 (NE_EXPR
, res_type
, one
, one
)));
15198 ASSERT_TRUE (integer_nonzerop (fold_build2 (NE_EXPR
, res_type
, index
, one
)));
15199 ASSERT_FALSE (integer_nonzerop (fold_build2 (EQ_EXPR
, res_type
,
15201 ASSERT_FALSE (integer_nonzerop (fold_build2 (NE_EXPR
, res_type
,
15203 ASSERT_TRUE (integer_nonzerop (fold_build2 (EQ_EXPR
, res_type
,
15207 /* Verify folding of VEC_DUPLICATE_EXPRs. */
15210 test_vec_duplicate_folding ()
15212 scalar_int_mode int_mode
= SCALAR_INT_TYPE_MODE (ssizetype
);
15213 machine_mode vec_mode
= targetm
.vectorize
.preferred_simd_mode (int_mode
);
15214 /* This will be 1 if VEC_MODE isn't a vector mode. */
15215 poly_uint64 nunits
= GET_MODE_NUNITS (vec_mode
);
15217 tree type
= build_vector_type (ssizetype
, nunits
);
15218 tree dup5_expr
= fold_unary (VEC_DUPLICATE_EXPR
, type
, ssize_int (5));
15219 tree dup5_cst
= build_vector_from_val (type
, ssize_int (5));
15220 ASSERT_TRUE (operand_equal_p (dup5_expr
, dup5_cst
, 0));
15223 /* Run all of the selftests within this file. */
15226 fold_const_c_tests ()
15228 test_arithmetic_folding ();
15229 test_vector_folding ();
15230 test_vec_duplicate_folding ();
15233 } // namespace selftest
15235 #endif /* CHECKING_P */