1 /* Fold a constant sub-tree into a single node for C-compiler
2 Copyright (C) 1987-2020 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"
74 #include "tree-into-ssa.h"
76 #include "case-cfn-macros.h"
77 #include "stringpool.h"
79 #include "tree-ssanames.h"
81 #include "stringpool.h"
83 #include "tree-vector-builder.h"
84 #include "vec-perm-indices.h"
86 /* Nonzero if we are folding constants inside an initializer; zero
88 int folding_initializer
= 0;
90 /* The following constants represent a bit based encoding of GCC's
91 comparison operators. This encoding simplifies transformations
92 on relational comparison operators, such as AND and OR. */
93 enum comparison_code
{
112 static bool negate_expr_p (tree
);
113 static tree
negate_expr (tree
);
114 static tree
associate_trees (location_t
, tree
, tree
, enum tree_code
, tree
);
115 static enum comparison_code
comparison_to_compcode (enum tree_code
);
116 static enum tree_code
compcode_to_comparison (enum comparison_code
);
117 static bool twoval_comparison_p (tree
, tree
*, tree
*);
118 static tree
eval_subst (location_t
, tree
, tree
, tree
, tree
, tree
);
119 static tree
optimize_bit_field_compare (location_t
, enum tree_code
,
121 static bool simple_operand_p (const_tree
);
122 static bool simple_operand_p_2 (tree
);
123 static tree
range_binop (enum tree_code
, tree
, tree
, int, tree
, int);
124 static tree
range_predecessor (tree
);
125 static tree
range_successor (tree
);
126 static tree
fold_range_test (location_t
, enum tree_code
, tree
, tree
, tree
);
127 static tree
fold_cond_expr_with_comparison (location_t
, tree
, tree
, tree
, tree
);
128 static tree
unextend (tree
, int, int, tree
);
129 static tree
extract_muldiv (tree
, tree
, enum tree_code
, tree
, bool *);
130 static tree
extract_muldiv_1 (tree
, tree
, enum tree_code
, tree
, bool *);
131 static tree
fold_binary_op_with_conditional_arg (location_t
,
132 enum tree_code
, tree
,
135 static tree
fold_negate_const (tree
, tree
);
136 static tree
fold_not_const (const_tree
, tree
);
137 static tree
fold_relational_const (enum tree_code
, tree
, tree
, tree
);
138 static tree
fold_convert_const (enum tree_code
, tree
, tree
);
139 static tree
fold_view_convert_expr (tree
, tree
);
140 static tree
fold_negate_expr (location_t
, tree
);
143 /* Return EXPR_LOCATION of T if it is not UNKNOWN_LOCATION.
144 Otherwise, return LOC. */
147 expr_location_or (tree t
, location_t loc
)
149 location_t tloc
= EXPR_LOCATION (t
);
150 return tloc
== UNKNOWN_LOCATION
? loc
: tloc
;
153 /* Similar to protected_set_expr_location, but never modify x in place,
154 if location can and needs to be set, unshare it. */
157 protected_set_expr_location_unshare (tree x
, location_t loc
)
159 if (CAN_HAVE_LOCATION_P (x
)
160 && EXPR_LOCATION (x
) != loc
161 && !(TREE_CODE (x
) == SAVE_EXPR
162 || TREE_CODE (x
) == TARGET_EXPR
163 || TREE_CODE (x
) == BIND_EXPR
))
166 SET_EXPR_LOCATION (x
, loc
);
171 /* If ARG2 divides ARG1 with zero remainder, carries out the exact
172 division and returns the quotient. Otherwise returns
176 div_if_zero_remainder (const_tree arg1
, const_tree arg2
)
180 if (wi::multiple_of_p (wi::to_widest (arg1
), wi::to_widest (arg2
),
182 return wide_int_to_tree (TREE_TYPE (arg1
), quo
);
187 /* This is nonzero if we should defer warnings about undefined
188 overflow. This facility exists because these warnings are a
189 special case. The code to estimate loop iterations does not want
190 to issue any warnings, since it works with expressions which do not
191 occur in user code. Various bits of cleanup code call fold(), but
192 only use the result if it has certain characteristics (e.g., is a
193 constant); that code only wants to issue a warning if the result is
196 static int fold_deferring_overflow_warnings
;
198 /* If a warning about undefined overflow is deferred, this is the
199 warning. Note that this may cause us to turn two warnings into
200 one, but that is fine since it is sufficient to only give one
201 warning per expression. */
203 static const char* fold_deferred_overflow_warning
;
205 /* If a warning about undefined overflow is deferred, this is the
206 level at which the warning should be emitted. */
208 static enum warn_strict_overflow_code fold_deferred_overflow_code
;
210 /* Start deferring overflow warnings. We could use a stack here to
211 permit nested calls, but at present it is not necessary. */
214 fold_defer_overflow_warnings (void)
216 ++fold_deferring_overflow_warnings
;
219 /* Stop deferring overflow warnings. If there is a pending warning,
220 and ISSUE is true, then issue the warning if appropriate. STMT is
221 the statement with which the warning should be associated (used for
222 location information); STMT may be NULL. CODE is the level of the
223 warning--a warn_strict_overflow_code value. This function will use
224 the smaller of CODE and the deferred code when deciding whether to
225 issue the warning. CODE may be zero to mean to always use the
229 fold_undefer_overflow_warnings (bool issue
, const gimple
*stmt
, int code
)
234 gcc_assert (fold_deferring_overflow_warnings
> 0);
235 --fold_deferring_overflow_warnings
;
236 if (fold_deferring_overflow_warnings
> 0)
238 if (fold_deferred_overflow_warning
!= NULL
240 && code
< (int) fold_deferred_overflow_code
)
241 fold_deferred_overflow_code
= (enum warn_strict_overflow_code
) code
;
245 warnmsg
= fold_deferred_overflow_warning
;
246 fold_deferred_overflow_warning
= NULL
;
248 if (!issue
|| warnmsg
== NULL
)
251 if (gimple_no_warning_p (stmt
))
254 /* Use the smallest code level when deciding to issue the
256 if (code
== 0 || code
> (int) fold_deferred_overflow_code
)
257 code
= fold_deferred_overflow_code
;
259 if (!issue_strict_overflow_warning (code
))
263 locus
= input_location
;
265 locus
= gimple_location (stmt
);
266 warning_at (locus
, OPT_Wstrict_overflow
, "%s", warnmsg
);
269 /* Stop deferring overflow warnings, ignoring any deferred
273 fold_undefer_and_ignore_overflow_warnings (void)
275 fold_undefer_overflow_warnings (false, NULL
, 0);
278 /* Whether we are deferring overflow warnings. */
281 fold_deferring_overflow_warnings_p (void)
283 return fold_deferring_overflow_warnings
> 0;
286 /* This is called when we fold something based on the fact that signed
287 overflow is undefined. */
290 fold_overflow_warning (const char* gmsgid
, enum warn_strict_overflow_code wc
)
292 if (fold_deferring_overflow_warnings
> 0)
294 if (fold_deferred_overflow_warning
== NULL
295 || wc
< fold_deferred_overflow_code
)
297 fold_deferred_overflow_warning
= gmsgid
;
298 fold_deferred_overflow_code
= wc
;
301 else if (issue_strict_overflow_warning (wc
))
302 warning (OPT_Wstrict_overflow
, gmsgid
);
305 /* Return true if the built-in mathematical function specified by CODE
306 is odd, i.e. -f(x) == f(-x). */
309 negate_mathfn_p (combined_fn fn
)
332 CASE_CFN_ROUNDEVEN_FN
:
344 return !flag_rounding_math
;
352 /* Check whether we may negate an integer constant T without causing
356 may_negate_without_overflow_p (const_tree t
)
360 gcc_assert (TREE_CODE (t
) == INTEGER_CST
);
362 type
= TREE_TYPE (t
);
363 if (TYPE_UNSIGNED (type
))
366 return !wi::only_sign_bit_p (wi::to_wide (t
));
369 /* Determine whether an expression T can be cheaply negated using
370 the function negate_expr without introducing undefined overflow. */
373 negate_expr_p (tree t
)
380 type
= TREE_TYPE (t
);
383 switch (TREE_CODE (t
))
386 if (INTEGRAL_TYPE_P (type
) && TYPE_UNSIGNED (type
))
389 /* Check that -CST will not overflow type. */
390 return may_negate_without_overflow_p (t
);
392 return (INTEGRAL_TYPE_P (type
)
393 && TYPE_OVERFLOW_WRAPS (type
));
399 return !TYPE_OVERFLOW_SANITIZED (type
);
402 /* We want to canonicalize to positive real constants. Pretend
403 that only negative ones can be easily negated. */
404 return REAL_VALUE_NEGATIVE (TREE_REAL_CST (t
));
407 return negate_expr_p (TREE_REALPART (t
))
408 && negate_expr_p (TREE_IMAGPART (t
));
412 if (FLOAT_TYPE_P (TREE_TYPE (type
)) || TYPE_OVERFLOW_WRAPS (type
))
415 /* Steps don't prevent negation. */
416 unsigned int count
= vector_cst_encoded_nelts (t
);
417 for (unsigned int i
= 0; i
< count
; ++i
)
418 if (!negate_expr_p (VECTOR_CST_ENCODED_ELT (t
, i
)))
425 return negate_expr_p (TREE_OPERAND (t
, 0))
426 && negate_expr_p (TREE_OPERAND (t
, 1));
429 return negate_expr_p (TREE_OPERAND (t
, 0));
432 if (HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
433 || HONOR_SIGNED_ZEROS (element_mode (type
))
434 || (ANY_INTEGRAL_TYPE_P (type
)
435 && ! TYPE_OVERFLOW_WRAPS (type
)))
437 /* -(A + B) -> (-B) - A. */
438 if (negate_expr_p (TREE_OPERAND (t
, 1)))
440 /* -(A + B) -> (-A) - B. */
441 return negate_expr_p (TREE_OPERAND (t
, 0));
444 /* We can't turn -(A-B) into B-A when we honor signed zeros. */
445 return !HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
446 && !HONOR_SIGNED_ZEROS (element_mode (type
))
447 && (! ANY_INTEGRAL_TYPE_P (type
)
448 || TYPE_OVERFLOW_WRAPS (type
));
451 if (TYPE_UNSIGNED (type
))
453 /* INT_MIN/n * n doesn't overflow while negating one operand it does
454 if n is a (negative) power of two. */
455 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
456 && ! TYPE_OVERFLOW_WRAPS (TREE_TYPE (t
))
457 && ! ((TREE_CODE (TREE_OPERAND (t
, 0)) == INTEGER_CST
459 (wi::abs (wi::to_wide (TREE_OPERAND (t
, 0))))) != 1)
460 || (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
462 (wi::abs (wi::to_wide (TREE_OPERAND (t
, 1))))) != 1)))
468 if (! HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (TREE_TYPE (t
))))
469 return negate_expr_p (TREE_OPERAND (t
, 1))
470 || negate_expr_p (TREE_OPERAND (t
, 0));
476 if (TYPE_UNSIGNED (type
))
478 /* In general we can't negate A in A / B, because if A is INT_MIN and
479 B is not 1 we change the sign of the result. */
480 if (TREE_CODE (TREE_OPERAND (t
, 0)) == INTEGER_CST
481 && negate_expr_p (TREE_OPERAND (t
, 0)))
483 /* In general we can't negate B in A / B, because if A is INT_MIN and
484 B is 1, we may turn this into INT_MIN / -1 which is undefined
485 and actually traps on some architectures. */
486 if (! ANY_INTEGRAL_TYPE_P (TREE_TYPE (t
))
487 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (t
))
488 || (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
489 && ! integer_onep (TREE_OPERAND (t
, 1))))
490 return negate_expr_p (TREE_OPERAND (t
, 1));
494 /* Negate -((double)float) as (double)(-float). */
495 if (TREE_CODE (type
) == REAL_TYPE
)
497 tree tem
= strip_float_extensions (t
);
499 return negate_expr_p (tem
);
504 /* Negate -f(x) as f(-x). */
505 if (negate_mathfn_p (get_call_combined_fn (t
)))
506 return negate_expr_p (CALL_EXPR_ARG (t
, 0));
510 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
511 if (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
)
513 tree op1
= TREE_OPERAND (t
, 1);
514 if (wi::to_wide (op1
) == TYPE_PRECISION (type
) - 1)
525 /* Given T, an expression, return a folded tree for -T or NULL_TREE, if no
526 simplification is possible.
527 If negate_expr_p would return true for T, NULL_TREE will never be
531 fold_negate_expr_1 (location_t loc
, tree t
)
533 tree type
= TREE_TYPE (t
);
536 switch (TREE_CODE (t
))
538 /* Convert - (~A) to A + 1. */
540 if (INTEGRAL_TYPE_P (type
))
541 return fold_build2_loc (loc
, PLUS_EXPR
, type
, TREE_OPERAND (t
, 0),
542 build_one_cst (type
));
546 tem
= fold_negate_const (t
, type
);
547 if (TREE_OVERFLOW (tem
) == TREE_OVERFLOW (t
)
548 || (ANY_INTEGRAL_TYPE_P (type
)
549 && !TYPE_OVERFLOW_TRAPS (type
)
550 && TYPE_OVERFLOW_WRAPS (type
))
551 || (flag_sanitize
& SANITIZE_SI_OVERFLOW
) == 0)
558 tem
= fold_negate_const (t
, type
);
563 tree rpart
= fold_negate_expr (loc
, TREE_REALPART (t
));
564 tree ipart
= fold_negate_expr (loc
, TREE_IMAGPART (t
));
566 return build_complex (type
, rpart
, ipart
);
572 tree_vector_builder elts
;
573 elts
.new_unary_operation (type
, t
, true);
574 unsigned int count
= elts
.encoded_nelts ();
575 for (unsigned int i
= 0; i
< count
; ++i
)
577 tree elt
= fold_negate_expr (loc
, VECTOR_CST_ELT (t
, i
));
578 if (elt
== NULL_TREE
)
580 elts
.quick_push (elt
);
583 return elts
.build ();
587 if (negate_expr_p (t
))
588 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
589 fold_negate_expr (loc
, TREE_OPERAND (t
, 0)),
590 fold_negate_expr (loc
, TREE_OPERAND (t
, 1)));
594 if (negate_expr_p (t
))
595 return fold_build1_loc (loc
, CONJ_EXPR
, type
,
596 fold_negate_expr (loc
, TREE_OPERAND (t
, 0)));
600 if (!TYPE_OVERFLOW_SANITIZED (type
))
601 return TREE_OPERAND (t
, 0);
605 if (!HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
606 && !HONOR_SIGNED_ZEROS (element_mode (type
)))
608 /* -(A + B) -> (-B) - A. */
609 if (negate_expr_p (TREE_OPERAND (t
, 1)))
611 tem
= negate_expr (TREE_OPERAND (t
, 1));
612 return fold_build2_loc (loc
, MINUS_EXPR
, type
,
613 tem
, TREE_OPERAND (t
, 0));
616 /* -(A + B) -> (-A) - B. */
617 if (negate_expr_p (TREE_OPERAND (t
, 0)))
619 tem
= negate_expr (TREE_OPERAND (t
, 0));
620 return fold_build2_loc (loc
, MINUS_EXPR
, type
,
621 tem
, TREE_OPERAND (t
, 1));
627 /* - (A - B) -> B - A */
628 if (!HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
629 && !HONOR_SIGNED_ZEROS (element_mode (type
)))
630 return fold_build2_loc (loc
, MINUS_EXPR
, type
,
631 TREE_OPERAND (t
, 1), TREE_OPERAND (t
, 0));
635 if (TYPE_UNSIGNED (type
))
641 if (! HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
)))
643 tem
= TREE_OPERAND (t
, 1);
644 if (negate_expr_p (tem
))
645 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
646 TREE_OPERAND (t
, 0), negate_expr (tem
));
647 tem
= TREE_OPERAND (t
, 0);
648 if (negate_expr_p (tem
))
649 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
650 negate_expr (tem
), TREE_OPERAND (t
, 1));
657 if (TYPE_UNSIGNED (type
))
659 /* In general we can't negate A in A / B, because if A is INT_MIN and
660 B is not 1 we change the sign of the result. */
661 if (TREE_CODE (TREE_OPERAND (t
, 0)) == INTEGER_CST
662 && negate_expr_p (TREE_OPERAND (t
, 0)))
663 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
664 negate_expr (TREE_OPERAND (t
, 0)),
665 TREE_OPERAND (t
, 1));
666 /* In general we can't negate B in A / B, because if A is INT_MIN and
667 B is 1, we may turn this into INT_MIN / -1 which is undefined
668 and actually traps on some architectures. */
669 if ((! ANY_INTEGRAL_TYPE_P (TREE_TYPE (t
))
670 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (t
))
671 || (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
672 && ! integer_onep (TREE_OPERAND (t
, 1))))
673 && negate_expr_p (TREE_OPERAND (t
, 1)))
674 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
676 negate_expr (TREE_OPERAND (t
, 1)));
680 /* Convert -((double)float) into (double)(-float). */
681 if (TREE_CODE (type
) == REAL_TYPE
)
683 tem
= strip_float_extensions (t
);
684 if (tem
!= t
&& negate_expr_p (tem
))
685 return fold_convert_loc (loc
, type
, negate_expr (tem
));
690 /* Negate -f(x) as f(-x). */
691 if (negate_mathfn_p (get_call_combined_fn (t
))
692 && negate_expr_p (CALL_EXPR_ARG (t
, 0)))
696 fndecl
= get_callee_fndecl (t
);
697 arg
= negate_expr (CALL_EXPR_ARG (t
, 0));
698 return build_call_expr_loc (loc
, fndecl
, 1, arg
);
703 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
704 if (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
)
706 tree op1
= TREE_OPERAND (t
, 1);
707 if (wi::to_wide (op1
) == TYPE_PRECISION (type
) - 1)
709 tree ntype
= TYPE_UNSIGNED (type
)
710 ? signed_type_for (type
)
711 : unsigned_type_for (type
);
712 tree temp
= fold_convert_loc (loc
, ntype
, TREE_OPERAND (t
, 0));
713 temp
= fold_build2_loc (loc
, RSHIFT_EXPR
, ntype
, temp
, op1
);
714 return fold_convert_loc (loc
, type
, temp
);
726 /* A wrapper for fold_negate_expr_1. */
729 fold_negate_expr (location_t loc
, tree t
)
731 tree type
= TREE_TYPE (t
);
733 tree tem
= fold_negate_expr_1 (loc
, t
);
734 if (tem
== NULL_TREE
)
736 return fold_convert_loc (loc
, type
, tem
);
739 /* Like fold_negate_expr, but return a NEGATE_EXPR tree, if T cannot be
740 negated in a simpler way. Also allow for T to be NULL_TREE, in which case
752 loc
= EXPR_LOCATION (t
);
753 type
= TREE_TYPE (t
);
756 tem
= fold_negate_expr (loc
, t
);
758 tem
= build1_loc (loc
, NEGATE_EXPR
, TREE_TYPE (t
), t
);
759 return fold_convert_loc (loc
, type
, tem
);
762 /* Split a tree IN into a constant, literal and variable parts that could be
763 combined with CODE to make IN. "constant" means an expression with
764 TREE_CONSTANT but that isn't an actual constant. CODE must be a
765 commutative arithmetic operation. Store the constant part into *CONP,
766 the literal in *LITP and return the variable part. If a part isn't
767 present, set it to null. If the tree does not decompose in this way,
768 return the entire tree as the variable part and the other parts as null.
770 If CODE is PLUS_EXPR we also split trees that use MINUS_EXPR. In that
771 case, we negate an operand that was subtracted. Except if it is a
772 literal for which we use *MINUS_LITP instead.
774 If NEGATE_P is true, we are negating all of IN, again except a literal
775 for which we use *MINUS_LITP instead. If a variable part is of pointer
776 type, it is negated after converting to TYPE. This prevents us from
777 generating illegal MINUS pointer expression. LOC is the location of
778 the converted variable part.
780 If IN is itself a literal or constant, return it as appropriate.
782 Note that we do not guarantee that any of the three values will be the
783 same type as IN, but they will have the same signedness and mode. */
786 split_tree (tree in
, tree type
, enum tree_code code
,
787 tree
*minus_varp
, tree
*conp
, tree
*minus_conp
,
788 tree
*litp
, tree
*minus_litp
, int negate_p
)
797 /* Strip any conversions that don't change the machine mode or signedness. */
798 STRIP_SIGN_NOPS (in
);
800 if (TREE_CODE (in
) == INTEGER_CST
|| TREE_CODE (in
) == REAL_CST
801 || TREE_CODE (in
) == FIXED_CST
)
803 else if (TREE_CODE (in
) == code
804 || ((! FLOAT_TYPE_P (TREE_TYPE (in
)) || flag_associative_math
)
805 && ! SAT_FIXED_POINT_TYPE_P (TREE_TYPE (in
))
806 /* We can associate addition and subtraction together (even
807 though the C standard doesn't say so) for integers because
808 the value is not affected. For reals, the value might be
809 affected, so we can't. */
810 && ((code
== PLUS_EXPR
&& TREE_CODE (in
) == POINTER_PLUS_EXPR
)
811 || (code
== PLUS_EXPR
&& TREE_CODE (in
) == MINUS_EXPR
)
812 || (code
== MINUS_EXPR
813 && (TREE_CODE (in
) == PLUS_EXPR
814 || TREE_CODE (in
) == POINTER_PLUS_EXPR
)))))
816 tree op0
= TREE_OPERAND (in
, 0);
817 tree op1
= TREE_OPERAND (in
, 1);
818 int neg1_p
= TREE_CODE (in
) == MINUS_EXPR
;
819 int neg_litp_p
= 0, neg_conp_p
= 0, neg_var_p
= 0;
821 /* First see if either of the operands is a literal, then a constant. */
822 if (TREE_CODE (op0
) == INTEGER_CST
|| TREE_CODE (op0
) == REAL_CST
823 || TREE_CODE (op0
) == FIXED_CST
)
824 *litp
= op0
, op0
= 0;
825 else if (TREE_CODE (op1
) == INTEGER_CST
|| TREE_CODE (op1
) == REAL_CST
826 || TREE_CODE (op1
) == FIXED_CST
)
827 *litp
= op1
, neg_litp_p
= neg1_p
, op1
= 0;
829 if (op0
!= 0 && TREE_CONSTANT (op0
))
830 *conp
= op0
, op0
= 0;
831 else if (op1
!= 0 && TREE_CONSTANT (op1
))
832 *conp
= op1
, neg_conp_p
= neg1_p
, op1
= 0;
834 /* If we haven't dealt with either operand, this is not a case we can
835 decompose. Otherwise, VAR is either of the ones remaining, if any. */
836 if (op0
!= 0 && op1
!= 0)
841 var
= op1
, neg_var_p
= neg1_p
;
843 /* Now do any needed negations. */
845 *minus_litp
= *litp
, *litp
= 0;
846 if (neg_conp_p
&& *conp
)
847 *minus_conp
= *conp
, *conp
= 0;
848 if (neg_var_p
&& var
)
849 *minus_varp
= var
, var
= 0;
851 else if (TREE_CONSTANT (in
))
853 else if (TREE_CODE (in
) == BIT_NOT_EXPR
854 && code
== PLUS_EXPR
)
856 /* -1 - X is folded to ~X, undo that here. Do _not_ do this
857 when IN is constant. */
858 *litp
= build_minus_one_cst (type
);
859 *minus_varp
= TREE_OPERAND (in
, 0);
867 *minus_litp
= *litp
, *litp
= 0;
868 else if (*minus_litp
)
869 *litp
= *minus_litp
, *minus_litp
= 0;
871 *minus_conp
= *conp
, *conp
= 0;
872 else if (*minus_conp
)
873 *conp
= *minus_conp
, *minus_conp
= 0;
875 *minus_varp
= var
, var
= 0;
876 else if (*minus_varp
)
877 var
= *minus_varp
, *minus_varp
= 0;
881 && TREE_OVERFLOW_P (*litp
))
882 *litp
= drop_tree_overflow (*litp
);
884 && TREE_OVERFLOW_P (*minus_litp
))
885 *minus_litp
= drop_tree_overflow (*minus_litp
);
890 /* Re-associate trees split by the above function. T1 and T2 are
891 either expressions to associate or null. Return the new
892 expression, if any. LOC is the location of the new expression. If
893 we build an operation, do it in TYPE and with CODE. */
896 associate_trees (location_t loc
, tree t1
, tree t2
, enum tree_code code
, tree type
)
900 gcc_assert (t2
== 0 || code
!= MINUS_EXPR
);
906 /* If either input is CODE, a PLUS_EXPR, or a MINUS_EXPR, don't
907 try to fold this since we will have infinite recursion. But do
908 deal with any NEGATE_EXPRs. */
909 if (TREE_CODE (t1
) == code
|| TREE_CODE (t2
) == code
910 || TREE_CODE (t1
) == PLUS_EXPR
|| TREE_CODE (t2
) == PLUS_EXPR
911 || TREE_CODE (t1
) == MINUS_EXPR
|| TREE_CODE (t2
) == MINUS_EXPR
)
913 if (code
== PLUS_EXPR
)
915 if (TREE_CODE (t1
) == NEGATE_EXPR
)
916 return build2_loc (loc
, MINUS_EXPR
, type
,
917 fold_convert_loc (loc
, type
, t2
),
918 fold_convert_loc (loc
, type
,
919 TREE_OPERAND (t1
, 0)));
920 else if (TREE_CODE (t2
) == NEGATE_EXPR
)
921 return build2_loc (loc
, MINUS_EXPR
, type
,
922 fold_convert_loc (loc
, type
, t1
),
923 fold_convert_loc (loc
, type
,
924 TREE_OPERAND (t2
, 0)));
925 else if (integer_zerop (t2
))
926 return fold_convert_loc (loc
, type
, t1
);
928 else if (code
== MINUS_EXPR
)
930 if (integer_zerop (t2
))
931 return fold_convert_loc (loc
, type
, t1
);
934 return build2_loc (loc
, code
, type
, fold_convert_loc (loc
, type
, t1
),
935 fold_convert_loc (loc
, type
, t2
));
938 return fold_build2_loc (loc
, code
, type
, fold_convert_loc (loc
, type
, t1
),
939 fold_convert_loc (loc
, type
, t2
));
942 /* Check whether TYPE1 and TYPE2 are equivalent integer types, suitable
943 for use in int_const_binop, size_binop and size_diffop. */
946 int_binop_types_match_p (enum tree_code code
, const_tree type1
, const_tree type2
)
948 if (!INTEGRAL_TYPE_P (type1
) && !POINTER_TYPE_P (type1
))
950 if (!INTEGRAL_TYPE_P (type2
) && !POINTER_TYPE_P (type2
))
965 return TYPE_UNSIGNED (type1
) == TYPE_UNSIGNED (type2
)
966 && TYPE_PRECISION (type1
) == TYPE_PRECISION (type2
)
967 && TYPE_MODE (type1
) == TYPE_MODE (type2
);
970 /* Combine two wide ints ARG1 and ARG2 under operation CODE to produce
971 a new constant in RES. Return FALSE if we don't know how to
972 evaluate CODE at compile-time. */
975 wide_int_binop (wide_int
&res
,
976 enum tree_code code
, const wide_int
&arg1
, const wide_int
&arg2
,
977 signop sign
, wi::overflow_type
*overflow
)
980 *overflow
= wi::OVF_NONE
;
984 res
= wi::bit_or (arg1
, arg2
);
988 res
= wi::bit_xor (arg1
, arg2
);
992 res
= wi::bit_and (arg1
, arg2
);
997 if (wi::neg_p (arg2
))
1000 if (code
== RSHIFT_EXPR
)
1008 if (code
== RSHIFT_EXPR
)
1009 /* It's unclear from the C standard whether shifts can overflow.
1010 The following code ignores overflow; perhaps a C standard
1011 interpretation ruling is needed. */
1012 res
= wi::rshift (arg1
, tmp
, sign
);
1014 res
= wi::lshift (arg1
, tmp
);
1019 if (wi::neg_p (arg2
))
1022 if (code
== RROTATE_EXPR
)
1023 code
= LROTATE_EXPR
;
1025 code
= RROTATE_EXPR
;
1030 if (code
== RROTATE_EXPR
)
1031 res
= wi::rrotate (arg1
, tmp
);
1033 res
= wi::lrotate (arg1
, tmp
);
1037 res
= wi::add (arg1
, arg2
, sign
, overflow
);
1041 res
= wi::sub (arg1
, arg2
, sign
, overflow
);
1045 res
= wi::mul (arg1
, arg2
, sign
, overflow
);
1048 case MULT_HIGHPART_EXPR
:
1049 res
= wi::mul_high (arg1
, arg2
, sign
);
1052 case TRUNC_DIV_EXPR
:
1053 case EXACT_DIV_EXPR
:
1056 res
= wi::div_trunc (arg1
, arg2
, sign
, overflow
);
1059 case FLOOR_DIV_EXPR
:
1062 res
= wi::div_floor (arg1
, arg2
, sign
, overflow
);
1068 res
= wi::div_ceil (arg1
, arg2
, sign
, overflow
);
1071 case ROUND_DIV_EXPR
:
1074 res
= wi::div_round (arg1
, arg2
, sign
, overflow
);
1077 case TRUNC_MOD_EXPR
:
1080 res
= wi::mod_trunc (arg1
, arg2
, sign
, overflow
);
1083 case FLOOR_MOD_EXPR
:
1086 res
= wi::mod_floor (arg1
, arg2
, sign
, overflow
);
1092 res
= wi::mod_ceil (arg1
, arg2
, sign
, overflow
);
1095 case ROUND_MOD_EXPR
:
1098 res
= wi::mod_round (arg1
, arg2
, sign
, overflow
);
1102 res
= wi::min (arg1
, arg2
, sign
);
1106 res
= wi::max (arg1
, arg2
, sign
);
1115 /* Combine two poly int's ARG1 and ARG2 under operation CODE to
1116 produce a new constant in RES. Return FALSE if we don't know how
1117 to evaluate CODE at compile-time. */
1120 poly_int_binop (poly_wide_int
&res
, enum tree_code code
,
1121 const_tree arg1
, const_tree arg2
,
1122 signop sign
, wi::overflow_type
*overflow
)
1124 gcc_assert (NUM_POLY_INT_COEFFS
!= 1);
1125 gcc_assert (poly_int_tree_p (arg1
) && poly_int_tree_p (arg2
));
1129 res
= wi::add (wi::to_poly_wide (arg1
),
1130 wi::to_poly_wide (arg2
), sign
, overflow
);
1134 res
= wi::sub (wi::to_poly_wide (arg1
),
1135 wi::to_poly_wide (arg2
), sign
, overflow
);
1139 if (TREE_CODE (arg2
) == INTEGER_CST
)
1140 res
= wi::mul (wi::to_poly_wide (arg1
),
1141 wi::to_wide (arg2
), sign
, overflow
);
1142 else if (TREE_CODE (arg1
) == INTEGER_CST
)
1143 res
= wi::mul (wi::to_poly_wide (arg2
),
1144 wi::to_wide (arg1
), sign
, overflow
);
1150 if (TREE_CODE (arg2
) == INTEGER_CST
)
1151 res
= wi::to_poly_wide (arg1
) << wi::to_wide (arg2
);
1157 if (TREE_CODE (arg2
) != INTEGER_CST
1158 || !can_ior_p (wi::to_poly_wide (arg1
), wi::to_wide (arg2
),
1169 /* Combine two integer constants ARG1 and ARG2 under operation CODE to
1170 produce a new constant. Return NULL_TREE if we don't know how to
1171 evaluate CODE at compile-time. */
1174 int_const_binop (enum tree_code code
, const_tree arg1
, const_tree arg2
,
1177 poly_wide_int poly_res
;
1178 tree type
= TREE_TYPE (arg1
);
1179 signop sign
= TYPE_SIGN (type
);
1180 wi::overflow_type overflow
= wi::OVF_NONE
;
1182 if (TREE_CODE (arg1
) == INTEGER_CST
&& TREE_CODE (arg2
) == INTEGER_CST
)
1184 wide_int warg1
= wi::to_wide (arg1
), res
;
1185 wide_int warg2
= wi::to_wide (arg2
, TYPE_PRECISION (type
));
1186 if (!wide_int_binop (res
, code
, warg1
, warg2
, sign
, &overflow
))
1190 else if (!poly_int_tree_p (arg1
)
1191 || !poly_int_tree_p (arg2
)
1192 || !poly_int_binop (poly_res
, code
, arg1
, arg2
, sign
, &overflow
))
1194 return force_fit_type (type
, poly_res
, overflowable
,
1195 (((sign
== SIGNED
|| overflowable
== -1)
1197 | TREE_OVERFLOW (arg1
) | TREE_OVERFLOW (arg2
)));
1200 /* Return true if binary operation OP distributes over addition in operand
1201 OPNO, with the other operand being held constant. OPNO counts from 1. */
1204 distributes_over_addition_p (tree_code op
, int opno
)
1221 /* Combine two constants ARG1 and ARG2 under operation CODE to produce a new
1222 constant. We assume ARG1 and ARG2 have the same data type, or at least
1223 are the same kind of constant and the same machine mode. Return zero if
1224 combining the constants is not allowed in the current operating mode. */
1227 const_binop (enum tree_code code
, tree arg1
, tree arg2
)
1229 /* Sanity check for the recursive cases. */
1236 if (poly_int_tree_p (arg1
) && poly_int_tree_p (arg2
))
1238 if (code
== POINTER_PLUS_EXPR
)
1239 return int_const_binop (PLUS_EXPR
,
1240 arg1
, fold_convert (TREE_TYPE (arg1
), arg2
));
1242 return int_const_binop (code
, arg1
, arg2
);
1245 if (TREE_CODE (arg1
) == REAL_CST
&& TREE_CODE (arg2
) == REAL_CST
)
1250 REAL_VALUE_TYPE value
;
1251 REAL_VALUE_TYPE result
;
1255 /* The following codes are handled by real_arithmetic. */
1270 d1
= TREE_REAL_CST (arg1
);
1271 d2
= TREE_REAL_CST (arg2
);
1273 type
= TREE_TYPE (arg1
);
1274 mode
= TYPE_MODE (type
);
1276 /* Don't perform operation if we honor signaling NaNs and
1277 either operand is a signaling NaN. */
1278 if (HONOR_SNANS (mode
)
1279 && (REAL_VALUE_ISSIGNALING_NAN (d1
)
1280 || REAL_VALUE_ISSIGNALING_NAN (d2
)))
1283 /* Don't perform operation if it would raise a division
1284 by zero exception. */
1285 if (code
== RDIV_EXPR
1286 && real_equal (&d2
, &dconst0
)
1287 && (flag_trapping_math
|| ! MODE_HAS_INFINITIES (mode
)))
1290 /* If either operand is a NaN, just return it. Otherwise, set up
1291 for floating-point trap; we return an overflow. */
1292 if (REAL_VALUE_ISNAN (d1
))
1294 /* Make resulting NaN value to be qNaN when flag_signaling_nans
1297 t
= build_real (type
, d1
);
1300 else if (REAL_VALUE_ISNAN (d2
))
1302 /* Make resulting NaN value to be qNaN when flag_signaling_nans
1305 t
= build_real (type
, d2
);
1309 inexact
= real_arithmetic (&value
, code
, &d1
, &d2
);
1310 real_convert (&result
, mode
, &value
);
1312 /* Don't constant fold this floating point operation if
1313 the result has overflowed and flag_trapping_math. */
1314 if (flag_trapping_math
1315 && MODE_HAS_INFINITIES (mode
)
1316 && REAL_VALUE_ISINF (result
)
1317 && !REAL_VALUE_ISINF (d1
)
1318 && !REAL_VALUE_ISINF (d2
))
1321 /* Don't constant fold this floating point operation if the
1322 result may dependent upon the run-time rounding mode and
1323 flag_rounding_math is set, or if GCC's software emulation
1324 is unable to accurately represent the result. */
1325 if ((flag_rounding_math
1326 || (MODE_COMPOSITE_P (mode
) && !flag_unsafe_math_optimizations
))
1327 && (inexact
|| !real_identical (&result
, &value
)))
1330 t
= build_real (type
, result
);
1332 TREE_OVERFLOW (t
) = TREE_OVERFLOW (arg1
) | TREE_OVERFLOW (arg2
);
1336 if (TREE_CODE (arg1
) == FIXED_CST
)
1338 FIXED_VALUE_TYPE f1
;
1339 FIXED_VALUE_TYPE f2
;
1340 FIXED_VALUE_TYPE result
;
1345 /* The following codes are handled by fixed_arithmetic. */
1351 case TRUNC_DIV_EXPR
:
1352 if (TREE_CODE (arg2
) != FIXED_CST
)
1354 f2
= TREE_FIXED_CST (arg2
);
1360 if (TREE_CODE (arg2
) != INTEGER_CST
)
1362 wi::tree_to_wide_ref w2
= wi::to_wide (arg2
);
1363 f2
.data
.high
= w2
.elt (1);
1364 f2
.data
.low
= w2
.ulow ();
1373 f1
= TREE_FIXED_CST (arg1
);
1374 type
= TREE_TYPE (arg1
);
1375 sat_p
= TYPE_SATURATING (type
);
1376 overflow_p
= fixed_arithmetic (&result
, code
, &f1
, &f2
, sat_p
);
1377 t
= build_fixed (type
, result
);
1378 /* Propagate overflow flags. */
1379 if (overflow_p
| TREE_OVERFLOW (arg1
) | TREE_OVERFLOW (arg2
))
1380 TREE_OVERFLOW (t
) = 1;
1384 if (TREE_CODE (arg1
) == COMPLEX_CST
&& TREE_CODE (arg2
) == COMPLEX_CST
)
1386 tree type
= TREE_TYPE (arg1
);
1387 tree r1
= TREE_REALPART (arg1
);
1388 tree i1
= TREE_IMAGPART (arg1
);
1389 tree r2
= TREE_REALPART (arg2
);
1390 tree i2
= TREE_IMAGPART (arg2
);
1397 real
= const_binop (code
, r1
, r2
);
1398 imag
= const_binop (code
, i1
, i2
);
1402 if (COMPLEX_FLOAT_TYPE_P (type
))
1403 return do_mpc_arg2 (arg1
, arg2
, type
,
1404 /* do_nonfinite= */ folding_initializer
,
1407 real
= const_binop (MINUS_EXPR
,
1408 const_binop (MULT_EXPR
, r1
, r2
),
1409 const_binop (MULT_EXPR
, i1
, i2
));
1410 imag
= const_binop (PLUS_EXPR
,
1411 const_binop (MULT_EXPR
, r1
, i2
),
1412 const_binop (MULT_EXPR
, i1
, r2
));
1416 if (COMPLEX_FLOAT_TYPE_P (type
))
1417 return do_mpc_arg2 (arg1
, arg2
, type
,
1418 /* do_nonfinite= */ folding_initializer
,
1421 case TRUNC_DIV_EXPR
:
1423 case FLOOR_DIV_EXPR
:
1424 case ROUND_DIV_EXPR
:
1425 if (flag_complex_method
== 0)
1427 /* Keep this algorithm in sync with
1428 tree-complex.c:expand_complex_div_straight().
1430 Expand complex division to scalars, straightforward algorithm.
1431 a / b = ((ar*br + ai*bi)/t) + i((ai*br - ar*bi)/t)
1435 = const_binop (PLUS_EXPR
,
1436 const_binop (MULT_EXPR
, r2
, r2
),
1437 const_binop (MULT_EXPR
, i2
, i2
));
1439 = const_binop (PLUS_EXPR
,
1440 const_binop (MULT_EXPR
, r1
, r2
),
1441 const_binop (MULT_EXPR
, i1
, i2
));
1443 = const_binop (MINUS_EXPR
,
1444 const_binop (MULT_EXPR
, i1
, r2
),
1445 const_binop (MULT_EXPR
, r1
, i2
));
1447 real
= const_binop (code
, t1
, magsquared
);
1448 imag
= const_binop (code
, t2
, magsquared
);
1452 /* Keep this algorithm in sync with
1453 tree-complex.c:expand_complex_div_wide().
1455 Expand complex division to scalars, modified algorithm to minimize
1456 overflow with wide input ranges. */
1457 tree compare
= fold_build2 (LT_EXPR
, boolean_type_node
,
1458 fold_abs_const (r2
, TREE_TYPE (type
)),
1459 fold_abs_const (i2
, TREE_TYPE (type
)));
1461 if (integer_nonzerop (compare
))
1463 /* In the TRUE branch, we compute
1465 div = (br * ratio) + bi;
1466 tr = (ar * ratio) + ai;
1467 ti = (ai * ratio) - ar;
1470 tree ratio
= const_binop (code
, r2
, i2
);
1471 tree div
= const_binop (PLUS_EXPR
, i2
,
1472 const_binop (MULT_EXPR
, r2
, ratio
));
1473 real
= const_binop (MULT_EXPR
, r1
, ratio
);
1474 real
= const_binop (PLUS_EXPR
, real
, i1
);
1475 real
= const_binop (code
, real
, div
);
1477 imag
= const_binop (MULT_EXPR
, i1
, ratio
);
1478 imag
= const_binop (MINUS_EXPR
, imag
, r1
);
1479 imag
= const_binop (code
, imag
, div
);
1483 /* In the FALSE branch, we compute
1485 divisor = (d * ratio) + c;
1486 tr = (b * ratio) + a;
1487 ti = b - (a * ratio);
1490 tree ratio
= const_binop (code
, i2
, r2
);
1491 tree div
= const_binop (PLUS_EXPR
, r2
,
1492 const_binop (MULT_EXPR
, i2
, ratio
));
1494 real
= const_binop (MULT_EXPR
, i1
, ratio
);
1495 real
= const_binop (PLUS_EXPR
, real
, r1
);
1496 real
= const_binop (code
, real
, div
);
1498 imag
= const_binop (MULT_EXPR
, r1
, ratio
);
1499 imag
= const_binop (MINUS_EXPR
, i1
, imag
);
1500 imag
= const_binop (code
, imag
, div
);
1510 return build_complex (type
, real
, imag
);
1513 if (TREE_CODE (arg1
) == VECTOR_CST
1514 && TREE_CODE (arg2
) == VECTOR_CST
1515 && known_eq (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg1
)),
1516 TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg2
))))
1518 tree type
= TREE_TYPE (arg1
);
1520 if (VECTOR_CST_STEPPED_P (arg1
)
1521 && VECTOR_CST_STEPPED_P (arg2
))
1522 /* We can operate directly on the encoding if:
1524 a3 - a2 == a2 - a1 && b3 - b2 == b2 - b1
1526 (a3 op b3) - (a2 op b2) == (a2 op b2) - (a1 op b1)
1528 Addition and subtraction are the supported operators
1529 for which this is true. */
1530 step_ok_p
= (code
== PLUS_EXPR
|| code
== MINUS_EXPR
);
1531 else if (VECTOR_CST_STEPPED_P (arg1
))
1532 /* We can operate directly on stepped encodings if:
1536 (a3 op c) - (a2 op c) == (a2 op c) - (a1 op c)
1538 which is true if (x -> x op c) distributes over addition. */
1539 step_ok_p
= distributes_over_addition_p (code
, 1);
1541 /* Similarly in reverse. */
1542 step_ok_p
= distributes_over_addition_p (code
, 2);
1543 tree_vector_builder elts
;
1544 if (!elts
.new_binary_operation (type
, arg1
, arg2
, step_ok_p
))
1546 unsigned int count
= elts
.encoded_nelts ();
1547 for (unsigned int i
= 0; i
< count
; ++i
)
1549 tree elem1
= VECTOR_CST_ELT (arg1
, i
);
1550 tree elem2
= VECTOR_CST_ELT (arg2
, i
);
1552 tree elt
= const_binop (code
, elem1
, elem2
);
1554 /* It is possible that const_binop cannot handle the given
1555 code and return NULL_TREE */
1556 if (elt
== NULL_TREE
)
1558 elts
.quick_push (elt
);
1561 return elts
.build ();
1564 /* Shifts allow a scalar offset for a vector. */
1565 if (TREE_CODE (arg1
) == VECTOR_CST
1566 && TREE_CODE (arg2
) == INTEGER_CST
)
1568 tree type
= TREE_TYPE (arg1
);
1569 bool step_ok_p
= distributes_over_addition_p (code
, 1);
1570 tree_vector_builder elts
;
1571 if (!elts
.new_unary_operation (type
, arg1
, step_ok_p
))
1573 unsigned int count
= elts
.encoded_nelts ();
1574 for (unsigned int i
= 0; i
< count
; ++i
)
1576 tree elem1
= VECTOR_CST_ELT (arg1
, i
);
1578 tree elt
= const_binop (code
, elem1
, arg2
);
1580 /* It is possible that const_binop cannot handle the given
1581 code and return NULL_TREE. */
1582 if (elt
== NULL_TREE
)
1584 elts
.quick_push (elt
);
1587 return elts
.build ();
1592 /* Overload that adds a TYPE parameter to be able to dispatch
1593 to fold_relational_const. */
1596 const_binop (enum tree_code code
, tree type
, tree arg1
, tree arg2
)
1598 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
1599 return fold_relational_const (code
, type
, arg1
, arg2
);
1601 /* ??? Until we make the const_binop worker take the type of the
1602 result as argument put those cases that need it here. */
1605 case VEC_SERIES_EXPR
:
1606 if (CONSTANT_CLASS_P (arg1
)
1607 && CONSTANT_CLASS_P (arg2
))
1608 return build_vec_series (type
, arg1
, arg2
);
1612 if ((TREE_CODE (arg1
) == REAL_CST
1613 && TREE_CODE (arg2
) == REAL_CST
)
1614 || (TREE_CODE (arg1
) == INTEGER_CST
1615 && TREE_CODE (arg2
) == INTEGER_CST
))
1616 return build_complex (type
, arg1
, arg2
);
1619 case POINTER_DIFF_EXPR
:
1620 if (poly_int_tree_p (arg1
) && poly_int_tree_p (arg2
))
1622 poly_offset_int res
= (wi::to_poly_offset (arg1
)
1623 - wi::to_poly_offset (arg2
));
1624 return force_fit_type (type
, res
, 1,
1625 TREE_OVERFLOW (arg1
) | TREE_OVERFLOW (arg2
));
1629 case VEC_PACK_TRUNC_EXPR
:
1630 case VEC_PACK_FIX_TRUNC_EXPR
:
1631 case VEC_PACK_FLOAT_EXPR
:
1633 unsigned int HOST_WIDE_INT out_nelts
, in_nelts
, i
;
1635 if (TREE_CODE (arg1
) != VECTOR_CST
1636 || TREE_CODE (arg2
) != VECTOR_CST
)
1639 if (!VECTOR_CST_NELTS (arg1
).is_constant (&in_nelts
))
1642 out_nelts
= in_nelts
* 2;
1643 gcc_assert (known_eq (in_nelts
, VECTOR_CST_NELTS (arg2
))
1644 && known_eq (out_nelts
, TYPE_VECTOR_SUBPARTS (type
)));
1646 tree_vector_builder
elts (type
, out_nelts
, 1);
1647 for (i
= 0; i
< out_nelts
; i
++)
1649 tree elt
= (i
< in_nelts
1650 ? VECTOR_CST_ELT (arg1
, i
)
1651 : VECTOR_CST_ELT (arg2
, i
- in_nelts
));
1652 elt
= fold_convert_const (code
== VEC_PACK_TRUNC_EXPR
1654 : code
== VEC_PACK_FLOAT_EXPR
1655 ? FLOAT_EXPR
: FIX_TRUNC_EXPR
,
1656 TREE_TYPE (type
), elt
);
1657 if (elt
== NULL_TREE
|| !CONSTANT_CLASS_P (elt
))
1659 elts
.quick_push (elt
);
1662 return elts
.build ();
1665 case VEC_WIDEN_MULT_LO_EXPR
:
1666 case VEC_WIDEN_MULT_HI_EXPR
:
1667 case VEC_WIDEN_MULT_EVEN_EXPR
:
1668 case VEC_WIDEN_MULT_ODD_EXPR
:
1670 unsigned HOST_WIDE_INT out_nelts
, in_nelts
, out
, ofs
, scale
;
1672 if (TREE_CODE (arg1
) != VECTOR_CST
|| TREE_CODE (arg2
) != VECTOR_CST
)
1675 if (!VECTOR_CST_NELTS (arg1
).is_constant (&in_nelts
))
1677 out_nelts
= in_nelts
/ 2;
1678 gcc_assert (known_eq (in_nelts
, VECTOR_CST_NELTS (arg2
))
1679 && known_eq (out_nelts
, TYPE_VECTOR_SUBPARTS (type
)));
1681 if (code
== VEC_WIDEN_MULT_LO_EXPR
)
1682 scale
= 0, ofs
= BYTES_BIG_ENDIAN
? out_nelts
: 0;
1683 else if (code
== VEC_WIDEN_MULT_HI_EXPR
)
1684 scale
= 0, ofs
= BYTES_BIG_ENDIAN
? 0 : out_nelts
;
1685 else if (code
== VEC_WIDEN_MULT_EVEN_EXPR
)
1687 else /* if (code == VEC_WIDEN_MULT_ODD_EXPR) */
1690 tree_vector_builder
elts (type
, out_nelts
, 1);
1691 for (out
= 0; out
< out_nelts
; out
++)
1693 unsigned int in
= (out
<< scale
) + ofs
;
1694 tree t1
= fold_convert_const (NOP_EXPR
, TREE_TYPE (type
),
1695 VECTOR_CST_ELT (arg1
, in
));
1696 tree t2
= fold_convert_const (NOP_EXPR
, TREE_TYPE (type
),
1697 VECTOR_CST_ELT (arg2
, in
));
1699 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
1701 tree elt
= const_binop (MULT_EXPR
, t1
, t2
);
1702 if (elt
== NULL_TREE
|| !CONSTANT_CLASS_P (elt
))
1704 elts
.quick_push (elt
);
1707 return elts
.build ();
1713 if (TREE_CODE_CLASS (code
) != tcc_binary
)
1716 /* Make sure type and arg0 have the same saturating flag. */
1717 gcc_checking_assert (TYPE_SATURATING (type
)
1718 == TYPE_SATURATING (TREE_TYPE (arg1
)));
1720 return const_binop (code
, arg1
, arg2
);
1723 /* Compute CODE ARG1 with resulting type TYPE with ARG1 being constant.
1724 Return zero if computing the constants is not possible. */
1727 const_unop (enum tree_code code
, tree type
, tree arg0
)
1729 /* Don't perform the operation, other than NEGATE and ABS, if
1730 flag_signaling_nans is on and the operand is a signaling NaN. */
1731 if (TREE_CODE (arg0
) == REAL_CST
1732 && HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg0
)))
1733 && REAL_VALUE_ISSIGNALING_NAN (TREE_REAL_CST (arg0
))
1734 && code
!= NEGATE_EXPR
1736 && code
!= ABSU_EXPR
)
1743 case FIX_TRUNC_EXPR
:
1744 case FIXED_CONVERT_EXPR
:
1745 return fold_convert_const (code
, type
, arg0
);
1747 case ADDR_SPACE_CONVERT_EXPR
:
1748 /* If the source address is 0, and the source address space
1749 cannot have a valid object at 0, fold to dest type null. */
1750 if (integer_zerop (arg0
)
1751 && !(targetm
.addr_space
.zero_address_valid
1752 (TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (arg0
))))))
1753 return fold_convert_const (code
, type
, arg0
);
1756 case VIEW_CONVERT_EXPR
:
1757 return fold_view_convert_expr (type
, arg0
);
1761 /* Can't call fold_negate_const directly here as that doesn't
1762 handle all cases and we might not be able to negate some
1764 tree tem
= fold_negate_expr (UNKNOWN_LOCATION
, arg0
);
1765 if (tem
&& CONSTANT_CLASS_P (tem
))
1772 if (TREE_CODE (arg0
) == INTEGER_CST
|| TREE_CODE (arg0
) == REAL_CST
)
1773 return fold_abs_const (arg0
, type
);
1777 if (TREE_CODE (arg0
) == COMPLEX_CST
)
1779 tree ipart
= fold_negate_const (TREE_IMAGPART (arg0
),
1781 return build_complex (type
, TREE_REALPART (arg0
), ipart
);
1786 if (TREE_CODE (arg0
) == INTEGER_CST
)
1787 return fold_not_const (arg0
, type
);
1788 else if (POLY_INT_CST_P (arg0
))
1789 return wide_int_to_tree (type
, -poly_int_cst_value (arg0
));
1790 /* Perform BIT_NOT_EXPR on each element individually. */
1791 else if (TREE_CODE (arg0
) == VECTOR_CST
)
1795 /* This can cope with stepped encodings because ~x == -1 - x. */
1796 tree_vector_builder elements
;
1797 elements
.new_unary_operation (type
, arg0
, true);
1798 unsigned int i
, count
= elements
.encoded_nelts ();
1799 for (i
= 0; i
< count
; ++i
)
1801 elem
= VECTOR_CST_ELT (arg0
, i
);
1802 elem
= const_unop (BIT_NOT_EXPR
, TREE_TYPE (type
), elem
);
1803 if (elem
== NULL_TREE
)
1805 elements
.quick_push (elem
);
1808 return elements
.build ();
1812 case TRUTH_NOT_EXPR
:
1813 if (TREE_CODE (arg0
) == INTEGER_CST
)
1814 return constant_boolean_node (integer_zerop (arg0
), type
);
1818 if (TREE_CODE (arg0
) == COMPLEX_CST
)
1819 return fold_convert (type
, TREE_REALPART (arg0
));
1823 if (TREE_CODE (arg0
) == COMPLEX_CST
)
1824 return fold_convert (type
, TREE_IMAGPART (arg0
));
1827 case VEC_UNPACK_LO_EXPR
:
1828 case VEC_UNPACK_HI_EXPR
:
1829 case VEC_UNPACK_FLOAT_LO_EXPR
:
1830 case VEC_UNPACK_FLOAT_HI_EXPR
:
1831 case VEC_UNPACK_FIX_TRUNC_LO_EXPR
:
1832 case VEC_UNPACK_FIX_TRUNC_HI_EXPR
:
1834 unsigned HOST_WIDE_INT out_nelts
, in_nelts
, i
;
1835 enum tree_code subcode
;
1837 if (TREE_CODE (arg0
) != VECTOR_CST
)
1840 if (!VECTOR_CST_NELTS (arg0
).is_constant (&in_nelts
))
1842 out_nelts
= in_nelts
/ 2;
1843 gcc_assert (known_eq (out_nelts
, TYPE_VECTOR_SUBPARTS (type
)));
1845 unsigned int offset
= 0;
1846 if ((!BYTES_BIG_ENDIAN
) ^ (code
== VEC_UNPACK_LO_EXPR
1847 || code
== VEC_UNPACK_FLOAT_LO_EXPR
1848 || code
== VEC_UNPACK_FIX_TRUNC_LO_EXPR
))
1851 if (code
== VEC_UNPACK_LO_EXPR
|| code
== VEC_UNPACK_HI_EXPR
)
1853 else if (code
== VEC_UNPACK_FLOAT_LO_EXPR
1854 || code
== VEC_UNPACK_FLOAT_HI_EXPR
)
1855 subcode
= FLOAT_EXPR
;
1857 subcode
= FIX_TRUNC_EXPR
;
1859 tree_vector_builder
elts (type
, out_nelts
, 1);
1860 for (i
= 0; i
< out_nelts
; i
++)
1862 tree elt
= fold_convert_const (subcode
, TREE_TYPE (type
),
1863 VECTOR_CST_ELT (arg0
, i
+ offset
));
1864 if (elt
== NULL_TREE
|| !CONSTANT_CLASS_P (elt
))
1866 elts
.quick_push (elt
);
1869 return elts
.build ();
1872 case VEC_DUPLICATE_EXPR
:
1873 if (CONSTANT_CLASS_P (arg0
))
1874 return build_vector_from_val (type
, arg0
);
1884 /* Create a sizetype INT_CST node with NUMBER sign extended. KIND
1885 indicates which particular sizetype to create. */
1888 size_int_kind (poly_int64 number
, enum size_type_kind kind
)
1890 return build_int_cst (sizetype_tab
[(int) kind
], number
);
1893 /* Combine operands OP1 and OP2 with arithmetic operation CODE. CODE
1894 is a tree code. The type of the result is taken from the operands.
1895 Both must be equivalent integer types, ala int_binop_types_match_p.
1896 If the operands are constant, so is the result. */
1899 size_binop_loc (location_t loc
, enum tree_code code
, tree arg0
, tree arg1
)
1901 tree type
= TREE_TYPE (arg0
);
1903 if (arg0
== error_mark_node
|| arg1
== error_mark_node
)
1904 return error_mark_node
;
1906 gcc_assert (int_binop_types_match_p (code
, TREE_TYPE (arg0
),
1909 /* Handle the special case of two poly_int constants faster. */
1910 if (poly_int_tree_p (arg0
) && poly_int_tree_p (arg1
))
1912 /* And some specific cases even faster than that. */
1913 if (code
== PLUS_EXPR
)
1915 if (integer_zerop (arg0
)
1916 && !TREE_OVERFLOW (tree_strip_any_location_wrapper (arg0
)))
1918 if (integer_zerop (arg1
)
1919 && !TREE_OVERFLOW (tree_strip_any_location_wrapper (arg1
)))
1922 else if (code
== MINUS_EXPR
)
1924 if (integer_zerop (arg1
)
1925 && !TREE_OVERFLOW (tree_strip_any_location_wrapper (arg1
)))
1928 else if (code
== MULT_EXPR
)
1930 if (integer_onep (arg0
)
1931 && !TREE_OVERFLOW (tree_strip_any_location_wrapper (arg0
)))
1935 /* Handle general case of two integer constants. For sizetype
1936 constant calculations we always want to know about overflow,
1937 even in the unsigned case. */
1938 tree res
= int_const_binop (code
, arg0
, arg1
, -1);
1939 if (res
!= NULL_TREE
)
1943 return fold_build2_loc (loc
, code
, type
, arg0
, arg1
);
1946 /* Given two values, either both of sizetype or both of bitsizetype,
1947 compute the difference between the two values. Return the value
1948 in signed type corresponding to the type of the operands. */
1951 size_diffop_loc (location_t loc
, tree arg0
, tree arg1
)
1953 tree type
= TREE_TYPE (arg0
);
1956 gcc_assert (int_binop_types_match_p (MINUS_EXPR
, TREE_TYPE (arg0
),
1959 /* If the type is already signed, just do the simple thing. */
1960 if (!TYPE_UNSIGNED (type
))
1961 return size_binop_loc (loc
, MINUS_EXPR
, arg0
, arg1
);
1963 if (type
== sizetype
)
1965 else if (type
== bitsizetype
)
1966 ctype
= sbitsizetype
;
1968 ctype
= signed_type_for (type
);
1970 /* If either operand is not a constant, do the conversions to the signed
1971 type and subtract. The hardware will do the right thing with any
1972 overflow in the subtraction. */
1973 if (TREE_CODE (arg0
) != INTEGER_CST
|| TREE_CODE (arg1
) != INTEGER_CST
)
1974 return size_binop_loc (loc
, MINUS_EXPR
,
1975 fold_convert_loc (loc
, ctype
, arg0
),
1976 fold_convert_loc (loc
, ctype
, arg1
));
1978 /* If ARG0 is larger than ARG1, subtract and return the result in CTYPE.
1979 Otherwise, subtract the other way, convert to CTYPE (we know that can't
1980 overflow) and negate (which can't either). Special-case a result
1981 of zero while we're here. */
1982 if (tree_int_cst_equal (arg0
, arg1
))
1983 return build_int_cst (ctype
, 0);
1984 else if (tree_int_cst_lt (arg1
, arg0
))
1985 return fold_convert_loc (loc
, ctype
,
1986 size_binop_loc (loc
, MINUS_EXPR
, arg0
, arg1
));
1988 return size_binop_loc (loc
, MINUS_EXPR
, build_int_cst (ctype
, 0),
1989 fold_convert_loc (loc
, ctype
,
1990 size_binop_loc (loc
,
1995 /* A subroutine of fold_convert_const handling conversions of an
1996 INTEGER_CST to another integer type. */
1999 fold_convert_const_int_from_int (tree type
, const_tree arg1
)
2001 /* Given an integer constant, make new constant with new type,
2002 appropriately sign-extended or truncated. Use widest_int
2003 so that any extension is done according ARG1's type. */
2004 return force_fit_type (type
, wi::to_widest (arg1
),
2005 !POINTER_TYPE_P (TREE_TYPE (arg1
)),
2006 TREE_OVERFLOW (arg1
));
2009 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2010 to an integer type. */
2013 fold_convert_const_int_from_real (enum tree_code code
, tree type
, const_tree arg1
)
2015 bool overflow
= false;
2018 /* The following code implements the floating point to integer
2019 conversion rules required by the Java Language Specification,
2020 that IEEE NaNs are mapped to zero and values that overflow
2021 the target precision saturate, i.e. values greater than
2022 INT_MAX are mapped to INT_MAX, and values less than INT_MIN
2023 are mapped to INT_MIN. These semantics are allowed by the
2024 C and C++ standards that simply state that the behavior of
2025 FP-to-integer conversion is unspecified upon overflow. */
2029 REAL_VALUE_TYPE x
= TREE_REAL_CST (arg1
);
2033 case FIX_TRUNC_EXPR
:
2034 real_trunc (&r
, VOIDmode
, &x
);
2041 /* If R is NaN, return zero and show we have an overflow. */
2042 if (REAL_VALUE_ISNAN (r
))
2045 val
= wi::zero (TYPE_PRECISION (type
));
2048 /* See if R is less than the lower bound or greater than the
2053 tree lt
= TYPE_MIN_VALUE (type
);
2054 REAL_VALUE_TYPE l
= real_value_from_int_cst (NULL_TREE
, lt
);
2055 if (real_less (&r
, &l
))
2058 val
= wi::to_wide (lt
);
2064 tree ut
= TYPE_MAX_VALUE (type
);
2067 REAL_VALUE_TYPE u
= real_value_from_int_cst (NULL_TREE
, ut
);
2068 if (real_less (&u
, &r
))
2071 val
= wi::to_wide (ut
);
2077 val
= real_to_integer (&r
, &overflow
, TYPE_PRECISION (type
));
2079 t
= force_fit_type (type
, val
, -1, overflow
| TREE_OVERFLOW (arg1
));
2083 /* A subroutine of fold_convert_const handling conversions of a
2084 FIXED_CST to an integer type. */
2087 fold_convert_const_int_from_fixed (tree type
, const_tree arg1
)
2090 double_int temp
, temp_trunc
;
2093 /* Right shift FIXED_CST to temp by fbit. */
2094 temp
= TREE_FIXED_CST (arg1
).data
;
2095 mode
= TREE_FIXED_CST (arg1
).mode
;
2096 if (GET_MODE_FBIT (mode
) < HOST_BITS_PER_DOUBLE_INT
)
2098 temp
= temp
.rshift (GET_MODE_FBIT (mode
),
2099 HOST_BITS_PER_DOUBLE_INT
,
2100 SIGNED_FIXED_POINT_MODE_P (mode
));
2102 /* Left shift temp to temp_trunc by fbit. */
2103 temp_trunc
= temp
.lshift (GET_MODE_FBIT (mode
),
2104 HOST_BITS_PER_DOUBLE_INT
,
2105 SIGNED_FIXED_POINT_MODE_P (mode
));
2109 temp
= double_int_zero
;
2110 temp_trunc
= double_int_zero
;
2113 /* If FIXED_CST is negative, we need to round the value toward 0.
2114 By checking if the fractional bits are not zero to add 1 to temp. */
2115 if (SIGNED_FIXED_POINT_MODE_P (mode
)
2116 && temp_trunc
.is_negative ()
2117 && TREE_FIXED_CST (arg1
).data
!= temp_trunc
)
2118 temp
+= double_int_one
;
2120 /* Given a fixed-point constant, make new constant with new type,
2121 appropriately sign-extended or truncated. */
2122 t
= force_fit_type (type
, temp
, -1,
2123 (temp
.is_negative ()
2124 && (TYPE_UNSIGNED (type
)
2125 < TYPE_UNSIGNED (TREE_TYPE (arg1
))))
2126 | TREE_OVERFLOW (arg1
));
2131 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2132 to another floating point type. */
2135 fold_convert_const_real_from_real (tree type
, const_tree arg1
)
2137 REAL_VALUE_TYPE value
;
2140 /* Don't perform the operation if flag_signaling_nans is on
2141 and the operand is a signaling NaN. */
2142 if (HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg1
)))
2143 && REAL_VALUE_ISSIGNALING_NAN (TREE_REAL_CST (arg1
)))
2146 real_convert (&value
, TYPE_MODE (type
), &TREE_REAL_CST (arg1
));
2147 t
= build_real (type
, value
);
2149 /* If converting an infinity or NAN to a representation that doesn't
2150 have one, set the overflow bit so that we can produce some kind of
2151 error message at the appropriate point if necessary. It's not the
2152 most user-friendly message, but it's better than nothing. */
2153 if (REAL_VALUE_ISINF (TREE_REAL_CST (arg1
))
2154 && !MODE_HAS_INFINITIES (TYPE_MODE (type
)))
2155 TREE_OVERFLOW (t
) = 1;
2156 else if (REAL_VALUE_ISNAN (TREE_REAL_CST (arg1
))
2157 && !MODE_HAS_NANS (TYPE_MODE (type
)))
2158 TREE_OVERFLOW (t
) = 1;
2159 /* Regular overflow, conversion produced an infinity in a mode that
2160 can't represent them. */
2161 else if (!MODE_HAS_INFINITIES (TYPE_MODE (type
))
2162 && REAL_VALUE_ISINF (value
)
2163 && !REAL_VALUE_ISINF (TREE_REAL_CST (arg1
)))
2164 TREE_OVERFLOW (t
) = 1;
2166 TREE_OVERFLOW (t
) = TREE_OVERFLOW (arg1
);
2170 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2171 to a floating point type. */
2174 fold_convert_const_real_from_fixed (tree type
, const_tree arg1
)
2176 REAL_VALUE_TYPE value
;
2179 real_convert_from_fixed (&value
, SCALAR_FLOAT_TYPE_MODE (type
),
2180 &TREE_FIXED_CST (arg1
));
2181 t
= build_real (type
, value
);
2183 TREE_OVERFLOW (t
) = TREE_OVERFLOW (arg1
);
2187 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2188 to another fixed-point type. */
2191 fold_convert_const_fixed_from_fixed (tree type
, const_tree arg1
)
2193 FIXED_VALUE_TYPE value
;
2197 overflow_p
= fixed_convert (&value
, SCALAR_TYPE_MODE (type
),
2198 &TREE_FIXED_CST (arg1
), TYPE_SATURATING (type
));
2199 t
= build_fixed (type
, value
);
2201 /* Propagate overflow flags. */
2202 if (overflow_p
| TREE_OVERFLOW (arg1
))
2203 TREE_OVERFLOW (t
) = 1;
2207 /* A subroutine of fold_convert_const handling conversions an INTEGER_CST
2208 to a fixed-point type. */
2211 fold_convert_const_fixed_from_int (tree type
, const_tree arg1
)
2213 FIXED_VALUE_TYPE value
;
2218 gcc_assert (TREE_INT_CST_NUNITS (arg1
) <= 2);
2220 di
.low
= TREE_INT_CST_ELT (arg1
, 0);
2221 if (TREE_INT_CST_NUNITS (arg1
) == 1)
2222 di
.high
= (HOST_WIDE_INT
) di
.low
< 0 ? HOST_WIDE_INT_M1
: 0;
2224 di
.high
= TREE_INT_CST_ELT (arg1
, 1);
2226 overflow_p
= fixed_convert_from_int (&value
, SCALAR_TYPE_MODE (type
), di
,
2227 TYPE_UNSIGNED (TREE_TYPE (arg1
)),
2228 TYPE_SATURATING (type
));
2229 t
= build_fixed (type
, value
);
2231 /* Propagate overflow flags. */
2232 if (overflow_p
| TREE_OVERFLOW (arg1
))
2233 TREE_OVERFLOW (t
) = 1;
2237 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2238 to a fixed-point type. */
2241 fold_convert_const_fixed_from_real (tree type
, const_tree arg1
)
2243 FIXED_VALUE_TYPE value
;
2247 overflow_p
= fixed_convert_from_real (&value
, SCALAR_TYPE_MODE (type
),
2248 &TREE_REAL_CST (arg1
),
2249 TYPE_SATURATING (type
));
2250 t
= build_fixed (type
, value
);
2252 /* Propagate overflow flags. */
2253 if (overflow_p
| TREE_OVERFLOW (arg1
))
2254 TREE_OVERFLOW (t
) = 1;
2258 /* Attempt to fold type conversion operation CODE of expression ARG1 to
2259 type TYPE. If no simplification can be done return NULL_TREE. */
2262 fold_convert_const (enum tree_code code
, tree type
, tree arg1
)
2264 tree arg_type
= TREE_TYPE (arg1
);
2265 if (arg_type
== type
)
2268 /* We can't widen types, since the runtime value could overflow the
2269 original type before being extended to the new type. */
2270 if (POLY_INT_CST_P (arg1
)
2271 && (POINTER_TYPE_P (type
) || INTEGRAL_TYPE_P (type
))
2272 && TYPE_PRECISION (type
) <= TYPE_PRECISION (arg_type
))
2273 return build_poly_int_cst (type
,
2274 poly_wide_int::from (poly_int_cst_value (arg1
),
2275 TYPE_PRECISION (type
),
2276 TYPE_SIGN (arg_type
)));
2278 if (POINTER_TYPE_P (type
) || INTEGRAL_TYPE_P (type
)
2279 || TREE_CODE (type
) == OFFSET_TYPE
)
2281 if (TREE_CODE (arg1
) == INTEGER_CST
)
2282 return fold_convert_const_int_from_int (type
, arg1
);
2283 else if (TREE_CODE (arg1
) == REAL_CST
)
2284 return fold_convert_const_int_from_real (code
, type
, arg1
);
2285 else if (TREE_CODE (arg1
) == FIXED_CST
)
2286 return fold_convert_const_int_from_fixed (type
, arg1
);
2288 else if (TREE_CODE (type
) == REAL_TYPE
)
2290 if (TREE_CODE (arg1
) == INTEGER_CST
)
2291 return build_real_from_int_cst (type
, arg1
);
2292 else if (TREE_CODE (arg1
) == REAL_CST
)
2293 return fold_convert_const_real_from_real (type
, arg1
);
2294 else if (TREE_CODE (arg1
) == FIXED_CST
)
2295 return fold_convert_const_real_from_fixed (type
, arg1
);
2297 else if (TREE_CODE (type
) == FIXED_POINT_TYPE
)
2299 if (TREE_CODE (arg1
) == FIXED_CST
)
2300 return fold_convert_const_fixed_from_fixed (type
, arg1
);
2301 else if (TREE_CODE (arg1
) == INTEGER_CST
)
2302 return fold_convert_const_fixed_from_int (type
, arg1
);
2303 else if (TREE_CODE (arg1
) == REAL_CST
)
2304 return fold_convert_const_fixed_from_real (type
, arg1
);
2306 else if (TREE_CODE (type
) == VECTOR_TYPE
)
2308 if (TREE_CODE (arg1
) == VECTOR_CST
2309 && known_eq (TYPE_VECTOR_SUBPARTS (type
), VECTOR_CST_NELTS (arg1
)))
2311 tree elttype
= TREE_TYPE (type
);
2312 tree arg1_elttype
= TREE_TYPE (TREE_TYPE (arg1
));
2313 /* We can't handle steps directly when extending, since the
2314 values need to wrap at the original precision first. */
2316 = (INTEGRAL_TYPE_P (elttype
)
2317 && INTEGRAL_TYPE_P (arg1_elttype
)
2318 && TYPE_PRECISION (elttype
) <= TYPE_PRECISION (arg1_elttype
));
2319 tree_vector_builder v
;
2320 if (!v
.new_unary_operation (type
, arg1
, step_ok_p
))
2322 unsigned int len
= v
.encoded_nelts ();
2323 for (unsigned int i
= 0; i
< len
; ++i
)
2325 tree elt
= VECTOR_CST_ELT (arg1
, i
);
2326 tree cvt
= fold_convert_const (code
, elttype
, elt
);
2327 if (cvt
== NULL_TREE
)
2337 /* Construct a vector of zero elements of vector type TYPE. */
2340 build_zero_vector (tree type
)
2344 t
= fold_convert_const (NOP_EXPR
, TREE_TYPE (type
), integer_zero_node
);
2345 return build_vector_from_val (type
, t
);
2348 /* Returns true, if ARG is convertible to TYPE using a NOP_EXPR. */
2351 fold_convertible_p (const_tree type
, const_tree arg
)
2353 tree orig
= TREE_TYPE (arg
);
2358 if (TREE_CODE (arg
) == ERROR_MARK
2359 || TREE_CODE (type
) == ERROR_MARK
2360 || TREE_CODE (orig
) == ERROR_MARK
)
2363 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (orig
))
2366 switch (TREE_CODE (type
))
2368 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2369 case POINTER_TYPE
: case REFERENCE_TYPE
:
2371 return (INTEGRAL_TYPE_P (orig
)
2372 || (POINTER_TYPE_P (orig
)
2373 && TYPE_PRECISION (type
) <= TYPE_PRECISION (orig
))
2374 || TREE_CODE (orig
) == OFFSET_TYPE
);
2377 case FIXED_POINT_TYPE
:
2379 return TREE_CODE (type
) == TREE_CODE (orig
);
2382 return (VECTOR_TYPE_P (orig
)
2383 && known_eq (TYPE_VECTOR_SUBPARTS (type
),
2384 TYPE_VECTOR_SUBPARTS (orig
))
2385 && fold_convertible_p (TREE_TYPE (type
), TREE_TYPE (orig
)));
2392 /* Convert expression ARG to type TYPE. Used by the middle-end for
2393 simple conversions in preference to calling the front-end's convert. */
2396 fold_convert_loc (location_t loc
, tree type
, tree arg
)
2398 tree orig
= TREE_TYPE (arg
);
2404 if (TREE_CODE (arg
) == ERROR_MARK
2405 || TREE_CODE (type
) == ERROR_MARK
2406 || TREE_CODE (orig
) == ERROR_MARK
)
2407 return error_mark_node
;
2409 switch (TREE_CODE (type
))
2412 case REFERENCE_TYPE
:
2413 /* Handle conversions between pointers to different address spaces. */
2414 if (POINTER_TYPE_P (orig
)
2415 && (TYPE_ADDR_SPACE (TREE_TYPE (type
))
2416 != TYPE_ADDR_SPACE (TREE_TYPE (orig
))))
2417 return fold_build1_loc (loc
, ADDR_SPACE_CONVERT_EXPR
, type
, arg
);
2420 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2422 if (TREE_CODE (arg
) == INTEGER_CST
)
2424 tem
= fold_convert_const (NOP_EXPR
, type
, arg
);
2425 if (tem
!= NULL_TREE
)
2428 if (INTEGRAL_TYPE_P (orig
) || POINTER_TYPE_P (orig
)
2429 || TREE_CODE (orig
) == OFFSET_TYPE
)
2430 return fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
2431 if (TREE_CODE (orig
) == COMPLEX_TYPE
)
2432 return fold_convert_loc (loc
, type
,
2433 fold_build1_loc (loc
, REALPART_EXPR
,
2434 TREE_TYPE (orig
), arg
));
2435 gcc_assert (TREE_CODE (orig
) == VECTOR_TYPE
2436 && tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (orig
)));
2437 return fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, type
, arg
);
2440 if (TREE_CODE (arg
) == INTEGER_CST
)
2442 tem
= fold_convert_const (FLOAT_EXPR
, type
, arg
);
2443 if (tem
!= NULL_TREE
)
2446 else if (TREE_CODE (arg
) == REAL_CST
)
2448 tem
= fold_convert_const (NOP_EXPR
, type
, arg
);
2449 if (tem
!= NULL_TREE
)
2452 else if (TREE_CODE (arg
) == FIXED_CST
)
2454 tem
= fold_convert_const (FIXED_CONVERT_EXPR
, type
, arg
);
2455 if (tem
!= NULL_TREE
)
2459 switch (TREE_CODE (orig
))
2462 case BOOLEAN_TYPE
: case ENUMERAL_TYPE
:
2463 case POINTER_TYPE
: case REFERENCE_TYPE
:
2464 return fold_build1_loc (loc
, FLOAT_EXPR
, type
, arg
);
2467 return fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
2469 case FIXED_POINT_TYPE
:
2470 return fold_build1_loc (loc
, FIXED_CONVERT_EXPR
, type
, arg
);
2473 tem
= fold_build1_loc (loc
, REALPART_EXPR
, TREE_TYPE (orig
), arg
);
2474 return fold_convert_loc (loc
, type
, tem
);
2480 case FIXED_POINT_TYPE
:
2481 if (TREE_CODE (arg
) == FIXED_CST
|| TREE_CODE (arg
) == INTEGER_CST
2482 || TREE_CODE (arg
) == REAL_CST
)
2484 tem
= fold_convert_const (FIXED_CONVERT_EXPR
, type
, arg
);
2485 if (tem
!= NULL_TREE
)
2486 goto fold_convert_exit
;
2489 switch (TREE_CODE (orig
))
2491 case FIXED_POINT_TYPE
:
2496 return fold_build1_loc (loc
, FIXED_CONVERT_EXPR
, type
, arg
);
2499 tem
= fold_build1_loc (loc
, REALPART_EXPR
, TREE_TYPE (orig
), arg
);
2500 return fold_convert_loc (loc
, type
, tem
);
2507 switch (TREE_CODE (orig
))
2510 case BOOLEAN_TYPE
: case ENUMERAL_TYPE
:
2511 case POINTER_TYPE
: case REFERENCE_TYPE
:
2513 case FIXED_POINT_TYPE
:
2514 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
2515 fold_convert_loc (loc
, TREE_TYPE (type
), arg
),
2516 fold_convert_loc (loc
, TREE_TYPE (type
),
2517 integer_zero_node
));
2522 if (TREE_CODE (arg
) == COMPLEX_EXPR
)
2524 rpart
= fold_convert_loc (loc
, TREE_TYPE (type
),
2525 TREE_OPERAND (arg
, 0));
2526 ipart
= fold_convert_loc (loc
, TREE_TYPE (type
),
2527 TREE_OPERAND (arg
, 1));
2528 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rpart
, ipart
);
2531 arg
= save_expr (arg
);
2532 rpart
= fold_build1_loc (loc
, REALPART_EXPR
, TREE_TYPE (orig
), arg
);
2533 ipart
= fold_build1_loc (loc
, IMAGPART_EXPR
, TREE_TYPE (orig
), arg
);
2534 rpart
= fold_convert_loc (loc
, TREE_TYPE (type
), rpart
);
2535 ipart
= fold_convert_loc (loc
, TREE_TYPE (type
), ipart
);
2536 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rpart
, ipart
);
2544 if (integer_zerop (arg
))
2545 return build_zero_vector (type
);
2546 gcc_assert (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (orig
)));
2547 gcc_assert (INTEGRAL_TYPE_P (orig
) || POINTER_TYPE_P (orig
)
2548 || TREE_CODE (orig
) == VECTOR_TYPE
);
2549 return fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, type
, arg
);
2552 tem
= fold_ignored_result (arg
);
2553 return fold_build1_loc (loc
, NOP_EXPR
, type
, tem
);
2556 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (orig
))
2557 return fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
2561 protected_set_expr_location_unshare (tem
, loc
);
2565 /* Return false if expr can be assumed not to be an lvalue, true
2569 maybe_lvalue_p (const_tree x
)
2571 /* We only need to wrap lvalue tree codes. */
2572 switch (TREE_CODE (x
))
2585 case ARRAY_RANGE_REF
:
2591 case PREINCREMENT_EXPR
:
2592 case PREDECREMENT_EXPR
:
2594 case TRY_CATCH_EXPR
:
2595 case WITH_CLEANUP_EXPR
:
2601 case VIEW_CONVERT_EXPR
:
2605 /* Assume the worst for front-end tree codes. */
2606 if ((int)TREE_CODE (x
) >= NUM_TREE_CODES
)
2614 /* Return an expr equal to X but certainly not valid as an lvalue. */
2617 non_lvalue_loc (location_t loc
, tree x
)
2619 /* While we are in GIMPLE, NON_LVALUE_EXPR doesn't mean anything to
2624 if (! maybe_lvalue_p (x
))
2626 return build1_loc (loc
, NON_LVALUE_EXPR
, TREE_TYPE (x
), x
);
2629 /* When pedantic, return an expr equal to X but certainly not valid as a
2630 pedantic lvalue. Otherwise, return X. */
2633 pedantic_non_lvalue_loc (location_t loc
, tree x
)
2635 return protected_set_expr_location_unshare (x
, loc
);
2638 /* Given a tree comparison code, return the code that is the logical inverse.
2639 It is generally not safe to do this for floating-point comparisons, except
2640 for EQ_EXPR, NE_EXPR, ORDERED_EXPR and UNORDERED_EXPR, so we return
2641 ERROR_MARK in this case. */
2644 invert_tree_comparison (enum tree_code code
, bool honor_nans
)
2646 if (honor_nans
&& flag_trapping_math
&& code
!= EQ_EXPR
&& code
!= NE_EXPR
2647 && code
!= ORDERED_EXPR
&& code
!= UNORDERED_EXPR
)
2657 return honor_nans
? UNLE_EXPR
: LE_EXPR
;
2659 return honor_nans
? UNLT_EXPR
: LT_EXPR
;
2661 return honor_nans
? UNGE_EXPR
: GE_EXPR
;
2663 return honor_nans
? UNGT_EXPR
: GT_EXPR
;
2677 return UNORDERED_EXPR
;
2678 case UNORDERED_EXPR
:
2679 return ORDERED_EXPR
;
2685 /* Similar, but return the comparison that results if the operands are
2686 swapped. This is safe for floating-point. */
2689 swap_tree_comparison (enum tree_code code
)
2696 case UNORDERED_EXPR
:
2722 /* Convert a comparison tree code from an enum tree_code representation
2723 into a compcode bit-based encoding. This function is the inverse of
2724 compcode_to_comparison. */
2726 static enum comparison_code
2727 comparison_to_compcode (enum tree_code code
)
2744 return COMPCODE_ORD
;
2745 case UNORDERED_EXPR
:
2746 return COMPCODE_UNORD
;
2748 return COMPCODE_UNLT
;
2750 return COMPCODE_UNEQ
;
2752 return COMPCODE_UNLE
;
2754 return COMPCODE_UNGT
;
2756 return COMPCODE_LTGT
;
2758 return COMPCODE_UNGE
;
2764 /* Convert a compcode bit-based encoding of a comparison operator back
2765 to GCC's enum tree_code representation. This function is the
2766 inverse of comparison_to_compcode. */
2768 static enum tree_code
2769 compcode_to_comparison (enum comparison_code code
)
2786 return ORDERED_EXPR
;
2787 case COMPCODE_UNORD
:
2788 return UNORDERED_EXPR
;
2806 /* Return true if COND1 tests the opposite condition of COND2. */
2809 inverse_conditions_p (const_tree cond1
, const_tree cond2
)
2811 return (COMPARISON_CLASS_P (cond1
)
2812 && COMPARISON_CLASS_P (cond2
)
2813 && (invert_tree_comparison
2815 HONOR_NANS (TREE_OPERAND (cond1
, 0))) == TREE_CODE (cond2
))
2816 && operand_equal_p (TREE_OPERAND (cond1
, 0),
2817 TREE_OPERAND (cond2
, 0), 0)
2818 && operand_equal_p (TREE_OPERAND (cond1
, 1),
2819 TREE_OPERAND (cond2
, 1), 0));
2822 /* Return a tree for the comparison which is the combination of
2823 doing the AND or OR (depending on CODE) of the two operations LCODE
2824 and RCODE on the identical operands LL_ARG and LR_ARG. Take into account
2825 the possibility of trapping if the mode has NaNs, and return NULL_TREE
2826 if this makes the transformation invalid. */
2829 combine_comparisons (location_t loc
,
2830 enum tree_code code
, enum tree_code lcode
,
2831 enum tree_code rcode
, tree truth_type
,
2832 tree ll_arg
, tree lr_arg
)
2834 bool honor_nans
= HONOR_NANS (ll_arg
);
2835 enum comparison_code lcompcode
= comparison_to_compcode (lcode
);
2836 enum comparison_code rcompcode
= comparison_to_compcode (rcode
);
2841 case TRUTH_AND_EXPR
: case TRUTH_ANDIF_EXPR
:
2842 compcode
= lcompcode
& rcompcode
;
2845 case TRUTH_OR_EXPR
: case TRUTH_ORIF_EXPR
:
2846 compcode
= lcompcode
| rcompcode
;
2855 /* Eliminate unordered comparisons, as well as LTGT and ORD
2856 which are not used unless the mode has NaNs. */
2857 compcode
&= ~COMPCODE_UNORD
;
2858 if (compcode
== COMPCODE_LTGT
)
2859 compcode
= COMPCODE_NE
;
2860 else if (compcode
== COMPCODE_ORD
)
2861 compcode
= COMPCODE_TRUE
;
2863 else if (flag_trapping_math
)
2865 /* Check that the original operation and the optimized ones will trap
2866 under the same condition. */
2867 bool ltrap
= (lcompcode
& COMPCODE_UNORD
) == 0
2868 && (lcompcode
!= COMPCODE_EQ
)
2869 && (lcompcode
!= COMPCODE_ORD
);
2870 bool rtrap
= (rcompcode
& COMPCODE_UNORD
) == 0
2871 && (rcompcode
!= COMPCODE_EQ
)
2872 && (rcompcode
!= COMPCODE_ORD
);
2873 bool trap
= (compcode
& COMPCODE_UNORD
) == 0
2874 && (compcode
!= COMPCODE_EQ
)
2875 && (compcode
!= COMPCODE_ORD
);
2877 /* In a short-circuited boolean expression the LHS might be
2878 such that the RHS, if evaluated, will never trap. For
2879 example, in ORD (x, y) && (x < y), we evaluate the RHS only
2880 if neither x nor y is NaN. (This is a mixed blessing: for
2881 example, the expression above will never trap, hence
2882 optimizing it to x < y would be invalid). */
2883 if ((code
== TRUTH_ORIF_EXPR
&& (lcompcode
& COMPCODE_UNORD
))
2884 || (code
== TRUTH_ANDIF_EXPR
&& !(lcompcode
& COMPCODE_UNORD
)))
2887 /* If the comparison was short-circuited, and only the RHS
2888 trapped, we may now generate a spurious trap. */
2890 && (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
))
2893 /* If we changed the conditions that cause a trap, we lose. */
2894 if ((ltrap
|| rtrap
) != trap
)
2898 if (compcode
== COMPCODE_TRUE
)
2899 return constant_boolean_node (true, truth_type
);
2900 else if (compcode
== COMPCODE_FALSE
)
2901 return constant_boolean_node (false, truth_type
);
2904 enum tree_code tcode
;
2906 tcode
= compcode_to_comparison ((enum comparison_code
) compcode
);
2907 return fold_build2_loc (loc
, tcode
, truth_type
, ll_arg
, lr_arg
);
2911 /* Return nonzero if two operands (typically of the same tree node)
2912 are necessarily equal. FLAGS modifies behavior as follows:
2914 If OEP_ONLY_CONST is set, only return nonzero for constants.
2915 This function tests whether the operands are indistinguishable;
2916 it does not test whether they are equal using C's == operation.
2917 The distinction is important for IEEE floating point, because
2918 (1) -0.0 and 0.0 are distinguishable, but -0.0==0.0, and
2919 (2) two NaNs may be indistinguishable, but NaN!=NaN.
2921 If OEP_ONLY_CONST is unset, a VAR_DECL is considered equal to itself
2922 even though it may hold multiple values during a function.
2923 This is because a GCC tree node guarantees that nothing else is
2924 executed between the evaluation of its "operands" (which may often
2925 be evaluated in arbitrary order). Hence if the operands themselves
2926 don't side-effect, the VAR_DECLs, PARM_DECLs etc... must hold the
2927 same value in each operand/subexpression. Hence leaving OEP_ONLY_CONST
2928 unset means assuming isochronic (or instantaneous) tree equivalence.
2929 Unless comparing arbitrary expression trees, such as from different
2930 statements, this flag can usually be left unset.
2932 If OEP_PURE_SAME is set, then pure functions with identical arguments
2933 are considered the same. It is used when the caller has other ways
2934 to ensure that global memory is unchanged in between.
2936 If OEP_ADDRESS_OF is set, we are actually comparing addresses of objects,
2937 not values of expressions.
2939 If OEP_LEXICOGRAPHIC is set, then also handle expressions with side-effects
2940 such as MODIFY_EXPR, RETURN_EXPR, as well as STATEMENT_LISTs.
2942 If OEP_BITWISE is set, then require the values to be bitwise identical
2943 rather than simply numerically equal. Do not take advantage of things
2944 like math-related flags or undefined behavior; only return true for
2945 values that are provably bitwise identical in all circumstances.
2947 Unless OEP_MATCH_SIDE_EFFECTS is set, the function returns false on
2948 any operand with side effect. This is unnecesarily conservative in the
2949 case we know that arg0 and arg1 are in disjoint code paths (such as in
2950 ?: operator). In addition OEP_MATCH_SIDE_EFFECTS is used when comparing
2951 addresses with TREE_CONSTANT flag set so we know that &var == &var
2952 even if var is volatile. */
2955 operand_compare::operand_equal_p (const_tree arg0
, const_tree arg1
,
2959 if (verify_hash_value (arg0
, arg1
, flags
, &r
))
2962 STRIP_ANY_LOCATION_WRAPPER (arg0
);
2963 STRIP_ANY_LOCATION_WRAPPER (arg1
);
2965 /* If either is ERROR_MARK, they aren't equal. */
2966 if (TREE_CODE (arg0
) == ERROR_MARK
|| TREE_CODE (arg1
) == ERROR_MARK
2967 || TREE_TYPE (arg0
) == error_mark_node
2968 || TREE_TYPE (arg1
) == error_mark_node
)
2971 /* Similar, if either does not have a type (like a template id),
2972 they aren't equal. */
2973 if (!TREE_TYPE (arg0
) || !TREE_TYPE (arg1
))
2976 /* Bitwise identity makes no sense if the values have different layouts. */
2977 if ((flags
& OEP_BITWISE
)
2978 && !tree_nop_conversion_p (TREE_TYPE (arg0
), TREE_TYPE (arg1
)))
2981 /* We cannot consider pointers to different address space equal. */
2982 if (POINTER_TYPE_P (TREE_TYPE (arg0
))
2983 && POINTER_TYPE_P (TREE_TYPE (arg1
))
2984 && (TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (arg0
)))
2985 != TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (arg1
)))))
2988 /* Check equality of integer constants before bailing out due to
2989 precision differences. */
2990 if (TREE_CODE (arg0
) == INTEGER_CST
&& TREE_CODE (arg1
) == INTEGER_CST
)
2992 /* Address of INTEGER_CST is not defined; check that we did not forget
2993 to drop the OEP_ADDRESS_OF flags. */
2994 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
2995 return tree_int_cst_equal (arg0
, arg1
);
2998 if (!(flags
& OEP_ADDRESS_OF
))
3000 /* If both types don't have the same signedness, then we can't consider
3001 them equal. We must check this before the STRIP_NOPS calls
3002 because they may change the signedness of the arguments. As pointers
3003 strictly don't have a signedness, require either two pointers or
3004 two non-pointers as well. */
3005 if (TYPE_UNSIGNED (TREE_TYPE (arg0
)) != TYPE_UNSIGNED (TREE_TYPE (arg1
))
3006 || POINTER_TYPE_P (TREE_TYPE (arg0
))
3007 != POINTER_TYPE_P (TREE_TYPE (arg1
)))
3010 /* If both types don't have the same precision, then it is not safe
3012 if (element_precision (TREE_TYPE (arg0
))
3013 != element_precision (TREE_TYPE (arg1
)))
3020 /* FIXME: Fortran FE currently produce ADDR_EXPR of NOP_EXPR. Enable the
3021 sanity check once the issue is solved. */
3023 /* Addresses of conversions and SSA_NAMEs (and many other things)
3024 are not defined. Check that we did not forget to drop the
3025 OEP_ADDRESS_OF/OEP_CONSTANT_ADDRESS_OF flags. */
3026 gcc_checking_assert (!CONVERT_EXPR_P (arg0
) && !CONVERT_EXPR_P (arg1
)
3027 && TREE_CODE (arg0
) != SSA_NAME
);
3030 /* In case both args are comparisons but with different comparison
3031 code, try to swap the comparison operands of one arg to produce
3032 a match and compare that variant. */
3033 if (TREE_CODE (arg0
) != TREE_CODE (arg1
)
3034 && COMPARISON_CLASS_P (arg0
)
3035 && COMPARISON_CLASS_P (arg1
))
3037 enum tree_code swap_code
= swap_tree_comparison (TREE_CODE (arg1
));
3039 if (TREE_CODE (arg0
) == swap_code
)
3040 return operand_equal_p (TREE_OPERAND (arg0
, 0),
3041 TREE_OPERAND (arg1
, 1), flags
)
3042 && operand_equal_p (TREE_OPERAND (arg0
, 1),
3043 TREE_OPERAND (arg1
, 0), flags
);
3046 if (TREE_CODE (arg0
) != TREE_CODE (arg1
))
3048 /* NOP_EXPR and CONVERT_EXPR are considered equal. */
3049 if (CONVERT_EXPR_P (arg0
) && CONVERT_EXPR_P (arg1
))
3051 else if (flags
& OEP_ADDRESS_OF
)
3053 /* If we are interested in comparing addresses ignore
3054 MEM_REF wrappings of the base that can appear just for
3056 if (TREE_CODE (arg0
) == MEM_REF
3058 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == ADDR_EXPR
3059 && TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0) == arg1
3060 && integer_zerop (TREE_OPERAND (arg0
, 1)))
3062 else if (TREE_CODE (arg1
) == MEM_REF
3064 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == ADDR_EXPR
3065 && TREE_OPERAND (TREE_OPERAND (arg1
, 0), 0) == arg0
3066 && integer_zerop (TREE_OPERAND (arg1
, 1)))
3074 /* When not checking adddresses, this is needed for conversions and for
3075 COMPONENT_REF. Might as well play it safe and always test this. */
3076 if (TREE_CODE (TREE_TYPE (arg0
)) == ERROR_MARK
3077 || TREE_CODE (TREE_TYPE (arg1
)) == ERROR_MARK
3078 || (TYPE_MODE (TREE_TYPE (arg0
)) != TYPE_MODE (TREE_TYPE (arg1
))
3079 && !(flags
& OEP_ADDRESS_OF
)))
3082 /* If ARG0 and ARG1 are the same SAVE_EXPR, they are necessarily equal.
3083 We don't care about side effects in that case because the SAVE_EXPR
3084 takes care of that for us. In all other cases, two expressions are
3085 equal if they have no side effects. If we have two identical
3086 expressions with side effects that should be treated the same due
3087 to the only side effects being identical SAVE_EXPR's, that will
3088 be detected in the recursive calls below.
3089 If we are taking an invariant address of two identical objects
3090 they are necessarily equal as well. */
3091 if (arg0
== arg1
&& ! (flags
& OEP_ONLY_CONST
)
3092 && (TREE_CODE (arg0
) == SAVE_EXPR
3093 || (flags
& OEP_MATCH_SIDE_EFFECTS
)
3094 || (! TREE_SIDE_EFFECTS (arg0
) && ! TREE_SIDE_EFFECTS (arg1
))))
3097 /* Next handle constant cases, those for which we can return 1 even
3098 if ONLY_CONST is set. */
3099 if (TREE_CONSTANT (arg0
) && TREE_CONSTANT (arg1
))
3100 switch (TREE_CODE (arg0
))
3103 return tree_int_cst_equal (arg0
, arg1
);
3106 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (arg0
),
3107 TREE_FIXED_CST (arg1
));
3110 if (real_identical (&TREE_REAL_CST (arg0
), &TREE_REAL_CST (arg1
)))
3113 if (!(flags
& OEP_BITWISE
) && !HONOR_SIGNED_ZEROS (arg0
))
3115 /* If we do not distinguish between signed and unsigned zero,
3116 consider them equal. */
3117 if (real_zerop (arg0
) && real_zerop (arg1
))
3124 if (VECTOR_CST_LOG2_NPATTERNS (arg0
)
3125 != VECTOR_CST_LOG2_NPATTERNS (arg1
))
3128 if (VECTOR_CST_NELTS_PER_PATTERN (arg0
)
3129 != VECTOR_CST_NELTS_PER_PATTERN (arg1
))
3132 unsigned int count
= vector_cst_encoded_nelts (arg0
);
3133 for (unsigned int i
= 0; i
< count
; ++i
)
3134 if (!operand_equal_p (VECTOR_CST_ENCODED_ELT (arg0
, i
),
3135 VECTOR_CST_ENCODED_ELT (arg1
, i
), flags
))
3141 return (operand_equal_p (TREE_REALPART (arg0
), TREE_REALPART (arg1
),
3143 && operand_equal_p (TREE_IMAGPART (arg0
), TREE_IMAGPART (arg1
),
3147 return (TREE_STRING_LENGTH (arg0
) == TREE_STRING_LENGTH (arg1
)
3148 && ! memcmp (TREE_STRING_POINTER (arg0
),
3149 TREE_STRING_POINTER (arg1
),
3150 TREE_STRING_LENGTH (arg0
)));
3153 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
3154 return operand_equal_p (TREE_OPERAND (arg0
, 0), TREE_OPERAND (arg1
, 0),
3155 flags
| OEP_ADDRESS_OF
3156 | OEP_MATCH_SIDE_EFFECTS
);
3158 /* In GIMPLE empty constructors are allowed in initializers of
3160 return !CONSTRUCTOR_NELTS (arg0
) && !CONSTRUCTOR_NELTS (arg1
);
3165 /* Don't handle more cases for OEP_BITWISE, since we can't guarantee that
3166 two instances of undefined behavior will give identical results. */
3167 if (flags
& (OEP_ONLY_CONST
| OEP_BITWISE
))
3170 /* Define macros to test an operand from arg0 and arg1 for equality and a
3171 variant that allows null and views null as being different from any
3172 non-null value. In the latter case, if either is null, the both
3173 must be; otherwise, do the normal comparison. */
3174 #define OP_SAME(N) operand_equal_p (TREE_OPERAND (arg0, N), \
3175 TREE_OPERAND (arg1, N), flags)
3177 #define OP_SAME_WITH_NULL(N) \
3178 ((!TREE_OPERAND (arg0, N) || !TREE_OPERAND (arg1, N)) \
3179 ? TREE_OPERAND (arg0, N) == TREE_OPERAND (arg1, N) : OP_SAME (N))
3181 switch (TREE_CODE_CLASS (TREE_CODE (arg0
)))
3184 /* Two conversions are equal only if signedness and modes match. */
3185 switch (TREE_CODE (arg0
))
3188 case FIX_TRUNC_EXPR
:
3189 if (TYPE_UNSIGNED (TREE_TYPE (arg0
))
3190 != TYPE_UNSIGNED (TREE_TYPE (arg1
)))
3200 case tcc_comparison
:
3202 if (OP_SAME (0) && OP_SAME (1))
3205 /* For commutative ops, allow the other order. */
3206 return (commutative_tree_code (TREE_CODE (arg0
))
3207 && operand_equal_p (TREE_OPERAND (arg0
, 0),
3208 TREE_OPERAND (arg1
, 1), flags
)
3209 && operand_equal_p (TREE_OPERAND (arg0
, 1),
3210 TREE_OPERAND (arg1
, 0), flags
));
3213 /* If either of the pointer (or reference) expressions we are
3214 dereferencing contain a side effect, these cannot be equal,
3215 but their addresses can be. */
3216 if ((flags
& OEP_MATCH_SIDE_EFFECTS
) == 0
3217 && (TREE_SIDE_EFFECTS (arg0
)
3218 || TREE_SIDE_EFFECTS (arg1
)))
3221 switch (TREE_CODE (arg0
))
3224 if (!(flags
& OEP_ADDRESS_OF
))
3226 if (TYPE_ALIGN (TREE_TYPE (arg0
))
3227 != TYPE_ALIGN (TREE_TYPE (arg1
)))
3229 /* Verify that the access types are compatible. */
3230 if (TYPE_MAIN_VARIANT (TREE_TYPE (arg0
))
3231 != TYPE_MAIN_VARIANT (TREE_TYPE (arg1
)))
3234 flags
&= ~OEP_ADDRESS_OF
;
3238 /* Require the same offset. */
3239 if (!operand_equal_p (TYPE_SIZE (TREE_TYPE (arg0
)),
3240 TYPE_SIZE (TREE_TYPE (arg1
)),
3241 flags
& ~OEP_ADDRESS_OF
))
3246 case VIEW_CONVERT_EXPR
:
3249 case TARGET_MEM_REF
:
3251 if (!(flags
& OEP_ADDRESS_OF
))
3253 /* Require equal access sizes */
3254 if (TYPE_SIZE (TREE_TYPE (arg0
)) != TYPE_SIZE (TREE_TYPE (arg1
))
3255 && (!TYPE_SIZE (TREE_TYPE (arg0
))
3256 || !TYPE_SIZE (TREE_TYPE (arg1
))
3257 || !operand_equal_p (TYPE_SIZE (TREE_TYPE (arg0
)),
3258 TYPE_SIZE (TREE_TYPE (arg1
)),
3261 /* Verify that access happens in similar types. */
3262 if (!types_compatible_p (TREE_TYPE (arg0
), TREE_TYPE (arg1
)))
3264 /* Verify that accesses are TBAA compatible. */
3265 if (!alias_ptr_types_compatible_p
3266 (TREE_TYPE (TREE_OPERAND (arg0
, 1)),
3267 TREE_TYPE (TREE_OPERAND (arg1
, 1)))
3268 || (MR_DEPENDENCE_CLIQUE (arg0
)
3269 != MR_DEPENDENCE_CLIQUE (arg1
))
3270 || (MR_DEPENDENCE_BASE (arg0
)
3271 != MR_DEPENDENCE_BASE (arg1
)))
3273 /* Verify that alignment is compatible. */
3274 if (TYPE_ALIGN (TREE_TYPE (arg0
))
3275 != TYPE_ALIGN (TREE_TYPE (arg1
)))
3278 flags
&= ~OEP_ADDRESS_OF
;
3279 return (OP_SAME (0) && OP_SAME (1)
3280 /* TARGET_MEM_REF require equal extra operands. */
3281 && (TREE_CODE (arg0
) != TARGET_MEM_REF
3282 || (OP_SAME_WITH_NULL (2)
3283 && OP_SAME_WITH_NULL (3)
3284 && OP_SAME_WITH_NULL (4))));
3287 case ARRAY_RANGE_REF
:
3290 flags
&= ~OEP_ADDRESS_OF
;
3291 /* Compare the array index by value if it is constant first as we
3292 may have different types but same value here. */
3293 return ((tree_int_cst_equal (TREE_OPERAND (arg0
, 1),
3294 TREE_OPERAND (arg1
, 1))
3296 && OP_SAME_WITH_NULL (2)
3297 && OP_SAME_WITH_NULL (3)
3298 /* Compare low bound and element size as with OEP_ADDRESS_OF
3299 we have to account for the offset of the ref. */
3300 && (TREE_TYPE (TREE_OPERAND (arg0
, 0))
3301 == TREE_TYPE (TREE_OPERAND (arg1
, 0))
3302 || (operand_equal_p (array_ref_low_bound
3303 (CONST_CAST_TREE (arg0
)),
3305 (CONST_CAST_TREE (arg1
)), flags
)
3306 && operand_equal_p (array_ref_element_size
3307 (CONST_CAST_TREE (arg0
)),
3308 array_ref_element_size
3309 (CONST_CAST_TREE (arg1
)),
3313 /* Handle operand 2 the same as for ARRAY_REF. Operand 0
3314 may be NULL when we're called to compare MEM_EXPRs. */
3315 if (!OP_SAME_WITH_NULL (0)
3318 flags
&= ~OEP_ADDRESS_OF
;
3319 return OP_SAME_WITH_NULL (2);
3324 flags
&= ~OEP_ADDRESS_OF
;
3325 return OP_SAME (1) && OP_SAME (2);
3327 /* Virtual table call. */
3330 if (!operand_equal_p (OBJ_TYPE_REF_EXPR (arg0
),
3331 OBJ_TYPE_REF_EXPR (arg1
), flags
))
3333 if (tree_to_uhwi (OBJ_TYPE_REF_TOKEN (arg0
))
3334 != tree_to_uhwi (OBJ_TYPE_REF_TOKEN (arg1
)))
3336 if (!operand_equal_p (OBJ_TYPE_REF_OBJECT (arg0
),
3337 OBJ_TYPE_REF_OBJECT (arg1
), flags
))
3339 if (!types_same_for_odr (obj_type_ref_class (arg0
),
3340 obj_type_ref_class (arg1
)))
3349 case tcc_expression
:
3350 switch (TREE_CODE (arg0
))
3353 /* Be sure we pass right ADDRESS_OF flag. */
3354 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
3355 return operand_equal_p (TREE_OPERAND (arg0
, 0),
3356 TREE_OPERAND (arg1
, 0),
3357 flags
| OEP_ADDRESS_OF
);
3359 case TRUTH_NOT_EXPR
:
3362 case TRUTH_ANDIF_EXPR
:
3363 case TRUTH_ORIF_EXPR
:
3364 return OP_SAME (0) && OP_SAME (1);
3366 case WIDEN_MULT_PLUS_EXPR
:
3367 case WIDEN_MULT_MINUS_EXPR
:
3370 /* The multiplcation operands are commutative. */
3373 case TRUTH_AND_EXPR
:
3375 case TRUTH_XOR_EXPR
:
3376 if (OP_SAME (0) && OP_SAME (1))
3379 /* Otherwise take into account this is a commutative operation. */
3380 return (operand_equal_p (TREE_OPERAND (arg0
, 0),
3381 TREE_OPERAND (arg1
, 1), flags
)
3382 && operand_equal_p (TREE_OPERAND (arg0
, 1),
3383 TREE_OPERAND (arg1
, 0), flags
));
3386 if (! OP_SAME (1) || ! OP_SAME_WITH_NULL (2))
3388 flags
&= ~OEP_ADDRESS_OF
;
3391 case BIT_INSERT_EXPR
:
3392 /* BIT_INSERT_EXPR has an implict operand as the type precision
3393 of op1. Need to check to make sure they are the same. */
3394 if (TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
3395 && TREE_CODE (TREE_OPERAND (arg1
, 1)) == INTEGER_CST
3396 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg0
, 1)))
3397 != TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg1
, 1))))
3403 return OP_SAME (0) && OP_SAME (1) && OP_SAME (2);
3408 case PREDECREMENT_EXPR
:
3409 case PREINCREMENT_EXPR
:
3410 case POSTDECREMENT_EXPR
:
3411 case POSTINCREMENT_EXPR
:
3412 if (flags
& OEP_LEXICOGRAPHIC
)
3413 return OP_SAME (0) && OP_SAME (1);
3416 case CLEANUP_POINT_EXPR
:
3419 if (flags
& OEP_LEXICOGRAPHIC
)
3428 switch (TREE_CODE (arg0
))
3431 if ((CALL_EXPR_FN (arg0
) == NULL_TREE
)
3432 != (CALL_EXPR_FN (arg1
) == NULL_TREE
))
3433 /* If not both CALL_EXPRs are either internal or normal function
3434 functions, then they are not equal. */
3436 else if (CALL_EXPR_FN (arg0
) == NULL_TREE
)
3438 /* If the CALL_EXPRs call different internal functions, then they
3440 if (CALL_EXPR_IFN (arg0
) != CALL_EXPR_IFN (arg1
))
3445 /* If the CALL_EXPRs call different functions, then they are not
3447 if (! operand_equal_p (CALL_EXPR_FN (arg0
), CALL_EXPR_FN (arg1
),
3452 /* FIXME: We could skip this test for OEP_MATCH_SIDE_EFFECTS. */
3454 unsigned int cef
= call_expr_flags (arg0
);
3455 if (flags
& OEP_PURE_SAME
)
3456 cef
&= ECF_CONST
| ECF_PURE
;
3459 if (!cef
&& !(flags
& OEP_LEXICOGRAPHIC
))
3463 /* Now see if all the arguments are the same. */
3465 const_call_expr_arg_iterator iter0
, iter1
;
3467 for (a0
= first_const_call_expr_arg (arg0
, &iter0
),
3468 a1
= first_const_call_expr_arg (arg1
, &iter1
);
3470 a0
= next_const_call_expr_arg (&iter0
),
3471 a1
= next_const_call_expr_arg (&iter1
))
3472 if (! operand_equal_p (a0
, a1
, flags
))
3475 /* If we get here and both argument lists are exhausted
3476 then the CALL_EXPRs are equal. */
3477 return ! (a0
|| a1
);
3483 case tcc_declaration
:
3484 /* Consider __builtin_sqrt equal to sqrt. */
3485 return (TREE_CODE (arg0
) == FUNCTION_DECL
3486 && fndecl_built_in_p (arg0
) && fndecl_built_in_p (arg1
)
3487 && DECL_BUILT_IN_CLASS (arg0
) == DECL_BUILT_IN_CLASS (arg1
)
3488 && (DECL_UNCHECKED_FUNCTION_CODE (arg0
)
3489 == DECL_UNCHECKED_FUNCTION_CODE (arg1
)));
3491 case tcc_exceptional
:
3492 if (TREE_CODE (arg0
) == CONSTRUCTOR
)
3494 if (CONSTRUCTOR_NO_CLEARING (arg0
) != CONSTRUCTOR_NO_CLEARING (arg1
))
3497 /* In GIMPLE constructors are used only to build vectors from
3498 elements. Individual elements in the constructor must be
3499 indexed in increasing order and form an initial sequence.
3501 We make no effort to compare constructors in generic.
3502 (see sem_variable::equals in ipa-icf which can do so for
3504 if (!VECTOR_TYPE_P (TREE_TYPE (arg0
))
3505 || !VECTOR_TYPE_P (TREE_TYPE (arg1
)))
3508 /* Be sure that vectors constructed have the same representation.
3509 We only tested element precision and modes to match.
3510 Vectors may be BLKmode and thus also check that the number of
3512 if (maybe_ne (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0
)),
3513 TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg1
))))
3516 vec
<constructor_elt
, va_gc
> *v0
= CONSTRUCTOR_ELTS (arg0
);
3517 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (arg1
);
3518 unsigned int len
= vec_safe_length (v0
);
3520 if (len
!= vec_safe_length (v1
))
3523 for (unsigned int i
= 0; i
< len
; i
++)
3525 constructor_elt
*c0
= &(*v0
)[i
];
3526 constructor_elt
*c1
= &(*v1
)[i
];
3528 if (!operand_equal_p (c0
->value
, c1
->value
, flags
)
3529 /* In GIMPLE the indexes can be either NULL or matching i.
3530 Double check this so we won't get false
3531 positives for GENERIC. */
3533 && (TREE_CODE (c0
->index
) != INTEGER_CST
3534 || compare_tree_int (c0
->index
, i
)))
3536 && (TREE_CODE (c1
->index
) != INTEGER_CST
3537 || compare_tree_int (c1
->index
, i
))))
3542 else if (TREE_CODE (arg0
) == STATEMENT_LIST
3543 && (flags
& OEP_LEXICOGRAPHIC
))
3545 /* Compare the STATEMENT_LISTs. */
3546 tree_stmt_iterator tsi1
, tsi2
;
3547 tree body1
= CONST_CAST_TREE (arg0
);
3548 tree body2
= CONST_CAST_TREE (arg1
);
3549 for (tsi1
= tsi_start (body1
), tsi2
= tsi_start (body2
); ;
3550 tsi_next (&tsi1
), tsi_next (&tsi2
))
3552 /* The lists don't have the same number of statements. */
3553 if (tsi_end_p (tsi1
) ^ tsi_end_p (tsi2
))
3555 if (tsi_end_p (tsi1
) && tsi_end_p (tsi2
))
3557 if (!operand_equal_p (tsi_stmt (tsi1
), tsi_stmt (tsi2
),
3558 flags
& (OEP_LEXICOGRAPHIC
3559 | OEP_NO_HASH_CHECK
)))
3566 switch (TREE_CODE (arg0
))
3569 if (flags
& OEP_LEXICOGRAPHIC
)
3570 return OP_SAME_WITH_NULL (0);
3572 case DEBUG_BEGIN_STMT
:
3573 if (flags
& OEP_LEXICOGRAPHIC
)
3585 #undef OP_SAME_WITH_NULL
3588 /* Generate a hash value for an expression. This can be used iteratively
3589 by passing a previous result as the HSTATE argument. */
3592 operand_compare::hash_operand (const_tree t
, inchash::hash
&hstate
,
3596 enum tree_code code
;
3597 enum tree_code_class tclass
;
3599 if (t
== NULL_TREE
|| t
== error_mark_node
)
3601 hstate
.merge_hash (0);
3605 STRIP_ANY_LOCATION_WRAPPER (t
);
3607 if (!(flags
& OEP_ADDRESS_OF
))
3610 code
= TREE_CODE (t
);
3614 /* Alas, constants aren't shared, so we can't rely on pointer
3617 hstate
.merge_hash (0);
3620 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
3621 for (i
= 0; i
< TREE_INT_CST_EXT_NUNITS (t
); i
++)
3622 hstate
.add_hwi (TREE_INT_CST_ELT (t
, i
));
3627 if (!HONOR_SIGNED_ZEROS (t
) && real_zerop (t
))
3630 val2
= real_hash (TREE_REAL_CST_PTR (t
));
3631 hstate
.merge_hash (val2
);
3636 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
3637 hstate
.merge_hash (val2
);
3641 hstate
.add ((const void *) TREE_STRING_POINTER (t
),
3642 TREE_STRING_LENGTH (t
));
3645 hash_operand (TREE_REALPART (t
), hstate
, flags
);
3646 hash_operand (TREE_IMAGPART (t
), hstate
, flags
);
3650 hstate
.add_int (VECTOR_CST_NPATTERNS (t
));
3651 hstate
.add_int (VECTOR_CST_NELTS_PER_PATTERN (t
));
3652 unsigned int count
= vector_cst_encoded_nelts (t
);
3653 for (unsigned int i
= 0; i
< count
; ++i
)
3654 hash_operand (VECTOR_CST_ENCODED_ELT (t
, i
), hstate
, flags
);
3658 /* We can just compare by pointer. */
3659 hstate
.add_hwi (SSA_NAME_VERSION (t
));
3661 case PLACEHOLDER_EXPR
:
3662 /* The node itself doesn't matter. */
3669 /* A list of expressions, for a CALL_EXPR or as the elements of a
3671 for (; t
; t
= TREE_CHAIN (t
))
3672 hash_operand (TREE_VALUE (t
), hstate
, flags
);
3676 unsigned HOST_WIDE_INT idx
;
3678 flags
&= ~OEP_ADDRESS_OF
;
3679 hstate
.add_int (CONSTRUCTOR_NO_CLEARING (t
));
3680 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
3682 /* In GIMPLE the indexes can be either NULL or matching i. */
3683 if (field
== NULL_TREE
)
3684 field
= bitsize_int (idx
);
3685 hash_operand (field
, hstate
, flags
);
3686 hash_operand (value
, hstate
, flags
);
3690 case STATEMENT_LIST
:
3692 tree_stmt_iterator i
;
3693 for (i
= tsi_start (CONST_CAST_TREE (t
));
3694 !tsi_end_p (i
); tsi_next (&i
))
3695 hash_operand (tsi_stmt (i
), hstate
, flags
);
3699 for (i
= 0; i
< TREE_VEC_LENGTH (t
); ++i
)
3700 hash_operand (TREE_VEC_ELT (t
, i
), hstate
, flags
);
3702 case IDENTIFIER_NODE
:
3703 hstate
.add_object (IDENTIFIER_HASH_VALUE (t
));
3706 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
3707 Otherwise nodes that compare equal according to operand_equal_p might
3708 get different hash codes. However, don't do this for machine specific
3709 or front end builtins, since the function code is overloaded in those
3711 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
3712 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
3714 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
3715 code
= TREE_CODE (t
);
3719 if (POLY_INT_CST_P (t
))
3721 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
3722 hstate
.add_wide_int (wi::to_wide (POLY_INT_CST_COEFF (t
, i
)));
3725 tclass
= TREE_CODE_CLASS (code
);
3727 if (tclass
== tcc_declaration
)
3729 /* DECL's have a unique ID */
3730 hstate
.add_hwi (DECL_UID (t
));
3732 else if (tclass
== tcc_comparison
&& !commutative_tree_code (code
))
3734 /* For comparisons that can be swapped, use the lower
3736 enum tree_code ccode
= swap_tree_comparison (code
);
3739 hstate
.add_object (ccode
);
3740 hash_operand (TREE_OPERAND (t
, ccode
!= code
), hstate
, flags
);
3741 hash_operand (TREE_OPERAND (t
, ccode
== code
), hstate
, flags
);
3743 else if (CONVERT_EXPR_CODE_P (code
))
3745 /* NOP_EXPR and CONVERT_EXPR are considered equal by
3747 enum tree_code ccode
= NOP_EXPR
;
3748 hstate
.add_object (ccode
);
3750 /* Don't hash the type, that can lead to having nodes which
3751 compare equal according to operand_equal_p, but which
3752 have different hash codes. Make sure to include signedness
3753 in the hash computation. */
3754 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
3755 hash_operand (TREE_OPERAND (t
, 0), hstate
, flags
);
3757 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
3758 else if (code
== MEM_REF
3759 && (flags
& OEP_ADDRESS_OF
) != 0
3760 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
3761 && DECL_P (TREE_OPERAND (TREE_OPERAND (t
, 0), 0))
3762 && integer_zerop (TREE_OPERAND (t
, 1)))
3763 hash_operand (TREE_OPERAND (TREE_OPERAND (t
, 0), 0),
3765 /* Don't ICE on FE specific trees, or their arguments etc.
3766 during operand_equal_p hash verification. */
3767 else if (!IS_EXPR_CODE_CLASS (tclass
))
3768 gcc_assert (flags
& OEP_HASH_CHECK
);
3771 unsigned int sflags
= flags
;
3773 hstate
.add_object (code
);
3778 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
3779 flags
|= OEP_ADDRESS_OF
;
3785 case TARGET_MEM_REF
:
3786 flags
&= ~OEP_ADDRESS_OF
;
3791 case ARRAY_RANGE_REF
:
3794 sflags
&= ~OEP_ADDRESS_OF
;
3798 flags
&= ~OEP_ADDRESS_OF
;
3801 case WIDEN_MULT_PLUS_EXPR
:
3802 case WIDEN_MULT_MINUS_EXPR
:
3804 /* The multiplication operands are commutative. */
3805 inchash::hash one
, two
;
3806 hash_operand (TREE_OPERAND (t
, 0), one
, flags
);
3807 hash_operand (TREE_OPERAND (t
, 1), two
, flags
);
3808 hstate
.add_commutative (one
, two
);
3809 hash_operand (TREE_OPERAND (t
, 2), two
, flags
);
3814 if (CALL_EXPR_FN (t
) == NULL_TREE
)
3815 hstate
.add_int (CALL_EXPR_IFN (t
));
3819 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
3820 Usually different TARGET_EXPRs just should use
3821 different temporaries in their slots. */
3822 hash_operand (TARGET_EXPR_SLOT (t
), hstate
, flags
);
3825 /* Virtual table call. */
3827 inchash::add_expr (OBJ_TYPE_REF_EXPR (t
), hstate
, flags
);
3828 inchash::add_expr (OBJ_TYPE_REF_TOKEN (t
), hstate
, flags
);
3829 inchash::add_expr (OBJ_TYPE_REF_OBJECT (t
), hstate
, flags
);
3835 /* Don't hash the type, that can lead to having nodes which
3836 compare equal according to operand_equal_p, but which
3837 have different hash codes. */
3838 if (code
== NON_LVALUE_EXPR
)
3840 /* Make sure to include signness in the hash computation. */
3841 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
3842 hash_operand (TREE_OPERAND (t
, 0), hstate
, flags
);
3845 else if (commutative_tree_code (code
))
3847 /* It's a commutative expression. We want to hash it the same
3848 however it appears. We do this by first hashing both operands
3849 and then rehashing based on the order of their independent
3851 inchash::hash one
, two
;
3852 hash_operand (TREE_OPERAND (t
, 0), one
, flags
);
3853 hash_operand (TREE_OPERAND (t
, 1), two
, flags
);
3854 hstate
.add_commutative (one
, two
);
3857 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
3858 hash_operand (TREE_OPERAND (t
, i
), hstate
,
3859 i
== 0 ? flags
: sflags
);
3866 operand_compare::verify_hash_value (const_tree arg0
, const_tree arg1
,
3867 unsigned int flags
, bool *ret
)
3869 /* When checking, verify at the outermost operand_equal_p call that
3870 if operand_equal_p returns non-zero then ARG0 and ARG1 has the same
3872 if (flag_checking
&& !(flags
& OEP_NO_HASH_CHECK
))
3874 if (operand_equal_p (arg0
, arg1
, flags
| OEP_NO_HASH_CHECK
))
3878 inchash::hash
hstate0 (0), hstate1 (0);
3879 hash_operand (arg0
, hstate0
, flags
| OEP_HASH_CHECK
);
3880 hash_operand (arg1
, hstate1
, flags
| OEP_HASH_CHECK
);
3881 hashval_t h0
= hstate0
.end ();
3882 hashval_t h1
= hstate1
.end ();
3883 gcc_assert (h0
== h1
);
3897 static operand_compare default_compare_instance
;
3899 /* Conveinece wrapper around operand_compare class because usually we do
3900 not need to play with the valueizer. */
3903 operand_equal_p (const_tree arg0
, const_tree arg1
, unsigned int flags
)
3905 return default_compare_instance
.operand_equal_p (arg0
, arg1
, flags
);
3911 /* Generate a hash value for an expression. This can be used iteratively
3912 by passing a previous result as the HSTATE argument.
3914 This function is intended to produce the same hash for expressions which
3915 would compare equal using operand_equal_p. */
3917 add_expr (const_tree t
, inchash::hash
&hstate
, unsigned int flags
)
3919 default_compare_instance
.hash_operand (t
, hstate
, flags
);
3924 /* Similar to operand_equal_p, but see if ARG0 might be a variant of ARG1
3925 with a different signedness or a narrower precision. */
3928 operand_equal_for_comparison_p (tree arg0
, tree arg1
)
3930 if (operand_equal_p (arg0
, arg1
, 0))
3933 if (! INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
3934 || ! INTEGRAL_TYPE_P (TREE_TYPE (arg1
)))
3937 /* Discard any conversions that don't change the modes of ARG0 and ARG1
3938 and see if the inner values are the same. This removes any
3939 signedness comparison, which doesn't matter here. */
3944 if (operand_equal_p (op0
, op1
, 0))
3947 /* Discard a single widening conversion from ARG1 and see if the inner
3948 value is the same as ARG0. */
3949 if (CONVERT_EXPR_P (arg1
)
3950 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
3951 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
3952 < TYPE_PRECISION (TREE_TYPE (arg1
))
3953 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
3959 /* See if ARG is an expression that is either a comparison or is performing
3960 arithmetic on comparisons. The comparisons must only be comparing
3961 two different values, which will be stored in *CVAL1 and *CVAL2; if
3962 they are nonzero it means that some operands have already been found.
3963 No variables may be used anywhere else in the expression except in the
3966 If this is true, return 1. Otherwise, return zero. */
3969 twoval_comparison_p (tree arg
, tree
*cval1
, tree
*cval2
)
3971 enum tree_code code
= TREE_CODE (arg
);
3972 enum tree_code_class tclass
= TREE_CODE_CLASS (code
);
3974 /* We can handle some of the tcc_expression cases here. */
3975 if (tclass
== tcc_expression
&& code
== TRUTH_NOT_EXPR
)
3977 else if (tclass
== tcc_expression
3978 && (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
3979 || code
== COMPOUND_EXPR
))
3980 tclass
= tcc_binary
;
3985 return twoval_comparison_p (TREE_OPERAND (arg
, 0), cval1
, cval2
);
3988 return (twoval_comparison_p (TREE_OPERAND (arg
, 0), cval1
, cval2
)
3989 && twoval_comparison_p (TREE_OPERAND (arg
, 1), cval1
, cval2
));
3994 case tcc_expression
:
3995 if (code
== COND_EXPR
)
3996 return (twoval_comparison_p (TREE_OPERAND (arg
, 0), cval1
, cval2
)
3997 && twoval_comparison_p (TREE_OPERAND (arg
, 1), cval1
, cval2
)
3998 && twoval_comparison_p (TREE_OPERAND (arg
, 2), cval1
, cval2
));
4001 case tcc_comparison
:
4002 /* First see if we can handle the first operand, then the second. For
4003 the second operand, we know *CVAL1 can't be zero. It must be that
4004 one side of the comparison is each of the values; test for the
4005 case where this isn't true by failing if the two operands
4008 if (operand_equal_p (TREE_OPERAND (arg
, 0),
4009 TREE_OPERAND (arg
, 1), 0))
4013 *cval1
= TREE_OPERAND (arg
, 0);
4014 else if (operand_equal_p (*cval1
, TREE_OPERAND (arg
, 0), 0))
4016 else if (*cval2
== 0)
4017 *cval2
= TREE_OPERAND (arg
, 0);
4018 else if (operand_equal_p (*cval2
, TREE_OPERAND (arg
, 0), 0))
4023 if (operand_equal_p (*cval1
, TREE_OPERAND (arg
, 1), 0))
4025 else if (*cval2
== 0)
4026 *cval2
= TREE_OPERAND (arg
, 1);
4027 else if (operand_equal_p (*cval2
, TREE_OPERAND (arg
, 1), 0))
4039 /* ARG is a tree that is known to contain just arithmetic operations and
4040 comparisons. Evaluate the operations in the tree substituting NEW0 for
4041 any occurrence of OLD0 as an operand of a comparison and likewise for
4045 eval_subst (location_t loc
, tree arg
, tree old0
, tree new0
,
4046 tree old1
, tree new1
)
4048 tree type
= TREE_TYPE (arg
);
4049 enum tree_code code
= TREE_CODE (arg
);
4050 enum tree_code_class tclass
= TREE_CODE_CLASS (code
);
4052 /* We can handle some of the tcc_expression cases here. */
4053 if (tclass
== tcc_expression
&& code
== TRUTH_NOT_EXPR
)
4055 else if (tclass
== tcc_expression
4056 && (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
))
4057 tclass
= tcc_binary
;
4062 return fold_build1_loc (loc
, code
, type
,
4063 eval_subst (loc
, TREE_OPERAND (arg
, 0),
4064 old0
, new0
, old1
, new1
));
4067 return fold_build2_loc (loc
, code
, type
,
4068 eval_subst (loc
, TREE_OPERAND (arg
, 0),
4069 old0
, new0
, old1
, new1
),
4070 eval_subst (loc
, TREE_OPERAND (arg
, 1),
4071 old0
, new0
, old1
, new1
));
4073 case tcc_expression
:
4077 return eval_subst (loc
, TREE_OPERAND (arg
, 0), old0
, new0
,
4081 return eval_subst (loc
, TREE_OPERAND (arg
, 1), old0
, new0
,
4085 return fold_build3_loc (loc
, code
, type
,
4086 eval_subst (loc
, TREE_OPERAND (arg
, 0),
4087 old0
, new0
, old1
, new1
),
4088 eval_subst (loc
, TREE_OPERAND (arg
, 1),
4089 old0
, new0
, old1
, new1
),
4090 eval_subst (loc
, TREE_OPERAND (arg
, 2),
4091 old0
, new0
, old1
, new1
));
4095 /* Fall through - ??? */
4097 case tcc_comparison
:
4099 tree arg0
= TREE_OPERAND (arg
, 0);
4100 tree arg1
= TREE_OPERAND (arg
, 1);
4102 /* We need to check both for exact equality and tree equality. The
4103 former will be true if the operand has a side-effect. In that
4104 case, we know the operand occurred exactly once. */
4106 if (arg0
== old0
|| operand_equal_p (arg0
, old0
, 0))
4108 else if (arg0
== old1
|| operand_equal_p (arg0
, old1
, 0))
4111 if (arg1
== old0
|| operand_equal_p (arg1
, old0
, 0))
4113 else if (arg1
== old1
|| operand_equal_p (arg1
, old1
, 0))
4116 return fold_build2_loc (loc
, code
, type
, arg0
, arg1
);
4124 /* Return a tree for the case when the result of an expression is RESULT
4125 converted to TYPE and OMITTED was previously an operand of the expression
4126 but is now not needed (e.g., we folded OMITTED * 0).
4128 If OMITTED has side effects, we must evaluate it. Otherwise, just do
4129 the conversion of RESULT to TYPE. */
4132 omit_one_operand_loc (location_t loc
, tree type
, tree result
, tree omitted
)
4134 tree t
= fold_convert_loc (loc
, type
, result
);
4136 /* If the resulting operand is an empty statement, just return the omitted
4137 statement casted to void. */
4138 if (IS_EMPTY_STMT (t
) && TREE_SIDE_EFFECTS (omitted
))
4139 return build1_loc (loc
, NOP_EXPR
, void_type_node
,
4140 fold_ignored_result (omitted
));
4142 if (TREE_SIDE_EFFECTS (omitted
))
4143 return build2_loc (loc
, COMPOUND_EXPR
, type
,
4144 fold_ignored_result (omitted
), t
);
4146 return non_lvalue_loc (loc
, t
);
4149 /* Return a tree for the case when the result of an expression is RESULT
4150 converted to TYPE and OMITTED1 and OMITTED2 were previously operands
4151 of the expression but are now not needed.
4153 If OMITTED1 or OMITTED2 has side effects, they must be evaluated.
4154 If both OMITTED1 and OMITTED2 have side effects, OMITTED1 is
4155 evaluated before OMITTED2. Otherwise, if neither has side effects,
4156 just do the conversion of RESULT to TYPE. */
4159 omit_two_operands_loc (location_t loc
, tree type
, tree result
,
4160 tree omitted1
, tree omitted2
)
4162 tree t
= fold_convert_loc (loc
, type
, result
);
4164 if (TREE_SIDE_EFFECTS (omitted2
))
4165 t
= build2_loc (loc
, COMPOUND_EXPR
, type
, omitted2
, t
);
4166 if (TREE_SIDE_EFFECTS (omitted1
))
4167 t
= build2_loc (loc
, COMPOUND_EXPR
, type
, omitted1
, t
);
4169 return TREE_CODE (t
) != COMPOUND_EXPR
? non_lvalue_loc (loc
, t
) : t
;
4173 /* Return a simplified tree node for the truth-negation of ARG. This
4174 never alters ARG itself. We assume that ARG is an operation that
4175 returns a truth value (0 or 1).
4177 FIXME: one would think we would fold the result, but it causes
4178 problems with the dominator optimizer. */
4181 fold_truth_not_expr (location_t loc
, tree arg
)
4183 tree type
= TREE_TYPE (arg
);
4184 enum tree_code code
= TREE_CODE (arg
);
4185 location_t loc1
, loc2
;
4187 /* If this is a comparison, we can simply invert it, except for
4188 floating-point non-equality comparisons, in which case we just
4189 enclose a TRUTH_NOT_EXPR around what we have. */
4191 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
4193 tree op_type
= TREE_TYPE (TREE_OPERAND (arg
, 0));
4194 if (FLOAT_TYPE_P (op_type
)
4195 && flag_trapping_math
4196 && code
!= ORDERED_EXPR
&& code
!= UNORDERED_EXPR
4197 && code
!= NE_EXPR
&& code
!= EQ_EXPR
)
4200 code
= invert_tree_comparison (code
, HONOR_NANS (op_type
));
4201 if (code
== ERROR_MARK
)
4204 tree ret
= build2_loc (loc
, code
, type
, TREE_OPERAND (arg
, 0),
4205 TREE_OPERAND (arg
, 1));
4206 if (TREE_NO_WARNING (arg
))
4207 TREE_NO_WARNING (ret
) = 1;
4214 return constant_boolean_node (integer_zerop (arg
), type
);
4216 case TRUTH_AND_EXPR
:
4217 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
4218 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
4219 return build2_loc (loc
, TRUTH_OR_EXPR
, type
,
4220 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
4221 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
4224 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
4225 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
4226 return build2_loc (loc
, TRUTH_AND_EXPR
, type
,
4227 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
4228 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
4230 case TRUTH_XOR_EXPR
:
4231 /* Here we can invert either operand. We invert the first operand
4232 unless the second operand is a TRUTH_NOT_EXPR in which case our
4233 result is the XOR of the first operand with the inside of the
4234 negation of the second operand. */
4236 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == TRUTH_NOT_EXPR
)
4237 return build2_loc (loc
, TRUTH_XOR_EXPR
, type
, TREE_OPERAND (arg
, 0),
4238 TREE_OPERAND (TREE_OPERAND (arg
, 1), 0));
4240 return build2_loc (loc
, TRUTH_XOR_EXPR
, type
,
4241 invert_truthvalue_loc (loc
, TREE_OPERAND (arg
, 0)),
4242 TREE_OPERAND (arg
, 1));
4244 case TRUTH_ANDIF_EXPR
:
4245 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
4246 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
4247 return build2_loc (loc
, TRUTH_ORIF_EXPR
, type
,
4248 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
4249 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
4251 case TRUTH_ORIF_EXPR
:
4252 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
4253 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
4254 return build2_loc (loc
, TRUTH_ANDIF_EXPR
, type
,
4255 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
4256 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
4258 case TRUTH_NOT_EXPR
:
4259 return TREE_OPERAND (arg
, 0);
4263 tree arg1
= TREE_OPERAND (arg
, 1);
4264 tree arg2
= TREE_OPERAND (arg
, 2);
4266 loc1
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
4267 loc2
= expr_location_or (TREE_OPERAND (arg
, 2), loc
);
4269 /* A COND_EXPR may have a throw as one operand, which
4270 then has void type. Just leave void operands
4272 return build3_loc (loc
, COND_EXPR
, type
, TREE_OPERAND (arg
, 0),
4273 VOID_TYPE_P (TREE_TYPE (arg1
))
4274 ? arg1
: invert_truthvalue_loc (loc1
, arg1
),
4275 VOID_TYPE_P (TREE_TYPE (arg2
))
4276 ? arg2
: invert_truthvalue_loc (loc2
, arg2
));
4280 loc1
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
4281 return build2_loc (loc
, COMPOUND_EXPR
, type
,
4282 TREE_OPERAND (arg
, 0),
4283 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 1)));
4285 case NON_LVALUE_EXPR
:
4286 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
4287 return invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0));
4290 if (TREE_CODE (TREE_TYPE (arg
)) == BOOLEAN_TYPE
)
4291 return build1_loc (loc
, TRUTH_NOT_EXPR
, type
, arg
);
4296 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
4297 return build1_loc (loc
, TREE_CODE (arg
), type
,
4298 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)));
4301 if (!integer_onep (TREE_OPERAND (arg
, 1)))
4303 return build2_loc (loc
, EQ_EXPR
, type
, arg
, build_int_cst (type
, 0));
4306 return build1_loc (loc
, TRUTH_NOT_EXPR
, type
, arg
);
4308 case CLEANUP_POINT_EXPR
:
4309 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
4310 return build1_loc (loc
, CLEANUP_POINT_EXPR
, type
,
4311 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)));
4318 /* Fold the truth-negation of ARG. This never alters ARG itself. We
4319 assume that ARG is an operation that returns a truth value (0 or 1
4320 for scalars, 0 or -1 for vectors). Return the folded expression if
4321 folding is successful. Otherwise, return NULL_TREE. */
4324 fold_invert_truthvalue (location_t loc
, tree arg
)
4326 tree type
= TREE_TYPE (arg
);
4327 return fold_unary_loc (loc
, VECTOR_TYPE_P (type
)
4333 /* Return a simplified tree node for the truth-negation of ARG. This
4334 never alters ARG itself. We assume that ARG is an operation that
4335 returns a truth value (0 or 1 for scalars, 0 or -1 for vectors). */
4338 invert_truthvalue_loc (location_t loc
, tree arg
)
4340 if (TREE_CODE (arg
) == ERROR_MARK
)
4343 tree type
= TREE_TYPE (arg
);
4344 return fold_build1_loc (loc
, VECTOR_TYPE_P (type
)
4350 /* Return a BIT_FIELD_REF of type TYPE to refer to BITSIZE bits of INNER
4351 starting at BITPOS. The field is unsigned if UNSIGNEDP is nonzero
4352 and uses reverse storage order if REVERSEP is nonzero. ORIG_INNER
4353 is the original memory reference used to preserve the alias set of
4357 make_bit_field_ref (location_t loc
, tree inner
, tree orig_inner
, tree type
,
4358 HOST_WIDE_INT bitsize
, poly_int64 bitpos
,
4359 int unsignedp
, int reversep
)
4361 tree result
, bftype
;
4363 /* Attempt not to lose the access path if possible. */
4364 if (TREE_CODE (orig_inner
) == COMPONENT_REF
)
4366 tree ninner
= TREE_OPERAND (orig_inner
, 0);
4368 poly_int64 nbitsize
, nbitpos
;
4370 int nunsignedp
, nreversep
, nvolatilep
= 0;
4371 tree base
= get_inner_reference (ninner
, &nbitsize
, &nbitpos
,
4372 &noffset
, &nmode
, &nunsignedp
,
4373 &nreversep
, &nvolatilep
);
4375 && noffset
== NULL_TREE
4376 && known_subrange_p (bitpos
, bitsize
, nbitpos
, nbitsize
)
4386 alias_set_type iset
= get_alias_set (orig_inner
);
4387 if (iset
== 0 && get_alias_set (inner
) != iset
)
4388 inner
= fold_build2 (MEM_REF
, TREE_TYPE (inner
),
4389 build_fold_addr_expr (inner
),
4390 build_int_cst (ptr_type_node
, 0));
4392 if (known_eq (bitpos
, 0) && !reversep
)
4394 tree size
= TYPE_SIZE (TREE_TYPE (inner
));
4395 if ((INTEGRAL_TYPE_P (TREE_TYPE (inner
))
4396 || POINTER_TYPE_P (TREE_TYPE (inner
)))
4397 && tree_fits_shwi_p (size
)
4398 && tree_to_shwi (size
) == bitsize
)
4399 return fold_convert_loc (loc
, type
, inner
);
4403 if (TYPE_PRECISION (bftype
) != bitsize
4404 || TYPE_UNSIGNED (bftype
) == !unsignedp
)
4405 bftype
= build_nonstandard_integer_type (bitsize
, 0);
4407 result
= build3_loc (loc
, BIT_FIELD_REF
, bftype
, inner
,
4408 bitsize_int (bitsize
), bitsize_int (bitpos
));
4409 REF_REVERSE_STORAGE_ORDER (result
) = reversep
;
4412 result
= fold_convert_loc (loc
, type
, result
);
4417 /* Optimize a bit-field compare.
4419 There are two cases: First is a compare against a constant and the
4420 second is a comparison of two items where the fields are at the same
4421 bit position relative to the start of a chunk (byte, halfword, word)
4422 large enough to contain it. In these cases we can avoid the shift
4423 implicit in bitfield extractions.
4425 For constants, we emit a compare of the shifted constant with the
4426 BIT_AND_EXPR of a mask and a byte, halfword, or word of the operand being
4427 compared. For two fields at the same position, we do the ANDs with the
4428 similar mask and compare the result of the ANDs.
4430 CODE is the comparison code, known to be either NE_EXPR or EQ_EXPR.
4431 COMPARE_TYPE is the type of the comparison, and LHS and RHS
4432 are the left and right operands of the comparison, respectively.
4434 If the optimization described above can be done, we return the resulting
4435 tree. Otherwise we return zero. */
4438 optimize_bit_field_compare (location_t loc
, enum tree_code code
,
4439 tree compare_type
, tree lhs
, tree rhs
)
4441 poly_int64 plbitpos
, plbitsize
, rbitpos
, rbitsize
;
4442 HOST_WIDE_INT lbitpos
, lbitsize
, nbitpos
, nbitsize
;
4443 tree type
= TREE_TYPE (lhs
);
4445 int const_p
= TREE_CODE (rhs
) == INTEGER_CST
;
4446 machine_mode lmode
, rmode
;
4447 scalar_int_mode nmode
;
4448 int lunsignedp
, runsignedp
;
4449 int lreversep
, rreversep
;
4450 int lvolatilep
= 0, rvolatilep
= 0;
4451 tree linner
, rinner
= NULL_TREE
;
4455 /* Get all the information about the extractions being done. If the bit size
4456 is the same as the size of the underlying object, we aren't doing an
4457 extraction at all and so can do nothing. We also don't want to
4458 do anything if the inner expression is a PLACEHOLDER_EXPR since we
4459 then will no longer be able to replace it. */
4460 linner
= get_inner_reference (lhs
, &plbitsize
, &plbitpos
, &offset
, &lmode
,
4461 &lunsignedp
, &lreversep
, &lvolatilep
);
4463 || !known_size_p (plbitsize
)
4464 || !plbitsize
.is_constant (&lbitsize
)
4465 || !plbitpos
.is_constant (&lbitpos
)
4466 || known_eq (lbitsize
, GET_MODE_BITSIZE (lmode
))
4468 || TREE_CODE (linner
) == PLACEHOLDER_EXPR
4473 rreversep
= lreversep
;
4476 /* If this is not a constant, we can only do something if bit positions,
4477 sizes, signedness and storage order are the same. */
4479 = get_inner_reference (rhs
, &rbitsize
, &rbitpos
, &offset
, &rmode
,
4480 &runsignedp
, &rreversep
, &rvolatilep
);
4483 || maybe_ne (lbitpos
, rbitpos
)
4484 || maybe_ne (lbitsize
, rbitsize
)
4485 || lunsignedp
!= runsignedp
4486 || lreversep
!= rreversep
4488 || TREE_CODE (rinner
) == PLACEHOLDER_EXPR
4493 /* Honor the C++ memory model and mimic what RTL expansion does. */
4494 poly_uint64 bitstart
= 0;
4495 poly_uint64 bitend
= 0;
4496 if (TREE_CODE (lhs
) == COMPONENT_REF
)
4498 get_bit_range (&bitstart
, &bitend
, lhs
, &plbitpos
, &offset
);
4499 if (!plbitpos
.is_constant (&lbitpos
) || offset
!= NULL_TREE
)
4503 /* See if we can find a mode to refer to this field. We should be able to,
4504 but fail if we can't. */
4505 if (!get_best_mode (lbitsize
, lbitpos
, bitstart
, bitend
,
4506 const_p
? TYPE_ALIGN (TREE_TYPE (linner
))
4507 : MIN (TYPE_ALIGN (TREE_TYPE (linner
)),
4508 TYPE_ALIGN (TREE_TYPE (rinner
))),
4509 BITS_PER_WORD
, false, &nmode
))
4512 /* Set signed and unsigned types of the precision of this mode for the
4514 unsigned_type
= lang_hooks
.types
.type_for_mode (nmode
, 1);
4516 /* Compute the bit position and size for the new reference and our offset
4517 within it. If the new reference is the same size as the original, we
4518 won't optimize anything, so return zero. */
4519 nbitsize
= GET_MODE_BITSIZE (nmode
);
4520 nbitpos
= lbitpos
& ~ (nbitsize
- 1);
4522 if (nbitsize
== lbitsize
)
4525 if (lreversep
? !BYTES_BIG_ENDIAN
: BYTES_BIG_ENDIAN
)
4526 lbitpos
= nbitsize
- lbitsize
- lbitpos
;
4528 /* Make the mask to be used against the extracted field. */
4529 mask
= build_int_cst_type (unsigned_type
, -1);
4530 mask
= const_binop (LSHIFT_EXPR
, mask
, size_int (nbitsize
- lbitsize
));
4531 mask
= const_binop (RSHIFT_EXPR
, mask
,
4532 size_int (nbitsize
- lbitsize
- lbitpos
));
4539 /* If not comparing with constant, just rework the comparison
4541 tree t1
= make_bit_field_ref (loc
, linner
, lhs
, unsigned_type
,
4542 nbitsize
, nbitpos
, 1, lreversep
);
4543 t1
= fold_build2_loc (loc
, BIT_AND_EXPR
, unsigned_type
, t1
, mask
);
4544 tree t2
= make_bit_field_ref (loc
, rinner
, rhs
, unsigned_type
,
4545 nbitsize
, nbitpos
, 1, rreversep
);
4546 t2
= fold_build2_loc (loc
, BIT_AND_EXPR
, unsigned_type
, t2
, mask
);
4547 return fold_build2_loc (loc
, code
, compare_type
, t1
, t2
);
4550 /* Otherwise, we are handling the constant case. See if the constant is too
4551 big for the field. Warn and return a tree for 0 (false) if so. We do
4552 this not only for its own sake, but to avoid having to test for this
4553 error case below. If we didn't, we might generate wrong code.
4555 For unsigned fields, the constant shifted right by the field length should
4556 be all zero. For signed fields, the high-order bits should agree with
4561 if (wi::lrshift (wi::to_wide (rhs
), lbitsize
) != 0)
4563 warning (0, "comparison is always %d due to width of bit-field",
4565 return constant_boolean_node (code
== NE_EXPR
, compare_type
);
4570 wide_int tem
= wi::arshift (wi::to_wide (rhs
), lbitsize
- 1);
4571 if (tem
!= 0 && tem
!= -1)
4573 warning (0, "comparison is always %d due to width of bit-field",
4575 return constant_boolean_node (code
== NE_EXPR
, compare_type
);
4582 /* Single-bit compares should always be against zero. */
4583 if (lbitsize
== 1 && ! integer_zerop (rhs
))
4585 code
= code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
;
4586 rhs
= build_int_cst (type
, 0);
4589 /* Make a new bitfield reference, shift the constant over the
4590 appropriate number of bits and mask it with the computed mask
4591 (in case this was a signed field). If we changed it, make a new one. */
4592 lhs
= make_bit_field_ref (loc
, linner
, lhs
, unsigned_type
,
4593 nbitsize
, nbitpos
, 1, lreversep
);
4595 rhs
= const_binop (BIT_AND_EXPR
,
4596 const_binop (LSHIFT_EXPR
,
4597 fold_convert_loc (loc
, unsigned_type
, rhs
),
4598 size_int (lbitpos
)),
4601 lhs
= build2_loc (loc
, code
, compare_type
,
4602 build2 (BIT_AND_EXPR
, unsigned_type
, lhs
, mask
), rhs
);
4606 /* Subroutine for fold_truth_andor_1: decode a field reference.
4608 If EXP is a comparison reference, we return the innermost reference.
4610 *PBITSIZE is set to the number of bits in the reference, *PBITPOS is
4611 set to the starting bit number.
4613 If the innermost field can be completely contained in a mode-sized
4614 unit, *PMODE is set to that mode. Otherwise, it is set to VOIDmode.
4616 *PVOLATILEP is set to 1 if the any expression encountered is volatile;
4617 otherwise it is not changed.
4619 *PUNSIGNEDP is set to the signedness of the field.
4621 *PREVERSEP is set to the storage order of the field.
4623 *PMASK is set to the mask used. This is either contained in a
4624 BIT_AND_EXPR or derived from the width of the field.
4626 *PAND_MASK is set to the mask found in a BIT_AND_EXPR, if any.
4628 Return 0 if this is not a component reference or is one that we can't
4629 do anything with. */
4632 decode_field_reference (location_t loc
, tree
*exp_
, HOST_WIDE_INT
*pbitsize
,
4633 HOST_WIDE_INT
*pbitpos
, machine_mode
*pmode
,
4634 int *punsignedp
, int *preversep
, int *pvolatilep
,
4635 tree
*pmask
, tree
*pand_mask
)
4638 tree outer_type
= 0;
4640 tree mask
, inner
, offset
;
4642 unsigned int precision
;
4644 /* All the optimizations using this function assume integer fields.
4645 There are problems with FP fields since the type_for_size call
4646 below can fail for, e.g., XFmode. */
4647 if (! INTEGRAL_TYPE_P (TREE_TYPE (exp
)))
4650 /* We are interested in the bare arrangement of bits, so strip everything
4651 that doesn't affect the machine mode. However, record the type of the
4652 outermost expression if it may matter below. */
4653 if (CONVERT_EXPR_P (exp
)
4654 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4655 outer_type
= TREE_TYPE (exp
);
4658 if (TREE_CODE (exp
) == BIT_AND_EXPR
)
4660 and_mask
= TREE_OPERAND (exp
, 1);
4661 exp
= TREE_OPERAND (exp
, 0);
4662 STRIP_NOPS (exp
); STRIP_NOPS (and_mask
);
4663 if (TREE_CODE (and_mask
) != INTEGER_CST
)
4667 poly_int64 poly_bitsize
, poly_bitpos
;
4668 inner
= get_inner_reference (exp
, &poly_bitsize
, &poly_bitpos
, &offset
,
4669 pmode
, punsignedp
, preversep
, pvolatilep
);
4670 if ((inner
== exp
&& and_mask
== 0)
4671 || !poly_bitsize
.is_constant (pbitsize
)
4672 || !poly_bitpos
.is_constant (pbitpos
)
4675 || TREE_CODE (inner
) == PLACEHOLDER_EXPR
4676 /* Reject out-of-bound accesses (PR79731). */
4677 || (! AGGREGATE_TYPE_P (TREE_TYPE (inner
))
4678 && compare_tree_int (TYPE_SIZE (TREE_TYPE (inner
)),
4679 *pbitpos
+ *pbitsize
) < 0))
4682 unsigned_type
= lang_hooks
.types
.type_for_size (*pbitsize
, 1);
4683 if (unsigned_type
== NULL_TREE
)
4688 /* If the number of bits in the reference is the same as the bitsize of
4689 the outer type, then the outer type gives the signedness. Otherwise
4690 (in case of a small bitfield) the signedness is unchanged. */
4691 if (outer_type
&& *pbitsize
== TYPE_PRECISION (outer_type
))
4692 *punsignedp
= TYPE_UNSIGNED (outer_type
);
4694 /* Compute the mask to access the bitfield. */
4695 precision
= TYPE_PRECISION (unsigned_type
);
4697 mask
= build_int_cst_type (unsigned_type
, -1);
4699 mask
= const_binop (LSHIFT_EXPR
, mask
, size_int (precision
- *pbitsize
));
4700 mask
= const_binop (RSHIFT_EXPR
, mask
, size_int (precision
- *pbitsize
));
4702 /* Merge it with the mask we found in the BIT_AND_EXPR, if any. */
4704 mask
= fold_build2_loc (loc
, BIT_AND_EXPR
, unsigned_type
,
4705 fold_convert_loc (loc
, unsigned_type
, and_mask
), mask
);
4708 *pand_mask
= and_mask
;
4712 /* Return nonzero if MASK represents a mask of SIZE ones in the low-order
4713 bit positions and MASK is SIGNED. */
4716 all_ones_mask_p (const_tree mask
, unsigned int size
)
4718 tree type
= TREE_TYPE (mask
);
4719 unsigned int precision
= TYPE_PRECISION (type
);
4721 /* If this function returns true when the type of the mask is
4722 UNSIGNED, then there will be errors. In particular see
4723 gcc.c-torture/execute/990326-1.c. There does not appear to be
4724 any documentation paper trail as to why this is so. But the pre
4725 wide-int worked with that restriction and it has been preserved
4727 if (size
> precision
|| TYPE_SIGN (type
) == UNSIGNED
)
4730 return wi::mask (size
, false, precision
) == wi::to_wide (mask
);
4733 /* Subroutine for fold: determine if VAL is the INTEGER_CONST that
4734 represents the sign bit of EXP's type. If EXP represents a sign
4735 or zero extension, also test VAL against the unextended type.
4736 The return value is the (sub)expression whose sign bit is VAL,
4737 or NULL_TREE otherwise. */
4740 sign_bit_p (tree exp
, const_tree val
)
4745 /* Tree EXP must have an integral type. */
4746 t
= TREE_TYPE (exp
);
4747 if (! INTEGRAL_TYPE_P (t
))
4750 /* Tree VAL must be an integer constant. */
4751 if (TREE_CODE (val
) != INTEGER_CST
4752 || TREE_OVERFLOW (val
))
4755 width
= TYPE_PRECISION (t
);
4756 if (wi::only_sign_bit_p (wi::to_wide (val
), width
))
4759 /* Handle extension from a narrower type. */
4760 if (TREE_CODE (exp
) == NOP_EXPR
4761 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp
, 0))) < width
)
4762 return sign_bit_p (TREE_OPERAND (exp
, 0), val
);
4767 /* Subroutine for fold_truth_andor_1: determine if an operand is simple enough
4768 to be evaluated unconditionally. */
4771 simple_operand_p (const_tree exp
)
4773 /* Strip any conversions that don't change the machine mode. */
4776 return (CONSTANT_CLASS_P (exp
)
4777 || TREE_CODE (exp
) == SSA_NAME
4779 && ! TREE_ADDRESSABLE (exp
)
4780 && ! TREE_THIS_VOLATILE (exp
)
4781 && ! DECL_NONLOCAL (exp
)
4782 /* Don't regard global variables as simple. They may be
4783 allocated in ways unknown to the compiler (shared memory,
4784 #pragma weak, etc). */
4785 && ! TREE_PUBLIC (exp
)
4786 && ! DECL_EXTERNAL (exp
)
4787 /* Weakrefs are not safe to be read, since they can be NULL.
4788 They are !TREE_PUBLIC && !DECL_EXTERNAL but still
4789 have DECL_WEAK flag set. */
4790 && (! VAR_OR_FUNCTION_DECL_P (exp
) || ! DECL_WEAK (exp
))
4791 /* Loading a static variable is unduly expensive, but global
4792 registers aren't expensive. */
4793 && (! TREE_STATIC (exp
) || DECL_REGISTER (exp
))));
4796 /* Subroutine for fold_truth_andor: determine if an operand is simple enough
4797 to be evaluated unconditionally.
4798 I addition to simple_operand_p, we assume that comparisons, conversions,
4799 and logic-not operations are simple, if their operands are simple, too. */
4802 simple_operand_p_2 (tree exp
)
4804 enum tree_code code
;
4806 if (TREE_SIDE_EFFECTS (exp
) || generic_expr_could_trap_p (exp
))
4809 while (CONVERT_EXPR_P (exp
))
4810 exp
= TREE_OPERAND (exp
, 0);
4812 code
= TREE_CODE (exp
);
4814 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
4815 return (simple_operand_p (TREE_OPERAND (exp
, 0))
4816 && simple_operand_p (TREE_OPERAND (exp
, 1)));
4818 if (code
== TRUTH_NOT_EXPR
)
4819 return simple_operand_p_2 (TREE_OPERAND (exp
, 0));
4821 return simple_operand_p (exp
);
4825 /* The following functions are subroutines to fold_range_test and allow it to
4826 try to change a logical combination of comparisons into a range test.
4829 X == 2 || X == 3 || X == 4 || X == 5
4833 (unsigned) (X - 2) <= 3
4835 We describe each set of comparisons as being either inside or outside
4836 a range, using a variable named like IN_P, and then describe the
4837 range with a lower and upper bound. If one of the bounds is omitted,
4838 it represents either the highest or lowest value of the type.
4840 In the comments below, we represent a range by two numbers in brackets
4841 preceded by a "+" to designate being inside that range, or a "-" to
4842 designate being outside that range, so the condition can be inverted by
4843 flipping the prefix. An omitted bound is represented by a "-". For
4844 example, "- [-, 10]" means being outside the range starting at the lowest
4845 possible value and ending at 10, in other words, being greater than 10.
4846 The range "+ [-, -]" is always true and hence the range "- [-, -]" is
4849 We set up things so that the missing bounds are handled in a consistent
4850 manner so neither a missing bound nor "true" and "false" need to be
4851 handled using a special case. */
4853 /* Return the result of applying CODE to ARG0 and ARG1, but handle the case
4854 of ARG0 and/or ARG1 being omitted, meaning an unlimited range. UPPER0_P
4855 and UPPER1_P are nonzero if the respective argument is an upper bound
4856 and zero for a lower. TYPE, if nonzero, is the type of the result; it
4857 must be specified for a comparison. ARG1 will be converted to ARG0's
4858 type if both are specified. */
4861 range_binop (enum tree_code code
, tree type
, tree arg0
, int upper0_p
,
4862 tree arg1
, int upper1_p
)
4868 /* If neither arg represents infinity, do the normal operation.
4869 Else, if not a comparison, return infinity. Else handle the special
4870 comparison rules. Note that most of the cases below won't occur, but
4871 are handled for consistency. */
4873 if (arg0
!= 0 && arg1
!= 0)
4875 tem
= fold_build2 (code
, type
!= 0 ? type
: TREE_TYPE (arg0
),
4876 arg0
, fold_convert (TREE_TYPE (arg0
), arg1
));
4878 return TREE_CODE (tem
) == INTEGER_CST
? tem
: 0;
4881 if (TREE_CODE_CLASS (code
) != tcc_comparison
)
4884 /* Set SGN[01] to -1 if ARG[01] is a lower bound, 1 for upper, and 0
4885 for neither. In real maths, we cannot assume open ended ranges are
4886 the same. But, this is computer arithmetic, where numbers are finite.
4887 We can therefore make the transformation of any unbounded range with
4888 the value Z, Z being greater than any representable number. This permits
4889 us to treat unbounded ranges as equal. */
4890 sgn0
= arg0
!= 0 ? 0 : (upper0_p
? 1 : -1);
4891 sgn1
= arg1
!= 0 ? 0 : (upper1_p
? 1 : -1);
4895 result
= sgn0
== sgn1
;
4898 result
= sgn0
!= sgn1
;
4901 result
= sgn0
< sgn1
;
4904 result
= sgn0
<= sgn1
;
4907 result
= sgn0
> sgn1
;
4910 result
= sgn0
>= sgn1
;
4916 return constant_boolean_node (result
, type
);
4919 /* Helper routine for make_range. Perform one step for it, return
4920 new expression if the loop should continue or NULL_TREE if it should
4924 make_range_step (location_t loc
, enum tree_code code
, tree arg0
, tree arg1
,
4925 tree exp_type
, tree
*p_low
, tree
*p_high
, int *p_in_p
,
4926 bool *strict_overflow_p
)
4928 tree arg0_type
= TREE_TYPE (arg0
);
4929 tree n_low
, n_high
, low
= *p_low
, high
= *p_high
;
4930 int in_p
= *p_in_p
, n_in_p
;
4934 case TRUTH_NOT_EXPR
:
4935 /* We can only do something if the range is testing for zero. */
4936 if (low
== NULL_TREE
|| high
== NULL_TREE
4937 || ! integer_zerop (low
) || ! integer_zerop (high
))
4942 case EQ_EXPR
: case NE_EXPR
:
4943 case LT_EXPR
: case LE_EXPR
: case GE_EXPR
: case GT_EXPR
:
4944 /* We can only do something if the range is testing for zero
4945 and if the second operand is an integer constant. Note that
4946 saying something is "in" the range we make is done by
4947 complementing IN_P since it will set in the initial case of
4948 being not equal to zero; "out" is leaving it alone. */
4949 if (low
== NULL_TREE
|| high
== NULL_TREE
4950 || ! integer_zerop (low
) || ! integer_zerop (high
)
4951 || TREE_CODE (arg1
) != INTEGER_CST
)
4956 case NE_EXPR
: /* - [c, c] */
4959 case EQ_EXPR
: /* + [c, c] */
4960 in_p
= ! in_p
, low
= high
= arg1
;
4962 case GT_EXPR
: /* - [-, c] */
4963 low
= 0, high
= arg1
;
4965 case GE_EXPR
: /* + [c, -] */
4966 in_p
= ! in_p
, low
= arg1
, high
= 0;
4968 case LT_EXPR
: /* - [c, -] */
4969 low
= arg1
, high
= 0;
4971 case LE_EXPR
: /* + [-, c] */
4972 in_p
= ! in_p
, low
= 0, high
= arg1
;
4978 /* If this is an unsigned comparison, we also know that EXP is
4979 greater than or equal to zero. We base the range tests we make
4980 on that fact, so we record it here so we can parse existing
4981 range tests. We test arg0_type since often the return type
4982 of, e.g. EQ_EXPR, is boolean. */
4983 if (TYPE_UNSIGNED (arg0_type
) && (low
== 0 || high
== 0))
4985 if (! merge_ranges (&n_in_p
, &n_low
, &n_high
,
4987 build_int_cst (arg0_type
, 0),
4991 in_p
= n_in_p
, low
= n_low
, high
= n_high
;
4993 /* If the high bound is missing, but we have a nonzero low
4994 bound, reverse the range so it goes from zero to the low bound
4996 if (high
== 0 && low
&& ! integer_zerop (low
))
4999 high
= range_binop (MINUS_EXPR
, NULL_TREE
, low
, 0,
5000 build_int_cst (TREE_TYPE (low
), 1), 0);
5001 low
= build_int_cst (arg0_type
, 0);
5011 /* If flag_wrapv and ARG0_TYPE is signed, make sure
5012 low and high are non-NULL, then normalize will DTRT. */
5013 if (!TYPE_UNSIGNED (arg0_type
)
5014 && !TYPE_OVERFLOW_UNDEFINED (arg0_type
))
5016 if (low
== NULL_TREE
)
5017 low
= TYPE_MIN_VALUE (arg0_type
);
5018 if (high
== NULL_TREE
)
5019 high
= TYPE_MAX_VALUE (arg0_type
);
5022 /* (-x) IN [a,b] -> x in [-b, -a] */
5023 n_low
= range_binop (MINUS_EXPR
, exp_type
,
5024 build_int_cst (exp_type
, 0),
5026 n_high
= range_binop (MINUS_EXPR
, exp_type
,
5027 build_int_cst (exp_type
, 0),
5029 if (n_high
!= 0 && TREE_OVERFLOW (n_high
))
5035 return build2_loc (loc
, MINUS_EXPR
, exp_type
, negate_expr (arg0
),
5036 build_int_cst (exp_type
, 1));
5040 if (TREE_CODE (arg1
) != INTEGER_CST
)
5043 /* If flag_wrapv and ARG0_TYPE is signed, then we cannot
5044 move a constant to the other side. */
5045 if (!TYPE_UNSIGNED (arg0_type
)
5046 && !TYPE_OVERFLOW_UNDEFINED (arg0_type
))
5049 /* If EXP is signed, any overflow in the computation is undefined,
5050 so we don't worry about it so long as our computations on
5051 the bounds don't overflow. For unsigned, overflow is defined
5052 and this is exactly the right thing. */
5053 n_low
= range_binop (code
== MINUS_EXPR
? PLUS_EXPR
: MINUS_EXPR
,
5054 arg0_type
, low
, 0, arg1
, 0);
5055 n_high
= range_binop (code
== MINUS_EXPR
? PLUS_EXPR
: MINUS_EXPR
,
5056 arg0_type
, high
, 1, arg1
, 0);
5057 if ((n_low
!= 0 && TREE_OVERFLOW (n_low
))
5058 || (n_high
!= 0 && TREE_OVERFLOW (n_high
)))
5061 if (TYPE_OVERFLOW_UNDEFINED (arg0_type
))
5062 *strict_overflow_p
= true;
5065 /* Check for an unsigned range which has wrapped around the maximum
5066 value thus making n_high < n_low, and normalize it. */
5067 if (n_low
&& n_high
&& tree_int_cst_lt (n_high
, n_low
))
5069 low
= range_binop (PLUS_EXPR
, arg0_type
, n_high
, 0,
5070 build_int_cst (TREE_TYPE (n_high
), 1), 0);
5071 high
= range_binop (MINUS_EXPR
, arg0_type
, n_low
, 0,
5072 build_int_cst (TREE_TYPE (n_low
), 1), 0);
5074 /* If the range is of the form +/- [ x+1, x ], we won't
5075 be able to normalize it. But then, it represents the
5076 whole range or the empty set, so make it
5078 if (tree_int_cst_equal (n_low
, low
)
5079 && tree_int_cst_equal (n_high
, high
))
5085 low
= n_low
, high
= n_high
;
5093 case NON_LVALUE_EXPR
:
5094 if (TYPE_PRECISION (arg0_type
) > TYPE_PRECISION (exp_type
))
5097 if (! INTEGRAL_TYPE_P (arg0_type
)
5098 || (low
!= 0 && ! int_fits_type_p (low
, arg0_type
))
5099 || (high
!= 0 && ! int_fits_type_p (high
, arg0_type
)))
5102 n_low
= low
, n_high
= high
;
5105 n_low
= fold_convert_loc (loc
, arg0_type
, n_low
);
5108 n_high
= fold_convert_loc (loc
, arg0_type
, n_high
);
5110 /* If we're converting arg0 from an unsigned type, to exp,
5111 a signed type, we will be doing the comparison as unsigned.
5112 The tests above have already verified that LOW and HIGH
5115 So we have to ensure that we will handle large unsigned
5116 values the same way that the current signed bounds treat
5119 if (!TYPE_UNSIGNED (exp_type
) && TYPE_UNSIGNED (arg0_type
))
5123 /* For fixed-point modes, we need to pass the saturating flag
5124 as the 2nd parameter. */
5125 if (ALL_FIXED_POINT_MODE_P (TYPE_MODE (arg0_type
)))
5127 = lang_hooks
.types
.type_for_mode (TYPE_MODE (arg0_type
),
5128 TYPE_SATURATING (arg0_type
));
5131 = lang_hooks
.types
.type_for_mode (TYPE_MODE (arg0_type
), 1);
5133 /* A range without an upper bound is, naturally, unbounded.
5134 Since convert would have cropped a very large value, use
5135 the max value for the destination type. */
5137 = TYPE_MAX_VALUE (equiv_type
) ? TYPE_MAX_VALUE (equiv_type
)
5138 : TYPE_MAX_VALUE (arg0_type
);
5140 if (TYPE_PRECISION (exp_type
) == TYPE_PRECISION (arg0_type
))
5141 high_positive
= fold_build2_loc (loc
, RSHIFT_EXPR
, arg0_type
,
5142 fold_convert_loc (loc
, arg0_type
,
5144 build_int_cst (arg0_type
, 1));
5146 /* If the low bound is specified, "and" the range with the
5147 range for which the original unsigned value will be
5151 if (! merge_ranges (&n_in_p
, &n_low
, &n_high
, 1, n_low
, n_high
,
5152 1, fold_convert_loc (loc
, arg0_type
,
5157 in_p
= (n_in_p
== in_p
);
5161 /* Otherwise, "or" the range with the range of the input
5162 that will be interpreted as negative. */
5163 if (! merge_ranges (&n_in_p
, &n_low
, &n_high
, 0, n_low
, n_high
,
5164 1, fold_convert_loc (loc
, arg0_type
,
5169 in_p
= (in_p
!= n_in_p
);
5183 /* Given EXP, a logical expression, set the range it is testing into
5184 variables denoted by PIN_P, PLOW, and PHIGH. Return the expression
5185 actually being tested. *PLOW and *PHIGH will be made of the same
5186 type as the returned expression. If EXP is not a comparison, we
5187 will most likely not be returning a useful value and range. Set
5188 *STRICT_OVERFLOW_P to true if the return value is only valid
5189 because signed overflow is undefined; otherwise, do not change
5190 *STRICT_OVERFLOW_P. */
5193 make_range (tree exp
, int *pin_p
, tree
*plow
, tree
*phigh
,
5194 bool *strict_overflow_p
)
5196 enum tree_code code
;
5197 tree arg0
, arg1
= NULL_TREE
;
5198 tree exp_type
, nexp
;
5201 location_t loc
= EXPR_LOCATION (exp
);
5203 /* Start with simply saying "EXP != 0" and then look at the code of EXP
5204 and see if we can refine the range. Some of the cases below may not
5205 happen, but it doesn't seem worth worrying about this. We "continue"
5206 the outer loop when we've changed something; otherwise we "break"
5207 the switch, which will "break" the while. */
5210 low
= high
= build_int_cst (TREE_TYPE (exp
), 0);
5214 code
= TREE_CODE (exp
);
5215 exp_type
= TREE_TYPE (exp
);
5218 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
5220 if (TREE_OPERAND_LENGTH (exp
) > 0)
5221 arg0
= TREE_OPERAND (exp
, 0);
5222 if (TREE_CODE_CLASS (code
) == tcc_binary
5223 || TREE_CODE_CLASS (code
) == tcc_comparison
5224 || (TREE_CODE_CLASS (code
) == tcc_expression
5225 && TREE_OPERAND_LENGTH (exp
) > 1))
5226 arg1
= TREE_OPERAND (exp
, 1);
5228 if (arg0
== NULL_TREE
)
5231 nexp
= make_range_step (loc
, code
, arg0
, arg1
, exp_type
, &low
,
5232 &high
, &in_p
, strict_overflow_p
);
5233 if (nexp
== NULL_TREE
)
5238 /* If EXP is a constant, we can evaluate whether this is true or false. */
5239 if (TREE_CODE (exp
) == INTEGER_CST
)
5241 in_p
= in_p
== (integer_onep (range_binop (GE_EXPR
, integer_type_node
,
5243 && integer_onep (range_binop (LE_EXPR
, integer_type_node
,
5249 *pin_p
= in_p
, *plow
= low
, *phigh
= high
;
5253 /* Returns TRUE if [LOW, HIGH] range check can be optimized to
5254 a bitwise check i.e. when
5255 LOW == 0xXX...X00...0
5256 HIGH == 0xXX...X11...1
5257 Return corresponding mask in MASK and stem in VALUE. */
5260 maskable_range_p (const_tree low
, const_tree high
, tree type
, tree
*mask
,
5263 if (TREE_CODE (low
) != INTEGER_CST
5264 || TREE_CODE (high
) != INTEGER_CST
)
5267 unsigned prec
= TYPE_PRECISION (type
);
5268 wide_int lo
= wi::to_wide (low
, prec
);
5269 wide_int hi
= wi::to_wide (high
, prec
);
5271 wide_int end_mask
= lo
^ hi
;
5272 if ((end_mask
& (end_mask
+ 1)) != 0
5273 || (lo
& end_mask
) != 0)
5276 wide_int stem_mask
= ~end_mask
;
5277 wide_int stem
= lo
& stem_mask
;
5278 if (stem
!= (hi
& stem_mask
))
5281 *mask
= wide_int_to_tree (type
, stem_mask
);
5282 *value
= wide_int_to_tree (type
, stem
);
5287 /* Helper routine for build_range_check and match.pd. Return the type to
5288 perform the check or NULL if it shouldn't be optimized. */
5291 range_check_type (tree etype
)
5293 /* First make sure that arithmetics in this type is valid, then make sure
5294 that it wraps around. */
5295 if (TREE_CODE (etype
) == ENUMERAL_TYPE
|| TREE_CODE (etype
) == BOOLEAN_TYPE
)
5296 etype
= lang_hooks
.types
.type_for_size (TYPE_PRECISION (etype
), 1);
5298 if (TREE_CODE (etype
) == INTEGER_TYPE
&& !TYPE_UNSIGNED (etype
))
5300 tree utype
, minv
, maxv
;
5302 /* Check if (unsigned) INT_MAX + 1 == (unsigned) INT_MIN
5303 for the type in question, as we rely on this here. */
5304 utype
= unsigned_type_for (etype
);
5305 maxv
= fold_convert (utype
, TYPE_MAX_VALUE (etype
));
5306 maxv
= range_binop (PLUS_EXPR
, NULL_TREE
, maxv
, 1,
5307 build_int_cst (TREE_TYPE (maxv
), 1), 1);
5308 minv
= fold_convert (utype
, TYPE_MIN_VALUE (etype
));
5310 if (integer_zerop (range_binop (NE_EXPR
, integer_type_node
,
5316 else if (POINTER_TYPE_P (etype
))
5317 etype
= unsigned_type_for (etype
);
5321 /* Given a range, LOW, HIGH, and IN_P, an expression, EXP, and a result
5322 type, TYPE, return an expression to test if EXP is in (or out of, depending
5323 on IN_P) the range. Return 0 if the test couldn't be created. */
5326 build_range_check (location_t loc
, tree type
, tree exp
, int in_p
,
5327 tree low
, tree high
)
5329 tree etype
= TREE_TYPE (exp
), mask
, value
;
5331 /* Disable this optimization for function pointer expressions
5332 on targets that require function pointer canonicalization. */
5333 if (targetm
.have_canonicalize_funcptr_for_compare ()
5334 && POINTER_TYPE_P (etype
)
5335 && FUNC_OR_METHOD_TYPE_P (TREE_TYPE (etype
)))
5340 value
= build_range_check (loc
, type
, exp
, 1, low
, high
);
5342 return invert_truthvalue_loc (loc
, value
);
5347 if (low
== 0 && high
== 0)
5348 return omit_one_operand_loc (loc
, type
, build_int_cst (type
, 1), exp
);
5351 return fold_build2_loc (loc
, LE_EXPR
, type
, exp
,
5352 fold_convert_loc (loc
, etype
, high
));
5355 return fold_build2_loc (loc
, GE_EXPR
, type
, exp
,
5356 fold_convert_loc (loc
, etype
, low
));
5358 if (operand_equal_p (low
, high
, 0))
5359 return fold_build2_loc (loc
, EQ_EXPR
, type
, exp
,
5360 fold_convert_loc (loc
, etype
, low
));
5362 if (TREE_CODE (exp
) == BIT_AND_EXPR
5363 && maskable_range_p (low
, high
, etype
, &mask
, &value
))
5364 return fold_build2_loc (loc
, EQ_EXPR
, type
,
5365 fold_build2_loc (loc
, BIT_AND_EXPR
, etype
,
5369 if (integer_zerop (low
))
5371 if (! TYPE_UNSIGNED (etype
))
5373 etype
= unsigned_type_for (etype
);
5374 high
= fold_convert_loc (loc
, etype
, high
);
5375 exp
= fold_convert_loc (loc
, etype
, exp
);
5377 return build_range_check (loc
, type
, exp
, 1, 0, high
);
5380 /* Optimize (c>=1) && (c<=127) into (signed char)c > 0. */
5381 if (integer_onep (low
) && TREE_CODE (high
) == INTEGER_CST
)
5383 int prec
= TYPE_PRECISION (etype
);
5385 if (wi::mask
<widest_int
> (prec
- 1, false) == wi::to_widest (high
))
5387 if (TYPE_UNSIGNED (etype
))
5389 tree signed_etype
= signed_type_for (etype
);
5390 if (TYPE_PRECISION (signed_etype
) != TYPE_PRECISION (etype
))
5392 = build_nonstandard_integer_type (TYPE_PRECISION (etype
), 0);
5394 etype
= signed_etype
;
5395 exp
= fold_convert_loc (loc
, etype
, exp
);
5397 return fold_build2_loc (loc
, GT_EXPR
, type
, exp
,
5398 build_int_cst (etype
, 0));
5402 /* Optimize (c>=low) && (c<=high) into (c-low>=0) && (c-low<=high-low).
5403 This requires wrap-around arithmetics for the type of the expression. */
5404 etype
= range_check_type (etype
);
5405 if (etype
== NULL_TREE
)
5408 high
= fold_convert_loc (loc
, etype
, high
);
5409 low
= fold_convert_loc (loc
, etype
, low
);
5410 exp
= fold_convert_loc (loc
, etype
, exp
);
5412 value
= const_binop (MINUS_EXPR
, high
, low
);
5414 if (value
!= 0 && !TREE_OVERFLOW (value
))
5415 return build_range_check (loc
, type
,
5416 fold_build2_loc (loc
, MINUS_EXPR
, etype
, exp
, low
),
5417 1, build_int_cst (etype
, 0), value
);
5422 /* Return the predecessor of VAL in its type, handling the infinite case. */
5425 range_predecessor (tree val
)
5427 tree type
= TREE_TYPE (val
);
5429 if (INTEGRAL_TYPE_P (type
)
5430 && operand_equal_p (val
, TYPE_MIN_VALUE (type
), 0))
5433 return range_binop (MINUS_EXPR
, NULL_TREE
, val
, 0,
5434 build_int_cst (TREE_TYPE (val
), 1), 0);
5437 /* Return the successor of VAL in its type, handling the infinite case. */
5440 range_successor (tree val
)
5442 tree type
= TREE_TYPE (val
);
5444 if (INTEGRAL_TYPE_P (type
)
5445 && operand_equal_p (val
, TYPE_MAX_VALUE (type
), 0))
5448 return range_binop (PLUS_EXPR
, NULL_TREE
, val
, 0,
5449 build_int_cst (TREE_TYPE (val
), 1), 0);
5452 /* Given two ranges, see if we can merge them into one. Return 1 if we
5453 can, 0 if we can't. Set the output range into the specified parameters. */
5456 merge_ranges (int *pin_p
, tree
*plow
, tree
*phigh
, int in0_p
, tree low0
,
5457 tree high0
, int in1_p
, tree low1
, tree high1
)
5465 int lowequal
= ((low0
== 0 && low1
== 0)
5466 || integer_onep (range_binop (EQ_EXPR
, integer_type_node
,
5467 low0
, 0, low1
, 0)));
5468 int highequal
= ((high0
== 0 && high1
== 0)
5469 || integer_onep (range_binop (EQ_EXPR
, integer_type_node
,
5470 high0
, 1, high1
, 1)));
5472 /* Make range 0 be the range that starts first, or ends last if they
5473 start at the same value. Swap them if it isn't. */
5474 if (integer_onep (range_binop (GT_EXPR
, integer_type_node
,
5477 && integer_onep (range_binop (GT_EXPR
, integer_type_node
,
5478 high1
, 1, high0
, 1))))
5480 temp
= in0_p
, in0_p
= in1_p
, in1_p
= temp
;
5481 tem
= low0
, low0
= low1
, low1
= tem
;
5482 tem
= high0
, high0
= high1
, high1
= tem
;
5485 /* If the second range is != high1 where high1 is the type maximum of
5486 the type, try first merging with < high1 range. */
5489 && TREE_CODE (low1
) == INTEGER_CST
5490 && (TREE_CODE (TREE_TYPE (low1
)) == INTEGER_TYPE
5491 || (TREE_CODE (TREE_TYPE (low1
)) == ENUMERAL_TYPE
5492 && known_eq (TYPE_PRECISION (TREE_TYPE (low1
)),
5493 GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (low1
))))))
5494 && operand_equal_p (low1
, high1
, 0))
5496 if (tree_int_cst_equal (low1
, TYPE_MAX_VALUE (TREE_TYPE (low1
)))
5497 && merge_ranges (pin_p
, plow
, phigh
, in0_p
, low0
, high0
,
5498 !in1_p
, NULL_TREE
, range_predecessor (low1
)))
5500 /* Similarly for the second range != low1 where low1 is the type minimum
5501 of the type, try first merging with > low1 range. */
5502 if (tree_int_cst_equal (low1
, TYPE_MIN_VALUE (TREE_TYPE (low1
)))
5503 && merge_ranges (pin_p
, plow
, phigh
, in0_p
, low0
, high0
,
5504 !in1_p
, range_successor (low1
), NULL_TREE
))
5508 /* Now flag two cases, whether the ranges are disjoint or whether the
5509 second range is totally subsumed in the first. Note that the tests
5510 below are simplified by the ones above. */
5511 no_overlap
= integer_onep (range_binop (LT_EXPR
, integer_type_node
,
5512 high0
, 1, low1
, 0));
5513 subset
= integer_onep (range_binop (LE_EXPR
, integer_type_node
,
5514 high1
, 1, high0
, 1));
5516 /* We now have four cases, depending on whether we are including or
5517 excluding the two ranges. */
5520 /* If they don't overlap, the result is false. If the second range
5521 is a subset it is the result. Otherwise, the range is from the start
5522 of the second to the end of the first. */
5524 in_p
= 0, low
= high
= 0;
5526 in_p
= 1, low
= low1
, high
= high1
;
5528 in_p
= 1, low
= low1
, high
= high0
;
5531 else if (in0_p
&& ! in1_p
)
5533 /* If they don't overlap, the result is the first range. If they are
5534 equal, the result is false. If the second range is a subset of the
5535 first, and the ranges begin at the same place, we go from just after
5536 the end of the second range to the end of the first. If the second
5537 range is not a subset of the first, or if it is a subset and both
5538 ranges end at the same place, the range starts at the start of the
5539 first range and ends just before the second range.
5540 Otherwise, we can't describe this as a single range. */
5542 in_p
= 1, low
= low0
, high
= high0
;
5543 else if (lowequal
&& highequal
)
5544 in_p
= 0, low
= high
= 0;
5545 else if (subset
&& lowequal
)
5547 low
= range_successor (high1
);
5552 /* We are in the weird situation where high0 > high1 but
5553 high1 has no successor. Punt. */
5557 else if (! subset
|| highequal
)
5560 high
= range_predecessor (low1
);
5564 /* low0 < low1 but low1 has no predecessor. Punt. */
5572 else if (! in0_p
&& in1_p
)
5574 /* If they don't overlap, the result is the second range. If the second
5575 is a subset of the first, the result is false. Otherwise,
5576 the range starts just after the first range and ends at the
5577 end of the second. */
5579 in_p
= 1, low
= low1
, high
= high1
;
5580 else if (subset
|| highequal
)
5581 in_p
= 0, low
= high
= 0;
5584 low
= range_successor (high0
);
5589 /* high1 > high0 but high0 has no successor. Punt. */
5597 /* The case where we are excluding both ranges. Here the complex case
5598 is if they don't overlap. In that case, the only time we have a
5599 range is if they are adjacent. If the second is a subset of the
5600 first, the result is the first. Otherwise, the range to exclude
5601 starts at the beginning of the first range and ends at the end of the
5605 if (integer_onep (range_binop (EQ_EXPR
, integer_type_node
,
5606 range_successor (high0
),
5608 in_p
= 0, low
= low0
, high
= high1
;
5611 /* Canonicalize - [min, x] into - [-, x]. */
5612 if (low0
&& TREE_CODE (low0
) == INTEGER_CST
)
5613 switch (TREE_CODE (TREE_TYPE (low0
)))
5616 if (maybe_ne (TYPE_PRECISION (TREE_TYPE (low0
)),
5618 (TYPE_MODE (TREE_TYPE (low0
)))))
5622 if (tree_int_cst_equal (low0
,
5623 TYPE_MIN_VALUE (TREE_TYPE (low0
))))
5627 if (TYPE_UNSIGNED (TREE_TYPE (low0
))
5628 && integer_zerop (low0
))
5635 /* Canonicalize - [x, max] into - [x, -]. */
5636 if (high1
&& TREE_CODE (high1
) == INTEGER_CST
)
5637 switch (TREE_CODE (TREE_TYPE (high1
)))
5640 if (maybe_ne (TYPE_PRECISION (TREE_TYPE (high1
)),
5642 (TYPE_MODE (TREE_TYPE (high1
)))))
5646 if (tree_int_cst_equal (high1
,
5647 TYPE_MAX_VALUE (TREE_TYPE (high1
))))
5651 if (TYPE_UNSIGNED (TREE_TYPE (high1
))
5652 && integer_zerop (range_binop (PLUS_EXPR
, NULL_TREE
,
5654 build_int_cst (TREE_TYPE (high1
), 1),
5662 /* The ranges might be also adjacent between the maximum and
5663 minimum values of the given type. For
5664 - [{min,-}, x] and - [y, {max,-}] ranges where x + 1 < y
5665 return + [x + 1, y - 1]. */
5666 if (low0
== 0 && high1
== 0)
5668 low
= range_successor (high0
);
5669 high
= range_predecessor (low1
);
5670 if (low
== 0 || high
== 0)
5680 in_p
= 0, low
= low0
, high
= high0
;
5682 in_p
= 0, low
= low0
, high
= high1
;
5685 *pin_p
= in_p
, *plow
= low
, *phigh
= high
;
5690 /* Subroutine of fold, looking inside expressions of the form
5691 A op B ? A : C, where ARG0, ARG1 and ARG2 are the three operands
5692 of the COND_EXPR. This function is being used also to optimize
5693 A op B ? C : A, by reversing the comparison first.
5695 Return a folded expression whose code is not a COND_EXPR
5696 anymore, or NULL_TREE if no folding opportunity is found. */
5699 fold_cond_expr_with_comparison (location_t loc
, tree type
,
5700 tree arg0
, tree arg1
, tree arg2
)
5702 enum tree_code comp_code
= TREE_CODE (arg0
);
5703 tree arg00
= TREE_OPERAND (arg0
, 0);
5704 tree arg01
= TREE_OPERAND (arg0
, 1);
5705 tree arg1_type
= TREE_TYPE (arg1
);
5711 /* If we have A op 0 ? A : -A, consider applying the following
5714 A == 0? A : -A same as -A
5715 A != 0? A : -A same as A
5716 A >= 0? A : -A same as abs (A)
5717 A > 0? A : -A same as abs (A)
5718 A <= 0? A : -A same as -abs (A)
5719 A < 0? A : -A same as -abs (A)
5721 None of these transformations work for modes with signed
5722 zeros. If A is +/-0, the first two transformations will
5723 change the sign of the result (from +0 to -0, or vice
5724 versa). The last four will fix the sign of the result,
5725 even though the original expressions could be positive or
5726 negative, depending on the sign of A.
5728 Note that all these transformations are correct if A is
5729 NaN, since the two alternatives (A and -A) are also NaNs. */
5730 if (!HONOR_SIGNED_ZEROS (element_mode (type
))
5731 && (FLOAT_TYPE_P (TREE_TYPE (arg01
))
5732 ? real_zerop (arg01
)
5733 : integer_zerop (arg01
))
5734 && ((TREE_CODE (arg2
) == NEGATE_EXPR
5735 && operand_equal_p (TREE_OPERAND (arg2
, 0), arg1
, 0))
5736 /* In the case that A is of the form X-Y, '-A' (arg2) may
5737 have already been folded to Y-X, check for that. */
5738 || (TREE_CODE (arg1
) == MINUS_EXPR
5739 && TREE_CODE (arg2
) == MINUS_EXPR
5740 && operand_equal_p (TREE_OPERAND (arg1
, 0),
5741 TREE_OPERAND (arg2
, 1), 0)
5742 && operand_equal_p (TREE_OPERAND (arg1
, 1),
5743 TREE_OPERAND (arg2
, 0), 0))))
5748 tem
= fold_convert_loc (loc
, arg1_type
, arg1
);
5749 return fold_convert_loc (loc
, type
, negate_expr (tem
));
5752 return fold_convert_loc (loc
, type
, arg1
);
5755 if (flag_trapping_math
)
5760 if (TYPE_UNSIGNED (TREE_TYPE (arg1
)))
5762 tem
= fold_build1_loc (loc
, ABS_EXPR
, TREE_TYPE (arg1
), arg1
);
5763 return fold_convert_loc (loc
, type
, tem
);
5766 if (flag_trapping_math
)
5771 if (TYPE_UNSIGNED (TREE_TYPE (arg1
)))
5773 tem
= fold_build1_loc (loc
, ABS_EXPR
, TREE_TYPE (arg1
), arg1
);
5774 return negate_expr (fold_convert_loc (loc
, type
, tem
));
5776 gcc_assert (TREE_CODE_CLASS (comp_code
) == tcc_comparison
);
5780 /* A != 0 ? A : 0 is simply A, unless A is -0. Likewise
5781 A == 0 ? A : 0 is always 0 unless A is -0. Note that
5782 both transformations are correct when A is NaN: A != 0
5783 is then true, and A == 0 is false. */
5785 if (!HONOR_SIGNED_ZEROS (element_mode (type
))
5786 && integer_zerop (arg01
) && integer_zerop (arg2
))
5788 if (comp_code
== NE_EXPR
)
5789 return fold_convert_loc (loc
, type
, arg1
);
5790 else if (comp_code
== EQ_EXPR
)
5791 return build_zero_cst (type
);
5794 /* Try some transformations of A op B ? A : B.
5796 A == B? A : B same as B
5797 A != B? A : B same as A
5798 A >= B? A : B same as max (A, B)
5799 A > B? A : B same as max (B, A)
5800 A <= B? A : B same as min (A, B)
5801 A < B? A : B same as min (B, A)
5803 As above, these transformations don't work in the presence
5804 of signed zeros. For example, if A and B are zeros of
5805 opposite sign, the first two transformations will change
5806 the sign of the result. In the last four, the original
5807 expressions give different results for (A=+0, B=-0) and
5808 (A=-0, B=+0), but the transformed expressions do not.
5810 The first two transformations are correct if either A or B
5811 is a NaN. In the first transformation, the condition will
5812 be false, and B will indeed be chosen. In the case of the
5813 second transformation, the condition A != B will be true,
5814 and A will be chosen.
5816 The conversions to max() and min() are not correct if B is
5817 a number and A is not. The conditions in the original
5818 expressions will be false, so all four give B. The min()
5819 and max() versions would give a NaN instead. */
5820 if (!HONOR_SIGNED_ZEROS (element_mode (type
))
5821 && operand_equal_for_comparison_p (arg01
, arg2
)
5822 /* Avoid these transformations if the COND_EXPR may be used
5823 as an lvalue in the C++ front-end. PR c++/19199. */
5825 || VECTOR_TYPE_P (type
)
5826 || (! lang_GNU_CXX ()
5827 && strcmp (lang_hooks
.name
, "GNU Objective-C++") != 0)
5828 || ! maybe_lvalue_p (arg1
)
5829 || ! maybe_lvalue_p (arg2
)))
5831 tree comp_op0
= arg00
;
5832 tree comp_op1
= arg01
;
5833 tree comp_type
= TREE_TYPE (comp_op0
);
5838 return fold_convert_loc (loc
, type
, arg2
);
5840 return fold_convert_loc (loc
, type
, arg1
);
5845 /* In C++ a ?: expression can be an lvalue, so put the
5846 operand which will be used if they are equal first
5847 so that we can convert this back to the
5848 corresponding COND_EXPR. */
5849 if (!HONOR_NANS (arg1
))
5851 comp_op0
= fold_convert_loc (loc
, comp_type
, comp_op0
);
5852 comp_op1
= fold_convert_loc (loc
, comp_type
, comp_op1
);
5853 tem
= (comp_code
== LE_EXPR
|| comp_code
== UNLE_EXPR
)
5854 ? fold_build2_loc (loc
, MIN_EXPR
, comp_type
, comp_op0
, comp_op1
)
5855 : fold_build2_loc (loc
, MIN_EXPR
, comp_type
,
5856 comp_op1
, comp_op0
);
5857 return fold_convert_loc (loc
, type
, tem
);
5864 if (!HONOR_NANS (arg1
))
5866 comp_op0
= fold_convert_loc (loc
, comp_type
, comp_op0
);
5867 comp_op1
= fold_convert_loc (loc
, comp_type
, comp_op1
);
5868 tem
= (comp_code
== GE_EXPR
|| comp_code
== UNGE_EXPR
)
5869 ? fold_build2_loc (loc
, MAX_EXPR
, comp_type
, comp_op0
, comp_op1
)
5870 : fold_build2_loc (loc
, MAX_EXPR
, comp_type
,
5871 comp_op1
, comp_op0
);
5872 return fold_convert_loc (loc
, type
, tem
);
5876 if (!HONOR_NANS (arg1
))
5877 return fold_convert_loc (loc
, type
, arg2
);
5880 if (!HONOR_NANS (arg1
))
5881 return fold_convert_loc (loc
, type
, arg1
);
5884 gcc_assert (TREE_CODE_CLASS (comp_code
) == tcc_comparison
);
5894 #ifndef LOGICAL_OP_NON_SHORT_CIRCUIT
5895 #define LOGICAL_OP_NON_SHORT_CIRCUIT \
5896 (BRANCH_COST (optimize_function_for_speed_p (cfun), \
5900 /* EXP is some logical combination of boolean tests. See if we can
5901 merge it into some range test. Return the new tree if so. */
5904 fold_range_test (location_t loc
, enum tree_code code
, tree type
,
5907 int or_op
= (code
== TRUTH_ORIF_EXPR
5908 || code
== TRUTH_OR_EXPR
);
5909 int in0_p
, in1_p
, in_p
;
5910 tree low0
, low1
, low
, high0
, high1
, high
;
5911 bool strict_overflow_p
= false;
5913 const char * const warnmsg
= G_("assuming signed overflow does not occur "
5914 "when simplifying range test");
5916 if (!INTEGRAL_TYPE_P (type
))
5919 lhs
= make_range (op0
, &in0_p
, &low0
, &high0
, &strict_overflow_p
);
5920 rhs
= make_range (op1
, &in1_p
, &low1
, &high1
, &strict_overflow_p
);
5922 /* If this is an OR operation, invert both sides; we will invert
5923 again at the end. */
5925 in0_p
= ! in0_p
, in1_p
= ! in1_p
;
5927 /* If both expressions are the same, if we can merge the ranges, and we
5928 can build the range test, return it or it inverted. If one of the
5929 ranges is always true or always false, consider it to be the same
5930 expression as the other. */
5931 if ((lhs
== 0 || rhs
== 0 || operand_equal_p (lhs
, rhs
, 0))
5932 && merge_ranges (&in_p
, &low
, &high
, in0_p
, low0
, high0
,
5934 && (tem
= (build_range_check (loc
, type
,
5936 : rhs
!= 0 ? rhs
: integer_zero_node
,
5937 in_p
, low
, high
))) != 0)
5939 if (strict_overflow_p
)
5940 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_COMPARISON
);
5941 return or_op
? invert_truthvalue_loc (loc
, tem
) : tem
;
5944 /* On machines where the branch cost is expensive, if this is a
5945 short-circuited branch and the underlying object on both sides
5946 is the same, make a non-short-circuit operation. */
5947 bool logical_op_non_short_circuit
= LOGICAL_OP_NON_SHORT_CIRCUIT
;
5948 if (param_logical_op_non_short_circuit
!= -1)
5949 logical_op_non_short_circuit
5950 = param_logical_op_non_short_circuit
;
5951 if (logical_op_non_short_circuit
5952 && !flag_sanitize_coverage
5953 && lhs
!= 0 && rhs
!= 0
5954 && (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
)
5955 && operand_equal_p (lhs
, rhs
, 0))
5957 /* If simple enough, just rewrite. Otherwise, make a SAVE_EXPR
5958 unless we are at top level or LHS contains a PLACEHOLDER_EXPR, in
5959 which cases we can't do this. */
5960 if (simple_operand_p (lhs
))
5961 return build2_loc (loc
, code
== TRUTH_ANDIF_EXPR
5962 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
,
5965 else if (!lang_hooks
.decls
.global_bindings_p ()
5966 && !CONTAINS_PLACEHOLDER_P (lhs
))
5968 tree common
= save_expr (lhs
);
5970 if ((lhs
= build_range_check (loc
, type
, common
,
5971 or_op
? ! in0_p
: in0_p
,
5973 && (rhs
= build_range_check (loc
, type
, common
,
5974 or_op
? ! in1_p
: in1_p
,
5977 if (strict_overflow_p
)
5978 fold_overflow_warning (warnmsg
,
5979 WARN_STRICT_OVERFLOW_COMPARISON
);
5980 return build2_loc (loc
, code
== TRUTH_ANDIF_EXPR
5981 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
,
5990 /* Subroutine for fold_truth_andor_1: C is an INTEGER_CST interpreted as a P
5991 bit value. Arrange things so the extra bits will be set to zero if and
5992 only if C is signed-extended to its full width. If MASK is nonzero,
5993 it is an INTEGER_CST that should be AND'ed with the extra bits. */
5996 unextend (tree c
, int p
, int unsignedp
, tree mask
)
5998 tree type
= TREE_TYPE (c
);
5999 int modesize
= GET_MODE_BITSIZE (SCALAR_INT_TYPE_MODE (type
));
6002 if (p
== modesize
|| unsignedp
)
6005 /* We work by getting just the sign bit into the low-order bit, then
6006 into the high-order bit, then sign-extend. We then XOR that value
6008 temp
= build_int_cst (TREE_TYPE (c
),
6009 wi::extract_uhwi (wi::to_wide (c
), p
- 1, 1));
6011 /* We must use a signed type in order to get an arithmetic right shift.
6012 However, we must also avoid introducing accidental overflows, so that
6013 a subsequent call to integer_zerop will work. Hence we must
6014 do the type conversion here. At this point, the constant is either
6015 zero or one, and the conversion to a signed type can never overflow.
6016 We could get an overflow if this conversion is done anywhere else. */
6017 if (TYPE_UNSIGNED (type
))
6018 temp
= fold_convert (signed_type_for (type
), temp
);
6020 temp
= const_binop (LSHIFT_EXPR
, temp
, size_int (modesize
- 1));
6021 temp
= const_binop (RSHIFT_EXPR
, temp
, size_int (modesize
- p
- 1));
6023 temp
= const_binop (BIT_AND_EXPR
, temp
,
6024 fold_convert (TREE_TYPE (c
), mask
));
6025 /* If necessary, convert the type back to match the type of C. */
6026 if (TYPE_UNSIGNED (type
))
6027 temp
= fold_convert (type
, temp
);
6029 return fold_convert (type
, const_binop (BIT_XOR_EXPR
, c
, temp
));
6032 /* For an expression that has the form
6036 we can drop one of the inner expressions and simplify to
6040 LOC is the location of the resulting expression. OP is the inner
6041 logical operation; the left-hand side in the examples above, while CMPOP
6042 is the right-hand side. RHS_ONLY is used to prevent us from accidentally
6043 removing a condition that guards another, as in
6044 (A != NULL && A->...) || A == NULL
6045 which we must not transform. If RHS_ONLY is true, only eliminate the
6046 right-most operand of the inner logical operation. */
6049 merge_truthop_with_opposite_arm (location_t loc
, tree op
, tree cmpop
,
6052 tree type
= TREE_TYPE (cmpop
);
6053 enum tree_code code
= TREE_CODE (cmpop
);
6054 enum tree_code truthop_code
= TREE_CODE (op
);
6055 tree lhs
= TREE_OPERAND (op
, 0);
6056 tree rhs
= TREE_OPERAND (op
, 1);
6057 tree orig_lhs
= lhs
, orig_rhs
= rhs
;
6058 enum tree_code rhs_code
= TREE_CODE (rhs
);
6059 enum tree_code lhs_code
= TREE_CODE (lhs
);
6060 enum tree_code inv_code
;
6062 if (TREE_SIDE_EFFECTS (op
) || TREE_SIDE_EFFECTS (cmpop
))
6065 if (TREE_CODE_CLASS (code
) != tcc_comparison
)
6068 if (rhs_code
== truthop_code
)
6070 tree newrhs
= merge_truthop_with_opposite_arm (loc
, rhs
, cmpop
, rhs_only
);
6071 if (newrhs
!= NULL_TREE
)
6074 rhs_code
= TREE_CODE (rhs
);
6077 if (lhs_code
== truthop_code
&& !rhs_only
)
6079 tree newlhs
= merge_truthop_with_opposite_arm (loc
, lhs
, cmpop
, false);
6080 if (newlhs
!= NULL_TREE
)
6083 lhs_code
= TREE_CODE (lhs
);
6087 inv_code
= invert_tree_comparison (code
, HONOR_NANS (type
));
6088 if (inv_code
== rhs_code
6089 && operand_equal_p (TREE_OPERAND (rhs
, 0), TREE_OPERAND (cmpop
, 0), 0)
6090 && operand_equal_p (TREE_OPERAND (rhs
, 1), TREE_OPERAND (cmpop
, 1), 0))
6092 if (!rhs_only
&& inv_code
== lhs_code
6093 && operand_equal_p (TREE_OPERAND (lhs
, 0), TREE_OPERAND (cmpop
, 0), 0)
6094 && operand_equal_p (TREE_OPERAND (lhs
, 1), TREE_OPERAND (cmpop
, 1), 0))
6096 if (rhs
!= orig_rhs
|| lhs
!= orig_lhs
)
6097 return fold_build2_loc (loc
, truthop_code
, TREE_TYPE (cmpop
),
6102 /* Find ways of folding logical expressions of LHS and RHS:
6103 Try to merge two comparisons to the same innermost item.
6104 Look for range tests like "ch >= '0' && ch <= '9'".
6105 Look for combinations of simple terms on machines with expensive branches
6106 and evaluate the RHS unconditionally.
6108 For example, if we have p->a == 2 && p->b == 4 and we can make an
6109 object large enough to span both A and B, we can do this with a comparison
6110 against the object ANDed with the a mask.
6112 If we have p->a == q->a && p->b == q->b, we may be able to use bit masking
6113 operations to do this with one comparison.
6115 We check for both normal comparisons and the BIT_AND_EXPRs made this by
6116 function and the one above.
6118 CODE is the logical operation being done. It can be TRUTH_ANDIF_EXPR,
6119 TRUTH_AND_EXPR, TRUTH_ORIF_EXPR, or TRUTH_OR_EXPR.
6121 TRUTH_TYPE is the type of the logical operand and LHS and RHS are its
6124 We return the simplified tree or 0 if no optimization is possible. */
6127 fold_truth_andor_1 (location_t loc
, enum tree_code code
, tree truth_type
,
6130 /* If this is the "or" of two comparisons, we can do something if
6131 the comparisons are NE_EXPR. If this is the "and", we can do something
6132 if the comparisons are EQ_EXPR. I.e.,
6133 (a->b == 2 && a->c == 4) can become (a->new == NEW).
6135 WANTED_CODE is this operation code. For single bit fields, we can
6136 convert EQ_EXPR to NE_EXPR so we need not reject the "wrong"
6137 comparison for one-bit fields. */
6139 enum tree_code wanted_code
;
6140 enum tree_code lcode
, rcode
;
6141 tree ll_arg
, lr_arg
, rl_arg
, rr_arg
;
6142 tree ll_inner
, lr_inner
, rl_inner
, rr_inner
;
6143 HOST_WIDE_INT ll_bitsize
, ll_bitpos
, lr_bitsize
, lr_bitpos
;
6144 HOST_WIDE_INT rl_bitsize
, rl_bitpos
, rr_bitsize
, rr_bitpos
;
6145 HOST_WIDE_INT xll_bitpos
, xlr_bitpos
, xrl_bitpos
, xrr_bitpos
;
6146 HOST_WIDE_INT lnbitsize
, lnbitpos
, rnbitsize
, rnbitpos
;
6147 int ll_unsignedp
, lr_unsignedp
, rl_unsignedp
, rr_unsignedp
;
6148 int ll_reversep
, lr_reversep
, rl_reversep
, rr_reversep
;
6149 machine_mode ll_mode
, lr_mode
, rl_mode
, rr_mode
;
6150 scalar_int_mode lnmode
, rnmode
;
6151 tree ll_mask
, lr_mask
, rl_mask
, rr_mask
;
6152 tree ll_and_mask
, lr_and_mask
, rl_and_mask
, rr_and_mask
;
6153 tree l_const
, r_const
;
6154 tree lntype
, rntype
, result
;
6155 HOST_WIDE_INT first_bit
, end_bit
;
6158 /* Start by getting the comparison codes. Fail if anything is volatile.
6159 If one operand is a BIT_AND_EXPR with the constant one, treat it as if
6160 it were surrounded with a NE_EXPR. */
6162 if (TREE_SIDE_EFFECTS (lhs
) || TREE_SIDE_EFFECTS (rhs
))
6165 lcode
= TREE_CODE (lhs
);
6166 rcode
= TREE_CODE (rhs
);
6168 if (lcode
== BIT_AND_EXPR
&& integer_onep (TREE_OPERAND (lhs
, 1)))
6170 lhs
= build2 (NE_EXPR
, truth_type
, lhs
,
6171 build_int_cst (TREE_TYPE (lhs
), 0));
6175 if (rcode
== BIT_AND_EXPR
&& integer_onep (TREE_OPERAND (rhs
, 1)))
6177 rhs
= build2 (NE_EXPR
, truth_type
, rhs
,
6178 build_int_cst (TREE_TYPE (rhs
), 0));
6182 if (TREE_CODE_CLASS (lcode
) != tcc_comparison
6183 || TREE_CODE_CLASS (rcode
) != tcc_comparison
)
6186 ll_arg
= TREE_OPERAND (lhs
, 0);
6187 lr_arg
= TREE_OPERAND (lhs
, 1);
6188 rl_arg
= TREE_OPERAND (rhs
, 0);
6189 rr_arg
= TREE_OPERAND (rhs
, 1);
6191 /* Simplify (x<y) && (x==y) into (x<=y) and related optimizations. */
6192 if (simple_operand_p (ll_arg
)
6193 && simple_operand_p (lr_arg
))
6195 if (operand_equal_p (ll_arg
, rl_arg
, 0)
6196 && operand_equal_p (lr_arg
, rr_arg
, 0))
6198 result
= combine_comparisons (loc
, code
, lcode
, rcode
,
6199 truth_type
, ll_arg
, lr_arg
);
6203 else if (operand_equal_p (ll_arg
, rr_arg
, 0)
6204 && operand_equal_p (lr_arg
, rl_arg
, 0))
6206 result
= combine_comparisons (loc
, code
, lcode
,
6207 swap_tree_comparison (rcode
),
6208 truth_type
, ll_arg
, lr_arg
);
6214 code
= ((code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
)
6215 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
);
6217 /* If the RHS can be evaluated unconditionally and its operands are
6218 simple, it wins to evaluate the RHS unconditionally on machines
6219 with expensive branches. In this case, this isn't a comparison
6220 that can be merged. */
6222 if (BRANCH_COST (optimize_function_for_speed_p (cfun
),
6224 && ! FLOAT_TYPE_P (TREE_TYPE (rl_arg
))
6225 && simple_operand_p (rl_arg
)
6226 && simple_operand_p (rr_arg
))
6228 /* Convert (a != 0) || (b != 0) into (a | b) != 0. */
6229 if (code
== TRUTH_OR_EXPR
6230 && lcode
== NE_EXPR
&& integer_zerop (lr_arg
)
6231 && rcode
== NE_EXPR
&& integer_zerop (rr_arg
)
6232 && TREE_TYPE (ll_arg
) == TREE_TYPE (rl_arg
)
6233 && INTEGRAL_TYPE_P (TREE_TYPE (ll_arg
)))
6234 return build2_loc (loc
, NE_EXPR
, truth_type
,
6235 build2 (BIT_IOR_EXPR
, TREE_TYPE (ll_arg
),
6237 build_int_cst (TREE_TYPE (ll_arg
), 0));
6239 /* Convert (a == 0) && (b == 0) into (a | b) == 0. */
6240 if (code
== TRUTH_AND_EXPR
6241 && lcode
== EQ_EXPR
&& integer_zerop (lr_arg
)
6242 && rcode
== EQ_EXPR
&& integer_zerop (rr_arg
)
6243 && TREE_TYPE (ll_arg
) == TREE_TYPE (rl_arg
)
6244 && INTEGRAL_TYPE_P (TREE_TYPE (ll_arg
)))
6245 return build2_loc (loc
, EQ_EXPR
, truth_type
,
6246 build2 (BIT_IOR_EXPR
, TREE_TYPE (ll_arg
),
6248 build_int_cst (TREE_TYPE (ll_arg
), 0));
6251 /* See if the comparisons can be merged. Then get all the parameters for
6254 if ((lcode
!= EQ_EXPR
&& lcode
!= NE_EXPR
)
6255 || (rcode
!= EQ_EXPR
&& rcode
!= NE_EXPR
))
6258 ll_reversep
= lr_reversep
= rl_reversep
= rr_reversep
= 0;
6260 ll_inner
= decode_field_reference (loc
, &ll_arg
,
6261 &ll_bitsize
, &ll_bitpos
, &ll_mode
,
6262 &ll_unsignedp
, &ll_reversep
, &volatilep
,
6263 &ll_mask
, &ll_and_mask
);
6264 lr_inner
= decode_field_reference (loc
, &lr_arg
,
6265 &lr_bitsize
, &lr_bitpos
, &lr_mode
,
6266 &lr_unsignedp
, &lr_reversep
, &volatilep
,
6267 &lr_mask
, &lr_and_mask
);
6268 rl_inner
= decode_field_reference (loc
, &rl_arg
,
6269 &rl_bitsize
, &rl_bitpos
, &rl_mode
,
6270 &rl_unsignedp
, &rl_reversep
, &volatilep
,
6271 &rl_mask
, &rl_and_mask
);
6272 rr_inner
= decode_field_reference (loc
, &rr_arg
,
6273 &rr_bitsize
, &rr_bitpos
, &rr_mode
,
6274 &rr_unsignedp
, &rr_reversep
, &volatilep
,
6275 &rr_mask
, &rr_and_mask
);
6277 /* It must be true that the inner operation on the lhs of each
6278 comparison must be the same if we are to be able to do anything.
6279 Then see if we have constants. If not, the same must be true for
6282 || ll_reversep
!= rl_reversep
6283 || ll_inner
== 0 || rl_inner
== 0
6284 || ! operand_equal_p (ll_inner
, rl_inner
, 0))
6287 if (TREE_CODE (lr_arg
) == INTEGER_CST
6288 && TREE_CODE (rr_arg
) == INTEGER_CST
)
6290 l_const
= lr_arg
, r_const
= rr_arg
;
6291 lr_reversep
= ll_reversep
;
6293 else if (lr_reversep
!= rr_reversep
6294 || lr_inner
== 0 || rr_inner
== 0
6295 || ! operand_equal_p (lr_inner
, rr_inner
, 0))
6298 l_const
= r_const
= 0;
6300 /* If either comparison code is not correct for our logical operation,
6301 fail. However, we can convert a one-bit comparison against zero into
6302 the opposite comparison against that bit being set in the field. */
6304 wanted_code
= (code
== TRUTH_AND_EXPR
? EQ_EXPR
: NE_EXPR
);
6305 if (lcode
!= wanted_code
)
6307 if (l_const
&& integer_zerop (l_const
) && integer_pow2p (ll_mask
))
6309 /* Make the left operand unsigned, since we are only interested
6310 in the value of one bit. Otherwise we are doing the wrong
6319 /* This is analogous to the code for l_const above. */
6320 if (rcode
!= wanted_code
)
6322 if (r_const
&& integer_zerop (r_const
) && integer_pow2p (rl_mask
))
6331 /* See if we can find a mode that contains both fields being compared on
6332 the left. If we can't, fail. Otherwise, update all constants and masks
6333 to be relative to a field of that size. */
6334 first_bit
= MIN (ll_bitpos
, rl_bitpos
);
6335 end_bit
= MAX (ll_bitpos
+ ll_bitsize
, rl_bitpos
+ rl_bitsize
);
6336 if (!get_best_mode (end_bit
- first_bit
, first_bit
, 0, 0,
6337 TYPE_ALIGN (TREE_TYPE (ll_inner
)), BITS_PER_WORD
,
6338 volatilep
, &lnmode
))
6341 lnbitsize
= GET_MODE_BITSIZE (lnmode
);
6342 lnbitpos
= first_bit
& ~ (lnbitsize
- 1);
6343 lntype
= lang_hooks
.types
.type_for_size (lnbitsize
, 1);
6344 xll_bitpos
= ll_bitpos
- lnbitpos
, xrl_bitpos
= rl_bitpos
- lnbitpos
;
6346 if (ll_reversep
? !BYTES_BIG_ENDIAN
: BYTES_BIG_ENDIAN
)
6348 xll_bitpos
= lnbitsize
- xll_bitpos
- ll_bitsize
;
6349 xrl_bitpos
= lnbitsize
- xrl_bitpos
- rl_bitsize
;
6352 ll_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
, lntype
, ll_mask
),
6353 size_int (xll_bitpos
));
6354 rl_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
, lntype
, rl_mask
),
6355 size_int (xrl_bitpos
));
6359 l_const
= fold_convert_loc (loc
, lntype
, l_const
);
6360 l_const
= unextend (l_const
, ll_bitsize
, ll_unsignedp
, ll_and_mask
);
6361 l_const
= const_binop (LSHIFT_EXPR
, l_const
, size_int (xll_bitpos
));
6362 if (! integer_zerop (const_binop (BIT_AND_EXPR
, l_const
,
6363 fold_build1_loc (loc
, BIT_NOT_EXPR
,
6366 warning (0, "comparison is always %d", wanted_code
== NE_EXPR
);
6368 return constant_boolean_node (wanted_code
== NE_EXPR
, truth_type
);
6373 r_const
= fold_convert_loc (loc
, lntype
, r_const
);
6374 r_const
= unextend (r_const
, rl_bitsize
, rl_unsignedp
, rl_and_mask
);
6375 r_const
= const_binop (LSHIFT_EXPR
, r_const
, size_int (xrl_bitpos
));
6376 if (! integer_zerop (const_binop (BIT_AND_EXPR
, r_const
,
6377 fold_build1_loc (loc
, BIT_NOT_EXPR
,
6380 warning (0, "comparison is always %d", wanted_code
== NE_EXPR
);
6382 return constant_boolean_node (wanted_code
== NE_EXPR
, truth_type
);
6386 /* If the right sides are not constant, do the same for it. Also,
6387 disallow this optimization if a size, signedness or storage order
6388 mismatch occurs between the left and right sides. */
6391 if (ll_bitsize
!= lr_bitsize
|| rl_bitsize
!= rr_bitsize
6392 || ll_unsignedp
!= lr_unsignedp
|| rl_unsignedp
!= rr_unsignedp
6393 || ll_reversep
!= lr_reversep
6394 /* Make sure the two fields on the right
6395 correspond to the left without being swapped. */
6396 || ll_bitpos
- rl_bitpos
!= lr_bitpos
- rr_bitpos
)
6399 first_bit
= MIN (lr_bitpos
, rr_bitpos
);
6400 end_bit
= MAX (lr_bitpos
+ lr_bitsize
, rr_bitpos
+ rr_bitsize
);
6401 if (!get_best_mode (end_bit
- first_bit
, first_bit
, 0, 0,
6402 TYPE_ALIGN (TREE_TYPE (lr_inner
)), BITS_PER_WORD
,
6403 volatilep
, &rnmode
))
6406 rnbitsize
= GET_MODE_BITSIZE (rnmode
);
6407 rnbitpos
= first_bit
& ~ (rnbitsize
- 1);
6408 rntype
= lang_hooks
.types
.type_for_size (rnbitsize
, 1);
6409 xlr_bitpos
= lr_bitpos
- rnbitpos
, xrr_bitpos
= rr_bitpos
- rnbitpos
;
6411 if (lr_reversep
? !BYTES_BIG_ENDIAN
: BYTES_BIG_ENDIAN
)
6413 xlr_bitpos
= rnbitsize
- xlr_bitpos
- lr_bitsize
;
6414 xrr_bitpos
= rnbitsize
- xrr_bitpos
- rr_bitsize
;
6417 lr_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
,
6419 size_int (xlr_bitpos
));
6420 rr_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
,
6422 size_int (xrr_bitpos
));
6424 /* Make a mask that corresponds to both fields being compared.
6425 Do this for both items being compared. If the operands are the
6426 same size and the bits being compared are in the same position
6427 then we can do this by masking both and comparing the masked
6429 ll_mask
= const_binop (BIT_IOR_EXPR
, ll_mask
, rl_mask
);
6430 lr_mask
= const_binop (BIT_IOR_EXPR
, lr_mask
, rr_mask
);
6431 if (lnbitsize
== rnbitsize
6432 && xll_bitpos
== xlr_bitpos
6436 lhs
= make_bit_field_ref (loc
, ll_inner
, ll_arg
,
6437 lntype
, lnbitsize
, lnbitpos
,
6438 ll_unsignedp
|| rl_unsignedp
, ll_reversep
);
6439 if (! all_ones_mask_p (ll_mask
, lnbitsize
))
6440 lhs
= build2 (BIT_AND_EXPR
, lntype
, lhs
, ll_mask
);
6442 rhs
= make_bit_field_ref (loc
, lr_inner
, lr_arg
,
6443 rntype
, rnbitsize
, rnbitpos
,
6444 lr_unsignedp
|| rr_unsignedp
, lr_reversep
);
6445 if (! all_ones_mask_p (lr_mask
, rnbitsize
))
6446 rhs
= build2 (BIT_AND_EXPR
, rntype
, rhs
, lr_mask
);
6448 return build2_loc (loc
, wanted_code
, truth_type
, lhs
, rhs
);
6451 /* There is still another way we can do something: If both pairs of
6452 fields being compared are adjacent, we may be able to make a wider
6453 field containing them both.
6455 Note that we still must mask the lhs/rhs expressions. Furthermore,
6456 the mask must be shifted to account for the shift done by
6457 make_bit_field_ref. */
6458 if (((ll_bitsize
+ ll_bitpos
== rl_bitpos
6459 && lr_bitsize
+ lr_bitpos
== rr_bitpos
)
6460 || (ll_bitpos
== rl_bitpos
+ rl_bitsize
6461 && lr_bitpos
== rr_bitpos
+ rr_bitsize
))
6469 lhs
= make_bit_field_ref (loc
, ll_inner
, ll_arg
, lntype
,
6470 ll_bitsize
+ rl_bitsize
,
6471 MIN (ll_bitpos
, rl_bitpos
),
6472 ll_unsignedp
, ll_reversep
);
6473 rhs
= make_bit_field_ref (loc
, lr_inner
, lr_arg
, rntype
,
6474 lr_bitsize
+ rr_bitsize
,
6475 MIN (lr_bitpos
, rr_bitpos
),
6476 lr_unsignedp
, lr_reversep
);
6478 ll_mask
= const_binop (RSHIFT_EXPR
, ll_mask
,
6479 size_int (MIN (xll_bitpos
, xrl_bitpos
)));
6480 lr_mask
= const_binop (RSHIFT_EXPR
, lr_mask
,
6481 size_int (MIN (xlr_bitpos
, xrr_bitpos
)));
6483 /* Convert to the smaller type before masking out unwanted bits. */
6485 if (lntype
!= rntype
)
6487 if (lnbitsize
> rnbitsize
)
6489 lhs
= fold_convert_loc (loc
, rntype
, lhs
);
6490 ll_mask
= fold_convert_loc (loc
, rntype
, ll_mask
);
6493 else if (lnbitsize
< rnbitsize
)
6495 rhs
= fold_convert_loc (loc
, lntype
, rhs
);
6496 lr_mask
= fold_convert_loc (loc
, lntype
, lr_mask
);
6501 if (! all_ones_mask_p (ll_mask
, ll_bitsize
+ rl_bitsize
))
6502 lhs
= build2 (BIT_AND_EXPR
, type
, lhs
, ll_mask
);
6504 if (! all_ones_mask_p (lr_mask
, lr_bitsize
+ rr_bitsize
))
6505 rhs
= build2 (BIT_AND_EXPR
, type
, rhs
, lr_mask
);
6507 return build2_loc (loc
, wanted_code
, truth_type
, lhs
, rhs
);
6513 /* Handle the case of comparisons with constants. If there is something in
6514 common between the masks, those bits of the constants must be the same.
6515 If not, the condition is always false. Test for this to avoid generating
6516 incorrect code below. */
6517 result
= const_binop (BIT_AND_EXPR
, ll_mask
, rl_mask
);
6518 if (! integer_zerop (result
)
6519 && simple_cst_equal (const_binop (BIT_AND_EXPR
, result
, l_const
),
6520 const_binop (BIT_AND_EXPR
, result
, r_const
)) != 1)
6522 if (wanted_code
== NE_EXPR
)
6524 warning (0, "%<or%> of unmatched not-equal tests is always 1");
6525 return constant_boolean_node (true, truth_type
);
6529 warning (0, "%<and%> of mutually exclusive equal-tests is always 0");
6530 return constant_boolean_node (false, truth_type
);
6537 /* Construct the expression we will return. First get the component
6538 reference we will make. Unless the mask is all ones the width of
6539 that field, perform the mask operation. Then compare with the
6541 result
= make_bit_field_ref (loc
, ll_inner
, ll_arg
,
6542 lntype
, lnbitsize
, lnbitpos
,
6543 ll_unsignedp
|| rl_unsignedp
, ll_reversep
);
6545 ll_mask
= const_binop (BIT_IOR_EXPR
, ll_mask
, rl_mask
);
6546 if (! all_ones_mask_p (ll_mask
, lnbitsize
))
6547 result
= build2_loc (loc
, BIT_AND_EXPR
, lntype
, result
, ll_mask
);
6549 return build2_loc (loc
, wanted_code
, truth_type
, result
,
6550 const_binop (BIT_IOR_EXPR
, l_const
, r_const
));
6553 /* T is an integer expression that is being multiplied, divided, or taken a
6554 modulus (CODE says which and what kind of divide or modulus) by a
6555 constant C. See if we can eliminate that operation by folding it with
6556 other operations already in T. WIDE_TYPE, if non-null, is a type that
6557 should be used for the computation if wider than our type.
6559 For example, if we are dividing (X * 8) + (Y * 16) by 4, we can return
6560 (X * 2) + (Y * 4). We must, however, be assured that either the original
6561 expression would not overflow or that overflow is undefined for the type
6562 in the language in question.
6564 If we return a non-null expression, it is an equivalent form of the
6565 original computation, but need not be in the original type.
6567 We set *STRICT_OVERFLOW_P to true if the return values depends on
6568 signed overflow being undefined. Otherwise we do not change
6569 *STRICT_OVERFLOW_P. */
6572 extract_muldiv (tree t
, tree c
, enum tree_code code
, tree wide_type
,
6573 bool *strict_overflow_p
)
6575 /* To avoid exponential search depth, refuse to allow recursion past
6576 three levels. Beyond that (1) it's highly unlikely that we'll find
6577 something interesting and (2) we've probably processed it before
6578 when we built the inner expression. */
6587 ret
= extract_muldiv_1 (t
, c
, code
, wide_type
, strict_overflow_p
);
6594 extract_muldiv_1 (tree t
, tree c
, enum tree_code code
, tree wide_type
,
6595 bool *strict_overflow_p
)
6597 tree type
= TREE_TYPE (t
);
6598 enum tree_code tcode
= TREE_CODE (t
);
6599 tree ctype
= (wide_type
!= 0
6600 && (GET_MODE_SIZE (SCALAR_INT_TYPE_MODE (wide_type
))
6601 > GET_MODE_SIZE (SCALAR_INT_TYPE_MODE (type
)))
6602 ? wide_type
: type
);
6604 int same_p
= tcode
== code
;
6605 tree op0
= NULL_TREE
, op1
= NULL_TREE
;
6606 bool sub_strict_overflow_p
;
6608 /* Don't deal with constants of zero here; they confuse the code below. */
6609 if (integer_zerop (c
))
6612 if (TREE_CODE_CLASS (tcode
) == tcc_unary
)
6613 op0
= TREE_OPERAND (t
, 0);
6615 if (TREE_CODE_CLASS (tcode
) == tcc_binary
)
6616 op0
= TREE_OPERAND (t
, 0), op1
= TREE_OPERAND (t
, 1);
6618 /* Note that we need not handle conditional operations here since fold
6619 already handles those cases. So just do arithmetic here. */
6623 /* For a constant, we can always simplify if we are a multiply
6624 or (for divide and modulus) if it is a multiple of our constant. */
6625 if (code
== MULT_EXPR
6626 || wi::multiple_of_p (wi::to_wide (t
), wi::to_wide (c
),
6629 tree tem
= const_binop (code
, fold_convert (ctype
, t
),
6630 fold_convert (ctype
, c
));
6631 /* If the multiplication overflowed, we lost information on it.
6632 See PR68142 and PR69845. */
6633 if (TREE_OVERFLOW (tem
))
6639 CASE_CONVERT
: case NON_LVALUE_EXPR
:
6640 /* If op0 is an expression ... */
6641 if ((COMPARISON_CLASS_P (op0
)
6642 || UNARY_CLASS_P (op0
)
6643 || BINARY_CLASS_P (op0
)
6644 || VL_EXP_CLASS_P (op0
)
6645 || EXPRESSION_CLASS_P (op0
))
6646 /* ... and has wrapping overflow, and its type is smaller
6647 than ctype, then we cannot pass through as widening. */
6648 && (((ANY_INTEGRAL_TYPE_P (TREE_TYPE (op0
))
6649 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (op0
)))
6650 && (TYPE_PRECISION (ctype
)
6651 > TYPE_PRECISION (TREE_TYPE (op0
))))
6652 /* ... or this is a truncation (t is narrower than op0),
6653 then we cannot pass through this narrowing. */
6654 || (TYPE_PRECISION (type
)
6655 < TYPE_PRECISION (TREE_TYPE (op0
)))
6656 /* ... or signedness changes for division or modulus,
6657 then we cannot pass through this conversion. */
6658 || (code
!= MULT_EXPR
6659 && (TYPE_UNSIGNED (ctype
)
6660 != TYPE_UNSIGNED (TREE_TYPE (op0
))))
6661 /* ... or has undefined overflow while the converted to
6662 type has not, we cannot do the operation in the inner type
6663 as that would introduce undefined overflow. */
6664 || ((ANY_INTEGRAL_TYPE_P (TREE_TYPE (op0
))
6665 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (op0
)))
6666 && !TYPE_OVERFLOW_UNDEFINED (type
))))
6669 /* Pass the constant down and see if we can make a simplification. If
6670 we can, replace this expression with the inner simplification for
6671 possible later conversion to our or some other type. */
6672 if ((t2
= fold_convert (TREE_TYPE (op0
), c
)) != 0
6673 && TREE_CODE (t2
) == INTEGER_CST
6674 && !TREE_OVERFLOW (t2
)
6675 && (t1
= extract_muldiv (op0
, t2
, code
,
6676 code
== MULT_EXPR
? ctype
: NULL_TREE
,
6677 strict_overflow_p
)) != 0)
6682 /* If widening the type changes it from signed to unsigned, then we
6683 must avoid building ABS_EXPR itself as unsigned. */
6684 if (TYPE_UNSIGNED (ctype
) && !TYPE_UNSIGNED (type
))
6686 tree cstype
= (*signed_type_for
) (ctype
);
6687 if ((t1
= extract_muldiv (op0
, c
, code
, cstype
, strict_overflow_p
))
6690 t1
= fold_build1 (tcode
, cstype
, fold_convert (cstype
, t1
));
6691 return fold_convert (ctype
, t1
);
6695 /* If the constant is negative, we cannot simplify this. */
6696 if (tree_int_cst_sgn (c
) == -1)
6700 /* For division and modulus, type can't be unsigned, as e.g.
6701 (-(x / 2U)) / 2U isn't equal to -((x / 2U) / 2U) for x >= 2.
6702 For signed types, even with wrapping overflow, this is fine. */
6703 if (code
!= MULT_EXPR
&& TYPE_UNSIGNED (type
))
6705 if ((t1
= extract_muldiv (op0
, c
, code
, wide_type
, strict_overflow_p
))
6707 return fold_build1 (tcode
, ctype
, fold_convert (ctype
, t1
));
6710 case MIN_EXPR
: case MAX_EXPR
:
6711 /* If widening the type changes the signedness, then we can't perform
6712 this optimization as that changes the result. */
6713 if (TYPE_UNSIGNED (ctype
) != TYPE_UNSIGNED (type
))
6716 /* MIN (a, b) / 5 -> MIN (a / 5, b / 5) */
6717 sub_strict_overflow_p
= false;
6718 if ((t1
= extract_muldiv (op0
, c
, code
, wide_type
,
6719 &sub_strict_overflow_p
)) != 0
6720 && (t2
= extract_muldiv (op1
, c
, code
, wide_type
,
6721 &sub_strict_overflow_p
)) != 0)
6723 if (tree_int_cst_sgn (c
) < 0)
6724 tcode
= (tcode
== MIN_EXPR
? MAX_EXPR
: MIN_EXPR
);
6725 if (sub_strict_overflow_p
)
6726 *strict_overflow_p
= true;
6727 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, t1
),
6728 fold_convert (ctype
, t2
));
6732 case LSHIFT_EXPR
: case RSHIFT_EXPR
:
6733 /* If the second operand is constant, this is a multiplication
6734 or floor division, by a power of two, so we can treat it that
6735 way unless the multiplier or divisor overflows. Signed
6736 left-shift overflow is implementation-defined rather than
6737 undefined in C90, so do not convert signed left shift into
6739 if (TREE_CODE (op1
) == INTEGER_CST
6740 && (tcode
== RSHIFT_EXPR
|| TYPE_UNSIGNED (TREE_TYPE (op0
)))
6741 /* const_binop may not detect overflow correctly,
6742 so check for it explicitly here. */
6743 && wi::gtu_p (TYPE_PRECISION (TREE_TYPE (size_one_node
)),
6745 && (t1
= fold_convert (ctype
,
6746 const_binop (LSHIFT_EXPR
, size_one_node
,
6748 && !TREE_OVERFLOW (t1
))
6749 return extract_muldiv (build2 (tcode
== LSHIFT_EXPR
6750 ? MULT_EXPR
: FLOOR_DIV_EXPR
,
6752 fold_convert (ctype
, op0
),
6754 c
, code
, wide_type
, strict_overflow_p
);
6757 case PLUS_EXPR
: case MINUS_EXPR
:
6758 /* See if we can eliminate the operation on both sides. If we can, we
6759 can return a new PLUS or MINUS. If we can't, the only remaining
6760 cases where we can do anything are if the second operand is a
6762 sub_strict_overflow_p
= false;
6763 t1
= extract_muldiv (op0
, c
, code
, wide_type
, &sub_strict_overflow_p
);
6764 t2
= extract_muldiv (op1
, c
, code
, wide_type
, &sub_strict_overflow_p
);
6765 if (t1
!= 0 && t2
!= 0
6766 && TYPE_OVERFLOW_WRAPS (ctype
)
6767 && (code
== MULT_EXPR
6768 /* If not multiplication, we can only do this if both operands
6769 are divisible by c. */
6770 || (multiple_of_p (ctype
, op0
, c
)
6771 && multiple_of_p (ctype
, op1
, c
))))
6773 if (sub_strict_overflow_p
)
6774 *strict_overflow_p
= true;
6775 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, t1
),
6776 fold_convert (ctype
, t2
));
6779 /* If this was a subtraction, negate OP1 and set it to be an addition.
6780 This simplifies the logic below. */
6781 if (tcode
== MINUS_EXPR
)
6783 tcode
= PLUS_EXPR
, op1
= negate_expr (op1
);
6784 /* If OP1 was not easily negatable, the constant may be OP0. */
6785 if (TREE_CODE (op0
) == INTEGER_CST
)
6787 std::swap (op0
, op1
);
6792 if (TREE_CODE (op1
) != INTEGER_CST
)
6795 /* If either OP1 or C are negative, this optimization is not safe for
6796 some of the division and remainder types while for others we need
6797 to change the code. */
6798 if (tree_int_cst_sgn (op1
) < 0 || tree_int_cst_sgn (c
) < 0)
6800 if (code
== CEIL_DIV_EXPR
)
6801 code
= FLOOR_DIV_EXPR
;
6802 else if (code
== FLOOR_DIV_EXPR
)
6803 code
= CEIL_DIV_EXPR
;
6804 else if (code
!= MULT_EXPR
6805 && code
!= CEIL_MOD_EXPR
&& code
!= FLOOR_MOD_EXPR
)
6809 /* If it's a multiply or a division/modulus operation of a multiple
6810 of our constant, do the operation and verify it doesn't overflow. */
6811 if (code
== MULT_EXPR
6812 || wi::multiple_of_p (wi::to_wide (op1
), wi::to_wide (c
),
6815 op1
= const_binop (code
, fold_convert (ctype
, op1
),
6816 fold_convert (ctype
, c
));
6817 /* We allow the constant to overflow with wrapping semantics. */
6819 || (TREE_OVERFLOW (op1
) && !TYPE_OVERFLOW_WRAPS (ctype
)))
6825 /* If we have an unsigned type, we cannot widen the operation since it
6826 will change the result if the original computation overflowed. */
6827 if (TYPE_UNSIGNED (ctype
) && ctype
!= type
)
6830 /* The last case is if we are a multiply. In that case, we can
6831 apply the distributive law to commute the multiply and addition
6832 if the multiplication of the constants doesn't overflow
6833 and overflow is defined. With undefined overflow
6834 op0 * c might overflow, while (op0 + orig_op1) * c doesn't.
6835 But fold_plusminus_mult_expr would factor back any power-of-two
6836 value so do not distribute in the first place in this case. */
6837 if (code
== MULT_EXPR
6838 && TYPE_OVERFLOW_WRAPS (ctype
)
6839 && !(tree_fits_shwi_p (c
) && pow2p_hwi (absu_hwi (tree_to_shwi (c
)))))
6840 return fold_build2 (tcode
, ctype
,
6841 fold_build2 (code
, ctype
,
6842 fold_convert (ctype
, op0
),
6843 fold_convert (ctype
, c
)),
6849 /* We have a special case here if we are doing something like
6850 (C * 8) % 4 since we know that's zero. */
6851 if ((code
== TRUNC_MOD_EXPR
|| code
== CEIL_MOD_EXPR
6852 || code
== FLOOR_MOD_EXPR
|| code
== ROUND_MOD_EXPR
)
6853 /* If the multiplication can overflow we cannot optimize this. */
6854 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (t
))
6855 && TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
6856 && wi::multiple_of_p (wi::to_wide (op1
), wi::to_wide (c
),
6859 *strict_overflow_p
= true;
6860 return omit_one_operand (type
, integer_zero_node
, op0
);
6863 /* ... fall through ... */
6865 case TRUNC_DIV_EXPR
: case CEIL_DIV_EXPR
: case FLOOR_DIV_EXPR
:
6866 case ROUND_DIV_EXPR
: case EXACT_DIV_EXPR
:
6867 /* If we can extract our operation from the LHS, do so and return a
6868 new operation. Likewise for the RHS from a MULT_EXPR. Otherwise,
6869 do something only if the second operand is a constant. */
6871 && TYPE_OVERFLOW_WRAPS (ctype
)
6872 && (t1
= extract_muldiv (op0
, c
, code
, wide_type
,
6873 strict_overflow_p
)) != 0)
6874 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, t1
),
6875 fold_convert (ctype
, op1
));
6876 else if (tcode
== MULT_EXPR
&& code
== MULT_EXPR
6877 && TYPE_OVERFLOW_WRAPS (ctype
)
6878 && (t1
= extract_muldiv (op1
, c
, code
, wide_type
,
6879 strict_overflow_p
)) != 0)
6880 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, op0
),
6881 fold_convert (ctype
, t1
));
6882 else if (TREE_CODE (op1
) != INTEGER_CST
)
6885 /* If these are the same operation types, we can associate them
6886 assuming no overflow. */
6889 bool overflow_p
= false;
6890 wi::overflow_type overflow_mul
;
6891 signop sign
= TYPE_SIGN (ctype
);
6892 unsigned prec
= TYPE_PRECISION (ctype
);
6893 wide_int mul
= wi::mul (wi::to_wide (op1
, prec
),
6894 wi::to_wide (c
, prec
),
6895 sign
, &overflow_mul
);
6896 overflow_p
= TREE_OVERFLOW (c
) | TREE_OVERFLOW (op1
);
6898 && ((sign
== UNSIGNED
&& tcode
!= MULT_EXPR
) || sign
== SIGNED
))
6901 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, op0
),
6902 wide_int_to_tree (ctype
, mul
));
6905 /* If these operations "cancel" each other, we have the main
6906 optimizations of this pass, which occur when either constant is a
6907 multiple of the other, in which case we replace this with either an
6908 operation or CODE or TCODE.
6910 If we have an unsigned type, we cannot do this since it will change
6911 the result if the original computation overflowed. */
6912 if (TYPE_OVERFLOW_UNDEFINED (ctype
)
6913 && ((code
== MULT_EXPR
&& tcode
== EXACT_DIV_EXPR
)
6914 || (tcode
== MULT_EXPR
6915 && code
!= TRUNC_MOD_EXPR
&& code
!= CEIL_MOD_EXPR
6916 && code
!= FLOOR_MOD_EXPR
&& code
!= ROUND_MOD_EXPR
6917 && code
!= MULT_EXPR
)))
6919 if (wi::multiple_of_p (wi::to_wide (op1
), wi::to_wide (c
),
6922 if (TYPE_OVERFLOW_UNDEFINED (ctype
))
6923 *strict_overflow_p
= true;
6924 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, op0
),
6925 fold_convert (ctype
,
6926 const_binop (TRUNC_DIV_EXPR
,
6929 else if (wi::multiple_of_p (wi::to_wide (c
), wi::to_wide (op1
),
6932 if (TYPE_OVERFLOW_UNDEFINED (ctype
))
6933 *strict_overflow_p
= true;
6934 return fold_build2 (code
, ctype
, fold_convert (ctype
, op0
),
6935 fold_convert (ctype
,
6936 const_binop (TRUNC_DIV_EXPR
,
6949 /* Return a node which has the indicated constant VALUE (either 0 or
6950 1 for scalars or {-1,-1,..} or {0,0,...} for vectors),
6951 and is of the indicated TYPE. */
6954 constant_boolean_node (bool value
, tree type
)
6956 if (type
== integer_type_node
)
6957 return value
? integer_one_node
: integer_zero_node
;
6958 else if (type
== boolean_type_node
)
6959 return value
? boolean_true_node
: boolean_false_node
;
6960 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6961 return build_vector_from_val (type
,
6962 build_int_cst (TREE_TYPE (type
),
6965 return fold_convert (type
, value
? integer_one_node
: integer_zero_node
);
6969 /* Transform `a + (b ? x : y)' into `b ? (a + x) : (a + y)'.
6970 Transform, `a + (x < y)' into `(x < y) ? (a + 1) : (a + 0)'. Here
6971 CODE corresponds to the `+', COND to the `(b ? x : y)' or `(x < y)'
6972 expression, and ARG to `a'. If COND_FIRST_P is nonzero, then the
6973 COND is the first argument to CODE; otherwise (as in the example
6974 given here), it is the second argument. TYPE is the type of the
6975 original expression. Return NULL_TREE if no simplification is
6979 fold_binary_op_with_conditional_arg (location_t loc
,
6980 enum tree_code code
,
6981 tree type
, tree op0
, tree op1
,
6982 tree cond
, tree arg
, int cond_first_p
)
6984 tree cond_type
= cond_first_p
? TREE_TYPE (op0
) : TREE_TYPE (op1
);
6985 tree arg_type
= cond_first_p
? TREE_TYPE (op1
) : TREE_TYPE (op0
);
6986 tree test
, true_value
, false_value
;
6987 tree lhs
= NULL_TREE
;
6988 tree rhs
= NULL_TREE
;
6989 enum tree_code cond_code
= COND_EXPR
;
6991 /* Do not move possibly trapping operations into the conditional as this
6992 pessimizes code and causes gimplification issues when applied late. */
6993 if (operation_could_trap_p (code
, FLOAT_TYPE_P (type
),
6994 ANY_INTEGRAL_TYPE_P (type
)
6995 && TYPE_OVERFLOW_TRAPS (type
), op1
))
6998 if (TREE_CODE (cond
) == COND_EXPR
6999 || TREE_CODE (cond
) == VEC_COND_EXPR
)
7001 test
= TREE_OPERAND (cond
, 0);
7002 true_value
= TREE_OPERAND (cond
, 1);
7003 false_value
= TREE_OPERAND (cond
, 2);
7004 /* If this operand throws an expression, then it does not make
7005 sense to try to perform a logical or arithmetic operation
7007 if (VOID_TYPE_P (TREE_TYPE (true_value
)))
7009 if (VOID_TYPE_P (TREE_TYPE (false_value
)))
7012 else if (!(TREE_CODE (type
) != VECTOR_TYPE
7013 && TREE_CODE (TREE_TYPE (cond
)) == VECTOR_TYPE
))
7015 tree testtype
= TREE_TYPE (cond
);
7017 true_value
= constant_boolean_node (true, testtype
);
7018 false_value
= constant_boolean_node (false, testtype
);
7021 /* Detect the case of mixing vector and scalar types - bail out. */
7024 if (TREE_CODE (TREE_TYPE (test
)) == VECTOR_TYPE
)
7025 cond_code
= VEC_COND_EXPR
;
7027 /* This transformation is only worthwhile if we don't have to wrap ARG
7028 in a SAVE_EXPR and the operation can be simplified without recursing
7029 on at least one of the branches once its pushed inside the COND_EXPR. */
7030 if (!TREE_CONSTANT (arg
)
7031 && (TREE_SIDE_EFFECTS (arg
)
7032 || TREE_CODE (arg
) == COND_EXPR
|| TREE_CODE (arg
) == VEC_COND_EXPR
7033 || TREE_CONSTANT (true_value
) || TREE_CONSTANT (false_value
)))
7036 arg
= fold_convert_loc (loc
, arg_type
, arg
);
7039 true_value
= fold_convert_loc (loc
, cond_type
, true_value
);
7041 lhs
= fold_build2_loc (loc
, code
, type
, true_value
, arg
);
7043 lhs
= fold_build2_loc (loc
, code
, type
, arg
, true_value
);
7047 false_value
= fold_convert_loc (loc
, cond_type
, false_value
);
7049 rhs
= fold_build2_loc (loc
, code
, type
, false_value
, arg
);
7051 rhs
= fold_build2_loc (loc
, code
, type
, arg
, false_value
);
7054 /* Check that we have simplified at least one of the branches. */
7055 if (!TREE_CONSTANT (arg
) && !TREE_CONSTANT (lhs
) && !TREE_CONSTANT (rhs
))
7058 return fold_build3_loc (loc
, cond_code
, type
, test
, lhs
, rhs
);
7062 /* Subroutine of fold() that checks for the addition of +/- 0.0.
7064 If !NEGATE, return true if ADDEND is +/-0.0 and, for all X of type
7065 TYPE, X + ADDEND is the same as X. If NEGATE, return true if X -
7066 ADDEND is the same as X.
7068 X + 0 and X - 0 both give X when X is NaN, infinite, or nonzero
7069 and finite. The problematic cases are when X is zero, and its mode
7070 has signed zeros. In the case of rounding towards -infinity,
7071 X - 0 is not the same as X because 0 - 0 is -0. In other rounding
7072 modes, X + 0 is not the same as X because -0 + 0 is 0. */
7075 fold_real_zero_addition_p (const_tree type
, const_tree addend
, int negate
)
7077 if (!real_zerop (addend
))
7080 /* Don't allow the fold with -fsignaling-nans. */
7081 if (HONOR_SNANS (type
))
7084 /* Allow the fold if zeros aren't signed, or their sign isn't important. */
7085 if (!HONOR_SIGNED_ZEROS (type
))
7088 /* There is no case that is safe for all rounding modes. */
7089 if (HONOR_SIGN_DEPENDENT_ROUNDING (type
))
7092 /* In a vector or complex, we would need to check the sign of all zeros. */
7093 if (TREE_CODE (addend
) == VECTOR_CST
)
7094 addend
= uniform_vector_p (addend
);
7095 if (!addend
|| TREE_CODE (addend
) != REAL_CST
)
7098 /* Treat x + -0 as x - 0 and x - -0 as x + 0. */
7099 if (REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (addend
)))
7102 /* The mode has signed zeros, and we have to honor their sign.
7103 In this situation, there is only one case we can return true for.
7104 X - 0 is the same as X with default rounding. */
7108 /* Subroutine of match.pd that optimizes comparisons of a division by
7109 a nonzero integer constant against an integer constant, i.e.
7112 CODE is the comparison operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR,
7113 GE_EXPR or LE_EXPR. ARG01 and ARG1 must be a INTEGER_CST. */
7116 fold_div_compare (enum tree_code code
, tree c1
, tree c2
, tree
*lo
,
7117 tree
*hi
, bool *neg_overflow
)
7119 tree prod
, tmp
, type
= TREE_TYPE (c1
);
7120 signop sign
= TYPE_SIGN (type
);
7121 wi::overflow_type overflow
;
7123 /* We have to do this the hard way to detect unsigned overflow.
7124 prod = int_const_binop (MULT_EXPR, c1, c2); */
7125 wide_int val
= wi::mul (wi::to_wide (c1
), wi::to_wide (c2
), sign
, &overflow
);
7126 prod
= force_fit_type (type
, val
, -1, overflow
);
7127 *neg_overflow
= false;
7129 if (sign
== UNSIGNED
)
7131 tmp
= int_const_binop (MINUS_EXPR
, c1
, build_int_cst (type
, 1));
7134 /* Likewise *hi = int_const_binop (PLUS_EXPR, prod, tmp). */
7135 val
= wi::add (wi::to_wide (prod
), wi::to_wide (tmp
), sign
, &overflow
);
7136 *hi
= force_fit_type (type
, val
, -1, overflow
| TREE_OVERFLOW (prod
));
7138 else if (tree_int_cst_sgn (c1
) >= 0)
7140 tmp
= int_const_binop (MINUS_EXPR
, c1
, build_int_cst (type
, 1));
7141 switch (tree_int_cst_sgn (c2
))
7144 *neg_overflow
= true;
7145 *lo
= int_const_binop (MINUS_EXPR
, prod
, tmp
);
7150 *lo
= fold_negate_const (tmp
, type
);
7155 *hi
= int_const_binop (PLUS_EXPR
, prod
, tmp
);
7165 /* A negative divisor reverses the relational operators. */
7166 code
= swap_tree_comparison (code
);
7168 tmp
= int_const_binop (PLUS_EXPR
, c1
, build_int_cst (type
, 1));
7169 switch (tree_int_cst_sgn (c2
))
7172 *hi
= int_const_binop (MINUS_EXPR
, prod
, tmp
);
7177 *hi
= fold_negate_const (tmp
, type
);
7182 *neg_overflow
= true;
7183 *lo
= int_const_binop (PLUS_EXPR
, prod
, tmp
);
7192 if (code
!= EQ_EXPR
&& code
!= NE_EXPR
)
7195 if (TREE_OVERFLOW (*lo
)
7196 || operand_equal_p (*lo
, TYPE_MIN_VALUE (type
), 0))
7198 if (TREE_OVERFLOW (*hi
)
7199 || operand_equal_p (*hi
, TYPE_MAX_VALUE (type
), 0))
7206 /* If CODE with arguments ARG0 and ARG1 represents a single bit
7207 equality/inequality test, then return a simplified form of the test
7208 using a sign testing. Otherwise return NULL. TYPE is the desired
7212 fold_single_bit_test_into_sign_test (location_t loc
,
7213 enum tree_code code
, tree arg0
, tree arg1
,
7216 /* If this is testing a single bit, we can optimize the test. */
7217 if ((code
== NE_EXPR
|| code
== EQ_EXPR
)
7218 && TREE_CODE (arg0
) == BIT_AND_EXPR
&& integer_zerop (arg1
)
7219 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
7221 /* If we have (A & C) != 0 where C is the sign bit of A, convert
7222 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
7223 tree arg00
= sign_bit_p (TREE_OPERAND (arg0
, 0), TREE_OPERAND (arg0
, 1));
7225 if (arg00
!= NULL_TREE
7226 /* This is only a win if casting to a signed type is cheap,
7227 i.e. when arg00's type is not a partial mode. */
7228 && type_has_mode_precision_p (TREE_TYPE (arg00
)))
7230 tree stype
= signed_type_for (TREE_TYPE (arg00
));
7231 return fold_build2_loc (loc
, code
== EQ_EXPR
? GE_EXPR
: LT_EXPR
,
7233 fold_convert_loc (loc
, stype
, arg00
),
7234 build_int_cst (stype
, 0));
7241 /* If CODE with arguments ARG0 and ARG1 represents a single bit
7242 equality/inequality test, then return a simplified form of
7243 the test using shifts and logical operations. Otherwise return
7244 NULL. TYPE is the desired result type. */
7247 fold_single_bit_test (location_t loc
, enum tree_code code
,
7248 tree arg0
, tree arg1
, tree result_type
)
7250 /* If this is testing a single bit, we can optimize the test. */
7251 if ((code
== NE_EXPR
|| code
== EQ_EXPR
)
7252 && TREE_CODE (arg0
) == BIT_AND_EXPR
&& integer_zerop (arg1
)
7253 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
7255 tree inner
= TREE_OPERAND (arg0
, 0);
7256 tree type
= TREE_TYPE (arg0
);
7257 int bitnum
= tree_log2 (TREE_OPERAND (arg0
, 1));
7258 scalar_int_mode operand_mode
= SCALAR_INT_TYPE_MODE (type
);
7260 tree signed_type
, unsigned_type
, intermediate_type
;
7263 /* First, see if we can fold the single bit test into a sign-bit
7265 tem
= fold_single_bit_test_into_sign_test (loc
, code
, arg0
, arg1
,
7270 /* Otherwise we have (A & C) != 0 where C is a single bit,
7271 convert that into ((A >> C2) & 1). Where C2 = log2(C).
7272 Similarly for (A & C) == 0. */
7274 /* If INNER is a right shift of a constant and it plus BITNUM does
7275 not overflow, adjust BITNUM and INNER. */
7276 if (TREE_CODE (inner
) == RSHIFT_EXPR
7277 && TREE_CODE (TREE_OPERAND (inner
, 1)) == INTEGER_CST
7278 && bitnum
< TYPE_PRECISION (type
)
7279 && wi::ltu_p (wi::to_wide (TREE_OPERAND (inner
, 1)),
7280 TYPE_PRECISION (type
) - bitnum
))
7282 bitnum
+= tree_to_uhwi (TREE_OPERAND (inner
, 1));
7283 inner
= TREE_OPERAND (inner
, 0);
7286 /* If we are going to be able to omit the AND below, we must do our
7287 operations as unsigned. If we must use the AND, we have a choice.
7288 Normally unsigned is faster, but for some machines signed is. */
7289 ops_unsigned
= (load_extend_op (operand_mode
) == SIGN_EXTEND
7290 && !flag_syntax_only
) ? 0 : 1;
7292 signed_type
= lang_hooks
.types
.type_for_mode (operand_mode
, 0);
7293 unsigned_type
= lang_hooks
.types
.type_for_mode (operand_mode
, 1);
7294 intermediate_type
= ops_unsigned
? unsigned_type
: signed_type
;
7295 inner
= fold_convert_loc (loc
, intermediate_type
, inner
);
7298 inner
= build2 (RSHIFT_EXPR
, intermediate_type
,
7299 inner
, size_int (bitnum
));
7301 one
= build_int_cst (intermediate_type
, 1);
7303 if (code
== EQ_EXPR
)
7304 inner
= fold_build2_loc (loc
, BIT_XOR_EXPR
, intermediate_type
, inner
, one
);
7306 /* Put the AND last so it can combine with more things. */
7307 inner
= build2 (BIT_AND_EXPR
, intermediate_type
, inner
, one
);
7309 /* Make sure to return the proper type. */
7310 inner
= fold_convert_loc (loc
, result_type
, inner
);
7317 /* Test whether it is preferable two swap two operands, ARG0 and
7318 ARG1, for example because ARG0 is an integer constant and ARG1
7322 tree_swap_operands_p (const_tree arg0
, const_tree arg1
)
7324 if (CONSTANT_CLASS_P (arg1
))
7326 if (CONSTANT_CLASS_P (arg0
))
7332 if (TREE_CONSTANT (arg1
))
7334 if (TREE_CONSTANT (arg0
))
7337 /* It is preferable to swap two SSA_NAME to ensure a canonical form
7338 for commutative and comparison operators. Ensuring a canonical
7339 form allows the optimizers to find additional redundancies without
7340 having to explicitly check for both orderings. */
7341 if (TREE_CODE (arg0
) == SSA_NAME
7342 && TREE_CODE (arg1
) == SSA_NAME
7343 && SSA_NAME_VERSION (arg0
) > SSA_NAME_VERSION (arg1
))
7346 /* Put SSA_NAMEs last. */
7347 if (TREE_CODE (arg1
) == SSA_NAME
)
7349 if (TREE_CODE (arg0
) == SSA_NAME
)
7352 /* Put variables last. */
7362 /* Fold A < X && A + 1 > Y to A < X && A >= Y. Normally A + 1 > Y
7363 means A >= Y && A != MAX, but in this case we know that
7364 A < X <= MAX. INEQ is A + 1 > Y, BOUND is A < X. */
7367 fold_to_nonsharp_ineq_using_bound (location_t loc
, tree ineq
, tree bound
)
7369 tree a
, typea
, type
= TREE_TYPE (ineq
), a1
, diff
, y
;
7371 if (TREE_CODE (bound
) == LT_EXPR
)
7372 a
= TREE_OPERAND (bound
, 0);
7373 else if (TREE_CODE (bound
) == GT_EXPR
)
7374 a
= TREE_OPERAND (bound
, 1);
7378 typea
= TREE_TYPE (a
);
7379 if (!INTEGRAL_TYPE_P (typea
)
7380 && !POINTER_TYPE_P (typea
))
7383 if (TREE_CODE (ineq
) == LT_EXPR
)
7385 a1
= TREE_OPERAND (ineq
, 1);
7386 y
= TREE_OPERAND (ineq
, 0);
7388 else if (TREE_CODE (ineq
) == GT_EXPR
)
7390 a1
= TREE_OPERAND (ineq
, 0);
7391 y
= TREE_OPERAND (ineq
, 1);
7396 if (TREE_TYPE (a1
) != typea
)
7399 if (POINTER_TYPE_P (typea
))
7401 /* Convert the pointer types into integer before taking the difference. */
7402 tree ta
= fold_convert_loc (loc
, ssizetype
, a
);
7403 tree ta1
= fold_convert_loc (loc
, ssizetype
, a1
);
7404 diff
= fold_binary_loc (loc
, MINUS_EXPR
, ssizetype
, ta1
, ta
);
7407 diff
= fold_binary_loc (loc
, MINUS_EXPR
, typea
, a1
, a
);
7409 if (!diff
|| !integer_onep (diff
))
7412 return fold_build2_loc (loc
, GE_EXPR
, type
, a
, y
);
7415 /* Fold a sum or difference of at least one multiplication.
7416 Returns the folded tree or NULL if no simplification could be made. */
7419 fold_plusminus_mult_expr (location_t loc
, enum tree_code code
, tree type
,
7420 tree arg0
, tree arg1
)
7422 tree arg00
, arg01
, arg10
, arg11
;
7423 tree alt0
= NULL_TREE
, alt1
= NULL_TREE
, same
;
7425 /* (A * C) +- (B * C) -> (A+-B) * C.
7426 (A * C) +- A -> A * (C+-1).
7427 We are most concerned about the case where C is a constant,
7428 but other combinations show up during loop reduction. Since
7429 it is not difficult, try all four possibilities. */
7431 if (TREE_CODE (arg0
) == MULT_EXPR
)
7433 arg00
= TREE_OPERAND (arg0
, 0);
7434 arg01
= TREE_OPERAND (arg0
, 1);
7436 else if (TREE_CODE (arg0
) == INTEGER_CST
)
7438 arg00
= build_one_cst (type
);
7443 /* We cannot generate constant 1 for fract. */
7444 if (ALL_FRACT_MODE_P (TYPE_MODE (type
)))
7447 arg01
= build_one_cst (type
);
7449 if (TREE_CODE (arg1
) == MULT_EXPR
)
7451 arg10
= TREE_OPERAND (arg1
, 0);
7452 arg11
= TREE_OPERAND (arg1
, 1);
7454 else if (TREE_CODE (arg1
) == INTEGER_CST
)
7456 arg10
= build_one_cst (type
);
7457 /* As we canonicalize A - 2 to A + -2 get rid of that sign for
7458 the purpose of this canonicalization. */
7459 if (wi::neg_p (wi::to_wide (arg1
), TYPE_SIGN (TREE_TYPE (arg1
)))
7460 && negate_expr_p (arg1
)
7461 && code
== PLUS_EXPR
)
7463 arg11
= negate_expr (arg1
);
7471 /* We cannot generate constant 1 for fract. */
7472 if (ALL_FRACT_MODE_P (TYPE_MODE (type
)))
7475 arg11
= build_one_cst (type
);
7479 /* Prefer factoring a common non-constant. */
7480 if (operand_equal_p (arg00
, arg10
, 0))
7481 same
= arg00
, alt0
= arg01
, alt1
= arg11
;
7482 else if (operand_equal_p (arg01
, arg11
, 0))
7483 same
= arg01
, alt0
= arg00
, alt1
= arg10
;
7484 else if (operand_equal_p (arg00
, arg11
, 0))
7485 same
= arg00
, alt0
= arg01
, alt1
= arg10
;
7486 else if (operand_equal_p (arg01
, arg10
, 0))
7487 same
= arg01
, alt0
= arg00
, alt1
= arg11
;
7489 /* No identical multiplicands; see if we can find a common
7490 power-of-two factor in non-power-of-two multiplies. This
7491 can help in multi-dimensional array access. */
7492 else if (tree_fits_shwi_p (arg01
) && tree_fits_shwi_p (arg11
))
7494 HOST_WIDE_INT int01
= tree_to_shwi (arg01
);
7495 HOST_WIDE_INT int11
= tree_to_shwi (arg11
);
7500 /* Move min of absolute values to int11. */
7501 if (absu_hwi (int01
) < absu_hwi (int11
))
7503 tmp
= int01
, int01
= int11
, int11
= tmp
;
7504 alt0
= arg00
, arg00
= arg10
, arg10
= alt0
;
7511 const unsigned HOST_WIDE_INT factor
= absu_hwi (int11
);
7513 && pow2p_hwi (factor
)
7514 && (int01
& (factor
- 1)) == 0
7515 /* The remainder should not be a constant, otherwise we
7516 end up folding i * 4 + 2 to (i * 2 + 1) * 2 which has
7517 increased the number of multiplications necessary. */
7518 && TREE_CODE (arg10
) != INTEGER_CST
)
7520 alt0
= fold_build2_loc (loc
, MULT_EXPR
, TREE_TYPE (arg00
), arg00
,
7521 build_int_cst (TREE_TYPE (arg00
),
7526 maybe_same
= alt0
, alt0
= alt1
, alt1
= maybe_same
;
7533 if (! ANY_INTEGRAL_TYPE_P (type
)
7534 || TYPE_OVERFLOW_WRAPS (type
)
7535 /* We are neither factoring zero nor minus one. */
7536 || TREE_CODE (same
) == INTEGER_CST
)
7537 return fold_build2_loc (loc
, MULT_EXPR
, type
,
7538 fold_build2_loc (loc
, code
, type
,
7539 fold_convert_loc (loc
, type
, alt0
),
7540 fold_convert_loc (loc
, type
, alt1
)),
7541 fold_convert_loc (loc
, type
, same
));
7543 /* Same may be zero and thus the operation 'code' may overflow. Likewise
7544 same may be minus one and thus the multiplication may overflow. Perform
7545 the sum operation in an unsigned type. */
7546 tree utype
= unsigned_type_for (type
);
7547 tree tem
= fold_build2_loc (loc
, code
, utype
,
7548 fold_convert_loc (loc
, utype
, alt0
),
7549 fold_convert_loc (loc
, utype
, alt1
));
7550 /* If the sum evaluated to a constant that is not -INF the multiplication
7552 if (TREE_CODE (tem
) == INTEGER_CST
7553 && (wi::to_wide (tem
)
7554 != wi::min_value (TYPE_PRECISION (utype
), SIGNED
)))
7555 return fold_build2_loc (loc
, MULT_EXPR
, type
,
7556 fold_convert (type
, tem
), same
);
7558 /* Do not resort to unsigned multiplication because
7559 we lose the no-overflow property of the expression. */
7563 /* Subroutine of native_encode_expr. Encode the INTEGER_CST
7564 specified by EXPR into the buffer PTR of length LEN bytes.
7565 Return the number of bytes placed in the buffer, or zero
7569 native_encode_int (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7571 tree type
= TREE_TYPE (expr
);
7572 int total_bytes
= GET_MODE_SIZE (SCALAR_INT_TYPE_MODE (type
));
7573 int byte
, offset
, word
, words
;
7574 unsigned char value
;
7576 if ((off
== -1 && total_bytes
> len
) || off
>= total_bytes
)
7583 return MIN (len
, total_bytes
- off
);
7585 words
= total_bytes
/ UNITS_PER_WORD
;
7587 for (byte
= 0; byte
< total_bytes
; byte
++)
7589 int bitpos
= byte
* BITS_PER_UNIT
;
7590 /* Extend EXPR according to TYPE_SIGN if the precision isn't a whole
7592 value
= wi::extract_uhwi (wi::to_widest (expr
), bitpos
, BITS_PER_UNIT
);
7594 if (total_bytes
> UNITS_PER_WORD
)
7596 word
= byte
/ UNITS_PER_WORD
;
7597 if (WORDS_BIG_ENDIAN
)
7598 word
= (words
- 1) - word
;
7599 offset
= word
* UNITS_PER_WORD
;
7600 if (BYTES_BIG_ENDIAN
)
7601 offset
+= (UNITS_PER_WORD
- 1) - (byte
% UNITS_PER_WORD
);
7603 offset
+= byte
% UNITS_PER_WORD
;
7606 offset
= BYTES_BIG_ENDIAN
? (total_bytes
- 1) - byte
: byte
;
7607 if (offset
>= off
&& offset
- off
< len
)
7608 ptr
[offset
- off
] = value
;
7610 return MIN (len
, total_bytes
- off
);
7614 /* Subroutine of native_encode_expr. Encode the FIXED_CST
7615 specified by EXPR into the buffer PTR of length LEN bytes.
7616 Return the number of bytes placed in the buffer, or zero
7620 native_encode_fixed (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7622 tree type
= TREE_TYPE (expr
);
7623 scalar_mode mode
= SCALAR_TYPE_MODE (type
);
7624 int total_bytes
= GET_MODE_SIZE (mode
);
7625 FIXED_VALUE_TYPE value
;
7626 tree i_value
, i_type
;
7628 if (total_bytes
* BITS_PER_UNIT
> HOST_BITS_PER_DOUBLE_INT
)
7631 i_type
= lang_hooks
.types
.type_for_size (GET_MODE_BITSIZE (mode
), 1);
7633 if (NULL_TREE
== i_type
|| TYPE_PRECISION (i_type
) != total_bytes
)
7636 value
= TREE_FIXED_CST (expr
);
7637 i_value
= double_int_to_tree (i_type
, value
.data
);
7639 return native_encode_int (i_value
, ptr
, len
, off
);
7643 /* Subroutine of native_encode_expr. Encode the REAL_CST
7644 specified by EXPR into the buffer PTR of length LEN bytes.
7645 Return the number of bytes placed in the buffer, or zero
7649 native_encode_real (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7651 tree type
= TREE_TYPE (expr
);
7652 int total_bytes
= GET_MODE_SIZE (SCALAR_FLOAT_TYPE_MODE (type
));
7653 int byte
, offset
, word
, words
, bitpos
;
7654 unsigned char value
;
7656 /* There are always 32 bits in each long, no matter the size of
7657 the hosts long. We handle floating point representations with
7661 if ((off
== -1 && total_bytes
> len
) || off
>= total_bytes
)
7668 return MIN (len
, total_bytes
- off
);
7670 words
= (32 / BITS_PER_UNIT
) / UNITS_PER_WORD
;
7672 real_to_target (tmp
, TREE_REAL_CST_PTR (expr
), TYPE_MODE (type
));
7674 for (bitpos
= 0; bitpos
< total_bytes
* BITS_PER_UNIT
;
7675 bitpos
+= BITS_PER_UNIT
)
7677 byte
= (bitpos
/ BITS_PER_UNIT
) & 3;
7678 value
= (unsigned char) (tmp
[bitpos
/ 32] >> (bitpos
& 31));
7680 if (UNITS_PER_WORD
< 4)
7682 word
= byte
/ UNITS_PER_WORD
;
7683 if (WORDS_BIG_ENDIAN
)
7684 word
= (words
- 1) - word
;
7685 offset
= word
* UNITS_PER_WORD
;
7686 if (BYTES_BIG_ENDIAN
)
7687 offset
+= (UNITS_PER_WORD
- 1) - (byte
% UNITS_PER_WORD
);
7689 offset
+= byte
% UNITS_PER_WORD
;
7694 if (BYTES_BIG_ENDIAN
)
7696 /* Reverse bytes within each long, or within the entire float
7697 if it's smaller than a long (for HFmode). */
7698 offset
= MIN (3, total_bytes
- 1) - offset
;
7699 gcc_assert (offset
>= 0);
7702 offset
= offset
+ ((bitpos
/ BITS_PER_UNIT
) & ~3);
7704 && offset
- off
< len
)
7705 ptr
[offset
- off
] = value
;
7707 return MIN (len
, total_bytes
- off
);
7710 /* Subroutine of native_encode_expr. Encode the COMPLEX_CST
7711 specified by EXPR into the buffer PTR of length LEN bytes.
7712 Return the number of bytes placed in the buffer, or zero
7716 native_encode_complex (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7721 part
= TREE_REALPART (expr
);
7722 rsize
= native_encode_expr (part
, ptr
, len
, off
);
7723 if (off
== -1 && rsize
== 0)
7725 part
= TREE_IMAGPART (expr
);
7727 off
= MAX (0, off
- GET_MODE_SIZE (SCALAR_TYPE_MODE (TREE_TYPE (part
))));
7728 isize
= native_encode_expr (part
, ptr
? ptr
+ rsize
: NULL
,
7730 if (off
== -1 && isize
!= rsize
)
7732 return rsize
+ isize
;
7735 /* Like native_encode_vector, but only encode the first COUNT elements.
7736 The other arguments are as for native_encode_vector. */
7739 native_encode_vector_part (const_tree expr
, unsigned char *ptr
, int len
,
7740 int off
, unsigned HOST_WIDE_INT count
)
7742 tree itype
= TREE_TYPE (TREE_TYPE (expr
));
7743 if (VECTOR_BOOLEAN_TYPE_P (TREE_TYPE (expr
))
7744 && TYPE_PRECISION (itype
) <= BITS_PER_UNIT
)
7746 /* This is the only case in which elements can be smaller than a byte.
7747 Element 0 is always in the lsb of the containing byte. */
7748 unsigned int elt_bits
= TYPE_PRECISION (itype
);
7749 int total_bytes
= CEIL (elt_bits
* count
, BITS_PER_UNIT
);
7750 if ((off
== -1 && total_bytes
> len
) || off
>= total_bytes
)
7756 /* Zero the buffer and then set bits later where necessary. */
7757 int extract_bytes
= MIN (len
, total_bytes
- off
);
7759 memset (ptr
, 0, extract_bytes
);
7761 unsigned int elts_per_byte
= BITS_PER_UNIT
/ elt_bits
;
7762 unsigned int first_elt
= off
* elts_per_byte
;
7763 unsigned int extract_elts
= extract_bytes
* elts_per_byte
;
7764 for (unsigned int i
= 0; i
< extract_elts
; ++i
)
7766 tree elt
= VECTOR_CST_ELT (expr
, first_elt
+ i
);
7767 if (TREE_CODE (elt
) != INTEGER_CST
)
7770 if (ptr
&& wi::extract_uhwi (wi::to_wide (elt
), 0, 1))
7772 unsigned int bit
= i
* elt_bits
;
7773 ptr
[bit
/ BITS_PER_UNIT
] |= 1 << (bit
% BITS_PER_UNIT
);
7776 return extract_bytes
;
7780 int size
= GET_MODE_SIZE (SCALAR_TYPE_MODE (itype
));
7781 for (unsigned HOST_WIDE_INT i
= 0; i
< count
; i
++)
7788 tree elem
= VECTOR_CST_ELT (expr
, i
);
7789 int res
= native_encode_expr (elem
, ptr
? ptr
+ offset
: NULL
,
7791 if ((off
== -1 && res
!= size
) || res
== 0)
7795 return (off
== -1 && i
< count
- 1) ? 0 : offset
;
7802 /* Subroutine of native_encode_expr. Encode the VECTOR_CST
7803 specified by EXPR into the buffer PTR of length LEN bytes.
7804 Return the number of bytes placed in the buffer, or zero
7808 native_encode_vector (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7810 unsigned HOST_WIDE_INT count
;
7811 if (!VECTOR_CST_NELTS (expr
).is_constant (&count
))
7813 return native_encode_vector_part (expr
, ptr
, len
, off
, count
);
7817 /* Subroutine of native_encode_expr. Encode the STRING_CST
7818 specified by EXPR into the buffer PTR of length LEN bytes.
7819 Return the number of bytes placed in the buffer, or zero
7823 native_encode_string (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7825 tree type
= TREE_TYPE (expr
);
7827 /* Wide-char strings are encoded in target byte-order so native
7828 encoding them is trivial. */
7829 if (BITS_PER_UNIT
!= CHAR_BIT
7830 || TREE_CODE (type
) != ARRAY_TYPE
7831 || TREE_CODE (TREE_TYPE (type
)) != INTEGER_TYPE
7832 || !tree_fits_shwi_p (TYPE_SIZE_UNIT (type
)))
7835 HOST_WIDE_INT total_bytes
= tree_to_shwi (TYPE_SIZE_UNIT (TREE_TYPE (expr
)));
7836 if ((off
== -1 && total_bytes
> len
) || off
>= total_bytes
)
7842 else if (TREE_STRING_LENGTH (expr
) - off
< MIN (total_bytes
, len
))
7845 if (off
< TREE_STRING_LENGTH (expr
))
7847 written
= MIN (len
, TREE_STRING_LENGTH (expr
) - off
);
7848 memcpy (ptr
, TREE_STRING_POINTER (expr
) + off
, written
);
7850 memset (ptr
+ written
, 0,
7851 MIN (total_bytes
- written
, len
- written
));
7854 memcpy (ptr
, TREE_STRING_POINTER (expr
) + off
, MIN (total_bytes
, len
));
7855 return MIN (total_bytes
- off
, len
);
7859 /* Subroutine of fold_view_convert_expr. Encode the INTEGER_CST,
7860 REAL_CST, COMPLEX_CST or VECTOR_CST specified by EXPR into the
7861 buffer PTR of length LEN bytes. If PTR is NULL, don't actually store
7862 anything, just do a dry run. If OFF is not -1 then start
7863 the encoding at byte offset OFF and encode at most LEN bytes.
7864 Return the number of bytes placed in the buffer, or zero upon failure. */
7867 native_encode_expr (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7869 /* We don't support starting at negative offset and -1 is special. */
7873 switch (TREE_CODE (expr
))
7876 return native_encode_int (expr
, ptr
, len
, off
);
7879 return native_encode_real (expr
, ptr
, len
, off
);
7882 return native_encode_fixed (expr
, ptr
, len
, off
);
7885 return native_encode_complex (expr
, ptr
, len
, off
);
7888 return native_encode_vector (expr
, ptr
, len
, off
);
7891 return native_encode_string (expr
, ptr
, len
, off
);
7899 /* Subroutine of native_interpret_expr. Interpret the contents of
7900 the buffer PTR of length LEN as an INTEGER_CST of type TYPE.
7901 If the buffer cannot be interpreted, return NULL_TREE. */
7904 native_interpret_int (tree type
, const unsigned char *ptr
, int len
)
7906 int total_bytes
= GET_MODE_SIZE (SCALAR_INT_TYPE_MODE (type
));
7908 if (total_bytes
> len
7909 || total_bytes
* BITS_PER_UNIT
> HOST_BITS_PER_DOUBLE_INT
)
7912 wide_int result
= wi::from_buffer (ptr
, total_bytes
);
7914 return wide_int_to_tree (type
, result
);
7918 /* Subroutine of native_interpret_expr. Interpret the contents of
7919 the buffer PTR of length LEN as a FIXED_CST of type TYPE.
7920 If the buffer cannot be interpreted, return NULL_TREE. */
7923 native_interpret_fixed (tree type
, const unsigned char *ptr
, int len
)
7925 scalar_mode mode
= SCALAR_TYPE_MODE (type
);
7926 int total_bytes
= GET_MODE_SIZE (mode
);
7928 FIXED_VALUE_TYPE fixed_value
;
7930 if (total_bytes
> len
7931 || total_bytes
* BITS_PER_UNIT
> HOST_BITS_PER_DOUBLE_INT
)
7934 result
= double_int::from_buffer (ptr
, total_bytes
);
7935 fixed_value
= fixed_from_double_int (result
, mode
);
7937 return build_fixed (type
, fixed_value
);
7941 /* Subroutine of native_interpret_expr. Interpret the contents of
7942 the buffer PTR of length LEN as a REAL_CST of type TYPE.
7943 If the buffer cannot be interpreted, return NULL_TREE. */
7946 native_interpret_real (tree type
, const unsigned char *ptr
, int len
)
7948 scalar_float_mode mode
= SCALAR_FLOAT_TYPE_MODE (type
);
7949 int total_bytes
= GET_MODE_SIZE (mode
);
7950 unsigned char value
;
7951 /* There are always 32 bits in each long, no matter the size of
7952 the hosts long. We handle floating point representations with
7957 if (total_bytes
> len
|| total_bytes
> 24)
7959 int words
= (32 / BITS_PER_UNIT
) / UNITS_PER_WORD
;
7961 memset (tmp
, 0, sizeof (tmp
));
7962 for (int bitpos
= 0; bitpos
< total_bytes
* BITS_PER_UNIT
;
7963 bitpos
+= BITS_PER_UNIT
)
7965 /* Both OFFSET and BYTE index within a long;
7966 bitpos indexes the whole float. */
7967 int offset
, byte
= (bitpos
/ BITS_PER_UNIT
) & 3;
7968 if (UNITS_PER_WORD
< 4)
7970 int word
= byte
/ UNITS_PER_WORD
;
7971 if (WORDS_BIG_ENDIAN
)
7972 word
= (words
- 1) - word
;
7973 offset
= word
* UNITS_PER_WORD
;
7974 if (BYTES_BIG_ENDIAN
)
7975 offset
+= (UNITS_PER_WORD
- 1) - (byte
% UNITS_PER_WORD
);
7977 offset
+= byte
% UNITS_PER_WORD
;
7982 if (BYTES_BIG_ENDIAN
)
7984 /* Reverse bytes within each long, or within the entire float
7985 if it's smaller than a long (for HFmode). */
7986 offset
= MIN (3, total_bytes
- 1) - offset
;
7987 gcc_assert (offset
>= 0);
7990 value
= ptr
[offset
+ ((bitpos
/ BITS_PER_UNIT
) & ~3)];
7992 tmp
[bitpos
/ 32] |= (unsigned long)value
<< (bitpos
& 31);
7995 real_from_target (&r
, tmp
, mode
);
7996 return build_real (type
, r
);
8000 /* Subroutine of native_interpret_expr. Interpret the contents of
8001 the buffer PTR of length LEN as a COMPLEX_CST of type TYPE.
8002 If the buffer cannot be interpreted, return NULL_TREE. */
8005 native_interpret_complex (tree type
, const unsigned char *ptr
, int len
)
8007 tree etype
, rpart
, ipart
;
8010 etype
= TREE_TYPE (type
);
8011 size
= GET_MODE_SIZE (SCALAR_TYPE_MODE (etype
));
8014 rpart
= native_interpret_expr (etype
, ptr
, size
);
8017 ipart
= native_interpret_expr (etype
, ptr
+size
, size
);
8020 return build_complex (type
, rpart
, ipart
);
8023 /* Read a vector of type TYPE from the target memory image given by BYTES,
8024 which contains LEN bytes. The vector is known to be encodable using
8025 NPATTERNS interleaved patterns with NELTS_PER_PATTERN elements each.
8027 Return the vector on success, otherwise return null. */
8030 native_interpret_vector_part (tree type
, const unsigned char *bytes
,
8031 unsigned int len
, unsigned int npatterns
,
8032 unsigned int nelts_per_pattern
)
8034 tree elt_type
= TREE_TYPE (type
);
8035 if (VECTOR_BOOLEAN_TYPE_P (type
)
8036 && TYPE_PRECISION (elt_type
) <= BITS_PER_UNIT
)
8038 /* This is the only case in which elements can be smaller than a byte.
8039 Element 0 is always in the lsb of the containing byte. */
8040 unsigned int elt_bits
= TYPE_PRECISION (elt_type
);
8041 if (elt_bits
* npatterns
* nelts_per_pattern
> len
* BITS_PER_UNIT
)
8044 tree_vector_builder
builder (type
, npatterns
, nelts_per_pattern
);
8045 for (unsigned int i
= 0; i
< builder
.encoded_nelts (); ++i
)
8047 unsigned int bit_index
= i
* elt_bits
;
8048 unsigned int byte_index
= bit_index
/ BITS_PER_UNIT
;
8049 unsigned int lsb
= bit_index
% BITS_PER_UNIT
;
8050 builder
.quick_push (bytes
[byte_index
] & (1 << lsb
)
8051 ? build_all_ones_cst (elt_type
)
8052 : build_zero_cst (elt_type
));
8054 return builder
.build ();
8057 unsigned int elt_bytes
= tree_to_uhwi (TYPE_SIZE_UNIT (elt_type
));
8058 if (elt_bytes
* npatterns
* nelts_per_pattern
> len
)
8061 tree_vector_builder
builder (type
, npatterns
, nelts_per_pattern
);
8062 for (unsigned int i
= 0; i
< builder
.encoded_nelts (); ++i
)
8064 tree elt
= native_interpret_expr (elt_type
, bytes
, elt_bytes
);
8067 builder
.quick_push (elt
);
8070 return builder
.build ();
8073 /* Subroutine of native_interpret_expr. Interpret the contents of
8074 the buffer PTR of length LEN as a VECTOR_CST of type TYPE.
8075 If the buffer cannot be interpreted, return NULL_TREE. */
8078 native_interpret_vector (tree type
, const unsigned char *ptr
, unsigned int len
)
8082 unsigned HOST_WIDE_INT count
;
8084 etype
= TREE_TYPE (type
);
8085 size
= GET_MODE_SIZE (SCALAR_TYPE_MODE (etype
));
8086 if (!TYPE_VECTOR_SUBPARTS (type
).is_constant (&count
)
8087 || size
* count
> len
)
8090 return native_interpret_vector_part (type
, ptr
, len
, count
, 1);
8094 /* Subroutine of fold_view_convert_expr. Interpret the contents of
8095 the buffer PTR of length LEN as a constant of type TYPE. For
8096 INTEGRAL_TYPE_P we return an INTEGER_CST, for SCALAR_FLOAT_TYPE_P
8097 we return a REAL_CST, etc... If the buffer cannot be interpreted,
8098 return NULL_TREE. */
8101 native_interpret_expr (tree type
, const unsigned char *ptr
, int len
)
8103 switch (TREE_CODE (type
))
8109 case REFERENCE_TYPE
:
8110 return native_interpret_int (type
, ptr
, len
);
8113 return native_interpret_real (type
, ptr
, len
);
8115 case FIXED_POINT_TYPE
:
8116 return native_interpret_fixed (type
, ptr
, len
);
8119 return native_interpret_complex (type
, ptr
, len
);
8122 return native_interpret_vector (type
, ptr
, len
);
8129 /* Returns true if we can interpret the contents of a native encoding
8133 can_native_interpret_type_p (tree type
)
8135 switch (TREE_CODE (type
))
8141 case REFERENCE_TYPE
:
8142 case FIXED_POINT_TYPE
:
8152 /* Try to view-convert VECTOR_CST EXPR to VECTOR_TYPE TYPE by operating
8153 directly on the VECTOR_CST encoding, in a way that works for variable-
8154 length vectors. Return the resulting VECTOR_CST on success or null
8158 fold_view_convert_vector_encoding (tree type
, tree expr
)
8160 tree expr_type
= TREE_TYPE (expr
);
8161 poly_uint64 type_bits
, expr_bits
;
8162 if (!poly_int_tree_p (TYPE_SIZE (type
), &type_bits
)
8163 || !poly_int_tree_p (TYPE_SIZE (expr_type
), &expr_bits
))
8166 poly_uint64 type_units
= TYPE_VECTOR_SUBPARTS (type
);
8167 poly_uint64 expr_units
= TYPE_VECTOR_SUBPARTS (expr_type
);
8168 unsigned int type_elt_bits
= vector_element_size (type_bits
, type_units
);
8169 unsigned int expr_elt_bits
= vector_element_size (expr_bits
, expr_units
);
8171 /* We can only preserve the semantics of a stepped pattern if the new
8172 vector element is an integer of the same size. */
8173 if (VECTOR_CST_STEPPED_P (expr
)
8174 && (!INTEGRAL_TYPE_P (type
) || type_elt_bits
!= expr_elt_bits
))
8177 /* The number of bits needed to encode one element from every pattern
8178 of the original vector. */
8179 unsigned int expr_sequence_bits
8180 = VECTOR_CST_NPATTERNS (expr
) * expr_elt_bits
;
8182 /* The number of bits needed to encode one element from every pattern
8184 unsigned int type_sequence_bits
8185 = least_common_multiple (expr_sequence_bits
, type_elt_bits
);
8187 /* Don't try to read more bytes than are available, which can happen
8188 for constant-sized vectors if TYPE has larger elements than EXPR_TYPE.
8189 The general VIEW_CONVERT handling can cope with that case, so there's
8190 no point complicating things here. */
8191 unsigned int nelts_per_pattern
= VECTOR_CST_NELTS_PER_PATTERN (expr
);
8192 unsigned int buffer_bytes
= CEIL (nelts_per_pattern
* type_sequence_bits
,
8194 unsigned int buffer_bits
= buffer_bytes
* BITS_PER_UNIT
;
8195 if (known_gt (buffer_bits
, expr_bits
))
8198 /* Get enough bytes of EXPR to form the new encoding. */
8199 auto_vec
<unsigned char, 128> buffer (buffer_bytes
);
8200 buffer
.quick_grow (buffer_bytes
);
8201 if (native_encode_vector_part (expr
, buffer
.address (), buffer_bytes
, 0,
8202 buffer_bits
/ expr_elt_bits
)
8203 != (int) buffer_bytes
)
8206 /* Reencode the bytes as TYPE. */
8207 unsigned int type_npatterns
= type_sequence_bits
/ type_elt_bits
;
8208 return native_interpret_vector_part (type
, &buffer
[0], buffer
.length (),
8209 type_npatterns
, nelts_per_pattern
);
8212 /* Fold a VIEW_CONVERT_EXPR of a constant expression EXPR to type
8213 TYPE at compile-time. If we're unable to perform the conversion
8214 return NULL_TREE. */
8217 fold_view_convert_expr (tree type
, tree expr
)
8219 /* We support up to 512-bit values (for V8DFmode). */
8220 unsigned char buffer
[64];
8223 /* Check that the host and target are sane. */
8224 if (CHAR_BIT
!= 8 || BITS_PER_UNIT
!= 8)
8227 if (VECTOR_TYPE_P (type
) && TREE_CODE (expr
) == VECTOR_CST
)
8228 if (tree res
= fold_view_convert_vector_encoding (type
, expr
))
8231 len
= native_encode_expr (expr
, buffer
, sizeof (buffer
));
8235 return native_interpret_expr (type
, buffer
, len
);
8238 /* Build an expression for the address of T. Folds away INDIRECT_REF
8239 to avoid confusing the gimplify process. */
8242 build_fold_addr_expr_with_type_loc (location_t loc
, tree t
, tree ptrtype
)
8244 /* The size of the object is not relevant when talking about its address. */
8245 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
8246 t
= TREE_OPERAND (t
, 0);
8248 if (TREE_CODE (t
) == INDIRECT_REF
)
8250 t
= TREE_OPERAND (t
, 0);
8252 if (TREE_TYPE (t
) != ptrtype
)
8253 t
= build1_loc (loc
, NOP_EXPR
, ptrtype
, t
);
8255 else if (TREE_CODE (t
) == MEM_REF
8256 && integer_zerop (TREE_OPERAND (t
, 1)))
8257 return TREE_OPERAND (t
, 0);
8258 else if (TREE_CODE (t
) == MEM_REF
8259 && TREE_CODE (TREE_OPERAND (t
, 0)) == INTEGER_CST
)
8260 return fold_binary (POINTER_PLUS_EXPR
, ptrtype
,
8261 TREE_OPERAND (t
, 0),
8262 convert_to_ptrofftype (TREE_OPERAND (t
, 1)));
8263 else if (TREE_CODE (t
) == VIEW_CONVERT_EXPR
)
8265 t
= build_fold_addr_expr_loc (loc
, TREE_OPERAND (t
, 0));
8267 if (TREE_TYPE (t
) != ptrtype
)
8268 t
= fold_convert_loc (loc
, ptrtype
, t
);
8271 t
= build1_loc (loc
, ADDR_EXPR
, ptrtype
, t
);
8276 /* Build an expression for the address of T. */
8279 build_fold_addr_expr_loc (location_t loc
, tree t
)
8281 tree ptrtype
= build_pointer_type (TREE_TYPE (t
));
8283 return build_fold_addr_expr_with_type_loc (loc
, t
, ptrtype
);
8286 /* Fold a unary expression of code CODE and type TYPE with operand
8287 OP0. Return the folded expression if folding is successful.
8288 Otherwise, return NULL_TREE. */
8291 fold_unary_loc (location_t loc
, enum tree_code code
, tree type
, tree op0
)
8295 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
8297 gcc_assert (IS_EXPR_CODE_CLASS (kind
)
8298 && TREE_CODE_LENGTH (code
) == 1);
8303 if (CONVERT_EXPR_CODE_P (code
)
8304 || code
== FLOAT_EXPR
|| code
== ABS_EXPR
|| code
== NEGATE_EXPR
)
8306 /* Don't use STRIP_NOPS, because signedness of argument type
8308 STRIP_SIGN_NOPS (arg0
);
8312 /* Strip any conversions that don't change the mode. This
8313 is safe for every expression, except for a comparison
8314 expression because its signedness is derived from its
8317 Note that this is done as an internal manipulation within
8318 the constant folder, in order to find the simplest
8319 representation of the arguments so that their form can be
8320 studied. In any cases, the appropriate type conversions
8321 should be put back in the tree that will get out of the
8326 if (CONSTANT_CLASS_P (arg0
))
8328 tree tem
= const_unop (code
, type
, arg0
);
8331 if (TREE_TYPE (tem
) != type
)
8332 tem
= fold_convert_loc (loc
, type
, tem
);
8338 tem
= generic_simplify (loc
, code
, type
, op0
);
8342 if (TREE_CODE_CLASS (code
) == tcc_unary
)
8344 if (TREE_CODE (arg0
) == COMPOUND_EXPR
)
8345 return build2 (COMPOUND_EXPR
, type
, TREE_OPERAND (arg0
, 0),
8346 fold_build1_loc (loc
, code
, type
,
8347 fold_convert_loc (loc
, TREE_TYPE (op0
),
8348 TREE_OPERAND (arg0
, 1))));
8349 else if (TREE_CODE (arg0
) == COND_EXPR
)
8351 tree arg01
= TREE_OPERAND (arg0
, 1);
8352 tree arg02
= TREE_OPERAND (arg0
, 2);
8353 if (! VOID_TYPE_P (TREE_TYPE (arg01
)))
8354 arg01
= fold_build1_loc (loc
, code
, type
,
8355 fold_convert_loc (loc
,
8356 TREE_TYPE (op0
), arg01
));
8357 if (! VOID_TYPE_P (TREE_TYPE (arg02
)))
8358 arg02
= fold_build1_loc (loc
, code
, type
,
8359 fold_convert_loc (loc
,
8360 TREE_TYPE (op0
), arg02
));
8361 tem
= fold_build3_loc (loc
, COND_EXPR
, type
, TREE_OPERAND (arg0
, 0),
8364 /* If this was a conversion, and all we did was to move into
8365 inside the COND_EXPR, bring it back out. But leave it if
8366 it is a conversion from integer to integer and the
8367 result precision is no wider than a word since such a
8368 conversion is cheap and may be optimized away by combine,
8369 while it couldn't if it were outside the COND_EXPR. Then return
8370 so we don't get into an infinite recursion loop taking the
8371 conversion out and then back in. */
8373 if ((CONVERT_EXPR_CODE_P (code
)
8374 || code
== NON_LVALUE_EXPR
)
8375 && TREE_CODE (tem
) == COND_EXPR
8376 && TREE_CODE (TREE_OPERAND (tem
, 1)) == code
8377 && TREE_CODE (TREE_OPERAND (tem
, 2)) == code
8378 && ! VOID_TYPE_P (TREE_OPERAND (tem
, 1))
8379 && ! VOID_TYPE_P (TREE_OPERAND (tem
, 2))
8380 && (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem
, 1), 0))
8381 == TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem
, 2), 0)))
8382 && (! (INTEGRAL_TYPE_P (TREE_TYPE (tem
))
8384 (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem
, 1), 0))))
8385 && TYPE_PRECISION (TREE_TYPE (tem
)) <= BITS_PER_WORD
)
8386 || flag_syntax_only
))
8387 tem
= build1_loc (loc
, code
, type
,
8389 TREE_TYPE (TREE_OPERAND
8390 (TREE_OPERAND (tem
, 1), 0)),
8391 TREE_OPERAND (tem
, 0),
8392 TREE_OPERAND (TREE_OPERAND (tem
, 1), 0),
8393 TREE_OPERAND (TREE_OPERAND (tem
, 2),
8401 case NON_LVALUE_EXPR
:
8402 if (!maybe_lvalue_p (op0
))
8403 return fold_convert_loc (loc
, type
, op0
);
8408 case FIX_TRUNC_EXPR
:
8409 if (COMPARISON_CLASS_P (op0
))
8411 /* If we have (type) (a CMP b) and type is an integral type, return
8412 new expression involving the new type. Canonicalize
8413 (type) (a CMP b) to (a CMP b) ? (type) true : (type) false for
8415 Do not fold the result as that would not simplify further, also
8416 folding again results in recursions. */
8417 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
8418 return build2_loc (loc
, TREE_CODE (op0
), type
,
8419 TREE_OPERAND (op0
, 0),
8420 TREE_OPERAND (op0
, 1));
8421 else if (!INTEGRAL_TYPE_P (type
) && !VOID_TYPE_P (type
)
8422 && TREE_CODE (type
) != VECTOR_TYPE
)
8423 return build3_loc (loc
, COND_EXPR
, type
, op0
,
8424 constant_boolean_node (true, type
),
8425 constant_boolean_node (false, type
));
8428 /* Handle (T *)&A.B.C for A being of type T and B and C
8429 living at offset zero. This occurs frequently in
8430 C++ upcasting and then accessing the base. */
8431 if (TREE_CODE (op0
) == ADDR_EXPR
8432 && POINTER_TYPE_P (type
)
8433 && handled_component_p (TREE_OPERAND (op0
, 0)))
8435 poly_int64 bitsize
, bitpos
;
8438 int unsignedp
, reversep
, volatilep
;
8440 = get_inner_reference (TREE_OPERAND (op0
, 0), &bitsize
, &bitpos
,
8441 &offset
, &mode
, &unsignedp
, &reversep
,
8443 /* If the reference was to a (constant) zero offset, we can use
8444 the address of the base if it has the same base type
8445 as the result type and the pointer type is unqualified. */
8447 && known_eq (bitpos
, 0)
8448 && (TYPE_MAIN_VARIANT (TREE_TYPE (type
))
8449 == TYPE_MAIN_VARIANT (TREE_TYPE (base
)))
8450 && TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
8451 return fold_convert_loc (loc
, type
,
8452 build_fold_addr_expr_loc (loc
, base
));
8455 if (TREE_CODE (op0
) == MODIFY_EXPR
8456 && TREE_CONSTANT (TREE_OPERAND (op0
, 1))
8457 /* Detect assigning a bitfield. */
8458 && !(TREE_CODE (TREE_OPERAND (op0
, 0)) == COMPONENT_REF
8460 (TREE_OPERAND (TREE_OPERAND (op0
, 0), 1))))
8462 /* Don't leave an assignment inside a conversion
8463 unless assigning a bitfield. */
8464 tem
= fold_build1_loc (loc
, code
, type
, TREE_OPERAND (op0
, 1));
8465 /* First do the assignment, then return converted constant. */
8466 tem
= build2_loc (loc
, COMPOUND_EXPR
, TREE_TYPE (tem
), op0
, tem
);
8467 TREE_NO_WARNING (tem
) = 1;
8468 TREE_USED (tem
) = 1;
8472 /* Convert (T)(x & c) into (T)x & (T)c, if c is an integer
8473 constants (if x has signed type, the sign bit cannot be set
8474 in c). This folds extension into the BIT_AND_EXPR.
8475 ??? We don't do it for BOOLEAN_TYPE or ENUMERAL_TYPE because they
8476 very likely don't have maximal range for their precision and this
8477 transformation effectively doesn't preserve non-maximal ranges. */
8478 if (TREE_CODE (type
) == INTEGER_TYPE
8479 && TREE_CODE (op0
) == BIT_AND_EXPR
8480 && TREE_CODE (TREE_OPERAND (op0
, 1)) == INTEGER_CST
)
8482 tree and_expr
= op0
;
8483 tree and0
= TREE_OPERAND (and_expr
, 0);
8484 tree and1
= TREE_OPERAND (and_expr
, 1);
8487 if (TYPE_UNSIGNED (TREE_TYPE (and_expr
))
8488 || (TYPE_PRECISION (type
)
8489 <= TYPE_PRECISION (TREE_TYPE (and_expr
))))
8491 else if (TYPE_PRECISION (TREE_TYPE (and1
))
8492 <= HOST_BITS_PER_WIDE_INT
8493 && tree_fits_uhwi_p (and1
))
8495 unsigned HOST_WIDE_INT cst
;
8497 cst
= tree_to_uhwi (and1
);
8498 cst
&= HOST_WIDE_INT_M1U
8499 << (TYPE_PRECISION (TREE_TYPE (and1
)) - 1);
8500 change
= (cst
== 0);
8502 && !flag_syntax_only
8503 && (load_extend_op (TYPE_MODE (TREE_TYPE (and0
)))
8506 tree uns
= unsigned_type_for (TREE_TYPE (and0
));
8507 and0
= fold_convert_loc (loc
, uns
, and0
);
8508 and1
= fold_convert_loc (loc
, uns
, and1
);
8513 tem
= force_fit_type (type
, wi::to_widest (and1
), 0,
8514 TREE_OVERFLOW (and1
));
8515 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
8516 fold_convert_loc (loc
, type
, and0
), tem
);
8520 /* Convert (T1)(X p+ Y) into ((T1)X p+ Y), for pointer type, when the new
8521 cast (T1)X will fold away. We assume that this happens when X itself
8523 if (POINTER_TYPE_P (type
)
8524 && TREE_CODE (arg0
) == POINTER_PLUS_EXPR
8525 && CONVERT_EXPR_P (TREE_OPERAND (arg0
, 0)))
8527 tree arg00
= TREE_OPERAND (arg0
, 0);
8528 tree arg01
= TREE_OPERAND (arg0
, 1);
8530 return fold_build_pointer_plus_loc
8531 (loc
, fold_convert_loc (loc
, type
, arg00
), arg01
);
8534 /* Convert (T1)(~(T2)X) into ~(T1)X if T1 and T2 are integral types
8535 of the same precision, and X is an integer type not narrower than
8536 types T1 or T2, i.e. the cast (T2)X isn't an extension. */
8537 if (INTEGRAL_TYPE_P (type
)
8538 && TREE_CODE (op0
) == BIT_NOT_EXPR
8539 && INTEGRAL_TYPE_P (TREE_TYPE (op0
))
8540 && CONVERT_EXPR_P (TREE_OPERAND (op0
, 0))
8541 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (op0
)))
8543 tem
= TREE_OPERAND (TREE_OPERAND (op0
, 0), 0);
8544 if (INTEGRAL_TYPE_P (TREE_TYPE (tem
))
8545 && TYPE_PRECISION (type
) <= TYPE_PRECISION (TREE_TYPE (tem
)))
8546 return fold_build1_loc (loc
, BIT_NOT_EXPR
, type
,
8547 fold_convert_loc (loc
, type
, tem
));
8550 /* Convert (T1)(X * Y) into (T1)X * (T1)Y if T1 is narrower than the
8551 type of X and Y (integer types only). */
8552 if (INTEGRAL_TYPE_P (type
)
8553 && TREE_CODE (op0
) == MULT_EXPR
8554 && INTEGRAL_TYPE_P (TREE_TYPE (op0
))
8555 && TYPE_PRECISION (type
) < TYPE_PRECISION (TREE_TYPE (op0
)))
8557 /* Be careful not to introduce new overflows. */
8559 if (TYPE_OVERFLOW_WRAPS (type
))
8562 mult_type
= unsigned_type_for (type
);
8564 if (TYPE_PRECISION (mult_type
) < TYPE_PRECISION (TREE_TYPE (op0
)))
8566 tem
= fold_build2_loc (loc
, MULT_EXPR
, mult_type
,
8567 fold_convert_loc (loc
, mult_type
,
8568 TREE_OPERAND (op0
, 0)),
8569 fold_convert_loc (loc
, mult_type
,
8570 TREE_OPERAND (op0
, 1)));
8571 return fold_convert_loc (loc
, type
, tem
);
8577 case VIEW_CONVERT_EXPR
:
8578 if (TREE_CODE (op0
) == MEM_REF
)
8580 if (TYPE_ALIGN (TREE_TYPE (op0
)) != TYPE_ALIGN (type
))
8581 type
= build_aligned_type (type
, TYPE_ALIGN (TREE_TYPE (op0
)));
8582 tem
= fold_build2_loc (loc
, MEM_REF
, type
,
8583 TREE_OPERAND (op0
, 0), TREE_OPERAND (op0
, 1));
8584 REF_REVERSE_STORAGE_ORDER (tem
) = REF_REVERSE_STORAGE_ORDER (op0
);
8591 tem
= fold_negate_expr (loc
, arg0
);
8593 return fold_convert_loc (loc
, type
, tem
);
8597 /* Convert fabs((double)float) into (double)fabsf(float). */
8598 if (TREE_CODE (arg0
) == NOP_EXPR
8599 && TREE_CODE (type
) == REAL_TYPE
)
8601 tree targ0
= strip_float_extensions (arg0
);
8603 return fold_convert_loc (loc
, type
,
8604 fold_build1_loc (loc
, ABS_EXPR
,
8611 /* Convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */
8612 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
8613 && (tem
= fold_unary_loc (loc
, BIT_NOT_EXPR
, type
,
8614 fold_convert_loc (loc
, type
,
8615 TREE_OPERAND (arg0
, 0)))))
8616 return fold_build2_loc (loc
, BIT_XOR_EXPR
, type
, tem
,
8617 fold_convert_loc (loc
, type
,
8618 TREE_OPERAND (arg0
, 1)));
8619 else if (TREE_CODE (arg0
) == BIT_XOR_EXPR
8620 && (tem
= fold_unary_loc (loc
, BIT_NOT_EXPR
, type
,
8621 fold_convert_loc (loc
, type
,
8622 TREE_OPERAND (arg0
, 1)))))
8623 return fold_build2_loc (loc
, BIT_XOR_EXPR
, type
,
8624 fold_convert_loc (loc
, type
,
8625 TREE_OPERAND (arg0
, 0)), tem
);
8629 case TRUTH_NOT_EXPR
:
8630 /* Note that the operand of this must be an int
8631 and its values must be 0 or 1.
8632 ("true" is a fixed value perhaps depending on the language,
8633 but we don't handle values other than 1 correctly yet.) */
8634 tem
= fold_truth_not_expr (loc
, arg0
);
8637 return fold_convert_loc (loc
, type
, tem
);
8640 /* Fold *&X to X if X is an lvalue. */
8641 if (TREE_CODE (op0
) == ADDR_EXPR
)
8643 tree op00
= TREE_OPERAND (op0
, 0);
8645 || TREE_CODE (op00
) == PARM_DECL
8646 || TREE_CODE (op00
) == RESULT_DECL
)
8647 && !TREE_READONLY (op00
))
8654 } /* switch (code) */
8658 /* If the operation was a conversion do _not_ mark a resulting constant
8659 with TREE_OVERFLOW if the original constant was not. These conversions
8660 have implementation defined behavior and retaining the TREE_OVERFLOW
8661 flag here would confuse later passes such as VRP. */
8663 fold_unary_ignore_overflow_loc (location_t loc
, enum tree_code code
,
8664 tree type
, tree op0
)
8666 tree res
= fold_unary_loc (loc
, code
, type
, op0
);
8668 && TREE_CODE (res
) == INTEGER_CST
8669 && TREE_CODE (op0
) == INTEGER_CST
8670 && CONVERT_EXPR_CODE_P (code
))
8671 TREE_OVERFLOW (res
) = TREE_OVERFLOW (op0
);
8676 /* Fold a binary bitwise/truth expression of code CODE and type TYPE with
8677 operands OP0 and OP1. LOC is the location of the resulting expression.
8678 ARG0 and ARG1 are the NOP_STRIPed results of OP0 and OP1.
8679 Return the folded expression if folding is successful. Otherwise,
8680 return NULL_TREE. */
8682 fold_truth_andor (location_t loc
, enum tree_code code
, tree type
,
8683 tree arg0
, tree arg1
, tree op0
, tree op1
)
8687 /* We only do these simplifications if we are optimizing. */
8691 /* Check for things like (A || B) && (A || C). We can convert this
8692 to A || (B && C). Note that either operator can be any of the four
8693 truth and/or operations and the transformation will still be
8694 valid. Also note that we only care about order for the
8695 ANDIF and ORIF operators. If B contains side effects, this
8696 might change the truth-value of A. */
8697 if (TREE_CODE (arg0
) == TREE_CODE (arg1
)
8698 && (TREE_CODE (arg0
) == TRUTH_ANDIF_EXPR
8699 || TREE_CODE (arg0
) == TRUTH_ORIF_EXPR
8700 || TREE_CODE (arg0
) == TRUTH_AND_EXPR
8701 || TREE_CODE (arg0
) == TRUTH_OR_EXPR
)
8702 && ! TREE_SIDE_EFFECTS (TREE_OPERAND (arg0
, 1)))
8704 tree a00
= TREE_OPERAND (arg0
, 0);
8705 tree a01
= TREE_OPERAND (arg0
, 1);
8706 tree a10
= TREE_OPERAND (arg1
, 0);
8707 tree a11
= TREE_OPERAND (arg1
, 1);
8708 int commutative
= ((TREE_CODE (arg0
) == TRUTH_OR_EXPR
8709 || TREE_CODE (arg0
) == TRUTH_AND_EXPR
)
8710 && (code
== TRUTH_AND_EXPR
8711 || code
== TRUTH_OR_EXPR
));
8713 if (operand_equal_p (a00
, a10
, 0))
8714 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
, a00
,
8715 fold_build2_loc (loc
, code
, type
, a01
, a11
));
8716 else if (commutative
&& operand_equal_p (a00
, a11
, 0))
8717 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
, a00
,
8718 fold_build2_loc (loc
, code
, type
, a01
, a10
));
8719 else if (commutative
&& operand_equal_p (a01
, a10
, 0))
8720 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
, a01
,
8721 fold_build2_loc (loc
, code
, type
, a00
, a11
));
8723 /* This case if tricky because we must either have commutative
8724 operators or else A10 must not have side-effects. */
8726 else if ((commutative
|| ! TREE_SIDE_EFFECTS (a10
))
8727 && operand_equal_p (a01
, a11
, 0))
8728 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
,
8729 fold_build2_loc (loc
, code
, type
, a00
, a10
),
8733 /* See if we can build a range comparison. */
8734 if ((tem
= fold_range_test (loc
, code
, type
, op0
, op1
)) != 0)
8737 if ((code
== TRUTH_ANDIF_EXPR
&& TREE_CODE (arg0
) == TRUTH_ORIF_EXPR
)
8738 || (code
== TRUTH_ORIF_EXPR
&& TREE_CODE (arg0
) == TRUTH_ANDIF_EXPR
))
8740 tem
= merge_truthop_with_opposite_arm (loc
, arg0
, arg1
, true);
8742 return fold_build2_loc (loc
, code
, type
, tem
, arg1
);
8745 if ((code
== TRUTH_ANDIF_EXPR
&& TREE_CODE (arg1
) == TRUTH_ORIF_EXPR
)
8746 || (code
== TRUTH_ORIF_EXPR
&& TREE_CODE (arg1
) == TRUTH_ANDIF_EXPR
))
8748 tem
= merge_truthop_with_opposite_arm (loc
, arg1
, arg0
, false);
8750 return fold_build2_loc (loc
, code
, type
, arg0
, tem
);
8753 /* Check for the possibility of merging component references. If our
8754 lhs is another similar operation, try to merge its rhs with our
8755 rhs. Then try to merge our lhs and rhs. */
8756 if (TREE_CODE (arg0
) == code
8757 && (tem
= fold_truth_andor_1 (loc
, code
, type
,
8758 TREE_OPERAND (arg0
, 1), arg1
)) != 0)
8759 return fold_build2_loc (loc
, code
, type
, TREE_OPERAND (arg0
, 0), tem
);
8761 if ((tem
= fold_truth_andor_1 (loc
, code
, type
, arg0
, arg1
)) != 0)
8764 bool logical_op_non_short_circuit
= LOGICAL_OP_NON_SHORT_CIRCUIT
;
8765 if (param_logical_op_non_short_circuit
!= -1)
8766 logical_op_non_short_circuit
8767 = param_logical_op_non_short_circuit
;
8768 if (logical_op_non_short_circuit
8769 && !flag_sanitize_coverage
8770 && (code
== TRUTH_AND_EXPR
8771 || code
== TRUTH_ANDIF_EXPR
8772 || code
== TRUTH_OR_EXPR
8773 || code
== TRUTH_ORIF_EXPR
))
8775 enum tree_code ncode
, icode
;
8777 ncode
= (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_AND_EXPR
)
8778 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
;
8779 icode
= ncode
== TRUTH_AND_EXPR
? TRUTH_ANDIF_EXPR
: TRUTH_ORIF_EXPR
;
8781 /* Transform ((A AND-IF B) AND[-IF] C) into (A AND-IF (B AND C)),
8782 or ((A OR-IF B) OR[-IF] C) into (A OR-IF (B OR C))
8783 We don't want to pack more than two leafs to a non-IF AND/OR
8785 If tree-code of left-hand operand isn't an AND/OR-IF code and not
8786 equal to IF-CODE, then we don't want to add right-hand operand.
8787 If the inner right-hand side of left-hand operand has
8788 side-effects, or isn't simple, then we can't add to it,
8789 as otherwise we might destroy if-sequence. */
8790 if (TREE_CODE (arg0
) == icode
8791 && simple_operand_p_2 (arg1
)
8792 /* Needed for sequence points to handle trappings, and
8794 && simple_operand_p_2 (TREE_OPERAND (arg0
, 1)))
8796 tem
= fold_build2_loc (loc
, ncode
, type
, TREE_OPERAND (arg0
, 1),
8798 return fold_build2_loc (loc
, icode
, type
, TREE_OPERAND (arg0
, 0),
8801 /* Same as above but for (A AND[-IF] (B AND-IF C)) -> ((A AND B) AND-IF C),
8802 or (A OR[-IF] (B OR-IF C) -> ((A OR B) OR-IF C). */
8803 else if (TREE_CODE (arg1
) == icode
8804 && simple_operand_p_2 (arg0
)
8805 /* Needed for sequence points to handle trappings, and
8807 && simple_operand_p_2 (TREE_OPERAND (arg1
, 0)))
8809 tem
= fold_build2_loc (loc
, ncode
, type
,
8810 arg0
, TREE_OPERAND (arg1
, 0));
8811 return fold_build2_loc (loc
, icode
, type
, tem
,
8812 TREE_OPERAND (arg1
, 1));
8814 /* Transform (A AND-IF B) into (A AND B), or (A OR-IF B)
8816 For sequence point consistancy, we need to check for trapping,
8817 and side-effects. */
8818 else if (code
== icode
&& simple_operand_p_2 (arg0
)
8819 && simple_operand_p_2 (arg1
))
8820 return fold_build2_loc (loc
, ncode
, type
, arg0
, arg1
);
8826 /* Helper that tries to canonicalize the comparison ARG0 CODE ARG1
8827 by changing CODE to reduce the magnitude of constants involved in
8828 ARG0 of the comparison.
8829 Returns a canonicalized comparison tree if a simplification was
8830 possible, otherwise returns NULL_TREE.
8831 Set *STRICT_OVERFLOW_P to true if the canonicalization is only
8832 valid if signed overflow is undefined. */
8835 maybe_canonicalize_comparison_1 (location_t loc
, enum tree_code code
, tree type
,
8836 tree arg0
, tree arg1
,
8837 bool *strict_overflow_p
)
8839 enum tree_code code0
= TREE_CODE (arg0
);
8840 tree t
, cst0
= NULL_TREE
;
8843 /* Match A +- CST code arg1. We can change this only if overflow
8845 if (!((ANY_INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
8846 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
)))
8847 /* In principle pointers also have undefined overflow behavior,
8848 but that causes problems elsewhere. */
8849 && !POINTER_TYPE_P (TREE_TYPE (arg0
))
8850 && (code0
== MINUS_EXPR
8851 || code0
== PLUS_EXPR
)
8852 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
))
8855 /* Identify the constant in arg0 and its sign. */
8856 cst0
= TREE_OPERAND (arg0
, 1);
8857 sgn0
= tree_int_cst_sgn (cst0
);
8859 /* Overflowed constants and zero will cause problems. */
8860 if (integer_zerop (cst0
)
8861 || TREE_OVERFLOW (cst0
))
8864 /* See if we can reduce the magnitude of the constant in
8865 arg0 by changing the comparison code. */
8866 /* A - CST < arg1 -> A - CST-1 <= arg1. */
8868 && code0
== ((sgn0
== -1) ? PLUS_EXPR
: MINUS_EXPR
))
8870 /* A + CST > arg1 -> A + CST-1 >= arg1. */
8871 else if (code
== GT_EXPR
8872 && code0
== ((sgn0
== -1) ? MINUS_EXPR
: PLUS_EXPR
))
8874 /* A + CST <= arg1 -> A + CST-1 < arg1. */
8875 else if (code
== LE_EXPR
8876 && code0
== ((sgn0
== -1) ? MINUS_EXPR
: PLUS_EXPR
))
8878 /* A - CST >= arg1 -> A - CST-1 > arg1. */
8879 else if (code
== GE_EXPR
8880 && code0
== ((sgn0
== -1) ? PLUS_EXPR
: MINUS_EXPR
))
8884 *strict_overflow_p
= true;
8886 /* Now build the constant reduced in magnitude. But not if that
8887 would produce one outside of its types range. */
8888 if (INTEGRAL_TYPE_P (TREE_TYPE (cst0
))
8890 && TYPE_MIN_VALUE (TREE_TYPE (cst0
))
8891 && tree_int_cst_equal (cst0
, TYPE_MIN_VALUE (TREE_TYPE (cst0
))))
8893 && TYPE_MAX_VALUE (TREE_TYPE (cst0
))
8894 && tree_int_cst_equal (cst0
, TYPE_MAX_VALUE (TREE_TYPE (cst0
))))))
8897 t
= int_const_binop (sgn0
== -1 ? PLUS_EXPR
: MINUS_EXPR
,
8898 cst0
, build_int_cst (TREE_TYPE (cst0
), 1));
8899 t
= fold_build2_loc (loc
, code0
, TREE_TYPE (arg0
), TREE_OPERAND (arg0
, 0), t
);
8900 t
= fold_convert (TREE_TYPE (arg1
), t
);
8902 return fold_build2_loc (loc
, code
, type
, t
, arg1
);
8905 /* Canonicalize the comparison ARG0 CODE ARG1 with type TYPE with undefined
8906 overflow further. Try to decrease the magnitude of constants involved
8907 by changing LE_EXPR and GE_EXPR to LT_EXPR and GT_EXPR or vice versa
8908 and put sole constants at the second argument position.
8909 Returns the canonicalized tree if changed, otherwise NULL_TREE. */
8912 maybe_canonicalize_comparison (location_t loc
, enum tree_code code
, tree type
,
8913 tree arg0
, tree arg1
)
8916 bool strict_overflow_p
;
8917 const char * const warnmsg
= G_("assuming signed overflow does not occur "
8918 "when reducing constant in comparison");
8920 /* Try canonicalization by simplifying arg0. */
8921 strict_overflow_p
= false;
8922 t
= maybe_canonicalize_comparison_1 (loc
, code
, type
, arg0
, arg1
,
8923 &strict_overflow_p
);
8926 if (strict_overflow_p
)
8927 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_MAGNITUDE
);
8931 /* Try canonicalization by simplifying arg1 using the swapped
8933 code
= swap_tree_comparison (code
);
8934 strict_overflow_p
= false;
8935 t
= maybe_canonicalize_comparison_1 (loc
, code
, type
, arg1
, arg0
,
8936 &strict_overflow_p
);
8937 if (t
&& strict_overflow_p
)
8938 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_MAGNITUDE
);
8942 /* Return whether BASE + OFFSET + BITPOS may wrap around the address
8943 space. This is used to avoid issuing overflow warnings for
8944 expressions like &p->x which cannot wrap. */
8947 pointer_may_wrap_p (tree base
, tree offset
, poly_int64 bitpos
)
8949 if (!POINTER_TYPE_P (TREE_TYPE (base
)))
8952 if (maybe_lt (bitpos
, 0))
8955 poly_wide_int wi_offset
;
8956 int precision
= TYPE_PRECISION (TREE_TYPE (base
));
8957 if (offset
== NULL_TREE
)
8958 wi_offset
= wi::zero (precision
);
8959 else if (!poly_int_tree_p (offset
) || TREE_OVERFLOW (offset
))
8962 wi_offset
= wi::to_poly_wide (offset
);
8964 wi::overflow_type overflow
;
8965 poly_wide_int units
= wi::shwi (bits_to_bytes_round_down (bitpos
),
8967 poly_wide_int total
= wi::add (wi_offset
, units
, UNSIGNED
, &overflow
);
8971 poly_uint64 total_hwi
, size
;
8972 if (!total
.to_uhwi (&total_hwi
)
8973 || !poly_int_tree_p (TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (base
))),
8975 || known_eq (size
, 0U))
8978 if (known_le (total_hwi
, size
))
8981 /* We can do slightly better for SIZE if we have an ADDR_EXPR of an
8983 if (TREE_CODE (base
) == ADDR_EXPR
8984 && poly_int_tree_p (TYPE_SIZE_UNIT (TREE_TYPE (TREE_OPERAND (base
, 0))),
8986 && maybe_ne (size
, 0U)
8987 && known_le (total_hwi
, size
))
8993 /* Return a positive integer when the symbol DECL is known to have
8994 a nonzero address, zero when it's known not to (e.g., it's a weak
8995 symbol), and a negative integer when the symbol is not yet in the
8996 symbol table and so whether or not its address is zero is unknown.
8997 For function local objects always return positive integer. */
8999 maybe_nonzero_address (tree decl
)
9001 if (DECL_P (decl
) && decl_in_symtab_p (decl
))
9002 if (struct symtab_node
*symbol
= symtab_node::get_create (decl
))
9003 return symbol
->nonzero_address ();
9005 /* Function local objects are never NULL. */
9007 && (DECL_CONTEXT (decl
)
9008 && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
9009 && auto_var_in_fn_p (decl
, DECL_CONTEXT (decl
))))
9015 /* Subroutine of fold_binary. This routine performs all of the
9016 transformations that are common to the equality/inequality
9017 operators (EQ_EXPR and NE_EXPR) and the ordering operators
9018 (LT_EXPR, LE_EXPR, GE_EXPR and GT_EXPR). Callers other than
9019 fold_binary should call fold_binary. Fold a comparison with
9020 tree code CODE and type TYPE with operands OP0 and OP1. Return
9021 the folded comparison or NULL_TREE. */
9024 fold_comparison (location_t loc
, enum tree_code code
, tree type
,
9027 const bool equality_code
= (code
== EQ_EXPR
|| code
== NE_EXPR
);
9028 tree arg0
, arg1
, tem
;
9033 STRIP_SIGN_NOPS (arg0
);
9034 STRIP_SIGN_NOPS (arg1
);
9036 /* For comparisons of pointers we can decompose it to a compile time
9037 comparison of the base objects and the offsets into the object.
9038 This requires at least one operand being an ADDR_EXPR or a
9039 POINTER_PLUS_EXPR to do more than the operand_equal_p test below. */
9040 if (POINTER_TYPE_P (TREE_TYPE (arg0
))
9041 && (TREE_CODE (arg0
) == ADDR_EXPR
9042 || TREE_CODE (arg1
) == ADDR_EXPR
9043 || TREE_CODE (arg0
) == POINTER_PLUS_EXPR
9044 || TREE_CODE (arg1
) == POINTER_PLUS_EXPR
))
9046 tree base0
, base1
, offset0
= NULL_TREE
, offset1
= NULL_TREE
;
9047 poly_int64 bitsize
, bitpos0
= 0, bitpos1
= 0;
9049 int volatilep
, reversep
, unsignedp
;
9050 bool indirect_base0
= false, indirect_base1
= false;
9052 /* Get base and offset for the access. Strip ADDR_EXPR for
9053 get_inner_reference, but put it back by stripping INDIRECT_REF
9054 off the base object if possible. indirect_baseN will be true
9055 if baseN is not an address but refers to the object itself. */
9057 if (TREE_CODE (arg0
) == ADDR_EXPR
)
9060 = get_inner_reference (TREE_OPERAND (arg0
, 0),
9061 &bitsize
, &bitpos0
, &offset0
, &mode
,
9062 &unsignedp
, &reversep
, &volatilep
);
9063 if (TREE_CODE (base0
) == INDIRECT_REF
)
9064 base0
= TREE_OPERAND (base0
, 0);
9066 indirect_base0
= true;
9068 else if (TREE_CODE (arg0
) == POINTER_PLUS_EXPR
)
9070 base0
= TREE_OPERAND (arg0
, 0);
9071 STRIP_SIGN_NOPS (base0
);
9072 if (TREE_CODE (base0
) == ADDR_EXPR
)
9075 = get_inner_reference (TREE_OPERAND (base0
, 0),
9076 &bitsize
, &bitpos0
, &offset0
, &mode
,
9077 &unsignedp
, &reversep
, &volatilep
);
9078 if (TREE_CODE (base0
) == INDIRECT_REF
)
9079 base0
= TREE_OPERAND (base0
, 0);
9081 indirect_base0
= true;
9083 if (offset0
== NULL_TREE
|| integer_zerop (offset0
))
9084 offset0
= TREE_OPERAND (arg0
, 1);
9086 offset0
= size_binop (PLUS_EXPR
, offset0
,
9087 TREE_OPERAND (arg0
, 1));
9088 if (poly_int_tree_p (offset0
))
9090 poly_offset_int tem
= wi::sext (wi::to_poly_offset (offset0
),
9091 TYPE_PRECISION (sizetype
));
9092 tem
<<= LOG2_BITS_PER_UNIT
;
9094 if (tem
.to_shwi (&bitpos0
))
9095 offset0
= NULL_TREE
;
9100 if (TREE_CODE (arg1
) == ADDR_EXPR
)
9103 = get_inner_reference (TREE_OPERAND (arg1
, 0),
9104 &bitsize
, &bitpos1
, &offset1
, &mode
,
9105 &unsignedp
, &reversep
, &volatilep
);
9106 if (TREE_CODE (base1
) == INDIRECT_REF
)
9107 base1
= TREE_OPERAND (base1
, 0);
9109 indirect_base1
= true;
9111 else if (TREE_CODE (arg1
) == POINTER_PLUS_EXPR
)
9113 base1
= TREE_OPERAND (arg1
, 0);
9114 STRIP_SIGN_NOPS (base1
);
9115 if (TREE_CODE (base1
) == ADDR_EXPR
)
9118 = get_inner_reference (TREE_OPERAND (base1
, 0),
9119 &bitsize
, &bitpos1
, &offset1
, &mode
,
9120 &unsignedp
, &reversep
, &volatilep
);
9121 if (TREE_CODE (base1
) == INDIRECT_REF
)
9122 base1
= TREE_OPERAND (base1
, 0);
9124 indirect_base1
= true;
9126 if (offset1
== NULL_TREE
|| integer_zerop (offset1
))
9127 offset1
= TREE_OPERAND (arg1
, 1);
9129 offset1
= size_binop (PLUS_EXPR
, offset1
,
9130 TREE_OPERAND (arg1
, 1));
9131 if (poly_int_tree_p (offset1
))
9133 poly_offset_int tem
= wi::sext (wi::to_poly_offset (offset1
),
9134 TYPE_PRECISION (sizetype
));
9135 tem
<<= LOG2_BITS_PER_UNIT
;
9137 if (tem
.to_shwi (&bitpos1
))
9138 offset1
= NULL_TREE
;
9142 /* If we have equivalent bases we might be able to simplify. */
9143 if (indirect_base0
== indirect_base1
9144 && operand_equal_p (base0
, base1
,
9145 indirect_base0
? OEP_ADDRESS_OF
: 0))
9147 /* We can fold this expression to a constant if the non-constant
9148 offset parts are equal. */
9149 if ((offset0
== offset1
9150 || (offset0
&& offset1
9151 && operand_equal_p (offset0
, offset1
, 0)))
9154 && (DECL_P (base0
) || CONSTANT_CLASS_P (base0
)))
9155 || TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
))))
9158 && maybe_ne (bitpos0
, bitpos1
)
9159 && (pointer_may_wrap_p (base0
, offset0
, bitpos0
)
9160 || pointer_may_wrap_p (base1
, offset1
, bitpos1
)))
9161 fold_overflow_warning (("assuming pointer wraparound does not "
9162 "occur when comparing P +- C1 with "
9164 WARN_STRICT_OVERFLOW_CONDITIONAL
);
9169 if (known_eq (bitpos0
, bitpos1
))
9170 return constant_boolean_node (true, type
);
9171 if (known_ne (bitpos0
, bitpos1
))
9172 return constant_boolean_node (false, type
);
9175 if (known_ne (bitpos0
, bitpos1
))
9176 return constant_boolean_node (true, type
);
9177 if (known_eq (bitpos0
, bitpos1
))
9178 return constant_boolean_node (false, type
);
9181 if (known_lt (bitpos0
, bitpos1
))
9182 return constant_boolean_node (true, type
);
9183 if (known_ge (bitpos0
, bitpos1
))
9184 return constant_boolean_node (false, type
);
9187 if (known_le (bitpos0
, bitpos1
))
9188 return constant_boolean_node (true, type
);
9189 if (known_gt (bitpos0
, bitpos1
))
9190 return constant_boolean_node (false, type
);
9193 if (known_ge (bitpos0
, bitpos1
))
9194 return constant_boolean_node (true, type
);
9195 if (known_lt (bitpos0
, bitpos1
))
9196 return constant_boolean_node (false, type
);
9199 if (known_gt (bitpos0
, bitpos1
))
9200 return constant_boolean_node (true, type
);
9201 if (known_le (bitpos0
, bitpos1
))
9202 return constant_boolean_node (false, type
);
9207 /* We can simplify the comparison to a comparison of the variable
9208 offset parts if the constant offset parts are equal.
9209 Be careful to use signed sizetype here because otherwise we
9210 mess with array offsets in the wrong way. This is possible
9211 because pointer arithmetic is restricted to retain within an
9212 object and overflow on pointer differences is undefined as of
9213 6.5.6/8 and /9 with respect to the signed ptrdiff_t. */
9214 else if (known_eq (bitpos0
, bitpos1
)
9217 && (DECL_P (base0
) || CONSTANT_CLASS_P (base0
)))
9218 || TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
))))
9220 /* By converting to signed sizetype we cover middle-end pointer
9221 arithmetic which operates on unsigned pointer types of size
9222 type size and ARRAY_REF offsets which are properly sign or
9223 zero extended from their type in case it is narrower than
9225 if (offset0
== NULL_TREE
)
9226 offset0
= build_int_cst (ssizetype
, 0);
9228 offset0
= fold_convert_loc (loc
, ssizetype
, offset0
);
9229 if (offset1
== NULL_TREE
)
9230 offset1
= build_int_cst (ssizetype
, 0);
9232 offset1
= fold_convert_loc (loc
, ssizetype
, offset1
);
9235 && (pointer_may_wrap_p (base0
, offset0
, bitpos0
)
9236 || pointer_may_wrap_p (base1
, offset1
, bitpos1
)))
9237 fold_overflow_warning (("assuming pointer wraparound does not "
9238 "occur when comparing P +- C1 with "
9240 WARN_STRICT_OVERFLOW_COMPARISON
);
9242 return fold_build2_loc (loc
, code
, type
, offset0
, offset1
);
9245 /* For equal offsets we can simplify to a comparison of the
9247 else if (known_eq (bitpos0
, bitpos1
)
9249 ? base0
!= TREE_OPERAND (arg0
, 0) : base0
!= arg0
)
9251 ? base1
!= TREE_OPERAND (arg1
, 0) : base1
!= arg1
)
9252 && ((offset0
== offset1
)
9253 || (offset0
&& offset1
9254 && operand_equal_p (offset0
, offset1
, 0))))
9257 base0
= build_fold_addr_expr_loc (loc
, base0
);
9259 base1
= build_fold_addr_expr_loc (loc
, base1
);
9260 return fold_build2_loc (loc
, code
, type
, base0
, base1
);
9262 /* Comparison between an ordinary (non-weak) symbol and a null
9263 pointer can be eliminated since such symbols must have a non
9264 null address. In C, relational expressions between pointers
9265 to objects and null pointers are undefined. The results
9266 below follow the C++ rules with the additional property that
9267 every object pointer compares greater than a null pointer.
9269 else if (((DECL_P (base0
)
9270 && maybe_nonzero_address (base0
) > 0
9271 /* Avoid folding references to struct members at offset 0 to
9272 prevent tests like '&ptr->firstmember == 0' from getting
9273 eliminated. When ptr is null, although the -> expression
9274 is strictly speaking invalid, GCC retains it as a matter
9275 of QoI. See PR c/44555. */
9276 && (offset0
== NULL_TREE
&& known_ne (bitpos0
, 0)))
9277 || CONSTANT_CLASS_P (base0
))
9279 /* The caller guarantees that when one of the arguments is
9280 constant (i.e., null in this case) it is second. */
9281 && integer_zerop (arg1
))
9288 return constant_boolean_node (false, type
);
9292 return constant_boolean_node (true, type
);
9299 /* Transform comparisons of the form X +- C1 CMP Y +- C2 to
9300 X CMP Y +- C2 +- C1 for signed X, Y. This is valid if
9301 the resulting offset is smaller in absolute value than the
9302 original one and has the same sign. */
9303 if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
9304 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
))
9305 && (TREE_CODE (arg0
) == PLUS_EXPR
|| TREE_CODE (arg0
) == MINUS_EXPR
)
9306 && (TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
9307 && !TREE_OVERFLOW (TREE_OPERAND (arg0
, 1)))
9308 && (TREE_CODE (arg1
) == PLUS_EXPR
|| TREE_CODE (arg1
) == MINUS_EXPR
)
9309 && (TREE_CODE (TREE_OPERAND (arg1
, 1)) == INTEGER_CST
9310 && !TREE_OVERFLOW (TREE_OPERAND (arg1
, 1))))
9312 tree const1
= TREE_OPERAND (arg0
, 1);
9313 tree const2
= TREE_OPERAND (arg1
, 1);
9314 tree variable1
= TREE_OPERAND (arg0
, 0);
9315 tree variable2
= TREE_OPERAND (arg1
, 0);
9317 const char * const warnmsg
= G_("assuming signed overflow does not "
9318 "occur when combining constants around "
9321 /* Put the constant on the side where it doesn't overflow and is
9322 of lower absolute value and of same sign than before. */
9323 cst
= int_const_binop (TREE_CODE (arg0
) == TREE_CODE (arg1
)
9324 ? MINUS_EXPR
: PLUS_EXPR
,
9326 if (!TREE_OVERFLOW (cst
)
9327 && tree_int_cst_compare (const2
, cst
) == tree_int_cst_sgn (const2
)
9328 && tree_int_cst_sgn (cst
) == tree_int_cst_sgn (const2
))
9330 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_COMPARISON
);
9331 return fold_build2_loc (loc
, code
, type
,
9333 fold_build2_loc (loc
, TREE_CODE (arg1
),
9338 cst
= int_const_binop (TREE_CODE (arg0
) == TREE_CODE (arg1
)
9339 ? MINUS_EXPR
: PLUS_EXPR
,
9341 if (!TREE_OVERFLOW (cst
)
9342 && tree_int_cst_compare (const1
, cst
) == tree_int_cst_sgn (const1
)
9343 && tree_int_cst_sgn (cst
) == tree_int_cst_sgn (const1
))
9345 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_COMPARISON
);
9346 return fold_build2_loc (loc
, code
, type
,
9347 fold_build2_loc (loc
, TREE_CODE (arg0
),
9354 tem
= maybe_canonicalize_comparison (loc
, code
, type
, arg0
, arg1
);
9358 /* If we are comparing an expression that just has comparisons
9359 of two integer values, arithmetic expressions of those comparisons,
9360 and constants, we can simplify it. There are only three cases
9361 to check: the two values can either be equal, the first can be
9362 greater, or the second can be greater. Fold the expression for
9363 those three values. Since each value must be 0 or 1, we have
9364 eight possibilities, each of which corresponds to the constant 0
9365 or 1 or one of the six possible comparisons.
9367 This handles common cases like (a > b) == 0 but also handles
9368 expressions like ((x > y) - (y > x)) > 0, which supposedly
9369 occur in macroized code. */
9371 if (TREE_CODE (arg1
) == INTEGER_CST
&& TREE_CODE (arg0
) != INTEGER_CST
)
9373 tree cval1
= 0, cval2
= 0;
9375 if (twoval_comparison_p (arg0
, &cval1
, &cval2
)
9376 /* Don't handle degenerate cases here; they should already
9377 have been handled anyway. */
9378 && cval1
!= 0 && cval2
!= 0
9379 && ! (TREE_CONSTANT (cval1
) && TREE_CONSTANT (cval2
))
9380 && TREE_TYPE (cval1
) == TREE_TYPE (cval2
)
9381 && INTEGRAL_TYPE_P (TREE_TYPE (cval1
))
9382 && TYPE_MAX_VALUE (TREE_TYPE (cval1
))
9383 && TYPE_MAX_VALUE (TREE_TYPE (cval2
))
9384 && ! operand_equal_p (TYPE_MIN_VALUE (TREE_TYPE (cval1
)),
9385 TYPE_MAX_VALUE (TREE_TYPE (cval2
)), 0))
9387 tree maxval
= TYPE_MAX_VALUE (TREE_TYPE (cval1
));
9388 tree minval
= TYPE_MIN_VALUE (TREE_TYPE (cval1
));
9390 /* We can't just pass T to eval_subst in case cval1 or cval2
9391 was the same as ARG1. */
9394 = fold_build2_loc (loc
, code
, type
,
9395 eval_subst (loc
, arg0
, cval1
, maxval
,
9399 = fold_build2_loc (loc
, code
, type
,
9400 eval_subst (loc
, arg0
, cval1
, maxval
,
9404 = fold_build2_loc (loc
, code
, type
,
9405 eval_subst (loc
, arg0
, cval1
, minval
,
9409 /* All three of these results should be 0 or 1. Confirm they are.
9410 Then use those values to select the proper code to use. */
9412 if (TREE_CODE (high_result
) == INTEGER_CST
9413 && TREE_CODE (equal_result
) == INTEGER_CST
9414 && TREE_CODE (low_result
) == INTEGER_CST
)
9416 /* Make a 3-bit mask with the high-order bit being the
9417 value for `>', the next for '=', and the low for '<'. */
9418 switch ((integer_onep (high_result
) * 4)
9419 + (integer_onep (equal_result
) * 2)
9420 + integer_onep (low_result
))
9424 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
9445 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
9448 return fold_build2_loc (loc
, code
, type
, cval1
, cval2
);
9457 /* Subroutine of fold_binary. Optimize complex multiplications of the
9458 form z * conj(z), as pow(realpart(z),2) + pow(imagpart(z),2). The
9459 argument EXPR represents the expression "z" of type TYPE. */
9462 fold_mult_zconjz (location_t loc
, tree type
, tree expr
)
9464 tree itype
= TREE_TYPE (type
);
9465 tree rpart
, ipart
, tem
;
9467 if (TREE_CODE (expr
) == COMPLEX_EXPR
)
9469 rpart
= TREE_OPERAND (expr
, 0);
9470 ipart
= TREE_OPERAND (expr
, 1);
9472 else if (TREE_CODE (expr
) == COMPLEX_CST
)
9474 rpart
= TREE_REALPART (expr
);
9475 ipart
= TREE_IMAGPART (expr
);
9479 expr
= save_expr (expr
);
9480 rpart
= fold_build1_loc (loc
, REALPART_EXPR
, itype
, expr
);
9481 ipart
= fold_build1_loc (loc
, IMAGPART_EXPR
, itype
, expr
);
9484 rpart
= save_expr (rpart
);
9485 ipart
= save_expr (ipart
);
9486 tem
= fold_build2_loc (loc
, PLUS_EXPR
, itype
,
9487 fold_build2_loc (loc
, MULT_EXPR
, itype
, rpart
, rpart
),
9488 fold_build2_loc (loc
, MULT_EXPR
, itype
, ipart
, ipart
));
9489 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, tem
,
9490 build_zero_cst (itype
));
9494 /* Helper function for fold_vec_perm. Store elements of VECTOR_CST or
9495 CONSTRUCTOR ARG into array ELTS, which has NELTS elements, and return
9496 true if successful. */
9499 vec_cst_ctor_to_array (tree arg
, unsigned int nelts
, tree
*elts
)
9501 unsigned HOST_WIDE_INT i
, nunits
;
9503 if (TREE_CODE (arg
) == VECTOR_CST
9504 && VECTOR_CST_NELTS (arg
).is_constant (&nunits
))
9506 for (i
= 0; i
< nunits
; ++i
)
9507 elts
[i
] = VECTOR_CST_ELT (arg
, i
);
9509 else if (TREE_CODE (arg
) == CONSTRUCTOR
)
9511 constructor_elt
*elt
;
9513 FOR_EACH_VEC_SAFE_ELT (CONSTRUCTOR_ELTS (arg
), i
, elt
)
9514 if (i
>= nelts
|| TREE_CODE (TREE_TYPE (elt
->value
)) == VECTOR_TYPE
)
9517 elts
[i
] = elt
->value
;
9521 for (; i
< nelts
; i
++)
9523 = fold_convert (TREE_TYPE (TREE_TYPE (arg
)), integer_zero_node
);
9527 /* Attempt to fold vector permutation of ARG0 and ARG1 vectors using SEL
9528 selector. Return the folded VECTOR_CST or CONSTRUCTOR if successful,
9529 NULL_TREE otherwise. */
9532 fold_vec_perm (tree type
, tree arg0
, tree arg1
, const vec_perm_indices
&sel
)
9535 unsigned HOST_WIDE_INT nelts
;
9536 bool need_ctor
= false;
9538 if (!sel
.length ().is_constant (&nelts
))
9540 gcc_assert (known_eq (TYPE_VECTOR_SUBPARTS (type
), nelts
)
9541 && known_eq (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0
)), nelts
)
9542 && known_eq (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg1
)), nelts
));
9543 if (TREE_TYPE (TREE_TYPE (arg0
)) != TREE_TYPE (type
)
9544 || TREE_TYPE (TREE_TYPE (arg1
)) != TREE_TYPE (type
))
9547 tree
*in_elts
= XALLOCAVEC (tree
, nelts
* 2);
9548 if (!vec_cst_ctor_to_array (arg0
, nelts
, in_elts
)
9549 || !vec_cst_ctor_to_array (arg1
, nelts
, in_elts
+ nelts
))
9552 tree_vector_builder
out_elts (type
, nelts
, 1);
9553 for (i
= 0; i
< nelts
; i
++)
9555 HOST_WIDE_INT index
;
9556 if (!sel
[i
].is_constant (&index
))
9558 if (!CONSTANT_CLASS_P (in_elts
[index
]))
9560 out_elts
.quick_push (unshare_expr (in_elts
[index
]));
9565 vec
<constructor_elt
, va_gc
> *v
;
9566 vec_alloc (v
, nelts
);
9567 for (i
= 0; i
< nelts
; i
++)
9568 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, out_elts
[i
]);
9569 return build_constructor (type
, v
);
9572 return out_elts
.build ();
9575 /* Try to fold a pointer difference of type TYPE two address expressions of
9576 array references AREF0 and AREF1 using location LOC. Return a
9577 simplified expression for the difference or NULL_TREE. */
9580 fold_addr_of_array_ref_difference (location_t loc
, tree type
,
9581 tree aref0
, tree aref1
,
9582 bool use_pointer_diff
)
9584 tree base0
= TREE_OPERAND (aref0
, 0);
9585 tree base1
= TREE_OPERAND (aref1
, 0);
9586 tree base_offset
= build_int_cst (type
, 0);
9588 /* If the bases are array references as well, recurse. If the bases
9589 are pointer indirections compute the difference of the pointers.
9590 If the bases are equal, we are set. */
9591 if ((TREE_CODE (base0
) == ARRAY_REF
9592 && TREE_CODE (base1
) == ARRAY_REF
9594 = fold_addr_of_array_ref_difference (loc
, type
, base0
, base1
,
9596 || (INDIRECT_REF_P (base0
)
9597 && INDIRECT_REF_P (base1
)
9600 ? fold_binary_loc (loc
, POINTER_DIFF_EXPR
, type
,
9601 TREE_OPERAND (base0
, 0),
9602 TREE_OPERAND (base1
, 0))
9603 : fold_binary_loc (loc
, MINUS_EXPR
, type
,
9605 TREE_OPERAND (base0
, 0)),
9607 TREE_OPERAND (base1
, 0)))))
9608 || operand_equal_p (base0
, base1
, OEP_ADDRESS_OF
))
9610 tree op0
= fold_convert_loc (loc
, type
, TREE_OPERAND (aref0
, 1));
9611 tree op1
= fold_convert_loc (loc
, type
, TREE_OPERAND (aref1
, 1));
9612 tree esz
= fold_convert_loc (loc
, type
, array_ref_element_size (aref0
));
9613 tree diff
= fold_build2_loc (loc
, MINUS_EXPR
, type
, op0
, op1
);
9614 return fold_build2_loc (loc
, PLUS_EXPR
, type
,
9616 fold_build2_loc (loc
, MULT_EXPR
, type
,
9622 /* If the real or vector real constant CST of type TYPE has an exact
9623 inverse, return it, else return NULL. */
9626 exact_inverse (tree type
, tree cst
)
9632 switch (TREE_CODE (cst
))
9635 r
= TREE_REAL_CST (cst
);
9637 if (exact_real_inverse (TYPE_MODE (type
), &r
))
9638 return build_real (type
, r
);
9644 unit_type
= TREE_TYPE (type
);
9645 mode
= TYPE_MODE (unit_type
);
9647 tree_vector_builder elts
;
9648 if (!elts
.new_unary_operation (type
, cst
, false))
9650 unsigned int count
= elts
.encoded_nelts ();
9651 for (unsigned int i
= 0; i
< count
; ++i
)
9653 r
= TREE_REAL_CST (VECTOR_CST_ELT (cst
, i
));
9654 if (!exact_real_inverse (mode
, &r
))
9656 elts
.quick_push (build_real (unit_type
, r
));
9659 return elts
.build ();
9667 /* Mask out the tz least significant bits of X of type TYPE where
9668 tz is the number of trailing zeroes in Y. */
9670 mask_with_tz (tree type
, const wide_int
&x
, const wide_int
&y
)
9672 int tz
= wi::ctz (y
);
9674 return wi::mask (tz
, true, TYPE_PRECISION (type
)) & x
;
9678 /* Return true when T is an address and is known to be nonzero.
9679 For floating point we further ensure that T is not denormal.
9680 Similar logic is present in nonzero_address in rtlanal.h.
9682 If the return value is based on the assumption that signed overflow
9683 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
9684 change *STRICT_OVERFLOW_P. */
9687 tree_expr_nonzero_warnv_p (tree t
, bool *strict_overflow_p
)
9689 tree type
= TREE_TYPE (t
);
9690 enum tree_code code
;
9692 /* Doing something useful for floating point would need more work. */
9693 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
9696 code
= TREE_CODE (t
);
9697 switch (TREE_CODE_CLASS (code
))
9700 return tree_unary_nonzero_warnv_p (code
, type
, TREE_OPERAND (t
, 0),
9703 case tcc_comparison
:
9704 return tree_binary_nonzero_warnv_p (code
, type
,
9705 TREE_OPERAND (t
, 0),
9706 TREE_OPERAND (t
, 1),
9709 case tcc_declaration
:
9711 return tree_single_nonzero_warnv_p (t
, strict_overflow_p
);
9719 case TRUTH_NOT_EXPR
:
9720 return tree_unary_nonzero_warnv_p (code
, type
, TREE_OPERAND (t
, 0),
9723 case TRUTH_AND_EXPR
:
9725 case TRUTH_XOR_EXPR
:
9726 return tree_binary_nonzero_warnv_p (code
, type
,
9727 TREE_OPERAND (t
, 0),
9728 TREE_OPERAND (t
, 1),
9736 case WITH_SIZE_EXPR
:
9738 return tree_single_nonzero_warnv_p (t
, strict_overflow_p
);
9743 return tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 1),
9747 return tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 0),
9752 tree fndecl
= get_callee_fndecl (t
);
9753 if (!fndecl
) return false;
9754 if (flag_delete_null_pointer_checks
&& !flag_check_new
9755 && DECL_IS_OPERATOR_NEW_P (fndecl
)
9756 && !TREE_NOTHROW (fndecl
))
9758 if (flag_delete_null_pointer_checks
9759 && lookup_attribute ("returns_nonnull",
9760 TYPE_ATTRIBUTES (TREE_TYPE (fndecl
))))
9762 return alloca_call_p (t
);
9771 /* Return true when T is an address and is known to be nonzero.
9772 Handle warnings about undefined signed overflow. */
9775 tree_expr_nonzero_p (tree t
)
9777 bool ret
, strict_overflow_p
;
9779 strict_overflow_p
= false;
9780 ret
= tree_expr_nonzero_warnv_p (t
, &strict_overflow_p
);
9781 if (strict_overflow_p
)
9782 fold_overflow_warning (("assuming signed overflow does not occur when "
9783 "determining that expression is always "
9785 WARN_STRICT_OVERFLOW_MISC
);
9789 /* Return true if T is known not to be equal to an integer W. */
9792 expr_not_equal_to (tree t
, const wide_int
&w
)
9794 wide_int min
, max
, nz
;
9795 value_range_kind rtype
;
9796 switch (TREE_CODE (t
))
9799 return wi::to_wide (t
) != w
;
9802 if (!INTEGRAL_TYPE_P (TREE_TYPE (t
)))
9804 rtype
= get_range_info (t
, &min
, &max
);
9805 if (rtype
== VR_RANGE
)
9807 if (wi::lt_p (max
, w
, TYPE_SIGN (TREE_TYPE (t
))))
9809 if (wi::lt_p (w
, min
, TYPE_SIGN (TREE_TYPE (t
))))
9812 else if (rtype
== VR_ANTI_RANGE
9813 && wi::le_p (min
, w
, TYPE_SIGN (TREE_TYPE (t
)))
9814 && wi::le_p (w
, max
, TYPE_SIGN (TREE_TYPE (t
))))
9816 /* If T has some known zero bits and W has any of those bits set,
9817 then T is known not to be equal to W. */
9818 if (wi::ne_p (wi::zext (wi::bit_and_not (w
, get_nonzero_bits (t
)),
9819 TYPE_PRECISION (TREE_TYPE (t
))), 0))
9828 /* Fold a binary expression of code CODE and type TYPE with operands
9829 OP0 and OP1. LOC is the location of the resulting expression.
9830 Return the folded expression if folding is successful. Otherwise,
9831 return NULL_TREE. */
9834 fold_binary_loc (location_t loc
, enum tree_code code
, tree type
,
9837 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
9838 tree arg0
, arg1
, tem
;
9839 tree t1
= NULL_TREE
;
9840 bool strict_overflow_p
;
9843 gcc_assert (IS_EXPR_CODE_CLASS (kind
)
9844 && TREE_CODE_LENGTH (code
) == 2
9846 && op1
!= NULL_TREE
);
9851 /* Strip any conversions that don't change the mode. This is
9852 safe for every expression, except for a comparison expression
9853 because its signedness is derived from its operands. So, in
9854 the latter case, only strip conversions that don't change the
9855 signedness. MIN_EXPR/MAX_EXPR also need signedness of arguments
9858 Note that this is done as an internal manipulation within the
9859 constant folder, in order to find the simplest representation
9860 of the arguments so that their form can be studied. In any
9861 cases, the appropriate type conversions should be put back in
9862 the tree that will get out of the constant folder. */
9864 if (kind
== tcc_comparison
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
9866 STRIP_SIGN_NOPS (arg0
);
9867 STRIP_SIGN_NOPS (arg1
);
9875 /* Note that TREE_CONSTANT isn't enough: static var addresses are
9876 constant but we can't do arithmetic on them. */
9877 if (CONSTANT_CLASS_P (arg0
) && CONSTANT_CLASS_P (arg1
))
9879 tem
= const_binop (code
, type
, arg0
, arg1
);
9880 if (tem
!= NULL_TREE
)
9882 if (TREE_TYPE (tem
) != type
)
9883 tem
= fold_convert_loc (loc
, type
, tem
);
9888 /* If this is a commutative operation, and ARG0 is a constant, move it
9889 to ARG1 to reduce the number of tests below. */
9890 if (commutative_tree_code (code
)
9891 && tree_swap_operands_p (arg0
, arg1
))
9892 return fold_build2_loc (loc
, code
, type
, op1
, op0
);
9894 /* Likewise if this is a comparison, and ARG0 is a constant, move it
9895 to ARG1 to reduce the number of tests below. */
9896 if (kind
== tcc_comparison
9897 && tree_swap_operands_p (arg0
, arg1
))
9898 return fold_build2_loc (loc
, swap_tree_comparison (code
), type
, op1
, op0
);
9900 tem
= generic_simplify (loc
, code
, type
, op0
, op1
);
9904 /* ARG0 is the first operand of EXPR, and ARG1 is the second operand.
9906 First check for cases where an arithmetic operation is applied to a
9907 compound, conditional, or comparison operation. Push the arithmetic
9908 operation inside the compound or conditional to see if any folding
9909 can then be done. Convert comparison to conditional for this purpose.
9910 The also optimizes non-constant cases that used to be done in
9913 Before we do that, see if this is a BIT_AND_EXPR or a BIT_IOR_EXPR,
9914 one of the operands is a comparison and the other is a comparison, a
9915 BIT_AND_EXPR with the constant 1, or a truth value. In that case, the
9916 code below would make the expression more complex. Change it to a
9917 TRUTH_{AND,OR}_EXPR. Likewise, convert a similar NE_EXPR to
9918 TRUTH_XOR_EXPR and an EQ_EXPR to the inversion of a TRUTH_XOR_EXPR. */
9920 if ((code
== BIT_AND_EXPR
|| code
== BIT_IOR_EXPR
9921 || code
== EQ_EXPR
|| code
== NE_EXPR
)
9922 && !VECTOR_TYPE_P (TREE_TYPE (arg0
))
9923 && ((truth_value_p (TREE_CODE (arg0
))
9924 && (truth_value_p (TREE_CODE (arg1
))
9925 || (TREE_CODE (arg1
) == BIT_AND_EXPR
9926 && integer_onep (TREE_OPERAND (arg1
, 1)))))
9927 || (truth_value_p (TREE_CODE (arg1
))
9928 && (truth_value_p (TREE_CODE (arg0
))
9929 || (TREE_CODE (arg0
) == BIT_AND_EXPR
9930 && integer_onep (TREE_OPERAND (arg0
, 1)))))))
9932 tem
= fold_build2_loc (loc
, code
== BIT_AND_EXPR
? TRUTH_AND_EXPR
9933 : code
== BIT_IOR_EXPR
? TRUTH_OR_EXPR
9936 fold_convert_loc (loc
, boolean_type_node
, arg0
),
9937 fold_convert_loc (loc
, boolean_type_node
, arg1
));
9939 if (code
== EQ_EXPR
)
9940 tem
= invert_truthvalue_loc (loc
, tem
);
9942 return fold_convert_loc (loc
, type
, tem
);
9945 if (TREE_CODE_CLASS (code
) == tcc_binary
9946 || TREE_CODE_CLASS (code
) == tcc_comparison
)
9948 if (TREE_CODE (arg0
) == COMPOUND_EXPR
)
9950 tem
= fold_build2_loc (loc
, code
, type
,
9951 fold_convert_loc (loc
, TREE_TYPE (op0
),
9952 TREE_OPERAND (arg0
, 1)), op1
);
9953 return build2_loc (loc
, COMPOUND_EXPR
, type
, TREE_OPERAND (arg0
, 0),
9956 if (TREE_CODE (arg1
) == COMPOUND_EXPR
)
9958 tem
= fold_build2_loc (loc
, code
, type
, op0
,
9959 fold_convert_loc (loc
, TREE_TYPE (op1
),
9960 TREE_OPERAND (arg1
, 1)));
9961 return build2_loc (loc
, COMPOUND_EXPR
, type
, TREE_OPERAND (arg1
, 0),
9965 if (TREE_CODE (arg0
) == COND_EXPR
9966 || TREE_CODE (arg0
) == VEC_COND_EXPR
9967 || COMPARISON_CLASS_P (arg0
))
9969 tem
= fold_binary_op_with_conditional_arg (loc
, code
, type
, op0
, op1
,
9971 /*cond_first_p=*/1);
9972 if (tem
!= NULL_TREE
)
9976 if (TREE_CODE (arg1
) == COND_EXPR
9977 || TREE_CODE (arg1
) == VEC_COND_EXPR
9978 || COMPARISON_CLASS_P (arg1
))
9980 tem
= fold_binary_op_with_conditional_arg (loc
, code
, type
, op0
, op1
,
9982 /*cond_first_p=*/0);
9983 if (tem
!= NULL_TREE
)
9991 /* MEM[&MEM[p, CST1], CST2] -> MEM[p, CST1 + CST2]. */
9992 if (TREE_CODE (arg0
) == ADDR_EXPR
9993 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == MEM_REF
)
9995 tree iref
= TREE_OPERAND (arg0
, 0);
9996 return fold_build2 (MEM_REF
, type
,
9997 TREE_OPERAND (iref
, 0),
9998 int_const_binop (PLUS_EXPR
, arg1
,
9999 TREE_OPERAND (iref
, 1)));
10002 /* MEM[&a.b, CST2] -> MEM[&a, offsetof (a, b) + CST2]. */
10003 if (TREE_CODE (arg0
) == ADDR_EXPR
10004 && handled_component_p (TREE_OPERAND (arg0
, 0)))
10007 poly_int64 coffset
;
10008 base
= get_addr_base_and_unit_offset (TREE_OPERAND (arg0
, 0),
10012 return fold_build2 (MEM_REF
, type
,
10013 build_fold_addr_expr (base
),
10014 int_const_binop (PLUS_EXPR
, arg1
,
10015 size_int (coffset
)));
10020 case POINTER_PLUS_EXPR
:
10021 /* INT +p INT -> (PTR)(INT + INT). Stripping types allows for this. */
10022 if (INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
10023 && INTEGRAL_TYPE_P (TREE_TYPE (arg0
)))
10024 return fold_convert_loc (loc
, type
,
10025 fold_build2_loc (loc
, PLUS_EXPR
, sizetype
,
10026 fold_convert_loc (loc
, sizetype
,
10028 fold_convert_loc (loc
, sizetype
,
10034 if (INTEGRAL_TYPE_P (type
) || VECTOR_INTEGER_TYPE_P (type
))
10036 /* X + (X / CST) * -CST is X % CST. */
10037 if (TREE_CODE (arg1
) == MULT_EXPR
10038 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == TRUNC_DIV_EXPR
10039 && operand_equal_p (arg0
,
10040 TREE_OPERAND (TREE_OPERAND (arg1
, 0), 0), 0))
10042 tree cst0
= TREE_OPERAND (TREE_OPERAND (arg1
, 0), 1);
10043 tree cst1
= TREE_OPERAND (arg1
, 1);
10044 tree sum
= fold_binary_loc (loc
, PLUS_EXPR
, TREE_TYPE (cst1
),
10046 if (sum
&& integer_zerop (sum
))
10047 return fold_convert_loc (loc
, type
,
10048 fold_build2_loc (loc
, TRUNC_MOD_EXPR
,
10049 TREE_TYPE (arg0
), arg0
,
10054 /* Handle (A1 * C1) + (A2 * C2) with A1, A2 or C1, C2 being the same or
10055 one. Make sure the type is not saturating and has the signedness of
10056 the stripped operands, as fold_plusminus_mult_expr will re-associate.
10057 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
10058 if ((TREE_CODE (arg0
) == MULT_EXPR
10059 || TREE_CODE (arg1
) == MULT_EXPR
)
10060 && !TYPE_SATURATING (type
)
10061 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg0
))
10062 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg1
))
10063 && (!FLOAT_TYPE_P (type
) || flag_associative_math
))
10065 tree tem
= fold_plusminus_mult_expr (loc
, code
, type
, arg0
, arg1
);
10070 if (! FLOAT_TYPE_P (type
))
10072 /* Reassociate (plus (plus (mult) (foo)) (mult)) as
10073 (plus (plus (mult) (mult)) (foo)) so that we can
10074 take advantage of the factoring cases below. */
10075 if (ANY_INTEGRAL_TYPE_P (type
)
10076 && TYPE_OVERFLOW_WRAPS (type
)
10077 && (((TREE_CODE (arg0
) == PLUS_EXPR
10078 || TREE_CODE (arg0
) == MINUS_EXPR
)
10079 && TREE_CODE (arg1
) == MULT_EXPR
)
10080 || ((TREE_CODE (arg1
) == PLUS_EXPR
10081 || TREE_CODE (arg1
) == MINUS_EXPR
)
10082 && TREE_CODE (arg0
) == MULT_EXPR
)))
10084 tree parg0
, parg1
, parg
, marg
;
10085 enum tree_code pcode
;
10087 if (TREE_CODE (arg1
) == MULT_EXPR
)
10088 parg
= arg0
, marg
= arg1
;
10090 parg
= arg1
, marg
= arg0
;
10091 pcode
= TREE_CODE (parg
);
10092 parg0
= TREE_OPERAND (parg
, 0);
10093 parg1
= TREE_OPERAND (parg
, 1);
10094 STRIP_NOPS (parg0
);
10095 STRIP_NOPS (parg1
);
10097 if (TREE_CODE (parg0
) == MULT_EXPR
10098 && TREE_CODE (parg1
) != MULT_EXPR
)
10099 return fold_build2_loc (loc
, pcode
, type
,
10100 fold_build2_loc (loc
, PLUS_EXPR
, type
,
10101 fold_convert_loc (loc
, type
,
10103 fold_convert_loc (loc
, type
,
10105 fold_convert_loc (loc
, type
, parg1
));
10106 if (TREE_CODE (parg0
) != MULT_EXPR
10107 && TREE_CODE (parg1
) == MULT_EXPR
)
10109 fold_build2_loc (loc
, PLUS_EXPR
, type
,
10110 fold_convert_loc (loc
, type
, parg0
),
10111 fold_build2_loc (loc
, pcode
, type
,
10112 fold_convert_loc (loc
, type
, marg
),
10113 fold_convert_loc (loc
, type
,
10119 /* Fold __complex__ ( x, 0 ) + __complex__ ( 0, y )
10120 to __complex__ ( x, y ). This is not the same for SNaNs or
10121 if signed zeros are involved. */
10122 if (!HONOR_SNANS (element_mode (arg0
))
10123 && !HONOR_SIGNED_ZEROS (element_mode (arg0
))
10124 && COMPLEX_FLOAT_TYPE_P (TREE_TYPE (arg0
)))
10126 tree rtype
= TREE_TYPE (TREE_TYPE (arg0
));
10127 tree arg0r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg0
);
10128 tree arg0i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg0
);
10129 bool arg0rz
= false, arg0iz
= false;
10130 if ((arg0r
&& (arg0rz
= real_zerop (arg0r
)))
10131 || (arg0i
&& (arg0iz
= real_zerop (arg0i
))))
10133 tree arg1r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg1
);
10134 tree arg1i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg1
);
10135 if (arg0rz
&& arg1i
&& real_zerop (arg1i
))
10137 tree rp
= arg1r
? arg1r
10138 : build1 (REALPART_EXPR
, rtype
, arg1
);
10139 tree ip
= arg0i
? arg0i
10140 : build1 (IMAGPART_EXPR
, rtype
, arg0
);
10141 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
10143 else if (arg0iz
&& arg1r
&& real_zerop (arg1r
))
10145 tree rp
= arg0r
? arg0r
10146 : build1 (REALPART_EXPR
, rtype
, arg0
);
10147 tree ip
= arg1i
? arg1i
10148 : build1 (IMAGPART_EXPR
, rtype
, arg1
);
10149 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
10154 /* Convert a + (b*c + d*e) into (a + b*c) + d*e.
10155 We associate floats only if the user has specified
10156 -fassociative-math. */
10157 if (flag_associative_math
10158 && TREE_CODE (arg1
) == PLUS_EXPR
10159 && TREE_CODE (arg0
) != MULT_EXPR
)
10161 tree tree10
= TREE_OPERAND (arg1
, 0);
10162 tree tree11
= TREE_OPERAND (arg1
, 1);
10163 if (TREE_CODE (tree11
) == MULT_EXPR
10164 && TREE_CODE (tree10
) == MULT_EXPR
)
10167 tree0
= fold_build2_loc (loc
, PLUS_EXPR
, type
, arg0
, tree10
);
10168 return fold_build2_loc (loc
, PLUS_EXPR
, type
, tree0
, tree11
);
10171 /* Convert (b*c + d*e) + a into b*c + (d*e +a).
10172 We associate floats only if the user has specified
10173 -fassociative-math. */
10174 if (flag_associative_math
10175 && TREE_CODE (arg0
) == PLUS_EXPR
10176 && TREE_CODE (arg1
) != MULT_EXPR
)
10178 tree tree00
= TREE_OPERAND (arg0
, 0);
10179 tree tree01
= TREE_OPERAND (arg0
, 1);
10180 if (TREE_CODE (tree01
) == MULT_EXPR
10181 && TREE_CODE (tree00
) == MULT_EXPR
)
10184 tree0
= fold_build2_loc (loc
, PLUS_EXPR
, type
, tree01
, arg1
);
10185 return fold_build2_loc (loc
, PLUS_EXPR
, type
, tree00
, tree0
);
10191 /* (A << C1) + (A >> C2) if A is unsigned and C1+C2 is the size of A
10192 is a rotate of A by C1 bits. */
10193 /* (A << B) + (A >> (Z - B)) if A is unsigned and Z is the size of A
10194 is a rotate of A by B bits.
10195 Similarly for (A << B) | (A >> (-B & C3)) where C3 is Z-1,
10196 though in this case CODE must be | and not + or ^, otherwise
10197 it doesn't return A when B is 0. */
10199 enum tree_code code0
, code1
;
10201 code0
= TREE_CODE (arg0
);
10202 code1
= TREE_CODE (arg1
);
10203 if (((code0
== RSHIFT_EXPR
&& code1
== LSHIFT_EXPR
)
10204 || (code1
== RSHIFT_EXPR
&& code0
== LSHIFT_EXPR
))
10205 && operand_equal_p (TREE_OPERAND (arg0
, 0),
10206 TREE_OPERAND (arg1
, 0), 0)
10207 && (rtype
= TREE_TYPE (TREE_OPERAND (arg0
, 0)),
10208 TYPE_UNSIGNED (rtype
))
10209 /* Only create rotates in complete modes. Other cases are not
10210 expanded properly. */
10211 && (element_precision (rtype
)
10212 == GET_MODE_UNIT_PRECISION (TYPE_MODE (rtype
))))
10214 tree tree01
, tree11
;
10215 tree orig_tree01
, orig_tree11
;
10216 enum tree_code code01
, code11
;
10218 tree01
= orig_tree01
= TREE_OPERAND (arg0
, 1);
10219 tree11
= orig_tree11
= TREE_OPERAND (arg1
, 1);
10220 STRIP_NOPS (tree01
);
10221 STRIP_NOPS (tree11
);
10222 code01
= TREE_CODE (tree01
);
10223 code11
= TREE_CODE (tree11
);
10224 if (code11
!= MINUS_EXPR
10225 && (code01
== MINUS_EXPR
|| code01
== BIT_AND_EXPR
))
10227 std::swap (code0
, code1
);
10228 std::swap (code01
, code11
);
10229 std::swap (tree01
, tree11
);
10230 std::swap (orig_tree01
, orig_tree11
);
10232 if (code01
== INTEGER_CST
10233 && code11
== INTEGER_CST
10234 && (wi::to_widest (tree01
) + wi::to_widest (tree11
)
10235 == element_precision (rtype
)))
10237 tem
= build2_loc (loc
, LROTATE_EXPR
,
10238 rtype
, TREE_OPERAND (arg0
, 0),
10239 code0
== LSHIFT_EXPR
10240 ? orig_tree01
: orig_tree11
);
10241 return fold_convert_loc (loc
, type
, tem
);
10243 else if (code11
== MINUS_EXPR
)
10245 tree tree110
, tree111
;
10246 tree110
= TREE_OPERAND (tree11
, 0);
10247 tree111
= TREE_OPERAND (tree11
, 1);
10248 STRIP_NOPS (tree110
);
10249 STRIP_NOPS (tree111
);
10250 if (TREE_CODE (tree110
) == INTEGER_CST
10251 && compare_tree_int (tree110
,
10252 element_precision (rtype
)) == 0
10253 && operand_equal_p (tree01
, tree111
, 0))
10255 tem
= build2_loc (loc
, (code0
== LSHIFT_EXPR
10256 ? LROTATE_EXPR
: RROTATE_EXPR
),
10257 rtype
, TREE_OPERAND (arg0
, 0),
10259 return fold_convert_loc (loc
, type
, tem
);
10262 else if (code
== BIT_IOR_EXPR
10263 && code11
== BIT_AND_EXPR
10264 && pow2p_hwi (element_precision (rtype
)))
10266 tree tree110
, tree111
;
10267 tree110
= TREE_OPERAND (tree11
, 0);
10268 tree111
= TREE_OPERAND (tree11
, 1);
10269 STRIP_NOPS (tree110
);
10270 STRIP_NOPS (tree111
);
10271 if (TREE_CODE (tree110
) == NEGATE_EXPR
10272 && TREE_CODE (tree111
) == INTEGER_CST
10273 && compare_tree_int (tree111
,
10274 element_precision (rtype
) - 1) == 0
10275 && operand_equal_p (tree01
, TREE_OPERAND (tree110
, 0), 0))
10277 tem
= build2_loc (loc
, (code0
== LSHIFT_EXPR
10278 ? LROTATE_EXPR
: RROTATE_EXPR
),
10279 rtype
, TREE_OPERAND (arg0
, 0),
10281 return fold_convert_loc (loc
, type
, tem
);
10288 /* In most languages, can't associate operations on floats through
10289 parentheses. Rather than remember where the parentheses were, we
10290 don't associate floats at all, unless the user has specified
10291 -fassociative-math.
10292 And, we need to make sure type is not saturating. */
10294 if ((! FLOAT_TYPE_P (type
) || flag_associative_math
)
10295 && !TYPE_SATURATING (type
))
10297 tree var0
, minus_var0
, con0
, minus_con0
, lit0
, minus_lit0
;
10298 tree var1
, minus_var1
, con1
, minus_con1
, lit1
, minus_lit1
;
10302 /* Split both trees into variables, constants, and literals. Then
10303 associate each group together, the constants with literals,
10304 then the result with variables. This increases the chances of
10305 literals being recombined later and of generating relocatable
10306 expressions for the sum of a constant and literal. */
10307 var0
= split_tree (arg0
, type
, code
,
10308 &minus_var0
, &con0
, &minus_con0
,
10309 &lit0
, &minus_lit0
, 0);
10310 var1
= split_tree (arg1
, type
, code
,
10311 &minus_var1
, &con1
, &minus_con1
,
10312 &lit1
, &minus_lit1
, code
== MINUS_EXPR
);
10314 /* Recombine MINUS_EXPR operands by using PLUS_EXPR. */
10315 if (code
== MINUS_EXPR
)
10318 /* With undefined overflow prefer doing association in a type
10319 which wraps on overflow, if that is one of the operand types. */
10320 if ((POINTER_TYPE_P (type
) || INTEGRAL_TYPE_P (type
))
10321 && !TYPE_OVERFLOW_WRAPS (type
))
10323 if (INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
10324 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg0
)))
10325 atype
= TREE_TYPE (arg0
);
10326 else if (INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
10327 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg1
)))
10328 atype
= TREE_TYPE (arg1
);
10329 gcc_assert (TYPE_PRECISION (atype
) == TYPE_PRECISION (type
));
10332 /* With undefined overflow we can only associate constants with one
10333 variable, and constants whose association doesn't overflow. */
10334 if ((POINTER_TYPE_P (atype
) || INTEGRAL_TYPE_P (atype
))
10335 && !TYPE_OVERFLOW_WRAPS (atype
))
10337 if ((var0
&& var1
) || (minus_var0
&& minus_var1
))
10339 /* ??? If split_tree would handle NEGATE_EXPR we could
10340 simply reject these cases and the allowed cases would
10341 be the var0/minus_var1 ones. */
10342 tree tmp0
= var0
? var0
: minus_var0
;
10343 tree tmp1
= var1
? var1
: minus_var1
;
10344 bool one_neg
= false;
10346 if (TREE_CODE (tmp0
) == NEGATE_EXPR
)
10348 tmp0
= TREE_OPERAND (tmp0
, 0);
10349 one_neg
= !one_neg
;
10351 if (CONVERT_EXPR_P (tmp0
)
10352 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (tmp0
, 0)))
10353 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (tmp0
, 0)))
10354 <= TYPE_PRECISION (atype
)))
10355 tmp0
= TREE_OPERAND (tmp0
, 0);
10356 if (TREE_CODE (tmp1
) == NEGATE_EXPR
)
10358 tmp1
= TREE_OPERAND (tmp1
, 0);
10359 one_neg
= !one_neg
;
10361 if (CONVERT_EXPR_P (tmp1
)
10362 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (tmp1
, 0)))
10363 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (tmp1
, 0)))
10364 <= TYPE_PRECISION (atype
)))
10365 tmp1
= TREE_OPERAND (tmp1
, 0);
10366 /* The only case we can still associate with two variables
10367 is if they cancel out. */
10369 || !operand_equal_p (tmp0
, tmp1
, 0))
10372 else if ((var0
&& minus_var1
10373 && ! operand_equal_p (var0
, minus_var1
, 0))
10374 || (minus_var0
&& var1
10375 && ! operand_equal_p (minus_var0
, var1
, 0)))
10379 /* Only do something if we found more than two objects. Otherwise,
10380 nothing has changed and we risk infinite recursion. */
10382 && ((var0
!= 0) + (var1
!= 0)
10383 + (minus_var0
!= 0) + (minus_var1
!= 0)
10384 + (con0
!= 0) + (con1
!= 0)
10385 + (minus_con0
!= 0) + (minus_con1
!= 0)
10386 + (lit0
!= 0) + (lit1
!= 0)
10387 + (minus_lit0
!= 0) + (minus_lit1
!= 0)) > 2)
10389 var0
= associate_trees (loc
, var0
, var1
, code
, atype
);
10390 minus_var0
= associate_trees (loc
, minus_var0
, minus_var1
,
10392 con0
= associate_trees (loc
, con0
, con1
, code
, atype
);
10393 minus_con0
= associate_trees (loc
, minus_con0
, minus_con1
,
10395 lit0
= associate_trees (loc
, lit0
, lit1
, code
, atype
);
10396 minus_lit0
= associate_trees (loc
, minus_lit0
, minus_lit1
,
10399 if (minus_var0
&& var0
)
10401 var0
= associate_trees (loc
, var0
, minus_var0
,
10402 MINUS_EXPR
, atype
);
10405 if (minus_con0
&& con0
)
10407 con0
= associate_trees (loc
, con0
, minus_con0
,
10408 MINUS_EXPR
, atype
);
10412 /* Preserve the MINUS_EXPR if the negative part of the literal is
10413 greater than the positive part. Otherwise, the multiplicative
10414 folding code (i.e extract_muldiv) may be fooled in case
10415 unsigned constants are subtracted, like in the following
10416 example: ((X*2 + 4) - 8U)/2. */
10417 if (minus_lit0
&& lit0
)
10419 if (TREE_CODE (lit0
) == INTEGER_CST
10420 && TREE_CODE (minus_lit0
) == INTEGER_CST
10421 && tree_int_cst_lt (lit0
, minus_lit0
)
10422 /* But avoid ending up with only negated parts. */
10425 minus_lit0
= associate_trees (loc
, minus_lit0
, lit0
,
10426 MINUS_EXPR
, atype
);
10431 lit0
= associate_trees (loc
, lit0
, minus_lit0
,
10432 MINUS_EXPR
, atype
);
10437 /* Don't introduce overflows through reassociation. */
10438 if ((lit0
&& TREE_OVERFLOW_P (lit0
))
10439 || (minus_lit0
&& TREE_OVERFLOW_P (minus_lit0
)))
10442 /* Eliminate lit0 and minus_lit0 to con0 and minus_con0. */
10443 con0
= associate_trees (loc
, con0
, lit0
, code
, atype
);
10445 minus_con0
= associate_trees (loc
, minus_con0
, minus_lit0
,
10449 /* Eliminate minus_con0. */
10453 con0
= associate_trees (loc
, con0
, minus_con0
,
10454 MINUS_EXPR
, atype
);
10456 var0
= associate_trees (loc
, var0
, minus_con0
,
10457 MINUS_EXPR
, atype
);
10459 gcc_unreachable ();
10463 /* Eliminate minus_var0. */
10467 con0
= associate_trees (loc
, con0
, minus_var0
,
10468 MINUS_EXPR
, atype
);
10470 gcc_unreachable ();
10475 fold_convert_loc (loc
, type
, associate_trees (loc
, var0
, con0
,
10482 case POINTER_DIFF_EXPR
:
10484 /* Fold &a[i] - &a[j] to i-j. */
10485 if (TREE_CODE (arg0
) == ADDR_EXPR
10486 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == ARRAY_REF
10487 && TREE_CODE (arg1
) == ADDR_EXPR
10488 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == ARRAY_REF
)
10490 tree tem
= fold_addr_of_array_ref_difference (loc
, type
,
10491 TREE_OPERAND (arg0
, 0),
10492 TREE_OPERAND (arg1
, 0),
10494 == POINTER_DIFF_EXPR
);
10499 /* Further transformations are not for pointers. */
10500 if (code
== POINTER_DIFF_EXPR
)
10503 /* (-A) - B -> (-B) - A where B is easily negated and we can swap. */
10504 if (TREE_CODE (arg0
) == NEGATE_EXPR
10505 && negate_expr_p (op1
)
10506 /* If arg0 is e.g. unsigned int and type is int, then this could
10507 introduce UB, because if A is INT_MIN at runtime, the original
10508 expression can be well defined while the latter is not.
10510 && !(ANY_INTEGRAL_TYPE_P (type
)
10511 && TYPE_OVERFLOW_UNDEFINED (type
)
10512 && ANY_INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
10513 && !TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
))))
10514 return fold_build2_loc (loc
, MINUS_EXPR
, type
, negate_expr (op1
),
10515 fold_convert_loc (loc
, type
,
10516 TREE_OPERAND (arg0
, 0)));
10518 /* Fold __complex__ ( x, 0 ) - __complex__ ( 0, y ) to
10519 __complex__ ( x, -y ). This is not the same for SNaNs or if
10520 signed zeros are involved. */
10521 if (!HONOR_SNANS (element_mode (arg0
))
10522 && !HONOR_SIGNED_ZEROS (element_mode (arg0
))
10523 && COMPLEX_FLOAT_TYPE_P (TREE_TYPE (arg0
)))
10525 tree rtype
= TREE_TYPE (TREE_TYPE (arg0
));
10526 tree arg0r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg0
);
10527 tree arg0i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg0
);
10528 bool arg0rz
= false, arg0iz
= false;
10529 if ((arg0r
&& (arg0rz
= real_zerop (arg0r
)))
10530 || (arg0i
&& (arg0iz
= real_zerop (arg0i
))))
10532 tree arg1r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg1
);
10533 tree arg1i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg1
);
10534 if (arg0rz
&& arg1i
&& real_zerop (arg1i
))
10536 tree rp
= fold_build1_loc (loc
, NEGATE_EXPR
, rtype
,
10538 : build1 (REALPART_EXPR
, rtype
, arg1
));
10539 tree ip
= arg0i
? arg0i
10540 : build1 (IMAGPART_EXPR
, rtype
, arg0
);
10541 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
10543 else if (arg0iz
&& arg1r
&& real_zerop (arg1r
))
10545 tree rp
= arg0r
? arg0r
10546 : build1 (REALPART_EXPR
, rtype
, arg0
);
10547 tree ip
= fold_build1_loc (loc
, NEGATE_EXPR
, rtype
,
10549 : build1 (IMAGPART_EXPR
, rtype
, arg1
));
10550 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
10555 /* A - B -> A + (-B) if B is easily negatable. */
10556 if (negate_expr_p (op1
)
10557 && ! TYPE_OVERFLOW_SANITIZED (type
)
10558 && ((FLOAT_TYPE_P (type
)
10559 /* Avoid this transformation if B is a positive REAL_CST. */
10560 && (TREE_CODE (op1
) != REAL_CST
10561 || REAL_VALUE_NEGATIVE (TREE_REAL_CST (op1
))))
10562 || INTEGRAL_TYPE_P (type
)))
10563 return fold_build2_loc (loc
, PLUS_EXPR
, type
,
10564 fold_convert_loc (loc
, type
, arg0
),
10565 negate_expr (op1
));
10567 /* Handle (A1 * C1) - (A2 * C2) with A1, A2 or C1, C2 being the same or
10568 one. Make sure the type is not saturating and has the signedness of
10569 the stripped operands, as fold_plusminus_mult_expr will re-associate.
10570 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
10571 if ((TREE_CODE (arg0
) == MULT_EXPR
10572 || TREE_CODE (arg1
) == MULT_EXPR
)
10573 && !TYPE_SATURATING (type
)
10574 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg0
))
10575 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg1
))
10576 && (!FLOAT_TYPE_P (type
) || flag_associative_math
))
10578 tree tem
= fold_plusminus_mult_expr (loc
, code
, type
, arg0
, arg1
);
10586 if (! FLOAT_TYPE_P (type
))
10588 /* Transform x * -C into -x * C if x is easily negatable. */
10589 if (TREE_CODE (op1
) == INTEGER_CST
10590 && tree_int_cst_sgn (op1
) == -1
10591 && negate_expr_p (op0
)
10592 && negate_expr_p (op1
)
10593 && (tem
= negate_expr (op1
)) != op1
10594 && ! TREE_OVERFLOW (tem
))
10595 return fold_build2_loc (loc
, MULT_EXPR
, type
,
10596 fold_convert_loc (loc
, type
,
10597 negate_expr (op0
)), tem
);
10599 strict_overflow_p
= false;
10600 if (TREE_CODE (arg1
) == INTEGER_CST
10601 && (tem
= extract_muldiv (op0
, arg1
, code
, NULL_TREE
,
10602 &strict_overflow_p
)) != 0)
10604 if (strict_overflow_p
)
10605 fold_overflow_warning (("assuming signed overflow does not "
10606 "occur when simplifying "
10608 WARN_STRICT_OVERFLOW_MISC
);
10609 return fold_convert_loc (loc
, type
, tem
);
10612 /* Optimize z * conj(z) for integer complex numbers. */
10613 if (TREE_CODE (arg0
) == CONJ_EXPR
10614 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
10615 return fold_mult_zconjz (loc
, type
, arg1
);
10616 if (TREE_CODE (arg1
) == CONJ_EXPR
10617 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10618 return fold_mult_zconjz (loc
, type
, arg0
);
10622 /* Fold z * +-I to __complex__ (-+__imag z, +-__real z).
10623 This is not the same for NaNs or if signed zeros are
10625 if (!HONOR_NANS (arg0
)
10626 && !HONOR_SIGNED_ZEROS (element_mode (arg0
))
10627 && COMPLEX_FLOAT_TYPE_P (TREE_TYPE (arg0
))
10628 && TREE_CODE (arg1
) == COMPLEX_CST
10629 && real_zerop (TREE_REALPART (arg1
)))
10631 tree rtype
= TREE_TYPE (TREE_TYPE (arg0
));
10632 if (real_onep (TREE_IMAGPART (arg1
)))
10634 fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
10635 negate_expr (fold_build1_loc (loc
, IMAGPART_EXPR
,
10637 fold_build1_loc (loc
, REALPART_EXPR
, rtype
, arg0
));
10638 else if (real_minus_onep (TREE_IMAGPART (arg1
)))
10640 fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
10641 fold_build1_loc (loc
, IMAGPART_EXPR
, rtype
, arg0
),
10642 negate_expr (fold_build1_loc (loc
, REALPART_EXPR
,
10646 /* Optimize z * conj(z) for floating point complex numbers.
10647 Guarded by flag_unsafe_math_optimizations as non-finite
10648 imaginary components don't produce scalar results. */
10649 if (flag_unsafe_math_optimizations
10650 && TREE_CODE (arg0
) == CONJ_EXPR
10651 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
10652 return fold_mult_zconjz (loc
, type
, arg1
);
10653 if (flag_unsafe_math_optimizations
10654 && TREE_CODE (arg1
) == CONJ_EXPR
10655 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10656 return fold_mult_zconjz (loc
, type
, arg0
);
10661 /* Canonicalize (X & C1) | C2. */
10662 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10663 && TREE_CODE (arg1
) == INTEGER_CST
10664 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
10666 int width
= TYPE_PRECISION (type
), w
;
10667 wide_int c1
= wi::to_wide (TREE_OPERAND (arg0
, 1));
10668 wide_int c2
= wi::to_wide (arg1
);
10670 /* If (C1&C2) == C1, then (X&C1)|C2 becomes (X,C2). */
10671 if ((c1
& c2
) == c1
)
10672 return omit_one_operand_loc (loc
, type
, arg1
,
10673 TREE_OPERAND (arg0
, 0));
10675 wide_int msk
= wi::mask (width
, false,
10676 TYPE_PRECISION (TREE_TYPE (arg1
)));
10678 /* If (C1|C2) == ~0 then (X&C1)|C2 becomes X|C2. */
10679 if (wi::bit_and_not (msk
, c1
| c2
) == 0)
10681 tem
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10682 return fold_build2_loc (loc
, BIT_IOR_EXPR
, type
, tem
, arg1
);
10685 /* Minimize the number of bits set in C1, i.e. C1 := C1 & ~C2,
10686 unless (C1 & ~C2) | (C2 & C3) for some C3 is a mask of some
10687 mode which allows further optimizations. */
10690 wide_int c3
= wi::bit_and_not (c1
, c2
);
10691 for (w
= BITS_PER_UNIT
; w
<= width
; w
<<= 1)
10693 wide_int mask
= wi::mask (w
, false,
10694 TYPE_PRECISION (type
));
10695 if (((c1
| c2
) & mask
) == mask
10696 && wi::bit_and_not (c1
, mask
) == 0)
10705 tem
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10706 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, type
, tem
,
10707 wide_int_to_tree (type
, c3
));
10708 return fold_build2_loc (loc
, BIT_IOR_EXPR
, type
, tem
, arg1
);
10712 /* See if this can be simplified into a rotate first. If that
10713 is unsuccessful continue in the association code. */
10717 /* Fold (X & 1) ^ 1 as (X & 1) == 0. */
10718 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10719 && INTEGRAL_TYPE_P (type
)
10720 && integer_onep (TREE_OPERAND (arg0
, 1))
10721 && integer_onep (arg1
))
10722 return fold_build2_loc (loc
, EQ_EXPR
, type
, arg0
,
10723 build_zero_cst (TREE_TYPE (arg0
)));
10725 /* See if this can be simplified into a rotate first. If that
10726 is unsuccessful continue in the association code. */
10730 /* Fold (X ^ 1) & 1 as (X & 1) == 0. */
10731 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
10732 && INTEGRAL_TYPE_P (type
)
10733 && integer_onep (TREE_OPERAND (arg0
, 1))
10734 && integer_onep (arg1
))
10737 tem
= TREE_OPERAND (arg0
, 0);
10738 tem2
= fold_convert_loc (loc
, TREE_TYPE (tem
), arg1
);
10739 tem2
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (tem
),
10741 return fold_build2_loc (loc
, EQ_EXPR
, type
, tem2
,
10742 build_zero_cst (TREE_TYPE (tem
)));
10744 /* Fold ~X & 1 as (X & 1) == 0. */
10745 if (TREE_CODE (arg0
) == BIT_NOT_EXPR
10746 && INTEGRAL_TYPE_P (type
)
10747 && integer_onep (arg1
))
10750 tem
= TREE_OPERAND (arg0
, 0);
10751 tem2
= fold_convert_loc (loc
, TREE_TYPE (tem
), arg1
);
10752 tem2
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (tem
),
10754 return fold_build2_loc (loc
, EQ_EXPR
, type
, tem2
,
10755 build_zero_cst (TREE_TYPE (tem
)));
10757 /* Fold !X & 1 as X == 0. */
10758 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
10759 && integer_onep (arg1
))
10761 tem
= TREE_OPERAND (arg0
, 0);
10762 return fold_build2_loc (loc
, EQ_EXPR
, type
, tem
,
10763 build_zero_cst (TREE_TYPE (tem
)));
10766 /* Fold (X * Y) & -(1 << CST) to X * Y if Y is a constant
10767 multiple of 1 << CST. */
10768 if (TREE_CODE (arg1
) == INTEGER_CST
)
10770 wi::tree_to_wide_ref cst1
= wi::to_wide (arg1
);
10771 wide_int ncst1
= -cst1
;
10772 if ((cst1
& ncst1
) == ncst1
10773 && multiple_of_p (type
, arg0
,
10774 wide_int_to_tree (TREE_TYPE (arg1
), ncst1
)))
10775 return fold_convert_loc (loc
, type
, arg0
);
10778 /* Fold (X * CST1) & CST2 to zero if we can, or drop known zero
10780 if (TREE_CODE (arg1
) == INTEGER_CST
10781 && TREE_CODE (arg0
) == MULT_EXPR
10782 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
10784 wi::tree_to_wide_ref warg1
= wi::to_wide (arg1
);
10786 = mask_with_tz (type
, warg1
, wi::to_wide (TREE_OPERAND (arg0
, 1)));
10789 return omit_two_operands_loc (loc
, type
, build_zero_cst (type
),
10791 else if (masked
!= warg1
)
10793 /* Avoid the transform if arg1 is a mask of some
10794 mode which allows further optimizations. */
10795 int pop
= wi::popcount (warg1
);
10796 if (!(pop
>= BITS_PER_UNIT
10798 && wi::mask (pop
, false, warg1
.get_precision ()) == warg1
))
10799 return fold_build2_loc (loc
, code
, type
, op0
,
10800 wide_int_to_tree (type
, masked
));
10804 /* Simplify ((int)c & 0377) into (int)c, if c is unsigned char. */
10805 if (TREE_CODE (arg1
) == INTEGER_CST
&& TREE_CODE (arg0
) == NOP_EXPR
10806 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (arg0
, 0))))
10808 prec
= element_precision (TREE_TYPE (TREE_OPERAND (arg0
, 0)));
10810 wide_int mask
= wide_int::from (wi::to_wide (arg1
), prec
, UNSIGNED
);
10813 fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10819 /* Don't touch a floating-point divide by zero unless the mode
10820 of the constant can represent infinity. */
10821 if (TREE_CODE (arg1
) == REAL_CST
10822 && !MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (arg1
)))
10823 && real_zerop (arg1
))
10826 /* (-A) / (-B) -> A / B */
10827 if (TREE_CODE (arg0
) == NEGATE_EXPR
&& negate_expr_p (arg1
))
10828 return fold_build2_loc (loc
, RDIV_EXPR
, type
,
10829 TREE_OPERAND (arg0
, 0),
10830 negate_expr (arg1
));
10831 if (TREE_CODE (arg1
) == NEGATE_EXPR
&& negate_expr_p (arg0
))
10832 return fold_build2_loc (loc
, RDIV_EXPR
, type
,
10833 negate_expr (arg0
),
10834 TREE_OPERAND (arg1
, 0));
10837 case TRUNC_DIV_EXPR
:
10840 case FLOOR_DIV_EXPR
:
10841 /* Simplify A / (B << N) where A and B are positive and B is
10842 a power of 2, to A >> (N + log2(B)). */
10843 strict_overflow_p
= false;
10844 if (TREE_CODE (arg1
) == LSHIFT_EXPR
10845 && (TYPE_UNSIGNED (type
)
10846 || tree_expr_nonnegative_warnv_p (op0
, &strict_overflow_p
)))
10848 tree sval
= TREE_OPERAND (arg1
, 0);
10849 if (integer_pow2p (sval
) && tree_int_cst_sgn (sval
) > 0)
10851 tree sh_cnt
= TREE_OPERAND (arg1
, 1);
10852 tree pow2
= build_int_cst (TREE_TYPE (sh_cnt
),
10853 wi::exact_log2 (wi::to_wide (sval
)));
10855 if (strict_overflow_p
)
10856 fold_overflow_warning (("assuming signed overflow does not "
10857 "occur when simplifying A / (B << N)"),
10858 WARN_STRICT_OVERFLOW_MISC
);
10860 sh_cnt
= fold_build2_loc (loc
, PLUS_EXPR
, TREE_TYPE (sh_cnt
),
10862 return fold_build2_loc (loc
, RSHIFT_EXPR
, type
,
10863 fold_convert_loc (loc
, type
, arg0
), sh_cnt
);
10869 case ROUND_DIV_EXPR
:
10870 case CEIL_DIV_EXPR
:
10871 case EXACT_DIV_EXPR
:
10872 if (integer_zerop (arg1
))
10875 /* Convert -A / -B to A / B when the type is signed and overflow is
10877 if ((!INTEGRAL_TYPE_P (type
) || TYPE_OVERFLOW_UNDEFINED (type
))
10878 && TREE_CODE (op0
) == NEGATE_EXPR
10879 && negate_expr_p (op1
))
10881 if (INTEGRAL_TYPE_P (type
))
10882 fold_overflow_warning (("assuming signed overflow does not occur "
10883 "when distributing negation across "
10885 WARN_STRICT_OVERFLOW_MISC
);
10886 return fold_build2_loc (loc
, code
, type
,
10887 fold_convert_loc (loc
, type
,
10888 TREE_OPERAND (arg0
, 0)),
10889 negate_expr (op1
));
10891 if ((!INTEGRAL_TYPE_P (type
) || TYPE_OVERFLOW_UNDEFINED (type
))
10892 && TREE_CODE (arg1
) == NEGATE_EXPR
10893 && negate_expr_p (op0
))
10895 if (INTEGRAL_TYPE_P (type
))
10896 fold_overflow_warning (("assuming signed overflow does not occur "
10897 "when distributing negation across "
10899 WARN_STRICT_OVERFLOW_MISC
);
10900 return fold_build2_loc (loc
, code
, type
,
10902 fold_convert_loc (loc
, type
,
10903 TREE_OPERAND (arg1
, 0)));
10906 /* If arg0 is a multiple of arg1, then rewrite to the fastest div
10907 operation, EXACT_DIV_EXPR.
10909 Note that only CEIL_DIV_EXPR and FLOOR_DIV_EXPR are rewritten now.
10910 At one time others generated faster code, it's not clear if they do
10911 after the last round to changes to the DIV code in expmed.c. */
10912 if ((code
== CEIL_DIV_EXPR
|| code
== FLOOR_DIV_EXPR
)
10913 && multiple_of_p (type
, arg0
, arg1
))
10914 return fold_build2_loc (loc
, EXACT_DIV_EXPR
, type
,
10915 fold_convert (type
, arg0
),
10916 fold_convert (type
, arg1
));
10918 strict_overflow_p
= false;
10919 if (TREE_CODE (arg1
) == INTEGER_CST
10920 && (tem
= extract_muldiv (op0
, arg1
, code
, NULL_TREE
,
10921 &strict_overflow_p
)) != 0)
10923 if (strict_overflow_p
)
10924 fold_overflow_warning (("assuming signed overflow does not occur "
10925 "when simplifying division"),
10926 WARN_STRICT_OVERFLOW_MISC
);
10927 return fold_convert_loc (loc
, type
, tem
);
10932 case CEIL_MOD_EXPR
:
10933 case FLOOR_MOD_EXPR
:
10934 case ROUND_MOD_EXPR
:
10935 case TRUNC_MOD_EXPR
:
10936 strict_overflow_p
= false;
10937 if (TREE_CODE (arg1
) == INTEGER_CST
10938 && (tem
= extract_muldiv (op0
, arg1
, code
, NULL_TREE
,
10939 &strict_overflow_p
)) != 0)
10941 if (strict_overflow_p
)
10942 fold_overflow_warning (("assuming signed overflow does not occur "
10943 "when simplifying modulus"),
10944 WARN_STRICT_OVERFLOW_MISC
);
10945 return fold_convert_loc (loc
, type
, tem
);
10954 /* Since negative shift count is not well-defined,
10955 don't try to compute it in the compiler. */
10956 if (TREE_CODE (arg1
) == INTEGER_CST
&& tree_int_cst_sgn (arg1
) < 0)
10959 prec
= element_precision (type
);
10961 /* If we have a rotate of a bit operation with the rotate count and
10962 the second operand of the bit operation both constant,
10963 permute the two operations. */
10964 if (code
== RROTATE_EXPR
&& TREE_CODE (arg1
) == INTEGER_CST
10965 && (TREE_CODE (arg0
) == BIT_AND_EXPR
10966 || TREE_CODE (arg0
) == BIT_IOR_EXPR
10967 || TREE_CODE (arg0
) == BIT_XOR_EXPR
)
10968 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
10970 tree arg00
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10971 tree arg01
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 1));
10972 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
,
10973 fold_build2_loc (loc
, code
, type
,
10975 fold_build2_loc (loc
, code
, type
,
10979 /* Two consecutive rotates adding up to the some integer
10980 multiple of the precision of the type can be ignored. */
10981 if (code
== RROTATE_EXPR
&& TREE_CODE (arg1
) == INTEGER_CST
10982 && TREE_CODE (arg0
) == RROTATE_EXPR
10983 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
10984 && wi::umod_trunc (wi::to_wide (arg1
)
10985 + wi::to_wide (TREE_OPERAND (arg0
, 1)),
10987 return fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10995 case TRUTH_ANDIF_EXPR
:
10996 /* Note that the operands of this must be ints
10997 and their values must be 0 or 1.
10998 ("true" is a fixed value perhaps depending on the language.) */
10999 /* If first arg is constant zero, return it. */
11000 if (integer_zerop (arg0
))
11001 return fold_convert_loc (loc
, type
, arg0
);
11003 case TRUTH_AND_EXPR
:
11004 /* If either arg is constant true, drop it. */
11005 if (TREE_CODE (arg0
) == INTEGER_CST
&& ! integer_zerop (arg0
))
11006 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg1
));
11007 if (TREE_CODE (arg1
) == INTEGER_CST
&& ! integer_zerop (arg1
)
11008 /* Preserve sequence points. */
11009 && (code
!= TRUTH_ANDIF_EXPR
|| ! TREE_SIDE_EFFECTS (arg0
)))
11010 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
11011 /* If second arg is constant zero, result is zero, but first arg
11012 must be evaluated. */
11013 if (integer_zerop (arg1
))
11014 return omit_one_operand_loc (loc
, type
, arg1
, arg0
);
11015 /* Likewise for first arg, but note that only the TRUTH_AND_EXPR
11016 case will be handled here. */
11017 if (integer_zerop (arg0
))
11018 return omit_one_operand_loc (loc
, type
, arg0
, arg1
);
11020 /* !X && X is always false. */
11021 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
11022 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
11023 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg1
);
11024 /* X && !X is always false. */
11025 if (TREE_CODE (arg1
) == TRUTH_NOT_EXPR
11026 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
11027 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
11029 /* A < X && A + 1 > Y ==> A < X && A >= Y. Normally A + 1 > Y
11030 means A >= Y && A != MAX, but in this case we know that
11033 if (!TREE_SIDE_EFFECTS (arg0
)
11034 && !TREE_SIDE_EFFECTS (arg1
))
11036 tem
= fold_to_nonsharp_ineq_using_bound (loc
, arg0
, arg1
);
11037 if (tem
&& !operand_equal_p (tem
, arg0
, 0))
11038 return fold_build2_loc (loc
, code
, type
, tem
, arg1
);
11040 tem
= fold_to_nonsharp_ineq_using_bound (loc
, arg1
, arg0
);
11041 if (tem
&& !operand_equal_p (tem
, arg1
, 0))
11042 return fold_build2_loc (loc
, code
, type
, arg0
, tem
);
11045 if ((tem
= fold_truth_andor (loc
, code
, type
, arg0
, arg1
, op0
, op1
))
11051 case TRUTH_ORIF_EXPR
:
11052 /* Note that the operands of this must be ints
11053 and their values must be 0 or true.
11054 ("true" is a fixed value perhaps depending on the language.) */
11055 /* If first arg is constant true, return it. */
11056 if (TREE_CODE (arg0
) == INTEGER_CST
&& ! integer_zerop (arg0
))
11057 return fold_convert_loc (loc
, type
, arg0
);
11059 case TRUTH_OR_EXPR
:
11060 /* If either arg is constant zero, drop it. */
11061 if (TREE_CODE (arg0
) == INTEGER_CST
&& integer_zerop (arg0
))
11062 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg1
));
11063 if (TREE_CODE (arg1
) == INTEGER_CST
&& integer_zerop (arg1
)
11064 /* Preserve sequence points. */
11065 && (code
!= TRUTH_ORIF_EXPR
|| ! TREE_SIDE_EFFECTS (arg0
)))
11066 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
11067 /* If second arg is constant true, result is true, but we must
11068 evaluate first arg. */
11069 if (TREE_CODE (arg1
) == INTEGER_CST
&& ! integer_zerop (arg1
))
11070 return omit_one_operand_loc (loc
, type
, arg1
, arg0
);
11071 /* Likewise for first arg, but note this only occurs here for
11073 if (TREE_CODE (arg0
) == INTEGER_CST
&& ! integer_zerop (arg0
))
11074 return omit_one_operand_loc (loc
, type
, arg0
, arg1
);
11076 /* !X || X is always true. */
11077 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
11078 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
11079 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg1
);
11080 /* X || !X is always true. */
11081 if (TREE_CODE (arg1
) == TRUTH_NOT_EXPR
11082 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
11083 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
11085 /* (X && !Y) || (!X && Y) is X ^ Y */
11086 if (TREE_CODE (arg0
) == TRUTH_AND_EXPR
11087 && TREE_CODE (arg1
) == TRUTH_AND_EXPR
)
11089 tree a0
, a1
, l0
, l1
, n0
, n1
;
11091 a0
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 0));
11092 a1
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 1));
11094 l0
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
11095 l1
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 1));
11097 n0
= fold_build1_loc (loc
, TRUTH_NOT_EXPR
, type
, l0
);
11098 n1
= fold_build1_loc (loc
, TRUTH_NOT_EXPR
, type
, l1
);
11100 if ((operand_equal_p (n0
, a0
, 0)
11101 && operand_equal_p (n1
, a1
, 0))
11102 || (operand_equal_p (n0
, a1
, 0)
11103 && operand_equal_p (n1
, a0
, 0)))
11104 return fold_build2_loc (loc
, TRUTH_XOR_EXPR
, type
, l0
, n1
);
11107 if ((tem
= fold_truth_andor (loc
, code
, type
, arg0
, arg1
, op0
, op1
))
11113 case TRUTH_XOR_EXPR
:
11114 /* If the second arg is constant zero, drop it. */
11115 if (integer_zerop (arg1
))
11116 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
11117 /* If the second arg is constant true, this is a logical inversion. */
11118 if (integer_onep (arg1
))
11120 tem
= invert_truthvalue_loc (loc
, arg0
);
11121 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, tem
));
11123 /* Identical arguments cancel to zero. */
11124 if (operand_equal_p (arg0
, arg1
, 0))
11125 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
11127 /* !X ^ X is always true. */
11128 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
11129 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
11130 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg1
);
11132 /* X ^ !X is always true. */
11133 if (TREE_CODE (arg1
) == TRUTH_NOT_EXPR
11134 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
11135 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
11144 tem
= fold_comparison (loc
, code
, type
, op0
, op1
);
11145 if (tem
!= NULL_TREE
)
11148 /* bool_var != 1 becomes !bool_var. */
11149 if (TREE_CODE (TREE_TYPE (arg0
)) == BOOLEAN_TYPE
&& integer_onep (arg1
)
11150 && code
== NE_EXPR
)
11151 return fold_convert_loc (loc
, type
,
11152 fold_build1_loc (loc
, TRUTH_NOT_EXPR
,
11153 TREE_TYPE (arg0
), arg0
));
11155 /* bool_var == 0 becomes !bool_var. */
11156 if (TREE_CODE (TREE_TYPE (arg0
)) == BOOLEAN_TYPE
&& integer_zerop (arg1
)
11157 && code
== EQ_EXPR
)
11158 return fold_convert_loc (loc
, type
,
11159 fold_build1_loc (loc
, TRUTH_NOT_EXPR
,
11160 TREE_TYPE (arg0
), arg0
));
11162 /* !exp != 0 becomes !exp */
11163 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
&& integer_zerop (arg1
)
11164 && code
== NE_EXPR
)
11165 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
11167 /* If this is an EQ or NE comparison with zero and ARG0 is
11168 (1 << foo) & bar, convert it to (bar >> foo) & 1. Both require
11169 two operations, but the latter can be done in one less insn
11170 on machines that have only two-operand insns or on which a
11171 constant cannot be the first operand. */
11172 if (TREE_CODE (arg0
) == BIT_AND_EXPR
11173 && integer_zerop (arg1
))
11175 tree arg00
= TREE_OPERAND (arg0
, 0);
11176 tree arg01
= TREE_OPERAND (arg0
, 1);
11177 if (TREE_CODE (arg00
) == LSHIFT_EXPR
11178 && integer_onep (TREE_OPERAND (arg00
, 0)))
11180 tree tem
= fold_build2_loc (loc
, RSHIFT_EXPR
, TREE_TYPE (arg00
),
11181 arg01
, TREE_OPERAND (arg00
, 1));
11182 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg0
), tem
,
11183 build_int_cst (TREE_TYPE (arg0
), 1));
11184 return fold_build2_loc (loc
, code
, type
,
11185 fold_convert_loc (loc
, TREE_TYPE (arg1
), tem
),
11188 else if (TREE_CODE (arg01
) == LSHIFT_EXPR
11189 && integer_onep (TREE_OPERAND (arg01
, 0)))
11191 tree tem
= fold_build2_loc (loc
, RSHIFT_EXPR
, TREE_TYPE (arg01
),
11192 arg00
, TREE_OPERAND (arg01
, 1));
11193 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg0
), tem
,
11194 build_int_cst (TREE_TYPE (arg0
), 1));
11195 return fold_build2_loc (loc
, code
, type
,
11196 fold_convert_loc (loc
, TREE_TYPE (arg1
), tem
),
11201 /* Fold ((X >> C1) & C2) == 0 and ((X >> C1) & C2) != 0 where
11202 C1 is a valid shift constant, and C2 is a power of two, i.e.
11204 if (TREE_CODE (arg0
) == BIT_AND_EXPR
11205 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == RSHIFT_EXPR
11206 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1))
11208 && integer_pow2p (TREE_OPERAND (arg0
, 1))
11209 && integer_zerop (arg1
))
11211 tree itype
= TREE_TYPE (arg0
);
11212 tree arg001
= TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1);
11213 prec
= TYPE_PRECISION (itype
);
11215 /* Check for a valid shift count. */
11216 if (wi::ltu_p (wi::to_wide (arg001
), prec
))
11218 tree arg01
= TREE_OPERAND (arg0
, 1);
11219 tree arg000
= TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0);
11220 unsigned HOST_WIDE_INT log2
= tree_log2 (arg01
);
11221 /* If (C2 << C1) doesn't overflow, then ((X >> C1) & C2) != 0
11222 can be rewritten as (X & (C2 << C1)) != 0. */
11223 if ((log2
+ TREE_INT_CST_LOW (arg001
)) < prec
)
11225 tem
= fold_build2_loc (loc
, LSHIFT_EXPR
, itype
, arg01
, arg001
);
11226 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, itype
, arg000
, tem
);
11227 return fold_build2_loc (loc
, code
, type
, tem
,
11228 fold_convert_loc (loc
, itype
, arg1
));
11230 /* Otherwise, for signed (arithmetic) shifts,
11231 ((X >> C1) & C2) != 0 is rewritten as X < 0, and
11232 ((X >> C1) & C2) == 0 is rewritten as X >= 0. */
11233 else if (!TYPE_UNSIGNED (itype
))
11234 return fold_build2_loc (loc
, code
== EQ_EXPR
? GE_EXPR
: LT_EXPR
, type
,
11235 arg000
, build_int_cst (itype
, 0));
11236 /* Otherwise, of unsigned (logical) shifts,
11237 ((X >> C1) & C2) != 0 is rewritten as (X,false), and
11238 ((X >> C1) & C2) == 0 is rewritten as (X,true). */
11240 return omit_one_operand_loc (loc
, type
,
11241 code
== EQ_EXPR
? integer_one_node
11242 : integer_zero_node
,
11247 /* If this is a comparison of a field, we may be able to simplify it. */
11248 if ((TREE_CODE (arg0
) == COMPONENT_REF
11249 || TREE_CODE (arg0
) == BIT_FIELD_REF
)
11250 /* Handle the constant case even without -O
11251 to make sure the warnings are given. */
11252 && (optimize
|| TREE_CODE (arg1
) == INTEGER_CST
))
11254 t1
= optimize_bit_field_compare (loc
, code
, type
, arg0
, arg1
);
11259 /* Optimize comparisons of strlen vs zero to a compare of the
11260 first character of the string vs zero. To wit,
11261 strlen(ptr) == 0 => *ptr == 0
11262 strlen(ptr) != 0 => *ptr != 0
11263 Other cases should reduce to one of these two (or a constant)
11264 due to the return value of strlen being unsigned. */
11265 if (TREE_CODE (arg0
) == CALL_EXPR
&& integer_zerop (arg1
))
11267 tree fndecl
= get_callee_fndecl (arg0
);
11270 && fndecl_built_in_p (fndecl
, BUILT_IN_STRLEN
)
11271 && call_expr_nargs (arg0
) == 1
11272 && (TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (arg0
, 0)))
11276 = build_pointer_type (build_qualified_type (char_type_node
,
11278 tree ptr
= fold_convert_loc (loc
, ptrtype
,
11279 CALL_EXPR_ARG (arg0
, 0));
11280 tree iref
= build_fold_indirect_ref_loc (loc
, ptr
);
11281 return fold_build2_loc (loc
, code
, type
, iref
,
11282 build_int_cst (TREE_TYPE (iref
), 0));
11286 /* Fold (X >> C) != 0 into X < 0 if C is one less than the width
11287 of X. Similarly fold (X >> C) == 0 into X >= 0. */
11288 if (TREE_CODE (arg0
) == RSHIFT_EXPR
11289 && integer_zerop (arg1
)
11290 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
11292 tree arg00
= TREE_OPERAND (arg0
, 0);
11293 tree arg01
= TREE_OPERAND (arg0
, 1);
11294 tree itype
= TREE_TYPE (arg00
);
11295 if (wi::to_wide (arg01
) == element_precision (itype
) - 1)
11297 if (TYPE_UNSIGNED (itype
))
11299 itype
= signed_type_for (itype
);
11300 arg00
= fold_convert_loc (loc
, itype
, arg00
);
11302 return fold_build2_loc (loc
, code
== EQ_EXPR
? GE_EXPR
: LT_EXPR
,
11303 type
, arg00
, build_zero_cst (itype
));
11307 /* Fold (~X & C) == 0 into (X & C) != 0 and (~X & C) != 0 into
11308 (X & C) == 0 when C is a single bit. */
11309 if (TREE_CODE (arg0
) == BIT_AND_EXPR
11310 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_NOT_EXPR
11311 && integer_zerop (arg1
)
11312 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
11314 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg0
),
11315 TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0),
11316 TREE_OPERAND (arg0
, 1));
11317 return fold_build2_loc (loc
, code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
,
11319 fold_convert_loc (loc
, TREE_TYPE (arg0
),
11323 /* Fold ((X & C) ^ C) eq/ne 0 into (X & C) ne/eq 0, when the
11324 constant C is a power of two, i.e. a single bit. */
11325 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
11326 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_AND_EXPR
11327 && integer_zerop (arg1
)
11328 && integer_pow2p (TREE_OPERAND (arg0
, 1))
11329 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1),
11330 TREE_OPERAND (arg0
, 1), OEP_ONLY_CONST
))
11332 tree arg00
= TREE_OPERAND (arg0
, 0);
11333 return fold_build2_loc (loc
, code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
, type
,
11334 arg00
, build_int_cst (TREE_TYPE (arg00
), 0));
11337 /* Likewise, fold ((X ^ C) & C) eq/ne 0 into (X & C) ne/eq 0,
11338 when is C is a power of two, i.e. a single bit. */
11339 if (TREE_CODE (arg0
) == BIT_AND_EXPR
11340 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_XOR_EXPR
11341 && integer_zerop (arg1
)
11342 && integer_pow2p (TREE_OPERAND (arg0
, 1))
11343 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1),
11344 TREE_OPERAND (arg0
, 1), OEP_ONLY_CONST
))
11346 tree arg000
= TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0);
11347 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg000
),
11348 arg000
, TREE_OPERAND (arg0
, 1));
11349 return fold_build2_loc (loc
, code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
, type
,
11350 tem
, build_int_cst (TREE_TYPE (tem
), 0));
11353 if (integer_zerop (arg1
)
11354 && tree_expr_nonzero_p (arg0
))
11356 tree res
= constant_boolean_node (code
==NE_EXPR
, type
);
11357 return omit_one_operand_loc (loc
, type
, res
, arg0
);
11360 /* Fold (X & C) op (Y & C) as (X ^ Y) & C op 0", and symmetries. */
11361 if (TREE_CODE (arg0
) == BIT_AND_EXPR
11362 && TREE_CODE (arg1
) == BIT_AND_EXPR
)
11364 tree arg00
= TREE_OPERAND (arg0
, 0);
11365 tree arg01
= TREE_OPERAND (arg0
, 1);
11366 tree arg10
= TREE_OPERAND (arg1
, 0);
11367 tree arg11
= TREE_OPERAND (arg1
, 1);
11368 tree itype
= TREE_TYPE (arg0
);
11370 if (operand_equal_p (arg01
, arg11
, 0))
11372 tem
= fold_convert_loc (loc
, itype
, arg10
);
11373 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg00
, tem
);
11374 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, itype
, tem
, arg01
);
11375 return fold_build2_loc (loc
, code
, type
, tem
,
11376 build_zero_cst (itype
));
11378 if (operand_equal_p (arg01
, arg10
, 0))
11380 tem
= fold_convert_loc (loc
, itype
, arg11
);
11381 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg00
, tem
);
11382 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, itype
, tem
, arg01
);
11383 return fold_build2_loc (loc
, code
, type
, tem
,
11384 build_zero_cst (itype
));
11386 if (operand_equal_p (arg00
, arg11
, 0))
11388 tem
= fold_convert_loc (loc
, itype
, arg10
);
11389 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg01
, tem
);
11390 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, itype
, tem
, arg00
);
11391 return fold_build2_loc (loc
, code
, type
, tem
,
11392 build_zero_cst (itype
));
11394 if (operand_equal_p (arg00
, arg10
, 0))
11396 tem
= fold_convert_loc (loc
, itype
, arg11
);
11397 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg01
, tem
);
11398 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, itype
, tem
, arg00
);
11399 return fold_build2_loc (loc
, code
, type
, tem
,
11400 build_zero_cst (itype
));
11404 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
11405 && TREE_CODE (arg1
) == BIT_XOR_EXPR
)
11407 tree arg00
= TREE_OPERAND (arg0
, 0);
11408 tree arg01
= TREE_OPERAND (arg0
, 1);
11409 tree arg10
= TREE_OPERAND (arg1
, 0);
11410 tree arg11
= TREE_OPERAND (arg1
, 1);
11411 tree itype
= TREE_TYPE (arg0
);
11413 /* Optimize (X ^ Z) op (Y ^ Z) as X op Y, and symmetries.
11414 operand_equal_p guarantees no side-effects so we don't need
11415 to use omit_one_operand on Z. */
11416 if (operand_equal_p (arg01
, arg11
, 0))
11417 return fold_build2_loc (loc
, code
, type
, arg00
,
11418 fold_convert_loc (loc
, TREE_TYPE (arg00
),
11420 if (operand_equal_p (arg01
, arg10
, 0))
11421 return fold_build2_loc (loc
, code
, type
, arg00
,
11422 fold_convert_loc (loc
, TREE_TYPE (arg00
),
11424 if (operand_equal_p (arg00
, arg11
, 0))
11425 return fold_build2_loc (loc
, code
, type
, arg01
,
11426 fold_convert_loc (loc
, TREE_TYPE (arg01
),
11428 if (operand_equal_p (arg00
, arg10
, 0))
11429 return fold_build2_loc (loc
, code
, type
, arg01
,
11430 fold_convert_loc (loc
, TREE_TYPE (arg01
),
11433 /* Optimize (X ^ C1) op (Y ^ C2) as (X ^ (C1 ^ C2)) op Y. */
11434 if (TREE_CODE (arg01
) == INTEGER_CST
11435 && TREE_CODE (arg11
) == INTEGER_CST
)
11437 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg01
,
11438 fold_convert_loc (loc
, itype
, arg11
));
11439 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg00
, tem
);
11440 return fold_build2_loc (loc
, code
, type
, tem
,
11441 fold_convert_loc (loc
, itype
, arg10
));
11445 /* Attempt to simplify equality/inequality comparisons of complex
11446 values. Only lower the comparison if the result is known or
11447 can be simplified to a single scalar comparison. */
11448 if ((TREE_CODE (arg0
) == COMPLEX_EXPR
11449 || TREE_CODE (arg0
) == COMPLEX_CST
)
11450 && (TREE_CODE (arg1
) == COMPLEX_EXPR
11451 || TREE_CODE (arg1
) == COMPLEX_CST
))
11453 tree real0
, imag0
, real1
, imag1
;
11456 if (TREE_CODE (arg0
) == COMPLEX_EXPR
)
11458 real0
= TREE_OPERAND (arg0
, 0);
11459 imag0
= TREE_OPERAND (arg0
, 1);
11463 real0
= TREE_REALPART (arg0
);
11464 imag0
= TREE_IMAGPART (arg0
);
11467 if (TREE_CODE (arg1
) == COMPLEX_EXPR
)
11469 real1
= TREE_OPERAND (arg1
, 0);
11470 imag1
= TREE_OPERAND (arg1
, 1);
11474 real1
= TREE_REALPART (arg1
);
11475 imag1
= TREE_IMAGPART (arg1
);
11478 rcond
= fold_binary_loc (loc
, code
, type
, real0
, real1
);
11479 if (rcond
&& TREE_CODE (rcond
) == INTEGER_CST
)
11481 if (integer_zerop (rcond
))
11483 if (code
== EQ_EXPR
)
11484 return omit_two_operands_loc (loc
, type
, boolean_false_node
,
11486 return fold_build2_loc (loc
, NE_EXPR
, type
, imag0
, imag1
);
11490 if (code
== NE_EXPR
)
11491 return omit_two_operands_loc (loc
, type
, boolean_true_node
,
11493 return fold_build2_loc (loc
, EQ_EXPR
, type
, imag0
, imag1
);
11497 icond
= fold_binary_loc (loc
, code
, type
, imag0
, imag1
);
11498 if (icond
&& TREE_CODE (icond
) == INTEGER_CST
)
11500 if (integer_zerop (icond
))
11502 if (code
== EQ_EXPR
)
11503 return omit_two_operands_loc (loc
, type
, boolean_false_node
,
11505 return fold_build2_loc (loc
, NE_EXPR
, type
, real0
, real1
);
11509 if (code
== NE_EXPR
)
11510 return omit_two_operands_loc (loc
, type
, boolean_true_node
,
11512 return fold_build2_loc (loc
, EQ_EXPR
, type
, real0
, real1
);
11523 tem
= fold_comparison (loc
, code
, type
, op0
, op1
);
11524 if (tem
!= NULL_TREE
)
11527 /* Transform comparisons of the form X +- C CMP X. */
11528 if ((TREE_CODE (arg0
) == PLUS_EXPR
|| TREE_CODE (arg0
) == MINUS_EXPR
)
11529 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0)
11530 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == REAL_CST
11531 && !HONOR_SNANS (arg0
))
11533 tree arg01
= TREE_OPERAND (arg0
, 1);
11534 enum tree_code code0
= TREE_CODE (arg0
);
11535 int is_positive
= REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg01
)) ? -1 : 1;
11537 /* (X - c) > X becomes false. */
11538 if (code
== GT_EXPR
11539 && ((code0
== MINUS_EXPR
&& is_positive
>= 0)
11540 || (code0
== PLUS_EXPR
&& is_positive
<= 0)))
11541 return constant_boolean_node (0, type
);
11543 /* Likewise (X + c) < X becomes false. */
11544 if (code
== LT_EXPR
11545 && ((code0
== PLUS_EXPR
&& is_positive
>= 0)
11546 || (code0
== MINUS_EXPR
&& is_positive
<= 0)))
11547 return constant_boolean_node (0, type
);
11549 /* Convert (X - c) <= X to true. */
11550 if (!HONOR_NANS (arg1
)
11552 && ((code0
== MINUS_EXPR
&& is_positive
>= 0)
11553 || (code0
== PLUS_EXPR
&& is_positive
<= 0)))
11554 return constant_boolean_node (1, type
);
11556 /* Convert (X + c) >= X to true. */
11557 if (!HONOR_NANS (arg1
)
11559 && ((code0
== PLUS_EXPR
&& is_positive
>= 0)
11560 || (code0
== MINUS_EXPR
&& is_positive
<= 0)))
11561 return constant_boolean_node (1, type
);
11564 /* If we are comparing an ABS_EXPR with a constant, we can
11565 convert all the cases into explicit comparisons, but they may
11566 well not be faster than doing the ABS and one comparison.
11567 But ABS (X) <= C is a range comparison, which becomes a subtraction
11568 and a comparison, and is probably faster. */
11569 if (code
== LE_EXPR
11570 && TREE_CODE (arg1
) == INTEGER_CST
11571 && TREE_CODE (arg0
) == ABS_EXPR
11572 && ! TREE_SIDE_EFFECTS (arg0
)
11573 && (tem
= negate_expr (arg1
)) != 0
11574 && TREE_CODE (tem
) == INTEGER_CST
11575 && !TREE_OVERFLOW (tem
))
11576 return fold_build2_loc (loc
, TRUTH_ANDIF_EXPR
, type
,
11577 build2 (GE_EXPR
, type
,
11578 TREE_OPERAND (arg0
, 0), tem
),
11579 build2 (LE_EXPR
, type
,
11580 TREE_OPERAND (arg0
, 0), arg1
));
11582 /* Convert ABS_EXPR<x> >= 0 to true. */
11583 strict_overflow_p
= false;
11584 if (code
== GE_EXPR
11585 && (integer_zerop (arg1
)
11586 || (! HONOR_NANS (arg0
)
11587 && real_zerop (arg1
)))
11588 && tree_expr_nonnegative_warnv_p (arg0
, &strict_overflow_p
))
11590 if (strict_overflow_p
)
11591 fold_overflow_warning (("assuming signed overflow does not occur "
11592 "when simplifying comparison of "
11593 "absolute value and zero"),
11594 WARN_STRICT_OVERFLOW_CONDITIONAL
);
11595 return omit_one_operand_loc (loc
, type
,
11596 constant_boolean_node (true, type
),
11600 /* Convert ABS_EXPR<x> < 0 to false. */
11601 strict_overflow_p
= false;
11602 if (code
== LT_EXPR
11603 && (integer_zerop (arg1
) || real_zerop (arg1
))
11604 && tree_expr_nonnegative_warnv_p (arg0
, &strict_overflow_p
))
11606 if (strict_overflow_p
)
11607 fold_overflow_warning (("assuming signed overflow does not occur "
11608 "when simplifying comparison of "
11609 "absolute value and zero"),
11610 WARN_STRICT_OVERFLOW_CONDITIONAL
);
11611 return omit_one_operand_loc (loc
, type
,
11612 constant_boolean_node (false, type
),
11616 /* If X is unsigned, convert X < (1 << Y) into X >> Y == 0
11617 and similarly for >= into !=. */
11618 if ((code
== LT_EXPR
|| code
== GE_EXPR
)
11619 && TYPE_UNSIGNED (TREE_TYPE (arg0
))
11620 && TREE_CODE (arg1
) == LSHIFT_EXPR
11621 && integer_onep (TREE_OPERAND (arg1
, 0)))
11622 return build2_loc (loc
, code
== LT_EXPR
? EQ_EXPR
: NE_EXPR
, type
,
11623 build2 (RSHIFT_EXPR
, TREE_TYPE (arg0
), arg0
,
11624 TREE_OPERAND (arg1
, 1)),
11625 build_zero_cst (TREE_TYPE (arg0
)));
11627 /* Similarly for X < (cast) (1 << Y). But cast can't be narrowing,
11628 otherwise Y might be >= # of bits in X's type and thus e.g.
11629 (unsigned char) (1 << Y) for Y 15 might be 0.
11630 If the cast is widening, then 1 << Y should have unsigned type,
11631 otherwise if Y is number of bits in the signed shift type minus 1,
11632 we can't optimize this. E.g. (unsigned long long) (1 << Y) for Y
11633 31 might be 0xffffffff80000000. */
11634 if ((code
== LT_EXPR
|| code
== GE_EXPR
)
11635 && TYPE_UNSIGNED (TREE_TYPE (arg0
))
11636 && CONVERT_EXPR_P (arg1
)
11637 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == LSHIFT_EXPR
11638 && (element_precision (TREE_TYPE (arg1
))
11639 >= element_precision (TREE_TYPE (TREE_OPERAND (arg1
, 0))))
11640 && (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
11641 || (element_precision (TREE_TYPE (arg1
))
11642 == element_precision (TREE_TYPE (TREE_OPERAND (arg1
, 0)))))
11643 && integer_onep (TREE_OPERAND (TREE_OPERAND (arg1
, 0), 0)))
11645 tem
= build2 (RSHIFT_EXPR
, TREE_TYPE (arg0
), arg0
,
11646 TREE_OPERAND (TREE_OPERAND (arg1
, 0), 1));
11647 return build2_loc (loc
, code
== LT_EXPR
? EQ_EXPR
: NE_EXPR
, type
,
11648 fold_convert_loc (loc
, TREE_TYPE (arg0
), tem
),
11649 build_zero_cst (TREE_TYPE (arg0
)));
11654 case UNORDERED_EXPR
:
11662 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
11664 tree targ0
= strip_float_extensions (arg0
);
11665 tree targ1
= strip_float_extensions (arg1
);
11666 tree newtype
= TREE_TYPE (targ0
);
11668 if (TYPE_PRECISION (TREE_TYPE (targ1
)) > TYPE_PRECISION (newtype
))
11669 newtype
= TREE_TYPE (targ1
);
11671 if (TYPE_PRECISION (newtype
) < TYPE_PRECISION (TREE_TYPE (arg0
)))
11672 return fold_build2_loc (loc
, code
, type
,
11673 fold_convert_loc (loc
, newtype
, targ0
),
11674 fold_convert_loc (loc
, newtype
, targ1
));
11679 case COMPOUND_EXPR
:
11680 /* When pedantic, a compound expression can be neither an lvalue
11681 nor an integer constant expression. */
11682 if (TREE_SIDE_EFFECTS (arg0
) || TREE_CONSTANT (arg1
))
11684 /* Don't let (0, 0) be null pointer constant. */
11685 tem
= integer_zerop (arg1
) ? build1 (NOP_EXPR
, type
, arg1
)
11686 : fold_convert_loc (loc
, type
, arg1
);
11687 return pedantic_non_lvalue_loc (loc
, tem
);
11690 /* An ASSERT_EXPR should never be passed to fold_binary. */
11691 gcc_unreachable ();
11695 } /* switch (code) */
11698 /* For constants M and N, if M == (1LL << cst) - 1 && (N & M) == M,
11699 ((A & N) + B) & M -> (A + B) & M
11700 Similarly if (N & M) == 0,
11701 ((A | N) + B) & M -> (A + B) & M
11702 and for - instead of + (or unary - instead of +)
11703 and/or ^ instead of |.
11704 If B is constant and (B & M) == 0, fold into A & M.
11706 This function is a helper for match.pd patterns. Return non-NULL
11707 type in which the simplified operation should be performed only
11708 if any optimization is possible.
11710 ARG1 is M above, ARG00 is left operand of +/-, if CODE00 is BIT_*_EXPR,
11711 then ARG00{0,1} are operands of that bitop, otherwise CODE00 is ERROR_MARK.
11712 Similarly for ARG01, CODE01 and ARG01{0,1}, just for the right operand of
11715 fold_bit_and_mask (tree type
, tree arg1
, enum tree_code code
,
11716 tree arg00
, enum tree_code code00
, tree arg000
, tree arg001
,
11717 tree arg01
, enum tree_code code01
, tree arg010
, tree arg011
,
11720 gcc_assert (TREE_CODE (arg1
) == INTEGER_CST
);
11721 gcc_assert (code
== PLUS_EXPR
|| code
== MINUS_EXPR
|| code
== NEGATE_EXPR
);
11722 wi::tree_to_wide_ref cst1
= wi::to_wide (arg1
);
11724 || (cst1
& (cst1
+ 1)) != 0
11725 || !INTEGRAL_TYPE_P (type
)
11726 || (!TYPE_OVERFLOW_WRAPS (type
)
11727 && TREE_CODE (type
) != INTEGER_TYPE
)
11728 || (wi::max_value (type
) & cst1
) != cst1
)
11731 enum tree_code codes
[2] = { code00
, code01
};
11732 tree arg0xx
[4] = { arg000
, arg001
, arg010
, arg011
};
11736 /* Now we know that arg0 is (C + D) or (C - D) or -C and
11737 arg1 (M) is == (1LL << cst) - 1.
11738 Store C into PMOP[0] and D into PMOP[1]. */
11741 which
= code
!= NEGATE_EXPR
;
11743 for (; which
>= 0; which
--)
11744 switch (codes
[which
])
11749 gcc_assert (TREE_CODE (arg0xx
[2 * which
+ 1]) == INTEGER_CST
);
11750 cst0
= wi::to_wide (arg0xx
[2 * which
+ 1]) & cst1
;
11751 if (codes
[which
] == BIT_AND_EXPR
)
11756 else if (cst0
!= 0)
11758 /* If C or D is of the form (A & N) where
11759 (N & M) == M, or of the form (A | N) or
11760 (A ^ N) where (N & M) == 0, replace it with A. */
11761 pmop
[which
] = arg0xx
[2 * which
];
11764 if (TREE_CODE (pmop
[which
]) != INTEGER_CST
)
11766 /* If C or D is a N where (N & M) == 0, it can be
11767 omitted (replaced with 0). */
11768 if ((code
== PLUS_EXPR
11769 || (code
== MINUS_EXPR
&& which
== 0))
11770 && (cst1
& wi::to_wide (pmop
[which
])) == 0)
11771 pmop
[which
] = build_int_cst (type
, 0);
11772 /* Similarly, with C - N where (-N & M) == 0. */
11773 if (code
== MINUS_EXPR
11775 && (cst1
& -wi::to_wide (pmop
[which
])) == 0)
11776 pmop
[which
] = build_int_cst (type
, 0);
11779 gcc_unreachable ();
11782 /* Only build anything new if we optimized one or both arguments above. */
11783 if (pmop
[0] == arg00
&& pmop
[1] == arg01
)
11786 if (TYPE_OVERFLOW_WRAPS (type
))
11789 return unsigned_type_for (type
);
11792 /* Used by contains_label_[p1]. */
11794 struct contains_label_data
11796 hash_set
<tree
> *pset
;
11797 bool inside_switch_p
;
11800 /* Callback for walk_tree, looking for LABEL_EXPR. Return *TP if it is
11801 a LABEL_EXPR or CASE_LABEL_EXPR not inside of another SWITCH_EXPR; otherwise
11802 return NULL_TREE. Do not check the subtrees of GOTO_EXPR. */
11805 contains_label_1 (tree
*tp
, int *walk_subtrees
, void *data
)
11807 contains_label_data
*d
= (contains_label_data
*) data
;
11808 switch (TREE_CODE (*tp
))
11813 case CASE_LABEL_EXPR
:
11814 if (!d
->inside_switch_p
)
11819 if (!d
->inside_switch_p
)
11821 if (walk_tree (&SWITCH_COND (*tp
), contains_label_1
, data
, d
->pset
))
11823 d
->inside_switch_p
= true;
11824 if (walk_tree (&SWITCH_BODY (*tp
), contains_label_1
, data
, d
->pset
))
11826 d
->inside_switch_p
= false;
11827 *walk_subtrees
= 0;
11832 *walk_subtrees
= 0;
11840 /* Return whether the sub-tree ST contains a label which is accessible from
11841 outside the sub-tree. */
11844 contains_label_p (tree st
)
11846 hash_set
<tree
> pset
;
11847 contains_label_data data
= { &pset
, false };
11848 return walk_tree (&st
, contains_label_1
, &data
, &pset
) != NULL_TREE
;
11851 /* Fold a ternary expression of code CODE and type TYPE with operands
11852 OP0, OP1, and OP2. Return the folded expression if folding is
11853 successful. Otherwise, return NULL_TREE. */
11856 fold_ternary_loc (location_t loc
, enum tree_code code
, tree type
,
11857 tree op0
, tree op1
, tree op2
)
11860 tree arg0
= NULL_TREE
, arg1
= NULL_TREE
, arg2
= NULL_TREE
;
11861 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
11863 gcc_assert (IS_EXPR_CODE_CLASS (kind
)
11864 && TREE_CODE_LENGTH (code
) == 3);
11866 /* If this is a commutative operation, and OP0 is a constant, move it
11867 to OP1 to reduce the number of tests below. */
11868 if (commutative_ternary_tree_code (code
)
11869 && tree_swap_operands_p (op0
, op1
))
11870 return fold_build3_loc (loc
, code
, type
, op1
, op0
, op2
);
11872 tem
= generic_simplify (loc
, code
, type
, op0
, op1
, op2
);
11876 /* Strip any conversions that don't change the mode. This is safe
11877 for every expression, except for a comparison expression because
11878 its signedness is derived from its operands. So, in the latter
11879 case, only strip conversions that don't change the signedness.
11881 Note that this is done as an internal manipulation within the
11882 constant folder, in order to find the simplest representation of
11883 the arguments so that their form can be studied. In any cases,
11884 the appropriate type conversions should be put back in the tree
11885 that will get out of the constant folder. */
11906 case COMPONENT_REF
:
11907 if (TREE_CODE (arg0
) == CONSTRUCTOR
11908 && ! type_contains_placeholder_p (TREE_TYPE (arg0
)))
11910 unsigned HOST_WIDE_INT idx
;
11912 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg0
), idx
, field
, value
)
11919 case VEC_COND_EXPR
:
11920 /* Pedantic ANSI C says that a conditional expression is never an lvalue,
11921 so all simple results must be passed through pedantic_non_lvalue. */
11922 if (TREE_CODE (arg0
) == INTEGER_CST
)
11924 tree unused_op
= integer_zerop (arg0
) ? op1
: op2
;
11925 tem
= integer_zerop (arg0
) ? op2
: op1
;
11926 /* Only optimize constant conditions when the selected branch
11927 has the same type as the COND_EXPR. This avoids optimizing
11928 away "c ? x : throw", where the throw has a void type.
11929 Avoid throwing away that operand which contains label. */
11930 if ((!TREE_SIDE_EFFECTS (unused_op
)
11931 || !contains_label_p (unused_op
))
11932 && (! VOID_TYPE_P (TREE_TYPE (tem
))
11933 || VOID_TYPE_P (type
)))
11934 return pedantic_non_lvalue_loc (loc
, tem
);
11937 else if (TREE_CODE (arg0
) == VECTOR_CST
)
11939 unsigned HOST_WIDE_INT nelts
;
11940 if ((TREE_CODE (arg1
) == VECTOR_CST
11941 || TREE_CODE (arg1
) == CONSTRUCTOR
)
11942 && (TREE_CODE (arg2
) == VECTOR_CST
11943 || TREE_CODE (arg2
) == CONSTRUCTOR
)
11944 && TYPE_VECTOR_SUBPARTS (type
).is_constant (&nelts
))
11946 vec_perm_builder
sel (nelts
, nelts
, 1);
11947 for (unsigned int i
= 0; i
< nelts
; i
++)
11949 tree val
= VECTOR_CST_ELT (arg0
, i
);
11950 if (integer_all_onesp (val
))
11951 sel
.quick_push (i
);
11952 else if (integer_zerop (val
))
11953 sel
.quick_push (nelts
+ i
);
11954 else /* Currently unreachable. */
11957 vec_perm_indices
indices (sel
, 2, nelts
);
11958 tree t
= fold_vec_perm (type
, arg1
, arg2
, indices
);
11959 if (t
!= NULL_TREE
)
11964 /* If we have A op B ? A : C, we may be able to convert this to a
11965 simpler expression, depending on the operation and the values
11966 of B and C. Signed zeros prevent all of these transformations,
11967 for reasons given above each one.
11969 Also try swapping the arguments and inverting the conditional. */
11970 if (COMPARISON_CLASS_P (arg0
)
11971 && operand_equal_for_comparison_p (TREE_OPERAND (arg0
, 0), op1
)
11972 && !HONOR_SIGNED_ZEROS (element_mode (op1
)))
11974 tem
= fold_cond_expr_with_comparison (loc
, type
, arg0
, op1
, op2
);
11979 if (COMPARISON_CLASS_P (arg0
)
11980 && operand_equal_for_comparison_p (TREE_OPERAND (arg0
, 0), op2
)
11981 && !HONOR_SIGNED_ZEROS (element_mode (op2
)))
11983 location_t loc0
= expr_location_or (arg0
, loc
);
11984 tem
= fold_invert_truthvalue (loc0
, arg0
);
11985 if (tem
&& COMPARISON_CLASS_P (tem
))
11987 tem
= fold_cond_expr_with_comparison (loc
, type
, tem
, op2
, op1
);
11993 /* If the second operand is simpler than the third, swap them
11994 since that produces better jump optimization results. */
11995 if (truth_value_p (TREE_CODE (arg0
))
11996 && tree_swap_operands_p (op1
, op2
))
11998 location_t loc0
= expr_location_or (arg0
, loc
);
11999 /* See if this can be inverted. If it can't, possibly because
12000 it was a floating-point inequality comparison, don't do
12002 tem
= fold_invert_truthvalue (loc0
, arg0
);
12004 return fold_build3_loc (loc
, code
, type
, tem
, op2
, op1
);
12007 /* Convert A ? 1 : 0 to simply A. */
12008 if ((code
== VEC_COND_EXPR
? integer_all_onesp (op1
)
12009 : (integer_onep (op1
)
12010 && !VECTOR_TYPE_P (type
)))
12011 && integer_zerop (op2
)
12012 /* If we try to convert OP0 to our type, the
12013 call to fold will try to move the conversion inside
12014 a COND, which will recurse. In that case, the COND_EXPR
12015 is probably the best choice, so leave it alone. */
12016 && type
== TREE_TYPE (arg0
))
12017 return pedantic_non_lvalue_loc (loc
, arg0
);
12019 /* Convert A ? 0 : 1 to !A. This prefers the use of NOT_EXPR
12020 over COND_EXPR in cases such as floating point comparisons. */
12021 if (integer_zerop (op1
)
12022 && code
== COND_EXPR
12023 && integer_onep (op2
)
12024 && !VECTOR_TYPE_P (type
)
12025 && truth_value_p (TREE_CODE (arg0
)))
12026 return pedantic_non_lvalue_loc (loc
,
12027 fold_convert_loc (loc
, type
,
12028 invert_truthvalue_loc (loc
,
12031 /* A < 0 ? <sign bit of A> : 0 is simply (A & <sign bit of A>). */
12032 if (TREE_CODE (arg0
) == LT_EXPR
12033 && integer_zerop (TREE_OPERAND (arg0
, 1))
12034 && integer_zerop (op2
)
12035 && (tem
= sign_bit_p (TREE_OPERAND (arg0
, 0), arg1
)))
12037 /* sign_bit_p looks through both zero and sign extensions,
12038 but for this optimization only sign extensions are
12040 tree tem2
= TREE_OPERAND (arg0
, 0);
12041 while (tem
!= tem2
)
12043 if (TREE_CODE (tem2
) != NOP_EXPR
12044 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (tem2
, 0))))
12049 tem2
= TREE_OPERAND (tem2
, 0);
12051 /* sign_bit_p only checks ARG1 bits within A's precision.
12052 If <sign bit of A> has wider type than A, bits outside
12053 of A's precision in <sign bit of A> need to be checked.
12054 If they are all 0, this optimization needs to be done
12055 in unsigned A's type, if they are all 1 in signed A's type,
12056 otherwise this can't be done. */
12058 && TYPE_PRECISION (TREE_TYPE (tem
))
12059 < TYPE_PRECISION (TREE_TYPE (arg1
))
12060 && TYPE_PRECISION (TREE_TYPE (tem
))
12061 < TYPE_PRECISION (type
))
12063 int inner_width
, outer_width
;
12066 inner_width
= TYPE_PRECISION (TREE_TYPE (tem
));
12067 outer_width
= TYPE_PRECISION (TREE_TYPE (arg1
));
12068 if (outer_width
> TYPE_PRECISION (type
))
12069 outer_width
= TYPE_PRECISION (type
);
12071 wide_int mask
= wi::shifted_mask
12072 (inner_width
, outer_width
- inner_width
, false,
12073 TYPE_PRECISION (TREE_TYPE (arg1
)));
12075 wide_int common
= mask
& wi::to_wide (arg1
);
12076 if (common
== mask
)
12078 tem_type
= signed_type_for (TREE_TYPE (tem
));
12079 tem
= fold_convert_loc (loc
, tem_type
, tem
);
12081 else if (common
== 0)
12083 tem_type
= unsigned_type_for (TREE_TYPE (tem
));
12084 tem
= fold_convert_loc (loc
, tem_type
, tem
);
12092 fold_convert_loc (loc
, type
,
12093 fold_build2_loc (loc
, BIT_AND_EXPR
,
12094 TREE_TYPE (tem
), tem
,
12095 fold_convert_loc (loc
,
12100 /* (A >> N) & 1 ? (1 << N) : 0 is simply A & (1 << N). A & 1 was
12101 already handled above. */
12102 if (TREE_CODE (arg0
) == BIT_AND_EXPR
12103 && integer_onep (TREE_OPERAND (arg0
, 1))
12104 && integer_zerop (op2
)
12105 && integer_pow2p (arg1
))
12107 tree tem
= TREE_OPERAND (arg0
, 0);
12109 if (TREE_CODE (tem
) == RSHIFT_EXPR
12110 && tree_fits_uhwi_p (TREE_OPERAND (tem
, 1))
12111 && (unsigned HOST_WIDE_INT
) tree_log2 (arg1
)
12112 == tree_to_uhwi (TREE_OPERAND (tem
, 1)))
12113 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
12114 fold_convert_loc (loc
, type
,
12115 TREE_OPERAND (tem
, 0)),
12119 /* A & N ? N : 0 is simply A & N if N is a power of two. This
12120 is probably obsolete because the first operand should be a
12121 truth value (that's why we have the two cases above), but let's
12122 leave it in until we can confirm this for all front-ends. */
12123 if (integer_zerop (op2
)
12124 && TREE_CODE (arg0
) == NE_EXPR
12125 && integer_zerop (TREE_OPERAND (arg0
, 1))
12126 && integer_pow2p (arg1
)
12127 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_AND_EXPR
12128 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1),
12129 arg1
, OEP_ONLY_CONST
)
12130 /* operand_equal_p compares just value, not precision, so e.g.
12131 arg1 could be 8-bit -128 and be power of two, but BIT_AND_EXPR
12132 second operand 32-bit -128, which is not a power of two (or vice
12134 && integer_pow2p (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1)))
12135 return pedantic_non_lvalue_loc (loc
,
12136 fold_convert_loc (loc
, type
,
12137 TREE_OPERAND (arg0
,
12140 /* Disable the transformations below for vectors, since
12141 fold_binary_op_with_conditional_arg may undo them immediately,
12142 yielding an infinite loop. */
12143 if (code
== VEC_COND_EXPR
)
12146 /* Convert A ? B : 0 into A && B if A and B are truth values. */
12147 if (integer_zerop (op2
)
12148 && truth_value_p (TREE_CODE (arg0
))
12149 && truth_value_p (TREE_CODE (arg1
))
12150 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
12151 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
? BIT_AND_EXPR
12152 : TRUTH_ANDIF_EXPR
,
12153 type
, fold_convert_loc (loc
, type
, arg0
), op1
);
12155 /* Convert A ? B : 1 into !A || B if A and B are truth values. */
12156 if (code
== VEC_COND_EXPR
? integer_all_onesp (op2
) : integer_onep (op2
)
12157 && truth_value_p (TREE_CODE (arg0
))
12158 && truth_value_p (TREE_CODE (arg1
))
12159 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
12161 location_t loc0
= expr_location_or (arg0
, loc
);
12162 /* Only perform transformation if ARG0 is easily inverted. */
12163 tem
= fold_invert_truthvalue (loc0
, arg0
);
12165 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
12168 type
, fold_convert_loc (loc
, type
, tem
),
12172 /* Convert A ? 0 : B into !A && B if A and B are truth values. */
12173 if (integer_zerop (arg1
)
12174 && truth_value_p (TREE_CODE (arg0
))
12175 && truth_value_p (TREE_CODE (op2
))
12176 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
12178 location_t loc0
= expr_location_or (arg0
, loc
);
12179 /* Only perform transformation if ARG0 is easily inverted. */
12180 tem
= fold_invert_truthvalue (loc0
, arg0
);
12182 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
12183 ? BIT_AND_EXPR
: TRUTH_ANDIF_EXPR
,
12184 type
, fold_convert_loc (loc
, type
, tem
),
12188 /* Convert A ? 1 : B into A || B if A and B are truth values. */
12189 if (code
== VEC_COND_EXPR
? integer_all_onesp (arg1
) : integer_onep (arg1
)
12190 && truth_value_p (TREE_CODE (arg0
))
12191 && truth_value_p (TREE_CODE (op2
))
12192 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
12193 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
12194 ? BIT_IOR_EXPR
: TRUTH_ORIF_EXPR
,
12195 type
, fold_convert_loc (loc
, type
, arg0
), op2
);
12200 /* CALL_EXPRs used to be ternary exprs. Catch any mistaken uses
12201 of fold_ternary on them. */
12202 gcc_unreachable ();
12204 case BIT_FIELD_REF
:
12205 if (TREE_CODE (arg0
) == VECTOR_CST
12206 && (type
== TREE_TYPE (TREE_TYPE (arg0
))
12207 || (VECTOR_TYPE_P (type
)
12208 && TREE_TYPE (type
) == TREE_TYPE (TREE_TYPE (arg0
))))
12209 && tree_fits_uhwi_p (op1
)
12210 && tree_fits_uhwi_p (op2
))
12212 tree eltype
= TREE_TYPE (TREE_TYPE (arg0
));
12213 unsigned HOST_WIDE_INT width
= tree_to_uhwi (TYPE_SIZE (eltype
));
12214 unsigned HOST_WIDE_INT n
= tree_to_uhwi (arg1
);
12215 unsigned HOST_WIDE_INT idx
= tree_to_uhwi (op2
);
12218 && (idx
% width
) == 0
12219 && (n
% width
) == 0
12220 && known_le ((idx
+ n
) / width
,
12221 TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0
))))
12226 if (TREE_CODE (arg0
) == VECTOR_CST
)
12230 tem
= VECTOR_CST_ELT (arg0
, idx
);
12231 if (VECTOR_TYPE_P (type
))
12232 tem
= fold_build1 (VIEW_CONVERT_EXPR
, type
, tem
);
12236 tree_vector_builder
vals (type
, n
, 1);
12237 for (unsigned i
= 0; i
< n
; ++i
)
12238 vals
.quick_push (VECTOR_CST_ELT (arg0
, idx
+ i
));
12239 return vals
.build ();
12244 /* On constants we can use native encode/interpret to constant
12245 fold (nearly) all BIT_FIELD_REFs. */
12246 if (CONSTANT_CLASS_P (arg0
)
12247 && can_native_interpret_type_p (type
)
12248 && BITS_PER_UNIT
== 8
12249 && tree_fits_uhwi_p (op1
)
12250 && tree_fits_uhwi_p (op2
))
12252 unsigned HOST_WIDE_INT bitpos
= tree_to_uhwi (op2
);
12253 unsigned HOST_WIDE_INT bitsize
= tree_to_uhwi (op1
);
12254 /* Limit us to a reasonable amount of work. To relax the
12255 other limitations we need bit-shifting of the buffer
12256 and rounding up the size. */
12257 if (bitpos
% BITS_PER_UNIT
== 0
12258 && bitsize
% BITS_PER_UNIT
== 0
12259 && bitsize
<= MAX_BITSIZE_MODE_ANY_MODE
)
12261 unsigned char b
[MAX_BITSIZE_MODE_ANY_MODE
/ BITS_PER_UNIT
];
12262 unsigned HOST_WIDE_INT len
12263 = native_encode_expr (arg0
, b
, bitsize
/ BITS_PER_UNIT
,
12264 bitpos
/ BITS_PER_UNIT
);
12266 && len
* BITS_PER_UNIT
>= bitsize
)
12268 tree v
= native_interpret_expr (type
, b
,
12269 bitsize
/ BITS_PER_UNIT
);
12278 case VEC_PERM_EXPR
:
12279 /* Perform constant folding of BIT_INSERT_EXPR. */
12280 if (TREE_CODE (arg2
) == VECTOR_CST
12281 && TREE_CODE (op0
) == VECTOR_CST
12282 && TREE_CODE (op1
) == VECTOR_CST
)
12284 /* Build a vector of integers from the tree mask. */
12285 vec_perm_builder builder
;
12286 if (!tree_to_vec_perm_builder (&builder
, arg2
))
12289 /* Create a vec_perm_indices for the integer vector. */
12290 poly_uint64 nelts
= TYPE_VECTOR_SUBPARTS (type
);
12291 bool single_arg
= (op0
== op1
);
12292 vec_perm_indices
sel (builder
, single_arg
? 1 : 2, nelts
);
12293 return fold_vec_perm (type
, op0
, op1
, sel
);
12297 case BIT_INSERT_EXPR
:
12298 /* Perform (partial) constant folding of BIT_INSERT_EXPR. */
12299 if (TREE_CODE (arg0
) == INTEGER_CST
12300 && TREE_CODE (arg1
) == INTEGER_CST
)
12302 unsigned HOST_WIDE_INT bitpos
= tree_to_uhwi (op2
);
12303 unsigned bitsize
= TYPE_PRECISION (TREE_TYPE (arg1
));
12304 wide_int tem
= (wi::to_wide (arg0
)
12305 & wi::shifted_mask (bitpos
, bitsize
, true,
12306 TYPE_PRECISION (type
)));
12308 = wi::lshift (wi::zext (wi::to_wide (arg1
, TYPE_PRECISION (type
)),
12310 return wide_int_to_tree (type
, wi::bit_or (tem
, tem2
));
12312 else if (TREE_CODE (arg0
) == VECTOR_CST
12313 && CONSTANT_CLASS_P (arg1
)
12314 && types_compatible_p (TREE_TYPE (TREE_TYPE (arg0
)),
12317 unsigned HOST_WIDE_INT bitpos
= tree_to_uhwi (op2
);
12318 unsigned HOST_WIDE_INT elsize
12319 = tree_to_uhwi (TYPE_SIZE (TREE_TYPE (arg1
)));
12320 if (bitpos
% elsize
== 0)
12322 unsigned k
= bitpos
/ elsize
;
12323 unsigned HOST_WIDE_INT nelts
;
12324 if (operand_equal_p (VECTOR_CST_ELT (arg0
, k
), arg1
, 0))
12326 else if (VECTOR_CST_NELTS (arg0
).is_constant (&nelts
))
12328 tree_vector_builder
elts (type
, nelts
, 1);
12329 elts
.quick_grow (nelts
);
12330 for (unsigned HOST_WIDE_INT i
= 0; i
< nelts
; ++i
)
12331 elts
[i
] = (i
== k
? arg1
: VECTOR_CST_ELT (arg0
, i
));
12332 return elts
.build ();
12340 } /* switch (code) */
12343 /* Gets the element ACCESS_INDEX from CTOR, which must be a CONSTRUCTOR
12344 of an array (or vector). *CTOR_IDX if non-NULL is updated with the
12345 constructor element index of the value returned. If the element is
12346 not found NULL_TREE is returned and *CTOR_IDX is updated to
12347 the index of the element after the ACCESS_INDEX position (which
12348 may be outside of the CTOR array). */
12351 get_array_ctor_element_at_index (tree ctor
, offset_int access_index
,
12352 unsigned *ctor_idx
)
12354 tree index_type
= NULL_TREE
;
12355 signop index_sgn
= UNSIGNED
;
12356 offset_int low_bound
= 0;
12358 if (TREE_CODE (TREE_TYPE (ctor
)) == ARRAY_TYPE
)
12360 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ctor
));
12361 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
12363 /* Static constructors for variably sized objects makes no sense. */
12364 gcc_assert (TREE_CODE (TYPE_MIN_VALUE (domain_type
)) == INTEGER_CST
);
12365 index_type
= TREE_TYPE (TYPE_MIN_VALUE (domain_type
));
12366 /* ??? When it is obvious that the range is signed, treat it so. */
12367 if (TYPE_UNSIGNED (index_type
)
12368 && TYPE_MAX_VALUE (domain_type
)
12369 && tree_int_cst_lt (TYPE_MAX_VALUE (domain_type
),
12370 TYPE_MIN_VALUE (domain_type
)))
12372 index_sgn
= SIGNED
;
12374 = offset_int::from (wi::to_wide (TYPE_MIN_VALUE (domain_type
)),
12379 index_sgn
= TYPE_SIGN (index_type
);
12380 low_bound
= wi::to_offset (TYPE_MIN_VALUE (domain_type
));
12386 access_index
= wi::ext (access_index
, TYPE_PRECISION (index_type
),
12389 offset_int index
= low_bound
;
12391 index
= wi::ext (index
, TYPE_PRECISION (index_type
), index_sgn
);
12393 offset_int max_index
= index
;
12396 bool first_p
= true;
12398 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor
), cnt
, cfield
, cval
)
12400 /* Array constructor might explicitly set index, or specify a range,
12401 or leave index NULL meaning that it is next index after previous
12405 if (TREE_CODE (cfield
) == INTEGER_CST
)
12407 = offset_int::from (wi::to_wide (cfield
), index_sgn
);
12410 gcc_assert (TREE_CODE (cfield
) == RANGE_EXPR
);
12411 index
= offset_int::from (wi::to_wide (TREE_OPERAND (cfield
, 0)),
12414 = offset_int::from (wi::to_wide (TREE_OPERAND (cfield
, 1)),
12416 gcc_checking_assert (wi::le_p (index
, max_index
, index_sgn
));
12421 index
= max_index
+ 1;
12423 index
= wi::ext (index
, TYPE_PRECISION (index_type
), index_sgn
);
12424 gcc_checking_assert (wi::gt_p (index
, max_index
, index_sgn
));
12430 /* Do we have match? */
12431 if (wi::cmp (access_index
, index
, index_sgn
) >= 0)
12433 if (wi::cmp (access_index
, max_index
, index_sgn
) <= 0)
12440 else if (in_gimple_form
)
12441 /* We're past the element we search for. Note during parsing
12442 the elements might not be sorted.
12443 ??? We should use a binary search and a flag on the
12444 CONSTRUCTOR as to whether elements are sorted in declaration
12453 /* Perform constant folding and related simplification of EXPR.
12454 The related simplifications include x*1 => x, x*0 => 0, etc.,
12455 and application of the associative law.
12456 NOP_EXPR conversions may be removed freely (as long as we
12457 are careful not to change the type of the overall expression).
12458 We cannot simplify through a CONVERT_EXPR, FIX_EXPR or FLOAT_EXPR,
12459 but we can constant-fold them if they have constant operands. */
12461 #ifdef ENABLE_FOLD_CHECKING
12462 # define fold(x) fold_1 (x)
12463 static tree
fold_1 (tree
);
12469 const tree t
= expr
;
12470 enum tree_code code
= TREE_CODE (t
);
12471 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
12473 location_t loc
= EXPR_LOCATION (expr
);
12475 /* Return right away if a constant. */
12476 if (kind
== tcc_constant
)
12479 /* CALL_EXPR-like objects with variable numbers of operands are
12480 treated specially. */
12481 if (kind
== tcc_vl_exp
)
12483 if (code
== CALL_EXPR
)
12485 tem
= fold_call_expr (loc
, expr
, false);
12486 return tem
? tem
: expr
;
12491 if (IS_EXPR_CODE_CLASS (kind
))
12493 tree type
= TREE_TYPE (t
);
12494 tree op0
, op1
, op2
;
12496 switch (TREE_CODE_LENGTH (code
))
12499 op0
= TREE_OPERAND (t
, 0);
12500 tem
= fold_unary_loc (loc
, code
, type
, op0
);
12501 return tem
? tem
: expr
;
12503 op0
= TREE_OPERAND (t
, 0);
12504 op1
= TREE_OPERAND (t
, 1);
12505 tem
= fold_binary_loc (loc
, code
, type
, op0
, op1
);
12506 return tem
? tem
: expr
;
12508 op0
= TREE_OPERAND (t
, 0);
12509 op1
= TREE_OPERAND (t
, 1);
12510 op2
= TREE_OPERAND (t
, 2);
12511 tem
= fold_ternary_loc (loc
, code
, type
, op0
, op1
, op2
);
12512 return tem
? tem
: expr
;
12522 tree op0
= TREE_OPERAND (t
, 0);
12523 tree op1
= TREE_OPERAND (t
, 1);
12525 if (TREE_CODE (op1
) == INTEGER_CST
12526 && TREE_CODE (op0
) == CONSTRUCTOR
12527 && ! type_contains_placeholder_p (TREE_TYPE (op0
)))
12529 tree val
= get_array_ctor_element_at_index (op0
,
12530 wi::to_offset (op1
));
12538 /* Return a VECTOR_CST if possible. */
12541 tree type
= TREE_TYPE (t
);
12542 if (TREE_CODE (type
) != VECTOR_TYPE
)
12547 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (t
), i
, val
)
12548 if (! CONSTANT_CLASS_P (val
))
12551 return build_vector_from_ctor (type
, CONSTRUCTOR_ELTS (t
));
12555 return fold (DECL_INITIAL (t
));
12559 } /* switch (code) */
12562 #ifdef ENABLE_FOLD_CHECKING
12565 static void fold_checksum_tree (const_tree
, struct md5_ctx
*,
12566 hash_table
<nofree_ptr_hash
<const tree_node
> > *);
12567 static void fold_check_failed (const_tree
, const_tree
);
12568 void print_fold_checksum (const_tree
);
12570 /* When --enable-checking=fold, compute a digest of expr before
12571 and after actual fold call to see if fold did not accidentally
12572 change original expr. */
12578 struct md5_ctx ctx
;
12579 unsigned char checksum_before
[16], checksum_after
[16];
12580 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12582 md5_init_ctx (&ctx
);
12583 fold_checksum_tree (expr
, &ctx
, &ht
);
12584 md5_finish_ctx (&ctx
, checksum_before
);
12587 ret
= fold_1 (expr
);
12589 md5_init_ctx (&ctx
);
12590 fold_checksum_tree (expr
, &ctx
, &ht
);
12591 md5_finish_ctx (&ctx
, checksum_after
);
12593 if (memcmp (checksum_before
, checksum_after
, 16))
12594 fold_check_failed (expr
, ret
);
12600 print_fold_checksum (const_tree expr
)
12602 struct md5_ctx ctx
;
12603 unsigned char checksum
[16], cnt
;
12604 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12606 md5_init_ctx (&ctx
);
12607 fold_checksum_tree (expr
, &ctx
, &ht
);
12608 md5_finish_ctx (&ctx
, checksum
);
12609 for (cnt
= 0; cnt
< 16; ++cnt
)
12610 fprintf (stderr
, "%02x", checksum
[cnt
]);
12611 putc ('\n', stderr
);
12615 fold_check_failed (const_tree expr ATTRIBUTE_UNUSED
, const_tree ret ATTRIBUTE_UNUSED
)
12617 internal_error ("fold check: original tree changed by fold");
12621 fold_checksum_tree (const_tree expr
, struct md5_ctx
*ctx
,
12622 hash_table
<nofree_ptr_hash
<const tree_node
> > *ht
)
12624 const tree_node
**slot
;
12625 enum tree_code code
;
12626 union tree_node
*buf
;
12632 slot
= ht
->find_slot (expr
, INSERT
);
12636 code
= TREE_CODE (expr
);
12637 if (TREE_CODE_CLASS (code
) == tcc_declaration
12638 && HAS_DECL_ASSEMBLER_NAME_P (expr
))
12640 /* Allow DECL_ASSEMBLER_NAME and symtab_node to be modified. */
12641 size_t sz
= tree_size (expr
);
12642 buf
= XALLOCAVAR (union tree_node
, sz
);
12643 memcpy ((char *) buf
, expr
, sz
);
12644 SET_DECL_ASSEMBLER_NAME ((tree
) buf
, NULL
);
12645 buf
->decl_with_vis
.symtab_node
= NULL
;
12646 buf
->base
.nowarning_flag
= 0;
12649 else if (TREE_CODE_CLASS (code
) == tcc_type
12650 && (TYPE_POINTER_TO (expr
)
12651 || TYPE_REFERENCE_TO (expr
)
12652 || TYPE_CACHED_VALUES_P (expr
)
12653 || TYPE_CONTAINS_PLACEHOLDER_INTERNAL (expr
)
12654 || TYPE_NEXT_VARIANT (expr
)
12655 || TYPE_ALIAS_SET_KNOWN_P (expr
)))
12657 /* Allow these fields to be modified. */
12659 size_t sz
= tree_size (expr
);
12660 buf
= XALLOCAVAR (union tree_node
, sz
);
12661 memcpy ((char *) buf
, expr
, sz
);
12662 expr
= tmp
= (tree
) buf
;
12663 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (tmp
) = 0;
12664 TYPE_POINTER_TO (tmp
) = NULL
;
12665 TYPE_REFERENCE_TO (tmp
) = NULL
;
12666 TYPE_NEXT_VARIANT (tmp
) = NULL
;
12667 TYPE_ALIAS_SET (tmp
) = -1;
12668 if (TYPE_CACHED_VALUES_P (tmp
))
12670 TYPE_CACHED_VALUES_P (tmp
) = 0;
12671 TYPE_CACHED_VALUES (tmp
) = NULL
;
12674 else if (TREE_NO_WARNING (expr
) && (DECL_P (expr
) || EXPR_P (expr
)))
12676 /* Allow TREE_NO_WARNING to be set. Perhaps we shouldn't allow that
12677 and change builtins.c etc. instead - see PR89543. */
12678 size_t sz
= tree_size (expr
);
12679 buf
= XALLOCAVAR (union tree_node
, sz
);
12680 memcpy ((char *) buf
, expr
, sz
);
12681 buf
->base
.nowarning_flag
= 0;
12684 md5_process_bytes (expr
, tree_size (expr
), ctx
);
12685 if (CODE_CONTAINS_STRUCT (code
, TS_TYPED
))
12686 fold_checksum_tree (TREE_TYPE (expr
), ctx
, ht
);
12687 if (TREE_CODE_CLASS (code
) != tcc_type
12688 && TREE_CODE_CLASS (code
) != tcc_declaration
12689 && code
!= TREE_LIST
12690 && code
!= SSA_NAME
12691 && CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
12692 fold_checksum_tree (TREE_CHAIN (expr
), ctx
, ht
);
12693 switch (TREE_CODE_CLASS (code
))
12699 md5_process_bytes (TREE_STRING_POINTER (expr
),
12700 TREE_STRING_LENGTH (expr
), ctx
);
12703 fold_checksum_tree (TREE_REALPART (expr
), ctx
, ht
);
12704 fold_checksum_tree (TREE_IMAGPART (expr
), ctx
, ht
);
12707 len
= vector_cst_encoded_nelts (expr
);
12708 for (i
= 0; i
< len
; ++i
)
12709 fold_checksum_tree (VECTOR_CST_ENCODED_ELT (expr
, i
), ctx
, ht
);
12715 case tcc_exceptional
:
12719 fold_checksum_tree (TREE_PURPOSE (expr
), ctx
, ht
);
12720 fold_checksum_tree (TREE_VALUE (expr
), ctx
, ht
);
12721 expr
= TREE_CHAIN (expr
);
12722 goto recursive_label
;
12725 for (i
= 0; i
< TREE_VEC_LENGTH (expr
); ++i
)
12726 fold_checksum_tree (TREE_VEC_ELT (expr
, i
), ctx
, ht
);
12732 case tcc_expression
:
12733 case tcc_reference
:
12734 case tcc_comparison
:
12737 case tcc_statement
:
12739 len
= TREE_OPERAND_LENGTH (expr
);
12740 for (i
= 0; i
< len
; ++i
)
12741 fold_checksum_tree (TREE_OPERAND (expr
, i
), ctx
, ht
);
12743 case tcc_declaration
:
12744 fold_checksum_tree (DECL_NAME (expr
), ctx
, ht
);
12745 fold_checksum_tree (DECL_CONTEXT (expr
), ctx
, ht
);
12746 if (CODE_CONTAINS_STRUCT (TREE_CODE (expr
), TS_DECL_COMMON
))
12748 fold_checksum_tree (DECL_SIZE (expr
), ctx
, ht
);
12749 fold_checksum_tree (DECL_SIZE_UNIT (expr
), ctx
, ht
);
12750 fold_checksum_tree (DECL_INITIAL (expr
), ctx
, ht
);
12751 fold_checksum_tree (DECL_ABSTRACT_ORIGIN (expr
), ctx
, ht
);
12752 fold_checksum_tree (DECL_ATTRIBUTES (expr
), ctx
, ht
);
12755 if (CODE_CONTAINS_STRUCT (TREE_CODE (expr
), TS_DECL_NON_COMMON
))
12757 if (TREE_CODE (expr
) == FUNCTION_DECL
)
12759 fold_checksum_tree (DECL_VINDEX (expr
), ctx
, ht
);
12760 fold_checksum_tree (DECL_ARGUMENTS (expr
), ctx
, ht
);
12762 fold_checksum_tree (DECL_RESULT_FLD (expr
), ctx
, ht
);
12766 if (TREE_CODE (expr
) == ENUMERAL_TYPE
)
12767 fold_checksum_tree (TYPE_VALUES (expr
), ctx
, ht
);
12768 fold_checksum_tree (TYPE_SIZE (expr
), ctx
, ht
);
12769 fold_checksum_tree (TYPE_SIZE_UNIT (expr
), ctx
, ht
);
12770 fold_checksum_tree (TYPE_ATTRIBUTES (expr
), ctx
, ht
);
12771 fold_checksum_tree (TYPE_NAME (expr
), ctx
, ht
);
12772 if (INTEGRAL_TYPE_P (expr
)
12773 || SCALAR_FLOAT_TYPE_P (expr
))
12775 fold_checksum_tree (TYPE_MIN_VALUE (expr
), ctx
, ht
);
12776 fold_checksum_tree (TYPE_MAX_VALUE (expr
), ctx
, ht
);
12778 fold_checksum_tree (TYPE_MAIN_VARIANT (expr
), ctx
, ht
);
12779 if (TREE_CODE (expr
) == RECORD_TYPE
12780 || TREE_CODE (expr
) == UNION_TYPE
12781 || TREE_CODE (expr
) == QUAL_UNION_TYPE
)
12782 fold_checksum_tree (TYPE_BINFO (expr
), ctx
, ht
);
12783 fold_checksum_tree (TYPE_CONTEXT (expr
), ctx
, ht
);
12790 /* Helper function for outputting the checksum of a tree T. When
12791 debugging with gdb, you can "define mynext" to be "next" followed
12792 by "call debug_fold_checksum (op0)", then just trace down till the
12795 DEBUG_FUNCTION
void
12796 debug_fold_checksum (const_tree t
)
12799 unsigned char checksum
[16];
12800 struct md5_ctx ctx
;
12801 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12803 md5_init_ctx (&ctx
);
12804 fold_checksum_tree (t
, &ctx
, &ht
);
12805 md5_finish_ctx (&ctx
, checksum
);
12808 for (i
= 0; i
< 16; i
++)
12809 fprintf (stderr
, "%d ", checksum
[i
]);
12811 fprintf (stderr
, "\n");
12816 /* Fold a unary tree expression with code CODE of type TYPE with an
12817 operand OP0. LOC is the location of the resulting expression.
12818 Return a folded expression if successful. Otherwise, return a tree
12819 expression with code CODE of type TYPE with an operand OP0. */
12822 fold_build1_loc (location_t loc
,
12823 enum tree_code code
, tree type
, tree op0 MEM_STAT_DECL
)
12826 #ifdef ENABLE_FOLD_CHECKING
12827 unsigned char checksum_before
[16], checksum_after
[16];
12828 struct md5_ctx ctx
;
12829 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12831 md5_init_ctx (&ctx
);
12832 fold_checksum_tree (op0
, &ctx
, &ht
);
12833 md5_finish_ctx (&ctx
, checksum_before
);
12837 tem
= fold_unary_loc (loc
, code
, type
, op0
);
12839 tem
= build1_loc (loc
, code
, type
, op0 PASS_MEM_STAT
);
12841 #ifdef ENABLE_FOLD_CHECKING
12842 md5_init_ctx (&ctx
);
12843 fold_checksum_tree (op0
, &ctx
, &ht
);
12844 md5_finish_ctx (&ctx
, checksum_after
);
12846 if (memcmp (checksum_before
, checksum_after
, 16))
12847 fold_check_failed (op0
, tem
);
12852 /* Fold a binary tree expression with code CODE of type TYPE with
12853 operands OP0 and OP1. LOC is the location of the resulting
12854 expression. Return a folded expression if successful. Otherwise,
12855 return a tree expression with code CODE of type TYPE with operands
12859 fold_build2_loc (location_t loc
,
12860 enum tree_code code
, tree type
, tree op0
, tree op1
12864 #ifdef ENABLE_FOLD_CHECKING
12865 unsigned char checksum_before_op0
[16],
12866 checksum_before_op1
[16],
12867 checksum_after_op0
[16],
12868 checksum_after_op1
[16];
12869 struct md5_ctx ctx
;
12870 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12872 md5_init_ctx (&ctx
);
12873 fold_checksum_tree (op0
, &ctx
, &ht
);
12874 md5_finish_ctx (&ctx
, checksum_before_op0
);
12877 md5_init_ctx (&ctx
);
12878 fold_checksum_tree (op1
, &ctx
, &ht
);
12879 md5_finish_ctx (&ctx
, checksum_before_op1
);
12883 tem
= fold_binary_loc (loc
, code
, type
, op0
, op1
);
12885 tem
= build2_loc (loc
, code
, type
, op0
, op1 PASS_MEM_STAT
);
12887 #ifdef ENABLE_FOLD_CHECKING
12888 md5_init_ctx (&ctx
);
12889 fold_checksum_tree (op0
, &ctx
, &ht
);
12890 md5_finish_ctx (&ctx
, checksum_after_op0
);
12893 if (memcmp (checksum_before_op0
, checksum_after_op0
, 16))
12894 fold_check_failed (op0
, tem
);
12896 md5_init_ctx (&ctx
);
12897 fold_checksum_tree (op1
, &ctx
, &ht
);
12898 md5_finish_ctx (&ctx
, checksum_after_op1
);
12900 if (memcmp (checksum_before_op1
, checksum_after_op1
, 16))
12901 fold_check_failed (op1
, tem
);
12906 /* Fold a ternary tree expression with code CODE of type TYPE with
12907 operands OP0, OP1, and OP2. Return a folded expression if
12908 successful. Otherwise, return a tree expression with code CODE of
12909 type TYPE with operands OP0, OP1, and OP2. */
12912 fold_build3_loc (location_t loc
, enum tree_code code
, tree type
,
12913 tree op0
, tree op1
, tree op2 MEM_STAT_DECL
)
12916 #ifdef ENABLE_FOLD_CHECKING
12917 unsigned char checksum_before_op0
[16],
12918 checksum_before_op1
[16],
12919 checksum_before_op2
[16],
12920 checksum_after_op0
[16],
12921 checksum_after_op1
[16],
12922 checksum_after_op2
[16];
12923 struct md5_ctx ctx
;
12924 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12926 md5_init_ctx (&ctx
);
12927 fold_checksum_tree (op0
, &ctx
, &ht
);
12928 md5_finish_ctx (&ctx
, checksum_before_op0
);
12931 md5_init_ctx (&ctx
);
12932 fold_checksum_tree (op1
, &ctx
, &ht
);
12933 md5_finish_ctx (&ctx
, checksum_before_op1
);
12936 md5_init_ctx (&ctx
);
12937 fold_checksum_tree (op2
, &ctx
, &ht
);
12938 md5_finish_ctx (&ctx
, checksum_before_op2
);
12942 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
12943 tem
= fold_ternary_loc (loc
, code
, type
, op0
, op1
, op2
);
12945 tem
= build3_loc (loc
, code
, type
, op0
, op1
, op2 PASS_MEM_STAT
);
12947 #ifdef ENABLE_FOLD_CHECKING
12948 md5_init_ctx (&ctx
);
12949 fold_checksum_tree (op0
, &ctx
, &ht
);
12950 md5_finish_ctx (&ctx
, checksum_after_op0
);
12953 if (memcmp (checksum_before_op0
, checksum_after_op0
, 16))
12954 fold_check_failed (op0
, tem
);
12956 md5_init_ctx (&ctx
);
12957 fold_checksum_tree (op1
, &ctx
, &ht
);
12958 md5_finish_ctx (&ctx
, checksum_after_op1
);
12961 if (memcmp (checksum_before_op1
, checksum_after_op1
, 16))
12962 fold_check_failed (op1
, tem
);
12964 md5_init_ctx (&ctx
);
12965 fold_checksum_tree (op2
, &ctx
, &ht
);
12966 md5_finish_ctx (&ctx
, checksum_after_op2
);
12968 if (memcmp (checksum_before_op2
, checksum_after_op2
, 16))
12969 fold_check_failed (op2
, tem
);
12974 /* Fold a CALL_EXPR expression of type TYPE with operands FN and NARGS
12975 arguments in ARGARRAY, and a null static chain.
12976 Return a folded expression if successful. Otherwise, return a CALL_EXPR
12977 of type TYPE from the given operands as constructed by build_call_array. */
12980 fold_build_call_array_loc (location_t loc
, tree type
, tree fn
,
12981 int nargs
, tree
*argarray
)
12984 #ifdef ENABLE_FOLD_CHECKING
12985 unsigned char checksum_before_fn
[16],
12986 checksum_before_arglist
[16],
12987 checksum_after_fn
[16],
12988 checksum_after_arglist
[16];
12989 struct md5_ctx ctx
;
12990 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12993 md5_init_ctx (&ctx
);
12994 fold_checksum_tree (fn
, &ctx
, &ht
);
12995 md5_finish_ctx (&ctx
, checksum_before_fn
);
12998 md5_init_ctx (&ctx
);
12999 for (i
= 0; i
< nargs
; i
++)
13000 fold_checksum_tree (argarray
[i
], &ctx
, &ht
);
13001 md5_finish_ctx (&ctx
, checksum_before_arglist
);
13005 tem
= fold_builtin_call_array (loc
, type
, fn
, nargs
, argarray
);
13007 tem
= build_call_array_loc (loc
, type
, fn
, nargs
, argarray
);
13009 #ifdef ENABLE_FOLD_CHECKING
13010 md5_init_ctx (&ctx
);
13011 fold_checksum_tree (fn
, &ctx
, &ht
);
13012 md5_finish_ctx (&ctx
, checksum_after_fn
);
13015 if (memcmp (checksum_before_fn
, checksum_after_fn
, 16))
13016 fold_check_failed (fn
, tem
);
13018 md5_init_ctx (&ctx
);
13019 for (i
= 0; i
< nargs
; i
++)
13020 fold_checksum_tree (argarray
[i
], &ctx
, &ht
);
13021 md5_finish_ctx (&ctx
, checksum_after_arglist
);
13023 if (memcmp (checksum_before_arglist
, checksum_after_arglist
, 16))
13024 fold_check_failed (NULL_TREE
, tem
);
13029 /* Perform constant folding and related simplification of initializer
13030 expression EXPR. These behave identically to "fold_buildN" but ignore
13031 potential run-time traps and exceptions that fold must preserve. */
13033 #define START_FOLD_INIT \
13034 int saved_signaling_nans = flag_signaling_nans;\
13035 int saved_trapping_math = flag_trapping_math;\
13036 int saved_rounding_math = flag_rounding_math;\
13037 int saved_trapv = flag_trapv;\
13038 int saved_folding_initializer = folding_initializer;\
13039 flag_signaling_nans = 0;\
13040 flag_trapping_math = 0;\
13041 flag_rounding_math = 0;\
13043 folding_initializer = 1;
13045 #define END_FOLD_INIT \
13046 flag_signaling_nans = saved_signaling_nans;\
13047 flag_trapping_math = saved_trapping_math;\
13048 flag_rounding_math = saved_rounding_math;\
13049 flag_trapv = saved_trapv;\
13050 folding_initializer = saved_folding_initializer;
13053 fold_build1_initializer_loc (location_t loc
, enum tree_code code
,
13054 tree type
, tree op
)
13059 result
= fold_build1_loc (loc
, code
, type
, op
);
13066 fold_build2_initializer_loc (location_t loc
, enum tree_code code
,
13067 tree type
, tree op0
, tree op1
)
13072 result
= fold_build2_loc (loc
, code
, type
, op0
, op1
);
13079 fold_build_call_array_initializer_loc (location_t loc
, tree type
, tree fn
,
13080 int nargs
, tree
*argarray
)
13085 result
= fold_build_call_array_loc (loc
, type
, fn
, nargs
, argarray
);
13091 #undef START_FOLD_INIT
13092 #undef END_FOLD_INIT
13094 /* Determine if first argument is a multiple of second argument. Return 0 if
13095 it is not, or we cannot easily determined it to be.
13097 An example of the sort of thing we care about (at this point; this routine
13098 could surely be made more general, and expanded to do what the *_DIV_EXPR's
13099 fold cases do now) is discovering that
13101 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
13107 when we know that the two SAVE_EXPR (J * 8) nodes are the same node.
13109 This code also handles discovering that
13111 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
13113 is a multiple of 8 so we don't have to worry about dealing with a
13114 possible remainder.
13116 Note that we *look* inside a SAVE_EXPR only to determine how it was
13117 calculated; it is not safe for fold to do much of anything else with the
13118 internals of a SAVE_EXPR, since it cannot know when it will be evaluated
13119 at run time. For example, the latter example above *cannot* be implemented
13120 as SAVE_EXPR (I) * J or any variant thereof, since the value of J at
13121 evaluation time of the original SAVE_EXPR is not necessarily the same at
13122 the time the new expression is evaluated. The only optimization of this
13123 sort that would be valid is changing
13125 SAVE_EXPR (I) * SAVE_EXPR (SAVE_EXPR (J) * 8)
13129 SAVE_EXPR (I) * SAVE_EXPR (J)
13131 (where the same SAVE_EXPR (J) is used in the original and the
13132 transformed version). */
13135 multiple_of_p (tree type
, const_tree top
, const_tree bottom
)
13140 if (operand_equal_p (top
, bottom
, 0))
13143 if (TREE_CODE (type
) != INTEGER_TYPE
)
13146 switch (TREE_CODE (top
))
13149 /* Bitwise and provides a power of two multiple. If the mask is
13150 a multiple of BOTTOM then TOP is a multiple of BOTTOM. */
13151 if (!integer_pow2p (bottom
))
13153 return (multiple_of_p (type
, TREE_OPERAND (top
, 1), bottom
)
13154 || multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
));
13157 if (TREE_CODE (bottom
) == INTEGER_CST
)
13159 op1
= TREE_OPERAND (top
, 0);
13160 op2
= TREE_OPERAND (top
, 1);
13161 if (TREE_CODE (op1
) == INTEGER_CST
)
13162 std::swap (op1
, op2
);
13163 if (TREE_CODE (op2
) == INTEGER_CST
)
13165 if (multiple_of_p (type
, op2
, bottom
))
13167 /* Handle multiple_of_p ((x * 2 + 2) * 4, 8). */
13168 if (multiple_of_p (type
, bottom
, op2
))
13170 widest_int w
= wi::sdiv_trunc (wi::to_widest (bottom
),
13171 wi::to_widest (op2
));
13172 if (wi::fits_to_tree_p (w
, TREE_TYPE (bottom
)))
13174 op2
= wide_int_to_tree (TREE_TYPE (bottom
), w
);
13175 return multiple_of_p (type
, op1
, op2
);
13178 return multiple_of_p (type
, op1
, bottom
);
13181 return (multiple_of_p (type
, TREE_OPERAND (top
, 1), bottom
)
13182 || multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
));
13185 /* It is impossible to prove if op0 - op1 is multiple of bottom
13186 precisely, so be conservative here checking if both op0 and op1
13187 are multiple of bottom. Note we check the second operand first
13188 since it's usually simpler. */
13189 return (multiple_of_p (type
, TREE_OPERAND (top
, 1), bottom
)
13190 && multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
));
13193 /* The same as MINUS_EXPR, but handle cases like op0 + 0xfffffffd
13194 as op0 - 3 if the expression has unsigned type. For example,
13195 (X / 3) + 0xfffffffd is multiple of 3, but 0xfffffffd is not. */
13196 op1
= TREE_OPERAND (top
, 1);
13197 if (TYPE_UNSIGNED (type
)
13198 && TREE_CODE (op1
) == INTEGER_CST
&& tree_int_cst_sign_bit (op1
))
13199 op1
= fold_build1 (NEGATE_EXPR
, type
, op1
);
13200 return (multiple_of_p (type
, op1
, bottom
)
13201 && multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
));
13204 if (TREE_CODE (TREE_OPERAND (top
, 1)) == INTEGER_CST
)
13206 op1
= TREE_OPERAND (top
, 1);
13207 /* const_binop may not detect overflow correctly,
13208 so check for it explicitly here. */
13209 if (wi::gtu_p (TYPE_PRECISION (TREE_TYPE (size_one_node
)),
13211 && (t1
= fold_convert (type
,
13212 const_binop (LSHIFT_EXPR
, size_one_node
,
13214 && !TREE_OVERFLOW (t1
))
13215 return multiple_of_p (type
, t1
, bottom
);
13220 /* Can't handle conversions from non-integral or wider integral type. */
13221 if ((TREE_CODE (TREE_TYPE (TREE_OPERAND (top
, 0))) != INTEGER_TYPE
)
13222 || (TYPE_PRECISION (type
)
13223 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (top
, 0)))))
13229 return multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
);
13232 return (multiple_of_p (type
, TREE_OPERAND (top
, 1), bottom
)
13233 && multiple_of_p (type
, TREE_OPERAND (top
, 2), bottom
));
13236 if (TREE_CODE (bottom
) != INTEGER_CST
13237 || integer_zerop (bottom
)
13238 || (TYPE_UNSIGNED (type
)
13239 && (tree_int_cst_sgn (top
) < 0
13240 || tree_int_cst_sgn (bottom
) < 0)))
13242 return wi::multiple_of_p (wi::to_widest (top
), wi::to_widest (bottom
),
13246 if (TREE_CODE (bottom
) == INTEGER_CST
13247 && (stmt
= SSA_NAME_DEF_STMT (top
)) != NULL
13248 && gimple_code (stmt
) == GIMPLE_ASSIGN
)
13250 enum tree_code code
= gimple_assign_rhs_code (stmt
);
13252 /* Check for special cases to see if top is defined as multiple
13255 top = (X & ~(bottom - 1) ; bottom is power of 2
13261 if (code
== BIT_AND_EXPR
13262 && (op2
= gimple_assign_rhs2 (stmt
)) != NULL_TREE
13263 && TREE_CODE (op2
) == INTEGER_CST
13264 && integer_pow2p (bottom
)
13265 && wi::multiple_of_p (wi::to_widest (op2
),
13266 wi::to_widest (bottom
), UNSIGNED
))
13269 op1
= gimple_assign_rhs1 (stmt
);
13270 if (code
== MINUS_EXPR
13271 && (op2
= gimple_assign_rhs2 (stmt
)) != NULL_TREE
13272 && TREE_CODE (op2
) == SSA_NAME
13273 && (stmt
= SSA_NAME_DEF_STMT (op2
)) != NULL
13274 && gimple_code (stmt
) == GIMPLE_ASSIGN
13275 && (code
= gimple_assign_rhs_code (stmt
)) == TRUNC_MOD_EXPR
13276 && operand_equal_p (op1
, gimple_assign_rhs1 (stmt
), 0)
13277 && operand_equal_p (bottom
, gimple_assign_rhs2 (stmt
), 0))
13284 if (POLY_INT_CST_P (top
) && poly_int_tree_p (bottom
))
13285 return multiple_p (wi::to_poly_widest (top
),
13286 wi::to_poly_widest (bottom
));
13292 #define tree_expr_nonnegative_warnv_p(X, Y) \
13293 _Pragma ("GCC error \"Use RECURSE for recursive calls\"") 0
13295 #define RECURSE(X) \
13296 ((tree_expr_nonnegative_warnv_p) (X, strict_overflow_p, depth + 1))
13298 /* Return true if CODE or TYPE is known to be non-negative. */
13301 tree_simple_nonnegative_warnv_p (enum tree_code code
, tree type
)
13303 if ((TYPE_PRECISION (type
) != 1 || TYPE_UNSIGNED (type
))
13304 && truth_value_p (code
))
13305 /* Truth values evaluate to 0 or 1, which is nonnegative unless we
13306 have a signed:1 type (where the value is -1 and 0). */
13311 /* Return true if (CODE OP0) is known to be non-negative. If the return
13312 value is based on the assumption that signed overflow is undefined,
13313 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13314 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13317 tree_unary_nonnegative_warnv_p (enum tree_code code
, tree type
, tree op0
,
13318 bool *strict_overflow_p
, int depth
)
13320 if (TYPE_UNSIGNED (type
))
13326 /* We can't return 1 if flag_wrapv is set because
13327 ABS_EXPR<INT_MIN> = INT_MIN. */
13328 if (!ANY_INTEGRAL_TYPE_P (type
))
13330 if (TYPE_OVERFLOW_UNDEFINED (type
))
13332 *strict_overflow_p
= true;
13337 case NON_LVALUE_EXPR
:
13339 case FIX_TRUNC_EXPR
:
13340 return RECURSE (op0
);
13344 tree inner_type
= TREE_TYPE (op0
);
13345 tree outer_type
= type
;
13347 if (TREE_CODE (outer_type
) == REAL_TYPE
)
13349 if (TREE_CODE (inner_type
) == REAL_TYPE
)
13350 return RECURSE (op0
);
13351 if (INTEGRAL_TYPE_P (inner_type
))
13353 if (TYPE_UNSIGNED (inner_type
))
13355 return RECURSE (op0
);
13358 else if (INTEGRAL_TYPE_P (outer_type
))
13360 if (TREE_CODE (inner_type
) == REAL_TYPE
)
13361 return RECURSE (op0
);
13362 if (INTEGRAL_TYPE_P (inner_type
))
13363 return TYPE_PRECISION (inner_type
) < TYPE_PRECISION (outer_type
)
13364 && TYPE_UNSIGNED (inner_type
);
13370 return tree_simple_nonnegative_warnv_p (code
, type
);
13373 /* We don't know sign of `t', so be conservative and return false. */
13377 /* Return true if (CODE OP0 OP1) is known to be non-negative. If the return
13378 value is based on the assumption that signed overflow is undefined,
13379 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13380 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13383 tree_binary_nonnegative_warnv_p (enum tree_code code
, tree type
, tree op0
,
13384 tree op1
, bool *strict_overflow_p
,
13387 if (TYPE_UNSIGNED (type
))
13392 case POINTER_PLUS_EXPR
:
13394 if (FLOAT_TYPE_P (type
))
13395 return RECURSE (op0
) && RECURSE (op1
);
13397 /* zero_extend(x) + zero_extend(y) is non-negative if x and y are
13398 both unsigned and at least 2 bits shorter than the result. */
13399 if (TREE_CODE (type
) == INTEGER_TYPE
13400 && TREE_CODE (op0
) == NOP_EXPR
13401 && TREE_CODE (op1
) == NOP_EXPR
)
13403 tree inner1
= TREE_TYPE (TREE_OPERAND (op0
, 0));
13404 tree inner2
= TREE_TYPE (TREE_OPERAND (op1
, 0));
13405 if (TREE_CODE (inner1
) == INTEGER_TYPE
&& TYPE_UNSIGNED (inner1
)
13406 && TREE_CODE (inner2
) == INTEGER_TYPE
&& TYPE_UNSIGNED (inner2
))
13408 unsigned int prec
= MAX (TYPE_PRECISION (inner1
),
13409 TYPE_PRECISION (inner2
)) + 1;
13410 return prec
< TYPE_PRECISION (type
);
13416 if (FLOAT_TYPE_P (type
) || TYPE_OVERFLOW_UNDEFINED (type
))
13418 /* x * x is always non-negative for floating point x
13419 or without overflow. */
13420 if (operand_equal_p (op0
, op1
, 0)
13421 || (RECURSE (op0
) && RECURSE (op1
)))
13423 if (ANY_INTEGRAL_TYPE_P (type
)
13424 && TYPE_OVERFLOW_UNDEFINED (type
))
13425 *strict_overflow_p
= true;
13430 /* zero_extend(x) * zero_extend(y) is non-negative if x and y are
13431 both unsigned and their total bits is shorter than the result. */
13432 if (TREE_CODE (type
) == INTEGER_TYPE
13433 && (TREE_CODE (op0
) == NOP_EXPR
|| TREE_CODE (op0
) == INTEGER_CST
)
13434 && (TREE_CODE (op1
) == NOP_EXPR
|| TREE_CODE (op1
) == INTEGER_CST
))
13436 tree inner0
= (TREE_CODE (op0
) == NOP_EXPR
)
13437 ? TREE_TYPE (TREE_OPERAND (op0
, 0))
13439 tree inner1
= (TREE_CODE (op1
) == NOP_EXPR
)
13440 ? TREE_TYPE (TREE_OPERAND (op1
, 0))
13443 bool unsigned0
= TYPE_UNSIGNED (inner0
);
13444 bool unsigned1
= TYPE_UNSIGNED (inner1
);
13446 if (TREE_CODE (op0
) == INTEGER_CST
)
13447 unsigned0
= unsigned0
|| tree_int_cst_sgn (op0
) >= 0;
13449 if (TREE_CODE (op1
) == INTEGER_CST
)
13450 unsigned1
= unsigned1
|| tree_int_cst_sgn (op1
) >= 0;
13452 if (TREE_CODE (inner0
) == INTEGER_TYPE
&& unsigned0
13453 && TREE_CODE (inner1
) == INTEGER_TYPE
&& unsigned1
)
13455 unsigned int precision0
= (TREE_CODE (op0
) == INTEGER_CST
)
13456 ? tree_int_cst_min_precision (op0
, UNSIGNED
)
13457 : TYPE_PRECISION (inner0
);
13459 unsigned int precision1
= (TREE_CODE (op1
) == INTEGER_CST
)
13460 ? tree_int_cst_min_precision (op1
, UNSIGNED
)
13461 : TYPE_PRECISION (inner1
);
13463 return precision0
+ precision1
< TYPE_PRECISION (type
);
13470 return RECURSE (op0
) || RECURSE (op1
);
13476 case TRUNC_DIV_EXPR
:
13477 case CEIL_DIV_EXPR
:
13478 case FLOOR_DIV_EXPR
:
13479 case ROUND_DIV_EXPR
:
13480 return RECURSE (op0
) && RECURSE (op1
);
13482 case TRUNC_MOD_EXPR
:
13483 return RECURSE (op0
);
13485 case FLOOR_MOD_EXPR
:
13486 return RECURSE (op1
);
13488 case CEIL_MOD_EXPR
:
13489 case ROUND_MOD_EXPR
:
13491 return tree_simple_nonnegative_warnv_p (code
, type
);
13494 /* We don't know sign of `t', so be conservative and return false. */
13498 /* Return true if T is known to be non-negative. If the return
13499 value is based on the assumption that signed overflow is undefined,
13500 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13501 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13504 tree_single_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
, int depth
)
13506 if (TYPE_UNSIGNED (TREE_TYPE (t
)))
13509 switch (TREE_CODE (t
))
13512 return tree_int_cst_sgn (t
) >= 0;
13515 return ! REAL_VALUE_NEGATIVE (TREE_REAL_CST (t
));
13518 return ! FIXED_VALUE_NEGATIVE (TREE_FIXED_CST (t
));
13521 return RECURSE (TREE_OPERAND (t
, 1)) && RECURSE (TREE_OPERAND (t
, 2));
13524 /* Limit the depth of recursion to avoid quadratic behavior.
13525 This is expected to catch almost all occurrences in practice.
13526 If this code misses important cases that unbounded recursion
13527 would not, passes that need this information could be revised
13528 to provide it through dataflow propagation. */
13529 return (!name_registered_for_update_p (t
)
13530 && depth
< param_max_ssa_name_query_depth
13531 && gimple_stmt_nonnegative_warnv_p (SSA_NAME_DEF_STMT (t
),
13532 strict_overflow_p
, depth
));
13535 return tree_simple_nonnegative_warnv_p (TREE_CODE (t
), TREE_TYPE (t
));
13539 /* Return true if T is known to be non-negative. If the return
13540 value is based on the assumption that signed overflow is undefined,
13541 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13542 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13545 tree_call_nonnegative_warnv_p (tree type
, combined_fn fn
, tree arg0
, tree arg1
,
13546 bool *strict_overflow_p
, int depth
)
13567 case CFN_BUILT_IN_BSWAP32
:
13568 case CFN_BUILT_IN_BSWAP64
:
13574 /* sqrt(-0.0) is -0.0. */
13575 if (!HONOR_SIGNED_ZEROS (element_mode (type
)))
13577 return RECURSE (arg0
);
13605 CASE_CFN_NEARBYINT
:
13606 CASE_CFN_NEARBYINT_FN
:
13611 CASE_CFN_ROUNDEVEN
:
13612 CASE_CFN_ROUNDEVEN_FN
:
13617 CASE_CFN_SIGNIFICAND
:
13622 /* True if the 1st argument is nonnegative. */
13623 return RECURSE (arg0
);
13627 /* True if the 1st OR 2nd arguments are nonnegative. */
13628 return RECURSE (arg0
) || RECURSE (arg1
);
13632 /* True if the 1st AND 2nd arguments are nonnegative. */
13633 return RECURSE (arg0
) && RECURSE (arg1
);
13636 CASE_CFN_COPYSIGN_FN
:
13637 /* True if the 2nd argument is nonnegative. */
13638 return RECURSE (arg1
);
13641 /* True if the 1st argument is nonnegative or the second
13642 argument is an even integer. */
13643 if (TREE_CODE (arg1
) == INTEGER_CST
13644 && (TREE_INT_CST_LOW (arg1
) & 1) == 0)
13646 return RECURSE (arg0
);
13649 /* True if the 1st argument is nonnegative or the second
13650 argument is an even integer valued real. */
13651 if (TREE_CODE (arg1
) == REAL_CST
)
13656 c
= TREE_REAL_CST (arg1
);
13657 n
= real_to_integer (&c
);
13660 REAL_VALUE_TYPE cint
;
13661 real_from_integer (&cint
, VOIDmode
, n
, SIGNED
);
13662 if (real_identical (&c
, &cint
))
13666 return RECURSE (arg0
);
13671 return tree_simple_nonnegative_warnv_p (CALL_EXPR
, type
);
13674 /* Return true if T is known to be non-negative. If the return
13675 value is based on the assumption that signed overflow is undefined,
13676 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13677 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13680 tree_invalid_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
, int depth
)
13682 enum tree_code code
= TREE_CODE (t
);
13683 if (TYPE_UNSIGNED (TREE_TYPE (t
)))
13690 tree temp
= TARGET_EXPR_SLOT (t
);
13691 t
= TARGET_EXPR_INITIAL (t
);
13693 /* If the initializer is non-void, then it's a normal expression
13694 that will be assigned to the slot. */
13695 if (!VOID_TYPE_P (t
))
13696 return RECURSE (t
);
13698 /* Otherwise, the initializer sets the slot in some way. One common
13699 way is an assignment statement at the end of the initializer. */
13702 if (TREE_CODE (t
) == BIND_EXPR
)
13703 t
= expr_last (BIND_EXPR_BODY (t
));
13704 else if (TREE_CODE (t
) == TRY_FINALLY_EXPR
13705 || TREE_CODE (t
) == TRY_CATCH_EXPR
)
13706 t
= expr_last (TREE_OPERAND (t
, 0));
13707 else if (TREE_CODE (t
) == STATEMENT_LIST
)
13712 if (TREE_CODE (t
) == MODIFY_EXPR
13713 && TREE_OPERAND (t
, 0) == temp
)
13714 return RECURSE (TREE_OPERAND (t
, 1));
13721 tree arg0
= call_expr_nargs (t
) > 0 ? CALL_EXPR_ARG (t
, 0) : NULL_TREE
;
13722 tree arg1
= call_expr_nargs (t
) > 1 ? CALL_EXPR_ARG (t
, 1) : NULL_TREE
;
13724 return tree_call_nonnegative_warnv_p (TREE_TYPE (t
),
13725 get_call_combined_fn (t
),
13728 strict_overflow_p
, depth
);
13730 case COMPOUND_EXPR
:
13732 return RECURSE (TREE_OPERAND (t
, 1));
13735 return RECURSE (expr_last (TREE_OPERAND (t
, 1)));
13738 return RECURSE (TREE_OPERAND (t
, 0));
13741 return tree_simple_nonnegative_warnv_p (TREE_CODE (t
), TREE_TYPE (t
));
13746 #undef tree_expr_nonnegative_warnv_p
13748 /* Return true if T is known to be non-negative. If the return
13749 value is based on the assumption that signed overflow is undefined,
13750 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13751 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13754 tree_expr_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
, int depth
)
13756 enum tree_code code
;
13757 if (t
== error_mark_node
)
13760 code
= TREE_CODE (t
);
13761 switch (TREE_CODE_CLASS (code
))
13764 case tcc_comparison
:
13765 return tree_binary_nonnegative_warnv_p (TREE_CODE (t
),
13767 TREE_OPERAND (t
, 0),
13768 TREE_OPERAND (t
, 1),
13769 strict_overflow_p
, depth
);
13772 return tree_unary_nonnegative_warnv_p (TREE_CODE (t
),
13774 TREE_OPERAND (t
, 0),
13775 strict_overflow_p
, depth
);
13778 case tcc_declaration
:
13779 case tcc_reference
:
13780 return tree_single_nonnegative_warnv_p (t
, strict_overflow_p
, depth
);
13788 case TRUTH_AND_EXPR
:
13789 case TRUTH_OR_EXPR
:
13790 case TRUTH_XOR_EXPR
:
13791 return tree_binary_nonnegative_warnv_p (TREE_CODE (t
),
13793 TREE_OPERAND (t
, 0),
13794 TREE_OPERAND (t
, 1),
13795 strict_overflow_p
, depth
);
13796 case TRUTH_NOT_EXPR
:
13797 return tree_unary_nonnegative_warnv_p (TREE_CODE (t
),
13799 TREE_OPERAND (t
, 0),
13800 strict_overflow_p
, depth
);
13807 case WITH_SIZE_EXPR
:
13809 return tree_single_nonnegative_warnv_p (t
, strict_overflow_p
, depth
);
13812 return tree_invalid_nonnegative_warnv_p (t
, strict_overflow_p
, depth
);
13816 /* Return true if `t' is known to be non-negative. Handle warnings
13817 about undefined signed overflow. */
13820 tree_expr_nonnegative_p (tree t
)
13822 bool ret
, strict_overflow_p
;
13824 strict_overflow_p
= false;
13825 ret
= tree_expr_nonnegative_warnv_p (t
, &strict_overflow_p
);
13826 if (strict_overflow_p
)
13827 fold_overflow_warning (("assuming signed overflow does not occur when "
13828 "determining that expression is always "
13830 WARN_STRICT_OVERFLOW_MISC
);
13835 /* Return true when (CODE OP0) is an address and is known to be nonzero.
13836 For floating point we further ensure that T is not denormal.
13837 Similar logic is present in nonzero_address in rtlanal.h.
13839 If the return value is based on the assumption that signed overflow
13840 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13841 change *STRICT_OVERFLOW_P. */
13844 tree_unary_nonzero_warnv_p (enum tree_code code
, tree type
, tree op0
,
13845 bool *strict_overflow_p
)
13850 return tree_expr_nonzero_warnv_p (op0
,
13851 strict_overflow_p
);
13855 tree inner_type
= TREE_TYPE (op0
);
13856 tree outer_type
= type
;
13858 return (TYPE_PRECISION (outer_type
) >= TYPE_PRECISION (inner_type
)
13859 && tree_expr_nonzero_warnv_p (op0
,
13860 strict_overflow_p
));
13864 case NON_LVALUE_EXPR
:
13865 return tree_expr_nonzero_warnv_p (op0
,
13866 strict_overflow_p
);
13875 /* Return true when (CODE OP0 OP1) is an address and is known to be nonzero.
13876 For floating point we further ensure that T is not denormal.
13877 Similar logic is present in nonzero_address in rtlanal.h.
13879 If the return value is based on the assumption that signed overflow
13880 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13881 change *STRICT_OVERFLOW_P. */
13884 tree_binary_nonzero_warnv_p (enum tree_code code
,
13887 tree op1
, bool *strict_overflow_p
)
13889 bool sub_strict_overflow_p
;
13892 case POINTER_PLUS_EXPR
:
13894 if (ANY_INTEGRAL_TYPE_P (type
) && TYPE_OVERFLOW_UNDEFINED (type
))
13896 /* With the presence of negative values it is hard
13897 to say something. */
13898 sub_strict_overflow_p
= false;
13899 if (!tree_expr_nonnegative_warnv_p (op0
,
13900 &sub_strict_overflow_p
)
13901 || !tree_expr_nonnegative_warnv_p (op1
,
13902 &sub_strict_overflow_p
))
13904 /* One of operands must be positive and the other non-negative. */
13905 /* We don't set *STRICT_OVERFLOW_P here: even if this value
13906 overflows, on a twos-complement machine the sum of two
13907 nonnegative numbers can never be zero. */
13908 return (tree_expr_nonzero_warnv_p (op0
,
13910 || tree_expr_nonzero_warnv_p (op1
,
13911 strict_overflow_p
));
13916 if (TYPE_OVERFLOW_UNDEFINED (type
))
13918 if (tree_expr_nonzero_warnv_p (op0
,
13920 && tree_expr_nonzero_warnv_p (op1
,
13921 strict_overflow_p
))
13923 *strict_overflow_p
= true;
13930 sub_strict_overflow_p
= false;
13931 if (tree_expr_nonzero_warnv_p (op0
,
13932 &sub_strict_overflow_p
)
13933 && tree_expr_nonzero_warnv_p (op1
,
13934 &sub_strict_overflow_p
))
13936 if (sub_strict_overflow_p
)
13937 *strict_overflow_p
= true;
13942 sub_strict_overflow_p
= false;
13943 if (tree_expr_nonzero_warnv_p (op0
,
13944 &sub_strict_overflow_p
))
13946 if (sub_strict_overflow_p
)
13947 *strict_overflow_p
= true;
13949 /* When both operands are nonzero, then MAX must be too. */
13950 if (tree_expr_nonzero_warnv_p (op1
,
13951 strict_overflow_p
))
13954 /* MAX where operand 0 is positive is positive. */
13955 return tree_expr_nonnegative_warnv_p (op0
,
13956 strict_overflow_p
);
13958 /* MAX where operand 1 is positive is positive. */
13959 else if (tree_expr_nonzero_warnv_p (op1
,
13960 &sub_strict_overflow_p
)
13961 && tree_expr_nonnegative_warnv_p (op1
,
13962 &sub_strict_overflow_p
))
13964 if (sub_strict_overflow_p
)
13965 *strict_overflow_p
= true;
13971 return (tree_expr_nonzero_warnv_p (op1
,
13973 || tree_expr_nonzero_warnv_p (op0
,
13974 strict_overflow_p
));
13983 /* Return true when T is an address and is known to be nonzero.
13984 For floating point we further ensure that T is not denormal.
13985 Similar logic is present in nonzero_address in rtlanal.h.
13987 If the return value is based on the assumption that signed overflow
13988 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13989 change *STRICT_OVERFLOW_P. */
13992 tree_single_nonzero_warnv_p (tree t
, bool *strict_overflow_p
)
13994 bool sub_strict_overflow_p
;
13995 switch (TREE_CODE (t
))
13998 return !integer_zerop (t
);
14002 tree base
= TREE_OPERAND (t
, 0);
14004 if (!DECL_P (base
))
14005 base
= get_base_address (base
);
14007 if (base
&& TREE_CODE (base
) == TARGET_EXPR
)
14008 base
= TARGET_EXPR_SLOT (base
);
14013 /* For objects in symbol table check if we know they are non-zero.
14014 Don't do anything for variables and functions before symtab is built;
14015 it is quite possible that they will be declared weak later. */
14016 int nonzero_addr
= maybe_nonzero_address (base
);
14017 if (nonzero_addr
>= 0)
14018 return nonzero_addr
;
14020 /* Constants are never weak. */
14021 if (CONSTANT_CLASS_P (base
))
14028 sub_strict_overflow_p
= false;
14029 if (tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 1),
14030 &sub_strict_overflow_p
)
14031 && tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 2),
14032 &sub_strict_overflow_p
))
14034 if (sub_strict_overflow_p
)
14035 *strict_overflow_p
= true;
14041 if (!INTEGRAL_TYPE_P (TREE_TYPE (t
)))
14043 return expr_not_equal_to (t
, wi::zero (TYPE_PRECISION (TREE_TYPE (t
))));
14051 #define integer_valued_real_p(X) \
14052 _Pragma ("GCC error \"Use RECURSE for recursive calls\"") 0
14054 #define RECURSE(X) \
14055 ((integer_valued_real_p) (X, depth + 1))
14057 /* Return true if the floating point result of (CODE OP0) has an
14058 integer value. We also allow +Inf, -Inf and NaN to be considered
14059 integer values. Return false for signaling NaN.
14061 DEPTH is the current nesting depth of the query. */
14064 integer_valued_real_unary_p (tree_code code
, tree op0
, int depth
)
14072 return RECURSE (op0
);
14076 tree type
= TREE_TYPE (op0
);
14077 if (TREE_CODE (type
) == INTEGER_TYPE
)
14079 if (TREE_CODE (type
) == REAL_TYPE
)
14080 return RECURSE (op0
);
14090 /* Return true if the floating point result of (CODE OP0 OP1) has an
14091 integer value. We also allow +Inf, -Inf and NaN to be considered
14092 integer values. Return false for signaling NaN.
14094 DEPTH is the current nesting depth of the query. */
14097 integer_valued_real_binary_p (tree_code code
, tree op0
, tree op1
, int depth
)
14106 return RECURSE (op0
) && RECURSE (op1
);
14114 /* Return true if the floating point result of calling FNDECL with arguments
14115 ARG0 and ARG1 has an integer value. We also allow +Inf, -Inf and NaN to be
14116 considered integer values. Return false for signaling NaN. If FNDECL
14117 takes fewer than 2 arguments, the remaining ARGn are null.
14119 DEPTH is the current nesting depth of the query. */
14122 integer_valued_real_call_p (combined_fn fn
, tree arg0
, tree arg1
, int depth
)
14130 CASE_CFN_NEARBYINT
:
14131 CASE_CFN_NEARBYINT_FN
:
14136 CASE_CFN_ROUNDEVEN
:
14137 CASE_CFN_ROUNDEVEN_FN
:
14146 return RECURSE (arg0
) && RECURSE (arg1
);
14154 /* Return true if the floating point expression T (a GIMPLE_SINGLE_RHS)
14155 has an integer value. We also allow +Inf, -Inf and NaN to be
14156 considered integer values. Return false for signaling NaN.
14158 DEPTH is the current nesting depth of the query. */
14161 integer_valued_real_single_p (tree t
, int depth
)
14163 switch (TREE_CODE (t
))
14166 return real_isinteger (TREE_REAL_CST_PTR (t
), TYPE_MODE (TREE_TYPE (t
)));
14169 return RECURSE (TREE_OPERAND (t
, 1)) && RECURSE (TREE_OPERAND (t
, 2));
14172 /* Limit the depth of recursion to avoid quadratic behavior.
14173 This is expected to catch almost all occurrences in practice.
14174 If this code misses important cases that unbounded recursion
14175 would not, passes that need this information could be revised
14176 to provide it through dataflow propagation. */
14177 return (!name_registered_for_update_p (t
)
14178 && depth
< param_max_ssa_name_query_depth
14179 && gimple_stmt_integer_valued_real_p (SSA_NAME_DEF_STMT (t
),
14188 /* Return true if the floating point expression T (a GIMPLE_INVALID_RHS)
14189 has an integer value. We also allow +Inf, -Inf and NaN to be
14190 considered integer values. Return false for signaling NaN.
14192 DEPTH is the current nesting depth of the query. */
14195 integer_valued_real_invalid_p (tree t
, int depth
)
14197 switch (TREE_CODE (t
))
14199 case COMPOUND_EXPR
:
14202 return RECURSE (TREE_OPERAND (t
, 1));
14205 return RECURSE (TREE_OPERAND (t
, 0));
14214 #undef integer_valued_real_p
14216 /* Return true if the floating point expression T has an integer value.
14217 We also allow +Inf, -Inf and NaN to be considered integer values.
14218 Return false for signaling NaN.
14220 DEPTH is the current nesting depth of the query. */
14223 integer_valued_real_p (tree t
, int depth
)
14225 if (t
== error_mark_node
)
14228 STRIP_ANY_LOCATION_WRAPPER (t
);
14230 tree_code code
= TREE_CODE (t
);
14231 switch (TREE_CODE_CLASS (code
))
14234 case tcc_comparison
:
14235 return integer_valued_real_binary_p (code
, TREE_OPERAND (t
, 0),
14236 TREE_OPERAND (t
, 1), depth
);
14239 return integer_valued_real_unary_p (code
, TREE_OPERAND (t
, 0), depth
);
14242 case tcc_declaration
:
14243 case tcc_reference
:
14244 return integer_valued_real_single_p (t
, depth
);
14254 return integer_valued_real_single_p (t
, depth
);
14258 tree arg0
= (call_expr_nargs (t
) > 0
14259 ? CALL_EXPR_ARG (t
, 0)
14261 tree arg1
= (call_expr_nargs (t
) > 1
14262 ? CALL_EXPR_ARG (t
, 1)
14264 return integer_valued_real_call_p (get_call_combined_fn (t
),
14265 arg0
, arg1
, depth
);
14269 return integer_valued_real_invalid_p (t
, depth
);
14273 /* Given the components of a binary expression CODE, TYPE, OP0 and OP1,
14274 attempt to fold the expression to a constant without modifying TYPE,
14277 If the expression could be simplified to a constant, then return
14278 the constant. If the expression would not be simplified to a
14279 constant, then return NULL_TREE. */
14282 fold_binary_to_constant (enum tree_code code
, tree type
, tree op0
, tree op1
)
14284 tree tem
= fold_binary (code
, type
, op0
, op1
);
14285 return (tem
&& TREE_CONSTANT (tem
)) ? tem
: NULL_TREE
;
14288 /* Given the components of a unary expression CODE, TYPE and OP0,
14289 attempt to fold the expression to a constant without modifying
14292 If the expression could be simplified to a constant, then return
14293 the constant. If the expression would not be simplified to a
14294 constant, then return NULL_TREE. */
14297 fold_unary_to_constant (enum tree_code code
, tree type
, tree op0
)
14299 tree tem
= fold_unary (code
, type
, op0
);
14300 return (tem
&& TREE_CONSTANT (tem
)) ? tem
: NULL_TREE
;
14303 /* If EXP represents referencing an element in a constant string
14304 (either via pointer arithmetic or array indexing), return the
14305 tree representing the value accessed, otherwise return NULL. */
14308 fold_read_from_constant_string (tree exp
)
14310 if ((TREE_CODE (exp
) == INDIRECT_REF
14311 || TREE_CODE (exp
) == ARRAY_REF
)
14312 && TREE_CODE (TREE_TYPE (exp
)) == INTEGER_TYPE
)
14314 tree exp1
= TREE_OPERAND (exp
, 0);
14317 location_t loc
= EXPR_LOCATION (exp
);
14319 if (TREE_CODE (exp
) == INDIRECT_REF
)
14320 string
= string_constant (exp1
, &index
, NULL
, NULL
);
14323 tree low_bound
= array_ref_low_bound (exp
);
14324 index
= fold_convert_loc (loc
, sizetype
, TREE_OPERAND (exp
, 1));
14326 /* Optimize the special-case of a zero lower bound.
14328 We convert the low_bound to sizetype to avoid some problems
14329 with constant folding. (E.g. suppose the lower bound is 1,
14330 and its mode is QI. Without the conversion,l (ARRAY
14331 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
14332 +INDEX), which becomes (ARRAY+255+INDEX). Oops!) */
14333 if (! integer_zerop (low_bound
))
14334 index
= size_diffop_loc (loc
, index
,
14335 fold_convert_loc (loc
, sizetype
, low_bound
));
14340 scalar_int_mode char_mode
;
14342 && TYPE_MODE (TREE_TYPE (exp
)) == TYPE_MODE (TREE_TYPE (TREE_TYPE (string
)))
14343 && TREE_CODE (string
) == STRING_CST
14344 && TREE_CODE (index
) == INTEGER_CST
14345 && compare_tree_int (index
, TREE_STRING_LENGTH (string
)) < 0
14346 && is_int_mode (TYPE_MODE (TREE_TYPE (TREE_TYPE (string
))),
14348 && GET_MODE_SIZE (char_mode
) == 1)
14349 return build_int_cst_type (TREE_TYPE (exp
),
14350 (TREE_STRING_POINTER (string
)
14351 [TREE_INT_CST_LOW (index
)]));
14356 /* Folds a read from vector element at IDX of vector ARG. */
14359 fold_read_from_vector (tree arg
, poly_uint64 idx
)
14361 unsigned HOST_WIDE_INT i
;
14362 if (known_lt (idx
, TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg
)))
14363 && known_ge (idx
, 0u)
14364 && idx
.is_constant (&i
))
14366 if (TREE_CODE (arg
) == VECTOR_CST
)
14367 return VECTOR_CST_ELT (arg
, i
);
14368 else if (TREE_CODE (arg
) == CONSTRUCTOR
)
14370 if (i
>= CONSTRUCTOR_NELTS (arg
))
14371 return build_zero_cst (TREE_TYPE (TREE_TYPE (arg
)));
14372 return CONSTRUCTOR_ELT (arg
, i
)->value
;
14378 /* Return the tree for neg (ARG0) when ARG0 is known to be either
14379 an integer constant, real, or fixed-point constant.
14381 TYPE is the type of the result. */
14384 fold_negate_const (tree arg0
, tree type
)
14386 tree t
= NULL_TREE
;
14388 switch (TREE_CODE (arg0
))
14391 t
= build_real (type
, real_value_negate (&TREE_REAL_CST (arg0
)));
14396 FIXED_VALUE_TYPE f
;
14397 bool overflow_p
= fixed_arithmetic (&f
, NEGATE_EXPR
,
14398 &(TREE_FIXED_CST (arg0
)), NULL
,
14399 TYPE_SATURATING (type
));
14400 t
= build_fixed (type
, f
);
14401 /* Propagate overflow flags. */
14402 if (overflow_p
| TREE_OVERFLOW (arg0
))
14403 TREE_OVERFLOW (t
) = 1;
14408 if (poly_int_tree_p (arg0
))
14410 wi::overflow_type overflow
;
14411 poly_wide_int res
= wi::neg (wi::to_poly_wide (arg0
), &overflow
);
14412 t
= force_fit_type (type
, res
, 1,
14413 (overflow
&& ! TYPE_UNSIGNED (type
))
14414 || TREE_OVERFLOW (arg0
));
14418 gcc_unreachable ();
14424 /* Return the tree for abs (ARG0) when ARG0 is known to be either
14425 an integer constant or real constant.
14427 TYPE is the type of the result. */
14430 fold_abs_const (tree arg0
, tree type
)
14432 tree t
= NULL_TREE
;
14434 switch (TREE_CODE (arg0
))
14438 /* If the value is unsigned or non-negative, then the absolute value
14439 is the same as the ordinary value. */
14440 wide_int val
= wi::to_wide (arg0
);
14441 wi::overflow_type overflow
= wi::OVF_NONE
;
14442 if (!wi::neg_p (val
, TYPE_SIGN (TREE_TYPE (arg0
))))
14445 /* If the value is negative, then the absolute value is
14448 val
= wi::neg (val
, &overflow
);
14450 /* Force to the destination type, set TREE_OVERFLOW for signed
14452 t
= force_fit_type (type
, val
, 1, overflow
| TREE_OVERFLOW (arg0
));
14457 if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg0
)))
14458 t
= build_real (type
, real_value_negate (&TREE_REAL_CST (arg0
)));
14464 gcc_unreachable ();
14470 /* Return the tree for not (ARG0) when ARG0 is known to be an integer
14471 constant. TYPE is the type of the result. */
14474 fold_not_const (const_tree arg0
, tree type
)
14476 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
);
14478 return force_fit_type (type
, ~wi::to_wide (arg0
), 0, TREE_OVERFLOW (arg0
));
14481 /* Given CODE, a relational operator, the target type, TYPE and two
14482 constant operands OP0 and OP1, return the result of the
14483 relational operation. If the result is not a compile time
14484 constant, then return NULL_TREE. */
14487 fold_relational_const (enum tree_code code
, tree type
, tree op0
, tree op1
)
14489 int result
, invert
;
14491 /* From here on, the only cases we handle are when the result is
14492 known to be a constant. */
14494 if (TREE_CODE (op0
) == REAL_CST
&& TREE_CODE (op1
) == REAL_CST
)
14496 const REAL_VALUE_TYPE
*c0
= TREE_REAL_CST_PTR (op0
);
14497 const REAL_VALUE_TYPE
*c1
= TREE_REAL_CST_PTR (op1
);
14499 /* Handle the cases where either operand is a NaN. */
14500 if (real_isnan (c0
) || real_isnan (c1
))
14510 case UNORDERED_EXPR
:
14524 if (flag_trapping_math
)
14530 gcc_unreachable ();
14533 return constant_boolean_node (result
, type
);
14536 return constant_boolean_node (real_compare (code
, c0
, c1
), type
);
14539 if (TREE_CODE (op0
) == FIXED_CST
&& TREE_CODE (op1
) == FIXED_CST
)
14541 const FIXED_VALUE_TYPE
*c0
= TREE_FIXED_CST_PTR (op0
);
14542 const FIXED_VALUE_TYPE
*c1
= TREE_FIXED_CST_PTR (op1
);
14543 return constant_boolean_node (fixed_compare (code
, c0
, c1
), type
);
14546 /* Handle equality/inequality of complex constants. */
14547 if (TREE_CODE (op0
) == COMPLEX_CST
&& TREE_CODE (op1
) == COMPLEX_CST
)
14549 tree rcond
= fold_relational_const (code
, type
,
14550 TREE_REALPART (op0
),
14551 TREE_REALPART (op1
));
14552 tree icond
= fold_relational_const (code
, type
,
14553 TREE_IMAGPART (op0
),
14554 TREE_IMAGPART (op1
));
14555 if (code
== EQ_EXPR
)
14556 return fold_build2 (TRUTH_ANDIF_EXPR
, type
, rcond
, icond
);
14557 else if (code
== NE_EXPR
)
14558 return fold_build2 (TRUTH_ORIF_EXPR
, type
, rcond
, icond
);
14563 if (TREE_CODE (op0
) == VECTOR_CST
&& TREE_CODE (op1
) == VECTOR_CST
)
14565 if (!VECTOR_TYPE_P (type
))
14567 /* Have vector comparison with scalar boolean result. */
14568 gcc_assert ((code
== EQ_EXPR
|| code
== NE_EXPR
)
14569 && known_eq (VECTOR_CST_NELTS (op0
),
14570 VECTOR_CST_NELTS (op1
)));
14571 unsigned HOST_WIDE_INT nunits
;
14572 if (!VECTOR_CST_NELTS (op0
).is_constant (&nunits
))
14574 for (unsigned i
= 0; i
< nunits
; i
++)
14576 tree elem0
= VECTOR_CST_ELT (op0
, i
);
14577 tree elem1
= VECTOR_CST_ELT (op1
, i
);
14578 tree tmp
= fold_relational_const (EQ_EXPR
, type
, elem0
, elem1
);
14579 if (tmp
== NULL_TREE
)
14581 if (integer_zerop (tmp
))
14582 return constant_boolean_node (code
== NE_EXPR
, type
);
14584 return constant_boolean_node (code
== EQ_EXPR
, type
);
14586 tree_vector_builder elts
;
14587 if (!elts
.new_binary_operation (type
, op0
, op1
, false))
14589 unsigned int count
= elts
.encoded_nelts ();
14590 for (unsigned i
= 0; i
< count
; i
++)
14592 tree elem_type
= TREE_TYPE (type
);
14593 tree elem0
= VECTOR_CST_ELT (op0
, i
);
14594 tree elem1
= VECTOR_CST_ELT (op1
, i
);
14596 tree tem
= fold_relational_const (code
, elem_type
,
14599 if (tem
== NULL_TREE
)
14602 elts
.quick_push (build_int_cst (elem_type
,
14603 integer_zerop (tem
) ? 0 : -1));
14606 return elts
.build ();
14609 /* From here on we only handle LT, LE, GT, GE, EQ and NE.
14611 To compute GT, swap the arguments and do LT.
14612 To compute GE, do LT and invert the result.
14613 To compute LE, swap the arguments, do LT and invert the result.
14614 To compute NE, do EQ and invert the result.
14616 Therefore, the code below must handle only EQ and LT. */
14618 if (code
== LE_EXPR
|| code
== GT_EXPR
)
14620 std::swap (op0
, op1
);
14621 code
= swap_tree_comparison (code
);
14624 /* Note that it is safe to invert for real values here because we
14625 have already handled the one case that it matters. */
14628 if (code
== NE_EXPR
|| code
== GE_EXPR
)
14631 code
= invert_tree_comparison (code
, false);
14634 /* Compute a result for LT or EQ if args permit;
14635 Otherwise return T. */
14636 if (TREE_CODE (op0
) == INTEGER_CST
&& TREE_CODE (op1
) == INTEGER_CST
)
14638 if (code
== EQ_EXPR
)
14639 result
= tree_int_cst_equal (op0
, op1
);
14641 result
= tree_int_cst_lt (op0
, op1
);
14648 return constant_boolean_node (result
, type
);
14651 /* If necessary, return a CLEANUP_POINT_EXPR for EXPR with the
14652 indicated TYPE. If no CLEANUP_POINT_EXPR is necessary, return EXPR
14656 fold_build_cleanup_point_expr (tree type
, tree expr
)
14658 /* If the expression does not have side effects then we don't have to wrap
14659 it with a cleanup point expression. */
14660 if (!TREE_SIDE_EFFECTS (expr
))
14663 /* If the expression is a return, check to see if the expression inside the
14664 return has no side effects or the right hand side of the modify expression
14665 inside the return. If either don't have side effects set we don't need to
14666 wrap the expression in a cleanup point expression. Note we don't check the
14667 left hand side of the modify because it should always be a return decl. */
14668 if (TREE_CODE (expr
) == RETURN_EXPR
)
14670 tree op
= TREE_OPERAND (expr
, 0);
14671 if (!op
|| !TREE_SIDE_EFFECTS (op
))
14673 op
= TREE_OPERAND (op
, 1);
14674 if (!TREE_SIDE_EFFECTS (op
))
14678 return build1_loc (EXPR_LOCATION (expr
), CLEANUP_POINT_EXPR
, type
, expr
);
14681 /* Given a pointer value OP0 and a type TYPE, return a simplified version
14682 of an indirection through OP0, or NULL_TREE if no simplification is
14686 fold_indirect_ref_1 (location_t loc
, tree type
, tree op0
)
14690 poly_uint64 const_op01
;
14693 subtype
= TREE_TYPE (sub
);
14694 if (!POINTER_TYPE_P (subtype
)
14695 || TYPE_REF_CAN_ALIAS_ALL (TREE_TYPE (op0
)))
14698 if (TREE_CODE (sub
) == ADDR_EXPR
)
14700 tree op
= TREE_OPERAND (sub
, 0);
14701 tree optype
= TREE_TYPE (op
);
14703 /* *&CONST_DECL -> to the value of the const decl. */
14704 if (TREE_CODE (op
) == CONST_DECL
)
14705 return DECL_INITIAL (op
);
14706 /* *&p => p; make sure to handle *&"str"[cst] here. */
14707 if (type
== optype
)
14709 tree fop
= fold_read_from_constant_string (op
);
14715 /* *(foo *)&fooarray => fooarray[0] */
14716 else if (TREE_CODE (optype
) == ARRAY_TYPE
14717 && type
== TREE_TYPE (optype
)
14718 && (!in_gimple_form
14719 || TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
))
14721 tree type_domain
= TYPE_DOMAIN (optype
);
14722 tree min_val
= size_zero_node
;
14723 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
14724 min_val
= TYPE_MIN_VALUE (type_domain
);
14726 && TREE_CODE (min_val
) != INTEGER_CST
)
14728 return build4_loc (loc
, ARRAY_REF
, type
, op
, min_val
,
14729 NULL_TREE
, NULL_TREE
);
14731 /* *(foo *)&complexfoo => __real__ complexfoo */
14732 else if (TREE_CODE (optype
) == COMPLEX_TYPE
14733 && type
== TREE_TYPE (optype
))
14734 return fold_build1_loc (loc
, REALPART_EXPR
, type
, op
);
14735 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
14736 else if (VECTOR_TYPE_P (optype
)
14737 && type
== TREE_TYPE (optype
))
14739 tree part_width
= TYPE_SIZE (type
);
14740 tree index
= bitsize_int (0);
14741 return fold_build3_loc (loc
, BIT_FIELD_REF
, type
, op
, part_width
,
14746 if (TREE_CODE (sub
) == POINTER_PLUS_EXPR
14747 && poly_int_tree_p (TREE_OPERAND (sub
, 1), &const_op01
))
14749 tree op00
= TREE_OPERAND (sub
, 0);
14750 tree op01
= TREE_OPERAND (sub
, 1);
14753 if (TREE_CODE (op00
) == ADDR_EXPR
)
14756 op00
= TREE_OPERAND (op00
, 0);
14757 op00type
= TREE_TYPE (op00
);
14759 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
14760 if (VECTOR_TYPE_P (op00type
)
14761 && type
== TREE_TYPE (op00type
)
14762 /* POINTER_PLUS_EXPR second operand is sizetype, unsigned,
14763 but we want to treat offsets with MSB set as negative.
14764 For the code below negative offsets are invalid and
14765 TYPE_SIZE of the element is something unsigned, so
14766 check whether op01 fits into poly_int64, which implies
14767 it is from 0 to INTTYPE_MAXIMUM (HOST_WIDE_INT), and
14768 then just use poly_uint64 because we want to treat the
14769 value as unsigned. */
14770 && tree_fits_poly_int64_p (op01
))
14772 tree part_width
= TYPE_SIZE (type
);
14773 poly_uint64 max_offset
14774 = (tree_to_uhwi (part_width
) / BITS_PER_UNIT
14775 * TYPE_VECTOR_SUBPARTS (op00type
));
14776 if (known_lt (const_op01
, max_offset
))
14778 tree index
= bitsize_int (const_op01
* BITS_PER_UNIT
);
14779 return fold_build3_loc (loc
,
14780 BIT_FIELD_REF
, type
, op00
,
14781 part_width
, index
);
14784 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
14785 else if (TREE_CODE (op00type
) == COMPLEX_TYPE
14786 && type
== TREE_TYPE (op00type
))
14788 if (known_eq (wi::to_poly_offset (TYPE_SIZE_UNIT (type
)),
14790 return fold_build1_loc (loc
, IMAGPART_EXPR
, type
, op00
);
14792 /* ((foo *)&fooarray)[1] => fooarray[1] */
14793 else if (TREE_CODE (op00type
) == ARRAY_TYPE
14794 && type
== TREE_TYPE (op00type
))
14796 tree type_domain
= TYPE_DOMAIN (op00type
);
14797 tree min_val
= size_zero_node
;
14798 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
14799 min_val
= TYPE_MIN_VALUE (type_domain
);
14800 poly_uint64 type_size
, index
;
14801 if (poly_int_tree_p (min_val
)
14802 && poly_int_tree_p (TYPE_SIZE_UNIT (type
), &type_size
)
14803 && multiple_p (const_op01
, type_size
, &index
))
14805 poly_offset_int off
= index
+ wi::to_poly_offset (min_val
);
14806 op01
= wide_int_to_tree (sizetype
, off
);
14807 return build4_loc (loc
, ARRAY_REF
, type
, op00
, op01
,
14808 NULL_TREE
, NULL_TREE
);
14814 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
14815 if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
14816 && type
== TREE_TYPE (TREE_TYPE (subtype
))
14817 && (!in_gimple_form
14818 || TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
))
14821 tree min_val
= size_zero_node
;
14822 sub
= build_fold_indirect_ref_loc (loc
, sub
);
14823 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
14824 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
14825 min_val
= TYPE_MIN_VALUE (type_domain
);
14827 && TREE_CODE (min_val
) != INTEGER_CST
)
14829 return build4_loc (loc
, ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
,
14836 /* Builds an expression for an indirection through T, simplifying some
14840 build_fold_indirect_ref_loc (location_t loc
, tree t
)
14842 tree type
= TREE_TYPE (TREE_TYPE (t
));
14843 tree sub
= fold_indirect_ref_1 (loc
, type
, t
);
14848 return build1_loc (loc
, INDIRECT_REF
, type
, t
);
14851 /* Given an INDIRECT_REF T, return either T or a simplified version. */
14854 fold_indirect_ref_loc (location_t loc
, tree t
)
14856 tree sub
= fold_indirect_ref_1 (loc
, TREE_TYPE (t
), TREE_OPERAND (t
, 0));
14864 /* Strip non-trapping, non-side-effecting tree nodes from an expression
14865 whose result is ignored. The type of the returned tree need not be
14866 the same as the original expression. */
14869 fold_ignored_result (tree t
)
14871 if (!TREE_SIDE_EFFECTS (t
))
14872 return integer_zero_node
;
14875 switch (TREE_CODE_CLASS (TREE_CODE (t
)))
14878 t
= TREE_OPERAND (t
, 0);
14882 case tcc_comparison
:
14883 if (!TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 1)))
14884 t
= TREE_OPERAND (t
, 0);
14885 else if (!TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 0)))
14886 t
= TREE_OPERAND (t
, 1);
14891 case tcc_expression
:
14892 switch (TREE_CODE (t
))
14894 case COMPOUND_EXPR
:
14895 if (TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 1)))
14897 t
= TREE_OPERAND (t
, 0);
14901 if (TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 1))
14902 || TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 2)))
14904 t
= TREE_OPERAND (t
, 0);
14917 /* Return the value of VALUE, rounded up to a multiple of DIVISOR. */
14920 round_up_loc (location_t loc
, tree value
, unsigned int divisor
)
14922 tree div
= NULL_TREE
;
14927 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
14928 have to do anything. Only do this when we are not given a const,
14929 because in that case, this check is more expensive than just
14931 if (TREE_CODE (value
) != INTEGER_CST
)
14933 div
= build_int_cst (TREE_TYPE (value
), divisor
);
14935 if (multiple_of_p (TREE_TYPE (value
), value
, div
))
14939 /* If divisor is a power of two, simplify this to bit manipulation. */
14940 if (pow2_or_zerop (divisor
))
14942 if (TREE_CODE (value
) == INTEGER_CST
)
14944 wide_int val
= wi::to_wide (value
);
14947 if ((val
& (divisor
- 1)) == 0)
14950 overflow_p
= TREE_OVERFLOW (value
);
14951 val
+= divisor
- 1;
14952 val
&= (int) -divisor
;
14956 return force_fit_type (TREE_TYPE (value
), val
, -1, overflow_p
);
14962 t
= build_int_cst (TREE_TYPE (value
), divisor
- 1);
14963 value
= size_binop_loc (loc
, PLUS_EXPR
, value
, t
);
14964 t
= build_int_cst (TREE_TYPE (value
), - (int) divisor
);
14965 value
= size_binop_loc (loc
, BIT_AND_EXPR
, value
, t
);
14971 div
= build_int_cst (TREE_TYPE (value
), divisor
);
14972 value
= size_binop_loc (loc
, CEIL_DIV_EXPR
, value
, div
);
14973 value
= size_binop_loc (loc
, MULT_EXPR
, value
, div
);
14979 /* Likewise, but round down. */
14982 round_down_loc (location_t loc
, tree value
, int divisor
)
14984 tree div
= NULL_TREE
;
14986 gcc_assert (divisor
> 0);
14990 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
14991 have to do anything. Only do this when we are not given a const,
14992 because in that case, this check is more expensive than just
14994 if (TREE_CODE (value
) != INTEGER_CST
)
14996 div
= build_int_cst (TREE_TYPE (value
), divisor
);
14998 if (multiple_of_p (TREE_TYPE (value
), value
, div
))
15002 /* If divisor is a power of two, simplify this to bit manipulation. */
15003 if (pow2_or_zerop (divisor
))
15007 t
= build_int_cst (TREE_TYPE (value
), -divisor
);
15008 value
= size_binop_loc (loc
, BIT_AND_EXPR
, value
, t
);
15013 div
= build_int_cst (TREE_TYPE (value
), divisor
);
15014 value
= size_binop_loc (loc
, FLOOR_DIV_EXPR
, value
, div
);
15015 value
= size_binop_loc (loc
, MULT_EXPR
, value
, div
);
15021 /* Returns the pointer to the base of the object addressed by EXP and
15022 extracts the information about the offset of the access, storing it
15023 to PBITPOS and POFFSET. */
15026 split_address_to_core_and_offset (tree exp
,
15027 poly_int64_pod
*pbitpos
, tree
*poffset
)
15031 int unsignedp
, reversep
, volatilep
;
15032 poly_int64 bitsize
;
15033 location_t loc
= EXPR_LOCATION (exp
);
15035 if (TREE_CODE (exp
) == ADDR_EXPR
)
15037 core
= get_inner_reference (TREE_OPERAND (exp
, 0), &bitsize
, pbitpos
,
15038 poffset
, &mode
, &unsignedp
, &reversep
,
15040 core
= build_fold_addr_expr_loc (loc
, core
);
15042 else if (TREE_CODE (exp
) == POINTER_PLUS_EXPR
)
15044 core
= TREE_OPERAND (exp
, 0);
15047 *poffset
= TREE_OPERAND (exp
, 1);
15048 if (poly_int_tree_p (*poffset
))
15050 poly_offset_int tem
15051 = wi::sext (wi::to_poly_offset (*poffset
),
15052 TYPE_PRECISION (TREE_TYPE (*poffset
)));
15053 tem
<<= LOG2_BITS_PER_UNIT
;
15054 if (tem
.to_shwi (pbitpos
))
15055 *poffset
= NULL_TREE
;
15062 *poffset
= NULL_TREE
;
15068 /* Returns true if addresses of E1 and E2 differ by a constant, false
15069 otherwise. If they do, E1 - E2 is stored in *DIFF. */
15072 ptr_difference_const (tree e1
, tree e2
, poly_int64_pod
*diff
)
15075 poly_int64 bitpos1
, bitpos2
;
15076 tree toffset1
, toffset2
, tdiff
, type
;
15078 core1
= split_address_to_core_and_offset (e1
, &bitpos1
, &toffset1
);
15079 core2
= split_address_to_core_and_offset (e2
, &bitpos2
, &toffset2
);
15081 poly_int64 bytepos1
, bytepos2
;
15082 if (!multiple_p (bitpos1
, BITS_PER_UNIT
, &bytepos1
)
15083 || !multiple_p (bitpos2
, BITS_PER_UNIT
, &bytepos2
)
15084 || !operand_equal_p (core1
, core2
, 0))
15087 if (toffset1
&& toffset2
)
15089 type
= TREE_TYPE (toffset1
);
15090 if (type
!= TREE_TYPE (toffset2
))
15091 toffset2
= fold_convert (type
, toffset2
);
15093 tdiff
= fold_build2 (MINUS_EXPR
, type
, toffset1
, toffset2
);
15094 if (!cst_and_fits_in_hwi (tdiff
))
15097 *diff
= int_cst_value (tdiff
);
15099 else if (toffset1
|| toffset2
)
15101 /* If only one of the offsets is non-constant, the difference cannot
15108 *diff
+= bytepos1
- bytepos2
;
15112 /* Return OFF converted to a pointer offset type suitable as offset for
15113 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
15115 convert_to_ptrofftype_loc (location_t loc
, tree off
)
15117 return fold_convert_loc (loc
, sizetype
, off
);
15120 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
15122 fold_build_pointer_plus_loc (location_t loc
, tree ptr
, tree off
)
15124 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
15125 ptr
, convert_to_ptrofftype_loc (loc
, off
));
15128 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
15130 fold_build_pointer_plus_hwi_loc (location_t loc
, tree ptr
, HOST_WIDE_INT off
)
15132 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
15133 ptr
, size_int (off
));
15136 /* Return a pointer P to a NUL-terminated string representing the sequence
15137 of constant characters referred to by SRC (or a subsequence of such
15138 characters within it if SRC is a reference to a string plus some
15139 constant offset). If STRLEN is non-null, store the number of bytes
15140 in the string constant including the terminating NUL char. *STRLEN is
15141 typically strlen(P) + 1 in the absence of embedded NUL characters. */
15144 c_getstr (tree src
, unsigned HOST_WIDE_INT
*strlen
/* = NULL */)
15152 src
= string_constant (src
, &offset_node
, &mem_size
, NULL
);
15156 unsigned HOST_WIDE_INT offset
= 0;
15157 if (offset_node
!= NULL_TREE
)
15159 if (!tree_fits_uhwi_p (offset_node
))
15162 offset
= tree_to_uhwi (offset_node
);
15165 if (!tree_fits_uhwi_p (mem_size
))
15168 /* STRING_LENGTH is the size of the string literal, including any
15169 embedded NULs. STRING_SIZE is the size of the array the string
15170 literal is stored in. */
15171 unsigned HOST_WIDE_INT string_length
= TREE_STRING_LENGTH (src
);
15172 unsigned HOST_WIDE_INT string_size
= tree_to_uhwi (mem_size
);
15174 /* Ideally this would turn into a gcc_checking_assert over time. */
15175 if (string_length
> string_size
)
15176 string_length
= string_size
;
15178 const char *string
= TREE_STRING_POINTER (src
);
15180 /* Ideally this would turn into a gcc_checking_assert over time. */
15181 if (string_length
> string_size
)
15182 string_length
= string_size
;
15184 if (string_length
== 0
15185 || offset
>= string_size
)
15190 /* Compute and store the length of the substring at OFFSET.
15191 All offsets past the initial length refer to null strings. */
15192 if (offset
< string_length
)
15193 *strlen
= string_length
- offset
;
15199 tree eltype
= TREE_TYPE (TREE_TYPE (src
));
15200 /* Support only properly NUL-terminated single byte strings. */
15201 if (tree_to_uhwi (TYPE_SIZE_UNIT (eltype
)) != 1)
15203 if (string
[string_length
- 1] != '\0')
15207 return offset
< string_length
? string
+ offset
: "";
15210 /* Given a tree T, compute which bits in T may be nonzero. */
15213 tree_nonzero_bits (const_tree t
)
15215 switch (TREE_CODE (t
))
15218 return wi::to_wide (t
);
15220 return get_nonzero_bits (t
);
15221 case NON_LVALUE_EXPR
:
15223 return tree_nonzero_bits (TREE_OPERAND (t
, 0));
15225 return wi::bit_and (tree_nonzero_bits (TREE_OPERAND (t
, 0)),
15226 tree_nonzero_bits (TREE_OPERAND (t
, 1)));
15229 return wi::bit_or (tree_nonzero_bits (TREE_OPERAND (t
, 0)),
15230 tree_nonzero_bits (TREE_OPERAND (t
, 1)));
15232 return wi::bit_or (tree_nonzero_bits (TREE_OPERAND (t
, 1)),
15233 tree_nonzero_bits (TREE_OPERAND (t
, 2)));
15235 return wide_int::from (tree_nonzero_bits (TREE_OPERAND (t
, 0)),
15236 TYPE_PRECISION (TREE_TYPE (t
)),
15237 TYPE_SIGN (TREE_TYPE (TREE_OPERAND (t
, 0))));
15239 if (INTEGRAL_TYPE_P (TREE_TYPE (t
)))
15241 wide_int nzbits1
= tree_nonzero_bits (TREE_OPERAND (t
, 0));
15242 wide_int nzbits2
= tree_nonzero_bits (TREE_OPERAND (t
, 1));
15243 if (wi::bit_and (nzbits1
, nzbits2
) == 0)
15244 return wi::bit_or (nzbits1
, nzbits2
);
15248 if (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
)
15250 tree type
= TREE_TYPE (t
);
15251 wide_int nzbits
= tree_nonzero_bits (TREE_OPERAND (t
, 0));
15252 wide_int arg1
= wi::to_wide (TREE_OPERAND (t
, 1),
15253 TYPE_PRECISION (type
));
15254 return wi::neg_p (arg1
)
15255 ? wi::rshift (nzbits
, -arg1
, TYPE_SIGN (type
))
15256 : wi::lshift (nzbits
, arg1
);
15260 if (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
)
15262 tree type
= TREE_TYPE (t
);
15263 wide_int nzbits
= tree_nonzero_bits (TREE_OPERAND (t
, 0));
15264 wide_int arg1
= wi::to_wide (TREE_OPERAND (t
, 1),
15265 TYPE_PRECISION (type
));
15266 return wi::neg_p (arg1
)
15267 ? wi::lshift (nzbits
, -arg1
)
15268 : wi::rshift (nzbits
, arg1
, TYPE_SIGN (type
));
15275 return wi::shwi (-1, TYPE_PRECISION (TREE_TYPE (t
)));
15280 namespace selftest
{
15282 /* Helper functions for writing tests of folding trees. */
15284 /* Verify that the binary op (LHS CODE RHS) folds to CONSTANT. */
15287 assert_binop_folds_to_const (tree lhs
, enum tree_code code
, tree rhs
,
15290 ASSERT_EQ (constant
, fold_build2 (code
, TREE_TYPE (lhs
), lhs
, rhs
));
15293 /* Verify that the binary op (LHS CODE RHS) folds to an NON_LVALUE_EXPR
15294 wrapping WRAPPED_EXPR. */
15297 assert_binop_folds_to_nonlvalue (tree lhs
, enum tree_code code
, tree rhs
,
15300 tree result
= fold_build2 (code
, TREE_TYPE (lhs
), lhs
, rhs
);
15301 ASSERT_NE (wrapped_expr
, result
);
15302 ASSERT_EQ (NON_LVALUE_EXPR
, TREE_CODE (result
));
15303 ASSERT_EQ (wrapped_expr
, TREE_OPERAND (result
, 0));
15306 /* Verify that various arithmetic binary operations are folded
15310 test_arithmetic_folding ()
15312 tree type
= integer_type_node
;
15313 tree x
= create_tmp_var_raw (type
, "x");
15314 tree zero
= build_zero_cst (type
);
15315 tree one
= build_int_cst (type
, 1);
15318 /* 1 <-- (0 + 1) */
15319 assert_binop_folds_to_const (zero
, PLUS_EXPR
, one
,
15321 assert_binop_folds_to_const (one
, PLUS_EXPR
, zero
,
15324 /* (nonlvalue)x <-- (x + 0) */
15325 assert_binop_folds_to_nonlvalue (x
, PLUS_EXPR
, zero
,
15329 /* 0 <-- (x - x) */
15330 assert_binop_folds_to_const (x
, MINUS_EXPR
, x
,
15332 assert_binop_folds_to_nonlvalue (x
, MINUS_EXPR
, zero
,
15335 /* Multiplication. */
15336 /* 0 <-- (x * 0) */
15337 assert_binop_folds_to_const (x
, MULT_EXPR
, zero
,
15340 /* (nonlvalue)x <-- (x * 1) */
15341 assert_binop_folds_to_nonlvalue (x
, MULT_EXPR
, one
,
15345 /* Verify that various binary operations on vectors are folded
15349 test_vector_folding ()
15351 tree inner_type
= integer_type_node
;
15352 tree type
= build_vector_type (inner_type
, 4);
15353 tree zero
= build_zero_cst (type
);
15354 tree one
= build_one_cst (type
);
15355 tree index
= build_index_vector (type
, 0, 1);
15357 /* Verify equality tests that return a scalar boolean result. */
15358 tree res_type
= boolean_type_node
;
15359 ASSERT_FALSE (integer_nonzerop (fold_build2 (EQ_EXPR
, res_type
, zero
, one
)));
15360 ASSERT_TRUE (integer_nonzerop (fold_build2 (EQ_EXPR
, res_type
, zero
, zero
)));
15361 ASSERT_TRUE (integer_nonzerop (fold_build2 (NE_EXPR
, res_type
, zero
, one
)));
15362 ASSERT_FALSE (integer_nonzerop (fold_build2 (NE_EXPR
, res_type
, one
, one
)));
15363 ASSERT_TRUE (integer_nonzerop (fold_build2 (NE_EXPR
, res_type
, index
, one
)));
15364 ASSERT_FALSE (integer_nonzerop (fold_build2 (EQ_EXPR
, res_type
,
15366 ASSERT_FALSE (integer_nonzerop (fold_build2 (NE_EXPR
, res_type
,
15368 ASSERT_TRUE (integer_nonzerop (fold_build2 (EQ_EXPR
, res_type
,
15372 /* Verify folding of VEC_DUPLICATE_EXPRs. */
15375 test_vec_duplicate_folding ()
15377 scalar_int_mode int_mode
= SCALAR_INT_TYPE_MODE (ssizetype
);
15378 machine_mode vec_mode
= targetm
.vectorize
.preferred_simd_mode (int_mode
);
15379 /* This will be 1 if VEC_MODE isn't a vector mode. */
15380 poly_uint64 nunits
= GET_MODE_NUNITS (vec_mode
);
15382 tree type
= build_vector_type (ssizetype
, nunits
);
15383 tree dup5_expr
= fold_unary (VEC_DUPLICATE_EXPR
, type
, ssize_int (5));
15384 tree dup5_cst
= build_vector_from_val (type
, ssize_int (5));
15385 ASSERT_TRUE (operand_equal_p (dup5_expr
, dup5_cst
, 0));
15388 /* Run all of the selftests within this file. */
15391 fold_const_c_tests ()
15393 test_arithmetic_folding ();
15394 test_vector_folding ();
15395 test_vec_duplicate_folding ();
15398 } // namespace selftest
15400 #endif /* CHECKING_P */