1 /* Fold a constant sub-tree into a single node for C-compiler
2 Copyright (C) 1987-2017 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /*@@ This file should be rewritten to use an arbitrary precision
21 @@ representation for "struct tree_int_cst" and "struct tree_real_cst".
22 @@ Perhaps the routines could also be used for bc/dc, and made a lib.
23 @@ The routines that translate from the ap rep should
24 @@ warn if precision et. al. is lost.
25 @@ This would also make life easier when this technology is used
26 @@ for cross-compilers. */
28 /* The entry points in this file are fold, size_int_wide and size_binop.
30 fold takes a tree as argument and returns a simplified tree.
32 size_binop takes a tree code for an arithmetic operation
33 and two operands that are trees, and produces a tree for the
34 result, assuming the type comes from `sizetype'.
36 size_int takes an integer value, and creates a tree constant
37 with type from `sizetype'.
39 Note: Since the folders get called on non-gimple code as well as
40 gimple code, we need to handle GIMPLE tuples as well as their
41 corresponding tree equivalents. */
45 #include "coretypes.h"
54 #include "tree-ssa-operands.h"
55 #include "optabs-query.h"
57 #include "diagnostic-core.h"
60 #include "fold-const.h"
61 #include "fold-const-call.h"
62 #include "stor-layout.h"
64 #include "tree-iterator.h"
67 #include "langhooks.h"
72 #include "generic-match.h"
73 #include "gimple-fold.h"
75 #include "tree-into-ssa.h"
77 #include "case-cfn-macros.h"
78 #include "stringpool.h"
80 #include "tree-ssanames.h"
82 #include "stringpool.h"
84 #include "tree-vector-builder.h"
85 #include "vec-perm-indices.h"
87 /* Nonzero if we are folding constants inside an initializer; zero
89 int folding_initializer
= 0;
91 /* The following constants represent a bit based encoding of GCC's
92 comparison operators. This encoding simplifies transformations
93 on relational comparison operators, such as AND and OR. */
94 enum comparison_code
{
113 static bool negate_expr_p (tree
);
114 static tree
negate_expr (tree
);
115 static tree
associate_trees (location_t
, tree
, tree
, enum tree_code
, tree
);
116 static enum comparison_code
comparison_to_compcode (enum tree_code
);
117 static enum tree_code
compcode_to_comparison (enum comparison_code
);
118 static int twoval_comparison_p (tree
, tree
*, tree
*, int *);
119 static tree
eval_subst (location_t
, tree
, tree
, tree
, tree
, tree
);
120 static tree
optimize_bit_field_compare (location_t
, enum tree_code
,
122 static int simple_operand_p (const_tree
);
123 static bool simple_operand_p_2 (tree
);
124 static tree
range_binop (enum tree_code
, tree
, tree
, int, tree
, int);
125 static tree
range_predecessor (tree
);
126 static tree
range_successor (tree
);
127 static tree
fold_range_test (location_t
, enum tree_code
, tree
, tree
, tree
);
128 static tree
fold_cond_expr_with_comparison (location_t
, tree
, tree
, tree
, tree
);
129 static tree
unextend (tree
, int, int, tree
);
130 static tree
extract_muldiv (tree
, tree
, enum tree_code
, tree
, bool *);
131 static tree
extract_muldiv_1 (tree
, tree
, enum tree_code
, tree
, bool *);
132 static tree
fold_binary_op_with_conditional_arg (location_t
,
133 enum tree_code
, tree
,
136 static tree
fold_negate_const (tree
, tree
);
137 static tree
fold_not_const (const_tree
, tree
);
138 static tree
fold_relational_const (enum tree_code
, tree
, tree
, tree
);
139 static tree
fold_convert_const (enum tree_code
, tree
, tree
);
140 static tree
fold_view_convert_expr (tree
, tree
);
141 static tree
fold_negate_expr (location_t
, tree
);
144 /* Return EXPR_LOCATION of T if it is not UNKNOWN_LOCATION.
145 Otherwise, return LOC. */
148 expr_location_or (tree t
, location_t loc
)
150 location_t tloc
= EXPR_LOCATION (t
);
151 return tloc
== UNKNOWN_LOCATION
? loc
: tloc
;
154 /* Similar to protected_set_expr_location, but never modify x in place,
155 if location can and needs to be set, unshare it. */
158 protected_set_expr_location_unshare (tree x
, location_t loc
)
160 if (CAN_HAVE_LOCATION_P (x
)
161 && EXPR_LOCATION (x
) != loc
162 && !(TREE_CODE (x
) == SAVE_EXPR
163 || TREE_CODE (x
) == TARGET_EXPR
164 || TREE_CODE (x
) == BIND_EXPR
))
167 SET_EXPR_LOCATION (x
, loc
);
172 /* If ARG2 divides ARG1 with zero remainder, carries out the exact
173 division and returns the quotient. Otherwise returns
177 div_if_zero_remainder (const_tree arg1
, const_tree arg2
)
181 if (wi::multiple_of_p (wi::to_widest (arg1
), wi::to_widest (arg2
),
183 return wide_int_to_tree (TREE_TYPE (arg1
), quo
);
188 /* This is nonzero if we should defer warnings about undefined
189 overflow. This facility exists because these warnings are a
190 special case. The code to estimate loop iterations does not want
191 to issue any warnings, since it works with expressions which do not
192 occur in user code. Various bits of cleanup code call fold(), but
193 only use the result if it has certain characteristics (e.g., is a
194 constant); that code only wants to issue a warning if the result is
197 static int fold_deferring_overflow_warnings
;
199 /* If a warning about undefined overflow is deferred, this is the
200 warning. Note that this may cause us to turn two warnings into
201 one, but that is fine since it is sufficient to only give one
202 warning per expression. */
204 static const char* fold_deferred_overflow_warning
;
206 /* If a warning about undefined overflow is deferred, this is the
207 level at which the warning should be emitted. */
209 static enum warn_strict_overflow_code fold_deferred_overflow_code
;
211 /* Start deferring overflow warnings. We could use a stack here to
212 permit nested calls, but at present it is not necessary. */
215 fold_defer_overflow_warnings (void)
217 ++fold_deferring_overflow_warnings
;
220 /* Stop deferring overflow warnings. If there is a pending warning,
221 and ISSUE is true, then issue the warning if appropriate. STMT is
222 the statement with which the warning should be associated (used for
223 location information); STMT may be NULL. CODE is the level of the
224 warning--a warn_strict_overflow_code value. This function will use
225 the smaller of CODE and the deferred code when deciding whether to
226 issue the warning. CODE may be zero to mean to always use the
230 fold_undefer_overflow_warnings (bool issue
, const gimple
*stmt
, int code
)
235 gcc_assert (fold_deferring_overflow_warnings
> 0);
236 --fold_deferring_overflow_warnings
;
237 if (fold_deferring_overflow_warnings
> 0)
239 if (fold_deferred_overflow_warning
!= NULL
241 && code
< (int) fold_deferred_overflow_code
)
242 fold_deferred_overflow_code
= (enum warn_strict_overflow_code
) code
;
246 warnmsg
= fold_deferred_overflow_warning
;
247 fold_deferred_overflow_warning
= NULL
;
249 if (!issue
|| warnmsg
== NULL
)
252 if (gimple_no_warning_p (stmt
))
255 /* Use the smallest code level when deciding to issue the
257 if (code
== 0 || code
> (int) fold_deferred_overflow_code
)
258 code
= fold_deferred_overflow_code
;
260 if (!issue_strict_overflow_warning (code
))
264 locus
= input_location
;
266 locus
= gimple_location (stmt
);
267 warning_at (locus
, OPT_Wstrict_overflow
, "%s", warnmsg
);
270 /* Stop deferring overflow warnings, ignoring any deferred
274 fold_undefer_and_ignore_overflow_warnings (void)
276 fold_undefer_overflow_warnings (false, NULL
, 0);
279 /* Whether we are deferring overflow warnings. */
282 fold_deferring_overflow_warnings_p (void)
284 return fold_deferring_overflow_warnings
> 0;
287 /* This is called when we fold something based on the fact that signed
288 overflow is undefined. */
291 fold_overflow_warning (const char* gmsgid
, enum warn_strict_overflow_code wc
)
293 if (fold_deferring_overflow_warnings
> 0)
295 if (fold_deferred_overflow_warning
== NULL
296 || wc
< fold_deferred_overflow_code
)
298 fold_deferred_overflow_warning
= gmsgid
;
299 fold_deferred_overflow_code
= wc
;
302 else if (issue_strict_overflow_warning (wc
))
303 warning (OPT_Wstrict_overflow
, gmsgid
);
306 /* Return true if the built-in mathematical function specified by CODE
307 is odd, i.e. -f(x) == f(-x). */
310 negate_mathfn_p (combined_fn fn
)
343 return !flag_rounding_math
;
351 /* Check whether we may negate an integer constant T without causing
355 may_negate_without_overflow_p (const_tree t
)
359 gcc_assert (TREE_CODE (t
) == INTEGER_CST
);
361 type
= TREE_TYPE (t
);
362 if (TYPE_UNSIGNED (type
))
365 return !wi::only_sign_bit_p (wi::to_wide (t
));
368 /* Determine whether an expression T can be cheaply negated using
369 the function negate_expr without introducing undefined overflow. */
372 negate_expr_p (tree t
)
379 type
= TREE_TYPE (t
);
382 switch (TREE_CODE (t
))
385 if (INTEGRAL_TYPE_P (type
) && TYPE_UNSIGNED (type
))
388 /* Check that -CST will not overflow type. */
389 return may_negate_without_overflow_p (t
);
391 return (INTEGRAL_TYPE_P (type
)
392 && TYPE_OVERFLOW_WRAPS (type
));
398 return !TYPE_OVERFLOW_SANITIZED (type
);
401 /* We want to canonicalize to positive real constants. Pretend
402 that only negative ones can be easily negated. */
403 return REAL_VALUE_NEGATIVE (TREE_REAL_CST (t
));
406 return negate_expr_p (TREE_REALPART (t
))
407 && negate_expr_p (TREE_IMAGPART (t
));
411 if (FLOAT_TYPE_P (TREE_TYPE (type
)) || TYPE_OVERFLOW_WRAPS (type
))
414 /* Steps don't prevent negation. */
415 unsigned int count
= vector_cst_encoded_nelts (t
);
416 for (unsigned int i
= 0; i
< count
; ++i
)
417 if (!negate_expr_p (VECTOR_CST_ENCODED_ELT (t
, i
)))
424 return negate_expr_p (TREE_OPERAND (t
, 0))
425 && negate_expr_p (TREE_OPERAND (t
, 1));
428 return negate_expr_p (TREE_OPERAND (t
, 0));
431 if (HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
432 || HONOR_SIGNED_ZEROS (element_mode (type
))
433 || (ANY_INTEGRAL_TYPE_P (type
)
434 && ! TYPE_OVERFLOW_WRAPS (type
)))
436 /* -(A + B) -> (-B) - A. */
437 if (negate_expr_p (TREE_OPERAND (t
, 1)))
439 /* -(A + B) -> (-A) - B. */
440 return negate_expr_p (TREE_OPERAND (t
, 0));
443 /* We can't turn -(A-B) into B-A when we honor signed zeros. */
444 return !HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
445 && !HONOR_SIGNED_ZEROS (element_mode (type
))
446 && (! ANY_INTEGRAL_TYPE_P (type
)
447 || TYPE_OVERFLOW_WRAPS (type
));
450 if (TYPE_UNSIGNED (type
))
452 /* INT_MIN/n * n doesn't overflow while negating one operand it does
453 if n is a (negative) power of two. */
454 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
455 && ! TYPE_OVERFLOW_WRAPS (TREE_TYPE (t
))
456 && ! ((TREE_CODE (TREE_OPERAND (t
, 0)) == INTEGER_CST
458 (wi::abs (wi::to_wide (TREE_OPERAND (t
, 0))))) != 1)
459 || (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
461 (wi::abs (wi::to_wide (TREE_OPERAND (t
, 1))))) != 1)))
467 if (! HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (TREE_TYPE (t
))))
468 return negate_expr_p (TREE_OPERAND (t
, 1))
469 || negate_expr_p (TREE_OPERAND (t
, 0));
475 if (TYPE_UNSIGNED (type
))
477 if (negate_expr_p (TREE_OPERAND (t
, 0)))
479 /* In general we can't negate B in A / B, because if A is INT_MIN and
480 B is 1, we may turn this into INT_MIN / -1 which is undefined
481 and actually traps on some architectures. */
482 if (! INTEGRAL_TYPE_P (TREE_TYPE (t
))
483 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (t
))
484 || (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
485 && ! integer_onep (TREE_OPERAND (t
, 1))))
486 return negate_expr_p (TREE_OPERAND (t
, 1));
490 /* Negate -((double)float) as (double)(-float). */
491 if (TREE_CODE (type
) == REAL_TYPE
)
493 tree tem
= strip_float_extensions (t
);
495 return negate_expr_p (tem
);
500 /* Negate -f(x) as f(-x). */
501 if (negate_mathfn_p (get_call_combined_fn (t
)))
502 return negate_expr_p (CALL_EXPR_ARG (t
, 0));
506 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
507 if (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
)
509 tree op1
= TREE_OPERAND (t
, 1);
510 if (wi::to_wide (op1
) == TYPE_PRECISION (type
) - 1)
521 /* Given T, an expression, return a folded tree for -T or NULL_TREE, if no
522 simplification is possible.
523 If negate_expr_p would return true for T, NULL_TREE will never be
527 fold_negate_expr_1 (location_t loc
, tree t
)
529 tree type
= TREE_TYPE (t
);
532 switch (TREE_CODE (t
))
534 /* Convert - (~A) to A + 1. */
536 if (INTEGRAL_TYPE_P (type
))
537 return fold_build2_loc (loc
, PLUS_EXPR
, type
, TREE_OPERAND (t
, 0),
538 build_one_cst (type
));
542 tem
= fold_negate_const (t
, type
);
543 if (TREE_OVERFLOW (tem
) == TREE_OVERFLOW (t
)
544 || (ANY_INTEGRAL_TYPE_P (type
)
545 && !TYPE_OVERFLOW_TRAPS (type
)
546 && TYPE_OVERFLOW_WRAPS (type
))
547 || (flag_sanitize
& SANITIZE_SI_OVERFLOW
) == 0)
554 tem
= fold_negate_const (t
, type
);
559 tree rpart
= fold_negate_expr (loc
, TREE_REALPART (t
));
560 tree ipart
= fold_negate_expr (loc
, TREE_IMAGPART (t
));
562 return build_complex (type
, rpart
, ipart
);
568 tree_vector_builder elts
;
569 elts
.new_unary_operation (type
, t
, true);
570 unsigned int count
= elts
.encoded_nelts ();
571 for (unsigned int i
= 0; i
< count
; ++i
)
573 tree elt
= fold_negate_expr (loc
, VECTOR_CST_ELT (t
, i
));
574 if (elt
== NULL_TREE
)
576 elts
.quick_push (elt
);
579 return elts
.build ();
583 if (negate_expr_p (t
))
584 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
585 fold_negate_expr (loc
, TREE_OPERAND (t
, 0)),
586 fold_negate_expr (loc
, TREE_OPERAND (t
, 1)));
590 if (negate_expr_p (t
))
591 return fold_build1_loc (loc
, CONJ_EXPR
, type
,
592 fold_negate_expr (loc
, TREE_OPERAND (t
, 0)));
596 if (!TYPE_OVERFLOW_SANITIZED (type
))
597 return TREE_OPERAND (t
, 0);
601 if (!HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
602 && !HONOR_SIGNED_ZEROS (element_mode (type
)))
604 /* -(A + B) -> (-B) - A. */
605 if (negate_expr_p (TREE_OPERAND (t
, 1)))
607 tem
= negate_expr (TREE_OPERAND (t
, 1));
608 return fold_build2_loc (loc
, MINUS_EXPR
, type
,
609 tem
, TREE_OPERAND (t
, 0));
612 /* -(A + B) -> (-A) - B. */
613 if (negate_expr_p (TREE_OPERAND (t
, 0)))
615 tem
= negate_expr (TREE_OPERAND (t
, 0));
616 return fold_build2_loc (loc
, MINUS_EXPR
, type
,
617 tem
, TREE_OPERAND (t
, 1));
623 /* - (A - B) -> B - A */
624 if (!HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
625 && !HONOR_SIGNED_ZEROS (element_mode (type
)))
626 return fold_build2_loc (loc
, MINUS_EXPR
, type
,
627 TREE_OPERAND (t
, 1), TREE_OPERAND (t
, 0));
631 if (TYPE_UNSIGNED (type
))
637 if (! HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
)))
639 tem
= TREE_OPERAND (t
, 1);
640 if (negate_expr_p (tem
))
641 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
642 TREE_OPERAND (t
, 0), negate_expr (tem
));
643 tem
= TREE_OPERAND (t
, 0);
644 if (negate_expr_p (tem
))
645 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
646 negate_expr (tem
), TREE_OPERAND (t
, 1));
653 if (TYPE_UNSIGNED (type
))
655 if (negate_expr_p (TREE_OPERAND (t
, 0)))
656 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
657 negate_expr (TREE_OPERAND (t
, 0)),
658 TREE_OPERAND (t
, 1));
659 /* In general we can't negate B in A / B, because if A is INT_MIN and
660 B is 1, we may turn this into INT_MIN / -1 which is undefined
661 and actually traps on some architectures. */
662 if ((! INTEGRAL_TYPE_P (TREE_TYPE (t
))
663 || TYPE_OVERFLOW_WRAPS (TREE_TYPE (t
))
664 || (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
665 && ! integer_onep (TREE_OPERAND (t
, 1))))
666 && negate_expr_p (TREE_OPERAND (t
, 1)))
667 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
669 negate_expr (TREE_OPERAND (t
, 1)));
673 /* Convert -((double)float) into (double)(-float). */
674 if (TREE_CODE (type
) == REAL_TYPE
)
676 tem
= strip_float_extensions (t
);
677 if (tem
!= t
&& negate_expr_p (tem
))
678 return fold_convert_loc (loc
, type
, negate_expr (tem
));
683 /* Negate -f(x) as f(-x). */
684 if (negate_mathfn_p (get_call_combined_fn (t
))
685 && negate_expr_p (CALL_EXPR_ARG (t
, 0)))
689 fndecl
= get_callee_fndecl (t
);
690 arg
= negate_expr (CALL_EXPR_ARG (t
, 0));
691 return build_call_expr_loc (loc
, fndecl
, 1, arg
);
696 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
697 if (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
)
699 tree op1
= TREE_OPERAND (t
, 1);
700 if (wi::to_wide (op1
) == TYPE_PRECISION (type
) - 1)
702 tree ntype
= TYPE_UNSIGNED (type
)
703 ? signed_type_for (type
)
704 : unsigned_type_for (type
);
705 tree temp
= fold_convert_loc (loc
, ntype
, TREE_OPERAND (t
, 0));
706 temp
= fold_build2_loc (loc
, RSHIFT_EXPR
, ntype
, temp
, op1
);
707 return fold_convert_loc (loc
, type
, temp
);
719 /* A wrapper for fold_negate_expr_1. */
722 fold_negate_expr (location_t loc
, tree t
)
724 tree type
= TREE_TYPE (t
);
726 tree tem
= fold_negate_expr_1 (loc
, t
);
727 if (tem
== NULL_TREE
)
729 return fold_convert_loc (loc
, type
, tem
);
732 /* Like fold_negate_expr, but return a NEGATE_EXPR tree, if T can not be
733 negated in a simpler way. Also allow for T to be NULL_TREE, in which case
745 loc
= EXPR_LOCATION (t
);
746 type
= TREE_TYPE (t
);
749 tem
= fold_negate_expr (loc
, t
);
751 tem
= build1_loc (loc
, NEGATE_EXPR
, TREE_TYPE (t
), t
);
752 return fold_convert_loc (loc
, type
, tem
);
755 /* Split a tree IN into a constant, literal and variable parts that could be
756 combined with CODE to make IN. "constant" means an expression with
757 TREE_CONSTANT but that isn't an actual constant. CODE must be a
758 commutative arithmetic operation. Store the constant part into *CONP,
759 the literal in *LITP and return the variable part. If a part isn't
760 present, set it to null. If the tree does not decompose in this way,
761 return the entire tree as the variable part and the other parts as null.
763 If CODE is PLUS_EXPR we also split trees that use MINUS_EXPR. In that
764 case, we negate an operand that was subtracted. Except if it is a
765 literal for which we use *MINUS_LITP instead.
767 If NEGATE_P is true, we are negating all of IN, again except a literal
768 for which we use *MINUS_LITP instead. If a variable part is of pointer
769 type, it is negated after converting to TYPE. This prevents us from
770 generating illegal MINUS pointer expression. LOC is the location of
771 the converted variable part.
773 If IN is itself a literal or constant, return it as appropriate.
775 Note that we do not guarantee that any of the three values will be the
776 same type as IN, but they will have the same signedness and mode. */
779 split_tree (tree in
, tree type
, enum tree_code code
,
780 tree
*minus_varp
, tree
*conp
, tree
*minus_conp
,
781 tree
*litp
, tree
*minus_litp
, int negate_p
)
790 /* Strip any conversions that don't change the machine mode or signedness. */
791 STRIP_SIGN_NOPS (in
);
793 if (TREE_CODE (in
) == INTEGER_CST
|| TREE_CODE (in
) == REAL_CST
794 || TREE_CODE (in
) == FIXED_CST
)
796 else if (TREE_CODE (in
) == code
797 || ((! FLOAT_TYPE_P (TREE_TYPE (in
)) || flag_associative_math
)
798 && ! SAT_FIXED_POINT_TYPE_P (TREE_TYPE (in
))
799 /* We can associate addition and subtraction together (even
800 though the C standard doesn't say so) for integers because
801 the value is not affected. For reals, the value might be
802 affected, so we can't. */
803 && ((code
== PLUS_EXPR
&& TREE_CODE (in
) == POINTER_PLUS_EXPR
)
804 || (code
== PLUS_EXPR
&& TREE_CODE (in
) == MINUS_EXPR
)
805 || (code
== MINUS_EXPR
806 && (TREE_CODE (in
) == PLUS_EXPR
807 || TREE_CODE (in
) == POINTER_PLUS_EXPR
)))))
809 tree op0
= TREE_OPERAND (in
, 0);
810 tree op1
= TREE_OPERAND (in
, 1);
811 int neg1_p
= TREE_CODE (in
) == MINUS_EXPR
;
812 int neg_litp_p
= 0, neg_conp_p
= 0, neg_var_p
= 0;
814 /* First see if either of the operands is a literal, then a constant. */
815 if (TREE_CODE (op0
) == INTEGER_CST
|| TREE_CODE (op0
) == REAL_CST
816 || TREE_CODE (op0
) == FIXED_CST
)
817 *litp
= op0
, op0
= 0;
818 else if (TREE_CODE (op1
) == INTEGER_CST
|| TREE_CODE (op1
) == REAL_CST
819 || TREE_CODE (op1
) == FIXED_CST
)
820 *litp
= op1
, neg_litp_p
= neg1_p
, op1
= 0;
822 if (op0
!= 0 && TREE_CONSTANT (op0
))
823 *conp
= op0
, op0
= 0;
824 else if (op1
!= 0 && TREE_CONSTANT (op1
))
825 *conp
= op1
, neg_conp_p
= neg1_p
, op1
= 0;
827 /* If we haven't dealt with either operand, this is not a case we can
828 decompose. Otherwise, VAR is either of the ones remaining, if any. */
829 if (op0
!= 0 && op1
!= 0)
834 var
= op1
, neg_var_p
= neg1_p
;
836 /* Now do any needed negations. */
838 *minus_litp
= *litp
, *litp
= 0;
839 if (neg_conp_p
&& *conp
)
840 *minus_conp
= *conp
, *conp
= 0;
841 if (neg_var_p
&& var
)
842 *minus_varp
= var
, var
= 0;
844 else if (TREE_CONSTANT (in
))
846 else if (TREE_CODE (in
) == BIT_NOT_EXPR
847 && code
== PLUS_EXPR
)
849 /* -1 - X is folded to ~X, undo that here. Do _not_ do this
850 when IN is constant. */
851 *litp
= build_minus_one_cst (type
);
852 *minus_varp
= TREE_OPERAND (in
, 0);
860 *minus_litp
= *litp
, *litp
= 0;
861 else if (*minus_litp
)
862 *litp
= *minus_litp
, *minus_litp
= 0;
864 *minus_conp
= *conp
, *conp
= 0;
865 else if (*minus_conp
)
866 *conp
= *minus_conp
, *minus_conp
= 0;
868 *minus_varp
= var
, var
= 0;
869 else if (*minus_varp
)
870 var
= *minus_varp
, *minus_varp
= 0;
874 && TREE_OVERFLOW_P (*litp
))
875 *litp
= drop_tree_overflow (*litp
);
877 && TREE_OVERFLOW_P (*minus_litp
))
878 *minus_litp
= drop_tree_overflow (*minus_litp
);
883 /* Re-associate trees split by the above function. T1 and T2 are
884 either expressions to associate or null. Return the new
885 expression, if any. LOC is the location of the new expression. If
886 we build an operation, do it in TYPE and with CODE. */
889 associate_trees (location_t loc
, tree t1
, tree t2
, enum tree_code code
, tree type
)
893 gcc_assert (t2
== 0 || code
!= MINUS_EXPR
);
899 /* If either input is CODE, a PLUS_EXPR, or a MINUS_EXPR, don't
900 try to fold this since we will have infinite recursion. But do
901 deal with any NEGATE_EXPRs. */
902 if (TREE_CODE (t1
) == code
|| TREE_CODE (t2
) == code
903 || TREE_CODE (t1
) == PLUS_EXPR
|| TREE_CODE (t2
) == PLUS_EXPR
904 || TREE_CODE (t1
) == MINUS_EXPR
|| TREE_CODE (t2
) == MINUS_EXPR
)
906 if (code
== PLUS_EXPR
)
908 if (TREE_CODE (t1
) == NEGATE_EXPR
)
909 return build2_loc (loc
, MINUS_EXPR
, type
,
910 fold_convert_loc (loc
, type
, t2
),
911 fold_convert_loc (loc
, type
,
912 TREE_OPERAND (t1
, 0)));
913 else if (TREE_CODE (t2
) == NEGATE_EXPR
)
914 return build2_loc (loc
, MINUS_EXPR
, type
,
915 fold_convert_loc (loc
, type
, t1
),
916 fold_convert_loc (loc
, type
,
917 TREE_OPERAND (t2
, 0)));
918 else if (integer_zerop (t2
))
919 return fold_convert_loc (loc
, type
, t1
);
921 else if (code
== MINUS_EXPR
)
923 if (integer_zerop (t2
))
924 return fold_convert_loc (loc
, type
, t1
);
927 return build2_loc (loc
, code
, type
, fold_convert_loc (loc
, type
, t1
),
928 fold_convert_loc (loc
, type
, t2
));
931 return fold_build2_loc (loc
, code
, type
, fold_convert_loc (loc
, type
, t1
),
932 fold_convert_loc (loc
, type
, t2
));
935 /* Check whether TYPE1 and TYPE2 are equivalent integer types, suitable
936 for use in int_const_binop, size_binop and size_diffop. */
939 int_binop_types_match_p (enum tree_code code
, const_tree type1
, const_tree type2
)
941 if (!INTEGRAL_TYPE_P (type1
) && !POINTER_TYPE_P (type1
))
943 if (!INTEGRAL_TYPE_P (type2
) && !POINTER_TYPE_P (type2
))
958 return TYPE_UNSIGNED (type1
) == TYPE_UNSIGNED (type2
)
959 && TYPE_PRECISION (type1
) == TYPE_PRECISION (type2
)
960 && TYPE_MODE (type1
) == TYPE_MODE (type2
);
963 /* Subroutine of int_const_binop_1 that handles two INTEGER_CSTs. */
966 int_const_binop_2 (enum tree_code code
, const_tree parg1
, const_tree parg2
,
971 tree type
= TREE_TYPE (parg1
);
972 signop sign
= TYPE_SIGN (type
);
973 bool overflow
= false;
975 wi::tree_to_wide_ref arg1
= wi::to_wide (parg1
);
976 wide_int arg2
= wi::to_wide (parg2
, TYPE_PRECISION (type
));
981 res
= wi::bit_or (arg1
, arg2
);
985 res
= wi::bit_xor (arg1
, arg2
);
989 res
= wi::bit_and (arg1
, arg2
);
994 if (wi::neg_p (arg2
))
997 if (code
== RSHIFT_EXPR
)
1003 if (code
== RSHIFT_EXPR
)
1004 /* It's unclear from the C standard whether shifts can overflow.
1005 The following code ignores overflow; perhaps a C standard
1006 interpretation ruling is needed. */
1007 res
= wi::rshift (arg1
, arg2
, sign
);
1009 res
= wi::lshift (arg1
, arg2
);
1014 if (wi::neg_p (arg2
))
1017 if (code
== RROTATE_EXPR
)
1018 code
= LROTATE_EXPR
;
1020 code
= RROTATE_EXPR
;
1023 if (code
== RROTATE_EXPR
)
1024 res
= wi::rrotate (arg1
, arg2
);
1026 res
= wi::lrotate (arg1
, arg2
);
1030 res
= wi::add (arg1
, arg2
, sign
, &overflow
);
1034 res
= wi::sub (arg1
, arg2
, sign
, &overflow
);
1038 res
= wi::mul (arg1
, arg2
, sign
, &overflow
);
1041 case MULT_HIGHPART_EXPR
:
1042 res
= wi::mul_high (arg1
, arg2
, sign
);
1045 case TRUNC_DIV_EXPR
:
1046 case EXACT_DIV_EXPR
:
1049 res
= wi::div_trunc (arg1
, arg2
, sign
, &overflow
);
1052 case FLOOR_DIV_EXPR
:
1055 res
= wi::div_floor (arg1
, arg2
, sign
, &overflow
);
1061 res
= wi::div_ceil (arg1
, arg2
, sign
, &overflow
);
1064 case ROUND_DIV_EXPR
:
1067 res
= wi::div_round (arg1
, arg2
, sign
, &overflow
);
1070 case TRUNC_MOD_EXPR
:
1073 res
= wi::mod_trunc (arg1
, arg2
, sign
, &overflow
);
1076 case FLOOR_MOD_EXPR
:
1079 res
= wi::mod_floor (arg1
, arg2
, sign
, &overflow
);
1085 res
= wi::mod_ceil (arg1
, arg2
, sign
, &overflow
);
1088 case ROUND_MOD_EXPR
:
1091 res
= wi::mod_round (arg1
, arg2
, sign
, &overflow
);
1095 res
= wi::min (arg1
, arg2
, sign
);
1099 res
= wi::max (arg1
, arg2
, sign
);
1106 t
= force_fit_type (type
, res
, overflowable
,
1107 (((sign
== SIGNED
|| overflowable
== -1)
1109 | TREE_OVERFLOW (parg1
) | TREE_OVERFLOW (parg2
)));
1114 /* Combine two integer constants PARG1 and PARG2 under operation CODE
1115 to produce a new constant. Return NULL_TREE if we don't know how
1116 to evaluate CODE at compile-time. */
1119 int_const_binop_1 (enum tree_code code
, const_tree arg1
, const_tree arg2
,
1122 if (TREE_CODE (arg1
) == INTEGER_CST
&& TREE_CODE (arg2
) == INTEGER_CST
)
1123 return int_const_binop_2 (code
, arg1
, arg2
, overflowable
);
1125 gcc_assert (NUM_POLY_INT_COEFFS
!= 1);
1127 if (poly_int_tree_p (arg1
) && poly_int_tree_p (arg2
))
1131 tree type
= TREE_TYPE (arg1
);
1132 signop sign
= TYPE_SIGN (type
);
1136 res
= wi::add (wi::to_poly_wide (arg1
),
1137 wi::to_poly_wide (arg2
), sign
, &overflow
);
1141 res
= wi::sub (wi::to_poly_wide (arg1
),
1142 wi::to_poly_wide (arg2
), sign
, &overflow
);
1146 if (TREE_CODE (arg2
) == INTEGER_CST
)
1147 res
= wi::mul (wi::to_poly_wide (arg1
),
1148 wi::to_wide (arg2
), sign
, &overflow
);
1149 else if (TREE_CODE (arg1
) == INTEGER_CST
)
1150 res
= wi::mul (wi::to_poly_wide (arg2
),
1151 wi::to_wide (arg1
), sign
, &overflow
);
1157 if (TREE_CODE (arg2
) == INTEGER_CST
)
1158 res
= wi::to_poly_wide (arg1
) << wi::to_wide (arg2
);
1164 if (TREE_CODE (arg2
) != INTEGER_CST
1165 || !can_ior_p (wi::to_poly_wide (arg1
), wi::to_wide (arg2
),
1173 return force_fit_type (type
, res
, overflowable
,
1174 (((sign
== SIGNED
|| overflowable
== -1)
1176 | TREE_OVERFLOW (arg1
) | TREE_OVERFLOW (arg2
)));
1183 int_const_binop (enum tree_code code
, const_tree arg1
, const_tree arg2
)
1185 return int_const_binop_1 (code
, arg1
, arg2
, 1);
1188 /* Return true if binary operation OP distributes over addition in operand
1189 OPNO, with the other operand being held constant. OPNO counts from 1. */
1192 distributes_over_addition_p (tree_code op
, int opno
)
1209 /* Combine two constants ARG1 and ARG2 under operation CODE to produce a new
1210 constant. We assume ARG1 and ARG2 have the same data type, or at least
1211 are the same kind of constant and the same machine mode. Return zero if
1212 combining the constants is not allowed in the current operating mode. */
1215 const_binop (enum tree_code code
, tree arg1
, tree arg2
)
1217 /* Sanity check for the recursive cases. */
1224 if (poly_int_tree_p (arg1
) && poly_int_tree_p (arg2
))
1226 if (code
== POINTER_PLUS_EXPR
)
1227 return int_const_binop (PLUS_EXPR
,
1228 arg1
, fold_convert (TREE_TYPE (arg1
), arg2
));
1230 return int_const_binop (code
, arg1
, arg2
);
1233 if (TREE_CODE (arg1
) == REAL_CST
&& TREE_CODE (arg2
) == REAL_CST
)
1238 REAL_VALUE_TYPE value
;
1239 REAL_VALUE_TYPE result
;
1243 /* The following codes are handled by real_arithmetic. */
1258 d1
= TREE_REAL_CST (arg1
);
1259 d2
= TREE_REAL_CST (arg2
);
1261 type
= TREE_TYPE (arg1
);
1262 mode
= TYPE_MODE (type
);
1264 /* Don't perform operation if we honor signaling NaNs and
1265 either operand is a signaling NaN. */
1266 if (HONOR_SNANS (mode
)
1267 && (REAL_VALUE_ISSIGNALING_NAN (d1
)
1268 || REAL_VALUE_ISSIGNALING_NAN (d2
)))
1271 /* Don't perform operation if it would raise a division
1272 by zero exception. */
1273 if (code
== RDIV_EXPR
1274 && real_equal (&d2
, &dconst0
)
1275 && (flag_trapping_math
|| ! MODE_HAS_INFINITIES (mode
)))
1278 /* If either operand is a NaN, just return it. Otherwise, set up
1279 for floating-point trap; we return an overflow. */
1280 if (REAL_VALUE_ISNAN (d1
))
1282 /* Make resulting NaN value to be qNaN when flag_signaling_nans
1285 t
= build_real (type
, d1
);
1288 else if (REAL_VALUE_ISNAN (d2
))
1290 /* Make resulting NaN value to be qNaN when flag_signaling_nans
1293 t
= build_real (type
, d2
);
1297 inexact
= real_arithmetic (&value
, code
, &d1
, &d2
);
1298 real_convert (&result
, mode
, &value
);
1300 /* Don't constant fold this floating point operation if
1301 the result has overflowed and flag_trapping_math. */
1302 if (flag_trapping_math
1303 && MODE_HAS_INFINITIES (mode
)
1304 && REAL_VALUE_ISINF (result
)
1305 && !REAL_VALUE_ISINF (d1
)
1306 && !REAL_VALUE_ISINF (d2
))
1309 /* Don't constant fold this floating point operation if the
1310 result may dependent upon the run-time rounding mode and
1311 flag_rounding_math is set, or if GCC's software emulation
1312 is unable to accurately represent the result. */
1313 if ((flag_rounding_math
1314 || (MODE_COMPOSITE_P (mode
) && !flag_unsafe_math_optimizations
))
1315 && (inexact
|| !real_identical (&result
, &value
)))
1318 t
= build_real (type
, result
);
1320 TREE_OVERFLOW (t
) = TREE_OVERFLOW (arg1
) | TREE_OVERFLOW (arg2
);
1324 if (TREE_CODE (arg1
) == FIXED_CST
)
1326 FIXED_VALUE_TYPE f1
;
1327 FIXED_VALUE_TYPE f2
;
1328 FIXED_VALUE_TYPE result
;
1333 /* The following codes are handled by fixed_arithmetic. */
1339 case TRUNC_DIV_EXPR
:
1340 if (TREE_CODE (arg2
) != FIXED_CST
)
1342 f2
= TREE_FIXED_CST (arg2
);
1348 if (TREE_CODE (arg2
) != INTEGER_CST
)
1350 wi::tree_to_wide_ref w2
= wi::to_wide (arg2
);
1351 f2
.data
.high
= w2
.elt (1);
1352 f2
.data
.low
= w2
.ulow ();
1361 f1
= TREE_FIXED_CST (arg1
);
1362 type
= TREE_TYPE (arg1
);
1363 sat_p
= TYPE_SATURATING (type
);
1364 overflow_p
= fixed_arithmetic (&result
, code
, &f1
, &f2
, sat_p
);
1365 t
= build_fixed (type
, result
);
1366 /* Propagate overflow flags. */
1367 if (overflow_p
| TREE_OVERFLOW (arg1
) | TREE_OVERFLOW (arg2
))
1368 TREE_OVERFLOW (t
) = 1;
1372 if (TREE_CODE (arg1
) == COMPLEX_CST
&& TREE_CODE (arg2
) == COMPLEX_CST
)
1374 tree type
= TREE_TYPE (arg1
);
1375 tree r1
= TREE_REALPART (arg1
);
1376 tree i1
= TREE_IMAGPART (arg1
);
1377 tree r2
= TREE_REALPART (arg2
);
1378 tree i2
= TREE_IMAGPART (arg2
);
1385 real
= const_binop (code
, r1
, r2
);
1386 imag
= const_binop (code
, i1
, i2
);
1390 if (COMPLEX_FLOAT_TYPE_P (type
))
1391 return do_mpc_arg2 (arg1
, arg2
, type
,
1392 /* do_nonfinite= */ folding_initializer
,
1395 real
= const_binop (MINUS_EXPR
,
1396 const_binop (MULT_EXPR
, r1
, r2
),
1397 const_binop (MULT_EXPR
, i1
, i2
));
1398 imag
= const_binop (PLUS_EXPR
,
1399 const_binop (MULT_EXPR
, r1
, i2
),
1400 const_binop (MULT_EXPR
, i1
, r2
));
1404 if (COMPLEX_FLOAT_TYPE_P (type
))
1405 return do_mpc_arg2 (arg1
, arg2
, type
,
1406 /* do_nonfinite= */ folding_initializer
,
1409 case TRUNC_DIV_EXPR
:
1411 case FLOOR_DIV_EXPR
:
1412 case ROUND_DIV_EXPR
:
1413 if (flag_complex_method
== 0)
1415 /* Keep this algorithm in sync with
1416 tree-complex.c:expand_complex_div_straight().
1418 Expand complex division to scalars, straightforward algorithm.
1419 a / b = ((ar*br + ai*bi)/t) + i((ai*br - ar*bi)/t)
1423 = const_binop (PLUS_EXPR
,
1424 const_binop (MULT_EXPR
, r2
, r2
),
1425 const_binop (MULT_EXPR
, i2
, i2
));
1427 = const_binop (PLUS_EXPR
,
1428 const_binop (MULT_EXPR
, r1
, r2
),
1429 const_binop (MULT_EXPR
, i1
, i2
));
1431 = const_binop (MINUS_EXPR
,
1432 const_binop (MULT_EXPR
, i1
, r2
),
1433 const_binop (MULT_EXPR
, r1
, i2
));
1435 real
= const_binop (code
, t1
, magsquared
);
1436 imag
= const_binop (code
, t2
, magsquared
);
1440 /* Keep this algorithm in sync with
1441 tree-complex.c:expand_complex_div_wide().
1443 Expand complex division to scalars, modified algorithm to minimize
1444 overflow with wide input ranges. */
1445 tree compare
= fold_build2 (LT_EXPR
, boolean_type_node
,
1446 fold_abs_const (r2
, TREE_TYPE (type
)),
1447 fold_abs_const (i2
, TREE_TYPE (type
)));
1449 if (integer_nonzerop (compare
))
1451 /* In the TRUE branch, we compute
1453 div = (br * ratio) + bi;
1454 tr = (ar * ratio) + ai;
1455 ti = (ai * ratio) - ar;
1458 tree ratio
= const_binop (code
, r2
, i2
);
1459 tree div
= const_binop (PLUS_EXPR
, i2
,
1460 const_binop (MULT_EXPR
, r2
, ratio
));
1461 real
= const_binop (MULT_EXPR
, r1
, ratio
);
1462 real
= const_binop (PLUS_EXPR
, real
, i1
);
1463 real
= const_binop (code
, real
, div
);
1465 imag
= const_binop (MULT_EXPR
, i1
, ratio
);
1466 imag
= const_binop (MINUS_EXPR
, imag
, r1
);
1467 imag
= const_binop (code
, imag
, div
);
1471 /* In the FALSE branch, we compute
1473 divisor = (d * ratio) + c;
1474 tr = (b * ratio) + a;
1475 ti = b - (a * ratio);
1478 tree ratio
= const_binop (code
, i2
, r2
);
1479 tree div
= const_binop (PLUS_EXPR
, r2
,
1480 const_binop (MULT_EXPR
, i2
, ratio
));
1482 real
= const_binop (MULT_EXPR
, i1
, ratio
);
1483 real
= const_binop (PLUS_EXPR
, real
, r1
);
1484 real
= const_binop (code
, real
, div
);
1486 imag
= const_binop (MULT_EXPR
, r1
, ratio
);
1487 imag
= const_binop (MINUS_EXPR
, i1
, imag
);
1488 imag
= const_binop (code
, imag
, div
);
1498 return build_complex (type
, real
, imag
);
1501 if (TREE_CODE (arg1
) == VECTOR_CST
1502 && TREE_CODE (arg2
) == VECTOR_CST
1503 && (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg1
))
1504 == TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg2
))))
1506 tree type
= TREE_TYPE (arg1
);
1508 if (VECTOR_CST_STEPPED_P (arg1
)
1509 && VECTOR_CST_STEPPED_P (arg2
))
1510 /* We can operate directly on the encoding if:
1512 a3 - a2 == a2 - a1 && b3 - b2 == b2 - b1
1514 (a3 op b3) - (a2 op b2) == (a2 op b2) - (a1 op b1)
1516 Addition and subtraction are the supported operators
1517 for which this is true. */
1518 step_ok_p
= (code
== PLUS_EXPR
|| code
== MINUS_EXPR
);
1519 else if (VECTOR_CST_STEPPED_P (arg1
))
1520 /* We can operate directly on stepped encodings if:
1524 (a3 op c) - (a2 op c) == (a2 op c) - (a1 op c)
1526 which is true if (x -> x op c) distributes over addition. */
1527 step_ok_p
= distributes_over_addition_p (code
, 1);
1529 /* Similarly in reverse. */
1530 step_ok_p
= distributes_over_addition_p (code
, 2);
1531 tree_vector_builder elts
;
1532 if (!elts
.new_binary_operation (type
, arg1
, arg2
, step_ok_p
))
1534 unsigned int count
= elts
.encoded_nelts ();
1535 for (unsigned int i
= 0; i
< count
; ++i
)
1537 tree elem1
= VECTOR_CST_ELT (arg1
, i
);
1538 tree elem2
= VECTOR_CST_ELT (arg2
, i
);
1540 tree elt
= const_binop (code
, elem1
, elem2
);
1542 /* It is possible that const_binop cannot handle the given
1543 code and return NULL_TREE */
1544 if (elt
== NULL_TREE
)
1546 elts
.quick_push (elt
);
1549 return elts
.build ();
1552 /* Shifts allow a scalar offset for a vector. */
1553 if (TREE_CODE (arg1
) == VECTOR_CST
1554 && TREE_CODE (arg2
) == INTEGER_CST
)
1556 tree type
= TREE_TYPE (arg1
);
1557 bool step_ok_p
= distributes_over_addition_p (code
, 1);
1558 tree_vector_builder elts
;
1559 if (!elts
.new_unary_operation (type
, arg1
, step_ok_p
))
1561 unsigned int count
= elts
.encoded_nelts ();
1562 for (unsigned int i
= 0; i
< count
; ++i
)
1564 tree elem1
= VECTOR_CST_ELT (arg1
, i
);
1566 tree elt
= const_binop (code
, elem1
, arg2
);
1568 /* It is possible that const_binop cannot handle the given
1569 code and return NULL_TREE. */
1570 if (elt
== NULL_TREE
)
1572 elts
.quick_push (elt
);
1575 return elts
.build ();
1580 /* Overload that adds a TYPE parameter to be able to dispatch
1581 to fold_relational_const. */
1584 const_binop (enum tree_code code
, tree type
, tree arg1
, tree arg2
)
1586 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
1587 return fold_relational_const (code
, type
, arg1
, arg2
);
1589 /* ??? Until we make the const_binop worker take the type of the
1590 result as argument put those cases that need it here. */
1593 case VEC_SERIES_EXPR
:
1594 if (CONSTANT_CLASS_P (arg1
)
1595 && CONSTANT_CLASS_P (arg2
))
1596 return build_vec_series (type
, arg1
, arg2
);
1600 if ((TREE_CODE (arg1
) == REAL_CST
1601 && TREE_CODE (arg2
) == REAL_CST
)
1602 || (TREE_CODE (arg1
) == INTEGER_CST
1603 && TREE_CODE (arg2
) == INTEGER_CST
))
1604 return build_complex (type
, arg1
, arg2
);
1607 case POINTER_DIFF_EXPR
:
1608 if (TREE_CODE (arg1
) == INTEGER_CST
&& TREE_CODE (arg2
) == INTEGER_CST
)
1610 offset_int res
= wi::sub (wi::to_offset (arg1
),
1611 wi::to_offset (arg2
));
1612 return force_fit_type (type
, res
, 1,
1613 TREE_OVERFLOW (arg1
) | TREE_OVERFLOW (arg2
));
1617 case VEC_PACK_TRUNC_EXPR
:
1618 case VEC_PACK_FIX_TRUNC_EXPR
:
1620 unsigned int out_nelts
, in_nelts
, i
;
1622 if (TREE_CODE (arg1
) != VECTOR_CST
1623 || TREE_CODE (arg2
) != VECTOR_CST
)
1626 in_nelts
= VECTOR_CST_NELTS (arg1
);
1627 out_nelts
= in_nelts
* 2;
1628 gcc_assert (in_nelts
== VECTOR_CST_NELTS (arg2
)
1629 && out_nelts
== TYPE_VECTOR_SUBPARTS (type
));
1631 tree_vector_builder
elts (type
, out_nelts
, 1);
1632 for (i
= 0; i
< out_nelts
; i
++)
1634 tree elt
= (i
< in_nelts
1635 ? VECTOR_CST_ELT (arg1
, i
)
1636 : VECTOR_CST_ELT (arg2
, i
- in_nelts
));
1637 elt
= fold_convert_const (code
== VEC_PACK_TRUNC_EXPR
1638 ? NOP_EXPR
: FIX_TRUNC_EXPR
,
1639 TREE_TYPE (type
), elt
);
1640 if (elt
== NULL_TREE
|| !CONSTANT_CLASS_P (elt
))
1642 elts
.quick_push (elt
);
1645 return elts
.build ();
1648 case VEC_WIDEN_MULT_LO_EXPR
:
1649 case VEC_WIDEN_MULT_HI_EXPR
:
1650 case VEC_WIDEN_MULT_EVEN_EXPR
:
1651 case VEC_WIDEN_MULT_ODD_EXPR
:
1653 unsigned int out_nelts
, in_nelts
, out
, ofs
, scale
;
1655 if (TREE_CODE (arg1
) != VECTOR_CST
|| TREE_CODE (arg2
) != VECTOR_CST
)
1658 in_nelts
= VECTOR_CST_NELTS (arg1
);
1659 out_nelts
= in_nelts
/ 2;
1660 gcc_assert (in_nelts
== VECTOR_CST_NELTS (arg2
)
1661 && out_nelts
== TYPE_VECTOR_SUBPARTS (type
));
1663 if (code
== VEC_WIDEN_MULT_LO_EXPR
)
1664 scale
= 0, ofs
= BYTES_BIG_ENDIAN
? out_nelts
: 0;
1665 else if (code
== VEC_WIDEN_MULT_HI_EXPR
)
1666 scale
= 0, ofs
= BYTES_BIG_ENDIAN
? 0 : out_nelts
;
1667 else if (code
== VEC_WIDEN_MULT_EVEN_EXPR
)
1669 else /* if (code == VEC_WIDEN_MULT_ODD_EXPR) */
1672 tree_vector_builder
elts (type
, out_nelts
, 1);
1673 for (out
= 0; out
< out_nelts
; out
++)
1675 unsigned int in
= (out
<< scale
) + ofs
;
1676 tree t1
= fold_convert_const (NOP_EXPR
, TREE_TYPE (type
),
1677 VECTOR_CST_ELT (arg1
, in
));
1678 tree t2
= fold_convert_const (NOP_EXPR
, TREE_TYPE (type
),
1679 VECTOR_CST_ELT (arg2
, in
));
1681 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
1683 tree elt
= const_binop (MULT_EXPR
, t1
, t2
);
1684 if (elt
== NULL_TREE
|| !CONSTANT_CLASS_P (elt
))
1686 elts
.quick_push (elt
);
1689 return elts
.build ();
1695 if (TREE_CODE_CLASS (code
) != tcc_binary
)
1698 /* Make sure type and arg0 have the same saturating flag. */
1699 gcc_checking_assert (TYPE_SATURATING (type
)
1700 == TYPE_SATURATING (TREE_TYPE (arg1
)));
1702 return const_binop (code
, arg1
, arg2
);
1705 /* Compute CODE ARG1 with resulting type TYPE with ARG1 being constant.
1706 Return zero if computing the constants is not possible. */
1709 const_unop (enum tree_code code
, tree type
, tree arg0
)
1711 /* Don't perform the operation, other than NEGATE and ABS, if
1712 flag_signaling_nans is on and the operand is a signaling NaN. */
1713 if (TREE_CODE (arg0
) == REAL_CST
1714 && HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg0
)))
1715 && REAL_VALUE_ISSIGNALING_NAN (TREE_REAL_CST (arg0
))
1716 && code
!= NEGATE_EXPR
1717 && code
!= ABS_EXPR
)
1724 case FIX_TRUNC_EXPR
:
1725 case FIXED_CONVERT_EXPR
:
1726 return fold_convert_const (code
, type
, arg0
);
1728 case ADDR_SPACE_CONVERT_EXPR
:
1729 /* If the source address is 0, and the source address space
1730 cannot have a valid object at 0, fold to dest type null. */
1731 if (integer_zerop (arg0
)
1732 && !(targetm
.addr_space
.zero_address_valid
1733 (TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (arg0
))))))
1734 return fold_convert_const (code
, type
, arg0
);
1737 case VIEW_CONVERT_EXPR
:
1738 return fold_view_convert_expr (type
, arg0
);
1742 /* Can't call fold_negate_const directly here as that doesn't
1743 handle all cases and we might not be able to negate some
1745 tree tem
= fold_negate_expr (UNKNOWN_LOCATION
, arg0
);
1746 if (tem
&& CONSTANT_CLASS_P (tem
))
1752 if (TREE_CODE (arg0
) == INTEGER_CST
|| TREE_CODE (arg0
) == REAL_CST
)
1753 return fold_abs_const (arg0
, type
);
1757 if (TREE_CODE (arg0
) == COMPLEX_CST
)
1759 tree ipart
= fold_negate_const (TREE_IMAGPART (arg0
),
1761 return build_complex (type
, TREE_REALPART (arg0
), ipart
);
1766 if (TREE_CODE (arg0
) == INTEGER_CST
)
1767 return fold_not_const (arg0
, type
);
1768 else if (POLY_INT_CST_P (arg0
))
1769 return wide_int_to_tree (type
, -poly_int_cst_value (arg0
));
1770 /* Perform BIT_NOT_EXPR on each element individually. */
1771 else if (TREE_CODE (arg0
) == VECTOR_CST
)
1775 /* This can cope with stepped encodings because ~x == -1 - x. */
1776 tree_vector_builder elements
;
1777 elements
.new_unary_operation (type
, arg0
, true);
1778 unsigned int i
, count
= elements
.encoded_nelts ();
1779 for (i
= 0; i
< count
; ++i
)
1781 elem
= VECTOR_CST_ELT (arg0
, i
);
1782 elem
= const_unop (BIT_NOT_EXPR
, TREE_TYPE (type
), elem
);
1783 if (elem
== NULL_TREE
)
1785 elements
.quick_push (elem
);
1788 return elements
.build ();
1792 case TRUTH_NOT_EXPR
:
1793 if (TREE_CODE (arg0
) == INTEGER_CST
)
1794 return constant_boolean_node (integer_zerop (arg0
), type
);
1798 if (TREE_CODE (arg0
) == COMPLEX_CST
)
1799 return fold_convert (type
, TREE_REALPART (arg0
));
1803 if (TREE_CODE (arg0
) == COMPLEX_CST
)
1804 return fold_convert (type
, TREE_IMAGPART (arg0
));
1807 case VEC_UNPACK_LO_EXPR
:
1808 case VEC_UNPACK_HI_EXPR
:
1809 case VEC_UNPACK_FLOAT_LO_EXPR
:
1810 case VEC_UNPACK_FLOAT_HI_EXPR
:
1812 unsigned int out_nelts
, in_nelts
, i
;
1813 enum tree_code subcode
;
1815 if (TREE_CODE (arg0
) != VECTOR_CST
)
1818 in_nelts
= VECTOR_CST_NELTS (arg0
);
1819 out_nelts
= in_nelts
/ 2;
1820 gcc_assert (out_nelts
== TYPE_VECTOR_SUBPARTS (type
));
1822 unsigned int offset
= 0;
1823 if ((!BYTES_BIG_ENDIAN
) ^ (code
== VEC_UNPACK_LO_EXPR
1824 || code
== VEC_UNPACK_FLOAT_LO_EXPR
))
1827 if (code
== VEC_UNPACK_LO_EXPR
|| code
== VEC_UNPACK_HI_EXPR
)
1830 subcode
= FLOAT_EXPR
;
1832 tree_vector_builder
elts (type
, out_nelts
, 1);
1833 for (i
= 0; i
< out_nelts
; i
++)
1835 tree elt
= fold_convert_const (subcode
, TREE_TYPE (type
),
1836 VECTOR_CST_ELT (arg0
, i
+ offset
));
1837 if (elt
== NULL_TREE
|| !CONSTANT_CLASS_P (elt
))
1839 elts
.quick_push (elt
);
1842 return elts
.build ();
1845 case VEC_DUPLICATE_EXPR
:
1846 if (CONSTANT_CLASS_P (arg0
))
1847 return build_vector_from_val (type
, arg0
);
1857 /* Create a sizetype INT_CST node with NUMBER sign extended. KIND
1858 indicates which particular sizetype to create. */
1861 size_int_kind (poly_int64 number
, enum size_type_kind kind
)
1863 return build_int_cst (sizetype_tab
[(int) kind
], number
);
1866 /* Combine operands OP1 and OP2 with arithmetic operation CODE. CODE
1867 is a tree code. The type of the result is taken from the operands.
1868 Both must be equivalent integer types, ala int_binop_types_match_p.
1869 If the operands are constant, so is the result. */
1872 size_binop_loc (location_t loc
, enum tree_code code
, tree arg0
, tree arg1
)
1874 tree type
= TREE_TYPE (arg0
);
1876 if (arg0
== error_mark_node
|| arg1
== error_mark_node
)
1877 return error_mark_node
;
1879 gcc_assert (int_binop_types_match_p (code
, TREE_TYPE (arg0
),
1882 /* Handle the special case of two poly_int constants faster. */
1883 if (poly_int_tree_p (arg0
) && poly_int_tree_p (arg1
))
1885 /* And some specific cases even faster than that. */
1886 if (code
== PLUS_EXPR
)
1888 if (integer_zerop (arg0
) && !TREE_OVERFLOW (arg0
))
1890 if (integer_zerop (arg1
) && !TREE_OVERFLOW (arg1
))
1893 else if (code
== MINUS_EXPR
)
1895 if (integer_zerop (arg1
) && !TREE_OVERFLOW (arg1
))
1898 else if (code
== MULT_EXPR
)
1900 if (integer_onep (arg0
) && !TREE_OVERFLOW (arg0
))
1904 /* Handle general case of two integer constants. For sizetype
1905 constant calculations we always want to know about overflow,
1906 even in the unsigned case. */
1907 tree res
= int_const_binop_1 (code
, arg0
, arg1
, -1);
1908 if (res
!= NULL_TREE
)
1912 return fold_build2_loc (loc
, code
, type
, arg0
, arg1
);
1915 /* Given two values, either both of sizetype or both of bitsizetype,
1916 compute the difference between the two values. Return the value
1917 in signed type corresponding to the type of the operands. */
1920 size_diffop_loc (location_t loc
, tree arg0
, tree arg1
)
1922 tree type
= TREE_TYPE (arg0
);
1925 gcc_assert (int_binop_types_match_p (MINUS_EXPR
, TREE_TYPE (arg0
),
1928 /* If the type is already signed, just do the simple thing. */
1929 if (!TYPE_UNSIGNED (type
))
1930 return size_binop_loc (loc
, MINUS_EXPR
, arg0
, arg1
);
1932 if (type
== sizetype
)
1934 else if (type
== bitsizetype
)
1935 ctype
= sbitsizetype
;
1937 ctype
= signed_type_for (type
);
1939 /* If either operand is not a constant, do the conversions to the signed
1940 type and subtract. The hardware will do the right thing with any
1941 overflow in the subtraction. */
1942 if (TREE_CODE (arg0
) != INTEGER_CST
|| TREE_CODE (arg1
) != INTEGER_CST
)
1943 return size_binop_loc (loc
, MINUS_EXPR
,
1944 fold_convert_loc (loc
, ctype
, arg0
),
1945 fold_convert_loc (loc
, ctype
, arg1
));
1947 /* If ARG0 is larger than ARG1, subtract and return the result in CTYPE.
1948 Otherwise, subtract the other way, convert to CTYPE (we know that can't
1949 overflow) and negate (which can't either). Special-case a result
1950 of zero while we're here. */
1951 if (tree_int_cst_equal (arg0
, arg1
))
1952 return build_int_cst (ctype
, 0);
1953 else if (tree_int_cst_lt (arg1
, arg0
))
1954 return fold_convert_loc (loc
, ctype
,
1955 size_binop_loc (loc
, MINUS_EXPR
, arg0
, arg1
));
1957 return size_binop_loc (loc
, MINUS_EXPR
, build_int_cst (ctype
, 0),
1958 fold_convert_loc (loc
, ctype
,
1959 size_binop_loc (loc
,
1964 /* A subroutine of fold_convert_const handling conversions of an
1965 INTEGER_CST to another integer type. */
1968 fold_convert_const_int_from_int (tree type
, const_tree arg1
)
1970 /* Given an integer constant, make new constant with new type,
1971 appropriately sign-extended or truncated. Use widest_int
1972 so that any extension is done according ARG1's type. */
1973 return force_fit_type (type
, wi::to_widest (arg1
),
1974 !POINTER_TYPE_P (TREE_TYPE (arg1
)),
1975 TREE_OVERFLOW (arg1
));
1978 /* A subroutine of fold_convert_const handling conversions a REAL_CST
1979 to an integer type. */
1982 fold_convert_const_int_from_real (enum tree_code code
, tree type
, const_tree arg1
)
1984 bool overflow
= false;
1987 /* The following code implements the floating point to integer
1988 conversion rules required by the Java Language Specification,
1989 that IEEE NaNs are mapped to zero and values that overflow
1990 the target precision saturate, i.e. values greater than
1991 INT_MAX are mapped to INT_MAX, and values less than INT_MIN
1992 are mapped to INT_MIN. These semantics are allowed by the
1993 C and C++ standards that simply state that the behavior of
1994 FP-to-integer conversion is unspecified upon overflow. */
1998 REAL_VALUE_TYPE x
= TREE_REAL_CST (arg1
);
2002 case FIX_TRUNC_EXPR
:
2003 real_trunc (&r
, VOIDmode
, &x
);
2010 /* If R is NaN, return zero and show we have an overflow. */
2011 if (REAL_VALUE_ISNAN (r
))
2014 val
= wi::zero (TYPE_PRECISION (type
));
2017 /* See if R is less than the lower bound or greater than the
2022 tree lt
= TYPE_MIN_VALUE (type
);
2023 REAL_VALUE_TYPE l
= real_value_from_int_cst (NULL_TREE
, lt
);
2024 if (real_less (&r
, &l
))
2027 val
= wi::to_wide (lt
);
2033 tree ut
= TYPE_MAX_VALUE (type
);
2036 REAL_VALUE_TYPE u
= real_value_from_int_cst (NULL_TREE
, ut
);
2037 if (real_less (&u
, &r
))
2040 val
= wi::to_wide (ut
);
2046 val
= real_to_integer (&r
, &overflow
, TYPE_PRECISION (type
));
2048 t
= force_fit_type (type
, val
, -1, overflow
| TREE_OVERFLOW (arg1
));
2052 /* A subroutine of fold_convert_const handling conversions of a
2053 FIXED_CST to an integer type. */
2056 fold_convert_const_int_from_fixed (tree type
, const_tree arg1
)
2059 double_int temp
, temp_trunc
;
2062 /* Right shift FIXED_CST to temp by fbit. */
2063 temp
= TREE_FIXED_CST (arg1
).data
;
2064 mode
= TREE_FIXED_CST (arg1
).mode
;
2065 if (GET_MODE_FBIT (mode
) < HOST_BITS_PER_DOUBLE_INT
)
2067 temp
= temp
.rshift (GET_MODE_FBIT (mode
),
2068 HOST_BITS_PER_DOUBLE_INT
,
2069 SIGNED_FIXED_POINT_MODE_P (mode
));
2071 /* Left shift temp to temp_trunc by fbit. */
2072 temp_trunc
= temp
.lshift (GET_MODE_FBIT (mode
),
2073 HOST_BITS_PER_DOUBLE_INT
,
2074 SIGNED_FIXED_POINT_MODE_P (mode
));
2078 temp
= double_int_zero
;
2079 temp_trunc
= double_int_zero
;
2082 /* If FIXED_CST is negative, we need to round the value toward 0.
2083 By checking if the fractional bits are not zero to add 1 to temp. */
2084 if (SIGNED_FIXED_POINT_MODE_P (mode
)
2085 && temp_trunc
.is_negative ()
2086 && TREE_FIXED_CST (arg1
).data
!= temp_trunc
)
2087 temp
+= double_int_one
;
2089 /* Given a fixed-point constant, make new constant with new type,
2090 appropriately sign-extended or truncated. */
2091 t
= force_fit_type (type
, temp
, -1,
2092 (temp
.is_negative ()
2093 && (TYPE_UNSIGNED (type
)
2094 < TYPE_UNSIGNED (TREE_TYPE (arg1
))))
2095 | TREE_OVERFLOW (arg1
));
2100 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2101 to another floating point type. */
2104 fold_convert_const_real_from_real (tree type
, const_tree arg1
)
2106 REAL_VALUE_TYPE value
;
2109 /* Don't perform the operation if flag_signaling_nans is on
2110 and the operand is a signaling NaN. */
2111 if (HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg1
)))
2112 && REAL_VALUE_ISSIGNALING_NAN (TREE_REAL_CST (arg1
)))
2115 real_convert (&value
, TYPE_MODE (type
), &TREE_REAL_CST (arg1
));
2116 t
= build_real (type
, value
);
2118 /* If converting an infinity or NAN to a representation that doesn't
2119 have one, set the overflow bit so that we can produce some kind of
2120 error message at the appropriate point if necessary. It's not the
2121 most user-friendly message, but it's better than nothing. */
2122 if (REAL_VALUE_ISINF (TREE_REAL_CST (arg1
))
2123 && !MODE_HAS_INFINITIES (TYPE_MODE (type
)))
2124 TREE_OVERFLOW (t
) = 1;
2125 else if (REAL_VALUE_ISNAN (TREE_REAL_CST (arg1
))
2126 && !MODE_HAS_NANS (TYPE_MODE (type
)))
2127 TREE_OVERFLOW (t
) = 1;
2128 /* Regular overflow, conversion produced an infinity in a mode that
2129 can't represent them. */
2130 else if (!MODE_HAS_INFINITIES (TYPE_MODE (type
))
2131 && REAL_VALUE_ISINF (value
)
2132 && !REAL_VALUE_ISINF (TREE_REAL_CST (arg1
)))
2133 TREE_OVERFLOW (t
) = 1;
2135 TREE_OVERFLOW (t
) = TREE_OVERFLOW (arg1
);
2139 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2140 to a floating point type. */
2143 fold_convert_const_real_from_fixed (tree type
, const_tree arg1
)
2145 REAL_VALUE_TYPE value
;
2148 real_convert_from_fixed (&value
, SCALAR_FLOAT_TYPE_MODE (type
),
2149 &TREE_FIXED_CST (arg1
));
2150 t
= build_real (type
, value
);
2152 TREE_OVERFLOW (t
) = TREE_OVERFLOW (arg1
);
2156 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2157 to another fixed-point type. */
2160 fold_convert_const_fixed_from_fixed (tree type
, const_tree arg1
)
2162 FIXED_VALUE_TYPE value
;
2166 overflow_p
= fixed_convert (&value
, SCALAR_TYPE_MODE (type
),
2167 &TREE_FIXED_CST (arg1
), TYPE_SATURATING (type
));
2168 t
= build_fixed (type
, value
);
2170 /* Propagate overflow flags. */
2171 if (overflow_p
| TREE_OVERFLOW (arg1
))
2172 TREE_OVERFLOW (t
) = 1;
2176 /* A subroutine of fold_convert_const handling conversions an INTEGER_CST
2177 to a fixed-point type. */
2180 fold_convert_const_fixed_from_int (tree type
, const_tree arg1
)
2182 FIXED_VALUE_TYPE value
;
2187 gcc_assert (TREE_INT_CST_NUNITS (arg1
) <= 2);
2189 di
.low
= TREE_INT_CST_ELT (arg1
, 0);
2190 if (TREE_INT_CST_NUNITS (arg1
) == 1)
2191 di
.high
= (HOST_WIDE_INT
) di
.low
< 0 ? HOST_WIDE_INT_M1
: 0;
2193 di
.high
= TREE_INT_CST_ELT (arg1
, 1);
2195 overflow_p
= fixed_convert_from_int (&value
, SCALAR_TYPE_MODE (type
), di
,
2196 TYPE_UNSIGNED (TREE_TYPE (arg1
)),
2197 TYPE_SATURATING (type
));
2198 t
= build_fixed (type
, value
);
2200 /* Propagate overflow flags. */
2201 if (overflow_p
| TREE_OVERFLOW (arg1
))
2202 TREE_OVERFLOW (t
) = 1;
2206 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2207 to a fixed-point type. */
2210 fold_convert_const_fixed_from_real (tree type
, const_tree arg1
)
2212 FIXED_VALUE_TYPE value
;
2216 overflow_p
= fixed_convert_from_real (&value
, SCALAR_TYPE_MODE (type
),
2217 &TREE_REAL_CST (arg1
),
2218 TYPE_SATURATING (type
));
2219 t
= build_fixed (type
, value
);
2221 /* Propagate overflow flags. */
2222 if (overflow_p
| TREE_OVERFLOW (arg1
))
2223 TREE_OVERFLOW (t
) = 1;
2227 /* Attempt to fold type conversion operation CODE of expression ARG1 to
2228 type TYPE. If no simplification can be done return NULL_TREE. */
2231 fold_convert_const (enum tree_code code
, tree type
, tree arg1
)
2233 tree arg_type
= TREE_TYPE (arg1
);
2234 if (arg_type
== type
)
2237 /* We can't widen types, since the runtime value could overflow the
2238 original type before being extended to the new type. */
2239 if (POLY_INT_CST_P (arg1
)
2240 && (POINTER_TYPE_P (type
) || INTEGRAL_TYPE_P (type
))
2241 && TYPE_PRECISION (type
) <= TYPE_PRECISION (arg_type
))
2242 return build_poly_int_cst (type
,
2243 poly_wide_int::from (poly_int_cst_value (arg1
),
2244 TYPE_PRECISION (type
),
2245 TYPE_SIGN (arg_type
)));
2247 if (POINTER_TYPE_P (type
) || INTEGRAL_TYPE_P (type
)
2248 || TREE_CODE (type
) == OFFSET_TYPE
)
2250 if (TREE_CODE (arg1
) == INTEGER_CST
)
2251 return fold_convert_const_int_from_int (type
, arg1
);
2252 else if (TREE_CODE (arg1
) == REAL_CST
)
2253 return fold_convert_const_int_from_real (code
, type
, arg1
);
2254 else if (TREE_CODE (arg1
) == FIXED_CST
)
2255 return fold_convert_const_int_from_fixed (type
, arg1
);
2257 else if (TREE_CODE (type
) == REAL_TYPE
)
2259 if (TREE_CODE (arg1
) == INTEGER_CST
)
2260 return build_real_from_int_cst (type
, arg1
);
2261 else if (TREE_CODE (arg1
) == REAL_CST
)
2262 return fold_convert_const_real_from_real (type
, arg1
);
2263 else if (TREE_CODE (arg1
) == FIXED_CST
)
2264 return fold_convert_const_real_from_fixed (type
, arg1
);
2266 else if (TREE_CODE (type
) == FIXED_POINT_TYPE
)
2268 if (TREE_CODE (arg1
) == FIXED_CST
)
2269 return fold_convert_const_fixed_from_fixed (type
, arg1
);
2270 else if (TREE_CODE (arg1
) == INTEGER_CST
)
2271 return fold_convert_const_fixed_from_int (type
, arg1
);
2272 else if (TREE_CODE (arg1
) == REAL_CST
)
2273 return fold_convert_const_fixed_from_real (type
, arg1
);
2275 else if (TREE_CODE (type
) == VECTOR_TYPE
)
2277 if (TREE_CODE (arg1
) == VECTOR_CST
2278 && TYPE_VECTOR_SUBPARTS (type
) == VECTOR_CST_NELTS (arg1
))
2280 tree elttype
= TREE_TYPE (type
);
2281 tree arg1_elttype
= TREE_TYPE (TREE_TYPE (arg1
));
2282 /* We can't handle steps directly when extending, since the
2283 values need to wrap at the original precision first. */
2285 = (INTEGRAL_TYPE_P (elttype
)
2286 && INTEGRAL_TYPE_P (arg1_elttype
)
2287 && TYPE_PRECISION (elttype
) <= TYPE_PRECISION (arg1_elttype
));
2288 tree_vector_builder v
;
2289 if (!v
.new_unary_operation (type
, arg1
, step_ok_p
))
2291 unsigned int len
= v
.encoded_nelts ();
2292 for (unsigned int i
= 0; i
< len
; ++i
)
2294 tree elt
= VECTOR_CST_ELT (arg1
, i
);
2295 tree cvt
= fold_convert_const (code
, elttype
, elt
);
2296 if (cvt
== NULL_TREE
)
2306 /* Construct a vector of zero elements of vector type TYPE. */
2309 build_zero_vector (tree type
)
2313 t
= fold_convert_const (NOP_EXPR
, TREE_TYPE (type
), integer_zero_node
);
2314 return build_vector_from_val (type
, t
);
2317 /* Returns true, if ARG is convertible to TYPE using a NOP_EXPR. */
2320 fold_convertible_p (const_tree type
, const_tree arg
)
2322 tree orig
= TREE_TYPE (arg
);
2327 if (TREE_CODE (arg
) == ERROR_MARK
2328 || TREE_CODE (type
) == ERROR_MARK
2329 || TREE_CODE (orig
) == ERROR_MARK
)
2332 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (orig
))
2335 switch (TREE_CODE (type
))
2337 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2338 case POINTER_TYPE
: case REFERENCE_TYPE
:
2340 return (INTEGRAL_TYPE_P (orig
) || POINTER_TYPE_P (orig
)
2341 || TREE_CODE (orig
) == OFFSET_TYPE
);
2344 case FIXED_POINT_TYPE
:
2347 return TREE_CODE (type
) == TREE_CODE (orig
);
2354 /* Convert expression ARG to type TYPE. Used by the middle-end for
2355 simple conversions in preference to calling the front-end's convert. */
2358 fold_convert_loc (location_t loc
, tree type
, tree arg
)
2360 tree orig
= TREE_TYPE (arg
);
2366 if (TREE_CODE (arg
) == ERROR_MARK
2367 || TREE_CODE (type
) == ERROR_MARK
2368 || TREE_CODE (orig
) == ERROR_MARK
)
2369 return error_mark_node
;
2371 switch (TREE_CODE (type
))
2374 case REFERENCE_TYPE
:
2375 /* Handle conversions between pointers to different address spaces. */
2376 if (POINTER_TYPE_P (orig
)
2377 && (TYPE_ADDR_SPACE (TREE_TYPE (type
))
2378 != TYPE_ADDR_SPACE (TREE_TYPE (orig
))))
2379 return fold_build1_loc (loc
, ADDR_SPACE_CONVERT_EXPR
, type
, arg
);
2382 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2384 if (TREE_CODE (arg
) == INTEGER_CST
)
2386 tem
= fold_convert_const (NOP_EXPR
, type
, arg
);
2387 if (tem
!= NULL_TREE
)
2390 if (INTEGRAL_TYPE_P (orig
) || POINTER_TYPE_P (orig
)
2391 || TREE_CODE (orig
) == OFFSET_TYPE
)
2392 return fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
2393 if (TREE_CODE (orig
) == COMPLEX_TYPE
)
2394 return fold_convert_loc (loc
, type
,
2395 fold_build1_loc (loc
, REALPART_EXPR
,
2396 TREE_TYPE (orig
), arg
));
2397 gcc_assert (TREE_CODE (orig
) == VECTOR_TYPE
2398 && tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (orig
)));
2399 return fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, type
, arg
);
2402 if (TREE_CODE (arg
) == INTEGER_CST
)
2404 tem
= fold_convert_const (FLOAT_EXPR
, type
, arg
);
2405 if (tem
!= NULL_TREE
)
2408 else if (TREE_CODE (arg
) == REAL_CST
)
2410 tem
= fold_convert_const (NOP_EXPR
, type
, arg
);
2411 if (tem
!= NULL_TREE
)
2414 else if (TREE_CODE (arg
) == FIXED_CST
)
2416 tem
= fold_convert_const (FIXED_CONVERT_EXPR
, type
, arg
);
2417 if (tem
!= NULL_TREE
)
2421 switch (TREE_CODE (orig
))
2424 case BOOLEAN_TYPE
: case ENUMERAL_TYPE
:
2425 case POINTER_TYPE
: case REFERENCE_TYPE
:
2426 return fold_build1_loc (loc
, FLOAT_EXPR
, type
, arg
);
2429 return fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
2431 case FIXED_POINT_TYPE
:
2432 return fold_build1_loc (loc
, FIXED_CONVERT_EXPR
, type
, arg
);
2435 tem
= fold_build1_loc (loc
, REALPART_EXPR
, TREE_TYPE (orig
), arg
);
2436 return fold_convert_loc (loc
, type
, tem
);
2442 case FIXED_POINT_TYPE
:
2443 if (TREE_CODE (arg
) == FIXED_CST
|| TREE_CODE (arg
) == INTEGER_CST
2444 || TREE_CODE (arg
) == REAL_CST
)
2446 tem
= fold_convert_const (FIXED_CONVERT_EXPR
, type
, arg
);
2447 if (tem
!= NULL_TREE
)
2448 goto fold_convert_exit
;
2451 switch (TREE_CODE (orig
))
2453 case FIXED_POINT_TYPE
:
2458 return fold_build1_loc (loc
, FIXED_CONVERT_EXPR
, type
, arg
);
2461 tem
= fold_build1_loc (loc
, REALPART_EXPR
, TREE_TYPE (orig
), arg
);
2462 return fold_convert_loc (loc
, type
, tem
);
2469 switch (TREE_CODE (orig
))
2472 case BOOLEAN_TYPE
: case ENUMERAL_TYPE
:
2473 case POINTER_TYPE
: case REFERENCE_TYPE
:
2475 case FIXED_POINT_TYPE
:
2476 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
2477 fold_convert_loc (loc
, TREE_TYPE (type
), arg
),
2478 fold_convert_loc (loc
, TREE_TYPE (type
),
2479 integer_zero_node
));
2484 if (TREE_CODE (arg
) == COMPLEX_EXPR
)
2486 rpart
= fold_convert_loc (loc
, TREE_TYPE (type
),
2487 TREE_OPERAND (arg
, 0));
2488 ipart
= fold_convert_loc (loc
, TREE_TYPE (type
),
2489 TREE_OPERAND (arg
, 1));
2490 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rpart
, ipart
);
2493 arg
= save_expr (arg
);
2494 rpart
= fold_build1_loc (loc
, REALPART_EXPR
, TREE_TYPE (orig
), arg
);
2495 ipart
= fold_build1_loc (loc
, IMAGPART_EXPR
, TREE_TYPE (orig
), arg
);
2496 rpart
= fold_convert_loc (loc
, TREE_TYPE (type
), rpart
);
2497 ipart
= fold_convert_loc (loc
, TREE_TYPE (type
), ipart
);
2498 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rpart
, ipart
);
2506 if (integer_zerop (arg
))
2507 return build_zero_vector (type
);
2508 gcc_assert (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (orig
)));
2509 gcc_assert (INTEGRAL_TYPE_P (orig
) || POINTER_TYPE_P (orig
)
2510 || TREE_CODE (orig
) == VECTOR_TYPE
);
2511 return fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, type
, arg
);
2514 tem
= fold_ignored_result (arg
);
2515 return fold_build1_loc (loc
, NOP_EXPR
, type
, tem
);
2518 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (orig
))
2519 return fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
2523 protected_set_expr_location_unshare (tem
, loc
);
2527 /* Return false if expr can be assumed not to be an lvalue, true
2531 maybe_lvalue_p (const_tree x
)
2533 /* We only need to wrap lvalue tree codes. */
2534 switch (TREE_CODE (x
))
2547 case ARRAY_RANGE_REF
:
2553 case PREINCREMENT_EXPR
:
2554 case PREDECREMENT_EXPR
:
2556 case TRY_CATCH_EXPR
:
2557 case WITH_CLEANUP_EXPR
:
2566 /* Assume the worst for front-end tree codes. */
2567 if ((int)TREE_CODE (x
) >= NUM_TREE_CODES
)
2575 /* Return an expr equal to X but certainly not valid as an lvalue. */
2578 non_lvalue_loc (location_t loc
, tree x
)
2580 /* While we are in GIMPLE, NON_LVALUE_EXPR doesn't mean anything to
2585 if (! maybe_lvalue_p (x
))
2587 return build1_loc (loc
, NON_LVALUE_EXPR
, TREE_TYPE (x
), x
);
2590 /* When pedantic, return an expr equal to X but certainly not valid as a
2591 pedantic lvalue. Otherwise, return X. */
2594 pedantic_non_lvalue_loc (location_t loc
, tree x
)
2596 return protected_set_expr_location_unshare (x
, loc
);
2599 /* Given a tree comparison code, return the code that is the logical inverse.
2600 It is generally not safe to do this for floating-point comparisons, except
2601 for EQ_EXPR, NE_EXPR, ORDERED_EXPR and UNORDERED_EXPR, so we return
2602 ERROR_MARK in this case. */
2605 invert_tree_comparison (enum tree_code code
, bool honor_nans
)
2607 if (honor_nans
&& flag_trapping_math
&& code
!= EQ_EXPR
&& code
!= NE_EXPR
2608 && code
!= ORDERED_EXPR
&& code
!= UNORDERED_EXPR
)
2618 return honor_nans
? UNLE_EXPR
: LE_EXPR
;
2620 return honor_nans
? UNLT_EXPR
: LT_EXPR
;
2622 return honor_nans
? UNGE_EXPR
: GE_EXPR
;
2624 return honor_nans
? UNGT_EXPR
: GT_EXPR
;
2638 return UNORDERED_EXPR
;
2639 case UNORDERED_EXPR
:
2640 return ORDERED_EXPR
;
2646 /* Similar, but return the comparison that results if the operands are
2647 swapped. This is safe for floating-point. */
2650 swap_tree_comparison (enum tree_code code
)
2657 case UNORDERED_EXPR
:
2683 /* Convert a comparison tree code from an enum tree_code representation
2684 into a compcode bit-based encoding. This function is the inverse of
2685 compcode_to_comparison. */
2687 static enum comparison_code
2688 comparison_to_compcode (enum tree_code code
)
2705 return COMPCODE_ORD
;
2706 case UNORDERED_EXPR
:
2707 return COMPCODE_UNORD
;
2709 return COMPCODE_UNLT
;
2711 return COMPCODE_UNEQ
;
2713 return COMPCODE_UNLE
;
2715 return COMPCODE_UNGT
;
2717 return COMPCODE_LTGT
;
2719 return COMPCODE_UNGE
;
2725 /* Convert a compcode bit-based encoding of a comparison operator back
2726 to GCC's enum tree_code representation. This function is the
2727 inverse of comparison_to_compcode. */
2729 static enum tree_code
2730 compcode_to_comparison (enum comparison_code code
)
2747 return ORDERED_EXPR
;
2748 case COMPCODE_UNORD
:
2749 return UNORDERED_EXPR
;
2767 /* Return a tree for the comparison which is the combination of
2768 doing the AND or OR (depending on CODE) of the two operations LCODE
2769 and RCODE on the identical operands LL_ARG and LR_ARG. Take into account
2770 the possibility of trapping if the mode has NaNs, and return NULL_TREE
2771 if this makes the transformation invalid. */
2774 combine_comparisons (location_t loc
,
2775 enum tree_code code
, enum tree_code lcode
,
2776 enum tree_code rcode
, tree truth_type
,
2777 tree ll_arg
, tree lr_arg
)
2779 bool honor_nans
= HONOR_NANS (ll_arg
);
2780 enum comparison_code lcompcode
= comparison_to_compcode (lcode
);
2781 enum comparison_code rcompcode
= comparison_to_compcode (rcode
);
2786 case TRUTH_AND_EXPR
: case TRUTH_ANDIF_EXPR
:
2787 compcode
= lcompcode
& rcompcode
;
2790 case TRUTH_OR_EXPR
: case TRUTH_ORIF_EXPR
:
2791 compcode
= lcompcode
| rcompcode
;
2800 /* Eliminate unordered comparisons, as well as LTGT and ORD
2801 which are not used unless the mode has NaNs. */
2802 compcode
&= ~COMPCODE_UNORD
;
2803 if (compcode
== COMPCODE_LTGT
)
2804 compcode
= COMPCODE_NE
;
2805 else if (compcode
== COMPCODE_ORD
)
2806 compcode
= COMPCODE_TRUE
;
2808 else if (flag_trapping_math
)
2810 /* Check that the original operation and the optimized ones will trap
2811 under the same condition. */
2812 bool ltrap
= (lcompcode
& COMPCODE_UNORD
) == 0
2813 && (lcompcode
!= COMPCODE_EQ
)
2814 && (lcompcode
!= COMPCODE_ORD
);
2815 bool rtrap
= (rcompcode
& COMPCODE_UNORD
) == 0
2816 && (rcompcode
!= COMPCODE_EQ
)
2817 && (rcompcode
!= COMPCODE_ORD
);
2818 bool trap
= (compcode
& COMPCODE_UNORD
) == 0
2819 && (compcode
!= COMPCODE_EQ
)
2820 && (compcode
!= COMPCODE_ORD
);
2822 /* In a short-circuited boolean expression the LHS might be
2823 such that the RHS, if evaluated, will never trap. For
2824 example, in ORD (x, y) && (x < y), we evaluate the RHS only
2825 if neither x nor y is NaN. (This is a mixed blessing: for
2826 example, the expression above will never trap, hence
2827 optimizing it to x < y would be invalid). */
2828 if ((code
== TRUTH_ORIF_EXPR
&& (lcompcode
& COMPCODE_UNORD
))
2829 || (code
== TRUTH_ANDIF_EXPR
&& !(lcompcode
& COMPCODE_UNORD
)))
2832 /* If the comparison was short-circuited, and only the RHS
2833 trapped, we may now generate a spurious trap. */
2835 && (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
))
2838 /* If we changed the conditions that cause a trap, we lose. */
2839 if ((ltrap
|| rtrap
) != trap
)
2843 if (compcode
== COMPCODE_TRUE
)
2844 return constant_boolean_node (true, truth_type
);
2845 else if (compcode
== COMPCODE_FALSE
)
2846 return constant_boolean_node (false, truth_type
);
2849 enum tree_code tcode
;
2851 tcode
= compcode_to_comparison ((enum comparison_code
) compcode
);
2852 return fold_build2_loc (loc
, tcode
, truth_type
, ll_arg
, lr_arg
);
2856 /* Return nonzero if two operands (typically of the same tree node)
2857 are necessarily equal. FLAGS modifies behavior as follows:
2859 If OEP_ONLY_CONST is set, only return nonzero for constants.
2860 This function tests whether the operands are indistinguishable;
2861 it does not test whether they are equal using C's == operation.
2862 The distinction is important for IEEE floating point, because
2863 (1) -0.0 and 0.0 are distinguishable, but -0.0==0.0, and
2864 (2) two NaNs may be indistinguishable, but NaN!=NaN.
2866 If OEP_ONLY_CONST is unset, a VAR_DECL is considered equal to itself
2867 even though it may hold multiple values during a function.
2868 This is because a GCC tree node guarantees that nothing else is
2869 executed between the evaluation of its "operands" (which may often
2870 be evaluated in arbitrary order). Hence if the operands themselves
2871 don't side-effect, the VAR_DECLs, PARM_DECLs etc... must hold the
2872 same value in each operand/subexpression. Hence leaving OEP_ONLY_CONST
2873 unset means assuming isochronic (or instantaneous) tree equivalence.
2874 Unless comparing arbitrary expression trees, such as from different
2875 statements, this flag can usually be left unset.
2877 If OEP_PURE_SAME is set, then pure functions with identical arguments
2878 are considered the same. It is used when the caller has other ways
2879 to ensure that global memory is unchanged in between.
2881 If OEP_ADDRESS_OF is set, we are actually comparing addresses of objects,
2882 not values of expressions.
2884 If OEP_LEXICOGRAPHIC is set, then also handle expressions with side-effects
2885 such as MODIFY_EXPR, RETURN_EXPR, as well as STATEMENT_LISTs.
2887 Unless OEP_MATCH_SIDE_EFFECTS is set, the function returns false on
2888 any operand with side effect. This is unnecesarily conservative in the
2889 case we know that arg0 and arg1 are in disjoint code paths (such as in
2890 ?: operator). In addition OEP_MATCH_SIDE_EFFECTS is used when comparing
2891 addresses with TREE_CONSTANT flag set so we know that &var == &var
2892 even if var is volatile. */
2895 operand_equal_p (const_tree arg0
, const_tree arg1
, unsigned int flags
)
2897 /* When checking, verify at the outermost operand_equal_p call that
2898 if operand_equal_p returns non-zero then ARG0 and ARG1 has the same
2900 if (flag_checking
&& !(flags
& OEP_NO_HASH_CHECK
))
2902 if (operand_equal_p (arg0
, arg1
, flags
| OEP_NO_HASH_CHECK
))
2906 inchash::hash
hstate0 (0), hstate1 (0);
2907 inchash::add_expr (arg0
, hstate0
, flags
| OEP_HASH_CHECK
);
2908 inchash::add_expr (arg1
, hstate1
, flags
| OEP_HASH_CHECK
);
2909 hashval_t h0
= hstate0
.end ();
2910 hashval_t h1
= hstate1
.end ();
2911 gcc_assert (h0
== h1
);
2919 /* If either is ERROR_MARK, they aren't equal. */
2920 if (TREE_CODE (arg0
) == ERROR_MARK
|| TREE_CODE (arg1
) == ERROR_MARK
2921 || TREE_TYPE (arg0
) == error_mark_node
2922 || TREE_TYPE (arg1
) == error_mark_node
)
2925 /* Similar, if either does not have a type (like a released SSA name),
2926 they aren't equal. */
2927 if (!TREE_TYPE (arg0
) || !TREE_TYPE (arg1
))
2930 /* We cannot consider pointers to different address space equal. */
2931 if (POINTER_TYPE_P (TREE_TYPE (arg0
))
2932 && POINTER_TYPE_P (TREE_TYPE (arg1
))
2933 && (TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (arg0
)))
2934 != TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (arg1
)))))
2937 /* Check equality of integer constants before bailing out due to
2938 precision differences. */
2939 if (TREE_CODE (arg0
) == INTEGER_CST
&& TREE_CODE (arg1
) == INTEGER_CST
)
2941 /* Address of INTEGER_CST is not defined; check that we did not forget
2942 to drop the OEP_ADDRESS_OF flags. */
2943 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
2944 return tree_int_cst_equal (arg0
, arg1
);
2947 if (!(flags
& OEP_ADDRESS_OF
))
2949 /* If both types don't have the same signedness, then we can't consider
2950 them equal. We must check this before the STRIP_NOPS calls
2951 because they may change the signedness of the arguments. As pointers
2952 strictly don't have a signedness, require either two pointers or
2953 two non-pointers as well. */
2954 if (TYPE_UNSIGNED (TREE_TYPE (arg0
)) != TYPE_UNSIGNED (TREE_TYPE (arg1
))
2955 || POINTER_TYPE_P (TREE_TYPE (arg0
))
2956 != POINTER_TYPE_P (TREE_TYPE (arg1
)))
2959 /* If both types don't have the same precision, then it is not safe
2961 if (element_precision (TREE_TYPE (arg0
))
2962 != element_precision (TREE_TYPE (arg1
)))
2969 /* FIXME: Fortran FE currently produce ADDR_EXPR of NOP_EXPR. Enable the
2970 sanity check once the issue is solved. */
2972 /* Addresses of conversions and SSA_NAMEs (and many other things)
2973 are not defined. Check that we did not forget to drop the
2974 OEP_ADDRESS_OF/OEP_CONSTANT_ADDRESS_OF flags. */
2975 gcc_checking_assert (!CONVERT_EXPR_P (arg0
) && !CONVERT_EXPR_P (arg1
)
2976 && TREE_CODE (arg0
) != SSA_NAME
);
2979 /* In case both args are comparisons but with different comparison
2980 code, try to swap the comparison operands of one arg to produce
2981 a match and compare that variant. */
2982 if (TREE_CODE (arg0
) != TREE_CODE (arg1
)
2983 && COMPARISON_CLASS_P (arg0
)
2984 && COMPARISON_CLASS_P (arg1
))
2986 enum tree_code swap_code
= swap_tree_comparison (TREE_CODE (arg1
));
2988 if (TREE_CODE (arg0
) == swap_code
)
2989 return operand_equal_p (TREE_OPERAND (arg0
, 0),
2990 TREE_OPERAND (arg1
, 1), flags
)
2991 && operand_equal_p (TREE_OPERAND (arg0
, 1),
2992 TREE_OPERAND (arg1
, 0), flags
);
2995 if (TREE_CODE (arg0
) != TREE_CODE (arg1
))
2997 /* NOP_EXPR and CONVERT_EXPR are considered equal. */
2998 if (CONVERT_EXPR_P (arg0
) && CONVERT_EXPR_P (arg1
))
3000 else if (flags
& OEP_ADDRESS_OF
)
3002 /* If we are interested in comparing addresses ignore
3003 MEM_REF wrappings of the base that can appear just for
3005 if (TREE_CODE (arg0
) == MEM_REF
3007 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == ADDR_EXPR
3008 && TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0) == arg1
3009 && integer_zerop (TREE_OPERAND (arg0
, 1)))
3011 else if (TREE_CODE (arg1
) == MEM_REF
3013 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == ADDR_EXPR
3014 && TREE_OPERAND (TREE_OPERAND (arg1
, 0), 0) == arg0
3015 && integer_zerop (TREE_OPERAND (arg1
, 1)))
3023 /* When not checking adddresses, this is needed for conversions and for
3024 COMPONENT_REF. Might as well play it safe and always test this. */
3025 if (TREE_CODE (TREE_TYPE (arg0
)) == ERROR_MARK
3026 || TREE_CODE (TREE_TYPE (arg1
)) == ERROR_MARK
3027 || (TYPE_MODE (TREE_TYPE (arg0
)) != TYPE_MODE (TREE_TYPE (arg1
))
3028 && !(flags
& OEP_ADDRESS_OF
)))
3031 /* If ARG0 and ARG1 are the same SAVE_EXPR, they are necessarily equal.
3032 We don't care about side effects in that case because the SAVE_EXPR
3033 takes care of that for us. In all other cases, two expressions are
3034 equal if they have no side effects. If we have two identical
3035 expressions with side effects that should be treated the same due
3036 to the only side effects being identical SAVE_EXPR's, that will
3037 be detected in the recursive calls below.
3038 If we are taking an invariant address of two identical objects
3039 they are necessarily equal as well. */
3040 if (arg0
== arg1
&& ! (flags
& OEP_ONLY_CONST
)
3041 && (TREE_CODE (arg0
) == SAVE_EXPR
3042 || (flags
& OEP_MATCH_SIDE_EFFECTS
)
3043 || (! TREE_SIDE_EFFECTS (arg0
) && ! TREE_SIDE_EFFECTS (arg1
))))
3046 /* Next handle constant cases, those for which we can return 1 even
3047 if ONLY_CONST is set. */
3048 if (TREE_CONSTANT (arg0
) && TREE_CONSTANT (arg1
))
3049 switch (TREE_CODE (arg0
))
3052 return tree_int_cst_equal (arg0
, arg1
);
3055 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (arg0
),
3056 TREE_FIXED_CST (arg1
));
3059 if (real_identical (&TREE_REAL_CST (arg0
), &TREE_REAL_CST (arg1
)))
3063 if (!HONOR_SIGNED_ZEROS (arg0
))
3065 /* If we do not distinguish between signed and unsigned zero,
3066 consider them equal. */
3067 if (real_zerop (arg0
) && real_zerop (arg1
))
3074 if (VECTOR_CST_LOG2_NPATTERNS (arg0
)
3075 != VECTOR_CST_LOG2_NPATTERNS (arg1
))
3078 if (VECTOR_CST_NELTS_PER_PATTERN (arg0
)
3079 != VECTOR_CST_NELTS_PER_PATTERN (arg1
))
3082 unsigned int count
= vector_cst_encoded_nelts (arg0
);
3083 for (unsigned int i
= 0; i
< count
; ++i
)
3084 if (!operand_equal_p (VECTOR_CST_ENCODED_ELT (arg0
, i
),
3085 VECTOR_CST_ENCODED_ELT (arg1
, i
), flags
))
3091 return (operand_equal_p (TREE_REALPART (arg0
), TREE_REALPART (arg1
),
3093 && operand_equal_p (TREE_IMAGPART (arg0
), TREE_IMAGPART (arg1
),
3097 return (TREE_STRING_LENGTH (arg0
) == TREE_STRING_LENGTH (arg1
)
3098 && ! memcmp (TREE_STRING_POINTER (arg0
),
3099 TREE_STRING_POINTER (arg1
),
3100 TREE_STRING_LENGTH (arg0
)));
3103 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
3104 return operand_equal_p (TREE_OPERAND (arg0
, 0), TREE_OPERAND (arg1
, 0),
3105 flags
| OEP_ADDRESS_OF
3106 | OEP_MATCH_SIDE_EFFECTS
);
3108 /* In GIMPLE empty constructors are allowed in initializers of
3110 return !CONSTRUCTOR_NELTS (arg0
) && !CONSTRUCTOR_NELTS (arg1
);
3115 if (flags
& OEP_ONLY_CONST
)
3118 /* Define macros to test an operand from arg0 and arg1 for equality and a
3119 variant that allows null and views null as being different from any
3120 non-null value. In the latter case, if either is null, the both
3121 must be; otherwise, do the normal comparison. */
3122 #define OP_SAME(N) operand_equal_p (TREE_OPERAND (arg0, N), \
3123 TREE_OPERAND (arg1, N), flags)
3125 #define OP_SAME_WITH_NULL(N) \
3126 ((!TREE_OPERAND (arg0, N) || !TREE_OPERAND (arg1, N)) \
3127 ? TREE_OPERAND (arg0, N) == TREE_OPERAND (arg1, N) : OP_SAME (N))
3129 switch (TREE_CODE_CLASS (TREE_CODE (arg0
)))
3132 /* Two conversions are equal only if signedness and modes match. */
3133 switch (TREE_CODE (arg0
))
3136 case FIX_TRUNC_EXPR
:
3137 if (TYPE_UNSIGNED (TREE_TYPE (arg0
))
3138 != TYPE_UNSIGNED (TREE_TYPE (arg1
)))
3148 case tcc_comparison
:
3150 if (OP_SAME (0) && OP_SAME (1))
3153 /* For commutative ops, allow the other order. */
3154 return (commutative_tree_code (TREE_CODE (arg0
))
3155 && operand_equal_p (TREE_OPERAND (arg0
, 0),
3156 TREE_OPERAND (arg1
, 1), flags
)
3157 && operand_equal_p (TREE_OPERAND (arg0
, 1),
3158 TREE_OPERAND (arg1
, 0), flags
));
3161 /* If either of the pointer (or reference) expressions we are
3162 dereferencing contain a side effect, these cannot be equal,
3163 but their addresses can be. */
3164 if ((flags
& OEP_MATCH_SIDE_EFFECTS
) == 0
3165 && (TREE_SIDE_EFFECTS (arg0
)
3166 || TREE_SIDE_EFFECTS (arg1
)))
3169 switch (TREE_CODE (arg0
))
3172 if (!(flags
& OEP_ADDRESS_OF
)
3173 && (TYPE_ALIGN (TREE_TYPE (arg0
))
3174 != TYPE_ALIGN (TREE_TYPE (arg1
))))
3176 flags
&= ~OEP_ADDRESS_OF
;
3180 /* Require the same offset. */
3181 if (!operand_equal_p (TYPE_SIZE (TREE_TYPE (arg0
)),
3182 TYPE_SIZE (TREE_TYPE (arg1
)),
3183 flags
& ~OEP_ADDRESS_OF
))
3188 case VIEW_CONVERT_EXPR
:
3191 case TARGET_MEM_REF
:
3193 if (!(flags
& OEP_ADDRESS_OF
))
3195 /* Require equal access sizes */
3196 if (TYPE_SIZE (TREE_TYPE (arg0
)) != TYPE_SIZE (TREE_TYPE (arg1
))
3197 && (!TYPE_SIZE (TREE_TYPE (arg0
))
3198 || !TYPE_SIZE (TREE_TYPE (arg1
))
3199 || !operand_equal_p (TYPE_SIZE (TREE_TYPE (arg0
)),
3200 TYPE_SIZE (TREE_TYPE (arg1
)),
3203 /* Verify that access happens in similar types. */
3204 if (!types_compatible_p (TREE_TYPE (arg0
), TREE_TYPE (arg1
)))
3206 /* Verify that accesses are TBAA compatible. */
3207 if (!alias_ptr_types_compatible_p
3208 (TREE_TYPE (TREE_OPERAND (arg0
, 1)),
3209 TREE_TYPE (TREE_OPERAND (arg1
, 1)))
3210 || (MR_DEPENDENCE_CLIQUE (arg0
)
3211 != MR_DEPENDENCE_CLIQUE (arg1
))
3212 || (MR_DEPENDENCE_BASE (arg0
)
3213 != MR_DEPENDENCE_BASE (arg1
)))
3215 /* Verify that alignment is compatible. */
3216 if (TYPE_ALIGN (TREE_TYPE (arg0
))
3217 != TYPE_ALIGN (TREE_TYPE (arg1
)))
3220 flags
&= ~OEP_ADDRESS_OF
;
3221 return (OP_SAME (0) && OP_SAME (1)
3222 /* TARGET_MEM_REF require equal extra operands. */
3223 && (TREE_CODE (arg0
) != TARGET_MEM_REF
3224 || (OP_SAME_WITH_NULL (2)
3225 && OP_SAME_WITH_NULL (3)
3226 && OP_SAME_WITH_NULL (4))));
3229 case ARRAY_RANGE_REF
:
3232 flags
&= ~OEP_ADDRESS_OF
;
3233 /* Compare the array index by value if it is constant first as we
3234 may have different types but same value here. */
3235 return ((tree_int_cst_equal (TREE_OPERAND (arg0
, 1),
3236 TREE_OPERAND (arg1
, 1))
3238 && OP_SAME_WITH_NULL (2)
3239 && OP_SAME_WITH_NULL (3)
3240 /* Compare low bound and element size as with OEP_ADDRESS_OF
3241 we have to account for the offset of the ref. */
3242 && (TREE_TYPE (TREE_OPERAND (arg0
, 0))
3243 == TREE_TYPE (TREE_OPERAND (arg1
, 0))
3244 || (operand_equal_p (array_ref_low_bound
3245 (CONST_CAST_TREE (arg0
)),
3247 (CONST_CAST_TREE (arg1
)), flags
)
3248 && operand_equal_p (array_ref_element_size
3249 (CONST_CAST_TREE (arg0
)),
3250 array_ref_element_size
3251 (CONST_CAST_TREE (arg1
)),
3255 /* Handle operand 2 the same as for ARRAY_REF. Operand 0
3256 may be NULL when we're called to compare MEM_EXPRs. */
3257 if (!OP_SAME_WITH_NULL (0)
3260 flags
&= ~OEP_ADDRESS_OF
;
3261 return OP_SAME_WITH_NULL (2);
3266 flags
&= ~OEP_ADDRESS_OF
;
3267 return OP_SAME (1) && OP_SAME (2);
3273 case tcc_expression
:
3274 switch (TREE_CODE (arg0
))
3277 /* Be sure we pass right ADDRESS_OF flag. */
3278 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
3279 return operand_equal_p (TREE_OPERAND (arg0
, 0),
3280 TREE_OPERAND (arg1
, 0),
3281 flags
| OEP_ADDRESS_OF
);
3283 case TRUTH_NOT_EXPR
:
3286 case TRUTH_ANDIF_EXPR
:
3287 case TRUTH_ORIF_EXPR
:
3288 return OP_SAME (0) && OP_SAME (1);
3291 case WIDEN_MULT_PLUS_EXPR
:
3292 case WIDEN_MULT_MINUS_EXPR
:
3295 /* The multiplcation operands are commutative. */
3298 case TRUTH_AND_EXPR
:
3300 case TRUTH_XOR_EXPR
:
3301 if (OP_SAME (0) && OP_SAME (1))
3304 /* Otherwise take into account this is a commutative operation. */
3305 return (operand_equal_p (TREE_OPERAND (arg0
, 0),
3306 TREE_OPERAND (arg1
, 1), flags
)
3307 && operand_equal_p (TREE_OPERAND (arg0
, 1),
3308 TREE_OPERAND (arg1
, 0), flags
));
3311 if (! OP_SAME (1) || ! OP_SAME_WITH_NULL (2))
3313 flags
&= ~OEP_ADDRESS_OF
;
3316 case BIT_INSERT_EXPR
:
3317 /* BIT_INSERT_EXPR has an implict operand as the type precision
3318 of op1. Need to check to make sure they are the same. */
3319 if (TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
3320 && TREE_CODE (TREE_OPERAND (arg1
, 1)) == INTEGER_CST
3321 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg0
, 1)))
3322 != TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg1
, 1))))
3328 return OP_SAME (0) && OP_SAME (1) && OP_SAME (2);
3333 case PREDECREMENT_EXPR
:
3334 case PREINCREMENT_EXPR
:
3335 case POSTDECREMENT_EXPR
:
3336 case POSTINCREMENT_EXPR
:
3337 if (flags
& OEP_LEXICOGRAPHIC
)
3338 return OP_SAME (0) && OP_SAME (1);
3341 case CLEANUP_POINT_EXPR
:
3343 if (flags
& OEP_LEXICOGRAPHIC
)
3352 switch (TREE_CODE (arg0
))
3355 if ((CALL_EXPR_FN (arg0
) == NULL_TREE
)
3356 != (CALL_EXPR_FN (arg1
) == NULL_TREE
))
3357 /* If not both CALL_EXPRs are either internal or normal function
3358 functions, then they are not equal. */
3360 else if (CALL_EXPR_FN (arg0
) == NULL_TREE
)
3362 /* If the CALL_EXPRs call different internal functions, then they
3364 if (CALL_EXPR_IFN (arg0
) != CALL_EXPR_IFN (arg1
))
3369 /* If the CALL_EXPRs call different functions, then they are not
3371 if (! operand_equal_p (CALL_EXPR_FN (arg0
), CALL_EXPR_FN (arg1
),
3376 /* FIXME: We could skip this test for OEP_MATCH_SIDE_EFFECTS. */
3378 unsigned int cef
= call_expr_flags (arg0
);
3379 if (flags
& OEP_PURE_SAME
)
3380 cef
&= ECF_CONST
| ECF_PURE
;
3383 if (!cef
&& !(flags
& OEP_LEXICOGRAPHIC
))
3387 /* Now see if all the arguments are the same. */
3389 const_call_expr_arg_iterator iter0
, iter1
;
3391 for (a0
= first_const_call_expr_arg (arg0
, &iter0
),
3392 a1
= first_const_call_expr_arg (arg1
, &iter1
);
3394 a0
= next_const_call_expr_arg (&iter0
),
3395 a1
= next_const_call_expr_arg (&iter1
))
3396 if (! operand_equal_p (a0
, a1
, flags
))
3399 /* If we get here and both argument lists are exhausted
3400 then the CALL_EXPRs are equal. */
3401 return ! (a0
|| a1
);
3407 case tcc_declaration
:
3408 /* Consider __builtin_sqrt equal to sqrt. */
3409 return (TREE_CODE (arg0
) == FUNCTION_DECL
3410 && DECL_BUILT_IN (arg0
) && DECL_BUILT_IN (arg1
)
3411 && DECL_BUILT_IN_CLASS (arg0
) == DECL_BUILT_IN_CLASS (arg1
)
3412 && DECL_FUNCTION_CODE (arg0
) == DECL_FUNCTION_CODE (arg1
));
3414 case tcc_exceptional
:
3415 if (TREE_CODE (arg0
) == CONSTRUCTOR
)
3417 /* In GIMPLE constructors are used only to build vectors from
3418 elements. Individual elements in the constructor must be
3419 indexed in increasing order and form an initial sequence.
3421 We make no effort to compare constructors in generic.
3422 (see sem_variable::equals in ipa-icf which can do so for
3424 if (!VECTOR_TYPE_P (TREE_TYPE (arg0
))
3425 || !VECTOR_TYPE_P (TREE_TYPE (arg1
)))
3428 /* Be sure that vectors constructed have the same representation.
3429 We only tested element precision and modes to match.
3430 Vectors may be BLKmode and thus also check that the number of
3432 if (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0
))
3433 != TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg1
)))
3436 vec
<constructor_elt
, va_gc
> *v0
= CONSTRUCTOR_ELTS (arg0
);
3437 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (arg1
);
3438 unsigned int len
= vec_safe_length (v0
);
3440 if (len
!= vec_safe_length (v1
))
3443 for (unsigned int i
= 0; i
< len
; i
++)
3445 constructor_elt
*c0
= &(*v0
)[i
];
3446 constructor_elt
*c1
= &(*v1
)[i
];
3448 if (!operand_equal_p (c0
->value
, c1
->value
, flags
)
3449 /* In GIMPLE the indexes can be either NULL or matching i.
3450 Double check this so we won't get false
3451 positives for GENERIC. */
3453 && (TREE_CODE (c0
->index
) != INTEGER_CST
3454 || !compare_tree_int (c0
->index
, i
)))
3456 && (TREE_CODE (c1
->index
) != INTEGER_CST
3457 || !compare_tree_int (c1
->index
, i
))))
3462 else if (TREE_CODE (arg0
) == STATEMENT_LIST
3463 && (flags
& OEP_LEXICOGRAPHIC
))
3465 /* Compare the STATEMENT_LISTs. */
3466 tree_stmt_iterator tsi1
, tsi2
;
3467 tree body1
= CONST_CAST_TREE (arg0
);
3468 tree body2
= CONST_CAST_TREE (arg1
);
3469 for (tsi1
= tsi_start (body1
), tsi2
= tsi_start (body2
); ;
3470 tsi_next (&tsi1
), tsi_next (&tsi2
))
3472 /* The lists don't have the same number of statements. */
3473 if (tsi_end_p (tsi1
) ^ tsi_end_p (tsi2
))
3475 if (tsi_end_p (tsi1
) && tsi_end_p (tsi2
))
3477 if (!operand_equal_p (tsi_stmt (tsi1
), tsi_stmt (tsi2
),
3485 switch (TREE_CODE (arg0
))
3488 if (flags
& OEP_LEXICOGRAPHIC
)
3489 return OP_SAME_WITH_NULL (0);
3500 #undef OP_SAME_WITH_NULL
3503 /* Similar to operand_equal_p, but see if ARG0 might be a variant of ARG1
3504 with a different signedness or a narrower precision. */
3507 operand_equal_for_comparison_p (tree arg0
, tree arg1
)
3509 if (operand_equal_p (arg0
, arg1
, 0))
3512 if (! INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
3513 || ! INTEGRAL_TYPE_P (TREE_TYPE (arg1
)))
3516 /* Discard any conversions that don't change the modes of ARG0 and ARG1
3517 and see if the inner values are the same. This removes any
3518 signedness comparison, which doesn't matter here. */
3523 if (operand_equal_p (op0
, op1
, 0))
3526 /* Discard a single widening conversion from ARG1 and see if the inner
3527 value is the same as ARG0. */
3528 if (CONVERT_EXPR_P (arg1
)
3529 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
3530 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
3531 < TYPE_PRECISION (TREE_TYPE (arg1
))
3532 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
3538 /* See if ARG is an expression that is either a comparison or is performing
3539 arithmetic on comparisons. The comparisons must only be comparing
3540 two different values, which will be stored in *CVAL1 and *CVAL2; if
3541 they are nonzero it means that some operands have already been found.
3542 No variables may be used anywhere else in the expression except in the
3543 comparisons. If SAVE_P is true it means we removed a SAVE_EXPR around
3544 the expression and save_expr needs to be called with CVAL1 and CVAL2.
3546 If this is true, return 1. Otherwise, return zero. */
3549 twoval_comparison_p (tree arg
, tree
*cval1
, tree
*cval2
, int *save_p
)
3551 enum tree_code code
= TREE_CODE (arg
);
3552 enum tree_code_class tclass
= TREE_CODE_CLASS (code
);
3554 /* We can handle some of the tcc_expression cases here. */
3555 if (tclass
== tcc_expression
&& code
== TRUTH_NOT_EXPR
)
3557 else if (tclass
== tcc_expression
3558 && (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
3559 || code
== COMPOUND_EXPR
))
3560 tclass
= tcc_binary
;
3562 else if (tclass
== tcc_expression
&& code
== SAVE_EXPR
3563 && ! TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
3565 /* If we've already found a CVAL1 or CVAL2, this expression is
3566 two complex to handle. */
3567 if (*cval1
|| *cval2
)
3577 return twoval_comparison_p (TREE_OPERAND (arg
, 0), cval1
, cval2
, save_p
);
3580 return (twoval_comparison_p (TREE_OPERAND (arg
, 0), cval1
, cval2
, save_p
)
3581 && twoval_comparison_p (TREE_OPERAND (arg
, 1),
3582 cval1
, cval2
, save_p
));
3587 case tcc_expression
:
3588 if (code
== COND_EXPR
)
3589 return (twoval_comparison_p (TREE_OPERAND (arg
, 0),
3590 cval1
, cval2
, save_p
)
3591 && twoval_comparison_p (TREE_OPERAND (arg
, 1),
3592 cval1
, cval2
, save_p
)
3593 && twoval_comparison_p (TREE_OPERAND (arg
, 2),
3594 cval1
, cval2
, save_p
));
3597 case tcc_comparison
:
3598 /* First see if we can handle the first operand, then the second. For
3599 the second operand, we know *CVAL1 can't be zero. It must be that
3600 one side of the comparison is each of the values; test for the
3601 case where this isn't true by failing if the two operands
3604 if (operand_equal_p (TREE_OPERAND (arg
, 0),
3605 TREE_OPERAND (arg
, 1), 0))
3609 *cval1
= TREE_OPERAND (arg
, 0);
3610 else if (operand_equal_p (*cval1
, TREE_OPERAND (arg
, 0), 0))
3612 else if (*cval2
== 0)
3613 *cval2
= TREE_OPERAND (arg
, 0);
3614 else if (operand_equal_p (*cval2
, TREE_OPERAND (arg
, 0), 0))
3619 if (operand_equal_p (*cval1
, TREE_OPERAND (arg
, 1), 0))
3621 else if (*cval2
== 0)
3622 *cval2
= TREE_OPERAND (arg
, 1);
3623 else if (operand_equal_p (*cval2
, TREE_OPERAND (arg
, 1), 0))
3635 /* ARG is a tree that is known to contain just arithmetic operations and
3636 comparisons. Evaluate the operations in the tree substituting NEW0 for
3637 any occurrence of OLD0 as an operand of a comparison and likewise for
3641 eval_subst (location_t loc
, tree arg
, tree old0
, tree new0
,
3642 tree old1
, tree new1
)
3644 tree type
= TREE_TYPE (arg
);
3645 enum tree_code code
= TREE_CODE (arg
);
3646 enum tree_code_class tclass
= TREE_CODE_CLASS (code
);
3648 /* We can handle some of the tcc_expression cases here. */
3649 if (tclass
== tcc_expression
&& code
== TRUTH_NOT_EXPR
)
3651 else if (tclass
== tcc_expression
3652 && (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
))
3653 tclass
= tcc_binary
;
3658 return fold_build1_loc (loc
, code
, type
,
3659 eval_subst (loc
, TREE_OPERAND (arg
, 0),
3660 old0
, new0
, old1
, new1
));
3663 return fold_build2_loc (loc
, code
, type
,
3664 eval_subst (loc
, TREE_OPERAND (arg
, 0),
3665 old0
, new0
, old1
, new1
),
3666 eval_subst (loc
, TREE_OPERAND (arg
, 1),
3667 old0
, new0
, old1
, new1
));
3669 case tcc_expression
:
3673 return eval_subst (loc
, TREE_OPERAND (arg
, 0), old0
, new0
,
3677 return eval_subst (loc
, TREE_OPERAND (arg
, 1), old0
, new0
,
3681 return fold_build3_loc (loc
, code
, type
,
3682 eval_subst (loc
, TREE_OPERAND (arg
, 0),
3683 old0
, new0
, old1
, new1
),
3684 eval_subst (loc
, TREE_OPERAND (arg
, 1),
3685 old0
, new0
, old1
, new1
),
3686 eval_subst (loc
, TREE_OPERAND (arg
, 2),
3687 old0
, new0
, old1
, new1
));
3691 /* Fall through - ??? */
3693 case tcc_comparison
:
3695 tree arg0
= TREE_OPERAND (arg
, 0);
3696 tree arg1
= TREE_OPERAND (arg
, 1);
3698 /* We need to check both for exact equality and tree equality. The
3699 former will be true if the operand has a side-effect. In that
3700 case, we know the operand occurred exactly once. */
3702 if (arg0
== old0
|| operand_equal_p (arg0
, old0
, 0))
3704 else if (arg0
== old1
|| operand_equal_p (arg0
, old1
, 0))
3707 if (arg1
== old0
|| operand_equal_p (arg1
, old0
, 0))
3709 else if (arg1
== old1
|| operand_equal_p (arg1
, old1
, 0))
3712 return fold_build2_loc (loc
, code
, type
, arg0
, arg1
);
3720 /* Return a tree for the case when the result of an expression is RESULT
3721 converted to TYPE and OMITTED was previously an operand of the expression
3722 but is now not needed (e.g., we folded OMITTED * 0).
3724 If OMITTED has side effects, we must evaluate it. Otherwise, just do
3725 the conversion of RESULT to TYPE. */
3728 omit_one_operand_loc (location_t loc
, tree type
, tree result
, tree omitted
)
3730 tree t
= fold_convert_loc (loc
, type
, result
);
3732 /* If the resulting operand is an empty statement, just return the omitted
3733 statement casted to void. */
3734 if (IS_EMPTY_STMT (t
) && TREE_SIDE_EFFECTS (omitted
))
3735 return build1_loc (loc
, NOP_EXPR
, void_type_node
,
3736 fold_ignored_result (omitted
));
3738 if (TREE_SIDE_EFFECTS (omitted
))
3739 return build2_loc (loc
, COMPOUND_EXPR
, type
,
3740 fold_ignored_result (omitted
), t
);
3742 return non_lvalue_loc (loc
, t
);
3745 /* Return a tree for the case when the result of an expression is RESULT
3746 converted to TYPE and OMITTED1 and OMITTED2 were previously operands
3747 of the expression but are now not needed.
3749 If OMITTED1 or OMITTED2 has side effects, they must be evaluated.
3750 If both OMITTED1 and OMITTED2 have side effects, OMITTED1 is
3751 evaluated before OMITTED2. Otherwise, if neither has side effects,
3752 just do the conversion of RESULT to TYPE. */
3755 omit_two_operands_loc (location_t loc
, tree type
, tree result
,
3756 tree omitted1
, tree omitted2
)
3758 tree t
= fold_convert_loc (loc
, type
, result
);
3760 if (TREE_SIDE_EFFECTS (omitted2
))
3761 t
= build2_loc (loc
, COMPOUND_EXPR
, type
, omitted2
, t
);
3762 if (TREE_SIDE_EFFECTS (omitted1
))
3763 t
= build2_loc (loc
, COMPOUND_EXPR
, type
, omitted1
, t
);
3765 return TREE_CODE (t
) != COMPOUND_EXPR
? non_lvalue_loc (loc
, t
) : t
;
3769 /* Return a simplified tree node for the truth-negation of ARG. This
3770 never alters ARG itself. We assume that ARG is an operation that
3771 returns a truth value (0 or 1).
3773 FIXME: one would think we would fold the result, but it causes
3774 problems with the dominator optimizer. */
3777 fold_truth_not_expr (location_t loc
, tree arg
)
3779 tree type
= TREE_TYPE (arg
);
3780 enum tree_code code
= TREE_CODE (arg
);
3781 location_t loc1
, loc2
;
3783 /* If this is a comparison, we can simply invert it, except for
3784 floating-point non-equality comparisons, in which case we just
3785 enclose a TRUTH_NOT_EXPR around what we have. */
3787 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
3789 tree op_type
= TREE_TYPE (TREE_OPERAND (arg
, 0));
3790 if (FLOAT_TYPE_P (op_type
)
3791 && flag_trapping_math
3792 && code
!= ORDERED_EXPR
&& code
!= UNORDERED_EXPR
3793 && code
!= NE_EXPR
&& code
!= EQ_EXPR
)
3796 code
= invert_tree_comparison (code
, HONOR_NANS (op_type
));
3797 if (code
== ERROR_MARK
)
3800 tree ret
= build2_loc (loc
, code
, type
, TREE_OPERAND (arg
, 0),
3801 TREE_OPERAND (arg
, 1));
3802 if (TREE_NO_WARNING (arg
))
3803 TREE_NO_WARNING (ret
) = 1;
3810 return constant_boolean_node (integer_zerop (arg
), type
);
3812 case TRUTH_AND_EXPR
:
3813 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3814 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3815 return build2_loc (loc
, TRUTH_OR_EXPR
, type
,
3816 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
3817 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
3820 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3821 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3822 return build2_loc (loc
, TRUTH_AND_EXPR
, type
,
3823 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
3824 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
3826 case TRUTH_XOR_EXPR
:
3827 /* Here we can invert either operand. We invert the first operand
3828 unless the second operand is a TRUTH_NOT_EXPR in which case our
3829 result is the XOR of the first operand with the inside of the
3830 negation of the second operand. */
3832 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == TRUTH_NOT_EXPR
)
3833 return build2_loc (loc
, TRUTH_XOR_EXPR
, type
, TREE_OPERAND (arg
, 0),
3834 TREE_OPERAND (TREE_OPERAND (arg
, 1), 0));
3836 return build2_loc (loc
, TRUTH_XOR_EXPR
, type
,
3837 invert_truthvalue_loc (loc
, TREE_OPERAND (arg
, 0)),
3838 TREE_OPERAND (arg
, 1));
3840 case TRUTH_ANDIF_EXPR
:
3841 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3842 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3843 return build2_loc (loc
, TRUTH_ORIF_EXPR
, type
,
3844 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
3845 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
3847 case TRUTH_ORIF_EXPR
:
3848 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3849 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3850 return build2_loc (loc
, TRUTH_ANDIF_EXPR
, type
,
3851 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
3852 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
3854 case TRUTH_NOT_EXPR
:
3855 return TREE_OPERAND (arg
, 0);
3859 tree arg1
= TREE_OPERAND (arg
, 1);
3860 tree arg2
= TREE_OPERAND (arg
, 2);
3862 loc1
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3863 loc2
= expr_location_or (TREE_OPERAND (arg
, 2), loc
);
3865 /* A COND_EXPR may have a throw as one operand, which
3866 then has void type. Just leave void operands
3868 return build3_loc (loc
, COND_EXPR
, type
, TREE_OPERAND (arg
, 0),
3869 VOID_TYPE_P (TREE_TYPE (arg1
))
3870 ? arg1
: invert_truthvalue_loc (loc1
, arg1
),
3871 VOID_TYPE_P (TREE_TYPE (arg2
))
3872 ? arg2
: invert_truthvalue_loc (loc2
, arg2
));
3876 loc1
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3877 return build2_loc (loc
, COMPOUND_EXPR
, type
,
3878 TREE_OPERAND (arg
, 0),
3879 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 1)));
3881 case NON_LVALUE_EXPR
:
3882 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3883 return invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0));
3886 if (TREE_CODE (TREE_TYPE (arg
)) == BOOLEAN_TYPE
)
3887 return build1_loc (loc
, TRUTH_NOT_EXPR
, type
, arg
);
3892 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3893 return build1_loc (loc
, TREE_CODE (arg
), type
,
3894 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)));
3897 if (!integer_onep (TREE_OPERAND (arg
, 1)))
3899 return build2_loc (loc
, EQ_EXPR
, type
, arg
, build_int_cst (type
, 0));
3902 return build1_loc (loc
, TRUTH_NOT_EXPR
, type
, arg
);
3904 case CLEANUP_POINT_EXPR
:
3905 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3906 return build1_loc (loc
, CLEANUP_POINT_EXPR
, type
,
3907 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)));
3914 /* Fold the truth-negation of ARG. This never alters ARG itself. We
3915 assume that ARG is an operation that returns a truth value (0 or 1
3916 for scalars, 0 or -1 for vectors). Return the folded expression if
3917 folding is successful. Otherwise, return NULL_TREE. */
3920 fold_invert_truthvalue (location_t loc
, tree arg
)
3922 tree type
= TREE_TYPE (arg
);
3923 return fold_unary_loc (loc
, VECTOR_TYPE_P (type
)
3929 /* Return a simplified tree node for the truth-negation of ARG. This
3930 never alters ARG itself. We assume that ARG is an operation that
3931 returns a truth value (0 or 1 for scalars, 0 or -1 for vectors). */
3934 invert_truthvalue_loc (location_t loc
, tree arg
)
3936 if (TREE_CODE (arg
) == ERROR_MARK
)
3939 tree type
= TREE_TYPE (arg
);
3940 return fold_build1_loc (loc
, VECTOR_TYPE_P (type
)
3946 /* Return a BIT_FIELD_REF of type TYPE to refer to BITSIZE bits of INNER
3947 starting at BITPOS. The field is unsigned if UNSIGNEDP is nonzero
3948 and uses reverse storage order if REVERSEP is nonzero. ORIG_INNER
3949 is the original memory reference used to preserve the alias set of
3953 make_bit_field_ref (location_t loc
, tree inner
, tree orig_inner
, tree type
,
3954 HOST_WIDE_INT bitsize
, poly_int64 bitpos
,
3955 int unsignedp
, int reversep
)
3957 tree result
, bftype
;
3959 /* Attempt not to lose the access path if possible. */
3960 if (TREE_CODE (orig_inner
) == COMPONENT_REF
)
3962 tree ninner
= TREE_OPERAND (orig_inner
, 0);
3964 poly_int64 nbitsize
, nbitpos
;
3966 int nunsignedp
, nreversep
, nvolatilep
= 0;
3967 tree base
= get_inner_reference (ninner
, &nbitsize
, &nbitpos
,
3968 &noffset
, &nmode
, &nunsignedp
,
3969 &nreversep
, &nvolatilep
);
3971 && noffset
== NULL_TREE
3972 && known_subrange_p (bitpos
, bitsize
, nbitpos
, nbitsize
)
3982 alias_set_type iset
= get_alias_set (orig_inner
);
3983 if (iset
== 0 && get_alias_set (inner
) != iset
)
3984 inner
= fold_build2 (MEM_REF
, TREE_TYPE (inner
),
3985 build_fold_addr_expr (inner
),
3986 build_int_cst (ptr_type_node
, 0));
3988 if (known_eq (bitpos
, 0) && !reversep
)
3990 tree size
= TYPE_SIZE (TREE_TYPE (inner
));
3991 if ((INTEGRAL_TYPE_P (TREE_TYPE (inner
))
3992 || POINTER_TYPE_P (TREE_TYPE (inner
)))
3993 && tree_fits_shwi_p (size
)
3994 && tree_to_shwi (size
) == bitsize
)
3995 return fold_convert_loc (loc
, type
, inner
);
3999 if (TYPE_PRECISION (bftype
) != bitsize
4000 || TYPE_UNSIGNED (bftype
) == !unsignedp
)
4001 bftype
= build_nonstandard_integer_type (bitsize
, 0);
4003 result
= build3_loc (loc
, BIT_FIELD_REF
, bftype
, inner
,
4004 bitsize_int (bitsize
), bitsize_int (bitpos
));
4005 REF_REVERSE_STORAGE_ORDER (result
) = reversep
;
4008 result
= fold_convert_loc (loc
, type
, result
);
4013 /* Optimize a bit-field compare.
4015 There are two cases: First is a compare against a constant and the
4016 second is a comparison of two items where the fields are at the same
4017 bit position relative to the start of a chunk (byte, halfword, word)
4018 large enough to contain it. In these cases we can avoid the shift
4019 implicit in bitfield extractions.
4021 For constants, we emit a compare of the shifted constant with the
4022 BIT_AND_EXPR of a mask and a byte, halfword, or word of the operand being
4023 compared. For two fields at the same position, we do the ANDs with the
4024 similar mask and compare the result of the ANDs.
4026 CODE is the comparison code, known to be either NE_EXPR or EQ_EXPR.
4027 COMPARE_TYPE is the type of the comparison, and LHS and RHS
4028 are the left and right operands of the comparison, respectively.
4030 If the optimization described above can be done, we return the resulting
4031 tree. Otherwise we return zero. */
4034 optimize_bit_field_compare (location_t loc
, enum tree_code code
,
4035 tree compare_type
, tree lhs
, tree rhs
)
4037 poly_int64 plbitpos
, plbitsize
, rbitpos
, rbitsize
;
4038 HOST_WIDE_INT lbitpos
, lbitsize
, nbitpos
, nbitsize
;
4039 tree type
= TREE_TYPE (lhs
);
4041 int const_p
= TREE_CODE (rhs
) == INTEGER_CST
;
4042 machine_mode lmode
, rmode
;
4043 scalar_int_mode nmode
;
4044 int lunsignedp
, runsignedp
;
4045 int lreversep
, rreversep
;
4046 int lvolatilep
= 0, rvolatilep
= 0;
4047 tree linner
, rinner
= NULL_TREE
;
4051 /* Get all the information about the extractions being done. If the bit size
4052 is the same as the size of the underlying object, we aren't doing an
4053 extraction at all and so can do nothing. We also don't want to
4054 do anything if the inner expression is a PLACEHOLDER_EXPR since we
4055 then will no longer be able to replace it. */
4056 linner
= get_inner_reference (lhs
, &plbitsize
, &plbitpos
, &offset
, &lmode
,
4057 &lunsignedp
, &lreversep
, &lvolatilep
);
4059 || !known_size_p (plbitsize
)
4060 || !plbitsize
.is_constant (&lbitsize
)
4061 || !plbitpos
.is_constant (&lbitpos
)
4062 || lbitsize
== GET_MODE_BITSIZE (lmode
)
4064 || TREE_CODE (linner
) == PLACEHOLDER_EXPR
4069 rreversep
= lreversep
;
4072 /* If this is not a constant, we can only do something if bit positions,
4073 sizes, signedness and storage order are the same. */
4075 = get_inner_reference (rhs
, &rbitsize
, &rbitpos
, &offset
, &rmode
,
4076 &runsignedp
, &rreversep
, &rvolatilep
);
4079 || maybe_ne (lbitpos
, rbitpos
)
4080 || maybe_ne (lbitsize
, rbitsize
)
4081 || lunsignedp
!= runsignedp
4082 || lreversep
!= rreversep
4084 || TREE_CODE (rinner
) == PLACEHOLDER_EXPR
4089 /* Honor the C++ memory model and mimic what RTL expansion does. */
4090 poly_uint64 bitstart
= 0;
4091 poly_uint64 bitend
= 0;
4092 if (TREE_CODE (lhs
) == COMPONENT_REF
)
4094 get_bit_range (&bitstart
, &bitend
, lhs
, &plbitpos
, &offset
);
4095 if (!plbitpos
.is_constant (&lbitpos
) || offset
!= NULL_TREE
)
4099 /* See if we can find a mode to refer to this field. We should be able to,
4100 but fail if we can't. */
4101 if (!get_best_mode (lbitsize
, lbitpos
, bitstart
, bitend
,
4102 const_p
? TYPE_ALIGN (TREE_TYPE (linner
))
4103 : MIN (TYPE_ALIGN (TREE_TYPE (linner
)),
4104 TYPE_ALIGN (TREE_TYPE (rinner
))),
4105 BITS_PER_WORD
, false, &nmode
))
4108 /* Set signed and unsigned types of the precision of this mode for the
4110 unsigned_type
= lang_hooks
.types
.type_for_mode (nmode
, 1);
4112 /* Compute the bit position and size for the new reference and our offset
4113 within it. If the new reference is the same size as the original, we
4114 won't optimize anything, so return zero. */
4115 nbitsize
= GET_MODE_BITSIZE (nmode
);
4116 nbitpos
= lbitpos
& ~ (nbitsize
- 1);
4118 if (nbitsize
== lbitsize
)
4121 if (lreversep
? !BYTES_BIG_ENDIAN
: BYTES_BIG_ENDIAN
)
4122 lbitpos
= nbitsize
- lbitsize
- lbitpos
;
4124 /* Make the mask to be used against the extracted field. */
4125 mask
= build_int_cst_type (unsigned_type
, -1);
4126 mask
= const_binop (LSHIFT_EXPR
, mask
, size_int (nbitsize
- lbitsize
));
4127 mask
= const_binop (RSHIFT_EXPR
, mask
,
4128 size_int (nbitsize
- lbitsize
- lbitpos
));
4135 /* If not comparing with constant, just rework the comparison
4137 tree t1
= make_bit_field_ref (loc
, linner
, lhs
, unsigned_type
,
4138 nbitsize
, nbitpos
, 1, lreversep
);
4139 t1
= fold_build2_loc (loc
, BIT_AND_EXPR
, unsigned_type
, t1
, mask
);
4140 tree t2
= make_bit_field_ref (loc
, rinner
, rhs
, unsigned_type
,
4141 nbitsize
, nbitpos
, 1, rreversep
);
4142 t2
= fold_build2_loc (loc
, BIT_AND_EXPR
, unsigned_type
, t2
, mask
);
4143 return fold_build2_loc (loc
, code
, compare_type
, t1
, t2
);
4146 /* Otherwise, we are handling the constant case. See if the constant is too
4147 big for the field. Warn and return a tree for 0 (false) if so. We do
4148 this not only for its own sake, but to avoid having to test for this
4149 error case below. If we didn't, we might generate wrong code.
4151 For unsigned fields, the constant shifted right by the field length should
4152 be all zero. For signed fields, the high-order bits should agree with
4157 if (wi::lrshift (wi::to_wide (rhs
), lbitsize
) != 0)
4159 warning (0, "comparison is always %d due to width of bit-field",
4161 return constant_boolean_node (code
== NE_EXPR
, compare_type
);
4166 wide_int tem
= wi::arshift (wi::to_wide (rhs
), lbitsize
- 1);
4167 if (tem
!= 0 && tem
!= -1)
4169 warning (0, "comparison is always %d due to width of bit-field",
4171 return constant_boolean_node (code
== NE_EXPR
, compare_type
);
4178 /* Single-bit compares should always be against zero. */
4179 if (lbitsize
== 1 && ! integer_zerop (rhs
))
4181 code
= code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
;
4182 rhs
= build_int_cst (type
, 0);
4185 /* Make a new bitfield reference, shift the constant over the
4186 appropriate number of bits and mask it with the computed mask
4187 (in case this was a signed field). If we changed it, make a new one. */
4188 lhs
= make_bit_field_ref (loc
, linner
, lhs
, unsigned_type
,
4189 nbitsize
, nbitpos
, 1, lreversep
);
4191 rhs
= const_binop (BIT_AND_EXPR
,
4192 const_binop (LSHIFT_EXPR
,
4193 fold_convert_loc (loc
, unsigned_type
, rhs
),
4194 size_int (lbitpos
)),
4197 lhs
= build2_loc (loc
, code
, compare_type
,
4198 build2 (BIT_AND_EXPR
, unsigned_type
, lhs
, mask
), rhs
);
4202 /* Subroutine for fold_truth_andor_1: decode a field reference.
4204 If EXP is a comparison reference, we return the innermost reference.
4206 *PBITSIZE is set to the number of bits in the reference, *PBITPOS is
4207 set to the starting bit number.
4209 If the innermost field can be completely contained in a mode-sized
4210 unit, *PMODE is set to that mode. Otherwise, it is set to VOIDmode.
4212 *PVOLATILEP is set to 1 if the any expression encountered is volatile;
4213 otherwise it is not changed.
4215 *PUNSIGNEDP is set to the signedness of the field.
4217 *PREVERSEP is set to the storage order of the field.
4219 *PMASK is set to the mask used. This is either contained in a
4220 BIT_AND_EXPR or derived from the width of the field.
4222 *PAND_MASK is set to the mask found in a BIT_AND_EXPR, if any.
4224 Return 0 if this is not a component reference or is one that we can't
4225 do anything with. */
4228 decode_field_reference (location_t loc
, tree
*exp_
, HOST_WIDE_INT
*pbitsize
,
4229 HOST_WIDE_INT
*pbitpos
, machine_mode
*pmode
,
4230 int *punsignedp
, int *preversep
, int *pvolatilep
,
4231 tree
*pmask
, tree
*pand_mask
)
4234 tree outer_type
= 0;
4236 tree mask
, inner
, offset
;
4238 unsigned int precision
;
4240 /* All the optimizations using this function assume integer fields.
4241 There are problems with FP fields since the type_for_size call
4242 below can fail for, e.g., XFmode. */
4243 if (! INTEGRAL_TYPE_P (TREE_TYPE (exp
)))
4246 /* We are interested in the bare arrangement of bits, so strip everything
4247 that doesn't affect the machine mode. However, record the type of the
4248 outermost expression if it may matter below. */
4249 if (CONVERT_EXPR_P (exp
)
4250 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4251 outer_type
= TREE_TYPE (exp
);
4254 if (TREE_CODE (exp
) == BIT_AND_EXPR
)
4256 and_mask
= TREE_OPERAND (exp
, 1);
4257 exp
= TREE_OPERAND (exp
, 0);
4258 STRIP_NOPS (exp
); STRIP_NOPS (and_mask
);
4259 if (TREE_CODE (and_mask
) != INTEGER_CST
)
4263 poly_int64 poly_bitsize
, poly_bitpos
;
4264 inner
= get_inner_reference (exp
, &poly_bitsize
, &poly_bitpos
, &offset
,
4265 pmode
, punsignedp
, preversep
, pvolatilep
);
4266 if ((inner
== exp
&& and_mask
== 0)
4267 || !poly_bitsize
.is_constant (pbitsize
)
4268 || !poly_bitpos
.is_constant (pbitpos
)
4271 || TREE_CODE (inner
) == PLACEHOLDER_EXPR
4272 /* Reject out-of-bound accesses (PR79731). */
4273 || (! AGGREGATE_TYPE_P (TREE_TYPE (inner
))
4274 && compare_tree_int (TYPE_SIZE (TREE_TYPE (inner
)),
4275 *pbitpos
+ *pbitsize
) < 0))
4280 /* If the number of bits in the reference is the same as the bitsize of
4281 the outer type, then the outer type gives the signedness. Otherwise
4282 (in case of a small bitfield) the signedness is unchanged. */
4283 if (outer_type
&& *pbitsize
== TYPE_PRECISION (outer_type
))
4284 *punsignedp
= TYPE_UNSIGNED (outer_type
);
4286 /* Compute the mask to access the bitfield. */
4287 unsigned_type
= lang_hooks
.types
.type_for_size (*pbitsize
, 1);
4288 precision
= TYPE_PRECISION (unsigned_type
);
4290 mask
= build_int_cst_type (unsigned_type
, -1);
4292 mask
= const_binop (LSHIFT_EXPR
, mask
, size_int (precision
- *pbitsize
));
4293 mask
= const_binop (RSHIFT_EXPR
, mask
, size_int (precision
- *pbitsize
));
4295 /* Merge it with the mask we found in the BIT_AND_EXPR, if any. */
4297 mask
= fold_build2_loc (loc
, BIT_AND_EXPR
, unsigned_type
,
4298 fold_convert_loc (loc
, unsigned_type
, and_mask
), mask
);
4301 *pand_mask
= and_mask
;
4305 /* Return nonzero if MASK represents a mask of SIZE ones in the low-order
4306 bit positions and MASK is SIGNED. */
4309 all_ones_mask_p (const_tree mask
, unsigned int size
)
4311 tree type
= TREE_TYPE (mask
);
4312 unsigned int precision
= TYPE_PRECISION (type
);
4314 /* If this function returns true when the type of the mask is
4315 UNSIGNED, then there will be errors. In particular see
4316 gcc.c-torture/execute/990326-1.c. There does not appear to be
4317 any documentation paper trail as to why this is so. But the pre
4318 wide-int worked with that restriction and it has been preserved
4320 if (size
> precision
|| TYPE_SIGN (type
) == UNSIGNED
)
4323 return wi::mask (size
, false, precision
) == wi::to_wide (mask
);
4326 /* Subroutine for fold: determine if VAL is the INTEGER_CONST that
4327 represents the sign bit of EXP's type. If EXP represents a sign
4328 or zero extension, also test VAL against the unextended type.
4329 The return value is the (sub)expression whose sign bit is VAL,
4330 or NULL_TREE otherwise. */
4333 sign_bit_p (tree exp
, const_tree val
)
4338 /* Tree EXP must have an integral type. */
4339 t
= TREE_TYPE (exp
);
4340 if (! INTEGRAL_TYPE_P (t
))
4343 /* Tree VAL must be an integer constant. */
4344 if (TREE_CODE (val
) != INTEGER_CST
4345 || TREE_OVERFLOW (val
))
4348 width
= TYPE_PRECISION (t
);
4349 if (wi::only_sign_bit_p (wi::to_wide (val
), width
))
4352 /* Handle extension from a narrower type. */
4353 if (TREE_CODE (exp
) == NOP_EXPR
4354 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp
, 0))) < width
)
4355 return sign_bit_p (TREE_OPERAND (exp
, 0), val
);
4360 /* Subroutine for fold_truth_andor_1: determine if an operand is simple enough
4361 to be evaluated unconditionally. */
4364 simple_operand_p (const_tree exp
)
4366 /* Strip any conversions that don't change the machine mode. */
4369 return (CONSTANT_CLASS_P (exp
)
4370 || TREE_CODE (exp
) == SSA_NAME
4372 && ! TREE_ADDRESSABLE (exp
)
4373 && ! TREE_THIS_VOLATILE (exp
)
4374 && ! DECL_NONLOCAL (exp
)
4375 /* Don't regard global variables as simple. They may be
4376 allocated in ways unknown to the compiler (shared memory,
4377 #pragma weak, etc). */
4378 && ! TREE_PUBLIC (exp
)
4379 && ! DECL_EXTERNAL (exp
)
4380 /* Weakrefs are not safe to be read, since they can be NULL.
4381 They are !TREE_PUBLIC && !DECL_EXTERNAL but still
4382 have DECL_WEAK flag set. */
4383 && (! VAR_OR_FUNCTION_DECL_P (exp
) || ! DECL_WEAK (exp
))
4384 /* Loading a static variable is unduly expensive, but global
4385 registers aren't expensive. */
4386 && (! TREE_STATIC (exp
) || DECL_REGISTER (exp
))));
4389 /* Subroutine for fold_truth_andor: determine if an operand is simple enough
4390 to be evaluated unconditionally.
4391 I addition to simple_operand_p, we assume that comparisons, conversions,
4392 and logic-not operations are simple, if their operands are simple, too. */
4395 simple_operand_p_2 (tree exp
)
4397 enum tree_code code
;
4399 if (TREE_SIDE_EFFECTS (exp
)
4400 || tree_could_trap_p (exp
))
4403 while (CONVERT_EXPR_P (exp
))
4404 exp
= TREE_OPERAND (exp
, 0);
4406 code
= TREE_CODE (exp
);
4408 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
4409 return (simple_operand_p (TREE_OPERAND (exp
, 0))
4410 && simple_operand_p (TREE_OPERAND (exp
, 1)));
4412 if (code
== TRUTH_NOT_EXPR
)
4413 return simple_operand_p_2 (TREE_OPERAND (exp
, 0));
4415 return simple_operand_p (exp
);
4419 /* The following functions are subroutines to fold_range_test and allow it to
4420 try to change a logical combination of comparisons into a range test.
4423 X == 2 || X == 3 || X == 4 || X == 5
4427 (unsigned) (X - 2) <= 3
4429 We describe each set of comparisons as being either inside or outside
4430 a range, using a variable named like IN_P, and then describe the
4431 range with a lower and upper bound. If one of the bounds is omitted,
4432 it represents either the highest or lowest value of the type.
4434 In the comments below, we represent a range by two numbers in brackets
4435 preceded by a "+" to designate being inside that range, or a "-" to
4436 designate being outside that range, so the condition can be inverted by
4437 flipping the prefix. An omitted bound is represented by a "-". For
4438 example, "- [-, 10]" means being outside the range starting at the lowest
4439 possible value and ending at 10, in other words, being greater than 10.
4440 The range "+ [-, -]" is always true and hence the range "- [-, -]" is
4443 We set up things so that the missing bounds are handled in a consistent
4444 manner so neither a missing bound nor "true" and "false" need to be
4445 handled using a special case. */
4447 /* Return the result of applying CODE to ARG0 and ARG1, but handle the case
4448 of ARG0 and/or ARG1 being omitted, meaning an unlimited range. UPPER0_P
4449 and UPPER1_P are nonzero if the respective argument is an upper bound
4450 and zero for a lower. TYPE, if nonzero, is the type of the result; it
4451 must be specified for a comparison. ARG1 will be converted to ARG0's
4452 type if both are specified. */
4455 range_binop (enum tree_code code
, tree type
, tree arg0
, int upper0_p
,
4456 tree arg1
, int upper1_p
)
4462 /* If neither arg represents infinity, do the normal operation.
4463 Else, if not a comparison, return infinity. Else handle the special
4464 comparison rules. Note that most of the cases below won't occur, but
4465 are handled for consistency. */
4467 if (arg0
!= 0 && arg1
!= 0)
4469 tem
= fold_build2 (code
, type
!= 0 ? type
: TREE_TYPE (arg0
),
4470 arg0
, fold_convert (TREE_TYPE (arg0
), arg1
));
4472 return TREE_CODE (tem
) == INTEGER_CST
? tem
: 0;
4475 if (TREE_CODE_CLASS (code
) != tcc_comparison
)
4478 /* Set SGN[01] to -1 if ARG[01] is a lower bound, 1 for upper, and 0
4479 for neither. In real maths, we cannot assume open ended ranges are
4480 the same. But, this is computer arithmetic, where numbers are finite.
4481 We can therefore make the transformation of any unbounded range with
4482 the value Z, Z being greater than any representable number. This permits
4483 us to treat unbounded ranges as equal. */
4484 sgn0
= arg0
!= 0 ? 0 : (upper0_p
? 1 : -1);
4485 sgn1
= arg1
!= 0 ? 0 : (upper1_p
? 1 : -1);
4489 result
= sgn0
== sgn1
;
4492 result
= sgn0
!= sgn1
;
4495 result
= sgn0
< sgn1
;
4498 result
= sgn0
<= sgn1
;
4501 result
= sgn0
> sgn1
;
4504 result
= sgn0
>= sgn1
;
4510 return constant_boolean_node (result
, type
);
4513 /* Helper routine for make_range. Perform one step for it, return
4514 new expression if the loop should continue or NULL_TREE if it should
4518 make_range_step (location_t loc
, enum tree_code code
, tree arg0
, tree arg1
,
4519 tree exp_type
, tree
*p_low
, tree
*p_high
, int *p_in_p
,
4520 bool *strict_overflow_p
)
4522 tree arg0_type
= TREE_TYPE (arg0
);
4523 tree n_low
, n_high
, low
= *p_low
, high
= *p_high
;
4524 int in_p
= *p_in_p
, n_in_p
;
4528 case TRUTH_NOT_EXPR
:
4529 /* We can only do something if the range is testing for zero. */
4530 if (low
== NULL_TREE
|| high
== NULL_TREE
4531 || ! integer_zerop (low
) || ! integer_zerop (high
))
4536 case EQ_EXPR
: case NE_EXPR
:
4537 case LT_EXPR
: case LE_EXPR
: case GE_EXPR
: case GT_EXPR
:
4538 /* We can only do something if the range is testing for zero
4539 and if the second operand is an integer constant. Note that
4540 saying something is "in" the range we make is done by
4541 complementing IN_P since it will set in the initial case of
4542 being not equal to zero; "out" is leaving it alone. */
4543 if (low
== NULL_TREE
|| high
== NULL_TREE
4544 || ! integer_zerop (low
) || ! integer_zerop (high
)
4545 || TREE_CODE (arg1
) != INTEGER_CST
)
4550 case NE_EXPR
: /* - [c, c] */
4553 case EQ_EXPR
: /* + [c, c] */
4554 in_p
= ! in_p
, low
= high
= arg1
;
4556 case GT_EXPR
: /* - [-, c] */
4557 low
= 0, high
= arg1
;
4559 case GE_EXPR
: /* + [c, -] */
4560 in_p
= ! in_p
, low
= arg1
, high
= 0;
4562 case LT_EXPR
: /* - [c, -] */
4563 low
= arg1
, high
= 0;
4565 case LE_EXPR
: /* + [-, c] */
4566 in_p
= ! in_p
, low
= 0, high
= arg1
;
4572 /* If this is an unsigned comparison, we also know that EXP is
4573 greater than or equal to zero. We base the range tests we make
4574 on that fact, so we record it here so we can parse existing
4575 range tests. We test arg0_type since often the return type
4576 of, e.g. EQ_EXPR, is boolean. */
4577 if (TYPE_UNSIGNED (arg0_type
) && (low
== 0 || high
== 0))
4579 if (! merge_ranges (&n_in_p
, &n_low
, &n_high
,
4581 build_int_cst (arg0_type
, 0),
4585 in_p
= n_in_p
, low
= n_low
, high
= n_high
;
4587 /* If the high bound is missing, but we have a nonzero low
4588 bound, reverse the range so it goes from zero to the low bound
4590 if (high
== 0 && low
&& ! integer_zerop (low
))
4593 high
= range_binop (MINUS_EXPR
, NULL_TREE
, low
, 0,
4594 build_int_cst (TREE_TYPE (low
), 1), 0);
4595 low
= build_int_cst (arg0_type
, 0);
4605 /* If flag_wrapv and ARG0_TYPE is signed, make sure
4606 low and high are non-NULL, then normalize will DTRT. */
4607 if (!TYPE_UNSIGNED (arg0_type
)
4608 && !TYPE_OVERFLOW_UNDEFINED (arg0_type
))
4610 if (low
== NULL_TREE
)
4611 low
= TYPE_MIN_VALUE (arg0_type
);
4612 if (high
== NULL_TREE
)
4613 high
= TYPE_MAX_VALUE (arg0_type
);
4616 /* (-x) IN [a,b] -> x in [-b, -a] */
4617 n_low
= range_binop (MINUS_EXPR
, exp_type
,
4618 build_int_cst (exp_type
, 0),
4620 n_high
= range_binop (MINUS_EXPR
, exp_type
,
4621 build_int_cst (exp_type
, 0),
4623 if (n_high
!= 0 && TREE_OVERFLOW (n_high
))
4629 return build2_loc (loc
, MINUS_EXPR
, exp_type
, negate_expr (arg0
),
4630 build_int_cst (exp_type
, 1));
4634 if (TREE_CODE (arg1
) != INTEGER_CST
)
4637 /* If flag_wrapv and ARG0_TYPE is signed, then we cannot
4638 move a constant to the other side. */
4639 if (!TYPE_UNSIGNED (arg0_type
)
4640 && !TYPE_OVERFLOW_UNDEFINED (arg0_type
))
4643 /* If EXP is signed, any overflow in the computation is undefined,
4644 so we don't worry about it so long as our computations on
4645 the bounds don't overflow. For unsigned, overflow is defined
4646 and this is exactly the right thing. */
4647 n_low
= range_binop (code
== MINUS_EXPR
? PLUS_EXPR
: MINUS_EXPR
,
4648 arg0_type
, low
, 0, arg1
, 0);
4649 n_high
= range_binop (code
== MINUS_EXPR
? PLUS_EXPR
: MINUS_EXPR
,
4650 arg0_type
, high
, 1, arg1
, 0);
4651 if ((n_low
!= 0 && TREE_OVERFLOW (n_low
))
4652 || (n_high
!= 0 && TREE_OVERFLOW (n_high
)))
4655 if (TYPE_OVERFLOW_UNDEFINED (arg0_type
))
4656 *strict_overflow_p
= true;
4659 /* Check for an unsigned range which has wrapped around the maximum
4660 value thus making n_high < n_low, and normalize it. */
4661 if (n_low
&& n_high
&& tree_int_cst_lt (n_high
, n_low
))
4663 low
= range_binop (PLUS_EXPR
, arg0_type
, n_high
, 0,
4664 build_int_cst (TREE_TYPE (n_high
), 1), 0);
4665 high
= range_binop (MINUS_EXPR
, arg0_type
, n_low
, 0,
4666 build_int_cst (TREE_TYPE (n_low
), 1), 0);
4668 /* If the range is of the form +/- [ x+1, x ], we won't
4669 be able to normalize it. But then, it represents the
4670 whole range or the empty set, so make it
4672 if (tree_int_cst_equal (n_low
, low
)
4673 && tree_int_cst_equal (n_high
, high
))
4679 low
= n_low
, high
= n_high
;
4687 case NON_LVALUE_EXPR
:
4688 if (TYPE_PRECISION (arg0_type
) > TYPE_PRECISION (exp_type
))
4691 if (! INTEGRAL_TYPE_P (arg0_type
)
4692 || (low
!= 0 && ! int_fits_type_p (low
, arg0_type
))
4693 || (high
!= 0 && ! int_fits_type_p (high
, arg0_type
)))
4696 n_low
= low
, n_high
= high
;
4699 n_low
= fold_convert_loc (loc
, arg0_type
, n_low
);
4702 n_high
= fold_convert_loc (loc
, arg0_type
, n_high
);
4704 /* If we're converting arg0 from an unsigned type, to exp,
4705 a signed type, we will be doing the comparison as unsigned.
4706 The tests above have already verified that LOW and HIGH
4709 So we have to ensure that we will handle large unsigned
4710 values the same way that the current signed bounds treat
4713 if (!TYPE_UNSIGNED (exp_type
) && TYPE_UNSIGNED (arg0_type
))
4717 /* For fixed-point modes, we need to pass the saturating flag
4718 as the 2nd parameter. */
4719 if (ALL_FIXED_POINT_MODE_P (TYPE_MODE (arg0_type
)))
4721 = lang_hooks
.types
.type_for_mode (TYPE_MODE (arg0_type
),
4722 TYPE_SATURATING (arg0_type
));
4725 = lang_hooks
.types
.type_for_mode (TYPE_MODE (arg0_type
), 1);
4727 /* A range without an upper bound is, naturally, unbounded.
4728 Since convert would have cropped a very large value, use
4729 the max value for the destination type. */
4731 = TYPE_MAX_VALUE (equiv_type
) ? TYPE_MAX_VALUE (equiv_type
)
4732 : TYPE_MAX_VALUE (arg0_type
);
4734 if (TYPE_PRECISION (exp_type
) == TYPE_PRECISION (arg0_type
))
4735 high_positive
= fold_build2_loc (loc
, RSHIFT_EXPR
, arg0_type
,
4736 fold_convert_loc (loc
, arg0_type
,
4738 build_int_cst (arg0_type
, 1));
4740 /* If the low bound is specified, "and" the range with the
4741 range for which the original unsigned value will be
4745 if (! merge_ranges (&n_in_p
, &n_low
, &n_high
, 1, n_low
, n_high
,
4746 1, fold_convert_loc (loc
, arg0_type
,
4751 in_p
= (n_in_p
== in_p
);
4755 /* Otherwise, "or" the range with the range of the input
4756 that will be interpreted as negative. */
4757 if (! merge_ranges (&n_in_p
, &n_low
, &n_high
, 0, n_low
, n_high
,
4758 1, fold_convert_loc (loc
, arg0_type
,
4763 in_p
= (in_p
!= n_in_p
);
4777 /* Given EXP, a logical expression, set the range it is testing into
4778 variables denoted by PIN_P, PLOW, and PHIGH. Return the expression
4779 actually being tested. *PLOW and *PHIGH will be made of the same
4780 type as the returned expression. If EXP is not a comparison, we
4781 will most likely not be returning a useful value and range. Set
4782 *STRICT_OVERFLOW_P to true if the return value is only valid
4783 because signed overflow is undefined; otherwise, do not change
4784 *STRICT_OVERFLOW_P. */
4787 make_range (tree exp
, int *pin_p
, tree
*plow
, tree
*phigh
,
4788 bool *strict_overflow_p
)
4790 enum tree_code code
;
4791 tree arg0
, arg1
= NULL_TREE
;
4792 tree exp_type
, nexp
;
4795 location_t loc
= EXPR_LOCATION (exp
);
4797 /* Start with simply saying "EXP != 0" and then look at the code of EXP
4798 and see if we can refine the range. Some of the cases below may not
4799 happen, but it doesn't seem worth worrying about this. We "continue"
4800 the outer loop when we've changed something; otherwise we "break"
4801 the switch, which will "break" the while. */
4804 low
= high
= build_int_cst (TREE_TYPE (exp
), 0);
4808 code
= TREE_CODE (exp
);
4809 exp_type
= TREE_TYPE (exp
);
4812 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
4814 if (TREE_OPERAND_LENGTH (exp
) > 0)
4815 arg0
= TREE_OPERAND (exp
, 0);
4816 if (TREE_CODE_CLASS (code
) == tcc_binary
4817 || TREE_CODE_CLASS (code
) == tcc_comparison
4818 || (TREE_CODE_CLASS (code
) == tcc_expression
4819 && TREE_OPERAND_LENGTH (exp
) > 1))
4820 arg1
= TREE_OPERAND (exp
, 1);
4822 if (arg0
== NULL_TREE
)
4825 nexp
= make_range_step (loc
, code
, arg0
, arg1
, exp_type
, &low
,
4826 &high
, &in_p
, strict_overflow_p
);
4827 if (nexp
== NULL_TREE
)
4832 /* If EXP is a constant, we can evaluate whether this is true or false. */
4833 if (TREE_CODE (exp
) == INTEGER_CST
)
4835 in_p
= in_p
== (integer_onep (range_binop (GE_EXPR
, integer_type_node
,
4837 && integer_onep (range_binop (LE_EXPR
, integer_type_node
,
4843 *pin_p
= in_p
, *plow
= low
, *phigh
= high
;
4847 /* Returns TRUE if [LOW, HIGH] range check can be optimized to
4848 a bitwise check i.e. when
4849 LOW == 0xXX...X00...0
4850 HIGH == 0xXX...X11...1
4851 Return corresponding mask in MASK and stem in VALUE. */
4854 maskable_range_p (const_tree low
, const_tree high
, tree type
, tree
*mask
,
4857 if (TREE_CODE (low
) != INTEGER_CST
4858 || TREE_CODE (high
) != INTEGER_CST
)
4861 unsigned prec
= TYPE_PRECISION (type
);
4862 wide_int lo
= wi::to_wide (low
, prec
);
4863 wide_int hi
= wi::to_wide (high
, prec
);
4865 wide_int end_mask
= lo
^ hi
;
4866 if ((end_mask
& (end_mask
+ 1)) != 0
4867 || (lo
& end_mask
) != 0)
4870 wide_int stem_mask
= ~end_mask
;
4871 wide_int stem
= lo
& stem_mask
;
4872 if (stem
!= (hi
& stem_mask
))
4875 *mask
= wide_int_to_tree (type
, stem_mask
);
4876 *value
= wide_int_to_tree (type
, stem
);
4881 /* Helper routine for build_range_check and match.pd. Return the type to
4882 perform the check or NULL if it shouldn't be optimized. */
4885 range_check_type (tree etype
)
4887 /* First make sure that arithmetics in this type is valid, then make sure
4888 that it wraps around. */
4889 if (TREE_CODE (etype
) == ENUMERAL_TYPE
|| TREE_CODE (etype
) == BOOLEAN_TYPE
)
4890 etype
= lang_hooks
.types
.type_for_size (TYPE_PRECISION (etype
),
4891 TYPE_UNSIGNED (etype
));
4893 if (TREE_CODE (etype
) == INTEGER_TYPE
&& !TYPE_OVERFLOW_WRAPS (etype
))
4895 tree utype
, minv
, maxv
;
4897 /* Check if (unsigned) INT_MAX + 1 == (unsigned) INT_MIN
4898 for the type in question, as we rely on this here. */
4899 utype
= unsigned_type_for (etype
);
4900 maxv
= fold_convert (utype
, TYPE_MAX_VALUE (etype
));
4901 maxv
= range_binop (PLUS_EXPR
, NULL_TREE
, maxv
, 1,
4902 build_int_cst (TREE_TYPE (maxv
), 1), 1);
4903 minv
= fold_convert (utype
, TYPE_MIN_VALUE (etype
));
4905 if (integer_zerop (range_binop (NE_EXPR
, integer_type_node
,
4914 /* Given a range, LOW, HIGH, and IN_P, an expression, EXP, and a result
4915 type, TYPE, return an expression to test if EXP is in (or out of, depending
4916 on IN_P) the range. Return 0 if the test couldn't be created. */
4919 build_range_check (location_t loc
, tree type
, tree exp
, int in_p
,
4920 tree low
, tree high
)
4922 tree etype
= TREE_TYPE (exp
), mask
, value
;
4924 /* Disable this optimization for function pointer expressions
4925 on targets that require function pointer canonicalization. */
4926 if (targetm
.have_canonicalize_funcptr_for_compare ()
4927 && TREE_CODE (etype
) == POINTER_TYPE
4928 && TREE_CODE (TREE_TYPE (etype
)) == FUNCTION_TYPE
)
4933 value
= build_range_check (loc
, type
, exp
, 1, low
, high
);
4935 return invert_truthvalue_loc (loc
, value
);
4940 if (low
== 0 && high
== 0)
4941 return omit_one_operand_loc (loc
, type
, build_int_cst (type
, 1), exp
);
4944 return fold_build2_loc (loc
, LE_EXPR
, type
, exp
,
4945 fold_convert_loc (loc
, etype
, high
));
4948 return fold_build2_loc (loc
, GE_EXPR
, type
, exp
,
4949 fold_convert_loc (loc
, etype
, low
));
4951 if (operand_equal_p (low
, high
, 0))
4952 return fold_build2_loc (loc
, EQ_EXPR
, type
, exp
,
4953 fold_convert_loc (loc
, etype
, low
));
4955 if (TREE_CODE (exp
) == BIT_AND_EXPR
4956 && maskable_range_p (low
, high
, etype
, &mask
, &value
))
4957 return fold_build2_loc (loc
, EQ_EXPR
, type
,
4958 fold_build2_loc (loc
, BIT_AND_EXPR
, etype
,
4962 if (integer_zerop (low
))
4964 if (! TYPE_UNSIGNED (etype
))
4966 etype
= unsigned_type_for (etype
);
4967 high
= fold_convert_loc (loc
, etype
, high
);
4968 exp
= fold_convert_loc (loc
, etype
, exp
);
4970 return build_range_check (loc
, type
, exp
, 1, 0, high
);
4973 /* Optimize (c>=1) && (c<=127) into (signed char)c > 0. */
4974 if (integer_onep (low
) && TREE_CODE (high
) == INTEGER_CST
)
4976 int prec
= TYPE_PRECISION (etype
);
4978 if (wi::mask
<widest_int
> (prec
- 1, false) == wi::to_widest (high
))
4980 if (TYPE_UNSIGNED (etype
))
4982 tree signed_etype
= signed_type_for (etype
);
4983 if (TYPE_PRECISION (signed_etype
) != TYPE_PRECISION (etype
))
4985 = build_nonstandard_integer_type (TYPE_PRECISION (etype
), 0);
4987 etype
= signed_etype
;
4988 exp
= fold_convert_loc (loc
, etype
, exp
);
4990 return fold_build2_loc (loc
, GT_EXPR
, type
, exp
,
4991 build_int_cst (etype
, 0));
4995 /* Optimize (c>=low) && (c<=high) into (c-low>=0) && (c-low<=high-low).
4996 This requires wrap-around arithmetics for the type of the expression. */
4997 etype
= range_check_type (etype
);
4998 if (etype
== NULL_TREE
)
5001 if (POINTER_TYPE_P (etype
))
5002 etype
= unsigned_type_for (etype
);
5004 high
= fold_convert_loc (loc
, etype
, high
);
5005 low
= fold_convert_loc (loc
, etype
, low
);
5006 exp
= fold_convert_loc (loc
, etype
, exp
);
5008 value
= const_binop (MINUS_EXPR
, high
, low
);
5010 if (value
!= 0 && !TREE_OVERFLOW (value
))
5011 return build_range_check (loc
, type
,
5012 fold_build2_loc (loc
, MINUS_EXPR
, etype
, exp
, low
),
5013 1, build_int_cst (etype
, 0), value
);
5018 /* Return the predecessor of VAL in its type, handling the infinite case. */
5021 range_predecessor (tree val
)
5023 tree type
= TREE_TYPE (val
);
5025 if (INTEGRAL_TYPE_P (type
)
5026 && operand_equal_p (val
, TYPE_MIN_VALUE (type
), 0))
5029 return range_binop (MINUS_EXPR
, NULL_TREE
, val
, 0,
5030 build_int_cst (TREE_TYPE (val
), 1), 0);
5033 /* Return the successor of VAL in its type, handling the infinite case. */
5036 range_successor (tree val
)
5038 tree type
= TREE_TYPE (val
);
5040 if (INTEGRAL_TYPE_P (type
)
5041 && operand_equal_p (val
, TYPE_MAX_VALUE (type
), 0))
5044 return range_binop (PLUS_EXPR
, NULL_TREE
, val
, 0,
5045 build_int_cst (TREE_TYPE (val
), 1), 0);
5048 /* Given two ranges, see if we can merge them into one. Return 1 if we
5049 can, 0 if we can't. Set the output range into the specified parameters. */
5052 merge_ranges (int *pin_p
, tree
*plow
, tree
*phigh
, int in0_p
, tree low0
,
5053 tree high0
, int in1_p
, tree low1
, tree high1
)
5061 int lowequal
= ((low0
== 0 && low1
== 0)
5062 || integer_onep (range_binop (EQ_EXPR
, integer_type_node
,
5063 low0
, 0, low1
, 0)));
5064 int highequal
= ((high0
== 0 && high1
== 0)
5065 || integer_onep (range_binop (EQ_EXPR
, integer_type_node
,
5066 high0
, 1, high1
, 1)));
5068 /* Make range 0 be the range that starts first, or ends last if they
5069 start at the same value. Swap them if it isn't. */
5070 if (integer_onep (range_binop (GT_EXPR
, integer_type_node
,
5073 && integer_onep (range_binop (GT_EXPR
, integer_type_node
,
5074 high1
, 1, high0
, 1))))
5076 temp
= in0_p
, in0_p
= in1_p
, in1_p
= temp
;
5077 tem
= low0
, low0
= low1
, low1
= tem
;
5078 tem
= high0
, high0
= high1
, high1
= tem
;
5081 /* Now flag two cases, whether the ranges are disjoint or whether the
5082 second range is totally subsumed in the first. Note that the tests
5083 below are simplified by the ones above. */
5084 no_overlap
= integer_onep (range_binop (LT_EXPR
, integer_type_node
,
5085 high0
, 1, low1
, 0));
5086 subset
= integer_onep (range_binop (LE_EXPR
, integer_type_node
,
5087 high1
, 1, high0
, 1));
5089 /* We now have four cases, depending on whether we are including or
5090 excluding the two ranges. */
5093 /* If they don't overlap, the result is false. If the second range
5094 is a subset it is the result. Otherwise, the range is from the start
5095 of the second to the end of the first. */
5097 in_p
= 0, low
= high
= 0;
5099 in_p
= 1, low
= low1
, high
= high1
;
5101 in_p
= 1, low
= low1
, high
= high0
;
5104 else if (in0_p
&& ! in1_p
)
5106 /* If they don't overlap, the result is the first range. If they are
5107 equal, the result is false. If the second range is a subset of the
5108 first, and the ranges begin at the same place, we go from just after
5109 the end of the second range to the end of the first. If the second
5110 range is not a subset of the first, or if it is a subset and both
5111 ranges end at the same place, the range starts at the start of the
5112 first range and ends just before the second range.
5113 Otherwise, we can't describe this as a single range. */
5115 in_p
= 1, low
= low0
, high
= high0
;
5116 else if (lowequal
&& highequal
)
5117 in_p
= 0, low
= high
= 0;
5118 else if (subset
&& lowequal
)
5120 low
= range_successor (high1
);
5125 /* We are in the weird situation where high0 > high1 but
5126 high1 has no successor. Punt. */
5130 else if (! subset
|| highequal
)
5133 high
= range_predecessor (low1
);
5137 /* low0 < low1 but low1 has no predecessor. Punt. */
5145 else if (! in0_p
&& in1_p
)
5147 /* If they don't overlap, the result is the second range. If the second
5148 is a subset of the first, the result is false. Otherwise,
5149 the range starts just after the first range and ends at the
5150 end of the second. */
5152 in_p
= 1, low
= low1
, high
= high1
;
5153 else if (subset
|| highequal
)
5154 in_p
= 0, low
= high
= 0;
5157 low
= range_successor (high0
);
5162 /* high1 > high0 but high0 has no successor. Punt. */
5170 /* The case where we are excluding both ranges. Here the complex case
5171 is if they don't overlap. In that case, the only time we have a
5172 range is if they are adjacent. If the second is a subset of the
5173 first, the result is the first. Otherwise, the range to exclude
5174 starts at the beginning of the first range and ends at the end of the
5178 if (integer_onep (range_binop (EQ_EXPR
, integer_type_node
,
5179 range_successor (high0
),
5181 in_p
= 0, low
= low0
, high
= high1
;
5184 /* Canonicalize - [min, x] into - [-, x]. */
5185 if (low0
&& TREE_CODE (low0
) == INTEGER_CST
)
5186 switch (TREE_CODE (TREE_TYPE (low0
)))
5189 if (TYPE_PRECISION (TREE_TYPE (low0
))
5190 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (low0
))))
5194 if (tree_int_cst_equal (low0
,
5195 TYPE_MIN_VALUE (TREE_TYPE (low0
))))
5199 if (TYPE_UNSIGNED (TREE_TYPE (low0
))
5200 && integer_zerop (low0
))
5207 /* Canonicalize - [x, max] into - [x, -]. */
5208 if (high1
&& TREE_CODE (high1
) == INTEGER_CST
)
5209 switch (TREE_CODE (TREE_TYPE (high1
)))
5212 if (TYPE_PRECISION (TREE_TYPE (high1
))
5213 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (high1
))))
5217 if (tree_int_cst_equal (high1
,
5218 TYPE_MAX_VALUE (TREE_TYPE (high1
))))
5222 if (TYPE_UNSIGNED (TREE_TYPE (high1
))
5223 && integer_zerop (range_binop (PLUS_EXPR
, NULL_TREE
,
5225 build_int_cst (TREE_TYPE (high1
), 1),
5233 /* The ranges might be also adjacent between the maximum and
5234 minimum values of the given type. For
5235 - [{min,-}, x] and - [y, {max,-}] ranges where x + 1 < y
5236 return + [x + 1, y - 1]. */
5237 if (low0
== 0 && high1
== 0)
5239 low
= range_successor (high0
);
5240 high
= range_predecessor (low1
);
5241 if (low
== 0 || high
== 0)
5251 in_p
= 0, low
= low0
, high
= high0
;
5253 in_p
= 0, low
= low0
, high
= high1
;
5256 *pin_p
= in_p
, *plow
= low
, *phigh
= high
;
5261 /* Subroutine of fold, looking inside expressions of the form
5262 A op B ? A : C, where ARG0, ARG1 and ARG2 are the three operands
5263 of the COND_EXPR. This function is being used also to optimize
5264 A op B ? C : A, by reversing the comparison first.
5266 Return a folded expression whose code is not a COND_EXPR
5267 anymore, or NULL_TREE if no folding opportunity is found. */
5270 fold_cond_expr_with_comparison (location_t loc
, tree type
,
5271 tree arg0
, tree arg1
, tree arg2
)
5273 enum tree_code comp_code
= TREE_CODE (arg0
);
5274 tree arg00
= TREE_OPERAND (arg0
, 0);
5275 tree arg01
= TREE_OPERAND (arg0
, 1);
5276 tree arg1_type
= TREE_TYPE (arg1
);
5282 /* If we have A op 0 ? A : -A, consider applying the following
5285 A == 0? A : -A same as -A
5286 A != 0? A : -A same as A
5287 A >= 0? A : -A same as abs (A)
5288 A > 0? A : -A same as abs (A)
5289 A <= 0? A : -A same as -abs (A)
5290 A < 0? A : -A same as -abs (A)
5292 None of these transformations work for modes with signed
5293 zeros. If A is +/-0, the first two transformations will
5294 change the sign of the result (from +0 to -0, or vice
5295 versa). The last four will fix the sign of the result,
5296 even though the original expressions could be positive or
5297 negative, depending on the sign of A.
5299 Note that all these transformations are correct if A is
5300 NaN, since the two alternatives (A and -A) are also NaNs. */
5301 if (!HONOR_SIGNED_ZEROS (element_mode (type
))
5302 && (FLOAT_TYPE_P (TREE_TYPE (arg01
))
5303 ? real_zerop (arg01
)
5304 : integer_zerop (arg01
))
5305 && ((TREE_CODE (arg2
) == NEGATE_EXPR
5306 && operand_equal_p (TREE_OPERAND (arg2
, 0), arg1
, 0))
5307 /* In the case that A is of the form X-Y, '-A' (arg2) may
5308 have already been folded to Y-X, check for that. */
5309 || (TREE_CODE (arg1
) == MINUS_EXPR
5310 && TREE_CODE (arg2
) == MINUS_EXPR
5311 && operand_equal_p (TREE_OPERAND (arg1
, 0),
5312 TREE_OPERAND (arg2
, 1), 0)
5313 && operand_equal_p (TREE_OPERAND (arg1
, 1),
5314 TREE_OPERAND (arg2
, 0), 0))))
5319 tem
= fold_convert_loc (loc
, arg1_type
, arg1
);
5320 return fold_convert_loc (loc
, type
, negate_expr (tem
));
5323 return fold_convert_loc (loc
, type
, arg1
);
5326 if (flag_trapping_math
)
5331 if (TYPE_UNSIGNED (TREE_TYPE (arg1
)))
5333 tem
= fold_build1_loc (loc
, ABS_EXPR
, TREE_TYPE (arg1
), arg1
);
5334 return fold_convert_loc (loc
, type
, tem
);
5337 if (flag_trapping_math
)
5342 if (TYPE_UNSIGNED (TREE_TYPE (arg1
)))
5344 tem
= fold_build1_loc (loc
, ABS_EXPR
, TREE_TYPE (arg1
), arg1
);
5345 return negate_expr (fold_convert_loc (loc
, type
, tem
));
5347 gcc_assert (TREE_CODE_CLASS (comp_code
) == tcc_comparison
);
5351 /* A != 0 ? A : 0 is simply A, unless A is -0. Likewise
5352 A == 0 ? A : 0 is always 0 unless A is -0. Note that
5353 both transformations are correct when A is NaN: A != 0
5354 is then true, and A == 0 is false. */
5356 if (!HONOR_SIGNED_ZEROS (element_mode (type
))
5357 && integer_zerop (arg01
) && integer_zerop (arg2
))
5359 if (comp_code
== NE_EXPR
)
5360 return fold_convert_loc (loc
, type
, arg1
);
5361 else if (comp_code
== EQ_EXPR
)
5362 return build_zero_cst (type
);
5365 /* Try some transformations of A op B ? A : B.
5367 A == B? A : B same as B
5368 A != B? A : B same as A
5369 A >= B? A : B same as max (A, B)
5370 A > B? A : B same as max (B, A)
5371 A <= B? A : B same as min (A, B)
5372 A < B? A : B same as min (B, A)
5374 As above, these transformations don't work in the presence
5375 of signed zeros. For example, if A and B are zeros of
5376 opposite sign, the first two transformations will change
5377 the sign of the result. In the last four, the original
5378 expressions give different results for (A=+0, B=-0) and
5379 (A=-0, B=+0), but the transformed expressions do not.
5381 The first two transformations are correct if either A or B
5382 is a NaN. In the first transformation, the condition will
5383 be false, and B will indeed be chosen. In the case of the
5384 second transformation, the condition A != B will be true,
5385 and A will be chosen.
5387 The conversions to max() and min() are not correct if B is
5388 a number and A is not. The conditions in the original
5389 expressions will be false, so all four give B. The min()
5390 and max() versions would give a NaN instead. */
5391 if (!HONOR_SIGNED_ZEROS (element_mode (type
))
5392 && operand_equal_for_comparison_p (arg01
, arg2
)
5393 /* Avoid these transformations if the COND_EXPR may be used
5394 as an lvalue in the C++ front-end. PR c++/19199. */
5396 || VECTOR_TYPE_P (type
)
5397 || (! lang_GNU_CXX ()
5398 && strcmp (lang_hooks
.name
, "GNU Objective-C++") != 0)
5399 || ! maybe_lvalue_p (arg1
)
5400 || ! maybe_lvalue_p (arg2
)))
5402 tree comp_op0
= arg00
;
5403 tree comp_op1
= arg01
;
5404 tree comp_type
= TREE_TYPE (comp_op0
);
5409 return fold_convert_loc (loc
, type
, arg2
);
5411 return fold_convert_loc (loc
, type
, arg1
);
5416 /* In C++ a ?: expression can be an lvalue, so put the
5417 operand which will be used if they are equal first
5418 so that we can convert this back to the
5419 corresponding COND_EXPR. */
5420 if (!HONOR_NANS (arg1
))
5422 comp_op0
= fold_convert_loc (loc
, comp_type
, comp_op0
);
5423 comp_op1
= fold_convert_loc (loc
, comp_type
, comp_op1
);
5424 tem
= (comp_code
== LE_EXPR
|| comp_code
== UNLE_EXPR
)
5425 ? fold_build2_loc (loc
, MIN_EXPR
, comp_type
, comp_op0
, comp_op1
)
5426 : fold_build2_loc (loc
, MIN_EXPR
, comp_type
,
5427 comp_op1
, comp_op0
);
5428 return fold_convert_loc (loc
, type
, tem
);
5435 if (!HONOR_NANS (arg1
))
5437 comp_op0
= fold_convert_loc (loc
, comp_type
, comp_op0
);
5438 comp_op1
= fold_convert_loc (loc
, comp_type
, comp_op1
);
5439 tem
= (comp_code
== GE_EXPR
|| comp_code
== UNGE_EXPR
)
5440 ? fold_build2_loc (loc
, MAX_EXPR
, comp_type
, comp_op0
, comp_op1
)
5441 : fold_build2_loc (loc
, MAX_EXPR
, comp_type
,
5442 comp_op1
, comp_op0
);
5443 return fold_convert_loc (loc
, type
, tem
);
5447 if (!HONOR_NANS (arg1
))
5448 return fold_convert_loc (loc
, type
, arg2
);
5451 if (!HONOR_NANS (arg1
))
5452 return fold_convert_loc (loc
, type
, arg1
);
5455 gcc_assert (TREE_CODE_CLASS (comp_code
) == tcc_comparison
);
5465 #ifndef LOGICAL_OP_NON_SHORT_CIRCUIT
5466 #define LOGICAL_OP_NON_SHORT_CIRCUIT \
5467 (BRANCH_COST (optimize_function_for_speed_p (cfun), \
5471 /* EXP is some logical combination of boolean tests. See if we can
5472 merge it into some range test. Return the new tree if so. */
5475 fold_range_test (location_t loc
, enum tree_code code
, tree type
,
5478 int or_op
= (code
== TRUTH_ORIF_EXPR
5479 || code
== TRUTH_OR_EXPR
);
5480 int in0_p
, in1_p
, in_p
;
5481 tree low0
, low1
, low
, high0
, high1
, high
;
5482 bool strict_overflow_p
= false;
5484 const char * const warnmsg
= G_("assuming signed overflow does not occur "
5485 "when simplifying range test");
5487 if (!INTEGRAL_TYPE_P (type
))
5490 lhs
= make_range (op0
, &in0_p
, &low0
, &high0
, &strict_overflow_p
);
5491 rhs
= make_range (op1
, &in1_p
, &low1
, &high1
, &strict_overflow_p
);
5493 /* If this is an OR operation, invert both sides; we will invert
5494 again at the end. */
5496 in0_p
= ! in0_p
, in1_p
= ! in1_p
;
5498 /* If both expressions are the same, if we can merge the ranges, and we
5499 can build the range test, return it or it inverted. If one of the
5500 ranges is always true or always false, consider it to be the same
5501 expression as the other. */
5502 if ((lhs
== 0 || rhs
== 0 || operand_equal_p (lhs
, rhs
, 0))
5503 && merge_ranges (&in_p
, &low
, &high
, in0_p
, low0
, high0
,
5505 && (tem
= (build_range_check (loc
, type
,
5507 : rhs
!= 0 ? rhs
: integer_zero_node
,
5508 in_p
, low
, high
))) != 0)
5510 if (strict_overflow_p
)
5511 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_COMPARISON
);
5512 return or_op
? invert_truthvalue_loc (loc
, tem
) : tem
;
5515 /* On machines where the branch cost is expensive, if this is a
5516 short-circuited branch and the underlying object on both sides
5517 is the same, make a non-short-circuit operation. */
5518 else if (LOGICAL_OP_NON_SHORT_CIRCUIT
5519 && !flag_sanitize_coverage
5520 && lhs
!= 0 && rhs
!= 0
5521 && (code
== TRUTH_ANDIF_EXPR
5522 || code
== TRUTH_ORIF_EXPR
)
5523 && operand_equal_p (lhs
, rhs
, 0))
5525 /* If simple enough, just rewrite. Otherwise, make a SAVE_EXPR
5526 unless we are at top level or LHS contains a PLACEHOLDER_EXPR, in
5527 which cases we can't do this. */
5528 if (simple_operand_p (lhs
))
5529 return build2_loc (loc
, code
== TRUTH_ANDIF_EXPR
5530 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
,
5533 else if (!lang_hooks
.decls
.global_bindings_p ()
5534 && !CONTAINS_PLACEHOLDER_P (lhs
))
5536 tree common
= save_expr (lhs
);
5538 if ((lhs
= build_range_check (loc
, type
, common
,
5539 or_op
? ! in0_p
: in0_p
,
5541 && (rhs
= build_range_check (loc
, type
, common
,
5542 or_op
? ! in1_p
: in1_p
,
5545 if (strict_overflow_p
)
5546 fold_overflow_warning (warnmsg
,
5547 WARN_STRICT_OVERFLOW_COMPARISON
);
5548 return build2_loc (loc
, code
== TRUTH_ANDIF_EXPR
5549 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
,
5558 /* Subroutine for fold_truth_andor_1: C is an INTEGER_CST interpreted as a P
5559 bit value. Arrange things so the extra bits will be set to zero if and
5560 only if C is signed-extended to its full width. If MASK is nonzero,
5561 it is an INTEGER_CST that should be AND'ed with the extra bits. */
5564 unextend (tree c
, int p
, int unsignedp
, tree mask
)
5566 tree type
= TREE_TYPE (c
);
5567 int modesize
= GET_MODE_BITSIZE (SCALAR_INT_TYPE_MODE (type
));
5570 if (p
== modesize
|| unsignedp
)
5573 /* We work by getting just the sign bit into the low-order bit, then
5574 into the high-order bit, then sign-extend. We then XOR that value
5576 temp
= build_int_cst (TREE_TYPE (c
),
5577 wi::extract_uhwi (wi::to_wide (c
), p
- 1, 1));
5579 /* We must use a signed type in order to get an arithmetic right shift.
5580 However, we must also avoid introducing accidental overflows, so that
5581 a subsequent call to integer_zerop will work. Hence we must
5582 do the type conversion here. At this point, the constant is either
5583 zero or one, and the conversion to a signed type can never overflow.
5584 We could get an overflow if this conversion is done anywhere else. */
5585 if (TYPE_UNSIGNED (type
))
5586 temp
= fold_convert (signed_type_for (type
), temp
);
5588 temp
= const_binop (LSHIFT_EXPR
, temp
, size_int (modesize
- 1));
5589 temp
= const_binop (RSHIFT_EXPR
, temp
, size_int (modesize
- p
- 1));
5591 temp
= const_binop (BIT_AND_EXPR
, temp
,
5592 fold_convert (TREE_TYPE (c
), mask
));
5593 /* If necessary, convert the type back to match the type of C. */
5594 if (TYPE_UNSIGNED (type
))
5595 temp
= fold_convert (type
, temp
);
5597 return fold_convert (type
, const_binop (BIT_XOR_EXPR
, c
, temp
));
5600 /* For an expression that has the form
5604 we can drop one of the inner expressions and simplify to
5608 LOC is the location of the resulting expression. OP is the inner
5609 logical operation; the left-hand side in the examples above, while CMPOP
5610 is the right-hand side. RHS_ONLY is used to prevent us from accidentally
5611 removing a condition that guards another, as in
5612 (A != NULL && A->...) || A == NULL
5613 which we must not transform. If RHS_ONLY is true, only eliminate the
5614 right-most operand of the inner logical operation. */
5617 merge_truthop_with_opposite_arm (location_t loc
, tree op
, tree cmpop
,
5620 tree type
= TREE_TYPE (cmpop
);
5621 enum tree_code code
= TREE_CODE (cmpop
);
5622 enum tree_code truthop_code
= TREE_CODE (op
);
5623 tree lhs
= TREE_OPERAND (op
, 0);
5624 tree rhs
= TREE_OPERAND (op
, 1);
5625 tree orig_lhs
= lhs
, orig_rhs
= rhs
;
5626 enum tree_code rhs_code
= TREE_CODE (rhs
);
5627 enum tree_code lhs_code
= TREE_CODE (lhs
);
5628 enum tree_code inv_code
;
5630 if (TREE_SIDE_EFFECTS (op
) || TREE_SIDE_EFFECTS (cmpop
))
5633 if (TREE_CODE_CLASS (code
) != tcc_comparison
)
5636 if (rhs_code
== truthop_code
)
5638 tree newrhs
= merge_truthop_with_opposite_arm (loc
, rhs
, cmpop
, rhs_only
);
5639 if (newrhs
!= NULL_TREE
)
5642 rhs_code
= TREE_CODE (rhs
);
5645 if (lhs_code
== truthop_code
&& !rhs_only
)
5647 tree newlhs
= merge_truthop_with_opposite_arm (loc
, lhs
, cmpop
, false);
5648 if (newlhs
!= NULL_TREE
)
5651 lhs_code
= TREE_CODE (lhs
);
5655 inv_code
= invert_tree_comparison (code
, HONOR_NANS (type
));
5656 if (inv_code
== rhs_code
5657 && operand_equal_p (TREE_OPERAND (rhs
, 0), TREE_OPERAND (cmpop
, 0), 0)
5658 && operand_equal_p (TREE_OPERAND (rhs
, 1), TREE_OPERAND (cmpop
, 1), 0))
5660 if (!rhs_only
&& inv_code
== lhs_code
5661 && operand_equal_p (TREE_OPERAND (lhs
, 0), TREE_OPERAND (cmpop
, 0), 0)
5662 && operand_equal_p (TREE_OPERAND (lhs
, 1), TREE_OPERAND (cmpop
, 1), 0))
5664 if (rhs
!= orig_rhs
|| lhs
!= orig_lhs
)
5665 return fold_build2_loc (loc
, truthop_code
, TREE_TYPE (cmpop
),
5670 /* Find ways of folding logical expressions of LHS and RHS:
5671 Try to merge two comparisons to the same innermost item.
5672 Look for range tests like "ch >= '0' && ch <= '9'".
5673 Look for combinations of simple terms on machines with expensive branches
5674 and evaluate the RHS unconditionally.
5676 For example, if we have p->a == 2 && p->b == 4 and we can make an
5677 object large enough to span both A and B, we can do this with a comparison
5678 against the object ANDed with the a mask.
5680 If we have p->a == q->a && p->b == q->b, we may be able to use bit masking
5681 operations to do this with one comparison.
5683 We check for both normal comparisons and the BIT_AND_EXPRs made this by
5684 function and the one above.
5686 CODE is the logical operation being done. It can be TRUTH_ANDIF_EXPR,
5687 TRUTH_AND_EXPR, TRUTH_ORIF_EXPR, or TRUTH_OR_EXPR.
5689 TRUTH_TYPE is the type of the logical operand and LHS and RHS are its
5692 We return the simplified tree or 0 if no optimization is possible. */
5695 fold_truth_andor_1 (location_t loc
, enum tree_code code
, tree truth_type
,
5698 /* If this is the "or" of two comparisons, we can do something if
5699 the comparisons are NE_EXPR. If this is the "and", we can do something
5700 if the comparisons are EQ_EXPR. I.e.,
5701 (a->b == 2 && a->c == 4) can become (a->new == NEW).
5703 WANTED_CODE is this operation code. For single bit fields, we can
5704 convert EQ_EXPR to NE_EXPR so we need not reject the "wrong"
5705 comparison for one-bit fields. */
5707 enum tree_code wanted_code
;
5708 enum tree_code lcode
, rcode
;
5709 tree ll_arg
, lr_arg
, rl_arg
, rr_arg
;
5710 tree ll_inner
, lr_inner
, rl_inner
, rr_inner
;
5711 HOST_WIDE_INT ll_bitsize
, ll_bitpos
, lr_bitsize
, lr_bitpos
;
5712 HOST_WIDE_INT rl_bitsize
, rl_bitpos
, rr_bitsize
, rr_bitpos
;
5713 HOST_WIDE_INT xll_bitpos
, xlr_bitpos
, xrl_bitpos
, xrr_bitpos
;
5714 HOST_WIDE_INT lnbitsize
, lnbitpos
, rnbitsize
, rnbitpos
;
5715 int ll_unsignedp
, lr_unsignedp
, rl_unsignedp
, rr_unsignedp
;
5716 int ll_reversep
, lr_reversep
, rl_reversep
, rr_reversep
;
5717 machine_mode ll_mode
, lr_mode
, rl_mode
, rr_mode
;
5718 scalar_int_mode lnmode
, rnmode
;
5719 tree ll_mask
, lr_mask
, rl_mask
, rr_mask
;
5720 tree ll_and_mask
, lr_and_mask
, rl_and_mask
, rr_and_mask
;
5721 tree l_const
, r_const
;
5722 tree lntype
, rntype
, result
;
5723 HOST_WIDE_INT first_bit
, end_bit
;
5726 /* Start by getting the comparison codes. Fail if anything is volatile.
5727 If one operand is a BIT_AND_EXPR with the constant one, treat it as if
5728 it were surrounded with a NE_EXPR. */
5730 if (TREE_SIDE_EFFECTS (lhs
) || TREE_SIDE_EFFECTS (rhs
))
5733 lcode
= TREE_CODE (lhs
);
5734 rcode
= TREE_CODE (rhs
);
5736 if (lcode
== BIT_AND_EXPR
&& integer_onep (TREE_OPERAND (lhs
, 1)))
5738 lhs
= build2 (NE_EXPR
, truth_type
, lhs
,
5739 build_int_cst (TREE_TYPE (lhs
), 0));
5743 if (rcode
== BIT_AND_EXPR
&& integer_onep (TREE_OPERAND (rhs
, 1)))
5745 rhs
= build2 (NE_EXPR
, truth_type
, rhs
,
5746 build_int_cst (TREE_TYPE (rhs
), 0));
5750 if (TREE_CODE_CLASS (lcode
) != tcc_comparison
5751 || TREE_CODE_CLASS (rcode
) != tcc_comparison
)
5754 ll_arg
= TREE_OPERAND (lhs
, 0);
5755 lr_arg
= TREE_OPERAND (lhs
, 1);
5756 rl_arg
= TREE_OPERAND (rhs
, 0);
5757 rr_arg
= TREE_OPERAND (rhs
, 1);
5759 /* Simplify (x<y) && (x==y) into (x<=y) and related optimizations. */
5760 if (simple_operand_p (ll_arg
)
5761 && simple_operand_p (lr_arg
))
5763 if (operand_equal_p (ll_arg
, rl_arg
, 0)
5764 && operand_equal_p (lr_arg
, rr_arg
, 0))
5766 result
= combine_comparisons (loc
, code
, lcode
, rcode
,
5767 truth_type
, ll_arg
, lr_arg
);
5771 else if (operand_equal_p (ll_arg
, rr_arg
, 0)
5772 && operand_equal_p (lr_arg
, rl_arg
, 0))
5774 result
= combine_comparisons (loc
, code
, lcode
,
5775 swap_tree_comparison (rcode
),
5776 truth_type
, ll_arg
, lr_arg
);
5782 code
= ((code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
)
5783 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
);
5785 /* If the RHS can be evaluated unconditionally and its operands are
5786 simple, it wins to evaluate the RHS unconditionally on machines
5787 with expensive branches. In this case, this isn't a comparison
5788 that can be merged. */
5790 if (BRANCH_COST (optimize_function_for_speed_p (cfun
),
5792 && ! FLOAT_TYPE_P (TREE_TYPE (rl_arg
))
5793 && simple_operand_p (rl_arg
)
5794 && simple_operand_p (rr_arg
))
5796 /* Convert (a != 0) || (b != 0) into (a | b) != 0. */
5797 if (code
== TRUTH_OR_EXPR
5798 && lcode
== NE_EXPR
&& integer_zerop (lr_arg
)
5799 && rcode
== NE_EXPR
&& integer_zerop (rr_arg
)
5800 && TREE_TYPE (ll_arg
) == TREE_TYPE (rl_arg
)
5801 && INTEGRAL_TYPE_P (TREE_TYPE (ll_arg
)))
5802 return build2_loc (loc
, NE_EXPR
, truth_type
,
5803 build2 (BIT_IOR_EXPR
, TREE_TYPE (ll_arg
),
5805 build_int_cst (TREE_TYPE (ll_arg
), 0));
5807 /* Convert (a == 0) && (b == 0) into (a | b) == 0. */
5808 if (code
== TRUTH_AND_EXPR
5809 && lcode
== EQ_EXPR
&& integer_zerop (lr_arg
)
5810 && rcode
== EQ_EXPR
&& integer_zerop (rr_arg
)
5811 && TREE_TYPE (ll_arg
) == TREE_TYPE (rl_arg
)
5812 && INTEGRAL_TYPE_P (TREE_TYPE (ll_arg
)))
5813 return build2_loc (loc
, EQ_EXPR
, truth_type
,
5814 build2 (BIT_IOR_EXPR
, TREE_TYPE (ll_arg
),
5816 build_int_cst (TREE_TYPE (ll_arg
), 0));
5819 /* See if the comparisons can be merged. Then get all the parameters for
5822 if ((lcode
!= EQ_EXPR
&& lcode
!= NE_EXPR
)
5823 || (rcode
!= EQ_EXPR
&& rcode
!= NE_EXPR
))
5826 ll_reversep
= lr_reversep
= rl_reversep
= rr_reversep
= 0;
5828 ll_inner
= decode_field_reference (loc
, &ll_arg
,
5829 &ll_bitsize
, &ll_bitpos
, &ll_mode
,
5830 &ll_unsignedp
, &ll_reversep
, &volatilep
,
5831 &ll_mask
, &ll_and_mask
);
5832 lr_inner
= decode_field_reference (loc
, &lr_arg
,
5833 &lr_bitsize
, &lr_bitpos
, &lr_mode
,
5834 &lr_unsignedp
, &lr_reversep
, &volatilep
,
5835 &lr_mask
, &lr_and_mask
);
5836 rl_inner
= decode_field_reference (loc
, &rl_arg
,
5837 &rl_bitsize
, &rl_bitpos
, &rl_mode
,
5838 &rl_unsignedp
, &rl_reversep
, &volatilep
,
5839 &rl_mask
, &rl_and_mask
);
5840 rr_inner
= decode_field_reference (loc
, &rr_arg
,
5841 &rr_bitsize
, &rr_bitpos
, &rr_mode
,
5842 &rr_unsignedp
, &rr_reversep
, &volatilep
,
5843 &rr_mask
, &rr_and_mask
);
5845 /* It must be true that the inner operation on the lhs of each
5846 comparison must be the same if we are to be able to do anything.
5847 Then see if we have constants. If not, the same must be true for
5850 || ll_reversep
!= rl_reversep
5851 || ll_inner
== 0 || rl_inner
== 0
5852 || ! operand_equal_p (ll_inner
, rl_inner
, 0))
5855 if (TREE_CODE (lr_arg
) == INTEGER_CST
5856 && TREE_CODE (rr_arg
) == INTEGER_CST
)
5858 l_const
= lr_arg
, r_const
= rr_arg
;
5859 lr_reversep
= ll_reversep
;
5861 else if (lr_reversep
!= rr_reversep
5862 || lr_inner
== 0 || rr_inner
== 0
5863 || ! operand_equal_p (lr_inner
, rr_inner
, 0))
5866 l_const
= r_const
= 0;
5868 /* If either comparison code is not correct for our logical operation,
5869 fail. However, we can convert a one-bit comparison against zero into
5870 the opposite comparison against that bit being set in the field. */
5872 wanted_code
= (code
== TRUTH_AND_EXPR
? EQ_EXPR
: NE_EXPR
);
5873 if (lcode
!= wanted_code
)
5875 if (l_const
&& integer_zerop (l_const
) && integer_pow2p (ll_mask
))
5877 /* Make the left operand unsigned, since we are only interested
5878 in the value of one bit. Otherwise we are doing the wrong
5887 /* This is analogous to the code for l_const above. */
5888 if (rcode
!= wanted_code
)
5890 if (r_const
&& integer_zerop (r_const
) && integer_pow2p (rl_mask
))
5899 /* See if we can find a mode that contains both fields being compared on
5900 the left. If we can't, fail. Otherwise, update all constants and masks
5901 to be relative to a field of that size. */
5902 first_bit
= MIN (ll_bitpos
, rl_bitpos
);
5903 end_bit
= MAX (ll_bitpos
+ ll_bitsize
, rl_bitpos
+ rl_bitsize
);
5904 if (!get_best_mode (end_bit
- first_bit
, first_bit
, 0, 0,
5905 TYPE_ALIGN (TREE_TYPE (ll_inner
)), BITS_PER_WORD
,
5906 volatilep
, &lnmode
))
5909 lnbitsize
= GET_MODE_BITSIZE (lnmode
);
5910 lnbitpos
= first_bit
& ~ (lnbitsize
- 1);
5911 lntype
= lang_hooks
.types
.type_for_size (lnbitsize
, 1);
5912 xll_bitpos
= ll_bitpos
- lnbitpos
, xrl_bitpos
= rl_bitpos
- lnbitpos
;
5914 if (ll_reversep
? !BYTES_BIG_ENDIAN
: BYTES_BIG_ENDIAN
)
5916 xll_bitpos
= lnbitsize
- xll_bitpos
- ll_bitsize
;
5917 xrl_bitpos
= lnbitsize
- xrl_bitpos
- rl_bitsize
;
5920 ll_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
, lntype
, ll_mask
),
5921 size_int (xll_bitpos
));
5922 rl_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
, lntype
, rl_mask
),
5923 size_int (xrl_bitpos
));
5927 l_const
= fold_convert_loc (loc
, lntype
, l_const
);
5928 l_const
= unextend (l_const
, ll_bitsize
, ll_unsignedp
, ll_and_mask
);
5929 l_const
= const_binop (LSHIFT_EXPR
, l_const
, size_int (xll_bitpos
));
5930 if (! integer_zerop (const_binop (BIT_AND_EXPR
, l_const
,
5931 fold_build1_loc (loc
, BIT_NOT_EXPR
,
5934 warning (0, "comparison is always %d", wanted_code
== NE_EXPR
);
5936 return constant_boolean_node (wanted_code
== NE_EXPR
, truth_type
);
5941 r_const
= fold_convert_loc (loc
, lntype
, r_const
);
5942 r_const
= unextend (r_const
, rl_bitsize
, rl_unsignedp
, rl_and_mask
);
5943 r_const
= const_binop (LSHIFT_EXPR
, r_const
, size_int (xrl_bitpos
));
5944 if (! integer_zerop (const_binop (BIT_AND_EXPR
, r_const
,
5945 fold_build1_loc (loc
, BIT_NOT_EXPR
,
5948 warning (0, "comparison is always %d", wanted_code
== NE_EXPR
);
5950 return constant_boolean_node (wanted_code
== NE_EXPR
, truth_type
);
5954 /* If the right sides are not constant, do the same for it. Also,
5955 disallow this optimization if a size or signedness mismatch occurs
5956 between the left and right sides. */
5959 if (ll_bitsize
!= lr_bitsize
|| rl_bitsize
!= rr_bitsize
5960 || ll_unsignedp
!= lr_unsignedp
|| rl_unsignedp
!= rr_unsignedp
5961 /* Make sure the two fields on the right
5962 correspond to the left without being swapped. */
5963 || ll_bitpos
- rl_bitpos
!= lr_bitpos
- rr_bitpos
)
5966 first_bit
= MIN (lr_bitpos
, rr_bitpos
);
5967 end_bit
= MAX (lr_bitpos
+ lr_bitsize
, rr_bitpos
+ rr_bitsize
);
5968 if (!get_best_mode (end_bit
- first_bit
, first_bit
, 0, 0,
5969 TYPE_ALIGN (TREE_TYPE (lr_inner
)), BITS_PER_WORD
,
5970 volatilep
, &rnmode
))
5973 rnbitsize
= GET_MODE_BITSIZE (rnmode
);
5974 rnbitpos
= first_bit
& ~ (rnbitsize
- 1);
5975 rntype
= lang_hooks
.types
.type_for_size (rnbitsize
, 1);
5976 xlr_bitpos
= lr_bitpos
- rnbitpos
, xrr_bitpos
= rr_bitpos
- rnbitpos
;
5978 if (lr_reversep
? !BYTES_BIG_ENDIAN
: BYTES_BIG_ENDIAN
)
5980 xlr_bitpos
= rnbitsize
- xlr_bitpos
- lr_bitsize
;
5981 xrr_bitpos
= rnbitsize
- xrr_bitpos
- rr_bitsize
;
5984 lr_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
,
5986 size_int (xlr_bitpos
));
5987 rr_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
,
5989 size_int (xrr_bitpos
));
5991 /* Make a mask that corresponds to both fields being compared.
5992 Do this for both items being compared. If the operands are the
5993 same size and the bits being compared are in the same position
5994 then we can do this by masking both and comparing the masked
5996 ll_mask
= const_binop (BIT_IOR_EXPR
, ll_mask
, rl_mask
);
5997 lr_mask
= const_binop (BIT_IOR_EXPR
, lr_mask
, rr_mask
);
5998 if (lnbitsize
== rnbitsize
5999 && xll_bitpos
== xlr_bitpos
6003 lhs
= make_bit_field_ref (loc
, ll_inner
, ll_arg
,
6004 lntype
, lnbitsize
, lnbitpos
,
6005 ll_unsignedp
|| rl_unsignedp
, ll_reversep
);
6006 if (! all_ones_mask_p (ll_mask
, lnbitsize
))
6007 lhs
= build2 (BIT_AND_EXPR
, lntype
, lhs
, ll_mask
);
6009 rhs
= make_bit_field_ref (loc
, lr_inner
, lr_arg
,
6010 rntype
, rnbitsize
, rnbitpos
,
6011 lr_unsignedp
|| rr_unsignedp
, lr_reversep
);
6012 if (! all_ones_mask_p (lr_mask
, rnbitsize
))
6013 rhs
= build2 (BIT_AND_EXPR
, rntype
, rhs
, lr_mask
);
6015 return build2_loc (loc
, wanted_code
, truth_type
, lhs
, rhs
);
6018 /* There is still another way we can do something: If both pairs of
6019 fields being compared are adjacent, we may be able to make a wider
6020 field containing them both.
6022 Note that we still must mask the lhs/rhs expressions. Furthermore,
6023 the mask must be shifted to account for the shift done by
6024 make_bit_field_ref. */
6025 if (((ll_bitsize
+ ll_bitpos
== rl_bitpos
6026 && lr_bitsize
+ lr_bitpos
== rr_bitpos
)
6027 || (ll_bitpos
== rl_bitpos
+ rl_bitsize
6028 && lr_bitpos
== rr_bitpos
+ rr_bitsize
))
6036 lhs
= make_bit_field_ref (loc
, ll_inner
, ll_arg
, lntype
,
6037 ll_bitsize
+ rl_bitsize
,
6038 MIN (ll_bitpos
, rl_bitpos
),
6039 ll_unsignedp
, ll_reversep
);
6040 rhs
= make_bit_field_ref (loc
, lr_inner
, lr_arg
, rntype
,
6041 lr_bitsize
+ rr_bitsize
,
6042 MIN (lr_bitpos
, rr_bitpos
),
6043 lr_unsignedp
, lr_reversep
);
6045 ll_mask
= const_binop (RSHIFT_EXPR
, ll_mask
,
6046 size_int (MIN (xll_bitpos
, xrl_bitpos
)));
6047 lr_mask
= const_binop (RSHIFT_EXPR
, lr_mask
,
6048 size_int (MIN (xlr_bitpos
, xrr_bitpos
)));
6050 /* Convert to the smaller type before masking out unwanted bits. */
6052 if (lntype
!= rntype
)
6054 if (lnbitsize
> rnbitsize
)
6056 lhs
= fold_convert_loc (loc
, rntype
, lhs
);
6057 ll_mask
= fold_convert_loc (loc
, rntype
, ll_mask
);
6060 else if (lnbitsize
< rnbitsize
)
6062 rhs
= fold_convert_loc (loc
, lntype
, rhs
);
6063 lr_mask
= fold_convert_loc (loc
, lntype
, lr_mask
);
6068 if (! all_ones_mask_p (ll_mask
, ll_bitsize
+ rl_bitsize
))
6069 lhs
= build2 (BIT_AND_EXPR
, type
, lhs
, ll_mask
);
6071 if (! all_ones_mask_p (lr_mask
, lr_bitsize
+ rr_bitsize
))
6072 rhs
= build2 (BIT_AND_EXPR
, type
, rhs
, lr_mask
);
6074 return build2_loc (loc
, wanted_code
, truth_type
, lhs
, rhs
);
6080 /* Handle the case of comparisons with constants. If there is something in
6081 common between the masks, those bits of the constants must be the same.
6082 If not, the condition is always false. Test for this to avoid generating
6083 incorrect code below. */
6084 result
= const_binop (BIT_AND_EXPR
, ll_mask
, rl_mask
);
6085 if (! integer_zerop (result
)
6086 && simple_cst_equal (const_binop (BIT_AND_EXPR
, result
, l_const
),
6087 const_binop (BIT_AND_EXPR
, result
, r_const
)) != 1)
6089 if (wanted_code
== NE_EXPR
)
6091 warning (0, "%<or%> of unmatched not-equal tests is always 1");
6092 return constant_boolean_node (true, truth_type
);
6096 warning (0, "%<and%> of mutually exclusive equal-tests is always 0");
6097 return constant_boolean_node (false, truth_type
);
6104 /* Construct the expression we will return. First get the component
6105 reference we will make. Unless the mask is all ones the width of
6106 that field, perform the mask operation. Then compare with the
6108 result
= make_bit_field_ref (loc
, ll_inner
, ll_arg
,
6109 lntype
, lnbitsize
, lnbitpos
,
6110 ll_unsignedp
|| rl_unsignedp
, ll_reversep
);
6112 ll_mask
= const_binop (BIT_IOR_EXPR
, ll_mask
, rl_mask
);
6113 if (! all_ones_mask_p (ll_mask
, lnbitsize
))
6114 result
= build2_loc (loc
, BIT_AND_EXPR
, lntype
, result
, ll_mask
);
6116 return build2_loc (loc
, wanted_code
, truth_type
, result
,
6117 const_binop (BIT_IOR_EXPR
, l_const
, r_const
));
6120 /* T is an integer expression that is being multiplied, divided, or taken a
6121 modulus (CODE says which and what kind of divide or modulus) by a
6122 constant C. See if we can eliminate that operation by folding it with
6123 other operations already in T. WIDE_TYPE, if non-null, is a type that
6124 should be used for the computation if wider than our type.
6126 For example, if we are dividing (X * 8) + (Y * 16) by 4, we can return
6127 (X * 2) + (Y * 4). We must, however, be assured that either the original
6128 expression would not overflow or that overflow is undefined for the type
6129 in the language in question.
6131 If we return a non-null expression, it is an equivalent form of the
6132 original computation, but need not be in the original type.
6134 We set *STRICT_OVERFLOW_P to true if the return values depends on
6135 signed overflow being undefined. Otherwise we do not change
6136 *STRICT_OVERFLOW_P. */
6139 extract_muldiv (tree t
, tree c
, enum tree_code code
, tree wide_type
,
6140 bool *strict_overflow_p
)
6142 /* To avoid exponential search depth, refuse to allow recursion past
6143 three levels. Beyond that (1) it's highly unlikely that we'll find
6144 something interesting and (2) we've probably processed it before
6145 when we built the inner expression. */
6154 ret
= extract_muldiv_1 (t
, c
, code
, wide_type
, strict_overflow_p
);
6161 extract_muldiv_1 (tree t
, tree c
, enum tree_code code
, tree wide_type
,
6162 bool *strict_overflow_p
)
6164 tree type
= TREE_TYPE (t
);
6165 enum tree_code tcode
= TREE_CODE (t
);
6166 tree ctype
= (wide_type
!= 0
6167 && (GET_MODE_SIZE (SCALAR_INT_TYPE_MODE (wide_type
))
6168 > GET_MODE_SIZE (SCALAR_INT_TYPE_MODE (type
)))
6169 ? wide_type
: type
);
6171 int same_p
= tcode
== code
;
6172 tree op0
= NULL_TREE
, op1
= NULL_TREE
;
6173 bool sub_strict_overflow_p
;
6175 /* Don't deal with constants of zero here; they confuse the code below. */
6176 if (integer_zerop (c
))
6179 if (TREE_CODE_CLASS (tcode
) == tcc_unary
)
6180 op0
= TREE_OPERAND (t
, 0);
6182 if (TREE_CODE_CLASS (tcode
) == tcc_binary
)
6183 op0
= TREE_OPERAND (t
, 0), op1
= TREE_OPERAND (t
, 1);
6185 /* Note that we need not handle conditional operations here since fold
6186 already handles those cases. So just do arithmetic here. */
6190 /* For a constant, we can always simplify if we are a multiply
6191 or (for divide and modulus) if it is a multiple of our constant. */
6192 if (code
== MULT_EXPR
6193 || wi::multiple_of_p (wi::to_wide (t
), wi::to_wide (c
),
6196 tree tem
= const_binop (code
, fold_convert (ctype
, t
),
6197 fold_convert (ctype
, c
));
6198 /* If the multiplication overflowed, we lost information on it.
6199 See PR68142 and PR69845. */
6200 if (TREE_OVERFLOW (tem
))
6206 CASE_CONVERT
: case NON_LVALUE_EXPR
:
6207 /* If op0 is an expression ... */
6208 if ((COMPARISON_CLASS_P (op0
)
6209 || UNARY_CLASS_P (op0
)
6210 || BINARY_CLASS_P (op0
)
6211 || VL_EXP_CLASS_P (op0
)
6212 || EXPRESSION_CLASS_P (op0
))
6213 /* ... and has wrapping overflow, and its type is smaller
6214 than ctype, then we cannot pass through as widening. */
6215 && (((ANY_INTEGRAL_TYPE_P (TREE_TYPE (op0
))
6216 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (op0
)))
6217 && (TYPE_PRECISION (ctype
)
6218 > TYPE_PRECISION (TREE_TYPE (op0
))))
6219 /* ... or this is a truncation (t is narrower than op0),
6220 then we cannot pass through this narrowing. */
6221 || (TYPE_PRECISION (type
)
6222 < TYPE_PRECISION (TREE_TYPE (op0
)))
6223 /* ... or signedness changes for division or modulus,
6224 then we cannot pass through this conversion. */
6225 || (code
!= MULT_EXPR
6226 && (TYPE_UNSIGNED (ctype
)
6227 != TYPE_UNSIGNED (TREE_TYPE (op0
))))
6228 /* ... or has undefined overflow while the converted to
6229 type has not, we cannot do the operation in the inner type
6230 as that would introduce undefined overflow. */
6231 || ((ANY_INTEGRAL_TYPE_P (TREE_TYPE (op0
))
6232 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (op0
)))
6233 && !TYPE_OVERFLOW_UNDEFINED (type
))))
6236 /* Pass the constant down and see if we can make a simplification. If
6237 we can, replace this expression with the inner simplification for
6238 possible later conversion to our or some other type. */
6239 if ((t2
= fold_convert (TREE_TYPE (op0
), c
)) != 0
6240 && TREE_CODE (t2
) == INTEGER_CST
6241 && !TREE_OVERFLOW (t2
)
6242 && (t1
= extract_muldiv (op0
, t2
, code
,
6243 code
== MULT_EXPR
? ctype
: NULL_TREE
,
6244 strict_overflow_p
)) != 0)
6249 /* If widening the type changes it from signed to unsigned, then we
6250 must avoid building ABS_EXPR itself as unsigned. */
6251 if (TYPE_UNSIGNED (ctype
) && !TYPE_UNSIGNED (type
))
6253 tree cstype
= (*signed_type_for
) (ctype
);
6254 if ((t1
= extract_muldiv (op0
, c
, code
, cstype
, strict_overflow_p
))
6257 t1
= fold_build1 (tcode
, cstype
, fold_convert (cstype
, t1
));
6258 return fold_convert (ctype
, t1
);
6262 /* If the constant is negative, we cannot simplify this. */
6263 if (tree_int_cst_sgn (c
) == -1)
6267 /* For division and modulus, type can't be unsigned, as e.g.
6268 (-(x / 2U)) / 2U isn't equal to -((x / 2U) / 2U) for x >= 2.
6269 For signed types, even with wrapping overflow, this is fine. */
6270 if (code
!= MULT_EXPR
&& TYPE_UNSIGNED (type
))
6272 if ((t1
= extract_muldiv (op0
, c
, code
, wide_type
, strict_overflow_p
))
6274 return fold_build1 (tcode
, ctype
, fold_convert (ctype
, t1
));
6277 case MIN_EXPR
: case MAX_EXPR
:
6278 /* If widening the type changes the signedness, then we can't perform
6279 this optimization as that changes the result. */
6280 if (TYPE_UNSIGNED (ctype
) != TYPE_UNSIGNED (type
))
6283 /* MIN (a, b) / 5 -> MIN (a / 5, b / 5) */
6284 sub_strict_overflow_p
= false;
6285 if ((t1
= extract_muldiv (op0
, c
, code
, wide_type
,
6286 &sub_strict_overflow_p
)) != 0
6287 && (t2
= extract_muldiv (op1
, c
, code
, wide_type
,
6288 &sub_strict_overflow_p
)) != 0)
6290 if (tree_int_cst_sgn (c
) < 0)
6291 tcode
= (tcode
== MIN_EXPR
? MAX_EXPR
: MIN_EXPR
);
6292 if (sub_strict_overflow_p
)
6293 *strict_overflow_p
= true;
6294 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, t1
),
6295 fold_convert (ctype
, t2
));
6299 case LSHIFT_EXPR
: case RSHIFT_EXPR
:
6300 /* If the second operand is constant, this is a multiplication
6301 or floor division, by a power of two, so we can treat it that
6302 way unless the multiplier or divisor overflows. Signed
6303 left-shift overflow is implementation-defined rather than
6304 undefined in C90, so do not convert signed left shift into
6306 if (TREE_CODE (op1
) == INTEGER_CST
6307 && (tcode
== RSHIFT_EXPR
|| TYPE_UNSIGNED (TREE_TYPE (op0
)))
6308 /* const_binop may not detect overflow correctly,
6309 so check for it explicitly here. */
6310 && wi::gtu_p (TYPE_PRECISION (TREE_TYPE (size_one_node
)),
6312 && (t1
= fold_convert (ctype
,
6313 const_binop (LSHIFT_EXPR
, size_one_node
,
6315 && !TREE_OVERFLOW (t1
))
6316 return extract_muldiv (build2 (tcode
== LSHIFT_EXPR
6317 ? MULT_EXPR
: FLOOR_DIV_EXPR
,
6319 fold_convert (ctype
, op0
),
6321 c
, code
, wide_type
, strict_overflow_p
);
6324 case PLUS_EXPR
: case MINUS_EXPR
:
6325 /* See if we can eliminate the operation on both sides. If we can, we
6326 can return a new PLUS or MINUS. If we can't, the only remaining
6327 cases where we can do anything are if the second operand is a
6329 sub_strict_overflow_p
= false;
6330 t1
= extract_muldiv (op0
, c
, code
, wide_type
, &sub_strict_overflow_p
);
6331 t2
= extract_muldiv (op1
, c
, code
, wide_type
, &sub_strict_overflow_p
);
6332 if (t1
!= 0 && t2
!= 0
6333 && TYPE_OVERFLOW_WRAPS (ctype
)
6334 && (code
== MULT_EXPR
6335 /* If not multiplication, we can only do this if both operands
6336 are divisible by c. */
6337 || (multiple_of_p (ctype
, op0
, c
)
6338 && multiple_of_p (ctype
, op1
, c
))))
6340 if (sub_strict_overflow_p
)
6341 *strict_overflow_p
= true;
6342 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, t1
),
6343 fold_convert (ctype
, t2
));
6346 /* If this was a subtraction, negate OP1 and set it to be an addition.
6347 This simplifies the logic below. */
6348 if (tcode
== MINUS_EXPR
)
6350 tcode
= PLUS_EXPR
, op1
= negate_expr (op1
);
6351 /* If OP1 was not easily negatable, the constant may be OP0. */
6352 if (TREE_CODE (op0
) == INTEGER_CST
)
6354 std::swap (op0
, op1
);
6359 if (TREE_CODE (op1
) != INTEGER_CST
)
6362 /* If either OP1 or C are negative, this optimization is not safe for
6363 some of the division and remainder types while for others we need
6364 to change the code. */
6365 if (tree_int_cst_sgn (op1
) < 0 || tree_int_cst_sgn (c
) < 0)
6367 if (code
== CEIL_DIV_EXPR
)
6368 code
= FLOOR_DIV_EXPR
;
6369 else if (code
== FLOOR_DIV_EXPR
)
6370 code
= CEIL_DIV_EXPR
;
6371 else if (code
!= MULT_EXPR
6372 && code
!= CEIL_MOD_EXPR
&& code
!= FLOOR_MOD_EXPR
)
6376 /* If it's a multiply or a division/modulus operation of a multiple
6377 of our constant, do the operation and verify it doesn't overflow. */
6378 if (code
== MULT_EXPR
6379 || wi::multiple_of_p (wi::to_wide (op1
), wi::to_wide (c
),
6382 op1
= const_binop (code
, fold_convert (ctype
, op1
),
6383 fold_convert (ctype
, c
));
6384 /* We allow the constant to overflow with wrapping semantics. */
6386 || (TREE_OVERFLOW (op1
) && !TYPE_OVERFLOW_WRAPS (ctype
)))
6392 /* If we have an unsigned type, we cannot widen the operation since it
6393 will change the result if the original computation overflowed. */
6394 if (TYPE_UNSIGNED (ctype
) && ctype
!= type
)
6397 /* The last case is if we are a multiply. In that case, we can
6398 apply the distributive law to commute the multiply and addition
6399 if the multiplication of the constants doesn't overflow
6400 and overflow is defined. With undefined overflow
6401 op0 * c might overflow, while (op0 + orig_op1) * c doesn't. */
6402 if (code
== MULT_EXPR
&& TYPE_OVERFLOW_WRAPS (ctype
))
6403 return fold_build2 (tcode
, ctype
,
6404 fold_build2 (code
, ctype
,
6405 fold_convert (ctype
, op0
),
6406 fold_convert (ctype
, c
)),
6412 /* We have a special case here if we are doing something like
6413 (C * 8) % 4 since we know that's zero. */
6414 if ((code
== TRUNC_MOD_EXPR
|| code
== CEIL_MOD_EXPR
6415 || code
== FLOOR_MOD_EXPR
|| code
== ROUND_MOD_EXPR
)
6416 /* If the multiplication can overflow we cannot optimize this. */
6417 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (t
))
6418 && TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
6419 && wi::multiple_of_p (wi::to_wide (op1
), wi::to_wide (c
),
6422 *strict_overflow_p
= true;
6423 return omit_one_operand (type
, integer_zero_node
, op0
);
6426 /* ... fall through ... */
6428 case TRUNC_DIV_EXPR
: case CEIL_DIV_EXPR
: case FLOOR_DIV_EXPR
:
6429 case ROUND_DIV_EXPR
: case EXACT_DIV_EXPR
:
6430 /* If we can extract our operation from the LHS, do so and return a
6431 new operation. Likewise for the RHS from a MULT_EXPR. Otherwise,
6432 do something only if the second operand is a constant. */
6434 && TYPE_OVERFLOW_WRAPS (ctype
)
6435 && (t1
= extract_muldiv (op0
, c
, code
, wide_type
,
6436 strict_overflow_p
)) != 0)
6437 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, t1
),
6438 fold_convert (ctype
, op1
));
6439 else if (tcode
== MULT_EXPR
&& code
== MULT_EXPR
6440 && TYPE_OVERFLOW_WRAPS (ctype
)
6441 && (t1
= extract_muldiv (op1
, c
, code
, wide_type
,
6442 strict_overflow_p
)) != 0)
6443 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, op0
),
6444 fold_convert (ctype
, t1
));
6445 else if (TREE_CODE (op1
) != INTEGER_CST
)
6448 /* If these are the same operation types, we can associate them
6449 assuming no overflow. */
6452 bool overflow_p
= false;
6453 bool overflow_mul_p
;
6454 signop sign
= TYPE_SIGN (ctype
);
6455 unsigned prec
= TYPE_PRECISION (ctype
);
6456 wide_int mul
= wi::mul (wi::to_wide (op1
, prec
),
6457 wi::to_wide (c
, prec
),
6458 sign
, &overflow_mul_p
);
6459 overflow_p
= TREE_OVERFLOW (c
) | TREE_OVERFLOW (op1
);
6461 && ((sign
== UNSIGNED
&& tcode
!= MULT_EXPR
) || sign
== SIGNED
))
6464 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, op0
),
6465 wide_int_to_tree (ctype
, mul
));
6468 /* If these operations "cancel" each other, we have the main
6469 optimizations of this pass, which occur when either constant is a
6470 multiple of the other, in which case we replace this with either an
6471 operation or CODE or TCODE.
6473 If we have an unsigned type, we cannot do this since it will change
6474 the result if the original computation overflowed. */
6475 if (TYPE_OVERFLOW_UNDEFINED (ctype
)
6476 && ((code
== MULT_EXPR
&& tcode
== EXACT_DIV_EXPR
)
6477 || (tcode
== MULT_EXPR
6478 && code
!= TRUNC_MOD_EXPR
&& code
!= CEIL_MOD_EXPR
6479 && code
!= FLOOR_MOD_EXPR
&& code
!= ROUND_MOD_EXPR
6480 && code
!= MULT_EXPR
)))
6482 if (wi::multiple_of_p (wi::to_wide (op1
), wi::to_wide (c
),
6485 if (TYPE_OVERFLOW_UNDEFINED (ctype
))
6486 *strict_overflow_p
= true;
6487 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, op0
),
6488 fold_convert (ctype
,
6489 const_binop (TRUNC_DIV_EXPR
,
6492 else if (wi::multiple_of_p (wi::to_wide (c
), wi::to_wide (op1
),
6495 if (TYPE_OVERFLOW_UNDEFINED (ctype
))
6496 *strict_overflow_p
= true;
6497 return fold_build2 (code
, ctype
, fold_convert (ctype
, op0
),
6498 fold_convert (ctype
,
6499 const_binop (TRUNC_DIV_EXPR
,
6512 /* Return a node which has the indicated constant VALUE (either 0 or
6513 1 for scalars or {-1,-1,..} or {0,0,...} for vectors),
6514 and is of the indicated TYPE. */
6517 constant_boolean_node (bool value
, tree type
)
6519 if (type
== integer_type_node
)
6520 return value
? integer_one_node
: integer_zero_node
;
6521 else if (type
== boolean_type_node
)
6522 return value
? boolean_true_node
: boolean_false_node
;
6523 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6524 return build_vector_from_val (type
,
6525 build_int_cst (TREE_TYPE (type
),
6528 return fold_convert (type
, value
? integer_one_node
: integer_zero_node
);
6532 /* Transform `a + (b ? x : y)' into `b ? (a + x) : (a + y)'.
6533 Transform, `a + (x < y)' into `(x < y) ? (a + 1) : (a + 0)'. Here
6534 CODE corresponds to the `+', COND to the `(b ? x : y)' or `(x < y)'
6535 expression, and ARG to `a'. If COND_FIRST_P is nonzero, then the
6536 COND is the first argument to CODE; otherwise (as in the example
6537 given here), it is the second argument. TYPE is the type of the
6538 original expression. Return NULL_TREE if no simplification is
6542 fold_binary_op_with_conditional_arg (location_t loc
,
6543 enum tree_code code
,
6544 tree type
, tree op0
, tree op1
,
6545 tree cond
, tree arg
, int cond_first_p
)
6547 tree cond_type
= cond_first_p
? TREE_TYPE (op0
) : TREE_TYPE (op1
);
6548 tree arg_type
= cond_first_p
? TREE_TYPE (op1
) : TREE_TYPE (op0
);
6549 tree test
, true_value
, false_value
;
6550 tree lhs
= NULL_TREE
;
6551 tree rhs
= NULL_TREE
;
6552 enum tree_code cond_code
= COND_EXPR
;
6554 if (TREE_CODE (cond
) == COND_EXPR
6555 || TREE_CODE (cond
) == VEC_COND_EXPR
)
6557 test
= TREE_OPERAND (cond
, 0);
6558 true_value
= TREE_OPERAND (cond
, 1);
6559 false_value
= TREE_OPERAND (cond
, 2);
6560 /* If this operand throws an expression, then it does not make
6561 sense to try to perform a logical or arithmetic operation
6563 if (VOID_TYPE_P (TREE_TYPE (true_value
)))
6565 if (VOID_TYPE_P (TREE_TYPE (false_value
)))
6568 else if (!(TREE_CODE (type
) != VECTOR_TYPE
6569 && TREE_CODE (TREE_TYPE (cond
)) == VECTOR_TYPE
))
6571 tree testtype
= TREE_TYPE (cond
);
6573 true_value
= constant_boolean_node (true, testtype
);
6574 false_value
= constant_boolean_node (false, testtype
);
6577 /* Detect the case of mixing vector and scalar types - bail out. */
6580 if (TREE_CODE (TREE_TYPE (test
)) == VECTOR_TYPE
)
6581 cond_code
= VEC_COND_EXPR
;
6583 /* This transformation is only worthwhile if we don't have to wrap ARG
6584 in a SAVE_EXPR and the operation can be simplified without recursing
6585 on at least one of the branches once its pushed inside the COND_EXPR. */
6586 if (!TREE_CONSTANT (arg
)
6587 && (TREE_SIDE_EFFECTS (arg
)
6588 || TREE_CODE (arg
) == COND_EXPR
|| TREE_CODE (arg
) == VEC_COND_EXPR
6589 || TREE_CONSTANT (true_value
) || TREE_CONSTANT (false_value
)))
6592 arg
= fold_convert_loc (loc
, arg_type
, arg
);
6595 true_value
= fold_convert_loc (loc
, cond_type
, true_value
);
6597 lhs
= fold_build2_loc (loc
, code
, type
, true_value
, arg
);
6599 lhs
= fold_build2_loc (loc
, code
, type
, arg
, true_value
);
6603 false_value
= fold_convert_loc (loc
, cond_type
, false_value
);
6605 rhs
= fold_build2_loc (loc
, code
, type
, false_value
, arg
);
6607 rhs
= fold_build2_loc (loc
, code
, type
, arg
, false_value
);
6610 /* Check that we have simplified at least one of the branches. */
6611 if (!TREE_CONSTANT (arg
) && !TREE_CONSTANT (lhs
) && !TREE_CONSTANT (rhs
))
6614 return fold_build3_loc (loc
, cond_code
, type
, test
, lhs
, rhs
);
6618 /* Subroutine of fold() that checks for the addition of +/- 0.0.
6620 If !NEGATE, return true if ADDEND is +/-0.0 and, for all X of type
6621 TYPE, X + ADDEND is the same as X. If NEGATE, return true if X -
6622 ADDEND is the same as X.
6624 X + 0 and X - 0 both give X when X is NaN, infinite, or nonzero
6625 and finite. The problematic cases are when X is zero, and its mode
6626 has signed zeros. In the case of rounding towards -infinity,
6627 X - 0 is not the same as X because 0 - 0 is -0. In other rounding
6628 modes, X + 0 is not the same as X because -0 + 0 is 0. */
6631 fold_real_zero_addition_p (const_tree type
, const_tree addend
, int negate
)
6633 if (!real_zerop (addend
))
6636 /* Don't allow the fold with -fsignaling-nans. */
6637 if (HONOR_SNANS (element_mode (type
)))
6640 /* Allow the fold if zeros aren't signed, or their sign isn't important. */
6641 if (!HONOR_SIGNED_ZEROS (element_mode (type
)))
6644 /* In a vector or complex, we would need to check the sign of all zeros. */
6645 if (TREE_CODE (addend
) != REAL_CST
)
6648 /* Treat x + -0 as x - 0 and x - -0 as x + 0. */
6649 if (REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (addend
)))
6652 /* The mode has signed zeros, and we have to honor their sign.
6653 In this situation, there is only one case we can return true for.
6654 X - 0 is the same as X unless rounding towards -infinity is
6656 return negate
&& !HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
));
6659 /* Subroutine of match.pd that optimizes comparisons of a division by
6660 a nonzero integer constant against an integer constant, i.e.
6663 CODE is the comparison operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR,
6664 GE_EXPR or LE_EXPR. ARG01 and ARG1 must be a INTEGER_CST. */
6667 fold_div_compare (enum tree_code code
, tree c1
, tree c2
, tree
*lo
,
6668 tree
*hi
, bool *neg_overflow
)
6670 tree prod
, tmp
, type
= TREE_TYPE (c1
);
6671 signop sign
= TYPE_SIGN (type
);
6674 /* We have to do this the hard way to detect unsigned overflow.
6675 prod = int_const_binop (MULT_EXPR, c1, c2); */
6676 wide_int val
= wi::mul (wi::to_wide (c1
), wi::to_wide (c2
), sign
, &overflow
);
6677 prod
= force_fit_type (type
, val
, -1, overflow
);
6678 *neg_overflow
= false;
6680 if (sign
== UNSIGNED
)
6682 tmp
= int_const_binop (MINUS_EXPR
, c1
, build_int_cst (type
, 1));
6685 /* Likewise *hi = int_const_binop (PLUS_EXPR, prod, tmp). */
6686 val
= wi::add (wi::to_wide (prod
), wi::to_wide (tmp
), sign
, &overflow
);
6687 *hi
= force_fit_type (type
, val
, -1, overflow
| TREE_OVERFLOW (prod
));
6689 else if (tree_int_cst_sgn (c1
) >= 0)
6691 tmp
= int_const_binop (MINUS_EXPR
, c1
, build_int_cst (type
, 1));
6692 switch (tree_int_cst_sgn (c2
))
6695 *neg_overflow
= true;
6696 *lo
= int_const_binop (MINUS_EXPR
, prod
, tmp
);
6701 *lo
= fold_negate_const (tmp
, type
);
6706 *hi
= int_const_binop (PLUS_EXPR
, prod
, tmp
);
6716 /* A negative divisor reverses the relational operators. */
6717 code
= swap_tree_comparison (code
);
6719 tmp
= int_const_binop (PLUS_EXPR
, c1
, build_int_cst (type
, 1));
6720 switch (tree_int_cst_sgn (c2
))
6723 *hi
= int_const_binop (MINUS_EXPR
, prod
, tmp
);
6728 *hi
= fold_negate_const (tmp
, type
);
6733 *neg_overflow
= true;
6734 *lo
= int_const_binop (PLUS_EXPR
, prod
, tmp
);
6743 if (code
!= EQ_EXPR
&& code
!= NE_EXPR
)
6746 if (TREE_OVERFLOW (*lo
)
6747 || operand_equal_p (*lo
, TYPE_MIN_VALUE (type
), 0))
6749 if (TREE_OVERFLOW (*hi
)
6750 || operand_equal_p (*hi
, TYPE_MAX_VALUE (type
), 0))
6757 /* If CODE with arguments ARG0 and ARG1 represents a single bit
6758 equality/inequality test, then return a simplified form of the test
6759 using a sign testing. Otherwise return NULL. TYPE is the desired
6763 fold_single_bit_test_into_sign_test (location_t loc
,
6764 enum tree_code code
, tree arg0
, tree arg1
,
6767 /* If this is testing a single bit, we can optimize the test. */
6768 if ((code
== NE_EXPR
|| code
== EQ_EXPR
)
6769 && TREE_CODE (arg0
) == BIT_AND_EXPR
&& integer_zerop (arg1
)
6770 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
6772 /* If we have (A & C) != 0 where C is the sign bit of A, convert
6773 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
6774 tree arg00
= sign_bit_p (TREE_OPERAND (arg0
, 0), TREE_OPERAND (arg0
, 1));
6776 if (arg00
!= NULL_TREE
6777 /* This is only a win if casting to a signed type is cheap,
6778 i.e. when arg00's type is not a partial mode. */
6779 && type_has_mode_precision_p (TREE_TYPE (arg00
)))
6781 tree stype
= signed_type_for (TREE_TYPE (arg00
));
6782 return fold_build2_loc (loc
, code
== EQ_EXPR
? GE_EXPR
: LT_EXPR
,
6784 fold_convert_loc (loc
, stype
, arg00
),
6785 build_int_cst (stype
, 0));
6792 /* If CODE with arguments ARG0 and ARG1 represents a single bit
6793 equality/inequality test, then return a simplified form of
6794 the test using shifts and logical operations. Otherwise return
6795 NULL. TYPE is the desired result type. */
6798 fold_single_bit_test (location_t loc
, enum tree_code code
,
6799 tree arg0
, tree arg1
, tree result_type
)
6801 /* If this is testing a single bit, we can optimize the test. */
6802 if ((code
== NE_EXPR
|| code
== EQ_EXPR
)
6803 && TREE_CODE (arg0
) == BIT_AND_EXPR
&& integer_zerop (arg1
)
6804 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
6806 tree inner
= TREE_OPERAND (arg0
, 0);
6807 tree type
= TREE_TYPE (arg0
);
6808 int bitnum
= tree_log2 (TREE_OPERAND (arg0
, 1));
6809 scalar_int_mode operand_mode
= SCALAR_INT_TYPE_MODE (type
);
6811 tree signed_type
, unsigned_type
, intermediate_type
;
6814 /* First, see if we can fold the single bit test into a sign-bit
6816 tem
= fold_single_bit_test_into_sign_test (loc
, code
, arg0
, arg1
,
6821 /* Otherwise we have (A & C) != 0 where C is a single bit,
6822 convert that into ((A >> C2) & 1). Where C2 = log2(C).
6823 Similarly for (A & C) == 0. */
6825 /* If INNER is a right shift of a constant and it plus BITNUM does
6826 not overflow, adjust BITNUM and INNER. */
6827 if (TREE_CODE (inner
) == RSHIFT_EXPR
6828 && TREE_CODE (TREE_OPERAND (inner
, 1)) == INTEGER_CST
6829 && bitnum
< TYPE_PRECISION (type
)
6830 && wi::ltu_p (wi::to_wide (TREE_OPERAND (inner
, 1)),
6831 TYPE_PRECISION (type
) - bitnum
))
6833 bitnum
+= tree_to_uhwi (TREE_OPERAND (inner
, 1));
6834 inner
= TREE_OPERAND (inner
, 0);
6837 /* If we are going to be able to omit the AND below, we must do our
6838 operations as unsigned. If we must use the AND, we have a choice.
6839 Normally unsigned is faster, but for some machines signed is. */
6840 ops_unsigned
= (load_extend_op (operand_mode
) == SIGN_EXTEND
6841 && !flag_syntax_only
) ? 0 : 1;
6843 signed_type
= lang_hooks
.types
.type_for_mode (operand_mode
, 0);
6844 unsigned_type
= lang_hooks
.types
.type_for_mode (operand_mode
, 1);
6845 intermediate_type
= ops_unsigned
? unsigned_type
: signed_type
;
6846 inner
= fold_convert_loc (loc
, intermediate_type
, inner
);
6849 inner
= build2 (RSHIFT_EXPR
, intermediate_type
,
6850 inner
, size_int (bitnum
));
6852 one
= build_int_cst (intermediate_type
, 1);
6854 if (code
== EQ_EXPR
)
6855 inner
= fold_build2_loc (loc
, BIT_XOR_EXPR
, intermediate_type
, inner
, one
);
6857 /* Put the AND last so it can combine with more things. */
6858 inner
= build2 (BIT_AND_EXPR
, intermediate_type
, inner
, one
);
6860 /* Make sure to return the proper type. */
6861 inner
= fold_convert_loc (loc
, result_type
, inner
);
6868 /* Test whether it is preferable two swap two operands, ARG0 and
6869 ARG1, for example because ARG0 is an integer constant and ARG1
6873 tree_swap_operands_p (const_tree arg0
, const_tree arg1
)
6875 if (CONSTANT_CLASS_P (arg1
))
6877 if (CONSTANT_CLASS_P (arg0
))
6883 if (TREE_CONSTANT (arg1
))
6885 if (TREE_CONSTANT (arg0
))
6888 /* It is preferable to swap two SSA_NAME to ensure a canonical form
6889 for commutative and comparison operators. Ensuring a canonical
6890 form allows the optimizers to find additional redundancies without
6891 having to explicitly check for both orderings. */
6892 if (TREE_CODE (arg0
) == SSA_NAME
6893 && TREE_CODE (arg1
) == SSA_NAME
6894 && SSA_NAME_VERSION (arg0
) > SSA_NAME_VERSION (arg1
))
6897 /* Put SSA_NAMEs last. */
6898 if (TREE_CODE (arg1
) == SSA_NAME
)
6900 if (TREE_CODE (arg0
) == SSA_NAME
)
6903 /* Put variables last. */
6913 /* Fold A < X && A + 1 > Y to A < X && A >= Y. Normally A + 1 > Y
6914 means A >= Y && A != MAX, but in this case we know that
6915 A < X <= MAX. INEQ is A + 1 > Y, BOUND is A < X. */
6918 fold_to_nonsharp_ineq_using_bound (location_t loc
, tree ineq
, tree bound
)
6920 tree a
, typea
, type
= TREE_TYPE (ineq
), a1
, diff
, y
;
6922 if (TREE_CODE (bound
) == LT_EXPR
)
6923 a
= TREE_OPERAND (bound
, 0);
6924 else if (TREE_CODE (bound
) == GT_EXPR
)
6925 a
= TREE_OPERAND (bound
, 1);
6929 typea
= TREE_TYPE (a
);
6930 if (!INTEGRAL_TYPE_P (typea
)
6931 && !POINTER_TYPE_P (typea
))
6934 if (TREE_CODE (ineq
) == LT_EXPR
)
6936 a1
= TREE_OPERAND (ineq
, 1);
6937 y
= TREE_OPERAND (ineq
, 0);
6939 else if (TREE_CODE (ineq
) == GT_EXPR
)
6941 a1
= TREE_OPERAND (ineq
, 0);
6942 y
= TREE_OPERAND (ineq
, 1);
6947 if (TREE_TYPE (a1
) != typea
)
6950 if (POINTER_TYPE_P (typea
))
6952 /* Convert the pointer types into integer before taking the difference. */
6953 tree ta
= fold_convert_loc (loc
, ssizetype
, a
);
6954 tree ta1
= fold_convert_loc (loc
, ssizetype
, a1
);
6955 diff
= fold_binary_loc (loc
, MINUS_EXPR
, ssizetype
, ta1
, ta
);
6958 diff
= fold_binary_loc (loc
, MINUS_EXPR
, typea
, a1
, a
);
6960 if (!diff
|| !integer_onep (diff
))
6963 return fold_build2_loc (loc
, GE_EXPR
, type
, a
, y
);
6966 /* Fold a sum or difference of at least one multiplication.
6967 Returns the folded tree or NULL if no simplification could be made. */
6970 fold_plusminus_mult_expr (location_t loc
, enum tree_code code
, tree type
,
6971 tree arg0
, tree arg1
)
6973 tree arg00
, arg01
, arg10
, arg11
;
6974 tree alt0
= NULL_TREE
, alt1
= NULL_TREE
, same
;
6976 /* (A * C) +- (B * C) -> (A+-B) * C.
6977 (A * C) +- A -> A * (C+-1).
6978 We are most concerned about the case where C is a constant,
6979 but other combinations show up during loop reduction. Since
6980 it is not difficult, try all four possibilities. */
6982 if (TREE_CODE (arg0
) == MULT_EXPR
)
6984 arg00
= TREE_OPERAND (arg0
, 0);
6985 arg01
= TREE_OPERAND (arg0
, 1);
6987 else if (TREE_CODE (arg0
) == INTEGER_CST
)
6989 arg00
= build_one_cst (type
);
6994 /* We cannot generate constant 1 for fract. */
6995 if (ALL_FRACT_MODE_P (TYPE_MODE (type
)))
6998 arg01
= build_one_cst (type
);
7000 if (TREE_CODE (arg1
) == MULT_EXPR
)
7002 arg10
= TREE_OPERAND (arg1
, 0);
7003 arg11
= TREE_OPERAND (arg1
, 1);
7005 else if (TREE_CODE (arg1
) == INTEGER_CST
)
7007 arg10
= build_one_cst (type
);
7008 /* As we canonicalize A - 2 to A + -2 get rid of that sign for
7009 the purpose of this canonicalization. */
7010 if (wi::neg_p (wi::to_wide (arg1
), TYPE_SIGN (TREE_TYPE (arg1
)))
7011 && negate_expr_p (arg1
)
7012 && code
== PLUS_EXPR
)
7014 arg11
= negate_expr (arg1
);
7022 /* We cannot generate constant 1 for fract. */
7023 if (ALL_FRACT_MODE_P (TYPE_MODE (type
)))
7026 arg11
= build_one_cst (type
);
7030 /* Prefer factoring a common non-constant. */
7031 if (operand_equal_p (arg00
, arg10
, 0))
7032 same
= arg00
, alt0
= arg01
, alt1
= arg11
;
7033 else if (operand_equal_p (arg01
, arg11
, 0))
7034 same
= arg01
, alt0
= arg00
, alt1
= arg10
;
7035 else if (operand_equal_p (arg00
, arg11
, 0))
7036 same
= arg00
, alt0
= arg01
, alt1
= arg10
;
7037 else if (operand_equal_p (arg01
, arg10
, 0))
7038 same
= arg01
, alt0
= arg00
, alt1
= arg11
;
7040 /* No identical multiplicands; see if we can find a common
7041 power-of-two factor in non-power-of-two multiplies. This
7042 can help in multi-dimensional array access. */
7043 else if (tree_fits_shwi_p (arg01
)
7044 && tree_fits_shwi_p (arg11
))
7046 HOST_WIDE_INT int01
, int11
, tmp
;
7049 int01
= tree_to_shwi (arg01
);
7050 int11
= tree_to_shwi (arg11
);
7052 /* Move min of absolute values to int11. */
7053 if (absu_hwi (int01
) < absu_hwi (int11
))
7055 tmp
= int01
, int01
= int11
, int11
= tmp
;
7056 alt0
= arg00
, arg00
= arg10
, arg10
= alt0
;
7063 if (exact_log2 (absu_hwi (int11
)) > 0 && int01
% int11
== 0
7064 /* The remainder should not be a constant, otherwise we
7065 end up folding i * 4 + 2 to (i * 2 + 1) * 2 which has
7066 increased the number of multiplications necessary. */
7067 && TREE_CODE (arg10
) != INTEGER_CST
)
7069 alt0
= fold_build2_loc (loc
, MULT_EXPR
, TREE_TYPE (arg00
), arg00
,
7070 build_int_cst (TREE_TYPE (arg00
),
7075 maybe_same
= alt0
, alt0
= alt1
, alt1
= maybe_same
;
7082 if (! INTEGRAL_TYPE_P (type
)
7083 || TYPE_OVERFLOW_WRAPS (type
)
7084 /* We are neither factoring zero nor minus one. */
7085 || TREE_CODE (same
) == INTEGER_CST
)
7086 return fold_build2_loc (loc
, MULT_EXPR
, type
,
7087 fold_build2_loc (loc
, code
, type
,
7088 fold_convert_loc (loc
, type
, alt0
),
7089 fold_convert_loc (loc
, type
, alt1
)),
7090 fold_convert_loc (loc
, type
, same
));
7092 /* Same may be zero and thus the operation 'code' may overflow. Likewise
7093 same may be minus one and thus the multiplication may overflow. Perform
7094 the operations in an unsigned type. */
7095 tree utype
= unsigned_type_for (type
);
7096 tree tem
= fold_build2_loc (loc
, code
, utype
,
7097 fold_convert_loc (loc
, utype
, alt0
),
7098 fold_convert_loc (loc
, utype
, alt1
));
7099 /* If the sum evaluated to a constant that is not -INF the multiplication
7101 if (TREE_CODE (tem
) == INTEGER_CST
7102 && (wi::to_wide (tem
)
7103 != wi::min_value (TYPE_PRECISION (utype
), SIGNED
)))
7104 return fold_build2_loc (loc
, MULT_EXPR
, type
,
7105 fold_convert (type
, tem
), same
);
7107 return fold_convert_loc (loc
, type
,
7108 fold_build2_loc (loc
, MULT_EXPR
, utype
, tem
,
7109 fold_convert_loc (loc
, utype
, same
)));
7112 /* Subroutine of native_encode_expr. Encode the INTEGER_CST
7113 specified by EXPR into the buffer PTR of length LEN bytes.
7114 Return the number of bytes placed in the buffer, or zero
7118 native_encode_int (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7120 tree type
= TREE_TYPE (expr
);
7121 int total_bytes
= GET_MODE_SIZE (SCALAR_INT_TYPE_MODE (type
));
7122 int byte
, offset
, word
, words
;
7123 unsigned char value
;
7125 if ((off
== -1 && total_bytes
> len
) || off
>= total_bytes
)
7132 return MIN (len
, total_bytes
- off
);
7134 words
= total_bytes
/ UNITS_PER_WORD
;
7136 for (byte
= 0; byte
< total_bytes
; byte
++)
7138 int bitpos
= byte
* BITS_PER_UNIT
;
7139 /* Extend EXPR according to TYPE_SIGN if the precision isn't a whole
7141 value
= wi::extract_uhwi (wi::to_widest (expr
), bitpos
, BITS_PER_UNIT
);
7143 if (total_bytes
> UNITS_PER_WORD
)
7145 word
= byte
/ UNITS_PER_WORD
;
7146 if (WORDS_BIG_ENDIAN
)
7147 word
= (words
- 1) - word
;
7148 offset
= word
* UNITS_PER_WORD
;
7149 if (BYTES_BIG_ENDIAN
)
7150 offset
+= (UNITS_PER_WORD
- 1) - (byte
% UNITS_PER_WORD
);
7152 offset
+= byte
% UNITS_PER_WORD
;
7155 offset
= BYTES_BIG_ENDIAN
? (total_bytes
- 1) - byte
: byte
;
7156 if (offset
>= off
&& offset
- off
< len
)
7157 ptr
[offset
- off
] = value
;
7159 return MIN (len
, total_bytes
- off
);
7163 /* Subroutine of native_encode_expr. Encode the FIXED_CST
7164 specified by EXPR into the buffer PTR of length LEN bytes.
7165 Return the number of bytes placed in the buffer, or zero
7169 native_encode_fixed (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7171 tree type
= TREE_TYPE (expr
);
7172 scalar_mode mode
= SCALAR_TYPE_MODE (type
);
7173 int total_bytes
= GET_MODE_SIZE (mode
);
7174 FIXED_VALUE_TYPE value
;
7175 tree i_value
, i_type
;
7177 if (total_bytes
* BITS_PER_UNIT
> HOST_BITS_PER_DOUBLE_INT
)
7180 i_type
= lang_hooks
.types
.type_for_size (GET_MODE_BITSIZE (mode
), 1);
7182 if (NULL_TREE
== i_type
|| TYPE_PRECISION (i_type
) != total_bytes
)
7185 value
= TREE_FIXED_CST (expr
);
7186 i_value
= double_int_to_tree (i_type
, value
.data
);
7188 return native_encode_int (i_value
, ptr
, len
, off
);
7192 /* Subroutine of native_encode_expr. Encode the REAL_CST
7193 specified by EXPR into the buffer PTR of length LEN bytes.
7194 Return the number of bytes placed in the buffer, or zero
7198 native_encode_real (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7200 tree type
= TREE_TYPE (expr
);
7201 int total_bytes
= GET_MODE_SIZE (SCALAR_FLOAT_TYPE_MODE (type
));
7202 int byte
, offset
, word
, words
, bitpos
;
7203 unsigned char value
;
7205 /* There are always 32 bits in each long, no matter the size of
7206 the hosts long. We handle floating point representations with
7210 if ((off
== -1 && total_bytes
> len
) || off
>= total_bytes
)
7217 return MIN (len
, total_bytes
- off
);
7219 words
= (32 / BITS_PER_UNIT
) / UNITS_PER_WORD
;
7221 real_to_target (tmp
, TREE_REAL_CST_PTR (expr
), TYPE_MODE (type
));
7223 for (bitpos
= 0; bitpos
< total_bytes
* BITS_PER_UNIT
;
7224 bitpos
+= BITS_PER_UNIT
)
7226 byte
= (bitpos
/ BITS_PER_UNIT
) & 3;
7227 value
= (unsigned char) (tmp
[bitpos
/ 32] >> (bitpos
& 31));
7229 if (UNITS_PER_WORD
< 4)
7231 word
= byte
/ UNITS_PER_WORD
;
7232 if (WORDS_BIG_ENDIAN
)
7233 word
= (words
- 1) - word
;
7234 offset
= word
* UNITS_PER_WORD
;
7235 if (BYTES_BIG_ENDIAN
)
7236 offset
+= (UNITS_PER_WORD
- 1) - (byte
% UNITS_PER_WORD
);
7238 offset
+= byte
% UNITS_PER_WORD
;
7243 if (BYTES_BIG_ENDIAN
)
7245 /* Reverse bytes within each long, or within the entire float
7246 if it's smaller than a long (for HFmode). */
7247 offset
= MIN (3, total_bytes
- 1) - offset
;
7248 gcc_assert (offset
>= 0);
7251 offset
= offset
+ ((bitpos
/ BITS_PER_UNIT
) & ~3);
7253 && offset
- off
< len
)
7254 ptr
[offset
- off
] = value
;
7256 return MIN (len
, total_bytes
- off
);
7259 /* Subroutine of native_encode_expr. Encode the COMPLEX_CST
7260 specified by EXPR into the buffer PTR of length LEN bytes.
7261 Return the number of bytes placed in the buffer, or zero
7265 native_encode_complex (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7270 part
= TREE_REALPART (expr
);
7271 rsize
= native_encode_expr (part
, ptr
, len
, off
);
7272 if (off
== -1 && rsize
== 0)
7274 part
= TREE_IMAGPART (expr
);
7276 off
= MAX (0, off
- GET_MODE_SIZE (SCALAR_TYPE_MODE (TREE_TYPE (part
))));
7277 isize
= native_encode_expr (part
, ptr
? ptr
+ rsize
: NULL
,
7279 if (off
== -1 && isize
!= rsize
)
7281 return rsize
+ isize
;
7285 /* Subroutine of native_encode_expr. Encode the VECTOR_CST
7286 specified by EXPR into the buffer PTR of length LEN bytes.
7287 Return the number of bytes placed in the buffer, or zero
7291 native_encode_vector (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7298 count
= VECTOR_CST_NELTS (expr
);
7299 itype
= TREE_TYPE (TREE_TYPE (expr
));
7300 size
= GET_MODE_SIZE (SCALAR_TYPE_MODE (itype
));
7301 for (i
= 0; i
< count
; i
++)
7308 elem
= VECTOR_CST_ELT (expr
, i
);
7309 int res
= native_encode_expr (elem
, ptr
? ptr
+ offset
: NULL
,
7311 if ((off
== -1 && res
!= size
) || res
== 0)
7323 /* Subroutine of native_encode_expr. Encode the STRING_CST
7324 specified by EXPR into the buffer PTR of length LEN bytes.
7325 Return the number of bytes placed in the buffer, or zero
7329 native_encode_string (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7331 tree type
= TREE_TYPE (expr
);
7333 /* Wide-char strings are encoded in target byte-order so native
7334 encoding them is trivial. */
7335 if (BITS_PER_UNIT
!= CHAR_BIT
7336 || TREE_CODE (type
) != ARRAY_TYPE
7337 || TREE_CODE (TREE_TYPE (type
)) != INTEGER_TYPE
7338 || !tree_fits_shwi_p (TYPE_SIZE_UNIT (type
)))
7341 HOST_WIDE_INT total_bytes
= tree_to_shwi (TYPE_SIZE_UNIT (TREE_TYPE (expr
)));
7342 if ((off
== -1 && total_bytes
> len
) || off
>= total_bytes
)
7348 else if (TREE_STRING_LENGTH (expr
) - off
< MIN (total_bytes
, len
))
7351 if (off
< TREE_STRING_LENGTH (expr
))
7353 written
= MIN (len
, TREE_STRING_LENGTH (expr
) - off
);
7354 memcpy (ptr
, TREE_STRING_POINTER (expr
) + off
, written
);
7356 memset (ptr
+ written
, 0,
7357 MIN (total_bytes
- written
, len
- written
));
7360 memcpy (ptr
, TREE_STRING_POINTER (expr
) + off
, MIN (total_bytes
, len
));
7361 return MIN (total_bytes
- off
, len
);
7365 /* Subroutine of fold_view_convert_expr. Encode the INTEGER_CST,
7366 REAL_CST, COMPLEX_CST or VECTOR_CST specified by EXPR into the
7367 buffer PTR of length LEN bytes. If PTR is NULL, don't actually store
7368 anything, just do a dry run. If OFF is not -1 then start
7369 the encoding at byte offset OFF and encode at most LEN bytes.
7370 Return the number of bytes placed in the buffer, or zero upon failure. */
7373 native_encode_expr (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7375 /* We don't support starting at negative offset and -1 is special. */
7379 switch (TREE_CODE (expr
))
7382 return native_encode_int (expr
, ptr
, len
, off
);
7385 return native_encode_real (expr
, ptr
, len
, off
);
7388 return native_encode_fixed (expr
, ptr
, len
, off
);
7391 return native_encode_complex (expr
, ptr
, len
, off
);
7394 return native_encode_vector (expr
, ptr
, len
, off
);
7397 return native_encode_string (expr
, ptr
, len
, off
);
7405 /* Subroutine of native_interpret_expr. Interpret the contents of
7406 the buffer PTR of length LEN as an INTEGER_CST of type TYPE.
7407 If the buffer cannot be interpreted, return NULL_TREE. */
7410 native_interpret_int (tree type
, const unsigned char *ptr
, int len
)
7412 int total_bytes
= GET_MODE_SIZE (SCALAR_INT_TYPE_MODE (type
));
7414 if (total_bytes
> len
7415 || total_bytes
* BITS_PER_UNIT
> HOST_BITS_PER_DOUBLE_INT
)
7418 wide_int result
= wi::from_buffer (ptr
, total_bytes
);
7420 return wide_int_to_tree (type
, result
);
7424 /* Subroutine of native_interpret_expr. Interpret the contents of
7425 the buffer PTR of length LEN as a FIXED_CST of type TYPE.
7426 If the buffer cannot be interpreted, return NULL_TREE. */
7429 native_interpret_fixed (tree type
, const unsigned char *ptr
, int len
)
7431 scalar_mode mode
= SCALAR_TYPE_MODE (type
);
7432 int total_bytes
= GET_MODE_SIZE (mode
);
7434 FIXED_VALUE_TYPE fixed_value
;
7436 if (total_bytes
> len
7437 || total_bytes
* BITS_PER_UNIT
> HOST_BITS_PER_DOUBLE_INT
)
7440 result
= double_int::from_buffer (ptr
, total_bytes
);
7441 fixed_value
= fixed_from_double_int (result
, mode
);
7443 return build_fixed (type
, fixed_value
);
7447 /* Subroutine of native_interpret_expr. Interpret the contents of
7448 the buffer PTR of length LEN as a REAL_CST of type TYPE.
7449 If the buffer cannot be interpreted, return NULL_TREE. */
7452 native_interpret_real (tree type
, const unsigned char *ptr
, int len
)
7454 scalar_float_mode mode
= SCALAR_FLOAT_TYPE_MODE (type
);
7455 int total_bytes
= GET_MODE_SIZE (mode
);
7456 unsigned char value
;
7457 /* There are always 32 bits in each long, no matter the size of
7458 the hosts long. We handle floating point representations with
7463 if (total_bytes
> len
|| total_bytes
> 24)
7465 int words
= (32 / BITS_PER_UNIT
) / UNITS_PER_WORD
;
7467 memset (tmp
, 0, sizeof (tmp
));
7468 for (int bitpos
= 0; bitpos
< total_bytes
* BITS_PER_UNIT
;
7469 bitpos
+= BITS_PER_UNIT
)
7471 /* Both OFFSET and BYTE index within a long;
7472 bitpos indexes the whole float. */
7473 int offset
, byte
= (bitpos
/ BITS_PER_UNIT
) & 3;
7474 if (UNITS_PER_WORD
< 4)
7476 int word
= byte
/ UNITS_PER_WORD
;
7477 if (WORDS_BIG_ENDIAN
)
7478 word
= (words
- 1) - word
;
7479 offset
= word
* UNITS_PER_WORD
;
7480 if (BYTES_BIG_ENDIAN
)
7481 offset
+= (UNITS_PER_WORD
- 1) - (byte
% UNITS_PER_WORD
);
7483 offset
+= byte
% UNITS_PER_WORD
;
7488 if (BYTES_BIG_ENDIAN
)
7490 /* Reverse bytes within each long, or within the entire float
7491 if it's smaller than a long (for HFmode). */
7492 offset
= MIN (3, total_bytes
- 1) - offset
;
7493 gcc_assert (offset
>= 0);
7496 value
= ptr
[offset
+ ((bitpos
/ BITS_PER_UNIT
) & ~3)];
7498 tmp
[bitpos
/ 32] |= (unsigned long)value
<< (bitpos
& 31);
7501 real_from_target (&r
, tmp
, mode
);
7502 return build_real (type
, r
);
7506 /* Subroutine of native_interpret_expr. Interpret the contents of
7507 the buffer PTR of length LEN as a COMPLEX_CST of type TYPE.
7508 If the buffer cannot be interpreted, return NULL_TREE. */
7511 native_interpret_complex (tree type
, const unsigned char *ptr
, int len
)
7513 tree etype
, rpart
, ipart
;
7516 etype
= TREE_TYPE (type
);
7517 size
= GET_MODE_SIZE (SCALAR_TYPE_MODE (etype
));
7520 rpart
= native_interpret_expr (etype
, ptr
, size
);
7523 ipart
= native_interpret_expr (etype
, ptr
+size
, size
);
7526 return build_complex (type
, rpart
, ipart
);
7530 /* Subroutine of native_interpret_expr. Interpret the contents of
7531 the buffer PTR of length LEN as a VECTOR_CST of type TYPE.
7532 If the buffer cannot be interpreted, return NULL_TREE. */
7535 native_interpret_vector (tree type
, const unsigned char *ptr
, int len
)
7540 etype
= TREE_TYPE (type
);
7541 size
= GET_MODE_SIZE (SCALAR_TYPE_MODE (etype
));
7542 count
= TYPE_VECTOR_SUBPARTS (type
);
7543 if (size
* count
> len
)
7546 tree_vector_builder
elements (type
, count
, 1);
7547 for (i
= 0; i
< count
; ++i
)
7549 elem
= native_interpret_expr (etype
, ptr
+(i
*size
), size
);
7552 elements
.quick_push (elem
);
7554 return elements
.build ();
7558 /* Subroutine of fold_view_convert_expr. Interpret the contents of
7559 the buffer PTR of length LEN as a constant of type TYPE. For
7560 INTEGRAL_TYPE_P we return an INTEGER_CST, for SCALAR_FLOAT_TYPE_P
7561 we return a REAL_CST, etc... If the buffer cannot be interpreted,
7562 return NULL_TREE. */
7565 native_interpret_expr (tree type
, const unsigned char *ptr
, int len
)
7567 switch (TREE_CODE (type
))
7573 case REFERENCE_TYPE
:
7574 return native_interpret_int (type
, ptr
, len
);
7577 return native_interpret_real (type
, ptr
, len
);
7579 case FIXED_POINT_TYPE
:
7580 return native_interpret_fixed (type
, ptr
, len
);
7583 return native_interpret_complex (type
, ptr
, len
);
7586 return native_interpret_vector (type
, ptr
, len
);
7593 /* Returns true if we can interpret the contents of a native encoding
7597 can_native_interpret_type_p (tree type
)
7599 switch (TREE_CODE (type
))
7605 case REFERENCE_TYPE
:
7606 case FIXED_POINT_TYPE
:
7617 /* Fold a VIEW_CONVERT_EXPR of a constant expression EXPR to type
7618 TYPE at compile-time. If we're unable to perform the conversion
7619 return NULL_TREE. */
7622 fold_view_convert_expr (tree type
, tree expr
)
7624 /* We support up to 512-bit values (for V8DFmode). */
7625 unsigned char buffer
[64];
7628 /* Check that the host and target are sane. */
7629 if (CHAR_BIT
!= 8 || BITS_PER_UNIT
!= 8)
7632 len
= native_encode_expr (expr
, buffer
, sizeof (buffer
));
7636 return native_interpret_expr (type
, buffer
, len
);
7639 /* Build an expression for the address of T. Folds away INDIRECT_REF
7640 to avoid confusing the gimplify process. */
7643 build_fold_addr_expr_with_type_loc (location_t loc
, tree t
, tree ptrtype
)
7645 /* The size of the object is not relevant when talking about its address. */
7646 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
7647 t
= TREE_OPERAND (t
, 0);
7649 if (TREE_CODE (t
) == INDIRECT_REF
)
7651 t
= TREE_OPERAND (t
, 0);
7653 if (TREE_TYPE (t
) != ptrtype
)
7654 t
= build1_loc (loc
, NOP_EXPR
, ptrtype
, t
);
7656 else if (TREE_CODE (t
) == MEM_REF
7657 && integer_zerop (TREE_OPERAND (t
, 1)))
7658 return TREE_OPERAND (t
, 0);
7659 else if (TREE_CODE (t
) == MEM_REF
7660 && TREE_CODE (TREE_OPERAND (t
, 0)) == INTEGER_CST
)
7661 return fold_binary (POINTER_PLUS_EXPR
, ptrtype
,
7662 TREE_OPERAND (t
, 0),
7663 convert_to_ptrofftype (TREE_OPERAND (t
, 1)));
7664 else if (TREE_CODE (t
) == VIEW_CONVERT_EXPR
)
7666 t
= build_fold_addr_expr_loc (loc
, TREE_OPERAND (t
, 0));
7668 if (TREE_TYPE (t
) != ptrtype
)
7669 t
= fold_convert_loc (loc
, ptrtype
, t
);
7672 t
= build1_loc (loc
, ADDR_EXPR
, ptrtype
, t
);
7677 /* Build an expression for the address of T. */
7680 build_fold_addr_expr_loc (location_t loc
, tree t
)
7682 tree ptrtype
= build_pointer_type (TREE_TYPE (t
));
7684 return build_fold_addr_expr_with_type_loc (loc
, t
, ptrtype
);
7687 /* Fold a unary expression of code CODE and type TYPE with operand
7688 OP0. Return the folded expression if folding is successful.
7689 Otherwise, return NULL_TREE. */
7692 fold_unary_loc (location_t loc
, enum tree_code code
, tree type
, tree op0
)
7696 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
7698 gcc_assert (IS_EXPR_CODE_CLASS (kind
)
7699 && TREE_CODE_LENGTH (code
) == 1);
7704 if (CONVERT_EXPR_CODE_P (code
)
7705 || code
== FLOAT_EXPR
|| code
== ABS_EXPR
|| code
== NEGATE_EXPR
)
7707 /* Don't use STRIP_NOPS, because signedness of argument type
7709 STRIP_SIGN_NOPS (arg0
);
7713 /* Strip any conversions that don't change the mode. This
7714 is safe for every expression, except for a comparison
7715 expression because its signedness is derived from its
7718 Note that this is done as an internal manipulation within
7719 the constant folder, in order to find the simplest
7720 representation of the arguments so that their form can be
7721 studied. In any cases, the appropriate type conversions
7722 should be put back in the tree that will get out of the
7727 if (CONSTANT_CLASS_P (arg0
))
7729 tree tem
= const_unop (code
, type
, arg0
);
7732 if (TREE_TYPE (tem
) != type
)
7733 tem
= fold_convert_loc (loc
, type
, tem
);
7739 tem
= generic_simplify (loc
, code
, type
, op0
);
7743 if (TREE_CODE_CLASS (code
) == tcc_unary
)
7745 if (TREE_CODE (arg0
) == COMPOUND_EXPR
)
7746 return build2 (COMPOUND_EXPR
, type
, TREE_OPERAND (arg0
, 0),
7747 fold_build1_loc (loc
, code
, type
,
7748 fold_convert_loc (loc
, TREE_TYPE (op0
),
7749 TREE_OPERAND (arg0
, 1))));
7750 else if (TREE_CODE (arg0
) == COND_EXPR
)
7752 tree arg01
= TREE_OPERAND (arg0
, 1);
7753 tree arg02
= TREE_OPERAND (arg0
, 2);
7754 if (! VOID_TYPE_P (TREE_TYPE (arg01
)))
7755 arg01
= fold_build1_loc (loc
, code
, type
,
7756 fold_convert_loc (loc
,
7757 TREE_TYPE (op0
), arg01
));
7758 if (! VOID_TYPE_P (TREE_TYPE (arg02
)))
7759 arg02
= fold_build1_loc (loc
, code
, type
,
7760 fold_convert_loc (loc
,
7761 TREE_TYPE (op0
), arg02
));
7762 tem
= fold_build3_loc (loc
, COND_EXPR
, type
, TREE_OPERAND (arg0
, 0),
7765 /* If this was a conversion, and all we did was to move into
7766 inside the COND_EXPR, bring it back out. But leave it if
7767 it is a conversion from integer to integer and the
7768 result precision is no wider than a word since such a
7769 conversion is cheap and may be optimized away by combine,
7770 while it couldn't if it were outside the COND_EXPR. Then return
7771 so we don't get into an infinite recursion loop taking the
7772 conversion out and then back in. */
7774 if ((CONVERT_EXPR_CODE_P (code
)
7775 || code
== NON_LVALUE_EXPR
)
7776 && TREE_CODE (tem
) == COND_EXPR
7777 && TREE_CODE (TREE_OPERAND (tem
, 1)) == code
7778 && TREE_CODE (TREE_OPERAND (tem
, 2)) == code
7779 && ! VOID_TYPE_P (TREE_OPERAND (tem
, 1))
7780 && ! VOID_TYPE_P (TREE_OPERAND (tem
, 2))
7781 && (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem
, 1), 0))
7782 == TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem
, 2), 0)))
7783 && (! (INTEGRAL_TYPE_P (TREE_TYPE (tem
))
7785 (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem
, 1), 0))))
7786 && TYPE_PRECISION (TREE_TYPE (tem
)) <= BITS_PER_WORD
)
7787 || flag_syntax_only
))
7788 tem
= build1_loc (loc
, code
, type
,
7790 TREE_TYPE (TREE_OPERAND
7791 (TREE_OPERAND (tem
, 1), 0)),
7792 TREE_OPERAND (tem
, 0),
7793 TREE_OPERAND (TREE_OPERAND (tem
, 1), 0),
7794 TREE_OPERAND (TREE_OPERAND (tem
, 2),
7802 case NON_LVALUE_EXPR
:
7803 if (!maybe_lvalue_p (op0
))
7804 return fold_convert_loc (loc
, type
, op0
);
7809 case FIX_TRUNC_EXPR
:
7810 if (COMPARISON_CLASS_P (op0
))
7812 /* If we have (type) (a CMP b) and type is an integral type, return
7813 new expression involving the new type. Canonicalize
7814 (type) (a CMP b) to (a CMP b) ? (type) true : (type) false for
7816 Do not fold the result as that would not simplify further, also
7817 folding again results in recursions. */
7818 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
7819 return build2_loc (loc
, TREE_CODE (op0
), type
,
7820 TREE_OPERAND (op0
, 0),
7821 TREE_OPERAND (op0
, 1));
7822 else if (!INTEGRAL_TYPE_P (type
) && !VOID_TYPE_P (type
)
7823 && TREE_CODE (type
) != VECTOR_TYPE
)
7824 return build3_loc (loc
, COND_EXPR
, type
, op0
,
7825 constant_boolean_node (true, type
),
7826 constant_boolean_node (false, type
));
7829 /* Handle (T *)&A.B.C for A being of type T and B and C
7830 living at offset zero. This occurs frequently in
7831 C++ upcasting and then accessing the base. */
7832 if (TREE_CODE (op0
) == ADDR_EXPR
7833 && POINTER_TYPE_P (type
)
7834 && handled_component_p (TREE_OPERAND (op0
, 0)))
7836 poly_int64 bitsize
, bitpos
;
7839 int unsignedp
, reversep
, volatilep
;
7841 = get_inner_reference (TREE_OPERAND (op0
, 0), &bitsize
, &bitpos
,
7842 &offset
, &mode
, &unsignedp
, &reversep
,
7844 /* If the reference was to a (constant) zero offset, we can use
7845 the address of the base if it has the same base type
7846 as the result type and the pointer type is unqualified. */
7848 && known_eq (bitpos
, 0)
7849 && (TYPE_MAIN_VARIANT (TREE_TYPE (type
))
7850 == TYPE_MAIN_VARIANT (TREE_TYPE (base
)))
7851 && TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
7852 return fold_convert_loc (loc
, type
,
7853 build_fold_addr_expr_loc (loc
, base
));
7856 if (TREE_CODE (op0
) == MODIFY_EXPR
7857 && TREE_CONSTANT (TREE_OPERAND (op0
, 1))
7858 /* Detect assigning a bitfield. */
7859 && !(TREE_CODE (TREE_OPERAND (op0
, 0)) == COMPONENT_REF
7861 (TREE_OPERAND (TREE_OPERAND (op0
, 0), 1))))
7863 /* Don't leave an assignment inside a conversion
7864 unless assigning a bitfield. */
7865 tem
= fold_build1_loc (loc
, code
, type
, TREE_OPERAND (op0
, 1));
7866 /* First do the assignment, then return converted constant. */
7867 tem
= build2_loc (loc
, COMPOUND_EXPR
, TREE_TYPE (tem
), op0
, tem
);
7868 TREE_NO_WARNING (tem
) = 1;
7869 TREE_USED (tem
) = 1;
7873 /* Convert (T)(x & c) into (T)x & (T)c, if c is an integer
7874 constants (if x has signed type, the sign bit cannot be set
7875 in c). This folds extension into the BIT_AND_EXPR.
7876 ??? We don't do it for BOOLEAN_TYPE or ENUMERAL_TYPE because they
7877 very likely don't have maximal range for their precision and this
7878 transformation effectively doesn't preserve non-maximal ranges. */
7879 if (TREE_CODE (type
) == INTEGER_TYPE
7880 && TREE_CODE (op0
) == BIT_AND_EXPR
7881 && TREE_CODE (TREE_OPERAND (op0
, 1)) == INTEGER_CST
)
7883 tree and_expr
= op0
;
7884 tree and0
= TREE_OPERAND (and_expr
, 0);
7885 tree and1
= TREE_OPERAND (and_expr
, 1);
7888 if (TYPE_UNSIGNED (TREE_TYPE (and_expr
))
7889 || (TYPE_PRECISION (type
)
7890 <= TYPE_PRECISION (TREE_TYPE (and_expr
))))
7892 else if (TYPE_PRECISION (TREE_TYPE (and1
))
7893 <= HOST_BITS_PER_WIDE_INT
7894 && tree_fits_uhwi_p (and1
))
7896 unsigned HOST_WIDE_INT cst
;
7898 cst
= tree_to_uhwi (and1
);
7899 cst
&= HOST_WIDE_INT_M1U
7900 << (TYPE_PRECISION (TREE_TYPE (and1
)) - 1);
7901 change
= (cst
== 0);
7903 && !flag_syntax_only
7904 && (load_extend_op (TYPE_MODE (TREE_TYPE (and0
)))
7907 tree uns
= unsigned_type_for (TREE_TYPE (and0
));
7908 and0
= fold_convert_loc (loc
, uns
, and0
);
7909 and1
= fold_convert_loc (loc
, uns
, and1
);
7914 tem
= force_fit_type (type
, wi::to_widest (and1
), 0,
7915 TREE_OVERFLOW (and1
));
7916 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
7917 fold_convert_loc (loc
, type
, and0
), tem
);
7921 /* Convert (T1)(X p+ Y) into ((T1)X p+ Y), for pointer type, when the new
7922 cast (T1)X will fold away. We assume that this happens when X itself
7924 if (POINTER_TYPE_P (type
)
7925 && TREE_CODE (arg0
) == POINTER_PLUS_EXPR
7926 && CONVERT_EXPR_P (TREE_OPERAND (arg0
, 0)))
7928 tree arg00
= TREE_OPERAND (arg0
, 0);
7929 tree arg01
= TREE_OPERAND (arg0
, 1);
7931 return fold_build_pointer_plus_loc
7932 (loc
, fold_convert_loc (loc
, type
, arg00
), arg01
);
7935 /* Convert (T1)(~(T2)X) into ~(T1)X if T1 and T2 are integral types
7936 of the same precision, and X is an integer type not narrower than
7937 types T1 or T2, i.e. the cast (T2)X isn't an extension. */
7938 if (INTEGRAL_TYPE_P (type
)
7939 && TREE_CODE (op0
) == BIT_NOT_EXPR
7940 && INTEGRAL_TYPE_P (TREE_TYPE (op0
))
7941 && CONVERT_EXPR_P (TREE_OPERAND (op0
, 0))
7942 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (op0
)))
7944 tem
= TREE_OPERAND (TREE_OPERAND (op0
, 0), 0);
7945 if (INTEGRAL_TYPE_P (TREE_TYPE (tem
))
7946 && TYPE_PRECISION (type
) <= TYPE_PRECISION (TREE_TYPE (tem
)))
7947 return fold_build1_loc (loc
, BIT_NOT_EXPR
, type
,
7948 fold_convert_loc (loc
, type
, tem
));
7951 /* Convert (T1)(X * Y) into (T1)X * (T1)Y if T1 is narrower than the
7952 type of X and Y (integer types only). */
7953 if (INTEGRAL_TYPE_P (type
)
7954 && TREE_CODE (op0
) == MULT_EXPR
7955 && INTEGRAL_TYPE_P (TREE_TYPE (op0
))
7956 && TYPE_PRECISION (type
) < TYPE_PRECISION (TREE_TYPE (op0
)))
7958 /* Be careful not to introduce new overflows. */
7960 if (TYPE_OVERFLOW_WRAPS (type
))
7963 mult_type
= unsigned_type_for (type
);
7965 if (TYPE_PRECISION (mult_type
) < TYPE_PRECISION (TREE_TYPE (op0
)))
7967 tem
= fold_build2_loc (loc
, MULT_EXPR
, mult_type
,
7968 fold_convert_loc (loc
, mult_type
,
7969 TREE_OPERAND (op0
, 0)),
7970 fold_convert_loc (loc
, mult_type
,
7971 TREE_OPERAND (op0
, 1)));
7972 return fold_convert_loc (loc
, type
, tem
);
7978 case VIEW_CONVERT_EXPR
:
7979 if (TREE_CODE (op0
) == MEM_REF
)
7981 if (TYPE_ALIGN (TREE_TYPE (op0
)) != TYPE_ALIGN (type
))
7982 type
= build_aligned_type (type
, TYPE_ALIGN (TREE_TYPE (op0
)));
7983 tem
= fold_build2_loc (loc
, MEM_REF
, type
,
7984 TREE_OPERAND (op0
, 0), TREE_OPERAND (op0
, 1));
7985 REF_REVERSE_STORAGE_ORDER (tem
) = REF_REVERSE_STORAGE_ORDER (op0
);
7992 tem
= fold_negate_expr (loc
, arg0
);
7994 return fold_convert_loc (loc
, type
, tem
);
7998 /* Convert fabs((double)float) into (double)fabsf(float). */
7999 if (TREE_CODE (arg0
) == NOP_EXPR
8000 && TREE_CODE (type
) == REAL_TYPE
)
8002 tree targ0
= strip_float_extensions (arg0
);
8004 return fold_convert_loc (loc
, type
,
8005 fold_build1_loc (loc
, ABS_EXPR
,
8012 /* Convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */
8013 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
8014 && (tem
= fold_unary_loc (loc
, BIT_NOT_EXPR
, type
,
8015 fold_convert_loc (loc
, type
,
8016 TREE_OPERAND (arg0
, 0)))))
8017 return fold_build2_loc (loc
, BIT_XOR_EXPR
, type
, tem
,
8018 fold_convert_loc (loc
, type
,
8019 TREE_OPERAND (arg0
, 1)));
8020 else if (TREE_CODE (arg0
) == BIT_XOR_EXPR
8021 && (tem
= fold_unary_loc (loc
, BIT_NOT_EXPR
, type
,
8022 fold_convert_loc (loc
, type
,
8023 TREE_OPERAND (arg0
, 1)))))
8024 return fold_build2_loc (loc
, BIT_XOR_EXPR
, type
,
8025 fold_convert_loc (loc
, type
,
8026 TREE_OPERAND (arg0
, 0)), tem
);
8030 case TRUTH_NOT_EXPR
:
8031 /* Note that the operand of this must be an int
8032 and its values must be 0 or 1.
8033 ("true" is a fixed value perhaps depending on the language,
8034 but we don't handle values other than 1 correctly yet.) */
8035 tem
= fold_truth_not_expr (loc
, arg0
);
8038 return fold_convert_loc (loc
, type
, tem
);
8041 /* Fold *&X to X if X is an lvalue. */
8042 if (TREE_CODE (op0
) == ADDR_EXPR
)
8044 tree op00
= TREE_OPERAND (op0
, 0);
8046 || TREE_CODE (op00
) == PARM_DECL
8047 || TREE_CODE (op00
) == RESULT_DECL
)
8048 && !TREE_READONLY (op00
))
8055 } /* switch (code) */
8059 /* If the operation was a conversion do _not_ mark a resulting constant
8060 with TREE_OVERFLOW if the original constant was not. These conversions
8061 have implementation defined behavior and retaining the TREE_OVERFLOW
8062 flag here would confuse later passes such as VRP. */
8064 fold_unary_ignore_overflow_loc (location_t loc
, enum tree_code code
,
8065 tree type
, tree op0
)
8067 tree res
= fold_unary_loc (loc
, code
, type
, op0
);
8069 && TREE_CODE (res
) == INTEGER_CST
8070 && TREE_CODE (op0
) == INTEGER_CST
8071 && CONVERT_EXPR_CODE_P (code
))
8072 TREE_OVERFLOW (res
) = TREE_OVERFLOW (op0
);
8077 /* Fold a binary bitwise/truth expression of code CODE and type TYPE with
8078 operands OP0 and OP1. LOC is the location of the resulting expression.
8079 ARG0 and ARG1 are the NOP_STRIPed results of OP0 and OP1.
8080 Return the folded expression if folding is successful. Otherwise,
8081 return NULL_TREE. */
8083 fold_truth_andor (location_t loc
, enum tree_code code
, tree type
,
8084 tree arg0
, tree arg1
, tree op0
, tree op1
)
8088 /* We only do these simplifications if we are optimizing. */
8092 /* Check for things like (A || B) && (A || C). We can convert this
8093 to A || (B && C). Note that either operator can be any of the four
8094 truth and/or operations and the transformation will still be
8095 valid. Also note that we only care about order for the
8096 ANDIF and ORIF operators. If B contains side effects, this
8097 might change the truth-value of A. */
8098 if (TREE_CODE (arg0
) == TREE_CODE (arg1
)
8099 && (TREE_CODE (arg0
) == TRUTH_ANDIF_EXPR
8100 || TREE_CODE (arg0
) == TRUTH_ORIF_EXPR
8101 || TREE_CODE (arg0
) == TRUTH_AND_EXPR
8102 || TREE_CODE (arg0
) == TRUTH_OR_EXPR
)
8103 && ! TREE_SIDE_EFFECTS (TREE_OPERAND (arg0
, 1)))
8105 tree a00
= TREE_OPERAND (arg0
, 0);
8106 tree a01
= TREE_OPERAND (arg0
, 1);
8107 tree a10
= TREE_OPERAND (arg1
, 0);
8108 tree a11
= TREE_OPERAND (arg1
, 1);
8109 int commutative
= ((TREE_CODE (arg0
) == TRUTH_OR_EXPR
8110 || TREE_CODE (arg0
) == TRUTH_AND_EXPR
)
8111 && (code
== TRUTH_AND_EXPR
8112 || code
== TRUTH_OR_EXPR
));
8114 if (operand_equal_p (a00
, a10
, 0))
8115 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
, a00
,
8116 fold_build2_loc (loc
, code
, type
, a01
, a11
));
8117 else if (commutative
&& operand_equal_p (a00
, a11
, 0))
8118 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
, a00
,
8119 fold_build2_loc (loc
, code
, type
, a01
, a10
));
8120 else if (commutative
&& operand_equal_p (a01
, a10
, 0))
8121 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
, a01
,
8122 fold_build2_loc (loc
, code
, type
, a00
, a11
));
8124 /* This case if tricky because we must either have commutative
8125 operators or else A10 must not have side-effects. */
8127 else if ((commutative
|| ! TREE_SIDE_EFFECTS (a10
))
8128 && operand_equal_p (a01
, a11
, 0))
8129 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
,
8130 fold_build2_loc (loc
, code
, type
, a00
, a10
),
8134 /* See if we can build a range comparison. */
8135 if ((tem
= fold_range_test (loc
, code
, type
, op0
, op1
)) != 0)
8138 if ((code
== TRUTH_ANDIF_EXPR
&& TREE_CODE (arg0
) == TRUTH_ORIF_EXPR
)
8139 || (code
== TRUTH_ORIF_EXPR
&& TREE_CODE (arg0
) == TRUTH_ANDIF_EXPR
))
8141 tem
= merge_truthop_with_opposite_arm (loc
, arg0
, arg1
, true);
8143 return fold_build2_loc (loc
, code
, type
, tem
, arg1
);
8146 if ((code
== TRUTH_ANDIF_EXPR
&& TREE_CODE (arg1
) == TRUTH_ORIF_EXPR
)
8147 || (code
== TRUTH_ORIF_EXPR
&& TREE_CODE (arg1
) == TRUTH_ANDIF_EXPR
))
8149 tem
= merge_truthop_with_opposite_arm (loc
, arg1
, arg0
, false);
8151 return fold_build2_loc (loc
, code
, type
, arg0
, tem
);
8154 /* Check for the possibility of merging component references. If our
8155 lhs is another similar operation, try to merge its rhs with our
8156 rhs. Then try to merge our lhs and rhs. */
8157 if (TREE_CODE (arg0
) == code
8158 && (tem
= fold_truth_andor_1 (loc
, code
, type
,
8159 TREE_OPERAND (arg0
, 1), arg1
)) != 0)
8160 return fold_build2_loc (loc
, code
, type
, TREE_OPERAND (arg0
, 0), tem
);
8162 if ((tem
= fold_truth_andor_1 (loc
, code
, type
, arg0
, arg1
)) != 0)
8165 if (LOGICAL_OP_NON_SHORT_CIRCUIT
8166 && !flag_sanitize_coverage
8167 && (code
== TRUTH_AND_EXPR
8168 || code
== TRUTH_ANDIF_EXPR
8169 || code
== TRUTH_OR_EXPR
8170 || code
== TRUTH_ORIF_EXPR
))
8172 enum tree_code ncode
, icode
;
8174 ncode
= (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_AND_EXPR
)
8175 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
;
8176 icode
= ncode
== TRUTH_AND_EXPR
? TRUTH_ANDIF_EXPR
: TRUTH_ORIF_EXPR
;
8178 /* Transform ((A AND-IF B) AND[-IF] C) into (A AND-IF (B AND C)),
8179 or ((A OR-IF B) OR[-IF] C) into (A OR-IF (B OR C))
8180 We don't want to pack more than two leafs to a non-IF AND/OR
8182 If tree-code of left-hand operand isn't an AND/OR-IF code and not
8183 equal to IF-CODE, then we don't want to add right-hand operand.
8184 If the inner right-hand side of left-hand operand has
8185 side-effects, or isn't simple, then we can't add to it,
8186 as otherwise we might destroy if-sequence. */
8187 if (TREE_CODE (arg0
) == icode
8188 && simple_operand_p_2 (arg1
)
8189 /* Needed for sequence points to handle trappings, and
8191 && simple_operand_p_2 (TREE_OPERAND (arg0
, 1)))
8193 tem
= fold_build2_loc (loc
, ncode
, type
, TREE_OPERAND (arg0
, 1),
8195 return fold_build2_loc (loc
, icode
, type
, TREE_OPERAND (arg0
, 0),
8198 /* Same as above but for (A AND[-IF] (B AND-IF C)) -> ((A AND B) AND-IF C),
8199 or (A OR[-IF] (B OR-IF C) -> ((A OR B) OR-IF C). */
8200 else if (TREE_CODE (arg1
) == icode
8201 && simple_operand_p_2 (arg0
)
8202 /* Needed for sequence points to handle trappings, and
8204 && simple_operand_p_2 (TREE_OPERAND (arg1
, 0)))
8206 tem
= fold_build2_loc (loc
, ncode
, type
,
8207 arg0
, TREE_OPERAND (arg1
, 0));
8208 return fold_build2_loc (loc
, icode
, type
, tem
,
8209 TREE_OPERAND (arg1
, 1));
8211 /* Transform (A AND-IF B) into (A AND B), or (A OR-IF B)
8213 For sequence point consistancy, we need to check for trapping,
8214 and side-effects. */
8215 else if (code
== icode
&& simple_operand_p_2 (arg0
)
8216 && simple_operand_p_2 (arg1
))
8217 return fold_build2_loc (loc
, ncode
, type
, arg0
, arg1
);
8223 /* Helper that tries to canonicalize the comparison ARG0 CODE ARG1
8224 by changing CODE to reduce the magnitude of constants involved in
8225 ARG0 of the comparison.
8226 Returns a canonicalized comparison tree if a simplification was
8227 possible, otherwise returns NULL_TREE.
8228 Set *STRICT_OVERFLOW_P to true if the canonicalization is only
8229 valid if signed overflow is undefined. */
8232 maybe_canonicalize_comparison_1 (location_t loc
, enum tree_code code
, tree type
,
8233 tree arg0
, tree arg1
,
8234 bool *strict_overflow_p
)
8236 enum tree_code code0
= TREE_CODE (arg0
);
8237 tree t
, cst0
= NULL_TREE
;
8240 /* Match A +- CST code arg1. We can change this only if overflow
8242 if (!((ANY_INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
8243 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
)))
8244 /* In principle pointers also have undefined overflow behavior,
8245 but that causes problems elsewhere. */
8246 && !POINTER_TYPE_P (TREE_TYPE (arg0
))
8247 && (code0
== MINUS_EXPR
8248 || code0
== PLUS_EXPR
)
8249 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
))
8252 /* Identify the constant in arg0 and its sign. */
8253 cst0
= TREE_OPERAND (arg0
, 1);
8254 sgn0
= tree_int_cst_sgn (cst0
);
8256 /* Overflowed constants and zero will cause problems. */
8257 if (integer_zerop (cst0
)
8258 || TREE_OVERFLOW (cst0
))
8261 /* See if we can reduce the magnitude of the constant in
8262 arg0 by changing the comparison code. */
8263 /* A - CST < arg1 -> A - CST-1 <= arg1. */
8265 && code0
== ((sgn0
== -1) ? PLUS_EXPR
: MINUS_EXPR
))
8267 /* A + CST > arg1 -> A + CST-1 >= arg1. */
8268 else if (code
== GT_EXPR
8269 && code0
== ((sgn0
== -1) ? MINUS_EXPR
: PLUS_EXPR
))
8271 /* A + CST <= arg1 -> A + CST-1 < arg1. */
8272 else if (code
== LE_EXPR
8273 && code0
== ((sgn0
== -1) ? MINUS_EXPR
: PLUS_EXPR
))
8275 /* A - CST >= arg1 -> A - CST-1 > arg1. */
8276 else if (code
== GE_EXPR
8277 && code0
== ((sgn0
== -1) ? PLUS_EXPR
: MINUS_EXPR
))
8281 *strict_overflow_p
= true;
8283 /* Now build the constant reduced in magnitude. But not if that
8284 would produce one outside of its types range. */
8285 if (INTEGRAL_TYPE_P (TREE_TYPE (cst0
))
8287 && TYPE_MIN_VALUE (TREE_TYPE (cst0
))
8288 && tree_int_cst_equal (cst0
, TYPE_MIN_VALUE (TREE_TYPE (cst0
))))
8290 && TYPE_MAX_VALUE (TREE_TYPE (cst0
))
8291 && tree_int_cst_equal (cst0
, TYPE_MAX_VALUE (TREE_TYPE (cst0
))))))
8294 t
= int_const_binop (sgn0
== -1 ? PLUS_EXPR
: MINUS_EXPR
,
8295 cst0
, build_int_cst (TREE_TYPE (cst0
), 1));
8296 t
= fold_build2_loc (loc
, code0
, TREE_TYPE (arg0
), TREE_OPERAND (arg0
, 0), t
);
8297 t
= fold_convert (TREE_TYPE (arg1
), t
);
8299 return fold_build2_loc (loc
, code
, type
, t
, arg1
);
8302 /* Canonicalize the comparison ARG0 CODE ARG1 with type TYPE with undefined
8303 overflow further. Try to decrease the magnitude of constants involved
8304 by changing LE_EXPR and GE_EXPR to LT_EXPR and GT_EXPR or vice versa
8305 and put sole constants at the second argument position.
8306 Returns the canonicalized tree if changed, otherwise NULL_TREE. */
8309 maybe_canonicalize_comparison (location_t loc
, enum tree_code code
, tree type
,
8310 tree arg0
, tree arg1
)
8313 bool strict_overflow_p
;
8314 const char * const warnmsg
= G_("assuming signed overflow does not occur "
8315 "when reducing constant in comparison");
8317 /* Try canonicalization by simplifying arg0. */
8318 strict_overflow_p
= false;
8319 t
= maybe_canonicalize_comparison_1 (loc
, code
, type
, arg0
, arg1
,
8320 &strict_overflow_p
);
8323 if (strict_overflow_p
)
8324 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_MAGNITUDE
);
8328 /* Try canonicalization by simplifying arg1 using the swapped
8330 code
= swap_tree_comparison (code
);
8331 strict_overflow_p
= false;
8332 t
= maybe_canonicalize_comparison_1 (loc
, code
, type
, arg1
, arg0
,
8333 &strict_overflow_p
);
8334 if (t
&& strict_overflow_p
)
8335 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_MAGNITUDE
);
8339 /* Return whether BASE + OFFSET + BITPOS may wrap around the address
8340 space. This is used to avoid issuing overflow warnings for
8341 expressions like &p->x which can not wrap. */
8344 pointer_may_wrap_p (tree base
, tree offset
, poly_int64 bitpos
)
8346 if (!POINTER_TYPE_P (TREE_TYPE (base
)))
8349 if (maybe_lt (bitpos
, 0))
8352 poly_wide_int wi_offset
;
8353 int precision
= TYPE_PRECISION (TREE_TYPE (base
));
8354 if (offset
== NULL_TREE
)
8355 wi_offset
= wi::zero (precision
);
8356 else if (!poly_int_tree_p (offset
) || TREE_OVERFLOW (offset
))
8359 wi_offset
= wi::to_poly_wide (offset
);
8362 poly_wide_int units
= wi::shwi (bits_to_bytes_round_down (bitpos
),
8364 poly_wide_int total
= wi::add (wi_offset
, units
, UNSIGNED
, &overflow
);
8368 poly_uint64 total_hwi
, size
;
8369 if (!total
.to_uhwi (&total_hwi
)
8370 || !poly_int_tree_p (TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (base
))),
8372 || known_eq (size
, 0U))
8375 if (known_le (total_hwi
, size
))
8378 /* We can do slightly better for SIZE if we have an ADDR_EXPR of an
8380 if (TREE_CODE (base
) == ADDR_EXPR
8381 && poly_int_tree_p (TYPE_SIZE_UNIT (TREE_TYPE (TREE_OPERAND (base
, 0))),
8383 && maybe_ne (size
, 0U)
8384 && known_le (total_hwi
, size
))
8390 /* Return a positive integer when the symbol DECL is known to have
8391 a nonzero address, zero when it's known not to (e.g., it's a weak
8392 symbol), and a negative integer when the symbol is not yet in the
8393 symbol table and so whether or not its address is zero is unknown.
8394 For function local objects always return positive integer. */
8396 maybe_nonzero_address (tree decl
)
8398 if (DECL_P (decl
) && decl_in_symtab_p (decl
))
8399 if (struct symtab_node
*symbol
= symtab_node::get_create (decl
))
8400 return symbol
->nonzero_address ();
8402 /* Function local objects are never NULL. */
8404 && (DECL_CONTEXT (decl
)
8405 && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
8406 && auto_var_in_fn_p (decl
, DECL_CONTEXT (decl
))))
8412 /* Subroutine of fold_binary. This routine performs all of the
8413 transformations that are common to the equality/inequality
8414 operators (EQ_EXPR and NE_EXPR) and the ordering operators
8415 (LT_EXPR, LE_EXPR, GE_EXPR and GT_EXPR). Callers other than
8416 fold_binary should call fold_binary. Fold a comparison with
8417 tree code CODE and type TYPE with operands OP0 and OP1. Return
8418 the folded comparison or NULL_TREE. */
8421 fold_comparison (location_t loc
, enum tree_code code
, tree type
,
8424 const bool equality_code
= (code
== EQ_EXPR
|| code
== NE_EXPR
);
8425 tree arg0
, arg1
, tem
;
8430 STRIP_SIGN_NOPS (arg0
);
8431 STRIP_SIGN_NOPS (arg1
);
8433 /* For comparisons of pointers we can decompose it to a compile time
8434 comparison of the base objects and the offsets into the object.
8435 This requires at least one operand being an ADDR_EXPR or a
8436 POINTER_PLUS_EXPR to do more than the operand_equal_p test below. */
8437 if (POINTER_TYPE_P (TREE_TYPE (arg0
))
8438 && (TREE_CODE (arg0
) == ADDR_EXPR
8439 || TREE_CODE (arg1
) == ADDR_EXPR
8440 || TREE_CODE (arg0
) == POINTER_PLUS_EXPR
8441 || TREE_CODE (arg1
) == POINTER_PLUS_EXPR
))
8443 tree base0
, base1
, offset0
= NULL_TREE
, offset1
= NULL_TREE
;
8444 poly_int64 bitsize
, bitpos0
= 0, bitpos1
= 0;
8446 int volatilep
, reversep
, unsignedp
;
8447 bool indirect_base0
= false, indirect_base1
= false;
8449 /* Get base and offset for the access. Strip ADDR_EXPR for
8450 get_inner_reference, but put it back by stripping INDIRECT_REF
8451 off the base object if possible. indirect_baseN will be true
8452 if baseN is not an address but refers to the object itself. */
8454 if (TREE_CODE (arg0
) == ADDR_EXPR
)
8457 = get_inner_reference (TREE_OPERAND (arg0
, 0),
8458 &bitsize
, &bitpos0
, &offset0
, &mode
,
8459 &unsignedp
, &reversep
, &volatilep
);
8460 if (TREE_CODE (base0
) == INDIRECT_REF
)
8461 base0
= TREE_OPERAND (base0
, 0);
8463 indirect_base0
= true;
8465 else if (TREE_CODE (arg0
) == POINTER_PLUS_EXPR
)
8467 base0
= TREE_OPERAND (arg0
, 0);
8468 STRIP_SIGN_NOPS (base0
);
8469 if (TREE_CODE (base0
) == ADDR_EXPR
)
8472 = get_inner_reference (TREE_OPERAND (base0
, 0),
8473 &bitsize
, &bitpos0
, &offset0
, &mode
,
8474 &unsignedp
, &reversep
, &volatilep
);
8475 if (TREE_CODE (base0
) == INDIRECT_REF
)
8476 base0
= TREE_OPERAND (base0
, 0);
8478 indirect_base0
= true;
8480 if (offset0
== NULL_TREE
|| integer_zerop (offset0
))
8481 offset0
= TREE_OPERAND (arg0
, 1);
8483 offset0
= size_binop (PLUS_EXPR
, offset0
,
8484 TREE_OPERAND (arg0
, 1));
8485 if (poly_int_tree_p (offset0
))
8487 poly_offset_int tem
= wi::sext (wi::to_poly_offset (offset0
),
8488 TYPE_PRECISION (sizetype
));
8489 tem
<<= LOG2_BITS_PER_UNIT
;
8491 if (tem
.to_shwi (&bitpos0
))
8492 offset0
= NULL_TREE
;
8497 if (TREE_CODE (arg1
) == ADDR_EXPR
)
8500 = get_inner_reference (TREE_OPERAND (arg1
, 0),
8501 &bitsize
, &bitpos1
, &offset1
, &mode
,
8502 &unsignedp
, &reversep
, &volatilep
);
8503 if (TREE_CODE (base1
) == INDIRECT_REF
)
8504 base1
= TREE_OPERAND (base1
, 0);
8506 indirect_base1
= true;
8508 else if (TREE_CODE (arg1
) == POINTER_PLUS_EXPR
)
8510 base1
= TREE_OPERAND (arg1
, 0);
8511 STRIP_SIGN_NOPS (base1
);
8512 if (TREE_CODE (base1
) == ADDR_EXPR
)
8515 = get_inner_reference (TREE_OPERAND (base1
, 0),
8516 &bitsize
, &bitpos1
, &offset1
, &mode
,
8517 &unsignedp
, &reversep
, &volatilep
);
8518 if (TREE_CODE (base1
) == INDIRECT_REF
)
8519 base1
= TREE_OPERAND (base1
, 0);
8521 indirect_base1
= true;
8523 if (offset1
== NULL_TREE
|| integer_zerop (offset1
))
8524 offset1
= TREE_OPERAND (arg1
, 1);
8526 offset1
= size_binop (PLUS_EXPR
, offset1
,
8527 TREE_OPERAND (arg1
, 1));
8528 if (poly_int_tree_p (offset1
))
8530 poly_offset_int tem
= wi::sext (wi::to_poly_offset (offset1
),
8531 TYPE_PRECISION (sizetype
));
8532 tem
<<= LOG2_BITS_PER_UNIT
;
8534 if (tem
.to_shwi (&bitpos1
))
8535 offset1
= NULL_TREE
;
8539 /* If we have equivalent bases we might be able to simplify. */
8540 if (indirect_base0
== indirect_base1
8541 && operand_equal_p (base0
, base1
,
8542 indirect_base0
? OEP_ADDRESS_OF
: 0))
8544 /* We can fold this expression to a constant if the non-constant
8545 offset parts are equal. */
8546 if (offset0
== offset1
8547 || (offset0
&& offset1
8548 && operand_equal_p (offset0
, offset1
, 0)))
8551 && maybe_ne (bitpos0
, bitpos1
)
8552 && (pointer_may_wrap_p (base0
, offset0
, bitpos0
)
8553 || pointer_may_wrap_p (base1
, offset1
, bitpos1
)))
8554 fold_overflow_warning (("assuming pointer wraparound does not "
8555 "occur when comparing P +- C1 with "
8557 WARN_STRICT_OVERFLOW_CONDITIONAL
);
8562 if (known_eq (bitpos0
, bitpos1
))
8563 return boolean_true_node
;
8564 if (known_ne (bitpos0
, bitpos1
))
8565 return boolean_false_node
;
8568 if (known_ne (bitpos0
, bitpos1
))
8569 return boolean_true_node
;
8570 if (known_eq (bitpos0
, bitpos1
))
8571 return boolean_false_node
;
8574 if (known_lt (bitpos0
, bitpos1
))
8575 return boolean_true_node
;
8576 if (known_ge (bitpos0
, bitpos1
))
8577 return boolean_false_node
;
8580 if (known_le (bitpos0
, bitpos1
))
8581 return boolean_true_node
;
8582 if (known_gt (bitpos0
, bitpos1
))
8583 return boolean_false_node
;
8586 if (known_ge (bitpos0
, bitpos1
))
8587 return boolean_true_node
;
8588 if (known_lt (bitpos0
, bitpos1
))
8589 return boolean_false_node
;
8592 if (known_gt (bitpos0
, bitpos1
))
8593 return boolean_true_node
;
8594 if (known_le (bitpos0
, bitpos1
))
8595 return boolean_false_node
;
8600 /* We can simplify the comparison to a comparison of the variable
8601 offset parts if the constant offset parts are equal.
8602 Be careful to use signed sizetype here because otherwise we
8603 mess with array offsets in the wrong way. This is possible
8604 because pointer arithmetic is restricted to retain within an
8605 object and overflow on pointer differences is undefined as of
8606 6.5.6/8 and /9 with respect to the signed ptrdiff_t. */
8607 else if (known_eq (bitpos0
, bitpos1
))
8609 /* By converting to signed sizetype we cover middle-end pointer
8610 arithmetic which operates on unsigned pointer types of size
8611 type size and ARRAY_REF offsets which are properly sign or
8612 zero extended from their type in case it is narrower than
8614 if (offset0
== NULL_TREE
)
8615 offset0
= build_int_cst (ssizetype
, 0);
8617 offset0
= fold_convert_loc (loc
, ssizetype
, offset0
);
8618 if (offset1
== NULL_TREE
)
8619 offset1
= build_int_cst (ssizetype
, 0);
8621 offset1
= fold_convert_loc (loc
, ssizetype
, offset1
);
8624 && (pointer_may_wrap_p (base0
, offset0
, bitpos0
)
8625 || pointer_may_wrap_p (base1
, offset1
, bitpos1
)))
8626 fold_overflow_warning (("assuming pointer wraparound does not "
8627 "occur when comparing P +- C1 with "
8629 WARN_STRICT_OVERFLOW_COMPARISON
);
8631 return fold_build2_loc (loc
, code
, type
, offset0
, offset1
);
8634 /* For equal offsets we can simplify to a comparison of the
8636 else if (known_eq (bitpos0
, bitpos1
)
8638 ? base0
!= TREE_OPERAND (arg0
, 0) : base0
!= arg0
)
8640 ? base1
!= TREE_OPERAND (arg1
, 0) : base1
!= arg1
)
8641 && ((offset0
== offset1
)
8642 || (offset0
&& offset1
8643 && operand_equal_p (offset0
, offset1
, 0))))
8646 base0
= build_fold_addr_expr_loc (loc
, base0
);
8648 base1
= build_fold_addr_expr_loc (loc
, base1
);
8649 return fold_build2_loc (loc
, code
, type
, base0
, base1
);
8651 /* Comparison between an ordinary (non-weak) symbol and a null
8652 pointer can be eliminated since such symbols must have a non
8653 null address. In C, relational expressions between pointers
8654 to objects and null pointers are undefined. The results
8655 below follow the C++ rules with the additional property that
8656 every object pointer compares greater than a null pointer.
8658 else if (((DECL_P (base0
)
8659 && maybe_nonzero_address (base0
) > 0
8660 /* Avoid folding references to struct members at offset 0 to
8661 prevent tests like '&ptr->firstmember == 0' from getting
8662 eliminated. When ptr is null, although the -> expression
8663 is strictly speaking invalid, GCC retains it as a matter
8664 of QoI. See PR c/44555. */
8665 && (offset0
== NULL_TREE
&& known_ne (bitpos0
, 0)))
8666 || CONSTANT_CLASS_P (base0
))
8668 /* The caller guarantees that when one of the arguments is
8669 constant (i.e., null in this case) it is second. */
8670 && integer_zerop (arg1
))
8677 return constant_boolean_node (false, type
);
8681 return constant_boolean_node (true, type
);
8688 /* Transform comparisons of the form X +- C1 CMP Y +- C2 to
8689 X CMP Y +- C2 +- C1 for signed X, Y. This is valid if
8690 the resulting offset is smaller in absolute value than the
8691 original one and has the same sign. */
8692 if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
8693 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
))
8694 && (TREE_CODE (arg0
) == PLUS_EXPR
|| TREE_CODE (arg0
) == MINUS_EXPR
)
8695 && (TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
8696 && !TREE_OVERFLOW (TREE_OPERAND (arg0
, 1)))
8697 && (TREE_CODE (arg1
) == PLUS_EXPR
|| TREE_CODE (arg1
) == MINUS_EXPR
)
8698 && (TREE_CODE (TREE_OPERAND (arg1
, 1)) == INTEGER_CST
8699 && !TREE_OVERFLOW (TREE_OPERAND (arg1
, 1))))
8701 tree const1
= TREE_OPERAND (arg0
, 1);
8702 tree const2
= TREE_OPERAND (arg1
, 1);
8703 tree variable1
= TREE_OPERAND (arg0
, 0);
8704 tree variable2
= TREE_OPERAND (arg1
, 0);
8706 const char * const warnmsg
= G_("assuming signed overflow does not "
8707 "occur when combining constants around "
8710 /* Put the constant on the side where it doesn't overflow and is
8711 of lower absolute value and of same sign than before. */
8712 cst
= int_const_binop (TREE_CODE (arg0
) == TREE_CODE (arg1
)
8713 ? MINUS_EXPR
: PLUS_EXPR
,
8715 if (!TREE_OVERFLOW (cst
)
8716 && tree_int_cst_compare (const2
, cst
) == tree_int_cst_sgn (const2
)
8717 && tree_int_cst_sgn (cst
) == tree_int_cst_sgn (const2
))
8719 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_COMPARISON
);
8720 return fold_build2_loc (loc
, code
, type
,
8722 fold_build2_loc (loc
, TREE_CODE (arg1
),
8727 cst
= int_const_binop (TREE_CODE (arg0
) == TREE_CODE (arg1
)
8728 ? MINUS_EXPR
: PLUS_EXPR
,
8730 if (!TREE_OVERFLOW (cst
)
8731 && tree_int_cst_compare (const1
, cst
) == tree_int_cst_sgn (const1
)
8732 && tree_int_cst_sgn (cst
) == tree_int_cst_sgn (const1
))
8734 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_COMPARISON
);
8735 return fold_build2_loc (loc
, code
, type
,
8736 fold_build2_loc (loc
, TREE_CODE (arg0
),
8743 tem
= maybe_canonicalize_comparison (loc
, code
, type
, arg0
, arg1
);
8747 /* If we are comparing an expression that just has comparisons
8748 of two integer values, arithmetic expressions of those comparisons,
8749 and constants, we can simplify it. There are only three cases
8750 to check: the two values can either be equal, the first can be
8751 greater, or the second can be greater. Fold the expression for
8752 those three values. Since each value must be 0 or 1, we have
8753 eight possibilities, each of which corresponds to the constant 0
8754 or 1 or one of the six possible comparisons.
8756 This handles common cases like (a > b) == 0 but also handles
8757 expressions like ((x > y) - (y > x)) > 0, which supposedly
8758 occur in macroized code. */
8760 if (TREE_CODE (arg1
) == INTEGER_CST
&& TREE_CODE (arg0
) != INTEGER_CST
)
8762 tree cval1
= 0, cval2
= 0;
8765 if (twoval_comparison_p (arg0
, &cval1
, &cval2
, &save_p
)
8766 /* Don't handle degenerate cases here; they should already
8767 have been handled anyway. */
8768 && cval1
!= 0 && cval2
!= 0
8769 && ! (TREE_CONSTANT (cval1
) && TREE_CONSTANT (cval2
))
8770 && TREE_TYPE (cval1
) == TREE_TYPE (cval2
)
8771 && INTEGRAL_TYPE_P (TREE_TYPE (cval1
))
8772 && TYPE_MAX_VALUE (TREE_TYPE (cval1
))
8773 && TYPE_MAX_VALUE (TREE_TYPE (cval2
))
8774 && ! operand_equal_p (TYPE_MIN_VALUE (TREE_TYPE (cval1
)),
8775 TYPE_MAX_VALUE (TREE_TYPE (cval2
)), 0))
8777 tree maxval
= TYPE_MAX_VALUE (TREE_TYPE (cval1
));
8778 tree minval
= TYPE_MIN_VALUE (TREE_TYPE (cval1
));
8780 /* We can't just pass T to eval_subst in case cval1 or cval2
8781 was the same as ARG1. */
8784 = fold_build2_loc (loc
, code
, type
,
8785 eval_subst (loc
, arg0
, cval1
, maxval
,
8789 = fold_build2_loc (loc
, code
, type
,
8790 eval_subst (loc
, arg0
, cval1
, maxval
,
8794 = fold_build2_loc (loc
, code
, type
,
8795 eval_subst (loc
, arg0
, cval1
, minval
,
8799 /* All three of these results should be 0 or 1. Confirm they are.
8800 Then use those values to select the proper code to use. */
8802 if (TREE_CODE (high_result
) == INTEGER_CST
8803 && TREE_CODE (equal_result
) == INTEGER_CST
8804 && TREE_CODE (low_result
) == INTEGER_CST
)
8806 /* Make a 3-bit mask with the high-order bit being the
8807 value for `>', the next for '=', and the low for '<'. */
8808 switch ((integer_onep (high_result
) * 4)
8809 + (integer_onep (equal_result
) * 2)
8810 + integer_onep (low_result
))
8814 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
8835 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
8840 tem
= save_expr (build2 (code
, type
, cval1
, cval2
));
8841 protected_set_expr_location (tem
, loc
);
8844 return fold_build2_loc (loc
, code
, type
, cval1
, cval2
);
8853 /* Subroutine of fold_binary. Optimize complex multiplications of the
8854 form z * conj(z), as pow(realpart(z),2) + pow(imagpart(z),2). The
8855 argument EXPR represents the expression "z" of type TYPE. */
8858 fold_mult_zconjz (location_t loc
, tree type
, tree expr
)
8860 tree itype
= TREE_TYPE (type
);
8861 tree rpart
, ipart
, tem
;
8863 if (TREE_CODE (expr
) == COMPLEX_EXPR
)
8865 rpart
= TREE_OPERAND (expr
, 0);
8866 ipart
= TREE_OPERAND (expr
, 1);
8868 else if (TREE_CODE (expr
) == COMPLEX_CST
)
8870 rpart
= TREE_REALPART (expr
);
8871 ipart
= TREE_IMAGPART (expr
);
8875 expr
= save_expr (expr
);
8876 rpart
= fold_build1_loc (loc
, REALPART_EXPR
, itype
, expr
);
8877 ipart
= fold_build1_loc (loc
, IMAGPART_EXPR
, itype
, expr
);
8880 rpart
= save_expr (rpart
);
8881 ipart
= save_expr (ipart
);
8882 tem
= fold_build2_loc (loc
, PLUS_EXPR
, itype
,
8883 fold_build2_loc (loc
, MULT_EXPR
, itype
, rpart
, rpart
),
8884 fold_build2_loc (loc
, MULT_EXPR
, itype
, ipart
, ipart
));
8885 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, tem
,
8886 build_zero_cst (itype
));
8890 /* Helper function for fold_vec_perm. Store elements of VECTOR_CST or
8891 CONSTRUCTOR ARG into array ELTS, which has NELTS elements, and return
8892 true if successful. */
8895 vec_cst_ctor_to_array (tree arg
, unsigned int nelts
, tree
*elts
)
8899 if (TREE_CODE (arg
) == VECTOR_CST
)
8901 for (i
= 0; i
< VECTOR_CST_NELTS (arg
); ++i
)
8902 elts
[i
] = VECTOR_CST_ELT (arg
, i
);
8904 else if (TREE_CODE (arg
) == CONSTRUCTOR
)
8906 constructor_elt
*elt
;
8908 FOR_EACH_VEC_SAFE_ELT (CONSTRUCTOR_ELTS (arg
), i
, elt
)
8909 if (i
>= nelts
|| TREE_CODE (TREE_TYPE (elt
->value
)) == VECTOR_TYPE
)
8912 elts
[i
] = elt
->value
;
8916 for (; i
< nelts
; i
++)
8918 = fold_convert (TREE_TYPE (TREE_TYPE (arg
)), integer_zero_node
);
8922 /* Attempt to fold vector permutation of ARG0 and ARG1 vectors using SEL
8923 selector. Return the folded VECTOR_CST or CONSTRUCTOR if successful,
8924 NULL_TREE otherwise. */
8927 fold_vec_perm (tree type
, tree arg0
, tree arg1
, const vec_perm_indices
&sel
)
8930 bool need_ctor
= false;
8932 unsigned int nelts
= sel
.length ();
8933 gcc_assert (TYPE_VECTOR_SUBPARTS (type
) == nelts
8934 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0
)) == nelts
8935 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg1
)) == nelts
);
8936 if (TREE_TYPE (TREE_TYPE (arg0
)) != TREE_TYPE (type
)
8937 || TREE_TYPE (TREE_TYPE (arg1
)) != TREE_TYPE (type
))
8940 tree
*in_elts
= XALLOCAVEC (tree
, nelts
* 2);
8941 if (!vec_cst_ctor_to_array (arg0
, nelts
, in_elts
)
8942 || !vec_cst_ctor_to_array (arg1
, nelts
, in_elts
+ nelts
))
8945 tree_vector_builder
out_elts (type
, nelts
, 1);
8946 for (i
= 0; i
< nelts
; i
++)
8948 if (!CONSTANT_CLASS_P (in_elts
[sel
[i
]]))
8950 out_elts
.quick_push (unshare_expr (in_elts
[sel
[i
]]));
8955 vec
<constructor_elt
, va_gc
> *v
;
8956 vec_alloc (v
, nelts
);
8957 for (i
= 0; i
< nelts
; i
++)
8958 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, out_elts
[i
]);
8959 return build_constructor (type
, v
);
8962 return out_elts
.build ();
8965 /* Try to fold a pointer difference of type TYPE two address expressions of
8966 array references AREF0 and AREF1 using location LOC. Return a
8967 simplified expression for the difference or NULL_TREE. */
8970 fold_addr_of_array_ref_difference (location_t loc
, tree type
,
8971 tree aref0
, tree aref1
,
8972 bool use_pointer_diff
)
8974 tree base0
= TREE_OPERAND (aref0
, 0);
8975 tree base1
= TREE_OPERAND (aref1
, 0);
8976 tree base_offset
= build_int_cst (type
, 0);
8978 /* If the bases are array references as well, recurse. If the bases
8979 are pointer indirections compute the difference of the pointers.
8980 If the bases are equal, we are set. */
8981 if ((TREE_CODE (base0
) == ARRAY_REF
8982 && TREE_CODE (base1
) == ARRAY_REF
8984 = fold_addr_of_array_ref_difference (loc
, type
, base0
, base1
,
8986 || (INDIRECT_REF_P (base0
)
8987 && INDIRECT_REF_P (base1
)
8990 ? fold_binary_loc (loc
, POINTER_DIFF_EXPR
, type
,
8991 TREE_OPERAND (base0
, 0),
8992 TREE_OPERAND (base1
, 0))
8993 : fold_binary_loc (loc
, MINUS_EXPR
, type
,
8995 TREE_OPERAND (base0
, 0)),
8997 TREE_OPERAND (base1
, 0)))))
8998 || operand_equal_p (base0
, base1
, OEP_ADDRESS_OF
))
9000 tree op0
= fold_convert_loc (loc
, type
, TREE_OPERAND (aref0
, 1));
9001 tree op1
= fold_convert_loc (loc
, type
, TREE_OPERAND (aref1
, 1));
9002 tree esz
= fold_convert_loc (loc
, type
, array_ref_element_size (aref0
));
9003 tree diff
= fold_build2_loc (loc
, MINUS_EXPR
, type
, op0
, op1
);
9004 return fold_build2_loc (loc
, PLUS_EXPR
, type
,
9006 fold_build2_loc (loc
, MULT_EXPR
, type
,
9012 /* If the real or vector real constant CST of type TYPE has an exact
9013 inverse, return it, else return NULL. */
9016 exact_inverse (tree type
, tree cst
)
9022 switch (TREE_CODE (cst
))
9025 r
= TREE_REAL_CST (cst
);
9027 if (exact_real_inverse (TYPE_MODE (type
), &r
))
9028 return build_real (type
, r
);
9034 unit_type
= TREE_TYPE (type
);
9035 mode
= TYPE_MODE (unit_type
);
9037 tree_vector_builder elts
;
9038 if (!elts
.new_unary_operation (type
, cst
, false))
9040 unsigned int count
= elts
.encoded_nelts ();
9041 for (unsigned int i
= 0; i
< count
; ++i
)
9043 r
= TREE_REAL_CST (VECTOR_CST_ELT (cst
, i
));
9044 if (!exact_real_inverse (mode
, &r
))
9046 elts
.quick_push (build_real (unit_type
, r
));
9049 return elts
.build ();
9057 /* Mask out the tz least significant bits of X of type TYPE where
9058 tz is the number of trailing zeroes in Y. */
9060 mask_with_tz (tree type
, const wide_int
&x
, const wide_int
&y
)
9062 int tz
= wi::ctz (y
);
9064 return wi::mask (tz
, true, TYPE_PRECISION (type
)) & x
;
9068 /* Return true when T is an address and is known to be nonzero.
9069 For floating point we further ensure that T is not denormal.
9070 Similar logic is present in nonzero_address in rtlanal.h.
9072 If the return value is based on the assumption that signed overflow
9073 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
9074 change *STRICT_OVERFLOW_P. */
9077 tree_expr_nonzero_warnv_p (tree t
, bool *strict_overflow_p
)
9079 tree type
= TREE_TYPE (t
);
9080 enum tree_code code
;
9082 /* Doing something useful for floating point would need more work. */
9083 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
9086 code
= TREE_CODE (t
);
9087 switch (TREE_CODE_CLASS (code
))
9090 return tree_unary_nonzero_warnv_p (code
, type
, TREE_OPERAND (t
, 0),
9093 case tcc_comparison
:
9094 return tree_binary_nonzero_warnv_p (code
, type
,
9095 TREE_OPERAND (t
, 0),
9096 TREE_OPERAND (t
, 1),
9099 case tcc_declaration
:
9101 return tree_single_nonzero_warnv_p (t
, strict_overflow_p
);
9109 case TRUTH_NOT_EXPR
:
9110 return tree_unary_nonzero_warnv_p (code
, type
, TREE_OPERAND (t
, 0),
9113 case TRUTH_AND_EXPR
:
9115 case TRUTH_XOR_EXPR
:
9116 return tree_binary_nonzero_warnv_p (code
, type
,
9117 TREE_OPERAND (t
, 0),
9118 TREE_OPERAND (t
, 1),
9126 case WITH_SIZE_EXPR
:
9128 return tree_single_nonzero_warnv_p (t
, strict_overflow_p
);
9133 return tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 1),
9137 return tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 0),
9142 tree fndecl
= get_callee_fndecl (t
);
9143 if (!fndecl
) return false;
9144 if (flag_delete_null_pointer_checks
&& !flag_check_new
9145 && DECL_IS_OPERATOR_NEW (fndecl
)
9146 && !TREE_NOTHROW (fndecl
))
9148 if (flag_delete_null_pointer_checks
9149 && lookup_attribute ("returns_nonnull",
9150 TYPE_ATTRIBUTES (TREE_TYPE (fndecl
))))
9152 return alloca_call_p (t
);
9161 /* Return true when T is an address and is known to be nonzero.
9162 Handle warnings about undefined signed overflow. */
9165 tree_expr_nonzero_p (tree t
)
9167 bool ret
, strict_overflow_p
;
9169 strict_overflow_p
= false;
9170 ret
= tree_expr_nonzero_warnv_p (t
, &strict_overflow_p
);
9171 if (strict_overflow_p
)
9172 fold_overflow_warning (("assuming signed overflow does not occur when "
9173 "determining that expression is always "
9175 WARN_STRICT_OVERFLOW_MISC
);
9179 /* Return true if T is known not to be equal to an integer W. */
9182 expr_not_equal_to (tree t
, const wide_int
&w
)
9184 wide_int min
, max
, nz
;
9185 value_range_type rtype
;
9186 switch (TREE_CODE (t
))
9189 return wi::to_wide (t
) != w
;
9192 if (!INTEGRAL_TYPE_P (TREE_TYPE (t
)))
9194 rtype
= get_range_info (t
, &min
, &max
);
9195 if (rtype
== VR_RANGE
)
9197 if (wi::lt_p (max
, w
, TYPE_SIGN (TREE_TYPE (t
))))
9199 if (wi::lt_p (w
, min
, TYPE_SIGN (TREE_TYPE (t
))))
9202 else if (rtype
== VR_ANTI_RANGE
9203 && wi::le_p (min
, w
, TYPE_SIGN (TREE_TYPE (t
)))
9204 && wi::le_p (w
, max
, TYPE_SIGN (TREE_TYPE (t
))))
9206 /* If T has some known zero bits and W has any of those bits set,
9207 then T is known not to be equal to W. */
9208 if (wi::ne_p (wi::zext (wi::bit_and_not (w
, get_nonzero_bits (t
)),
9209 TYPE_PRECISION (TREE_TYPE (t
))), 0))
9218 /* Fold a binary expression of code CODE and type TYPE with operands
9219 OP0 and OP1. LOC is the location of the resulting expression.
9220 Return the folded expression if folding is successful. Otherwise,
9221 return NULL_TREE. */
9224 fold_binary_loc (location_t loc
, enum tree_code code
, tree type
,
9227 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
9228 tree arg0
, arg1
, tem
;
9229 tree t1
= NULL_TREE
;
9230 bool strict_overflow_p
;
9233 gcc_assert (IS_EXPR_CODE_CLASS (kind
)
9234 && TREE_CODE_LENGTH (code
) == 2
9236 && op1
!= NULL_TREE
);
9241 /* Strip any conversions that don't change the mode. This is
9242 safe for every expression, except for a comparison expression
9243 because its signedness is derived from its operands. So, in
9244 the latter case, only strip conversions that don't change the
9245 signedness. MIN_EXPR/MAX_EXPR also need signedness of arguments
9248 Note that this is done as an internal manipulation within the
9249 constant folder, in order to find the simplest representation
9250 of the arguments so that their form can be studied. In any
9251 cases, the appropriate type conversions should be put back in
9252 the tree that will get out of the constant folder. */
9254 if (kind
== tcc_comparison
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
9256 STRIP_SIGN_NOPS (arg0
);
9257 STRIP_SIGN_NOPS (arg1
);
9265 /* Note that TREE_CONSTANT isn't enough: static var addresses are
9266 constant but we can't do arithmetic on them. */
9267 if (CONSTANT_CLASS_P (arg0
) && CONSTANT_CLASS_P (arg1
))
9269 tem
= const_binop (code
, type
, arg0
, arg1
);
9270 if (tem
!= NULL_TREE
)
9272 if (TREE_TYPE (tem
) != type
)
9273 tem
= fold_convert_loc (loc
, type
, tem
);
9278 /* If this is a commutative operation, and ARG0 is a constant, move it
9279 to ARG1 to reduce the number of tests below. */
9280 if (commutative_tree_code (code
)
9281 && tree_swap_operands_p (arg0
, arg1
))
9282 return fold_build2_loc (loc
, code
, type
, op1
, op0
);
9284 /* Likewise if this is a comparison, and ARG0 is a constant, move it
9285 to ARG1 to reduce the number of tests below. */
9286 if (kind
== tcc_comparison
9287 && tree_swap_operands_p (arg0
, arg1
))
9288 return fold_build2_loc (loc
, swap_tree_comparison (code
), type
, op1
, op0
);
9290 tem
= generic_simplify (loc
, code
, type
, op0
, op1
);
9294 /* ARG0 is the first operand of EXPR, and ARG1 is the second operand.
9296 First check for cases where an arithmetic operation is applied to a
9297 compound, conditional, or comparison operation. Push the arithmetic
9298 operation inside the compound or conditional to see if any folding
9299 can then be done. Convert comparison to conditional for this purpose.
9300 The also optimizes non-constant cases that used to be done in
9303 Before we do that, see if this is a BIT_AND_EXPR or a BIT_IOR_EXPR,
9304 one of the operands is a comparison and the other is a comparison, a
9305 BIT_AND_EXPR with the constant 1, or a truth value. In that case, the
9306 code below would make the expression more complex. Change it to a
9307 TRUTH_{AND,OR}_EXPR. Likewise, convert a similar NE_EXPR to
9308 TRUTH_XOR_EXPR and an EQ_EXPR to the inversion of a TRUTH_XOR_EXPR. */
9310 if ((code
== BIT_AND_EXPR
|| code
== BIT_IOR_EXPR
9311 || code
== EQ_EXPR
|| code
== NE_EXPR
)
9312 && TREE_CODE (type
) != VECTOR_TYPE
9313 && ((truth_value_p (TREE_CODE (arg0
))
9314 && (truth_value_p (TREE_CODE (arg1
))
9315 || (TREE_CODE (arg1
) == BIT_AND_EXPR
9316 && integer_onep (TREE_OPERAND (arg1
, 1)))))
9317 || (truth_value_p (TREE_CODE (arg1
))
9318 && (truth_value_p (TREE_CODE (arg0
))
9319 || (TREE_CODE (arg0
) == BIT_AND_EXPR
9320 && integer_onep (TREE_OPERAND (arg0
, 1)))))))
9322 tem
= fold_build2_loc (loc
, code
== BIT_AND_EXPR
? TRUTH_AND_EXPR
9323 : code
== BIT_IOR_EXPR
? TRUTH_OR_EXPR
9326 fold_convert_loc (loc
, boolean_type_node
, arg0
),
9327 fold_convert_loc (loc
, boolean_type_node
, arg1
));
9329 if (code
== EQ_EXPR
)
9330 tem
= invert_truthvalue_loc (loc
, tem
);
9332 return fold_convert_loc (loc
, type
, tem
);
9335 if (TREE_CODE_CLASS (code
) == tcc_binary
9336 || TREE_CODE_CLASS (code
) == tcc_comparison
)
9338 if (TREE_CODE (arg0
) == COMPOUND_EXPR
)
9340 tem
= fold_build2_loc (loc
, code
, type
,
9341 fold_convert_loc (loc
, TREE_TYPE (op0
),
9342 TREE_OPERAND (arg0
, 1)), op1
);
9343 return build2_loc (loc
, COMPOUND_EXPR
, type
, TREE_OPERAND (arg0
, 0),
9346 if (TREE_CODE (arg1
) == COMPOUND_EXPR
)
9348 tem
= fold_build2_loc (loc
, code
, type
, op0
,
9349 fold_convert_loc (loc
, TREE_TYPE (op1
),
9350 TREE_OPERAND (arg1
, 1)));
9351 return build2_loc (loc
, COMPOUND_EXPR
, type
, TREE_OPERAND (arg1
, 0),
9355 if (TREE_CODE (arg0
) == COND_EXPR
9356 || TREE_CODE (arg0
) == VEC_COND_EXPR
9357 || COMPARISON_CLASS_P (arg0
))
9359 tem
= fold_binary_op_with_conditional_arg (loc
, code
, type
, op0
, op1
,
9361 /*cond_first_p=*/1);
9362 if (tem
!= NULL_TREE
)
9366 if (TREE_CODE (arg1
) == COND_EXPR
9367 || TREE_CODE (arg1
) == VEC_COND_EXPR
9368 || COMPARISON_CLASS_P (arg1
))
9370 tem
= fold_binary_op_with_conditional_arg (loc
, code
, type
, op0
, op1
,
9372 /*cond_first_p=*/0);
9373 if (tem
!= NULL_TREE
)
9381 /* MEM[&MEM[p, CST1], CST2] -> MEM[p, CST1 + CST2]. */
9382 if (TREE_CODE (arg0
) == ADDR_EXPR
9383 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == MEM_REF
)
9385 tree iref
= TREE_OPERAND (arg0
, 0);
9386 return fold_build2 (MEM_REF
, type
,
9387 TREE_OPERAND (iref
, 0),
9388 int_const_binop (PLUS_EXPR
, arg1
,
9389 TREE_OPERAND (iref
, 1)));
9392 /* MEM[&a.b, CST2] -> MEM[&a, offsetof (a, b) + CST2]. */
9393 if (TREE_CODE (arg0
) == ADDR_EXPR
9394 && handled_component_p (TREE_OPERAND (arg0
, 0)))
9398 base
= get_addr_base_and_unit_offset (TREE_OPERAND (arg0
, 0),
9402 return fold_build2 (MEM_REF
, type
,
9403 build_fold_addr_expr (base
),
9404 int_const_binop (PLUS_EXPR
, arg1
,
9405 size_int (coffset
)));
9410 case POINTER_PLUS_EXPR
:
9411 /* INT +p INT -> (PTR)(INT + INT). Stripping types allows for this. */
9412 if (INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
9413 && INTEGRAL_TYPE_P (TREE_TYPE (arg0
)))
9414 return fold_convert_loc (loc
, type
,
9415 fold_build2_loc (loc
, PLUS_EXPR
, sizetype
,
9416 fold_convert_loc (loc
, sizetype
,
9418 fold_convert_loc (loc
, sizetype
,
9424 if (INTEGRAL_TYPE_P (type
) || VECTOR_INTEGER_TYPE_P (type
))
9426 /* X + (X / CST) * -CST is X % CST. */
9427 if (TREE_CODE (arg1
) == MULT_EXPR
9428 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == TRUNC_DIV_EXPR
9429 && operand_equal_p (arg0
,
9430 TREE_OPERAND (TREE_OPERAND (arg1
, 0), 0), 0))
9432 tree cst0
= TREE_OPERAND (TREE_OPERAND (arg1
, 0), 1);
9433 tree cst1
= TREE_OPERAND (arg1
, 1);
9434 tree sum
= fold_binary_loc (loc
, PLUS_EXPR
, TREE_TYPE (cst1
),
9436 if (sum
&& integer_zerop (sum
))
9437 return fold_convert_loc (loc
, type
,
9438 fold_build2_loc (loc
, TRUNC_MOD_EXPR
,
9439 TREE_TYPE (arg0
), arg0
,
9444 /* Handle (A1 * C1) + (A2 * C2) with A1, A2 or C1, C2 being the same or
9445 one. Make sure the type is not saturating and has the signedness of
9446 the stripped operands, as fold_plusminus_mult_expr will re-associate.
9447 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
9448 if ((TREE_CODE (arg0
) == MULT_EXPR
9449 || TREE_CODE (arg1
) == MULT_EXPR
)
9450 && !TYPE_SATURATING (type
)
9451 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg0
))
9452 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg1
))
9453 && (!FLOAT_TYPE_P (type
) || flag_associative_math
))
9455 tree tem
= fold_plusminus_mult_expr (loc
, code
, type
, arg0
, arg1
);
9460 if (! FLOAT_TYPE_P (type
))
9462 /* Reassociate (plus (plus (mult) (foo)) (mult)) as
9463 (plus (plus (mult) (mult)) (foo)) so that we can
9464 take advantage of the factoring cases below. */
9465 if (ANY_INTEGRAL_TYPE_P (type
)
9466 && TYPE_OVERFLOW_WRAPS (type
)
9467 && (((TREE_CODE (arg0
) == PLUS_EXPR
9468 || TREE_CODE (arg0
) == MINUS_EXPR
)
9469 && TREE_CODE (arg1
) == MULT_EXPR
)
9470 || ((TREE_CODE (arg1
) == PLUS_EXPR
9471 || TREE_CODE (arg1
) == MINUS_EXPR
)
9472 && TREE_CODE (arg0
) == MULT_EXPR
)))
9474 tree parg0
, parg1
, parg
, marg
;
9475 enum tree_code pcode
;
9477 if (TREE_CODE (arg1
) == MULT_EXPR
)
9478 parg
= arg0
, marg
= arg1
;
9480 parg
= arg1
, marg
= arg0
;
9481 pcode
= TREE_CODE (parg
);
9482 parg0
= TREE_OPERAND (parg
, 0);
9483 parg1
= TREE_OPERAND (parg
, 1);
9487 if (TREE_CODE (parg0
) == MULT_EXPR
9488 && TREE_CODE (parg1
) != MULT_EXPR
)
9489 return fold_build2_loc (loc
, pcode
, type
,
9490 fold_build2_loc (loc
, PLUS_EXPR
, type
,
9491 fold_convert_loc (loc
, type
,
9493 fold_convert_loc (loc
, type
,
9495 fold_convert_loc (loc
, type
, parg1
));
9496 if (TREE_CODE (parg0
) != MULT_EXPR
9497 && TREE_CODE (parg1
) == MULT_EXPR
)
9499 fold_build2_loc (loc
, PLUS_EXPR
, type
,
9500 fold_convert_loc (loc
, type
, parg0
),
9501 fold_build2_loc (loc
, pcode
, type
,
9502 fold_convert_loc (loc
, type
, marg
),
9503 fold_convert_loc (loc
, type
,
9509 /* Fold __complex__ ( x, 0 ) + __complex__ ( 0, y )
9510 to __complex__ ( x, y ). This is not the same for SNaNs or
9511 if signed zeros are involved. */
9512 if (!HONOR_SNANS (element_mode (arg0
))
9513 && !HONOR_SIGNED_ZEROS (element_mode (arg0
))
9514 && COMPLEX_FLOAT_TYPE_P (TREE_TYPE (arg0
)))
9516 tree rtype
= TREE_TYPE (TREE_TYPE (arg0
));
9517 tree arg0r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg0
);
9518 tree arg0i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg0
);
9519 bool arg0rz
= false, arg0iz
= false;
9520 if ((arg0r
&& (arg0rz
= real_zerop (arg0r
)))
9521 || (arg0i
&& (arg0iz
= real_zerop (arg0i
))))
9523 tree arg1r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg1
);
9524 tree arg1i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg1
);
9525 if (arg0rz
&& arg1i
&& real_zerop (arg1i
))
9527 tree rp
= arg1r
? arg1r
9528 : build1 (REALPART_EXPR
, rtype
, arg1
);
9529 tree ip
= arg0i
? arg0i
9530 : build1 (IMAGPART_EXPR
, rtype
, arg0
);
9531 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
9533 else if (arg0iz
&& arg1r
&& real_zerop (arg1r
))
9535 tree rp
= arg0r
? arg0r
9536 : build1 (REALPART_EXPR
, rtype
, arg0
);
9537 tree ip
= arg1i
? arg1i
9538 : build1 (IMAGPART_EXPR
, rtype
, arg1
);
9539 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
9544 /* Convert a + (b*c + d*e) into (a + b*c) + d*e.
9545 We associate floats only if the user has specified
9546 -fassociative-math. */
9547 if (flag_associative_math
9548 && TREE_CODE (arg1
) == PLUS_EXPR
9549 && TREE_CODE (arg0
) != MULT_EXPR
)
9551 tree tree10
= TREE_OPERAND (arg1
, 0);
9552 tree tree11
= TREE_OPERAND (arg1
, 1);
9553 if (TREE_CODE (tree11
) == MULT_EXPR
9554 && TREE_CODE (tree10
) == MULT_EXPR
)
9557 tree0
= fold_build2_loc (loc
, PLUS_EXPR
, type
, arg0
, tree10
);
9558 return fold_build2_loc (loc
, PLUS_EXPR
, type
, tree0
, tree11
);
9561 /* Convert (b*c + d*e) + a into b*c + (d*e +a).
9562 We associate floats only if the user has specified
9563 -fassociative-math. */
9564 if (flag_associative_math
9565 && TREE_CODE (arg0
) == PLUS_EXPR
9566 && TREE_CODE (arg1
) != MULT_EXPR
)
9568 tree tree00
= TREE_OPERAND (arg0
, 0);
9569 tree tree01
= TREE_OPERAND (arg0
, 1);
9570 if (TREE_CODE (tree01
) == MULT_EXPR
9571 && TREE_CODE (tree00
) == MULT_EXPR
)
9574 tree0
= fold_build2_loc (loc
, PLUS_EXPR
, type
, tree01
, arg1
);
9575 return fold_build2_loc (loc
, PLUS_EXPR
, type
, tree00
, tree0
);
9581 /* (A << C1) + (A >> C2) if A is unsigned and C1+C2 is the size of A
9582 is a rotate of A by C1 bits. */
9583 /* (A << B) + (A >> (Z - B)) if A is unsigned and Z is the size of A
9584 is a rotate of A by B bits.
9585 Similarly for (A << B) | (A >> (-B & C3)) where C3 is Z-1,
9586 though in this case CODE must be | and not + or ^, otherwise
9587 it doesn't return A when B is 0. */
9589 enum tree_code code0
, code1
;
9591 code0
= TREE_CODE (arg0
);
9592 code1
= TREE_CODE (arg1
);
9593 if (((code0
== RSHIFT_EXPR
&& code1
== LSHIFT_EXPR
)
9594 || (code1
== RSHIFT_EXPR
&& code0
== LSHIFT_EXPR
))
9595 && operand_equal_p (TREE_OPERAND (arg0
, 0),
9596 TREE_OPERAND (arg1
, 0), 0)
9597 && (rtype
= TREE_TYPE (TREE_OPERAND (arg0
, 0)),
9598 TYPE_UNSIGNED (rtype
))
9599 /* Only create rotates in complete modes. Other cases are not
9600 expanded properly. */
9601 && (element_precision (rtype
)
9602 == GET_MODE_UNIT_PRECISION (TYPE_MODE (rtype
))))
9604 tree tree01
, tree11
;
9605 tree orig_tree01
, orig_tree11
;
9606 enum tree_code code01
, code11
;
9608 tree01
= orig_tree01
= TREE_OPERAND (arg0
, 1);
9609 tree11
= orig_tree11
= TREE_OPERAND (arg1
, 1);
9610 STRIP_NOPS (tree01
);
9611 STRIP_NOPS (tree11
);
9612 code01
= TREE_CODE (tree01
);
9613 code11
= TREE_CODE (tree11
);
9614 if (code11
!= MINUS_EXPR
9615 && (code01
== MINUS_EXPR
|| code01
== BIT_AND_EXPR
))
9617 std::swap (code0
, code1
);
9618 std::swap (code01
, code11
);
9619 std::swap (tree01
, tree11
);
9620 std::swap (orig_tree01
, orig_tree11
);
9622 if (code01
== INTEGER_CST
9623 && code11
== INTEGER_CST
9624 && (wi::to_widest (tree01
) + wi::to_widest (tree11
)
9625 == element_precision (rtype
)))
9627 tem
= build2_loc (loc
, LROTATE_EXPR
,
9628 rtype
, TREE_OPERAND (arg0
, 0),
9629 code0
== LSHIFT_EXPR
9630 ? orig_tree01
: orig_tree11
);
9631 return fold_convert_loc (loc
, type
, tem
);
9633 else if (code11
== MINUS_EXPR
)
9635 tree tree110
, tree111
;
9636 tree110
= TREE_OPERAND (tree11
, 0);
9637 tree111
= TREE_OPERAND (tree11
, 1);
9638 STRIP_NOPS (tree110
);
9639 STRIP_NOPS (tree111
);
9640 if (TREE_CODE (tree110
) == INTEGER_CST
9641 && compare_tree_int (tree110
,
9642 element_precision (rtype
)) == 0
9643 && operand_equal_p (tree01
, tree111
, 0))
9645 tem
= build2_loc (loc
, (code0
== LSHIFT_EXPR
9646 ? LROTATE_EXPR
: RROTATE_EXPR
),
9647 rtype
, TREE_OPERAND (arg0
, 0),
9649 return fold_convert_loc (loc
, type
, tem
);
9652 else if (code
== BIT_IOR_EXPR
9653 && code11
== BIT_AND_EXPR
9654 && pow2p_hwi (element_precision (rtype
)))
9656 tree tree110
, tree111
;
9657 tree110
= TREE_OPERAND (tree11
, 0);
9658 tree111
= TREE_OPERAND (tree11
, 1);
9659 STRIP_NOPS (tree110
);
9660 STRIP_NOPS (tree111
);
9661 if (TREE_CODE (tree110
) == NEGATE_EXPR
9662 && TREE_CODE (tree111
) == INTEGER_CST
9663 && compare_tree_int (tree111
,
9664 element_precision (rtype
) - 1) == 0
9665 && operand_equal_p (tree01
, TREE_OPERAND (tree110
, 0), 0))
9667 tem
= build2_loc (loc
, (code0
== LSHIFT_EXPR
9668 ? LROTATE_EXPR
: RROTATE_EXPR
),
9669 rtype
, TREE_OPERAND (arg0
, 0),
9671 return fold_convert_loc (loc
, type
, tem
);
9678 /* In most languages, can't associate operations on floats through
9679 parentheses. Rather than remember where the parentheses were, we
9680 don't associate floats at all, unless the user has specified
9682 And, we need to make sure type is not saturating. */
9684 if ((! FLOAT_TYPE_P (type
) || flag_associative_math
)
9685 && !TYPE_SATURATING (type
))
9687 tree var0
, minus_var0
, con0
, minus_con0
, lit0
, minus_lit0
;
9688 tree var1
, minus_var1
, con1
, minus_con1
, lit1
, minus_lit1
;
9692 /* Split both trees into variables, constants, and literals. Then
9693 associate each group together, the constants with literals,
9694 then the result with variables. This increases the chances of
9695 literals being recombined later and of generating relocatable
9696 expressions for the sum of a constant and literal. */
9697 var0
= split_tree (arg0
, type
, code
,
9698 &minus_var0
, &con0
, &minus_con0
,
9699 &lit0
, &minus_lit0
, 0);
9700 var1
= split_tree (arg1
, type
, code
,
9701 &minus_var1
, &con1
, &minus_con1
,
9702 &lit1
, &minus_lit1
, code
== MINUS_EXPR
);
9704 /* Recombine MINUS_EXPR operands by using PLUS_EXPR. */
9705 if (code
== MINUS_EXPR
)
9708 /* With undefined overflow prefer doing association in a type
9709 which wraps on overflow, if that is one of the operand types. */
9710 if (POINTER_TYPE_P (type
)
9711 || (INTEGRAL_TYPE_P (type
) && !TYPE_OVERFLOW_WRAPS (type
)))
9713 if (INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
9714 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg0
)))
9715 atype
= TREE_TYPE (arg0
);
9716 else if (INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
9717 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg1
)))
9718 atype
= TREE_TYPE (arg1
);
9719 gcc_assert (TYPE_PRECISION (atype
) == TYPE_PRECISION (type
));
9722 /* With undefined overflow we can only associate constants with one
9723 variable, and constants whose association doesn't overflow. */
9724 if (POINTER_TYPE_P (atype
)
9725 || (INTEGRAL_TYPE_P (atype
) && !TYPE_OVERFLOW_WRAPS (atype
)))
9727 if ((var0
&& var1
) || (minus_var0
&& minus_var1
))
9729 /* ??? If split_tree would handle NEGATE_EXPR we could
9730 simply reject these cases and the allowed cases would
9731 be the var0/minus_var1 ones. */
9732 tree tmp0
= var0
? var0
: minus_var0
;
9733 tree tmp1
= var1
? var1
: minus_var1
;
9734 bool one_neg
= false;
9736 if (TREE_CODE (tmp0
) == NEGATE_EXPR
)
9738 tmp0
= TREE_OPERAND (tmp0
, 0);
9741 if (CONVERT_EXPR_P (tmp0
)
9742 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (tmp0
, 0)))
9743 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (tmp0
, 0)))
9744 <= TYPE_PRECISION (atype
)))
9745 tmp0
= TREE_OPERAND (tmp0
, 0);
9746 if (TREE_CODE (tmp1
) == NEGATE_EXPR
)
9748 tmp1
= TREE_OPERAND (tmp1
, 0);
9751 if (CONVERT_EXPR_P (tmp1
)
9752 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (tmp1
, 0)))
9753 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (tmp1
, 0)))
9754 <= TYPE_PRECISION (atype
)))
9755 tmp1
= TREE_OPERAND (tmp1
, 0);
9756 /* The only case we can still associate with two variables
9757 is if they cancel out. */
9759 || !operand_equal_p (tmp0
, tmp1
, 0))
9762 else if ((var0
&& minus_var1
9763 && ! operand_equal_p (var0
, minus_var1
, 0))
9764 || (minus_var0
&& var1
9765 && ! operand_equal_p (minus_var0
, var1
, 0)))
9769 /* Only do something if we found more than two objects. Otherwise,
9770 nothing has changed and we risk infinite recursion. */
9772 && ((var0
!= 0) + (var1
!= 0)
9773 + (minus_var0
!= 0) + (minus_var1
!= 0)
9774 + (con0
!= 0) + (con1
!= 0)
9775 + (minus_con0
!= 0) + (minus_con1
!= 0)
9776 + (lit0
!= 0) + (lit1
!= 0)
9777 + (minus_lit0
!= 0) + (minus_lit1
!= 0)) > 2)
9779 var0
= associate_trees (loc
, var0
, var1
, code
, atype
);
9780 minus_var0
= associate_trees (loc
, minus_var0
, minus_var1
,
9782 con0
= associate_trees (loc
, con0
, con1
, code
, atype
);
9783 minus_con0
= associate_trees (loc
, minus_con0
, minus_con1
,
9785 lit0
= associate_trees (loc
, lit0
, lit1
, code
, atype
);
9786 minus_lit0
= associate_trees (loc
, minus_lit0
, minus_lit1
,
9789 if (minus_var0
&& var0
)
9791 var0
= associate_trees (loc
, var0
, minus_var0
,
9795 if (minus_con0
&& con0
)
9797 con0
= associate_trees (loc
, con0
, minus_con0
,
9802 /* Preserve the MINUS_EXPR if the negative part of the literal is
9803 greater than the positive part. Otherwise, the multiplicative
9804 folding code (i.e extract_muldiv) may be fooled in case
9805 unsigned constants are subtracted, like in the following
9806 example: ((X*2 + 4) - 8U)/2. */
9807 if (minus_lit0
&& lit0
)
9809 if (TREE_CODE (lit0
) == INTEGER_CST
9810 && TREE_CODE (minus_lit0
) == INTEGER_CST
9811 && tree_int_cst_lt (lit0
, minus_lit0
)
9812 /* But avoid ending up with only negated parts. */
9815 minus_lit0
= associate_trees (loc
, minus_lit0
, lit0
,
9821 lit0
= associate_trees (loc
, lit0
, minus_lit0
,
9827 /* Don't introduce overflows through reassociation. */
9828 if ((lit0
&& TREE_OVERFLOW_P (lit0
))
9829 || (minus_lit0
&& TREE_OVERFLOW_P (minus_lit0
)))
9832 /* Eliminate lit0 and minus_lit0 to con0 and minus_con0. */
9833 con0
= associate_trees (loc
, con0
, lit0
, code
, atype
);
9835 minus_con0
= associate_trees (loc
, minus_con0
, minus_lit0
,
9839 /* Eliminate minus_con0. */
9843 con0
= associate_trees (loc
, con0
, minus_con0
,
9846 var0
= associate_trees (loc
, var0
, minus_con0
,
9853 /* Eliminate minus_var0. */
9857 con0
= associate_trees (loc
, con0
, minus_var0
,
9865 fold_convert_loc (loc
, type
, associate_trees (loc
, var0
, con0
,
9872 case POINTER_DIFF_EXPR
:
9874 /* Fold &a[i] - &a[j] to i-j. */
9875 if (TREE_CODE (arg0
) == ADDR_EXPR
9876 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == ARRAY_REF
9877 && TREE_CODE (arg1
) == ADDR_EXPR
9878 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == ARRAY_REF
)
9880 tree tem
= fold_addr_of_array_ref_difference (loc
, type
,
9881 TREE_OPERAND (arg0
, 0),
9882 TREE_OPERAND (arg1
, 0),
9884 == POINTER_DIFF_EXPR
);
9889 /* Further transformations are not for pointers. */
9890 if (code
== POINTER_DIFF_EXPR
)
9893 /* (-A) - B -> (-B) - A where B is easily negated and we can swap. */
9894 if (TREE_CODE (arg0
) == NEGATE_EXPR
9895 && negate_expr_p (op1
)
9896 /* If arg0 is e.g. unsigned int and type is int, then this could
9897 introduce UB, because if A is INT_MIN at runtime, the original
9898 expression can be well defined while the latter is not.
9900 && !(ANY_INTEGRAL_TYPE_P (type
)
9901 && TYPE_OVERFLOW_UNDEFINED (type
)
9902 && ANY_INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
9903 && !TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
))))
9904 return fold_build2_loc (loc
, MINUS_EXPR
, type
, negate_expr (op1
),
9905 fold_convert_loc (loc
, type
,
9906 TREE_OPERAND (arg0
, 0)));
9908 /* Fold __complex__ ( x, 0 ) - __complex__ ( 0, y ) to
9909 __complex__ ( x, -y ). This is not the same for SNaNs or if
9910 signed zeros are involved. */
9911 if (!HONOR_SNANS (element_mode (arg0
))
9912 && !HONOR_SIGNED_ZEROS (element_mode (arg0
))
9913 && COMPLEX_FLOAT_TYPE_P (TREE_TYPE (arg0
)))
9915 tree rtype
= TREE_TYPE (TREE_TYPE (arg0
));
9916 tree arg0r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg0
);
9917 tree arg0i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg0
);
9918 bool arg0rz
= false, arg0iz
= false;
9919 if ((arg0r
&& (arg0rz
= real_zerop (arg0r
)))
9920 || (arg0i
&& (arg0iz
= real_zerop (arg0i
))))
9922 tree arg1r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg1
);
9923 tree arg1i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg1
);
9924 if (arg0rz
&& arg1i
&& real_zerop (arg1i
))
9926 tree rp
= fold_build1_loc (loc
, NEGATE_EXPR
, rtype
,
9928 : build1 (REALPART_EXPR
, rtype
, arg1
));
9929 tree ip
= arg0i
? arg0i
9930 : build1 (IMAGPART_EXPR
, rtype
, arg0
);
9931 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
9933 else if (arg0iz
&& arg1r
&& real_zerop (arg1r
))
9935 tree rp
= arg0r
? arg0r
9936 : build1 (REALPART_EXPR
, rtype
, arg0
);
9937 tree ip
= fold_build1_loc (loc
, NEGATE_EXPR
, rtype
,
9939 : build1 (IMAGPART_EXPR
, rtype
, arg1
));
9940 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
9945 /* A - B -> A + (-B) if B is easily negatable. */
9946 if (negate_expr_p (op1
)
9947 && ! TYPE_OVERFLOW_SANITIZED (type
)
9948 && ((FLOAT_TYPE_P (type
)
9949 /* Avoid this transformation if B is a positive REAL_CST. */
9950 && (TREE_CODE (op1
) != REAL_CST
9951 || REAL_VALUE_NEGATIVE (TREE_REAL_CST (op1
))))
9952 || INTEGRAL_TYPE_P (type
)))
9953 return fold_build2_loc (loc
, PLUS_EXPR
, type
,
9954 fold_convert_loc (loc
, type
, arg0
),
9957 /* Handle (A1 * C1) - (A2 * C2) with A1, A2 or C1, C2 being the same or
9958 one. Make sure the type is not saturating and has the signedness of
9959 the stripped operands, as fold_plusminus_mult_expr will re-associate.
9960 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
9961 if ((TREE_CODE (arg0
) == MULT_EXPR
9962 || TREE_CODE (arg1
) == MULT_EXPR
)
9963 && !TYPE_SATURATING (type
)
9964 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg0
))
9965 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg1
))
9966 && (!FLOAT_TYPE_P (type
) || flag_associative_math
))
9968 tree tem
= fold_plusminus_mult_expr (loc
, code
, type
, arg0
, arg1
);
9976 if (! FLOAT_TYPE_P (type
))
9978 /* Transform x * -C into -x * C if x is easily negatable. */
9979 if (TREE_CODE (op1
) == INTEGER_CST
9980 && tree_int_cst_sgn (op1
) == -1
9981 && negate_expr_p (op0
)
9982 && negate_expr_p (op1
)
9983 && (tem
= negate_expr (op1
)) != op1
9984 && ! TREE_OVERFLOW (tem
))
9985 return fold_build2_loc (loc
, MULT_EXPR
, type
,
9986 fold_convert_loc (loc
, type
,
9987 negate_expr (op0
)), tem
);
9989 strict_overflow_p
= false;
9990 if (TREE_CODE (arg1
) == INTEGER_CST
9991 && (tem
= extract_muldiv (op0
, arg1
, code
, NULL_TREE
,
9992 &strict_overflow_p
)) != 0)
9994 if (strict_overflow_p
)
9995 fold_overflow_warning (("assuming signed overflow does not "
9996 "occur when simplifying "
9998 WARN_STRICT_OVERFLOW_MISC
);
9999 return fold_convert_loc (loc
, type
, tem
);
10002 /* Optimize z * conj(z) for integer complex numbers. */
10003 if (TREE_CODE (arg0
) == CONJ_EXPR
10004 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
10005 return fold_mult_zconjz (loc
, type
, arg1
);
10006 if (TREE_CODE (arg1
) == CONJ_EXPR
10007 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10008 return fold_mult_zconjz (loc
, type
, arg0
);
10012 /* Fold z * +-I to __complex__ (-+__imag z, +-__real z).
10013 This is not the same for NaNs or if signed zeros are
10015 if (!HONOR_NANS (arg0
)
10016 && !HONOR_SIGNED_ZEROS (element_mode (arg0
))
10017 && COMPLEX_FLOAT_TYPE_P (TREE_TYPE (arg0
))
10018 && TREE_CODE (arg1
) == COMPLEX_CST
10019 && real_zerop (TREE_REALPART (arg1
)))
10021 tree rtype
= TREE_TYPE (TREE_TYPE (arg0
));
10022 if (real_onep (TREE_IMAGPART (arg1
)))
10024 fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
10025 negate_expr (fold_build1_loc (loc
, IMAGPART_EXPR
,
10027 fold_build1_loc (loc
, REALPART_EXPR
, rtype
, arg0
));
10028 else if (real_minus_onep (TREE_IMAGPART (arg1
)))
10030 fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
10031 fold_build1_loc (loc
, IMAGPART_EXPR
, rtype
, arg0
),
10032 negate_expr (fold_build1_loc (loc
, REALPART_EXPR
,
10036 /* Optimize z * conj(z) for floating point complex numbers.
10037 Guarded by flag_unsafe_math_optimizations as non-finite
10038 imaginary components don't produce scalar results. */
10039 if (flag_unsafe_math_optimizations
10040 && TREE_CODE (arg0
) == CONJ_EXPR
10041 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
10042 return fold_mult_zconjz (loc
, type
, arg1
);
10043 if (flag_unsafe_math_optimizations
10044 && TREE_CODE (arg1
) == CONJ_EXPR
10045 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10046 return fold_mult_zconjz (loc
, type
, arg0
);
10051 /* Canonicalize (X & C1) | C2. */
10052 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10053 && TREE_CODE (arg1
) == INTEGER_CST
10054 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
10056 int width
= TYPE_PRECISION (type
), w
;
10057 wide_int c1
= wi::to_wide (TREE_OPERAND (arg0
, 1));
10058 wide_int c2
= wi::to_wide (arg1
);
10060 /* If (C1&C2) == C1, then (X&C1)|C2 becomes (X,C2). */
10061 if ((c1
& c2
) == c1
)
10062 return omit_one_operand_loc (loc
, type
, arg1
,
10063 TREE_OPERAND (arg0
, 0));
10065 wide_int msk
= wi::mask (width
, false,
10066 TYPE_PRECISION (TREE_TYPE (arg1
)));
10068 /* If (C1|C2) == ~0 then (X&C1)|C2 becomes X|C2. */
10069 if (wi::bit_and_not (msk
, c1
| c2
) == 0)
10071 tem
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10072 return fold_build2_loc (loc
, BIT_IOR_EXPR
, type
, tem
, arg1
);
10075 /* Minimize the number of bits set in C1, i.e. C1 := C1 & ~C2,
10076 unless (C1 & ~C2) | (C2 & C3) for some C3 is a mask of some
10077 mode which allows further optimizations. */
10080 wide_int c3
= wi::bit_and_not (c1
, c2
);
10081 for (w
= BITS_PER_UNIT
; w
<= width
; w
<<= 1)
10083 wide_int mask
= wi::mask (w
, false,
10084 TYPE_PRECISION (type
));
10085 if (((c1
| c2
) & mask
) == mask
10086 && wi::bit_and_not (c1
, mask
) == 0)
10095 tem
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10096 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, type
, tem
,
10097 wide_int_to_tree (type
, c3
));
10098 return fold_build2_loc (loc
, BIT_IOR_EXPR
, type
, tem
, arg1
);
10102 /* See if this can be simplified into a rotate first. If that
10103 is unsuccessful continue in the association code. */
10107 /* Fold (X & 1) ^ 1 as (X & 1) == 0. */
10108 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10109 && INTEGRAL_TYPE_P (type
)
10110 && integer_onep (TREE_OPERAND (arg0
, 1))
10111 && integer_onep (arg1
))
10112 return fold_build2_loc (loc
, EQ_EXPR
, type
, arg0
,
10113 build_zero_cst (TREE_TYPE (arg0
)));
10115 /* See if this can be simplified into a rotate first. If that
10116 is unsuccessful continue in the association code. */
10120 /* Fold (X ^ 1) & 1 as (X & 1) == 0. */
10121 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
10122 && INTEGRAL_TYPE_P (type
)
10123 && integer_onep (TREE_OPERAND (arg0
, 1))
10124 && integer_onep (arg1
))
10127 tem
= TREE_OPERAND (arg0
, 0);
10128 tem2
= fold_convert_loc (loc
, TREE_TYPE (tem
), arg1
);
10129 tem2
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (tem
),
10131 return fold_build2_loc (loc
, EQ_EXPR
, type
, tem2
,
10132 build_zero_cst (TREE_TYPE (tem
)));
10134 /* Fold ~X & 1 as (X & 1) == 0. */
10135 if (TREE_CODE (arg0
) == BIT_NOT_EXPR
10136 && INTEGRAL_TYPE_P (type
)
10137 && integer_onep (arg1
))
10140 tem
= TREE_OPERAND (arg0
, 0);
10141 tem2
= fold_convert_loc (loc
, TREE_TYPE (tem
), arg1
);
10142 tem2
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (tem
),
10144 return fold_build2_loc (loc
, EQ_EXPR
, type
, tem2
,
10145 build_zero_cst (TREE_TYPE (tem
)));
10147 /* Fold !X & 1 as X == 0. */
10148 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
10149 && integer_onep (arg1
))
10151 tem
= TREE_OPERAND (arg0
, 0);
10152 return fold_build2_loc (loc
, EQ_EXPR
, type
, tem
,
10153 build_zero_cst (TREE_TYPE (tem
)));
10156 /* Fold (X * Y) & -(1 << CST) to X * Y if Y is a constant
10157 multiple of 1 << CST. */
10158 if (TREE_CODE (arg1
) == INTEGER_CST
)
10160 wi::tree_to_wide_ref cst1
= wi::to_wide (arg1
);
10161 wide_int ncst1
= -cst1
;
10162 if ((cst1
& ncst1
) == ncst1
10163 && multiple_of_p (type
, arg0
,
10164 wide_int_to_tree (TREE_TYPE (arg1
), ncst1
)))
10165 return fold_convert_loc (loc
, type
, arg0
);
10168 /* Fold (X * CST1) & CST2 to zero if we can, or drop known zero
10170 if (TREE_CODE (arg1
) == INTEGER_CST
10171 && TREE_CODE (arg0
) == MULT_EXPR
10172 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
10174 wi::tree_to_wide_ref warg1
= wi::to_wide (arg1
);
10176 = mask_with_tz (type
, warg1
, wi::to_wide (TREE_OPERAND (arg0
, 1)));
10179 return omit_two_operands_loc (loc
, type
, build_zero_cst (type
),
10181 else if (masked
!= warg1
)
10183 /* Avoid the transform if arg1 is a mask of some
10184 mode which allows further optimizations. */
10185 int pop
= wi::popcount (warg1
);
10186 if (!(pop
>= BITS_PER_UNIT
10188 && wi::mask (pop
, false, warg1
.get_precision ()) == warg1
))
10189 return fold_build2_loc (loc
, code
, type
, op0
,
10190 wide_int_to_tree (type
, masked
));
10194 /* For constants M and N, if M == (1LL << cst) - 1 && (N & M) == M,
10195 ((A & N) + B) & M -> (A + B) & M
10196 Similarly if (N & M) == 0,
10197 ((A | N) + B) & M -> (A + B) & M
10198 and for - instead of + (or unary - instead of +)
10199 and/or ^ instead of |.
10200 If B is constant and (B & M) == 0, fold into A & M. */
10201 if (TREE_CODE (arg1
) == INTEGER_CST
)
10203 wi::tree_to_wide_ref cst1
= wi::to_wide (arg1
);
10204 if ((~cst1
!= 0) && (cst1
& (cst1
+ 1)) == 0
10205 && INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
10206 && (TREE_CODE (arg0
) == PLUS_EXPR
10207 || TREE_CODE (arg0
) == MINUS_EXPR
10208 || TREE_CODE (arg0
) == NEGATE_EXPR
)
10209 && (TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg0
))
10210 || TREE_CODE (TREE_TYPE (arg0
)) == INTEGER_TYPE
))
10216 /* Now we know that arg0 is (C + D) or (C - D) or
10217 -C and arg1 (M) is == (1LL << cst) - 1.
10218 Store C into PMOP[0] and D into PMOP[1]. */
10219 pmop
[0] = TREE_OPERAND (arg0
, 0);
10221 if (TREE_CODE (arg0
) != NEGATE_EXPR
)
10223 pmop
[1] = TREE_OPERAND (arg0
, 1);
10227 if ((wi::max_value (TREE_TYPE (arg0
)) & cst1
) != cst1
)
10230 for (; which
>= 0; which
--)
10231 switch (TREE_CODE (pmop
[which
]))
10236 if (TREE_CODE (TREE_OPERAND (pmop
[which
], 1))
10239 cst0
= wi::to_wide (TREE_OPERAND (pmop
[which
], 1)) & cst1
;
10240 if (TREE_CODE (pmop
[which
]) == BIT_AND_EXPR
)
10245 else if (cst0
!= 0)
10247 /* If C or D is of the form (A & N) where
10248 (N & M) == M, or of the form (A | N) or
10249 (A ^ N) where (N & M) == 0, replace it with A. */
10250 pmop
[which
] = TREE_OPERAND (pmop
[which
], 0);
10253 /* If C or D is a N where (N & M) == 0, it can be
10254 omitted (assumed 0). */
10255 if ((TREE_CODE (arg0
) == PLUS_EXPR
10256 || (TREE_CODE (arg0
) == MINUS_EXPR
&& which
== 0))
10257 && (cst1
& wi::to_wide (pmop
[which
])) == 0)
10258 pmop
[which
] = NULL
;
10264 /* Only build anything new if we optimized one or both arguments
10266 if (pmop
[0] != TREE_OPERAND (arg0
, 0)
10267 || (TREE_CODE (arg0
) != NEGATE_EXPR
10268 && pmop
[1] != TREE_OPERAND (arg0
, 1)))
10270 tree utype
= TREE_TYPE (arg0
);
10271 if (! TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg0
)))
10273 /* Perform the operations in a type that has defined
10274 overflow behavior. */
10275 utype
= unsigned_type_for (TREE_TYPE (arg0
));
10276 if (pmop
[0] != NULL
)
10277 pmop
[0] = fold_convert_loc (loc
, utype
, pmop
[0]);
10278 if (pmop
[1] != NULL
)
10279 pmop
[1] = fold_convert_loc (loc
, utype
, pmop
[1]);
10282 if (TREE_CODE (arg0
) == NEGATE_EXPR
)
10283 tem
= fold_build1_loc (loc
, NEGATE_EXPR
, utype
, pmop
[0]);
10284 else if (TREE_CODE (arg0
) == PLUS_EXPR
)
10286 if (pmop
[0] != NULL
&& pmop
[1] != NULL
)
10287 tem
= fold_build2_loc (loc
, PLUS_EXPR
, utype
,
10289 else if (pmop
[0] != NULL
)
10291 else if (pmop
[1] != NULL
)
10294 return build_int_cst (type
, 0);
10296 else if (pmop
[0] == NULL
)
10297 tem
= fold_build1_loc (loc
, NEGATE_EXPR
, utype
, pmop
[1]);
10299 tem
= fold_build2_loc (loc
, MINUS_EXPR
, utype
,
10301 /* TEM is now the new binary +, - or unary - replacement. */
10302 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, utype
, tem
,
10303 fold_convert_loc (loc
, utype
, arg1
));
10304 return fold_convert_loc (loc
, type
, tem
);
10309 /* Simplify ((int)c & 0377) into (int)c, if c is unsigned char. */
10310 if (TREE_CODE (arg1
) == INTEGER_CST
&& TREE_CODE (arg0
) == NOP_EXPR
10311 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (arg0
, 0))))
10313 prec
= element_precision (TREE_TYPE (TREE_OPERAND (arg0
, 0)));
10315 wide_int mask
= wide_int::from (wi::to_wide (arg1
), prec
, UNSIGNED
);
10318 fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10324 /* Don't touch a floating-point divide by zero unless the mode
10325 of the constant can represent infinity. */
10326 if (TREE_CODE (arg1
) == REAL_CST
10327 && !MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (arg1
)))
10328 && real_zerop (arg1
))
10331 /* (-A) / (-B) -> A / B */
10332 if (TREE_CODE (arg0
) == NEGATE_EXPR
&& negate_expr_p (arg1
))
10333 return fold_build2_loc (loc
, RDIV_EXPR
, type
,
10334 TREE_OPERAND (arg0
, 0),
10335 negate_expr (arg1
));
10336 if (TREE_CODE (arg1
) == NEGATE_EXPR
&& negate_expr_p (arg0
))
10337 return fold_build2_loc (loc
, RDIV_EXPR
, type
,
10338 negate_expr (arg0
),
10339 TREE_OPERAND (arg1
, 0));
10342 case TRUNC_DIV_EXPR
:
10345 case FLOOR_DIV_EXPR
:
10346 /* Simplify A / (B << N) where A and B are positive and B is
10347 a power of 2, to A >> (N + log2(B)). */
10348 strict_overflow_p
= false;
10349 if (TREE_CODE (arg1
) == LSHIFT_EXPR
10350 && (TYPE_UNSIGNED (type
)
10351 || tree_expr_nonnegative_warnv_p (op0
, &strict_overflow_p
)))
10353 tree sval
= TREE_OPERAND (arg1
, 0);
10354 if (integer_pow2p (sval
) && tree_int_cst_sgn (sval
) > 0)
10356 tree sh_cnt
= TREE_OPERAND (arg1
, 1);
10357 tree pow2
= build_int_cst (TREE_TYPE (sh_cnt
),
10358 wi::exact_log2 (wi::to_wide (sval
)));
10360 if (strict_overflow_p
)
10361 fold_overflow_warning (("assuming signed overflow does not "
10362 "occur when simplifying A / (B << N)"),
10363 WARN_STRICT_OVERFLOW_MISC
);
10365 sh_cnt
= fold_build2_loc (loc
, PLUS_EXPR
, TREE_TYPE (sh_cnt
),
10367 return fold_build2_loc (loc
, RSHIFT_EXPR
, type
,
10368 fold_convert_loc (loc
, type
, arg0
), sh_cnt
);
10374 case ROUND_DIV_EXPR
:
10375 case CEIL_DIV_EXPR
:
10376 case EXACT_DIV_EXPR
:
10377 if (integer_zerop (arg1
))
10380 /* Convert -A / -B to A / B when the type is signed and overflow is
10382 if ((!INTEGRAL_TYPE_P (type
) || TYPE_OVERFLOW_UNDEFINED (type
))
10383 && TREE_CODE (op0
) == NEGATE_EXPR
10384 && negate_expr_p (op1
))
10386 if (INTEGRAL_TYPE_P (type
))
10387 fold_overflow_warning (("assuming signed overflow does not occur "
10388 "when distributing negation across "
10390 WARN_STRICT_OVERFLOW_MISC
);
10391 return fold_build2_loc (loc
, code
, type
,
10392 fold_convert_loc (loc
, type
,
10393 TREE_OPERAND (arg0
, 0)),
10394 negate_expr (op1
));
10396 if ((!INTEGRAL_TYPE_P (type
) || TYPE_OVERFLOW_UNDEFINED (type
))
10397 && TREE_CODE (arg1
) == NEGATE_EXPR
10398 && negate_expr_p (op0
))
10400 if (INTEGRAL_TYPE_P (type
))
10401 fold_overflow_warning (("assuming signed overflow does not occur "
10402 "when distributing negation across "
10404 WARN_STRICT_OVERFLOW_MISC
);
10405 return fold_build2_loc (loc
, code
, type
,
10407 fold_convert_loc (loc
, type
,
10408 TREE_OPERAND (arg1
, 0)));
10411 /* If arg0 is a multiple of arg1, then rewrite to the fastest div
10412 operation, EXACT_DIV_EXPR.
10414 Note that only CEIL_DIV_EXPR and FLOOR_DIV_EXPR are rewritten now.
10415 At one time others generated faster code, it's not clear if they do
10416 after the last round to changes to the DIV code in expmed.c. */
10417 if ((code
== CEIL_DIV_EXPR
|| code
== FLOOR_DIV_EXPR
)
10418 && multiple_of_p (type
, arg0
, arg1
))
10419 return fold_build2_loc (loc
, EXACT_DIV_EXPR
, type
,
10420 fold_convert (type
, arg0
),
10421 fold_convert (type
, arg1
));
10423 strict_overflow_p
= false;
10424 if (TREE_CODE (arg1
) == INTEGER_CST
10425 && (tem
= extract_muldiv (op0
, arg1
, code
, NULL_TREE
,
10426 &strict_overflow_p
)) != 0)
10428 if (strict_overflow_p
)
10429 fold_overflow_warning (("assuming signed overflow does not occur "
10430 "when simplifying division"),
10431 WARN_STRICT_OVERFLOW_MISC
);
10432 return fold_convert_loc (loc
, type
, tem
);
10437 case CEIL_MOD_EXPR
:
10438 case FLOOR_MOD_EXPR
:
10439 case ROUND_MOD_EXPR
:
10440 case TRUNC_MOD_EXPR
:
10441 strict_overflow_p
= false;
10442 if (TREE_CODE (arg1
) == INTEGER_CST
10443 && (tem
= extract_muldiv (op0
, arg1
, code
, NULL_TREE
,
10444 &strict_overflow_p
)) != 0)
10446 if (strict_overflow_p
)
10447 fold_overflow_warning (("assuming signed overflow does not occur "
10448 "when simplifying modulus"),
10449 WARN_STRICT_OVERFLOW_MISC
);
10450 return fold_convert_loc (loc
, type
, tem
);
10459 /* Since negative shift count is not well-defined,
10460 don't try to compute it in the compiler. */
10461 if (TREE_CODE (arg1
) == INTEGER_CST
&& tree_int_cst_sgn (arg1
) < 0)
10464 prec
= element_precision (type
);
10466 /* If we have a rotate of a bit operation with the rotate count and
10467 the second operand of the bit operation both constant,
10468 permute the two operations. */
10469 if (code
== RROTATE_EXPR
&& TREE_CODE (arg1
) == INTEGER_CST
10470 && (TREE_CODE (arg0
) == BIT_AND_EXPR
10471 || TREE_CODE (arg0
) == BIT_IOR_EXPR
10472 || TREE_CODE (arg0
) == BIT_XOR_EXPR
)
10473 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
10475 tree arg00
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10476 tree arg01
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 1));
10477 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
,
10478 fold_build2_loc (loc
, code
, type
,
10480 fold_build2_loc (loc
, code
, type
,
10484 /* Two consecutive rotates adding up to the some integer
10485 multiple of the precision of the type can be ignored. */
10486 if (code
== RROTATE_EXPR
&& TREE_CODE (arg1
) == INTEGER_CST
10487 && TREE_CODE (arg0
) == RROTATE_EXPR
10488 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
10489 && wi::umod_trunc (wi::to_wide (arg1
)
10490 + wi::to_wide (TREE_OPERAND (arg0
, 1)),
10492 return fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10500 case TRUTH_ANDIF_EXPR
:
10501 /* Note that the operands of this must be ints
10502 and their values must be 0 or 1.
10503 ("true" is a fixed value perhaps depending on the language.) */
10504 /* If first arg is constant zero, return it. */
10505 if (integer_zerop (arg0
))
10506 return fold_convert_loc (loc
, type
, arg0
);
10508 case TRUTH_AND_EXPR
:
10509 /* If either arg is constant true, drop it. */
10510 if (TREE_CODE (arg0
) == INTEGER_CST
&& ! integer_zerop (arg0
))
10511 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg1
));
10512 if (TREE_CODE (arg1
) == INTEGER_CST
&& ! integer_zerop (arg1
)
10513 /* Preserve sequence points. */
10514 && (code
!= TRUTH_ANDIF_EXPR
|| ! TREE_SIDE_EFFECTS (arg0
)))
10515 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
10516 /* If second arg is constant zero, result is zero, but first arg
10517 must be evaluated. */
10518 if (integer_zerop (arg1
))
10519 return omit_one_operand_loc (loc
, type
, arg1
, arg0
);
10520 /* Likewise for first arg, but note that only the TRUTH_AND_EXPR
10521 case will be handled here. */
10522 if (integer_zerop (arg0
))
10523 return omit_one_operand_loc (loc
, type
, arg0
, arg1
);
10525 /* !X && X is always false. */
10526 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
10527 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
10528 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg1
);
10529 /* X && !X is always false. */
10530 if (TREE_CODE (arg1
) == TRUTH_NOT_EXPR
10531 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10532 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
10534 /* A < X && A + 1 > Y ==> A < X && A >= Y. Normally A + 1 > Y
10535 means A >= Y && A != MAX, but in this case we know that
10538 if (!TREE_SIDE_EFFECTS (arg0
)
10539 && !TREE_SIDE_EFFECTS (arg1
))
10541 tem
= fold_to_nonsharp_ineq_using_bound (loc
, arg0
, arg1
);
10542 if (tem
&& !operand_equal_p (tem
, arg0
, 0))
10543 return fold_build2_loc (loc
, code
, type
, tem
, arg1
);
10545 tem
= fold_to_nonsharp_ineq_using_bound (loc
, arg1
, arg0
);
10546 if (tem
&& !operand_equal_p (tem
, arg1
, 0))
10547 return fold_build2_loc (loc
, code
, type
, arg0
, tem
);
10550 if ((tem
= fold_truth_andor (loc
, code
, type
, arg0
, arg1
, op0
, op1
))
10556 case TRUTH_ORIF_EXPR
:
10557 /* Note that the operands of this must be ints
10558 and their values must be 0 or true.
10559 ("true" is a fixed value perhaps depending on the language.) */
10560 /* If first arg is constant true, return it. */
10561 if (TREE_CODE (arg0
) == INTEGER_CST
&& ! integer_zerop (arg0
))
10562 return fold_convert_loc (loc
, type
, arg0
);
10564 case TRUTH_OR_EXPR
:
10565 /* If either arg is constant zero, drop it. */
10566 if (TREE_CODE (arg0
) == INTEGER_CST
&& integer_zerop (arg0
))
10567 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg1
));
10568 if (TREE_CODE (arg1
) == INTEGER_CST
&& integer_zerop (arg1
)
10569 /* Preserve sequence points. */
10570 && (code
!= TRUTH_ORIF_EXPR
|| ! TREE_SIDE_EFFECTS (arg0
)))
10571 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
10572 /* If second arg is constant true, result is true, but we must
10573 evaluate first arg. */
10574 if (TREE_CODE (arg1
) == INTEGER_CST
&& ! integer_zerop (arg1
))
10575 return omit_one_operand_loc (loc
, type
, arg1
, arg0
);
10576 /* Likewise for first arg, but note this only occurs here for
10578 if (TREE_CODE (arg0
) == INTEGER_CST
&& ! integer_zerop (arg0
))
10579 return omit_one_operand_loc (loc
, type
, arg0
, arg1
);
10581 /* !X || X is always true. */
10582 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
10583 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
10584 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg1
);
10585 /* X || !X is always true. */
10586 if (TREE_CODE (arg1
) == TRUTH_NOT_EXPR
10587 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10588 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
10590 /* (X && !Y) || (!X && Y) is X ^ Y */
10591 if (TREE_CODE (arg0
) == TRUTH_AND_EXPR
10592 && TREE_CODE (arg1
) == TRUTH_AND_EXPR
)
10594 tree a0
, a1
, l0
, l1
, n0
, n1
;
10596 a0
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 0));
10597 a1
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 1));
10599 l0
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10600 l1
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 1));
10602 n0
= fold_build1_loc (loc
, TRUTH_NOT_EXPR
, type
, l0
);
10603 n1
= fold_build1_loc (loc
, TRUTH_NOT_EXPR
, type
, l1
);
10605 if ((operand_equal_p (n0
, a0
, 0)
10606 && operand_equal_p (n1
, a1
, 0))
10607 || (operand_equal_p (n0
, a1
, 0)
10608 && operand_equal_p (n1
, a0
, 0)))
10609 return fold_build2_loc (loc
, TRUTH_XOR_EXPR
, type
, l0
, n1
);
10612 if ((tem
= fold_truth_andor (loc
, code
, type
, arg0
, arg1
, op0
, op1
))
10618 case TRUTH_XOR_EXPR
:
10619 /* If the second arg is constant zero, drop it. */
10620 if (integer_zerop (arg1
))
10621 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
10622 /* If the second arg is constant true, this is a logical inversion. */
10623 if (integer_onep (arg1
))
10625 tem
= invert_truthvalue_loc (loc
, arg0
);
10626 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, tem
));
10628 /* Identical arguments cancel to zero. */
10629 if (operand_equal_p (arg0
, arg1
, 0))
10630 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
10632 /* !X ^ X is always true. */
10633 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
10634 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
10635 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg1
);
10637 /* X ^ !X is always true. */
10638 if (TREE_CODE (arg1
) == TRUTH_NOT_EXPR
10639 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10640 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
10649 tem
= fold_comparison (loc
, code
, type
, op0
, op1
);
10650 if (tem
!= NULL_TREE
)
10653 /* bool_var != 1 becomes !bool_var. */
10654 if (TREE_CODE (TREE_TYPE (arg0
)) == BOOLEAN_TYPE
&& integer_onep (arg1
)
10655 && code
== NE_EXPR
)
10656 return fold_convert_loc (loc
, type
,
10657 fold_build1_loc (loc
, TRUTH_NOT_EXPR
,
10658 TREE_TYPE (arg0
), arg0
));
10660 /* bool_var == 0 becomes !bool_var. */
10661 if (TREE_CODE (TREE_TYPE (arg0
)) == BOOLEAN_TYPE
&& integer_zerop (arg1
)
10662 && code
== EQ_EXPR
)
10663 return fold_convert_loc (loc
, type
,
10664 fold_build1_loc (loc
, TRUTH_NOT_EXPR
,
10665 TREE_TYPE (arg0
), arg0
));
10667 /* !exp != 0 becomes !exp */
10668 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
&& integer_zerop (arg1
)
10669 && code
== NE_EXPR
)
10670 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
10672 /* If this is an EQ or NE comparison with zero and ARG0 is
10673 (1 << foo) & bar, convert it to (bar >> foo) & 1. Both require
10674 two operations, but the latter can be done in one less insn
10675 on machines that have only two-operand insns or on which a
10676 constant cannot be the first operand. */
10677 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10678 && integer_zerop (arg1
))
10680 tree arg00
= TREE_OPERAND (arg0
, 0);
10681 tree arg01
= TREE_OPERAND (arg0
, 1);
10682 if (TREE_CODE (arg00
) == LSHIFT_EXPR
10683 && integer_onep (TREE_OPERAND (arg00
, 0)))
10685 tree tem
= fold_build2_loc (loc
, RSHIFT_EXPR
, TREE_TYPE (arg00
),
10686 arg01
, TREE_OPERAND (arg00
, 1));
10687 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg0
), tem
,
10688 build_int_cst (TREE_TYPE (arg0
), 1));
10689 return fold_build2_loc (loc
, code
, type
,
10690 fold_convert_loc (loc
, TREE_TYPE (arg1
), tem
),
10693 else if (TREE_CODE (arg01
) == LSHIFT_EXPR
10694 && integer_onep (TREE_OPERAND (arg01
, 0)))
10696 tree tem
= fold_build2_loc (loc
, RSHIFT_EXPR
, TREE_TYPE (arg01
),
10697 arg00
, TREE_OPERAND (arg01
, 1));
10698 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg0
), tem
,
10699 build_int_cst (TREE_TYPE (arg0
), 1));
10700 return fold_build2_loc (loc
, code
, type
,
10701 fold_convert_loc (loc
, TREE_TYPE (arg1
), tem
),
10706 /* If this is an NE or EQ comparison of zero against the result of a
10707 signed MOD operation whose second operand is a power of 2, make
10708 the MOD operation unsigned since it is simpler and equivalent. */
10709 if (integer_zerop (arg1
)
10710 && !TYPE_UNSIGNED (TREE_TYPE (arg0
))
10711 && (TREE_CODE (arg0
) == TRUNC_MOD_EXPR
10712 || TREE_CODE (arg0
) == CEIL_MOD_EXPR
10713 || TREE_CODE (arg0
) == FLOOR_MOD_EXPR
10714 || TREE_CODE (arg0
) == ROUND_MOD_EXPR
)
10715 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
10717 tree newtype
= unsigned_type_for (TREE_TYPE (arg0
));
10718 tree newmod
= fold_build2_loc (loc
, TREE_CODE (arg0
), newtype
,
10719 fold_convert_loc (loc
, newtype
,
10720 TREE_OPERAND (arg0
, 0)),
10721 fold_convert_loc (loc
, newtype
,
10722 TREE_OPERAND (arg0
, 1)));
10724 return fold_build2_loc (loc
, code
, type
, newmod
,
10725 fold_convert_loc (loc
, newtype
, arg1
));
10728 /* Fold ((X >> C1) & C2) == 0 and ((X >> C1) & C2) != 0 where
10729 C1 is a valid shift constant, and C2 is a power of two, i.e.
10731 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10732 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == RSHIFT_EXPR
10733 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1))
10735 && integer_pow2p (TREE_OPERAND (arg0
, 1))
10736 && integer_zerop (arg1
))
10738 tree itype
= TREE_TYPE (arg0
);
10739 tree arg001
= TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1);
10740 prec
= TYPE_PRECISION (itype
);
10742 /* Check for a valid shift count. */
10743 if (wi::ltu_p (wi::to_wide (arg001
), prec
))
10745 tree arg01
= TREE_OPERAND (arg0
, 1);
10746 tree arg000
= TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0);
10747 unsigned HOST_WIDE_INT log2
= tree_log2 (arg01
);
10748 /* If (C2 << C1) doesn't overflow, then ((X >> C1) & C2) != 0
10749 can be rewritten as (X & (C2 << C1)) != 0. */
10750 if ((log2
+ TREE_INT_CST_LOW (arg001
)) < prec
)
10752 tem
= fold_build2_loc (loc
, LSHIFT_EXPR
, itype
, arg01
, arg001
);
10753 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, itype
, arg000
, tem
);
10754 return fold_build2_loc (loc
, code
, type
, tem
,
10755 fold_convert_loc (loc
, itype
, arg1
));
10757 /* Otherwise, for signed (arithmetic) shifts,
10758 ((X >> C1) & C2) != 0 is rewritten as X < 0, and
10759 ((X >> C1) & C2) == 0 is rewritten as X >= 0. */
10760 else if (!TYPE_UNSIGNED (itype
))
10761 return fold_build2_loc (loc
, code
== EQ_EXPR
? GE_EXPR
: LT_EXPR
, type
,
10762 arg000
, build_int_cst (itype
, 0));
10763 /* Otherwise, of unsigned (logical) shifts,
10764 ((X >> C1) & C2) != 0 is rewritten as (X,false), and
10765 ((X >> C1) & C2) == 0 is rewritten as (X,true). */
10767 return omit_one_operand_loc (loc
, type
,
10768 code
== EQ_EXPR
? integer_one_node
10769 : integer_zero_node
,
10774 /* If this is a comparison of a field, we may be able to simplify it. */
10775 if ((TREE_CODE (arg0
) == COMPONENT_REF
10776 || TREE_CODE (arg0
) == BIT_FIELD_REF
)
10777 /* Handle the constant case even without -O
10778 to make sure the warnings are given. */
10779 && (optimize
|| TREE_CODE (arg1
) == INTEGER_CST
))
10781 t1
= optimize_bit_field_compare (loc
, code
, type
, arg0
, arg1
);
10786 /* Optimize comparisons of strlen vs zero to a compare of the
10787 first character of the string vs zero. To wit,
10788 strlen(ptr) == 0 => *ptr == 0
10789 strlen(ptr) != 0 => *ptr != 0
10790 Other cases should reduce to one of these two (or a constant)
10791 due to the return value of strlen being unsigned. */
10792 if (TREE_CODE (arg0
) == CALL_EXPR
10793 && integer_zerop (arg1
))
10795 tree fndecl
= get_callee_fndecl (arg0
);
10798 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
10799 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_STRLEN
10800 && call_expr_nargs (arg0
) == 1
10801 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (arg0
, 0))) == POINTER_TYPE
)
10803 tree iref
= build_fold_indirect_ref_loc (loc
,
10804 CALL_EXPR_ARG (arg0
, 0));
10805 return fold_build2_loc (loc
, code
, type
, iref
,
10806 build_int_cst (TREE_TYPE (iref
), 0));
10810 /* Fold (X >> C) != 0 into X < 0 if C is one less than the width
10811 of X. Similarly fold (X >> C) == 0 into X >= 0. */
10812 if (TREE_CODE (arg0
) == RSHIFT_EXPR
10813 && integer_zerop (arg1
)
10814 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
10816 tree arg00
= TREE_OPERAND (arg0
, 0);
10817 tree arg01
= TREE_OPERAND (arg0
, 1);
10818 tree itype
= TREE_TYPE (arg00
);
10819 if (wi::to_wide (arg01
) == element_precision (itype
) - 1)
10821 if (TYPE_UNSIGNED (itype
))
10823 itype
= signed_type_for (itype
);
10824 arg00
= fold_convert_loc (loc
, itype
, arg00
);
10826 return fold_build2_loc (loc
, code
== EQ_EXPR
? GE_EXPR
: LT_EXPR
,
10827 type
, arg00
, build_zero_cst (itype
));
10831 /* Fold (~X & C) == 0 into (X & C) != 0 and (~X & C) != 0 into
10832 (X & C) == 0 when C is a single bit. */
10833 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10834 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_NOT_EXPR
10835 && integer_zerop (arg1
)
10836 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
10838 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg0
),
10839 TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0),
10840 TREE_OPERAND (arg0
, 1));
10841 return fold_build2_loc (loc
, code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
,
10843 fold_convert_loc (loc
, TREE_TYPE (arg0
),
10847 /* Fold ((X & C) ^ C) eq/ne 0 into (X & C) ne/eq 0, when the
10848 constant C is a power of two, i.e. a single bit. */
10849 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
10850 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_AND_EXPR
10851 && integer_zerop (arg1
)
10852 && integer_pow2p (TREE_OPERAND (arg0
, 1))
10853 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1),
10854 TREE_OPERAND (arg0
, 1), OEP_ONLY_CONST
))
10856 tree arg00
= TREE_OPERAND (arg0
, 0);
10857 return fold_build2_loc (loc
, code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
, type
,
10858 arg00
, build_int_cst (TREE_TYPE (arg00
), 0));
10861 /* Likewise, fold ((X ^ C) & C) eq/ne 0 into (X & C) ne/eq 0,
10862 when is C is a power of two, i.e. a single bit. */
10863 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10864 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_XOR_EXPR
10865 && integer_zerop (arg1
)
10866 && integer_pow2p (TREE_OPERAND (arg0
, 1))
10867 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1),
10868 TREE_OPERAND (arg0
, 1), OEP_ONLY_CONST
))
10870 tree arg000
= TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0);
10871 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg000
),
10872 arg000
, TREE_OPERAND (arg0
, 1));
10873 return fold_build2_loc (loc
, code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
, type
,
10874 tem
, build_int_cst (TREE_TYPE (tem
), 0));
10877 if (integer_zerop (arg1
)
10878 && tree_expr_nonzero_p (arg0
))
10880 tree res
= constant_boolean_node (code
==NE_EXPR
, type
);
10881 return omit_one_operand_loc (loc
, type
, res
, arg0
);
10884 /* Fold (X & C) op (Y & C) as (X ^ Y) & C op 0", and symmetries. */
10885 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10886 && TREE_CODE (arg1
) == BIT_AND_EXPR
)
10888 tree arg00
= TREE_OPERAND (arg0
, 0);
10889 tree arg01
= TREE_OPERAND (arg0
, 1);
10890 tree arg10
= TREE_OPERAND (arg1
, 0);
10891 tree arg11
= TREE_OPERAND (arg1
, 1);
10892 tree itype
= TREE_TYPE (arg0
);
10894 if (operand_equal_p (arg01
, arg11
, 0))
10896 tem
= fold_convert_loc (loc
, itype
, arg10
);
10897 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg00
, tem
);
10898 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, itype
, tem
, arg01
);
10899 return fold_build2_loc (loc
, code
, type
, tem
,
10900 build_zero_cst (itype
));
10902 if (operand_equal_p (arg01
, arg10
, 0))
10904 tem
= fold_convert_loc (loc
, itype
, arg11
);
10905 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg00
, tem
);
10906 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, itype
, tem
, arg01
);
10907 return fold_build2_loc (loc
, code
, type
, tem
,
10908 build_zero_cst (itype
));
10910 if (operand_equal_p (arg00
, arg11
, 0))
10912 tem
= fold_convert_loc (loc
, itype
, arg10
);
10913 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg01
, tem
);
10914 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, itype
, tem
, arg00
);
10915 return fold_build2_loc (loc
, code
, type
, tem
,
10916 build_zero_cst (itype
));
10918 if (operand_equal_p (arg00
, arg10
, 0))
10920 tem
= fold_convert_loc (loc
, itype
, arg11
);
10921 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg01
, tem
);
10922 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, itype
, tem
, arg00
);
10923 return fold_build2_loc (loc
, code
, type
, tem
,
10924 build_zero_cst (itype
));
10928 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
10929 && TREE_CODE (arg1
) == BIT_XOR_EXPR
)
10931 tree arg00
= TREE_OPERAND (arg0
, 0);
10932 tree arg01
= TREE_OPERAND (arg0
, 1);
10933 tree arg10
= TREE_OPERAND (arg1
, 0);
10934 tree arg11
= TREE_OPERAND (arg1
, 1);
10935 tree itype
= TREE_TYPE (arg0
);
10937 /* Optimize (X ^ Z) op (Y ^ Z) as X op Y, and symmetries.
10938 operand_equal_p guarantees no side-effects so we don't need
10939 to use omit_one_operand on Z. */
10940 if (operand_equal_p (arg01
, arg11
, 0))
10941 return fold_build2_loc (loc
, code
, type
, arg00
,
10942 fold_convert_loc (loc
, TREE_TYPE (arg00
),
10944 if (operand_equal_p (arg01
, arg10
, 0))
10945 return fold_build2_loc (loc
, code
, type
, arg00
,
10946 fold_convert_loc (loc
, TREE_TYPE (arg00
),
10948 if (operand_equal_p (arg00
, arg11
, 0))
10949 return fold_build2_loc (loc
, code
, type
, arg01
,
10950 fold_convert_loc (loc
, TREE_TYPE (arg01
),
10952 if (operand_equal_p (arg00
, arg10
, 0))
10953 return fold_build2_loc (loc
, code
, type
, arg01
,
10954 fold_convert_loc (loc
, TREE_TYPE (arg01
),
10957 /* Optimize (X ^ C1) op (Y ^ C2) as (X ^ (C1 ^ C2)) op Y. */
10958 if (TREE_CODE (arg01
) == INTEGER_CST
10959 && TREE_CODE (arg11
) == INTEGER_CST
)
10961 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg01
,
10962 fold_convert_loc (loc
, itype
, arg11
));
10963 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg00
, tem
);
10964 return fold_build2_loc (loc
, code
, type
, tem
,
10965 fold_convert_loc (loc
, itype
, arg10
));
10969 /* Attempt to simplify equality/inequality comparisons of complex
10970 values. Only lower the comparison if the result is known or
10971 can be simplified to a single scalar comparison. */
10972 if ((TREE_CODE (arg0
) == COMPLEX_EXPR
10973 || TREE_CODE (arg0
) == COMPLEX_CST
)
10974 && (TREE_CODE (arg1
) == COMPLEX_EXPR
10975 || TREE_CODE (arg1
) == COMPLEX_CST
))
10977 tree real0
, imag0
, real1
, imag1
;
10980 if (TREE_CODE (arg0
) == COMPLEX_EXPR
)
10982 real0
= TREE_OPERAND (arg0
, 0);
10983 imag0
= TREE_OPERAND (arg0
, 1);
10987 real0
= TREE_REALPART (arg0
);
10988 imag0
= TREE_IMAGPART (arg0
);
10991 if (TREE_CODE (arg1
) == COMPLEX_EXPR
)
10993 real1
= TREE_OPERAND (arg1
, 0);
10994 imag1
= TREE_OPERAND (arg1
, 1);
10998 real1
= TREE_REALPART (arg1
);
10999 imag1
= TREE_IMAGPART (arg1
);
11002 rcond
= fold_binary_loc (loc
, code
, type
, real0
, real1
);
11003 if (rcond
&& TREE_CODE (rcond
) == INTEGER_CST
)
11005 if (integer_zerop (rcond
))
11007 if (code
== EQ_EXPR
)
11008 return omit_two_operands_loc (loc
, type
, boolean_false_node
,
11010 return fold_build2_loc (loc
, NE_EXPR
, type
, imag0
, imag1
);
11014 if (code
== NE_EXPR
)
11015 return omit_two_operands_loc (loc
, type
, boolean_true_node
,
11017 return fold_build2_loc (loc
, EQ_EXPR
, type
, imag0
, imag1
);
11021 icond
= fold_binary_loc (loc
, code
, type
, imag0
, imag1
);
11022 if (icond
&& TREE_CODE (icond
) == INTEGER_CST
)
11024 if (integer_zerop (icond
))
11026 if (code
== EQ_EXPR
)
11027 return omit_two_operands_loc (loc
, type
, boolean_false_node
,
11029 return fold_build2_loc (loc
, NE_EXPR
, type
, real0
, real1
);
11033 if (code
== NE_EXPR
)
11034 return omit_two_operands_loc (loc
, type
, boolean_true_node
,
11036 return fold_build2_loc (loc
, EQ_EXPR
, type
, real0
, real1
);
11047 tem
= fold_comparison (loc
, code
, type
, op0
, op1
);
11048 if (tem
!= NULL_TREE
)
11051 /* Transform comparisons of the form X +- C CMP X. */
11052 if ((TREE_CODE (arg0
) == PLUS_EXPR
|| TREE_CODE (arg0
) == MINUS_EXPR
)
11053 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0)
11054 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == REAL_CST
11055 && !HONOR_SNANS (arg0
))
11057 tree arg01
= TREE_OPERAND (arg0
, 1);
11058 enum tree_code code0
= TREE_CODE (arg0
);
11059 int is_positive
= REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg01
)) ? -1 : 1;
11061 /* (X - c) > X becomes false. */
11062 if (code
== GT_EXPR
11063 && ((code0
== MINUS_EXPR
&& is_positive
>= 0)
11064 || (code0
== PLUS_EXPR
&& is_positive
<= 0)))
11065 return constant_boolean_node (0, type
);
11067 /* Likewise (X + c) < X becomes false. */
11068 if (code
== LT_EXPR
11069 && ((code0
== PLUS_EXPR
&& is_positive
>= 0)
11070 || (code0
== MINUS_EXPR
&& is_positive
<= 0)))
11071 return constant_boolean_node (0, type
);
11073 /* Convert (X - c) <= X to true. */
11074 if (!HONOR_NANS (arg1
)
11076 && ((code0
== MINUS_EXPR
&& is_positive
>= 0)
11077 || (code0
== PLUS_EXPR
&& is_positive
<= 0)))
11078 return constant_boolean_node (1, type
);
11080 /* Convert (X + c) >= X to true. */
11081 if (!HONOR_NANS (arg1
)
11083 && ((code0
== PLUS_EXPR
&& is_positive
>= 0)
11084 || (code0
== MINUS_EXPR
&& is_positive
<= 0)))
11085 return constant_boolean_node (1, type
);
11088 /* If we are comparing an ABS_EXPR with a constant, we can
11089 convert all the cases into explicit comparisons, but they may
11090 well not be faster than doing the ABS and one comparison.
11091 But ABS (X) <= C is a range comparison, which becomes a subtraction
11092 and a comparison, and is probably faster. */
11093 if (code
== LE_EXPR
11094 && TREE_CODE (arg1
) == INTEGER_CST
11095 && TREE_CODE (arg0
) == ABS_EXPR
11096 && ! TREE_SIDE_EFFECTS (arg0
)
11097 && (tem
= negate_expr (arg1
)) != 0
11098 && TREE_CODE (tem
) == INTEGER_CST
11099 && !TREE_OVERFLOW (tem
))
11100 return fold_build2_loc (loc
, TRUTH_ANDIF_EXPR
, type
,
11101 build2 (GE_EXPR
, type
,
11102 TREE_OPERAND (arg0
, 0), tem
),
11103 build2 (LE_EXPR
, type
,
11104 TREE_OPERAND (arg0
, 0), arg1
));
11106 /* Convert ABS_EXPR<x> >= 0 to true. */
11107 strict_overflow_p
= false;
11108 if (code
== GE_EXPR
11109 && (integer_zerop (arg1
)
11110 || (! HONOR_NANS (arg0
)
11111 && real_zerop (arg1
)))
11112 && tree_expr_nonnegative_warnv_p (arg0
, &strict_overflow_p
))
11114 if (strict_overflow_p
)
11115 fold_overflow_warning (("assuming signed overflow does not occur "
11116 "when simplifying comparison of "
11117 "absolute value and zero"),
11118 WARN_STRICT_OVERFLOW_CONDITIONAL
);
11119 return omit_one_operand_loc (loc
, type
,
11120 constant_boolean_node (true, type
),
11124 /* Convert ABS_EXPR<x> < 0 to false. */
11125 strict_overflow_p
= false;
11126 if (code
== LT_EXPR
11127 && (integer_zerop (arg1
) || real_zerop (arg1
))
11128 && tree_expr_nonnegative_warnv_p (arg0
, &strict_overflow_p
))
11130 if (strict_overflow_p
)
11131 fold_overflow_warning (("assuming signed overflow does not occur "
11132 "when simplifying comparison of "
11133 "absolute value and zero"),
11134 WARN_STRICT_OVERFLOW_CONDITIONAL
);
11135 return omit_one_operand_loc (loc
, type
,
11136 constant_boolean_node (false, type
),
11140 /* If X is unsigned, convert X < (1 << Y) into X >> Y == 0
11141 and similarly for >= into !=. */
11142 if ((code
== LT_EXPR
|| code
== GE_EXPR
)
11143 && TYPE_UNSIGNED (TREE_TYPE (arg0
))
11144 && TREE_CODE (arg1
) == LSHIFT_EXPR
11145 && integer_onep (TREE_OPERAND (arg1
, 0)))
11146 return build2_loc (loc
, code
== LT_EXPR
? EQ_EXPR
: NE_EXPR
, type
,
11147 build2 (RSHIFT_EXPR
, TREE_TYPE (arg0
), arg0
,
11148 TREE_OPERAND (arg1
, 1)),
11149 build_zero_cst (TREE_TYPE (arg0
)));
11151 /* Similarly for X < (cast) (1 << Y). But cast can't be narrowing,
11152 otherwise Y might be >= # of bits in X's type and thus e.g.
11153 (unsigned char) (1 << Y) for Y 15 might be 0.
11154 If the cast is widening, then 1 << Y should have unsigned type,
11155 otherwise if Y is number of bits in the signed shift type minus 1,
11156 we can't optimize this. E.g. (unsigned long long) (1 << Y) for Y
11157 31 might be 0xffffffff80000000. */
11158 if ((code
== LT_EXPR
|| code
== GE_EXPR
)
11159 && TYPE_UNSIGNED (TREE_TYPE (arg0
))
11160 && CONVERT_EXPR_P (arg1
)
11161 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == LSHIFT_EXPR
11162 && (element_precision (TREE_TYPE (arg1
))
11163 >= element_precision (TREE_TYPE (TREE_OPERAND (arg1
, 0))))
11164 && (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
11165 || (element_precision (TREE_TYPE (arg1
))
11166 == element_precision (TREE_TYPE (TREE_OPERAND (arg1
, 0)))))
11167 && integer_onep (TREE_OPERAND (TREE_OPERAND (arg1
, 0), 0)))
11169 tem
= build2 (RSHIFT_EXPR
, TREE_TYPE (arg0
), arg0
,
11170 TREE_OPERAND (TREE_OPERAND (arg1
, 0), 1));
11171 return build2_loc (loc
, code
== LT_EXPR
? EQ_EXPR
: NE_EXPR
, type
,
11172 fold_convert_loc (loc
, TREE_TYPE (arg0
), tem
),
11173 build_zero_cst (TREE_TYPE (arg0
)));
11178 case UNORDERED_EXPR
:
11186 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
11188 tree targ0
= strip_float_extensions (arg0
);
11189 tree targ1
= strip_float_extensions (arg1
);
11190 tree newtype
= TREE_TYPE (targ0
);
11192 if (TYPE_PRECISION (TREE_TYPE (targ1
)) > TYPE_PRECISION (newtype
))
11193 newtype
= TREE_TYPE (targ1
);
11195 if (TYPE_PRECISION (newtype
) < TYPE_PRECISION (TREE_TYPE (arg0
)))
11196 return fold_build2_loc (loc
, code
, type
,
11197 fold_convert_loc (loc
, newtype
, targ0
),
11198 fold_convert_loc (loc
, newtype
, targ1
));
11203 case COMPOUND_EXPR
:
11204 /* When pedantic, a compound expression can be neither an lvalue
11205 nor an integer constant expression. */
11206 if (TREE_SIDE_EFFECTS (arg0
) || TREE_CONSTANT (arg1
))
11208 /* Don't let (0, 0) be null pointer constant. */
11209 tem
= integer_zerop (arg1
) ? build1 (NOP_EXPR
, type
, arg1
)
11210 : fold_convert_loc (loc
, type
, arg1
);
11211 return pedantic_non_lvalue_loc (loc
, tem
);
11214 /* An ASSERT_EXPR should never be passed to fold_binary. */
11215 gcc_unreachable ();
11219 } /* switch (code) */
11222 /* Used by contains_label_[p1]. */
11224 struct contains_label_data
11226 hash_set
<tree
> *pset
;
11227 bool inside_switch_p
;
11230 /* Callback for walk_tree, looking for LABEL_EXPR. Return *TP if it is
11231 a LABEL_EXPR or CASE_LABEL_EXPR not inside of another SWITCH_EXPR; otherwise
11232 return NULL_TREE. Do not check the subtrees of GOTO_EXPR. */
11235 contains_label_1 (tree
*tp
, int *walk_subtrees
, void *data
)
11237 contains_label_data
*d
= (contains_label_data
*) data
;
11238 switch (TREE_CODE (*tp
))
11243 case CASE_LABEL_EXPR
:
11244 if (!d
->inside_switch_p
)
11249 if (!d
->inside_switch_p
)
11251 if (walk_tree (&SWITCH_COND (*tp
), contains_label_1
, data
, d
->pset
))
11253 d
->inside_switch_p
= true;
11254 if (walk_tree (&SWITCH_BODY (*tp
), contains_label_1
, data
, d
->pset
))
11256 d
->inside_switch_p
= false;
11257 *walk_subtrees
= 0;
11262 *walk_subtrees
= 0;
11270 /* Return whether the sub-tree ST contains a label which is accessible from
11271 outside the sub-tree. */
11274 contains_label_p (tree st
)
11276 hash_set
<tree
> pset
;
11277 contains_label_data data
= { &pset
, false };
11278 return walk_tree (&st
, contains_label_1
, &data
, &pset
) != NULL_TREE
;
11281 /* Fold a ternary expression of code CODE and type TYPE with operands
11282 OP0, OP1, and OP2. Return the folded expression if folding is
11283 successful. Otherwise, return NULL_TREE. */
11286 fold_ternary_loc (location_t loc
, enum tree_code code
, tree type
,
11287 tree op0
, tree op1
, tree op2
)
11290 tree arg0
= NULL_TREE
, arg1
= NULL_TREE
, arg2
= NULL_TREE
;
11291 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
11293 gcc_assert (IS_EXPR_CODE_CLASS (kind
)
11294 && TREE_CODE_LENGTH (code
) == 3);
11296 /* If this is a commutative operation, and OP0 is a constant, move it
11297 to OP1 to reduce the number of tests below. */
11298 if (commutative_ternary_tree_code (code
)
11299 && tree_swap_operands_p (op0
, op1
))
11300 return fold_build3_loc (loc
, code
, type
, op1
, op0
, op2
);
11302 tem
= generic_simplify (loc
, code
, type
, op0
, op1
, op2
);
11306 /* Strip any conversions that don't change the mode. This is safe
11307 for every expression, except for a comparison expression because
11308 its signedness is derived from its operands. So, in the latter
11309 case, only strip conversions that don't change the signedness.
11311 Note that this is done as an internal manipulation within the
11312 constant folder, in order to find the simplest representation of
11313 the arguments so that their form can be studied. In any cases,
11314 the appropriate type conversions should be put back in the tree
11315 that will get out of the constant folder. */
11336 case COMPONENT_REF
:
11337 if (TREE_CODE (arg0
) == CONSTRUCTOR
11338 && ! type_contains_placeholder_p (TREE_TYPE (arg0
)))
11340 unsigned HOST_WIDE_INT idx
;
11342 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg0
), idx
, field
, value
)
11349 case VEC_COND_EXPR
:
11350 /* Pedantic ANSI C says that a conditional expression is never an lvalue,
11351 so all simple results must be passed through pedantic_non_lvalue. */
11352 if (TREE_CODE (arg0
) == INTEGER_CST
)
11354 tree unused_op
= integer_zerop (arg0
) ? op1
: op2
;
11355 tem
= integer_zerop (arg0
) ? op2
: op1
;
11356 /* Only optimize constant conditions when the selected branch
11357 has the same type as the COND_EXPR. This avoids optimizing
11358 away "c ? x : throw", where the throw has a void type.
11359 Avoid throwing away that operand which contains label. */
11360 if ((!TREE_SIDE_EFFECTS (unused_op
)
11361 || !contains_label_p (unused_op
))
11362 && (! VOID_TYPE_P (TREE_TYPE (tem
))
11363 || VOID_TYPE_P (type
)))
11364 return pedantic_non_lvalue_loc (loc
, tem
);
11367 else if (TREE_CODE (arg0
) == VECTOR_CST
)
11369 if ((TREE_CODE (arg1
) == VECTOR_CST
11370 || TREE_CODE (arg1
) == CONSTRUCTOR
)
11371 && (TREE_CODE (arg2
) == VECTOR_CST
11372 || TREE_CODE (arg2
) == CONSTRUCTOR
))
11374 unsigned int nelts
= VECTOR_CST_NELTS (arg0
), i
;
11375 gcc_assert (nelts
== TYPE_VECTOR_SUBPARTS (type
));
11376 vec_perm_builder
sel (nelts
, nelts
, 1);
11377 for (i
= 0; i
< nelts
; i
++)
11379 tree val
= VECTOR_CST_ELT (arg0
, i
);
11380 if (integer_all_onesp (val
))
11381 sel
.quick_push (i
);
11382 else if (integer_zerop (val
))
11383 sel
.quick_push (nelts
+ i
);
11384 else /* Currently unreachable. */
11387 tree t
= fold_vec_perm (type
, arg1
, arg2
,
11388 vec_perm_indices (sel
, 2, nelts
));
11389 if (t
!= NULL_TREE
)
11394 /* If we have A op B ? A : C, we may be able to convert this to a
11395 simpler expression, depending on the operation and the values
11396 of B and C. Signed zeros prevent all of these transformations,
11397 for reasons given above each one.
11399 Also try swapping the arguments and inverting the conditional. */
11400 if (COMPARISON_CLASS_P (arg0
)
11401 && operand_equal_for_comparison_p (TREE_OPERAND (arg0
, 0), op1
)
11402 && !HONOR_SIGNED_ZEROS (element_mode (op1
)))
11404 tem
= fold_cond_expr_with_comparison (loc
, type
, arg0
, op1
, op2
);
11409 if (COMPARISON_CLASS_P (arg0
)
11410 && operand_equal_for_comparison_p (TREE_OPERAND (arg0
, 0), op2
)
11411 && !HONOR_SIGNED_ZEROS (element_mode (op2
)))
11413 location_t loc0
= expr_location_or (arg0
, loc
);
11414 tem
= fold_invert_truthvalue (loc0
, arg0
);
11415 if (tem
&& COMPARISON_CLASS_P (tem
))
11417 tem
= fold_cond_expr_with_comparison (loc
, type
, tem
, op2
, op1
);
11423 /* If the second operand is simpler than the third, swap them
11424 since that produces better jump optimization results. */
11425 if (truth_value_p (TREE_CODE (arg0
))
11426 && tree_swap_operands_p (op1
, op2
))
11428 location_t loc0
= expr_location_or (arg0
, loc
);
11429 /* See if this can be inverted. If it can't, possibly because
11430 it was a floating-point inequality comparison, don't do
11432 tem
= fold_invert_truthvalue (loc0
, arg0
);
11434 return fold_build3_loc (loc
, code
, type
, tem
, op2
, op1
);
11437 /* Convert A ? 1 : 0 to simply A. */
11438 if ((code
== VEC_COND_EXPR
? integer_all_onesp (op1
)
11439 : (integer_onep (op1
)
11440 && !VECTOR_TYPE_P (type
)))
11441 && integer_zerop (op2
)
11442 /* If we try to convert OP0 to our type, the
11443 call to fold will try to move the conversion inside
11444 a COND, which will recurse. In that case, the COND_EXPR
11445 is probably the best choice, so leave it alone. */
11446 && type
== TREE_TYPE (arg0
))
11447 return pedantic_non_lvalue_loc (loc
, arg0
);
11449 /* Convert A ? 0 : 1 to !A. This prefers the use of NOT_EXPR
11450 over COND_EXPR in cases such as floating point comparisons. */
11451 if (integer_zerop (op1
)
11452 && code
== COND_EXPR
11453 && integer_onep (op2
)
11454 && !VECTOR_TYPE_P (type
)
11455 && truth_value_p (TREE_CODE (arg0
)))
11456 return pedantic_non_lvalue_loc (loc
,
11457 fold_convert_loc (loc
, type
,
11458 invert_truthvalue_loc (loc
,
11461 /* A < 0 ? <sign bit of A> : 0 is simply (A & <sign bit of A>). */
11462 if (TREE_CODE (arg0
) == LT_EXPR
11463 && integer_zerop (TREE_OPERAND (arg0
, 1))
11464 && integer_zerop (op2
)
11465 && (tem
= sign_bit_p (TREE_OPERAND (arg0
, 0), arg1
)))
11467 /* sign_bit_p looks through both zero and sign extensions,
11468 but for this optimization only sign extensions are
11470 tree tem2
= TREE_OPERAND (arg0
, 0);
11471 while (tem
!= tem2
)
11473 if (TREE_CODE (tem2
) != NOP_EXPR
11474 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (tem2
, 0))))
11479 tem2
= TREE_OPERAND (tem2
, 0);
11481 /* sign_bit_p only checks ARG1 bits within A's precision.
11482 If <sign bit of A> has wider type than A, bits outside
11483 of A's precision in <sign bit of A> need to be checked.
11484 If they are all 0, this optimization needs to be done
11485 in unsigned A's type, if they are all 1 in signed A's type,
11486 otherwise this can't be done. */
11488 && TYPE_PRECISION (TREE_TYPE (tem
))
11489 < TYPE_PRECISION (TREE_TYPE (arg1
))
11490 && TYPE_PRECISION (TREE_TYPE (tem
))
11491 < TYPE_PRECISION (type
))
11493 int inner_width
, outer_width
;
11496 inner_width
= TYPE_PRECISION (TREE_TYPE (tem
));
11497 outer_width
= TYPE_PRECISION (TREE_TYPE (arg1
));
11498 if (outer_width
> TYPE_PRECISION (type
))
11499 outer_width
= TYPE_PRECISION (type
);
11501 wide_int mask
= wi::shifted_mask
11502 (inner_width
, outer_width
- inner_width
, false,
11503 TYPE_PRECISION (TREE_TYPE (arg1
)));
11505 wide_int common
= mask
& wi::to_wide (arg1
);
11506 if (common
== mask
)
11508 tem_type
= signed_type_for (TREE_TYPE (tem
));
11509 tem
= fold_convert_loc (loc
, tem_type
, tem
);
11511 else if (common
== 0)
11513 tem_type
= unsigned_type_for (TREE_TYPE (tem
));
11514 tem
= fold_convert_loc (loc
, tem_type
, tem
);
11522 fold_convert_loc (loc
, type
,
11523 fold_build2_loc (loc
, BIT_AND_EXPR
,
11524 TREE_TYPE (tem
), tem
,
11525 fold_convert_loc (loc
,
11530 /* (A >> N) & 1 ? (1 << N) : 0 is simply A & (1 << N). A & 1 was
11531 already handled above. */
11532 if (TREE_CODE (arg0
) == BIT_AND_EXPR
11533 && integer_onep (TREE_OPERAND (arg0
, 1))
11534 && integer_zerop (op2
)
11535 && integer_pow2p (arg1
))
11537 tree tem
= TREE_OPERAND (arg0
, 0);
11539 if (TREE_CODE (tem
) == RSHIFT_EXPR
11540 && tree_fits_uhwi_p (TREE_OPERAND (tem
, 1))
11541 && (unsigned HOST_WIDE_INT
) tree_log2 (arg1
)
11542 == tree_to_uhwi (TREE_OPERAND (tem
, 1)))
11543 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
11544 fold_convert_loc (loc
, type
,
11545 TREE_OPERAND (tem
, 0)),
11549 /* A & N ? N : 0 is simply A & N if N is a power of two. This
11550 is probably obsolete because the first operand should be a
11551 truth value (that's why we have the two cases above), but let's
11552 leave it in until we can confirm this for all front-ends. */
11553 if (integer_zerop (op2
)
11554 && TREE_CODE (arg0
) == NE_EXPR
11555 && integer_zerop (TREE_OPERAND (arg0
, 1))
11556 && integer_pow2p (arg1
)
11557 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_AND_EXPR
11558 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1),
11559 arg1
, OEP_ONLY_CONST
))
11560 return pedantic_non_lvalue_loc (loc
,
11561 fold_convert_loc (loc
, type
,
11562 TREE_OPERAND (arg0
, 0)));
11564 /* Disable the transformations below for vectors, since
11565 fold_binary_op_with_conditional_arg may undo them immediately,
11566 yielding an infinite loop. */
11567 if (code
== VEC_COND_EXPR
)
11570 /* Convert A ? B : 0 into A && B if A and B are truth values. */
11571 if (integer_zerop (op2
)
11572 && truth_value_p (TREE_CODE (arg0
))
11573 && truth_value_p (TREE_CODE (arg1
))
11574 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
11575 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
? BIT_AND_EXPR
11576 : TRUTH_ANDIF_EXPR
,
11577 type
, fold_convert_loc (loc
, type
, arg0
), op1
);
11579 /* Convert A ? B : 1 into !A || B if A and B are truth values. */
11580 if (code
== VEC_COND_EXPR
? integer_all_onesp (op2
) : integer_onep (op2
)
11581 && truth_value_p (TREE_CODE (arg0
))
11582 && truth_value_p (TREE_CODE (arg1
))
11583 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
11585 location_t loc0
= expr_location_or (arg0
, loc
);
11586 /* Only perform transformation if ARG0 is easily inverted. */
11587 tem
= fold_invert_truthvalue (loc0
, arg0
);
11589 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
11592 type
, fold_convert_loc (loc
, type
, tem
),
11596 /* Convert A ? 0 : B into !A && B if A and B are truth values. */
11597 if (integer_zerop (arg1
)
11598 && truth_value_p (TREE_CODE (arg0
))
11599 && truth_value_p (TREE_CODE (op2
))
11600 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
11602 location_t loc0
= expr_location_or (arg0
, loc
);
11603 /* Only perform transformation if ARG0 is easily inverted. */
11604 tem
= fold_invert_truthvalue (loc0
, arg0
);
11606 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
11607 ? BIT_AND_EXPR
: TRUTH_ANDIF_EXPR
,
11608 type
, fold_convert_loc (loc
, type
, tem
),
11612 /* Convert A ? 1 : B into A || B if A and B are truth values. */
11613 if (code
== VEC_COND_EXPR
? integer_all_onesp (arg1
) : integer_onep (arg1
)
11614 && truth_value_p (TREE_CODE (arg0
))
11615 && truth_value_p (TREE_CODE (op2
))
11616 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
11617 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
11618 ? BIT_IOR_EXPR
: TRUTH_ORIF_EXPR
,
11619 type
, fold_convert_loc (loc
, type
, arg0
), op2
);
11624 /* CALL_EXPRs used to be ternary exprs. Catch any mistaken uses
11625 of fold_ternary on them. */
11626 gcc_unreachable ();
11628 case BIT_FIELD_REF
:
11629 if (TREE_CODE (arg0
) == VECTOR_CST
11630 && (type
== TREE_TYPE (TREE_TYPE (arg0
))
11631 || (TREE_CODE (type
) == VECTOR_TYPE
11632 && TREE_TYPE (type
) == TREE_TYPE (TREE_TYPE (arg0
)))))
11634 tree eltype
= TREE_TYPE (TREE_TYPE (arg0
));
11635 unsigned HOST_WIDE_INT width
= tree_to_uhwi (TYPE_SIZE (eltype
));
11636 unsigned HOST_WIDE_INT n
= tree_to_uhwi (arg1
);
11637 unsigned HOST_WIDE_INT idx
= tree_to_uhwi (op2
);
11640 && (idx
% width
) == 0
11641 && (n
% width
) == 0
11642 && ((idx
+ n
) / width
) <= TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0
)))
11647 if (TREE_CODE (arg0
) == VECTOR_CST
)
11650 return VECTOR_CST_ELT (arg0
, idx
);
11652 tree_vector_builder
vals (type
, n
, 1);
11653 for (unsigned i
= 0; i
< n
; ++i
)
11654 vals
.quick_push (VECTOR_CST_ELT (arg0
, idx
+ i
));
11655 return vals
.build ();
11660 /* On constants we can use native encode/interpret to constant
11661 fold (nearly) all BIT_FIELD_REFs. */
11662 if (CONSTANT_CLASS_P (arg0
)
11663 && can_native_interpret_type_p (type
)
11664 && BITS_PER_UNIT
== 8
11665 && tree_fits_uhwi_p (op1
)
11666 && tree_fits_uhwi_p (op2
))
11668 unsigned HOST_WIDE_INT bitpos
= tree_to_uhwi (op2
);
11669 unsigned HOST_WIDE_INT bitsize
= tree_to_uhwi (op1
);
11670 /* Limit us to a reasonable amount of work. To relax the
11671 other limitations we need bit-shifting of the buffer
11672 and rounding up the size. */
11673 if (bitpos
% BITS_PER_UNIT
== 0
11674 && bitsize
% BITS_PER_UNIT
== 0
11675 && bitsize
<= MAX_BITSIZE_MODE_ANY_MODE
)
11677 unsigned char b
[MAX_BITSIZE_MODE_ANY_MODE
/ BITS_PER_UNIT
];
11678 unsigned HOST_WIDE_INT len
11679 = native_encode_expr (arg0
, b
, bitsize
/ BITS_PER_UNIT
,
11680 bitpos
/ BITS_PER_UNIT
);
11682 && len
* BITS_PER_UNIT
>= bitsize
)
11684 tree v
= native_interpret_expr (type
, b
,
11685 bitsize
/ BITS_PER_UNIT
);
11695 /* For integers we can decompose the FMA if possible. */
11696 if (TREE_CODE (arg0
) == INTEGER_CST
11697 && TREE_CODE (arg1
) == INTEGER_CST
)
11698 return fold_build2_loc (loc
, PLUS_EXPR
, type
,
11699 const_binop (MULT_EXPR
, arg0
, arg1
), arg2
);
11700 if (integer_zerop (arg2
))
11701 return fold_build2_loc (loc
, MULT_EXPR
, type
, arg0
, arg1
);
11703 return fold_fma (loc
, type
, arg0
, arg1
, arg2
);
11705 case VEC_PERM_EXPR
:
11706 if (TREE_CODE (arg2
) == VECTOR_CST
)
11708 /* Build a vector of integers from the tree mask. */
11709 vec_perm_builder builder
;
11710 if (!tree_to_vec_perm_builder (&builder
, arg2
))
11713 /* Create a vec_perm_indices for the integer vector. */
11714 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (type
);
11715 bool single_arg
= (op0
== op1
);
11716 vec_perm_indices
sel (builder
, single_arg
? 1 : 2, nelts
);
11718 /* Check for cases that fold to OP0 or OP1 in their original
11720 if (sel
.series_p (0, 1, 0, 1))
11722 if (sel
.series_p (0, 1, nelts
, 1))
11727 if (sel
.all_from_input_p (0))
11729 else if (sel
.all_from_input_p (1))
11732 sel
.rotate_inputs (1);
11736 if ((TREE_CODE (op0
) == VECTOR_CST
11737 || TREE_CODE (op0
) == CONSTRUCTOR
)
11738 && (TREE_CODE (op1
) == VECTOR_CST
11739 || TREE_CODE (op1
) == CONSTRUCTOR
))
11741 tree t
= fold_vec_perm (type
, op0
, op1
, sel
);
11742 if (t
!= NULL_TREE
)
11746 bool changed
= (op0
== op1
&& !single_arg
);
11748 /* Generate a canonical form of the selector. */
11749 if (arg2
== op2
&& sel
.encoding () != builder
)
11751 /* Some targets are deficient and fail to expand a single
11752 argument permutation while still allowing an equivalent
11753 2-argument version. */
11754 if (sel
.ninputs () == 2
11755 || can_vec_perm_const_p (TYPE_MODE (type
), sel
, false))
11756 op2
= vec_perm_indices_to_tree (TREE_TYPE (arg2
), sel
);
11759 vec_perm_indices
sel2 (builder
, 2, nelts
);
11760 if (can_vec_perm_const_p (TYPE_MODE (type
), sel2
, false))
11761 op2
= vec_perm_indices_to_tree (TREE_TYPE (arg2
), sel2
);
11763 /* Not directly supported with either encoding,
11764 so use the preferred form. */
11765 op2
= vec_perm_indices_to_tree (TREE_TYPE (arg2
), sel
);
11771 return build3_loc (loc
, VEC_PERM_EXPR
, type
, op0
, op1
, op2
);
11775 case BIT_INSERT_EXPR
:
11776 /* Perform (partial) constant folding of BIT_INSERT_EXPR. */
11777 if (TREE_CODE (arg0
) == INTEGER_CST
11778 && TREE_CODE (arg1
) == INTEGER_CST
)
11780 unsigned HOST_WIDE_INT bitpos
= tree_to_uhwi (op2
);
11781 unsigned bitsize
= TYPE_PRECISION (TREE_TYPE (arg1
));
11782 wide_int tem
= (wi::to_wide (arg0
)
11783 & wi::shifted_mask (bitpos
, bitsize
, true,
11784 TYPE_PRECISION (type
)));
11786 = wi::lshift (wi::zext (wi::to_wide (arg1
, TYPE_PRECISION (type
)),
11788 return wide_int_to_tree (type
, wi::bit_or (tem
, tem2
));
11790 else if (TREE_CODE (arg0
) == VECTOR_CST
11791 && CONSTANT_CLASS_P (arg1
)
11792 && types_compatible_p (TREE_TYPE (TREE_TYPE (arg0
)),
11795 unsigned HOST_WIDE_INT bitpos
= tree_to_uhwi (op2
);
11796 unsigned HOST_WIDE_INT elsize
11797 = tree_to_uhwi (TYPE_SIZE (TREE_TYPE (arg1
)));
11798 if (bitpos
% elsize
== 0)
11800 unsigned k
= bitpos
/ elsize
;
11801 if (operand_equal_p (VECTOR_CST_ELT (arg0
, k
), arg1
, 0))
11805 unsigned int nelts
= VECTOR_CST_NELTS (arg0
);
11806 tree_vector_builder
elts (type
, nelts
, 1);
11807 elts
.quick_grow (nelts
);
11808 for (unsigned int i
= 0; i
< nelts
; ++i
)
11809 elts
[i
] = (i
== k
? arg1
: VECTOR_CST_ELT (arg0
, i
));
11810 return elts
.build ();
11818 } /* switch (code) */
11821 /* Gets the element ACCESS_INDEX from CTOR, which must be a CONSTRUCTOR
11822 of an array (or vector). */
11825 get_array_ctor_element_at_index (tree ctor
, offset_int access_index
)
11827 tree index_type
= NULL_TREE
;
11828 offset_int low_bound
= 0;
11830 if (TREE_CODE (TREE_TYPE (ctor
)) == ARRAY_TYPE
)
11832 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ctor
));
11833 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
11835 /* Static constructors for variably sized objects makes no sense. */
11836 gcc_assert (TREE_CODE (TYPE_MIN_VALUE (domain_type
)) == INTEGER_CST
);
11837 index_type
= TREE_TYPE (TYPE_MIN_VALUE (domain_type
));
11838 low_bound
= wi::to_offset (TYPE_MIN_VALUE (domain_type
));
11843 access_index
= wi::ext (access_index
, TYPE_PRECISION (index_type
),
11844 TYPE_SIGN (index_type
));
11846 offset_int index
= low_bound
- 1;
11848 index
= wi::ext (index
, TYPE_PRECISION (index_type
),
11849 TYPE_SIGN (index_type
));
11851 offset_int max_index
;
11852 unsigned HOST_WIDE_INT cnt
;
11855 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor
), cnt
, cfield
, cval
)
11857 /* Array constructor might explicitly set index, or specify a range,
11858 or leave index NULL meaning that it is next index after previous
11862 if (TREE_CODE (cfield
) == INTEGER_CST
)
11863 max_index
= index
= wi::to_offset (cfield
);
11866 gcc_assert (TREE_CODE (cfield
) == RANGE_EXPR
);
11867 index
= wi::to_offset (TREE_OPERAND (cfield
, 0));
11868 max_index
= wi::to_offset (TREE_OPERAND (cfield
, 1));
11875 index
= wi::ext (index
, TYPE_PRECISION (index_type
),
11876 TYPE_SIGN (index_type
));
11880 /* Do we have match? */
11881 if (wi::cmpu (access_index
, index
) >= 0
11882 && wi::cmpu (access_index
, max_index
) <= 0)
11888 /* Perform constant folding and related simplification of EXPR.
11889 The related simplifications include x*1 => x, x*0 => 0, etc.,
11890 and application of the associative law.
11891 NOP_EXPR conversions may be removed freely (as long as we
11892 are careful not to change the type of the overall expression).
11893 We cannot simplify through a CONVERT_EXPR, FIX_EXPR or FLOAT_EXPR,
11894 but we can constant-fold them if they have constant operands. */
11896 #ifdef ENABLE_FOLD_CHECKING
11897 # define fold(x) fold_1 (x)
11898 static tree
fold_1 (tree
);
11904 const tree t
= expr
;
11905 enum tree_code code
= TREE_CODE (t
);
11906 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
11908 location_t loc
= EXPR_LOCATION (expr
);
11910 /* Return right away if a constant. */
11911 if (kind
== tcc_constant
)
11914 /* CALL_EXPR-like objects with variable numbers of operands are
11915 treated specially. */
11916 if (kind
== tcc_vl_exp
)
11918 if (code
== CALL_EXPR
)
11920 tem
= fold_call_expr (loc
, expr
, false);
11921 return tem
? tem
: expr
;
11926 if (IS_EXPR_CODE_CLASS (kind
))
11928 tree type
= TREE_TYPE (t
);
11929 tree op0
, op1
, op2
;
11931 switch (TREE_CODE_LENGTH (code
))
11934 op0
= TREE_OPERAND (t
, 0);
11935 tem
= fold_unary_loc (loc
, code
, type
, op0
);
11936 return tem
? tem
: expr
;
11938 op0
= TREE_OPERAND (t
, 0);
11939 op1
= TREE_OPERAND (t
, 1);
11940 tem
= fold_binary_loc (loc
, code
, type
, op0
, op1
);
11941 return tem
? tem
: expr
;
11943 op0
= TREE_OPERAND (t
, 0);
11944 op1
= TREE_OPERAND (t
, 1);
11945 op2
= TREE_OPERAND (t
, 2);
11946 tem
= fold_ternary_loc (loc
, code
, type
, op0
, op1
, op2
);
11947 return tem
? tem
: expr
;
11957 tree op0
= TREE_OPERAND (t
, 0);
11958 tree op1
= TREE_OPERAND (t
, 1);
11960 if (TREE_CODE (op1
) == INTEGER_CST
11961 && TREE_CODE (op0
) == CONSTRUCTOR
11962 && ! type_contains_placeholder_p (TREE_TYPE (op0
)))
11964 tree val
= get_array_ctor_element_at_index (op0
,
11965 wi::to_offset (op1
));
11973 /* Return a VECTOR_CST if possible. */
11976 tree type
= TREE_TYPE (t
);
11977 if (TREE_CODE (type
) != VECTOR_TYPE
)
11982 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (t
), i
, val
)
11983 if (! CONSTANT_CLASS_P (val
))
11986 return build_vector_from_ctor (type
, CONSTRUCTOR_ELTS (t
));
11990 return fold (DECL_INITIAL (t
));
11994 } /* switch (code) */
11997 #ifdef ENABLE_FOLD_CHECKING
12000 static void fold_checksum_tree (const_tree
, struct md5_ctx
*,
12001 hash_table
<nofree_ptr_hash
<const tree_node
> > *);
12002 static void fold_check_failed (const_tree
, const_tree
);
12003 void print_fold_checksum (const_tree
);
12005 /* When --enable-checking=fold, compute a digest of expr before
12006 and after actual fold call to see if fold did not accidentally
12007 change original expr. */
12013 struct md5_ctx ctx
;
12014 unsigned char checksum_before
[16], checksum_after
[16];
12015 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12017 md5_init_ctx (&ctx
);
12018 fold_checksum_tree (expr
, &ctx
, &ht
);
12019 md5_finish_ctx (&ctx
, checksum_before
);
12022 ret
= fold_1 (expr
);
12024 md5_init_ctx (&ctx
);
12025 fold_checksum_tree (expr
, &ctx
, &ht
);
12026 md5_finish_ctx (&ctx
, checksum_after
);
12028 if (memcmp (checksum_before
, checksum_after
, 16))
12029 fold_check_failed (expr
, ret
);
12035 print_fold_checksum (const_tree expr
)
12037 struct md5_ctx ctx
;
12038 unsigned char checksum
[16], cnt
;
12039 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12041 md5_init_ctx (&ctx
);
12042 fold_checksum_tree (expr
, &ctx
, &ht
);
12043 md5_finish_ctx (&ctx
, checksum
);
12044 for (cnt
= 0; cnt
< 16; ++cnt
)
12045 fprintf (stderr
, "%02x", checksum
[cnt
]);
12046 putc ('\n', stderr
);
12050 fold_check_failed (const_tree expr ATTRIBUTE_UNUSED
, const_tree ret ATTRIBUTE_UNUSED
)
12052 internal_error ("fold check: original tree changed by fold");
12056 fold_checksum_tree (const_tree expr
, struct md5_ctx
*ctx
,
12057 hash_table
<nofree_ptr_hash
<const tree_node
> > *ht
)
12059 const tree_node
**slot
;
12060 enum tree_code code
;
12061 union tree_node buf
;
12067 slot
= ht
->find_slot (expr
, INSERT
);
12071 code
= TREE_CODE (expr
);
12072 if (TREE_CODE_CLASS (code
) == tcc_declaration
12073 && HAS_DECL_ASSEMBLER_NAME_P (expr
))
12075 /* Allow DECL_ASSEMBLER_NAME and symtab_node to be modified. */
12076 memcpy ((char *) &buf
, expr
, tree_size (expr
));
12077 SET_DECL_ASSEMBLER_NAME ((tree
)&buf
, NULL
);
12078 buf
.decl_with_vis
.symtab_node
= NULL
;
12079 expr
= (tree
) &buf
;
12081 else if (TREE_CODE_CLASS (code
) == tcc_type
12082 && (TYPE_POINTER_TO (expr
)
12083 || TYPE_REFERENCE_TO (expr
)
12084 || TYPE_CACHED_VALUES_P (expr
)
12085 || TYPE_CONTAINS_PLACEHOLDER_INTERNAL (expr
)
12086 || TYPE_NEXT_VARIANT (expr
)
12087 || TYPE_ALIAS_SET_KNOWN_P (expr
)))
12089 /* Allow these fields to be modified. */
12091 memcpy ((char *) &buf
, expr
, tree_size (expr
));
12092 expr
= tmp
= (tree
) &buf
;
12093 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (tmp
) = 0;
12094 TYPE_POINTER_TO (tmp
) = NULL
;
12095 TYPE_REFERENCE_TO (tmp
) = NULL
;
12096 TYPE_NEXT_VARIANT (tmp
) = NULL
;
12097 TYPE_ALIAS_SET (tmp
) = -1;
12098 if (TYPE_CACHED_VALUES_P (tmp
))
12100 TYPE_CACHED_VALUES_P (tmp
) = 0;
12101 TYPE_CACHED_VALUES (tmp
) = NULL
;
12104 md5_process_bytes (expr
, tree_size (expr
), ctx
);
12105 if (CODE_CONTAINS_STRUCT (code
, TS_TYPED
))
12106 fold_checksum_tree (TREE_TYPE (expr
), ctx
, ht
);
12107 if (TREE_CODE_CLASS (code
) != tcc_type
12108 && TREE_CODE_CLASS (code
) != tcc_declaration
12109 && code
!= TREE_LIST
12110 && code
!= SSA_NAME
12111 && CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
12112 fold_checksum_tree (TREE_CHAIN (expr
), ctx
, ht
);
12113 switch (TREE_CODE_CLASS (code
))
12119 md5_process_bytes (TREE_STRING_POINTER (expr
),
12120 TREE_STRING_LENGTH (expr
), ctx
);
12123 fold_checksum_tree (TREE_REALPART (expr
), ctx
, ht
);
12124 fold_checksum_tree (TREE_IMAGPART (expr
), ctx
, ht
);
12127 len
= vector_cst_encoded_nelts (expr
);
12128 for (i
= 0; i
< len
; ++i
)
12129 fold_checksum_tree (VECTOR_CST_ENCODED_ELT (expr
, i
), ctx
, ht
);
12135 case tcc_exceptional
:
12139 fold_checksum_tree (TREE_PURPOSE (expr
), ctx
, ht
);
12140 fold_checksum_tree (TREE_VALUE (expr
), ctx
, ht
);
12141 expr
= TREE_CHAIN (expr
);
12142 goto recursive_label
;
12145 for (i
= 0; i
< TREE_VEC_LENGTH (expr
); ++i
)
12146 fold_checksum_tree (TREE_VEC_ELT (expr
, i
), ctx
, ht
);
12152 case tcc_expression
:
12153 case tcc_reference
:
12154 case tcc_comparison
:
12157 case tcc_statement
:
12159 len
= TREE_OPERAND_LENGTH (expr
);
12160 for (i
= 0; i
< len
; ++i
)
12161 fold_checksum_tree (TREE_OPERAND (expr
, i
), ctx
, ht
);
12163 case tcc_declaration
:
12164 fold_checksum_tree (DECL_NAME (expr
), ctx
, ht
);
12165 fold_checksum_tree (DECL_CONTEXT (expr
), ctx
, ht
);
12166 if (CODE_CONTAINS_STRUCT (TREE_CODE (expr
), TS_DECL_COMMON
))
12168 fold_checksum_tree (DECL_SIZE (expr
), ctx
, ht
);
12169 fold_checksum_tree (DECL_SIZE_UNIT (expr
), ctx
, ht
);
12170 fold_checksum_tree (DECL_INITIAL (expr
), ctx
, ht
);
12171 fold_checksum_tree (DECL_ABSTRACT_ORIGIN (expr
), ctx
, ht
);
12172 fold_checksum_tree (DECL_ATTRIBUTES (expr
), ctx
, ht
);
12175 if (CODE_CONTAINS_STRUCT (TREE_CODE (expr
), TS_DECL_NON_COMMON
))
12177 if (TREE_CODE (expr
) == FUNCTION_DECL
)
12179 fold_checksum_tree (DECL_VINDEX (expr
), ctx
, ht
);
12180 fold_checksum_tree (DECL_ARGUMENTS (expr
), ctx
, ht
);
12182 fold_checksum_tree (DECL_RESULT_FLD (expr
), ctx
, ht
);
12186 if (TREE_CODE (expr
) == ENUMERAL_TYPE
)
12187 fold_checksum_tree (TYPE_VALUES (expr
), ctx
, ht
);
12188 fold_checksum_tree (TYPE_SIZE (expr
), ctx
, ht
);
12189 fold_checksum_tree (TYPE_SIZE_UNIT (expr
), ctx
, ht
);
12190 fold_checksum_tree (TYPE_ATTRIBUTES (expr
), ctx
, ht
);
12191 fold_checksum_tree (TYPE_NAME (expr
), ctx
, ht
);
12192 if (INTEGRAL_TYPE_P (expr
)
12193 || SCALAR_FLOAT_TYPE_P (expr
))
12195 fold_checksum_tree (TYPE_MIN_VALUE (expr
), ctx
, ht
);
12196 fold_checksum_tree (TYPE_MAX_VALUE (expr
), ctx
, ht
);
12198 fold_checksum_tree (TYPE_MAIN_VARIANT (expr
), ctx
, ht
);
12199 if (TREE_CODE (expr
) == RECORD_TYPE
12200 || TREE_CODE (expr
) == UNION_TYPE
12201 || TREE_CODE (expr
) == QUAL_UNION_TYPE
)
12202 fold_checksum_tree (TYPE_BINFO (expr
), ctx
, ht
);
12203 fold_checksum_tree (TYPE_CONTEXT (expr
), ctx
, ht
);
12210 /* Helper function for outputting the checksum of a tree T. When
12211 debugging with gdb, you can "define mynext" to be "next" followed
12212 by "call debug_fold_checksum (op0)", then just trace down till the
12215 DEBUG_FUNCTION
void
12216 debug_fold_checksum (const_tree t
)
12219 unsigned char checksum
[16];
12220 struct md5_ctx ctx
;
12221 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12223 md5_init_ctx (&ctx
);
12224 fold_checksum_tree (t
, &ctx
, &ht
);
12225 md5_finish_ctx (&ctx
, checksum
);
12228 for (i
= 0; i
< 16; i
++)
12229 fprintf (stderr
, "%d ", checksum
[i
]);
12231 fprintf (stderr
, "\n");
12236 /* Fold a unary tree expression with code CODE of type TYPE with an
12237 operand OP0. LOC is the location of the resulting expression.
12238 Return a folded expression if successful. Otherwise, return a tree
12239 expression with code CODE of type TYPE with an operand OP0. */
12242 fold_build1_loc (location_t loc
,
12243 enum tree_code code
, tree type
, tree op0 MEM_STAT_DECL
)
12246 #ifdef ENABLE_FOLD_CHECKING
12247 unsigned char checksum_before
[16], checksum_after
[16];
12248 struct md5_ctx ctx
;
12249 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12251 md5_init_ctx (&ctx
);
12252 fold_checksum_tree (op0
, &ctx
, &ht
);
12253 md5_finish_ctx (&ctx
, checksum_before
);
12257 tem
= fold_unary_loc (loc
, code
, type
, op0
);
12259 tem
= build1_loc (loc
, code
, type
, op0 PASS_MEM_STAT
);
12261 #ifdef ENABLE_FOLD_CHECKING
12262 md5_init_ctx (&ctx
);
12263 fold_checksum_tree (op0
, &ctx
, &ht
);
12264 md5_finish_ctx (&ctx
, checksum_after
);
12266 if (memcmp (checksum_before
, checksum_after
, 16))
12267 fold_check_failed (op0
, tem
);
12272 /* Fold a binary tree expression with code CODE of type TYPE with
12273 operands OP0 and OP1. LOC is the location of the resulting
12274 expression. Return a folded expression if successful. Otherwise,
12275 return a tree expression with code CODE of type TYPE with operands
12279 fold_build2_loc (location_t loc
,
12280 enum tree_code code
, tree type
, tree op0
, tree op1
12284 #ifdef ENABLE_FOLD_CHECKING
12285 unsigned char checksum_before_op0
[16],
12286 checksum_before_op1
[16],
12287 checksum_after_op0
[16],
12288 checksum_after_op1
[16];
12289 struct md5_ctx ctx
;
12290 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12292 md5_init_ctx (&ctx
);
12293 fold_checksum_tree (op0
, &ctx
, &ht
);
12294 md5_finish_ctx (&ctx
, checksum_before_op0
);
12297 md5_init_ctx (&ctx
);
12298 fold_checksum_tree (op1
, &ctx
, &ht
);
12299 md5_finish_ctx (&ctx
, checksum_before_op1
);
12303 tem
= fold_binary_loc (loc
, code
, type
, op0
, op1
);
12305 tem
= build2_loc (loc
, code
, type
, op0
, op1 PASS_MEM_STAT
);
12307 #ifdef ENABLE_FOLD_CHECKING
12308 md5_init_ctx (&ctx
);
12309 fold_checksum_tree (op0
, &ctx
, &ht
);
12310 md5_finish_ctx (&ctx
, checksum_after_op0
);
12313 if (memcmp (checksum_before_op0
, checksum_after_op0
, 16))
12314 fold_check_failed (op0
, tem
);
12316 md5_init_ctx (&ctx
);
12317 fold_checksum_tree (op1
, &ctx
, &ht
);
12318 md5_finish_ctx (&ctx
, checksum_after_op1
);
12320 if (memcmp (checksum_before_op1
, checksum_after_op1
, 16))
12321 fold_check_failed (op1
, tem
);
12326 /* Fold a ternary tree expression with code CODE of type TYPE with
12327 operands OP0, OP1, and OP2. Return a folded expression if
12328 successful. Otherwise, return a tree expression with code CODE of
12329 type TYPE with operands OP0, OP1, and OP2. */
12332 fold_build3_loc (location_t loc
, enum tree_code code
, tree type
,
12333 tree op0
, tree op1
, tree op2 MEM_STAT_DECL
)
12336 #ifdef ENABLE_FOLD_CHECKING
12337 unsigned char checksum_before_op0
[16],
12338 checksum_before_op1
[16],
12339 checksum_before_op2
[16],
12340 checksum_after_op0
[16],
12341 checksum_after_op1
[16],
12342 checksum_after_op2
[16];
12343 struct md5_ctx ctx
;
12344 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12346 md5_init_ctx (&ctx
);
12347 fold_checksum_tree (op0
, &ctx
, &ht
);
12348 md5_finish_ctx (&ctx
, checksum_before_op0
);
12351 md5_init_ctx (&ctx
);
12352 fold_checksum_tree (op1
, &ctx
, &ht
);
12353 md5_finish_ctx (&ctx
, checksum_before_op1
);
12356 md5_init_ctx (&ctx
);
12357 fold_checksum_tree (op2
, &ctx
, &ht
);
12358 md5_finish_ctx (&ctx
, checksum_before_op2
);
12362 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
12363 tem
= fold_ternary_loc (loc
, code
, type
, op0
, op1
, op2
);
12365 tem
= build3_loc (loc
, code
, type
, op0
, op1
, op2 PASS_MEM_STAT
);
12367 #ifdef ENABLE_FOLD_CHECKING
12368 md5_init_ctx (&ctx
);
12369 fold_checksum_tree (op0
, &ctx
, &ht
);
12370 md5_finish_ctx (&ctx
, checksum_after_op0
);
12373 if (memcmp (checksum_before_op0
, checksum_after_op0
, 16))
12374 fold_check_failed (op0
, tem
);
12376 md5_init_ctx (&ctx
);
12377 fold_checksum_tree (op1
, &ctx
, &ht
);
12378 md5_finish_ctx (&ctx
, checksum_after_op1
);
12381 if (memcmp (checksum_before_op1
, checksum_after_op1
, 16))
12382 fold_check_failed (op1
, tem
);
12384 md5_init_ctx (&ctx
);
12385 fold_checksum_tree (op2
, &ctx
, &ht
);
12386 md5_finish_ctx (&ctx
, checksum_after_op2
);
12388 if (memcmp (checksum_before_op2
, checksum_after_op2
, 16))
12389 fold_check_failed (op2
, tem
);
12394 /* Fold a CALL_EXPR expression of type TYPE with operands FN and NARGS
12395 arguments in ARGARRAY, and a null static chain.
12396 Return a folded expression if successful. Otherwise, return a CALL_EXPR
12397 of type TYPE from the given operands as constructed by build_call_array. */
12400 fold_build_call_array_loc (location_t loc
, tree type
, tree fn
,
12401 int nargs
, tree
*argarray
)
12404 #ifdef ENABLE_FOLD_CHECKING
12405 unsigned char checksum_before_fn
[16],
12406 checksum_before_arglist
[16],
12407 checksum_after_fn
[16],
12408 checksum_after_arglist
[16];
12409 struct md5_ctx ctx
;
12410 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
12413 md5_init_ctx (&ctx
);
12414 fold_checksum_tree (fn
, &ctx
, &ht
);
12415 md5_finish_ctx (&ctx
, checksum_before_fn
);
12418 md5_init_ctx (&ctx
);
12419 for (i
= 0; i
< nargs
; i
++)
12420 fold_checksum_tree (argarray
[i
], &ctx
, &ht
);
12421 md5_finish_ctx (&ctx
, checksum_before_arglist
);
12425 tem
= fold_builtin_call_array (loc
, type
, fn
, nargs
, argarray
);
12427 tem
= build_call_array_loc (loc
, type
, fn
, nargs
, argarray
);
12429 #ifdef ENABLE_FOLD_CHECKING
12430 md5_init_ctx (&ctx
);
12431 fold_checksum_tree (fn
, &ctx
, &ht
);
12432 md5_finish_ctx (&ctx
, checksum_after_fn
);
12435 if (memcmp (checksum_before_fn
, checksum_after_fn
, 16))
12436 fold_check_failed (fn
, tem
);
12438 md5_init_ctx (&ctx
);
12439 for (i
= 0; i
< nargs
; i
++)
12440 fold_checksum_tree (argarray
[i
], &ctx
, &ht
);
12441 md5_finish_ctx (&ctx
, checksum_after_arglist
);
12443 if (memcmp (checksum_before_arglist
, checksum_after_arglist
, 16))
12444 fold_check_failed (NULL_TREE
, tem
);
12449 /* Perform constant folding and related simplification of initializer
12450 expression EXPR. These behave identically to "fold_buildN" but ignore
12451 potential run-time traps and exceptions that fold must preserve. */
12453 #define START_FOLD_INIT \
12454 int saved_signaling_nans = flag_signaling_nans;\
12455 int saved_trapping_math = flag_trapping_math;\
12456 int saved_rounding_math = flag_rounding_math;\
12457 int saved_trapv = flag_trapv;\
12458 int saved_folding_initializer = folding_initializer;\
12459 flag_signaling_nans = 0;\
12460 flag_trapping_math = 0;\
12461 flag_rounding_math = 0;\
12463 folding_initializer = 1;
12465 #define END_FOLD_INIT \
12466 flag_signaling_nans = saved_signaling_nans;\
12467 flag_trapping_math = saved_trapping_math;\
12468 flag_rounding_math = saved_rounding_math;\
12469 flag_trapv = saved_trapv;\
12470 folding_initializer = saved_folding_initializer;
12473 fold_build1_initializer_loc (location_t loc
, enum tree_code code
,
12474 tree type
, tree op
)
12479 result
= fold_build1_loc (loc
, code
, type
, op
);
12486 fold_build2_initializer_loc (location_t loc
, enum tree_code code
,
12487 tree type
, tree op0
, tree op1
)
12492 result
= fold_build2_loc (loc
, code
, type
, op0
, op1
);
12499 fold_build_call_array_initializer_loc (location_t loc
, tree type
, tree fn
,
12500 int nargs
, tree
*argarray
)
12505 result
= fold_build_call_array_loc (loc
, type
, fn
, nargs
, argarray
);
12511 #undef START_FOLD_INIT
12512 #undef END_FOLD_INIT
12514 /* Determine if first argument is a multiple of second argument. Return 0 if
12515 it is not, or we cannot easily determined it to be.
12517 An example of the sort of thing we care about (at this point; this routine
12518 could surely be made more general, and expanded to do what the *_DIV_EXPR's
12519 fold cases do now) is discovering that
12521 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
12527 when we know that the two SAVE_EXPR (J * 8) nodes are the same node.
12529 This code also handles discovering that
12531 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
12533 is a multiple of 8 so we don't have to worry about dealing with a
12534 possible remainder.
12536 Note that we *look* inside a SAVE_EXPR only to determine how it was
12537 calculated; it is not safe for fold to do much of anything else with the
12538 internals of a SAVE_EXPR, since it cannot know when it will be evaluated
12539 at run time. For example, the latter example above *cannot* be implemented
12540 as SAVE_EXPR (I) * J or any variant thereof, since the value of J at
12541 evaluation time of the original SAVE_EXPR is not necessarily the same at
12542 the time the new expression is evaluated. The only optimization of this
12543 sort that would be valid is changing
12545 SAVE_EXPR (I) * SAVE_EXPR (SAVE_EXPR (J) * 8)
12549 SAVE_EXPR (I) * SAVE_EXPR (J)
12551 (where the same SAVE_EXPR (J) is used in the original and the
12552 transformed version). */
12555 multiple_of_p (tree type
, const_tree top
, const_tree bottom
)
12560 if (operand_equal_p (top
, bottom
, 0))
12563 if (TREE_CODE (type
) != INTEGER_TYPE
)
12566 switch (TREE_CODE (top
))
12569 /* Bitwise and provides a power of two multiple. If the mask is
12570 a multiple of BOTTOM then TOP is a multiple of BOTTOM. */
12571 if (!integer_pow2p (bottom
))
12576 return (multiple_of_p (type
, TREE_OPERAND (top
, 1), bottom
)
12577 || multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
));
12580 /* It is impossible to prove if op0 - op1 is multiple of bottom
12581 precisely, so be conservative here checking if both op0 and op1
12582 are multiple of bottom. Note we check the second operand first
12583 since it's usually simpler. */
12584 return (multiple_of_p (type
, TREE_OPERAND (top
, 1), bottom
)
12585 && multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
));
12588 /* The same as MINUS_EXPR, but handle cases like op0 + 0xfffffffd
12589 as op0 - 3 if the expression has unsigned type. For example,
12590 (X / 3) + 0xfffffffd is multiple of 3, but 0xfffffffd is not. */
12591 op1
= TREE_OPERAND (top
, 1);
12592 if (TYPE_UNSIGNED (type
)
12593 && TREE_CODE (op1
) == INTEGER_CST
&& tree_int_cst_sign_bit (op1
))
12594 op1
= fold_build1 (NEGATE_EXPR
, type
, op1
);
12595 return (multiple_of_p (type
, op1
, bottom
)
12596 && multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
));
12599 if (TREE_CODE (TREE_OPERAND (top
, 1)) == INTEGER_CST
)
12601 op1
= TREE_OPERAND (top
, 1);
12602 /* const_binop may not detect overflow correctly,
12603 so check for it explicitly here. */
12604 if (wi::gtu_p (TYPE_PRECISION (TREE_TYPE (size_one_node
)),
12606 && (t1
= fold_convert (type
,
12607 const_binop (LSHIFT_EXPR
, size_one_node
,
12609 && !TREE_OVERFLOW (t1
))
12610 return multiple_of_p (type
, t1
, bottom
);
12615 /* Can't handle conversions from non-integral or wider integral type. */
12616 if ((TREE_CODE (TREE_TYPE (TREE_OPERAND (top
, 0))) != INTEGER_TYPE
)
12617 || (TYPE_PRECISION (type
)
12618 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (top
, 0)))))
12624 return multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
);
12627 return (multiple_of_p (type
, TREE_OPERAND (top
, 1), bottom
)
12628 && multiple_of_p (type
, TREE_OPERAND (top
, 2), bottom
));
12631 if (TREE_CODE (bottom
) != INTEGER_CST
12632 || integer_zerop (bottom
)
12633 || (TYPE_UNSIGNED (type
)
12634 && (tree_int_cst_sgn (top
) < 0
12635 || tree_int_cst_sgn (bottom
) < 0)))
12637 return wi::multiple_of_p (wi::to_widest (top
), wi::to_widest (bottom
),
12641 if (TREE_CODE (bottom
) == INTEGER_CST
12642 && (stmt
= SSA_NAME_DEF_STMT (top
)) != NULL
12643 && gimple_code (stmt
) == GIMPLE_ASSIGN
)
12645 enum tree_code code
= gimple_assign_rhs_code (stmt
);
12647 /* Check for special cases to see if top is defined as multiple
12650 top = (X & ~(bottom - 1) ; bottom is power of 2
12656 if (code
== BIT_AND_EXPR
12657 && (op2
= gimple_assign_rhs2 (stmt
)) != NULL_TREE
12658 && TREE_CODE (op2
) == INTEGER_CST
12659 && integer_pow2p (bottom
)
12660 && wi::multiple_of_p (wi::to_widest (op2
),
12661 wi::to_widest (bottom
), UNSIGNED
))
12664 op1
= gimple_assign_rhs1 (stmt
);
12665 if (code
== MINUS_EXPR
12666 && (op2
= gimple_assign_rhs2 (stmt
)) != NULL_TREE
12667 && TREE_CODE (op2
) == SSA_NAME
12668 && (stmt
= SSA_NAME_DEF_STMT (op2
)) != NULL
12669 && gimple_code (stmt
) == GIMPLE_ASSIGN
12670 && (code
= gimple_assign_rhs_code (stmt
)) == TRUNC_MOD_EXPR
12671 && operand_equal_p (op1
, gimple_assign_rhs1 (stmt
), 0)
12672 && operand_equal_p (bottom
, gimple_assign_rhs2 (stmt
), 0))
12679 if (POLY_INT_CST_P (top
) && poly_int_tree_p (bottom
))
12680 return multiple_p (wi::to_poly_widest (top
),
12681 wi::to_poly_widest (bottom
));
12687 #define tree_expr_nonnegative_warnv_p(X, Y) \
12688 _Pragma ("GCC error \"Use RECURSE for recursive calls\"") 0
12690 #define RECURSE(X) \
12691 ((tree_expr_nonnegative_warnv_p) (X, strict_overflow_p, depth + 1))
12693 /* Return true if CODE or TYPE is known to be non-negative. */
12696 tree_simple_nonnegative_warnv_p (enum tree_code code
, tree type
)
12698 if ((TYPE_PRECISION (type
) != 1 || TYPE_UNSIGNED (type
))
12699 && truth_value_p (code
))
12700 /* Truth values evaluate to 0 or 1, which is nonnegative unless we
12701 have a signed:1 type (where the value is -1 and 0). */
12706 /* Return true if (CODE OP0) is known to be non-negative. If the return
12707 value is based on the assumption that signed overflow is undefined,
12708 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12709 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12712 tree_unary_nonnegative_warnv_p (enum tree_code code
, tree type
, tree op0
,
12713 bool *strict_overflow_p
, int depth
)
12715 if (TYPE_UNSIGNED (type
))
12721 /* We can't return 1 if flag_wrapv is set because
12722 ABS_EXPR<INT_MIN> = INT_MIN. */
12723 if (!ANY_INTEGRAL_TYPE_P (type
))
12725 if (TYPE_OVERFLOW_UNDEFINED (type
))
12727 *strict_overflow_p
= true;
12732 case NON_LVALUE_EXPR
:
12734 case FIX_TRUNC_EXPR
:
12735 return RECURSE (op0
);
12739 tree inner_type
= TREE_TYPE (op0
);
12740 tree outer_type
= type
;
12742 if (TREE_CODE (outer_type
) == REAL_TYPE
)
12744 if (TREE_CODE (inner_type
) == REAL_TYPE
)
12745 return RECURSE (op0
);
12746 if (INTEGRAL_TYPE_P (inner_type
))
12748 if (TYPE_UNSIGNED (inner_type
))
12750 return RECURSE (op0
);
12753 else if (INTEGRAL_TYPE_P (outer_type
))
12755 if (TREE_CODE (inner_type
) == REAL_TYPE
)
12756 return RECURSE (op0
);
12757 if (INTEGRAL_TYPE_P (inner_type
))
12758 return TYPE_PRECISION (inner_type
) < TYPE_PRECISION (outer_type
)
12759 && TYPE_UNSIGNED (inner_type
);
12765 return tree_simple_nonnegative_warnv_p (code
, type
);
12768 /* We don't know sign of `t', so be conservative and return false. */
12772 /* Return true if (CODE OP0 OP1) is known to be non-negative. If the return
12773 value is based on the assumption that signed overflow is undefined,
12774 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12775 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12778 tree_binary_nonnegative_warnv_p (enum tree_code code
, tree type
, tree op0
,
12779 tree op1
, bool *strict_overflow_p
,
12782 if (TYPE_UNSIGNED (type
))
12787 case POINTER_PLUS_EXPR
:
12789 if (FLOAT_TYPE_P (type
))
12790 return RECURSE (op0
) && RECURSE (op1
);
12792 /* zero_extend(x) + zero_extend(y) is non-negative if x and y are
12793 both unsigned and at least 2 bits shorter than the result. */
12794 if (TREE_CODE (type
) == INTEGER_TYPE
12795 && TREE_CODE (op0
) == NOP_EXPR
12796 && TREE_CODE (op1
) == NOP_EXPR
)
12798 tree inner1
= TREE_TYPE (TREE_OPERAND (op0
, 0));
12799 tree inner2
= TREE_TYPE (TREE_OPERAND (op1
, 0));
12800 if (TREE_CODE (inner1
) == INTEGER_TYPE
&& TYPE_UNSIGNED (inner1
)
12801 && TREE_CODE (inner2
) == INTEGER_TYPE
&& TYPE_UNSIGNED (inner2
))
12803 unsigned int prec
= MAX (TYPE_PRECISION (inner1
),
12804 TYPE_PRECISION (inner2
)) + 1;
12805 return prec
< TYPE_PRECISION (type
);
12811 if (FLOAT_TYPE_P (type
) || TYPE_OVERFLOW_UNDEFINED (type
))
12813 /* x * x is always non-negative for floating point x
12814 or without overflow. */
12815 if (operand_equal_p (op0
, op1
, 0)
12816 || (RECURSE (op0
) && RECURSE (op1
)))
12818 if (ANY_INTEGRAL_TYPE_P (type
)
12819 && TYPE_OVERFLOW_UNDEFINED (type
))
12820 *strict_overflow_p
= true;
12825 /* zero_extend(x) * zero_extend(y) is non-negative if x and y are
12826 both unsigned and their total bits is shorter than the result. */
12827 if (TREE_CODE (type
) == INTEGER_TYPE
12828 && (TREE_CODE (op0
) == NOP_EXPR
|| TREE_CODE (op0
) == INTEGER_CST
)
12829 && (TREE_CODE (op1
) == NOP_EXPR
|| TREE_CODE (op1
) == INTEGER_CST
))
12831 tree inner0
= (TREE_CODE (op0
) == NOP_EXPR
)
12832 ? TREE_TYPE (TREE_OPERAND (op0
, 0))
12834 tree inner1
= (TREE_CODE (op1
) == NOP_EXPR
)
12835 ? TREE_TYPE (TREE_OPERAND (op1
, 0))
12838 bool unsigned0
= TYPE_UNSIGNED (inner0
);
12839 bool unsigned1
= TYPE_UNSIGNED (inner1
);
12841 if (TREE_CODE (op0
) == INTEGER_CST
)
12842 unsigned0
= unsigned0
|| tree_int_cst_sgn (op0
) >= 0;
12844 if (TREE_CODE (op1
) == INTEGER_CST
)
12845 unsigned1
= unsigned1
|| tree_int_cst_sgn (op1
) >= 0;
12847 if (TREE_CODE (inner0
) == INTEGER_TYPE
&& unsigned0
12848 && TREE_CODE (inner1
) == INTEGER_TYPE
&& unsigned1
)
12850 unsigned int precision0
= (TREE_CODE (op0
) == INTEGER_CST
)
12851 ? tree_int_cst_min_precision (op0
, UNSIGNED
)
12852 : TYPE_PRECISION (inner0
);
12854 unsigned int precision1
= (TREE_CODE (op1
) == INTEGER_CST
)
12855 ? tree_int_cst_min_precision (op1
, UNSIGNED
)
12856 : TYPE_PRECISION (inner1
);
12858 return precision0
+ precision1
< TYPE_PRECISION (type
);
12865 return RECURSE (op0
) || RECURSE (op1
);
12871 case TRUNC_DIV_EXPR
:
12872 case CEIL_DIV_EXPR
:
12873 case FLOOR_DIV_EXPR
:
12874 case ROUND_DIV_EXPR
:
12875 return RECURSE (op0
) && RECURSE (op1
);
12877 case TRUNC_MOD_EXPR
:
12878 return RECURSE (op0
);
12880 case FLOOR_MOD_EXPR
:
12881 return RECURSE (op1
);
12883 case CEIL_MOD_EXPR
:
12884 case ROUND_MOD_EXPR
:
12886 return tree_simple_nonnegative_warnv_p (code
, type
);
12889 /* We don't know sign of `t', so be conservative and return false. */
12893 /* Return true if T is known to be non-negative. If the return
12894 value is based on the assumption that signed overflow is undefined,
12895 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12896 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12899 tree_single_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
, int depth
)
12901 if (TYPE_UNSIGNED (TREE_TYPE (t
)))
12904 switch (TREE_CODE (t
))
12907 return tree_int_cst_sgn (t
) >= 0;
12910 return ! REAL_VALUE_NEGATIVE (TREE_REAL_CST (t
));
12913 return ! FIXED_VALUE_NEGATIVE (TREE_FIXED_CST (t
));
12916 return RECURSE (TREE_OPERAND (t
, 1)) && RECURSE (TREE_OPERAND (t
, 2));
12919 /* Limit the depth of recursion to avoid quadratic behavior.
12920 This is expected to catch almost all occurrences in practice.
12921 If this code misses important cases that unbounded recursion
12922 would not, passes that need this information could be revised
12923 to provide it through dataflow propagation. */
12924 return (!name_registered_for_update_p (t
)
12925 && depth
< PARAM_VALUE (PARAM_MAX_SSA_NAME_QUERY_DEPTH
)
12926 && gimple_stmt_nonnegative_warnv_p (SSA_NAME_DEF_STMT (t
),
12927 strict_overflow_p
, depth
));
12930 return tree_simple_nonnegative_warnv_p (TREE_CODE (t
), TREE_TYPE (t
));
12934 /* Return true if T is known to be non-negative. If the return
12935 value is based on the assumption that signed overflow is undefined,
12936 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12937 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12940 tree_call_nonnegative_warnv_p (tree type
, combined_fn fn
, tree arg0
, tree arg1
,
12941 bool *strict_overflow_p
, int depth
)
12962 case CFN_BUILT_IN_BSWAP32
:
12963 case CFN_BUILT_IN_BSWAP64
:
12969 /* sqrt(-0.0) is -0.0. */
12970 if (!HONOR_SIGNED_ZEROS (element_mode (type
)))
12972 return RECURSE (arg0
);
13000 CASE_CFN_NEARBYINT
:
13001 CASE_CFN_NEARBYINT_FN
:
13010 CASE_CFN_SIGNIFICAND
:
13015 /* True if the 1st argument is nonnegative. */
13016 return RECURSE (arg0
);
13020 /* True if the 1st OR 2nd arguments are nonnegative. */
13021 return RECURSE (arg0
) || RECURSE (arg1
);
13025 /* True if the 1st AND 2nd arguments are nonnegative. */
13026 return RECURSE (arg0
) && RECURSE (arg1
);
13029 CASE_CFN_COPYSIGN_FN
:
13030 /* True if the 2nd argument is nonnegative. */
13031 return RECURSE (arg1
);
13034 /* True if the 1st argument is nonnegative or the second
13035 argument is an even integer. */
13036 if (TREE_CODE (arg1
) == INTEGER_CST
13037 && (TREE_INT_CST_LOW (arg1
) & 1) == 0)
13039 return RECURSE (arg0
);
13042 /* True if the 1st argument is nonnegative or the second
13043 argument is an even integer valued real. */
13044 if (TREE_CODE (arg1
) == REAL_CST
)
13049 c
= TREE_REAL_CST (arg1
);
13050 n
= real_to_integer (&c
);
13053 REAL_VALUE_TYPE cint
;
13054 real_from_integer (&cint
, VOIDmode
, n
, SIGNED
);
13055 if (real_identical (&c
, &cint
))
13059 return RECURSE (arg0
);
13064 return tree_simple_nonnegative_warnv_p (CALL_EXPR
, type
);
13067 /* Return true if T is known to be non-negative. If the return
13068 value is based on the assumption that signed overflow is undefined,
13069 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13070 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13073 tree_invalid_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
, int depth
)
13075 enum tree_code code
= TREE_CODE (t
);
13076 if (TYPE_UNSIGNED (TREE_TYPE (t
)))
13083 tree temp
= TARGET_EXPR_SLOT (t
);
13084 t
= TARGET_EXPR_INITIAL (t
);
13086 /* If the initializer is non-void, then it's a normal expression
13087 that will be assigned to the slot. */
13088 if (!VOID_TYPE_P (t
))
13089 return RECURSE (t
);
13091 /* Otherwise, the initializer sets the slot in some way. One common
13092 way is an assignment statement at the end of the initializer. */
13095 if (TREE_CODE (t
) == BIND_EXPR
)
13096 t
= expr_last (BIND_EXPR_BODY (t
));
13097 else if (TREE_CODE (t
) == TRY_FINALLY_EXPR
13098 || TREE_CODE (t
) == TRY_CATCH_EXPR
)
13099 t
= expr_last (TREE_OPERAND (t
, 0));
13100 else if (TREE_CODE (t
) == STATEMENT_LIST
)
13105 if (TREE_CODE (t
) == MODIFY_EXPR
13106 && TREE_OPERAND (t
, 0) == temp
)
13107 return RECURSE (TREE_OPERAND (t
, 1));
13114 tree arg0
= call_expr_nargs (t
) > 0 ? CALL_EXPR_ARG (t
, 0) : NULL_TREE
;
13115 tree arg1
= call_expr_nargs (t
) > 1 ? CALL_EXPR_ARG (t
, 1) : NULL_TREE
;
13117 return tree_call_nonnegative_warnv_p (TREE_TYPE (t
),
13118 get_call_combined_fn (t
),
13121 strict_overflow_p
, depth
);
13123 case COMPOUND_EXPR
:
13125 return RECURSE (TREE_OPERAND (t
, 1));
13128 return RECURSE (expr_last (TREE_OPERAND (t
, 1)));
13131 return RECURSE (TREE_OPERAND (t
, 0));
13134 return tree_simple_nonnegative_warnv_p (TREE_CODE (t
), TREE_TYPE (t
));
13139 #undef tree_expr_nonnegative_warnv_p
13141 /* Return true if T is known to be non-negative. If the return
13142 value is based on the assumption that signed overflow is undefined,
13143 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13144 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13147 tree_expr_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
, int depth
)
13149 enum tree_code code
;
13150 if (t
== error_mark_node
)
13153 code
= TREE_CODE (t
);
13154 switch (TREE_CODE_CLASS (code
))
13157 case tcc_comparison
:
13158 return tree_binary_nonnegative_warnv_p (TREE_CODE (t
),
13160 TREE_OPERAND (t
, 0),
13161 TREE_OPERAND (t
, 1),
13162 strict_overflow_p
, depth
);
13165 return tree_unary_nonnegative_warnv_p (TREE_CODE (t
),
13167 TREE_OPERAND (t
, 0),
13168 strict_overflow_p
, depth
);
13171 case tcc_declaration
:
13172 case tcc_reference
:
13173 return tree_single_nonnegative_warnv_p (t
, strict_overflow_p
, depth
);
13181 case TRUTH_AND_EXPR
:
13182 case TRUTH_OR_EXPR
:
13183 case TRUTH_XOR_EXPR
:
13184 return tree_binary_nonnegative_warnv_p (TREE_CODE (t
),
13186 TREE_OPERAND (t
, 0),
13187 TREE_OPERAND (t
, 1),
13188 strict_overflow_p
, depth
);
13189 case TRUTH_NOT_EXPR
:
13190 return tree_unary_nonnegative_warnv_p (TREE_CODE (t
),
13192 TREE_OPERAND (t
, 0),
13193 strict_overflow_p
, depth
);
13200 case WITH_SIZE_EXPR
:
13202 return tree_single_nonnegative_warnv_p (t
, strict_overflow_p
, depth
);
13205 return tree_invalid_nonnegative_warnv_p (t
, strict_overflow_p
, depth
);
13209 /* Return true if `t' is known to be non-negative. Handle warnings
13210 about undefined signed overflow. */
13213 tree_expr_nonnegative_p (tree t
)
13215 bool ret
, strict_overflow_p
;
13217 strict_overflow_p
= false;
13218 ret
= tree_expr_nonnegative_warnv_p (t
, &strict_overflow_p
);
13219 if (strict_overflow_p
)
13220 fold_overflow_warning (("assuming signed overflow does not occur when "
13221 "determining that expression is always "
13223 WARN_STRICT_OVERFLOW_MISC
);
13228 /* Return true when (CODE OP0) is an address and is known to be nonzero.
13229 For floating point we further ensure that T is not denormal.
13230 Similar logic is present in nonzero_address in rtlanal.h.
13232 If the return value is based on the assumption that signed overflow
13233 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13234 change *STRICT_OVERFLOW_P. */
13237 tree_unary_nonzero_warnv_p (enum tree_code code
, tree type
, tree op0
,
13238 bool *strict_overflow_p
)
13243 return tree_expr_nonzero_warnv_p (op0
,
13244 strict_overflow_p
);
13248 tree inner_type
= TREE_TYPE (op0
);
13249 tree outer_type
= type
;
13251 return (TYPE_PRECISION (outer_type
) >= TYPE_PRECISION (inner_type
)
13252 && tree_expr_nonzero_warnv_p (op0
,
13253 strict_overflow_p
));
13257 case NON_LVALUE_EXPR
:
13258 return tree_expr_nonzero_warnv_p (op0
,
13259 strict_overflow_p
);
13268 /* Return true when (CODE OP0 OP1) is an address and is known to be nonzero.
13269 For floating point we further ensure that T is not denormal.
13270 Similar logic is present in nonzero_address in rtlanal.h.
13272 If the return value is based on the assumption that signed overflow
13273 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13274 change *STRICT_OVERFLOW_P. */
13277 tree_binary_nonzero_warnv_p (enum tree_code code
,
13280 tree op1
, bool *strict_overflow_p
)
13282 bool sub_strict_overflow_p
;
13285 case POINTER_PLUS_EXPR
:
13287 if (ANY_INTEGRAL_TYPE_P (type
) && TYPE_OVERFLOW_UNDEFINED (type
))
13289 /* With the presence of negative values it is hard
13290 to say something. */
13291 sub_strict_overflow_p
= false;
13292 if (!tree_expr_nonnegative_warnv_p (op0
,
13293 &sub_strict_overflow_p
)
13294 || !tree_expr_nonnegative_warnv_p (op1
,
13295 &sub_strict_overflow_p
))
13297 /* One of operands must be positive and the other non-negative. */
13298 /* We don't set *STRICT_OVERFLOW_P here: even if this value
13299 overflows, on a twos-complement machine the sum of two
13300 nonnegative numbers can never be zero. */
13301 return (tree_expr_nonzero_warnv_p (op0
,
13303 || tree_expr_nonzero_warnv_p (op1
,
13304 strict_overflow_p
));
13309 if (TYPE_OVERFLOW_UNDEFINED (type
))
13311 if (tree_expr_nonzero_warnv_p (op0
,
13313 && tree_expr_nonzero_warnv_p (op1
,
13314 strict_overflow_p
))
13316 *strict_overflow_p
= true;
13323 sub_strict_overflow_p
= false;
13324 if (tree_expr_nonzero_warnv_p (op0
,
13325 &sub_strict_overflow_p
)
13326 && tree_expr_nonzero_warnv_p (op1
,
13327 &sub_strict_overflow_p
))
13329 if (sub_strict_overflow_p
)
13330 *strict_overflow_p
= true;
13335 sub_strict_overflow_p
= false;
13336 if (tree_expr_nonzero_warnv_p (op0
,
13337 &sub_strict_overflow_p
))
13339 if (sub_strict_overflow_p
)
13340 *strict_overflow_p
= true;
13342 /* When both operands are nonzero, then MAX must be too. */
13343 if (tree_expr_nonzero_warnv_p (op1
,
13344 strict_overflow_p
))
13347 /* MAX where operand 0 is positive is positive. */
13348 return tree_expr_nonnegative_warnv_p (op0
,
13349 strict_overflow_p
);
13351 /* MAX where operand 1 is positive is positive. */
13352 else if (tree_expr_nonzero_warnv_p (op1
,
13353 &sub_strict_overflow_p
)
13354 && tree_expr_nonnegative_warnv_p (op1
,
13355 &sub_strict_overflow_p
))
13357 if (sub_strict_overflow_p
)
13358 *strict_overflow_p
= true;
13364 return (tree_expr_nonzero_warnv_p (op1
,
13366 || tree_expr_nonzero_warnv_p (op0
,
13367 strict_overflow_p
));
13376 /* Return true when T is an address and is known to be nonzero.
13377 For floating point we further ensure that T is not denormal.
13378 Similar logic is present in nonzero_address in rtlanal.h.
13380 If the return value is based on the assumption that signed overflow
13381 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13382 change *STRICT_OVERFLOW_P. */
13385 tree_single_nonzero_warnv_p (tree t
, bool *strict_overflow_p
)
13387 bool sub_strict_overflow_p
;
13388 switch (TREE_CODE (t
))
13391 return !integer_zerop (t
);
13395 tree base
= TREE_OPERAND (t
, 0);
13397 if (!DECL_P (base
))
13398 base
= get_base_address (base
);
13400 if (base
&& TREE_CODE (base
) == TARGET_EXPR
)
13401 base
= TARGET_EXPR_SLOT (base
);
13406 /* For objects in symbol table check if we know they are non-zero.
13407 Don't do anything for variables and functions before symtab is built;
13408 it is quite possible that they will be declared weak later. */
13409 int nonzero_addr
= maybe_nonzero_address (base
);
13410 if (nonzero_addr
>= 0)
13411 return nonzero_addr
;
13413 /* Constants are never weak. */
13414 if (CONSTANT_CLASS_P (base
))
13421 sub_strict_overflow_p
= false;
13422 if (tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 1),
13423 &sub_strict_overflow_p
)
13424 && tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 2),
13425 &sub_strict_overflow_p
))
13427 if (sub_strict_overflow_p
)
13428 *strict_overflow_p
= true;
13434 if (!INTEGRAL_TYPE_P (TREE_TYPE (t
)))
13436 return expr_not_equal_to (t
, wi::zero (TYPE_PRECISION (TREE_TYPE (t
))));
13444 #define integer_valued_real_p(X) \
13445 _Pragma ("GCC error \"Use RECURSE for recursive calls\"") 0
13447 #define RECURSE(X) \
13448 ((integer_valued_real_p) (X, depth + 1))
13450 /* Return true if the floating point result of (CODE OP0) has an
13451 integer value. We also allow +Inf, -Inf and NaN to be considered
13452 integer values. Return false for signaling NaN.
13454 DEPTH is the current nesting depth of the query. */
13457 integer_valued_real_unary_p (tree_code code
, tree op0
, int depth
)
13465 return RECURSE (op0
);
13469 tree type
= TREE_TYPE (op0
);
13470 if (TREE_CODE (type
) == INTEGER_TYPE
)
13472 if (TREE_CODE (type
) == REAL_TYPE
)
13473 return RECURSE (op0
);
13483 /* Return true if the floating point result of (CODE OP0 OP1) has an
13484 integer value. We also allow +Inf, -Inf and NaN to be considered
13485 integer values. Return false for signaling NaN.
13487 DEPTH is the current nesting depth of the query. */
13490 integer_valued_real_binary_p (tree_code code
, tree op0
, tree op1
, int depth
)
13499 return RECURSE (op0
) && RECURSE (op1
);
13507 /* Return true if the floating point result of calling FNDECL with arguments
13508 ARG0 and ARG1 has an integer value. We also allow +Inf, -Inf and NaN to be
13509 considered integer values. Return false for signaling NaN. If FNDECL
13510 takes fewer than 2 arguments, the remaining ARGn are null.
13512 DEPTH is the current nesting depth of the query. */
13515 integer_valued_real_call_p (combined_fn fn
, tree arg0
, tree arg1
, int depth
)
13523 CASE_CFN_NEARBYINT
:
13524 CASE_CFN_NEARBYINT_FN
:
13537 return RECURSE (arg0
) && RECURSE (arg1
);
13545 /* Return true if the floating point expression T (a GIMPLE_SINGLE_RHS)
13546 has an integer value. We also allow +Inf, -Inf and NaN to be
13547 considered integer values. Return false for signaling NaN.
13549 DEPTH is the current nesting depth of the query. */
13552 integer_valued_real_single_p (tree t
, int depth
)
13554 switch (TREE_CODE (t
))
13557 return real_isinteger (TREE_REAL_CST_PTR (t
), TYPE_MODE (TREE_TYPE (t
)));
13560 return RECURSE (TREE_OPERAND (t
, 1)) && RECURSE (TREE_OPERAND (t
, 2));
13563 /* Limit the depth of recursion to avoid quadratic behavior.
13564 This is expected to catch almost all occurrences in practice.
13565 If this code misses important cases that unbounded recursion
13566 would not, passes that need this information could be revised
13567 to provide it through dataflow propagation. */
13568 return (!name_registered_for_update_p (t
)
13569 && depth
< PARAM_VALUE (PARAM_MAX_SSA_NAME_QUERY_DEPTH
)
13570 && gimple_stmt_integer_valued_real_p (SSA_NAME_DEF_STMT (t
),
13579 /* Return true if the floating point expression T (a GIMPLE_INVALID_RHS)
13580 has an integer value. We also allow +Inf, -Inf and NaN to be
13581 considered integer values. Return false for signaling NaN.
13583 DEPTH is the current nesting depth of the query. */
13586 integer_valued_real_invalid_p (tree t
, int depth
)
13588 switch (TREE_CODE (t
))
13590 case COMPOUND_EXPR
:
13593 return RECURSE (TREE_OPERAND (t
, 1));
13596 return RECURSE (TREE_OPERAND (t
, 0));
13605 #undef integer_valued_real_p
13607 /* Return true if the floating point expression T has an integer value.
13608 We also allow +Inf, -Inf and NaN to be considered integer values.
13609 Return false for signaling NaN.
13611 DEPTH is the current nesting depth of the query. */
13614 integer_valued_real_p (tree t
, int depth
)
13616 if (t
== error_mark_node
)
13619 tree_code code
= TREE_CODE (t
);
13620 switch (TREE_CODE_CLASS (code
))
13623 case tcc_comparison
:
13624 return integer_valued_real_binary_p (code
, TREE_OPERAND (t
, 0),
13625 TREE_OPERAND (t
, 1), depth
);
13628 return integer_valued_real_unary_p (code
, TREE_OPERAND (t
, 0), depth
);
13631 case tcc_declaration
:
13632 case tcc_reference
:
13633 return integer_valued_real_single_p (t
, depth
);
13643 return integer_valued_real_single_p (t
, depth
);
13647 tree arg0
= (call_expr_nargs (t
) > 0
13648 ? CALL_EXPR_ARG (t
, 0)
13650 tree arg1
= (call_expr_nargs (t
) > 1
13651 ? CALL_EXPR_ARG (t
, 1)
13653 return integer_valued_real_call_p (get_call_combined_fn (t
),
13654 arg0
, arg1
, depth
);
13658 return integer_valued_real_invalid_p (t
, depth
);
13662 /* Given the components of a binary expression CODE, TYPE, OP0 and OP1,
13663 attempt to fold the expression to a constant without modifying TYPE,
13666 If the expression could be simplified to a constant, then return
13667 the constant. If the expression would not be simplified to a
13668 constant, then return NULL_TREE. */
13671 fold_binary_to_constant (enum tree_code code
, tree type
, tree op0
, tree op1
)
13673 tree tem
= fold_binary (code
, type
, op0
, op1
);
13674 return (tem
&& TREE_CONSTANT (tem
)) ? tem
: NULL_TREE
;
13677 /* Given the components of a unary expression CODE, TYPE and OP0,
13678 attempt to fold the expression to a constant without modifying
13681 If the expression could be simplified to a constant, then return
13682 the constant. If the expression would not be simplified to a
13683 constant, then return NULL_TREE. */
13686 fold_unary_to_constant (enum tree_code code
, tree type
, tree op0
)
13688 tree tem
= fold_unary (code
, type
, op0
);
13689 return (tem
&& TREE_CONSTANT (tem
)) ? tem
: NULL_TREE
;
13692 /* If EXP represents referencing an element in a constant string
13693 (either via pointer arithmetic or array indexing), return the
13694 tree representing the value accessed, otherwise return NULL. */
13697 fold_read_from_constant_string (tree exp
)
13699 if ((TREE_CODE (exp
) == INDIRECT_REF
13700 || TREE_CODE (exp
) == ARRAY_REF
)
13701 && TREE_CODE (TREE_TYPE (exp
)) == INTEGER_TYPE
)
13703 tree exp1
= TREE_OPERAND (exp
, 0);
13706 location_t loc
= EXPR_LOCATION (exp
);
13708 if (TREE_CODE (exp
) == INDIRECT_REF
)
13709 string
= string_constant (exp1
, &index
);
13712 tree low_bound
= array_ref_low_bound (exp
);
13713 index
= fold_convert_loc (loc
, sizetype
, TREE_OPERAND (exp
, 1));
13715 /* Optimize the special-case of a zero lower bound.
13717 We convert the low_bound to sizetype to avoid some problems
13718 with constant folding. (E.g. suppose the lower bound is 1,
13719 and its mode is QI. Without the conversion,l (ARRAY
13720 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
13721 +INDEX), which becomes (ARRAY+255+INDEX). Oops!) */
13722 if (! integer_zerop (low_bound
))
13723 index
= size_diffop_loc (loc
, index
,
13724 fold_convert_loc (loc
, sizetype
, low_bound
));
13729 scalar_int_mode char_mode
;
13731 && TYPE_MODE (TREE_TYPE (exp
)) == TYPE_MODE (TREE_TYPE (TREE_TYPE (string
)))
13732 && TREE_CODE (string
) == STRING_CST
13733 && TREE_CODE (index
) == INTEGER_CST
13734 && compare_tree_int (index
, TREE_STRING_LENGTH (string
)) < 0
13735 && is_int_mode (TYPE_MODE (TREE_TYPE (TREE_TYPE (string
))),
13737 && GET_MODE_SIZE (char_mode
) == 1)
13738 return build_int_cst_type (TREE_TYPE (exp
),
13739 (TREE_STRING_POINTER (string
)
13740 [TREE_INT_CST_LOW (index
)]));
13745 /* Return the tree for neg (ARG0) when ARG0 is known to be either
13746 an integer constant, real, or fixed-point constant.
13748 TYPE is the type of the result. */
13751 fold_negate_const (tree arg0
, tree type
)
13753 tree t
= NULL_TREE
;
13755 switch (TREE_CODE (arg0
))
13758 t
= build_real (type
, real_value_negate (&TREE_REAL_CST (arg0
)));
13763 FIXED_VALUE_TYPE f
;
13764 bool overflow_p
= fixed_arithmetic (&f
, NEGATE_EXPR
,
13765 &(TREE_FIXED_CST (arg0
)), NULL
,
13766 TYPE_SATURATING (type
));
13767 t
= build_fixed (type
, f
);
13768 /* Propagate overflow flags. */
13769 if (overflow_p
| TREE_OVERFLOW (arg0
))
13770 TREE_OVERFLOW (t
) = 1;
13775 if (poly_int_tree_p (arg0
))
13778 poly_wide_int res
= wi::neg (wi::to_poly_wide (arg0
), &overflow
);
13779 t
= force_fit_type (type
, res
, 1,
13780 (overflow
&& ! TYPE_UNSIGNED (type
))
13781 || TREE_OVERFLOW (arg0
));
13785 gcc_unreachable ();
13791 /* Return the tree for abs (ARG0) when ARG0 is known to be either
13792 an integer constant or real constant.
13794 TYPE is the type of the result. */
13797 fold_abs_const (tree arg0
, tree type
)
13799 tree t
= NULL_TREE
;
13801 switch (TREE_CODE (arg0
))
13805 /* If the value is unsigned or non-negative, then the absolute value
13806 is the same as the ordinary value. */
13807 if (!wi::neg_p (wi::to_wide (arg0
), TYPE_SIGN (type
)))
13810 /* If the value is negative, then the absolute value is
13815 wide_int val
= wi::neg (wi::to_wide (arg0
), &overflow
);
13816 t
= force_fit_type (type
, val
, -1,
13817 overflow
| TREE_OVERFLOW (arg0
));
13823 if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg0
)))
13824 t
= build_real (type
, real_value_negate (&TREE_REAL_CST (arg0
)));
13830 gcc_unreachable ();
13836 /* Return the tree for not (ARG0) when ARG0 is known to be an integer
13837 constant. TYPE is the type of the result. */
13840 fold_not_const (const_tree arg0
, tree type
)
13842 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
);
13844 return force_fit_type (type
, ~wi::to_wide (arg0
), 0, TREE_OVERFLOW (arg0
));
13847 /* Given CODE, a relational operator, the target type, TYPE and two
13848 constant operands OP0 and OP1, return the result of the
13849 relational operation. If the result is not a compile time
13850 constant, then return NULL_TREE. */
13853 fold_relational_const (enum tree_code code
, tree type
, tree op0
, tree op1
)
13855 int result
, invert
;
13857 /* From here on, the only cases we handle are when the result is
13858 known to be a constant. */
13860 if (TREE_CODE (op0
) == REAL_CST
&& TREE_CODE (op1
) == REAL_CST
)
13862 const REAL_VALUE_TYPE
*c0
= TREE_REAL_CST_PTR (op0
);
13863 const REAL_VALUE_TYPE
*c1
= TREE_REAL_CST_PTR (op1
);
13865 /* Handle the cases where either operand is a NaN. */
13866 if (real_isnan (c0
) || real_isnan (c1
))
13876 case UNORDERED_EXPR
:
13890 if (flag_trapping_math
)
13896 gcc_unreachable ();
13899 return constant_boolean_node (result
, type
);
13902 return constant_boolean_node (real_compare (code
, c0
, c1
), type
);
13905 if (TREE_CODE (op0
) == FIXED_CST
&& TREE_CODE (op1
) == FIXED_CST
)
13907 const FIXED_VALUE_TYPE
*c0
= TREE_FIXED_CST_PTR (op0
);
13908 const FIXED_VALUE_TYPE
*c1
= TREE_FIXED_CST_PTR (op1
);
13909 return constant_boolean_node (fixed_compare (code
, c0
, c1
), type
);
13912 /* Handle equality/inequality of complex constants. */
13913 if (TREE_CODE (op0
) == COMPLEX_CST
&& TREE_CODE (op1
) == COMPLEX_CST
)
13915 tree rcond
= fold_relational_const (code
, type
,
13916 TREE_REALPART (op0
),
13917 TREE_REALPART (op1
));
13918 tree icond
= fold_relational_const (code
, type
,
13919 TREE_IMAGPART (op0
),
13920 TREE_IMAGPART (op1
));
13921 if (code
== EQ_EXPR
)
13922 return fold_build2 (TRUTH_ANDIF_EXPR
, type
, rcond
, icond
);
13923 else if (code
== NE_EXPR
)
13924 return fold_build2 (TRUTH_ORIF_EXPR
, type
, rcond
, icond
);
13929 if (TREE_CODE (op0
) == VECTOR_CST
&& TREE_CODE (op1
) == VECTOR_CST
)
13931 if (!VECTOR_TYPE_P (type
))
13933 /* Have vector comparison with scalar boolean result. */
13934 gcc_assert ((code
== EQ_EXPR
|| code
== NE_EXPR
)
13935 && VECTOR_CST_NELTS (op0
) == VECTOR_CST_NELTS (op1
));
13936 for (unsigned i
= 0; i
< VECTOR_CST_NELTS (op0
); i
++)
13938 tree elem0
= VECTOR_CST_ELT (op0
, i
);
13939 tree elem1
= VECTOR_CST_ELT (op1
, i
);
13940 tree tmp
= fold_relational_const (code
, type
, elem0
, elem1
);
13941 if (tmp
== NULL_TREE
)
13943 if (integer_zerop (tmp
))
13944 return constant_boolean_node (false, type
);
13946 return constant_boolean_node (true, type
);
13948 tree_vector_builder elts
;
13949 if (!elts
.new_binary_operation (type
, op0
, op1
, false))
13951 unsigned int count
= elts
.encoded_nelts ();
13952 for (unsigned i
= 0; i
< count
; i
++)
13954 tree elem_type
= TREE_TYPE (type
);
13955 tree elem0
= VECTOR_CST_ELT (op0
, i
);
13956 tree elem1
= VECTOR_CST_ELT (op1
, i
);
13958 tree tem
= fold_relational_const (code
, elem_type
,
13961 if (tem
== NULL_TREE
)
13964 elts
.quick_push (build_int_cst (elem_type
,
13965 integer_zerop (tem
) ? 0 : -1));
13968 return elts
.build ();
13971 /* From here on we only handle LT, LE, GT, GE, EQ and NE.
13973 To compute GT, swap the arguments and do LT.
13974 To compute GE, do LT and invert the result.
13975 To compute LE, swap the arguments, do LT and invert the result.
13976 To compute NE, do EQ and invert the result.
13978 Therefore, the code below must handle only EQ and LT. */
13980 if (code
== LE_EXPR
|| code
== GT_EXPR
)
13982 std::swap (op0
, op1
);
13983 code
= swap_tree_comparison (code
);
13986 /* Note that it is safe to invert for real values here because we
13987 have already handled the one case that it matters. */
13990 if (code
== NE_EXPR
|| code
== GE_EXPR
)
13993 code
= invert_tree_comparison (code
, false);
13996 /* Compute a result for LT or EQ if args permit;
13997 Otherwise return T. */
13998 if (TREE_CODE (op0
) == INTEGER_CST
&& TREE_CODE (op1
) == INTEGER_CST
)
14000 if (code
== EQ_EXPR
)
14001 result
= tree_int_cst_equal (op0
, op1
);
14003 result
= tree_int_cst_lt (op0
, op1
);
14010 return constant_boolean_node (result
, type
);
14013 /* If necessary, return a CLEANUP_POINT_EXPR for EXPR with the
14014 indicated TYPE. If no CLEANUP_POINT_EXPR is necessary, return EXPR
14018 fold_build_cleanup_point_expr (tree type
, tree expr
)
14020 /* If the expression does not have side effects then we don't have to wrap
14021 it with a cleanup point expression. */
14022 if (!TREE_SIDE_EFFECTS (expr
))
14025 /* If the expression is a return, check to see if the expression inside the
14026 return has no side effects or the right hand side of the modify expression
14027 inside the return. If either don't have side effects set we don't need to
14028 wrap the expression in a cleanup point expression. Note we don't check the
14029 left hand side of the modify because it should always be a return decl. */
14030 if (TREE_CODE (expr
) == RETURN_EXPR
)
14032 tree op
= TREE_OPERAND (expr
, 0);
14033 if (!op
|| !TREE_SIDE_EFFECTS (op
))
14035 op
= TREE_OPERAND (op
, 1);
14036 if (!TREE_SIDE_EFFECTS (op
))
14040 return build1_loc (EXPR_LOCATION (expr
), CLEANUP_POINT_EXPR
, type
, expr
);
14043 /* Given a pointer value OP0 and a type TYPE, return a simplified version
14044 of an indirection through OP0, or NULL_TREE if no simplification is
14048 fold_indirect_ref_1 (location_t loc
, tree type
, tree op0
)
14052 poly_uint64 const_op01
;
14055 subtype
= TREE_TYPE (sub
);
14056 if (!POINTER_TYPE_P (subtype
)
14057 || TYPE_REF_CAN_ALIAS_ALL (TREE_TYPE (op0
)))
14060 if (TREE_CODE (sub
) == ADDR_EXPR
)
14062 tree op
= TREE_OPERAND (sub
, 0);
14063 tree optype
= TREE_TYPE (op
);
14064 /* *&CONST_DECL -> to the value of the const decl. */
14065 if (TREE_CODE (op
) == CONST_DECL
)
14066 return DECL_INITIAL (op
);
14067 /* *&p => p; make sure to handle *&"str"[cst] here. */
14068 if (type
== optype
)
14070 tree fop
= fold_read_from_constant_string (op
);
14076 /* *(foo *)&fooarray => fooarray[0] */
14077 else if (TREE_CODE (optype
) == ARRAY_TYPE
14078 && type
== TREE_TYPE (optype
)
14079 && (!in_gimple_form
14080 || TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
))
14082 tree type_domain
= TYPE_DOMAIN (optype
);
14083 tree min_val
= size_zero_node
;
14084 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
14085 min_val
= TYPE_MIN_VALUE (type_domain
);
14087 && TREE_CODE (min_val
) != INTEGER_CST
)
14089 return build4_loc (loc
, ARRAY_REF
, type
, op
, min_val
,
14090 NULL_TREE
, NULL_TREE
);
14092 /* *(foo *)&complexfoo => __real__ complexfoo */
14093 else if (TREE_CODE (optype
) == COMPLEX_TYPE
14094 && type
== TREE_TYPE (optype
))
14095 return fold_build1_loc (loc
, REALPART_EXPR
, type
, op
);
14096 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
14097 else if (TREE_CODE (optype
) == VECTOR_TYPE
14098 && type
== TREE_TYPE (optype
))
14100 tree part_width
= TYPE_SIZE (type
);
14101 tree index
= bitsize_int (0);
14102 return fold_build3_loc (loc
, BIT_FIELD_REF
, type
, op
, part_width
, index
);
14106 if (TREE_CODE (sub
) == POINTER_PLUS_EXPR
14107 && poly_int_tree_p (TREE_OPERAND (sub
, 1), &const_op01
))
14109 tree op00
= TREE_OPERAND (sub
, 0);
14110 tree op01
= TREE_OPERAND (sub
, 1);
14113 if (TREE_CODE (op00
) == ADDR_EXPR
)
14116 op00
= TREE_OPERAND (op00
, 0);
14117 op00type
= TREE_TYPE (op00
);
14119 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
14120 if (TREE_CODE (op00type
) == VECTOR_TYPE
14121 && type
== TREE_TYPE (op00type
))
14123 tree part_width
= TYPE_SIZE (type
);
14124 poly_uint64 max_offset
14125 = (tree_to_uhwi (part_width
) / BITS_PER_UNIT
14126 * TYPE_VECTOR_SUBPARTS (op00type
));
14127 if (known_lt (const_op01
, max_offset
))
14129 tree index
= bitsize_int (const_op01
* BITS_PER_UNIT
);
14130 return fold_build3_loc (loc
,
14131 BIT_FIELD_REF
, type
, op00
,
14132 part_width
, index
);
14135 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
14136 else if (TREE_CODE (op00type
) == COMPLEX_TYPE
14137 && type
== TREE_TYPE (op00type
))
14139 if (known_eq (wi::to_poly_offset (TYPE_SIZE_UNIT (type
)),
14141 return fold_build1_loc (loc
, IMAGPART_EXPR
, type
, op00
);
14143 /* ((foo *)&fooarray)[1] => fooarray[1] */
14144 else if (TREE_CODE (op00type
) == ARRAY_TYPE
14145 && type
== TREE_TYPE (op00type
))
14147 tree type_domain
= TYPE_DOMAIN (op00type
);
14148 tree min
= size_zero_node
;
14149 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
14150 min
= TYPE_MIN_VALUE (type_domain
);
14151 offset_int off
= wi::to_offset (op01
);
14152 offset_int el_sz
= wi::to_offset (TYPE_SIZE_UNIT (type
));
14153 offset_int remainder
;
14154 off
= wi::divmod_trunc (off
, el_sz
, SIGNED
, &remainder
);
14155 if (remainder
== 0 && TREE_CODE (min
) == INTEGER_CST
)
14157 off
= off
+ wi::to_offset (min
);
14158 op01
= wide_int_to_tree (sizetype
, off
);
14159 return build4_loc (loc
, ARRAY_REF
, type
, op00
, op01
,
14160 NULL_TREE
, NULL_TREE
);
14166 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
14167 if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
14168 && type
== TREE_TYPE (TREE_TYPE (subtype
))
14169 && (!in_gimple_form
14170 || TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
))
14173 tree min_val
= size_zero_node
;
14174 sub
= build_fold_indirect_ref_loc (loc
, sub
);
14175 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
14176 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
14177 min_val
= TYPE_MIN_VALUE (type_domain
);
14179 && TREE_CODE (min_val
) != INTEGER_CST
)
14181 return build4_loc (loc
, ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
,
14188 /* Builds an expression for an indirection through T, simplifying some
14192 build_fold_indirect_ref_loc (location_t loc
, tree t
)
14194 tree type
= TREE_TYPE (TREE_TYPE (t
));
14195 tree sub
= fold_indirect_ref_1 (loc
, type
, t
);
14200 return build1_loc (loc
, INDIRECT_REF
, type
, t
);
14203 /* Given an INDIRECT_REF T, return either T or a simplified version. */
14206 fold_indirect_ref_loc (location_t loc
, tree t
)
14208 tree sub
= fold_indirect_ref_1 (loc
, TREE_TYPE (t
), TREE_OPERAND (t
, 0));
14216 /* Strip non-trapping, non-side-effecting tree nodes from an expression
14217 whose result is ignored. The type of the returned tree need not be
14218 the same as the original expression. */
14221 fold_ignored_result (tree t
)
14223 if (!TREE_SIDE_EFFECTS (t
))
14224 return integer_zero_node
;
14227 switch (TREE_CODE_CLASS (TREE_CODE (t
)))
14230 t
= TREE_OPERAND (t
, 0);
14234 case tcc_comparison
:
14235 if (!TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 1)))
14236 t
= TREE_OPERAND (t
, 0);
14237 else if (!TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 0)))
14238 t
= TREE_OPERAND (t
, 1);
14243 case tcc_expression
:
14244 switch (TREE_CODE (t
))
14246 case COMPOUND_EXPR
:
14247 if (TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 1)))
14249 t
= TREE_OPERAND (t
, 0);
14253 if (TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 1))
14254 || TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 2)))
14256 t
= TREE_OPERAND (t
, 0);
14269 /* Return the value of VALUE, rounded up to a multiple of DIVISOR. */
14272 round_up_loc (location_t loc
, tree value
, unsigned int divisor
)
14274 tree div
= NULL_TREE
;
14279 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
14280 have to do anything. Only do this when we are not given a const,
14281 because in that case, this check is more expensive than just
14283 if (TREE_CODE (value
) != INTEGER_CST
)
14285 div
= build_int_cst (TREE_TYPE (value
), divisor
);
14287 if (multiple_of_p (TREE_TYPE (value
), value
, div
))
14291 /* If divisor is a power of two, simplify this to bit manipulation. */
14292 if (pow2_or_zerop (divisor
))
14294 if (TREE_CODE (value
) == INTEGER_CST
)
14296 wide_int val
= wi::to_wide (value
);
14299 if ((val
& (divisor
- 1)) == 0)
14302 overflow_p
= TREE_OVERFLOW (value
);
14303 val
+= divisor
- 1;
14304 val
&= (int) -divisor
;
14308 return force_fit_type (TREE_TYPE (value
), val
, -1, overflow_p
);
14314 t
= build_int_cst (TREE_TYPE (value
), divisor
- 1);
14315 value
= size_binop_loc (loc
, PLUS_EXPR
, value
, t
);
14316 t
= build_int_cst (TREE_TYPE (value
), - (int) divisor
);
14317 value
= size_binop_loc (loc
, BIT_AND_EXPR
, value
, t
);
14323 div
= build_int_cst (TREE_TYPE (value
), divisor
);
14324 value
= size_binop_loc (loc
, CEIL_DIV_EXPR
, value
, div
);
14325 value
= size_binop_loc (loc
, MULT_EXPR
, value
, div
);
14331 /* Likewise, but round down. */
14334 round_down_loc (location_t loc
, tree value
, int divisor
)
14336 tree div
= NULL_TREE
;
14338 gcc_assert (divisor
> 0);
14342 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
14343 have to do anything. Only do this when we are not given a const,
14344 because in that case, this check is more expensive than just
14346 if (TREE_CODE (value
) != INTEGER_CST
)
14348 div
= build_int_cst (TREE_TYPE (value
), divisor
);
14350 if (multiple_of_p (TREE_TYPE (value
), value
, div
))
14354 /* If divisor is a power of two, simplify this to bit manipulation. */
14355 if (pow2_or_zerop (divisor
))
14359 t
= build_int_cst (TREE_TYPE (value
), -divisor
);
14360 value
= size_binop_loc (loc
, BIT_AND_EXPR
, value
, t
);
14365 div
= build_int_cst (TREE_TYPE (value
), divisor
);
14366 value
= size_binop_loc (loc
, FLOOR_DIV_EXPR
, value
, div
);
14367 value
= size_binop_loc (loc
, MULT_EXPR
, value
, div
);
14373 /* Returns the pointer to the base of the object addressed by EXP and
14374 extracts the information about the offset of the access, storing it
14375 to PBITPOS and POFFSET. */
14378 split_address_to_core_and_offset (tree exp
,
14379 poly_int64_pod
*pbitpos
, tree
*poffset
)
14383 int unsignedp
, reversep
, volatilep
;
14384 poly_int64 bitsize
;
14385 location_t loc
= EXPR_LOCATION (exp
);
14387 if (TREE_CODE (exp
) == ADDR_EXPR
)
14389 core
= get_inner_reference (TREE_OPERAND (exp
, 0), &bitsize
, pbitpos
,
14390 poffset
, &mode
, &unsignedp
, &reversep
,
14392 core
= build_fold_addr_expr_loc (loc
, core
);
14394 else if (TREE_CODE (exp
) == POINTER_PLUS_EXPR
)
14396 core
= TREE_OPERAND (exp
, 0);
14399 *poffset
= TREE_OPERAND (exp
, 1);
14400 if (poly_int_tree_p (*poffset
))
14402 poly_offset_int tem
14403 = wi::sext (wi::to_poly_offset (*poffset
),
14404 TYPE_PRECISION (TREE_TYPE (*poffset
)));
14405 tem
<<= LOG2_BITS_PER_UNIT
;
14406 if (tem
.to_shwi (pbitpos
))
14407 *poffset
= NULL_TREE
;
14414 *poffset
= NULL_TREE
;
14420 /* Returns true if addresses of E1 and E2 differ by a constant, false
14421 otherwise. If they do, E1 - E2 is stored in *DIFF. */
14424 ptr_difference_const (tree e1
, tree e2
, poly_int64_pod
*diff
)
14427 poly_int64 bitpos1
, bitpos2
;
14428 tree toffset1
, toffset2
, tdiff
, type
;
14430 core1
= split_address_to_core_and_offset (e1
, &bitpos1
, &toffset1
);
14431 core2
= split_address_to_core_and_offset (e2
, &bitpos2
, &toffset2
);
14433 poly_int64 bytepos1
, bytepos2
;
14434 if (!multiple_p (bitpos1
, BITS_PER_UNIT
, &bytepos1
)
14435 || !multiple_p (bitpos2
, BITS_PER_UNIT
, &bytepos2
)
14436 || !operand_equal_p (core1
, core2
, 0))
14439 if (toffset1
&& toffset2
)
14441 type
= TREE_TYPE (toffset1
);
14442 if (type
!= TREE_TYPE (toffset2
))
14443 toffset2
= fold_convert (type
, toffset2
);
14445 tdiff
= fold_build2 (MINUS_EXPR
, type
, toffset1
, toffset2
);
14446 if (!cst_and_fits_in_hwi (tdiff
))
14449 *diff
= int_cst_value (tdiff
);
14451 else if (toffset1
|| toffset2
)
14453 /* If only one of the offsets is non-constant, the difference cannot
14460 *diff
+= bytepos1
- bytepos2
;
14464 /* Return OFF converted to a pointer offset type suitable as offset for
14465 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
14467 convert_to_ptrofftype_loc (location_t loc
, tree off
)
14469 return fold_convert_loc (loc
, sizetype
, off
);
14472 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
14474 fold_build_pointer_plus_loc (location_t loc
, tree ptr
, tree off
)
14476 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
14477 ptr
, convert_to_ptrofftype_loc (loc
, off
));
14480 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
14482 fold_build_pointer_plus_hwi_loc (location_t loc
, tree ptr
, HOST_WIDE_INT off
)
14484 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
14485 ptr
, size_int (off
));
14488 /* Return a char pointer for a C string if it is a string constant
14489 or sum of string constant and integer constant. We only support
14490 string constants properly terminated with '\0' character.
14491 If STRLEN is a valid pointer, length (including terminating character)
14492 of returned string is stored to the argument. */
14495 c_getstr (tree src
, unsigned HOST_WIDE_INT
*strlen
)
14502 src
= string_constant (src
, &offset_node
);
14506 unsigned HOST_WIDE_INT offset
= 0;
14507 if (offset_node
!= NULL_TREE
)
14509 if (!tree_fits_uhwi_p (offset_node
))
14512 offset
= tree_to_uhwi (offset_node
);
14515 unsigned HOST_WIDE_INT string_length
= TREE_STRING_LENGTH (src
);
14516 const char *string
= TREE_STRING_POINTER (src
);
14518 /* Support only properly null-terminated strings. */
14519 if (string_length
== 0
14520 || string
[string_length
- 1] != '\0'
14521 || offset
>= string_length
)
14525 *strlen
= string_length
- offset
;
14526 return string
+ offset
;
14531 namespace selftest
{
14533 /* Helper functions for writing tests of folding trees. */
14535 /* Verify that the binary op (LHS CODE RHS) folds to CONSTANT. */
14538 assert_binop_folds_to_const (tree lhs
, enum tree_code code
, tree rhs
,
14541 ASSERT_EQ (constant
, fold_build2 (code
, TREE_TYPE (lhs
), lhs
, rhs
));
14544 /* Verify that the binary op (LHS CODE RHS) folds to an NON_LVALUE_EXPR
14545 wrapping WRAPPED_EXPR. */
14548 assert_binop_folds_to_nonlvalue (tree lhs
, enum tree_code code
, tree rhs
,
14551 tree result
= fold_build2 (code
, TREE_TYPE (lhs
), lhs
, rhs
);
14552 ASSERT_NE (wrapped_expr
, result
);
14553 ASSERT_EQ (NON_LVALUE_EXPR
, TREE_CODE (result
));
14554 ASSERT_EQ (wrapped_expr
, TREE_OPERAND (result
, 0));
14557 /* Verify that various arithmetic binary operations are folded
14561 test_arithmetic_folding ()
14563 tree type
= integer_type_node
;
14564 tree x
= create_tmp_var_raw (type
, "x");
14565 tree zero
= build_zero_cst (type
);
14566 tree one
= build_int_cst (type
, 1);
14569 /* 1 <-- (0 + 1) */
14570 assert_binop_folds_to_const (zero
, PLUS_EXPR
, one
,
14572 assert_binop_folds_to_const (one
, PLUS_EXPR
, zero
,
14575 /* (nonlvalue)x <-- (x + 0) */
14576 assert_binop_folds_to_nonlvalue (x
, PLUS_EXPR
, zero
,
14580 /* 0 <-- (x - x) */
14581 assert_binop_folds_to_const (x
, MINUS_EXPR
, x
,
14583 assert_binop_folds_to_nonlvalue (x
, MINUS_EXPR
, zero
,
14586 /* Multiplication. */
14587 /* 0 <-- (x * 0) */
14588 assert_binop_folds_to_const (x
, MULT_EXPR
, zero
,
14591 /* (nonlvalue)x <-- (x * 1) */
14592 assert_binop_folds_to_nonlvalue (x
, MULT_EXPR
, one
,
14596 /* Verify that various binary operations on vectors are folded
14600 test_vector_folding ()
14602 tree inner_type
= integer_type_node
;
14603 tree type
= build_vector_type (inner_type
, 4);
14604 tree zero
= build_zero_cst (type
);
14605 tree one
= build_one_cst (type
);
14607 /* Verify equality tests that return a scalar boolean result. */
14608 tree res_type
= boolean_type_node
;
14609 ASSERT_FALSE (integer_nonzerop (fold_build2 (EQ_EXPR
, res_type
, zero
, one
)));
14610 ASSERT_TRUE (integer_nonzerop (fold_build2 (EQ_EXPR
, res_type
, zero
, zero
)));
14611 ASSERT_TRUE (integer_nonzerop (fold_build2 (NE_EXPR
, res_type
, zero
, one
)));
14612 ASSERT_FALSE (integer_nonzerop (fold_build2 (NE_EXPR
, res_type
, one
, one
)));
14615 /* Verify folding of VEC_DUPLICATE_EXPRs. */
14618 test_vec_duplicate_folding ()
14620 scalar_int_mode int_mode
= SCALAR_INT_TYPE_MODE (ssizetype
);
14621 machine_mode vec_mode
= targetm
.vectorize
.preferred_simd_mode (int_mode
);
14622 /* This will be 1 if VEC_MODE isn't a vector mode. */
14623 unsigned int nunits
= GET_MODE_NUNITS (vec_mode
);
14625 tree type
= build_vector_type (ssizetype
, nunits
);
14626 tree dup5_expr
= fold_unary (VEC_DUPLICATE_EXPR
, type
, ssize_int (5));
14627 tree dup5_cst
= build_vector_from_val (type
, ssize_int (5));
14628 ASSERT_TRUE (operand_equal_p (dup5_expr
, dup5_cst
, 0));
14631 /* Run all of the selftests within this file. */
14634 fold_const_c_tests ()
14636 test_arithmetic_folding ();
14637 test_vector_folding ();
14638 test_vec_duplicate_folding ();
14641 } // namespace selftest
14643 #endif /* CHECKING_P */