1 /* Fold a constant sub-tree into a single node for C-compiler
2 Copyright (C) 1987-2015 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /*@@ This file should be rewritten to use an arbitrary precision
21 @@ representation for "struct tree_int_cst" and "struct tree_real_cst".
22 @@ Perhaps the routines could also be used for bc/dc, and made a lib.
23 @@ The routines that translate from the ap rep should
24 @@ warn if precision et. al. is lost.
25 @@ This would also make life easier when this technology is used
26 @@ for cross-compilers. */
28 /* The entry points in this file are fold, size_int_wide and size_binop.
30 fold takes a tree as argument and returns a simplified tree.
32 size_binop takes a tree code for an arithmetic operation
33 and two operands that are trees, and produces a tree for the
34 result, assuming the type comes from `sizetype'.
36 size_int takes an integer value, and creates a tree constant
37 with type from `sizetype'.
39 Note: Since the folders get called on non-gimple code as well as
40 gimple code, we need to handle GIMPLE tuples as well as their
41 corresponding tree equivalents. */
45 #include "coretypes.h"
51 #include "fold-const.h"
52 #include "stor-layout.h"
54 #include "tree-iterator.h"
57 #include "hard-reg-set.h"
59 #include "insn-config.h"
69 #include "diagnostic-core.h"
71 #include "langhooks.h"
74 #include "basic-block.h"
75 #include "tree-ssa-alias.h"
76 #include "internal-fn.h"
78 #include "gimple-expr.h"
84 #include "generic-match.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_mathfn_p (enum built_in_function
);
114 static bool negate_expr_p (tree
);
115 static tree
negate_expr (tree
);
116 static tree
split_tree (tree
, enum tree_code
, tree
*, tree
*, tree
*, int);
117 static tree
associate_trees (location_t
, tree
, tree
, enum tree_code
, tree
);
118 static enum comparison_code
comparison_to_compcode (enum tree_code
);
119 static enum tree_code
compcode_to_comparison (enum comparison_code
);
120 static int operand_equal_for_comparison_p (tree
, tree
, tree
);
121 static int twoval_comparison_p (tree
, tree
*, tree
*, int *);
122 static tree
eval_subst (location_t
, tree
, tree
, tree
, tree
, tree
);
123 static tree
distribute_bit_expr (location_t
, enum tree_code
, tree
, tree
, tree
);
124 static tree
make_bit_field_ref (location_t
, tree
, tree
,
125 HOST_WIDE_INT
, HOST_WIDE_INT
, int);
126 static tree
optimize_bit_field_compare (location_t
, enum tree_code
,
128 static tree
decode_field_reference (location_t
, tree
, HOST_WIDE_INT
*,
130 machine_mode
*, int *, int *,
132 static int simple_operand_p (const_tree
);
133 static bool simple_operand_p_2 (tree
);
134 static tree
range_binop (enum tree_code
, tree
, tree
, int, tree
, int);
135 static tree
range_predecessor (tree
);
136 static tree
range_successor (tree
);
137 static tree
fold_range_test (location_t
, enum tree_code
, tree
, tree
, tree
);
138 static tree
fold_cond_expr_with_comparison (location_t
, tree
, tree
, tree
, tree
);
139 static tree
unextend (tree
, int, int, tree
);
140 static tree
optimize_minmax_comparison (location_t
, enum tree_code
,
142 static tree
extract_muldiv (tree
, tree
, enum tree_code
, tree
, bool *);
143 static tree
extract_muldiv_1 (tree
, tree
, enum tree_code
, tree
, bool *);
144 static tree
fold_binary_op_with_conditional_arg (location_t
,
145 enum tree_code
, tree
,
148 static tree
fold_mathfn_compare (location_t
,
149 enum built_in_function
, enum tree_code
,
151 static tree
fold_inf_compare (location_t
, enum tree_code
, tree
, tree
, tree
);
152 static tree
fold_div_compare (location_t
, enum tree_code
, tree
, tree
, tree
);
153 static bool reorder_operands_p (const_tree
, const_tree
);
154 static tree
fold_negate_const (tree
, tree
);
155 static tree
fold_not_const (const_tree
, tree
);
156 static tree
fold_relational_const (enum tree_code
, tree
, tree
, tree
);
157 static tree
fold_convert_const (enum tree_code
, tree
, tree
);
158 static tree
fold_view_convert_expr (tree
, tree
);
159 static bool vec_cst_ctor_to_array (tree
, tree
*);
162 /* Return EXPR_LOCATION of T if it is not UNKNOWN_LOCATION.
163 Otherwise, return LOC. */
166 expr_location_or (tree t
, location_t loc
)
168 location_t tloc
= EXPR_LOCATION (t
);
169 return tloc
== UNKNOWN_LOCATION
? loc
: tloc
;
172 /* Similar to protected_set_expr_location, but never modify x in place,
173 if location can and needs to be set, unshare it. */
176 protected_set_expr_location_unshare (tree x
, location_t loc
)
178 if (CAN_HAVE_LOCATION_P (x
)
179 && EXPR_LOCATION (x
) != loc
180 && !(TREE_CODE (x
) == SAVE_EXPR
181 || TREE_CODE (x
) == TARGET_EXPR
182 || TREE_CODE (x
) == BIND_EXPR
))
185 SET_EXPR_LOCATION (x
, loc
);
190 /* If ARG2 divides ARG1 with zero remainder, carries out the exact
191 division and returns the quotient. Otherwise returns
195 div_if_zero_remainder (const_tree arg1
, const_tree arg2
)
199 if (wi::multiple_of_p (wi::to_widest (arg1
), wi::to_widest (arg2
),
201 return wide_int_to_tree (TREE_TYPE (arg1
), quo
);
206 /* This is nonzero if we should defer warnings about undefined
207 overflow. This facility exists because these warnings are a
208 special case. The code to estimate loop iterations does not want
209 to issue any warnings, since it works with expressions which do not
210 occur in user code. Various bits of cleanup code call fold(), but
211 only use the result if it has certain characteristics (e.g., is a
212 constant); that code only wants to issue a warning if the result is
215 static int fold_deferring_overflow_warnings
;
217 /* If a warning about undefined overflow is deferred, this is the
218 warning. Note that this may cause us to turn two warnings into
219 one, but that is fine since it is sufficient to only give one
220 warning per expression. */
222 static const char* fold_deferred_overflow_warning
;
224 /* If a warning about undefined overflow is deferred, this is the
225 level at which the warning should be emitted. */
227 static enum warn_strict_overflow_code fold_deferred_overflow_code
;
229 /* Start deferring overflow warnings. We could use a stack here to
230 permit nested calls, but at present it is not necessary. */
233 fold_defer_overflow_warnings (void)
235 ++fold_deferring_overflow_warnings
;
238 /* Stop deferring overflow warnings. If there is a pending warning,
239 and ISSUE is true, then issue the warning if appropriate. STMT is
240 the statement with which the warning should be associated (used for
241 location information); STMT may be NULL. CODE is the level of the
242 warning--a warn_strict_overflow_code value. This function will use
243 the smaller of CODE and the deferred code when deciding whether to
244 issue the warning. CODE may be zero to mean to always use the
248 fold_undefer_overflow_warnings (bool issue
, const_gimple stmt
, int code
)
253 gcc_assert (fold_deferring_overflow_warnings
> 0);
254 --fold_deferring_overflow_warnings
;
255 if (fold_deferring_overflow_warnings
> 0)
257 if (fold_deferred_overflow_warning
!= NULL
259 && code
< (int) fold_deferred_overflow_code
)
260 fold_deferred_overflow_code
= (enum warn_strict_overflow_code
) code
;
264 warnmsg
= fold_deferred_overflow_warning
;
265 fold_deferred_overflow_warning
= NULL
;
267 if (!issue
|| warnmsg
== NULL
)
270 if (gimple_no_warning_p (stmt
))
273 /* Use the smallest code level when deciding to issue the
275 if (code
== 0 || code
> (int) fold_deferred_overflow_code
)
276 code
= fold_deferred_overflow_code
;
278 if (!issue_strict_overflow_warning (code
))
282 locus
= input_location
;
284 locus
= gimple_location (stmt
);
285 warning_at (locus
, OPT_Wstrict_overflow
, "%s", warnmsg
);
288 /* Stop deferring overflow warnings, ignoring any deferred
292 fold_undefer_and_ignore_overflow_warnings (void)
294 fold_undefer_overflow_warnings (false, NULL
, 0);
297 /* Whether we are deferring overflow warnings. */
300 fold_deferring_overflow_warnings_p (void)
302 return fold_deferring_overflow_warnings
> 0;
305 /* This is called when we fold something based on the fact that signed
306 overflow is undefined. */
309 fold_overflow_warning (const char* gmsgid
, enum warn_strict_overflow_code wc
)
311 if (fold_deferring_overflow_warnings
> 0)
313 if (fold_deferred_overflow_warning
== NULL
314 || wc
< fold_deferred_overflow_code
)
316 fold_deferred_overflow_warning
= gmsgid
;
317 fold_deferred_overflow_code
= wc
;
320 else if (issue_strict_overflow_warning (wc
))
321 warning (OPT_Wstrict_overflow
, gmsgid
);
324 /* Return true if the built-in mathematical function specified by CODE
325 is odd, i.e. -f(x) == f(-x). */
328 negate_mathfn_p (enum built_in_function code
)
332 CASE_FLT_FN (BUILT_IN_ASIN
):
333 CASE_FLT_FN (BUILT_IN_ASINH
):
334 CASE_FLT_FN (BUILT_IN_ATAN
):
335 CASE_FLT_FN (BUILT_IN_ATANH
):
336 CASE_FLT_FN (BUILT_IN_CASIN
):
337 CASE_FLT_FN (BUILT_IN_CASINH
):
338 CASE_FLT_FN (BUILT_IN_CATAN
):
339 CASE_FLT_FN (BUILT_IN_CATANH
):
340 CASE_FLT_FN (BUILT_IN_CBRT
):
341 CASE_FLT_FN (BUILT_IN_CPROJ
):
342 CASE_FLT_FN (BUILT_IN_CSIN
):
343 CASE_FLT_FN (BUILT_IN_CSINH
):
344 CASE_FLT_FN (BUILT_IN_CTAN
):
345 CASE_FLT_FN (BUILT_IN_CTANH
):
346 CASE_FLT_FN (BUILT_IN_ERF
):
347 CASE_FLT_FN (BUILT_IN_LLROUND
):
348 CASE_FLT_FN (BUILT_IN_LROUND
):
349 CASE_FLT_FN (BUILT_IN_ROUND
):
350 CASE_FLT_FN (BUILT_IN_SIN
):
351 CASE_FLT_FN (BUILT_IN_SINH
):
352 CASE_FLT_FN (BUILT_IN_TAN
):
353 CASE_FLT_FN (BUILT_IN_TANH
):
354 CASE_FLT_FN (BUILT_IN_TRUNC
):
357 CASE_FLT_FN (BUILT_IN_LLRINT
):
358 CASE_FLT_FN (BUILT_IN_LRINT
):
359 CASE_FLT_FN (BUILT_IN_NEARBYINT
):
360 CASE_FLT_FN (BUILT_IN_RINT
):
361 return !flag_rounding_math
;
369 /* Check whether we may negate an integer constant T without causing
373 may_negate_without_overflow_p (const_tree t
)
377 gcc_assert (TREE_CODE (t
) == INTEGER_CST
);
379 type
= TREE_TYPE (t
);
380 if (TYPE_UNSIGNED (type
))
383 return !wi::only_sign_bit_p (t
);
386 /* Determine whether an expression T can be cheaply negated using
387 the function negate_expr without introducing undefined overflow. */
390 negate_expr_p (tree t
)
397 type
= TREE_TYPE (t
);
400 switch (TREE_CODE (t
))
403 if (INTEGRAL_TYPE_P (type
) && TYPE_OVERFLOW_WRAPS (type
))
406 /* Check that -CST will not overflow type. */
407 return may_negate_without_overflow_p (t
);
409 return (INTEGRAL_TYPE_P (type
)
410 && TYPE_OVERFLOW_WRAPS (type
));
416 return !TYPE_OVERFLOW_SANITIZED (type
);
419 /* We want to canonicalize to positive real constants. Pretend
420 that only negative ones can be easily negated. */
421 return REAL_VALUE_NEGATIVE (TREE_REAL_CST (t
));
424 return negate_expr_p (TREE_REALPART (t
))
425 && negate_expr_p (TREE_IMAGPART (t
));
429 if (FLOAT_TYPE_P (TREE_TYPE (type
)) || TYPE_OVERFLOW_WRAPS (type
))
432 int count
= TYPE_VECTOR_SUBPARTS (type
), i
;
434 for (i
= 0; i
< count
; i
++)
435 if (!negate_expr_p (VECTOR_CST_ELT (t
, i
)))
442 return negate_expr_p (TREE_OPERAND (t
, 0))
443 && negate_expr_p (TREE_OPERAND (t
, 1));
446 return negate_expr_p (TREE_OPERAND (t
, 0));
449 if (HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
450 || HONOR_SIGNED_ZEROS (element_mode (type
)))
452 /* -(A + B) -> (-B) - A. */
453 if (negate_expr_p (TREE_OPERAND (t
, 1))
454 && reorder_operands_p (TREE_OPERAND (t
, 0),
455 TREE_OPERAND (t
, 1)))
457 /* -(A + B) -> (-A) - B. */
458 return negate_expr_p (TREE_OPERAND (t
, 0));
461 /* We can't turn -(A-B) into B-A when we honor signed zeros. */
462 return !HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
463 && !HONOR_SIGNED_ZEROS (element_mode (type
))
464 && reorder_operands_p (TREE_OPERAND (t
, 0),
465 TREE_OPERAND (t
, 1));
468 if (TYPE_UNSIGNED (TREE_TYPE (t
)))
474 if (! HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (TREE_TYPE (t
))))
475 return negate_expr_p (TREE_OPERAND (t
, 1))
476 || negate_expr_p (TREE_OPERAND (t
, 0));
482 /* In general we can't negate A / B, because if A is INT_MIN and
483 B is 1, we may turn this into INT_MIN / -1 which is undefined
484 and actually traps on some architectures. But if overflow is
485 undefined, we can negate, because - (INT_MIN / 1) is an
487 if (INTEGRAL_TYPE_P (TREE_TYPE (t
)))
489 if (!TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (t
)))
491 /* If overflow is undefined then we have to be careful because
492 we ask whether it's ok to associate the negate with the
493 division which is not ok for example for
494 -((a - b) / c) where (-(a - b)) / c may invoke undefined
495 overflow because of negating INT_MIN. So do not use
496 negate_expr_p here but open-code the two important cases. */
497 if (TREE_CODE (TREE_OPERAND (t
, 0)) == NEGATE_EXPR
498 || (TREE_CODE (TREE_OPERAND (t
, 0)) == INTEGER_CST
499 && may_negate_without_overflow_p (TREE_OPERAND (t
, 0))))
502 else if (negate_expr_p (TREE_OPERAND (t
, 0)))
504 return negate_expr_p (TREE_OPERAND (t
, 1));
507 /* Negate -((double)float) as (double)(-float). */
508 if (TREE_CODE (type
) == REAL_TYPE
)
510 tree tem
= strip_float_extensions (t
);
512 return negate_expr_p (tem
);
517 /* Negate -f(x) as f(-x). */
518 if (negate_mathfn_p (builtin_mathfn_code (t
)))
519 return negate_expr_p (CALL_EXPR_ARG (t
, 0));
523 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
524 if (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
)
526 tree op1
= TREE_OPERAND (t
, 1);
527 if (wi::eq_p (op1
, TYPE_PRECISION (type
) - 1))
538 /* Given T, an expression, return a folded tree for -T or NULL_TREE, if no
539 simplification is possible.
540 If negate_expr_p would return true for T, NULL_TREE will never be
544 fold_negate_expr (location_t loc
, tree t
)
546 tree type
= TREE_TYPE (t
);
549 switch (TREE_CODE (t
))
551 /* Convert - (~A) to A + 1. */
553 if (INTEGRAL_TYPE_P (type
))
554 return fold_build2_loc (loc
, PLUS_EXPR
, type
, TREE_OPERAND (t
, 0),
555 build_one_cst (type
));
559 tem
= fold_negate_const (t
, type
);
560 if (TREE_OVERFLOW (tem
) == TREE_OVERFLOW (t
)
561 || (ANY_INTEGRAL_TYPE_P (type
)
562 && !TYPE_OVERFLOW_TRAPS (type
)
563 && TYPE_OVERFLOW_WRAPS (type
))
564 || (flag_sanitize
& SANITIZE_SI_OVERFLOW
) == 0)
569 tem
= fold_negate_const (t
, type
);
573 tem
= fold_negate_const (t
, type
);
578 tree rpart
= fold_negate_expr (loc
, TREE_REALPART (t
));
579 tree ipart
= fold_negate_expr (loc
, TREE_IMAGPART (t
));
581 return build_complex (type
, rpart
, ipart
);
587 int count
= TYPE_VECTOR_SUBPARTS (type
), i
;
588 tree
*elts
= XALLOCAVEC (tree
, count
);
590 for (i
= 0; i
< count
; i
++)
592 elts
[i
] = fold_negate_expr (loc
, VECTOR_CST_ELT (t
, i
));
593 if (elts
[i
] == NULL_TREE
)
597 return build_vector (type
, elts
);
601 if (negate_expr_p (t
))
602 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
603 fold_negate_expr (loc
, TREE_OPERAND (t
, 0)),
604 fold_negate_expr (loc
, TREE_OPERAND (t
, 1)));
608 if (negate_expr_p (t
))
609 return fold_build1_loc (loc
, CONJ_EXPR
, type
,
610 fold_negate_expr (loc
, TREE_OPERAND (t
, 0)));
614 if (!TYPE_OVERFLOW_SANITIZED (type
))
615 return TREE_OPERAND (t
, 0);
619 if (!HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
620 && !HONOR_SIGNED_ZEROS (element_mode (type
)))
622 /* -(A + B) -> (-B) - A. */
623 if (negate_expr_p (TREE_OPERAND (t
, 1))
624 && reorder_operands_p (TREE_OPERAND (t
, 0),
625 TREE_OPERAND (t
, 1)))
627 tem
= negate_expr (TREE_OPERAND (t
, 1));
628 return fold_build2_loc (loc
, MINUS_EXPR
, type
,
629 tem
, TREE_OPERAND (t
, 0));
632 /* -(A + B) -> (-A) - B. */
633 if (negate_expr_p (TREE_OPERAND (t
, 0)))
635 tem
= negate_expr (TREE_OPERAND (t
, 0));
636 return fold_build2_loc (loc
, MINUS_EXPR
, type
,
637 tem
, TREE_OPERAND (t
, 1));
643 /* - (A - B) -> B - A */
644 if (!HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
))
645 && !HONOR_SIGNED_ZEROS (element_mode (type
))
646 && reorder_operands_p (TREE_OPERAND (t
, 0), TREE_OPERAND (t
, 1)))
647 return fold_build2_loc (loc
, MINUS_EXPR
, type
,
648 TREE_OPERAND (t
, 1), TREE_OPERAND (t
, 0));
652 if (TYPE_UNSIGNED (type
))
658 if (! HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
)))
660 tem
= TREE_OPERAND (t
, 1);
661 if (negate_expr_p (tem
))
662 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
663 TREE_OPERAND (t
, 0), negate_expr (tem
));
664 tem
= TREE_OPERAND (t
, 0);
665 if (negate_expr_p (tem
))
666 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
667 negate_expr (tem
), TREE_OPERAND (t
, 1));
674 /* In general we can't negate A / B, because if A is INT_MIN and
675 B is 1, we may turn this into INT_MIN / -1 which is undefined
676 and actually traps on some architectures. But if overflow is
677 undefined, we can negate, because - (INT_MIN / 1) is an
679 if (!INTEGRAL_TYPE_P (type
) || TYPE_OVERFLOW_UNDEFINED (type
))
681 const char * const warnmsg
= G_("assuming signed overflow does not "
682 "occur when negating a division");
683 tem
= TREE_OPERAND (t
, 1);
684 if (negate_expr_p (tem
))
686 if (INTEGRAL_TYPE_P (type
)
687 && (TREE_CODE (tem
) != INTEGER_CST
688 || integer_onep (tem
)))
689 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_MISC
);
690 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
691 TREE_OPERAND (t
, 0), negate_expr (tem
));
693 /* If overflow is undefined then we have to be careful because
694 we ask whether it's ok to associate the negate with the
695 division which is not ok for example for
696 -((a - b) / c) where (-(a - b)) / c may invoke undefined
697 overflow because of negating INT_MIN. So do not use
698 negate_expr_p here but open-code the two important cases. */
699 tem
= TREE_OPERAND (t
, 0);
700 if ((INTEGRAL_TYPE_P (type
)
701 && (TREE_CODE (tem
) == NEGATE_EXPR
702 || (TREE_CODE (tem
) == INTEGER_CST
703 && may_negate_without_overflow_p (tem
))))
704 || !INTEGRAL_TYPE_P (type
))
705 return fold_build2_loc (loc
, TREE_CODE (t
), type
,
706 negate_expr (tem
), TREE_OPERAND (t
, 1));
711 /* Convert -((double)float) into (double)(-float). */
712 if (TREE_CODE (type
) == REAL_TYPE
)
714 tem
= strip_float_extensions (t
);
715 if (tem
!= t
&& negate_expr_p (tem
))
716 return fold_convert_loc (loc
, type
, negate_expr (tem
));
721 /* Negate -f(x) as f(-x). */
722 if (negate_mathfn_p (builtin_mathfn_code (t
))
723 && negate_expr_p (CALL_EXPR_ARG (t
, 0)))
727 fndecl
= get_callee_fndecl (t
);
728 arg
= negate_expr (CALL_EXPR_ARG (t
, 0));
729 return build_call_expr_loc (loc
, fndecl
, 1, arg
);
734 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
735 if (TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
)
737 tree op1
= TREE_OPERAND (t
, 1);
738 if (wi::eq_p (op1
, TYPE_PRECISION (type
) - 1))
740 tree ntype
= TYPE_UNSIGNED (type
)
741 ? signed_type_for (type
)
742 : unsigned_type_for (type
);
743 tree temp
= fold_convert_loc (loc
, ntype
, TREE_OPERAND (t
, 0));
744 temp
= fold_build2_loc (loc
, RSHIFT_EXPR
, ntype
, temp
, op1
);
745 return fold_convert_loc (loc
, type
, temp
);
757 /* Like fold_negate_expr, but return a NEGATE_EXPR tree, if T can not be
758 negated in a simpler way. Also allow for T to be NULL_TREE, in which case
770 loc
= EXPR_LOCATION (t
);
771 type
= TREE_TYPE (t
);
774 tem
= fold_negate_expr (loc
, t
);
776 tem
= build1_loc (loc
, NEGATE_EXPR
, TREE_TYPE (t
), t
);
777 return fold_convert_loc (loc
, type
, tem
);
780 /* Split a tree IN into a constant, literal and variable parts that could be
781 combined with CODE to make IN. "constant" means an expression with
782 TREE_CONSTANT but that isn't an actual constant. CODE must be a
783 commutative arithmetic operation. Store the constant part into *CONP,
784 the literal in *LITP and return the variable part. If a part isn't
785 present, set it to null. If the tree does not decompose in this way,
786 return the entire tree as the variable part and the other parts as null.
788 If CODE is PLUS_EXPR we also split trees that use MINUS_EXPR. In that
789 case, we negate an operand that was subtracted. Except if it is a
790 literal for which we use *MINUS_LITP instead.
792 If NEGATE_P is true, we are negating all of IN, again except a literal
793 for which we use *MINUS_LITP instead.
795 If IN is itself a literal or constant, return it as appropriate.
797 Note that we do not guarantee that any of the three values will be the
798 same type as IN, but they will have the same signedness and mode. */
801 split_tree (tree in
, enum tree_code code
, tree
*conp
, tree
*litp
,
802 tree
*minus_litp
, int negate_p
)
810 /* Strip any conversions that don't change the machine mode or signedness. */
811 STRIP_SIGN_NOPS (in
);
813 if (TREE_CODE (in
) == INTEGER_CST
|| TREE_CODE (in
) == REAL_CST
814 || TREE_CODE (in
) == FIXED_CST
)
816 else if (TREE_CODE (in
) == code
817 || ((! FLOAT_TYPE_P (TREE_TYPE (in
)) || flag_associative_math
)
818 && ! SAT_FIXED_POINT_TYPE_P (TREE_TYPE (in
))
819 /* We can associate addition and subtraction together (even
820 though the C standard doesn't say so) for integers because
821 the value is not affected. For reals, the value might be
822 affected, so we can't. */
823 && ((code
== PLUS_EXPR
&& TREE_CODE (in
) == MINUS_EXPR
)
824 || (code
== MINUS_EXPR
&& TREE_CODE (in
) == PLUS_EXPR
))))
826 tree op0
= TREE_OPERAND (in
, 0);
827 tree op1
= TREE_OPERAND (in
, 1);
828 int neg1_p
= TREE_CODE (in
) == MINUS_EXPR
;
829 int neg_litp_p
= 0, neg_conp_p
= 0, neg_var_p
= 0;
831 /* First see if either of the operands is a literal, then a constant. */
832 if (TREE_CODE (op0
) == INTEGER_CST
|| TREE_CODE (op0
) == REAL_CST
833 || TREE_CODE (op0
) == FIXED_CST
)
834 *litp
= op0
, op0
= 0;
835 else if (TREE_CODE (op1
) == INTEGER_CST
|| TREE_CODE (op1
) == REAL_CST
836 || TREE_CODE (op1
) == FIXED_CST
)
837 *litp
= op1
, neg_litp_p
= neg1_p
, op1
= 0;
839 if (op0
!= 0 && TREE_CONSTANT (op0
))
840 *conp
= op0
, op0
= 0;
841 else if (op1
!= 0 && TREE_CONSTANT (op1
))
842 *conp
= op1
, neg_conp_p
= neg1_p
, op1
= 0;
844 /* If we haven't dealt with either operand, this is not a case we can
845 decompose. Otherwise, VAR is either of the ones remaining, if any. */
846 if (op0
!= 0 && op1
!= 0)
851 var
= op1
, neg_var_p
= neg1_p
;
853 /* Now do any needed negations. */
855 *minus_litp
= *litp
, *litp
= 0;
857 *conp
= negate_expr (*conp
);
859 var
= negate_expr (var
);
861 else if (TREE_CODE (in
) == BIT_NOT_EXPR
862 && code
== PLUS_EXPR
)
864 /* -X - 1 is folded to ~X, undo that here. */
865 *minus_litp
= build_one_cst (TREE_TYPE (in
));
866 var
= negate_expr (TREE_OPERAND (in
, 0));
868 else if (TREE_CONSTANT (in
))
876 *minus_litp
= *litp
, *litp
= 0;
877 else if (*minus_litp
)
878 *litp
= *minus_litp
, *minus_litp
= 0;
879 *conp
= negate_expr (*conp
);
880 var
= negate_expr (var
);
886 /* Re-associate trees split by the above function. T1 and T2 are
887 either expressions to associate or null. Return the new
888 expression, if any. LOC is the location of the new expression. If
889 we build an operation, do it in TYPE and with CODE. */
892 associate_trees (location_t loc
, tree t1
, tree t2
, enum tree_code code
, tree type
)
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
) == MINUS_EXPR
|| TREE_CODE (t2
) == MINUS_EXPR
)
905 if (code
== PLUS_EXPR
)
907 if (TREE_CODE (t1
) == NEGATE_EXPR
)
908 return build2_loc (loc
, MINUS_EXPR
, type
,
909 fold_convert_loc (loc
, type
, t2
),
910 fold_convert_loc (loc
, type
,
911 TREE_OPERAND (t1
, 0)));
912 else if (TREE_CODE (t2
) == NEGATE_EXPR
)
913 return build2_loc (loc
, MINUS_EXPR
, type
,
914 fold_convert_loc (loc
, type
, t1
),
915 fold_convert_loc (loc
, type
,
916 TREE_OPERAND (t2
, 0)));
917 else if (integer_zerop (t2
))
918 return fold_convert_loc (loc
, type
, t1
);
920 else if (code
== MINUS_EXPR
)
922 if (integer_zerop (t2
))
923 return fold_convert_loc (loc
, type
, t1
);
926 return build2_loc (loc
, code
, type
, fold_convert_loc (loc
, type
, t1
),
927 fold_convert_loc (loc
, type
, t2
));
930 return fold_build2_loc (loc
, code
, type
, fold_convert_loc (loc
, type
, t1
),
931 fold_convert_loc (loc
, type
, t2
));
934 /* Check whether TYPE1 and TYPE2 are equivalent integer types, suitable
935 for use in int_const_binop, size_binop and size_diffop. */
938 int_binop_types_match_p (enum tree_code code
, const_tree type1
, const_tree type2
)
940 if (!INTEGRAL_TYPE_P (type1
) && !POINTER_TYPE_P (type1
))
942 if (!INTEGRAL_TYPE_P (type2
) && !POINTER_TYPE_P (type2
))
957 return TYPE_UNSIGNED (type1
) == TYPE_UNSIGNED (type2
)
958 && TYPE_PRECISION (type1
) == TYPE_PRECISION (type2
)
959 && TYPE_MODE (type1
) == TYPE_MODE (type2
);
963 /* Combine two integer constants ARG1 and ARG2 under operation CODE
964 to produce a new constant. Return NULL_TREE if we don't know how
965 to evaluate CODE at compile-time. */
968 int_const_binop_1 (enum tree_code code
, const_tree arg1
, const_tree parg2
,
973 tree type
= TREE_TYPE (arg1
);
974 signop sign
= TYPE_SIGN (type
);
975 bool overflow
= false;
977 wide_int arg2
= wide_int::from (parg2
, TYPE_PRECISION (type
),
978 TYPE_SIGN (TREE_TYPE (parg2
)));
983 res
= wi::bit_or (arg1
, arg2
);
987 res
= wi::bit_xor (arg1
, arg2
);
991 res
= wi::bit_and (arg1
, arg2
);
996 if (wi::neg_p (arg2
))
999 if (code
== RSHIFT_EXPR
)
1005 if (code
== RSHIFT_EXPR
)
1006 /* It's unclear from the C standard whether shifts can overflow.
1007 The following code ignores overflow; perhaps a C standard
1008 interpretation ruling is needed. */
1009 res
= wi::rshift (arg1
, arg2
, sign
);
1011 res
= wi::lshift (arg1
, arg2
);
1016 if (wi::neg_p (arg2
))
1019 if (code
== RROTATE_EXPR
)
1020 code
= LROTATE_EXPR
;
1022 code
= RROTATE_EXPR
;
1025 if (code
== RROTATE_EXPR
)
1026 res
= wi::rrotate (arg1
, arg2
);
1028 res
= wi::lrotate (arg1
, arg2
);
1032 res
= wi::add (arg1
, arg2
, sign
, &overflow
);
1036 res
= wi::sub (arg1
, arg2
, sign
, &overflow
);
1040 res
= wi::mul (arg1
, arg2
, sign
, &overflow
);
1043 case MULT_HIGHPART_EXPR
:
1044 res
= wi::mul_high (arg1
, arg2
, sign
);
1047 case TRUNC_DIV_EXPR
:
1048 case EXACT_DIV_EXPR
:
1051 res
= wi::div_trunc (arg1
, arg2
, sign
, &overflow
);
1054 case FLOOR_DIV_EXPR
:
1057 res
= wi::div_floor (arg1
, arg2
, sign
, &overflow
);
1063 res
= wi::div_ceil (arg1
, arg2
, sign
, &overflow
);
1066 case ROUND_DIV_EXPR
:
1069 res
= wi::div_round (arg1
, arg2
, sign
, &overflow
);
1072 case TRUNC_MOD_EXPR
:
1075 res
= wi::mod_trunc (arg1
, arg2
, sign
, &overflow
);
1078 case FLOOR_MOD_EXPR
:
1081 res
= wi::mod_floor (arg1
, arg2
, sign
, &overflow
);
1087 res
= wi::mod_ceil (arg1
, arg2
, sign
, &overflow
);
1090 case ROUND_MOD_EXPR
:
1093 res
= wi::mod_round (arg1
, arg2
, sign
, &overflow
);
1097 res
= wi::min (arg1
, arg2
, sign
);
1101 res
= wi::max (arg1
, arg2
, sign
);
1108 t
= force_fit_type (type
, res
, overflowable
,
1109 (((sign
== SIGNED
|| overflowable
== -1)
1111 | TREE_OVERFLOW (arg1
) | TREE_OVERFLOW (parg2
)));
1117 int_const_binop (enum tree_code code
, const_tree arg1
, const_tree arg2
)
1119 return int_const_binop_1 (code
, arg1
, arg2
, 1);
1122 /* Combine two constants ARG1 and ARG2 under operation CODE to produce a new
1123 constant. We assume ARG1 and ARG2 have the same data type, or at least
1124 are the same kind of constant and the same machine mode. Return zero if
1125 combining the constants is not allowed in the current operating mode. */
1128 const_binop (enum tree_code code
, tree arg1
, tree arg2
)
1130 /* Sanity check for the recursive cases. */
1137 if (TREE_CODE (arg1
) == INTEGER_CST
&& TREE_CODE (arg2
) == INTEGER_CST
)
1139 if (code
== POINTER_PLUS_EXPR
)
1140 return int_const_binop (PLUS_EXPR
,
1141 arg1
, fold_convert (TREE_TYPE (arg1
), arg2
));
1143 return int_const_binop (code
, arg1
, arg2
);
1146 if (TREE_CODE (arg1
) == REAL_CST
&& TREE_CODE (arg2
) == REAL_CST
)
1151 REAL_VALUE_TYPE value
;
1152 REAL_VALUE_TYPE result
;
1156 /* The following codes are handled by real_arithmetic. */
1171 d1
= TREE_REAL_CST (arg1
);
1172 d2
= TREE_REAL_CST (arg2
);
1174 type
= TREE_TYPE (arg1
);
1175 mode
= TYPE_MODE (type
);
1177 /* Don't perform operation if we honor signaling NaNs and
1178 either operand is a NaN. */
1179 if (HONOR_SNANS (mode
)
1180 && (REAL_VALUE_ISNAN (d1
) || REAL_VALUE_ISNAN (d2
)))
1183 /* Don't perform operation if it would raise a division
1184 by zero exception. */
1185 if (code
== RDIV_EXPR
1186 && REAL_VALUES_EQUAL (d2
, dconst0
)
1187 && (flag_trapping_math
|| ! MODE_HAS_INFINITIES (mode
)))
1190 /* If either operand is a NaN, just return it. Otherwise, set up
1191 for floating-point trap; we return an overflow. */
1192 if (REAL_VALUE_ISNAN (d1
))
1194 else if (REAL_VALUE_ISNAN (d2
))
1197 inexact
= real_arithmetic (&value
, code
, &d1
, &d2
);
1198 real_convert (&result
, mode
, &value
);
1200 /* Don't constant fold this floating point operation if
1201 the result has overflowed and flag_trapping_math. */
1202 if (flag_trapping_math
1203 && MODE_HAS_INFINITIES (mode
)
1204 && REAL_VALUE_ISINF (result
)
1205 && !REAL_VALUE_ISINF (d1
)
1206 && !REAL_VALUE_ISINF (d2
))
1209 /* Don't constant fold this floating point operation if the
1210 result may dependent upon the run-time rounding mode and
1211 flag_rounding_math is set, or if GCC's software emulation
1212 is unable to accurately represent the result. */
1213 if ((flag_rounding_math
1214 || (MODE_COMPOSITE_P (mode
) && !flag_unsafe_math_optimizations
))
1215 && (inexact
|| !real_identical (&result
, &value
)))
1218 t
= build_real (type
, result
);
1220 TREE_OVERFLOW (t
) = TREE_OVERFLOW (arg1
) | TREE_OVERFLOW (arg2
);
1224 if (TREE_CODE (arg1
) == FIXED_CST
)
1226 FIXED_VALUE_TYPE f1
;
1227 FIXED_VALUE_TYPE f2
;
1228 FIXED_VALUE_TYPE result
;
1233 /* The following codes are handled by fixed_arithmetic. */
1239 case TRUNC_DIV_EXPR
:
1240 if (TREE_CODE (arg2
) != FIXED_CST
)
1242 f2
= TREE_FIXED_CST (arg2
);
1248 if (TREE_CODE (arg2
) != INTEGER_CST
)
1251 f2
.data
.high
= w2
.elt (1);
1252 f2
.data
.low
= w2
.elt (0);
1261 f1
= TREE_FIXED_CST (arg1
);
1262 type
= TREE_TYPE (arg1
);
1263 sat_p
= TYPE_SATURATING (type
);
1264 overflow_p
= fixed_arithmetic (&result
, code
, &f1
, &f2
, sat_p
);
1265 t
= build_fixed (type
, result
);
1266 /* Propagate overflow flags. */
1267 if (overflow_p
| TREE_OVERFLOW (arg1
) | TREE_OVERFLOW (arg2
))
1268 TREE_OVERFLOW (t
) = 1;
1272 if (TREE_CODE (arg1
) == COMPLEX_CST
&& TREE_CODE (arg2
) == COMPLEX_CST
)
1274 tree type
= TREE_TYPE (arg1
);
1275 tree r1
= TREE_REALPART (arg1
);
1276 tree i1
= TREE_IMAGPART (arg1
);
1277 tree r2
= TREE_REALPART (arg2
);
1278 tree i2
= TREE_IMAGPART (arg2
);
1285 real
= const_binop (code
, r1
, r2
);
1286 imag
= const_binop (code
, i1
, i2
);
1290 if (COMPLEX_FLOAT_TYPE_P (type
))
1291 return do_mpc_arg2 (arg1
, arg2
, type
,
1292 /* do_nonfinite= */ folding_initializer
,
1295 real
= const_binop (MINUS_EXPR
,
1296 const_binop (MULT_EXPR
, r1
, r2
),
1297 const_binop (MULT_EXPR
, i1
, i2
));
1298 imag
= const_binop (PLUS_EXPR
,
1299 const_binop (MULT_EXPR
, r1
, i2
),
1300 const_binop (MULT_EXPR
, i1
, r2
));
1304 if (COMPLEX_FLOAT_TYPE_P (type
))
1305 return do_mpc_arg2 (arg1
, arg2
, type
,
1306 /* do_nonfinite= */ folding_initializer
,
1309 case TRUNC_DIV_EXPR
:
1311 case FLOOR_DIV_EXPR
:
1312 case ROUND_DIV_EXPR
:
1313 if (flag_complex_method
== 0)
1315 /* Keep this algorithm in sync with
1316 tree-complex.c:expand_complex_div_straight().
1318 Expand complex division to scalars, straightforward algorithm.
1319 a / b = ((ar*br + ai*bi)/t) + i((ai*br - ar*bi)/t)
1323 = const_binop (PLUS_EXPR
,
1324 const_binop (MULT_EXPR
, r2
, r2
),
1325 const_binop (MULT_EXPR
, i2
, i2
));
1327 = const_binop (PLUS_EXPR
,
1328 const_binop (MULT_EXPR
, r1
, r2
),
1329 const_binop (MULT_EXPR
, i1
, i2
));
1331 = const_binop (MINUS_EXPR
,
1332 const_binop (MULT_EXPR
, i1
, r2
),
1333 const_binop (MULT_EXPR
, r1
, i2
));
1335 real
= const_binop (code
, t1
, magsquared
);
1336 imag
= const_binop (code
, t2
, magsquared
);
1340 /* Keep this algorithm in sync with
1341 tree-complex.c:expand_complex_div_wide().
1343 Expand complex division to scalars, modified algorithm to minimize
1344 overflow with wide input ranges. */
1345 tree compare
= fold_build2 (LT_EXPR
, boolean_type_node
,
1346 fold_abs_const (r2
, TREE_TYPE (type
)),
1347 fold_abs_const (i2
, TREE_TYPE (type
)));
1349 if (integer_nonzerop (compare
))
1351 /* In the TRUE branch, we compute
1353 div = (br * ratio) + bi;
1354 tr = (ar * ratio) + ai;
1355 ti = (ai * ratio) - ar;
1358 tree ratio
= const_binop (code
, r2
, i2
);
1359 tree div
= const_binop (PLUS_EXPR
, i2
,
1360 const_binop (MULT_EXPR
, r2
, ratio
));
1361 real
= const_binop (MULT_EXPR
, r1
, ratio
);
1362 real
= const_binop (PLUS_EXPR
, real
, i1
);
1363 real
= const_binop (code
, real
, div
);
1365 imag
= const_binop (MULT_EXPR
, i1
, ratio
);
1366 imag
= const_binop (MINUS_EXPR
, imag
, r1
);
1367 imag
= const_binop (code
, imag
, div
);
1371 /* In the FALSE branch, we compute
1373 divisor = (d * ratio) + c;
1374 tr = (b * ratio) + a;
1375 ti = b - (a * ratio);
1378 tree ratio
= const_binop (code
, i2
, r2
);
1379 tree div
= const_binop (PLUS_EXPR
, r2
,
1380 const_binop (MULT_EXPR
, i2
, ratio
));
1382 real
= const_binop (MULT_EXPR
, i1
, ratio
);
1383 real
= const_binop (PLUS_EXPR
, real
, r1
);
1384 real
= const_binop (code
, real
, div
);
1386 imag
= const_binop (MULT_EXPR
, r1
, ratio
);
1387 imag
= const_binop (MINUS_EXPR
, i1
, imag
);
1388 imag
= const_binop (code
, imag
, div
);
1398 return build_complex (type
, real
, imag
);
1401 if (TREE_CODE (arg1
) == VECTOR_CST
1402 && TREE_CODE (arg2
) == VECTOR_CST
)
1404 tree type
= TREE_TYPE (arg1
);
1405 int count
= TYPE_VECTOR_SUBPARTS (type
), i
;
1406 tree
*elts
= XALLOCAVEC (tree
, count
);
1408 for (i
= 0; i
< count
; i
++)
1410 tree elem1
= VECTOR_CST_ELT (arg1
, i
);
1411 tree elem2
= VECTOR_CST_ELT (arg2
, i
);
1413 elts
[i
] = const_binop (code
, elem1
, elem2
);
1415 /* It is possible that const_binop cannot handle the given
1416 code and return NULL_TREE */
1417 if (elts
[i
] == NULL_TREE
)
1421 return build_vector (type
, elts
);
1424 /* Shifts allow a scalar offset for a vector. */
1425 if (TREE_CODE (arg1
) == VECTOR_CST
1426 && TREE_CODE (arg2
) == INTEGER_CST
)
1428 tree type
= TREE_TYPE (arg1
);
1429 int count
= TYPE_VECTOR_SUBPARTS (type
), i
;
1430 tree
*elts
= XALLOCAVEC (tree
, count
);
1432 for (i
= 0; i
< count
; i
++)
1434 tree elem1
= VECTOR_CST_ELT (arg1
, i
);
1436 elts
[i
] = const_binop (code
, elem1
, arg2
);
1438 /* It is possible that const_binop cannot handle the given
1439 code and return NULL_TREE. */
1440 if (elts
[i
] == NULL_TREE
)
1444 return build_vector (type
, elts
);
1449 /* Overload that adds a TYPE parameter to be able to dispatch
1450 to fold_relational_const. */
1453 const_binop (enum tree_code code
, tree type
, tree arg1
, tree arg2
)
1455 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
1456 return fold_relational_const (code
, type
, arg1
, arg2
);
1458 /* ??? Until we make the const_binop worker take the type of the
1459 result as argument put those cases that need it here. */
1463 if ((TREE_CODE (arg1
) == REAL_CST
1464 && TREE_CODE (arg2
) == REAL_CST
)
1465 || (TREE_CODE (arg1
) == INTEGER_CST
1466 && TREE_CODE (arg2
) == INTEGER_CST
))
1467 return build_complex (type
, arg1
, arg2
);
1470 case VEC_PACK_TRUNC_EXPR
:
1471 case VEC_PACK_FIX_TRUNC_EXPR
:
1473 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (type
), i
;
1476 gcc_assert (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg1
)) == nelts
/ 2
1477 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg2
)) == nelts
/ 2);
1478 if (TREE_CODE (arg1
) != VECTOR_CST
1479 || TREE_CODE (arg2
) != VECTOR_CST
)
1482 elts
= XALLOCAVEC (tree
, nelts
);
1483 if (!vec_cst_ctor_to_array (arg1
, elts
)
1484 || !vec_cst_ctor_to_array (arg2
, elts
+ nelts
/ 2))
1487 for (i
= 0; i
< nelts
; i
++)
1489 elts
[i
] = fold_convert_const (code
== VEC_PACK_TRUNC_EXPR
1490 ? NOP_EXPR
: FIX_TRUNC_EXPR
,
1491 TREE_TYPE (type
), elts
[i
]);
1492 if (elts
[i
] == NULL_TREE
|| !CONSTANT_CLASS_P (elts
[i
]))
1496 return build_vector (type
, elts
);
1499 case VEC_WIDEN_MULT_LO_EXPR
:
1500 case VEC_WIDEN_MULT_HI_EXPR
:
1501 case VEC_WIDEN_MULT_EVEN_EXPR
:
1502 case VEC_WIDEN_MULT_ODD_EXPR
:
1504 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (type
);
1505 unsigned int out
, ofs
, scale
;
1508 gcc_assert (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg1
)) == nelts
* 2
1509 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg2
)) == nelts
* 2);
1510 if (TREE_CODE (arg1
) != VECTOR_CST
|| TREE_CODE (arg2
) != VECTOR_CST
)
1513 elts
= XALLOCAVEC (tree
, nelts
* 4);
1514 if (!vec_cst_ctor_to_array (arg1
, elts
)
1515 || !vec_cst_ctor_to_array (arg2
, elts
+ nelts
* 2))
1518 if (code
== VEC_WIDEN_MULT_LO_EXPR
)
1519 scale
= 0, ofs
= BYTES_BIG_ENDIAN
? nelts
: 0;
1520 else if (code
== VEC_WIDEN_MULT_HI_EXPR
)
1521 scale
= 0, ofs
= BYTES_BIG_ENDIAN
? 0 : nelts
;
1522 else if (code
== VEC_WIDEN_MULT_EVEN_EXPR
)
1524 else /* if (code == VEC_WIDEN_MULT_ODD_EXPR) */
1527 for (out
= 0; out
< nelts
; out
++)
1529 unsigned int in1
= (out
<< scale
) + ofs
;
1530 unsigned int in2
= in1
+ nelts
* 2;
1533 t1
= fold_convert_const (NOP_EXPR
, TREE_TYPE (type
), elts
[in1
]);
1534 t2
= fold_convert_const (NOP_EXPR
, TREE_TYPE (type
), elts
[in2
]);
1536 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
1538 elts
[out
] = const_binop (MULT_EXPR
, t1
, t2
);
1539 if (elts
[out
] == NULL_TREE
|| !CONSTANT_CLASS_P (elts
[out
]))
1543 return build_vector (type
, elts
);
1549 if (TREE_CODE_CLASS (code
) != tcc_binary
)
1552 /* Make sure type and arg0 have the same saturating flag. */
1553 gcc_checking_assert (TYPE_SATURATING (type
)
1554 == TYPE_SATURATING (TREE_TYPE (arg1
)));
1556 return const_binop (code
, arg1
, arg2
);
1559 /* Compute CODE ARG1 with resulting type TYPE with ARG1 being constant.
1560 Return zero if computing the constants is not possible. */
1563 const_unop (enum tree_code code
, tree type
, tree arg0
)
1569 case FIX_TRUNC_EXPR
:
1570 case FIXED_CONVERT_EXPR
:
1571 return fold_convert_const (code
, type
, arg0
);
1573 case ADDR_SPACE_CONVERT_EXPR
:
1574 if (integer_zerop (arg0
))
1575 return fold_convert_const (code
, type
, arg0
);
1578 case VIEW_CONVERT_EXPR
:
1579 return fold_view_convert_expr (type
, arg0
);
1583 /* Can't call fold_negate_const directly here as that doesn't
1584 handle all cases and we might not be able to negate some
1586 tree tem
= fold_negate_expr (UNKNOWN_LOCATION
, arg0
);
1587 if (tem
&& CONSTANT_CLASS_P (tem
))
1593 if (TREE_CODE (arg0
) == INTEGER_CST
|| TREE_CODE (arg0
) == REAL_CST
)
1594 return fold_abs_const (arg0
, type
);
1598 if (TREE_CODE (arg0
) == COMPLEX_CST
)
1600 tree ipart
= fold_negate_const (TREE_IMAGPART (arg0
),
1602 return build_complex (type
, TREE_REALPART (arg0
), ipart
);
1607 if (TREE_CODE (arg0
) == INTEGER_CST
)
1608 return fold_not_const (arg0
, type
);
1609 /* Perform BIT_NOT_EXPR on each element individually. */
1610 else if (TREE_CODE (arg0
) == VECTOR_CST
)
1614 unsigned count
= VECTOR_CST_NELTS (arg0
), i
;
1616 elements
= XALLOCAVEC (tree
, count
);
1617 for (i
= 0; i
< count
; i
++)
1619 elem
= VECTOR_CST_ELT (arg0
, i
);
1620 elem
= const_unop (BIT_NOT_EXPR
, TREE_TYPE (type
), elem
);
1621 if (elem
== NULL_TREE
)
1626 return build_vector (type
, elements
);
1630 case TRUTH_NOT_EXPR
:
1631 if (TREE_CODE (arg0
) == INTEGER_CST
)
1632 return constant_boolean_node (integer_zerop (arg0
), type
);
1636 if (TREE_CODE (arg0
) == COMPLEX_CST
)
1637 return fold_convert (type
, TREE_REALPART (arg0
));
1641 if (TREE_CODE (arg0
) == COMPLEX_CST
)
1642 return fold_convert (type
, TREE_IMAGPART (arg0
));
1645 case VEC_UNPACK_LO_EXPR
:
1646 case VEC_UNPACK_HI_EXPR
:
1647 case VEC_UNPACK_FLOAT_LO_EXPR
:
1648 case VEC_UNPACK_FLOAT_HI_EXPR
:
1650 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (type
), i
;
1652 enum tree_code subcode
;
1654 gcc_assert (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0
)) == nelts
* 2);
1655 if (TREE_CODE (arg0
) != VECTOR_CST
)
1658 elts
= XALLOCAVEC (tree
, nelts
* 2);
1659 if (!vec_cst_ctor_to_array (arg0
, elts
))
1662 if ((!BYTES_BIG_ENDIAN
) ^ (code
== VEC_UNPACK_LO_EXPR
1663 || code
== VEC_UNPACK_FLOAT_LO_EXPR
))
1666 if (code
== VEC_UNPACK_LO_EXPR
|| code
== VEC_UNPACK_HI_EXPR
)
1669 subcode
= FLOAT_EXPR
;
1671 for (i
= 0; i
< nelts
; i
++)
1673 elts
[i
] = fold_convert_const (subcode
, TREE_TYPE (type
), elts
[i
]);
1674 if (elts
[i
] == NULL_TREE
|| !CONSTANT_CLASS_P (elts
[i
]))
1678 return build_vector (type
, elts
);
1681 case REDUC_MIN_EXPR
:
1682 case REDUC_MAX_EXPR
:
1683 case REDUC_PLUS_EXPR
:
1685 unsigned int nelts
, i
;
1687 enum tree_code subcode
;
1689 if (TREE_CODE (arg0
) != VECTOR_CST
)
1691 nelts
= TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0
));
1693 elts
= XALLOCAVEC (tree
, nelts
);
1694 if (!vec_cst_ctor_to_array (arg0
, elts
))
1699 case REDUC_MIN_EXPR
: subcode
= MIN_EXPR
; break;
1700 case REDUC_MAX_EXPR
: subcode
= MAX_EXPR
; break;
1701 case REDUC_PLUS_EXPR
: subcode
= PLUS_EXPR
; break;
1702 default: gcc_unreachable ();
1705 for (i
= 1; i
< nelts
; i
++)
1707 elts
[0] = const_binop (subcode
, elts
[0], elts
[i
]);
1708 if (elts
[0] == NULL_TREE
|| !CONSTANT_CLASS_P (elts
[0]))
1722 /* Create a sizetype INT_CST node with NUMBER sign extended. KIND
1723 indicates which particular sizetype to create. */
1726 size_int_kind (HOST_WIDE_INT number
, enum size_type_kind kind
)
1728 return build_int_cst (sizetype_tab
[(int) kind
], number
);
1731 /* Combine operands OP1 and OP2 with arithmetic operation CODE. CODE
1732 is a tree code. The type of the result is taken from the operands.
1733 Both must be equivalent integer types, ala int_binop_types_match_p.
1734 If the operands are constant, so is the result. */
1737 size_binop_loc (location_t loc
, enum tree_code code
, tree arg0
, tree arg1
)
1739 tree type
= TREE_TYPE (arg0
);
1741 if (arg0
== error_mark_node
|| arg1
== error_mark_node
)
1742 return error_mark_node
;
1744 gcc_assert (int_binop_types_match_p (code
, TREE_TYPE (arg0
),
1747 /* Handle the special case of two integer constants faster. */
1748 if (TREE_CODE (arg0
) == INTEGER_CST
&& TREE_CODE (arg1
) == INTEGER_CST
)
1750 /* And some specific cases even faster than that. */
1751 if (code
== PLUS_EXPR
)
1753 if (integer_zerop (arg0
) && !TREE_OVERFLOW (arg0
))
1755 if (integer_zerop (arg1
) && !TREE_OVERFLOW (arg1
))
1758 else if (code
== MINUS_EXPR
)
1760 if (integer_zerop (arg1
) && !TREE_OVERFLOW (arg1
))
1763 else if (code
== MULT_EXPR
)
1765 if (integer_onep (arg0
) && !TREE_OVERFLOW (arg0
))
1769 /* Handle general case of two integer constants. For sizetype
1770 constant calculations we always want to know about overflow,
1771 even in the unsigned case. */
1772 return int_const_binop_1 (code
, arg0
, arg1
, -1);
1775 return fold_build2_loc (loc
, code
, type
, arg0
, arg1
);
1778 /* Given two values, either both of sizetype or both of bitsizetype,
1779 compute the difference between the two values. Return the value
1780 in signed type corresponding to the type of the operands. */
1783 size_diffop_loc (location_t loc
, tree arg0
, tree arg1
)
1785 tree type
= TREE_TYPE (arg0
);
1788 gcc_assert (int_binop_types_match_p (MINUS_EXPR
, TREE_TYPE (arg0
),
1791 /* If the type is already signed, just do the simple thing. */
1792 if (!TYPE_UNSIGNED (type
))
1793 return size_binop_loc (loc
, MINUS_EXPR
, arg0
, arg1
);
1795 if (type
== sizetype
)
1797 else if (type
== bitsizetype
)
1798 ctype
= sbitsizetype
;
1800 ctype
= signed_type_for (type
);
1802 /* If either operand is not a constant, do the conversions to the signed
1803 type and subtract. The hardware will do the right thing with any
1804 overflow in the subtraction. */
1805 if (TREE_CODE (arg0
) != INTEGER_CST
|| TREE_CODE (arg1
) != INTEGER_CST
)
1806 return size_binop_loc (loc
, MINUS_EXPR
,
1807 fold_convert_loc (loc
, ctype
, arg0
),
1808 fold_convert_loc (loc
, ctype
, arg1
));
1810 /* If ARG0 is larger than ARG1, subtract and return the result in CTYPE.
1811 Otherwise, subtract the other way, convert to CTYPE (we know that can't
1812 overflow) and negate (which can't either). Special-case a result
1813 of zero while we're here. */
1814 if (tree_int_cst_equal (arg0
, arg1
))
1815 return build_int_cst (ctype
, 0);
1816 else if (tree_int_cst_lt (arg1
, arg0
))
1817 return fold_convert_loc (loc
, ctype
,
1818 size_binop_loc (loc
, MINUS_EXPR
, arg0
, arg1
));
1820 return size_binop_loc (loc
, MINUS_EXPR
, build_int_cst (ctype
, 0),
1821 fold_convert_loc (loc
, ctype
,
1822 size_binop_loc (loc
,
1827 /* A subroutine of fold_convert_const handling conversions of an
1828 INTEGER_CST to another integer type. */
1831 fold_convert_const_int_from_int (tree type
, const_tree arg1
)
1833 /* Given an integer constant, make new constant with new type,
1834 appropriately sign-extended or truncated. Use widest_int
1835 so that any extension is done according ARG1's type. */
1836 return force_fit_type (type
, wi::to_widest (arg1
),
1837 !POINTER_TYPE_P (TREE_TYPE (arg1
)),
1838 TREE_OVERFLOW (arg1
));
1841 /* A subroutine of fold_convert_const handling conversions a REAL_CST
1842 to an integer type. */
1845 fold_convert_const_int_from_real (enum tree_code code
, tree type
, const_tree arg1
)
1847 bool overflow
= false;
1850 /* The following code implements the floating point to integer
1851 conversion rules required by the Java Language Specification,
1852 that IEEE NaNs are mapped to zero and values that overflow
1853 the target precision saturate, i.e. values greater than
1854 INT_MAX are mapped to INT_MAX, and values less than INT_MIN
1855 are mapped to INT_MIN. These semantics are allowed by the
1856 C and C++ standards that simply state that the behavior of
1857 FP-to-integer conversion is unspecified upon overflow. */
1861 REAL_VALUE_TYPE x
= TREE_REAL_CST (arg1
);
1865 case FIX_TRUNC_EXPR
:
1866 real_trunc (&r
, VOIDmode
, &x
);
1873 /* If R is NaN, return zero and show we have an overflow. */
1874 if (REAL_VALUE_ISNAN (r
))
1877 val
= wi::zero (TYPE_PRECISION (type
));
1880 /* See if R is less than the lower bound or greater than the
1885 tree lt
= TYPE_MIN_VALUE (type
);
1886 REAL_VALUE_TYPE l
= real_value_from_int_cst (NULL_TREE
, lt
);
1887 if (REAL_VALUES_LESS (r
, l
))
1896 tree ut
= TYPE_MAX_VALUE (type
);
1899 REAL_VALUE_TYPE u
= real_value_from_int_cst (NULL_TREE
, ut
);
1900 if (REAL_VALUES_LESS (u
, r
))
1909 val
= real_to_integer (&r
, &overflow
, TYPE_PRECISION (type
));
1911 t
= force_fit_type (type
, val
, -1, overflow
| TREE_OVERFLOW (arg1
));
1915 /* A subroutine of fold_convert_const handling conversions of a
1916 FIXED_CST to an integer type. */
1919 fold_convert_const_int_from_fixed (tree type
, const_tree arg1
)
1922 double_int temp
, temp_trunc
;
1925 /* Right shift FIXED_CST to temp by fbit. */
1926 temp
= TREE_FIXED_CST (arg1
).data
;
1927 mode
= TREE_FIXED_CST (arg1
).mode
;
1928 if (GET_MODE_FBIT (mode
) < HOST_BITS_PER_DOUBLE_INT
)
1930 temp
= temp
.rshift (GET_MODE_FBIT (mode
),
1931 HOST_BITS_PER_DOUBLE_INT
,
1932 SIGNED_FIXED_POINT_MODE_P (mode
));
1934 /* Left shift temp to temp_trunc by fbit. */
1935 temp_trunc
= temp
.lshift (GET_MODE_FBIT (mode
),
1936 HOST_BITS_PER_DOUBLE_INT
,
1937 SIGNED_FIXED_POINT_MODE_P (mode
));
1941 temp
= double_int_zero
;
1942 temp_trunc
= double_int_zero
;
1945 /* If FIXED_CST is negative, we need to round the value toward 0.
1946 By checking if the fractional bits are not zero to add 1 to temp. */
1947 if (SIGNED_FIXED_POINT_MODE_P (mode
)
1948 && temp_trunc
.is_negative ()
1949 && TREE_FIXED_CST (arg1
).data
!= temp_trunc
)
1950 temp
+= double_int_one
;
1952 /* Given a fixed-point constant, make new constant with new type,
1953 appropriately sign-extended or truncated. */
1954 t
= force_fit_type (type
, temp
, -1,
1955 (temp
.is_negative ()
1956 && (TYPE_UNSIGNED (type
)
1957 < TYPE_UNSIGNED (TREE_TYPE (arg1
))))
1958 | TREE_OVERFLOW (arg1
));
1963 /* A subroutine of fold_convert_const handling conversions a REAL_CST
1964 to another floating point type. */
1967 fold_convert_const_real_from_real (tree type
, const_tree arg1
)
1969 REAL_VALUE_TYPE value
;
1972 real_convert (&value
, TYPE_MODE (type
), &TREE_REAL_CST (arg1
));
1973 t
= build_real (type
, value
);
1975 /* If converting an infinity or NAN to a representation that doesn't
1976 have one, set the overflow bit so that we can produce some kind of
1977 error message at the appropriate point if necessary. It's not the
1978 most user-friendly message, but it's better than nothing. */
1979 if (REAL_VALUE_ISINF (TREE_REAL_CST (arg1
))
1980 && !MODE_HAS_INFINITIES (TYPE_MODE (type
)))
1981 TREE_OVERFLOW (t
) = 1;
1982 else if (REAL_VALUE_ISNAN (TREE_REAL_CST (arg1
))
1983 && !MODE_HAS_NANS (TYPE_MODE (type
)))
1984 TREE_OVERFLOW (t
) = 1;
1985 /* Regular overflow, conversion produced an infinity in a mode that
1986 can't represent them. */
1987 else if (!MODE_HAS_INFINITIES (TYPE_MODE (type
))
1988 && REAL_VALUE_ISINF (value
)
1989 && !REAL_VALUE_ISINF (TREE_REAL_CST (arg1
)))
1990 TREE_OVERFLOW (t
) = 1;
1992 TREE_OVERFLOW (t
) = TREE_OVERFLOW (arg1
);
1996 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
1997 to a floating point type. */
2000 fold_convert_const_real_from_fixed (tree type
, const_tree arg1
)
2002 REAL_VALUE_TYPE value
;
2005 real_convert_from_fixed (&value
, TYPE_MODE (type
), &TREE_FIXED_CST (arg1
));
2006 t
= build_real (type
, value
);
2008 TREE_OVERFLOW (t
) = TREE_OVERFLOW (arg1
);
2012 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2013 to another fixed-point type. */
2016 fold_convert_const_fixed_from_fixed (tree type
, const_tree arg1
)
2018 FIXED_VALUE_TYPE value
;
2022 overflow_p
= fixed_convert (&value
, TYPE_MODE (type
), &TREE_FIXED_CST (arg1
),
2023 TYPE_SATURATING (type
));
2024 t
= build_fixed (type
, value
);
2026 /* Propagate overflow flags. */
2027 if (overflow_p
| TREE_OVERFLOW (arg1
))
2028 TREE_OVERFLOW (t
) = 1;
2032 /* A subroutine of fold_convert_const handling conversions an INTEGER_CST
2033 to a fixed-point type. */
2036 fold_convert_const_fixed_from_int (tree type
, const_tree arg1
)
2038 FIXED_VALUE_TYPE value
;
2043 gcc_assert (TREE_INT_CST_NUNITS (arg1
) <= 2);
2045 di
.low
= TREE_INT_CST_ELT (arg1
, 0);
2046 if (TREE_INT_CST_NUNITS (arg1
) == 1)
2047 di
.high
= (HOST_WIDE_INT
) di
.low
< 0 ? (HOST_WIDE_INT
) -1 : 0;
2049 di
.high
= TREE_INT_CST_ELT (arg1
, 1);
2051 overflow_p
= fixed_convert_from_int (&value
, TYPE_MODE (type
), di
,
2052 TYPE_UNSIGNED (TREE_TYPE (arg1
)),
2053 TYPE_SATURATING (type
));
2054 t
= build_fixed (type
, value
);
2056 /* Propagate overflow flags. */
2057 if (overflow_p
| TREE_OVERFLOW (arg1
))
2058 TREE_OVERFLOW (t
) = 1;
2062 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2063 to a fixed-point type. */
2066 fold_convert_const_fixed_from_real (tree type
, const_tree arg1
)
2068 FIXED_VALUE_TYPE value
;
2072 overflow_p
= fixed_convert_from_real (&value
, TYPE_MODE (type
),
2073 &TREE_REAL_CST (arg1
),
2074 TYPE_SATURATING (type
));
2075 t
= build_fixed (type
, value
);
2077 /* Propagate overflow flags. */
2078 if (overflow_p
| TREE_OVERFLOW (arg1
))
2079 TREE_OVERFLOW (t
) = 1;
2083 /* Attempt to fold type conversion operation CODE of expression ARG1 to
2084 type TYPE. If no simplification can be done return NULL_TREE. */
2087 fold_convert_const (enum tree_code code
, tree type
, tree arg1
)
2089 if (TREE_TYPE (arg1
) == type
)
2092 if (POINTER_TYPE_P (type
) || INTEGRAL_TYPE_P (type
)
2093 || TREE_CODE (type
) == OFFSET_TYPE
)
2095 if (TREE_CODE (arg1
) == INTEGER_CST
)
2096 return fold_convert_const_int_from_int (type
, arg1
);
2097 else if (TREE_CODE (arg1
) == REAL_CST
)
2098 return fold_convert_const_int_from_real (code
, type
, arg1
);
2099 else if (TREE_CODE (arg1
) == FIXED_CST
)
2100 return fold_convert_const_int_from_fixed (type
, arg1
);
2102 else if (TREE_CODE (type
) == REAL_TYPE
)
2104 if (TREE_CODE (arg1
) == INTEGER_CST
)
2105 return build_real_from_int_cst (type
, arg1
);
2106 else if (TREE_CODE (arg1
) == REAL_CST
)
2107 return fold_convert_const_real_from_real (type
, arg1
);
2108 else if (TREE_CODE (arg1
) == FIXED_CST
)
2109 return fold_convert_const_real_from_fixed (type
, arg1
);
2111 else if (TREE_CODE (type
) == FIXED_POINT_TYPE
)
2113 if (TREE_CODE (arg1
) == FIXED_CST
)
2114 return fold_convert_const_fixed_from_fixed (type
, arg1
);
2115 else if (TREE_CODE (arg1
) == INTEGER_CST
)
2116 return fold_convert_const_fixed_from_int (type
, arg1
);
2117 else if (TREE_CODE (arg1
) == REAL_CST
)
2118 return fold_convert_const_fixed_from_real (type
, arg1
);
2123 /* Construct a vector of zero elements of vector type TYPE. */
2126 build_zero_vector (tree type
)
2130 t
= fold_convert_const (NOP_EXPR
, TREE_TYPE (type
), integer_zero_node
);
2131 return build_vector_from_val (type
, t
);
2134 /* Returns true, if ARG is convertible to TYPE using a NOP_EXPR. */
2137 fold_convertible_p (const_tree type
, const_tree arg
)
2139 tree orig
= TREE_TYPE (arg
);
2144 if (TREE_CODE (arg
) == ERROR_MARK
2145 || TREE_CODE (type
) == ERROR_MARK
2146 || TREE_CODE (orig
) == ERROR_MARK
)
2149 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (orig
))
2152 switch (TREE_CODE (type
))
2154 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2155 case POINTER_TYPE
: case REFERENCE_TYPE
:
2157 if (INTEGRAL_TYPE_P (orig
) || POINTER_TYPE_P (orig
)
2158 || TREE_CODE (orig
) == OFFSET_TYPE
)
2160 return (TREE_CODE (orig
) == VECTOR_TYPE
2161 && tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (orig
)));
2164 case FIXED_POINT_TYPE
:
2168 return TREE_CODE (type
) == TREE_CODE (orig
);
2175 /* Convert expression ARG to type TYPE. Used by the middle-end for
2176 simple conversions in preference to calling the front-end's convert. */
2179 fold_convert_loc (location_t loc
, tree type
, tree arg
)
2181 tree orig
= TREE_TYPE (arg
);
2187 if (TREE_CODE (arg
) == ERROR_MARK
2188 || TREE_CODE (type
) == ERROR_MARK
2189 || TREE_CODE (orig
) == ERROR_MARK
)
2190 return error_mark_node
;
2192 switch (TREE_CODE (type
))
2195 case REFERENCE_TYPE
:
2196 /* Handle conversions between pointers to different address spaces. */
2197 if (POINTER_TYPE_P (orig
)
2198 && (TYPE_ADDR_SPACE (TREE_TYPE (type
))
2199 != TYPE_ADDR_SPACE (TREE_TYPE (orig
))))
2200 return fold_build1_loc (loc
, ADDR_SPACE_CONVERT_EXPR
, type
, arg
);
2203 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2205 if (TREE_CODE (arg
) == INTEGER_CST
)
2207 tem
= fold_convert_const (NOP_EXPR
, type
, arg
);
2208 if (tem
!= NULL_TREE
)
2211 if (INTEGRAL_TYPE_P (orig
) || POINTER_TYPE_P (orig
)
2212 || TREE_CODE (orig
) == OFFSET_TYPE
)
2213 return fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
2214 if (TREE_CODE (orig
) == COMPLEX_TYPE
)
2215 return fold_convert_loc (loc
, type
,
2216 fold_build1_loc (loc
, REALPART_EXPR
,
2217 TREE_TYPE (orig
), arg
));
2218 gcc_assert (TREE_CODE (orig
) == VECTOR_TYPE
2219 && tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (orig
)));
2220 return fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
2223 if (TREE_CODE (arg
) == INTEGER_CST
)
2225 tem
= fold_convert_const (FLOAT_EXPR
, type
, arg
);
2226 if (tem
!= NULL_TREE
)
2229 else if (TREE_CODE (arg
) == REAL_CST
)
2231 tem
= fold_convert_const (NOP_EXPR
, type
, arg
);
2232 if (tem
!= NULL_TREE
)
2235 else if (TREE_CODE (arg
) == FIXED_CST
)
2237 tem
= fold_convert_const (FIXED_CONVERT_EXPR
, type
, arg
);
2238 if (tem
!= NULL_TREE
)
2242 switch (TREE_CODE (orig
))
2245 case BOOLEAN_TYPE
: case ENUMERAL_TYPE
:
2246 case POINTER_TYPE
: case REFERENCE_TYPE
:
2247 return fold_build1_loc (loc
, FLOAT_EXPR
, type
, arg
);
2250 return fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
2252 case FIXED_POINT_TYPE
:
2253 return fold_build1_loc (loc
, FIXED_CONVERT_EXPR
, type
, arg
);
2256 tem
= fold_build1_loc (loc
, REALPART_EXPR
, TREE_TYPE (orig
), arg
);
2257 return fold_convert_loc (loc
, type
, tem
);
2263 case FIXED_POINT_TYPE
:
2264 if (TREE_CODE (arg
) == FIXED_CST
|| TREE_CODE (arg
) == INTEGER_CST
2265 || TREE_CODE (arg
) == REAL_CST
)
2267 tem
= fold_convert_const (FIXED_CONVERT_EXPR
, type
, arg
);
2268 if (tem
!= NULL_TREE
)
2269 goto fold_convert_exit
;
2272 switch (TREE_CODE (orig
))
2274 case FIXED_POINT_TYPE
:
2279 return fold_build1_loc (loc
, FIXED_CONVERT_EXPR
, type
, arg
);
2282 tem
= fold_build1_loc (loc
, REALPART_EXPR
, TREE_TYPE (orig
), arg
);
2283 return fold_convert_loc (loc
, type
, tem
);
2290 switch (TREE_CODE (orig
))
2293 case BOOLEAN_TYPE
: case ENUMERAL_TYPE
:
2294 case POINTER_TYPE
: case REFERENCE_TYPE
:
2296 case FIXED_POINT_TYPE
:
2297 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
2298 fold_convert_loc (loc
, TREE_TYPE (type
), arg
),
2299 fold_convert_loc (loc
, TREE_TYPE (type
),
2300 integer_zero_node
));
2305 if (TREE_CODE (arg
) == COMPLEX_EXPR
)
2307 rpart
= fold_convert_loc (loc
, TREE_TYPE (type
),
2308 TREE_OPERAND (arg
, 0));
2309 ipart
= fold_convert_loc (loc
, TREE_TYPE (type
),
2310 TREE_OPERAND (arg
, 1));
2311 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rpart
, ipart
);
2314 arg
= save_expr (arg
);
2315 rpart
= fold_build1_loc (loc
, REALPART_EXPR
, TREE_TYPE (orig
), arg
);
2316 ipart
= fold_build1_loc (loc
, IMAGPART_EXPR
, TREE_TYPE (orig
), arg
);
2317 rpart
= fold_convert_loc (loc
, TREE_TYPE (type
), rpart
);
2318 ipart
= fold_convert_loc (loc
, TREE_TYPE (type
), ipart
);
2319 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rpart
, ipart
);
2327 if (integer_zerop (arg
))
2328 return build_zero_vector (type
);
2329 gcc_assert (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (orig
)));
2330 gcc_assert (INTEGRAL_TYPE_P (orig
) || POINTER_TYPE_P (orig
)
2331 || TREE_CODE (orig
) == VECTOR_TYPE
);
2332 return fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, type
, arg
);
2335 tem
= fold_ignored_result (arg
);
2336 return fold_build1_loc (loc
, NOP_EXPR
, type
, tem
);
2339 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (orig
))
2340 return fold_build1_loc (loc
, NOP_EXPR
, type
, arg
);
2344 protected_set_expr_location_unshare (tem
, loc
);
2348 /* Return false if expr can be assumed not to be an lvalue, true
2352 maybe_lvalue_p (const_tree x
)
2354 /* We only need to wrap lvalue tree codes. */
2355 switch (TREE_CODE (x
))
2368 case ARRAY_RANGE_REF
:
2374 case PREINCREMENT_EXPR
:
2375 case PREDECREMENT_EXPR
:
2377 case TRY_CATCH_EXPR
:
2378 case WITH_CLEANUP_EXPR
:
2387 /* Assume the worst for front-end tree codes. */
2388 if ((int)TREE_CODE (x
) >= NUM_TREE_CODES
)
2396 /* Return an expr equal to X but certainly not valid as an lvalue. */
2399 non_lvalue_loc (location_t loc
, tree x
)
2401 /* While we are in GIMPLE, NON_LVALUE_EXPR doesn't mean anything to
2406 if (! maybe_lvalue_p (x
))
2408 return build1_loc (loc
, NON_LVALUE_EXPR
, TREE_TYPE (x
), x
);
2411 /* When pedantic, return an expr equal to X but certainly not valid as a
2412 pedantic lvalue. Otherwise, return X. */
2415 pedantic_non_lvalue_loc (location_t loc
, tree x
)
2417 return protected_set_expr_location_unshare (x
, loc
);
2420 /* Given a tree comparison code, return the code that is the logical inverse.
2421 It is generally not safe to do this for floating-point comparisons, except
2422 for EQ_EXPR, NE_EXPR, ORDERED_EXPR and UNORDERED_EXPR, so we return
2423 ERROR_MARK in this case. */
2426 invert_tree_comparison (enum tree_code code
, bool honor_nans
)
2428 if (honor_nans
&& flag_trapping_math
&& code
!= EQ_EXPR
&& code
!= NE_EXPR
2429 && code
!= ORDERED_EXPR
&& code
!= UNORDERED_EXPR
)
2439 return honor_nans
? UNLE_EXPR
: LE_EXPR
;
2441 return honor_nans
? UNLT_EXPR
: LT_EXPR
;
2443 return honor_nans
? UNGE_EXPR
: GE_EXPR
;
2445 return honor_nans
? UNGT_EXPR
: GT_EXPR
;
2459 return UNORDERED_EXPR
;
2460 case UNORDERED_EXPR
:
2461 return ORDERED_EXPR
;
2467 /* Similar, but return the comparison that results if the operands are
2468 swapped. This is safe for floating-point. */
2471 swap_tree_comparison (enum tree_code code
)
2478 case UNORDERED_EXPR
:
2504 /* Convert a comparison tree code from an enum tree_code representation
2505 into a compcode bit-based encoding. This function is the inverse of
2506 compcode_to_comparison. */
2508 static enum comparison_code
2509 comparison_to_compcode (enum tree_code code
)
2526 return COMPCODE_ORD
;
2527 case UNORDERED_EXPR
:
2528 return COMPCODE_UNORD
;
2530 return COMPCODE_UNLT
;
2532 return COMPCODE_UNEQ
;
2534 return COMPCODE_UNLE
;
2536 return COMPCODE_UNGT
;
2538 return COMPCODE_LTGT
;
2540 return COMPCODE_UNGE
;
2546 /* Convert a compcode bit-based encoding of a comparison operator back
2547 to GCC's enum tree_code representation. This function is the
2548 inverse of comparison_to_compcode. */
2550 static enum tree_code
2551 compcode_to_comparison (enum comparison_code code
)
2568 return ORDERED_EXPR
;
2569 case COMPCODE_UNORD
:
2570 return UNORDERED_EXPR
;
2588 /* Return a tree for the comparison which is the combination of
2589 doing the AND or OR (depending on CODE) of the two operations LCODE
2590 and RCODE on the identical operands LL_ARG and LR_ARG. Take into account
2591 the possibility of trapping if the mode has NaNs, and return NULL_TREE
2592 if this makes the transformation invalid. */
2595 combine_comparisons (location_t loc
,
2596 enum tree_code code
, enum tree_code lcode
,
2597 enum tree_code rcode
, tree truth_type
,
2598 tree ll_arg
, tree lr_arg
)
2600 bool honor_nans
= HONOR_NANS (ll_arg
);
2601 enum comparison_code lcompcode
= comparison_to_compcode (lcode
);
2602 enum comparison_code rcompcode
= comparison_to_compcode (rcode
);
2607 case TRUTH_AND_EXPR
: case TRUTH_ANDIF_EXPR
:
2608 compcode
= lcompcode
& rcompcode
;
2611 case TRUTH_OR_EXPR
: case TRUTH_ORIF_EXPR
:
2612 compcode
= lcompcode
| rcompcode
;
2621 /* Eliminate unordered comparisons, as well as LTGT and ORD
2622 which are not used unless the mode has NaNs. */
2623 compcode
&= ~COMPCODE_UNORD
;
2624 if (compcode
== COMPCODE_LTGT
)
2625 compcode
= COMPCODE_NE
;
2626 else if (compcode
== COMPCODE_ORD
)
2627 compcode
= COMPCODE_TRUE
;
2629 else if (flag_trapping_math
)
2631 /* Check that the original operation and the optimized ones will trap
2632 under the same condition. */
2633 bool ltrap
= (lcompcode
& COMPCODE_UNORD
) == 0
2634 && (lcompcode
!= COMPCODE_EQ
)
2635 && (lcompcode
!= COMPCODE_ORD
);
2636 bool rtrap
= (rcompcode
& COMPCODE_UNORD
) == 0
2637 && (rcompcode
!= COMPCODE_EQ
)
2638 && (rcompcode
!= COMPCODE_ORD
);
2639 bool trap
= (compcode
& COMPCODE_UNORD
) == 0
2640 && (compcode
!= COMPCODE_EQ
)
2641 && (compcode
!= COMPCODE_ORD
);
2643 /* In a short-circuited boolean expression the LHS might be
2644 such that the RHS, if evaluated, will never trap. For
2645 example, in ORD (x, y) && (x < y), we evaluate the RHS only
2646 if neither x nor y is NaN. (This is a mixed blessing: for
2647 example, the expression above will never trap, hence
2648 optimizing it to x < y would be invalid). */
2649 if ((code
== TRUTH_ORIF_EXPR
&& (lcompcode
& COMPCODE_UNORD
))
2650 || (code
== TRUTH_ANDIF_EXPR
&& !(lcompcode
& COMPCODE_UNORD
)))
2653 /* If the comparison was short-circuited, and only the RHS
2654 trapped, we may now generate a spurious trap. */
2656 && (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
))
2659 /* If we changed the conditions that cause a trap, we lose. */
2660 if ((ltrap
|| rtrap
) != trap
)
2664 if (compcode
== COMPCODE_TRUE
)
2665 return constant_boolean_node (true, truth_type
);
2666 else if (compcode
== COMPCODE_FALSE
)
2667 return constant_boolean_node (false, truth_type
);
2670 enum tree_code tcode
;
2672 tcode
= compcode_to_comparison ((enum comparison_code
) compcode
);
2673 return fold_build2_loc (loc
, tcode
, truth_type
, ll_arg
, lr_arg
);
2677 /* Return nonzero if two operands (typically of the same tree node)
2678 are necessarily equal. If either argument has side-effects this
2679 function returns zero. FLAGS modifies behavior as follows:
2681 If OEP_ONLY_CONST is set, only return nonzero for constants.
2682 This function tests whether the operands are indistinguishable;
2683 it does not test whether they are equal using C's == operation.
2684 The distinction is important for IEEE floating point, because
2685 (1) -0.0 and 0.0 are distinguishable, but -0.0==0.0, and
2686 (2) two NaNs may be indistinguishable, but NaN!=NaN.
2688 If OEP_ONLY_CONST is unset, a VAR_DECL is considered equal to itself
2689 even though it may hold multiple values during a function.
2690 This is because a GCC tree node guarantees that nothing else is
2691 executed between the evaluation of its "operands" (which may often
2692 be evaluated in arbitrary order). Hence if the operands themselves
2693 don't side-effect, the VAR_DECLs, PARM_DECLs etc... must hold the
2694 same value in each operand/subexpression. Hence leaving OEP_ONLY_CONST
2695 unset means assuming isochronic (or instantaneous) tree equivalence.
2696 Unless comparing arbitrary expression trees, such as from different
2697 statements, this flag can usually be left unset.
2699 If OEP_PURE_SAME is set, then pure functions with identical arguments
2700 are considered the same. It is used when the caller has other ways
2701 to ensure that global memory is unchanged in between. */
2704 operand_equal_p (const_tree arg0
, const_tree arg1
, unsigned int flags
)
2706 /* If either is ERROR_MARK, they aren't equal. */
2707 if (TREE_CODE (arg0
) == ERROR_MARK
|| TREE_CODE (arg1
) == ERROR_MARK
2708 || TREE_TYPE (arg0
) == error_mark_node
2709 || TREE_TYPE (arg1
) == error_mark_node
)
2712 /* Similar, if either does not have a type (like a released SSA name),
2713 they aren't equal. */
2714 if (!TREE_TYPE (arg0
) || !TREE_TYPE (arg1
))
2717 /* Check equality of integer constants before bailing out due to
2718 precision differences. */
2719 if (TREE_CODE (arg0
) == INTEGER_CST
&& TREE_CODE (arg1
) == INTEGER_CST
)
2720 return tree_int_cst_equal (arg0
, arg1
);
2722 /* If both types don't have the same signedness, then we can't consider
2723 them equal. We must check this before the STRIP_NOPS calls
2724 because they may change the signedness of the arguments. As pointers
2725 strictly don't have a signedness, require either two pointers or
2726 two non-pointers as well. */
2727 if (TYPE_UNSIGNED (TREE_TYPE (arg0
)) != TYPE_UNSIGNED (TREE_TYPE (arg1
))
2728 || POINTER_TYPE_P (TREE_TYPE (arg0
)) != POINTER_TYPE_P (TREE_TYPE (arg1
)))
2731 /* We cannot consider pointers to different address space equal. */
2732 if (POINTER_TYPE_P (TREE_TYPE (arg0
)) && POINTER_TYPE_P (TREE_TYPE (arg1
))
2733 && (TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (arg0
)))
2734 != TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (arg1
)))))
2737 /* If both types don't have the same precision, then it is not safe
2739 if (element_precision (TREE_TYPE (arg0
))
2740 != element_precision (TREE_TYPE (arg1
)))
2746 /* In case both args are comparisons but with different comparison
2747 code, try to swap the comparison operands of one arg to produce
2748 a match and compare that variant. */
2749 if (TREE_CODE (arg0
) != TREE_CODE (arg1
)
2750 && COMPARISON_CLASS_P (arg0
)
2751 && COMPARISON_CLASS_P (arg1
))
2753 enum tree_code swap_code
= swap_tree_comparison (TREE_CODE (arg1
));
2755 if (TREE_CODE (arg0
) == swap_code
)
2756 return operand_equal_p (TREE_OPERAND (arg0
, 0),
2757 TREE_OPERAND (arg1
, 1), flags
)
2758 && operand_equal_p (TREE_OPERAND (arg0
, 1),
2759 TREE_OPERAND (arg1
, 0), flags
);
2762 if (TREE_CODE (arg0
) != TREE_CODE (arg1
)
2763 /* NOP_EXPR and CONVERT_EXPR are considered equal. */
2764 && !(CONVERT_EXPR_P (arg0
) && CONVERT_EXPR_P (arg1
)))
2767 /* This is needed for conversions and for COMPONENT_REF.
2768 Might as well play it safe and always test this. */
2769 if (TREE_CODE (TREE_TYPE (arg0
)) == ERROR_MARK
2770 || TREE_CODE (TREE_TYPE (arg1
)) == ERROR_MARK
2771 || TYPE_MODE (TREE_TYPE (arg0
)) != TYPE_MODE (TREE_TYPE (arg1
)))
2774 /* If ARG0 and ARG1 are the same SAVE_EXPR, they are necessarily equal.
2775 We don't care about side effects in that case because the SAVE_EXPR
2776 takes care of that for us. In all other cases, two expressions are
2777 equal if they have no side effects. If we have two identical
2778 expressions with side effects that should be treated the same due
2779 to the only side effects being identical SAVE_EXPR's, that will
2780 be detected in the recursive calls below.
2781 If we are taking an invariant address of two identical objects
2782 they are necessarily equal as well. */
2783 if (arg0
== arg1
&& ! (flags
& OEP_ONLY_CONST
)
2784 && (TREE_CODE (arg0
) == SAVE_EXPR
2785 || (flags
& OEP_CONSTANT_ADDRESS_OF
)
2786 || (! TREE_SIDE_EFFECTS (arg0
) && ! TREE_SIDE_EFFECTS (arg1
))))
2789 /* Next handle constant cases, those for which we can return 1 even
2790 if ONLY_CONST is set. */
2791 if (TREE_CONSTANT (arg0
) && TREE_CONSTANT (arg1
))
2792 switch (TREE_CODE (arg0
))
2795 return tree_int_cst_equal (arg0
, arg1
);
2798 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (arg0
),
2799 TREE_FIXED_CST (arg1
));
2802 if (REAL_VALUES_IDENTICAL (TREE_REAL_CST (arg0
),
2803 TREE_REAL_CST (arg1
)))
2807 if (!HONOR_SIGNED_ZEROS (arg0
))
2809 /* If we do not distinguish between signed and unsigned zero,
2810 consider them equal. */
2811 if (real_zerop (arg0
) && real_zerop (arg1
))
2820 if (VECTOR_CST_NELTS (arg0
) != VECTOR_CST_NELTS (arg1
))
2823 for (i
= 0; i
< VECTOR_CST_NELTS (arg0
); ++i
)
2825 if (!operand_equal_p (VECTOR_CST_ELT (arg0
, i
),
2826 VECTOR_CST_ELT (arg1
, i
), flags
))
2833 return (operand_equal_p (TREE_REALPART (arg0
), TREE_REALPART (arg1
),
2835 && operand_equal_p (TREE_IMAGPART (arg0
), TREE_IMAGPART (arg1
),
2839 return (TREE_STRING_LENGTH (arg0
) == TREE_STRING_LENGTH (arg1
)
2840 && ! memcmp (TREE_STRING_POINTER (arg0
),
2841 TREE_STRING_POINTER (arg1
),
2842 TREE_STRING_LENGTH (arg0
)));
2845 return operand_equal_p (TREE_OPERAND (arg0
, 0), TREE_OPERAND (arg1
, 0),
2846 TREE_CONSTANT (arg0
) && TREE_CONSTANT (arg1
)
2847 ? OEP_CONSTANT_ADDRESS_OF
| OEP_ADDRESS_OF
: 0);
2852 if (flags
& OEP_ONLY_CONST
)
2855 /* Define macros to test an operand from arg0 and arg1 for equality and a
2856 variant that allows null and views null as being different from any
2857 non-null value. In the latter case, if either is null, the both
2858 must be; otherwise, do the normal comparison. */
2859 #define OP_SAME(N) operand_equal_p (TREE_OPERAND (arg0, N), \
2860 TREE_OPERAND (arg1, N), flags)
2862 #define OP_SAME_WITH_NULL(N) \
2863 ((!TREE_OPERAND (arg0, N) || !TREE_OPERAND (arg1, N)) \
2864 ? TREE_OPERAND (arg0, N) == TREE_OPERAND (arg1, N) : OP_SAME (N))
2866 switch (TREE_CODE_CLASS (TREE_CODE (arg0
)))
2869 /* Two conversions are equal only if signedness and modes match. */
2870 switch (TREE_CODE (arg0
))
2873 case FIX_TRUNC_EXPR
:
2874 if (TYPE_UNSIGNED (TREE_TYPE (arg0
))
2875 != TYPE_UNSIGNED (TREE_TYPE (arg1
)))
2885 case tcc_comparison
:
2887 if (OP_SAME (0) && OP_SAME (1))
2890 /* For commutative ops, allow the other order. */
2891 return (commutative_tree_code (TREE_CODE (arg0
))
2892 && operand_equal_p (TREE_OPERAND (arg0
, 0),
2893 TREE_OPERAND (arg1
, 1), flags
)
2894 && operand_equal_p (TREE_OPERAND (arg0
, 1),
2895 TREE_OPERAND (arg1
, 0), flags
));
2898 /* If either of the pointer (or reference) expressions we are
2899 dereferencing contain a side effect, these cannot be equal,
2900 but their addresses can be. */
2901 if ((flags
& OEP_CONSTANT_ADDRESS_OF
) == 0
2902 && (TREE_SIDE_EFFECTS (arg0
)
2903 || TREE_SIDE_EFFECTS (arg1
)))
2906 switch (TREE_CODE (arg0
))
2909 if (!(flags
& OEP_ADDRESS_OF
)
2910 && (TYPE_ALIGN (TREE_TYPE (arg0
))
2911 != TYPE_ALIGN (TREE_TYPE (arg1
))))
2913 flags
&= ~(OEP_CONSTANT_ADDRESS_OF
|OEP_ADDRESS_OF
);
2920 case TARGET_MEM_REF
:
2922 /* Require equal access sizes, and similar pointer types.
2923 We can have incomplete types for array references of
2924 variable-sized arrays from the Fortran frontend
2925 though. Also verify the types are compatible. */
2926 if (!((TYPE_SIZE (TREE_TYPE (arg0
)) == TYPE_SIZE (TREE_TYPE (arg1
))
2927 || (TYPE_SIZE (TREE_TYPE (arg0
))
2928 && TYPE_SIZE (TREE_TYPE (arg1
))
2929 && operand_equal_p (TYPE_SIZE (TREE_TYPE (arg0
)),
2930 TYPE_SIZE (TREE_TYPE (arg1
)), flags
)))
2931 && types_compatible_p (TREE_TYPE (arg0
), TREE_TYPE (arg1
))
2932 && ((flags
& OEP_ADDRESS_OF
)
2933 || (alias_ptr_types_compatible_p
2934 (TREE_TYPE (TREE_OPERAND (arg0
, 1)),
2935 TREE_TYPE (TREE_OPERAND (arg1
, 1)))
2936 && (MR_DEPENDENCE_CLIQUE (arg0
)
2937 == MR_DEPENDENCE_CLIQUE (arg1
))
2938 && (MR_DEPENDENCE_BASE (arg0
)
2939 == MR_DEPENDENCE_BASE (arg1
))
2940 && (TYPE_ALIGN (TREE_TYPE (arg0
))
2941 == TYPE_ALIGN (TREE_TYPE (arg1
)))))))
2943 flags
&= ~(OEP_CONSTANT_ADDRESS_OF
|OEP_ADDRESS_OF
);
2944 return (OP_SAME (0) && OP_SAME (1)
2945 /* TARGET_MEM_REF require equal extra operands. */
2946 && (TREE_CODE (arg0
) != TARGET_MEM_REF
2947 || (OP_SAME_WITH_NULL (2)
2948 && OP_SAME_WITH_NULL (3)
2949 && OP_SAME_WITH_NULL (4))));
2952 case ARRAY_RANGE_REF
:
2953 /* Operands 2 and 3 may be null.
2954 Compare the array index by value if it is constant first as we
2955 may have different types but same value here. */
2958 flags
&= ~(OEP_CONSTANT_ADDRESS_OF
|OEP_ADDRESS_OF
);
2959 return ((tree_int_cst_equal (TREE_OPERAND (arg0
, 1),
2960 TREE_OPERAND (arg1
, 1))
2962 && OP_SAME_WITH_NULL (2)
2963 && OP_SAME_WITH_NULL (3));
2966 /* Handle operand 2 the same as for ARRAY_REF. Operand 0
2967 may be NULL when we're called to compare MEM_EXPRs. */
2968 if (!OP_SAME_WITH_NULL (0)
2971 flags
&= ~(OEP_CONSTANT_ADDRESS_OF
|OEP_ADDRESS_OF
);
2972 return OP_SAME_WITH_NULL (2);
2977 flags
&= ~(OEP_CONSTANT_ADDRESS_OF
|OEP_ADDRESS_OF
);
2978 return OP_SAME (1) && OP_SAME (2);
2984 case tcc_expression
:
2985 switch (TREE_CODE (arg0
))
2988 return operand_equal_p (TREE_OPERAND (arg0
, 0),
2989 TREE_OPERAND (arg1
, 0),
2990 flags
| OEP_ADDRESS_OF
);
2992 case TRUTH_NOT_EXPR
:
2995 case TRUTH_ANDIF_EXPR
:
2996 case TRUTH_ORIF_EXPR
:
2997 return OP_SAME (0) && OP_SAME (1);
3000 case WIDEN_MULT_PLUS_EXPR
:
3001 case WIDEN_MULT_MINUS_EXPR
:
3004 /* The multiplcation operands are commutative. */
3007 case TRUTH_AND_EXPR
:
3009 case TRUTH_XOR_EXPR
:
3010 if (OP_SAME (0) && OP_SAME (1))
3013 /* Otherwise take into account this is a commutative operation. */
3014 return (operand_equal_p (TREE_OPERAND (arg0
, 0),
3015 TREE_OPERAND (arg1
, 1), flags
)
3016 && operand_equal_p (TREE_OPERAND (arg0
, 1),
3017 TREE_OPERAND (arg1
, 0), flags
));
3022 return OP_SAME (0) && OP_SAME (1) && OP_SAME (2);
3029 switch (TREE_CODE (arg0
))
3032 if ((CALL_EXPR_FN (arg0
) == NULL_TREE
)
3033 != (CALL_EXPR_FN (arg1
) == NULL_TREE
))
3034 /* If not both CALL_EXPRs are either internal or normal function
3035 functions, then they are not equal. */
3037 else if (CALL_EXPR_FN (arg0
) == NULL_TREE
)
3039 /* If the CALL_EXPRs call different internal functions, then they
3041 if (CALL_EXPR_IFN (arg0
) != CALL_EXPR_IFN (arg1
))
3046 /* If the CALL_EXPRs call different functions, then they are not
3048 if (! operand_equal_p (CALL_EXPR_FN (arg0
), CALL_EXPR_FN (arg1
),
3054 unsigned int cef
= call_expr_flags (arg0
);
3055 if (flags
& OEP_PURE_SAME
)
3056 cef
&= ECF_CONST
| ECF_PURE
;
3063 /* Now see if all the arguments are the same. */
3065 const_call_expr_arg_iterator iter0
, iter1
;
3067 for (a0
= first_const_call_expr_arg (arg0
, &iter0
),
3068 a1
= first_const_call_expr_arg (arg1
, &iter1
);
3070 a0
= next_const_call_expr_arg (&iter0
),
3071 a1
= next_const_call_expr_arg (&iter1
))
3072 if (! operand_equal_p (a0
, a1
, flags
))
3075 /* If we get here and both argument lists are exhausted
3076 then the CALL_EXPRs are equal. */
3077 return ! (a0
|| a1
);
3083 case tcc_declaration
:
3084 /* Consider __builtin_sqrt equal to sqrt. */
3085 return (TREE_CODE (arg0
) == FUNCTION_DECL
3086 && DECL_BUILT_IN (arg0
) && DECL_BUILT_IN (arg1
)
3087 && DECL_BUILT_IN_CLASS (arg0
) == DECL_BUILT_IN_CLASS (arg1
)
3088 && DECL_FUNCTION_CODE (arg0
) == DECL_FUNCTION_CODE (arg1
));
3095 #undef OP_SAME_WITH_NULL
3098 /* Similar to operand_equal_p, but see if ARG0 might have been made by
3099 shorten_compare from ARG1 when ARG1 was being compared with OTHER.
3101 When in doubt, return 0. */
3104 operand_equal_for_comparison_p (tree arg0
, tree arg1
, tree other
)
3106 int unsignedp1
, unsignedpo
;
3107 tree primarg0
, primarg1
, primother
;
3108 unsigned int correct_width
;
3110 if (operand_equal_p (arg0
, arg1
, 0))
3113 if (! INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
3114 || ! INTEGRAL_TYPE_P (TREE_TYPE (arg1
)))
3117 /* Discard any conversions that don't change the modes of ARG0 and ARG1
3118 and see if the inner values are the same. This removes any
3119 signedness comparison, which doesn't matter here. */
3120 primarg0
= arg0
, primarg1
= arg1
;
3121 STRIP_NOPS (primarg0
);
3122 STRIP_NOPS (primarg1
);
3123 if (operand_equal_p (primarg0
, primarg1
, 0))
3126 /* Duplicate what shorten_compare does to ARG1 and see if that gives the
3127 actual comparison operand, ARG0.
3129 First throw away any conversions to wider types
3130 already present in the operands. */
3132 primarg1
= get_narrower (arg1
, &unsignedp1
);
3133 primother
= get_narrower (other
, &unsignedpo
);
3135 correct_width
= TYPE_PRECISION (TREE_TYPE (arg1
));
3136 if (unsignedp1
== unsignedpo
3137 && TYPE_PRECISION (TREE_TYPE (primarg1
)) < correct_width
3138 && TYPE_PRECISION (TREE_TYPE (primother
)) < correct_width
)
3140 tree type
= TREE_TYPE (arg0
);
3142 /* Make sure shorter operand is extended the right way
3143 to match the longer operand. */
3144 primarg1
= fold_convert (signed_or_unsigned_type_for
3145 (unsignedp1
, TREE_TYPE (primarg1
)), primarg1
);
3147 if (operand_equal_p (arg0
, fold_convert (type
, primarg1
), 0))
3154 /* See if ARG is an expression that is either a comparison or is performing
3155 arithmetic on comparisons. The comparisons must only be comparing
3156 two different values, which will be stored in *CVAL1 and *CVAL2; if
3157 they are nonzero it means that some operands have already been found.
3158 No variables may be used anywhere else in the expression except in the
3159 comparisons. If SAVE_P is true it means we removed a SAVE_EXPR around
3160 the expression and save_expr needs to be called with CVAL1 and CVAL2.
3162 If this is true, return 1. Otherwise, return zero. */
3165 twoval_comparison_p (tree arg
, tree
*cval1
, tree
*cval2
, int *save_p
)
3167 enum tree_code code
= TREE_CODE (arg
);
3168 enum tree_code_class tclass
= TREE_CODE_CLASS (code
);
3170 /* We can handle some of the tcc_expression cases here. */
3171 if (tclass
== tcc_expression
&& code
== TRUTH_NOT_EXPR
)
3173 else if (tclass
== tcc_expression
3174 && (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
3175 || code
== COMPOUND_EXPR
))
3176 tclass
= tcc_binary
;
3178 else if (tclass
== tcc_expression
&& code
== SAVE_EXPR
3179 && ! TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
3181 /* If we've already found a CVAL1 or CVAL2, this expression is
3182 two complex to handle. */
3183 if (*cval1
|| *cval2
)
3193 return twoval_comparison_p (TREE_OPERAND (arg
, 0), cval1
, cval2
, save_p
);
3196 return (twoval_comparison_p (TREE_OPERAND (arg
, 0), cval1
, cval2
, save_p
)
3197 && twoval_comparison_p (TREE_OPERAND (arg
, 1),
3198 cval1
, cval2
, save_p
));
3203 case tcc_expression
:
3204 if (code
== COND_EXPR
)
3205 return (twoval_comparison_p (TREE_OPERAND (arg
, 0),
3206 cval1
, cval2
, save_p
)
3207 && twoval_comparison_p (TREE_OPERAND (arg
, 1),
3208 cval1
, cval2
, save_p
)
3209 && twoval_comparison_p (TREE_OPERAND (arg
, 2),
3210 cval1
, cval2
, save_p
));
3213 case tcc_comparison
:
3214 /* First see if we can handle the first operand, then the second. For
3215 the second operand, we know *CVAL1 can't be zero. It must be that
3216 one side of the comparison is each of the values; test for the
3217 case where this isn't true by failing if the two operands
3220 if (operand_equal_p (TREE_OPERAND (arg
, 0),
3221 TREE_OPERAND (arg
, 1), 0))
3225 *cval1
= TREE_OPERAND (arg
, 0);
3226 else if (operand_equal_p (*cval1
, TREE_OPERAND (arg
, 0), 0))
3228 else if (*cval2
== 0)
3229 *cval2
= TREE_OPERAND (arg
, 0);
3230 else if (operand_equal_p (*cval2
, TREE_OPERAND (arg
, 0), 0))
3235 if (operand_equal_p (*cval1
, TREE_OPERAND (arg
, 1), 0))
3237 else if (*cval2
== 0)
3238 *cval2
= TREE_OPERAND (arg
, 1);
3239 else if (operand_equal_p (*cval2
, TREE_OPERAND (arg
, 1), 0))
3251 /* ARG is a tree that is known to contain just arithmetic operations and
3252 comparisons. Evaluate the operations in the tree substituting NEW0 for
3253 any occurrence of OLD0 as an operand of a comparison and likewise for
3257 eval_subst (location_t loc
, tree arg
, tree old0
, tree new0
,
3258 tree old1
, tree new1
)
3260 tree type
= TREE_TYPE (arg
);
3261 enum tree_code code
= TREE_CODE (arg
);
3262 enum tree_code_class tclass
= TREE_CODE_CLASS (code
);
3264 /* We can handle some of the tcc_expression cases here. */
3265 if (tclass
== tcc_expression
&& code
== TRUTH_NOT_EXPR
)
3267 else if (tclass
== tcc_expression
3268 && (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
))
3269 tclass
= tcc_binary
;
3274 return fold_build1_loc (loc
, code
, type
,
3275 eval_subst (loc
, TREE_OPERAND (arg
, 0),
3276 old0
, new0
, old1
, new1
));
3279 return fold_build2_loc (loc
, code
, type
,
3280 eval_subst (loc
, TREE_OPERAND (arg
, 0),
3281 old0
, new0
, old1
, new1
),
3282 eval_subst (loc
, TREE_OPERAND (arg
, 1),
3283 old0
, new0
, old1
, new1
));
3285 case tcc_expression
:
3289 return eval_subst (loc
, TREE_OPERAND (arg
, 0), old0
, new0
,
3293 return eval_subst (loc
, TREE_OPERAND (arg
, 1), old0
, new0
,
3297 return fold_build3_loc (loc
, code
, type
,
3298 eval_subst (loc
, TREE_OPERAND (arg
, 0),
3299 old0
, new0
, old1
, new1
),
3300 eval_subst (loc
, TREE_OPERAND (arg
, 1),
3301 old0
, new0
, old1
, new1
),
3302 eval_subst (loc
, TREE_OPERAND (arg
, 2),
3303 old0
, new0
, old1
, new1
));
3307 /* Fall through - ??? */
3309 case tcc_comparison
:
3311 tree arg0
= TREE_OPERAND (arg
, 0);
3312 tree arg1
= TREE_OPERAND (arg
, 1);
3314 /* We need to check both for exact equality and tree equality. The
3315 former will be true if the operand has a side-effect. In that
3316 case, we know the operand occurred exactly once. */
3318 if (arg0
== old0
|| operand_equal_p (arg0
, old0
, 0))
3320 else if (arg0
== old1
|| operand_equal_p (arg0
, old1
, 0))
3323 if (arg1
== old0
|| operand_equal_p (arg1
, old0
, 0))
3325 else if (arg1
== old1
|| operand_equal_p (arg1
, old1
, 0))
3328 return fold_build2_loc (loc
, code
, type
, arg0
, arg1
);
3336 /* Return a tree for the case when the result of an expression is RESULT
3337 converted to TYPE and OMITTED was previously an operand of the expression
3338 but is now not needed (e.g., we folded OMITTED * 0).
3340 If OMITTED has side effects, we must evaluate it. Otherwise, just do
3341 the conversion of RESULT to TYPE. */
3344 omit_one_operand_loc (location_t loc
, tree type
, tree result
, tree omitted
)
3346 tree t
= fold_convert_loc (loc
, type
, result
);
3348 /* If the resulting operand is an empty statement, just return the omitted
3349 statement casted to void. */
3350 if (IS_EMPTY_STMT (t
) && TREE_SIDE_EFFECTS (omitted
))
3351 return build1_loc (loc
, NOP_EXPR
, void_type_node
,
3352 fold_ignored_result (omitted
));
3354 if (TREE_SIDE_EFFECTS (omitted
))
3355 return build2_loc (loc
, COMPOUND_EXPR
, type
,
3356 fold_ignored_result (omitted
), t
);
3358 return non_lvalue_loc (loc
, t
);
3361 /* Return a tree for the case when the result of an expression is RESULT
3362 converted to TYPE and OMITTED1 and OMITTED2 were previously operands
3363 of the expression but are now not needed.
3365 If OMITTED1 or OMITTED2 has side effects, they must be evaluated.
3366 If both OMITTED1 and OMITTED2 have side effects, OMITTED1 is
3367 evaluated before OMITTED2. Otherwise, if neither has side effects,
3368 just do the conversion of RESULT to TYPE. */
3371 omit_two_operands_loc (location_t loc
, tree type
, tree result
,
3372 tree omitted1
, tree omitted2
)
3374 tree t
= fold_convert_loc (loc
, type
, result
);
3376 if (TREE_SIDE_EFFECTS (omitted2
))
3377 t
= build2_loc (loc
, COMPOUND_EXPR
, type
, omitted2
, t
);
3378 if (TREE_SIDE_EFFECTS (omitted1
))
3379 t
= build2_loc (loc
, COMPOUND_EXPR
, type
, omitted1
, t
);
3381 return TREE_CODE (t
) != COMPOUND_EXPR
? non_lvalue_loc (loc
, t
) : t
;
3385 /* Return a simplified tree node for the truth-negation of ARG. This
3386 never alters ARG itself. We assume that ARG is an operation that
3387 returns a truth value (0 or 1).
3389 FIXME: one would think we would fold the result, but it causes
3390 problems with the dominator optimizer. */
3393 fold_truth_not_expr (location_t loc
, tree arg
)
3395 tree type
= TREE_TYPE (arg
);
3396 enum tree_code code
= TREE_CODE (arg
);
3397 location_t loc1
, loc2
;
3399 /* If this is a comparison, we can simply invert it, except for
3400 floating-point non-equality comparisons, in which case we just
3401 enclose a TRUTH_NOT_EXPR around what we have. */
3403 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
3405 tree op_type
= TREE_TYPE (TREE_OPERAND (arg
, 0));
3406 if (FLOAT_TYPE_P (op_type
)
3407 && flag_trapping_math
3408 && code
!= ORDERED_EXPR
&& code
!= UNORDERED_EXPR
3409 && code
!= NE_EXPR
&& code
!= EQ_EXPR
)
3412 code
= invert_tree_comparison (code
, HONOR_NANS (op_type
));
3413 if (code
== ERROR_MARK
)
3416 return build2_loc (loc
, code
, type
, TREE_OPERAND (arg
, 0),
3417 TREE_OPERAND (arg
, 1));
3423 return constant_boolean_node (integer_zerop (arg
), type
);
3425 case TRUTH_AND_EXPR
:
3426 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3427 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3428 return build2_loc (loc
, TRUTH_OR_EXPR
, type
,
3429 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
3430 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
3433 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3434 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3435 return build2_loc (loc
, TRUTH_AND_EXPR
, type
,
3436 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
3437 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
3439 case TRUTH_XOR_EXPR
:
3440 /* Here we can invert either operand. We invert the first operand
3441 unless the second operand is a TRUTH_NOT_EXPR in which case our
3442 result is the XOR of the first operand with the inside of the
3443 negation of the second operand. */
3445 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == TRUTH_NOT_EXPR
)
3446 return build2_loc (loc
, TRUTH_XOR_EXPR
, type
, TREE_OPERAND (arg
, 0),
3447 TREE_OPERAND (TREE_OPERAND (arg
, 1), 0));
3449 return build2_loc (loc
, TRUTH_XOR_EXPR
, type
,
3450 invert_truthvalue_loc (loc
, TREE_OPERAND (arg
, 0)),
3451 TREE_OPERAND (arg
, 1));
3453 case TRUTH_ANDIF_EXPR
:
3454 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3455 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3456 return build2_loc (loc
, TRUTH_ORIF_EXPR
, type
,
3457 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
3458 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
3460 case TRUTH_ORIF_EXPR
:
3461 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3462 loc2
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3463 return build2_loc (loc
, TRUTH_ANDIF_EXPR
, type
,
3464 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)),
3465 invert_truthvalue_loc (loc2
, TREE_OPERAND (arg
, 1)));
3467 case TRUTH_NOT_EXPR
:
3468 return TREE_OPERAND (arg
, 0);
3472 tree arg1
= TREE_OPERAND (arg
, 1);
3473 tree arg2
= TREE_OPERAND (arg
, 2);
3475 loc1
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3476 loc2
= expr_location_or (TREE_OPERAND (arg
, 2), loc
);
3478 /* A COND_EXPR may have a throw as one operand, which
3479 then has void type. Just leave void operands
3481 return build3_loc (loc
, COND_EXPR
, type
, TREE_OPERAND (arg
, 0),
3482 VOID_TYPE_P (TREE_TYPE (arg1
))
3483 ? arg1
: invert_truthvalue_loc (loc1
, arg1
),
3484 VOID_TYPE_P (TREE_TYPE (arg2
))
3485 ? arg2
: invert_truthvalue_loc (loc2
, arg2
));
3489 loc1
= expr_location_or (TREE_OPERAND (arg
, 1), loc
);
3490 return build2_loc (loc
, COMPOUND_EXPR
, type
,
3491 TREE_OPERAND (arg
, 0),
3492 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 1)));
3494 case NON_LVALUE_EXPR
:
3495 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3496 return invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0));
3499 if (TREE_CODE (TREE_TYPE (arg
)) == BOOLEAN_TYPE
)
3500 return build1_loc (loc
, TRUTH_NOT_EXPR
, type
, arg
);
3502 /* ... fall through ... */
3505 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3506 return build1_loc (loc
, TREE_CODE (arg
), type
,
3507 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)));
3510 if (!integer_onep (TREE_OPERAND (arg
, 1)))
3512 return build2_loc (loc
, EQ_EXPR
, type
, arg
, build_int_cst (type
, 0));
3515 return build1_loc (loc
, TRUTH_NOT_EXPR
, type
, arg
);
3517 case CLEANUP_POINT_EXPR
:
3518 loc1
= expr_location_or (TREE_OPERAND (arg
, 0), loc
);
3519 return build1_loc (loc
, CLEANUP_POINT_EXPR
, type
,
3520 invert_truthvalue_loc (loc1
, TREE_OPERAND (arg
, 0)));
3527 /* Fold the truth-negation of ARG. This never alters ARG itself. We
3528 assume that ARG is an operation that returns a truth value (0 or 1
3529 for scalars, 0 or -1 for vectors). Return the folded expression if
3530 folding is successful. Otherwise, return NULL_TREE. */
3533 fold_invert_truthvalue (location_t loc
, tree arg
)
3535 tree type
= TREE_TYPE (arg
);
3536 return fold_unary_loc (loc
, VECTOR_TYPE_P (type
)
3542 /* Return a simplified tree node for the truth-negation of ARG. This
3543 never alters ARG itself. We assume that ARG is an operation that
3544 returns a truth value (0 or 1 for scalars, 0 or -1 for vectors). */
3547 invert_truthvalue_loc (location_t loc
, tree arg
)
3549 if (TREE_CODE (arg
) == ERROR_MARK
)
3552 tree type
= TREE_TYPE (arg
);
3553 return fold_build1_loc (loc
, VECTOR_TYPE_P (type
)
3559 /* Given a bit-wise operation CODE applied to ARG0 and ARG1, see if both
3560 operands are another bit-wise operation with a common input. If so,
3561 distribute the bit operations to save an operation and possibly two if
3562 constants are involved. For example, convert
3563 (A | B) & (A | C) into A | (B & C)
3564 Further simplification will occur if B and C are constants.
3566 If this optimization cannot be done, 0 will be returned. */
3569 distribute_bit_expr (location_t loc
, enum tree_code code
, tree type
,
3570 tree arg0
, tree arg1
)
3575 if (TREE_CODE (arg0
) != TREE_CODE (arg1
)
3576 || TREE_CODE (arg0
) == code
3577 || (TREE_CODE (arg0
) != BIT_AND_EXPR
3578 && TREE_CODE (arg0
) != BIT_IOR_EXPR
))
3581 if (operand_equal_p (TREE_OPERAND (arg0
, 0), TREE_OPERAND (arg1
, 0), 0))
3583 common
= TREE_OPERAND (arg0
, 0);
3584 left
= TREE_OPERAND (arg0
, 1);
3585 right
= TREE_OPERAND (arg1
, 1);
3587 else if (operand_equal_p (TREE_OPERAND (arg0
, 0), TREE_OPERAND (arg1
, 1), 0))
3589 common
= TREE_OPERAND (arg0
, 0);
3590 left
= TREE_OPERAND (arg0
, 1);
3591 right
= TREE_OPERAND (arg1
, 0);
3593 else if (operand_equal_p (TREE_OPERAND (arg0
, 1), TREE_OPERAND (arg1
, 0), 0))
3595 common
= TREE_OPERAND (arg0
, 1);
3596 left
= TREE_OPERAND (arg0
, 0);
3597 right
= TREE_OPERAND (arg1
, 1);
3599 else if (operand_equal_p (TREE_OPERAND (arg0
, 1), TREE_OPERAND (arg1
, 1), 0))
3601 common
= TREE_OPERAND (arg0
, 1);
3602 left
= TREE_OPERAND (arg0
, 0);
3603 right
= TREE_OPERAND (arg1
, 0);
3608 common
= fold_convert_loc (loc
, type
, common
);
3609 left
= fold_convert_loc (loc
, type
, left
);
3610 right
= fold_convert_loc (loc
, type
, right
);
3611 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
, common
,
3612 fold_build2_loc (loc
, code
, type
, left
, right
));
3615 /* Knowing that ARG0 and ARG1 are both RDIV_EXPRs, simplify a binary operation
3616 with code CODE. This optimization is unsafe. */
3618 distribute_real_division (location_t loc
, enum tree_code code
, tree type
,
3619 tree arg0
, tree arg1
)
3621 bool mul0
= TREE_CODE (arg0
) == MULT_EXPR
;
3622 bool mul1
= TREE_CODE (arg1
) == MULT_EXPR
;
3624 /* (A / C) +- (B / C) -> (A +- B) / C. */
3626 && operand_equal_p (TREE_OPERAND (arg0
, 1),
3627 TREE_OPERAND (arg1
, 1), 0))
3628 return fold_build2_loc (loc
, mul0
? MULT_EXPR
: RDIV_EXPR
, type
,
3629 fold_build2_loc (loc
, code
, type
,
3630 TREE_OPERAND (arg0
, 0),
3631 TREE_OPERAND (arg1
, 0)),
3632 TREE_OPERAND (arg0
, 1));
3634 /* (A / C1) +- (A / C2) -> A * (1 / C1 +- 1 / C2). */
3635 if (operand_equal_p (TREE_OPERAND (arg0
, 0),
3636 TREE_OPERAND (arg1
, 0), 0)
3637 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == REAL_CST
3638 && TREE_CODE (TREE_OPERAND (arg1
, 1)) == REAL_CST
)
3640 REAL_VALUE_TYPE r0
, r1
;
3641 r0
= TREE_REAL_CST (TREE_OPERAND (arg0
, 1));
3642 r1
= TREE_REAL_CST (TREE_OPERAND (arg1
, 1));
3644 real_arithmetic (&r0
, RDIV_EXPR
, &dconst1
, &r0
);
3646 real_arithmetic (&r1
, RDIV_EXPR
, &dconst1
, &r1
);
3647 real_arithmetic (&r0
, code
, &r0
, &r1
);
3648 return fold_build2_loc (loc
, MULT_EXPR
, type
,
3649 TREE_OPERAND (arg0
, 0),
3650 build_real (type
, r0
));
3656 /* Return a BIT_FIELD_REF of type TYPE to refer to BITSIZE bits of INNER
3657 starting at BITPOS. The field is unsigned if UNSIGNEDP is nonzero. */
3660 make_bit_field_ref (location_t loc
, tree inner
, tree type
,
3661 HOST_WIDE_INT bitsize
, HOST_WIDE_INT bitpos
, int unsignedp
)
3663 tree result
, bftype
;
3667 tree size
= TYPE_SIZE (TREE_TYPE (inner
));
3668 if ((INTEGRAL_TYPE_P (TREE_TYPE (inner
))
3669 || POINTER_TYPE_P (TREE_TYPE (inner
)))
3670 && tree_fits_shwi_p (size
)
3671 && tree_to_shwi (size
) == bitsize
)
3672 return fold_convert_loc (loc
, type
, inner
);
3676 if (TYPE_PRECISION (bftype
) != bitsize
3677 || TYPE_UNSIGNED (bftype
) == !unsignedp
)
3678 bftype
= build_nonstandard_integer_type (bitsize
, 0);
3680 result
= build3_loc (loc
, BIT_FIELD_REF
, bftype
, inner
,
3681 size_int (bitsize
), bitsize_int (bitpos
));
3684 result
= fold_convert_loc (loc
, type
, result
);
3689 /* Optimize a bit-field compare.
3691 There are two cases: First is a compare against a constant and the
3692 second is a comparison of two items where the fields are at the same
3693 bit position relative to the start of a chunk (byte, halfword, word)
3694 large enough to contain it. In these cases we can avoid the shift
3695 implicit in bitfield extractions.
3697 For constants, we emit a compare of the shifted constant with the
3698 BIT_AND_EXPR of a mask and a byte, halfword, or word of the operand being
3699 compared. For two fields at the same position, we do the ANDs with the
3700 similar mask and compare the result of the ANDs.
3702 CODE is the comparison code, known to be either NE_EXPR or EQ_EXPR.
3703 COMPARE_TYPE is the type of the comparison, and LHS and RHS
3704 are the left and right operands of the comparison, respectively.
3706 If the optimization described above can be done, we return the resulting
3707 tree. Otherwise we return zero. */
3710 optimize_bit_field_compare (location_t loc
, enum tree_code code
,
3711 tree compare_type
, tree lhs
, tree rhs
)
3713 HOST_WIDE_INT lbitpos
, lbitsize
, rbitpos
, rbitsize
, nbitpos
, nbitsize
;
3714 tree type
= TREE_TYPE (lhs
);
3716 int const_p
= TREE_CODE (rhs
) == INTEGER_CST
;
3717 machine_mode lmode
, rmode
, nmode
;
3718 int lunsignedp
, runsignedp
;
3719 int lvolatilep
= 0, rvolatilep
= 0;
3720 tree linner
, rinner
= NULL_TREE
;
3724 /* Get all the information about the extractions being done. If the bit size
3725 if the same as the size of the underlying object, we aren't doing an
3726 extraction at all and so can do nothing. We also don't want to
3727 do anything if the inner expression is a PLACEHOLDER_EXPR since we
3728 then will no longer be able to replace it. */
3729 linner
= get_inner_reference (lhs
, &lbitsize
, &lbitpos
, &offset
, &lmode
,
3730 &lunsignedp
, &lvolatilep
, false);
3731 if (linner
== lhs
|| lbitsize
== GET_MODE_BITSIZE (lmode
) || lbitsize
< 0
3732 || offset
!= 0 || TREE_CODE (linner
) == PLACEHOLDER_EXPR
|| lvolatilep
)
3737 /* If this is not a constant, we can only do something if bit positions,
3738 sizes, and signedness are the same. */
3739 rinner
= get_inner_reference (rhs
, &rbitsize
, &rbitpos
, &offset
, &rmode
,
3740 &runsignedp
, &rvolatilep
, false);
3742 if (rinner
== rhs
|| lbitpos
!= rbitpos
|| lbitsize
!= rbitsize
3743 || lunsignedp
!= runsignedp
|| offset
!= 0
3744 || TREE_CODE (rinner
) == PLACEHOLDER_EXPR
|| rvolatilep
)
3748 /* See if we can find a mode to refer to this field. We should be able to,
3749 but fail if we can't. */
3750 nmode
= get_best_mode (lbitsize
, lbitpos
, 0, 0,
3751 const_p
? TYPE_ALIGN (TREE_TYPE (linner
))
3752 : MIN (TYPE_ALIGN (TREE_TYPE (linner
)),
3753 TYPE_ALIGN (TREE_TYPE (rinner
))),
3755 if (nmode
== VOIDmode
)
3758 /* Set signed and unsigned types of the precision of this mode for the
3760 unsigned_type
= lang_hooks
.types
.type_for_mode (nmode
, 1);
3762 /* Compute the bit position and size for the new reference and our offset
3763 within it. If the new reference is the same size as the original, we
3764 won't optimize anything, so return zero. */
3765 nbitsize
= GET_MODE_BITSIZE (nmode
);
3766 nbitpos
= lbitpos
& ~ (nbitsize
- 1);
3768 if (nbitsize
== lbitsize
)
3771 if (BYTES_BIG_ENDIAN
)
3772 lbitpos
= nbitsize
- lbitsize
- lbitpos
;
3774 /* Make the mask to be used against the extracted field. */
3775 mask
= build_int_cst_type (unsigned_type
, -1);
3776 mask
= const_binop (LSHIFT_EXPR
, mask
, size_int (nbitsize
- lbitsize
));
3777 mask
= const_binop (RSHIFT_EXPR
, mask
,
3778 size_int (nbitsize
- lbitsize
- lbitpos
));
3781 /* If not comparing with constant, just rework the comparison
3783 return fold_build2_loc (loc
, code
, compare_type
,
3784 fold_build2_loc (loc
, BIT_AND_EXPR
, unsigned_type
,
3785 make_bit_field_ref (loc
, linner
,
3790 fold_build2_loc (loc
, BIT_AND_EXPR
, unsigned_type
,
3791 make_bit_field_ref (loc
, rinner
,
3797 /* Otherwise, we are handling the constant case. See if the constant is too
3798 big for the field. Warn and return a tree of for 0 (false) if so. We do
3799 this not only for its own sake, but to avoid having to test for this
3800 error case below. If we didn't, we might generate wrong code.
3802 For unsigned fields, the constant shifted right by the field length should
3803 be all zero. For signed fields, the high-order bits should agree with
3808 if (wi::lrshift (rhs
, lbitsize
) != 0)
3810 warning (0, "comparison is always %d due to width of bit-field",
3812 return constant_boolean_node (code
== NE_EXPR
, compare_type
);
3817 wide_int tem
= wi::arshift (rhs
, lbitsize
- 1);
3818 if (tem
!= 0 && tem
!= -1)
3820 warning (0, "comparison is always %d due to width of bit-field",
3822 return constant_boolean_node (code
== NE_EXPR
, compare_type
);
3826 /* Single-bit compares should always be against zero. */
3827 if (lbitsize
== 1 && ! integer_zerop (rhs
))
3829 code
= code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
;
3830 rhs
= build_int_cst (type
, 0);
3833 /* Make a new bitfield reference, shift the constant over the
3834 appropriate number of bits and mask it with the computed mask
3835 (in case this was a signed field). If we changed it, make a new one. */
3836 lhs
= make_bit_field_ref (loc
, linner
, unsigned_type
, nbitsize
, nbitpos
, 1);
3838 rhs
= const_binop (BIT_AND_EXPR
,
3839 const_binop (LSHIFT_EXPR
,
3840 fold_convert_loc (loc
, unsigned_type
, rhs
),
3841 size_int (lbitpos
)),
3844 lhs
= build2_loc (loc
, code
, compare_type
,
3845 build2 (BIT_AND_EXPR
, unsigned_type
, lhs
, mask
), rhs
);
3849 /* Subroutine for fold_truth_andor_1: decode a field reference.
3851 If EXP is a comparison reference, we return the innermost reference.
3853 *PBITSIZE is set to the number of bits in the reference, *PBITPOS is
3854 set to the starting bit number.
3856 If the innermost field can be completely contained in a mode-sized
3857 unit, *PMODE is set to that mode. Otherwise, it is set to VOIDmode.
3859 *PVOLATILEP is set to 1 if the any expression encountered is volatile;
3860 otherwise it is not changed.
3862 *PUNSIGNEDP is set to the signedness of the field.
3864 *PMASK is set to the mask used. This is either contained in a
3865 BIT_AND_EXPR or derived from the width of the field.
3867 *PAND_MASK is set to the mask found in a BIT_AND_EXPR, if any.
3869 Return 0 if this is not a component reference or is one that we can't
3870 do anything with. */
3873 decode_field_reference (location_t loc
, tree exp
, HOST_WIDE_INT
*pbitsize
,
3874 HOST_WIDE_INT
*pbitpos
, machine_mode
*pmode
,
3875 int *punsignedp
, int *pvolatilep
,
3876 tree
*pmask
, tree
*pand_mask
)
3878 tree outer_type
= 0;
3880 tree mask
, inner
, offset
;
3882 unsigned int precision
;
3884 /* All the optimizations using this function assume integer fields.
3885 There are problems with FP fields since the type_for_size call
3886 below can fail for, e.g., XFmode. */
3887 if (! INTEGRAL_TYPE_P (TREE_TYPE (exp
)))
3890 /* We are interested in the bare arrangement of bits, so strip everything
3891 that doesn't affect the machine mode. However, record the type of the
3892 outermost expression if it may matter below. */
3893 if (CONVERT_EXPR_P (exp
)
3894 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
3895 outer_type
= TREE_TYPE (exp
);
3898 if (TREE_CODE (exp
) == BIT_AND_EXPR
)
3900 and_mask
= TREE_OPERAND (exp
, 1);
3901 exp
= TREE_OPERAND (exp
, 0);
3902 STRIP_NOPS (exp
); STRIP_NOPS (and_mask
);
3903 if (TREE_CODE (and_mask
) != INTEGER_CST
)
3907 inner
= get_inner_reference (exp
, pbitsize
, pbitpos
, &offset
, pmode
,
3908 punsignedp
, pvolatilep
, false);
3909 if ((inner
== exp
&& and_mask
== 0)
3910 || *pbitsize
< 0 || offset
!= 0
3911 || TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3914 /* If the number of bits in the reference is the same as the bitsize of
3915 the outer type, then the outer type gives the signedness. Otherwise
3916 (in case of a small bitfield) the signedness is unchanged. */
3917 if (outer_type
&& *pbitsize
== TYPE_PRECISION (outer_type
))
3918 *punsignedp
= TYPE_UNSIGNED (outer_type
);
3920 /* Compute the mask to access the bitfield. */
3921 unsigned_type
= lang_hooks
.types
.type_for_size (*pbitsize
, 1);
3922 precision
= TYPE_PRECISION (unsigned_type
);
3924 mask
= build_int_cst_type (unsigned_type
, -1);
3926 mask
= const_binop (LSHIFT_EXPR
, mask
, size_int (precision
- *pbitsize
));
3927 mask
= const_binop (RSHIFT_EXPR
, mask
, size_int (precision
- *pbitsize
));
3929 /* Merge it with the mask we found in the BIT_AND_EXPR, if any. */
3931 mask
= fold_build2_loc (loc
, BIT_AND_EXPR
, unsigned_type
,
3932 fold_convert_loc (loc
, unsigned_type
, and_mask
), mask
);
3935 *pand_mask
= and_mask
;
3939 /* Return nonzero if MASK represents a mask of SIZE ones in the low-order
3940 bit positions and MASK is SIGNED. */
3943 all_ones_mask_p (const_tree mask
, unsigned int size
)
3945 tree type
= TREE_TYPE (mask
);
3946 unsigned int precision
= TYPE_PRECISION (type
);
3948 /* If this function returns true when the type of the mask is
3949 UNSIGNED, then there will be errors. In particular see
3950 gcc.c-torture/execute/990326-1.c. There does not appear to be
3951 any documentation paper trail as to why this is so. But the pre
3952 wide-int worked with that restriction and it has been preserved
3954 if (size
> precision
|| TYPE_SIGN (type
) == UNSIGNED
)
3957 return wi::mask (size
, false, precision
) == mask
;
3960 /* Subroutine for fold: determine if VAL is the INTEGER_CONST that
3961 represents the sign bit of EXP's type. If EXP represents a sign
3962 or zero extension, also test VAL against the unextended type.
3963 The return value is the (sub)expression whose sign bit is VAL,
3964 or NULL_TREE otherwise. */
3967 sign_bit_p (tree exp
, const_tree val
)
3972 /* Tree EXP must have an integral type. */
3973 t
= TREE_TYPE (exp
);
3974 if (! INTEGRAL_TYPE_P (t
))
3977 /* Tree VAL must be an integer constant. */
3978 if (TREE_CODE (val
) != INTEGER_CST
3979 || TREE_OVERFLOW (val
))
3982 width
= TYPE_PRECISION (t
);
3983 if (wi::only_sign_bit_p (val
, width
))
3986 /* Handle extension from a narrower type. */
3987 if (TREE_CODE (exp
) == NOP_EXPR
3988 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp
, 0))) < width
)
3989 return sign_bit_p (TREE_OPERAND (exp
, 0), val
);
3994 /* Subroutine for fold_truth_andor_1: determine if an operand is simple enough
3995 to be evaluated unconditionally. */
3998 simple_operand_p (const_tree exp
)
4000 /* Strip any conversions that don't change the machine mode. */
4003 return (CONSTANT_CLASS_P (exp
)
4004 || TREE_CODE (exp
) == SSA_NAME
4006 && ! TREE_ADDRESSABLE (exp
)
4007 && ! TREE_THIS_VOLATILE (exp
)
4008 && ! DECL_NONLOCAL (exp
)
4009 /* Don't regard global variables as simple. They may be
4010 allocated in ways unknown to the compiler (shared memory,
4011 #pragma weak, etc). */
4012 && ! TREE_PUBLIC (exp
)
4013 && ! DECL_EXTERNAL (exp
)
4014 /* Weakrefs are not safe to be read, since they can be NULL.
4015 They are !TREE_PUBLIC && !DECL_EXTERNAL but still
4016 have DECL_WEAK flag set. */
4017 && (! VAR_OR_FUNCTION_DECL_P (exp
) || ! DECL_WEAK (exp
))
4018 /* Loading a static variable is unduly expensive, but global
4019 registers aren't expensive. */
4020 && (! TREE_STATIC (exp
) || DECL_REGISTER (exp
))));
4023 /* Subroutine for fold_truth_andor: determine if an operand is simple enough
4024 to be evaluated unconditionally.
4025 I addition to simple_operand_p, we assume that comparisons, conversions,
4026 and logic-not operations are simple, if their operands are simple, too. */
4029 simple_operand_p_2 (tree exp
)
4031 enum tree_code code
;
4033 if (TREE_SIDE_EFFECTS (exp
)
4034 || tree_could_trap_p (exp
))
4037 while (CONVERT_EXPR_P (exp
))
4038 exp
= TREE_OPERAND (exp
, 0);
4040 code
= TREE_CODE (exp
);
4042 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
4043 return (simple_operand_p (TREE_OPERAND (exp
, 0))
4044 && simple_operand_p (TREE_OPERAND (exp
, 1)));
4046 if (code
== TRUTH_NOT_EXPR
)
4047 return simple_operand_p_2 (TREE_OPERAND (exp
, 0));
4049 return simple_operand_p (exp
);
4053 /* The following functions are subroutines to fold_range_test and allow it to
4054 try to change a logical combination of comparisons into a range test.
4057 X == 2 || X == 3 || X == 4 || X == 5
4061 (unsigned) (X - 2) <= 3
4063 We describe each set of comparisons as being either inside or outside
4064 a range, using a variable named like IN_P, and then describe the
4065 range with a lower and upper bound. If one of the bounds is omitted,
4066 it represents either the highest or lowest value of the type.
4068 In the comments below, we represent a range by two numbers in brackets
4069 preceded by a "+" to designate being inside that range, or a "-" to
4070 designate being outside that range, so the condition can be inverted by
4071 flipping the prefix. An omitted bound is represented by a "-". For
4072 example, "- [-, 10]" means being outside the range starting at the lowest
4073 possible value and ending at 10, in other words, being greater than 10.
4074 The range "+ [-, -]" is always true and hence the range "- [-, -]" is
4077 We set up things so that the missing bounds are handled in a consistent
4078 manner so neither a missing bound nor "true" and "false" need to be
4079 handled using a special case. */
4081 /* Return the result of applying CODE to ARG0 and ARG1, but handle the case
4082 of ARG0 and/or ARG1 being omitted, meaning an unlimited range. UPPER0_P
4083 and UPPER1_P are nonzero if the respective argument is an upper bound
4084 and zero for a lower. TYPE, if nonzero, is the type of the result; it
4085 must be specified for a comparison. ARG1 will be converted to ARG0's
4086 type if both are specified. */
4089 range_binop (enum tree_code code
, tree type
, tree arg0
, int upper0_p
,
4090 tree arg1
, int upper1_p
)
4096 /* If neither arg represents infinity, do the normal operation.
4097 Else, if not a comparison, return infinity. Else handle the special
4098 comparison rules. Note that most of the cases below won't occur, but
4099 are handled for consistency. */
4101 if (arg0
!= 0 && arg1
!= 0)
4103 tem
= fold_build2 (code
, type
!= 0 ? type
: TREE_TYPE (arg0
),
4104 arg0
, fold_convert (TREE_TYPE (arg0
), arg1
));
4106 return TREE_CODE (tem
) == INTEGER_CST
? tem
: 0;
4109 if (TREE_CODE_CLASS (code
) != tcc_comparison
)
4112 /* Set SGN[01] to -1 if ARG[01] is a lower bound, 1 for upper, and 0
4113 for neither. In real maths, we cannot assume open ended ranges are
4114 the same. But, this is computer arithmetic, where numbers are finite.
4115 We can therefore make the transformation of any unbounded range with
4116 the value Z, Z being greater than any representable number. This permits
4117 us to treat unbounded ranges as equal. */
4118 sgn0
= arg0
!= 0 ? 0 : (upper0_p
? 1 : -1);
4119 sgn1
= arg1
!= 0 ? 0 : (upper1_p
? 1 : -1);
4123 result
= sgn0
== sgn1
;
4126 result
= sgn0
!= sgn1
;
4129 result
= sgn0
< sgn1
;
4132 result
= sgn0
<= sgn1
;
4135 result
= sgn0
> sgn1
;
4138 result
= sgn0
>= sgn1
;
4144 return constant_boolean_node (result
, type
);
4147 /* Helper routine for make_range. Perform one step for it, return
4148 new expression if the loop should continue or NULL_TREE if it should
4152 make_range_step (location_t loc
, enum tree_code code
, tree arg0
, tree arg1
,
4153 tree exp_type
, tree
*p_low
, tree
*p_high
, int *p_in_p
,
4154 bool *strict_overflow_p
)
4156 tree arg0_type
= TREE_TYPE (arg0
);
4157 tree n_low
, n_high
, low
= *p_low
, high
= *p_high
;
4158 int in_p
= *p_in_p
, n_in_p
;
4162 case TRUTH_NOT_EXPR
:
4163 /* We can only do something if the range is testing for zero. */
4164 if (low
== NULL_TREE
|| high
== NULL_TREE
4165 || ! integer_zerop (low
) || ! integer_zerop (high
))
4170 case EQ_EXPR
: case NE_EXPR
:
4171 case LT_EXPR
: case LE_EXPR
: case GE_EXPR
: case GT_EXPR
:
4172 /* We can only do something if the range is testing for zero
4173 and if the second operand is an integer constant. Note that
4174 saying something is "in" the range we make is done by
4175 complementing IN_P since it will set in the initial case of
4176 being not equal to zero; "out" is leaving it alone. */
4177 if (low
== NULL_TREE
|| high
== NULL_TREE
4178 || ! integer_zerop (low
) || ! integer_zerop (high
)
4179 || TREE_CODE (arg1
) != INTEGER_CST
)
4184 case NE_EXPR
: /* - [c, c] */
4187 case EQ_EXPR
: /* + [c, c] */
4188 in_p
= ! in_p
, low
= high
= arg1
;
4190 case GT_EXPR
: /* - [-, c] */
4191 low
= 0, high
= arg1
;
4193 case GE_EXPR
: /* + [c, -] */
4194 in_p
= ! in_p
, low
= arg1
, high
= 0;
4196 case LT_EXPR
: /* - [c, -] */
4197 low
= arg1
, high
= 0;
4199 case LE_EXPR
: /* + [-, c] */
4200 in_p
= ! in_p
, low
= 0, high
= arg1
;
4206 /* If this is an unsigned comparison, we also know that EXP is
4207 greater than or equal to zero. We base the range tests we make
4208 on that fact, so we record it here so we can parse existing
4209 range tests. We test arg0_type since often the return type
4210 of, e.g. EQ_EXPR, is boolean. */
4211 if (TYPE_UNSIGNED (arg0_type
) && (low
== 0 || high
== 0))
4213 if (! merge_ranges (&n_in_p
, &n_low
, &n_high
,
4215 build_int_cst (arg0_type
, 0),
4219 in_p
= n_in_p
, low
= n_low
, high
= n_high
;
4221 /* If the high bound is missing, but we have a nonzero low
4222 bound, reverse the range so it goes from zero to the low bound
4224 if (high
== 0 && low
&& ! integer_zerop (low
))
4227 high
= range_binop (MINUS_EXPR
, NULL_TREE
, low
, 0,
4228 build_int_cst (TREE_TYPE (low
), 1), 0);
4229 low
= build_int_cst (arg0_type
, 0);
4239 /* If flag_wrapv and ARG0_TYPE is signed, make sure
4240 low and high are non-NULL, then normalize will DTRT. */
4241 if (!TYPE_UNSIGNED (arg0_type
)
4242 && !TYPE_OVERFLOW_UNDEFINED (arg0_type
))
4244 if (low
== NULL_TREE
)
4245 low
= TYPE_MIN_VALUE (arg0_type
);
4246 if (high
== NULL_TREE
)
4247 high
= TYPE_MAX_VALUE (arg0_type
);
4250 /* (-x) IN [a,b] -> x in [-b, -a] */
4251 n_low
= range_binop (MINUS_EXPR
, exp_type
,
4252 build_int_cst (exp_type
, 0),
4254 n_high
= range_binop (MINUS_EXPR
, exp_type
,
4255 build_int_cst (exp_type
, 0),
4257 if (n_high
!= 0 && TREE_OVERFLOW (n_high
))
4263 return build2_loc (loc
, MINUS_EXPR
, exp_type
, negate_expr (arg0
),
4264 build_int_cst (exp_type
, 1));
4268 if (TREE_CODE (arg1
) != INTEGER_CST
)
4271 /* If flag_wrapv and ARG0_TYPE is signed, then we cannot
4272 move a constant to the other side. */
4273 if (!TYPE_UNSIGNED (arg0_type
)
4274 && !TYPE_OVERFLOW_UNDEFINED (arg0_type
))
4277 /* If EXP is signed, any overflow in the computation is undefined,
4278 so we don't worry about it so long as our computations on
4279 the bounds don't overflow. For unsigned, overflow is defined
4280 and this is exactly the right thing. */
4281 n_low
= range_binop (code
== MINUS_EXPR
? PLUS_EXPR
: MINUS_EXPR
,
4282 arg0_type
, low
, 0, arg1
, 0);
4283 n_high
= range_binop (code
== MINUS_EXPR
? PLUS_EXPR
: MINUS_EXPR
,
4284 arg0_type
, high
, 1, arg1
, 0);
4285 if ((n_low
!= 0 && TREE_OVERFLOW (n_low
))
4286 || (n_high
!= 0 && TREE_OVERFLOW (n_high
)))
4289 if (TYPE_OVERFLOW_UNDEFINED (arg0_type
))
4290 *strict_overflow_p
= true;
4293 /* Check for an unsigned range which has wrapped around the maximum
4294 value thus making n_high < n_low, and normalize it. */
4295 if (n_low
&& n_high
&& tree_int_cst_lt (n_high
, n_low
))
4297 low
= range_binop (PLUS_EXPR
, arg0_type
, n_high
, 0,
4298 build_int_cst (TREE_TYPE (n_high
), 1), 0);
4299 high
= range_binop (MINUS_EXPR
, arg0_type
, n_low
, 0,
4300 build_int_cst (TREE_TYPE (n_low
), 1), 0);
4302 /* If the range is of the form +/- [ x+1, x ], we won't
4303 be able to normalize it. But then, it represents the
4304 whole range or the empty set, so make it
4306 if (tree_int_cst_equal (n_low
, low
)
4307 && tree_int_cst_equal (n_high
, high
))
4313 low
= n_low
, high
= n_high
;
4321 case NON_LVALUE_EXPR
:
4322 if (TYPE_PRECISION (arg0_type
) > TYPE_PRECISION (exp_type
))
4325 if (! INTEGRAL_TYPE_P (arg0_type
)
4326 || (low
!= 0 && ! int_fits_type_p (low
, arg0_type
))
4327 || (high
!= 0 && ! int_fits_type_p (high
, arg0_type
)))
4330 n_low
= low
, n_high
= high
;
4333 n_low
= fold_convert_loc (loc
, arg0_type
, n_low
);
4336 n_high
= fold_convert_loc (loc
, arg0_type
, n_high
);
4338 /* If we're converting arg0 from an unsigned type, to exp,
4339 a signed type, we will be doing the comparison as unsigned.
4340 The tests above have already verified that LOW and HIGH
4343 So we have to ensure that we will handle large unsigned
4344 values the same way that the current signed bounds treat
4347 if (!TYPE_UNSIGNED (exp_type
) && TYPE_UNSIGNED (arg0_type
))
4351 /* For fixed-point modes, we need to pass the saturating flag
4352 as the 2nd parameter. */
4353 if (ALL_FIXED_POINT_MODE_P (TYPE_MODE (arg0_type
)))
4355 = lang_hooks
.types
.type_for_mode (TYPE_MODE (arg0_type
),
4356 TYPE_SATURATING (arg0_type
));
4359 = lang_hooks
.types
.type_for_mode (TYPE_MODE (arg0_type
), 1);
4361 /* A range without an upper bound is, naturally, unbounded.
4362 Since convert would have cropped a very large value, use
4363 the max value for the destination type. */
4365 = TYPE_MAX_VALUE (equiv_type
) ? TYPE_MAX_VALUE (equiv_type
)
4366 : TYPE_MAX_VALUE (arg0_type
);
4368 if (TYPE_PRECISION (exp_type
) == TYPE_PRECISION (arg0_type
))
4369 high_positive
= fold_build2_loc (loc
, RSHIFT_EXPR
, arg0_type
,
4370 fold_convert_loc (loc
, arg0_type
,
4372 build_int_cst (arg0_type
, 1));
4374 /* If the low bound is specified, "and" the range with the
4375 range for which the original unsigned value will be
4379 if (! merge_ranges (&n_in_p
, &n_low
, &n_high
, 1, n_low
, n_high
,
4380 1, fold_convert_loc (loc
, arg0_type
,
4385 in_p
= (n_in_p
== in_p
);
4389 /* Otherwise, "or" the range with the range of the input
4390 that will be interpreted as negative. */
4391 if (! merge_ranges (&n_in_p
, &n_low
, &n_high
, 0, n_low
, n_high
,
4392 1, fold_convert_loc (loc
, arg0_type
,
4397 in_p
= (in_p
!= n_in_p
);
4411 /* Given EXP, a logical expression, set the range it is testing into
4412 variables denoted by PIN_P, PLOW, and PHIGH. Return the expression
4413 actually being tested. *PLOW and *PHIGH will be made of the same
4414 type as the returned expression. If EXP is not a comparison, we
4415 will most likely not be returning a useful value and range. Set
4416 *STRICT_OVERFLOW_P to true if the return value is only valid
4417 because signed overflow is undefined; otherwise, do not change
4418 *STRICT_OVERFLOW_P. */
4421 make_range (tree exp
, int *pin_p
, tree
*plow
, tree
*phigh
,
4422 bool *strict_overflow_p
)
4424 enum tree_code code
;
4425 tree arg0
, arg1
= NULL_TREE
;
4426 tree exp_type
, nexp
;
4429 location_t loc
= EXPR_LOCATION (exp
);
4431 /* Start with simply saying "EXP != 0" and then look at the code of EXP
4432 and see if we can refine the range. Some of the cases below may not
4433 happen, but it doesn't seem worth worrying about this. We "continue"
4434 the outer loop when we've changed something; otherwise we "break"
4435 the switch, which will "break" the while. */
4438 low
= high
= build_int_cst (TREE_TYPE (exp
), 0);
4442 code
= TREE_CODE (exp
);
4443 exp_type
= TREE_TYPE (exp
);
4446 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
4448 if (TREE_OPERAND_LENGTH (exp
) > 0)
4449 arg0
= TREE_OPERAND (exp
, 0);
4450 if (TREE_CODE_CLASS (code
) == tcc_binary
4451 || TREE_CODE_CLASS (code
) == tcc_comparison
4452 || (TREE_CODE_CLASS (code
) == tcc_expression
4453 && TREE_OPERAND_LENGTH (exp
) > 1))
4454 arg1
= TREE_OPERAND (exp
, 1);
4456 if (arg0
== NULL_TREE
)
4459 nexp
= make_range_step (loc
, code
, arg0
, arg1
, exp_type
, &low
,
4460 &high
, &in_p
, strict_overflow_p
);
4461 if (nexp
== NULL_TREE
)
4466 /* If EXP is a constant, we can evaluate whether this is true or false. */
4467 if (TREE_CODE (exp
) == INTEGER_CST
)
4469 in_p
= in_p
== (integer_onep (range_binop (GE_EXPR
, integer_type_node
,
4471 && integer_onep (range_binop (LE_EXPR
, integer_type_node
,
4477 *pin_p
= in_p
, *plow
= low
, *phigh
= high
;
4481 /* Given a range, LOW, HIGH, and IN_P, an expression, EXP, and a result
4482 type, TYPE, return an expression to test if EXP is in (or out of, depending
4483 on IN_P) the range. Return 0 if the test couldn't be created. */
4486 build_range_check (location_t loc
, tree type
, tree exp
, int in_p
,
4487 tree low
, tree high
)
4489 tree etype
= TREE_TYPE (exp
), value
;
4491 #ifdef HAVE_canonicalize_funcptr_for_compare
4492 /* Disable this optimization for function pointer expressions
4493 on targets that require function pointer canonicalization. */
4494 if (HAVE_canonicalize_funcptr_for_compare
4495 && TREE_CODE (etype
) == POINTER_TYPE
4496 && TREE_CODE (TREE_TYPE (etype
)) == FUNCTION_TYPE
)
4502 value
= build_range_check (loc
, type
, exp
, 1, low
, high
);
4504 return invert_truthvalue_loc (loc
, value
);
4509 if (low
== 0 && high
== 0)
4510 return omit_one_operand_loc (loc
, type
, build_int_cst (type
, 1), exp
);
4513 return fold_build2_loc (loc
, LE_EXPR
, type
, exp
,
4514 fold_convert_loc (loc
, etype
, high
));
4517 return fold_build2_loc (loc
, GE_EXPR
, type
, exp
,
4518 fold_convert_loc (loc
, etype
, low
));
4520 if (operand_equal_p (low
, high
, 0))
4521 return fold_build2_loc (loc
, EQ_EXPR
, type
, exp
,
4522 fold_convert_loc (loc
, etype
, low
));
4524 if (integer_zerop (low
))
4526 if (! TYPE_UNSIGNED (etype
))
4528 etype
= unsigned_type_for (etype
);
4529 high
= fold_convert_loc (loc
, etype
, high
);
4530 exp
= fold_convert_loc (loc
, etype
, exp
);
4532 return build_range_check (loc
, type
, exp
, 1, 0, high
);
4535 /* Optimize (c>=1) && (c<=127) into (signed char)c > 0. */
4536 if (integer_onep (low
) && TREE_CODE (high
) == INTEGER_CST
)
4538 int prec
= TYPE_PRECISION (etype
);
4540 if (wi::mask (prec
- 1, false, prec
) == high
)
4542 if (TYPE_UNSIGNED (etype
))
4544 tree signed_etype
= signed_type_for (etype
);
4545 if (TYPE_PRECISION (signed_etype
) != TYPE_PRECISION (etype
))
4547 = build_nonstandard_integer_type (TYPE_PRECISION (etype
), 0);
4549 etype
= signed_etype
;
4550 exp
= fold_convert_loc (loc
, etype
, exp
);
4552 return fold_build2_loc (loc
, GT_EXPR
, type
, exp
,
4553 build_int_cst (etype
, 0));
4557 /* Optimize (c>=low) && (c<=high) into (c-low>=0) && (c-low<=high-low).
4558 This requires wrap-around arithmetics for the type of the expression.
4559 First make sure that arithmetics in this type is valid, then make sure
4560 that it wraps around. */
4561 if (TREE_CODE (etype
) == ENUMERAL_TYPE
|| TREE_CODE (etype
) == BOOLEAN_TYPE
)
4562 etype
= lang_hooks
.types
.type_for_size (TYPE_PRECISION (etype
),
4563 TYPE_UNSIGNED (etype
));
4565 if (TREE_CODE (etype
) == INTEGER_TYPE
&& !TYPE_OVERFLOW_WRAPS (etype
))
4567 tree utype
, minv
, maxv
;
4569 /* Check if (unsigned) INT_MAX + 1 == (unsigned) INT_MIN
4570 for the type in question, as we rely on this here. */
4571 utype
= unsigned_type_for (etype
);
4572 maxv
= fold_convert_loc (loc
, utype
, TYPE_MAX_VALUE (etype
));
4573 maxv
= range_binop (PLUS_EXPR
, NULL_TREE
, maxv
, 1,
4574 build_int_cst (TREE_TYPE (maxv
), 1), 1);
4575 minv
= fold_convert_loc (loc
, utype
, TYPE_MIN_VALUE (etype
));
4577 if (integer_zerop (range_binop (NE_EXPR
, integer_type_node
,
4584 high
= fold_convert_loc (loc
, etype
, high
);
4585 low
= fold_convert_loc (loc
, etype
, low
);
4586 exp
= fold_convert_loc (loc
, etype
, exp
);
4588 value
= const_binop (MINUS_EXPR
, high
, low
);
4591 if (POINTER_TYPE_P (etype
))
4593 if (value
!= 0 && !TREE_OVERFLOW (value
))
4595 low
= fold_build1_loc (loc
, NEGATE_EXPR
, TREE_TYPE (low
), low
);
4596 return build_range_check (loc
, type
,
4597 fold_build_pointer_plus_loc (loc
, exp
, low
),
4598 1, build_int_cst (etype
, 0), value
);
4603 if (value
!= 0 && !TREE_OVERFLOW (value
))
4604 return build_range_check (loc
, type
,
4605 fold_build2_loc (loc
, MINUS_EXPR
, etype
, exp
, low
),
4606 1, build_int_cst (etype
, 0), value
);
4611 /* Return the predecessor of VAL in its type, handling the infinite case. */
4614 range_predecessor (tree val
)
4616 tree type
= TREE_TYPE (val
);
4618 if (INTEGRAL_TYPE_P (type
)
4619 && operand_equal_p (val
, TYPE_MIN_VALUE (type
), 0))
4622 return range_binop (MINUS_EXPR
, NULL_TREE
, val
, 0,
4623 build_int_cst (TREE_TYPE (val
), 1), 0);
4626 /* Return the successor of VAL in its type, handling the infinite case. */
4629 range_successor (tree val
)
4631 tree type
= TREE_TYPE (val
);
4633 if (INTEGRAL_TYPE_P (type
)
4634 && operand_equal_p (val
, TYPE_MAX_VALUE (type
), 0))
4637 return range_binop (PLUS_EXPR
, NULL_TREE
, val
, 0,
4638 build_int_cst (TREE_TYPE (val
), 1), 0);
4641 /* Given two ranges, see if we can merge them into one. Return 1 if we
4642 can, 0 if we can't. Set the output range into the specified parameters. */
4645 merge_ranges (int *pin_p
, tree
*plow
, tree
*phigh
, int in0_p
, tree low0
,
4646 tree high0
, int in1_p
, tree low1
, tree high1
)
4654 int lowequal
= ((low0
== 0 && low1
== 0)
4655 || integer_onep (range_binop (EQ_EXPR
, integer_type_node
,
4656 low0
, 0, low1
, 0)));
4657 int highequal
= ((high0
== 0 && high1
== 0)
4658 || integer_onep (range_binop (EQ_EXPR
, integer_type_node
,
4659 high0
, 1, high1
, 1)));
4661 /* Make range 0 be the range that starts first, or ends last if they
4662 start at the same value. Swap them if it isn't. */
4663 if (integer_onep (range_binop (GT_EXPR
, integer_type_node
,
4666 && integer_onep (range_binop (GT_EXPR
, integer_type_node
,
4667 high1
, 1, high0
, 1))))
4669 temp
= in0_p
, in0_p
= in1_p
, in1_p
= temp
;
4670 tem
= low0
, low0
= low1
, low1
= tem
;
4671 tem
= high0
, high0
= high1
, high1
= tem
;
4674 /* Now flag two cases, whether the ranges are disjoint or whether the
4675 second range is totally subsumed in the first. Note that the tests
4676 below are simplified by the ones above. */
4677 no_overlap
= integer_onep (range_binop (LT_EXPR
, integer_type_node
,
4678 high0
, 1, low1
, 0));
4679 subset
= integer_onep (range_binop (LE_EXPR
, integer_type_node
,
4680 high1
, 1, high0
, 1));
4682 /* We now have four cases, depending on whether we are including or
4683 excluding the two ranges. */
4686 /* If they don't overlap, the result is false. If the second range
4687 is a subset it is the result. Otherwise, the range is from the start
4688 of the second to the end of the first. */
4690 in_p
= 0, low
= high
= 0;
4692 in_p
= 1, low
= low1
, high
= high1
;
4694 in_p
= 1, low
= low1
, high
= high0
;
4697 else if (in0_p
&& ! in1_p
)
4699 /* If they don't overlap, the result is the first range. If they are
4700 equal, the result is false. If the second range is a subset of the
4701 first, and the ranges begin at the same place, we go from just after
4702 the end of the second range to the end of the first. If the second
4703 range is not a subset of the first, or if it is a subset and both
4704 ranges end at the same place, the range starts at the start of the
4705 first range and ends just before the second range.
4706 Otherwise, we can't describe this as a single range. */
4708 in_p
= 1, low
= low0
, high
= high0
;
4709 else if (lowequal
&& highequal
)
4710 in_p
= 0, low
= high
= 0;
4711 else if (subset
&& lowequal
)
4713 low
= range_successor (high1
);
4718 /* We are in the weird situation where high0 > high1 but
4719 high1 has no successor. Punt. */
4723 else if (! subset
|| highequal
)
4726 high
= range_predecessor (low1
);
4730 /* low0 < low1 but low1 has no predecessor. Punt. */
4738 else if (! in0_p
&& in1_p
)
4740 /* If they don't overlap, the result is the second range. If the second
4741 is a subset of the first, the result is false. Otherwise,
4742 the range starts just after the first range and ends at the
4743 end of the second. */
4745 in_p
= 1, low
= low1
, high
= high1
;
4746 else if (subset
|| highequal
)
4747 in_p
= 0, low
= high
= 0;
4750 low
= range_successor (high0
);
4755 /* high1 > high0 but high0 has no successor. Punt. */
4763 /* The case where we are excluding both ranges. Here the complex case
4764 is if they don't overlap. In that case, the only time we have a
4765 range is if they are adjacent. If the second is a subset of the
4766 first, the result is the first. Otherwise, the range to exclude
4767 starts at the beginning of the first range and ends at the end of the
4771 if (integer_onep (range_binop (EQ_EXPR
, integer_type_node
,
4772 range_successor (high0
),
4774 in_p
= 0, low
= low0
, high
= high1
;
4777 /* Canonicalize - [min, x] into - [-, x]. */
4778 if (low0
&& TREE_CODE (low0
) == INTEGER_CST
)
4779 switch (TREE_CODE (TREE_TYPE (low0
)))
4782 if (TYPE_PRECISION (TREE_TYPE (low0
))
4783 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (low0
))))
4787 if (tree_int_cst_equal (low0
,
4788 TYPE_MIN_VALUE (TREE_TYPE (low0
))))
4792 if (TYPE_UNSIGNED (TREE_TYPE (low0
))
4793 && integer_zerop (low0
))
4800 /* Canonicalize - [x, max] into - [x, -]. */
4801 if (high1
&& TREE_CODE (high1
) == INTEGER_CST
)
4802 switch (TREE_CODE (TREE_TYPE (high1
)))
4805 if (TYPE_PRECISION (TREE_TYPE (high1
))
4806 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (high1
))))
4810 if (tree_int_cst_equal (high1
,
4811 TYPE_MAX_VALUE (TREE_TYPE (high1
))))
4815 if (TYPE_UNSIGNED (TREE_TYPE (high1
))
4816 && integer_zerop (range_binop (PLUS_EXPR
, NULL_TREE
,
4818 build_int_cst (TREE_TYPE (high1
), 1),
4826 /* The ranges might be also adjacent between the maximum and
4827 minimum values of the given type. For
4828 - [{min,-}, x] and - [y, {max,-}] ranges where x + 1 < y
4829 return + [x + 1, y - 1]. */
4830 if (low0
== 0 && high1
== 0)
4832 low
= range_successor (high0
);
4833 high
= range_predecessor (low1
);
4834 if (low
== 0 || high
== 0)
4844 in_p
= 0, low
= low0
, high
= high0
;
4846 in_p
= 0, low
= low0
, high
= high1
;
4849 *pin_p
= in_p
, *plow
= low
, *phigh
= high
;
4854 /* Subroutine of fold, looking inside expressions of the form
4855 A op B ? A : C, where ARG0, ARG1 and ARG2 are the three operands
4856 of the COND_EXPR. This function is being used also to optimize
4857 A op B ? C : A, by reversing the comparison first.
4859 Return a folded expression whose code is not a COND_EXPR
4860 anymore, or NULL_TREE if no folding opportunity is found. */
4863 fold_cond_expr_with_comparison (location_t loc
, tree type
,
4864 tree arg0
, tree arg1
, tree arg2
)
4866 enum tree_code comp_code
= TREE_CODE (arg0
);
4867 tree arg00
= TREE_OPERAND (arg0
, 0);
4868 tree arg01
= TREE_OPERAND (arg0
, 1);
4869 tree arg1_type
= TREE_TYPE (arg1
);
4875 /* If we have A op 0 ? A : -A, consider applying the following
4878 A == 0? A : -A same as -A
4879 A != 0? A : -A same as A
4880 A >= 0? A : -A same as abs (A)
4881 A > 0? A : -A same as abs (A)
4882 A <= 0? A : -A same as -abs (A)
4883 A < 0? A : -A same as -abs (A)
4885 None of these transformations work for modes with signed
4886 zeros. If A is +/-0, the first two transformations will
4887 change the sign of the result (from +0 to -0, or vice
4888 versa). The last four will fix the sign of the result,
4889 even though the original expressions could be positive or
4890 negative, depending on the sign of A.
4892 Note that all these transformations are correct if A is
4893 NaN, since the two alternatives (A and -A) are also NaNs. */
4894 if (!HONOR_SIGNED_ZEROS (element_mode (type
))
4895 && (FLOAT_TYPE_P (TREE_TYPE (arg01
))
4896 ? real_zerop (arg01
)
4897 : integer_zerop (arg01
))
4898 && ((TREE_CODE (arg2
) == NEGATE_EXPR
4899 && operand_equal_p (TREE_OPERAND (arg2
, 0), arg1
, 0))
4900 /* In the case that A is of the form X-Y, '-A' (arg2) may
4901 have already been folded to Y-X, check for that. */
4902 || (TREE_CODE (arg1
) == MINUS_EXPR
4903 && TREE_CODE (arg2
) == MINUS_EXPR
4904 && operand_equal_p (TREE_OPERAND (arg1
, 0),
4905 TREE_OPERAND (arg2
, 1), 0)
4906 && operand_equal_p (TREE_OPERAND (arg1
, 1),
4907 TREE_OPERAND (arg2
, 0), 0))))
4912 tem
= fold_convert_loc (loc
, arg1_type
, arg1
);
4913 return pedantic_non_lvalue_loc (loc
,
4914 fold_convert_loc (loc
, type
,
4915 negate_expr (tem
)));
4918 return pedantic_non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg1
));
4921 if (flag_trapping_math
)
4926 if (TYPE_UNSIGNED (TREE_TYPE (arg1
)))
4927 arg1
= fold_convert_loc (loc
, signed_type_for
4928 (TREE_TYPE (arg1
)), arg1
);
4929 tem
= fold_build1_loc (loc
, ABS_EXPR
, TREE_TYPE (arg1
), arg1
);
4930 return pedantic_non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, tem
));
4933 if (flag_trapping_math
)
4937 if (TYPE_UNSIGNED (TREE_TYPE (arg1
)))
4938 arg1
= fold_convert_loc (loc
, signed_type_for
4939 (TREE_TYPE (arg1
)), arg1
);
4940 tem
= fold_build1_loc (loc
, ABS_EXPR
, TREE_TYPE (arg1
), arg1
);
4941 return negate_expr (fold_convert_loc (loc
, type
, tem
));
4943 gcc_assert (TREE_CODE_CLASS (comp_code
) == tcc_comparison
);
4947 /* A != 0 ? A : 0 is simply A, unless A is -0. Likewise
4948 A == 0 ? A : 0 is always 0 unless A is -0. Note that
4949 both transformations are correct when A is NaN: A != 0
4950 is then true, and A == 0 is false. */
4952 if (!HONOR_SIGNED_ZEROS (element_mode (type
))
4953 && integer_zerop (arg01
) && integer_zerop (arg2
))
4955 if (comp_code
== NE_EXPR
)
4956 return pedantic_non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg1
));
4957 else if (comp_code
== EQ_EXPR
)
4958 return build_zero_cst (type
);
4961 /* Try some transformations of A op B ? A : B.
4963 A == B? A : B same as B
4964 A != B? A : B same as A
4965 A >= B? A : B same as max (A, B)
4966 A > B? A : B same as max (B, A)
4967 A <= B? A : B same as min (A, B)
4968 A < B? A : B same as min (B, A)
4970 As above, these transformations don't work in the presence
4971 of signed zeros. For example, if A and B are zeros of
4972 opposite sign, the first two transformations will change
4973 the sign of the result. In the last four, the original
4974 expressions give different results for (A=+0, B=-0) and
4975 (A=-0, B=+0), but the transformed expressions do not.
4977 The first two transformations are correct if either A or B
4978 is a NaN. In the first transformation, the condition will
4979 be false, and B will indeed be chosen. In the case of the
4980 second transformation, the condition A != B will be true,
4981 and A will be chosen.
4983 The conversions to max() and min() are not correct if B is
4984 a number and A is not. The conditions in the original
4985 expressions will be false, so all four give B. The min()
4986 and max() versions would give a NaN instead. */
4987 if (!HONOR_SIGNED_ZEROS (element_mode (type
))
4988 && operand_equal_for_comparison_p (arg01
, arg2
, arg00
)
4989 /* Avoid these transformations if the COND_EXPR may be used
4990 as an lvalue in the C++ front-end. PR c++/19199. */
4992 || VECTOR_TYPE_P (type
)
4993 || (! lang_GNU_CXX ()
4994 && strcmp (lang_hooks
.name
, "GNU Objective-C++") != 0)
4995 || ! maybe_lvalue_p (arg1
)
4996 || ! maybe_lvalue_p (arg2
)))
4998 tree comp_op0
= arg00
;
4999 tree comp_op1
= arg01
;
5000 tree comp_type
= TREE_TYPE (comp_op0
);
5002 /* Avoid adding NOP_EXPRs in case this is an lvalue. */
5003 if (TYPE_MAIN_VARIANT (comp_type
) == TYPE_MAIN_VARIANT (type
))
5013 return pedantic_non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg2
));
5015 return pedantic_non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg1
));
5020 /* In C++ a ?: expression can be an lvalue, so put the
5021 operand which will be used if they are equal first
5022 so that we can convert this back to the
5023 corresponding COND_EXPR. */
5024 if (!HONOR_NANS (arg1
))
5026 comp_op0
= fold_convert_loc (loc
, comp_type
, comp_op0
);
5027 comp_op1
= fold_convert_loc (loc
, comp_type
, comp_op1
);
5028 tem
= (comp_code
== LE_EXPR
|| comp_code
== UNLE_EXPR
)
5029 ? fold_build2_loc (loc
, MIN_EXPR
, comp_type
, comp_op0
, comp_op1
)
5030 : fold_build2_loc (loc
, MIN_EXPR
, comp_type
,
5031 comp_op1
, comp_op0
);
5032 return pedantic_non_lvalue_loc (loc
,
5033 fold_convert_loc (loc
, type
, tem
));
5040 if (!HONOR_NANS (arg1
))
5042 comp_op0
= fold_convert_loc (loc
, comp_type
, comp_op0
);
5043 comp_op1
= fold_convert_loc (loc
, comp_type
, comp_op1
);
5044 tem
= (comp_code
== GE_EXPR
|| comp_code
== UNGE_EXPR
)
5045 ? fold_build2_loc (loc
, MAX_EXPR
, comp_type
, comp_op0
, comp_op1
)
5046 : fold_build2_loc (loc
, MAX_EXPR
, comp_type
,
5047 comp_op1
, comp_op0
);
5048 return pedantic_non_lvalue_loc (loc
,
5049 fold_convert_loc (loc
, type
, tem
));
5053 if (!HONOR_NANS (arg1
))
5054 return pedantic_non_lvalue_loc (loc
,
5055 fold_convert_loc (loc
, type
, arg2
));
5058 if (!HONOR_NANS (arg1
))
5059 return pedantic_non_lvalue_loc (loc
,
5060 fold_convert_loc (loc
, type
, arg1
));
5063 gcc_assert (TREE_CODE_CLASS (comp_code
) == tcc_comparison
);
5068 /* If this is A op C1 ? A : C2 with C1 and C2 constant integers,
5069 we might still be able to simplify this. For example,
5070 if C1 is one less or one more than C2, this might have started
5071 out as a MIN or MAX and been transformed by this function.
5072 Only good for INTEGER_TYPEs, because we need TYPE_MAX_VALUE. */
5074 if (INTEGRAL_TYPE_P (type
)
5075 && TREE_CODE (arg01
) == INTEGER_CST
5076 && TREE_CODE (arg2
) == INTEGER_CST
)
5080 if (TREE_CODE (arg1
) == INTEGER_CST
)
5082 /* We can replace A with C1 in this case. */
5083 arg1
= fold_convert_loc (loc
, type
, arg01
);
5084 return fold_build3_loc (loc
, COND_EXPR
, type
, arg0
, arg1
, arg2
);
5087 /* If C1 is C2 + 1, this is min(A, C2), but use ARG00's type for
5088 MIN_EXPR, to preserve the signedness of the comparison. */
5089 if (! operand_equal_p (arg2
, TYPE_MAX_VALUE (type
),
5091 && operand_equal_p (arg01
,
5092 const_binop (PLUS_EXPR
, arg2
,
5093 build_int_cst (type
, 1)),
5096 tem
= fold_build2_loc (loc
, MIN_EXPR
, TREE_TYPE (arg00
), arg00
,
5097 fold_convert_loc (loc
, TREE_TYPE (arg00
),
5099 return pedantic_non_lvalue_loc (loc
,
5100 fold_convert_loc (loc
, type
, tem
));
5105 /* If C1 is C2 - 1, this is min(A, C2), with the same care
5107 if (! operand_equal_p (arg2
, TYPE_MIN_VALUE (type
),
5109 && operand_equal_p (arg01
,
5110 const_binop (MINUS_EXPR
, arg2
,
5111 build_int_cst (type
, 1)),
5114 tem
= fold_build2_loc (loc
, MIN_EXPR
, TREE_TYPE (arg00
), arg00
,
5115 fold_convert_loc (loc
, TREE_TYPE (arg00
),
5117 return pedantic_non_lvalue_loc (loc
,
5118 fold_convert_loc (loc
, type
, tem
));
5123 /* If C1 is C2 - 1, this is max(A, C2), but use ARG00's type for
5124 MAX_EXPR, to preserve the signedness of the comparison. */
5125 if (! operand_equal_p (arg2
, TYPE_MIN_VALUE (type
),
5127 && operand_equal_p (arg01
,
5128 const_binop (MINUS_EXPR
, arg2
,
5129 build_int_cst (type
, 1)),
5132 tem
= fold_build2_loc (loc
, MAX_EXPR
, TREE_TYPE (arg00
), arg00
,
5133 fold_convert_loc (loc
, TREE_TYPE (arg00
),
5135 return pedantic_non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, tem
));
5140 /* If C1 is C2 + 1, this is max(A, C2), with the same care as above. */
5141 if (! operand_equal_p (arg2
, TYPE_MAX_VALUE (type
),
5143 && operand_equal_p (arg01
,
5144 const_binop (PLUS_EXPR
, arg2
,
5145 build_int_cst (type
, 1)),
5148 tem
= fold_build2_loc (loc
, MAX_EXPR
, TREE_TYPE (arg00
), arg00
,
5149 fold_convert_loc (loc
, TREE_TYPE (arg00
),
5151 return pedantic_non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, tem
));
5165 #ifndef LOGICAL_OP_NON_SHORT_CIRCUIT
5166 #define LOGICAL_OP_NON_SHORT_CIRCUIT \
5167 (BRANCH_COST (optimize_function_for_speed_p (cfun), \
5171 /* EXP is some logical combination of boolean tests. See if we can
5172 merge it into some range test. Return the new tree if so. */
5175 fold_range_test (location_t loc
, enum tree_code code
, tree type
,
5178 int or_op
= (code
== TRUTH_ORIF_EXPR
5179 || code
== TRUTH_OR_EXPR
);
5180 int in0_p
, in1_p
, in_p
;
5181 tree low0
, low1
, low
, high0
, high1
, high
;
5182 bool strict_overflow_p
= false;
5184 const char * const warnmsg
= G_("assuming signed overflow does not occur "
5185 "when simplifying range test");
5187 if (!INTEGRAL_TYPE_P (type
))
5190 lhs
= make_range (op0
, &in0_p
, &low0
, &high0
, &strict_overflow_p
);
5191 rhs
= make_range (op1
, &in1_p
, &low1
, &high1
, &strict_overflow_p
);
5193 /* If this is an OR operation, invert both sides; we will invert
5194 again at the end. */
5196 in0_p
= ! in0_p
, in1_p
= ! in1_p
;
5198 /* If both expressions are the same, if we can merge the ranges, and we
5199 can build the range test, return it or it inverted. If one of the
5200 ranges is always true or always false, consider it to be the same
5201 expression as the other. */
5202 if ((lhs
== 0 || rhs
== 0 || operand_equal_p (lhs
, rhs
, 0))
5203 && merge_ranges (&in_p
, &low
, &high
, in0_p
, low0
, high0
,
5205 && 0 != (tem
= (build_range_check (loc
, type
,
5207 : rhs
!= 0 ? rhs
: integer_zero_node
,
5210 if (strict_overflow_p
)
5211 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_COMPARISON
);
5212 return or_op
? invert_truthvalue_loc (loc
, tem
) : tem
;
5215 /* On machines where the branch cost is expensive, if this is a
5216 short-circuited branch and the underlying object on both sides
5217 is the same, make a non-short-circuit operation. */
5218 else if (LOGICAL_OP_NON_SHORT_CIRCUIT
5219 && lhs
!= 0 && rhs
!= 0
5220 && (code
== TRUTH_ANDIF_EXPR
5221 || code
== TRUTH_ORIF_EXPR
)
5222 && operand_equal_p (lhs
, rhs
, 0))
5224 /* If simple enough, just rewrite. Otherwise, make a SAVE_EXPR
5225 unless we are at top level or LHS contains a PLACEHOLDER_EXPR, in
5226 which cases we can't do this. */
5227 if (simple_operand_p (lhs
))
5228 return build2_loc (loc
, code
== TRUTH_ANDIF_EXPR
5229 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
,
5232 else if (!lang_hooks
.decls
.global_bindings_p ()
5233 && !CONTAINS_PLACEHOLDER_P (lhs
))
5235 tree common
= save_expr (lhs
);
5237 if (0 != (lhs
= build_range_check (loc
, type
, common
,
5238 or_op
? ! in0_p
: in0_p
,
5240 && (0 != (rhs
= build_range_check (loc
, type
, common
,
5241 or_op
? ! in1_p
: in1_p
,
5244 if (strict_overflow_p
)
5245 fold_overflow_warning (warnmsg
,
5246 WARN_STRICT_OVERFLOW_COMPARISON
);
5247 return build2_loc (loc
, code
== TRUTH_ANDIF_EXPR
5248 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
,
5257 /* Subroutine for fold_truth_andor_1: C is an INTEGER_CST interpreted as a P
5258 bit value. Arrange things so the extra bits will be set to zero if and
5259 only if C is signed-extended to its full width. If MASK is nonzero,
5260 it is an INTEGER_CST that should be AND'ed with the extra bits. */
5263 unextend (tree c
, int p
, int unsignedp
, tree mask
)
5265 tree type
= TREE_TYPE (c
);
5266 int modesize
= GET_MODE_BITSIZE (TYPE_MODE (type
));
5269 if (p
== modesize
|| unsignedp
)
5272 /* We work by getting just the sign bit into the low-order bit, then
5273 into the high-order bit, then sign-extend. We then XOR that value
5275 temp
= build_int_cst (TREE_TYPE (c
), wi::extract_uhwi (c
, p
- 1, 1));
5277 /* We must use a signed type in order to get an arithmetic right shift.
5278 However, we must also avoid introducing accidental overflows, so that
5279 a subsequent call to integer_zerop will work. Hence we must
5280 do the type conversion here. At this point, the constant is either
5281 zero or one, and the conversion to a signed type can never overflow.
5282 We could get an overflow if this conversion is done anywhere else. */
5283 if (TYPE_UNSIGNED (type
))
5284 temp
= fold_convert (signed_type_for (type
), temp
);
5286 temp
= const_binop (LSHIFT_EXPR
, temp
, size_int (modesize
- 1));
5287 temp
= const_binop (RSHIFT_EXPR
, temp
, size_int (modesize
- p
- 1));
5289 temp
= const_binop (BIT_AND_EXPR
, temp
,
5290 fold_convert (TREE_TYPE (c
), mask
));
5291 /* If necessary, convert the type back to match the type of C. */
5292 if (TYPE_UNSIGNED (type
))
5293 temp
= fold_convert (type
, temp
);
5295 return fold_convert (type
, const_binop (BIT_XOR_EXPR
, c
, temp
));
5298 /* For an expression that has the form
5302 we can drop one of the inner expressions and simplify to
5306 LOC is the location of the resulting expression. OP is the inner
5307 logical operation; the left-hand side in the examples above, while CMPOP
5308 is the right-hand side. RHS_ONLY is used to prevent us from accidentally
5309 removing a condition that guards another, as in
5310 (A != NULL && A->...) || A == NULL
5311 which we must not transform. If RHS_ONLY is true, only eliminate the
5312 right-most operand of the inner logical operation. */
5315 merge_truthop_with_opposite_arm (location_t loc
, tree op
, tree cmpop
,
5318 tree type
= TREE_TYPE (cmpop
);
5319 enum tree_code code
= TREE_CODE (cmpop
);
5320 enum tree_code truthop_code
= TREE_CODE (op
);
5321 tree lhs
= TREE_OPERAND (op
, 0);
5322 tree rhs
= TREE_OPERAND (op
, 1);
5323 tree orig_lhs
= lhs
, orig_rhs
= rhs
;
5324 enum tree_code rhs_code
= TREE_CODE (rhs
);
5325 enum tree_code lhs_code
= TREE_CODE (lhs
);
5326 enum tree_code inv_code
;
5328 if (TREE_SIDE_EFFECTS (op
) || TREE_SIDE_EFFECTS (cmpop
))
5331 if (TREE_CODE_CLASS (code
) != tcc_comparison
)
5334 if (rhs_code
== truthop_code
)
5336 tree newrhs
= merge_truthop_with_opposite_arm (loc
, rhs
, cmpop
, rhs_only
);
5337 if (newrhs
!= NULL_TREE
)
5340 rhs_code
= TREE_CODE (rhs
);
5343 if (lhs_code
== truthop_code
&& !rhs_only
)
5345 tree newlhs
= merge_truthop_with_opposite_arm (loc
, lhs
, cmpop
, false);
5346 if (newlhs
!= NULL_TREE
)
5349 lhs_code
= TREE_CODE (lhs
);
5353 inv_code
= invert_tree_comparison (code
, HONOR_NANS (type
));
5354 if (inv_code
== rhs_code
5355 && operand_equal_p (TREE_OPERAND (rhs
, 0), TREE_OPERAND (cmpop
, 0), 0)
5356 && operand_equal_p (TREE_OPERAND (rhs
, 1), TREE_OPERAND (cmpop
, 1), 0))
5358 if (!rhs_only
&& inv_code
== lhs_code
5359 && operand_equal_p (TREE_OPERAND (lhs
, 0), TREE_OPERAND (cmpop
, 0), 0)
5360 && operand_equal_p (TREE_OPERAND (lhs
, 1), TREE_OPERAND (cmpop
, 1), 0))
5362 if (rhs
!= orig_rhs
|| lhs
!= orig_lhs
)
5363 return fold_build2_loc (loc
, truthop_code
, TREE_TYPE (cmpop
),
5368 /* Find ways of folding logical expressions of LHS and RHS:
5369 Try to merge two comparisons to the same innermost item.
5370 Look for range tests like "ch >= '0' && ch <= '9'".
5371 Look for combinations of simple terms on machines with expensive branches
5372 and evaluate the RHS unconditionally.
5374 For example, if we have p->a == 2 && p->b == 4 and we can make an
5375 object large enough to span both A and B, we can do this with a comparison
5376 against the object ANDed with the a mask.
5378 If we have p->a == q->a && p->b == q->b, we may be able to use bit masking
5379 operations to do this with one comparison.
5381 We check for both normal comparisons and the BIT_AND_EXPRs made this by
5382 function and the one above.
5384 CODE is the logical operation being done. It can be TRUTH_ANDIF_EXPR,
5385 TRUTH_AND_EXPR, TRUTH_ORIF_EXPR, or TRUTH_OR_EXPR.
5387 TRUTH_TYPE is the type of the logical operand and LHS and RHS are its
5390 We return the simplified tree or 0 if no optimization is possible. */
5393 fold_truth_andor_1 (location_t loc
, enum tree_code code
, tree truth_type
,
5396 /* If this is the "or" of two comparisons, we can do something if
5397 the comparisons are NE_EXPR. If this is the "and", we can do something
5398 if the comparisons are EQ_EXPR. I.e.,
5399 (a->b == 2 && a->c == 4) can become (a->new == NEW).
5401 WANTED_CODE is this operation code. For single bit fields, we can
5402 convert EQ_EXPR to NE_EXPR so we need not reject the "wrong"
5403 comparison for one-bit fields. */
5405 enum tree_code wanted_code
;
5406 enum tree_code lcode
, rcode
;
5407 tree ll_arg
, lr_arg
, rl_arg
, rr_arg
;
5408 tree ll_inner
, lr_inner
, rl_inner
, rr_inner
;
5409 HOST_WIDE_INT ll_bitsize
, ll_bitpos
, lr_bitsize
, lr_bitpos
;
5410 HOST_WIDE_INT rl_bitsize
, rl_bitpos
, rr_bitsize
, rr_bitpos
;
5411 HOST_WIDE_INT xll_bitpos
, xlr_bitpos
, xrl_bitpos
, xrr_bitpos
;
5412 HOST_WIDE_INT lnbitsize
, lnbitpos
, rnbitsize
, rnbitpos
;
5413 int ll_unsignedp
, lr_unsignedp
, rl_unsignedp
, rr_unsignedp
;
5414 machine_mode ll_mode
, lr_mode
, rl_mode
, rr_mode
;
5415 machine_mode lnmode
, rnmode
;
5416 tree ll_mask
, lr_mask
, rl_mask
, rr_mask
;
5417 tree ll_and_mask
, lr_and_mask
, rl_and_mask
, rr_and_mask
;
5418 tree l_const
, r_const
;
5419 tree lntype
, rntype
, result
;
5420 HOST_WIDE_INT first_bit
, end_bit
;
5423 /* Start by getting the comparison codes. Fail if anything is volatile.
5424 If one operand is a BIT_AND_EXPR with the constant one, treat it as if
5425 it were surrounded with a NE_EXPR. */
5427 if (TREE_SIDE_EFFECTS (lhs
) || TREE_SIDE_EFFECTS (rhs
))
5430 lcode
= TREE_CODE (lhs
);
5431 rcode
= TREE_CODE (rhs
);
5433 if (lcode
== BIT_AND_EXPR
&& integer_onep (TREE_OPERAND (lhs
, 1)))
5435 lhs
= build2 (NE_EXPR
, truth_type
, lhs
,
5436 build_int_cst (TREE_TYPE (lhs
), 0));
5440 if (rcode
== BIT_AND_EXPR
&& integer_onep (TREE_OPERAND (rhs
, 1)))
5442 rhs
= build2 (NE_EXPR
, truth_type
, rhs
,
5443 build_int_cst (TREE_TYPE (rhs
), 0));
5447 if (TREE_CODE_CLASS (lcode
) != tcc_comparison
5448 || TREE_CODE_CLASS (rcode
) != tcc_comparison
)
5451 ll_arg
= TREE_OPERAND (lhs
, 0);
5452 lr_arg
= TREE_OPERAND (lhs
, 1);
5453 rl_arg
= TREE_OPERAND (rhs
, 0);
5454 rr_arg
= TREE_OPERAND (rhs
, 1);
5456 /* Simplify (x<y) && (x==y) into (x<=y) and related optimizations. */
5457 if (simple_operand_p (ll_arg
)
5458 && simple_operand_p (lr_arg
))
5460 if (operand_equal_p (ll_arg
, rl_arg
, 0)
5461 && operand_equal_p (lr_arg
, rr_arg
, 0))
5463 result
= combine_comparisons (loc
, code
, lcode
, rcode
,
5464 truth_type
, ll_arg
, lr_arg
);
5468 else if (operand_equal_p (ll_arg
, rr_arg
, 0)
5469 && operand_equal_p (lr_arg
, rl_arg
, 0))
5471 result
= combine_comparisons (loc
, code
, lcode
,
5472 swap_tree_comparison (rcode
),
5473 truth_type
, ll_arg
, lr_arg
);
5479 code
= ((code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
)
5480 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
);
5482 /* If the RHS can be evaluated unconditionally and its operands are
5483 simple, it wins to evaluate the RHS unconditionally on machines
5484 with expensive branches. In this case, this isn't a comparison
5485 that can be merged. */
5487 if (BRANCH_COST (optimize_function_for_speed_p (cfun
),
5489 && ! FLOAT_TYPE_P (TREE_TYPE (rl_arg
))
5490 && simple_operand_p (rl_arg
)
5491 && simple_operand_p (rr_arg
))
5493 /* Convert (a != 0) || (b != 0) into (a | b) != 0. */
5494 if (code
== TRUTH_OR_EXPR
5495 && lcode
== NE_EXPR
&& integer_zerop (lr_arg
)
5496 && rcode
== NE_EXPR
&& integer_zerop (rr_arg
)
5497 && TREE_TYPE (ll_arg
) == TREE_TYPE (rl_arg
)
5498 && INTEGRAL_TYPE_P (TREE_TYPE (ll_arg
)))
5499 return build2_loc (loc
, NE_EXPR
, truth_type
,
5500 build2 (BIT_IOR_EXPR
, TREE_TYPE (ll_arg
),
5502 build_int_cst (TREE_TYPE (ll_arg
), 0));
5504 /* Convert (a == 0) && (b == 0) into (a | b) == 0. */
5505 if (code
== TRUTH_AND_EXPR
5506 && lcode
== EQ_EXPR
&& integer_zerop (lr_arg
)
5507 && rcode
== EQ_EXPR
&& integer_zerop (rr_arg
)
5508 && TREE_TYPE (ll_arg
) == TREE_TYPE (rl_arg
)
5509 && INTEGRAL_TYPE_P (TREE_TYPE (ll_arg
)))
5510 return build2_loc (loc
, EQ_EXPR
, truth_type
,
5511 build2 (BIT_IOR_EXPR
, TREE_TYPE (ll_arg
),
5513 build_int_cst (TREE_TYPE (ll_arg
), 0));
5516 /* See if the comparisons can be merged. Then get all the parameters for
5519 if ((lcode
!= EQ_EXPR
&& lcode
!= NE_EXPR
)
5520 || (rcode
!= EQ_EXPR
&& rcode
!= NE_EXPR
))
5524 ll_inner
= decode_field_reference (loc
, ll_arg
,
5525 &ll_bitsize
, &ll_bitpos
, &ll_mode
,
5526 &ll_unsignedp
, &volatilep
, &ll_mask
,
5528 lr_inner
= decode_field_reference (loc
, lr_arg
,
5529 &lr_bitsize
, &lr_bitpos
, &lr_mode
,
5530 &lr_unsignedp
, &volatilep
, &lr_mask
,
5532 rl_inner
= decode_field_reference (loc
, rl_arg
,
5533 &rl_bitsize
, &rl_bitpos
, &rl_mode
,
5534 &rl_unsignedp
, &volatilep
, &rl_mask
,
5536 rr_inner
= decode_field_reference (loc
, rr_arg
,
5537 &rr_bitsize
, &rr_bitpos
, &rr_mode
,
5538 &rr_unsignedp
, &volatilep
, &rr_mask
,
5541 /* It must be true that the inner operation on the lhs of each
5542 comparison must be the same if we are to be able to do anything.
5543 Then see if we have constants. If not, the same must be true for
5545 if (volatilep
|| ll_inner
== 0 || rl_inner
== 0
5546 || ! operand_equal_p (ll_inner
, rl_inner
, 0))
5549 if (TREE_CODE (lr_arg
) == INTEGER_CST
5550 && TREE_CODE (rr_arg
) == INTEGER_CST
)
5551 l_const
= lr_arg
, r_const
= rr_arg
;
5552 else if (lr_inner
== 0 || rr_inner
== 0
5553 || ! operand_equal_p (lr_inner
, rr_inner
, 0))
5556 l_const
= r_const
= 0;
5558 /* If either comparison code is not correct for our logical operation,
5559 fail. However, we can convert a one-bit comparison against zero into
5560 the opposite comparison against that bit being set in the field. */
5562 wanted_code
= (code
== TRUTH_AND_EXPR
? EQ_EXPR
: NE_EXPR
);
5563 if (lcode
!= wanted_code
)
5565 if (l_const
&& integer_zerop (l_const
) && integer_pow2p (ll_mask
))
5567 /* Make the left operand unsigned, since we are only interested
5568 in the value of one bit. Otherwise we are doing the wrong
5577 /* This is analogous to the code for l_const above. */
5578 if (rcode
!= wanted_code
)
5580 if (r_const
&& integer_zerop (r_const
) && integer_pow2p (rl_mask
))
5589 /* See if we can find a mode that contains both fields being compared on
5590 the left. If we can't, fail. Otherwise, update all constants and masks
5591 to be relative to a field of that size. */
5592 first_bit
= MIN (ll_bitpos
, rl_bitpos
);
5593 end_bit
= MAX (ll_bitpos
+ ll_bitsize
, rl_bitpos
+ rl_bitsize
);
5594 lnmode
= get_best_mode (end_bit
- first_bit
, first_bit
, 0, 0,
5595 TYPE_ALIGN (TREE_TYPE (ll_inner
)), word_mode
,
5597 if (lnmode
== VOIDmode
)
5600 lnbitsize
= GET_MODE_BITSIZE (lnmode
);
5601 lnbitpos
= first_bit
& ~ (lnbitsize
- 1);
5602 lntype
= lang_hooks
.types
.type_for_size (lnbitsize
, 1);
5603 xll_bitpos
= ll_bitpos
- lnbitpos
, xrl_bitpos
= rl_bitpos
- lnbitpos
;
5605 if (BYTES_BIG_ENDIAN
)
5607 xll_bitpos
= lnbitsize
- xll_bitpos
- ll_bitsize
;
5608 xrl_bitpos
= lnbitsize
- xrl_bitpos
- rl_bitsize
;
5611 ll_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
, lntype
, ll_mask
),
5612 size_int (xll_bitpos
));
5613 rl_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
, lntype
, rl_mask
),
5614 size_int (xrl_bitpos
));
5618 l_const
= fold_convert_loc (loc
, lntype
, l_const
);
5619 l_const
= unextend (l_const
, ll_bitsize
, ll_unsignedp
, ll_and_mask
);
5620 l_const
= const_binop (LSHIFT_EXPR
, l_const
, size_int (xll_bitpos
));
5621 if (! integer_zerop (const_binop (BIT_AND_EXPR
, l_const
,
5622 fold_build1_loc (loc
, BIT_NOT_EXPR
,
5625 warning (0, "comparison is always %d", wanted_code
== NE_EXPR
);
5627 return constant_boolean_node (wanted_code
== NE_EXPR
, truth_type
);
5632 r_const
= fold_convert_loc (loc
, lntype
, r_const
);
5633 r_const
= unextend (r_const
, rl_bitsize
, rl_unsignedp
, rl_and_mask
);
5634 r_const
= const_binop (LSHIFT_EXPR
, r_const
, size_int (xrl_bitpos
));
5635 if (! integer_zerop (const_binop (BIT_AND_EXPR
, r_const
,
5636 fold_build1_loc (loc
, BIT_NOT_EXPR
,
5639 warning (0, "comparison is always %d", wanted_code
== NE_EXPR
);
5641 return constant_boolean_node (wanted_code
== NE_EXPR
, truth_type
);
5645 /* If the right sides are not constant, do the same for it. Also,
5646 disallow this optimization if a size or signedness mismatch occurs
5647 between the left and right sides. */
5650 if (ll_bitsize
!= lr_bitsize
|| rl_bitsize
!= rr_bitsize
5651 || ll_unsignedp
!= lr_unsignedp
|| rl_unsignedp
!= rr_unsignedp
5652 /* Make sure the two fields on the right
5653 correspond to the left without being swapped. */
5654 || ll_bitpos
- rl_bitpos
!= lr_bitpos
- rr_bitpos
)
5657 first_bit
= MIN (lr_bitpos
, rr_bitpos
);
5658 end_bit
= MAX (lr_bitpos
+ lr_bitsize
, rr_bitpos
+ rr_bitsize
);
5659 rnmode
= get_best_mode (end_bit
- first_bit
, first_bit
, 0, 0,
5660 TYPE_ALIGN (TREE_TYPE (lr_inner
)), word_mode
,
5662 if (rnmode
== VOIDmode
)
5665 rnbitsize
= GET_MODE_BITSIZE (rnmode
);
5666 rnbitpos
= first_bit
& ~ (rnbitsize
- 1);
5667 rntype
= lang_hooks
.types
.type_for_size (rnbitsize
, 1);
5668 xlr_bitpos
= lr_bitpos
- rnbitpos
, xrr_bitpos
= rr_bitpos
- rnbitpos
;
5670 if (BYTES_BIG_ENDIAN
)
5672 xlr_bitpos
= rnbitsize
- xlr_bitpos
- lr_bitsize
;
5673 xrr_bitpos
= rnbitsize
- xrr_bitpos
- rr_bitsize
;
5676 lr_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
,
5678 size_int (xlr_bitpos
));
5679 rr_mask
= const_binop (LSHIFT_EXPR
, fold_convert_loc (loc
,
5681 size_int (xrr_bitpos
));
5683 /* Make a mask that corresponds to both fields being compared.
5684 Do this for both items being compared. If the operands are the
5685 same size and the bits being compared are in the same position
5686 then we can do this by masking both and comparing the masked
5688 ll_mask
= const_binop (BIT_IOR_EXPR
, ll_mask
, rl_mask
);
5689 lr_mask
= const_binop (BIT_IOR_EXPR
, lr_mask
, rr_mask
);
5690 if (lnbitsize
== rnbitsize
&& xll_bitpos
== xlr_bitpos
)
5692 lhs
= make_bit_field_ref (loc
, ll_inner
, lntype
, lnbitsize
, lnbitpos
,
5693 ll_unsignedp
|| rl_unsignedp
);
5694 if (! all_ones_mask_p (ll_mask
, lnbitsize
))
5695 lhs
= build2 (BIT_AND_EXPR
, lntype
, lhs
, ll_mask
);
5697 rhs
= make_bit_field_ref (loc
, lr_inner
, rntype
, rnbitsize
, rnbitpos
,
5698 lr_unsignedp
|| rr_unsignedp
);
5699 if (! all_ones_mask_p (lr_mask
, rnbitsize
))
5700 rhs
= build2 (BIT_AND_EXPR
, rntype
, rhs
, lr_mask
);
5702 return build2_loc (loc
, wanted_code
, truth_type
, lhs
, rhs
);
5705 /* There is still another way we can do something: If both pairs of
5706 fields being compared are adjacent, we may be able to make a wider
5707 field containing them both.
5709 Note that we still must mask the lhs/rhs expressions. Furthermore,
5710 the mask must be shifted to account for the shift done by
5711 make_bit_field_ref. */
5712 if ((ll_bitsize
+ ll_bitpos
== rl_bitpos
5713 && lr_bitsize
+ lr_bitpos
== rr_bitpos
)
5714 || (ll_bitpos
== rl_bitpos
+ rl_bitsize
5715 && lr_bitpos
== rr_bitpos
+ rr_bitsize
))
5719 lhs
= make_bit_field_ref (loc
, ll_inner
, lntype
,
5720 ll_bitsize
+ rl_bitsize
,
5721 MIN (ll_bitpos
, rl_bitpos
), ll_unsignedp
);
5722 rhs
= make_bit_field_ref (loc
, lr_inner
, rntype
,
5723 lr_bitsize
+ rr_bitsize
,
5724 MIN (lr_bitpos
, rr_bitpos
), lr_unsignedp
);
5726 ll_mask
= const_binop (RSHIFT_EXPR
, ll_mask
,
5727 size_int (MIN (xll_bitpos
, xrl_bitpos
)));
5728 lr_mask
= const_binop (RSHIFT_EXPR
, lr_mask
,
5729 size_int (MIN (xlr_bitpos
, xrr_bitpos
)));
5731 /* Convert to the smaller type before masking out unwanted bits. */
5733 if (lntype
!= rntype
)
5735 if (lnbitsize
> rnbitsize
)
5737 lhs
= fold_convert_loc (loc
, rntype
, lhs
);
5738 ll_mask
= fold_convert_loc (loc
, rntype
, ll_mask
);
5741 else if (lnbitsize
< rnbitsize
)
5743 rhs
= fold_convert_loc (loc
, lntype
, rhs
);
5744 lr_mask
= fold_convert_loc (loc
, lntype
, lr_mask
);
5749 if (! all_ones_mask_p (ll_mask
, ll_bitsize
+ rl_bitsize
))
5750 lhs
= build2 (BIT_AND_EXPR
, type
, lhs
, ll_mask
);
5752 if (! all_ones_mask_p (lr_mask
, lr_bitsize
+ rr_bitsize
))
5753 rhs
= build2 (BIT_AND_EXPR
, type
, rhs
, lr_mask
);
5755 return build2_loc (loc
, wanted_code
, truth_type
, lhs
, rhs
);
5761 /* Handle the case of comparisons with constants. If there is something in
5762 common between the masks, those bits of the constants must be the same.
5763 If not, the condition is always false. Test for this to avoid generating
5764 incorrect code below. */
5765 result
= const_binop (BIT_AND_EXPR
, ll_mask
, rl_mask
);
5766 if (! integer_zerop (result
)
5767 && simple_cst_equal (const_binop (BIT_AND_EXPR
, result
, l_const
),
5768 const_binop (BIT_AND_EXPR
, result
, r_const
)) != 1)
5770 if (wanted_code
== NE_EXPR
)
5772 warning (0, "%<or%> of unmatched not-equal tests is always 1");
5773 return constant_boolean_node (true, truth_type
);
5777 warning (0, "%<and%> of mutually exclusive equal-tests is always 0");
5778 return constant_boolean_node (false, truth_type
);
5782 /* Construct the expression we will return. First get the component
5783 reference we will make. Unless the mask is all ones the width of
5784 that field, perform the mask operation. Then compare with the
5786 result
= make_bit_field_ref (loc
, ll_inner
, lntype
, lnbitsize
, lnbitpos
,
5787 ll_unsignedp
|| rl_unsignedp
);
5789 ll_mask
= const_binop (BIT_IOR_EXPR
, ll_mask
, rl_mask
);
5790 if (! all_ones_mask_p (ll_mask
, lnbitsize
))
5791 result
= build2_loc (loc
, BIT_AND_EXPR
, lntype
, result
, ll_mask
);
5793 return build2_loc (loc
, wanted_code
, truth_type
, result
,
5794 const_binop (BIT_IOR_EXPR
, l_const
, r_const
));
5797 /* Optimize T, which is a comparison of a MIN_EXPR or MAX_EXPR with a
5801 optimize_minmax_comparison (location_t loc
, enum tree_code code
, tree type
,
5805 enum tree_code op_code
;
5808 int consts_equal
, consts_lt
;
5811 STRIP_SIGN_NOPS (arg0
);
5813 op_code
= TREE_CODE (arg0
);
5814 minmax_const
= TREE_OPERAND (arg0
, 1);
5815 comp_const
= fold_convert_loc (loc
, TREE_TYPE (arg0
), op1
);
5816 consts_equal
= tree_int_cst_equal (minmax_const
, comp_const
);
5817 consts_lt
= tree_int_cst_lt (minmax_const
, comp_const
);
5818 inner
= TREE_OPERAND (arg0
, 0);
5820 /* If something does not permit us to optimize, return the original tree. */
5821 if ((op_code
!= MIN_EXPR
&& op_code
!= MAX_EXPR
)
5822 || TREE_CODE (comp_const
) != INTEGER_CST
5823 || TREE_OVERFLOW (comp_const
)
5824 || TREE_CODE (minmax_const
) != INTEGER_CST
5825 || TREE_OVERFLOW (minmax_const
))
5828 /* Now handle all the various comparison codes. We only handle EQ_EXPR
5829 and GT_EXPR, doing the rest with recursive calls using logical
5833 case NE_EXPR
: case LT_EXPR
: case LE_EXPR
:
5836 = optimize_minmax_comparison (loc
,
5837 invert_tree_comparison (code
, false),
5840 return invert_truthvalue_loc (loc
, tem
);
5846 fold_build2_loc (loc
, TRUTH_ORIF_EXPR
, type
,
5847 optimize_minmax_comparison
5848 (loc
, EQ_EXPR
, type
, arg0
, comp_const
),
5849 optimize_minmax_comparison
5850 (loc
, GT_EXPR
, type
, arg0
, comp_const
));
5853 if (op_code
== MAX_EXPR
&& consts_equal
)
5854 /* MAX (X, 0) == 0 -> X <= 0 */
5855 return fold_build2_loc (loc
, LE_EXPR
, type
, inner
, comp_const
);
5857 else if (op_code
== MAX_EXPR
&& consts_lt
)
5858 /* MAX (X, 0) == 5 -> X == 5 */
5859 return fold_build2_loc (loc
, EQ_EXPR
, type
, inner
, comp_const
);
5861 else if (op_code
== MAX_EXPR
)
5862 /* MAX (X, 0) == -1 -> false */
5863 return omit_one_operand_loc (loc
, type
, integer_zero_node
, inner
);
5865 else if (consts_equal
)
5866 /* MIN (X, 0) == 0 -> X >= 0 */
5867 return fold_build2_loc (loc
, GE_EXPR
, type
, inner
, comp_const
);
5870 /* MIN (X, 0) == 5 -> false */
5871 return omit_one_operand_loc (loc
, type
, integer_zero_node
, inner
);
5874 /* MIN (X, 0) == -1 -> X == -1 */
5875 return fold_build2_loc (loc
, EQ_EXPR
, type
, inner
, comp_const
);
5878 if (op_code
== MAX_EXPR
&& (consts_equal
|| consts_lt
))
5879 /* MAX (X, 0) > 0 -> X > 0
5880 MAX (X, 0) > 5 -> X > 5 */
5881 return fold_build2_loc (loc
, GT_EXPR
, type
, inner
, comp_const
);
5883 else if (op_code
== MAX_EXPR
)
5884 /* MAX (X, 0) > -1 -> true */
5885 return omit_one_operand_loc (loc
, type
, integer_one_node
, inner
);
5887 else if (op_code
== MIN_EXPR
&& (consts_equal
|| consts_lt
))
5888 /* MIN (X, 0) > 0 -> false
5889 MIN (X, 0) > 5 -> false */
5890 return omit_one_operand_loc (loc
, type
, integer_zero_node
, inner
);
5893 /* MIN (X, 0) > -1 -> X > -1 */
5894 return fold_build2_loc (loc
, GT_EXPR
, type
, inner
, comp_const
);
5901 /* T is an integer expression that is being multiplied, divided, or taken a
5902 modulus (CODE says which and what kind of divide or modulus) by a
5903 constant C. See if we can eliminate that operation by folding it with
5904 other operations already in T. WIDE_TYPE, if non-null, is a type that
5905 should be used for the computation if wider than our type.
5907 For example, if we are dividing (X * 8) + (Y * 16) by 4, we can return
5908 (X * 2) + (Y * 4). We must, however, be assured that either the original
5909 expression would not overflow or that overflow is undefined for the type
5910 in the language in question.
5912 If we return a non-null expression, it is an equivalent form of the
5913 original computation, but need not be in the original type.
5915 We set *STRICT_OVERFLOW_P to true if the return values depends on
5916 signed overflow being undefined. Otherwise we do not change
5917 *STRICT_OVERFLOW_P. */
5920 extract_muldiv (tree t
, tree c
, enum tree_code code
, tree wide_type
,
5921 bool *strict_overflow_p
)
5923 /* To avoid exponential search depth, refuse to allow recursion past
5924 three levels. Beyond that (1) it's highly unlikely that we'll find
5925 something interesting and (2) we've probably processed it before
5926 when we built the inner expression. */
5935 ret
= extract_muldiv_1 (t
, c
, code
, wide_type
, strict_overflow_p
);
5942 extract_muldiv_1 (tree t
, tree c
, enum tree_code code
, tree wide_type
,
5943 bool *strict_overflow_p
)
5945 tree type
= TREE_TYPE (t
);
5946 enum tree_code tcode
= TREE_CODE (t
);
5947 tree ctype
= (wide_type
!= 0 && (GET_MODE_SIZE (TYPE_MODE (wide_type
))
5948 > GET_MODE_SIZE (TYPE_MODE (type
)))
5949 ? wide_type
: type
);
5951 int same_p
= tcode
== code
;
5952 tree op0
= NULL_TREE
, op1
= NULL_TREE
;
5953 bool sub_strict_overflow_p
;
5955 /* Don't deal with constants of zero here; they confuse the code below. */
5956 if (integer_zerop (c
))
5959 if (TREE_CODE_CLASS (tcode
) == tcc_unary
)
5960 op0
= TREE_OPERAND (t
, 0);
5962 if (TREE_CODE_CLASS (tcode
) == tcc_binary
)
5963 op0
= TREE_OPERAND (t
, 0), op1
= TREE_OPERAND (t
, 1);
5965 /* Note that we need not handle conditional operations here since fold
5966 already handles those cases. So just do arithmetic here. */
5970 /* For a constant, we can always simplify if we are a multiply
5971 or (for divide and modulus) if it is a multiple of our constant. */
5972 if (code
== MULT_EXPR
5973 || wi::multiple_of_p (t
, c
, TYPE_SIGN (type
)))
5974 return const_binop (code
, fold_convert (ctype
, t
),
5975 fold_convert (ctype
, c
));
5978 CASE_CONVERT
: case NON_LVALUE_EXPR
:
5979 /* If op0 is an expression ... */
5980 if ((COMPARISON_CLASS_P (op0
)
5981 || UNARY_CLASS_P (op0
)
5982 || BINARY_CLASS_P (op0
)
5983 || VL_EXP_CLASS_P (op0
)
5984 || EXPRESSION_CLASS_P (op0
))
5985 /* ... and has wrapping overflow, and its type is smaller
5986 than ctype, then we cannot pass through as widening. */
5987 && (((ANY_INTEGRAL_TYPE_P (TREE_TYPE (op0
))
5988 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (op0
)))
5989 && (TYPE_PRECISION (ctype
)
5990 > TYPE_PRECISION (TREE_TYPE (op0
))))
5991 /* ... or this is a truncation (t is narrower than op0),
5992 then we cannot pass through this narrowing. */
5993 || (TYPE_PRECISION (type
)
5994 < TYPE_PRECISION (TREE_TYPE (op0
)))
5995 /* ... or signedness changes for division or modulus,
5996 then we cannot pass through this conversion. */
5997 || (code
!= MULT_EXPR
5998 && (TYPE_UNSIGNED (ctype
)
5999 != TYPE_UNSIGNED (TREE_TYPE (op0
))))
6000 /* ... or has undefined overflow while the converted to
6001 type has not, we cannot do the operation in the inner type
6002 as that would introduce undefined overflow. */
6003 || ((ANY_INTEGRAL_TYPE_P (TREE_TYPE (op0
))
6004 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (op0
)))
6005 && !TYPE_OVERFLOW_UNDEFINED (type
))))
6008 /* Pass the constant down and see if we can make a simplification. If
6009 we can, replace this expression with the inner simplification for
6010 possible later conversion to our or some other type. */
6011 if ((t2
= fold_convert (TREE_TYPE (op0
), c
)) != 0
6012 && TREE_CODE (t2
) == INTEGER_CST
6013 && !TREE_OVERFLOW (t2
)
6014 && (0 != (t1
= extract_muldiv (op0
, t2
, code
,
6016 ? ctype
: NULL_TREE
,
6017 strict_overflow_p
))))
6022 /* If widening the type changes it from signed to unsigned, then we
6023 must avoid building ABS_EXPR itself as unsigned. */
6024 if (TYPE_UNSIGNED (ctype
) && !TYPE_UNSIGNED (type
))
6026 tree cstype
= (*signed_type_for
) (ctype
);
6027 if ((t1
= extract_muldiv (op0
, c
, code
, cstype
, strict_overflow_p
))
6030 t1
= fold_build1 (tcode
, cstype
, fold_convert (cstype
, t1
));
6031 return fold_convert (ctype
, t1
);
6035 /* If the constant is negative, we cannot simplify this. */
6036 if (tree_int_cst_sgn (c
) == -1)
6040 /* For division and modulus, type can't be unsigned, as e.g.
6041 (-(x / 2U)) / 2U isn't equal to -((x / 2U) / 2U) for x >= 2.
6042 For signed types, even with wrapping overflow, this is fine. */
6043 if (code
!= MULT_EXPR
&& TYPE_UNSIGNED (type
))
6045 if ((t1
= extract_muldiv (op0
, c
, code
, wide_type
, strict_overflow_p
))
6047 return fold_build1 (tcode
, ctype
, fold_convert (ctype
, t1
));
6050 case MIN_EXPR
: case MAX_EXPR
:
6051 /* If widening the type changes the signedness, then we can't perform
6052 this optimization as that changes the result. */
6053 if (TYPE_UNSIGNED (ctype
) != TYPE_UNSIGNED (type
))
6056 /* MIN (a, b) / 5 -> MIN (a / 5, b / 5) */
6057 sub_strict_overflow_p
= false;
6058 if ((t1
= extract_muldiv (op0
, c
, code
, wide_type
,
6059 &sub_strict_overflow_p
)) != 0
6060 && (t2
= extract_muldiv (op1
, c
, code
, wide_type
,
6061 &sub_strict_overflow_p
)) != 0)
6063 if (tree_int_cst_sgn (c
) < 0)
6064 tcode
= (tcode
== MIN_EXPR
? MAX_EXPR
: MIN_EXPR
);
6065 if (sub_strict_overflow_p
)
6066 *strict_overflow_p
= true;
6067 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, t1
),
6068 fold_convert (ctype
, t2
));
6072 case LSHIFT_EXPR
: case RSHIFT_EXPR
:
6073 /* If the second operand is constant, this is a multiplication
6074 or floor division, by a power of two, so we can treat it that
6075 way unless the multiplier or divisor overflows. Signed
6076 left-shift overflow is implementation-defined rather than
6077 undefined in C90, so do not convert signed left shift into
6079 if (TREE_CODE (op1
) == INTEGER_CST
6080 && (tcode
== RSHIFT_EXPR
|| TYPE_UNSIGNED (TREE_TYPE (op0
)))
6081 /* const_binop may not detect overflow correctly,
6082 so check for it explicitly here. */
6083 && wi::gtu_p (TYPE_PRECISION (TREE_TYPE (size_one_node
)), op1
)
6084 && 0 != (t1
= fold_convert (ctype
,
6085 const_binop (LSHIFT_EXPR
,
6088 && !TREE_OVERFLOW (t1
))
6089 return extract_muldiv (build2 (tcode
== LSHIFT_EXPR
6090 ? MULT_EXPR
: FLOOR_DIV_EXPR
,
6092 fold_convert (ctype
, op0
),
6094 c
, code
, wide_type
, strict_overflow_p
);
6097 case PLUS_EXPR
: case MINUS_EXPR
:
6098 /* See if we can eliminate the operation on both sides. If we can, we
6099 can return a new PLUS or MINUS. If we can't, the only remaining
6100 cases where we can do anything are if the second operand is a
6102 sub_strict_overflow_p
= false;
6103 t1
= extract_muldiv (op0
, c
, code
, wide_type
, &sub_strict_overflow_p
);
6104 t2
= extract_muldiv (op1
, c
, code
, wide_type
, &sub_strict_overflow_p
);
6105 if (t1
!= 0 && t2
!= 0
6106 && (code
== MULT_EXPR
6107 /* If not multiplication, we can only do this if both operands
6108 are divisible by c. */
6109 || (multiple_of_p (ctype
, op0
, c
)
6110 && multiple_of_p (ctype
, op1
, c
))))
6112 if (sub_strict_overflow_p
)
6113 *strict_overflow_p
= true;
6114 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, t1
),
6115 fold_convert (ctype
, t2
));
6118 /* If this was a subtraction, negate OP1 and set it to be an addition.
6119 This simplifies the logic below. */
6120 if (tcode
== MINUS_EXPR
)
6122 tcode
= PLUS_EXPR
, op1
= negate_expr (op1
);
6123 /* If OP1 was not easily negatable, the constant may be OP0. */
6124 if (TREE_CODE (op0
) == INTEGER_CST
)
6126 std::swap (op0
, op1
);
6131 if (TREE_CODE (op1
) != INTEGER_CST
)
6134 /* If either OP1 or C are negative, this optimization is not safe for
6135 some of the division and remainder types while for others we need
6136 to change the code. */
6137 if (tree_int_cst_sgn (op1
) < 0 || tree_int_cst_sgn (c
) < 0)
6139 if (code
== CEIL_DIV_EXPR
)
6140 code
= FLOOR_DIV_EXPR
;
6141 else if (code
== FLOOR_DIV_EXPR
)
6142 code
= CEIL_DIV_EXPR
;
6143 else if (code
!= MULT_EXPR
6144 && code
!= CEIL_MOD_EXPR
&& code
!= FLOOR_MOD_EXPR
)
6148 /* If it's a multiply or a division/modulus operation of a multiple
6149 of our constant, do the operation and verify it doesn't overflow. */
6150 if (code
== MULT_EXPR
6151 || wi::multiple_of_p (op1
, c
, TYPE_SIGN (type
)))
6153 op1
= const_binop (code
, fold_convert (ctype
, op1
),
6154 fold_convert (ctype
, c
));
6155 /* We allow the constant to overflow with wrapping semantics. */
6157 || (TREE_OVERFLOW (op1
) && !TYPE_OVERFLOW_WRAPS (ctype
)))
6163 /* If we have an unsigned type, we cannot widen the operation since it
6164 will change the result if the original computation overflowed. */
6165 if (TYPE_UNSIGNED (ctype
) && ctype
!= type
)
6168 /* If we were able to eliminate our operation from the first side,
6169 apply our operation to the second side and reform the PLUS. */
6170 if (t1
!= 0 && (TREE_CODE (t1
) != code
|| code
== MULT_EXPR
))
6171 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, t1
), op1
);
6173 /* The last case is if we are a multiply. In that case, we can
6174 apply the distributive law to commute the multiply and addition
6175 if the multiplication of the constants doesn't overflow
6176 and overflow is defined. With undefined overflow
6177 op0 * c might overflow, while (op0 + orig_op1) * c doesn't. */
6178 if (code
== MULT_EXPR
&& TYPE_OVERFLOW_WRAPS (ctype
))
6179 return fold_build2 (tcode
, ctype
,
6180 fold_build2 (code
, ctype
,
6181 fold_convert (ctype
, op0
),
6182 fold_convert (ctype
, c
)),
6188 /* We have a special case here if we are doing something like
6189 (C * 8) % 4 since we know that's zero. */
6190 if ((code
== TRUNC_MOD_EXPR
|| code
== CEIL_MOD_EXPR
6191 || code
== FLOOR_MOD_EXPR
|| code
== ROUND_MOD_EXPR
)
6192 /* If the multiplication can overflow we cannot optimize this. */
6193 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (t
))
6194 && TREE_CODE (TREE_OPERAND (t
, 1)) == INTEGER_CST
6195 && wi::multiple_of_p (op1
, c
, TYPE_SIGN (type
)))
6197 *strict_overflow_p
= true;
6198 return omit_one_operand (type
, integer_zero_node
, op0
);
6201 /* ... fall through ... */
6203 case TRUNC_DIV_EXPR
: case CEIL_DIV_EXPR
: case FLOOR_DIV_EXPR
:
6204 case ROUND_DIV_EXPR
: case EXACT_DIV_EXPR
:
6205 /* If we can extract our operation from the LHS, do so and return a
6206 new operation. Likewise for the RHS from a MULT_EXPR. Otherwise,
6207 do something only if the second operand is a constant. */
6209 && (t1
= extract_muldiv (op0
, c
, code
, wide_type
,
6210 strict_overflow_p
)) != 0)
6211 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, t1
),
6212 fold_convert (ctype
, op1
));
6213 else if (tcode
== MULT_EXPR
&& code
== MULT_EXPR
6214 && (t1
= extract_muldiv (op1
, c
, code
, wide_type
,
6215 strict_overflow_p
)) != 0)
6216 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, op0
),
6217 fold_convert (ctype
, t1
));
6218 else if (TREE_CODE (op1
) != INTEGER_CST
)
6221 /* If these are the same operation types, we can associate them
6222 assuming no overflow. */
6225 bool overflow_p
= false;
6226 bool overflow_mul_p
;
6227 signop sign
= TYPE_SIGN (ctype
);
6228 wide_int mul
= wi::mul (op1
, c
, sign
, &overflow_mul_p
);
6229 overflow_p
= TREE_OVERFLOW (c
) | TREE_OVERFLOW (op1
);
6231 && ((sign
== UNSIGNED
&& tcode
!= MULT_EXPR
) || sign
== SIGNED
))
6234 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, op0
),
6235 wide_int_to_tree (ctype
, mul
));
6238 /* If these operations "cancel" each other, we have the main
6239 optimizations of this pass, which occur when either constant is a
6240 multiple of the other, in which case we replace this with either an
6241 operation or CODE or TCODE.
6243 If we have an unsigned type, we cannot do this since it will change
6244 the result if the original computation overflowed. */
6245 if (TYPE_OVERFLOW_UNDEFINED (ctype
)
6246 && ((code
== MULT_EXPR
&& tcode
== EXACT_DIV_EXPR
)
6247 || (tcode
== MULT_EXPR
6248 && code
!= TRUNC_MOD_EXPR
&& code
!= CEIL_MOD_EXPR
6249 && code
!= FLOOR_MOD_EXPR
&& code
!= ROUND_MOD_EXPR
6250 && code
!= MULT_EXPR
)))
6252 if (wi::multiple_of_p (op1
, c
, TYPE_SIGN (type
)))
6254 if (TYPE_OVERFLOW_UNDEFINED (ctype
))
6255 *strict_overflow_p
= true;
6256 return fold_build2 (tcode
, ctype
, fold_convert (ctype
, op0
),
6257 fold_convert (ctype
,
6258 const_binop (TRUNC_DIV_EXPR
,
6261 else if (wi::multiple_of_p (c
, op1
, TYPE_SIGN (type
)))
6263 if (TYPE_OVERFLOW_UNDEFINED (ctype
))
6264 *strict_overflow_p
= true;
6265 return fold_build2 (code
, ctype
, fold_convert (ctype
, op0
),
6266 fold_convert (ctype
,
6267 const_binop (TRUNC_DIV_EXPR
,
6280 /* Return a node which has the indicated constant VALUE (either 0 or
6281 1 for scalars or {-1,-1,..} or {0,0,...} for vectors),
6282 and is of the indicated TYPE. */
6285 constant_boolean_node (bool value
, tree type
)
6287 if (type
== integer_type_node
)
6288 return value
? integer_one_node
: integer_zero_node
;
6289 else if (type
== boolean_type_node
)
6290 return value
? boolean_true_node
: boolean_false_node
;
6291 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6292 return build_vector_from_val (type
,
6293 build_int_cst (TREE_TYPE (type
),
6296 return fold_convert (type
, value
? integer_one_node
: integer_zero_node
);
6300 /* Transform `a + (b ? x : y)' into `b ? (a + x) : (a + y)'.
6301 Transform, `a + (x < y)' into `(x < y) ? (a + 1) : (a + 0)'. Here
6302 CODE corresponds to the `+', COND to the `(b ? x : y)' or `(x < y)'
6303 expression, and ARG to `a'. If COND_FIRST_P is nonzero, then the
6304 COND is the first argument to CODE; otherwise (as in the example
6305 given here), it is the second argument. TYPE is the type of the
6306 original expression. Return NULL_TREE if no simplification is
6310 fold_binary_op_with_conditional_arg (location_t loc
,
6311 enum tree_code code
,
6312 tree type
, tree op0
, tree op1
,
6313 tree cond
, tree arg
, int cond_first_p
)
6315 tree cond_type
= cond_first_p
? TREE_TYPE (op0
) : TREE_TYPE (op1
);
6316 tree arg_type
= cond_first_p
? TREE_TYPE (op1
) : TREE_TYPE (op0
);
6317 tree test
, true_value
, false_value
;
6318 tree lhs
= NULL_TREE
;
6319 tree rhs
= NULL_TREE
;
6320 enum tree_code cond_code
= COND_EXPR
;
6322 if (TREE_CODE (cond
) == COND_EXPR
6323 || TREE_CODE (cond
) == VEC_COND_EXPR
)
6325 test
= TREE_OPERAND (cond
, 0);
6326 true_value
= TREE_OPERAND (cond
, 1);
6327 false_value
= TREE_OPERAND (cond
, 2);
6328 /* If this operand throws an expression, then it does not make
6329 sense to try to perform a logical or arithmetic operation
6331 if (VOID_TYPE_P (TREE_TYPE (true_value
)))
6333 if (VOID_TYPE_P (TREE_TYPE (false_value
)))
6338 tree testtype
= TREE_TYPE (cond
);
6340 true_value
= constant_boolean_node (true, testtype
);
6341 false_value
= constant_boolean_node (false, testtype
);
6344 if (TREE_CODE (TREE_TYPE (test
)) == VECTOR_TYPE
)
6345 cond_code
= VEC_COND_EXPR
;
6347 /* This transformation is only worthwhile if we don't have to wrap ARG
6348 in a SAVE_EXPR and the operation can be simplified without recursing
6349 on at least one of the branches once its pushed inside the COND_EXPR. */
6350 if (!TREE_CONSTANT (arg
)
6351 && (TREE_SIDE_EFFECTS (arg
)
6352 || TREE_CODE (arg
) == COND_EXPR
|| TREE_CODE (arg
) == VEC_COND_EXPR
6353 || TREE_CONSTANT (true_value
) || TREE_CONSTANT (false_value
)))
6356 arg
= fold_convert_loc (loc
, arg_type
, arg
);
6359 true_value
= fold_convert_loc (loc
, cond_type
, true_value
);
6361 lhs
= fold_build2_loc (loc
, code
, type
, true_value
, arg
);
6363 lhs
= fold_build2_loc (loc
, code
, type
, arg
, true_value
);
6367 false_value
= fold_convert_loc (loc
, cond_type
, false_value
);
6369 rhs
= fold_build2_loc (loc
, code
, type
, false_value
, arg
);
6371 rhs
= fold_build2_loc (loc
, code
, type
, arg
, false_value
);
6374 /* Check that we have simplified at least one of the branches. */
6375 if (!TREE_CONSTANT (arg
) && !TREE_CONSTANT (lhs
) && !TREE_CONSTANT (rhs
))
6378 return fold_build3_loc (loc
, cond_code
, type
, test
, lhs
, rhs
);
6382 /* Subroutine of fold() that checks for the addition of +/- 0.0.
6384 If !NEGATE, return true if ADDEND is +/-0.0 and, for all X of type
6385 TYPE, X + ADDEND is the same as X. If NEGATE, return true if X -
6386 ADDEND is the same as X.
6388 X + 0 and X - 0 both give X when X is NaN, infinite, or nonzero
6389 and finite. The problematic cases are when X is zero, and its mode
6390 has signed zeros. In the case of rounding towards -infinity,
6391 X - 0 is not the same as X because 0 - 0 is -0. In other rounding
6392 modes, X + 0 is not the same as X because -0 + 0 is 0. */
6395 fold_real_zero_addition_p (const_tree type
, const_tree addend
, int negate
)
6397 if (!real_zerop (addend
))
6400 /* Don't allow the fold with -fsignaling-nans. */
6401 if (HONOR_SNANS (element_mode (type
)))
6404 /* Allow the fold if zeros aren't signed, or their sign isn't important. */
6405 if (!HONOR_SIGNED_ZEROS (element_mode (type
)))
6408 /* In a vector or complex, we would need to check the sign of all zeros. */
6409 if (TREE_CODE (addend
) != REAL_CST
)
6412 /* Treat x + -0 as x - 0 and x - -0 as x + 0. */
6413 if (REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (addend
)))
6416 /* The mode has signed zeros, and we have to honor their sign.
6417 In this situation, there is only one case we can return true for.
6418 X - 0 is the same as X unless rounding towards -infinity is
6420 return negate
&& !HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (type
));
6423 /* Subroutine of fold() that checks comparisons of built-in math
6424 functions against real constants.
6426 FCODE is the DECL_FUNCTION_CODE of the built-in, CODE is the comparison
6427 operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR, GE_EXPR or LE_EXPR. TYPE
6428 is the type of the result and ARG0 and ARG1 are the operands of the
6429 comparison. ARG1 must be a TREE_REAL_CST.
6431 The function returns the constant folded tree if a simplification
6432 can be made, and NULL_TREE otherwise. */
6435 fold_mathfn_compare (location_t loc
,
6436 enum built_in_function fcode
, enum tree_code code
,
6437 tree type
, tree arg0
, tree arg1
)
6441 if (BUILTIN_SQRT_P (fcode
))
6443 tree arg
= CALL_EXPR_ARG (arg0
, 0);
6444 machine_mode mode
= TYPE_MODE (TREE_TYPE (arg0
));
6446 c
= TREE_REAL_CST (arg1
);
6447 if (REAL_VALUE_NEGATIVE (c
))
6449 /* sqrt(x) < y is always false, if y is negative. */
6450 if (code
== EQ_EXPR
|| code
== LT_EXPR
|| code
== LE_EXPR
)
6451 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg
);
6453 /* sqrt(x) > y is always true, if y is negative and we
6454 don't care about NaNs, i.e. negative values of x. */
6455 if (code
== NE_EXPR
|| !HONOR_NANS (mode
))
6456 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg
);
6458 /* sqrt(x) > y is the same as x >= 0, if y is negative. */
6459 return fold_build2_loc (loc
, GE_EXPR
, type
, arg
,
6460 build_real (TREE_TYPE (arg
), dconst0
));
6462 else if (code
== GT_EXPR
|| code
== GE_EXPR
)
6466 REAL_ARITHMETIC (c2
, MULT_EXPR
, c
, c
);
6467 real_convert (&c2
, mode
, &c2
);
6469 if (REAL_VALUE_ISINF (c2
))
6471 /* sqrt(x) > y is x == +Inf, when y is very large. */
6472 if (HONOR_INFINITIES (mode
))
6473 return fold_build2_loc (loc
, EQ_EXPR
, type
, arg
,
6474 build_real (TREE_TYPE (arg
), c2
));
6476 /* sqrt(x) > y is always false, when y is very large
6477 and we don't care about infinities. */
6478 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg
);
6481 /* sqrt(x) > c is the same as x > c*c. */
6482 return fold_build2_loc (loc
, code
, type
, arg
,
6483 build_real (TREE_TYPE (arg
), c2
));
6485 else if (code
== LT_EXPR
|| code
== LE_EXPR
)
6489 REAL_ARITHMETIC (c2
, MULT_EXPR
, c
, c
);
6490 real_convert (&c2
, mode
, &c2
);
6492 if (REAL_VALUE_ISINF (c2
))
6494 /* sqrt(x) < y is always true, when y is a very large
6495 value and we don't care about NaNs or Infinities. */
6496 if (! HONOR_NANS (mode
) && ! HONOR_INFINITIES (mode
))
6497 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg
);
6499 /* sqrt(x) < y is x != +Inf when y is very large and we
6500 don't care about NaNs. */
6501 if (! HONOR_NANS (mode
))
6502 return fold_build2_loc (loc
, NE_EXPR
, type
, arg
,
6503 build_real (TREE_TYPE (arg
), c2
));
6505 /* sqrt(x) < y is x >= 0 when y is very large and we
6506 don't care about Infinities. */
6507 if (! HONOR_INFINITIES (mode
))
6508 return fold_build2_loc (loc
, GE_EXPR
, type
, arg
,
6509 build_real (TREE_TYPE (arg
), dconst0
));
6511 /* sqrt(x) < y is x >= 0 && x != +Inf, when y is large. */
6512 arg
= save_expr (arg
);
6513 return fold_build2_loc (loc
, TRUTH_ANDIF_EXPR
, type
,
6514 fold_build2_loc (loc
, GE_EXPR
, type
, arg
,
6515 build_real (TREE_TYPE (arg
),
6517 fold_build2_loc (loc
, NE_EXPR
, type
, arg
,
6518 build_real (TREE_TYPE (arg
),
6522 /* sqrt(x) < c is the same as x < c*c, if we ignore NaNs. */
6523 if (! HONOR_NANS (mode
))
6524 return fold_build2_loc (loc
, code
, type
, arg
,
6525 build_real (TREE_TYPE (arg
), c2
));
6527 /* sqrt(x) < c is the same as x >= 0 && x < c*c. */
6528 arg
= save_expr (arg
);
6529 return fold_build2_loc (loc
, TRUTH_ANDIF_EXPR
, type
,
6530 fold_build2_loc (loc
, GE_EXPR
, type
, arg
,
6531 build_real (TREE_TYPE (arg
),
6533 fold_build2_loc (loc
, code
, type
, arg
,
6534 build_real (TREE_TYPE (arg
),
6542 /* Subroutine of fold() that optimizes comparisons against Infinities,
6543 either +Inf or -Inf.
6545 CODE is the comparison operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR,
6546 GE_EXPR or LE_EXPR. TYPE is the type of the result and ARG0 and ARG1
6547 are the operands of the comparison. ARG1 must be a TREE_REAL_CST.
6549 The function returns the constant folded tree if a simplification
6550 can be made, and NULL_TREE otherwise. */
6553 fold_inf_compare (location_t loc
, enum tree_code code
, tree type
,
6554 tree arg0
, tree arg1
)
6557 REAL_VALUE_TYPE max
;
6561 mode
= TYPE_MODE (TREE_TYPE (arg0
));
6563 /* For negative infinity swap the sense of the comparison. */
6564 neg
= REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg1
));
6566 code
= swap_tree_comparison (code
);
6571 /* x > +Inf is always false, if with ignore sNANs. */
6572 if (HONOR_SNANS (mode
))
6574 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
6577 /* x <= +Inf is always true, if we don't case about NaNs. */
6578 if (! HONOR_NANS (mode
))
6579 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
6581 /* x <= +Inf is the same as x == x, i.e. isfinite(x). */
6582 arg0
= save_expr (arg0
);
6583 return fold_build2_loc (loc
, EQ_EXPR
, type
, arg0
, arg0
);
6587 /* x == +Inf and x >= +Inf are always equal to x > DBL_MAX. */
6588 real_maxval (&max
, neg
, mode
);
6589 return fold_build2_loc (loc
, neg
? LT_EXPR
: GT_EXPR
, type
,
6590 arg0
, build_real (TREE_TYPE (arg0
), max
));
6593 /* x < +Inf is always equal to x <= DBL_MAX. */
6594 real_maxval (&max
, neg
, mode
);
6595 return fold_build2_loc (loc
, neg
? GE_EXPR
: LE_EXPR
, type
,
6596 arg0
, build_real (TREE_TYPE (arg0
), max
));
6599 /* x != +Inf is always equal to !(x > DBL_MAX). */
6600 real_maxval (&max
, neg
, mode
);
6601 if (! HONOR_NANS (mode
))
6602 return fold_build2_loc (loc
, neg
? GE_EXPR
: LE_EXPR
, type
,
6603 arg0
, build_real (TREE_TYPE (arg0
), max
));
6605 temp
= fold_build2_loc (loc
, neg
? LT_EXPR
: GT_EXPR
, type
,
6606 arg0
, build_real (TREE_TYPE (arg0
), max
));
6607 return fold_build1_loc (loc
, TRUTH_NOT_EXPR
, type
, temp
);
6616 /* Subroutine of fold() that optimizes comparisons of a division by
6617 a nonzero integer constant against an integer constant, i.e.
6620 CODE is the comparison operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR,
6621 GE_EXPR or LE_EXPR. TYPE is the type of the result and ARG0 and ARG1
6622 are the operands of the comparison. ARG1 must be a TREE_REAL_CST.
6624 The function returns the constant folded tree if a simplification
6625 can be made, and NULL_TREE otherwise. */
6628 fold_div_compare (location_t loc
,
6629 enum tree_code code
, tree type
, tree arg0
, tree arg1
)
6631 tree prod
, tmp
, hi
, lo
;
6632 tree arg00
= TREE_OPERAND (arg0
, 0);
6633 tree arg01
= TREE_OPERAND (arg0
, 1);
6634 signop sign
= TYPE_SIGN (TREE_TYPE (arg0
));
6635 bool neg_overflow
= false;
6638 /* We have to do this the hard way to detect unsigned overflow.
6639 prod = int_const_binop (MULT_EXPR, arg01, arg1); */
6640 wide_int val
= wi::mul (arg01
, arg1
, sign
, &overflow
);
6641 prod
= force_fit_type (TREE_TYPE (arg00
), val
, -1, overflow
);
6642 neg_overflow
= false;
6644 if (sign
== UNSIGNED
)
6646 tmp
= int_const_binop (MINUS_EXPR
, arg01
,
6647 build_int_cst (TREE_TYPE (arg01
), 1));
6650 /* Likewise hi = int_const_binop (PLUS_EXPR, prod, tmp). */
6651 val
= wi::add (prod
, tmp
, sign
, &overflow
);
6652 hi
= force_fit_type (TREE_TYPE (arg00
), val
,
6653 -1, overflow
| TREE_OVERFLOW (prod
));
6655 else if (tree_int_cst_sgn (arg01
) >= 0)
6657 tmp
= int_const_binop (MINUS_EXPR
, arg01
,
6658 build_int_cst (TREE_TYPE (arg01
), 1));
6659 switch (tree_int_cst_sgn (arg1
))
6662 neg_overflow
= true;
6663 lo
= int_const_binop (MINUS_EXPR
, prod
, tmp
);
6668 lo
= fold_negate_const (tmp
, TREE_TYPE (arg0
));
6673 hi
= int_const_binop (PLUS_EXPR
, prod
, tmp
);
6683 /* A negative divisor reverses the relational operators. */
6684 code
= swap_tree_comparison (code
);
6686 tmp
= int_const_binop (PLUS_EXPR
, arg01
,
6687 build_int_cst (TREE_TYPE (arg01
), 1));
6688 switch (tree_int_cst_sgn (arg1
))
6691 hi
= int_const_binop (MINUS_EXPR
, prod
, tmp
);
6696 hi
= fold_negate_const (tmp
, TREE_TYPE (arg0
));
6701 neg_overflow
= true;
6702 lo
= int_const_binop (PLUS_EXPR
, prod
, tmp
);
6714 if (TREE_OVERFLOW (lo
) && TREE_OVERFLOW (hi
))
6715 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg00
);
6716 if (TREE_OVERFLOW (hi
))
6717 return fold_build2_loc (loc
, GE_EXPR
, type
, arg00
, lo
);
6718 if (TREE_OVERFLOW (lo
))
6719 return fold_build2_loc (loc
, LE_EXPR
, type
, arg00
, hi
);
6720 return build_range_check (loc
, type
, arg00
, 1, lo
, hi
);
6723 if (TREE_OVERFLOW (lo
) && TREE_OVERFLOW (hi
))
6724 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg00
);
6725 if (TREE_OVERFLOW (hi
))
6726 return fold_build2_loc (loc
, LT_EXPR
, type
, arg00
, lo
);
6727 if (TREE_OVERFLOW (lo
))
6728 return fold_build2_loc (loc
, GT_EXPR
, type
, arg00
, hi
);
6729 return build_range_check (loc
, type
, arg00
, 0, lo
, hi
);
6732 if (TREE_OVERFLOW (lo
))
6734 tmp
= neg_overflow
? integer_zero_node
: integer_one_node
;
6735 return omit_one_operand_loc (loc
, type
, tmp
, arg00
);
6737 return fold_build2_loc (loc
, LT_EXPR
, type
, arg00
, lo
);
6740 if (TREE_OVERFLOW (hi
))
6742 tmp
= neg_overflow
? integer_zero_node
: integer_one_node
;
6743 return omit_one_operand_loc (loc
, type
, tmp
, arg00
);
6745 return fold_build2_loc (loc
, LE_EXPR
, type
, arg00
, hi
);
6748 if (TREE_OVERFLOW (hi
))
6750 tmp
= neg_overflow
? integer_one_node
: integer_zero_node
;
6751 return omit_one_operand_loc (loc
, type
, tmp
, arg00
);
6753 return fold_build2_loc (loc
, GT_EXPR
, type
, arg00
, hi
);
6756 if (TREE_OVERFLOW (lo
))
6758 tmp
= neg_overflow
? integer_one_node
: integer_zero_node
;
6759 return omit_one_operand_loc (loc
, type
, tmp
, arg00
);
6761 return fold_build2_loc (loc
, GE_EXPR
, type
, arg00
, lo
);
6771 /* If CODE with arguments ARG0 and ARG1 represents a single bit
6772 equality/inequality test, then return a simplified form of the test
6773 using a sign testing. Otherwise return NULL. TYPE is the desired
6777 fold_single_bit_test_into_sign_test (location_t loc
,
6778 enum tree_code code
, tree arg0
, tree arg1
,
6781 /* If this is testing a single bit, we can optimize the test. */
6782 if ((code
== NE_EXPR
|| code
== EQ_EXPR
)
6783 && TREE_CODE (arg0
) == BIT_AND_EXPR
&& integer_zerop (arg1
)
6784 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
6786 /* If we have (A & C) != 0 where C is the sign bit of A, convert
6787 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
6788 tree arg00
= sign_bit_p (TREE_OPERAND (arg0
, 0), TREE_OPERAND (arg0
, 1));
6790 if (arg00
!= NULL_TREE
6791 /* This is only a win if casting to a signed type is cheap,
6792 i.e. when arg00's type is not a partial mode. */
6793 && TYPE_PRECISION (TREE_TYPE (arg00
))
6794 == GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (arg00
))))
6796 tree stype
= signed_type_for (TREE_TYPE (arg00
));
6797 return fold_build2_loc (loc
, code
== EQ_EXPR
? GE_EXPR
: LT_EXPR
,
6799 fold_convert_loc (loc
, stype
, arg00
),
6800 build_int_cst (stype
, 0));
6807 /* If CODE with arguments ARG0 and ARG1 represents a single bit
6808 equality/inequality test, then return a simplified form of
6809 the test using shifts and logical operations. Otherwise return
6810 NULL. TYPE is the desired result type. */
6813 fold_single_bit_test (location_t loc
, enum tree_code code
,
6814 tree arg0
, tree arg1
, tree result_type
)
6816 /* If this is testing a single bit, we can optimize the test. */
6817 if ((code
== NE_EXPR
|| code
== EQ_EXPR
)
6818 && TREE_CODE (arg0
) == BIT_AND_EXPR
&& integer_zerop (arg1
)
6819 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
6821 tree inner
= TREE_OPERAND (arg0
, 0);
6822 tree type
= TREE_TYPE (arg0
);
6823 int bitnum
= tree_log2 (TREE_OPERAND (arg0
, 1));
6824 machine_mode operand_mode
= TYPE_MODE (type
);
6826 tree signed_type
, unsigned_type
, intermediate_type
;
6829 /* First, see if we can fold the single bit test into a sign-bit
6831 tem
= fold_single_bit_test_into_sign_test (loc
, code
, arg0
, arg1
,
6836 /* Otherwise we have (A & C) != 0 where C is a single bit,
6837 convert that into ((A >> C2) & 1). Where C2 = log2(C).
6838 Similarly for (A & C) == 0. */
6840 /* If INNER is a right shift of a constant and it plus BITNUM does
6841 not overflow, adjust BITNUM and INNER. */
6842 if (TREE_CODE (inner
) == RSHIFT_EXPR
6843 && TREE_CODE (TREE_OPERAND (inner
, 1)) == INTEGER_CST
6844 && bitnum
< TYPE_PRECISION (type
)
6845 && wi::ltu_p (TREE_OPERAND (inner
, 1),
6846 TYPE_PRECISION (type
) - bitnum
))
6848 bitnum
+= tree_to_uhwi (TREE_OPERAND (inner
, 1));
6849 inner
= TREE_OPERAND (inner
, 0);
6852 /* If we are going to be able to omit the AND below, we must do our
6853 operations as unsigned. If we must use the AND, we have a choice.
6854 Normally unsigned is faster, but for some machines signed is. */
6855 #ifdef LOAD_EXTEND_OP
6856 ops_unsigned
= (LOAD_EXTEND_OP (operand_mode
) == SIGN_EXTEND
6857 && !flag_syntax_only
) ? 0 : 1;
6862 signed_type
= lang_hooks
.types
.type_for_mode (operand_mode
, 0);
6863 unsigned_type
= lang_hooks
.types
.type_for_mode (operand_mode
, 1);
6864 intermediate_type
= ops_unsigned
? unsigned_type
: signed_type
;
6865 inner
= fold_convert_loc (loc
, intermediate_type
, inner
);
6868 inner
= build2 (RSHIFT_EXPR
, intermediate_type
,
6869 inner
, size_int (bitnum
));
6871 one
= build_int_cst (intermediate_type
, 1);
6873 if (code
== EQ_EXPR
)
6874 inner
= fold_build2_loc (loc
, BIT_XOR_EXPR
, intermediate_type
, inner
, one
);
6876 /* Put the AND last so it can combine with more things. */
6877 inner
= build2 (BIT_AND_EXPR
, intermediate_type
, inner
, one
);
6879 /* Make sure to return the proper type. */
6880 inner
= fold_convert_loc (loc
, result_type
, inner
);
6887 /* Check whether we are allowed to reorder operands arg0 and arg1,
6888 such that the evaluation of arg1 occurs before arg0. */
6891 reorder_operands_p (const_tree arg0
, const_tree arg1
)
6893 if (! flag_evaluation_order
)
6895 if (TREE_CONSTANT (arg0
) || TREE_CONSTANT (arg1
))
6897 return ! TREE_SIDE_EFFECTS (arg0
)
6898 && ! TREE_SIDE_EFFECTS (arg1
);
6901 /* Test whether it is preferable two swap two operands, ARG0 and
6902 ARG1, for example because ARG0 is an integer constant and ARG1
6903 isn't. If REORDER is true, only recommend swapping if we can
6904 evaluate the operands in reverse order. */
6907 tree_swap_operands_p (const_tree arg0
, const_tree arg1
, bool reorder
)
6909 if (CONSTANT_CLASS_P (arg1
))
6911 if (CONSTANT_CLASS_P (arg0
))
6917 if (TREE_CONSTANT (arg1
))
6919 if (TREE_CONSTANT (arg0
))
6922 if (reorder
&& flag_evaluation_order
6923 && (TREE_SIDE_EFFECTS (arg0
) || TREE_SIDE_EFFECTS (arg1
)))
6926 /* It is preferable to swap two SSA_NAME to ensure a canonical form
6927 for commutative and comparison operators. Ensuring a canonical
6928 form allows the optimizers to find additional redundancies without
6929 having to explicitly check for both orderings. */
6930 if (TREE_CODE (arg0
) == SSA_NAME
6931 && TREE_CODE (arg1
) == SSA_NAME
6932 && SSA_NAME_VERSION (arg0
) > SSA_NAME_VERSION (arg1
))
6935 /* Put SSA_NAMEs last. */
6936 if (TREE_CODE (arg1
) == SSA_NAME
)
6938 if (TREE_CODE (arg0
) == SSA_NAME
)
6941 /* Put variables last. */
6950 /* Fold comparison ARG0 CODE ARG1 (with result in TYPE), where
6951 ARG0 is extended to a wider type. */
6954 fold_widened_comparison (location_t loc
, enum tree_code code
,
6955 tree type
, tree arg0
, tree arg1
)
6957 tree arg0_unw
= get_unwidened (arg0
, NULL_TREE
);
6959 tree shorter_type
, outer_type
;
6963 if (arg0_unw
== arg0
)
6965 shorter_type
= TREE_TYPE (arg0_unw
);
6967 #ifdef HAVE_canonicalize_funcptr_for_compare
6968 /* Disable this optimization if we're casting a function pointer
6969 type on targets that require function pointer canonicalization. */
6970 if (HAVE_canonicalize_funcptr_for_compare
6971 && TREE_CODE (shorter_type
) == POINTER_TYPE
6972 && TREE_CODE (TREE_TYPE (shorter_type
)) == FUNCTION_TYPE
)
6976 if (TYPE_PRECISION (TREE_TYPE (arg0
)) <= TYPE_PRECISION (shorter_type
))
6979 arg1_unw
= get_unwidened (arg1
, NULL_TREE
);
6981 /* If possible, express the comparison in the shorter mode. */
6982 if ((code
== EQ_EXPR
|| code
== NE_EXPR
6983 || TYPE_UNSIGNED (TREE_TYPE (arg0
)) == TYPE_UNSIGNED (shorter_type
))
6984 && (TREE_TYPE (arg1_unw
) == shorter_type
6985 || ((TYPE_PRECISION (shorter_type
)
6986 >= TYPE_PRECISION (TREE_TYPE (arg1_unw
)))
6987 && (TYPE_UNSIGNED (shorter_type
)
6988 == TYPE_UNSIGNED (TREE_TYPE (arg1_unw
))))
6989 || (TREE_CODE (arg1_unw
) == INTEGER_CST
6990 && (TREE_CODE (shorter_type
) == INTEGER_TYPE
6991 || TREE_CODE (shorter_type
) == BOOLEAN_TYPE
)
6992 && int_fits_type_p (arg1_unw
, shorter_type
))))
6993 return fold_build2_loc (loc
, code
, type
, arg0_unw
,
6994 fold_convert_loc (loc
, shorter_type
, arg1_unw
));
6996 if (TREE_CODE (arg1_unw
) != INTEGER_CST
6997 || TREE_CODE (shorter_type
) != INTEGER_TYPE
6998 || !int_fits_type_p (arg1_unw
, shorter_type
))
7001 /* If we are comparing with the integer that does not fit into the range
7002 of the shorter type, the result is known. */
7003 outer_type
= TREE_TYPE (arg1_unw
);
7004 min
= lower_bound_in_type (outer_type
, shorter_type
);
7005 max
= upper_bound_in_type (outer_type
, shorter_type
);
7007 above
= integer_nonzerop (fold_relational_const (LT_EXPR
, type
,
7009 below
= integer_nonzerop (fold_relational_const (LT_EXPR
, type
,
7016 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
7021 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
7027 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
7029 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
7034 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
7036 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
7045 /* Fold comparison ARG0 CODE ARG1 (with result in TYPE), where for
7046 ARG0 just the signedness is changed. */
7049 fold_sign_changed_comparison (location_t loc
, enum tree_code code
, tree type
,
7050 tree arg0
, tree arg1
)
7053 tree inner_type
, outer_type
;
7055 if (!CONVERT_EXPR_P (arg0
))
7058 outer_type
= TREE_TYPE (arg0
);
7059 arg0_inner
= TREE_OPERAND (arg0
, 0);
7060 inner_type
= TREE_TYPE (arg0_inner
);
7062 #ifdef HAVE_canonicalize_funcptr_for_compare
7063 /* Disable this optimization if we're casting a function pointer
7064 type on targets that require function pointer canonicalization. */
7065 if (HAVE_canonicalize_funcptr_for_compare
7066 && TREE_CODE (inner_type
) == POINTER_TYPE
7067 && TREE_CODE (TREE_TYPE (inner_type
)) == FUNCTION_TYPE
)
7071 if (TYPE_PRECISION (inner_type
) != TYPE_PRECISION (outer_type
))
7074 if (TREE_CODE (arg1
) != INTEGER_CST
7075 && !(CONVERT_EXPR_P (arg1
)
7076 && TREE_TYPE (TREE_OPERAND (arg1
, 0)) == inner_type
))
7079 if (TYPE_UNSIGNED (inner_type
) != TYPE_UNSIGNED (outer_type
)
7084 if (POINTER_TYPE_P (inner_type
) != POINTER_TYPE_P (outer_type
))
7087 if (TREE_CODE (arg1
) == INTEGER_CST
)
7088 arg1
= force_fit_type (inner_type
, wi::to_widest (arg1
), 0,
7089 TREE_OVERFLOW (arg1
));
7091 arg1
= fold_convert_loc (loc
, inner_type
, arg1
);
7093 return fold_build2_loc (loc
, code
, type
, arg0_inner
, arg1
);
7097 /* Fold A < X && A + 1 > Y to A < X && A >= Y. Normally A + 1 > Y
7098 means A >= Y && A != MAX, but in this case we know that
7099 A < X <= MAX. INEQ is A + 1 > Y, BOUND is A < X. */
7102 fold_to_nonsharp_ineq_using_bound (location_t loc
, tree ineq
, tree bound
)
7104 tree a
, typea
, type
= TREE_TYPE (ineq
), a1
, diff
, y
;
7106 if (TREE_CODE (bound
) == LT_EXPR
)
7107 a
= TREE_OPERAND (bound
, 0);
7108 else if (TREE_CODE (bound
) == GT_EXPR
)
7109 a
= TREE_OPERAND (bound
, 1);
7113 typea
= TREE_TYPE (a
);
7114 if (!INTEGRAL_TYPE_P (typea
)
7115 && !POINTER_TYPE_P (typea
))
7118 if (TREE_CODE (ineq
) == LT_EXPR
)
7120 a1
= TREE_OPERAND (ineq
, 1);
7121 y
= TREE_OPERAND (ineq
, 0);
7123 else if (TREE_CODE (ineq
) == GT_EXPR
)
7125 a1
= TREE_OPERAND (ineq
, 0);
7126 y
= TREE_OPERAND (ineq
, 1);
7131 if (TREE_TYPE (a1
) != typea
)
7134 if (POINTER_TYPE_P (typea
))
7136 /* Convert the pointer types into integer before taking the difference. */
7137 tree ta
= fold_convert_loc (loc
, ssizetype
, a
);
7138 tree ta1
= fold_convert_loc (loc
, ssizetype
, a1
);
7139 diff
= fold_binary_loc (loc
, MINUS_EXPR
, ssizetype
, ta1
, ta
);
7142 diff
= fold_binary_loc (loc
, MINUS_EXPR
, typea
, a1
, a
);
7144 if (!diff
|| !integer_onep (diff
))
7147 return fold_build2_loc (loc
, GE_EXPR
, type
, a
, y
);
7150 /* Fold a sum or difference of at least one multiplication.
7151 Returns the folded tree or NULL if no simplification could be made. */
7154 fold_plusminus_mult_expr (location_t loc
, enum tree_code code
, tree type
,
7155 tree arg0
, tree arg1
)
7157 tree arg00
, arg01
, arg10
, arg11
;
7158 tree alt0
= NULL_TREE
, alt1
= NULL_TREE
, same
;
7160 /* (A * C) +- (B * C) -> (A+-B) * C.
7161 (A * C) +- A -> A * (C+-1).
7162 We are most concerned about the case where C is a constant,
7163 but other combinations show up during loop reduction. Since
7164 it is not difficult, try all four possibilities. */
7166 if (TREE_CODE (arg0
) == MULT_EXPR
)
7168 arg00
= TREE_OPERAND (arg0
, 0);
7169 arg01
= TREE_OPERAND (arg0
, 1);
7171 else if (TREE_CODE (arg0
) == INTEGER_CST
)
7173 arg00
= build_one_cst (type
);
7178 /* We cannot generate constant 1 for fract. */
7179 if (ALL_FRACT_MODE_P (TYPE_MODE (type
)))
7182 arg01
= build_one_cst (type
);
7184 if (TREE_CODE (arg1
) == MULT_EXPR
)
7186 arg10
= TREE_OPERAND (arg1
, 0);
7187 arg11
= TREE_OPERAND (arg1
, 1);
7189 else if (TREE_CODE (arg1
) == INTEGER_CST
)
7191 arg10
= build_one_cst (type
);
7192 /* As we canonicalize A - 2 to A + -2 get rid of that sign for
7193 the purpose of this canonicalization. */
7194 if (wi::neg_p (arg1
, TYPE_SIGN (TREE_TYPE (arg1
)))
7195 && negate_expr_p (arg1
)
7196 && code
== PLUS_EXPR
)
7198 arg11
= negate_expr (arg1
);
7206 /* We cannot generate constant 1 for fract. */
7207 if (ALL_FRACT_MODE_P (TYPE_MODE (type
)))
7210 arg11
= build_one_cst (type
);
7214 if (operand_equal_p (arg01
, arg11
, 0))
7215 same
= arg01
, alt0
= arg00
, alt1
= arg10
;
7216 else if (operand_equal_p (arg00
, arg10
, 0))
7217 same
= arg00
, alt0
= arg01
, alt1
= arg11
;
7218 else if (operand_equal_p (arg00
, arg11
, 0))
7219 same
= arg00
, alt0
= arg01
, alt1
= arg10
;
7220 else if (operand_equal_p (arg01
, arg10
, 0))
7221 same
= arg01
, alt0
= arg00
, alt1
= arg11
;
7223 /* No identical multiplicands; see if we can find a common
7224 power-of-two factor in non-power-of-two multiplies. This
7225 can help in multi-dimensional array access. */
7226 else if (tree_fits_shwi_p (arg01
)
7227 && tree_fits_shwi_p (arg11
))
7229 HOST_WIDE_INT int01
, int11
, tmp
;
7232 int01
= tree_to_shwi (arg01
);
7233 int11
= tree_to_shwi (arg11
);
7235 /* Move min of absolute values to int11. */
7236 if (absu_hwi (int01
) < absu_hwi (int11
))
7238 tmp
= int01
, int01
= int11
, int11
= tmp
;
7239 alt0
= arg00
, arg00
= arg10
, arg10
= alt0
;
7246 if (exact_log2 (absu_hwi (int11
)) > 0 && int01
% int11
== 0
7247 /* The remainder should not be a constant, otherwise we
7248 end up folding i * 4 + 2 to (i * 2 + 1) * 2 which has
7249 increased the number of multiplications necessary. */
7250 && TREE_CODE (arg10
) != INTEGER_CST
)
7252 alt0
= fold_build2_loc (loc
, MULT_EXPR
, TREE_TYPE (arg00
), arg00
,
7253 build_int_cst (TREE_TYPE (arg00
),
7258 maybe_same
= alt0
, alt0
= alt1
, alt1
= maybe_same
;
7263 return fold_build2_loc (loc
, MULT_EXPR
, type
,
7264 fold_build2_loc (loc
, code
, type
,
7265 fold_convert_loc (loc
, type
, alt0
),
7266 fold_convert_loc (loc
, type
, alt1
)),
7267 fold_convert_loc (loc
, type
, same
));
7272 /* Subroutine of native_encode_expr. Encode the INTEGER_CST
7273 specified by EXPR into the buffer PTR of length LEN bytes.
7274 Return the number of bytes placed in the buffer, or zero
7278 native_encode_int (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7280 tree type
= TREE_TYPE (expr
);
7281 int total_bytes
= GET_MODE_SIZE (TYPE_MODE (type
));
7282 int byte
, offset
, word
, words
;
7283 unsigned char value
;
7285 if ((off
== -1 && total_bytes
> len
)
7286 || off
>= total_bytes
)
7290 words
= total_bytes
/ UNITS_PER_WORD
;
7292 for (byte
= 0; byte
< total_bytes
; byte
++)
7294 int bitpos
= byte
* BITS_PER_UNIT
;
7295 /* Extend EXPR according to TYPE_SIGN if the precision isn't a whole
7297 value
= wi::extract_uhwi (wi::to_widest (expr
), bitpos
, BITS_PER_UNIT
);
7299 if (total_bytes
> UNITS_PER_WORD
)
7301 word
= byte
/ UNITS_PER_WORD
;
7302 if (WORDS_BIG_ENDIAN
)
7303 word
= (words
- 1) - word
;
7304 offset
= word
* UNITS_PER_WORD
;
7305 if (BYTES_BIG_ENDIAN
)
7306 offset
+= (UNITS_PER_WORD
- 1) - (byte
% UNITS_PER_WORD
);
7308 offset
+= byte
% UNITS_PER_WORD
;
7311 offset
= BYTES_BIG_ENDIAN
? (total_bytes
- 1) - byte
: byte
;
7313 && offset
- off
< len
)
7314 ptr
[offset
- off
] = value
;
7316 return MIN (len
, total_bytes
- off
);
7320 /* Subroutine of native_encode_expr. Encode the FIXED_CST
7321 specified by EXPR into the buffer PTR of length LEN bytes.
7322 Return the number of bytes placed in the buffer, or zero
7326 native_encode_fixed (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7328 tree type
= TREE_TYPE (expr
);
7329 machine_mode mode
= TYPE_MODE (type
);
7330 int total_bytes
= GET_MODE_SIZE (mode
);
7331 FIXED_VALUE_TYPE value
;
7332 tree i_value
, i_type
;
7334 if (total_bytes
* BITS_PER_UNIT
> HOST_BITS_PER_DOUBLE_INT
)
7337 i_type
= lang_hooks
.types
.type_for_size (GET_MODE_BITSIZE (mode
), 1);
7339 if (NULL_TREE
== i_type
7340 || TYPE_PRECISION (i_type
) != total_bytes
)
7343 value
= TREE_FIXED_CST (expr
);
7344 i_value
= double_int_to_tree (i_type
, value
.data
);
7346 return native_encode_int (i_value
, ptr
, len
, off
);
7350 /* Subroutine of native_encode_expr. Encode the REAL_CST
7351 specified by EXPR into the buffer PTR of length LEN bytes.
7352 Return the number of bytes placed in the buffer, or zero
7356 native_encode_real (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7358 tree type
= TREE_TYPE (expr
);
7359 int total_bytes
= GET_MODE_SIZE (TYPE_MODE (type
));
7360 int byte
, offset
, word
, words
, bitpos
;
7361 unsigned char value
;
7363 /* There are always 32 bits in each long, no matter the size of
7364 the hosts long. We handle floating point representations with
7368 if ((off
== -1 && total_bytes
> len
)
7369 || off
>= total_bytes
)
7373 words
= (32 / BITS_PER_UNIT
) / UNITS_PER_WORD
;
7375 real_to_target (tmp
, TREE_REAL_CST_PTR (expr
), TYPE_MODE (type
));
7377 for (bitpos
= 0; bitpos
< total_bytes
* BITS_PER_UNIT
;
7378 bitpos
+= BITS_PER_UNIT
)
7380 byte
= (bitpos
/ BITS_PER_UNIT
) & 3;
7381 value
= (unsigned char) (tmp
[bitpos
/ 32] >> (bitpos
& 31));
7383 if (UNITS_PER_WORD
< 4)
7385 word
= byte
/ UNITS_PER_WORD
;
7386 if (WORDS_BIG_ENDIAN
)
7387 word
= (words
- 1) - word
;
7388 offset
= word
* UNITS_PER_WORD
;
7389 if (BYTES_BIG_ENDIAN
)
7390 offset
+= (UNITS_PER_WORD
- 1) - (byte
% UNITS_PER_WORD
);
7392 offset
+= byte
% UNITS_PER_WORD
;
7395 offset
= BYTES_BIG_ENDIAN
? 3 - byte
: byte
;
7396 offset
= offset
+ ((bitpos
/ BITS_PER_UNIT
) & ~3);
7398 && offset
- off
< len
)
7399 ptr
[offset
- off
] = value
;
7401 return MIN (len
, total_bytes
- off
);
7404 /* Subroutine of native_encode_expr. Encode the COMPLEX_CST
7405 specified by EXPR into the buffer PTR of length LEN bytes.
7406 Return the number of bytes placed in the buffer, or zero
7410 native_encode_complex (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7415 part
= TREE_REALPART (expr
);
7416 rsize
= native_encode_expr (part
, ptr
, len
, off
);
7420 part
= TREE_IMAGPART (expr
);
7422 off
= MAX (0, off
- GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (part
))));
7423 isize
= native_encode_expr (part
, ptr
+rsize
, len
-rsize
, off
);
7427 return rsize
+ isize
;
7431 /* Subroutine of native_encode_expr. Encode the VECTOR_CST
7432 specified by EXPR into the buffer PTR of length LEN bytes.
7433 Return the number of bytes placed in the buffer, or zero
7437 native_encode_vector (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7444 count
= VECTOR_CST_NELTS (expr
);
7445 itype
= TREE_TYPE (TREE_TYPE (expr
));
7446 size
= GET_MODE_SIZE (TYPE_MODE (itype
));
7447 for (i
= 0; i
< count
; i
++)
7454 elem
= VECTOR_CST_ELT (expr
, i
);
7455 int res
= native_encode_expr (elem
, ptr
+offset
, len
-offset
, off
);
7456 if ((off
== -1 && res
!= size
)
7469 /* Subroutine of native_encode_expr. Encode the STRING_CST
7470 specified by EXPR into the buffer PTR of length LEN bytes.
7471 Return the number of bytes placed in the buffer, or zero
7475 native_encode_string (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7477 tree type
= TREE_TYPE (expr
);
7478 HOST_WIDE_INT total_bytes
;
7480 if (TREE_CODE (type
) != ARRAY_TYPE
7481 || TREE_CODE (TREE_TYPE (type
)) != INTEGER_TYPE
7482 || GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))) != BITS_PER_UNIT
7483 || !tree_fits_shwi_p (TYPE_SIZE_UNIT (type
)))
7485 total_bytes
= tree_to_shwi (TYPE_SIZE_UNIT (type
));
7486 if ((off
== -1 && total_bytes
> len
)
7487 || off
>= total_bytes
)
7491 if (TREE_STRING_LENGTH (expr
) - off
< MIN (total_bytes
, len
))
7494 if (off
< TREE_STRING_LENGTH (expr
))
7496 written
= MIN (len
, TREE_STRING_LENGTH (expr
) - off
);
7497 memcpy (ptr
, TREE_STRING_POINTER (expr
) + off
, written
);
7499 memset (ptr
+ written
, 0,
7500 MIN (total_bytes
- written
, len
- written
));
7503 memcpy (ptr
, TREE_STRING_POINTER (expr
) + off
, MIN (total_bytes
, len
));
7504 return MIN (total_bytes
- off
, len
);
7508 /* Subroutine of fold_view_convert_expr. Encode the INTEGER_CST,
7509 REAL_CST, COMPLEX_CST or VECTOR_CST specified by EXPR into the
7510 buffer PTR of length LEN bytes. If OFF is not -1 then start
7511 the encoding at byte offset OFF and encode at most LEN bytes.
7512 Return the number of bytes placed in the buffer, or zero upon failure. */
7515 native_encode_expr (const_tree expr
, unsigned char *ptr
, int len
, int off
)
7517 switch (TREE_CODE (expr
))
7520 return native_encode_int (expr
, ptr
, len
, off
);
7523 return native_encode_real (expr
, ptr
, len
, off
);
7526 return native_encode_fixed (expr
, ptr
, len
, off
);
7529 return native_encode_complex (expr
, ptr
, len
, off
);
7532 return native_encode_vector (expr
, ptr
, len
, off
);
7535 return native_encode_string (expr
, ptr
, len
, off
);
7543 /* Subroutine of native_interpret_expr. Interpret the contents of
7544 the buffer PTR of length LEN as an INTEGER_CST of type TYPE.
7545 If the buffer cannot be interpreted, return NULL_TREE. */
7548 native_interpret_int (tree type
, const unsigned char *ptr
, int len
)
7550 int total_bytes
= GET_MODE_SIZE (TYPE_MODE (type
));
7552 if (total_bytes
> len
7553 || total_bytes
* BITS_PER_UNIT
> HOST_BITS_PER_DOUBLE_INT
)
7556 wide_int result
= wi::from_buffer (ptr
, total_bytes
);
7558 return wide_int_to_tree (type
, result
);
7562 /* Subroutine of native_interpret_expr. Interpret the contents of
7563 the buffer PTR of length LEN as a FIXED_CST of type TYPE.
7564 If the buffer cannot be interpreted, return NULL_TREE. */
7567 native_interpret_fixed (tree type
, const unsigned char *ptr
, int len
)
7569 int total_bytes
= GET_MODE_SIZE (TYPE_MODE (type
));
7571 FIXED_VALUE_TYPE fixed_value
;
7573 if (total_bytes
> len
7574 || total_bytes
* BITS_PER_UNIT
> HOST_BITS_PER_DOUBLE_INT
)
7577 result
= double_int::from_buffer (ptr
, total_bytes
);
7578 fixed_value
= fixed_from_double_int (result
, TYPE_MODE (type
));
7580 return build_fixed (type
, fixed_value
);
7584 /* Subroutine of native_interpret_expr. Interpret the contents of
7585 the buffer PTR of length LEN as a REAL_CST of type TYPE.
7586 If the buffer cannot be interpreted, return NULL_TREE. */
7589 native_interpret_real (tree type
, const unsigned char *ptr
, int len
)
7591 machine_mode mode
= TYPE_MODE (type
);
7592 int total_bytes
= GET_MODE_SIZE (mode
);
7593 int byte
, offset
, word
, words
, bitpos
;
7594 unsigned char value
;
7595 /* There are always 32 bits in each long, no matter the size of
7596 the hosts long. We handle floating point representations with
7601 total_bytes
= GET_MODE_SIZE (TYPE_MODE (type
));
7602 if (total_bytes
> len
|| total_bytes
> 24)
7604 words
= (32 / BITS_PER_UNIT
) / UNITS_PER_WORD
;
7606 memset (tmp
, 0, sizeof (tmp
));
7607 for (bitpos
= 0; bitpos
< total_bytes
* BITS_PER_UNIT
;
7608 bitpos
+= BITS_PER_UNIT
)
7610 byte
= (bitpos
/ BITS_PER_UNIT
) & 3;
7611 if (UNITS_PER_WORD
< 4)
7613 word
= byte
/ UNITS_PER_WORD
;
7614 if (WORDS_BIG_ENDIAN
)
7615 word
= (words
- 1) - word
;
7616 offset
= word
* UNITS_PER_WORD
;
7617 if (BYTES_BIG_ENDIAN
)
7618 offset
+= (UNITS_PER_WORD
- 1) - (byte
% UNITS_PER_WORD
);
7620 offset
+= byte
% UNITS_PER_WORD
;
7623 offset
= BYTES_BIG_ENDIAN
? 3 - byte
: byte
;
7624 value
= ptr
[offset
+ ((bitpos
/ BITS_PER_UNIT
) & ~3)];
7626 tmp
[bitpos
/ 32] |= (unsigned long)value
<< (bitpos
& 31);
7629 real_from_target (&r
, tmp
, mode
);
7630 return build_real (type
, r
);
7634 /* Subroutine of native_interpret_expr. Interpret the contents of
7635 the buffer PTR of length LEN as a COMPLEX_CST of type TYPE.
7636 If the buffer cannot be interpreted, return NULL_TREE. */
7639 native_interpret_complex (tree type
, const unsigned char *ptr
, int len
)
7641 tree etype
, rpart
, ipart
;
7644 etype
= TREE_TYPE (type
);
7645 size
= GET_MODE_SIZE (TYPE_MODE (etype
));
7648 rpart
= native_interpret_expr (etype
, ptr
, size
);
7651 ipart
= native_interpret_expr (etype
, ptr
+size
, size
);
7654 return build_complex (type
, rpart
, ipart
);
7658 /* Subroutine of native_interpret_expr. Interpret the contents of
7659 the buffer PTR of length LEN as a VECTOR_CST of type TYPE.
7660 If the buffer cannot be interpreted, return NULL_TREE. */
7663 native_interpret_vector (tree type
, const unsigned char *ptr
, int len
)
7669 etype
= TREE_TYPE (type
);
7670 size
= GET_MODE_SIZE (TYPE_MODE (etype
));
7671 count
= TYPE_VECTOR_SUBPARTS (type
);
7672 if (size
* count
> len
)
7675 elements
= XALLOCAVEC (tree
, count
);
7676 for (i
= count
- 1; i
>= 0; i
--)
7678 elem
= native_interpret_expr (etype
, ptr
+(i
*size
), size
);
7683 return build_vector (type
, elements
);
7687 /* Subroutine of fold_view_convert_expr. Interpret the contents of
7688 the buffer PTR of length LEN as a constant of type TYPE. For
7689 INTEGRAL_TYPE_P we return an INTEGER_CST, for SCALAR_FLOAT_TYPE_P
7690 we return a REAL_CST, etc... If the buffer cannot be interpreted,
7691 return NULL_TREE. */
7694 native_interpret_expr (tree type
, const unsigned char *ptr
, int len
)
7696 switch (TREE_CODE (type
))
7702 case REFERENCE_TYPE
:
7703 return native_interpret_int (type
, ptr
, len
);
7706 return native_interpret_real (type
, ptr
, len
);
7708 case FIXED_POINT_TYPE
:
7709 return native_interpret_fixed (type
, ptr
, len
);
7712 return native_interpret_complex (type
, ptr
, len
);
7715 return native_interpret_vector (type
, ptr
, len
);
7722 /* Returns true if we can interpret the contents of a native encoding
7726 can_native_interpret_type_p (tree type
)
7728 switch (TREE_CODE (type
))
7734 case REFERENCE_TYPE
:
7735 case FIXED_POINT_TYPE
:
7745 /* Fold a VIEW_CONVERT_EXPR of a constant expression EXPR to type
7746 TYPE at compile-time. If we're unable to perform the conversion
7747 return NULL_TREE. */
7750 fold_view_convert_expr (tree type
, tree expr
)
7752 /* We support up to 512-bit values (for V8DFmode). */
7753 unsigned char buffer
[64];
7756 /* Check that the host and target are sane. */
7757 if (CHAR_BIT
!= 8 || BITS_PER_UNIT
!= 8)
7760 len
= native_encode_expr (expr
, buffer
, sizeof (buffer
));
7764 return native_interpret_expr (type
, buffer
, len
);
7767 /* Build an expression for the address of T. Folds away INDIRECT_REF
7768 to avoid confusing the gimplify process. */
7771 build_fold_addr_expr_with_type_loc (location_t loc
, tree t
, tree ptrtype
)
7773 /* The size of the object is not relevant when talking about its address. */
7774 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
7775 t
= TREE_OPERAND (t
, 0);
7777 if (TREE_CODE (t
) == INDIRECT_REF
)
7779 t
= TREE_OPERAND (t
, 0);
7781 if (TREE_TYPE (t
) != ptrtype
)
7782 t
= build1_loc (loc
, NOP_EXPR
, ptrtype
, t
);
7784 else if (TREE_CODE (t
) == MEM_REF
7785 && integer_zerop (TREE_OPERAND (t
, 1)))
7786 return TREE_OPERAND (t
, 0);
7787 else if (TREE_CODE (t
) == MEM_REF
7788 && TREE_CODE (TREE_OPERAND (t
, 0)) == INTEGER_CST
)
7789 return fold_binary (POINTER_PLUS_EXPR
, ptrtype
,
7790 TREE_OPERAND (t
, 0),
7791 convert_to_ptrofftype (TREE_OPERAND (t
, 1)));
7792 else if (TREE_CODE (t
) == VIEW_CONVERT_EXPR
)
7794 t
= build_fold_addr_expr_loc (loc
, TREE_OPERAND (t
, 0));
7796 if (TREE_TYPE (t
) != ptrtype
)
7797 t
= fold_convert_loc (loc
, ptrtype
, t
);
7800 t
= build1_loc (loc
, ADDR_EXPR
, ptrtype
, t
);
7805 /* Build an expression for the address of T. */
7808 build_fold_addr_expr_loc (location_t loc
, tree t
)
7810 tree ptrtype
= build_pointer_type (TREE_TYPE (t
));
7812 return build_fold_addr_expr_with_type_loc (loc
, t
, ptrtype
);
7815 /* Fold a unary expression of code CODE and type TYPE with operand
7816 OP0. Return the folded expression if folding is successful.
7817 Otherwise, return NULL_TREE. */
7820 fold_unary_loc (location_t loc
, enum tree_code code
, tree type
, tree op0
)
7824 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
7826 gcc_assert (IS_EXPR_CODE_CLASS (kind
)
7827 && TREE_CODE_LENGTH (code
) == 1);
7832 if (CONVERT_EXPR_CODE_P (code
)
7833 || code
== FLOAT_EXPR
|| code
== ABS_EXPR
|| code
== NEGATE_EXPR
)
7835 /* Don't use STRIP_NOPS, because signedness of argument type
7837 STRIP_SIGN_NOPS (arg0
);
7841 /* Strip any conversions that don't change the mode. This
7842 is safe for every expression, except for a comparison
7843 expression because its signedness is derived from its
7846 Note that this is done as an internal manipulation within
7847 the constant folder, in order to find the simplest
7848 representation of the arguments so that their form can be
7849 studied. In any cases, the appropriate type conversions
7850 should be put back in the tree that will get out of the
7855 if (CONSTANT_CLASS_P (arg0
))
7857 tree tem
= const_unop (code
, type
, arg0
);
7860 if (TREE_TYPE (tem
) != type
)
7861 tem
= fold_convert_loc (loc
, type
, tem
);
7867 tem
= generic_simplify (loc
, code
, type
, op0
);
7871 if (TREE_CODE_CLASS (code
) == tcc_unary
)
7873 if (TREE_CODE (arg0
) == COMPOUND_EXPR
)
7874 return build2 (COMPOUND_EXPR
, type
, TREE_OPERAND (arg0
, 0),
7875 fold_build1_loc (loc
, code
, type
,
7876 fold_convert_loc (loc
, TREE_TYPE (op0
),
7877 TREE_OPERAND (arg0
, 1))));
7878 else if (TREE_CODE (arg0
) == COND_EXPR
)
7880 tree arg01
= TREE_OPERAND (arg0
, 1);
7881 tree arg02
= TREE_OPERAND (arg0
, 2);
7882 if (! VOID_TYPE_P (TREE_TYPE (arg01
)))
7883 arg01
= fold_build1_loc (loc
, code
, type
,
7884 fold_convert_loc (loc
,
7885 TREE_TYPE (op0
), arg01
));
7886 if (! VOID_TYPE_P (TREE_TYPE (arg02
)))
7887 arg02
= fold_build1_loc (loc
, code
, type
,
7888 fold_convert_loc (loc
,
7889 TREE_TYPE (op0
), arg02
));
7890 tem
= fold_build3_loc (loc
, COND_EXPR
, type
, TREE_OPERAND (arg0
, 0),
7893 /* If this was a conversion, and all we did was to move into
7894 inside the COND_EXPR, bring it back out. But leave it if
7895 it is a conversion from integer to integer and the
7896 result precision is no wider than a word since such a
7897 conversion is cheap and may be optimized away by combine,
7898 while it couldn't if it were outside the COND_EXPR. Then return
7899 so we don't get into an infinite recursion loop taking the
7900 conversion out and then back in. */
7902 if ((CONVERT_EXPR_CODE_P (code
)
7903 || code
== NON_LVALUE_EXPR
)
7904 && TREE_CODE (tem
) == COND_EXPR
7905 && TREE_CODE (TREE_OPERAND (tem
, 1)) == code
7906 && TREE_CODE (TREE_OPERAND (tem
, 2)) == code
7907 && ! VOID_TYPE_P (TREE_OPERAND (tem
, 1))
7908 && ! VOID_TYPE_P (TREE_OPERAND (tem
, 2))
7909 && (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem
, 1), 0))
7910 == TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem
, 2), 0)))
7911 && (! (INTEGRAL_TYPE_P (TREE_TYPE (tem
))
7913 (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem
, 1), 0))))
7914 && TYPE_PRECISION (TREE_TYPE (tem
)) <= BITS_PER_WORD
)
7915 || flag_syntax_only
))
7916 tem
= build1_loc (loc
, code
, type
,
7918 TREE_TYPE (TREE_OPERAND
7919 (TREE_OPERAND (tem
, 1), 0)),
7920 TREE_OPERAND (tem
, 0),
7921 TREE_OPERAND (TREE_OPERAND (tem
, 1), 0),
7922 TREE_OPERAND (TREE_OPERAND (tem
, 2),
7930 case NON_LVALUE_EXPR
:
7931 if (!maybe_lvalue_p (op0
))
7932 return fold_convert_loc (loc
, type
, op0
);
7937 case FIX_TRUNC_EXPR
:
7938 if (COMPARISON_CLASS_P (op0
))
7940 /* If we have (type) (a CMP b) and type is an integral type, return
7941 new expression involving the new type. Canonicalize
7942 (type) (a CMP b) to (a CMP b) ? (type) true : (type) false for
7944 Do not fold the result as that would not simplify further, also
7945 folding again results in recursions. */
7946 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
7947 return build2_loc (loc
, TREE_CODE (op0
), type
,
7948 TREE_OPERAND (op0
, 0),
7949 TREE_OPERAND (op0
, 1));
7950 else if (!INTEGRAL_TYPE_P (type
) && !VOID_TYPE_P (type
)
7951 && TREE_CODE (type
) != VECTOR_TYPE
)
7952 return build3_loc (loc
, COND_EXPR
, type
, op0
,
7953 constant_boolean_node (true, type
),
7954 constant_boolean_node (false, type
));
7957 /* Handle (T *)&A.B.C for A being of type T and B and C
7958 living at offset zero. This occurs frequently in
7959 C++ upcasting and then accessing the base. */
7960 if (TREE_CODE (op0
) == ADDR_EXPR
7961 && POINTER_TYPE_P (type
)
7962 && handled_component_p (TREE_OPERAND (op0
, 0)))
7964 HOST_WIDE_INT bitsize
, bitpos
;
7967 int unsignedp
, volatilep
;
7968 tree base
= TREE_OPERAND (op0
, 0);
7969 base
= get_inner_reference (base
, &bitsize
, &bitpos
, &offset
,
7970 &mode
, &unsignedp
, &volatilep
, false);
7971 /* If the reference was to a (constant) zero offset, we can use
7972 the address of the base if it has the same base type
7973 as the result type and the pointer type is unqualified. */
7974 if (! offset
&& bitpos
== 0
7975 && (TYPE_MAIN_VARIANT (TREE_TYPE (type
))
7976 == TYPE_MAIN_VARIANT (TREE_TYPE (base
)))
7977 && TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
7978 return fold_convert_loc (loc
, type
,
7979 build_fold_addr_expr_loc (loc
, base
));
7982 if (TREE_CODE (op0
) == MODIFY_EXPR
7983 && TREE_CONSTANT (TREE_OPERAND (op0
, 1))
7984 /* Detect assigning a bitfield. */
7985 && !(TREE_CODE (TREE_OPERAND (op0
, 0)) == COMPONENT_REF
7987 (TREE_OPERAND (TREE_OPERAND (op0
, 0), 1))))
7989 /* Don't leave an assignment inside a conversion
7990 unless assigning a bitfield. */
7991 tem
= fold_build1_loc (loc
, code
, type
, TREE_OPERAND (op0
, 1));
7992 /* First do the assignment, then return converted constant. */
7993 tem
= build2_loc (loc
, COMPOUND_EXPR
, TREE_TYPE (tem
), op0
, tem
);
7994 TREE_NO_WARNING (tem
) = 1;
7995 TREE_USED (tem
) = 1;
7999 /* Convert (T)(x & c) into (T)x & (T)c, if c is an integer
8000 constants (if x has signed type, the sign bit cannot be set
8001 in c). This folds extension into the BIT_AND_EXPR.
8002 ??? We don't do it for BOOLEAN_TYPE or ENUMERAL_TYPE because they
8003 very likely don't have maximal range for their precision and this
8004 transformation effectively doesn't preserve non-maximal ranges. */
8005 if (TREE_CODE (type
) == INTEGER_TYPE
8006 && TREE_CODE (op0
) == BIT_AND_EXPR
8007 && TREE_CODE (TREE_OPERAND (op0
, 1)) == INTEGER_CST
)
8009 tree and_expr
= op0
;
8010 tree and0
= TREE_OPERAND (and_expr
, 0);
8011 tree and1
= TREE_OPERAND (and_expr
, 1);
8014 if (TYPE_UNSIGNED (TREE_TYPE (and_expr
))
8015 || (TYPE_PRECISION (type
)
8016 <= TYPE_PRECISION (TREE_TYPE (and_expr
))))
8018 else if (TYPE_PRECISION (TREE_TYPE (and1
))
8019 <= HOST_BITS_PER_WIDE_INT
8020 && tree_fits_uhwi_p (and1
))
8022 unsigned HOST_WIDE_INT cst
;
8024 cst
= tree_to_uhwi (and1
);
8025 cst
&= HOST_WIDE_INT_M1U
8026 << (TYPE_PRECISION (TREE_TYPE (and1
)) - 1);
8027 change
= (cst
== 0);
8028 #ifdef LOAD_EXTEND_OP
8030 && !flag_syntax_only
8031 && (LOAD_EXTEND_OP (TYPE_MODE (TREE_TYPE (and0
)))
8034 tree uns
= unsigned_type_for (TREE_TYPE (and0
));
8035 and0
= fold_convert_loc (loc
, uns
, and0
);
8036 and1
= fold_convert_loc (loc
, uns
, and1
);
8042 tem
= force_fit_type (type
, wi::to_widest (and1
), 0,
8043 TREE_OVERFLOW (and1
));
8044 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
8045 fold_convert_loc (loc
, type
, and0
), tem
);
8049 /* Convert (T1)(X p+ Y) into ((T1)X p+ Y), for pointer type,
8050 when one of the new casts will fold away. Conservatively we assume
8051 that this happens when X or Y is NOP_EXPR or Y is INTEGER_CST. */
8052 if (POINTER_TYPE_P (type
)
8053 && TREE_CODE (arg0
) == POINTER_PLUS_EXPR
8054 && (!TYPE_RESTRICT (type
) || TYPE_RESTRICT (TREE_TYPE (arg0
)))
8055 && (TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
8056 || TREE_CODE (TREE_OPERAND (arg0
, 0)) == NOP_EXPR
8057 || TREE_CODE (TREE_OPERAND (arg0
, 1)) == NOP_EXPR
))
8059 tree arg00
= TREE_OPERAND (arg0
, 0);
8060 tree arg01
= TREE_OPERAND (arg0
, 1);
8062 return fold_build_pointer_plus_loc
8063 (loc
, fold_convert_loc (loc
, type
, arg00
), arg01
);
8066 /* Convert (T1)(~(T2)X) into ~(T1)X if T1 and T2 are integral types
8067 of the same precision, and X is an integer type not narrower than
8068 types T1 or T2, i.e. the cast (T2)X isn't an extension. */
8069 if (INTEGRAL_TYPE_P (type
)
8070 && TREE_CODE (op0
) == BIT_NOT_EXPR
8071 && INTEGRAL_TYPE_P (TREE_TYPE (op0
))
8072 && CONVERT_EXPR_P (TREE_OPERAND (op0
, 0))
8073 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (op0
)))
8075 tem
= TREE_OPERAND (TREE_OPERAND (op0
, 0), 0);
8076 if (INTEGRAL_TYPE_P (TREE_TYPE (tem
))
8077 && TYPE_PRECISION (type
) <= TYPE_PRECISION (TREE_TYPE (tem
)))
8078 return fold_build1_loc (loc
, BIT_NOT_EXPR
, type
,
8079 fold_convert_loc (loc
, type
, tem
));
8082 /* Convert (T1)(X * Y) into (T1)X * (T1)Y if T1 is narrower than the
8083 type of X and Y (integer types only). */
8084 if (INTEGRAL_TYPE_P (type
)
8085 && TREE_CODE (op0
) == MULT_EXPR
8086 && INTEGRAL_TYPE_P (TREE_TYPE (op0
))
8087 && TYPE_PRECISION (type
) < TYPE_PRECISION (TREE_TYPE (op0
)))
8089 /* Be careful not to introduce new overflows. */
8091 if (TYPE_OVERFLOW_WRAPS (type
))
8094 mult_type
= unsigned_type_for (type
);
8096 if (TYPE_PRECISION (mult_type
) < TYPE_PRECISION (TREE_TYPE (op0
)))
8098 tem
= fold_build2_loc (loc
, MULT_EXPR
, mult_type
,
8099 fold_convert_loc (loc
, mult_type
,
8100 TREE_OPERAND (op0
, 0)),
8101 fold_convert_loc (loc
, mult_type
,
8102 TREE_OPERAND (op0
, 1)));
8103 return fold_convert_loc (loc
, type
, tem
);
8109 case VIEW_CONVERT_EXPR
:
8110 if (TREE_CODE (op0
) == MEM_REF
)
8111 return fold_build2_loc (loc
, MEM_REF
, type
,
8112 TREE_OPERAND (op0
, 0), TREE_OPERAND (op0
, 1));
8117 tem
= fold_negate_expr (loc
, arg0
);
8119 return fold_convert_loc (loc
, type
, tem
);
8123 /* Convert fabs((double)float) into (double)fabsf(float). */
8124 if (TREE_CODE (arg0
) == NOP_EXPR
8125 && TREE_CODE (type
) == REAL_TYPE
)
8127 tree targ0
= strip_float_extensions (arg0
);
8129 return fold_convert_loc (loc
, type
,
8130 fold_build1_loc (loc
, ABS_EXPR
,
8134 /* ABS_EXPR<ABS_EXPR<x>> = ABS_EXPR<x> even if flag_wrapv is on. */
8135 else if (TREE_CODE (arg0
) == ABS_EXPR
)
8138 /* Strip sign ops from argument. */
8139 if (TREE_CODE (type
) == REAL_TYPE
)
8141 tem
= fold_strip_sign_ops (arg0
);
8143 return fold_build1_loc (loc
, ABS_EXPR
, type
,
8144 fold_convert_loc (loc
, type
, tem
));
8149 if (TREE_CODE (TREE_TYPE (arg0
)) != COMPLEX_TYPE
)
8150 return fold_convert_loc (loc
, type
, arg0
);
8151 if (TREE_CODE (arg0
) == COMPLEX_EXPR
)
8153 tree itype
= TREE_TYPE (type
);
8154 tree rpart
= fold_convert_loc (loc
, itype
, TREE_OPERAND (arg0
, 0));
8155 tree ipart
= fold_convert_loc (loc
, itype
, TREE_OPERAND (arg0
, 1));
8156 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rpart
,
8157 negate_expr (ipart
));
8159 if (TREE_CODE (arg0
) == CONJ_EXPR
)
8160 return fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
8164 /* Convert ~ (-A) to A - 1. */
8165 if (INTEGRAL_TYPE_P (type
) && TREE_CODE (arg0
) == NEGATE_EXPR
)
8166 return fold_build2_loc (loc
, MINUS_EXPR
, type
,
8167 fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0)),
8168 build_int_cst (type
, 1));
8169 /* Convert ~ (A - 1) or ~ (A + -1) to -A. */
8170 else if (INTEGRAL_TYPE_P (type
)
8171 && ((TREE_CODE (arg0
) == MINUS_EXPR
8172 && integer_onep (TREE_OPERAND (arg0
, 1)))
8173 || (TREE_CODE (arg0
) == PLUS_EXPR
8174 && integer_all_onesp (TREE_OPERAND (arg0
, 1)))))
8176 /* Perform the negation in ARG0's type and only then convert
8177 to TYPE as to avoid introducing undefined behavior. */
8178 tree t
= fold_build1_loc (loc
, NEGATE_EXPR
,
8179 TREE_TYPE (TREE_OPERAND (arg0
, 0)),
8180 TREE_OPERAND (arg0
, 0));
8181 return fold_convert_loc (loc
, type
, t
);
8183 /* Convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */
8184 else if (TREE_CODE (arg0
) == BIT_XOR_EXPR
8185 && (tem
= fold_unary_loc (loc
, BIT_NOT_EXPR
, type
,
8186 fold_convert_loc (loc
, type
,
8187 TREE_OPERAND (arg0
, 0)))))
8188 return fold_build2_loc (loc
, BIT_XOR_EXPR
, type
, tem
,
8189 fold_convert_loc (loc
, type
,
8190 TREE_OPERAND (arg0
, 1)));
8191 else if (TREE_CODE (arg0
) == BIT_XOR_EXPR
8192 && (tem
= fold_unary_loc (loc
, BIT_NOT_EXPR
, type
,
8193 fold_convert_loc (loc
, type
,
8194 TREE_OPERAND (arg0
, 1)))))
8195 return fold_build2_loc (loc
, BIT_XOR_EXPR
, type
,
8196 fold_convert_loc (loc
, type
,
8197 TREE_OPERAND (arg0
, 0)), tem
);
8201 case TRUTH_NOT_EXPR
:
8202 /* Note that the operand of this must be an int
8203 and its values must be 0 or 1.
8204 ("true" is a fixed value perhaps depending on the language,
8205 but we don't handle values other than 1 correctly yet.) */
8206 tem
= fold_truth_not_expr (loc
, arg0
);
8209 return fold_convert_loc (loc
, type
, tem
);
8212 if (TREE_CODE (TREE_TYPE (arg0
)) != COMPLEX_TYPE
)
8213 return fold_convert_loc (loc
, type
, arg0
);
8214 if (TREE_CODE (arg0
) == PLUS_EXPR
|| TREE_CODE (arg0
) == MINUS_EXPR
)
8216 tree itype
= TREE_TYPE (TREE_TYPE (arg0
));
8217 tem
= fold_build2_loc (loc
, TREE_CODE (arg0
), itype
,
8218 fold_build1_loc (loc
, REALPART_EXPR
, itype
,
8219 TREE_OPERAND (arg0
, 0)),
8220 fold_build1_loc (loc
, REALPART_EXPR
, itype
,
8221 TREE_OPERAND (arg0
, 1)));
8222 return fold_convert_loc (loc
, type
, tem
);
8224 if (TREE_CODE (arg0
) == CONJ_EXPR
)
8226 tree itype
= TREE_TYPE (TREE_TYPE (arg0
));
8227 tem
= fold_build1_loc (loc
, REALPART_EXPR
, itype
,
8228 TREE_OPERAND (arg0
, 0));
8229 return fold_convert_loc (loc
, type
, tem
);
8231 if (TREE_CODE (arg0
) == CALL_EXPR
)
8233 tree fn
= get_callee_fndecl (arg0
);
8234 if (fn
&& DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
8235 switch (DECL_FUNCTION_CODE (fn
))
8237 CASE_FLT_FN (BUILT_IN_CEXPI
):
8238 fn
= mathfn_built_in (type
, BUILT_IN_COS
);
8240 return build_call_expr_loc (loc
, fn
, 1, CALL_EXPR_ARG (arg0
, 0));
8250 if (TREE_CODE (TREE_TYPE (arg0
)) != COMPLEX_TYPE
)
8251 return build_zero_cst (type
);
8252 if (TREE_CODE (arg0
) == PLUS_EXPR
|| TREE_CODE (arg0
) == MINUS_EXPR
)
8254 tree itype
= TREE_TYPE (TREE_TYPE (arg0
));
8255 tem
= fold_build2_loc (loc
, TREE_CODE (arg0
), itype
,
8256 fold_build1_loc (loc
, IMAGPART_EXPR
, itype
,
8257 TREE_OPERAND (arg0
, 0)),
8258 fold_build1_loc (loc
, IMAGPART_EXPR
, itype
,
8259 TREE_OPERAND (arg0
, 1)));
8260 return fold_convert_loc (loc
, type
, tem
);
8262 if (TREE_CODE (arg0
) == CONJ_EXPR
)
8264 tree itype
= TREE_TYPE (TREE_TYPE (arg0
));
8265 tem
= fold_build1_loc (loc
, IMAGPART_EXPR
, itype
, TREE_OPERAND (arg0
, 0));
8266 return fold_convert_loc (loc
, type
, negate_expr (tem
));
8268 if (TREE_CODE (arg0
) == CALL_EXPR
)
8270 tree fn
= get_callee_fndecl (arg0
);
8271 if (fn
&& DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
8272 switch (DECL_FUNCTION_CODE (fn
))
8274 CASE_FLT_FN (BUILT_IN_CEXPI
):
8275 fn
= mathfn_built_in (type
, BUILT_IN_SIN
);
8277 return build_call_expr_loc (loc
, fn
, 1, CALL_EXPR_ARG (arg0
, 0));
8287 /* Fold *&X to X if X is an lvalue. */
8288 if (TREE_CODE (op0
) == ADDR_EXPR
)
8290 tree op00
= TREE_OPERAND (op0
, 0);
8291 if ((TREE_CODE (op00
) == VAR_DECL
8292 || TREE_CODE (op00
) == PARM_DECL
8293 || TREE_CODE (op00
) == RESULT_DECL
)
8294 && !TREE_READONLY (op00
))
8301 } /* switch (code) */
8305 /* If the operation was a conversion do _not_ mark a resulting constant
8306 with TREE_OVERFLOW if the original constant was not. These conversions
8307 have implementation defined behavior and retaining the TREE_OVERFLOW
8308 flag here would confuse later passes such as VRP. */
8310 fold_unary_ignore_overflow_loc (location_t loc
, enum tree_code code
,
8311 tree type
, tree op0
)
8313 tree res
= fold_unary_loc (loc
, code
, type
, op0
);
8315 && TREE_CODE (res
) == INTEGER_CST
8316 && TREE_CODE (op0
) == INTEGER_CST
8317 && CONVERT_EXPR_CODE_P (code
))
8318 TREE_OVERFLOW (res
) = TREE_OVERFLOW (op0
);
8323 /* Fold a binary bitwise/truth expression of code CODE and type TYPE with
8324 operands OP0 and OP1. LOC is the location of the resulting expression.
8325 ARG0 and ARG1 are the NOP_STRIPed results of OP0 and OP1.
8326 Return the folded expression if folding is successful. Otherwise,
8327 return NULL_TREE. */
8329 fold_truth_andor (location_t loc
, enum tree_code code
, tree type
,
8330 tree arg0
, tree arg1
, tree op0
, tree op1
)
8334 /* We only do these simplifications if we are optimizing. */
8338 /* Check for things like (A || B) && (A || C). We can convert this
8339 to A || (B && C). Note that either operator can be any of the four
8340 truth and/or operations and the transformation will still be
8341 valid. Also note that we only care about order for the
8342 ANDIF and ORIF operators. If B contains side effects, this
8343 might change the truth-value of A. */
8344 if (TREE_CODE (arg0
) == TREE_CODE (arg1
)
8345 && (TREE_CODE (arg0
) == TRUTH_ANDIF_EXPR
8346 || TREE_CODE (arg0
) == TRUTH_ORIF_EXPR
8347 || TREE_CODE (arg0
) == TRUTH_AND_EXPR
8348 || TREE_CODE (arg0
) == TRUTH_OR_EXPR
)
8349 && ! TREE_SIDE_EFFECTS (TREE_OPERAND (arg0
, 1)))
8351 tree a00
= TREE_OPERAND (arg0
, 0);
8352 tree a01
= TREE_OPERAND (arg0
, 1);
8353 tree a10
= TREE_OPERAND (arg1
, 0);
8354 tree a11
= TREE_OPERAND (arg1
, 1);
8355 int commutative
= ((TREE_CODE (arg0
) == TRUTH_OR_EXPR
8356 || TREE_CODE (arg0
) == TRUTH_AND_EXPR
)
8357 && (code
== TRUTH_AND_EXPR
8358 || code
== TRUTH_OR_EXPR
));
8360 if (operand_equal_p (a00
, a10
, 0))
8361 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
, a00
,
8362 fold_build2_loc (loc
, code
, type
, a01
, a11
));
8363 else if (commutative
&& operand_equal_p (a00
, a11
, 0))
8364 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
, a00
,
8365 fold_build2_loc (loc
, code
, type
, a01
, a10
));
8366 else if (commutative
&& operand_equal_p (a01
, a10
, 0))
8367 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
, a01
,
8368 fold_build2_loc (loc
, code
, type
, a00
, a11
));
8370 /* This case if tricky because we must either have commutative
8371 operators or else A10 must not have side-effects. */
8373 else if ((commutative
|| ! TREE_SIDE_EFFECTS (a10
))
8374 && operand_equal_p (a01
, a11
, 0))
8375 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
,
8376 fold_build2_loc (loc
, code
, type
, a00
, a10
),
8380 /* See if we can build a range comparison. */
8381 if (0 != (tem
= fold_range_test (loc
, code
, type
, op0
, op1
)))
8384 if ((code
== TRUTH_ANDIF_EXPR
&& TREE_CODE (arg0
) == TRUTH_ORIF_EXPR
)
8385 || (code
== TRUTH_ORIF_EXPR
&& TREE_CODE (arg0
) == TRUTH_ANDIF_EXPR
))
8387 tem
= merge_truthop_with_opposite_arm (loc
, arg0
, arg1
, true);
8389 return fold_build2_loc (loc
, code
, type
, tem
, arg1
);
8392 if ((code
== TRUTH_ANDIF_EXPR
&& TREE_CODE (arg1
) == TRUTH_ORIF_EXPR
)
8393 || (code
== TRUTH_ORIF_EXPR
&& TREE_CODE (arg1
) == TRUTH_ANDIF_EXPR
))
8395 tem
= merge_truthop_with_opposite_arm (loc
, arg1
, arg0
, false);
8397 return fold_build2_loc (loc
, code
, type
, arg0
, tem
);
8400 /* Check for the possibility of merging component references. If our
8401 lhs is another similar operation, try to merge its rhs with our
8402 rhs. Then try to merge our lhs and rhs. */
8403 if (TREE_CODE (arg0
) == code
8404 && 0 != (tem
= fold_truth_andor_1 (loc
, code
, type
,
8405 TREE_OPERAND (arg0
, 1), arg1
)))
8406 return fold_build2_loc (loc
, code
, type
, TREE_OPERAND (arg0
, 0), tem
);
8408 if ((tem
= fold_truth_andor_1 (loc
, code
, type
, arg0
, arg1
)) != 0)
8411 if (LOGICAL_OP_NON_SHORT_CIRCUIT
8412 && (code
== TRUTH_AND_EXPR
8413 || code
== TRUTH_ANDIF_EXPR
8414 || code
== TRUTH_OR_EXPR
8415 || code
== TRUTH_ORIF_EXPR
))
8417 enum tree_code ncode
, icode
;
8419 ncode
= (code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_AND_EXPR
)
8420 ? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
;
8421 icode
= ncode
== TRUTH_AND_EXPR
? TRUTH_ANDIF_EXPR
: TRUTH_ORIF_EXPR
;
8423 /* Transform ((A AND-IF B) AND[-IF] C) into (A AND-IF (B AND C)),
8424 or ((A OR-IF B) OR[-IF] C) into (A OR-IF (B OR C))
8425 We don't want to pack more than two leafs to a non-IF AND/OR
8427 If tree-code of left-hand operand isn't an AND/OR-IF code and not
8428 equal to IF-CODE, then we don't want to add right-hand operand.
8429 If the inner right-hand side of left-hand operand has
8430 side-effects, or isn't simple, then we can't add to it,
8431 as otherwise we might destroy if-sequence. */
8432 if (TREE_CODE (arg0
) == icode
8433 && simple_operand_p_2 (arg1
)
8434 /* Needed for sequence points to handle trappings, and
8436 && simple_operand_p_2 (TREE_OPERAND (arg0
, 1)))
8438 tem
= fold_build2_loc (loc
, ncode
, type
, TREE_OPERAND (arg0
, 1),
8440 return fold_build2_loc (loc
, icode
, type
, TREE_OPERAND (arg0
, 0),
8443 /* Same as abouve but for (A AND[-IF] (B AND-IF C)) -> ((A AND B) AND-IF C),
8444 or (A OR[-IF] (B OR-IF C) -> ((A OR B) OR-IF C). */
8445 else if (TREE_CODE (arg1
) == icode
8446 && simple_operand_p_2 (arg0
)
8447 /* Needed for sequence points to handle trappings, and
8449 && simple_operand_p_2 (TREE_OPERAND (arg1
, 0)))
8451 tem
= fold_build2_loc (loc
, ncode
, type
,
8452 arg0
, TREE_OPERAND (arg1
, 0));
8453 return fold_build2_loc (loc
, icode
, type
, tem
,
8454 TREE_OPERAND (arg1
, 1));
8456 /* Transform (A AND-IF B) into (A AND B), or (A OR-IF B)
8458 For sequence point consistancy, we need to check for trapping,
8459 and side-effects. */
8460 else if (code
== icode
&& simple_operand_p_2 (arg0
)
8461 && simple_operand_p_2 (arg1
))
8462 return fold_build2_loc (loc
, ncode
, type
, arg0
, arg1
);
8468 /* Fold a binary expression of code CODE and type TYPE with operands
8469 OP0 and OP1, containing either a MIN-MAX or a MAX-MIN combination.
8470 Return the folded expression if folding is successful. Otherwise,
8471 return NULL_TREE. */
8474 fold_minmax (location_t loc
, enum tree_code code
, tree type
, tree op0
, tree op1
)
8476 enum tree_code compl_code
;
8478 if (code
== MIN_EXPR
)
8479 compl_code
= MAX_EXPR
;
8480 else if (code
== MAX_EXPR
)
8481 compl_code
= MIN_EXPR
;
8485 /* MIN (MAX (a, b), b) == b. */
8486 if (TREE_CODE (op0
) == compl_code
8487 && operand_equal_p (TREE_OPERAND (op0
, 1), op1
, 0))
8488 return omit_one_operand_loc (loc
, type
, op1
, TREE_OPERAND (op0
, 0));
8490 /* MIN (MAX (b, a), b) == b. */
8491 if (TREE_CODE (op0
) == compl_code
8492 && operand_equal_p (TREE_OPERAND (op0
, 0), op1
, 0)
8493 && reorder_operands_p (TREE_OPERAND (op0
, 1), op1
))
8494 return omit_one_operand_loc (loc
, type
, op1
, TREE_OPERAND (op0
, 1));
8496 /* MIN (a, MAX (a, b)) == a. */
8497 if (TREE_CODE (op1
) == compl_code
8498 && operand_equal_p (op0
, TREE_OPERAND (op1
, 0), 0)
8499 && reorder_operands_p (op0
, TREE_OPERAND (op1
, 1)))
8500 return omit_one_operand_loc (loc
, type
, op0
, TREE_OPERAND (op1
, 1));
8502 /* MIN (a, MAX (b, a)) == a. */
8503 if (TREE_CODE (op1
) == compl_code
8504 && operand_equal_p (op0
, TREE_OPERAND (op1
, 1), 0)
8505 && reorder_operands_p (op0
, TREE_OPERAND (op1
, 0)))
8506 return omit_one_operand_loc (loc
, type
, op0
, TREE_OPERAND (op1
, 0));
8511 /* Helper that tries to canonicalize the comparison ARG0 CODE ARG1
8512 by changing CODE to reduce the magnitude of constants involved in
8513 ARG0 of the comparison.
8514 Returns a canonicalized comparison tree if a simplification was
8515 possible, otherwise returns NULL_TREE.
8516 Set *STRICT_OVERFLOW_P to true if the canonicalization is only
8517 valid if signed overflow is undefined. */
8520 maybe_canonicalize_comparison_1 (location_t loc
, enum tree_code code
, tree type
,
8521 tree arg0
, tree arg1
,
8522 bool *strict_overflow_p
)
8524 enum tree_code code0
= TREE_CODE (arg0
);
8525 tree t
, cst0
= NULL_TREE
;
8529 /* Match A +- CST code arg1 and CST code arg1. We can change the
8530 first form only if overflow is undefined. */
8531 if (!(((ANY_INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
8532 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
)))
8533 /* In principle pointers also have undefined overflow behavior,
8534 but that causes problems elsewhere. */
8535 && !POINTER_TYPE_P (TREE_TYPE (arg0
))
8536 && (code0
== MINUS_EXPR
8537 || code0
== PLUS_EXPR
)
8538 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
8539 || code0
== INTEGER_CST
))
8542 /* Identify the constant in arg0 and its sign. */
8543 if (code0
== INTEGER_CST
)
8546 cst0
= TREE_OPERAND (arg0
, 1);
8547 sgn0
= tree_int_cst_sgn (cst0
);
8549 /* Overflowed constants and zero will cause problems. */
8550 if (integer_zerop (cst0
)
8551 || TREE_OVERFLOW (cst0
))
8554 /* See if we can reduce the magnitude of the constant in
8555 arg0 by changing the comparison code. */
8556 if (code0
== INTEGER_CST
)
8558 /* CST <= arg1 -> CST-1 < arg1. */
8559 if (code
== LE_EXPR
&& sgn0
== 1)
8561 /* -CST < arg1 -> -CST-1 <= arg1. */
8562 else if (code
== LT_EXPR
&& sgn0
== -1)
8564 /* CST > arg1 -> CST-1 >= arg1. */
8565 else if (code
== GT_EXPR
&& sgn0
== 1)
8567 /* -CST >= arg1 -> -CST-1 > arg1. */
8568 else if (code
== GE_EXPR
&& sgn0
== -1)
8572 /* arg1 code' CST' might be more canonical. */
8577 /* A - CST < arg1 -> A - CST-1 <= arg1. */
8579 && code0
== ((sgn0
== -1) ? PLUS_EXPR
: MINUS_EXPR
))
8581 /* A + CST > arg1 -> A + CST-1 >= arg1. */
8582 else if (code
== GT_EXPR
8583 && code0
== ((sgn0
== -1) ? MINUS_EXPR
: PLUS_EXPR
))
8585 /* A + CST <= arg1 -> A + CST-1 < arg1. */
8586 else if (code
== LE_EXPR
8587 && code0
== ((sgn0
== -1) ? MINUS_EXPR
: PLUS_EXPR
))
8589 /* A - CST >= arg1 -> A - CST-1 > arg1. */
8590 else if (code
== GE_EXPR
8591 && code0
== ((sgn0
== -1) ? PLUS_EXPR
: MINUS_EXPR
))
8595 *strict_overflow_p
= true;
8598 /* Now build the constant reduced in magnitude. But not if that
8599 would produce one outside of its types range. */
8600 if (INTEGRAL_TYPE_P (TREE_TYPE (cst0
))
8602 && TYPE_MIN_VALUE (TREE_TYPE (cst0
))
8603 && tree_int_cst_equal (cst0
, TYPE_MIN_VALUE (TREE_TYPE (cst0
))))
8605 && TYPE_MAX_VALUE (TREE_TYPE (cst0
))
8606 && tree_int_cst_equal (cst0
, TYPE_MAX_VALUE (TREE_TYPE (cst0
))))))
8607 /* We cannot swap the comparison here as that would cause us to
8608 endlessly recurse. */
8611 t
= int_const_binop (sgn0
== -1 ? PLUS_EXPR
: MINUS_EXPR
,
8612 cst0
, build_int_cst (TREE_TYPE (cst0
), 1));
8613 if (code0
!= INTEGER_CST
)
8614 t
= fold_build2_loc (loc
, code0
, TREE_TYPE (arg0
), TREE_OPERAND (arg0
, 0), t
);
8615 t
= fold_convert (TREE_TYPE (arg1
), t
);
8617 /* If swapping might yield to a more canonical form, do so. */
8619 return fold_build2_loc (loc
, swap_tree_comparison (code
), type
, arg1
, t
);
8621 return fold_build2_loc (loc
, code
, type
, t
, arg1
);
8624 /* Canonicalize the comparison ARG0 CODE ARG1 with type TYPE with undefined
8625 overflow further. Try to decrease the magnitude of constants involved
8626 by changing LE_EXPR and GE_EXPR to LT_EXPR and GT_EXPR or vice versa
8627 and put sole constants at the second argument position.
8628 Returns the canonicalized tree if changed, otherwise NULL_TREE. */
8631 maybe_canonicalize_comparison (location_t loc
, enum tree_code code
, tree type
,
8632 tree arg0
, tree arg1
)
8635 bool strict_overflow_p
;
8636 const char * const warnmsg
= G_("assuming signed overflow does not occur "
8637 "when reducing constant in comparison");
8639 /* Try canonicalization by simplifying arg0. */
8640 strict_overflow_p
= false;
8641 t
= maybe_canonicalize_comparison_1 (loc
, code
, type
, arg0
, arg1
,
8642 &strict_overflow_p
);
8645 if (strict_overflow_p
)
8646 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_MAGNITUDE
);
8650 /* Try canonicalization by simplifying arg1 using the swapped
8652 code
= swap_tree_comparison (code
);
8653 strict_overflow_p
= false;
8654 t
= maybe_canonicalize_comparison_1 (loc
, code
, type
, arg1
, arg0
,
8655 &strict_overflow_p
);
8656 if (t
&& strict_overflow_p
)
8657 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_MAGNITUDE
);
8661 /* Return whether BASE + OFFSET + BITPOS may wrap around the address
8662 space. This is used to avoid issuing overflow warnings for
8663 expressions like &p->x which can not wrap. */
8666 pointer_may_wrap_p (tree base
, tree offset
, HOST_WIDE_INT bitpos
)
8668 if (!POINTER_TYPE_P (TREE_TYPE (base
)))
8675 int precision
= TYPE_PRECISION (TREE_TYPE (base
));
8676 if (offset
== NULL_TREE
)
8677 wi_offset
= wi::zero (precision
);
8678 else if (TREE_CODE (offset
) != INTEGER_CST
|| TREE_OVERFLOW (offset
))
8684 wide_int units
= wi::shwi (bitpos
/ BITS_PER_UNIT
, precision
);
8685 wide_int total
= wi::add (wi_offset
, units
, UNSIGNED
, &overflow
);
8689 if (!wi::fits_uhwi_p (total
))
8692 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (TREE_TYPE (base
)));
8696 /* We can do slightly better for SIZE if we have an ADDR_EXPR of an
8698 if (TREE_CODE (base
) == ADDR_EXPR
)
8700 HOST_WIDE_INT base_size
;
8702 base_size
= int_size_in_bytes (TREE_TYPE (TREE_OPERAND (base
, 0)));
8703 if (base_size
> 0 && size
< base_size
)
8707 return total
.to_uhwi () > (unsigned HOST_WIDE_INT
) size
;
8710 /* Return the HOST_WIDE_INT least significant bits of T, a sizetype
8711 kind INTEGER_CST. This makes sure to properly sign-extend the
8714 static HOST_WIDE_INT
8715 size_low_cst (const_tree t
)
8717 HOST_WIDE_INT w
= TREE_INT_CST_ELT (t
, 0);
8718 int prec
= TYPE_PRECISION (TREE_TYPE (t
));
8719 if (prec
< HOST_BITS_PER_WIDE_INT
)
8720 return sext_hwi (w
, prec
);
8724 /* Subroutine of fold_binary. This routine performs all of the
8725 transformations that are common to the equality/inequality
8726 operators (EQ_EXPR and NE_EXPR) and the ordering operators
8727 (LT_EXPR, LE_EXPR, GE_EXPR and GT_EXPR). Callers other than
8728 fold_binary should call fold_binary. Fold a comparison with
8729 tree code CODE and type TYPE with operands OP0 and OP1. Return
8730 the folded comparison or NULL_TREE. */
8733 fold_comparison (location_t loc
, enum tree_code code
, tree type
,
8736 const bool equality_code
= (code
== EQ_EXPR
|| code
== NE_EXPR
);
8737 tree arg0
, arg1
, tem
;
8742 STRIP_SIGN_NOPS (arg0
);
8743 STRIP_SIGN_NOPS (arg1
);
8745 /* Transform comparisons of the form X +- C1 CMP C2 to X CMP C2 -+ C1. */
8746 if ((TREE_CODE (arg0
) == PLUS_EXPR
|| TREE_CODE (arg0
) == MINUS_EXPR
)
8748 || (ANY_INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
8749 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
))))
8750 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
8751 && !TREE_OVERFLOW (TREE_OPERAND (arg0
, 1))
8752 && TREE_CODE (arg1
) == INTEGER_CST
8753 && !TREE_OVERFLOW (arg1
))
8755 const enum tree_code
8756 reverse_op
= TREE_CODE (arg0
) == PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
;
8757 tree const1
= TREE_OPERAND (arg0
, 1);
8758 tree const2
= fold_convert_loc (loc
, TREE_TYPE (const1
), arg1
);
8759 tree variable
= TREE_OPERAND (arg0
, 0);
8760 tree new_const
= int_const_binop (reverse_op
, const2
, const1
);
8762 /* If the constant operation overflowed this can be
8763 simplified as a comparison against INT_MAX/INT_MIN. */
8764 if (TREE_OVERFLOW (new_const
)
8765 && !TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg0
)))
8767 int const1_sgn
= tree_int_cst_sgn (const1
);
8768 enum tree_code code2
= code
;
8770 /* Get the sign of the constant on the lhs if the
8771 operation were VARIABLE + CONST1. */
8772 if (TREE_CODE (arg0
) == MINUS_EXPR
)
8773 const1_sgn
= -const1_sgn
;
8775 /* The sign of the constant determines if we overflowed
8776 INT_MAX (const1_sgn == -1) or INT_MIN (const1_sgn == 1).
8777 Canonicalize to the INT_MIN overflow by swapping the comparison
8779 if (const1_sgn
== -1)
8780 code2
= swap_tree_comparison (code
);
8782 /* We now can look at the canonicalized case
8783 VARIABLE + 1 CODE2 INT_MIN
8784 and decide on the result. */
8791 omit_one_operand_loc (loc
, type
, boolean_false_node
, variable
);
8797 omit_one_operand_loc (loc
, type
, boolean_true_node
, variable
);
8806 fold_overflow_warning ("assuming signed overflow does not occur "
8807 "when changing X +- C1 cmp C2 to "
8809 WARN_STRICT_OVERFLOW_COMPARISON
);
8810 return fold_build2_loc (loc
, code
, type
, variable
, new_const
);
8814 /* Transform comparisons of the form X - Y CMP 0 to X CMP Y. */
8815 if (TREE_CODE (arg0
) == MINUS_EXPR
8817 && integer_zerop (arg1
))
8819 /* ??? The transformation is valid for the other operators if overflow
8820 is undefined for the type, but performing it here badly interacts
8821 with the transformation in fold_cond_expr_with_comparison which
8822 attempts to synthetize ABS_EXPR. */
8824 fold_overflow_warning ("assuming signed overflow does not occur "
8825 "when changing X - Y cmp 0 to X cmp Y",
8826 WARN_STRICT_OVERFLOW_COMPARISON
);
8827 return fold_build2_loc (loc
, code
, type
, TREE_OPERAND (arg0
, 0),
8828 TREE_OPERAND (arg0
, 1));
8831 /* For comparisons of pointers we can decompose it to a compile time
8832 comparison of the base objects and the offsets into the object.
8833 This requires at least one operand being an ADDR_EXPR or a
8834 POINTER_PLUS_EXPR to do more than the operand_equal_p test below. */
8835 if (POINTER_TYPE_P (TREE_TYPE (arg0
))
8836 && (TREE_CODE (arg0
) == ADDR_EXPR
8837 || TREE_CODE (arg1
) == ADDR_EXPR
8838 || TREE_CODE (arg0
) == POINTER_PLUS_EXPR
8839 || TREE_CODE (arg1
) == POINTER_PLUS_EXPR
))
8841 tree base0
, base1
, offset0
= NULL_TREE
, offset1
= NULL_TREE
;
8842 HOST_WIDE_INT bitsize
, bitpos0
= 0, bitpos1
= 0;
8844 int volatilep
, unsignedp
;
8845 bool indirect_base0
= false, indirect_base1
= false;
8847 /* Get base and offset for the access. Strip ADDR_EXPR for
8848 get_inner_reference, but put it back by stripping INDIRECT_REF
8849 off the base object if possible. indirect_baseN will be true
8850 if baseN is not an address but refers to the object itself. */
8852 if (TREE_CODE (arg0
) == ADDR_EXPR
)
8854 base0
= get_inner_reference (TREE_OPERAND (arg0
, 0),
8855 &bitsize
, &bitpos0
, &offset0
, &mode
,
8856 &unsignedp
, &volatilep
, false);
8857 if (TREE_CODE (base0
) == INDIRECT_REF
)
8858 base0
= TREE_OPERAND (base0
, 0);
8860 indirect_base0
= true;
8862 else if (TREE_CODE (arg0
) == POINTER_PLUS_EXPR
)
8864 base0
= TREE_OPERAND (arg0
, 0);
8865 STRIP_SIGN_NOPS (base0
);
8866 if (TREE_CODE (base0
) == ADDR_EXPR
)
8868 base0
= TREE_OPERAND (base0
, 0);
8869 indirect_base0
= true;
8871 offset0
= TREE_OPERAND (arg0
, 1);
8872 if (tree_fits_shwi_p (offset0
))
8874 HOST_WIDE_INT off
= size_low_cst (offset0
);
8875 if ((HOST_WIDE_INT
) (((unsigned HOST_WIDE_INT
) off
)
8877 / BITS_PER_UNIT
== (HOST_WIDE_INT
) off
)
8879 bitpos0
= off
* BITS_PER_UNIT
;
8880 offset0
= NULL_TREE
;
8886 if (TREE_CODE (arg1
) == ADDR_EXPR
)
8888 base1
= get_inner_reference (TREE_OPERAND (arg1
, 0),
8889 &bitsize
, &bitpos1
, &offset1
, &mode
,
8890 &unsignedp
, &volatilep
, false);
8891 if (TREE_CODE (base1
) == INDIRECT_REF
)
8892 base1
= TREE_OPERAND (base1
, 0);
8894 indirect_base1
= true;
8896 else if (TREE_CODE (arg1
) == POINTER_PLUS_EXPR
)
8898 base1
= TREE_OPERAND (arg1
, 0);
8899 STRIP_SIGN_NOPS (base1
);
8900 if (TREE_CODE (base1
) == ADDR_EXPR
)
8902 base1
= TREE_OPERAND (base1
, 0);
8903 indirect_base1
= true;
8905 offset1
= TREE_OPERAND (arg1
, 1);
8906 if (tree_fits_shwi_p (offset1
))
8908 HOST_WIDE_INT off
= size_low_cst (offset1
);
8909 if ((HOST_WIDE_INT
) (((unsigned HOST_WIDE_INT
) off
)
8911 / BITS_PER_UNIT
== (HOST_WIDE_INT
) off
)
8913 bitpos1
= off
* BITS_PER_UNIT
;
8914 offset1
= NULL_TREE
;
8919 /* A local variable can never be pointed to by
8920 the default SSA name of an incoming parameter. */
8921 if ((TREE_CODE (arg0
) == ADDR_EXPR
8923 && TREE_CODE (base0
) == VAR_DECL
8924 && auto_var_in_fn_p (base0
, current_function_decl
)
8926 && TREE_CODE (base1
) == SSA_NAME
8927 && SSA_NAME_IS_DEFAULT_DEF (base1
)
8928 && TREE_CODE (SSA_NAME_VAR (base1
)) == PARM_DECL
)
8929 || (TREE_CODE (arg1
) == ADDR_EXPR
8931 && TREE_CODE (base1
) == VAR_DECL
8932 && auto_var_in_fn_p (base1
, current_function_decl
)
8934 && TREE_CODE (base0
) == SSA_NAME
8935 && SSA_NAME_IS_DEFAULT_DEF (base0
)
8936 && TREE_CODE (SSA_NAME_VAR (base0
)) == PARM_DECL
))
8938 if (code
== NE_EXPR
)
8939 return constant_boolean_node (1, type
);
8940 else if (code
== EQ_EXPR
)
8941 return constant_boolean_node (0, type
);
8943 /* If we have equivalent bases we might be able to simplify. */
8944 else if (indirect_base0
== indirect_base1
8945 && operand_equal_p (base0
, base1
, 0))
8947 /* We can fold this expression to a constant if the non-constant
8948 offset parts are equal. */
8949 if ((offset0
== offset1
8950 || (offset0
&& offset1
8951 && operand_equal_p (offset0
, offset1
, 0)))
8954 || (indirect_base0
&& DECL_P (base0
))
8955 || POINTER_TYPE_OVERFLOW_UNDEFINED
))
8959 && bitpos0
!= bitpos1
8960 && (pointer_may_wrap_p (base0
, offset0
, bitpos0
)
8961 || pointer_may_wrap_p (base1
, offset1
, bitpos1
)))
8962 fold_overflow_warning (("assuming pointer wraparound does not "
8963 "occur when comparing P +- C1 with "
8965 WARN_STRICT_OVERFLOW_CONDITIONAL
);
8970 return constant_boolean_node (bitpos0
== bitpos1
, type
);
8972 return constant_boolean_node (bitpos0
!= bitpos1
, type
);
8974 return constant_boolean_node (bitpos0
< bitpos1
, type
);
8976 return constant_boolean_node (bitpos0
<= bitpos1
, type
);
8978 return constant_boolean_node (bitpos0
>= bitpos1
, type
);
8980 return constant_boolean_node (bitpos0
> bitpos1
, type
);
8984 /* We can simplify the comparison to a comparison of the variable
8985 offset parts if the constant offset parts are equal.
8986 Be careful to use signed sizetype here because otherwise we
8987 mess with array offsets in the wrong way. This is possible
8988 because pointer arithmetic is restricted to retain within an
8989 object and overflow on pointer differences is undefined as of
8990 6.5.6/8 and /9 with respect to the signed ptrdiff_t. */
8991 else if (bitpos0
== bitpos1
8993 || (indirect_base0
&& DECL_P (base0
))
8994 || POINTER_TYPE_OVERFLOW_UNDEFINED
))
8996 /* By converting to signed sizetype we cover middle-end pointer
8997 arithmetic which operates on unsigned pointer types of size
8998 type size and ARRAY_REF offsets which are properly sign or
8999 zero extended from their type in case it is narrower than
9001 if (offset0
== NULL_TREE
)
9002 offset0
= build_int_cst (ssizetype
, 0);
9004 offset0
= fold_convert_loc (loc
, ssizetype
, offset0
);
9005 if (offset1
== NULL_TREE
)
9006 offset1
= build_int_cst (ssizetype
, 0);
9008 offset1
= fold_convert_loc (loc
, ssizetype
, offset1
);
9011 && (pointer_may_wrap_p (base0
, offset0
, bitpos0
)
9012 || pointer_may_wrap_p (base1
, offset1
, bitpos1
)))
9013 fold_overflow_warning (("assuming pointer wraparound does not "
9014 "occur when comparing P +- C1 with "
9016 WARN_STRICT_OVERFLOW_COMPARISON
);
9018 return fold_build2_loc (loc
, code
, type
, offset0
, offset1
);
9021 /* For non-equal bases we can simplify if they are addresses
9022 declarations with different addresses. */
9023 else if (indirect_base0
&& indirect_base1
9024 /* We know that !operand_equal_p (base0, base1, 0)
9025 because the if condition was false. But make
9026 sure two decls are not the same. */
9028 && TREE_CODE (arg0
) == ADDR_EXPR
9029 && TREE_CODE (arg1
) == ADDR_EXPR
9032 /* Watch for aliases. */
9033 && (!decl_in_symtab_p (base0
)
9034 || !decl_in_symtab_p (base1
)
9035 || !symtab_node::get_create (base0
)->equal_address_to
9036 (symtab_node::get_create (base1
))))
9038 if (code
== EQ_EXPR
)
9039 return omit_two_operands_loc (loc
, type
, boolean_false_node
,
9041 else if (code
== NE_EXPR
)
9042 return omit_two_operands_loc (loc
, type
, boolean_true_node
,
9045 /* For equal offsets we can simplify to a comparison of the
9047 else if (bitpos0
== bitpos1
9049 ? base0
!= TREE_OPERAND (arg0
, 0) : base0
!= arg0
)
9051 ? base1
!= TREE_OPERAND (arg1
, 0) : base1
!= arg1
)
9052 && ((offset0
== offset1
)
9053 || (offset0
&& offset1
9054 && operand_equal_p (offset0
, offset1
, 0))))
9057 base0
= build_fold_addr_expr_loc (loc
, base0
);
9059 base1
= build_fold_addr_expr_loc (loc
, base1
);
9060 return fold_build2_loc (loc
, code
, type
, base0
, base1
);
9064 /* Transform comparisons of the form X +- C1 CMP Y +- C2 to
9065 X CMP Y +- C2 +- C1 for signed X, Y. This is valid if
9066 the resulting offset is smaller in absolute value than the
9067 original one and has the same sign. */
9068 if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
9069 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
))
9070 && (TREE_CODE (arg0
) == PLUS_EXPR
|| TREE_CODE (arg0
) == MINUS_EXPR
)
9071 && (TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
9072 && !TREE_OVERFLOW (TREE_OPERAND (arg0
, 1)))
9073 && (TREE_CODE (arg1
) == PLUS_EXPR
|| TREE_CODE (arg1
) == MINUS_EXPR
)
9074 && (TREE_CODE (TREE_OPERAND (arg1
, 1)) == INTEGER_CST
9075 && !TREE_OVERFLOW (TREE_OPERAND (arg1
, 1))))
9077 tree const1
= TREE_OPERAND (arg0
, 1);
9078 tree const2
= TREE_OPERAND (arg1
, 1);
9079 tree variable1
= TREE_OPERAND (arg0
, 0);
9080 tree variable2
= TREE_OPERAND (arg1
, 0);
9082 const char * const warnmsg
= G_("assuming signed overflow does not "
9083 "occur when combining constants around "
9086 /* Put the constant on the side where it doesn't overflow and is
9087 of lower absolute value and of same sign than before. */
9088 cst
= int_const_binop (TREE_CODE (arg0
) == TREE_CODE (arg1
)
9089 ? MINUS_EXPR
: PLUS_EXPR
,
9091 if (!TREE_OVERFLOW (cst
)
9092 && tree_int_cst_compare (const2
, cst
) == tree_int_cst_sgn (const2
)
9093 && tree_int_cst_sgn (cst
) == tree_int_cst_sgn (const2
))
9095 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_COMPARISON
);
9096 return fold_build2_loc (loc
, code
, type
,
9098 fold_build2_loc (loc
, TREE_CODE (arg1
),
9103 cst
= int_const_binop (TREE_CODE (arg0
) == TREE_CODE (arg1
)
9104 ? MINUS_EXPR
: PLUS_EXPR
,
9106 if (!TREE_OVERFLOW (cst
)
9107 && tree_int_cst_compare (const1
, cst
) == tree_int_cst_sgn (const1
)
9108 && tree_int_cst_sgn (cst
) == tree_int_cst_sgn (const1
))
9110 fold_overflow_warning (warnmsg
, WARN_STRICT_OVERFLOW_COMPARISON
);
9111 return fold_build2_loc (loc
, code
, type
,
9112 fold_build2_loc (loc
, TREE_CODE (arg0
),
9119 /* Transform comparisons of the form X * C1 CMP 0 to X CMP 0 in the
9120 signed arithmetic case. That form is created by the compiler
9121 often enough for folding it to be of value. One example is in
9122 computing loop trip counts after Operator Strength Reduction. */
9123 if (ANY_INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
9124 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg0
))
9125 && TREE_CODE (arg0
) == MULT_EXPR
9126 && (TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
9127 && !TREE_OVERFLOW (TREE_OPERAND (arg0
, 1)))
9128 && integer_zerop (arg1
))
9130 tree const1
= TREE_OPERAND (arg0
, 1);
9131 tree const2
= arg1
; /* zero */
9132 tree variable1
= TREE_OPERAND (arg0
, 0);
9133 enum tree_code cmp_code
= code
;
9135 /* Handle unfolded multiplication by zero. */
9136 if (integer_zerop (const1
))
9137 return fold_build2_loc (loc
, cmp_code
, type
, const1
, const2
);
9139 fold_overflow_warning (("assuming signed overflow does not occur when "
9140 "eliminating multiplication in comparison "
9142 WARN_STRICT_OVERFLOW_COMPARISON
);
9144 /* If const1 is negative we swap the sense of the comparison. */
9145 if (tree_int_cst_sgn (const1
) < 0)
9146 cmp_code
= swap_tree_comparison (cmp_code
);
9148 return fold_build2_loc (loc
, cmp_code
, type
, variable1
, const2
);
9151 tem
= maybe_canonicalize_comparison (loc
, code
, type
, arg0
, arg1
);
9155 if (FLOAT_TYPE_P (TREE_TYPE (arg0
)))
9157 tree targ0
= strip_float_extensions (arg0
);
9158 tree targ1
= strip_float_extensions (arg1
);
9159 tree newtype
= TREE_TYPE (targ0
);
9161 if (TYPE_PRECISION (TREE_TYPE (targ1
)) > TYPE_PRECISION (newtype
))
9162 newtype
= TREE_TYPE (targ1
);
9164 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
9165 if (TYPE_PRECISION (newtype
) < TYPE_PRECISION (TREE_TYPE (arg0
)))
9166 return fold_build2_loc (loc
, code
, type
,
9167 fold_convert_loc (loc
, newtype
, targ0
),
9168 fold_convert_loc (loc
, newtype
, targ1
));
9170 if (TREE_CODE (arg1
) == REAL_CST
)
9172 REAL_VALUE_TYPE cst
;
9173 cst
= TREE_REAL_CST (arg1
);
9175 /* IEEE doesn't distinguish +0 and -0 in comparisons. */
9176 /* a CMP (-0) -> a CMP 0 */
9177 if (REAL_VALUE_MINUS_ZERO (cst
))
9178 return fold_build2_loc (loc
, code
, type
, arg0
,
9179 build_real (TREE_TYPE (arg1
), dconst0
));
9181 /* x != NaN is always true, other ops are always false. */
9182 if (REAL_VALUE_ISNAN (cst
)
9183 && ! HONOR_SNANS (arg1
))
9185 tem
= (code
== NE_EXPR
) ? integer_one_node
: integer_zero_node
;
9186 return omit_one_operand_loc (loc
, type
, tem
, arg0
);
9189 /* Fold comparisons against infinity. */
9190 if (REAL_VALUE_ISINF (cst
)
9191 && MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (arg1
))))
9193 tem
= fold_inf_compare (loc
, code
, type
, arg0
, arg1
);
9194 if (tem
!= NULL_TREE
)
9199 /* If this is a comparison of a real constant with a PLUS_EXPR
9200 or a MINUS_EXPR of a real constant, we can convert it into a
9201 comparison with a revised real constant as long as no overflow
9202 occurs when unsafe_math_optimizations are enabled. */
9203 if (flag_unsafe_math_optimizations
9204 && TREE_CODE (arg1
) == REAL_CST
9205 && (TREE_CODE (arg0
) == PLUS_EXPR
9206 || TREE_CODE (arg0
) == MINUS_EXPR
)
9207 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == REAL_CST
9208 && 0 != (tem
= const_binop (TREE_CODE (arg0
) == PLUS_EXPR
9209 ? MINUS_EXPR
: PLUS_EXPR
,
9210 arg1
, TREE_OPERAND (arg0
, 1)))
9211 && !TREE_OVERFLOW (tem
))
9212 return fold_build2_loc (loc
, code
, type
, TREE_OPERAND (arg0
, 0), tem
);
9214 /* Likewise, we can simplify a comparison of a real constant with
9215 a MINUS_EXPR whose first operand is also a real constant, i.e.
9216 (c1 - x) < c2 becomes x > c1-c2. Reordering is allowed on
9217 floating-point types only if -fassociative-math is set. */
9218 if (flag_associative_math
9219 && TREE_CODE (arg1
) == REAL_CST
9220 && TREE_CODE (arg0
) == MINUS_EXPR
9221 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == REAL_CST
9222 && 0 != (tem
= const_binop (MINUS_EXPR
, TREE_OPERAND (arg0
, 0),
9224 && !TREE_OVERFLOW (tem
))
9225 return fold_build2_loc (loc
, swap_tree_comparison (code
), type
,
9226 TREE_OPERAND (arg0
, 1), tem
);
9228 /* Fold comparisons against built-in math functions. */
9229 if (TREE_CODE (arg1
) == REAL_CST
9230 && flag_unsafe_math_optimizations
9231 && ! flag_errno_math
)
9233 enum built_in_function fcode
= builtin_mathfn_code (arg0
);
9235 if (fcode
!= END_BUILTINS
)
9237 tem
= fold_mathfn_compare (loc
, fcode
, code
, type
, arg0
, arg1
);
9238 if (tem
!= NULL_TREE
)
9244 if (TREE_CODE (TREE_TYPE (arg0
)) == INTEGER_TYPE
9245 && CONVERT_EXPR_P (arg0
))
9247 /* If we are widening one operand of an integer comparison,
9248 see if the other operand is similarly being widened. Perhaps we
9249 can do the comparison in the narrower type. */
9250 tem
= fold_widened_comparison (loc
, code
, type
, arg0
, arg1
);
9254 /* Or if we are changing signedness. */
9255 tem
= fold_sign_changed_comparison (loc
, code
, type
, arg0
, arg1
);
9260 /* If this is comparing a constant with a MIN_EXPR or a MAX_EXPR of a
9261 constant, we can simplify it. */
9262 if (TREE_CODE (arg1
) == INTEGER_CST
9263 && (TREE_CODE (arg0
) == MIN_EXPR
9264 || TREE_CODE (arg0
) == MAX_EXPR
)
9265 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
9267 tem
= optimize_minmax_comparison (loc
, code
, type
, op0
, op1
);
9272 /* Simplify comparison of something with itself. (For IEEE
9273 floating-point, we can only do some of these simplifications.) */
9274 if (operand_equal_p (arg0
, arg1
, 0))
9279 if (! FLOAT_TYPE_P (TREE_TYPE (arg0
))
9280 || ! HONOR_NANS (arg0
))
9281 return constant_boolean_node (1, type
);
9286 if (! FLOAT_TYPE_P (TREE_TYPE (arg0
))
9287 || ! HONOR_NANS (arg0
))
9288 return constant_boolean_node (1, type
);
9289 return fold_build2_loc (loc
, EQ_EXPR
, type
, arg0
, arg1
);
9292 /* For NE, we can only do this simplification if integer
9293 or we don't honor IEEE floating point NaNs. */
9294 if (FLOAT_TYPE_P (TREE_TYPE (arg0
))
9295 && HONOR_NANS (arg0
))
9297 /* ... fall through ... */
9300 return constant_boolean_node (0, type
);
9306 /* If we are comparing an expression that just has comparisons
9307 of two integer values, arithmetic expressions of those comparisons,
9308 and constants, we can simplify it. There are only three cases
9309 to check: the two values can either be equal, the first can be
9310 greater, or the second can be greater. Fold the expression for
9311 those three values. Since each value must be 0 or 1, we have
9312 eight possibilities, each of which corresponds to the constant 0
9313 or 1 or one of the six possible comparisons.
9315 This handles common cases like (a > b) == 0 but also handles
9316 expressions like ((x > y) - (y > x)) > 0, which supposedly
9317 occur in macroized code. */
9319 if (TREE_CODE (arg1
) == INTEGER_CST
&& TREE_CODE (arg0
) != INTEGER_CST
)
9321 tree cval1
= 0, cval2
= 0;
9324 if (twoval_comparison_p (arg0
, &cval1
, &cval2
, &save_p
)
9325 /* Don't handle degenerate cases here; they should already
9326 have been handled anyway. */
9327 && cval1
!= 0 && cval2
!= 0
9328 && ! (TREE_CONSTANT (cval1
) && TREE_CONSTANT (cval2
))
9329 && TREE_TYPE (cval1
) == TREE_TYPE (cval2
)
9330 && INTEGRAL_TYPE_P (TREE_TYPE (cval1
))
9331 && TYPE_MAX_VALUE (TREE_TYPE (cval1
))
9332 && TYPE_MAX_VALUE (TREE_TYPE (cval2
))
9333 && ! operand_equal_p (TYPE_MIN_VALUE (TREE_TYPE (cval1
)),
9334 TYPE_MAX_VALUE (TREE_TYPE (cval2
)), 0))
9336 tree maxval
= TYPE_MAX_VALUE (TREE_TYPE (cval1
));
9337 tree minval
= TYPE_MIN_VALUE (TREE_TYPE (cval1
));
9339 /* We can't just pass T to eval_subst in case cval1 or cval2
9340 was the same as ARG1. */
9343 = fold_build2_loc (loc
, code
, type
,
9344 eval_subst (loc
, arg0
, cval1
, maxval
,
9348 = fold_build2_loc (loc
, code
, type
,
9349 eval_subst (loc
, arg0
, cval1
, maxval
,
9353 = fold_build2_loc (loc
, code
, type
,
9354 eval_subst (loc
, arg0
, cval1
, minval
,
9358 /* All three of these results should be 0 or 1. Confirm they are.
9359 Then use those values to select the proper code to use. */
9361 if (TREE_CODE (high_result
) == INTEGER_CST
9362 && TREE_CODE (equal_result
) == INTEGER_CST
9363 && TREE_CODE (low_result
) == INTEGER_CST
)
9365 /* Make a 3-bit mask with the high-order bit being the
9366 value for `>', the next for '=', and the low for '<'. */
9367 switch ((integer_onep (high_result
) * 4)
9368 + (integer_onep (equal_result
) * 2)
9369 + integer_onep (low_result
))
9373 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
9394 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
9399 tem
= save_expr (build2 (code
, type
, cval1
, cval2
));
9400 SET_EXPR_LOCATION (tem
, loc
);
9403 return fold_build2_loc (loc
, code
, type
, cval1
, cval2
);
9408 /* We can fold X/C1 op C2 where C1 and C2 are integer constants
9409 into a single range test. */
9410 if ((TREE_CODE (arg0
) == TRUNC_DIV_EXPR
9411 || TREE_CODE (arg0
) == EXACT_DIV_EXPR
)
9412 && TREE_CODE (arg1
) == INTEGER_CST
9413 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
9414 && !integer_zerop (TREE_OPERAND (arg0
, 1))
9415 && !TREE_OVERFLOW (TREE_OPERAND (arg0
, 1))
9416 && !TREE_OVERFLOW (arg1
))
9418 tem
= fold_div_compare (loc
, code
, type
, arg0
, arg1
);
9419 if (tem
!= NULL_TREE
)
9423 /* Fold ~X op ~Y as Y op X. */
9424 if (TREE_CODE (arg0
) == BIT_NOT_EXPR
9425 && TREE_CODE (arg1
) == BIT_NOT_EXPR
)
9427 tree cmp_type
= TREE_TYPE (TREE_OPERAND (arg0
, 0));
9428 return fold_build2_loc (loc
, code
, type
,
9429 fold_convert_loc (loc
, cmp_type
,
9430 TREE_OPERAND (arg1
, 0)),
9431 TREE_OPERAND (arg0
, 0));
9434 /* Fold ~X op C as X op' ~C, where op' is the swapped comparison. */
9435 if (TREE_CODE (arg0
) == BIT_NOT_EXPR
9436 && (TREE_CODE (arg1
) == INTEGER_CST
|| TREE_CODE (arg1
) == VECTOR_CST
))
9438 tree cmp_type
= TREE_TYPE (TREE_OPERAND (arg0
, 0));
9439 return fold_build2_loc (loc
, swap_tree_comparison (code
), type
,
9440 TREE_OPERAND (arg0
, 0),
9441 fold_build1_loc (loc
, BIT_NOT_EXPR
, cmp_type
,
9442 fold_convert_loc (loc
, cmp_type
, arg1
)));
9449 /* Subroutine of fold_binary. Optimize complex multiplications of the
9450 form z * conj(z), as pow(realpart(z),2) + pow(imagpart(z),2). The
9451 argument EXPR represents the expression "z" of type TYPE. */
9454 fold_mult_zconjz (location_t loc
, tree type
, tree expr
)
9456 tree itype
= TREE_TYPE (type
);
9457 tree rpart
, ipart
, tem
;
9459 if (TREE_CODE (expr
) == COMPLEX_EXPR
)
9461 rpart
= TREE_OPERAND (expr
, 0);
9462 ipart
= TREE_OPERAND (expr
, 1);
9464 else if (TREE_CODE (expr
) == COMPLEX_CST
)
9466 rpart
= TREE_REALPART (expr
);
9467 ipart
= TREE_IMAGPART (expr
);
9471 expr
= save_expr (expr
);
9472 rpart
= fold_build1_loc (loc
, REALPART_EXPR
, itype
, expr
);
9473 ipart
= fold_build1_loc (loc
, IMAGPART_EXPR
, itype
, expr
);
9476 rpart
= save_expr (rpart
);
9477 ipart
= save_expr (ipart
);
9478 tem
= fold_build2_loc (loc
, PLUS_EXPR
, itype
,
9479 fold_build2_loc (loc
, MULT_EXPR
, itype
, rpart
, rpart
),
9480 fold_build2_loc (loc
, MULT_EXPR
, itype
, ipart
, ipart
));
9481 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, tem
,
9482 build_zero_cst (itype
));
9486 /* Subroutine of fold_binary. If P is the value of EXPR, computes
9487 power-of-two M and (arbitrary) N such that M divides (P-N). This condition
9488 guarantees that P and N have the same least significant log2(M) bits.
9489 N is not otherwise constrained. In particular, N is not normalized to
9490 0 <= N < M as is common. In general, the precise value of P is unknown.
9491 M is chosen as large as possible such that constant N can be determined.
9493 Returns M and sets *RESIDUE to N.
9495 If ALLOW_FUNC_ALIGN is true, do take functions' DECL_ALIGN_UNIT into
9496 account. This is not always possible due to PR 35705.
9499 static unsigned HOST_WIDE_INT
9500 get_pointer_modulus_and_residue (tree expr
, unsigned HOST_WIDE_INT
*residue
,
9501 bool allow_func_align
)
9503 enum tree_code code
;
9507 code
= TREE_CODE (expr
);
9508 if (code
== ADDR_EXPR
)
9510 unsigned int bitalign
;
9511 get_object_alignment_1 (TREE_OPERAND (expr
, 0), &bitalign
, residue
);
9512 *residue
/= BITS_PER_UNIT
;
9513 return bitalign
/ BITS_PER_UNIT
;
9515 else if (code
== POINTER_PLUS_EXPR
)
9518 unsigned HOST_WIDE_INT modulus
;
9519 enum tree_code inner_code
;
9521 op0
= TREE_OPERAND (expr
, 0);
9523 modulus
= get_pointer_modulus_and_residue (op0
, residue
,
9526 op1
= TREE_OPERAND (expr
, 1);
9528 inner_code
= TREE_CODE (op1
);
9529 if (inner_code
== INTEGER_CST
)
9531 *residue
+= TREE_INT_CST_LOW (op1
);
9534 else if (inner_code
== MULT_EXPR
)
9536 op1
= TREE_OPERAND (op1
, 1);
9537 if (TREE_CODE (op1
) == INTEGER_CST
)
9539 unsigned HOST_WIDE_INT align
;
9541 /* Compute the greatest power-of-2 divisor of op1. */
9542 align
= TREE_INT_CST_LOW (op1
);
9545 /* If align is non-zero and less than *modulus, replace
9546 *modulus with align., If align is 0, then either op1 is 0
9547 or the greatest power-of-2 divisor of op1 doesn't fit in an
9548 unsigned HOST_WIDE_INT. In either case, no additional
9549 constraint is imposed. */
9551 modulus
= MIN (modulus
, align
);
9558 /* If we get here, we were unable to determine anything useful about the
9563 /* Helper function for fold_vec_perm. Store elements of VECTOR_CST or
9564 CONSTRUCTOR ARG into array ELTS and return true if successful. */
9567 vec_cst_ctor_to_array (tree arg
, tree
*elts
)
9569 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg
)), i
;
9571 if (TREE_CODE (arg
) == VECTOR_CST
)
9573 for (i
= 0; i
< VECTOR_CST_NELTS (arg
); ++i
)
9574 elts
[i
] = VECTOR_CST_ELT (arg
, i
);
9576 else if (TREE_CODE (arg
) == CONSTRUCTOR
)
9578 constructor_elt
*elt
;
9580 FOR_EACH_VEC_SAFE_ELT (CONSTRUCTOR_ELTS (arg
), i
, elt
)
9581 if (i
>= nelts
|| TREE_CODE (TREE_TYPE (elt
->value
)) == VECTOR_TYPE
)
9584 elts
[i
] = elt
->value
;
9588 for (; i
< nelts
; i
++)
9590 = fold_convert (TREE_TYPE (TREE_TYPE (arg
)), integer_zero_node
);
9594 /* Attempt to fold vector permutation of ARG0 and ARG1 vectors using SEL
9595 selector. Return the folded VECTOR_CST or CONSTRUCTOR if successful,
9596 NULL_TREE otherwise. */
9599 fold_vec_perm (tree type
, tree arg0
, tree arg1
, const unsigned char *sel
)
9601 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (type
), i
;
9603 bool need_ctor
= false;
9605 gcc_assert (TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0
)) == nelts
9606 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg1
)) == nelts
);
9607 if (TREE_TYPE (TREE_TYPE (arg0
)) != TREE_TYPE (type
)
9608 || TREE_TYPE (TREE_TYPE (arg1
)) != TREE_TYPE (type
))
9611 elts
= XALLOCAVEC (tree
, nelts
* 3);
9612 if (!vec_cst_ctor_to_array (arg0
, elts
)
9613 || !vec_cst_ctor_to_array (arg1
, elts
+ nelts
))
9616 for (i
= 0; i
< nelts
; i
++)
9618 if (!CONSTANT_CLASS_P (elts
[sel
[i
]]))
9620 elts
[i
+ 2 * nelts
] = unshare_expr (elts
[sel
[i
]]);
9625 vec
<constructor_elt
, va_gc
> *v
;
9626 vec_alloc (v
, nelts
);
9627 for (i
= 0; i
< nelts
; i
++)
9628 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, elts
[2 * nelts
+ i
]);
9629 return build_constructor (type
, v
);
9632 return build_vector (type
, &elts
[2 * nelts
]);
9635 /* Try to fold a pointer difference of type TYPE two address expressions of
9636 array references AREF0 and AREF1 using location LOC. Return a
9637 simplified expression for the difference or NULL_TREE. */
9640 fold_addr_of_array_ref_difference (location_t loc
, tree type
,
9641 tree aref0
, tree aref1
)
9643 tree base0
= TREE_OPERAND (aref0
, 0);
9644 tree base1
= TREE_OPERAND (aref1
, 0);
9645 tree base_offset
= build_int_cst (type
, 0);
9647 /* If the bases are array references as well, recurse. If the bases
9648 are pointer indirections compute the difference of the pointers.
9649 If the bases are equal, we are set. */
9650 if ((TREE_CODE (base0
) == ARRAY_REF
9651 && TREE_CODE (base1
) == ARRAY_REF
9653 = fold_addr_of_array_ref_difference (loc
, type
, base0
, base1
)))
9654 || (INDIRECT_REF_P (base0
)
9655 && INDIRECT_REF_P (base1
)
9656 && (base_offset
= fold_binary_loc (loc
, MINUS_EXPR
, type
,
9657 TREE_OPERAND (base0
, 0),
9658 TREE_OPERAND (base1
, 0))))
9659 || operand_equal_p (base0
, base1
, 0))
9661 tree op0
= fold_convert_loc (loc
, type
, TREE_OPERAND (aref0
, 1));
9662 tree op1
= fold_convert_loc (loc
, type
, TREE_OPERAND (aref1
, 1));
9663 tree esz
= fold_convert_loc (loc
, type
, array_ref_element_size (aref0
));
9664 tree diff
= build2 (MINUS_EXPR
, type
, op0
, op1
);
9665 return fold_build2_loc (loc
, PLUS_EXPR
, type
,
9667 fold_build2_loc (loc
, MULT_EXPR
, type
,
9673 /* If the real or vector real constant CST of type TYPE has an exact
9674 inverse, return it, else return NULL. */
9677 exact_inverse (tree type
, tree cst
)
9680 tree unit_type
, *elts
;
9682 unsigned vec_nelts
, i
;
9684 switch (TREE_CODE (cst
))
9687 r
= TREE_REAL_CST (cst
);
9689 if (exact_real_inverse (TYPE_MODE (type
), &r
))
9690 return build_real (type
, r
);
9695 vec_nelts
= VECTOR_CST_NELTS (cst
);
9696 elts
= XALLOCAVEC (tree
, vec_nelts
);
9697 unit_type
= TREE_TYPE (type
);
9698 mode
= TYPE_MODE (unit_type
);
9700 for (i
= 0; i
< vec_nelts
; i
++)
9702 r
= TREE_REAL_CST (VECTOR_CST_ELT (cst
, i
));
9703 if (!exact_real_inverse (mode
, &r
))
9705 elts
[i
] = build_real (unit_type
, r
);
9708 return build_vector (type
, elts
);
9715 /* Mask out the tz least significant bits of X of type TYPE where
9716 tz is the number of trailing zeroes in Y. */
9718 mask_with_tz (tree type
, const wide_int
&x
, const wide_int
&y
)
9720 int tz
= wi::ctz (y
);
9722 return wi::mask (tz
, true, TYPE_PRECISION (type
)) & x
;
9726 /* Return true when T is an address and is known to be nonzero.
9727 For floating point we further ensure that T is not denormal.
9728 Similar logic is present in nonzero_address in rtlanal.h.
9730 If the return value is based on the assumption that signed overflow
9731 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
9732 change *STRICT_OVERFLOW_P. */
9735 tree_expr_nonzero_warnv_p (tree t
, bool *strict_overflow_p
)
9737 tree type
= TREE_TYPE (t
);
9738 enum tree_code code
;
9740 /* Doing something useful for floating point would need more work. */
9741 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
9744 code
= TREE_CODE (t
);
9745 switch (TREE_CODE_CLASS (code
))
9748 return tree_unary_nonzero_warnv_p (code
, type
, TREE_OPERAND (t
, 0),
9751 case tcc_comparison
:
9752 return tree_binary_nonzero_warnv_p (code
, type
,
9753 TREE_OPERAND (t
, 0),
9754 TREE_OPERAND (t
, 1),
9757 case tcc_declaration
:
9759 return tree_single_nonzero_warnv_p (t
, strict_overflow_p
);
9767 case TRUTH_NOT_EXPR
:
9768 return tree_unary_nonzero_warnv_p (code
, type
, TREE_OPERAND (t
, 0),
9771 case TRUTH_AND_EXPR
:
9773 case TRUTH_XOR_EXPR
:
9774 return tree_binary_nonzero_warnv_p (code
, type
,
9775 TREE_OPERAND (t
, 0),
9776 TREE_OPERAND (t
, 1),
9784 case WITH_SIZE_EXPR
:
9786 return tree_single_nonzero_warnv_p (t
, strict_overflow_p
);
9791 return tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 1),
9795 return tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 0),
9800 tree fndecl
= get_callee_fndecl (t
);
9801 if (!fndecl
) return false;
9802 if (flag_delete_null_pointer_checks
&& !flag_check_new
9803 && DECL_IS_OPERATOR_NEW (fndecl
)
9804 && !TREE_NOTHROW (fndecl
))
9806 if (flag_delete_null_pointer_checks
9807 && lookup_attribute ("returns_nonnull",
9808 TYPE_ATTRIBUTES (TREE_TYPE (fndecl
))))
9810 return alloca_call_p (t
);
9819 /* Return true when T is an address and is known to be nonzero.
9820 Handle warnings about undefined signed overflow. */
9823 tree_expr_nonzero_p (tree t
)
9825 bool ret
, strict_overflow_p
;
9827 strict_overflow_p
= false;
9828 ret
= tree_expr_nonzero_warnv_p (t
, &strict_overflow_p
);
9829 if (strict_overflow_p
)
9830 fold_overflow_warning (("assuming signed overflow does not occur when "
9831 "determining that expression is always "
9833 WARN_STRICT_OVERFLOW_MISC
);
9837 /* Fold a binary expression of code CODE and type TYPE with operands
9838 OP0 and OP1. LOC is the location of the resulting expression.
9839 Return the folded expression if folding is successful. Otherwise,
9840 return NULL_TREE. */
9843 fold_binary_loc (location_t loc
,
9844 enum tree_code code
, tree type
, tree op0
, tree op1
)
9846 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
9847 tree arg0
, arg1
, tem
;
9848 tree t1
= NULL_TREE
;
9849 bool strict_overflow_p
;
9852 gcc_assert (IS_EXPR_CODE_CLASS (kind
)
9853 && TREE_CODE_LENGTH (code
) == 2
9855 && op1
!= NULL_TREE
);
9860 /* Strip any conversions that don't change the mode. This is
9861 safe for every expression, except for a comparison expression
9862 because its signedness is derived from its operands. So, in
9863 the latter case, only strip conversions that don't change the
9864 signedness. MIN_EXPR/MAX_EXPR also need signedness of arguments
9867 Note that this is done as an internal manipulation within the
9868 constant folder, in order to find the simplest representation
9869 of the arguments so that their form can be studied. In any
9870 cases, the appropriate type conversions should be put back in
9871 the tree that will get out of the constant folder. */
9873 if (kind
== tcc_comparison
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
9875 STRIP_SIGN_NOPS (arg0
);
9876 STRIP_SIGN_NOPS (arg1
);
9884 /* Note that TREE_CONSTANT isn't enough: static var addresses are
9885 constant but we can't do arithmetic on them. */
9886 if (CONSTANT_CLASS_P (arg0
) && CONSTANT_CLASS_P (arg1
))
9888 tem
= const_binop (code
, type
, arg0
, arg1
);
9889 if (tem
!= NULL_TREE
)
9891 if (TREE_TYPE (tem
) != type
)
9892 tem
= fold_convert_loc (loc
, type
, tem
);
9897 /* If this is a commutative operation, and ARG0 is a constant, move it
9898 to ARG1 to reduce the number of tests below. */
9899 if (commutative_tree_code (code
)
9900 && tree_swap_operands_p (arg0
, arg1
, true))
9901 return fold_build2_loc (loc
, code
, type
, op1
, op0
);
9903 /* Likewise if this is a comparison, and ARG0 is a constant, move it
9904 to ARG1 to reduce the number of tests below. */
9905 if (kind
== tcc_comparison
9906 && tree_swap_operands_p (arg0
, arg1
, true))
9907 return fold_build2_loc (loc
, swap_tree_comparison (code
), type
, op1
, op0
);
9909 tem
= generic_simplify (loc
, code
, type
, op0
, op1
);
9913 /* ARG0 is the first operand of EXPR, and ARG1 is the second operand.
9915 First check for cases where an arithmetic operation is applied to a
9916 compound, conditional, or comparison operation. Push the arithmetic
9917 operation inside the compound or conditional to see if any folding
9918 can then be done. Convert comparison to conditional for this purpose.
9919 The also optimizes non-constant cases that used to be done in
9922 Before we do that, see if this is a BIT_AND_EXPR or a BIT_IOR_EXPR,
9923 one of the operands is a comparison and the other is a comparison, a
9924 BIT_AND_EXPR with the constant 1, or a truth value. In that case, the
9925 code below would make the expression more complex. Change it to a
9926 TRUTH_{AND,OR}_EXPR. Likewise, convert a similar NE_EXPR to
9927 TRUTH_XOR_EXPR and an EQ_EXPR to the inversion of a TRUTH_XOR_EXPR. */
9929 if ((code
== BIT_AND_EXPR
|| code
== BIT_IOR_EXPR
9930 || code
== EQ_EXPR
|| code
== NE_EXPR
)
9931 && TREE_CODE (type
) != VECTOR_TYPE
9932 && ((truth_value_p (TREE_CODE (arg0
))
9933 && (truth_value_p (TREE_CODE (arg1
))
9934 || (TREE_CODE (arg1
) == BIT_AND_EXPR
9935 && integer_onep (TREE_OPERAND (arg1
, 1)))))
9936 || (truth_value_p (TREE_CODE (arg1
))
9937 && (truth_value_p (TREE_CODE (arg0
))
9938 || (TREE_CODE (arg0
) == BIT_AND_EXPR
9939 && integer_onep (TREE_OPERAND (arg0
, 1)))))))
9941 tem
= fold_build2_loc (loc
, code
== BIT_AND_EXPR
? TRUTH_AND_EXPR
9942 : code
== BIT_IOR_EXPR
? TRUTH_OR_EXPR
9945 fold_convert_loc (loc
, boolean_type_node
, arg0
),
9946 fold_convert_loc (loc
, boolean_type_node
, arg1
));
9948 if (code
== EQ_EXPR
)
9949 tem
= invert_truthvalue_loc (loc
, tem
);
9951 return fold_convert_loc (loc
, type
, tem
);
9954 if (TREE_CODE_CLASS (code
) == tcc_binary
9955 || TREE_CODE_CLASS (code
) == tcc_comparison
)
9957 if (TREE_CODE (arg0
) == COMPOUND_EXPR
)
9959 tem
= fold_build2_loc (loc
, code
, type
,
9960 fold_convert_loc (loc
, TREE_TYPE (op0
),
9961 TREE_OPERAND (arg0
, 1)), op1
);
9962 return build2_loc (loc
, COMPOUND_EXPR
, type
, TREE_OPERAND (arg0
, 0),
9965 if (TREE_CODE (arg1
) == COMPOUND_EXPR
9966 && reorder_operands_p (arg0
, TREE_OPERAND (arg1
, 0)))
9968 tem
= fold_build2_loc (loc
, code
, type
, op0
,
9969 fold_convert_loc (loc
, TREE_TYPE (op1
),
9970 TREE_OPERAND (arg1
, 1)));
9971 return build2_loc (loc
, COMPOUND_EXPR
, type
, TREE_OPERAND (arg1
, 0),
9975 if (TREE_CODE (arg0
) == COND_EXPR
9976 || TREE_CODE (arg0
) == VEC_COND_EXPR
9977 || COMPARISON_CLASS_P (arg0
))
9979 tem
= fold_binary_op_with_conditional_arg (loc
, code
, type
, op0
, op1
,
9981 /*cond_first_p=*/1);
9982 if (tem
!= NULL_TREE
)
9986 if (TREE_CODE (arg1
) == COND_EXPR
9987 || TREE_CODE (arg1
) == VEC_COND_EXPR
9988 || COMPARISON_CLASS_P (arg1
))
9990 tem
= fold_binary_op_with_conditional_arg (loc
, code
, type
, op0
, op1
,
9992 /*cond_first_p=*/0);
9993 if (tem
!= NULL_TREE
)
10001 /* MEM[&MEM[p, CST1], CST2] -> MEM[p, CST1 + CST2]. */
10002 if (TREE_CODE (arg0
) == ADDR_EXPR
10003 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == MEM_REF
)
10005 tree iref
= TREE_OPERAND (arg0
, 0);
10006 return fold_build2 (MEM_REF
, type
,
10007 TREE_OPERAND (iref
, 0),
10008 int_const_binop (PLUS_EXPR
, arg1
,
10009 TREE_OPERAND (iref
, 1)));
10012 /* MEM[&a.b, CST2] -> MEM[&a, offsetof (a, b) + CST2]. */
10013 if (TREE_CODE (arg0
) == ADDR_EXPR
10014 && handled_component_p (TREE_OPERAND (arg0
, 0)))
10017 HOST_WIDE_INT coffset
;
10018 base
= get_addr_base_and_unit_offset (TREE_OPERAND (arg0
, 0),
10022 return fold_build2 (MEM_REF
, type
,
10023 build_fold_addr_expr (base
),
10024 int_const_binop (PLUS_EXPR
, arg1
,
10025 size_int (coffset
)));
10030 case POINTER_PLUS_EXPR
:
10031 /* INT +p INT -> (PTR)(INT + INT). Stripping types allows for this. */
10032 if (INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
10033 && INTEGRAL_TYPE_P (TREE_TYPE (arg0
)))
10034 return fold_convert_loc (loc
, type
,
10035 fold_build2_loc (loc
, PLUS_EXPR
, sizetype
,
10036 fold_convert_loc (loc
, sizetype
,
10038 fold_convert_loc (loc
, sizetype
,
10044 if (INTEGRAL_TYPE_P (type
) || VECTOR_INTEGER_TYPE_P (type
))
10046 /* X + (X / CST) * -CST is X % CST. */
10047 if (TREE_CODE (arg1
) == MULT_EXPR
10048 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == TRUNC_DIV_EXPR
10049 && operand_equal_p (arg0
,
10050 TREE_OPERAND (TREE_OPERAND (arg1
, 0), 0), 0))
10052 tree cst0
= TREE_OPERAND (TREE_OPERAND (arg1
, 0), 1);
10053 tree cst1
= TREE_OPERAND (arg1
, 1);
10054 tree sum
= fold_binary_loc (loc
, PLUS_EXPR
, TREE_TYPE (cst1
),
10056 if (sum
&& integer_zerop (sum
))
10057 return fold_convert_loc (loc
, type
,
10058 fold_build2_loc (loc
, TRUNC_MOD_EXPR
,
10059 TREE_TYPE (arg0
), arg0
,
10064 /* Handle (A1 * C1) + (A2 * C2) with A1, A2 or C1, C2 being the same or
10065 one. Make sure the type is not saturating and has the signedness of
10066 the stripped operands, as fold_plusminus_mult_expr will re-associate.
10067 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
10068 if ((TREE_CODE (arg0
) == MULT_EXPR
10069 || TREE_CODE (arg1
) == MULT_EXPR
)
10070 && !TYPE_SATURATING (type
)
10071 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg0
))
10072 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg1
))
10073 && (!FLOAT_TYPE_P (type
) || flag_associative_math
))
10075 tree tem
= fold_plusminus_mult_expr (loc
, code
, type
, arg0
, arg1
);
10080 if (! FLOAT_TYPE_P (type
))
10082 /* If we are adding two BIT_AND_EXPR's, both of which are and'ing
10083 with a constant, and the two constants have no bits in common,
10084 we should treat this as a BIT_IOR_EXPR since this may produce more
10085 simplifications. */
10086 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10087 && TREE_CODE (arg1
) == BIT_AND_EXPR
10088 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
10089 && TREE_CODE (TREE_OPERAND (arg1
, 1)) == INTEGER_CST
10090 && wi::bit_and (TREE_OPERAND (arg0
, 1),
10091 TREE_OPERAND (arg1
, 1)) == 0)
10093 code
= BIT_IOR_EXPR
;
10097 /* Reassociate (plus (plus (mult) (foo)) (mult)) as
10098 (plus (plus (mult) (mult)) (foo)) so that we can
10099 take advantage of the factoring cases below. */
10100 if (ANY_INTEGRAL_TYPE_P (type
)
10101 && TYPE_OVERFLOW_WRAPS (type
)
10102 && (((TREE_CODE (arg0
) == PLUS_EXPR
10103 || TREE_CODE (arg0
) == MINUS_EXPR
)
10104 && TREE_CODE (arg1
) == MULT_EXPR
)
10105 || ((TREE_CODE (arg1
) == PLUS_EXPR
10106 || TREE_CODE (arg1
) == MINUS_EXPR
)
10107 && TREE_CODE (arg0
) == MULT_EXPR
)))
10109 tree parg0
, parg1
, parg
, marg
;
10110 enum tree_code pcode
;
10112 if (TREE_CODE (arg1
) == MULT_EXPR
)
10113 parg
= arg0
, marg
= arg1
;
10115 parg
= arg1
, marg
= arg0
;
10116 pcode
= TREE_CODE (parg
);
10117 parg0
= TREE_OPERAND (parg
, 0);
10118 parg1
= TREE_OPERAND (parg
, 1);
10119 STRIP_NOPS (parg0
);
10120 STRIP_NOPS (parg1
);
10122 if (TREE_CODE (parg0
) == MULT_EXPR
10123 && TREE_CODE (parg1
) != MULT_EXPR
)
10124 return fold_build2_loc (loc
, pcode
, type
,
10125 fold_build2_loc (loc
, PLUS_EXPR
, type
,
10126 fold_convert_loc (loc
, type
,
10128 fold_convert_loc (loc
, type
,
10130 fold_convert_loc (loc
, type
, parg1
));
10131 if (TREE_CODE (parg0
) != MULT_EXPR
10132 && TREE_CODE (parg1
) == MULT_EXPR
)
10134 fold_build2_loc (loc
, PLUS_EXPR
, type
,
10135 fold_convert_loc (loc
, type
, parg0
),
10136 fold_build2_loc (loc
, pcode
, type
,
10137 fold_convert_loc (loc
, type
, marg
),
10138 fold_convert_loc (loc
, type
,
10144 /* Fold __complex__ ( x, 0 ) + __complex__ ( 0, y )
10145 to __complex__ ( x, y ). This is not the same for SNaNs or
10146 if signed zeros are involved. */
10147 if (!HONOR_SNANS (element_mode (arg0
))
10148 && !HONOR_SIGNED_ZEROS (element_mode (arg0
))
10149 && COMPLEX_FLOAT_TYPE_P (TREE_TYPE (arg0
)))
10151 tree rtype
= TREE_TYPE (TREE_TYPE (arg0
));
10152 tree arg0r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg0
);
10153 tree arg0i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg0
);
10154 bool arg0rz
= false, arg0iz
= false;
10155 if ((arg0r
&& (arg0rz
= real_zerop (arg0r
)))
10156 || (arg0i
&& (arg0iz
= real_zerop (arg0i
))))
10158 tree arg1r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg1
);
10159 tree arg1i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg1
);
10160 if (arg0rz
&& arg1i
&& real_zerop (arg1i
))
10162 tree rp
= arg1r
? arg1r
10163 : build1 (REALPART_EXPR
, rtype
, arg1
);
10164 tree ip
= arg0i
? arg0i
10165 : build1 (IMAGPART_EXPR
, rtype
, arg0
);
10166 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
10168 else if (arg0iz
&& arg1r
&& real_zerop (arg1r
))
10170 tree rp
= arg0r
? arg0r
10171 : build1 (REALPART_EXPR
, rtype
, arg0
);
10172 tree ip
= arg1i
? arg1i
10173 : build1 (IMAGPART_EXPR
, rtype
, arg1
);
10174 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
10179 if (flag_unsafe_math_optimizations
10180 && (TREE_CODE (arg0
) == RDIV_EXPR
|| TREE_CODE (arg0
) == MULT_EXPR
)
10181 && (TREE_CODE (arg1
) == RDIV_EXPR
|| TREE_CODE (arg1
) == MULT_EXPR
)
10182 && (tem
= distribute_real_division (loc
, code
, type
, arg0
, arg1
)))
10185 /* Convert a + (b*c + d*e) into (a + b*c) + d*e.
10186 We associate floats only if the user has specified
10187 -fassociative-math. */
10188 if (flag_associative_math
10189 && TREE_CODE (arg1
) == PLUS_EXPR
10190 && TREE_CODE (arg0
) != MULT_EXPR
)
10192 tree tree10
= TREE_OPERAND (arg1
, 0);
10193 tree tree11
= TREE_OPERAND (arg1
, 1);
10194 if (TREE_CODE (tree11
) == MULT_EXPR
10195 && TREE_CODE (tree10
) == MULT_EXPR
)
10198 tree0
= fold_build2_loc (loc
, PLUS_EXPR
, type
, arg0
, tree10
);
10199 return fold_build2_loc (loc
, PLUS_EXPR
, type
, tree0
, tree11
);
10202 /* Convert (b*c + d*e) + a into b*c + (d*e +a).
10203 We associate floats only if the user has specified
10204 -fassociative-math. */
10205 if (flag_associative_math
10206 && TREE_CODE (arg0
) == PLUS_EXPR
10207 && TREE_CODE (arg1
) != MULT_EXPR
)
10209 tree tree00
= TREE_OPERAND (arg0
, 0);
10210 tree tree01
= TREE_OPERAND (arg0
, 1);
10211 if (TREE_CODE (tree01
) == MULT_EXPR
10212 && TREE_CODE (tree00
) == MULT_EXPR
)
10215 tree0
= fold_build2_loc (loc
, PLUS_EXPR
, type
, tree01
, arg1
);
10216 return fold_build2_loc (loc
, PLUS_EXPR
, type
, tree00
, tree0
);
10222 /* (A << C1) + (A >> C2) if A is unsigned and C1+C2 is the size of A
10223 is a rotate of A by C1 bits. */
10224 /* (A << B) + (A >> (Z - B)) if A is unsigned and Z is the size of A
10225 is a rotate of A by B bits. */
10227 enum tree_code code0
, code1
;
10229 code0
= TREE_CODE (arg0
);
10230 code1
= TREE_CODE (arg1
);
10231 if (((code0
== RSHIFT_EXPR
&& code1
== LSHIFT_EXPR
)
10232 || (code1
== RSHIFT_EXPR
&& code0
== LSHIFT_EXPR
))
10233 && operand_equal_p (TREE_OPERAND (arg0
, 0),
10234 TREE_OPERAND (arg1
, 0), 0)
10235 && (rtype
= TREE_TYPE (TREE_OPERAND (arg0
, 0)),
10236 TYPE_UNSIGNED (rtype
))
10237 /* Only create rotates in complete modes. Other cases are not
10238 expanded properly. */
10239 && (element_precision (rtype
)
10240 == element_precision (TYPE_MODE (rtype
))))
10242 tree tree01
, tree11
;
10243 enum tree_code code01
, code11
;
10245 tree01
= TREE_OPERAND (arg0
, 1);
10246 tree11
= TREE_OPERAND (arg1
, 1);
10247 STRIP_NOPS (tree01
);
10248 STRIP_NOPS (tree11
);
10249 code01
= TREE_CODE (tree01
);
10250 code11
= TREE_CODE (tree11
);
10251 if (code01
== INTEGER_CST
10252 && code11
== INTEGER_CST
10253 && (wi::to_widest (tree01
) + wi::to_widest (tree11
)
10254 == element_precision (TREE_TYPE (TREE_OPERAND (arg0
, 0)))))
10256 tem
= build2_loc (loc
, LROTATE_EXPR
,
10257 TREE_TYPE (TREE_OPERAND (arg0
, 0)),
10258 TREE_OPERAND (arg0
, 0),
10259 code0
== LSHIFT_EXPR
10260 ? TREE_OPERAND (arg0
, 1)
10261 : TREE_OPERAND (arg1
, 1));
10262 return fold_convert_loc (loc
, type
, tem
);
10264 else if (code11
== MINUS_EXPR
)
10266 tree tree110
, tree111
;
10267 tree110
= TREE_OPERAND (tree11
, 0);
10268 tree111
= TREE_OPERAND (tree11
, 1);
10269 STRIP_NOPS (tree110
);
10270 STRIP_NOPS (tree111
);
10271 if (TREE_CODE (tree110
) == INTEGER_CST
10272 && 0 == compare_tree_int (tree110
,
10274 (TREE_TYPE (TREE_OPERAND
10276 && operand_equal_p (tree01
, tree111
, 0))
10278 fold_convert_loc (loc
, type
,
10279 build2 ((code0
== LSHIFT_EXPR
10282 TREE_TYPE (TREE_OPERAND (arg0
, 0)),
10283 TREE_OPERAND (arg0
, 0),
10284 TREE_OPERAND (arg0
, 1)));
10286 else if (code01
== MINUS_EXPR
)
10288 tree tree010
, tree011
;
10289 tree010
= TREE_OPERAND (tree01
, 0);
10290 tree011
= TREE_OPERAND (tree01
, 1);
10291 STRIP_NOPS (tree010
);
10292 STRIP_NOPS (tree011
);
10293 if (TREE_CODE (tree010
) == INTEGER_CST
10294 && 0 == compare_tree_int (tree010
,
10296 (TREE_TYPE (TREE_OPERAND
10298 && operand_equal_p (tree11
, tree011
, 0))
10299 return fold_convert_loc
10301 build2 ((code0
!= LSHIFT_EXPR
10304 TREE_TYPE (TREE_OPERAND (arg0
, 0)),
10305 TREE_OPERAND (arg0
, 0), TREE_OPERAND (arg1
, 1)));
10311 /* In most languages, can't associate operations on floats through
10312 parentheses. Rather than remember where the parentheses were, we
10313 don't associate floats at all, unless the user has specified
10314 -fassociative-math.
10315 And, we need to make sure type is not saturating. */
10317 if ((! FLOAT_TYPE_P (type
) || flag_associative_math
)
10318 && !TYPE_SATURATING (type
))
10320 tree var0
, con0
, lit0
, minus_lit0
;
10321 tree var1
, con1
, lit1
, minus_lit1
;
10325 /* Split both trees into variables, constants, and literals. Then
10326 associate each group together, the constants with literals,
10327 then the result with variables. This increases the chances of
10328 literals being recombined later and of generating relocatable
10329 expressions for the sum of a constant and literal. */
10330 var0
= split_tree (arg0
, code
, &con0
, &lit0
, &minus_lit0
, 0);
10331 var1
= split_tree (arg1
, code
, &con1
, &lit1
, &minus_lit1
,
10332 code
== MINUS_EXPR
);
10334 /* Recombine MINUS_EXPR operands by using PLUS_EXPR. */
10335 if (code
== MINUS_EXPR
)
10338 /* With undefined overflow prefer doing association in a type
10339 which wraps on overflow, if that is one of the operand types. */
10340 if ((POINTER_TYPE_P (type
) && POINTER_TYPE_OVERFLOW_UNDEFINED
)
10341 || (INTEGRAL_TYPE_P (type
) && !TYPE_OVERFLOW_WRAPS (type
)))
10343 if (INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
10344 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg0
)))
10345 atype
= TREE_TYPE (arg0
);
10346 else if (INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
10347 && TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg1
)))
10348 atype
= TREE_TYPE (arg1
);
10349 gcc_assert (TYPE_PRECISION (atype
) == TYPE_PRECISION (type
));
10352 /* With undefined overflow we can only associate constants with one
10353 variable, and constants whose association doesn't overflow. */
10354 if ((POINTER_TYPE_P (atype
) && POINTER_TYPE_OVERFLOW_UNDEFINED
)
10355 || (INTEGRAL_TYPE_P (atype
) && !TYPE_OVERFLOW_WRAPS (atype
)))
10362 if (TREE_CODE (tmp0
) == NEGATE_EXPR
)
10363 tmp0
= TREE_OPERAND (tmp0
, 0);
10364 if (CONVERT_EXPR_P (tmp0
)
10365 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (tmp0
, 0)))
10366 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (tmp0
, 0)))
10367 <= TYPE_PRECISION (atype
)))
10368 tmp0
= TREE_OPERAND (tmp0
, 0);
10369 if (TREE_CODE (tmp1
) == NEGATE_EXPR
)
10370 tmp1
= TREE_OPERAND (tmp1
, 0);
10371 if (CONVERT_EXPR_P (tmp1
)
10372 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (tmp1
, 0)))
10373 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (tmp1
, 0)))
10374 <= TYPE_PRECISION (atype
)))
10375 tmp1
= TREE_OPERAND (tmp1
, 0);
10376 /* The only case we can still associate with two variables
10377 is if they are the same, modulo negation and bit-pattern
10378 preserving conversions. */
10379 if (!operand_equal_p (tmp0
, tmp1
, 0))
10384 /* Only do something if we found more than two objects. Otherwise,
10385 nothing has changed and we risk infinite recursion. */
10387 && (2 < ((var0
!= 0) + (var1
!= 0)
10388 + (con0
!= 0) + (con1
!= 0)
10389 + (lit0
!= 0) + (lit1
!= 0)
10390 + (minus_lit0
!= 0) + (minus_lit1
!= 0))))
10392 bool any_overflows
= false;
10393 if (lit0
) any_overflows
|= TREE_OVERFLOW (lit0
);
10394 if (lit1
) any_overflows
|= TREE_OVERFLOW (lit1
);
10395 if (minus_lit0
) any_overflows
|= TREE_OVERFLOW (minus_lit0
);
10396 if (minus_lit1
) any_overflows
|= TREE_OVERFLOW (minus_lit1
);
10397 var0
= associate_trees (loc
, var0
, var1
, code
, atype
);
10398 con0
= associate_trees (loc
, con0
, con1
, code
, atype
);
10399 lit0
= associate_trees (loc
, lit0
, lit1
, code
, atype
);
10400 minus_lit0
= associate_trees (loc
, minus_lit0
, minus_lit1
,
10403 /* Preserve the MINUS_EXPR if the negative part of the literal is
10404 greater than the positive part. Otherwise, the multiplicative
10405 folding code (i.e extract_muldiv) may be fooled in case
10406 unsigned constants are subtracted, like in the following
10407 example: ((X*2 + 4) - 8U)/2. */
10408 if (minus_lit0
&& lit0
)
10410 if (TREE_CODE (lit0
) == INTEGER_CST
10411 && TREE_CODE (minus_lit0
) == INTEGER_CST
10412 && tree_int_cst_lt (lit0
, minus_lit0
))
10414 minus_lit0
= associate_trees (loc
, minus_lit0
, lit0
,
10415 MINUS_EXPR
, atype
);
10420 lit0
= associate_trees (loc
, lit0
, minus_lit0
,
10421 MINUS_EXPR
, atype
);
10426 /* Don't introduce overflows through reassociation. */
10428 && ((lit0
&& TREE_OVERFLOW_P (lit0
))
10429 || (minus_lit0
&& TREE_OVERFLOW_P (minus_lit0
))))
10436 fold_convert_loc (loc
, type
,
10437 associate_trees (loc
, var0
, minus_lit0
,
10438 MINUS_EXPR
, atype
));
10441 con0
= associate_trees (loc
, con0
, minus_lit0
,
10442 MINUS_EXPR
, atype
);
10444 fold_convert_loc (loc
, type
,
10445 associate_trees (loc
, var0
, con0
,
10446 PLUS_EXPR
, atype
));
10450 con0
= associate_trees (loc
, con0
, lit0
, code
, atype
);
10452 fold_convert_loc (loc
, type
, associate_trees (loc
, var0
, con0
,
10460 /* Pointer simplifications for subtraction, simple reassociations. */
10461 if (POINTER_TYPE_P (TREE_TYPE (arg1
)) && POINTER_TYPE_P (TREE_TYPE (arg0
)))
10463 /* (PTR0 p+ A) - (PTR1 p+ B) -> (PTR0 - PTR1) + (A - B) */
10464 if (TREE_CODE (arg0
) == POINTER_PLUS_EXPR
10465 && TREE_CODE (arg1
) == POINTER_PLUS_EXPR
)
10467 tree arg00
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10468 tree arg01
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 1));
10469 tree arg10
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 0));
10470 tree arg11
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 1));
10471 return fold_build2_loc (loc
, PLUS_EXPR
, type
,
10472 fold_build2_loc (loc
, MINUS_EXPR
, type
,
10474 fold_build2_loc (loc
, MINUS_EXPR
, type
,
10477 /* (PTR0 p+ A) - PTR1 -> (PTR0 - PTR1) + A, assuming PTR0 - PTR1 simplifies. */
10478 else if (TREE_CODE (arg0
) == POINTER_PLUS_EXPR
)
10480 tree arg00
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10481 tree arg01
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 1));
10482 tree tmp
= fold_binary_loc (loc
, MINUS_EXPR
, type
, arg00
,
10483 fold_convert_loc (loc
, type
, arg1
));
10485 return fold_build2_loc (loc
, PLUS_EXPR
, type
, tmp
, arg01
);
10487 /* PTR0 - (PTR1 p+ A) -> (PTR0 - PTR1) - A, assuming PTR0 - PTR1
10489 else if (TREE_CODE (arg1
) == POINTER_PLUS_EXPR
)
10491 tree arg10
= fold_convert_loc (loc
, type
,
10492 TREE_OPERAND (arg1
, 0));
10493 tree arg11
= fold_convert_loc (loc
, type
,
10494 TREE_OPERAND (arg1
, 1));
10495 tree tmp
= fold_binary_loc (loc
, MINUS_EXPR
, type
,
10496 fold_convert_loc (loc
, type
, arg0
),
10499 return fold_build2_loc (loc
, MINUS_EXPR
, type
, tmp
, arg11
);
10502 /* (-A) - B -> (-B) - A where B is easily negated and we can swap. */
10503 if (TREE_CODE (arg0
) == NEGATE_EXPR
10504 && negate_expr_p (arg1
)
10505 && reorder_operands_p (arg0
, arg1
))
10506 return fold_build2_loc (loc
, MINUS_EXPR
, type
,
10507 fold_convert_loc (loc
, type
,
10508 negate_expr (arg1
)),
10509 fold_convert_loc (loc
, type
,
10510 TREE_OPERAND (arg0
, 0)));
10512 /* X - (X / Y) * Y is X % Y. */
10513 if ((INTEGRAL_TYPE_P (type
) || VECTOR_INTEGER_TYPE_P (type
))
10514 && TREE_CODE (arg1
) == MULT_EXPR
10515 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == TRUNC_DIV_EXPR
10516 && operand_equal_p (arg0
,
10517 TREE_OPERAND (TREE_OPERAND (arg1
, 0), 0), 0)
10518 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (arg1
, 0), 1),
10519 TREE_OPERAND (arg1
, 1), 0))
10521 fold_convert_loc (loc
, type
,
10522 fold_build2_loc (loc
, TRUNC_MOD_EXPR
, TREE_TYPE (arg0
),
10523 arg0
, TREE_OPERAND (arg1
, 1)));
10525 if (! FLOAT_TYPE_P (type
))
10527 /* Fold A - (A & B) into ~B & A. */
10528 if (!TREE_SIDE_EFFECTS (arg0
)
10529 && TREE_CODE (arg1
) == BIT_AND_EXPR
)
10531 if (operand_equal_p (arg0
, TREE_OPERAND (arg1
, 1), 0))
10533 tree arg10
= fold_convert_loc (loc
, type
,
10534 TREE_OPERAND (arg1
, 0));
10535 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
10536 fold_build1_loc (loc
, BIT_NOT_EXPR
,
10538 fold_convert_loc (loc
, type
, arg0
));
10540 if (operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10542 tree arg11
= fold_convert_loc (loc
,
10543 type
, TREE_OPERAND (arg1
, 1));
10544 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
10545 fold_build1_loc (loc
, BIT_NOT_EXPR
,
10547 fold_convert_loc (loc
, type
, arg0
));
10551 /* Fold (A & ~B) - (A & B) into (A ^ B) - B, where B is
10552 any power of 2 minus 1. */
10553 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10554 && TREE_CODE (arg1
) == BIT_AND_EXPR
10555 && operand_equal_p (TREE_OPERAND (arg0
, 0),
10556 TREE_OPERAND (arg1
, 0), 0))
10558 tree mask0
= TREE_OPERAND (arg0
, 1);
10559 tree mask1
= TREE_OPERAND (arg1
, 1);
10560 tree tem
= fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, mask0
);
10562 if (operand_equal_p (tem
, mask1
, 0))
10564 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, type
,
10565 TREE_OPERAND (arg0
, 0), mask1
);
10566 return fold_build2_loc (loc
, MINUS_EXPR
, type
, tem
, mask1
);
10571 /* Fold __complex__ ( x, 0 ) - __complex__ ( 0, y ) to
10572 __complex__ ( x, -y ). This is not the same for SNaNs or if
10573 signed zeros are involved. */
10574 if (!HONOR_SNANS (element_mode (arg0
))
10575 && !HONOR_SIGNED_ZEROS (element_mode (arg0
))
10576 && COMPLEX_FLOAT_TYPE_P (TREE_TYPE (arg0
)))
10578 tree rtype
= TREE_TYPE (TREE_TYPE (arg0
));
10579 tree arg0r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg0
);
10580 tree arg0i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg0
);
10581 bool arg0rz
= false, arg0iz
= false;
10582 if ((arg0r
&& (arg0rz
= real_zerop (arg0r
)))
10583 || (arg0i
&& (arg0iz
= real_zerop (arg0i
))))
10585 tree arg1r
= fold_unary_loc (loc
, REALPART_EXPR
, rtype
, arg1
);
10586 tree arg1i
= fold_unary_loc (loc
, IMAGPART_EXPR
, rtype
, arg1
);
10587 if (arg0rz
&& arg1i
&& real_zerop (arg1i
))
10589 tree rp
= fold_build1_loc (loc
, NEGATE_EXPR
, rtype
,
10591 : build1 (REALPART_EXPR
, rtype
, arg1
));
10592 tree ip
= arg0i
? arg0i
10593 : build1 (IMAGPART_EXPR
, rtype
, arg0
);
10594 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
10596 else if (arg0iz
&& arg1r
&& real_zerop (arg1r
))
10598 tree rp
= arg0r
? arg0r
10599 : build1 (REALPART_EXPR
, rtype
, arg0
);
10600 tree ip
= fold_build1_loc (loc
, NEGATE_EXPR
, rtype
,
10602 : build1 (IMAGPART_EXPR
, rtype
, arg1
));
10603 return fold_build2_loc (loc
, COMPLEX_EXPR
, type
, rp
, ip
);
10608 /* A - B -> A + (-B) if B is easily negatable. */
10609 if (negate_expr_p (arg1
)
10610 && !TYPE_OVERFLOW_SANITIZED (type
)
10611 && ((FLOAT_TYPE_P (type
)
10612 /* Avoid this transformation if B is a positive REAL_CST. */
10613 && (TREE_CODE (arg1
) != REAL_CST
10614 || REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg1
))))
10615 || INTEGRAL_TYPE_P (type
)))
10616 return fold_build2_loc (loc
, PLUS_EXPR
, type
,
10617 fold_convert_loc (loc
, type
, arg0
),
10618 fold_convert_loc (loc
, type
,
10619 negate_expr (arg1
)));
10621 /* Try folding difference of addresses. */
10623 HOST_WIDE_INT diff
;
10625 if ((TREE_CODE (arg0
) == ADDR_EXPR
10626 || TREE_CODE (arg1
) == ADDR_EXPR
)
10627 && ptr_difference_const (arg0
, arg1
, &diff
))
10628 return build_int_cst_type (type
, diff
);
10631 /* Fold &a[i] - &a[j] to i-j. */
10632 if (TREE_CODE (arg0
) == ADDR_EXPR
10633 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == ARRAY_REF
10634 && TREE_CODE (arg1
) == ADDR_EXPR
10635 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == ARRAY_REF
)
10637 tree tem
= fold_addr_of_array_ref_difference (loc
, type
,
10638 TREE_OPERAND (arg0
, 0),
10639 TREE_OPERAND (arg1
, 0));
10644 if (FLOAT_TYPE_P (type
)
10645 && flag_unsafe_math_optimizations
10646 && (TREE_CODE (arg0
) == RDIV_EXPR
|| TREE_CODE (arg0
) == MULT_EXPR
)
10647 && (TREE_CODE (arg1
) == RDIV_EXPR
|| TREE_CODE (arg1
) == MULT_EXPR
)
10648 && (tem
= distribute_real_division (loc
, code
, type
, arg0
, arg1
)))
10651 /* Handle (A1 * C1) - (A2 * C2) with A1, A2 or C1, C2 being the same or
10652 one. Make sure the type is not saturating and has the signedness of
10653 the stripped operands, as fold_plusminus_mult_expr will re-associate.
10654 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
10655 if ((TREE_CODE (arg0
) == MULT_EXPR
10656 || TREE_CODE (arg1
) == MULT_EXPR
)
10657 && !TYPE_SATURATING (type
)
10658 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg0
))
10659 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (TREE_TYPE (arg1
))
10660 && (!FLOAT_TYPE_P (type
) || flag_associative_math
))
10662 tree tem
= fold_plusminus_mult_expr (loc
, code
, type
, arg0
, arg1
);
10670 /* (-A) * (-B) -> A * B */
10671 if (TREE_CODE (arg0
) == NEGATE_EXPR
&& negate_expr_p (arg1
))
10672 return fold_build2_loc (loc
, MULT_EXPR
, type
,
10673 fold_convert_loc (loc
, type
,
10674 TREE_OPERAND (arg0
, 0)),
10675 fold_convert_loc (loc
, type
,
10676 negate_expr (arg1
)));
10677 if (TREE_CODE (arg1
) == NEGATE_EXPR
&& negate_expr_p (arg0
))
10678 return fold_build2_loc (loc
, MULT_EXPR
, type
,
10679 fold_convert_loc (loc
, type
,
10680 negate_expr (arg0
)),
10681 fold_convert_loc (loc
, type
,
10682 TREE_OPERAND (arg1
, 0)));
10684 if (! FLOAT_TYPE_P (type
))
10686 /* Transform x * -C into -x * C if x is easily negatable. */
10687 if (TREE_CODE (arg1
) == INTEGER_CST
10688 && tree_int_cst_sgn (arg1
) == -1
10689 && negate_expr_p (arg0
)
10690 && (tem
= negate_expr (arg1
)) != arg1
10691 && !TREE_OVERFLOW (tem
))
10692 return fold_build2_loc (loc
, MULT_EXPR
, type
,
10693 fold_convert_loc (loc
, type
,
10694 negate_expr (arg0
)),
10697 /* (a * (1 << b)) is (a << b) */
10698 if (TREE_CODE (arg1
) == LSHIFT_EXPR
10699 && integer_onep (TREE_OPERAND (arg1
, 0)))
10700 return fold_build2_loc (loc
, LSHIFT_EXPR
, type
, op0
,
10701 TREE_OPERAND (arg1
, 1));
10702 if (TREE_CODE (arg0
) == LSHIFT_EXPR
10703 && integer_onep (TREE_OPERAND (arg0
, 0)))
10704 return fold_build2_loc (loc
, LSHIFT_EXPR
, type
, op1
,
10705 TREE_OPERAND (arg0
, 1));
10707 /* (A + A) * C -> A * 2 * C */
10708 if (TREE_CODE (arg0
) == PLUS_EXPR
10709 && TREE_CODE (arg1
) == INTEGER_CST
10710 && operand_equal_p (TREE_OPERAND (arg0
, 0),
10711 TREE_OPERAND (arg0
, 1), 0))
10712 return fold_build2_loc (loc
, MULT_EXPR
, type
,
10713 omit_one_operand_loc (loc
, type
,
10714 TREE_OPERAND (arg0
, 0),
10715 TREE_OPERAND (arg0
, 1)),
10716 fold_build2_loc (loc
, MULT_EXPR
, type
,
10717 build_int_cst (type
, 2) , arg1
));
10719 /* ((T) (X /[ex] C)) * C cancels out if the conversion is
10720 sign-changing only. */
10721 if (TREE_CODE (arg1
) == INTEGER_CST
10722 && TREE_CODE (arg0
) == EXACT_DIV_EXPR
10723 && operand_equal_p (arg1
, TREE_OPERAND (arg0
, 1), 0))
10724 return fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
10726 strict_overflow_p
= false;
10727 if (TREE_CODE (arg1
) == INTEGER_CST
10728 && 0 != (tem
= extract_muldiv (op0
, arg1
, code
, NULL_TREE
,
10729 &strict_overflow_p
)))
10731 if (strict_overflow_p
)
10732 fold_overflow_warning (("assuming signed overflow does not "
10733 "occur when simplifying "
10735 WARN_STRICT_OVERFLOW_MISC
);
10736 return fold_convert_loc (loc
, type
, tem
);
10739 /* Optimize z * conj(z) for integer complex numbers. */
10740 if (TREE_CODE (arg0
) == CONJ_EXPR
10741 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
10742 return fold_mult_zconjz (loc
, type
, arg1
);
10743 if (TREE_CODE (arg1
) == CONJ_EXPR
10744 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10745 return fold_mult_zconjz (loc
, type
, arg0
);
10749 /* Convert (C1/X)*C2 into (C1*C2)/X. This transformation may change
10750 the result for floating point types due to rounding so it is applied
10751 only if -fassociative-math was specify. */
10752 if (flag_associative_math
10753 && TREE_CODE (arg0
) == RDIV_EXPR
10754 && TREE_CODE (arg1
) == REAL_CST
10755 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == REAL_CST
)
10757 tree tem
= const_binop (MULT_EXPR
, TREE_OPERAND (arg0
, 0),
10760 return fold_build2_loc (loc
, RDIV_EXPR
, type
, tem
,
10761 TREE_OPERAND (arg0
, 1));
10764 /* Strip sign operations from X in X*X, i.e. -Y*-Y -> Y*Y. */
10765 if (operand_equal_p (arg0
, arg1
, 0))
10767 tree tem
= fold_strip_sign_ops (arg0
);
10768 if (tem
!= NULL_TREE
)
10770 tem
= fold_convert_loc (loc
, type
, tem
);
10771 return fold_build2_loc (loc
, MULT_EXPR
, type
, tem
, tem
);
10775 /* Fold z * +-I to __complex__ (-+__imag z, +-__real z).
10776 This is not the same for NaNs or if signed zeros are
10778 if (!HONOR_NANS (arg0
)
10779 && !HONOR_SIGNED_ZEROS (element_mode (arg0
))
10780 && COMPLEX_FLOAT_TYPE_P (TREE_TYPE (arg0
))
10781 && TREE_CODE (arg1
) == COMPLEX_CST
10782 && real_zerop (TREE_REALPART (arg1
)))
10784 tree rtype
= TREE_TYPE (TREE_TYPE (arg0
));
10785 if (real_onep (TREE_IMAGPART (arg1
)))
10787 fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
10788 negate_expr (fold_build1_loc (loc
, IMAGPART_EXPR
,
10790 fold_build1_loc (loc
, REALPART_EXPR
, rtype
, arg0
));
10791 else if (real_minus_onep (TREE_IMAGPART (arg1
)))
10793 fold_build2_loc (loc
, COMPLEX_EXPR
, type
,
10794 fold_build1_loc (loc
, IMAGPART_EXPR
, rtype
, arg0
),
10795 negate_expr (fold_build1_loc (loc
, REALPART_EXPR
,
10799 /* Optimize z * conj(z) for floating point complex numbers.
10800 Guarded by flag_unsafe_math_optimizations as non-finite
10801 imaginary components don't produce scalar results. */
10802 if (flag_unsafe_math_optimizations
10803 && TREE_CODE (arg0
) == CONJ_EXPR
10804 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
10805 return fold_mult_zconjz (loc
, type
, arg1
);
10806 if (flag_unsafe_math_optimizations
10807 && TREE_CODE (arg1
) == CONJ_EXPR
10808 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10809 return fold_mult_zconjz (loc
, type
, arg0
);
10811 if (flag_unsafe_math_optimizations
)
10813 enum built_in_function fcode0
= builtin_mathfn_code (arg0
);
10814 enum built_in_function fcode1
= builtin_mathfn_code (arg1
);
10816 /* Optimizations of root(...)*root(...). */
10817 if (fcode0
== fcode1
&& BUILTIN_ROOT_P (fcode0
))
10820 tree arg00
= CALL_EXPR_ARG (arg0
, 0);
10821 tree arg10
= CALL_EXPR_ARG (arg1
, 0);
10823 /* Optimize sqrt(x)*sqrt(x) as x. */
10824 if (BUILTIN_SQRT_P (fcode0
)
10825 && operand_equal_p (arg00
, arg10
, 0)
10826 && ! HONOR_SNANS (element_mode (type
)))
10829 /* Optimize root(x)*root(y) as root(x*y). */
10830 rootfn
= TREE_OPERAND (CALL_EXPR_FN (arg0
), 0);
10831 arg
= fold_build2_loc (loc
, MULT_EXPR
, type
, arg00
, arg10
);
10832 return build_call_expr_loc (loc
, rootfn
, 1, arg
);
10835 /* Optimize expN(x)*expN(y) as expN(x+y). */
10836 if (fcode0
== fcode1
&& BUILTIN_EXPONENT_P (fcode0
))
10838 tree expfn
= TREE_OPERAND (CALL_EXPR_FN (arg0
), 0);
10839 tree arg
= fold_build2_loc (loc
, PLUS_EXPR
, type
,
10840 CALL_EXPR_ARG (arg0
, 0),
10841 CALL_EXPR_ARG (arg1
, 0));
10842 return build_call_expr_loc (loc
, expfn
, 1, arg
);
10845 /* Optimizations of pow(...)*pow(...). */
10846 if ((fcode0
== BUILT_IN_POW
&& fcode1
== BUILT_IN_POW
)
10847 || (fcode0
== BUILT_IN_POWF
&& fcode1
== BUILT_IN_POWF
)
10848 || (fcode0
== BUILT_IN_POWL
&& fcode1
== BUILT_IN_POWL
))
10850 tree arg00
= CALL_EXPR_ARG (arg0
, 0);
10851 tree arg01
= CALL_EXPR_ARG (arg0
, 1);
10852 tree arg10
= CALL_EXPR_ARG (arg1
, 0);
10853 tree arg11
= CALL_EXPR_ARG (arg1
, 1);
10855 /* Optimize pow(x,y)*pow(z,y) as pow(x*z,y). */
10856 if (operand_equal_p (arg01
, arg11
, 0))
10858 tree powfn
= TREE_OPERAND (CALL_EXPR_FN (arg0
), 0);
10859 tree arg
= fold_build2_loc (loc
, MULT_EXPR
, type
,
10861 return build_call_expr_loc (loc
, powfn
, 2, arg
, arg01
);
10864 /* Optimize pow(x,y)*pow(x,z) as pow(x,y+z). */
10865 if (operand_equal_p (arg00
, arg10
, 0))
10867 tree powfn
= TREE_OPERAND (CALL_EXPR_FN (arg0
), 0);
10868 tree arg
= fold_build2_loc (loc
, PLUS_EXPR
, type
,
10870 return build_call_expr_loc (loc
, powfn
, 2, arg00
, arg
);
10874 /* Optimize tan(x)*cos(x) as sin(x). */
10875 if (((fcode0
== BUILT_IN_TAN
&& fcode1
== BUILT_IN_COS
)
10876 || (fcode0
== BUILT_IN_TANF
&& fcode1
== BUILT_IN_COSF
)
10877 || (fcode0
== BUILT_IN_TANL
&& fcode1
== BUILT_IN_COSL
)
10878 || (fcode0
== BUILT_IN_COS
&& fcode1
== BUILT_IN_TAN
)
10879 || (fcode0
== BUILT_IN_COSF
&& fcode1
== BUILT_IN_TANF
)
10880 || (fcode0
== BUILT_IN_COSL
&& fcode1
== BUILT_IN_TANL
))
10881 && operand_equal_p (CALL_EXPR_ARG (arg0
, 0),
10882 CALL_EXPR_ARG (arg1
, 0), 0))
10884 tree sinfn
= mathfn_built_in (type
, BUILT_IN_SIN
);
10886 if (sinfn
!= NULL_TREE
)
10887 return build_call_expr_loc (loc
, sinfn
, 1,
10888 CALL_EXPR_ARG (arg0
, 0));
10891 /* Optimize x*pow(x,c) as pow(x,c+1). */
10892 if (fcode1
== BUILT_IN_POW
10893 || fcode1
== BUILT_IN_POWF
10894 || fcode1
== BUILT_IN_POWL
)
10896 tree arg10
= CALL_EXPR_ARG (arg1
, 0);
10897 tree arg11
= CALL_EXPR_ARG (arg1
, 1);
10898 if (TREE_CODE (arg11
) == REAL_CST
10899 && !TREE_OVERFLOW (arg11
)
10900 && operand_equal_p (arg0
, arg10
, 0))
10902 tree powfn
= TREE_OPERAND (CALL_EXPR_FN (arg1
), 0);
10906 c
= TREE_REAL_CST (arg11
);
10907 real_arithmetic (&c
, PLUS_EXPR
, &c
, &dconst1
);
10908 arg
= build_real (type
, c
);
10909 return build_call_expr_loc (loc
, powfn
, 2, arg0
, arg
);
10913 /* Optimize pow(x,c)*x as pow(x,c+1). */
10914 if (fcode0
== BUILT_IN_POW
10915 || fcode0
== BUILT_IN_POWF
10916 || fcode0
== BUILT_IN_POWL
)
10918 tree arg00
= CALL_EXPR_ARG (arg0
, 0);
10919 tree arg01
= CALL_EXPR_ARG (arg0
, 1);
10920 if (TREE_CODE (arg01
) == REAL_CST
10921 && !TREE_OVERFLOW (arg01
)
10922 && operand_equal_p (arg1
, arg00
, 0))
10924 tree powfn
= TREE_OPERAND (CALL_EXPR_FN (arg0
), 0);
10928 c
= TREE_REAL_CST (arg01
);
10929 real_arithmetic (&c
, PLUS_EXPR
, &c
, &dconst1
);
10930 arg
= build_real (type
, c
);
10931 return build_call_expr_loc (loc
, powfn
, 2, arg1
, arg
);
10935 /* Canonicalize x*x as pow(x,2.0), which is expanded as x*x. */
10936 if (!in_gimple_form
10938 && operand_equal_p (arg0
, arg1
, 0))
10940 tree powfn
= mathfn_built_in (type
, BUILT_IN_POW
);
10944 tree arg
= build_real (type
, dconst2
);
10945 return build_call_expr_loc (loc
, powfn
, 2, arg0
, arg
);
10954 /* ~X | X is -1. */
10955 if (TREE_CODE (arg0
) == BIT_NOT_EXPR
10956 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
10958 t1
= build_zero_cst (type
);
10959 t1
= fold_unary_loc (loc
, BIT_NOT_EXPR
, type
, t1
);
10960 return omit_one_operand_loc (loc
, type
, t1
, arg1
);
10963 /* X | ~X is -1. */
10964 if (TREE_CODE (arg1
) == BIT_NOT_EXPR
10965 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
10967 t1
= build_zero_cst (type
);
10968 t1
= fold_unary_loc (loc
, BIT_NOT_EXPR
, type
, t1
);
10969 return omit_one_operand_loc (loc
, type
, t1
, arg0
);
10972 /* Canonicalize (X & C1) | C2. */
10973 if (TREE_CODE (arg0
) == BIT_AND_EXPR
10974 && TREE_CODE (arg1
) == INTEGER_CST
10975 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
10977 int width
= TYPE_PRECISION (type
), w
;
10978 wide_int c1
= TREE_OPERAND (arg0
, 1);
10979 wide_int c2
= arg1
;
10981 /* If (C1&C2) == C1, then (X&C1)|C2 becomes (X,C2). */
10982 if ((c1
& c2
) == c1
)
10983 return omit_one_operand_loc (loc
, type
, arg1
,
10984 TREE_OPERAND (arg0
, 0));
10986 wide_int msk
= wi::mask (width
, false,
10987 TYPE_PRECISION (TREE_TYPE (arg1
)));
10989 /* If (C1|C2) == ~0 then (X&C1)|C2 becomes X|C2. */
10990 if (msk
.and_not (c1
| c2
) == 0)
10991 return fold_build2_loc (loc
, BIT_IOR_EXPR
, type
,
10992 TREE_OPERAND (arg0
, 0), arg1
);
10994 /* Minimize the number of bits set in C1, i.e. C1 := C1 & ~C2,
10995 unless (C1 & ~C2) | (C2 & C3) for some C3 is a mask of some
10996 mode which allows further optimizations. */
10999 wide_int c3
= c1
.and_not (c2
);
11000 for (w
= BITS_PER_UNIT
; w
<= width
; w
<<= 1)
11002 wide_int mask
= wi::mask (w
, false,
11003 TYPE_PRECISION (type
));
11004 if (((c1
| c2
) & mask
) == mask
&& c1
.and_not (mask
) == 0)
11012 return fold_build2_loc (loc
, BIT_IOR_EXPR
, type
,
11013 fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
11014 TREE_OPERAND (arg0
, 0),
11015 wide_int_to_tree (type
,
11020 /* (X & ~Y) | (~X & Y) is X ^ Y */
11021 if (TREE_CODE (arg0
) == BIT_AND_EXPR
11022 && TREE_CODE (arg1
) == BIT_AND_EXPR
)
11024 tree a0
, a1
, l0
, l1
, n0
, n1
;
11026 a0
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 0));
11027 a1
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 1));
11029 l0
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
11030 l1
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 1));
11032 n0
= fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, l0
);
11033 n1
= fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, l1
);
11035 if ((operand_equal_p (n0
, a0
, 0)
11036 && operand_equal_p (n1
, a1
, 0))
11037 || (operand_equal_p (n0
, a1
, 0)
11038 && operand_equal_p (n1
, a0
, 0)))
11039 return fold_build2_loc (loc
, BIT_XOR_EXPR
, type
, l0
, n1
);
11042 t1
= distribute_bit_expr (loc
, code
, type
, arg0
, arg1
);
11043 if (t1
!= NULL_TREE
)
11046 /* Convert (or (not arg0) (not arg1)) to (not (and (arg0) (arg1))).
11048 This results in more efficient code for machines without a NAND
11049 instruction. Combine will canonicalize to the first form
11050 which will allow use of NAND instructions provided by the
11051 backend if they exist. */
11052 if (TREE_CODE (arg0
) == BIT_NOT_EXPR
11053 && TREE_CODE (arg1
) == BIT_NOT_EXPR
)
11056 fold_build1_loc (loc
, BIT_NOT_EXPR
, type
,
11057 build2 (BIT_AND_EXPR
, type
,
11058 fold_convert_loc (loc
, type
,
11059 TREE_OPERAND (arg0
, 0)),
11060 fold_convert_loc (loc
, type
,
11061 TREE_OPERAND (arg1
, 0))));
11064 /* See if this can be simplified into a rotate first. If that
11065 is unsuccessful continue in the association code. */
11069 /* ~X ^ X is -1. */
11070 if (TREE_CODE (arg0
) == BIT_NOT_EXPR
11071 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
11073 t1
= build_zero_cst (type
);
11074 t1
= fold_unary_loc (loc
, BIT_NOT_EXPR
, type
, t1
);
11075 return omit_one_operand_loc (loc
, type
, t1
, arg1
);
11078 /* X ^ ~X is -1. */
11079 if (TREE_CODE (arg1
) == BIT_NOT_EXPR
11080 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
11082 t1
= build_zero_cst (type
);
11083 t1
= fold_unary_loc (loc
, BIT_NOT_EXPR
, type
, t1
);
11084 return omit_one_operand_loc (loc
, type
, t1
, arg0
);
11087 /* If we are XORing two BIT_AND_EXPR's, both of which are and'ing
11088 with a constant, and the two constants have no bits in common,
11089 we should treat this as a BIT_IOR_EXPR since this may produce more
11090 simplifications. */
11091 if (TREE_CODE (arg0
) == BIT_AND_EXPR
11092 && TREE_CODE (arg1
) == BIT_AND_EXPR
11093 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
11094 && TREE_CODE (TREE_OPERAND (arg1
, 1)) == INTEGER_CST
11095 && wi::bit_and (TREE_OPERAND (arg0
, 1),
11096 TREE_OPERAND (arg1
, 1)) == 0)
11098 code
= BIT_IOR_EXPR
;
11102 /* (X | Y) ^ X -> Y & ~ X*/
11103 if (TREE_CODE (arg0
) == BIT_IOR_EXPR
11104 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
11106 tree t2
= TREE_OPERAND (arg0
, 1);
11107 t1
= fold_build1_loc (loc
, BIT_NOT_EXPR
, TREE_TYPE (arg1
),
11109 t1
= fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
11110 fold_convert_loc (loc
, type
, t2
),
11111 fold_convert_loc (loc
, type
, t1
));
11115 /* (Y | X) ^ X -> Y & ~ X*/
11116 if (TREE_CODE (arg0
) == BIT_IOR_EXPR
11117 && operand_equal_p (TREE_OPERAND (arg0
, 1), arg1
, 0))
11119 tree t2
= TREE_OPERAND (arg0
, 0);
11120 t1
= fold_build1_loc (loc
, BIT_NOT_EXPR
, TREE_TYPE (arg1
),
11122 t1
= fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
11123 fold_convert_loc (loc
, type
, t2
),
11124 fold_convert_loc (loc
, type
, t1
));
11128 /* X ^ (X | Y) -> Y & ~ X*/
11129 if (TREE_CODE (arg1
) == BIT_IOR_EXPR
11130 && operand_equal_p (TREE_OPERAND (arg1
, 0), arg0
, 0))
11132 tree t2
= TREE_OPERAND (arg1
, 1);
11133 t1
= fold_build1_loc (loc
, BIT_NOT_EXPR
, TREE_TYPE (arg0
),
11135 t1
= fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
11136 fold_convert_loc (loc
, type
, t2
),
11137 fold_convert_loc (loc
, type
, t1
));
11141 /* X ^ (Y | X) -> Y & ~ X*/
11142 if (TREE_CODE (arg1
) == BIT_IOR_EXPR
11143 && operand_equal_p (TREE_OPERAND (arg1
, 1), arg0
, 0))
11145 tree t2
= TREE_OPERAND (arg1
, 0);
11146 t1
= fold_build1_loc (loc
, BIT_NOT_EXPR
, TREE_TYPE (arg0
),
11148 t1
= fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
11149 fold_convert_loc (loc
, type
, t2
),
11150 fold_convert_loc (loc
, type
, t1
));
11154 /* Convert ~X ^ ~Y to X ^ Y. */
11155 if (TREE_CODE (arg0
) == BIT_NOT_EXPR
11156 && TREE_CODE (arg1
) == BIT_NOT_EXPR
)
11157 return fold_build2_loc (loc
, code
, type
,
11158 fold_convert_loc (loc
, type
,
11159 TREE_OPERAND (arg0
, 0)),
11160 fold_convert_loc (loc
, type
,
11161 TREE_OPERAND (arg1
, 0)));
11163 /* Convert ~X ^ C to X ^ ~C. */
11164 if (TREE_CODE (arg0
) == BIT_NOT_EXPR
11165 && TREE_CODE (arg1
) == INTEGER_CST
)
11166 return fold_build2_loc (loc
, code
, type
,
11167 fold_convert_loc (loc
, type
,
11168 TREE_OPERAND (arg0
, 0)),
11169 fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, arg1
));
11171 /* Fold (X & 1) ^ 1 as (X & 1) == 0. */
11172 if (TREE_CODE (arg0
) == BIT_AND_EXPR
11173 && INTEGRAL_TYPE_P (type
)
11174 && integer_onep (TREE_OPERAND (arg0
, 1))
11175 && integer_onep (arg1
))
11176 return fold_build2_loc (loc
, EQ_EXPR
, type
, arg0
,
11177 build_zero_cst (TREE_TYPE (arg0
)));
11179 /* Fold (X & Y) ^ Y as ~X & Y. */
11180 if (TREE_CODE (arg0
) == BIT_AND_EXPR
11181 && operand_equal_p (TREE_OPERAND (arg0
, 1), arg1
, 0))
11183 tem
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
11184 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
11185 fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, tem
),
11186 fold_convert_loc (loc
, type
, arg1
));
11188 /* Fold (X & Y) ^ X as ~Y & X. */
11189 if (TREE_CODE (arg0
) == BIT_AND_EXPR
11190 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0)
11191 && reorder_operands_p (TREE_OPERAND (arg0
, 1), arg1
))
11193 tem
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 1));
11194 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
11195 fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, tem
),
11196 fold_convert_loc (loc
, type
, arg1
));
11198 /* Fold X ^ (X & Y) as X & ~Y. */
11199 if (TREE_CODE (arg1
) == BIT_AND_EXPR
11200 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
11202 tem
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 1));
11203 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
11204 fold_convert_loc (loc
, type
, arg0
),
11205 fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, tem
));
11207 /* Fold X ^ (Y & X) as ~Y & X. */
11208 if (TREE_CODE (arg1
) == BIT_AND_EXPR
11209 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 1), 0)
11210 && reorder_operands_p (arg0
, TREE_OPERAND (arg1
, 0)))
11212 tem
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 0));
11213 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
11214 fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, tem
),
11215 fold_convert_loc (loc
, type
, arg0
));
11218 /* See if this can be simplified into a rotate first. If that
11219 is unsuccessful continue in the association code. */
11223 /* ~X & X, (X == 0) & X, and !X & X are always zero. */
11224 if ((TREE_CODE (arg0
) == BIT_NOT_EXPR
11225 || TREE_CODE (arg0
) == TRUTH_NOT_EXPR
11226 || (TREE_CODE (arg0
) == EQ_EXPR
11227 && integer_zerop (TREE_OPERAND (arg0
, 1))))
11228 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
11229 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg1
);
11231 /* X & ~X , X & (X == 0), and X & !X are always zero. */
11232 if ((TREE_CODE (arg1
) == BIT_NOT_EXPR
11233 || TREE_CODE (arg1
) == TRUTH_NOT_EXPR
11234 || (TREE_CODE (arg1
) == EQ_EXPR
11235 && integer_zerop (TREE_OPERAND (arg1
, 1))))
11236 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
11237 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
11239 /* Fold (X ^ 1) & 1 as (X & 1) == 0. */
11240 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
11241 && INTEGRAL_TYPE_P (type
)
11242 && integer_onep (TREE_OPERAND (arg0
, 1))
11243 && integer_onep (arg1
))
11246 tem
= TREE_OPERAND (arg0
, 0);
11247 tem2
= fold_convert_loc (loc
, TREE_TYPE (tem
), arg1
);
11248 tem2
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (tem
),
11250 return fold_build2_loc (loc
, EQ_EXPR
, type
, tem2
,
11251 build_zero_cst (TREE_TYPE (tem
)));
11253 /* Fold ~X & 1 as (X & 1) == 0. */
11254 if (TREE_CODE (arg0
) == BIT_NOT_EXPR
11255 && INTEGRAL_TYPE_P (type
)
11256 && integer_onep (arg1
))
11259 tem
= TREE_OPERAND (arg0
, 0);
11260 tem2
= fold_convert_loc (loc
, TREE_TYPE (tem
), arg1
);
11261 tem2
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (tem
),
11263 return fold_build2_loc (loc
, EQ_EXPR
, type
, tem2
,
11264 build_zero_cst (TREE_TYPE (tem
)));
11266 /* Fold !X & 1 as X == 0. */
11267 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
11268 && integer_onep (arg1
))
11270 tem
= TREE_OPERAND (arg0
, 0);
11271 return fold_build2_loc (loc
, EQ_EXPR
, type
, tem
,
11272 build_zero_cst (TREE_TYPE (tem
)));
11275 /* Fold (X ^ Y) & Y as ~X & Y. */
11276 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
11277 && operand_equal_p (TREE_OPERAND (arg0
, 1), arg1
, 0))
11279 tem
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
11280 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
11281 fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, tem
),
11282 fold_convert_loc (loc
, type
, arg1
));
11284 /* Fold (X ^ Y) & X as ~Y & X. */
11285 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
11286 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0)
11287 && reorder_operands_p (TREE_OPERAND (arg0
, 1), arg1
))
11289 tem
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 1));
11290 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
11291 fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, tem
),
11292 fold_convert_loc (loc
, type
, arg1
));
11294 /* Fold X & (X ^ Y) as X & ~Y. */
11295 if (TREE_CODE (arg1
) == BIT_XOR_EXPR
11296 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
11298 tem
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 1));
11299 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
11300 fold_convert_loc (loc
, type
, arg0
),
11301 fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, tem
));
11303 /* Fold X & (Y ^ X) as ~Y & X. */
11304 if (TREE_CODE (arg1
) == BIT_XOR_EXPR
11305 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 1), 0)
11306 && reorder_operands_p (arg0
, TREE_OPERAND (arg1
, 0)))
11308 tem
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 0));
11309 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
11310 fold_build1_loc (loc
, BIT_NOT_EXPR
, type
, tem
),
11311 fold_convert_loc (loc
, type
, arg0
));
11314 /* Fold (X * Y) & -(1 << CST) to X * Y if Y is a constant
11315 multiple of 1 << CST. */
11316 if (TREE_CODE (arg1
) == INTEGER_CST
)
11318 wide_int cst1
= arg1
;
11319 wide_int ncst1
= -cst1
;
11320 if ((cst1
& ncst1
) == ncst1
11321 && multiple_of_p (type
, arg0
,
11322 wide_int_to_tree (TREE_TYPE (arg1
), ncst1
)))
11323 return fold_convert_loc (loc
, type
, arg0
);
11326 /* Fold (X * CST1) & CST2 to zero if we can, or drop known zero
11328 if (TREE_CODE (arg1
) == INTEGER_CST
11329 && TREE_CODE (arg0
) == MULT_EXPR
11330 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
11332 wide_int warg1
= arg1
;
11333 wide_int masked
= mask_with_tz (type
, warg1
, TREE_OPERAND (arg0
, 1));
11336 return omit_two_operands_loc (loc
, type
, build_zero_cst (type
),
11338 else if (masked
!= warg1
)
11340 /* Avoid the transform if arg1 is a mask of some
11341 mode which allows further optimizations. */
11342 int pop
= wi::popcount (warg1
);
11343 if (!(pop
>= BITS_PER_UNIT
11344 && exact_log2 (pop
) != -1
11345 && wi::mask (pop
, false, warg1
.get_precision ()) == warg1
))
11346 return fold_build2_loc (loc
, code
, type
, op0
,
11347 wide_int_to_tree (type
, masked
));
11351 /* For constants M and N, if M == (1LL << cst) - 1 && (N & M) == M,
11352 ((A & N) + B) & M -> (A + B) & M
11353 Similarly if (N & M) == 0,
11354 ((A | N) + B) & M -> (A + B) & M
11355 and for - instead of + (or unary - instead of +)
11356 and/or ^ instead of |.
11357 If B is constant and (B & M) == 0, fold into A & M. */
11358 if (TREE_CODE (arg1
) == INTEGER_CST
)
11360 wide_int cst1
= arg1
;
11361 if ((~cst1
!= 0) && (cst1
& (cst1
+ 1)) == 0
11362 && INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
11363 && (TREE_CODE (arg0
) == PLUS_EXPR
11364 || TREE_CODE (arg0
) == MINUS_EXPR
11365 || TREE_CODE (arg0
) == NEGATE_EXPR
)
11366 && (TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg0
))
11367 || TREE_CODE (TREE_TYPE (arg0
)) == INTEGER_TYPE
))
11373 /* Now we know that arg0 is (C + D) or (C - D) or
11374 -C and arg1 (M) is == (1LL << cst) - 1.
11375 Store C into PMOP[0] and D into PMOP[1]. */
11376 pmop
[0] = TREE_OPERAND (arg0
, 0);
11378 if (TREE_CODE (arg0
) != NEGATE_EXPR
)
11380 pmop
[1] = TREE_OPERAND (arg0
, 1);
11384 if ((wi::max_value (TREE_TYPE (arg0
)) & cst1
) != cst1
)
11387 for (; which
>= 0; which
--)
11388 switch (TREE_CODE (pmop
[which
]))
11393 if (TREE_CODE (TREE_OPERAND (pmop
[which
], 1))
11396 cst0
= TREE_OPERAND (pmop
[which
], 1);
11398 if (TREE_CODE (pmop
[which
]) == BIT_AND_EXPR
)
11403 else if (cst0
!= 0)
11405 /* If C or D is of the form (A & N) where
11406 (N & M) == M, or of the form (A | N) or
11407 (A ^ N) where (N & M) == 0, replace it with A. */
11408 pmop
[which
] = TREE_OPERAND (pmop
[which
], 0);
11411 /* If C or D is a N where (N & M) == 0, it can be
11412 omitted (assumed 0). */
11413 if ((TREE_CODE (arg0
) == PLUS_EXPR
11414 || (TREE_CODE (arg0
) == MINUS_EXPR
&& which
== 0))
11415 && (cst1
& pmop
[which
]) == 0)
11416 pmop
[which
] = NULL
;
11422 /* Only build anything new if we optimized one or both arguments
11424 if (pmop
[0] != TREE_OPERAND (arg0
, 0)
11425 || (TREE_CODE (arg0
) != NEGATE_EXPR
11426 && pmop
[1] != TREE_OPERAND (arg0
, 1)))
11428 tree utype
= TREE_TYPE (arg0
);
11429 if (! TYPE_OVERFLOW_WRAPS (TREE_TYPE (arg0
)))
11431 /* Perform the operations in a type that has defined
11432 overflow behavior. */
11433 utype
= unsigned_type_for (TREE_TYPE (arg0
));
11434 if (pmop
[0] != NULL
)
11435 pmop
[0] = fold_convert_loc (loc
, utype
, pmop
[0]);
11436 if (pmop
[1] != NULL
)
11437 pmop
[1] = fold_convert_loc (loc
, utype
, pmop
[1]);
11440 if (TREE_CODE (arg0
) == NEGATE_EXPR
)
11441 tem
= fold_build1_loc (loc
, NEGATE_EXPR
, utype
, pmop
[0]);
11442 else if (TREE_CODE (arg0
) == PLUS_EXPR
)
11444 if (pmop
[0] != NULL
&& pmop
[1] != NULL
)
11445 tem
= fold_build2_loc (loc
, PLUS_EXPR
, utype
,
11447 else if (pmop
[0] != NULL
)
11449 else if (pmop
[1] != NULL
)
11452 return build_int_cst (type
, 0);
11454 else if (pmop
[0] == NULL
)
11455 tem
= fold_build1_loc (loc
, NEGATE_EXPR
, utype
, pmop
[1]);
11457 tem
= fold_build2_loc (loc
, MINUS_EXPR
, utype
,
11459 /* TEM is now the new binary +, - or unary - replacement. */
11460 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, utype
, tem
,
11461 fold_convert_loc (loc
, utype
, arg1
));
11462 return fold_convert_loc (loc
, type
, tem
);
11467 t1
= distribute_bit_expr (loc
, code
, type
, arg0
, arg1
);
11468 if (t1
!= NULL_TREE
)
11470 /* Simplify ((int)c & 0377) into (int)c, if c is unsigned char. */
11471 if (TREE_CODE (arg1
) == INTEGER_CST
&& TREE_CODE (arg0
) == NOP_EXPR
11472 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (arg0
, 0))))
11474 prec
= element_precision (TREE_TYPE (TREE_OPERAND (arg0
, 0)));
11476 wide_int mask
= wide_int::from (arg1
, prec
, UNSIGNED
);
11479 fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
11482 /* Convert (and (not arg0) (not arg1)) to (not (or (arg0) (arg1))).
11484 This results in more efficient code for machines without a NOR
11485 instruction. Combine will canonicalize to the first form
11486 which will allow use of NOR instructions provided by the
11487 backend if they exist. */
11488 if (TREE_CODE (arg0
) == BIT_NOT_EXPR
11489 && TREE_CODE (arg1
) == BIT_NOT_EXPR
)
11491 return fold_build1_loc (loc
, BIT_NOT_EXPR
, type
,
11492 build2 (BIT_IOR_EXPR
, type
,
11493 fold_convert_loc (loc
, type
,
11494 TREE_OPERAND (arg0
, 0)),
11495 fold_convert_loc (loc
, type
,
11496 TREE_OPERAND (arg1
, 0))));
11499 /* If arg0 is derived from the address of an object or function, we may
11500 be able to fold this expression using the object or function's
11502 if (POINTER_TYPE_P (TREE_TYPE (arg0
)) && tree_fits_uhwi_p (arg1
))
11504 unsigned HOST_WIDE_INT modulus
, residue
;
11505 unsigned HOST_WIDE_INT low
= tree_to_uhwi (arg1
);
11507 modulus
= get_pointer_modulus_and_residue (arg0
, &residue
,
11508 integer_onep (arg1
));
11510 /* This works because modulus is a power of 2. If this weren't the
11511 case, we'd have to replace it by its greatest power-of-2
11512 divisor: modulus & -modulus. */
11514 return build_int_cst (type
, residue
& low
);
11520 /* Don't touch a floating-point divide by zero unless the mode
11521 of the constant can represent infinity. */
11522 if (TREE_CODE (arg1
) == REAL_CST
11523 && !MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (arg1
)))
11524 && real_zerop (arg1
))
11527 /* (-A) / (-B) -> A / B */
11528 if (TREE_CODE (arg0
) == NEGATE_EXPR
&& negate_expr_p (arg1
))
11529 return fold_build2_loc (loc
, RDIV_EXPR
, type
,
11530 TREE_OPERAND (arg0
, 0),
11531 negate_expr (arg1
));
11532 if (TREE_CODE (arg1
) == NEGATE_EXPR
&& negate_expr_p (arg0
))
11533 return fold_build2_loc (loc
, RDIV_EXPR
, type
,
11534 negate_expr (arg0
),
11535 TREE_OPERAND (arg1
, 0));
11537 /* Convert A/B/C to A/(B*C). */
11538 if (flag_reciprocal_math
11539 && TREE_CODE (arg0
) == RDIV_EXPR
)
11540 return fold_build2_loc (loc
, RDIV_EXPR
, type
, TREE_OPERAND (arg0
, 0),
11541 fold_build2_loc (loc
, MULT_EXPR
, type
,
11542 TREE_OPERAND (arg0
, 1), arg1
));
11544 /* Convert A/(B/C) to (A/B)*C. */
11545 if (flag_reciprocal_math
11546 && TREE_CODE (arg1
) == RDIV_EXPR
)
11547 return fold_build2_loc (loc
, MULT_EXPR
, type
,
11548 fold_build2_loc (loc
, RDIV_EXPR
, type
, arg0
,
11549 TREE_OPERAND (arg1
, 0)),
11550 TREE_OPERAND (arg1
, 1));
11552 /* Convert C1/(X*C2) into (C1/C2)/X. */
11553 if (flag_reciprocal_math
11554 && TREE_CODE (arg1
) == MULT_EXPR
11555 && TREE_CODE (arg0
) == REAL_CST
11556 && TREE_CODE (TREE_OPERAND (arg1
, 1)) == REAL_CST
)
11558 tree tem
= const_binop (RDIV_EXPR
, arg0
,
11559 TREE_OPERAND (arg1
, 1));
11561 return fold_build2_loc (loc
, RDIV_EXPR
, type
, tem
,
11562 TREE_OPERAND (arg1
, 0));
11565 if (flag_unsafe_math_optimizations
)
11567 enum built_in_function fcode0
= builtin_mathfn_code (arg0
);
11568 enum built_in_function fcode1
= builtin_mathfn_code (arg1
);
11570 /* Optimize sin(x)/cos(x) as tan(x). */
11571 if (((fcode0
== BUILT_IN_SIN
&& fcode1
== BUILT_IN_COS
)
11572 || (fcode0
== BUILT_IN_SINF
&& fcode1
== BUILT_IN_COSF
)
11573 || (fcode0
== BUILT_IN_SINL
&& fcode1
== BUILT_IN_COSL
))
11574 && operand_equal_p (CALL_EXPR_ARG (arg0
, 0),
11575 CALL_EXPR_ARG (arg1
, 0), 0))
11577 tree tanfn
= mathfn_built_in (type
, BUILT_IN_TAN
);
11579 if (tanfn
!= NULL_TREE
)
11580 return build_call_expr_loc (loc
, tanfn
, 1, CALL_EXPR_ARG (arg0
, 0));
11583 /* Optimize cos(x)/sin(x) as 1.0/tan(x). */
11584 if (((fcode0
== BUILT_IN_COS
&& fcode1
== BUILT_IN_SIN
)
11585 || (fcode0
== BUILT_IN_COSF
&& fcode1
== BUILT_IN_SINF
)
11586 || (fcode0
== BUILT_IN_COSL
&& fcode1
== BUILT_IN_SINL
))
11587 && operand_equal_p (CALL_EXPR_ARG (arg0
, 0),
11588 CALL_EXPR_ARG (arg1
, 0), 0))
11590 tree tanfn
= mathfn_built_in (type
, BUILT_IN_TAN
);
11592 if (tanfn
!= NULL_TREE
)
11594 tree tmp
= build_call_expr_loc (loc
, tanfn
, 1,
11595 CALL_EXPR_ARG (arg0
, 0));
11596 return fold_build2_loc (loc
, RDIV_EXPR
, type
,
11597 build_real (type
, dconst1
), tmp
);
11601 /* Optimize sin(x)/tan(x) as cos(x) if we don't care about
11602 NaNs or Infinities. */
11603 if (((fcode0
== BUILT_IN_SIN
&& fcode1
== BUILT_IN_TAN
)
11604 || (fcode0
== BUILT_IN_SINF
&& fcode1
== BUILT_IN_TANF
)
11605 || (fcode0
== BUILT_IN_SINL
&& fcode1
== BUILT_IN_TANL
)))
11607 tree arg00
= CALL_EXPR_ARG (arg0
, 0);
11608 tree arg01
= CALL_EXPR_ARG (arg1
, 0);
11610 if (! HONOR_NANS (arg00
)
11611 && ! HONOR_INFINITIES (element_mode (arg00
))
11612 && operand_equal_p (arg00
, arg01
, 0))
11614 tree cosfn
= mathfn_built_in (type
, BUILT_IN_COS
);
11616 if (cosfn
!= NULL_TREE
)
11617 return build_call_expr_loc (loc
, cosfn
, 1, arg00
);
11621 /* Optimize tan(x)/sin(x) as 1.0/cos(x) if we don't care about
11622 NaNs or Infinities. */
11623 if (((fcode0
== BUILT_IN_TAN
&& fcode1
== BUILT_IN_SIN
)
11624 || (fcode0
== BUILT_IN_TANF
&& fcode1
== BUILT_IN_SINF
)
11625 || (fcode0
== BUILT_IN_TANL
&& fcode1
== BUILT_IN_SINL
)))
11627 tree arg00
= CALL_EXPR_ARG (arg0
, 0);
11628 tree arg01
= CALL_EXPR_ARG (arg1
, 0);
11630 if (! HONOR_NANS (arg00
)
11631 && ! HONOR_INFINITIES (element_mode (arg00
))
11632 && operand_equal_p (arg00
, arg01
, 0))
11634 tree cosfn
= mathfn_built_in (type
, BUILT_IN_COS
);
11636 if (cosfn
!= NULL_TREE
)
11638 tree tmp
= build_call_expr_loc (loc
, cosfn
, 1, arg00
);
11639 return fold_build2_loc (loc
, RDIV_EXPR
, type
,
11640 build_real (type
, dconst1
),
11646 /* Optimize pow(x,c)/x as pow(x,c-1). */
11647 if (fcode0
== BUILT_IN_POW
11648 || fcode0
== BUILT_IN_POWF
11649 || fcode0
== BUILT_IN_POWL
)
11651 tree arg00
= CALL_EXPR_ARG (arg0
, 0);
11652 tree arg01
= CALL_EXPR_ARG (arg0
, 1);
11653 if (TREE_CODE (arg01
) == REAL_CST
11654 && !TREE_OVERFLOW (arg01
)
11655 && operand_equal_p (arg1
, arg00
, 0))
11657 tree powfn
= TREE_OPERAND (CALL_EXPR_FN (arg0
), 0);
11661 c
= TREE_REAL_CST (arg01
);
11662 real_arithmetic (&c
, MINUS_EXPR
, &c
, &dconst1
);
11663 arg
= build_real (type
, c
);
11664 return build_call_expr_loc (loc
, powfn
, 2, arg1
, arg
);
11668 /* Optimize a/root(b/c) into a*root(c/b). */
11669 if (BUILTIN_ROOT_P (fcode1
))
11671 tree rootarg
= CALL_EXPR_ARG (arg1
, 0);
11673 if (TREE_CODE (rootarg
) == RDIV_EXPR
)
11675 tree rootfn
= TREE_OPERAND (CALL_EXPR_FN (arg1
), 0);
11676 tree b
= TREE_OPERAND (rootarg
, 0);
11677 tree c
= TREE_OPERAND (rootarg
, 1);
11679 tree tmp
= fold_build2_loc (loc
, RDIV_EXPR
, type
, c
, b
);
11681 tmp
= build_call_expr_loc (loc
, rootfn
, 1, tmp
);
11682 return fold_build2_loc (loc
, MULT_EXPR
, type
, arg0
, tmp
);
11686 /* Optimize x/expN(y) into x*expN(-y). */
11687 if (BUILTIN_EXPONENT_P (fcode1
))
11689 tree expfn
= TREE_OPERAND (CALL_EXPR_FN (arg1
), 0);
11690 tree arg
= negate_expr (CALL_EXPR_ARG (arg1
, 0));
11691 arg1
= build_call_expr_loc (loc
,
11693 fold_convert_loc (loc
, type
, arg
));
11694 return fold_build2_loc (loc
, MULT_EXPR
, type
, arg0
, arg1
);
11697 /* Optimize x/pow(y,z) into x*pow(y,-z). */
11698 if (fcode1
== BUILT_IN_POW
11699 || fcode1
== BUILT_IN_POWF
11700 || fcode1
== BUILT_IN_POWL
)
11702 tree powfn
= TREE_OPERAND (CALL_EXPR_FN (arg1
), 0);
11703 tree arg10
= CALL_EXPR_ARG (arg1
, 0);
11704 tree arg11
= CALL_EXPR_ARG (arg1
, 1);
11705 tree neg11
= fold_convert_loc (loc
, type
,
11706 negate_expr (arg11
));
11707 arg1
= build_call_expr_loc (loc
, powfn
, 2, arg10
, neg11
);
11708 return fold_build2_loc (loc
, MULT_EXPR
, type
, arg0
, arg1
);
11713 case TRUNC_DIV_EXPR
:
11714 /* Optimize (X & (-A)) / A where A is a power of 2,
11716 if (TREE_CODE (arg0
) == BIT_AND_EXPR
11717 && !TYPE_UNSIGNED (type
) && TREE_CODE (arg1
) == INTEGER_CST
11718 && integer_pow2p (arg1
) && tree_int_cst_sgn (arg1
) > 0)
11720 tree sum
= fold_binary_loc (loc
, PLUS_EXPR
, TREE_TYPE (arg1
),
11721 arg1
, TREE_OPERAND (arg0
, 1));
11722 if (sum
&& integer_zerop (sum
)) {
11723 tree pow2
= build_int_cst (integer_type_node
,
11724 wi::exact_log2 (arg1
));
11725 return fold_build2_loc (loc
, RSHIFT_EXPR
, type
,
11726 TREE_OPERAND (arg0
, 0), pow2
);
11732 case FLOOR_DIV_EXPR
:
11733 /* Simplify A / (B << N) where A and B are positive and B is
11734 a power of 2, to A >> (N + log2(B)). */
11735 strict_overflow_p
= false;
11736 if (TREE_CODE (arg1
) == LSHIFT_EXPR
11737 && (TYPE_UNSIGNED (type
)
11738 || tree_expr_nonnegative_warnv_p (op0
, &strict_overflow_p
)))
11740 tree sval
= TREE_OPERAND (arg1
, 0);
11741 if (integer_pow2p (sval
) && tree_int_cst_sgn (sval
) > 0)
11743 tree sh_cnt
= TREE_OPERAND (arg1
, 1);
11744 tree pow2
= build_int_cst (TREE_TYPE (sh_cnt
),
11745 wi::exact_log2 (sval
));
11747 if (strict_overflow_p
)
11748 fold_overflow_warning (("assuming signed overflow does not "
11749 "occur when simplifying A / (B << N)"),
11750 WARN_STRICT_OVERFLOW_MISC
);
11752 sh_cnt
= fold_build2_loc (loc
, PLUS_EXPR
, TREE_TYPE (sh_cnt
),
11754 return fold_build2_loc (loc
, RSHIFT_EXPR
, type
,
11755 fold_convert_loc (loc
, type
, arg0
), sh_cnt
);
11761 case ROUND_DIV_EXPR
:
11762 case CEIL_DIV_EXPR
:
11763 case EXACT_DIV_EXPR
:
11764 if (integer_zerop (arg1
))
11767 /* Convert -A / -B to A / B when the type is signed and overflow is
11769 if ((!INTEGRAL_TYPE_P (type
) || TYPE_OVERFLOW_UNDEFINED (type
))
11770 && TREE_CODE (arg0
) == NEGATE_EXPR
11771 && negate_expr_p (arg1
))
11773 if (INTEGRAL_TYPE_P (type
))
11774 fold_overflow_warning (("assuming signed overflow does not occur "
11775 "when distributing negation across "
11777 WARN_STRICT_OVERFLOW_MISC
);
11778 return fold_build2_loc (loc
, code
, type
,
11779 fold_convert_loc (loc
, type
,
11780 TREE_OPERAND (arg0
, 0)),
11781 fold_convert_loc (loc
, type
,
11782 negate_expr (arg1
)));
11784 if ((!INTEGRAL_TYPE_P (type
) || TYPE_OVERFLOW_UNDEFINED (type
))
11785 && TREE_CODE (arg1
) == NEGATE_EXPR
11786 && negate_expr_p (arg0
))
11788 if (INTEGRAL_TYPE_P (type
))
11789 fold_overflow_warning (("assuming signed overflow does not occur "
11790 "when distributing negation across "
11792 WARN_STRICT_OVERFLOW_MISC
);
11793 return fold_build2_loc (loc
, code
, type
,
11794 fold_convert_loc (loc
, type
,
11795 negate_expr (arg0
)),
11796 fold_convert_loc (loc
, type
,
11797 TREE_OPERAND (arg1
, 0)));
11800 /* If arg0 is a multiple of arg1, then rewrite to the fastest div
11801 operation, EXACT_DIV_EXPR.
11803 Note that only CEIL_DIV_EXPR and FLOOR_DIV_EXPR are rewritten now.
11804 At one time others generated faster code, it's not clear if they do
11805 after the last round to changes to the DIV code in expmed.c. */
11806 if ((code
== CEIL_DIV_EXPR
|| code
== FLOOR_DIV_EXPR
)
11807 && multiple_of_p (type
, arg0
, arg1
))
11808 return fold_build2_loc (loc
, EXACT_DIV_EXPR
, type
, arg0
, arg1
);
11810 strict_overflow_p
= false;
11811 if (TREE_CODE (arg1
) == INTEGER_CST
11812 && 0 != (tem
= extract_muldiv (op0
, arg1
, code
, NULL_TREE
,
11813 &strict_overflow_p
)))
11815 if (strict_overflow_p
)
11816 fold_overflow_warning (("assuming signed overflow does not occur "
11817 "when simplifying division"),
11818 WARN_STRICT_OVERFLOW_MISC
);
11819 return fold_convert_loc (loc
, type
, tem
);
11824 case CEIL_MOD_EXPR
:
11825 case FLOOR_MOD_EXPR
:
11826 case ROUND_MOD_EXPR
:
11827 case TRUNC_MOD_EXPR
:
11828 strict_overflow_p
= false;
11829 if (TREE_CODE (arg1
) == INTEGER_CST
11830 && 0 != (tem
= extract_muldiv (op0
, arg1
, code
, NULL_TREE
,
11831 &strict_overflow_p
)))
11833 if (strict_overflow_p
)
11834 fold_overflow_warning (("assuming signed overflow does not occur "
11835 "when simplifying modulus"),
11836 WARN_STRICT_OVERFLOW_MISC
);
11837 return fold_convert_loc (loc
, type
, tem
);
11846 /* Since negative shift count is not well-defined,
11847 don't try to compute it in the compiler. */
11848 if (TREE_CODE (arg1
) == INTEGER_CST
&& tree_int_cst_sgn (arg1
) < 0)
11851 prec
= element_precision (type
);
11853 /* Turn (a OP c1) OP c2 into a OP (c1+c2). */
11854 if (TREE_CODE (op0
) == code
&& tree_fits_uhwi_p (arg1
)
11855 && tree_to_uhwi (arg1
) < prec
11856 && tree_fits_uhwi_p (TREE_OPERAND (arg0
, 1))
11857 && tree_to_uhwi (TREE_OPERAND (arg0
, 1)) < prec
)
11859 unsigned int low
= (tree_to_uhwi (TREE_OPERAND (arg0
, 1))
11860 + tree_to_uhwi (arg1
));
11862 /* Deal with a OP (c1 + c2) being undefined but (a OP c1) OP c2
11863 being well defined. */
11866 if (code
== LROTATE_EXPR
|| code
== RROTATE_EXPR
)
11868 else if (TYPE_UNSIGNED (type
) || code
== LSHIFT_EXPR
)
11869 return omit_one_operand_loc (loc
, type
, build_zero_cst (type
),
11870 TREE_OPERAND (arg0
, 0));
11875 return fold_build2_loc (loc
, code
, type
, TREE_OPERAND (arg0
, 0),
11876 build_int_cst (TREE_TYPE (arg1
), low
));
11879 /* Transform (x >> c) << c into x & (-1<<c), or transform (x << c) >> c
11880 into x & ((unsigned)-1 >> c) for unsigned types. */
11881 if (((code
== LSHIFT_EXPR
&& TREE_CODE (arg0
) == RSHIFT_EXPR
)
11882 || (TYPE_UNSIGNED (type
)
11883 && code
== RSHIFT_EXPR
&& TREE_CODE (arg0
) == LSHIFT_EXPR
))
11884 && tree_fits_uhwi_p (arg1
)
11885 && tree_to_uhwi (arg1
) < prec
11886 && tree_fits_uhwi_p (TREE_OPERAND (arg0
, 1))
11887 && tree_to_uhwi (TREE_OPERAND (arg0
, 1)) < prec
)
11889 HOST_WIDE_INT low0
= tree_to_uhwi (TREE_OPERAND (arg0
, 1));
11890 HOST_WIDE_INT low1
= tree_to_uhwi (arg1
);
11896 arg00
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
11898 lshift
= build_minus_one_cst (type
);
11899 lshift
= const_binop (code
, lshift
, arg1
);
11901 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
, arg00
, lshift
);
11905 /* If we have a rotate of a bit operation with the rotate count and
11906 the second operand of the bit operation both constant,
11907 permute the two operations. */
11908 if (code
== RROTATE_EXPR
&& TREE_CODE (arg1
) == INTEGER_CST
11909 && (TREE_CODE (arg0
) == BIT_AND_EXPR
11910 || TREE_CODE (arg0
) == BIT_IOR_EXPR
11911 || TREE_CODE (arg0
) == BIT_XOR_EXPR
)
11912 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
11913 return fold_build2_loc (loc
, TREE_CODE (arg0
), type
,
11914 fold_build2_loc (loc
, code
, type
,
11915 TREE_OPERAND (arg0
, 0), arg1
),
11916 fold_build2_loc (loc
, code
, type
,
11917 TREE_OPERAND (arg0
, 1), arg1
));
11919 /* Two consecutive rotates adding up to the some integer
11920 multiple of the precision of the type can be ignored. */
11921 if (code
== RROTATE_EXPR
&& TREE_CODE (arg1
) == INTEGER_CST
11922 && TREE_CODE (arg0
) == RROTATE_EXPR
11923 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
11924 && wi::umod_trunc (wi::add (arg1
, TREE_OPERAND (arg0
, 1)),
11926 return TREE_OPERAND (arg0
, 0);
11928 /* Fold (X & C2) << C1 into (X << C1) & (C2 << C1)
11929 (X & C2) >> C1 into (X >> C1) & (C2 >> C1)
11930 if the latter can be further optimized. */
11931 if ((code
== LSHIFT_EXPR
|| code
== RSHIFT_EXPR
)
11932 && TREE_CODE (arg0
) == BIT_AND_EXPR
11933 && TREE_CODE (arg1
) == INTEGER_CST
11934 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
11936 tree mask
= fold_build2_loc (loc
, code
, type
,
11937 fold_convert_loc (loc
, type
,
11938 TREE_OPERAND (arg0
, 1)),
11940 tree shift
= fold_build2_loc (loc
, code
, type
,
11941 fold_convert_loc (loc
, type
,
11942 TREE_OPERAND (arg0
, 0)),
11944 tem
= fold_binary_loc (loc
, BIT_AND_EXPR
, type
, shift
, mask
);
11952 tem
= fold_minmax (loc
, MIN_EXPR
, type
, arg0
, arg1
);
11958 tem
= fold_minmax (loc
, MAX_EXPR
, type
, arg0
, arg1
);
11963 case TRUTH_ANDIF_EXPR
:
11964 /* Note that the operands of this must be ints
11965 and their values must be 0 or 1.
11966 ("true" is a fixed value perhaps depending on the language.) */
11967 /* If first arg is constant zero, return it. */
11968 if (integer_zerop (arg0
))
11969 return fold_convert_loc (loc
, type
, arg0
);
11970 case TRUTH_AND_EXPR
:
11971 /* If either arg is constant true, drop it. */
11972 if (TREE_CODE (arg0
) == INTEGER_CST
&& ! integer_zerop (arg0
))
11973 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg1
));
11974 if (TREE_CODE (arg1
) == INTEGER_CST
&& ! integer_zerop (arg1
)
11975 /* Preserve sequence points. */
11976 && (code
!= TRUTH_ANDIF_EXPR
|| ! TREE_SIDE_EFFECTS (arg0
)))
11977 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
11978 /* If second arg is constant zero, result is zero, but first arg
11979 must be evaluated. */
11980 if (integer_zerop (arg1
))
11981 return omit_one_operand_loc (loc
, type
, arg1
, arg0
);
11982 /* Likewise for first arg, but note that only the TRUTH_AND_EXPR
11983 case will be handled here. */
11984 if (integer_zerop (arg0
))
11985 return omit_one_operand_loc (loc
, type
, arg0
, arg1
);
11987 /* !X && X is always false. */
11988 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
11989 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
11990 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg1
);
11991 /* X && !X is always false. */
11992 if (TREE_CODE (arg1
) == TRUTH_NOT_EXPR
11993 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
11994 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
11996 /* A < X && A + 1 > Y ==> A < X && A >= Y. Normally A + 1 > Y
11997 means A >= Y && A != MAX, but in this case we know that
12000 if (!TREE_SIDE_EFFECTS (arg0
)
12001 && !TREE_SIDE_EFFECTS (arg1
))
12003 tem
= fold_to_nonsharp_ineq_using_bound (loc
, arg0
, arg1
);
12004 if (tem
&& !operand_equal_p (tem
, arg0
, 0))
12005 return fold_build2_loc (loc
, code
, type
, tem
, arg1
);
12007 tem
= fold_to_nonsharp_ineq_using_bound (loc
, arg1
, arg0
);
12008 if (tem
&& !operand_equal_p (tem
, arg1
, 0))
12009 return fold_build2_loc (loc
, code
, type
, arg0
, tem
);
12012 if ((tem
= fold_truth_andor (loc
, code
, type
, arg0
, arg1
, op0
, op1
))
12018 case TRUTH_ORIF_EXPR
:
12019 /* Note that the operands of this must be ints
12020 and their values must be 0 or true.
12021 ("true" is a fixed value perhaps depending on the language.) */
12022 /* If first arg is constant true, return it. */
12023 if (TREE_CODE (arg0
) == INTEGER_CST
&& ! integer_zerop (arg0
))
12024 return fold_convert_loc (loc
, type
, arg0
);
12025 case TRUTH_OR_EXPR
:
12026 /* If either arg is constant zero, drop it. */
12027 if (TREE_CODE (arg0
) == INTEGER_CST
&& integer_zerop (arg0
))
12028 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg1
));
12029 if (TREE_CODE (arg1
) == INTEGER_CST
&& integer_zerop (arg1
)
12030 /* Preserve sequence points. */
12031 && (code
!= TRUTH_ORIF_EXPR
|| ! TREE_SIDE_EFFECTS (arg0
)))
12032 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
12033 /* If second arg is constant true, result is true, but we must
12034 evaluate first arg. */
12035 if (TREE_CODE (arg1
) == INTEGER_CST
&& ! integer_zerop (arg1
))
12036 return omit_one_operand_loc (loc
, type
, arg1
, arg0
);
12037 /* Likewise for first arg, but note this only occurs here for
12039 if (TREE_CODE (arg0
) == INTEGER_CST
&& ! integer_zerop (arg0
))
12040 return omit_one_operand_loc (loc
, type
, arg0
, arg1
);
12042 /* !X || X is always true. */
12043 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
12044 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
12045 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg1
);
12046 /* X || !X is always true. */
12047 if (TREE_CODE (arg1
) == TRUTH_NOT_EXPR
12048 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
12049 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
12051 /* (X && !Y) || (!X && Y) is X ^ Y */
12052 if (TREE_CODE (arg0
) == TRUTH_AND_EXPR
12053 && TREE_CODE (arg1
) == TRUTH_AND_EXPR
)
12055 tree a0
, a1
, l0
, l1
, n0
, n1
;
12057 a0
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 0));
12058 a1
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg1
, 1));
12060 l0
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 0));
12061 l1
= fold_convert_loc (loc
, type
, TREE_OPERAND (arg0
, 1));
12063 n0
= fold_build1_loc (loc
, TRUTH_NOT_EXPR
, type
, l0
);
12064 n1
= fold_build1_loc (loc
, TRUTH_NOT_EXPR
, type
, l1
);
12066 if ((operand_equal_p (n0
, a0
, 0)
12067 && operand_equal_p (n1
, a1
, 0))
12068 || (operand_equal_p (n0
, a1
, 0)
12069 && operand_equal_p (n1
, a0
, 0)))
12070 return fold_build2_loc (loc
, TRUTH_XOR_EXPR
, type
, l0
, n1
);
12073 if ((tem
= fold_truth_andor (loc
, code
, type
, arg0
, arg1
, op0
, op1
))
12079 case TRUTH_XOR_EXPR
:
12080 /* If the second arg is constant zero, drop it. */
12081 if (integer_zerop (arg1
))
12082 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
12083 /* If the second arg is constant true, this is a logical inversion. */
12084 if (integer_onep (arg1
))
12086 tem
= invert_truthvalue_loc (loc
, arg0
);
12087 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, tem
));
12089 /* Identical arguments cancel to zero. */
12090 if (operand_equal_p (arg0
, arg1
, 0))
12091 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
12093 /* !X ^ X is always true. */
12094 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
12095 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0))
12096 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg1
);
12098 /* X ^ !X is always true. */
12099 if (TREE_CODE (arg1
) == TRUTH_NOT_EXPR
12100 && operand_equal_p (arg0
, TREE_OPERAND (arg1
, 0), 0))
12101 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
12110 tem
= fold_comparison (loc
, code
, type
, op0
, op1
);
12111 if (tem
!= NULL_TREE
)
12114 /* bool_var != 0 becomes bool_var. */
12115 if (TREE_CODE (TREE_TYPE (arg0
)) == BOOLEAN_TYPE
&& integer_zerop (arg1
)
12116 && code
== NE_EXPR
)
12117 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
12119 /* bool_var == 1 becomes bool_var. */
12120 if (TREE_CODE (TREE_TYPE (arg0
)) == BOOLEAN_TYPE
&& integer_onep (arg1
)
12121 && code
== EQ_EXPR
)
12122 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
12124 /* bool_var != 1 becomes !bool_var. */
12125 if (TREE_CODE (TREE_TYPE (arg0
)) == BOOLEAN_TYPE
&& integer_onep (arg1
)
12126 && code
== NE_EXPR
)
12127 return fold_convert_loc (loc
, type
,
12128 fold_build1_loc (loc
, TRUTH_NOT_EXPR
,
12129 TREE_TYPE (arg0
), arg0
));
12131 /* bool_var == 0 becomes !bool_var. */
12132 if (TREE_CODE (TREE_TYPE (arg0
)) == BOOLEAN_TYPE
&& integer_zerop (arg1
)
12133 && code
== EQ_EXPR
)
12134 return fold_convert_loc (loc
, type
,
12135 fold_build1_loc (loc
, TRUTH_NOT_EXPR
,
12136 TREE_TYPE (arg0
), arg0
));
12138 /* !exp != 0 becomes !exp */
12139 if (TREE_CODE (arg0
) == TRUTH_NOT_EXPR
&& integer_zerop (arg1
)
12140 && code
== NE_EXPR
)
12141 return non_lvalue_loc (loc
, fold_convert_loc (loc
, type
, arg0
));
12143 /* If this is an equality comparison of the address of two non-weak,
12144 unaliased symbols neither of which are extern (since we do not
12145 have access to attributes for externs), then we know the result. */
12146 if (TREE_CODE (arg0
) == ADDR_EXPR
12147 && DECL_P (TREE_OPERAND (arg0
, 0))
12148 && TREE_CODE (arg1
) == ADDR_EXPR
12149 && DECL_P (TREE_OPERAND (arg1
, 0)))
12153 if (decl_in_symtab_p (TREE_OPERAND (arg0
, 0))
12154 && decl_in_symtab_p (TREE_OPERAND (arg1
, 0)))
12155 equal
= symtab_node::get_create (TREE_OPERAND (arg0
, 0))
12156 ->equal_address_to (symtab_node::get_create
12157 (TREE_OPERAND (arg1
, 0)));
12159 equal
= TREE_OPERAND (arg0
, 0) == TREE_OPERAND (arg1
, 0);
12161 return constant_boolean_node (equal
12162 ? code
== EQ_EXPR
: code
!= EQ_EXPR
,
12166 /* Similarly for a NEGATE_EXPR. */
12167 if (TREE_CODE (arg0
) == NEGATE_EXPR
12168 && TREE_CODE (arg1
) == INTEGER_CST
12169 && 0 != (tem
= negate_expr (fold_convert_loc (loc
, TREE_TYPE (arg0
),
12171 && TREE_CODE (tem
) == INTEGER_CST
12172 && !TREE_OVERFLOW (tem
))
12173 return fold_build2_loc (loc
, code
, type
, TREE_OPERAND (arg0
, 0), tem
);
12175 /* Similarly for a BIT_XOR_EXPR; X ^ C1 == C2 is X == (C1 ^ C2). */
12176 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
12177 && TREE_CODE (arg1
) == INTEGER_CST
12178 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
12179 return fold_build2_loc (loc
, code
, type
, TREE_OPERAND (arg0
, 0),
12180 fold_build2_loc (loc
, BIT_XOR_EXPR
, TREE_TYPE (arg0
),
12181 fold_convert_loc (loc
,
12184 TREE_OPERAND (arg0
, 1)));
12186 /* Transform comparisons of the form X +- Y CMP X to Y CMP 0. */
12187 if ((TREE_CODE (arg0
) == PLUS_EXPR
12188 || TREE_CODE (arg0
) == POINTER_PLUS_EXPR
12189 || TREE_CODE (arg0
) == MINUS_EXPR
)
12190 && operand_equal_p (tree_strip_nop_conversions (TREE_OPERAND (arg0
,
12193 && (INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
12194 || POINTER_TYPE_P (TREE_TYPE (arg0
))))
12196 tree val
= TREE_OPERAND (arg0
, 1);
12197 return omit_two_operands_loc (loc
, type
,
12198 fold_build2_loc (loc
, code
, type
,
12200 build_int_cst (TREE_TYPE (val
),
12202 TREE_OPERAND (arg0
, 0), arg1
);
12205 /* Transform comparisons of the form C - X CMP X if C % 2 == 1. */
12206 if (TREE_CODE (arg0
) == MINUS_EXPR
12207 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == INTEGER_CST
12208 && operand_equal_p (tree_strip_nop_conversions (TREE_OPERAND (arg0
,
12211 && wi::extract_uhwi (TREE_OPERAND (arg0
, 0), 0, 1) == 1)
12213 return omit_two_operands_loc (loc
, type
,
12215 ? boolean_true_node
: boolean_false_node
,
12216 TREE_OPERAND (arg0
, 1), arg1
);
12219 /* Convert ABS_EXPR<x> == 0 or ABS_EXPR<x> != 0 to x == 0 or x != 0. */
12220 if (TREE_CODE (arg0
) == ABS_EXPR
12221 && (integer_zerop (arg1
) || real_zerop (arg1
)))
12222 return fold_build2_loc (loc
, code
, type
, TREE_OPERAND (arg0
, 0), arg1
);
12224 /* If this is an EQ or NE comparison with zero and ARG0 is
12225 (1 << foo) & bar, convert it to (bar >> foo) & 1. Both require
12226 two operations, but the latter can be done in one less insn
12227 on machines that have only two-operand insns or on which a
12228 constant cannot be the first operand. */
12229 if (TREE_CODE (arg0
) == BIT_AND_EXPR
12230 && integer_zerop (arg1
))
12232 tree arg00
= TREE_OPERAND (arg0
, 0);
12233 tree arg01
= TREE_OPERAND (arg0
, 1);
12234 if (TREE_CODE (arg00
) == LSHIFT_EXPR
12235 && integer_onep (TREE_OPERAND (arg00
, 0)))
12237 tree tem
= fold_build2_loc (loc
, RSHIFT_EXPR
, TREE_TYPE (arg00
),
12238 arg01
, TREE_OPERAND (arg00
, 1));
12239 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg0
), tem
,
12240 build_int_cst (TREE_TYPE (arg0
), 1));
12241 return fold_build2_loc (loc
, code
, type
,
12242 fold_convert_loc (loc
, TREE_TYPE (arg1
), tem
),
12245 else if (TREE_CODE (arg01
) == LSHIFT_EXPR
12246 && integer_onep (TREE_OPERAND (arg01
, 0)))
12248 tree tem
= fold_build2_loc (loc
, RSHIFT_EXPR
, TREE_TYPE (arg01
),
12249 arg00
, TREE_OPERAND (arg01
, 1));
12250 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg0
), tem
,
12251 build_int_cst (TREE_TYPE (arg0
), 1));
12252 return fold_build2_loc (loc
, code
, type
,
12253 fold_convert_loc (loc
, TREE_TYPE (arg1
), tem
),
12258 /* If this is an NE or EQ comparison of zero against the result of a
12259 signed MOD operation whose second operand is a power of 2, make
12260 the MOD operation unsigned since it is simpler and equivalent. */
12261 if (integer_zerop (arg1
)
12262 && !TYPE_UNSIGNED (TREE_TYPE (arg0
))
12263 && (TREE_CODE (arg0
) == TRUNC_MOD_EXPR
12264 || TREE_CODE (arg0
) == CEIL_MOD_EXPR
12265 || TREE_CODE (arg0
) == FLOOR_MOD_EXPR
12266 || TREE_CODE (arg0
) == ROUND_MOD_EXPR
)
12267 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
12269 tree newtype
= unsigned_type_for (TREE_TYPE (arg0
));
12270 tree newmod
= fold_build2_loc (loc
, TREE_CODE (arg0
), newtype
,
12271 fold_convert_loc (loc
, newtype
,
12272 TREE_OPERAND (arg0
, 0)),
12273 fold_convert_loc (loc
, newtype
,
12274 TREE_OPERAND (arg0
, 1)));
12276 return fold_build2_loc (loc
, code
, type
, newmod
,
12277 fold_convert_loc (loc
, newtype
, arg1
));
12280 /* Fold ((X >> C1) & C2) == 0 and ((X >> C1) & C2) != 0 where
12281 C1 is a valid shift constant, and C2 is a power of two, i.e.
12283 if (TREE_CODE (arg0
) == BIT_AND_EXPR
12284 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == RSHIFT_EXPR
12285 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1))
12287 && integer_pow2p (TREE_OPERAND (arg0
, 1))
12288 && integer_zerop (arg1
))
12290 tree itype
= TREE_TYPE (arg0
);
12291 tree arg001
= TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1);
12292 prec
= TYPE_PRECISION (itype
);
12294 /* Check for a valid shift count. */
12295 if (wi::ltu_p (arg001
, prec
))
12297 tree arg01
= TREE_OPERAND (arg0
, 1);
12298 tree arg000
= TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0);
12299 unsigned HOST_WIDE_INT log2
= tree_log2 (arg01
);
12300 /* If (C2 << C1) doesn't overflow, then ((X >> C1) & C2) != 0
12301 can be rewritten as (X & (C2 << C1)) != 0. */
12302 if ((log2
+ TREE_INT_CST_LOW (arg001
)) < prec
)
12304 tem
= fold_build2_loc (loc
, LSHIFT_EXPR
, itype
, arg01
, arg001
);
12305 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, itype
, arg000
, tem
);
12306 return fold_build2_loc (loc
, code
, type
, tem
,
12307 fold_convert_loc (loc
, itype
, arg1
));
12309 /* Otherwise, for signed (arithmetic) shifts,
12310 ((X >> C1) & C2) != 0 is rewritten as X < 0, and
12311 ((X >> C1) & C2) == 0 is rewritten as X >= 0. */
12312 else if (!TYPE_UNSIGNED (itype
))
12313 return fold_build2_loc (loc
, code
== EQ_EXPR
? GE_EXPR
: LT_EXPR
, type
,
12314 arg000
, build_int_cst (itype
, 0));
12315 /* Otherwise, of unsigned (logical) shifts,
12316 ((X >> C1) & C2) != 0 is rewritten as (X,false), and
12317 ((X >> C1) & C2) == 0 is rewritten as (X,true). */
12319 return omit_one_operand_loc (loc
, type
,
12320 code
== EQ_EXPR
? integer_one_node
12321 : integer_zero_node
,
12326 /* If we have (A & C) == C where C is a power of 2, convert this into
12327 (A & C) != 0. Similarly for NE_EXPR. */
12328 if (TREE_CODE (arg0
) == BIT_AND_EXPR
12329 && integer_pow2p (TREE_OPERAND (arg0
, 1))
12330 && operand_equal_p (TREE_OPERAND (arg0
, 1), arg1
, 0))
12331 return fold_build2_loc (loc
, code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
, type
,
12332 arg0
, fold_convert_loc (loc
, TREE_TYPE (arg0
),
12333 integer_zero_node
));
12335 /* If we have (A & C) != 0 or (A & C) == 0 and C is the sign
12336 bit, then fold the expression into A < 0 or A >= 0. */
12337 tem
= fold_single_bit_test_into_sign_test (loc
, code
, arg0
, arg1
, type
);
12341 /* If we have (A & C) == D where D & ~C != 0, convert this into 0.
12342 Similarly for NE_EXPR. */
12343 if (TREE_CODE (arg0
) == BIT_AND_EXPR
12344 && TREE_CODE (arg1
) == INTEGER_CST
12345 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
12347 tree notc
= fold_build1_loc (loc
, BIT_NOT_EXPR
,
12348 TREE_TYPE (TREE_OPERAND (arg0
, 1)),
12349 TREE_OPERAND (arg0
, 1));
12351 = fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg0
),
12352 fold_convert_loc (loc
, TREE_TYPE (arg0
), arg1
),
12354 tree rslt
= code
== EQ_EXPR
? integer_zero_node
: integer_one_node
;
12355 if (integer_nonzerop (dandnotc
))
12356 return omit_one_operand_loc (loc
, type
, rslt
, arg0
);
12359 /* If we have (A | C) == D where C & ~D != 0, convert this into 0.
12360 Similarly for NE_EXPR. */
12361 if (TREE_CODE (arg0
) == BIT_IOR_EXPR
12362 && TREE_CODE (arg1
) == INTEGER_CST
12363 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
12365 tree notd
= fold_build1_loc (loc
, BIT_NOT_EXPR
, TREE_TYPE (arg1
), arg1
);
12367 = fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg0
),
12368 TREE_OPERAND (arg0
, 1),
12369 fold_convert_loc (loc
, TREE_TYPE (arg0
), notd
));
12370 tree rslt
= code
== EQ_EXPR
? integer_zero_node
: integer_one_node
;
12371 if (integer_nonzerop (candnotd
))
12372 return omit_one_operand_loc (loc
, type
, rslt
, arg0
);
12375 /* If this is a comparison of a field, we may be able to simplify it. */
12376 if ((TREE_CODE (arg0
) == COMPONENT_REF
12377 || TREE_CODE (arg0
) == BIT_FIELD_REF
)
12378 /* Handle the constant case even without -O
12379 to make sure the warnings are given. */
12380 && (optimize
|| TREE_CODE (arg1
) == INTEGER_CST
))
12382 t1
= optimize_bit_field_compare (loc
, code
, type
, arg0
, arg1
);
12387 /* Optimize comparisons of strlen vs zero to a compare of the
12388 first character of the string vs zero. To wit,
12389 strlen(ptr) == 0 => *ptr == 0
12390 strlen(ptr) != 0 => *ptr != 0
12391 Other cases should reduce to one of these two (or a constant)
12392 due to the return value of strlen being unsigned. */
12393 if (TREE_CODE (arg0
) == CALL_EXPR
12394 && integer_zerop (arg1
))
12396 tree fndecl
= get_callee_fndecl (arg0
);
12399 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
12400 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_STRLEN
12401 && call_expr_nargs (arg0
) == 1
12402 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (arg0
, 0))) == POINTER_TYPE
)
12404 tree iref
= build_fold_indirect_ref_loc (loc
,
12405 CALL_EXPR_ARG (arg0
, 0));
12406 return fold_build2_loc (loc
, code
, type
, iref
,
12407 build_int_cst (TREE_TYPE (iref
), 0));
12411 /* Fold (X >> C) != 0 into X < 0 if C is one less than the width
12412 of X. Similarly fold (X >> C) == 0 into X >= 0. */
12413 if (TREE_CODE (arg0
) == RSHIFT_EXPR
12414 && integer_zerop (arg1
)
12415 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
12417 tree arg00
= TREE_OPERAND (arg0
, 0);
12418 tree arg01
= TREE_OPERAND (arg0
, 1);
12419 tree itype
= TREE_TYPE (arg00
);
12420 if (wi::eq_p (arg01
, element_precision (itype
) - 1))
12422 if (TYPE_UNSIGNED (itype
))
12424 itype
= signed_type_for (itype
);
12425 arg00
= fold_convert_loc (loc
, itype
, arg00
);
12427 return fold_build2_loc (loc
, code
== EQ_EXPR
? GE_EXPR
: LT_EXPR
,
12428 type
, arg00
, build_zero_cst (itype
));
12432 /* (X ^ Y) == 0 becomes X == Y, and (X ^ Y) != 0 becomes X != Y. */
12433 if (integer_zerop (arg1
)
12434 && TREE_CODE (arg0
) == BIT_XOR_EXPR
)
12435 return fold_build2_loc (loc
, code
, type
, TREE_OPERAND (arg0
, 0),
12436 TREE_OPERAND (arg0
, 1));
12438 /* (X ^ Y) == Y becomes X == 0. We know that Y has no side-effects. */
12439 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
12440 && operand_equal_p (TREE_OPERAND (arg0
, 1), arg1
, 0))
12441 return fold_build2_loc (loc
, code
, type
, TREE_OPERAND (arg0
, 0),
12442 build_zero_cst (TREE_TYPE (arg0
)));
12443 /* Likewise (X ^ Y) == X becomes Y == 0. X has no side-effects. */
12444 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
12445 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0)
12446 && reorder_operands_p (TREE_OPERAND (arg0
, 1), arg1
))
12447 return fold_build2_loc (loc
, code
, type
, TREE_OPERAND (arg0
, 1),
12448 build_zero_cst (TREE_TYPE (arg0
)));
12450 /* (X ^ C1) op C2 can be rewritten as X op (C1 ^ C2). */
12451 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
12452 && TREE_CODE (arg1
) == INTEGER_CST
12453 && TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
)
12454 return fold_build2_loc (loc
, code
, type
, TREE_OPERAND (arg0
, 0),
12455 fold_build2_loc (loc
, BIT_XOR_EXPR
, TREE_TYPE (arg1
),
12456 TREE_OPERAND (arg0
, 1), arg1
));
12458 /* Fold (~X & C) == 0 into (X & C) != 0 and (~X & C) != 0 into
12459 (X & C) == 0 when C is a single bit. */
12460 if (TREE_CODE (arg0
) == BIT_AND_EXPR
12461 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_NOT_EXPR
12462 && integer_zerop (arg1
)
12463 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
12465 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg0
),
12466 TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0),
12467 TREE_OPERAND (arg0
, 1));
12468 return fold_build2_loc (loc
, code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
,
12470 fold_convert_loc (loc
, TREE_TYPE (arg0
),
12474 /* Fold ((X & C) ^ C) eq/ne 0 into (X & C) ne/eq 0, when the
12475 constant C is a power of two, i.e. a single bit. */
12476 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
12477 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_AND_EXPR
12478 && integer_zerop (arg1
)
12479 && integer_pow2p (TREE_OPERAND (arg0
, 1))
12480 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1),
12481 TREE_OPERAND (arg0
, 1), OEP_ONLY_CONST
))
12483 tree arg00
= TREE_OPERAND (arg0
, 0);
12484 return fold_build2_loc (loc
, code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
, type
,
12485 arg00
, build_int_cst (TREE_TYPE (arg00
), 0));
12488 /* Likewise, fold ((X ^ C) & C) eq/ne 0 into (X & C) ne/eq 0,
12489 when is C is a power of two, i.e. a single bit. */
12490 if (TREE_CODE (arg0
) == BIT_AND_EXPR
12491 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_XOR_EXPR
12492 && integer_zerop (arg1
)
12493 && integer_pow2p (TREE_OPERAND (arg0
, 1))
12494 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1),
12495 TREE_OPERAND (arg0
, 1), OEP_ONLY_CONST
))
12497 tree arg000
= TREE_OPERAND (TREE_OPERAND (arg0
, 0), 0);
12498 tem
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg000
),
12499 arg000
, TREE_OPERAND (arg0
, 1));
12500 return fold_build2_loc (loc
, code
== EQ_EXPR
? NE_EXPR
: EQ_EXPR
, type
,
12501 tem
, build_int_cst (TREE_TYPE (tem
), 0));
12504 if (integer_zerop (arg1
)
12505 && tree_expr_nonzero_p (arg0
))
12507 tree res
= constant_boolean_node (code
==NE_EXPR
, type
);
12508 return omit_one_operand_loc (loc
, type
, res
, arg0
);
12511 /* Fold -X op -Y as X op Y, where op is eq/ne. */
12512 if (TREE_CODE (arg0
) == NEGATE_EXPR
12513 && TREE_CODE (arg1
) == NEGATE_EXPR
)
12514 return fold_build2_loc (loc
, code
, type
,
12515 TREE_OPERAND (arg0
, 0),
12516 fold_convert_loc (loc
, TREE_TYPE (arg0
),
12517 TREE_OPERAND (arg1
, 0)));
12519 /* Fold (X & C) op (Y & C) as (X ^ Y) & C op 0", and symmetries. */
12520 if (TREE_CODE (arg0
) == BIT_AND_EXPR
12521 && TREE_CODE (arg1
) == BIT_AND_EXPR
)
12523 tree arg00
= TREE_OPERAND (arg0
, 0);
12524 tree arg01
= TREE_OPERAND (arg0
, 1);
12525 tree arg10
= TREE_OPERAND (arg1
, 0);
12526 tree arg11
= TREE_OPERAND (arg1
, 1);
12527 tree itype
= TREE_TYPE (arg0
);
12529 if (operand_equal_p (arg01
, arg11
, 0))
12530 return fold_build2_loc (loc
, code
, type
,
12531 fold_build2_loc (loc
, BIT_AND_EXPR
, itype
,
12532 fold_build2_loc (loc
,
12533 BIT_XOR_EXPR
, itype
,
12536 build_zero_cst (itype
));
12538 if (operand_equal_p (arg01
, arg10
, 0))
12539 return fold_build2_loc (loc
, code
, type
,
12540 fold_build2_loc (loc
, BIT_AND_EXPR
, itype
,
12541 fold_build2_loc (loc
,
12542 BIT_XOR_EXPR
, itype
,
12545 build_zero_cst (itype
));
12547 if (operand_equal_p (arg00
, arg11
, 0))
12548 return fold_build2_loc (loc
, code
, type
,
12549 fold_build2_loc (loc
, BIT_AND_EXPR
, itype
,
12550 fold_build2_loc (loc
,
12551 BIT_XOR_EXPR
, itype
,
12554 build_zero_cst (itype
));
12556 if (operand_equal_p (arg00
, arg10
, 0))
12557 return fold_build2_loc (loc
, code
, type
,
12558 fold_build2_loc (loc
, BIT_AND_EXPR
, itype
,
12559 fold_build2_loc (loc
,
12560 BIT_XOR_EXPR
, itype
,
12563 build_zero_cst (itype
));
12566 if (TREE_CODE (arg0
) == BIT_XOR_EXPR
12567 && TREE_CODE (arg1
) == BIT_XOR_EXPR
)
12569 tree arg00
= TREE_OPERAND (arg0
, 0);
12570 tree arg01
= TREE_OPERAND (arg0
, 1);
12571 tree arg10
= TREE_OPERAND (arg1
, 0);
12572 tree arg11
= TREE_OPERAND (arg1
, 1);
12573 tree itype
= TREE_TYPE (arg0
);
12575 /* Optimize (X ^ Z) op (Y ^ Z) as X op Y, and symmetries.
12576 operand_equal_p guarantees no side-effects so we don't need
12577 to use omit_one_operand on Z. */
12578 if (operand_equal_p (arg01
, arg11
, 0))
12579 return fold_build2_loc (loc
, code
, type
, arg00
,
12580 fold_convert_loc (loc
, TREE_TYPE (arg00
),
12582 if (operand_equal_p (arg01
, arg10
, 0))
12583 return fold_build2_loc (loc
, code
, type
, arg00
,
12584 fold_convert_loc (loc
, TREE_TYPE (arg00
),
12586 if (operand_equal_p (arg00
, arg11
, 0))
12587 return fold_build2_loc (loc
, code
, type
, arg01
,
12588 fold_convert_loc (loc
, TREE_TYPE (arg01
),
12590 if (operand_equal_p (arg00
, arg10
, 0))
12591 return fold_build2_loc (loc
, code
, type
, arg01
,
12592 fold_convert_loc (loc
, TREE_TYPE (arg01
),
12595 /* Optimize (X ^ C1) op (Y ^ C2) as (X ^ (C1 ^ C2)) op Y. */
12596 if (TREE_CODE (arg01
) == INTEGER_CST
12597 && TREE_CODE (arg11
) == INTEGER_CST
)
12599 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg01
,
12600 fold_convert_loc (loc
, itype
, arg11
));
12601 tem
= fold_build2_loc (loc
, BIT_XOR_EXPR
, itype
, arg00
, tem
);
12602 return fold_build2_loc (loc
, code
, type
, tem
,
12603 fold_convert_loc (loc
, itype
, arg10
));
12607 /* Attempt to simplify equality/inequality comparisons of complex
12608 values. Only lower the comparison if the result is known or
12609 can be simplified to a single scalar comparison. */
12610 if ((TREE_CODE (arg0
) == COMPLEX_EXPR
12611 || TREE_CODE (arg0
) == COMPLEX_CST
)
12612 && (TREE_CODE (arg1
) == COMPLEX_EXPR
12613 || TREE_CODE (arg1
) == COMPLEX_CST
))
12615 tree real0
, imag0
, real1
, imag1
;
12618 if (TREE_CODE (arg0
) == COMPLEX_EXPR
)
12620 real0
= TREE_OPERAND (arg0
, 0);
12621 imag0
= TREE_OPERAND (arg0
, 1);
12625 real0
= TREE_REALPART (arg0
);
12626 imag0
= TREE_IMAGPART (arg0
);
12629 if (TREE_CODE (arg1
) == COMPLEX_EXPR
)
12631 real1
= TREE_OPERAND (arg1
, 0);
12632 imag1
= TREE_OPERAND (arg1
, 1);
12636 real1
= TREE_REALPART (arg1
);
12637 imag1
= TREE_IMAGPART (arg1
);
12640 rcond
= fold_binary_loc (loc
, code
, type
, real0
, real1
);
12641 if (rcond
&& TREE_CODE (rcond
) == INTEGER_CST
)
12643 if (integer_zerop (rcond
))
12645 if (code
== EQ_EXPR
)
12646 return omit_two_operands_loc (loc
, type
, boolean_false_node
,
12648 return fold_build2_loc (loc
, NE_EXPR
, type
, imag0
, imag1
);
12652 if (code
== NE_EXPR
)
12653 return omit_two_operands_loc (loc
, type
, boolean_true_node
,
12655 return fold_build2_loc (loc
, EQ_EXPR
, type
, imag0
, imag1
);
12659 icond
= fold_binary_loc (loc
, code
, type
, imag0
, imag1
);
12660 if (icond
&& TREE_CODE (icond
) == INTEGER_CST
)
12662 if (integer_zerop (icond
))
12664 if (code
== EQ_EXPR
)
12665 return omit_two_operands_loc (loc
, type
, boolean_false_node
,
12667 return fold_build2_loc (loc
, NE_EXPR
, type
, real0
, real1
);
12671 if (code
== NE_EXPR
)
12672 return omit_two_operands_loc (loc
, type
, boolean_true_node
,
12674 return fold_build2_loc (loc
, EQ_EXPR
, type
, real0
, real1
);
12685 tem
= fold_comparison (loc
, code
, type
, op0
, op1
);
12686 if (tem
!= NULL_TREE
)
12689 /* Transform comparisons of the form X +- C CMP X. */
12690 if ((TREE_CODE (arg0
) == PLUS_EXPR
|| TREE_CODE (arg0
) == MINUS_EXPR
)
12691 && operand_equal_p (TREE_OPERAND (arg0
, 0), arg1
, 0)
12692 && ((TREE_CODE (TREE_OPERAND (arg0
, 1)) == REAL_CST
12693 && !HONOR_SNANS (arg0
))
12694 || (TREE_CODE (TREE_OPERAND (arg0
, 1)) == INTEGER_CST
12695 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))))
12697 tree arg01
= TREE_OPERAND (arg0
, 1);
12698 enum tree_code code0
= TREE_CODE (arg0
);
12701 if (TREE_CODE (arg01
) == REAL_CST
)
12702 is_positive
= REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg01
)) ? -1 : 1;
12704 is_positive
= tree_int_cst_sgn (arg01
);
12706 /* (X - c) > X becomes false. */
12707 if (code
== GT_EXPR
12708 && ((code0
== MINUS_EXPR
&& is_positive
>= 0)
12709 || (code0
== PLUS_EXPR
&& is_positive
<= 0)))
12711 if (TREE_CODE (arg01
) == INTEGER_CST
12712 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
12713 fold_overflow_warning (("assuming signed overflow does not "
12714 "occur when assuming that (X - c) > X "
12715 "is always false"),
12716 WARN_STRICT_OVERFLOW_ALL
);
12717 return constant_boolean_node (0, type
);
12720 /* Likewise (X + c) < X becomes false. */
12721 if (code
== LT_EXPR
12722 && ((code0
== PLUS_EXPR
&& is_positive
>= 0)
12723 || (code0
== MINUS_EXPR
&& is_positive
<= 0)))
12725 if (TREE_CODE (arg01
) == INTEGER_CST
12726 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
12727 fold_overflow_warning (("assuming signed overflow does not "
12728 "occur when assuming that "
12729 "(X + c) < X is always false"),
12730 WARN_STRICT_OVERFLOW_ALL
);
12731 return constant_boolean_node (0, type
);
12734 /* Convert (X - c) <= X to true. */
12735 if (!HONOR_NANS (arg1
)
12737 && ((code0
== MINUS_EXPR
&& is_positive
>= 0)
12738 || (code0
== PLUS_EXPR
&& is_positive
<= 0)))
12740 if (TREE_CODE (arg01
) == INTEGER_CST
12741 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
12742 fold_overflow_warning (("assuming signed overflow does not "
12743 "occur when assuming that "
12744 "(X - c) <= X is always true"),
12745 WARN_STRICT_OVERFLOW_ALL
);
12746 return constant_boolean_node (1, type
);
12749 /* Convert (X + c) >= X to true. */
12750 if (!HONOR_NANS (arg1
)
12752 && ((code0
== PLUS_EXPR
&& is_positive
>= 0)
12753 || (code0
== MINUS_EXPR
&& is_positive
<= 0)))
12755 if (TREE_CODE (arg01
) == INTEGER_CST
12756 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
12757 fold_overflow_warning (("assuming signed overflow does not "
12758 "occur when assuming that "
12759 "(X + c) >= X is always true"),
12760 WARN_STRICT_OVERFLOW_ALL
);
12761 return constant_boolean_node (1, type
);
12764 if (TREE_CODE (arg01
) == INTEGER_CST
)
12766 /* Convert X + c > X and X - c < X to true for integers. */
12767 if (code
== GT_EXPR
12768 && ((code0
== PLUS_EXPR
&& is_positive
> 0)
12769 || (code0
== MINUS_EXPR
&& is_positive
< 0)))
12771 if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
12772 fold_overflow_warning (("assuming signed overflow does "
12773 "not occur when assuming that "
12774 "(X + c) > X is always true"),
12775 WARN_STRICT_OVERFLOW_ALL
);
12776 return constant_boolean_node (1, type
);
12779 if (code
== LT_EXPR
12780 && ((code0
== MINUS_EXPR
&& is_positive
> 0)
12781 || (code0
== PLUS_EXPR
&& is_positive
< 0)))
12783 if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
12784 fold_overflow_warning (("assuming signed overflow does "
12785 "not occur when assuming that "
12786 "(X - c) < X is always true"),
12787 WARN_STRICT_OVERFLOW_ALL
);
12788 return constant_boolean_node (1, type
);
12791 /* Convert X + c <= X and X - c >= X to false for integers. */
12792 if (code
== LE_EXPR
12793 && ((code0
== PLUS_EXPR
&& is_positive
> 0)
12794 || (code0
== MINUS_EXPR
&& is_positive
< 0)))
12796 if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
12797 fold_overflow_warning (("assuming signed overflow does "
12798 "not occur when assuming that "
12799 "(X + c) <= X is always false"),
12800 WARN_STRICT_OVERFLOW_ALL
);
12801 return constant_boolean_node (0, type
);
12804 if (code
== GE_EXPR
12805 && ((code0
== MINUS_EXPR
&& is_positive
> 0)
12806 || (code0
== PLUS_EXPR
&& is_positive
< 0)))
12808 if (TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (arg1
)))
12809 fold_overflow_warning (("assuming signed overflow does "
12810 "not occur when assuming that "
12811 "(X - c) >= X is always false"),
12812 WARN_STRICT_OVERFLOW_ALL
);
12813 return constant_boolean_node (0, type
);
12818 /* Comparisons with the highest or lowest possible integer of
12819 the specified precision will have known values. */
12821 tree arg1_type
= TREE_TYPE (arg1
);
12822 unsigned int prec
= TYPE_PRECISION (arg1_type
);
12824 if (TREE_CODE (arg1
) == INTEGER_CST
12825 && (INTEGRAL_TYPE_P (arg1_type
) || POINTER_TYPE_P (arg1_type
)))
12827 wide_int max
= wi::max_value (arg1_type
);
12828 wide_int signed_max
= wi::max_value (prec
, SIGNED
);
12829 wide_int min
= wi::min_value (arg1_type
);
12831 if (wi::eq_p (arg1
, max
))
12835 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
12838 return fold_build2_loc (loc
, EQ_EXPR
, type
, op0
, op1
);
12841 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
12844 return fold_build2_loc (loc
, NE_EXPR
, type
, op0
, op1
);
12846 /* The GE_EXPR and LT_EXPR cases above are not normally
12847 reached because of previous transformations. */
12852 else if (wi::eq_p (arg1
, max
- 1))
12856 arg1
= const_binop (PLUS_EXPR
, arg1
,
12857 build_int_cst (TREE_TYPE (arg1
), 1));
12858 return fold_build2_loc (loc
, EQ_EXPR
, type
,
12859 fold_convert_loc (loc
,
12860 TREE_TYPE (arg1
), arg0
),
12863 arg1
= const_binop (PLUS_EXPR
, arg1
,
12864 build_int_cst (TREE_TYPE (arg1
), 1));
12865 return fold_build2_loc (loc
, NE_EXPR
, type
,
12866 fold_convert_loc (loc
, TREE_TYPE (arg1
),
12872 else if (wi::eq_p (arg1
, min
))
12876 return omit_one_operand_loc (loc
, type
, integer_zero_node
, arg0
);
12879 return fold_build2_loc (loc
, EQ_EXPR
, type
, op0
, op1
);
12882 return omit_one_operand_loc (loc
, type
, integer_one_node
, arg0
);
12885 return fold_build2_loc (loc
, NE_EXPR
, type
, op0
, op1
);
12890 else if (wi::eq_p (arg1
, min
+ 1))
12894 arg1
= const_binop (MINUS_EXPR
, arg1
,
12895 build_int_cst (TREE_TYPE (arg1
), 1));
12896 return fold_build2_loc (loc
, NE_EXPR
, type
,
12897 fold_convert_loc (loc
,
12898 TREE_TYPE (arg1
), arg0
),
12901 arg1
= const_binop (MINUS_EXPR
, arg1
,
12902 build_int_cst (TREE_TYPE (arg1
), 1));
12903 return fold_build2_loc (loc
, EQ_EXPR
, type
,
12904 fold_convert_loc (loc
, TREE_TYPE (arg1
),
12911 else if (wi::eq_p (arg1
, signed_max
)
12912 && TYPE_UNSIGNED (arg1_type
)
12913 /* We will flip the signedness of the comparison operator
12914 associated with the mode of arg1, so the sign bit is
12915 specified by this mode. Check that arg1 is the signed
12916 max associated with this sign bit. */
12917 && prec
== GET_MODE_PRECISION (TYPE_MODE (arg1_type
))
12918 /* signed_type does not work on pointer types. */
12919 && INTEGRAL_TYPE_P (arg1_type
))
12921 /* The following case also applies to X < signed_max+1
12922 and X >= signed_max+1 because previous transformations. */
12923 if (code
== LE_EXPR
|| code
== GT_EXPR
)
12925 tree st
= signed_type_for (arg1_type
);
12926 return fold_build2_loc (loc
,
12927 code
== LE_EXPR
? GE_EXPR
: LT_EXPR
,
12928 type
, fold_convert_loc (loc
, st
, arg0
),
12929 build_int_cst (st
, 0));
12935 /* If we are comparing an ABS_EXPR with a constant, we can
12936 convert all the cases into explicit comparisons, but they may
12937 well not be faster than doing the ABS and one comparison.
12938 But ABS (X) <= C is a range comparison, which becomes a subtraction
12939 and a comparison, and is probably faster. */
12940 if (code
== LE_EXPR
12941 && TREE_CODE (arg1
) == INTEGER_CST
12942 && TREE_CODE (arg0
) == ABS_EXPR
12943 && ! TREE_SIDE_EFFECTS (arg0
)
12944 && (0 != (tem
= negate_expr (arg1
)))
12945 && TREE_CODE (tem
) == INTEGER_CST
12946 && !TREE_OVERFLOW (tem
))
12947 return fold_build2_loc (loc
, TRUTH_ANDIF_EXPR
, type
,
12948 build2 (GE_EXPR
, type
,
12949 TREE_OPERAND (arg0
, 0), tem
),
12950 build2 (LE_EXPR
, type
,
12951 TREE_OPERAND (arg0
, 0), arg1
));
12953 /* Convert ABS_EXPR<x> >= 0 to true. */
12954 strict_overflow_p
= false;
12955 if (code
== GE_EXPR
12956 && (integer_zerop (arg1
)
12957 || (! HONOR_NANS (arg0
)
12958 && real_zerop (arg1
)))
12959 && tree_expr_nonnegative_warnv_p (arg0
, &strict_overflow_p
))
12961 if (strict_overflow_p
)
12962 fold_overflow_warning (("assuming signed overflow does not occur "
12963 "when simplifying comparison of "
12964 "absolute value and zero"),
12965 WARN_STRICT_OVERFLOW_CONDITIONAL
);
12966 return omit_one_operand_loc (loc
, type
,
12967 constant_boolean_node (true, type
),
12971 /* Convert ABS_EXPR<x> < 0 to false. */
12972 strict_overflow_p
= false;
12973 if (code
== LT_EXPR
12974 && (integer_zerop (arg1
) || real_zerop (arg1
))
12975 && tree_expr_nonnegative_warnv_p (arg0
, &strict_overflow_p
))
12977 if (strict_overflow_p
)
12978 fold_overflow_warning (("assuming signed overflow does not occur "
12979 "when simplifying comparison of "
12980 "absolute value and zero"),
12981 WARN_STRICT_OVERFLOW_CONDITIONAL
);
12982 return omit_one_operand_loc (loc
, type
,
12983 constant_boolean_node (false, type
),
12987 /* If X is unsigned, convert X < (1 << Y) into X >> Y == 0
12988 and similarly for >= into !=. */
12989 if ((code
== LT_EXPR
|| code
== GE_EXPR
)
12990 && TYPE_UNSIGNED (TREE_TYPE (arg0
))
12991 && TREE_CODE (arg1
) == LSHIFT_EXPR
12992 && integer_onep (TREE_OPERAND (arg1
, 0)))
12993 return build2_loc (loc
, code
== LT_EXPR
? EQ_EXPR
: NE_EXPR
, type
,
12994 build2 (RSHIFT_EXPR
, TREE_TYPE (arg0
), arg0
,
12995 TREE_OPERAND (arg1
, 1)),
12996 build_zero_cst (TREE_TYPE (arg0
)));
12998 /* Similarly for X < (cast) (1 << Y). But cast can't be narrowing,
12999 otherwise Y might be >= # of bits in X's type and thus e.g.
13000 (unsigned char) (1 << Y) for Y 15 might be 0.
13001 If the cast is widening, then 1 << Y should have unsigned type,
13002 otherwise if Y is number of bits in the signed shift type minus 1,
13003 we can't optimize this. E.g. (unsigned long long) (1 << Y) for Y
13004 31 might be 0xffffffff80000000. */
13005 if ((code
== LT_EXPR
|| code
== GE_EXPR
)
13006 && TYPE_UNSIGNED (TREE_TYPE (arg0
))
13007 && CONVERT_EXPR_P (arg1
)
13008 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == LSHIFT_EXPR
13009 && (element_precision (TREE_TYPE (arg1
))
13010 >= element_precision (TREE_TYPE (TREE_OPERAND (arg1
, 0))))
13011 && (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
13012 || (element_precision (TREE_TYPE (arg1
))
13013 == element_precision (TREE_TYPE (TREE_OPERAND (arg1
, 0)))))
13014 && integer_onep (TREE_OPERAND (TREE_OPERAND (arg1
, 0), 0)))
13016 tem
= build2 (RSHIFT_EXPR
, TREE_TYPE (arg0
), arg0
,
13017 TREE_OPERAND (TREE_OPERAND (arg1
, 0), 1));
13018 return build2_loc (loc
, code
== LT_EXPR
? EQ_EXPR
: NE_EXPR
, type
,
13019 fold_convert_loc (loc
, TREE_TYPE (arg0
), tem
),
13020 build_zero_cst (TREE_TYPE (arg0
)));
13025 case UNORDERED_EXPR
:
13033 if (TREE_CODE (arg0
) == REAL_CST
&& TREE_CODE (arg1
) == REAL_CST
)
13035 t1
= fold_relational_const (code
, type
, arg0
, arg1
);
13036 if (t1
!= NULL_TREE
)
13040 /* If the first operand is NaN, the result is constant. */
13041 if (TREE_CODE (arg0
) == REAL_CST
13042 && REAL_VALUE_ISNAN (TREE_REAL_CST (arg0
))
13043 && (code
!= LTGT_EXPR
|| ! flag_trapping_math
))
13045 t1
= (code
== ORDERED_EXPR
|| code
== LTGT_EXPR
)
13046 ? integer_zero_node
13047 : integer_one_node
;
13048 return omit_one_operand_loc (loc
, type
, t1
, arg1
);
13051 /* If the second operand is NaN, the result is constant. */
13052 if (TREE_CODE (arg1
) == REAL_CST
13053 && REAL_VALUE_ISNAN (TREE_REAL_CST (arg1
))
13054 && (code
!= LTGT_EXPR
|| ! flag_trapping_math
))
13056 t1
= (code
== ORDERED_EXPR
|| code
== LTGT_EXPR
)
13057 ? integer_zero_node
13058 : integer_one_node
;
13059 return omit_one_operand_loc (loc
, type
, t1
, arg0
);
13062 /* Simplify unordered comparison of something with itself. */
13063 if ((code
== UNLE_EXPR
|| code
== UNGE_EXPR
|| code
== UNEQ_EXPR
)
13064 && operand_equal_p (arg0
, arg1
, 0))
13065 return constant_boolean_node (1, type
);
13067 if (code
== LTGT_EXPR
13068 && !flag_trapping_math
13069 && operand_equal_p (arg0
, arg1
, 0))
13070 return constant_boolean_node (0, type
);
13072 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
13074 tree targ0
= strip_float_extensions (arg0
);
13075 tree targ1
= strip_float_extensions (arg1
);
13076 tree newtype
= TREE_TYPE (targ0
);
13078 if (TYPE_PRECISION (TREE_TYPE (targ1
)) > TYPE_PRECISION (newtype
))
13079 newtype
= TREE_TYPE (targ1
);
13081 if (TYPE_PRECISION (newtype
) < TYPE_PRECISION (TREE_TYPE (arg0
)))
13082 return fold_build2_loc (loc
, code
, type
,
13083 fold_convert_loc (loc
, newtype
, targ0
),
13084 fold_convert_loc (loc
, newtype
, targ1
));
13089 case COMPOUND_EXPR
:
13090 /* When pedantic, a compound expression can be neither an lvalue
13091 nor an integer constant expression. */
13092 if (TREE_SIDE_EFFECTS (arg0
) || TREE_CONSTANT (arg1
))
13094 /* Don't let (0, 0) be null pointer constant. */
13095 tem
= integer_zerop (arg1
) ? build1 (NOP_EXPR
, type
, arg1
)
13096 : fold_convert_loc (loc
, type
, arg1
);
13097 return pedantic_non_lvalue_loc (loc
, tem
);
13100 /* An ASSERT_EXPR should never be passed to fold_binary. */
13101 gcc_unreachable ();
13105 } /* switch (code) */
13108 /* Callback for walk_tree, looking for LABEL_EXPR. Return *TP if it is
13109 a LABEL_EXPR; otherwise return NULL_TREE. Do not check the subtrees
13113 contains_label_1 (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
13115 switch (TREE_CODE (*tp
))
13121 *walk_subtrees
= 0;
13123 /* ... fall through ... */
13130 /* Return whether the sub-tree ST contains a label which is accessible from
13131 outside the sub-tree. */
13134 contains_label_p (tree st
)
13137 (walk_tree_without_duplicates (&st
, contains_label_1
, NULL
) != NULL_TREE
);
13140 /* Fold a ternary expression of code CODE and type TYPE with operands
13141 OP0, OP1, and OP2. Return the folded expression if folding is
13142 successful. Otherwise, return NULL_TREE. */
13145 fold_ternary_loc (location_t loc
, enum tree_code code
, tree type
,
13146 tree op0
, tree op1
, tree op2
)
13149 tree arg0
= NULL_TREE
, arg1
= NULL_TREE
, arg2
= NULL_TREE
;
13150 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
13152 gcc_assert (IS_EXPR_CODE_CLASS (kind
)
13153 && TREE_CODE_LENGTH (code
) == 3);
13155 /* If this is a commutative operation, and OP0 is a constant, move it
13156 to OP1 to reduce the number of tests below. */
13157 if (commutative_ternary_tree_code (code
)
13158 && tree_swap_operands_p (op0
, op1
, true))
13159 return fold_build3_loc (loc
, code
, type
, op1
, op0
, op2
);
13161 tem
= generic_simplify (loc
, code
, type
, op0
, op1
, op2
);
13165 /* Strip any conversions that don't change the mode. This is safe
13166 for every expression, except for a comparison expression because
13167 its signedness is derived from its operands. So, in the latter
13168 case, only strip conversions that don't change the signedness.
13170 Note that this is done as an internal manipulation within the
13171 constant folder, in order to find the simplest representation of
13172 the arguments so that their form can be studied. In any cases,
13173 the appropriate type conversions should be put back in the tree
13174 that will get out of the constant folder. */
13195 case COMPONENT_REF
:
13196 if (TREE_CODE (arg0
) == CONSTRUCTOR
13197 && ! type_contains_placeholder_p (TREE_TYPE (arg0
)))
13199 unsigned HOST_WIDE_INT idx
;
13201 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg0
), idx
, field
, value
)
13208 case VEC_COND_EXPR
:
13209 /* Pedantic ANSI C says that a conditional expression is never an lvalue,
13210 so all simple results must be passed through pedantic_non_lvalue. */
13211 if (TREE_CODE (arg0
) == INTEGER_CST
)
13213 tree unused_op
= integer_zerop (arg0
) ? op1
: op2
;
13214 tem
= integer_zerop (arg0
) ? op2
: op1
;
13215 /* Only optimize constant conditions when the selected branch
13216 has the same type as the COND_EXPR. This avoids optimizing
13217 away "c ? x : throw", where the throw has a void type.
13218 Avoid throwing away that operand which contains label. */
13219 if ((!TREE_SIDE_EFFECTS (unused_op
)
13220 || !contains_label_p (unused_op
))
13221 && (! VOID_TYPE_P (TREE_TYPE (tem
))
13222 || VOID_TYPE_P (type
)))
13223 return pedantic_non_lvalue_loc (loc
, tem
);
13226 else if (TREE_CODE (arg0
) == VECTOR_CST
)
13228 if ((TREE_CODE (arg1
) == VECTOR_CST
13229 || TREE_CODE (arg1
) == CONSTRUCTOR
)
13230 && (TREE_CODE (arg2
) == VECTOR_CST
13231 || TREE_CODE (arg2
) == CONSTRUCTOR
))
13233 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (type
), i
;
13234 unsigned char *sel
= XALLOCAVEC (unsigned char, nelts
);
13235 gcc_assert (nelts
== VECTOR_CST_NELTS (arg0
));
13236 for (i
= 0; i
< nelts
; i
++)
13238 tree val
= VECTOR_CST_ELT (arg0
, i
);
13239 if (integer_all_onesp (val
))
13241 else if (integer_zerop (val
))
13242 sel
[i
] = nelts
+ i
;
13243 else /* Currently unreachable. */
13246 tree t
= fold_vec_perm (type
, arg1
, arg2
, sel
);
13247 if (t
!= NULL_TREE
)
13252 /* If we have A op B ? A : C, we may be able to convert this to a
13253 simpler expression, depending on the operation and the values
13254 of B and C. Signed zeros prevent all of these transformations,
13255 for reasons given above each one.
13257 Also try swapping the arguments and inverting the conditional. */
13258 if (COMPARISON_CLASS_P (arg0
)
13259 && operand_equal_for_comparison_p (TREE_OPERAND (arg0
, 0),
13260 arg1
, TREE_OPERAND (arg0
, 1))
13261 && !HONOR_SIGNED_ZEROS (element_mode (arg1
)))
13263 tem
= fold_cond_expr_with_comparison (loc
, type
, arg0
, op1
, op2
);
13268 if (COMPARISON_CLASS_P (arg0
)
13269 && operand_equal_for_comparison_p (TREE_OPERAND (arg0
, 0),
13271 TREE_OPERAND (arg0
, 1))
13272 && !HONOR_SIGNED_ZEROS (element_mode (op2
)))
13274 location_t loc0
= expr_location_or (arg0
, loc
);
13275 tem
= fold_invert_truthvalue (loc0
, arg0
);
13276 if (tem
&& COMPARISON_CLASS_P (tem
))
13278 tem
= fold_cond_expr_with_comparison (loc
, type
, tem
, op2
, op1
);
13284 /* If the second operand is simpler than the third, swap them
13285 since that produces better jump optimization results. */
13286 if (truth_value_p (TREE_CODE (arg0
))
13287 && tree_swap_operands_p (op1
, op2
, false))
13289 location_t loc0
= expr_location_or (arg0
, loc
);
13290 /* See if this can be inverted. If it can't, possibly because
13291 it was a floating-point inequality comparison, don't do
13293 tem
= fold_invert_truthvalue (loc0
, arg0
);
13295 return fold_build3_loc (loc
, code
, type
, tem
, op2
, op1
);
13298 /* Convert A ? 1 : 0 to simply A. */
13299 if ((code
== VEC_COND_EXPR
? integer_all_onesp (op1
)
13300 : (integer_onep (op1
)
13301 && !VECTOR_TYPE_P (type
)))
13302 && integer_zerop (op2
)
13303 /* If we try to convert OP0 to our type, the
13304 call to fold will try to move the conversion inside
13305 a COND, which will recurse. In that case, the COND_EXPR
13306 is probably the best choice, so leave it alone. */
13307 && type
== TREE_TYPE (arg0
))
13308 return pedantic_non_lvalue_loc (loc
, arg0
);
13310 /* Convert A ? 0 : 1 to !A. This prefers the use of NOT_EXPR
13311 over COND_EXPR in cases such as floating point comparisons. */
13312 if (integer_zerop (op1
)
13313 && (code
== VEC_COND_EXPR
? integer_all_onesp (op2
)
13314 : (integer_onep (op2
)
13315 && !VECTOR_TYPE_P (type
)))
13316 && truth_value_p (TREE_CODE (arg0
)))
13317 return pedantic_non_lvalue_loc (loc
,
13318 fold_convert_loc (loc
, type
,
13319 invert_truthvalue_loc (loc
,
13322 /* A < 0 ? <sign bit of A> : 0 is simply (A & <sign bit of A>). */
13323 if (TREE_CODE (arg0
) == LT_EXPR
13324 && integer_zerop (TREE_OPERAND (arg0
, 1))
13325 && integer_zerop (op2
)
13326 && (tem
= sign_bit_p (TREE_OPERAND (arg0
, 0), arg1
)))
13328 /* sign_bit_p looks through both zero and sign extensions,
13329 but for this optimization only sign extensions are
13331 tree tem2
= TREE_OPERAND (arg0
, 0);
13332 while (tem
!= tem2
)
13334 if (TREE_CODE (tem2
) != NOP_EXPR
13335 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (tem2
, 0))))
13340 tem2
= TREE_OPERAND (tem2
, 0);
13342 /* sign_bit_p only checks ARG1 bits within A's precision.
13343 If <sign bit of A> has wider type than A, bits outside
13344 of A's precision in <sign bit of A> need to be checked.
13345 If they are all 0, this optimization needs to be done
13346 in unsigned A's type, if they are all 1 in signed A's type,
13347 otherwise this can't be done. */
13349 && TYPE_PRECISION (TREE_TYPE (tem
))
13350 < TYPE_PRECISION (TREE_TYPE (arg1
))
13351 && TYPE_PRECISION (TREE_TYPE (tem
))
13352 < TYPE_PRECISION (type
))
13354 int inner_width
, outer_width
;
13357 inner_width
= TYPE_PRECISION (TREE_TYPE (tem
));
13358 outer_width
= TYPE_PRECISION (TREE_TYPE (arg1
));
13359 if (outer_width
> TYPE_PRECISION (type
))
13360 outer_width
= TYPE_PRECISION (type
);
13362 wide_int mask
= wi::shifted_mask
13363 (inner_width
, outer_width
- inner_width
, false,
13364 TYPE_PRECISION (TREE_TYPE (arg1
)));
13366 wide_int common
= mask
& arg1
;
13367 if (common
== mask
)
13369 tem_type
= signed_type_for (TREE_TYPE (tem
));
13370 tem
= fold_convert_loc (loc
, tem_type
, tem
);
13372 else if (common
== 0)
13374 tem_type
= unsigned_type_for (TREE_TYPE (tem
));
13375 tem
= fold_convert_loc (loc
, tem_type
, tem
);
13383 fold_convert_loc (loc
, type
,
13384 fold_build2_loc (loc
, BIT_AND_EXPR
,
13385 TREE_TYPE (tem
), tem
,
13386 fold_convert_loc (loc
,
13391 /* (A >> N) & 1 ? (1 << N) : 0 is simply A & (1 << N). A & 1 was
13392 already handled above. */
13393 if (TREE_CODE (arg0
) == BIT_AND_EXPR
13394 && integer_onep (TREE_OPERAND (arg0
, 1))
13395 && integer_zerop (op2
)
13396 && integer_pow2p (arg1
))
13398 tree tem
= TREE_OPERAND (arg0
, 0);
13400 if (TREE_CODE (tem
) == RSHIFT_EXPR
13401 && tree_fits_uhwi_p (TREE_OPERAND (tem
, 1))
13402 && (unsigned HOST_WIDE_INT
) tree_log2 (arg1
) ==
13403 tree_to_uhwi (TREE_OPERAND (tem
, 1)))
13404 return fold_build2_loc (loc
, BIT_AND_EXPR
, type
,
13405 TREE_OPERAND (tem
, 0), arg1
);
13408 /* A & N ? N : 0 is simply A & N if N is a power of two. This
13409 is probably obsolete because the first operand should be a
13410 truth value (that's why we have the two cases above), but let's
13411 leave it in until we can confirm this for all front-ends. */
13412 if (integer_zerop (op2
)
13413 && TREE_CODE (arg0
) == NE_EXPR
13414 && integer_zerop (TREE_OPERAND (arg0
, 1))
13415 && integer_pow2p (arg1
)
13416 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == BIT_AND_EXPR
13417 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (arg0
, 0), 1),
13418 arg1
, OEP_ONLY_CONST
))
13419 return pedantic_non_lvalue_loc (loc
,
13420 fold_convert_loc (loc
, type
,
13421 TREE_OPERAND (arg0
, 0)));
13423 /* Disable the transformations below for vectors, since
13424 fold_binary_op_with_conditional_arg may undo them immediately,
13425 yielding an infinite loop. */
13426 if (code
== VEC_COND_EXPR
)
13429 /* Convert A ? B : 0 into A && B if A and B are truth values. */
13430 if (integer_zerop (op2
)
13431 && truth_value_p (TREE_CODE (arg0
))
13432 && truth_value_p (TREE_CODE (arg1
))
13433 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
13434 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
? BIT_AND_EXPR
13435 : TRUTH_ANDIF_EXPR
,
13436 type
, fold_convert_loc (loc
, type
, arg0
), arg1
);
13438 /* Convert A ? B : 1 into !A || B if A and B are truth values. */
13439 if (code
== VEC_COND_EXPR
? integer_all_onesp (op2
) : integer_onep (op2
)
13440 && truth_value_p (TREE_CODE (arg0
))
13441 && truth_value_p (TREE_CODE (arg1
))
13442 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
13444 location_t loc0
= expr_location_or (arg0
, loc
);
13445 /* Only perform transformation if ARG0 is easily inverted. */
13446 tem
= fold_invert_truthvalue (loc0
, arg0
);
13448 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
13451 type
, fold_convert_loc (loc
, type
, tem
),
13455 /* Convert A ? 0 : B into !A && B if A and B are truth values. */
13456 if (integer_zerop (arg1
)
13457 && truth_value_p (TREE_CODE (arg0
))
13458 && truth_value_p (TREE_CODE (op2
))
13459 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
13461 location_t loc0
= expr_location_or (arg0
, loc
);
13462 /* Only perform transformation if ARG0 is easily inverted. */
13463 tem
= fold_invert_truthvalue (loc0
, arg0
);
13465 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
13466 ? BIT_AND_EXPR
: TRUTH_ANDIF_EXPR
,
13467 type
, fold_convert_loc (loc
, type
, tem
),
13471 /* Convert A ? 1 : B into A || B if A and B are truth values. */
13472 if (code
== VEC_COND_EXPR
? integer_all_onesp (arg1
) : integer_onep (arg1
)
13473 && truth_value_p (TREE_CODE (arg0
))
13474 && truth_value_p (TREE_CODE (op2
))
13475 && (code
== VEC_COND_EXPR
|| !VECTOR_TYPE_P (type
)))
13476 return fold_build2_loc (loc
, code
== VEC_COND_EXPR
13477 ? BIT_IOR_EXPR
: TRUTH_ORIF_EXPR
,
13478 type
, fold_convert_loc (loc
, type
, arg0
), op2
);
13483 /* CALL_EXPRs used to be ternary exprs. Catch any mistaken uses
13484 of fold_ternary on them. */
13485 gcc_unreachable ();
13487 case BIT_FIELD_REF
:
13488 if ((TREE_CODE (arg0
) == VECTOR_CST
13489 || (TREE_CODE (arg0
) == CONSTRUCTOR
13490 && TREE_CODE (TREE_TYPE (arg0
)) == VECTOR_TYPE
))
13491 && (type
== TREE_TYPE (TREE_TYPE (arg0
))
13492 || (TREE_CODE (type
) == VECTOR_TYPE
13493 && TREE_TYPE (type
) == TREE_TYPE (TREE_TYPE (arg0
)))))
13495 tree eltype
= TREE_TYPE (TREE_TYPE (arg0
));
13496 unsigned HOST_WIDE_INT width
= tree_to_uhwi (TYPE_SIZE (eltype
));
13497 unsigned HOST_WIDE_INT n
= tree_to_uhwi (arg1
);
13498 unsigned HOST_WIDE_INT idx
= tree_to_uhwi (op2
);
13501 && (idx
% width
) == 0
13502 && (n
% width
) == 0
13503 && ((idx
+ n
) / width
) <= TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0
)))
13508 if (TREE_CODE (arg0
) == VECTOR_CST
)
13511 return VECTOR_CST_ELT (arg0
, idx
);
13513 tree
*vals
= XALLOCAVEC (tree
, n
);
13514 for (unsigned i
= 0; i
< n
; ++i
)
13515 vals
[i
] = VECTOR_CST_ELT (arg0
, idx
+ i
);
13516 return build_vector (type
, vals
);
13519 /* Constructor elements can be subvectors. */
13520 unsigned HOST_WIDE_INT k
= 1;
13521 if (CONSTRUCTOR_NELTS (arg0
) != 0)
13523 tree cons_elem
= TREE_TYPE (CONSTRUCTOR_ELT (arg0
, 0)->value
);
13524 if (TREE_CODE (cons_elem
) == VECTOR_TYPE
)
13525 k
= TYPE_VECTOR_SUBPARTS (cons_elem
);
13528 /* We keep an exact subset of the constructor elements. */
13529 if ((idx
% k
) == 0 && (n
% k
) == 0)
13531 if (CONSTRUCTOR_NELTS (arg0
) == 0)
13532 return build_constructor (type
, NULL
);
13537 if (idx
< CONSTRUCTOR_NELTS (arg0
))
13538 return CONSTRUCTOR_ELT (arg0
, idx
)->value
;
13539 return build_zero_cst (type
);
13542 vec
<constructor_elt
, va_gc
> *vals
;
13543 vec_alloc (vals
, n
);
13544 for (unsigned i
= 0;
13545 i
< n
&& idx
+ i
< CONSTRUCTOR_NELTS (arg0
);
13547 CONSTRUCTOR_APPEND_ELT (vals
, NULL_TREE
,
13549 (arg0
, idx
+ i
)->value
);
13550 return build_constructor (type
, vals
);
13552 /* The bitfield references a single constructor element. */
13553 else if (idx
+ n
<= (idx
/ k
+ 1) * k
)
13555 if (CONSTRUCTOR_NELTS (arg0
) <= idx
/ k
)
13556 return build_zero_cst (type
);
13558 return CONSTRUCTOR_ELT (arg0
, idx
/ k
)->value
;
13560 return fold_build3_loc (loc
, code
, type
,
13561 CONSTRUCTOR_ELT (arg0
, idx
/ k
)->value
, op1
,
13562 build_int_cst (TREE_TYPE (op2
), (idx
% k
) * width
));
13567 /* A bit-field-ref that referenced the full argument can be stripped. */
13568 if (INTEGRAL_TYPE_P (TREE_TYPE (arg0
))
13569 && TYPE_PRECISION (TREE_TYPE (arg0
)) == tree_to_uhwi (arg1
)
13570 && integer_zerop (op2
))
13571 return fold_convert_loc (loc
, type
, arg0
);
13573 /* On constants we can use native encode/interpret to constant
13574 fold (nearly) all BIT_FIELD_REFs. */
13575 if (CONSTANT_CLASS_P (arg0
)
13576 && can_native_interpret_type_p (type
)
13577 && tree_fits_uhwi_p (TYPE_SIZE_UNIT (TREE_TYPE (arg0
)))
13578 /* This limitation should not be necessary, we just need to
13579 round this up to mode size. */
13580 && tree_to_uhwi (op1
) % BITS_PER_UNIT
== 0
13581 /* Need bit-shifting of the buffer to relax the following. */
13582 && tree_to_uhwi (op2
) % BITS_PER_UNIT
== 0)
13584 unsigned HOST_WIDE_INT bitpos
= tree_to_uhwi (op2
);
13585 unsigned HOST_WIDE_INT bitsize
= tree_to_uhwi (op1
);
13586 unsigned HOST_WIDE_INT clen
;
13587 clen
= tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (arg0
)));
13588 /* ??? We cannot tell native_encode_expr to start at
13589 some random byte only. So limit us to a reasonable amount
13593 unsigned char *b
= XALLOCAVEC (unsigned char, clen
);
13594 unsigned HOST_WIDE_INT len
= native_encode_expr (arg0
, b
, clen
);
13596 && len
* BITS_PER_UNIT
>= bitpos
+ bitsize
)
13598 tree v
= native_interpret_expr (type
,
13599 b
+ bitpos
/ BITS_PER_UNIT
,
13600 bitsize
/ BITS_PER_UNIT
);
13610 /* For integers we can decompose the FMA if possible. */
13611 if (TREE_CODE (arg0
) == INTEGER_CST
13612 && TREE_CODE (arg1
) == INTEGER_CST
)
13613 return fold_build2_loc (loc
, PLUS_EXPR
, type
,
13614 const_binop (MULT_EXPR
, arg0
, arg1
), arg2
);
13615 if (integer_zerop (arg2
))
13616 return fold_build2_loc (loc
, MULT_EXPR
, type
, arg0
, arg1
);
13618 return fold_fma (loc
, type
, arg0
, arg1
, arg2
);
13620 case VEC_PERM_EXPR
:
13621 if (TREE_CODE (arg2
) == VECTOR_CST
)
13623 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (type
), i
, mask
, mask2
;
13624 unsigned char *sel
= XALLOCAVEC (unsigned char, 2 * nelts
);
13625 unsigned char *sel2
= sel
+ nelts
;
13626 bool need_mask_canon
= false;
13627 bool need_mask_canon2
= false;
13628 bool all_in_vec0
= true;
13629 bool all_in_vec1
= true;
13630 bool maybe_identity
= true;
13631 bool single_arg
= (op0
== op1
);
13632 bool changed
= false;
13634 mask2
= 2 * nelts
- 1;
13635 mask
= single_arg
? (nelts
- 1) : mask2
;
13636 gcc_assert (nelts
== VECTOR_CST_NELTS (arg2
));
13637 for (i
= 0; i
< nelts
; i
++)
13639 tree val
= VECTOR_CST_ELT (arg2
, i
);
13640 if (TREE_CODE (val
) != INTEGER_CST
)
13643 /* Make sure that the perm value is in an acceptable
13646 need_mask_canon
|= wi::gtu_p (t
, mask
);
13647 need_mask_canon2
|= wi::gtu_p (t
, mask2
);
13648 sel
[i
] = t
.to_uhwi () & mask
;
13649 sel2
[i
] = t
.to_uhwi () & mask2
;
13651 if (sel
[i
] < nelts
)
13652 all_in_vec1
= false;
13654 all_in_vec0
= false;
13656 if ((sel
[i
] & (nelts
-1)) != i
)
13657 maybe_identity
= false;
13660 if (maybe_identity
)
13670 else if (all_in_vec1
)
13673 for (i
= 0; i
< nelts
; i
++)
13675 need_mask_canon
= true;
13678 if ((TREE_CODE (op0
) == VECTOR_CST
13679 || TREE_CODE (op0
) == CONSTRUCTOR
)
13680 && (TREE_CODE (op1
) == VECTOR_CST
13681 || TREE_CODE (op1
) == CONSTRUCTOR
))
13683 tree t
= fold_vec_perm (type
, op0
, op1
, sel
);
13684 if (t
!= NULL_TREE
)
13688 if (op0
== op1
&& !single_arg
)
13691 /* Some targets are deficient and fail to expand a single
13692 argument permutation while still allowing an equivalent
13693 2-argument version. */
13694 if (need_mask_canon
&& arg2
== op2
13695 && !can_vec_perm_p (TYPE_MODE (type
), false, sel
)
13696 && can_vec_perm_p (TYPE_MODE (type
), false, sel2
))
13698 need_mask_canon
= need_mask_canon2
;
13702 if (need_mask_canon
&& arg2
== op2
)
13704 tree
*tsel
= XALLOCAVEC (tree
, nelts
);
13705 tree eltype
= TREE_TYPE (TREE_TYPE (arg2
));
13706 for (i
= 0; i
< nelts
; i
++)
13707 tsel
[i
] = build_int_cst (eltype
, sel
[i
]);
13708 op2
= build_vector (TREE_TYPE (arg2
), tsel
);
13713 return build3_loc (loc
, VEC_PERM_EXPR
, type
, op0
, op1
, op2
);
13719 } /* switch (code) */
13722 /* Perform constant folding and related simplification of EXPR.
13723 The related simplifications include x*1 => x, x*0 => 0, etc.,
13724 and application of the associative law.
13725 NOP_EXPR conversions may be removed freely (as long as we
13726 are careful not to change the type of the overall expression).
13727 We cannot simplify through a CONVERT_EXPR, FIX_EXPR or FLOAT_EXPR,
13728 but we can constant-fold them if they have constant operands. */
13730 #ifdef ENABLE_FOLD_CHECKING
13731 # define fold(x) fold_1 (x)
13732 static tree
fold_1 (tree
);
13738 const tree t
= expr
;
13739 enum tree_code code
= TREE_CODE (t
);
13740 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
13742 location_t loc
= EXPR_LOCATION (expr
);
13744 /* Return right away if a constant. */
13745 if (kind
== tcc_constant
)
13748 /* CALL_EXPR-like objects with variable numbers of operands are
13749 treated specially. */
13750 if (kind
== tcc_vl_exp
)
13752 if (code
== CALL_EXPR
)
13754 tem
= fold_call_expr (loc
, expr
, false);
13755 return tem
? tem
: expr
;
13760 if (IS_EXPR_CODE_CLASS (kind
))
13762 tree type
= TREE_TYPE (t
);
13763 tree op0
, op1
, op2
;
13765 switch (TREE_CODE_LENGTH (code
))
13768 op0
= TREE_OPERAND (t
, 0);
13769 tem
= fold_unary_loc (loc
, code
, type
, op0
);
13770 return tem
? tem
: expr
;
13772 op0
= TREE_OPERAND (t
, 0);
13773 op1
= TREE_OPERAND (t
, 1);
13774 tem
= fold_binary_loc (loc
, code
, type
, op0
, op1
);
13775 return tem
? tem
: expr
;
13777 op0
= TREE_OPERAND (t
, 0);
13778 op1
= TREE_OPERAND (t
, 1);
13779 op2
= TREE_OPERAND (t
, 2);
13780 tem
= fold_ternary_loc (loc
, code
, type
, op0
, op1
, op2
);
13781 return tem
? tem
: expr
;
13791 tree op0
= TREE_OPERAND (t
, 0);
13792 tree op1
= TREE_OPERAND (t
, 1);
13794 if (TREE_CODE (op1
) == INTEGER_CST
13795 && TREE_CODE (op0
) == CONSTRUCTOR
13796 && ! type_contains_placeholder_p (TREE_TYPE (op0
)))
13798 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (op0
);
13799 unsigned HOST_WIDE_INT end
= vec_safe_length (elts
);
13800 unsigned HOST_WIDE_INT begin
= 0;
13802 /* Find a matching index by means of a binary search. */
13803 while (begin
!= end
)
13805 unsigned HOST_WIDE_INT middle
= (begin
+ end
) / 2;
13806 tree index
= (*elts
)[middle
].index
;
13808 if (TREE_CODE (index
) == INTEGER_CST
13809 && tree_int_cst_lt (index
, op1
))
13810 begin
= middle
+ 1;
13811 else if (TREE_CODE (index
) == INTEGER_CST
13812 && tree_int_cst_lt (op1
, index
))
13814 else if (TREE_CODE (index
) == RANGE_EXPR
13815 && tree_int_cst_lt (TREE_OPERAND (index
, 1), op1
))
13816 begin
= middle
+ 1;
13817 else if (TREE_CODE (index
) == RANGE_EXPR
13818 && tree_int_cst_lt (op1
, TREE_OPERAND (index
, 0)))
13821 return (*elts
)[middle
].value
;
13828 /* Return a VECTOR_CST if possible. */
13831 tree type
= TREE_TYPE (t
);
13832 if (TREE_CODE (type
) != VECTOR_TYPE
)
13835 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
13836 unsigned HOST_WIDE_INT idx
, pos
= 0;
13839 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (t
), idx
, value
)
13841 if (!CONSTANT_CLASS_P (value
))
13843 if (TREE_CODE (value
) == VECTOR_CST
)
13845 for (unsigned i
= 0; i
< VECTOR_CST_NELTS (value
); ++i
)
13846 vec
[pos
++] = VECTOR_CST_ELT (value
, i
);
13849 vec
[pos
++] = value
;
13851 for (; pos
< TYPE_VECTOR_SUBPARTS (type
); ++pos
)
13852 vec
[pos
] = build_zero_cst (TREE_TYPE (type
));
13854 return build_vector (type
, vec
);
13858 return fold (DECL_INITIAL (t
));
13862 } /* switch (code) */
13865 #ifdef ENABLE_FOLD_CHECKING
13868 static void fold_checksum_tree (const_tree
, struct md5_ctx
*,
13869 hash_table
<nofree_ptr_hash
<const tree_node
> > *);
13870 static void fold_check_failed (const_tree
, const_tree
);
13871 void print_fold_checksum (const_tree
);
13873 /* When --enable-checking=fold, compute a digest of expr before
13874 and after actual fold call to see if fold did not accidentally
13875 change original expr. */
13881 struct md5_ctx ctx
;
13882 unsigned char checksum_before
[16], checksum_after
[16];
13883 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
13885 md5_init_ctx (&ctx
);
13886 fold_checksum_tree (expr
, &ctx
, &ht
);
13887 md5_finish_ctx (&ctx
, checksum_before
);
13890 ret
= fold_1 (expr
);
13892 md5_init_ctx (&ctx
);
13893 fold_checksum_tree (expr
, &ctx
, &ht
);
13894 md5_finish_ctx (&ctx
, checksum_after
);
13896 if (memcmp (checksum_before
, checksum_after
, 16))
13897 fold_check_failed (expr
, ret
);
13903 print_fold_checksum (const_tree expr
)
13905 struct md5_ctx ctx
;
13906 unsigned char checksum
[16], cnt
;
13907 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
13909 md5_init_ctx (&ctx
);
13910 fold_checksum_tree (expr
, &ctx
, &ht
);
13911 md5_finish_ctx (&ctx
, checksum
);
13912 for (cnt
= 0; cnt
< 16; ++cnt
)
13913 fprintf (stderr
, "%02x", checksum
[cnt
]);
13914 putc ('\n', stderr
);
13918 fold_check_failed (const_tree expr ATTRIBUTE_UNUSED
, const_tree ret ATTRIBUTE_UNUSED
)
13920 internal_error ("fold check: original tree changed by fold");
13924 fold_checksum_tree (const_tree expr
, struct md5_ctx
*ctx
,
13925 hash_table
<nofree_ptr_hash
<const tree_node
> > *ht
)
13927 const tree_node
**slot
;
13928 enum tree_code code
;
13929 union tree_node buf
;
13935 slot
= ht
->find_slot (expr
, INSERT
);
13939 code
= TREE_CODE (expr
);
13940 if (TREE_CODE_CLASS (code
) == tcc_declaration
13941 && HAS_DECL_ASSEMBLER_NAME_P (expr
))
13943 /* Allow DECL_ASSEMBLER_NAME and symtab_node to be modified. */
13944 memcpy ((char *) &buf
, expr
, tree_size (expr
));
13945 SET_DECL_ASSEMBLER_NAME ((tree
)&buf
, NULL
);
13946 buf
.decl_with_vis
.symtab_node
= NULL
;
13947 expr
= (tree
) &buf
;
13949 else if (TREE_CODE_CLASS (code
) == tcc_type
13950 && (TYPE_POINTER_TO (expr
)
13951 || TYPE_REFERENCE_TO (expr
)
13952 || TYPE_CACHED_VALUES_P (expr
)
13953 || TYPE_CONTAINS_PLACEHOLDER_INTERNAL (expr
)
13954 || TYPE_NEXT_VARIANT (expr
)))
13956 /* Allow these fields to be modified. */
13958 memcpy ((char *) &buf
, expr
, tree_size (expr
));
13959 expr
= tmp
= (tree
) &buf
;
13960 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (tmp
) = 0;
13961 TYPE_POINTER_TO (tmp
) = NULL
;
13962 TYPE_REFERENCE_TO (tmp
) = NULL
;
13963 TYPE_NEXT_VARIANT (tmp
) = NULL
;
13964 if (TYPE_CACHED_VALUES_P (tmp
))
13966 TYPE_CACHED_VALUES_P (tmp
) = 0;
13967 TYPE_CACHED_VALUES (tmp
) = NULL
;
13970 md5_process_bytes (expr
, tree_size (expr
), ctx
);
13971 if (CODE_CONTAINS_STRUCT (code
, TS_TYPED
))
13972 fold_checksum_tree (TREE_TYPE (expr
), ctx
, ht
);
13973 if (TREE_CODE_CLASS (code
) != tcc_type
13974 && TREE_CODE_CLASS (code
) != tcc_declaration
13975 && code
!= TREE_LIST
13976 && code
!= SSA_NAME
13977 && CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
13978 fold_checksum_tree (TREE_CHAIN (expr
), ctx
, ht
);
13979 switch (TREE_CODE_CLASS (code
))
13985 md5_process_bytes (TREE_STRING_POINTER (expr
),
13986 TREE_STRING_LENGTH (expr
), ctx
);
13989 fold_checksum_tree (TREE_REALPART (expr
), ctx
, ht
);
13990 fold_checksum_tree (TREE_IMAGPART (expr
), ctx
, ht
);
13993 for (i
= 0; i
< (int) VECTOR_CST_NELTS (expr
); ++i
)
13994 fold_checksum_tree (VECTOR_CST_ELT (expr
, i
), ctx
, ht
);
14000 case tcc_exceptional
:
14004 fold_checksum_tree (TREE_PURPOSE (expr
), ctx
, ht
);
14005 fold_checksum_tree (TREE_VALUE (expr
), ctx
, ht
);
14006 expr
= TREE_CHAIN (expr
);
14007 goto recursive_label
;
14010 for (i
= 0; i
< TREE_VEC_LENGTH (expr
); ++i
)
14011 fold_checksum_tree (TREE_VEC_ELT (expr
, i
), ctx
, ht
);
14017 case tcc_expression
:
14018 case tcc_reference
:
14019 case tcc_comparison
:
14022 case tcc_statement
:
14024 len
= TREE_OPERAND_LENGTH (expr
);
14025 for (i
= 0; i
< len
; ++i
)
14026 fold_checksum_tree (TREE_OPERAND (expr
, i
), ctx
, ht
);
14028 case tcc_declaration
:
14029 fold_checksum_tree (DECL_NAME (expr
), ctx
, ht
);
14030 fold_checksum_tree (DECL_CONTEXT (expr
), ctx
, ht
);
14031 if (CODE_CONTAINS_STRUCT (TREE_CODE (expr
), TS_DECL_COMMON
))
14033 fold_checksum_tree (DECL_SIZE (expr
), ctx
, ht
);
14034 fold_checksum_tree (DECL_SIZE_UNIT (expr
), ctx
, ht
);
14035 fold_checksum_tree (DECL_INITIAL (expr
), ctx
, ht
);
14036 fold_checksum_tree (DECL_ABSTRACT_ORIGIN (expr
), ctx
, ht
);
14037 fold_checksum_tree (DECL_ATTRIBUTES (expr
), ctx
, ht
);
14040 if (CODE_CONTAINS_STRUCT (TREE_CODE (expr
), TS_DECL_NON_COMMON
))
14042 if (TREE_CODE (expr
) == FUNCTION_DECL
)
14044 fold_checksum_tree (DECL_VINDEX (expr
), ctx
, ht
);
14045 fold_checksum_tree (DECL_ARGUMENTS (expr
), ctx
, ht
);
14047 fold_checksum_tree (DECL_RESULT_FLD (expr
), ctx
, ht
);
14051 if (TREE_CODE (expr
) == ENUMERAL_TYPE
)
14052 fold_checksum_tree (TYPE_VALUES (expr
), ctx
, ht
);
14053 fold_checksum_tree (TYPE_SIZE (expr
), ctx
, ht
);
14054 fold_checksum_tree (TYPE_SIZE_UNIT (expr
), ctx
, ht
);
14055 fold_checksum_tree (TYPE_ATTRIBUTES (expr
), ctx
, ht
);
14056 fold_checksum_tree (TYPE_NAME (expr
), ctx
, ht
);
14057 if (INTEGRAL_TYPE_P (expr
)
14058 || SCALAR_FLOAT_TYPE_P (expr
))
14060 fold_checksum_tree (TYPE_MIN_VALUE (expr
), ctx
, ht
);
14061 fold_checksum_tree (TYPE_MAX_VALUE (expr
), ctx
, ht
);
14063 fold_checksum_tree (TYPE_MAIN_VARIANT (expr
), ctx
, ht
);
14064 if (TREE_CODE (expr
) == RECORD_TYPE
14065 || TREE_CODE (expr
) == UNION_TYPE
14066 || TREE_CODE (expr
) == QUAL_UNION_TYPE
)
14067 fold_checksum_tree (TYPE_BINFO (expr
), ctx
, ht
);
14068 fold_checksum_tree (TYPE_CONTEXT (expr
), ctx
, ht
);
14075 /* Helper function for outputting the checksum of a tree T. When
14076 debugging with gdb, you can "define mynext" to be "next" followed
14077 by "call debug_fold_checksum (op0)", then just trace down till the
14080 DEBUG_FUNCTION
void
14081 debug_fold_checksum (const_tree t
)
14084 unsigned char checksum
[16];
14085 struct md5_ctx ctx
;
14086 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
14088 md5_init_ctx (&ctx
);
14089 fold_checksum_tree (t
, &ctx
, &ht
);
14090 md5_finish_ctx (&ctx
, checksum
);
14093 for (i
= 0; i
< 16; i
++)
14094 fprintf (stderr
, "%d ", checksum
[i
]);
14096 fprintf (stderr
, "\n");
14101 /* Fold a unary tree expression with code CODE of type TYPE with an
14102 operand OP0. LOC is the location of the resulting expression.
14103 Return a folded expression if successful. Otherwise, return a tree
14104 expression with code CODE of type TYPE with an operand OP0. */
14107 fold_build1_stat_loc (location_t loc
,
14108 enum tree_code code
, tree type
, tree op0 MEM_STAT_DECL
)
14111 #ifdef ENABLE_FOLD_CHECKING
14112 unsigned char checksum_before
[16], checksum_after
[16];
14113 struct md5_ctx ctx
;
14114 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
14116 md5_init_ctx (&ctx
);
14117 fold_checksum_tree (op0
, &ctx
, &ht
);
14118 md5_finish_ctx (&ctx
, checksum_before
);
14122 tem
= fold_unary_loc (loc
, code
, type
, op0
);
14124 tem
= build1_stat_loc (loc
, code
, type
, op0 PASS_MEM_STAT
);
14126 #ifdef ENABLE_FOLD_CHECKING
14127 md5_init_ctx (&ctx
);
14128 fold_checksum_tree (op0
, &ctx
, &ht
);
14129 md5_finish_ctx (&ctx
, checksum_after
);
14131 if (memcmp (checksum_before
, checksum_after
, 16))
14132 fold_check_failed (op0
, tem
);
14137 /* Fold a binary tree expression with code CODE of type TYPE with
14138 operands OP0 and OP1. LOC is the location of the resulting
14139 expression. Return a folded expression if successful. Otherwise,
14140 return a tree expression with code CODE of type TYPE with operands
14144 fold_build2_stat_loc (location_t loc
,
14145 enum tree_code code
, tree type
, tree op0
, tree op1
14149 #ifdef ENABLE_FOLD_CHECKING
14150 unsigned char checksum_before_op0
[16],
14151 checksum_before_op1
[16],
14152 checksum_after_op0
[16],
14153 checksum_after_op1
[16];
14154 struct md5_ctx ctx
;
14155 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
14157 md5_init_ctx (&ctx
);
14158 fold_checksum_tree (op0
, &ctx
, &ht
);
14159 md5_finish_ctx (&ctx
, checksum_before_op0
);
14162 md5_init_ctx (&ctx
);
14163 fold_checksum_tree (op1
, &ctx
, &ht
);
14164 md5_finish_ctx (&ctx
, checksum_before_op1
);
14168 tem
= fold_binary_loc (loc
, code
, type
, op0
, op1
);
14170 tem
= build2_stat_loc (loc
, code
, type
, op0
, op1 PASS_MEM_STAT
);
14172 #ifdef ENABLE_FOLD_CHECKING
14173 md5_init_ctx (&ctx
);
14174 fold_checksum_tree (op0
, &ctx
, &ht
);
14175 md5_finish_ctx (&ctx
, checksum_after_op0
);
14178 if (memcmp (checksum_before_op0
, checksum_after_op0
, 16))
14179 fold_check_failed (op0
, tem
);
14181 md5_init_ctx (&ctx
);
14182 fold_checksum_tree (op1
, &ctx
, &ht
);
14183 md5_finish_ctx (&ctx
, checksum_after_op1
);
14185 if (memcmp (checksum_before_op1
, checksum_after_op1
, 16))
14186 fold_check_failed (op1
, tem
);
14191 /* Fold a ternary tree expression with code CODE of type TYPE with
14192 operands OP0, OP1, and OP2. Return a folded expression if
14193 successful. Otherwise, return a tree expression with code CODE of
14194 type TYPE with operands OP0, OP1, and OP2. */
14197 fold_build3_stat_loc (location_t loc
, enum tree_code code
, tree type
,
14198 tree op0
, tree op1
, tree op2 MEM_STAT_DECL
)
14201 #ifdef ENABLE_FOLD_CHECKING
14202 unsigned char checksum_before_op0
[16],
14203 checksum_before_op1
[16],
14204 checksum_before_op2
[16],
14205 checksum_after_op0
[16],
14206 checksum_after_op1
[16],
14207 checksum_after_op2
[16];
14208 struct md5_ctx ctx
;
14209 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
14211 md5_init_ctx (&ctx
);
14212 fold_checksum_tree (op0
, &ctx
, &ht
);
14213 md5_finish_ctx (&ctx
, checksum_before_op0
);
14216 md5_init_ctx (&ctx
);
14217 fold_checksum_tree (op1
, &ctx
, &ht
);
14218 md5_finish_ctx (&ctx
, checksum_before_op1
);
14221 md5_init_ctx (&ctx
);
14222 fold_checksum_tree (op2
, &ctx
, &ht
);
14223 md5_finish_ctx (&ctx
, checksum_before_op2
);
14227 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
14228 tem
= fold_ternary_loc (loc
, code
, type
, op0
, op1
, op2
);
14230 tem
= build3_stat_loc (loc
, code
, type
, op0
, op1
, op2 PASS_MEM_STAT
);
14232 #ifdef ENABLE_FOLD_CHECKING
14233 md5_init_ctx (&ctx
);
14234 fold_checksum_tree (op0
, &ctx
, &ht
);
14235 md5_finish_ctx (&ctx
, checksum_after_op0
);
14238 if (memcmp (checksum_before_op0
, checksum_after_op0
, 16))
14239 fold_check_failed (op0
, tem
);
14241 md5_init_ctx (&ctx
);
14242 fold_checksum_tree (op1
, &ctx
, &ht
);
14243 md5_finish_ctx (&ctx
, checksum_after_op1
);
14246 if (memcmp (checksum_before_op1
, checksum_after_op1
, 16))
14247 fold_check_failed (op1
, tem
);
14249 md5_init_ctx (&ctx
);
14250 fold_checksum_tree (op2
, &ctx
, &ht
);
14251 md5_finish_ctx (&ctx
, checksum_after_op2
);
14253 if (memcmp (checksum_before_op2
, checksum_after_op2
, 16))
14254 fold_check_failed (op2
, tem
);
14259 /* Fold a CALL_EXPR expression of type TYPE with operands FN and NARGS
14260 arguments in ARGARRAY, and a null static chain.
14261 Return a folded expression if successful. Otherwise, return a CALL_EXPR
14262 of type TYPE from the given operands as constructed by build_call_array. */
14265 fold_build_call_array_loc (location_t loc
, tree type
, tree fn
,
14266 int nargs
, tree
*argarray
)
14269 #ifdef ENABLE_FOLD_CHECKING
14270 unsigned char checksum_before_fn
[16],
14271 checksum_before_arglist
[16],
14272 checksum_after_fn
[16],
14273 checksum_after_arglist
[16];
14274 struct md5_ctx ctx
;
14275 hash_table
<nofree_ptr_hash
<const tree_node
> > ht (32);
14278 md5_init_ctx (&ctx
);
14279 fold_checksum_tree (fn
, &ctx
, &ht
);
14280 md5_finish_ctx (&ctx
, checksum_before_fn
);
14283 md5_init_ctx (&ctx
);
14284 for (i
= 0; i
< nargs
; i
++)
14285 fold_checksum_tree (argarray
[i
], &ctx
, &ht
);
14286 md5_finish_ctx (&ctx
, checksum_before_arglist
);
14290 tem
= fold_builtin_call_array (loc
, type
, fn
, nargs
, argarray
);
14292 tem
= build_call_array_loc (loc
, type
, fn
, nargs
, argarray
);
14294 #ifdef ENABLE_FOLD_CHECKING
14295 md5_init_ctx (&ctx
);
14296 fold_checksum_tree (fn
, &ctx
, &ht
);
14297 md5_finish_ctx (&ctx
, checksum_after_fn
);
14300 if (memcmp (checksum_before_fn
, checksum_after_fn
, 16))
14301 fold_check_failed (fn
, tem
);
14303 md5_init_ctx (&ctx
);
14304 for (i
= 0; i
< nargs
; i
++)
14305 fold_checksum_tree (argarray
[i
], &ctx
, &ht
);
14306 md5_finish_ctx (&ctx
, checksum_after_arglist
);
14308 if (memcmp (checksum_before_arglist
, checksum_after_arglist
, 16))
14309 fold_check_failed (NULL_TREE
, tem
);
14314 /* Perform constant folding and related simplification of initializer
14315 expression EXPR. These behave identically to "fold_buildN" but ignore
14316 potential run-time traps and exceptions that fold must preserve. */
14318 #define START_FOLD_INIT \
14319 int saved_signaling_nans = flag_signaling_nans;\
14320 int saved_trapping_math = flag_trapping_math;\
14321 int saved_rounding_math = flag_rounding_math;\
14322 int saved_trapv = flag_trapv;\
14323 int saved_folding_initializer = folding_initializer;\
14324 flag_signaling_nans = 0;\
14325 flag_trapping_math = 0;\
14326 flag_rounding_math = 0;\
14328 folding_initializer = 1;
14330 #define END_FOLD_INIT \
14331 flag_signaling_nans = saved_signaling_nans;\
14332 flag_trapping_math = saved_trapping_math;\
14333 flag_rounding_math = saved_rounding_math;\
14334 flag_trapv = saved_trapv;\
14335 folding_initializer = saved_folding_initializer;
14338 fold_build1_initializer_loc (location_t loc
, enum tree_code code
,
14339 tree type
, tree op
)
14344 result
= fold_build1_loc (loc
, code
, type
, op
);
14351 fold_build2_initializer_loc (location_t loc
, enum tree_code code
,
14352 tree type
, tree op0
, tree op1
)
14357 result
= fold_build2_loc (loc
, code
, type
, op0
, op1
);
14364 fold_build_call_array_initializer_loc (location_t loc
, tree type
, tree fn
,
14365 int nargs
, tree
*argarray
)
14370 result
= fold_build_call_array_loc (loc
, type
, fn
, nargs
, argarray
);
14376 #undef START_FOLD_INIT
14377 #undef END_FOLD_INIT
14379 /* Determine if first argument is a multiple of second argument. Return 0 if
14380 it is not, or we cannot easily determined it to be.
14382 An example of the sort of thing we care about (at this point; this routine
14383 could surely be made more general, and expanded to do what the *_DIV_EXPR's
14384 fold cases do now) is discovering that
14386 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
14392 when we know that the two SAVE_EXPR (J * 8) nodes are the same node.
14394 This code also handles discovering that
14396 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
14398 is a multiple of 8 so we don't have to worry about dealing with a
14399 possible remainder.
14401 Note that we *look* inside a SAVE_EXPR only to determine how it was
14402 calculated; it is not safe for fold to do much of anything else with the
14403 internals of a SAVE_EXPR, since it cannot know when it will be evaluated
14404 at run time. For example, the latter example above *cannot* be implemented
14405 as SAVE_EXPR (I) * J or any variant thereof, since the value of J at
14406 evaluation time of the original SAVE_EXPR is not necessarily the same at
14407 the time the new expression is evaluated. The only optimization of this
14408 sort that would be valid is changing
14410 SAVE_EXPR (I) * SAVE_EXPR (SAVE_EXPR (J) * 8)
14414 SAVE_EXPR (I) * SAVE_EXPR (J)
14416 (where the same SAVE_EXPR (J) is used in the original and the
14417 transformed version). */
14420 multiple_of_p (tree type
, const_tree top
, const_tree bottom
)
14422 if (operand_equal_p (top
, bottom
, 0))
14425 if (TREE_CODE (type
) != INTEGER_TYPE
)
14428 switch (TREE_CODE (top
))
14431 /* Bitwise and provides a power of two multiple. If the mask is
14432 a multiple of BOTTOM then TOP is a multiple of BOTTOM. */
14433 if (!integer_pow2p (bottom
))
14438 return (multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
)
14439 || multiple_of_p (type
, TREE_OPERAND (top
, 1), bottom
));
14443 return (multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
)
14444 && multiple_of_p (type
, TREE_OPERAND (top
, 1), bottom
));
14447 if (TREE_CODE (TREE_OPERAND (top
, 1)) == INTEGER_CST
)
14451 op1
= TREE_OPERAND (top
, 1);
14452 /* const_binop may not detect overflow correctly,
14453 so check for it explicitly here. */
14454 if (wi::gtu_p (TYPE_PRECISION (TREE_TYPE (size_one_node
)), op1
)
14455 && 0 != (t1
= fold_convert (type
,
14456 const_binop (LSHIFT_EXPR
,
14459 && !TREE_OVERFLOW (t1
))
14460 return multiple_of_p (type
, t1
, bottom
);
14465 /* Can't handle conversions from non-integral or wider integral type. */
14466 if ((TREE_CODE (TREE_TYPE (TREE_OPERAND (top
, 0))) != INTEGER_TYPE
)
14467 || (TYPE_PRECISION (type
)
14468 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (top
, 0)))))
14471 /* .. fall through ... */
14474 return multiple_of_p (type
, TREE_OPERAND (top
, 0), bottom
);
14477 return (multiple_of_p (type
, TREE_OPERAND (top
, 1), bottom
)
14478 && multiple_of_p (type
, TREE_OPERAND (top
, 2), bottom
));
14481 if (TREE_CODE (bottom
) != INTEGER_CST
14482 || integer_zerop (bottom
)
14483 || (TYPE_UNSIGNED (type
)
14484 && (tree_int_cst_sgn (top
) < 0
14485 || tree_int_cst_sgn (bottom
) < 0)))
14487 return wi::multiple_of_p (wi::to_widest (top
), wi::to_widest (bottom
),
14495 /* Return true if CODE or TYPE is known to be non-negative. */
14498 tree_simple_nonnegative_warnv_p (enum tree_code code
, tree type
)
14500 if ((TYPE_PRECISION (type
) != 1 || TYPE_UNSIGNED (type
))
14501 && truth_value_p (code
))
14502 /* Truth values evaluate to 0 or 1, which is nonnegative unless we
14503 have a signed:1 type (where the value is -1 and 0). */
14508 /* Return true if (CODE OP0) is known to be non-negative. If the return
14509 value is based on the assumption that signed overflow is undefined,
14510 set *STRICT_OVERFLOW_P to true; otherwise, don't change
14511 *STRICT_OVERFLOW_P. */
14514 tree_unary_nonnegative_warnv_p (enum tree_code code
, tree type
, tree op0
,
14515 bool *strict_overflow_p
)
14517 if (TYPE_UNSIGNED (type
))
14523 /* We can't return 1 if flag_wrapv is set because
14524 ABS_EXPR<INT_MIN> = INT_MIN. */
14525 if (!ANY_INTEGRAL_TYPE_P (type
))
14527 if (TYPE_OVERFLOW_UNDEFINED (type
))
14529 *strict_overflow_p
= true;
14534 case NON_LVALUE_EXPR
:
14536 case FIX_TRUNC_EXPR
:
14537 return tree_expr_nonnegative_warnv_p (op0
,
14538 strict_overflow_p
);
14542 tree inner_type
= TREE_TYPE (op0
);
14543 tree outer_type
= type
;
14545 if (TREE_CODE (outer_type
) == REAL_TYPE
)
14547 if (TREE_CODE (inner_type
) == REAL_TYPE
)
14548 return tree_expr_nonnegative_warnv_p (op0
,
14549 strict_overflow_p
);
14550 if (INTEGRAL_TYPE_P (inner_type
))
14552 if (TYPE_UNSIGNED (inner_type
))
14554 return tree_expr_nonnegative_warnv_p (op0
,
14555 strict_overflow_p
);
14558 else if (INTEGRAL_TYPE_P (outer_type
))
14560 if (TREE_CODE (inner_type
) == REAL_TYPE
)
14561 return tree_expr_nonnegative_warnv_p (op0
,
14562 strict_overflow_p
);
14563 if (INTEGRAL_TYPE_P (inner_type
))
14564 return TYPE_PRECISION (inner_type
) < TYPE_PRECISION (outer_type
)
14565 && TYPE_UNSIGNED (inner_type
);
14571 return tree_simple_nonnegative_warnv_p (code
, type
);
14574 /* We don't know sign of `t', so be conservative and return false. */
14578 /* Return true if (CODE OP0 OP1) is known to be non-negative. If the return
14579 value is based on the assumption that signed overflow is undefined,
14580 set *STRICT_OVERFLOW_P to true; otherwise, don't change
14581 *STRICT_OVERFLOW_P. */
14584 tree_binary_nonnegative_warnv_p (enum tree_code code
, tree type
, tree op0
,
14585 tree op1
, bool *strict_overflow_p
)
14587 if (TYPE_UNSIGNED (type
))
14592 case POINTER_PLUS_EXPR
:
14594 if (FLOAT_TYPE_P (type
))
14595 return (tree_expr_nonnegative_warnv_p (op0
,
14597 && tree_expr_nonnegative_warnv_p (op1
,
14598 strict_overflow_p
));
14600 /* zero_extend(x) + zero_extend(y) is non-negative if x and y are
14601 both unsigned and at least 2 bits shorter than the result. */
14602 if (TREE_CODE (type
) == INTEGER_TYPE
14603 && TREE_CODE (op0
) == NOP_EXPR
14604 && TREE_CODE (op1
) == NOP_EXPR
)
14606 tree inner1
= TREE_TYPE (TREE_OPERAND (op0
, 0));
14607 tree inner2
= TREE_TYPE (TREE_OPERAND (op1
, 0));
14608 if (TREE_CODE (inner1
) == INTEGER_TYPE
&& TYPE_UNSIGNED (inner1
)
14609 && TREE_CODE (inner2
) == INTEGER_TYPE
&& TYPE_UNSIGNED (inner2
))
14611 unsigned int prec
= MAX (TYPE_PRECISION (inner1
),
14612 TYPE_PRECISION (inner2
)) + 1;
14613 return prec
< TYPE_PRECISION (type
);
14619 if (FLOAT_TYPE_P (type
) || TYPE_OVERFLOW_UNDEFINED (type
))
14621 /* x * x is always non-negative for floating point x
14622 or without overflow. */
14623 if (operand_equal_p (op0
, op1
, 0)
14624 || (tree_expr_nonnegative_warnv_p (op0
, strict_overflow_p
)
14625 && tree_expr_nonnegative_warnv_p (op1
, strict_overflow_p
)))
14627 if (ANY_INTEGRAL_TYPE_P (type
)
14628 && TYPE_OVERFLOW_UNDEFINED (type
))
14629 *strict_overflow_p
= true;
14634 /* zero_extend(x) * zero_extend(y) is non-negative if x and y are
14635 both unsigned and their total bits is shorter than the result. */
14636 if (TREE_CODE (type
) == INTEGER_TYPE
14637 && (TREE_CODE (op0
) == NOP_EXPR
|| TREE_CODE (op0
) == INTEGER_CST
)
14638 && (TREE_CODE (op1
) == NOP_EXPR
|| TREE_CODE (op1
) == INTEGER_CST
))
14640 tree inner0
= (TREE_CODE (op0
) == NOP_EXPR
)
14641 ? TREE_TYPE (TREE_OPERAND (op0
, 0))
14643 tree inner1
= (TREE_CODE (op1
) == NOP_EXPR
)
14644 ? TREE_TYPE (TREE_OPERAND (op1
, 0))
14647 bool unsigned0
= TYPE_UNSIGNED (inner0
);
14648 bool unsigned1
= TYPE_UNSIGNED (inner1
);
14650 if (TREE_CODE (op0
) == INTEGER_CST
)
14651 unsigned0
= unsigned0
|| tree_int_cst_sgn (op0
) >= 0;
14653 if (TREE_CODE (op1
) == INTEGER_CST
)
14654 unsigned1
= unsigned1
|| tree_int_cst_sgn (op1
) >= 0;
14656 if (TREE_CODE (inner0
) == INTEGER_TYPE
&& unsigned0
14657 && TREE_CODE (inner1
) == INTEGER_TYPE
&& unsigned1
)
14659 unsigned int precision0
= (TREE_CODE (op0
) == INTEGER_CST
)
14660 ? tree_int_cst_min_precision (op0
, UNSIGNED
)
14661 : TYPE_PRECISION (inner0
);
14663 unsigned int precision1
= (TREE_CODE (op1
) == INTEGER_CST
)
14664 ? tree_int_cst_min_precision (op1
, UNSIGNED
)
14665 : TYPE_PRECISION (inner1
);
14667 return precision0
+ precision1
< TYPE_PRECISION (type
);
14674 return (tree_expr_nonnegative_warnv_p (op0
,
14676 || tree_expr_nonnegative_warnv_p (op1
,
14677 strict_overflow_p
));
14683 case TRUNC_DIV_EXPR
:
14684 case CEIL_DIV_EXPR
:
14685 case FLOOR_DIV_EXPR
:
14686 case ROUND_DIV_EXPR
:
14687 return (tree_expr_nonnegative_warnv_p (op0
,
14689 && tree_expr_nonnegative_warnv_p (op1
,
14690 strict_overflow_p
));
14692 case TRUNC_MOD_EXPR
:
14693 case CEIL_MOD_EXPR
:
14694 case FLOOR_MOD_EXPR
:
14695 case ROUND_MOD_EXPR
:
14696 return tree_expr_nonnegative_warnv_p (op0
,
14697 strict_overflow_p
);
14699 return tree_simple_nonnegative_warnv_p (code
, type
);
14702 /* We don't know sign of `t', so be conservative and return false. */
14706 /* Return true if T is known to be non-negative. If the return
14707 value is based on the assumption that signed overflow is undefined,
14708 set *STRICT_OVERFLOW_P to true; otherwise, don't change
14709 *STRICT_OVERFLOW_P. */
14712 tree_single_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
)
14714 if (TYPE_UNSIGNED (TREE_TYPE (t
)))
14717 switch (TREE_CODE (t
))
14720 return tree_int_cst_sgn (t
) >= 0;
14723 return ! REAL_VALUE_NEGATIVE (TREE_REAL_CST (t
));
14726 return ! FIXED_VALUE_NEGATIVE (TREE_FIXED_CST (t
));
14729 return (tree_expr_nonnegative_warnv_p (TREE_OPERAND (t
, 1),
14731 && tree_expr_nonnegative_warnv_p (TREE_OPERAND (t
, 2),
14732 strict_overflow_p
));
14734 return tree_simple_nonnegative_warnv_p (TREE_CODE (t
),
14737 /* We don't know sign of `t', so be conservative and return false. */
14741 /* Return true if T is known to be non-negative. If the return
14742 value is based on the assumption that signed overflow is undefined,
14743 set *STRICT_OVERFLOW_P to true; otherwise, don't change
14744 *STRICT_OVERFLOW_P. */
14747 tree_call_nonnegative_warnv_p (tree type
, tree fndecl
,
14748 tree arg0
, tree arg1
, bool *strict_overflow_p
)
14750 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
14751 switch (DECL_FUNCTION_CODE (fndecl
))
14753 CASE_FLT_FN (BUILT_IN_ACOS
):
14754 CASE_FLT_FN (BUILT_IN_ACOSH
):
14755 CASE_FLT_FN (BUILT_IN_CABS
):
14756 CASE_FLT_FN (BUILT_IN_COSH
):
14757 CASE_FLT_FN (BUILT_IN_ERFC
):
14758 CASE_FLT_FN (BUILT_IN_EXP
):
14759 CASE_FLT_FN (BUILT_IN_EXP10
):
14760 CASE_FLT_FN (BUILT_IN_EXP2
):
14761 CASE_FLT_FN (BUILT_IN_FABS
):
14762 CASE_FLT_FN (BUILT_IN_FDIM
):
14763 CASE_FLT_FN (BUILT_IN_HYPOT
):
14764 CASE_FLT_FN (BUILT_IN_POW10
):
14765 CASE_INT_FN (BUILT_IN_FFS
):
14766 CASE_INT_FN (BUILT_IN_PARITY
):
14767 CASE_INT_FN (BUILT_IN_POPCOUNT
):
14768 CASE_INT_FN (BUILT_IN_CLZ
):
14769 CASE_INT_FN (BUILT_IN_CLRSB
):
14770 case BUILT_IN_BSWAP32
:
14771 case BUILT_IN_BSWAP64
:
14775 CASE_FLT_FN (BUILT_IN_SQRT
):
14776 /* sqrt(-0.0) is -0.0. */
14777 if (!HONOR_SIGNED_ZEROS (element_mode (type
)))
14779 return tree_expr_nonnegative_warnv_p (arg0
,
14780 strict_overflow_p
);
14782 CASE_FLT_FN (BUILT_IN_ASINH
):
14783 CASE_FLT_FN (BUILT_IN_ATAN
):
14784 CASE_FLT_FN (BUILT_IN_ATANH
):
14785 CASE_FLT_FN (BUILT_IN_CBRT
):
14786 CASE_FLT_FN (BUILT_IN_CEIL
):
14787 CASE_FLT_FN (BUILT_IN_ERF
):
14788 CASE_FLT_FN (BUILT_IN_EXPM1
):
14789 CASE_FLT_FN (BUILT_IN_FLOOR
):
14790 CASE_FLT_FN (BUILT_IN_FMOD
):
14791 CASE_FLT_FN (BUILT_IN_FREXP
):
14792 CASE_FLT_FN (BUILT_IN_ICEIL
):
14793 CASE_FLT_FN (BUILT_IN_IFLOOR
):
14794 CASE_FLT_FN (BUILT_IN_IRINT
):
14795 CASE_FLT_FN (BUILT_IN_IROUND
):
14796 CASE_FLT_FN (BUILT_IN_LCEIL
):
14797 CASE_FLT_FN (BUILT_IN_LDEXP
):
14798 CASE_FLT_FN (BUILT_IN_LFLOOR
):
14799 CASE_FLT_FN (BUILT_IN_LLCEIL
):
14800 CASE_FLT_FN (BUILT_IN_LLFLOOR
):
14801 CASE_FLT_FN (BUILT_IN_LLRINT
):
14802 CASE_FLT_FN (BUILT_IN_LLROUND
):
14803 CASE_FLT_FN (BUILT_IN_LRINT
):
14804 CASE_FLT_FN (BUILT_IN_LROUND
):
14805 CASE_FLT_FN (BUILT_IN_MODF
):
14806 CASE_FLT_FN (BUILT_IN_NEARBYINT
):
14807 CASE_FLT_FN (BUILT_IN_RINT
):
14808 CASE_FLT_FN (BUILT_IN_ROUND
):
14809 CASE_FLT_FN (BUILT_IN_SCALB
):
14810 CASE_FLT_FN (BUILT_IN_SCALBLN
):
14811 CASE_FLT_FN (BUILT_IN_SCALBN
):
14812 CASE_FLT_FN (BUILT_IN_SIGNBIT
):
14813 CASE_FLT_FN (BUILT_IN_SIGNIFICAND
):
14814 CASE_FLT_FN (BUILT_IN_SINH
):
14815 CASE_FLT_FN (BUILT_IN_TANH
):
14816 CASE_FLT_FN (BUILT_IN_TRUNC
):
14817 /* True if the 1st argument is nonnegative. */
14818 return tree_expr_nonnegative_warnv_p (arg0
,
14819 strict_overflow_p
);
14821 CASE_FLT_FN (BUILT_IN_FMAX
):
14822 /* True if the 1st OR 2nd arguments are nonnegative. */
14823 return (tree_expr_nonnegative_warnv_p (arg0
,
14825 || (tree_expr_nonnegative_warnv_p (arg1
,
14826 strict_overflow_p
)));
14828 CASE_FLT_FN (BUILT_IN_FMIN
):
14829 /* True if the 1st AND 2nd arguments are nonnegative. */
14830 return (tree_expr_nonnegative_warnv_p (arg0
,
14832 && (tree_expr_nonnegative_warnv_p (arg1
,
14833 strict_overflow_p
)));
14835 CASE_FLT_FN (BUILT_IN_COPYSIGN
):
14836 /* True if the 2nd argument is nonnegative. */
14837 return tree_expr_nonnegative_warnv_p (arg1
,
14838 strict_overflow_p
);
14840 CASE_FLT_FN (BUILT_IN_POWI
):
14841 /* True if the 1st argument is nonnegative or the second
14842 argument is an even integer. */
14843 if (TREE_CODE (arg1
) == INTEGER_CST
14844 && (TREE_INT_CST_LOW (arg1
) & 1) == 0)
14846 return tree_expr_nonnegative_warnv_p (arg0
,
14847 strict_overflow_p
);
14849 CASE_FLT_FN (BUILT_IN_POW
):
14850 /* True if the 1st argument is nonnegative or the second
14851 argument is an even integer valued real. */
14852 if (TREE_CODE (arg1
) == REAL_CST
)
14857 c
= TREE_REAL_CST (arg1
);
14858 n
= real_to_integer (&c
);
14861 REAL_VALUE_TYPE cint
;
14862 real_from_integer (&cint
, VOIDmode
, n
, SIGNED
);
14863 if (real_identical (&c
, &cint
))
14867 return tree_expr_nonnegative_warnv_p (arg0
,
14868 strict_overflow_p
);
14873 return tree_simple_nonnegative_warnv_p (CALL_EXPR
,
14877 /* Return true if T is known to be non-negative. If the return
14878 value is based on the assumption that signed overflow is undefined,
14879 set *STRICT_OVERFLOW_P to true; otherwise, don't change
14880 *STRICT_OVERFLOW_P. */
14883 tree_invalid_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
)
14885 enum tree_code code
= TREE_CODE (t
);
14886 if (TYPE_UNSIGNED (TREE_TYPE (t
)))
14893 tree temp
= TARGET_EXPR_SLOT (t
);
14894 t
= TARGET_EXPR_INITIAL (t
);
14896 /* If the initializer is non-void, then it's a normal expression
14897 that will be assigned to the slot. */
14898 if (!VOID_TYPE_P (t
))
14899 return tree_expr_nonnegative_warnv_p (t
, strict_overflow_p
);
14901 /* Otherwise, the initializer sets the slot in some way. One common
14902 way is an assignment statement at the end of the initializer. */
14905 if (TREE_CODE (t
) == BIND_EXPR
)
14906 t
= expr_last (BIND_EXPR_BODY (t
));
14907 else if (TREE_CODE (t
) == TRY_FINALLY_EXPR
14908 || TREE_CODE (t
) == TRY_CATCH_EXPR
)
14909 t
= expr_last (TREE_OPERAND (t
, 0));
14910 else if (TREE_CODE (t
) == STATEMENT_LIST
)
14915 if (TREE_CODE (t
) == MODIFY_EXPR
14916 && TREE_OPERAND (t
, 0) == temp
)
14917 return tree_expr_nonnegative_warnv_p (TREE_OPERAND (t
, 1),
14918 strict_overflow_p
);
14925 tree arg0
= call_expr_nargs (t
) > 0 ? CALL_EXPR_ARG (t
, 0) : NULL_TREE
;
14926 tree arg1
= call_expr_nargs (t
) > 1 ? CALL_EXPR_ARG (t
, 1) : NULL_TREE
;
14928 return tree_call_nonnegative_warnv_p (TREE_TYPE (t
),
14929 get_callee_fndecl (t
),
14932 strict_overflow_p
);
14934 case COMPOUND_EXPR
:
14936 return tree_expr_nonnegative_warnv_p (TREE_OPERAND (t
, 1),
14937 strict_overflow_p
);
14939 return tree_expr_nonnegative_warnv_p (expr_last (TREE_OPERAND (t
, 1)),
14940 strict_overflow_p
);
14942 return tree_expr_nonnegative_warnv_p (TREE_OPERAND (t
, 0),
14943 strict_overflow_p
);
14946 return tree_simple_nonnegative_warnv_p (TREE_CODE (t
),
14950 /* We don't know sign of `t', so be conservative and return false. */
14954 /* Return true if T is known to be non-negative. If the return
14955 value is based on the assumption that signed overflow is undefined,
14956 set *STRICT_OVERFLOW_P to true; otherwise, don't change
14957 *STRICT_OVERFLOW_P. */
14960 tree_expr_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
)
14962 enum tree_code code
;
14963 if (t
== error_mark_node
)
14966 code
= TREE_CODE (t
);
14967 switch (TREE_CODE_CLASS (code
))
14970 case tcc_comparison
:
14971 return tree_binary_nonnegative_warnv_p (TREE_CODE (t
),
14973 TREE_OPERAND (t
, 0),
14974 TREE_OPERAND (t
, 1),
14975 strict_overflow_p
);
14978 return tree_unary_nonnegative_warnv_p (TREE_CODE (t
),
14980 TREE_OPERAND (t
, 0),
14981 strict_overflow_p
);
14984 case tcc_declaration
:
14985 case tcc_reference
:
14986 return tree_single_nonnegative_warnv_p (t
, strict_overflow_p
);
14994 case TRUTH_AND_EXPR
:
14995 case TRUTH_OR_EXPR
:
14996 case TRUTH_XOR_EXPR
:
14997 return tree_binary_nonnegative_warnv_p (TREE_CODE (t
),
14999 TREE_OPERAND (t
, 0),
15000 TREE_OPERAND (t
, 1),
15001 strict_overflow_p
);
15002 case TRUTH_NOT_EXPR
:
15003 return tree_unary_nonnegative_warnv_p (TREE_CODE (t
),
15005 TREE_OPERAND (t
, 0),
15006 strict_overflow_p
);
15013 case WITH_SIZE_EXPR
:
15015 return tree_single_nonnegative_warnv_p (t
, strict_overflow_p
);
15018 return tree_invalid_nonnegative_warnv_p (t
, strict_overflow_p
);
15022 /* Return true if `t' is known to be non-negative. Handle warnings
15023 about undefined signed overflow. */
15026 tree_expr_nonnegative_p (tree t
)
15028 bool ret
, strict_overflow_p
;
15030 strict_overflow_p
= false;
15031 ret
= tree_expr_nonnegative_warnv_p (t
, &strict_overflow_p
);
15032 if (strict_overflow_p
)
15033 fold_overflow_warning (("assuming signed overflow does not occur when "
15034 "determining that expression is always "
15036 WARN_STRICT_OVERFLOW_MISC
);
15041 /* Return true when (CODE OP0) is an address and is known to be nonzero.
15042 For floating point we further ensure that T is not denormal.
15043 Similar logic is present in nonzero_address in rtlanal.h.
15045 If the return value is based on the assumption that signed overflow
15046 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
15047 change *STRICT_OVERFLOW_P. */
15050 tree_unary_nonzero_warnv_p (enum tree_code code
, tree type
, tree op0
,
15051 bool *strict_overflow_p
)
15056 return tree_expr_nonzero_warnv_p (op0
,
15057 strict_overflow_p
);
15061 tree inner_type
= TREE_TYPE (op0
);
15062 tree outer_type
= type
;
15064 return (TYPE_PRECISION (outer_type
) >= TYPE_PRECISION (inner_type
)
15065 && tree_expr_nonzero_warnv_p (op0
,
15066 strict_overflow_p
));
15070 case NON_LVALUE_EXPR
:
15071 return tree_expr_nonzero_warnv_p (op0
,
15072 strict_overflow_p
);
15081 /* Return true when (CODE OP0 OP1) is an address and is known to be nonzero.
15082 For floating point we further ensure that T is not denormal.
15083 Similar logic is present in nonzero_address in rtlanal.h.
15085 If the return value is based on the assumption that signed overflow
15086 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
15087 change *STRICT_OVERFLOW_P. */
15090 tree_binary_nonzero_warnv_p (enum tree_code code
,
15093 tree op1
, bool *strict_overflow_p
)
15095 bool sub_strict_overflow_p
;
15098 case POINTER_PLUS_EXPR
:
15100 if (ANY_INTEGRAL_TYPE_P (type
) && TYPE_OVERFLOW_UNDEFINED (type
))
15102 /* With the presence of negative values it is hard
15103 to say something. */
15104 sub_strict_overflow_p
= false;
15105 if (!tree_expr_nonnegative_warnv_p (op0
,
15106 &sub_strict_overflow_p
)
15107 || !tree_expr_nonnegative_warnv_p (op1
,
15108 &sub_strict_overflow_p
))
15110 /* One of operands must be positive and the other non-negative. */
15111 /* We don't set *STRICT_OVERFLOW_P here: even if this value
15112 overflows, on a twos-complement machine the sum of two
15113 nonnegative numbers can never be zero. */
15114 return (tree_expr_nonzero_warnv_p (op0
,
15116 || tree_expr_nonzero_warnv_p (op1
,
15117 strict_overflow_p
));
15122 if (TYPE_OVERFLOW_UNDEFINED (type
))
15124 if (tree_expr_nonzero_warnv_p (op0
,
15126 && tree_expr_nonzero_warnv_p (op1
,
15127 strict_overflow_p
))
15129 *strict_overflow_p
= true;
15136 sub_strict_overflow_p
= false;
15137 if (tree_expr_nonzero_warnv_p (op0
,
15138 &sub_strict_overflow_p
)
15139 && tree_expr_nonzero_warnv_p (op1
,
15140 &sub_strict_overflow_p
))
15142 if (sub_strict_overflow_p
)
15143 *strict_overflow_p
= true;
15148 sub_strict_overflow_p
= false;
15149 if (tree_expr_nonzero_warnv_p (op0
,
15150 &sub_strict_overflow_p
))
15152 if (sub_strict_overflow_p
)
15153 *strict_overflow_p
= true;
15155 /* When both operands are nonzero, then MAX must be too. */
15156 if (tree_expr_nonzero_warnv_p (op1
,
15157 strict_overflow_p
))
15160 /* MAX where operand 0 is positive is positive. */
15161 return tree_expr_nonnegative_warnv_p (op0
,
15162 strict_overflow_p
);
15164 /* MAX where operand 1 is positive is positive. */
15165 else if (tree_expr_nonzero_warnv_p (op1
,
15166 &sub_strict_overflow_p
)
15167 && tree_expr_nonnegative_warnv_p (op1
,
15168 &sub_strict_overflow_p
))
15170 if (sub_strict_overflow_p
)
15171 *strict_overflow_p
= true;
15177 return (tree_expr_nonzero_warnv_p (op1
,
15179 || tree_expr_nonzero_warnv_p (op0
,
15180 strict_overflow_p
));
15189 /* Return true when T is an address and is known to be nonzero.
15190 For floating point we further ensure that T is not denormal.
15191 Similar logic is present in nonzero_address in rtlanal.h.
15193 If the return value is based on the assumption that signed overflow
15194 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
15195 change *STRICT_OVERFLOW_P. */
15198 tree_single_nonzero_warnv_p (tree t
, bool *strict_overflow_p
)
15200 bool sub_strict_overflow_p
;
15201 switch (TREE_CODE (t
))
15204 return !integer_zerop (t
);
15208 tree base
= TREE_OPERAND (t
, 0);
15210 if (!DECL_P (base
))
15211 base
= get_base_address (base
);
15216 /* For objects in symbol table check if we know they are non-zero.
15217 Don't do anything for variables and functions before symtab is built;
15218 it is quite possible that they will be declared weak later. */
15219 if (DECL_P (base
) && decl_in_symtab_p (base
))
15221 struct symtab_node
*symbol
;
15223 symbol
= symtab_node::get_create (base
);
15225 return symbol
->nonzero_address ();
15230 /* Function local objects are never NULL. */
15232 && (DECL_CONTEXT (base
)
15233 && TREE_CODE (DECL_CONTEXT (base
)) == FUNCTION_DECL
15234 && auto_var_in_fn_p (base
, DECL_CONTEXT (base
))))
15237 /* Constants are never weak. */
15238 if (CONSTANT_CLASS_P (base
))
15245 sub_strict_overflow_p
= false;
15246 if (tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 1),
15247 &sub_strict_overflow_p
)
15248 && tree_expr_nonzero_warnv_p (TREE_OPERAND (t
, 2),
15249 &sub_strict_overflow_p
))
15251 if (sub_strict_overflow_p
)
15252 *strict_overflow_p
= true;
15263 /* Given the components of a binary expression CODE, TYPE, OP0 and OP1,
15264 attempt to fold the expression to a constant without modifying TYPE,
15267 If the expression could be simplified to a constant, then return
15268 the constant. If the expression would not be simplified to a
15269 constant, then return NULL_TREE. */
15272 fold_binary_to_constant (enum tree_code code
, tree type
, tree op0
, tree op1
)
15274 tree tem
= fold_binary (code
, type
, op0
, op1
);
15275 return (tem
&& TREE_CONSTANT (tem
)) ? tem
: NULL_TREE
;
15278 /* Given the components of a unary expression CODE, TYPE and OP0,
15279 attempt to fold the expression to a constant without modifying
15282 If the expression could be simplified to a constant, then return
15283 the constant. If the expression would not be simplified to a
15284 constant, then return NULL_TREE. */
15287 fold_unary_to_constant (enum tree_code code
, tree type
, tree op0
)
15289 tree tem
= fold_unary (code
, type
, op0
);
15290 return (tem
&& TREE_CONSTANT (tem
)) ? tem
: NULL_TREE
;
15293 /* If EXP represents referencing an element in a constant string
15294 (either via pointer arithmetic or array indexing), return the
15295 tree representing the value accessed, otherwise return NULL. */
15298 fold_read_from_constant_string (tree exp
)
15300 if ((TREE_CODE (exp
) == INDIRECT_REF
15301 || TREE_CODE (exp
) == ARRAY_REF
)
15302 && TREE_CODE (TREE_TYPE (exp
)) == INTEGER_TYPE
)
15304 tree exp1
= TREE_OPERAND (exp
, 0);
15307 location_t loc
= EXPR_LOCATION (exp
);
15309 if (TREE_CODE (exp
) == INDIRECT_REF
)
15310 string
= string_constant (exp1
, &index
);
15313 tree low_bound
= array_ref_low_bound (exp
);
15314 index
= fold_convert_loc (loc
, sizetype
, TREE_OPERAND (exp
, 1));
15316 /* Optimize the special-case of a zero lower bound.
15318 We convert the low_bound to sizetype to avoid some problems
15319 with constant folding. (E.g. suppose the lower bound is 1,
15320 and its mode is QI. Without the conversion,l (ARRAY
15321 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
15322 +INDEX), which becomes (ARRAY+255+INDEX). Oops!) */
15323 if (! integer_zerop (low_bound
))
15324 index
= size_diffop_loc (loc
, index
,
15325 fold_convert_loc (loc
, sizetype
, low_bound
));
15331 && TYPE_MODE (TREE_TYPE (exp
)) == TYPE_MODE (TREE_TYPE (TREE_TYPE (string
)))
15332 && TREE_CODE (string
) == STRING_CST
15333 && TREE_CODE (index
) == INTEGER_CST
15334 && compare_tree_int (index
, TREE_STRING_LENGTH (string
)) < 0
15335 && (GET_MODE_CLASS (TYPE_MODE (TREE_TYPE (TREE_TYPE (string
))))
15337 && (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (string
)))) == 1))
15338 return build_int_cst_type (TREE_TYPE (exp
),
15339 (TREE_STRING_POINTER (string
)
15340 [TREE_INT_CST_LOW (index
)]));
15345 /* Return the tree for neg (ARG0) when ARG0 is known to be either
15346 an integer constant, real, or fixed-point constant.
15348 TYPE is the type of the result. */
15351 fold_negate_const (tree arg0
, tree type
)
15353 tree t
= NULL_TREE
;
15355 switch (TREE_CODE (arg0
))
15360 wide_int val
= wi::neg (arg0
, &overflow
);
15361 t
= force_fit_type (type
, val
, 1,
15362 (overflow
| TREE_OVERFLOW (arg0
))
15363 && !TYPE_UNSIGNED (type
));
15368 t
= build_real (type
, real_value_negate (&TREE_REAL_CST (arg0
)));
15373 FIXED_VALUE_TYPE f
;
15374 bool overflow_p
= fixed_arithmetic (&f
, NEGATE_EXPR
,
15375 &(TREE_FIXED_CST (arg0
)), NULL
,
15376 TYPE_SATURATING (type
));
15377 t
= build_fixed (type
, f
);
15378 /* Propagate overflow flags. */
15379 if (overflow_p
| TREE_OVERFLOW (arg0
))
15380 TREE_OVERFLOW (t
) = 1;
15385 gcc_unreachable ();
15391 /* Return the tree for abs (ARG0) when ARG0 is known to be either
15392 an integer constant or real constant.
15394 TYPE is the type of the result. */
15397 fold_abs_const (tree arg0
, tree type
)
15399 tree t
= NULL_TREE
;
15401 switch (TREE_CODE (arg0
))
15405 /* If the value is unsigned or non-negative, then the absolute value
15406 is the same as the ordinary value. */
15407 if (!wi::neg_p (arg0
, TYPE_SIGN (type
)))
15410 /* If the value is negative, then the absolute value is
15415 wide_int val
= wi::neg (arg0
, &overflow
);
15416 t
= force_fit_type (type
, val
, -1,
15417 overflow
| TREE_OVERFLOW (arg0
));
15423 if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg0
)))
15424 t
= build_real (type
, real_value_negate (&TREE_REAL_CST (arg0
)));
15430 gcc_unreachable ();
15436 /* Return the tree for not (ARG0) when ARG0 is known to be an integer
15437 constant. TYPE is the type of the result. */
15440 fold_not_const (const_tree arg0
, tree type
)
15442 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
);
15444 return force_fit_type (type
, wi::bit_not (arg0
), 0, TREE_OVERFLOW (arg0
));
15447 /* Given CODE, a relational operator, the target type, TYPE and two
15448 constant operands OP0 and OP1, return the result of the
15449 relational operation. If the result is not a compile time
15450 constant, then return NULL_TREE. */
15453 fold_relational_const (enum tree_code code
, tree type
, tree op0
, tree op1
)
15455 int result
, invert
;
15457 /* From here on, the only cases we handle are when the result is
15458 known to be a constant. */
15460 if (TREE_CODE (op0
) == REAL_CST
&& TREE_CODE (op1
) == REAL_CST
)
15462 const REAL_VALUE_TYPE
*c0
= TREE_REAL_CST_PTR (op0
);
15463 const REAL_VALUE_TYPE
*c1
= TREE_REAL_CST_PTR (op1
);
15465 /* Handle the cases where either operand is a NaN. */
15466 if (real_isnan (c0
) || real_isnan (c1
))
15476 case UNORDERED_EXPR
:
15490 if (flag_trapping_math
)
15496 gcc_unreachable ();
15499 return constant_boolean_node (result
, type
);
15502 return constant_boolean_node (real_compare (code
, c0
, c1
), type
);
15505 if (TREE_CODE (op0
) == FIXED_CST
&& TREE_CODE (op1
) == FIXED_CST
)
15507 const FIXED_VALUE_TYPE
*c0
= TREE_FIXED_CST_PTR (op0
);
15508 const FIXED_VALUE_TYPE
*c1
= TREE_FIXED_CST_PTR (op1
);
15509 return constant_boolean_node (fixed_compare (code
, c0
, c1
), type
);
15512 /* Handle equality/inequality of complex constants. */
15513 if (TREE_CODE (op0
) == COMPLEX_CST
&& TREE_CODE (op1
) == COMPLEX_CST
)
15515 tree rcond
= fold_relational_const (code
, type
,
15516 TREE_REALPART (op0
),
15517 TREE_REALPART (op1
));
15518 tree icond
= fold_relational_const (code
, type
,
15519 TREE_IMAGPART (op0
),
15520 TREE_IMAGPART (op1
));
15521 if (code
== EQ_EXPR
)
15522 return fold_build2 (TRUTH_ANDIF_EXPR
, type
, rcond
, icond
);
15523 else if (code
== NE_EXPR
)
15524 return fold_build2 (TRUTH_ORIF_EXPR
, type
, rcond
, icond
);
15529 if (TREE_CODE (op0
) == VECTOR_CST
&& TREE_CODE (op1
) == VECTOR_CST
)
15531 unsigned count
= VECTOR_CST_NELTS (op0
);
15532 tree
*elts
= XALLOCAVEC (tree
, count
);
15533 gcc_assert (VECTOR_CST_NELTS (op1
) == count
15534 && TYPE_VECTOR_SUBPARTS (type
) == count
);
15536 for (unsigned i
= 0; i
< count
; i
++)
15538 tree elem_type
= TREE_TYPE (type
);
15539 tree elem0
= VECTOR_CST_ELT (op0
, i
);
15540 tree elem1
= VECTOR_CST_ELT (op1
, i
);
15542 tree tem
= fold_relational_const (code
, elem_type
,
15545 if (tem
== NULL_TREE
)
15548 elts
[i
] = build_int_cst (elem_type
, integer_zerop (tem
) ? 0 : -1);
15551 return build_vector (type
, elts
);
15554 /* From here on we only handle LT, LE, GT, GE, EQ and NE.
15556 To compute GT, swap the arguments and do LT.
15557 To compute GE, do LT and invert the result.
15558 To compute LE, swap the arguments, do LT and invert the result.
15559 To compute NE, do EQ and invert the result.
15561 Therefore, the code below must handle only EQ and LT. */
15563 if (code
== LE_EXPR
|| code
== GT_EXPR
)
15565 std::swap (op0
, op1
);
15566 code
= swap_tree_comparison (code
);
15569 /* Note that it is safe to invert for real values here because we
15570 have already handled the one case that it matters. */
15573 if (code
== NE_EXPR
|| code
== GE_EXPR
)
15576 code
= invert_tree_comparison (code
, false);
15579 /* Compute a result for LT or EQ if args permit;
15580 Otherwise return T. */
15581 if (TREE_CODE (op0
) == INTEGER_CST
&& TREE_CODE (op1
) == INTEGER_CST
)
15583 if (code
== EQ_EXPR
)
15584 result
= tree_int_cst_equal (op0
, op1
);
15586 result
= tree_int_cst_lt (op0
, op1
);
15593 return constant_boolean_node (result
, type
);
15596 /* If necessary, return a CLEANUP_POINT_EXPR for EXPR with the
15597 indicated TYPE. If no CLEANUP_POINT_EXPR is necessary, return EXPR
15601 fold_build_cleanup_point_expr (tree type
, tree expr
)
15603 /* If the expression does not have side effects then we don't have to wrap
15604 it with a cleanup point expression. */
15605 if (!TREE_SIDE_EFFECTS (expr
))
15608 /* If the expression is a return, check to see if the expression inside the
15609 return has no side effects or the right hand side of the modify expression
15610 inside the return. If either don't have side effects set we don't need to
15611 wrap the expression in a cleanup point expression. Note we don't check the
15612 left hand side of the modify because it should always be a return decl. */
15613 if (TREE_CODE (expr
) == RETURN_EXPR
)
15615 tree op
= TREE_OPERAND (expr
, 0);
15616 if (!op
|| !TREE_SIDE_EFFECTS (op
))
15618 op
= TREE_OPERAND (op
, 1);
15619 if (!TREE_SIDE_EFFECTS (op
))
15623 return build1 (CLEANUP_POINT_EXPR
, type
, expr
);
15626 /* Given a pointer value OP0 and a type TYPE, return a simplified version
15627 of an indirection through OP0, or NULL_TREE if no simplification is
15631 fold_indirect_ref_1 (location_t loc
, tree type
, tree op0
)
15637 subtype
= TREE_TYPE (sub
);
15638 if (!POINTER_TYPE_P (subtype
))
15641 if (TREE_CODE (sub
) == ADDR_EXPR
)
15643 tree op
= TREE_OPERAND (sub
, 0);
15644 tree optype
= TREE_TYPE (op
);
15645 /* *&CONST_DECL -> to the value of the const decl. */
15646 if (TREE_CODE (op
) == CONST_DECL
)
15647 return DECL_INITIAL (op
);
15648 /* *&p => p; make sure to handle *&"str"[cst] here. */
15649 if (type
== optype
)
15651 tree fop
= fold_read_from_constant_string (op
);
15657 /* *(foo *)&fooarray => fooarray[0] */
15658 else if (TREE_CODE (optype
) == ARRAY_TYPE
15659 && type
== TREE_TYPE (optype
)
15660 && (!in_gimple_form
15661 || TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
))
15663 tree type_domain
= TYPE_DOMAIN (optype
);
15664 tree min_val
= size_zero_node
;
15665 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
15666 min_val
= TYPE_MIN_VALUE (type_domain
);
15668 && TREE_CODE (min_val
) != INTEGER_CST
)
15670 return build4_loc (loc
, ARRAY_REF
, type
, op
, min_val
,
15671 NULL_TREE
, NULL_TREE
);
15673 /* *(foo *)&complexfoo => __real__ complexfoo */
15674 else if (TREE_CODE (optype
) == COMPLEX_TYPE
15675 && type
== TREE_TYPE (optype
))
15676 return fold_build1_loc (loc
, REALPART_EXPR
, type
, op
);
15677 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
15678 else if (TREE_CODE (optype
) == VECTOR_TYPE
15679 && type
== TREE_TYPE (optype
))
15681 tree part_width
= TYPE_SIZE (type
);
15682 tree index
= bitsize_int (0);
15683 return fold_build3_loc (loc
, BIT_FIELD_REF
, type
, op
, part_width
, index
);
15687 if (TREE_CODE (sub
) == POINTER_PLUS_EXPR
15688 && TREE_CODE (TREE_OPERAND (sub
, 1)) == INTEGER_CST
)
15690 tree op00
= TREE_OPERAND (sub
, 0);
15691 tree op01
= TREE_OPERAND (sub
, 1);
15694 if (TREE_CODE (op00
) == ADDR_EXPR
)
15697 op00
= TREE_OPERAND (op00
, 0);
15698 op00type
= TREE_TYPE (op00
);
15700 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
15701 if (TREE_CODE (op00type
) == VECTOR_TYPE
15702 && type
== TREE_TYPE (op00type
))
15704 HOST_WIDE_INT offset
= tree_to_shwi (op01
);
15705 tree part_width
= TYPE_SIZE (type
);
15706 unsigned HOST_WIDE_INT part_widthi
= tree_to_shwi (part_width
)/BITS_PER_UNIT
;
15707 unsigned HOST_WIDE_INT indexi
= offset
* BITS_PER_UNIT
;
15708 tree index
= bitsize_int (indexi
);
15710 if (offset
/ part_widthi
< TYPE_VECTOR_SUBPARTS (op00type
))
15711 return fold_build3_loc (loc
,
15712 BIT_FIELD_REF
, type
, op00
,
15713 part_width
, index
);
15716 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
15717 else if (TREE_CODE (op00type
) == COMPLEX_TYPE
15718 && type
== TREE_TYPE (op00type
))
15720 tree size
= TYPE_SIZE_UNIT (type
);
15721 if (tree_int_cst_equal (size
, op01
))
15722 return fold_build1_loc (loc
, IMAGPART_EXPR
, type
, op00
);
15724 /* ((foo *)&fooarray)[1] => fooarray[1] */
15725 else if (TREE_CODE (op00type
) == ARRAY_TYPE
15726 && type
== TREE_TYPE (op00type
))
15728 tree type_domain
= TYPE_DOMAIN (op00type
);
15729 tree min_val
= size_zero_node
;
15730 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
15731 min_val
= TYPE_MIN_VALUE (type_domain
);
15732 op01
= size_binop_loc (loc
, EXACT_DIV_EXPR
, op01
,
15733 TYPE_SIZE_UNIT (type
));
15734 op01
= size_binop_loc (loc
, PLUS_EXPR
, op01
, min_val
);
15735 return build4_loc (loc
, ARRAY_REF
, type
, op00
, op01
,
15736 NULL_TREE
, NULL_TREE
);
15741 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
15742 if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
15743 && type
== TREE_TYPE (TREE_TYPE (subtype
))
15744 && (!in_gimple_form
15745 || TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
))
15748 tree min_val
= size_zero_node
;
15749 sub
= build_fold_indirect_ref_loc (loc
, sub
);
15750 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
15751 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
15752 min_val
= TYPE_MIN_VALUE (type_domain
);
15754 && TREE_CODE (min_val
) != INTEGER_CST
)
15756 return build4_loc (loc
, ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
,
15763 /* Builds an expression for an indirection through T, simplifying some
15767 build_fold_indirect_ref_loc (location_t loc
, tree t
)
15769 tree type
= TREE_TYPE (TREE_TYPE (t
));
15770 tree sub
= fold_indirect_ref_1 (loc
, type
, t
);
15775 return build1_loc (loc
, INDIRECT_REF
, type
, t
);
15778 /* Given an INDIRECT_REF T, return either T or a simplified version. */
15781 fold_indirect_ref_loc (location_t loc
, tree t
)
15783 tree sub
= fold_indirect_ref_1 (loc
, TREE_TYPE (t
), TREE_OPERAND (t
, 0));
15791 /* Strip non-trapping, non-side-effecting tree nodes from an expression
15792 whose result is ignored. The type of the returned tree need not be
15793 the same as the original expression. */
15796 fold_ignored_result (tree t
)
15798 if (!TREE_SIDE_EFFECTS (t
))
15799 return integer_zero_node
;
15802 switch (TREE_CODE_CLASS (TREE_CODE (t
)))
15805 t
= TREE_OPERAND (t
, 0);
15809 case tcc_comparison
:
15810 if (!TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 1)))
15811 t
= TREE_OPERAND (t
, 0);
15812 else if (!TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 0)))
15813 t
= TREE_OPERAND (t
, 1);
15818 case tcc_expression
:
15819 switch (TREE_CODE (t
))
15821 case COMPOUND_EXPR
:
15822 if (TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 1)))
15824 t
= TREE_OPERAND (t
, 0);
15828 if (TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 1))
15829 || TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 2)))
15831 t
= TREE_OPERAND (t
, 0);
15844 /* Return the value of VALUE, rounded up to a multiple of DIVISOR. */
15847 round_up_loc (location_t loc
, tree value
, unsigned int divisor
)
15849 tree div
= NULL_TREE
;
15854 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
15855 have to do anything. Only do this when we are not given a const,
15856 because in that case, this check is more expensive than just
15858 if (TREE_CODE (value
) != INTEGER_CST
)
15860 div
= build_int_cst (TREE_TYPE (value
), divisor
);
15862 if (multiple_of_p (TREE_TYPE (value
), value
, div
))
15866 /* If divisor is a power of two, simplify this to bit manipulation. */
15867 if (divisor
== (divisor
& -divisor
))
15869 if (TREE_CODE (value
) == INTEGER_CST
)
15871 wide_int val
= value
;
15874 if ((val
& (divisor
- 1)) == 0)
15877 overflow_p
= TREE_OVERFLOW (value
);
15878 val
+= divisor
- 1;
15879 val
&= - (int) divisor
;
15883 return force_fit_type (TREE_TYPE (value
), val
, -1, overflow_p
);
15889 t
= build_int_cst (TREE_TYPE (value
), divisor
- 1);
15890 value
= size_binop_loc (loc
, PLUS_EXPR
, value
, t
);
15891 t
= build_int_cst (TREE_TYPE (value
), - (int) divisor
);
15892 value
= size_binop_loc (loc
, BIT_AND_EXPR
, value
, t
);
15898 div
= build_int_cst (TREE_TYPE (value
), divisor
);
15899 value
= size_binop_loc (loc
, CEIL_DIV_EXPR
, value
, div
);
15900 value
= size_binop_loc (loc
, MULT_EXPR
, value
, div
);
15906 /* Likewise, but round down. */
15909 round_down_loc (location_t loc
, tree value
, int divisor
)
15911 tree div
= NULL_TREE
;
15913 gcc_assert (divisor
> 0);
15917 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
15918 have to do anything. Only do this when we are not given a const,
15919 because in that case, this check is more expensive than just
15921 if (TREE_CODE (value
) != INTEGER_CST
)
15923 div
= build_int_cst (TREE_TYPE (value
), divisor
);
15925 if (multiple_of_p (TREE_TYPE (value
), value
, div
))
15929 /* If divisor is a power of two, simplify this to bit manipulation. */
15930 if (divisor
== (divisor
& -divisor
))
15934 t
= build_int_cst (TREE_TYPE (value
), -divisor
);
15935 value
= size_binop_loc (loc
, BIT_AND_EXPR
, value
, t
);
15940 div
= build_int_cst (TREE_TYPE (value
), divisor
);
15941 value
= size_binop_loc (loc
, FLOOR_DIV_EXPR
, value
, div
);
15942 value
= size_binop_loc (loc
, MULT_EXPR
, value
, div
);
15948 /* Returns the pointer to the base of the object addressed by EXP and
15949 extracts the information about the offset of the access, storing it
15950 to PBITPOS and POFFSET. */
15953 split_address_to_core_and_offset (tree exp
,
15954 HOST_WIDE_INT
*pbitpos
, tree
*poffset
)
15958 int unsignedp
, volatilep
;
15959 HOST_WIDE_INT bitsize
;
15960 location_t loc
= EXPR_LOCATION (exp
);
15962 if (TREE_CODE (exp
) == ADDR_EXPR
)
15964 core
= get_inner_reference (TREE_OPERAND (exp
, 0), &bitsize
, pbitpos
,
15965 poffset
, &mode
, &unsignedp
, &volatilep
,
15967 core
= build_fold_addr_expr_loc (loc
, core
);
15973 *poffset
= NULL_TREE
;
15979 /* Returns true if addresses of E1 and E2 differ by a constant, false
15980 otherwise. If they do, E1 - E2 is stored in *DIFF. */
15983 ptr_difference_const (tree e1
, tree e2
, HOST_WIDE_INT
*diff
)
15986 HOST_WIDE_INT bitpos1
, bitpos2
;
15987 tree toffset1
, toffset2
, tdiff
, type
;
15989 core1
= split_address_to_core_and_offset (e1
, &bitpos1
, &toffset1
);
15990 core2
= split_address_to_core_and_offset (e2
, &bitpos2
, &toffset2
);
15992 if (bitpos1
% BITS_PER_UNIT
!= 0
15993 || bitpos2
% BITS_PER_UNIT
!= 0
15994 || !operand_equal_p (core1
, core2
, 0))
15997 if (toffset1
&& toffset2
)
15999 type
= TREE_TYPE (toffset1
);
16000 if (type
!= TREE_TYPE (toffset2
))
16001 toffset2
= fold_convert (type
, toffset2
);
16003 tdiff
= fold_build2 (MINUS_EXPR
, type
, toffset1
, toffset2
);
16004 if (!cst_and_fits_in_hwi (tdiff
))
16007 *diff
= int_cst_value (tdiff
);
16009 else if (toffset1
|| toffset2
)
16011 /* If only one of the offsets is non-constant, the difference cannot
16018 *diff
+= (bitpos1
- bitpos2
) / BITS_PER_UNIT
;
16022 /* Simplify the floating point expression EXP when the sign of the
16023 result is not significant. Return NULL_TREE if no simplification
16027 fold_strip_sign_ops (tree exp
)
16030 location_t loc
= EXPR_LOCATION (exp
);
16032 switch (TREE_CODE (exp
))
16036 arg0
= fold_strip_sign_ops (TREE_OPERAND (exp
, 0));
16037 return arg0
? arg0
: TREE_OPERAND (exp
, 0);
16041 if (HONOR_SIGN_DEPENDENT_ROUNDING (element_mode (exp
)))
16043 arg0
= fold_strip_sign_ops (TREE_OPERAND (exp
, 0));
16044 arg1
= fold_strip_sign_ops (TREE_OPERAND (exp
, 1));
16045 if (arg0
!= NULL_TREE
|| arg1
!= NULL_TREE
)
16046 return fold_build2_loc (loc
, TREE_CODE (exp
), TREE_TYPE (exp
),
16047 arg0
? arg0
: TREE_OPERAND (exp
, 0),
16048 arg1
? arg1
: TREE_OPERAND (exp
, 1));
16051 case COMPOUND_EXPR
:
16052 arg0
= TREE_OPERAND (exp
, 0);
16053 arg1
= fold_strip_sign_ops (TREE_OPERAND (exp
, 1));
16055 return fold_build2_loc (loc
, COMPOUND_EXPR
, TREE_TYPE (exp
), arg0
, arg1
);
16059 arg0
= fold_strip_sign_ops (TREE_OPERAND (exp
, 1));
16060 arg1
= fold_strip_sign_ops (TREE_OPERAND (exp
, 2));
16062 return fold_build3_loc (loc
,
16063 COND_EXPR
, TREE_TYPE (exp
), TREE_OPERAND (exp
, 0),
16064 arg0
? arg0
: TREE_OPERAND (exp
, 1),
16065 arg1
? arg1
: TREE_OPERAND (exp
, 2));
16070 const enum built_in_function fcode
= builtin_mathfn_code (exp
);
16073 CASE_FLT_FN (BUILT_IN_COPYSIGN
):
16074 /* Strip copysign function call, return the 1st argument. */
16075 arg0
= CALL_EXPR_ARG (exp
, 0);
16076 arg1
= CALL_EXPR_ARG (exp
, 1);
16077 return omit_one_operand_loc (loc
, TREE_TYPE (exp
), arg0
, arg1
);
16080 /* Strip sign ops from the argument of "odd" math functions. */
16081 if (negate_mathfn_p (fcode
))
16083 arg0
= fold_strip_sign_ops (CALL_EXPR_ARG (exp
, 0));
16085 return build_call_expr_loc (loc
, get_callee_fndecl (exp
), 1, arg0
);
16098 /* Return OFF converted to a pointer offset type suitable as offset for
16099 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
16101 convert_to_ptrofftype_loc (location_t loc
, tree off
)
16103 return fold_convert_loc (loc
, sizetype
, off
);
16106 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
16108 fold_build_pointer_plus_loc (location_t loc
, tree ptr
, tree off
)
16110 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
16111 ptr
, convert_to_ptrofftype_loc (loc
, off
));
16114 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
16116 fold_build_pointer_plus_hwi_loc (location_t loc
, tree ptr
, HOST_WIDE_INT off
)
16118 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
16119 ptr
, size_int (off
));