1 /* Code for range operators.
2 Copyright (C) 2017-2022 Free Software Foundation, Inc.
3 Contributed by Andrew MacLeod <amacleod@redhat.com>
4 and Aldy Hernandez <aldyh@redhat.com>.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
26 #include "insn-codes.h"
31 #include "tree-pass.h"
33 #include "optabs-tree.h"
34 #include "gimple-pretty-print.h"
35 #include "diagnostic-core.h"
37 #include "fold-const.h"
38 #include "stor-layout.h"
41 #include "gimple-fold.h"
43 #include "gimple-iterator.h"
44 #include "gimple-walk.h"
47 #include "value-relation.h"
50 // Return the upper limit for a type.
52 static inline wide_int
53 max_limit (const_tree type
)
55 return wi::max_value (TYPE_PRECISION (type
) , TYPE_SIGN (type
));
58 // Return the lower limit for a type.
60 static inline wide_int
61 min_limit (const_tree type
)
63 return wi::min_value (TYPE_PRECISION (type
) , TYPE_SIGN (type
));
66 // If the range of either op1 or op2 is undefined, set the result to
67 // varying and return TRUE. If the caller truely cares about a result,
68 // they should pass in a varying if it has an undefined that it wants
69 // treated as a varying.
72 empty_range_varying (irange
&r
, tree type
,
73 const irange
&op1
, const irange
& op2
)
75 if (op1
.undefined_p () || op2
.undefined_p ())
84 // Return false if shifting by OP is undefined behavior. Otherwise, return
85 // true and the range it is to be shifted by. This allows trimming out of
86 // undefined ranges, leaving only valid ranges if there are any.
89 get_shift_range (irange
&r
, tree type
, const irange
&op
)
91 if (op
.undefined_p ())
94 // Build valid range and intersect it with the shift range.
95 r
= value_range (build_int_cst_type (op
.type (), 0),
96 build_int_cst_type (op
.type (), TYPE_PRECISION (type
) - 1));
99 // If there are no valid ranges in the shift range, returned false.
100 if (r
.undefined_p ())
105 // Return TRUE if 0 is within [WMIN, WMAX].
108 wi_includes_zero_p (tree type
, const wide_int
&wmin
, const wide_int
&wmax
)
110 signop sign
= TYPE_SIGN (type
);
111 return wi::le_p (wmin
, 0, sign
) && wi::ge_p (wmax
, 0, sign
);
114 // Return TRUE if [WMIN, WMAX] is the singleton 0.
117 wi_zero_p (tree type
, const wide_int
&wmin
, const wide_int
&wmax
)
119 unsigned prec
= TYPE_PRECISION (type
);
120 return wmin
== wmax
&& wi::eq_p (wmin
, wi::zero (prec
));
123 // Default wide_int fold operation returns [MIN, MAX].
126 range_operator::wi_fold (irange
&r
, tree type
,
127 const wide_int
&lh_lb ATTRIBUTE_UNUSED
,
128 const wide_int
&lh_ub ATTRIBUTE_UNUSED
,
129 const wide_int
&rh_lb ATTRIBUTE_UNUSED
,
130 const wide_int
&rh_ub ATTRIBUTE_UNUSED
) const
132 gcc_checking_assert (irange::supports_type_p (type
));
133 r
.set_varying (type
);
136 // Call wi_fold, except further split small subranges into constants.
137 // This can provide better precision. For something 8 >> [0,1]
138 // Instead of [8, 16], we will produce [8,8][16,16]
141 range_operator::wi_fold_in_parts (irange
&r
, tree type
,
142 const wide_int
&lh_lb
,
143 const wide_int
&lh_ub
,
144 const wide_int
&rh_lb
,
145 const wide_int
&rh_ub
) const
148 widest_int rh_range
= wi::sub (widest_int::from (rh_ub
, TYPE_SIGN (type
)),
149 widest_int::from (rh_lb
, TYPE_SIGN (type
)));
150 widest_int lh_range
= wi::sub (widest_int::from (lh_ub
, TYPE_SIGN (type
)),
151 widest_int::from (lh_lb
, TYPE_SIGN (type
)));
152 // If there are 2, 3, or 4 values in the RH range, do them separately.
153 // Call wi_fold_in_parts to check the RH side.
154 if (rh_range
> 0 && rh_range
< 4)
156 wi_fold_in_parts (r
, type
, lh_lb
, lh_ub
, rh_lb
, rh_lb
);
159 wi_fold_in_parts (tmp
, type
, lh_lb
, lh_ub
, rh_lb
+ 1, rh_lb
+ 1);
163 wi_fold_in_parts (tmp
, type
, lh_lb
, lh_ub
, rh_lb
+ 2, rh_lb
+ 2);
167 wi_fold_in_parts (tmp
, type
, lh_lb
, lh_ub
, rh_ub
, rh_ub
);
170 // Otherise check for 2, 3, or 4 values in the LH range and split them up.
171 // The RH side has been checked, so no recursion needed.
172 else if (lh_range
> 0 && lh_range
< 4)
174 wi_fold (r
, type
, lh_lb
, lh_lb
, rh_lb
, rh_ub
);
177 wi_fold (tmp
, type
, lh_lb
+ 1, lh_lb
+ 1, rh_lb
, rh_ub
);
181 wi_fold (tmp
, type
, lh_lb
+ 2, lh_lb
+ 2, rh_lb
, rh_ub
);
185 wi_fold (tmp
, type
, lh_ub
, lh_ub
, rh_lb
, rh_ub
);
188 // Otherwise just call wi_fold.
190 wi_fold (r
, type
, lh_lb
, lh_ub
, rh_lb
, rh_ub
);
193 // The default for fold is to break all ranges into sub-ranges and
194 // invoke the wi_fold method on each sub-range pair.
197 range_operator::fold_range (irange
&r
, tree type
,
200 relation_kind rel
) const
202 gcc_checking_assert (irange::supports_type_p (type
));
203 if (empty_range_varying (r
, type
, lh
, rh
))
206 unsigned num_lh
= lh
.num_pairs ();
207 unsigned num_rh
= rh
.num_pairs ();
209 // If both ranges are single pairs, fold directly into the result range.
210 // If the number of subranges grows too high, produce a summary result as the
211 // loop becomes exponential with little benefit. See PR 103821.
212 if ((num_lh
== 1 && num_rh
== 1) || num_lh
* num_rh
> 12)
214 wi_fold_in_parts (r
, type
, lh
.lower_bound (), lh
.upper_bound (),
215 rh
.lower_bound (), rh
.upper_bound ());
216 op1_op2_relation_effect (r
, type
, lh
, rh
, rel
);
222 for (unsigned x
= 0; x
< num_lh
; ++x
)
223 for (unsigned y
= 0; y
< num_rh
; ++y
)
225 wide_int lh_lb
= lh
.lower_bound (x
);
226 wide_int lh_ub
= lh
.upper_bound (x
);
227 wide_int rh_lb
= rh
.lower_bound (y
);
228 wide_int rh_ub
= rh
.upper_bound (y
);
229 wi_fold_in_parts (tmp
, type
, lh_lb
, lh_ub
, rh_lb
, rh_ub
);
233 op1_op2_relation_effect (r
, type
, lh
, rh
, rel
);
237 op1_op2_relation_effect (r
, type
, lh
, rh
, rel
);
241 // The default for op1_range is to return false.
244 range_operator::op1_range (irange
&r ATTRIBUTE_UNUSED
,
245 tree type ATTRIBUTE_UNUSED
,
246 const irange
&lhs ATTRIBUTE_UNUSED
,
247 const irange
&op2 ATTRIBUTE_UNUSED
,
248 relation_kind rel ATTRIBUTE_UNUSED
) const
253 // The default for op2_range is to return false.
256 range_operator::op2_range (irange
&r ATTRIBUTE_UNUSED
,
257 tree type ATTRIBUTE_UNUSED
,
258 const irange
&lhs ATTRIBUTE_UNUSED
,
259 const irange
&op1 ATTRIBUTE_UNUSED
,
260 relation_kind rel ATTRIBUTE_UNUSED
) const
265 // The default relation routines return VREL_NONE.
268 range_operator::lhs_op1_relation (const irange
&lhs ATTRIBUTE_UNUSED
,
269 const irange
&op1 ATTRIBUTE_UNUSED
,
270 const irange
&op2 ATTRIBUTE_UNUSED
) const
276 range_operator::lhs_op2_relation (const irange
&lhs ATTRIBUTE_UNUSED
,
277 const irange
&op1 ATTRIBUTE_UNUSED
,
278 const irange
&op2 ATTRIBUTE_UNUSED
) const
284 range_operator::op1_op2_relation (const irange
&lhs ATTRIBUTE_UNUSED
) const
289 // Default is no relation affects the LHS.
292 range_operator::op1_op2_relation_effect (irange
&lhs_range ATTRIBUTE_UNUSED
,
293 tree type ATTRIBUTE_UNUSED
,
294 const irange
&op1_range ATTRIBUTE_UNUSED
,
295 const irange
&op2_range ATTRIBUTE_UNUSED
,
296 relation_kind rel ATTRIBUTE_UNUSED
) const
301 // Create and return a range from a pair of wide-ints that are known
302 // to have overflowed (or underflowed).
305 value_range_from_overflowed_bounds (irange
&r
, tree type
,
306 const wide_int
&wmin
,
307 const wide_int
&wmax
)
309 const signop sgn
= TYPE_SIGN (type
);
310 const unsigned int prec
= TYPE_PRECISION (type
);
312 wide_int tmin
= wide_int::from (wmin
, prec
, sgn
);
313 wide_int tmax
= wide_int::from (wmax
, prec
, sgn
);
318 if (wi::cmp (tmin
, tmax
, sgn
) < 0)
321 if (wi::cmp (tmax
, tem
, sgn
) > 0)
324 // If the anti-range would cover nothing, drop to varying.
325 // Likewise if the anti-range bounds are outside of the types
327 if (covers
|| wi::cmp (tmin
, tmax
, sgn
) > 0)
328 r
.set_varying (type
);
331 tree tree_min
= wide_int_to_tree (type
, tmin
);
332 tree tree_max
= wide_int_to_tree (type
, tmax
);
333 r
.set (tree_min
, tree_max
, VR_ANTI_RANGE
);
337 // Create and return a range from a pair of wide-ints. MIN_OVF and
338 // MAX_OVF describe any overflow that might have occurred while
339 // calculating WMIN and WMAX respectively.
342 value_range_with_overflow (irange
&r
, tree type
,
343 const wide_int
&wmin
, const wide_int
&wmax
,
344 wi::overflow_type min_ovf
= wi::OVF_NONE
,
345 wi::overflow_type max_ovf
= wi::OVF_NONE
)
347 const signop sgn
= TYPE_SIGN (type
);
348 const unsigned int prec
= TYPE_PRECISION (type
);
349 const bool overflow_wraps
= TYPE_OVERFLOW_WRAPS (type
);
351 // For one bit precision if max != min, then the range covers all
353 if (prec
== 1 && wi::ne_p (wmax
, wmin
))
355 r
.set_varying (type
);
361 // If overflow wraps, truncate the values and adjust the range,
362 // kind, and bounds appropriately.
363 if ((min_ovf
!= wi::OVF_NONE
) == (max_ovf
!= wi::OVF_NONE
))
365 wide_int tmin
= wide_int::from (wmin
, prec
, sgn
);
366 wide_int tmax
= wide_int::from (wmax
, prec
, sgn
);
367 // If the limits are swapped, we wrapped around and cover
369 if (wi::gt_p (tmin
, tmax
, sgn
))
370 r
.set_varying (type
);
372 // No overflow or both overflow or underflow. The range
373 // kind stays normal.
374 r
.set (wide_int_to_tree (type
, tmin
),
375 wide_int_to_tree (type
, tmax
));
379 if ((min_ovf
== wi::OVF_UNDERFLOW
&& max_ovf
== wi::OVF_NONE
)
380 || (max_ovf
== wi::OVF_OVERFLOW
&& min_ovf
== wi::OVF_NONE
))
381 value_range_from_overflowed_bounds (r
, type
, wmin
, wmax
);
383 // Other underflow and/or overflow, drop to VR_VARYING.
384 r
.set_varying (type
);
388 // If both bounds either underflowed or overflowed, then the result
390 if ((min_ovf
== wi::OVF_OVERFLOW
&& max_ovf
== wi::OVF_OVERFLOW
)
391 || (min_ovf
== wi::OVF_UNDERFLOW
&& max_ovf
== wi::OVF_UNDERFLOW
))
397 // If overflow does not wrap, saturate to [MIN, MAX].
398 wide_int new_lb
, new_ub
;
399 if (min_ovf
== wi::OVF_UNDERFLOW
)
400 new_lb
= wi::min_value (prec
, sgn
);
401 else if (min_ovf
== wi::OVF_OVERFLOW
)
402 new_lb
= wi::max_value (prec
, sgn
);
406 if (max_ovf
== wi::OVF_UNDERFLOW
)
407 new_ub
= wi::min_value (prec
, sgn
);
408 else if (max_ovf
== wi::OVF_OVERFLOW
)
409 new_ub
= wi::max_value (prec
, sgn
);
413 r
.set (wide_int_to_tree (type
, new_lb
),
414 wide_int_to_tree (type
, new_ub
));
418 // Create and return a range from a pair of wide-ints. Canonicalize
419 // the case where the bounds are swapped. In which case, we transform
420 // [10,5] into [MIN,5][10,MAX].
423 create_possibly_reversed_range (irange
&r
, tree type
,
424 const wide_int
&new_lb
, const wide_int
&new_ub
)
426 signop s
= TYPE_SIGN (type
);
427 // If the bounds are swapped, treat the result as if an overflow occured.
428 if (wi::gt_p (new_lb
, new_ub
, s
))
429 value_range_from_overflowed_bounds (r
, type
, new_lb
, new_ub
);
431 // Otherwise it's just a normal range.
432 r
.set (wide_int_to_tree (type
, new_lb
), wide_int_to_tree (type
, new_ub
));
435 // Return an irange instance that is a boolean TRUE.
437 static inline int_range
<1>
438 range_true (tree type
)
440 unsigned prec
= TYPE_PRECISION (type
);
441 return int_range
<1> (type
, wi::one (prec
), wi::one (prec
));
444 // Return an irange instance that is a boolean FALSE.
446 static inline int_range
<1>
447 range_false (tree type
)
449 unsigned prec
= TYPE_PRECISION (type
);
450 return int_range
<1> (type
, wi::zero (prec
), wi::zero (prec
));
453 // Return an irange that covers both true and false.
455 static inline int_range
<1>
456 range_true_and_false (tree type
)
458 unsigned prec
= TYPE_PRECISION (type
);
459 return int_range
<1> (type
, wi::zero (prec
), wi::one (prec
));
462 enum bool_range_state
{ BRS_FALSE
, BRS_TRUE
, BRS_EMPTY
, BRS_FULL
};
464 // Return the summary information about boolean range LHS. If EMPTY/FULL,
465 // return the equivalent range for TYPE in R; if FALSE/TRUE, do nothing.
467 static bool_range_state
468 get_bool_state (irange
&r
, const irange
&lhs
, tree val_type
)
470 // If there is no result, then this is unexecutable.
471 if (lhs
.undefined_p ())
480 // For TRUE, we can't just test for [1,1] because Ada can have
481 // multi-bit booleans, and TRUE values can be: [1, MAX], ~[0], etc.
482 if (lhs
.contains_p (build_zero_cst (lhs
.type ())))
484 r
.set_varying (val_type
);
491 // For relation opcodes, first try to see if the supplied relation
492 // forces a true or false result, and return that.
493 // Then check for undefined operands. If none of this applies,
497 relop_early_resolve (irange
&r
, tree type
, const irange
&op1
,
498 const irange
&op2
, relation_kind rel
,
499 relation_kind my_rel
)
501 // If known relation is a complete subset of this relation, always true.
502 if (relation_union (rel
, my_rel
) == my_rel
)
504 r
= range_true (type
);
508 // If known relation has no subset of this relation, always false.
509 if (relation_intersect (rel
, my_rel
) == VREL_EMPTY
)
511 r
= range_false (type
);
515 // If either operand is undefined, return VARYING.
516 if (empty_range_varying (r
, type
, op1
, op2
))
523 class operator_equal
: public range_operator
526 virtual bool fold_range (irange
&r
, tree type
,
529 relation_kind rel
= VREL_NONE
) const;
530 virtual bool op1_range (irange
&r
, tree type
,
533 relation_kind rel
= VREL_NONE
) const;
534 virtual bool op2_range (irange
&r
, tree type
,
537 relation_kind rel
= VREL_NONE
) const;
538 virtual enum tree_code
op1_op2_relation (const irange
&lhs
) const;
541 // Check if the LHS range indicates a relation between OP1 and OP2.
544 operator_equal::op1_op2_relation (const irange
&lhs
) const
546 if (lhs
.undefined_p ())
549 // FALSE = op1 == op2 indicates NE_EXPR.
553 // TRUE = op1 == op2 indicates EQ_EXPR.
554 if (!lhs
.contains_p (build_zero_cst (lhs
.type ())))
561 operator_equal::fold_range (irange
&r
, tree type
,
564 relation_kind rel
) const
566 if (relop_early_resolve (r
, type
, op1
, op2
, rel
, EQ_EXPR
))
569 // We can be sure the values are always equal or not if both ranges
570 // consist of a single value, and then compare them.
571 if (wi::eq_p (op1
.lower_bound (), op1
.upper_bound ())
572 && wi::eq_p (op2
.lower_bound (), op2
.upper_bound ()))
574 if (wi::eq_p (op1
.lower_bound (), op2
.upper_bound()))
575 r
= range_true (type
);
577 r
= range_false (type
);
581 // If ranges do not intersect, we know the range is not equal,
582 // otherwise we don't know anything for sure.
583 int_range_max tmp
= op1
;
585 if (tmp
.undefined_p ())
586 r
= range_false (type
);
588 r
= range_true_and_false (type
);
594 operator_equal::op1_range (irange
&r
, tree type
,
597 relation_kind rel ATTRIBUTE_UNUSED
) const
599 switch (get_bool_state (r
, lhs
, type
))
602 // If the result is false, the only time we know anything is
603 // if OP2 is a constant.
604 if (wi::eq_p (op2
.lower_bound(), op2
.upper_bound()))
610 r
.set_varying (type
);
614 // If it's true, the result is the same as OP2.
625 operator_equal::op2_range (irange
&r
, tree type
,
628 relation_kind rel
) const
630 return operator_equal::op1_range (r
, type
, lhs
, op1
, rel
);
633 class operator_not_equal
: public range_operator
636 virtual bool fold_range (irange
&r
, tree type
,
639 relation_kind rel
= VREL_NONE
) const;
640 virtual bool op1_range (irange
&r
, tree type
,
643 relation_kind rel
= VREL_NONE
) const;
644 virtual bool op2_range (irange
&r
, tree type
,
647 relation_kind rel
= VREL_NONE
) const;
648 virtual enum tree_code
op1_op2_relation (const irange
&lhs
) const;
651 // Check if the LHS range indicates a relation between OP1 and OP2.
654 operator_not_equal::op1_op2_relation (const irange
&lhs
) const
656 if (lhs
.undefined_p ())
659 // FALSE = op1 != op2 indicates EQ_EXPR.
663 // TRUE = op1 != op2 indicates NE_EXPR.
664 if (!lhs
.contains_p (build_zero_cst (lhs
.type ())))
670 operator_not_equal::fold_range (irange
&r
, tree type
,
673 relation_kind rel
) const
675 if (relop_early_resolve (r
, type
, op1
, op2
, rel
, NE_EXPR
))
678 // We can be sure the values are always equal or not if both ranges
679 // consist of a single value, and then compare them.
680 if (wi::eq_p (op1
.lower_bound (), op1
.upper_bound ())
681 && wi::eq_p (op2
.lower_bound (), op2
.upper_bound ()))
683 if (wi::ne_p (op1
.lower_bound (), op2
.upper_bound()))
684 r
= range_true (type
);
686 r
= range_false (type
);
690 // If ranges do not intersect, we know the range is not equal,
691 // otherwise we don't know anything for sure.
692 int_range_max tmp
= op1
;
694 if (tmp
.undefined_p ())
695 r
= range_true (type
);
697 r
= range_true_and_false (type
);
703 operator_not_equal::op1_range (irange
&r
, tree type
,
706 relation_kind rel ATTRIBUTE_UNUSED
) const
708 switch (get_bool_state (r
, lhs
, type
))
711 // If the result is true, the only time we know anything is if
712 // OP2 is a constant.
713 if (wi::eq_p (op2
.lower_bound(), op2
.upper_bound()))
719 r
.set_varying (type
);
723 // If it's false, the result is the same as OP2.
735 operator_not_equal::op2_range (irange
&r
, tree type
,
738 relation_kind rel
) const
740 return operator_not_equal::op1_range (r
, type
, lhs
, op1
, rel
);
743 // (X < VAL) produces the range of [MIN, VAL - 1].
746 build_lt (irange
&r
, tree type
, const wide_int
&val
)
748 wi::overflow_type ov
;
750 signop sgn
= TYPE_SIGN (type
);
752 // Signed 1 bit cannot represent 1 for subtraction.
754 lim
= wi::add (val
, -1, sgn
, &ov
);
756 lim
= wi::sub (val
, 1, sgn
, &ov
);
758 // If val - 1 underflows, check if X < MIN, which is an empty range.
762 r
= int_range
<1> (type
, min_limit (type
), lim
);
765 // (X <= VAL) produces the range of [MIN, VAL].
768 build_le (irange
&r
, tree type
, const wide_int
&val
)
770 r
= int_range
<1> (type
, min_limit (type
), val
);
773 // (X > VAL) produces the range of [VAL + 1, MAX].
776 build_gt (irange
&r
, tree type
, const wide_int
&val
)
778 wi::overflow_type ov
;
780 signop sgn
= TYPE_SIGN (type
);
782 // Signed 1 bit cannot represent 1 for addition.
784 lim
= wi::sub (val
, -1, sgn
, &ov
);
786 lim
= wi::add (val
, 1, sgn
, &ov
);
787 // If val + 1 overflows, check is for X > MAX, which is an empty range.
791 r
= int_range
<1> (type
, lim
, max_limit (type
));
794 // (X >= val) produces the range of [VAL, MAX].
797 build_ge (irange
&r
, tree type
, const wide_int
&val
)
799 r
= int_range
<1> (type
, val
, max_limit (type
));
803 class operator_lt
: public range_operator
806 virtual bool fold_range (irange
&r
, tree type
,
809 relation_kind rel
= VREL_NONE
) const;
810 virtual bool op1_range (irange
&r
, tree type
,
813 relation_kind rel
= VREL_NONE
) const;
814 virtual bool op2_range (irange
&r
, tree type
,
817 relation_kind rel
= VREL_NONE
) const;
818 virtual enum tree_code
op1_op2_relation (const irange
&lhs
) const;
821 // Check if the LHS range indicates a relation between OP1 and OP2.
824 operator_lt::op1_op2_relation (const irange
&lhs
) const
826 if (lhs
.undefined_p ())
829 // FALSE = op1 < op2 indicates GE_EXPR.
833 // TRUE = op1 < op2 indicates LT_EXPR.
834 if (!lhs
.contains_p (build_zero_cst (lhs
.type ())))
840 operator_lt::fold_range (irange
&r
, tree type
,
843 relation_kind rel
) const
845 if (relop_early_resolve (r
, type
, op1
, op2
, rel
, LT_EXPR
))
848 signop sign
= TYPE_SIGN (op1
.type ());
849 gcc_checking_assert (sign
== TYPE_SIGN (op2
.type ()));
851 if (wi::lt_p (op1
.upper_bound (), op2
.lower_bound (), sign
))
852 r
= range_true (type
);
853 else if (!wi::lt_p (op1
.lower_bound (), op2
.upper_bound (), sign
))
854 r
= range_false (type
);
856 r
= range_true_and_false (type
);
861 operator_lt::op1_range (irange
&r
, tree type
,
864 relation_kind rel ATTRIBUTE_UNUSED
) const
866 switch (get_bool_state (r
, lhs
, type
))
869 build_lt (r
, type
, op2
.upper_bound ());
873 build_ge (r
, type
, op2
.lower_bound ());
883 operator_lt::op2_range (irange
&r
, tree type
,
886 relation_kind rel ATTRIBUTE_UNUSED
) const
888 switch (get_bool_state (r
, lhs
, type
))
891 build_le (r
, type
, op1
.upper_bound ());
895 build_gt (r
, type
, op1
.lower_bound ());
905 class operator_le
: public range_operator
908 virtual bool fold_range (irange
&r
, tree type
,
911 relation_kind rel
= VREL_NONE
) const;
912 virtual bool op1_range (irange
&r
, tree type
,
915 relation_kind rel
= VREL_NONE
) const;
916 virtual bool op2_range (irange
&r
, tree type
,
919 relation_kind rel
= VREL_NONE
) const;
920 virtual enum tree_code
op1_op2_relation (const irange
&lhs
) const;
923 // Check if the LHS range indicates a relation between OP1 and OP2.
926 operator_le::op1_op2_relation (const irange
&lhs
) const
928 if (lhs
.undefined_p ())
931 // FALSE = op1 <= op2 indicates GT_EXPR.
935 // TRUE = op1 <= op2 indicates LE_EXPR.
936 if (!lhs
.contains_p (build_zero_cst (lhs
.type ())))
942 operator_le::fold_range (irange
&r
, tree type
,
945 relation_kind rel
) const
947 if (relop_early_resolve (r
, type
, op1
, op2
, rel
, LE_EXPR
))
950 signop sign
= TYPE_SIGN (op1
.type ());
951 gcc_checking_assert (sign
== TYPE_SIGN (op2
.type ()));
953 if (wi::le_p (op1
.upper_bound (), op2
.lower_bound (), sign
))
954 r
= range_true (type
);
955 else if (!wi::le_p (op1
.lower_bound (), op2
.upper_bound (), sign
))
956 r
= range_false (type
);
958 r
= range_true_and_false (type
);
963 operator_le::op1_range (irange
&r
, tree type
,
966 relation_kind rel ATTRIBUTE_UNUSED
) const
968 switch (get_bool_state (r
, lhs
, type
))
971 build_le (r
, type
, op2
.upper_bound ());
975 build_gt (r
, type
, op2
.lower_bound ());
985 operator_le::op2_range (irange
&r
, tree type
,
988 relation_kind rel ATTRIBUTE_UNUSED
) const
990 switch (get_bool_state (r
, lhs
, type
))
993 build_lt (r
, type
, op1
.upper_bound ());
997 build_ge (r
, type
, op1
.lower_bound ());
1007 class operator_gt
: public range_operator
1010 virtual bool fold_range (irange
&r
, tree type
,
1013 relation_kind rel
= VREL_NONE
) const;
1014 virtual bool op1_range (irange
&r
, tree type
,
1017 relation_kind rel
= VREL_NONE
) const;
1018 virtual bool op2_range (irange
&r
, tree type
,
1021 relation_kind rel
= VREL_NONE
) const;
1022 virtual enum tree_code
op1_op2_relation (const irange
&lhs
) const;
1025 // Check if the LHS range indicates a relation between OP1 and OP2.
1028 operator_gt::op1_op2_relation (const irange
&lhs
) const
1030 if (lhs
.undefined_p ())
1033 // FALSE = op1 > op2 indicates LE_EXPR.
1037 // TRUE = op1 > op2 indicates GT_EXPR.
1038 if (!lhs
.contains_p (build_zero_cst (lhs
.type ())))
1045 operator_gt::fold_range (irange
&r
, tree type
,
1046 const irange
&op1
, const irange
&op2
,
1047 relation_kind rel
) const
1049 if (relop_early_resolve (r
, type
, op1
, op2
, rel
, GT_EXPR
))
1052 signop sign
= TYPE_SIGN (op1
.type ());
1053 gcc_checking_assert (sign
== TYPE_SIGN (op2
.type ()));
1055 if (wi::gt_p (op1
.lower_bound (), op2
.upper_bound (), sign
))
1056 r
= range_true (type
);
1057 else if (!wi::gt_p (op1
.upper_bound (), op2
.lower_bound (), sign
))
1058 r
= range_false (type
);
1060 r
= range_true_and_false (type
);
1065 operator_gt::op1_range (irange
&r
, tree type
,
1066 const irange
&lhs
, const irange
&op2
,
1067 relation_kind rel ATTRIBUTE_UNUSED
) const
1069 switch (get_bool_state (r
, lhs
, type
))
1072 build_gt (r
, type
, op2
.lower_bound ());
1076 build_le (r
, type
, op2
.upper_bound ());
1086 operator_gt::op2_range (irange
&r
, tree type
,
1089 relation_kind rel ATTRIBUTE_UNUSED
) const
1091 switch (get_bool_state (r
, lhs
, type
))
1094 build_ge (r
, type
, op1
.lower_bound ());
1098 build_lt (r
, type
, op1
.upper_bound ());
1108 class operator_ge
: public range_operator
1111 virtual bool fold_range (irange
&r
, tree type
,
1114 relation_kind rel
= VREL_NONE
) const;
1115 virtual bool op1_range (irange
&r
, tree type
,
1118 relation_kind rel
= VREL_NONE
) const;
1119 virtual bool op2_range (irange
&r
, tree type
,
1122 relation_kind rel
= VREL_NONE
) const;
1123 virtual enum tree_code
op1_op2_relation (const irange
&lhs
) const;
1126 // Check if the LHS range indicates a relation between OP1 and OP2.
1129 operator_ge::op1_op2_relation (const irange
&lhs
) const
1131 if (lhs
.undefined_p ())
1134 // FALSE = op1 >= op2 indicates LT_EXPR.
1138 // TRUE = op1 >= op2 indicates GE_EXPR.
1139 if (!lhs
.contains_p (build_zero_cst (lhs
.type ())))
1145 operator_ge::fold_range (irange
&r
, tree type
,
1148 relation_kind rel
) const
1150 if (relop_early_resolve (r
, type
, op1
, op2
, rel
, GE_EXPR
))
1153 signop sign
= TYPE_SIGN (op1
.type ());
1154 gcc_checking_assert (sign
== TYPE_SIGN (op2
.type ()));
1156 if (wi::ge_p (op1
.lower_bound (), op2
.upper_bound (), sign
))
1157 r
= range_true (type
);
1158 else if (!wi::ge_p (op1
.upper_bound (), op2
.lower_bound (), sign
))
1159 r
= range_false (type
);
1161 r
= range_true_and_false (type
);
1166 operator_ge::op1_range (irange
&r
, tree type
,
1169 relation_kind rel ATTRIBUTE_UNUSED
) const
1171 switch (get_bool_state (r
, lhs
, type
))
1174 build_ge (r
, type
, op2
.lower_bound ());
1178 build_lt (r
, type
, op2
.upper_bound ());
1188 operator_ge::op2_range (irange
&r
, tree type
,
1191 relation_kind rel ATTRIBUTE_UNUSED
) const
1193 switch (get_bool_state (r
, lhs
, type
))
1196 build_gt (r
, type
, op1
.lower_bound ());
1200 build_le (r
, type
, op1
.upper_bound ());
1210 class operator_plus
: public range_operator
1213 virtual bool op1_range (irange
&r
, tree type
,
1216 relation_kind rel ATTRIBUTE_UNUSED
) const;
1217 virtual bool op2_range (irange
&r
, tree type
,
1220 relation_kind rel ATTRIBUTE_UNUSED
) const;
1221 virtual void wi_fold (irange
&r
, tree type
,
1222 const wide_int
&lh_lb
,
1223 const wide_int
&lh_ub
,
1224 const wide_int
&rh_lb
,
1225 const wide_int
&rh_ub
) const;
1226 virtual enum tree_code
lhs_op1_relation (const irange
&lhs
, const irange
&op1
,
1227 const irange
&op2
) const;
1228 virtual enum tree_code
lhs_op2_relation (const irange
&lhs
, const irange
&op1
,
1229 const irange
&op2
) const;
1232 // Check to see if the range of OP2 indicates anything about the relation
1233 // between LHS and OP1.
1236 operator_plus::lhs_op1_relation (const irange
&lhs
,
1238 const irange
&op2
) const
1240 if (lhs
.undefined_p () || op1
.undefined_p () || op2
.undefined_p ())
1243 tree type
= lhs
.type ();
1244 unsigned prec
= TYPE_PRECISION (type
);
1245 wi::overflow_type ovf1
, ovf2
;
1246 signop sign
= TYPE_SIGN (type
);
1248 // LHS = OP1 + 0 indicates LHS == OP1.
1252 if (TYPE_OVERFLOW_WRAPS (type
))
1254 wi::add (op1
.lower_bound (), op2
.lower_bound (), sign
, &ovf1
);
1255 wi::add (op1
.upper_bound (), op2
.upper_bound (), sign
, &ovf2
);
1258 ovf1
= ovf2
= wi::OVF_NONE
;
1260 // Never wrapping additions.
1263 // Positive op2 means lhs > op1.
1264 if (wi::gt_p (op2
.lower_bound (), wi::zero (prec
), sign
))
1266 if (wi::ge_p (op2
.lower_bound (), wi::zero (prec
), sign
))
1269 // Negative op2 means lhs < op1.
1270 if (wi::lt_p (op2
.upper_bound (), wi::zero (prec
), sign
))
1272 if (wi::le_p (op2
.upper_bound (), wi::zero (prec
), sign
))
1275 // Always wrapping additions.
1276 else if (ovf1
&& ovf1
== ovf2
)
1278 // Positive op2 means lhs < op1.
1279 if (wi::gt_p (op2
.lower_bound (), wi::zero (prec
), sign
))
1281 if (wi::ge_p (op2
.lower_bound (), wi::zero (prec
), sign
))
1284 // Negative op2 means lhs > op1.
1285 if (wi::lt_p (op2
.upper_bound (), wi::zero (prec
), sign
))
1287 if (wi::le_p (op2
.upper_bound (), wi::zero (prec
), sign
))
1291 // If op2 does not contain 0, then LHS and OP1 can never be equal.
1292 if (!range_includes_zero_p (&op2
))
1298 // PLUS is symmetrical, so we can simply call lhs_op1_relation with reversed
1302 operator_plus::lhs_op2_relation (const irange
&lhs
, const irange
&op1
,
1303 const irange
&op2
) const
1305 return lhs_op1_relation (lhs
, op2
, op1
);
1309 operator_plus::wi_fold (irange
&r
, tree type
,
1310 const wide_int
&lh_lb
, const wide_int
&lh_ub
,
1311 const wide_int
&rh_lb
, const wide_int
&rh_ub
) const
1313 wi::overflow_type ov_lb
, ov_ub
;
1314 signop s
= TYPE_SIGN (type
);
1315 wide_int new_lb
= wi::add (lh_lb
, rh_lb
, s
, &ov_lb
);
1316 wide_int new_ub
= wi::add (lh_ub
, rh_ub
, s
, &ov_ub
);
1317 value_range_with_overflow (r
, type
, new_lb
, new_ub
, ov_lb
, ov_ub
);
1321 operator_plus::op1_range (irange
&r
, tree type
,
1324 relation_kind rel ATTRIBUTE_UNUSED
) const
1326 return range_op_handler (MINUS_EXPR
, type
)->fold_range (r
, type
, lhs
, op2
);
1330 operator_plus::op2_range (irange
&r
, tree type
,
1333 relation_kind rel ATTRIBUTE_UNUSED
) const
1335 return range_op_handler (MINUS_EXPR
, type
)->fold_range (r
, type
, lhs
, op1
);
1339 class operator_minus
: public range_operator
1342 virtual bool op1_range (irange
&r
, tree type
,
1345 relation_kind rel ATTRIBUTE_UNUSED
) const;
1346 virtual bool op2_range (irange
&r
, tree type
,
1349 relation_kind rel ATTRIBUTE_UNUSED
) const;
1350 virtual void wi_fold (irange
&r
, tree type
,
1351 const wide_int
&lh_lb
,
1352 const wide_int
&lh_ub
,
1353 const wide_int
&rh_lb
,
1354 const wide_int
&rh_ub
) const;
1355 virtual bool op1_op2_relation_effect (irange
&lhs_range
,
1357 const irange
&op1_range
,
1358 const irange
&op2_range
,
1359 relation_kind rel
) const;
1363 operator_minus::wi_fold (irange
&r
, tree type
,
1364 const wide_int
&lh_lb
, const wide_int
&lh_ub
,
1365 const wide_int
&rh_lb
, const wide_int
&rh_ub
) const
1367 wi::overflow_type ov_lb
, ov_ub
;
1368 signop s
= TYPE_SIGN (type
);
1369 wide_int new_lb
= wi::sub (lh_lb
, rh_ub
, s
, &ov_lb
);
1370 wide_int new_ub
= wi::sub (lh_ub
, rh_lb
, s
, &ov_ub
);
1371 value_range_with_overflow (r
, type
, new_lb
, new_ub
, ov_lb
, ov_ub
);
1374 // Check to see if the relation REL between OP1 and OP2 has any effect on the
1375 // LHS of the expression. If so, apply it to LHS_RANGE. This is a helper
1376 // function for both MINUS_EXPR and POINTER_DIFF_EXPR.
1379 minus_op1_op2_relation_effect (irange
&lhs_range
, tree type
,
1380 const irange
&op1_range ATTRIBUTE_UNUSED
,
1381 const irange
&op2_range ATTRIBUTE_UNUSED
,
1384 if (rel
== VREL_NONE
)
1387 int_range
<2> rel_range
;
1388 unsigned prec
= TYPE_PRECISION (type
);
1389 signop sgn
= TYPE_SIGN (type
);
1391 // == and != produce [0,0] and ~[0,0] regardless of wrapping.
1393 rel_range
= int_range
<2> (type
, wi::zero (prec
), wi::zero (prec
));
1394 else if (rel
== NE_EXPR
)
1395 rel_range
= int_range
<2> (type
, wi::zero (prec
), wi::zero (prec
),
1397 else if (TYPE_OVERFLOW_WRAPS (type
))
1401 // For wrapping signed values and unsigned, if op1 > op2 or
1402 // op1 < op2, then op1 - op2 can be restricted to ~[0, 0].
1405 rel_range
= int_range
<2> (type
, wi::zero (prec
), wi::zero (prec
),
1416 // op1 > op2, op1 - op2 can be restricted to [1, +INF]
1418 rel_range
= int_range
<2> (type
, wi::one (prec
),
1419 wi::max_value (prec
, sgn
));
1421 // op1 >= op2, op1 - op2 can be restricted to [0, +INF]
1423 rel_range
= int_range
<2> (type
, wi::zero (prec
),
1424 wi::max_value (prec
, sgn
));
1426 // op1 < op2, op1 - op2 can be restricted to [-INF, -1]
1428 rel_range
= int_range
<2> (type
, wi::min_value (prec
, sgn
),
1429 wi::minus_one (prec
));
1431 // op1 <= op2, op1 - op2 can be restricted to [-INF, 0]
1433 rel_range
= int_range
<2> (type
, wi::min_value (prec
, sgn
),
1440 lhs_range
.intersect (rel_range
);
1445 operator_minus::op1_op2_relation_effect (irange
&lhs_range
, tree type
,
1446 const irange
&op1_range
,
1447 const irange
&op2_range
,
1448 relation_kind rel
) const
1450 return minus_op1_op2_relation_effect (lhs_range
, type
, op1_range
, op2_range
,
1455 operator_minus::op1_range (irange
&r
, tree type
,
1458 relation_kind rel ATTRIBUTE_UNUSED
) const
1460 return range_op_handler (PLUS_EXPR
, type
)->fold_range (r
, type
, lhs
, op2
);
1464 operator_minus::op2_range (irange
&r
, tree type
,
1467 relation_kind rel ATTRIBUTE_UNUSED
) const
1469 return fold_range (r
, type
, op1
, lhs
);
1473 class operator_pointer_diff
: public range_operator
1475 virtual bool op1_op2_relation_effect (irange
&lhs_range
,
1477 const irange
&op1_range
,
1478 const irange
&op2_range
,
1479 relation_kind rel
) const;
1483 operator_pointer_diff::op1_op2_relation_effect (irange
&lhs_range
, tree type
,
1484 const irange
&op1_range
,
1485 const irange
&op2_range
,
1486 relation_kind rel
) const
1488 return minus_op1_op2_relation_effect (lhs_range
, type
, op1_range
, op2_range
,
1493 class operator_min
: public range_operator
1496 virtual void wi_fold (irange
&r
, tree type
,
1497 const wide_int
&lh_lb
,
1498 const wide_int
&lh_ub
,
1499 const wide_int
&rh_lb
,
1500 const wide_int
&rh_ub
) const;
1504 operator_min::wi_fold (irange
&r
, tree type
,
1505 const wide_int
&lh_lb
, const wide_int
&lh_ub
,
1506 const wide_int
&rh_lb
, const wide_int
&rh_ub
) const
1508 signop s
= TYPE_SIGN (type
);
1509 wide_int new_lb
= wi::min (lh_lb
, rh_lb
, s
);
1510 wide_int new_ub
= wi::min (lh_ub
, rh_ub
, s
);
1511 value_range_with_overflow (r
, type
, new_lb
, new_ub
);
1515 class operator_max
: public range_operator
1518 virtual void wi_fold (irange
&r
, tree type
,
1519 const wide_int
&lh_lb
,
1520 const wide_int
&lh_ub
,
1521 const wide_int
&rh_lb
,
1522 const wide_int
&rh_ub
) const;
1526 operator_max::wi_fold (irange
&r
, tree type
,
1527 const wide_int
&lh_lb
, const wide_int
&lh_ub
,
1528 const wide_int
&rh_lb
, const wide_int
&rh_ub
) const
1530 signop s
= TYPE_SIGN (type
);
1531 wide_int new_lb
= wi::max (lh_lb
, rh_lb
, s
);
1532 wide_int new_ub
= wi::max (lh_ub
, rh_ub
, s
);
1533 value_range_with_overflow (r
, type
, new_lb
, new_ub
);
1537 class cross_product_operator
: public range_operator
1540 // Perform an operation between two wide-ints and place the result
1541 // in R. Return true if the operation overflowed.
1542 virtual bool wi_op_overflows (wide_int
&r
,
1545 const wide_int
&) const = 0;
1547 // Calculate the cross product of two sets of sub-ranges and return it.
1548 void wi_cross_product (irange
&r
, tree type
,
1549 const wide_int
&lh_lb
,
1550 const wide_int
&lh_ub
,
1551 const wide_int
&rh_lb
,
1552 const wide_int
&rh_ub
) const;
1555 // Calculate the cross product of two sets of ranges and return it.
1557 // Multiplications, divisions and shifts are a bit tricky to handle,
1558 // depending on the mix of signs we have in the two ranges, we need to
1559 // operate on different values to get the minimum and maximum values
1560 // for the new range. One approach is to figure out all the
1561 // variations of range combinations and do the operations.
1563 // However, this involves several calls to compare_values and it is
1564 // pretty convoluted. It's simpler to do the 4 operations (MIN0 OP
1565 // MIN1, MIN0 OP MAX1, MAX0 OP MIN1 and MAX0 OP MAX0 OP MAX1) and then
1566 // figure the smallest and largest values to form the new range.
1569 cross_product_operator::wi_cross_product (irange
&r
, tree type
,
1570 const wide_int
&lh_lb
,
1571 const wide_int
&lh_ub
,
1572 const wide_int
&rh_lb
,
1573 const wide_int
&rh_ub
) const
1575 wide_int cp1
, cp2
, cp3
, cp4
;
1576 // Default to varying.
1577 r
.set_varying (type
);
1579 // Compute the 4 cross operations, bailing if we get an overflow we
1581 if (wi_op_overflows (cp1
, type
, lh_lb
, rh_lb
))
1583 if (wi::eq_p (lh_lb
, lh_ub
))
1585 else if (wi_op_overflows (cp3
, type
, lh_ub
, rh_lb
))
1587 if (wi::eq_p (rh_lb
, rh_ub
))
1589 else if (wi_op_overflows (cp2
, type
, lh_lb
, rh_ub
))
1591 if (wi::eq_p (lh_lb
, lh_ub
))
1593 else if (wi_op_overflows (cp4
, type
, lh_ub
, rh_ub
))
1597 signop sign
= TYPE_SIGN (type
);
1598 if (wi::gt_p (cp1
, cp2
, sign
))
1599 std::swap (cp1
, cp2
);
1600 if (wi::gt_p (cp3
, cp4
, sign
))
1601 std::swap (cp3
, cp4
);
1603 // Choose min and max from the ordered pairs.
1604 wide_int res_lb
= wi::min (cp1
, cp3
, sign
);
1605 wide_int res_ub
= wi::max (cp2
, cp4
, sign
);
1606 value_range_with_overflow (r
, type
, res_lb
, res_ub
);
1610 class operator_mult
: public cross_product_operator
1613 virtual void wi_fold (irange
&r
, tree type
,
1614 const wide_int
&lh_lb
,
1615 const wide_int
&lh_ub
,
1616 const wide_int
&rh_lb
,
1617 const wide_int
&rh_ub
) const;
1618 virtual bool wi_op_overflows (wide_int
&res
, tree type
,
1619 const wide_int
&w0
, const wide_int
&w1
) const;
1620 virtual bool op1_range (irange
&r
, tree type
,
1623 relation_kind rel ATTRIBUTE_UNUSED
) const;
1624 virtual bool op2_range (irange
&r
, tree type
,
1627 relation_kind rel ATTRIBUTE_UNUSED
) const;
1631 operator_mult::op1_range (irange
&r
, tree type
,
1632 const irange
&lhs
, const irange
&op2
,
1633 relation_kind rel ATTRIBUTE_UNUSED
) const
1637 // We can't solve 0 = OP1 * N by dividing by N with a wrapping type.
1638 // For example: For 0 = OP1 * 2, OP1 could be 0, or MAXINT, whereas
1639 // for 4 = OP1 * 2, OP1 could be 2 or 130 (unsigned 8-bit)
1640 if (TYPE_OVERFLOW_WRAPS (type
))
1643 if (op2
.singleton_p (&offset
) && !integer_zerop (offset
))
1644 return range_op_handler (TRUNC_DIV_EXPR
, type
)->fold_range (r
, type
,
1650 operator_mult::op2_range (irange
&r
, tree type
,
1651 const irange
&lhs
, const irange
&op1
,
1652 relation_kind rel
) const
1654 return operator_mult::op1_range (r
, type
, lhs
, op1
, rel
);
1658 operator_mult::wi_op_overflows (wide_int
&res
, tree type
,
1659 const wide_int
&w0
, const wide_int
&w1
) const
1661 wi::overflow_type overflow
= wi::OVF_NONE
;
1662 signop sign
= TYPE_SIGN (type
);
1663 res
= wi::mul (w0
, w1
, sign
, &overflow
);
1664 if (overflow
&& TYPE_OVERFLOW_UNDEFINED (type
))
1666 // For multiplication, the sign of the overflow is given
1667 // by the comparison of the signs of the operands.
1668 if (sign
== UNSIGNED
|| w0
.sign_mask () == w1
.sign_mask ())
1669 res
= wi::max_value (w0
.get_precision (), sign
);
1671 res
= wi::min_value (w0
.get_precision (), sign
);
1678 operator_mult::wi_fold (irange
&r
, tree type
,
1679 const wide_int
&lh_lb
, const wide_int
&lh_ub
,
1680 const wide_int
&rh_lb
, const wide_int
&rh_ub
) const
1682 if (TYPE_OVERFLOW_UNDEFINED (type
))
1684 wi_cross_product (r
, type
, lh_lb
, lh_ub
, rh_lb
, rh_ub
);
1688 // Multiply the ranges when overflow wraps. This is basically fancy
1689 // code so we don't drop to varying with an unsigned
1692 // This test requires 2*prec bits if both operands are signed and
1693 // 2*prec + 2 bits if either is not. Therefore, extend the values
1694 // using the sign of the result to PREC2. From here on out,
1695 // everthing is just signed math no matter what the input types
1698 signop sign
= TYPE_SIGN (type
);
1699 unsigned prec
= TYPE_PRECISION (type
);
1700 widest2_int min0
= widest2_int::from (lh_lb
, sign
);
1701 widest2_int max0
= widest2_int::from (lh_ub
, sign
);
1702 widest2_int min1
= widest2_int::from (rh_lb
, sign
);
1703 widest2_int max1
= widest2_int::from (rh_ub
, sign
);
1704 widest2_int sizem1
= wi::mask
<widest2_int
> (prec
, false);
1705 widest2_int size
= sizem1
+ 1;
1707 // Canonicalize the intervals.
1708 if (sign
== UNSIGNED
)
1710 if (wi::ltu_p (size
, min0
+ max0
))
1715 if (wi::ltu_p (size
, min1
+ max1
))
1722 // Sort the 4 products so that min is in prod0 and max is in
1724 widest2_int prod0
= min0
* min1
;
1725 widest2_int prod1
= min0
* max1
;
1726 widest2_int prod2
= max0
* min1
;
1727 widest2_int prod3
= max0
* max1
;
1729 // min0min1 > max0max1
1731 std::swap (prod0
, prod3
);
1733 // min0max1 > max0min1
1735 std::swap (prod1
, prod2
);
1738 std::swap (prod0
, prod1
);
1741 std::swap (prod2
, prod3
);
1744 prod2
= prod3
- prod0
;
1745 if (wi::geu_p (prod2
, sizem1
))
1746 // The range covers all values.
1747 r
.set_varying (type
);
1750 wide_int new_lb
= wide_int::from (prod0
, prec
, sign
);
1751 wide_int new_ub
= wide_int::from (prod3
, prec
, sign
);
1752 create_possibly_reversed_range (r
, type
, new_lb
, new_ub
);
1757 class operator_div
: public cross_product_operator
1760 operator_div (enum tree_code c
) { code
= c
; }
1761 virtual void wi_fold (irange
&r
, tree type
,
1762 const wide_int
&lh_lb
,
1763 const wide_int
&lh_ub
,
1764 const wide_int
&rh_lb
,
1765 const wide_int
&rh_ub
) const;
1766 virtual bool wi_op_overflows (wide_int
&res
, tree type
,
1767 const wide_int
&, const wide_int
&) const;
1769 enum tree_code code
;
1773 operator_div::wi_op_overflows (wide_int
&res
, tree type
,
1774 const wide_int
&w0
, const wide_int
&w1
) const
1779 wi::overflow_type overflow
= wi::OVF_NONE
;
1780 signop sign
= TYPE_SIGN (type
);
1784 case EXACT_DIV_EXPR
:
1785 // EXACT_DIV_EXPR is implemented as TRUNC_DIV_EXPR in
1786 // operator_exact_divide. No need to handle it here.
1789 case TRUNC_DIV_EXPR
:
1790 res
= wi::div_trunc (w0
, w1
, sign
, &overflow
);
1792 case FLOOR_DIV_EXPR
:
1793 res
= wi::div_floor (w0
, w1
, sign
, &overflow
);
1795 case ROUND_DIV_EXPR
:
1796 res
= wi::div_round (w0
, w1
, sign
, &overflow
);
1799 res
= wi::div_ceil (w0
, w1
, sign
, &overflow
);
1805 if (overflow
&& TYPE_OVERFLOW_UNDEFINED (type
))
1807 // For division, the only case is -INF / -1 = +INF.
1808 res
= wi::max_value (w0
.get_precision (), sign
);
1815 operator_div::wi_fold (irange
&r
, tree type
,
1816 const wide_int
&lh_lb
, const wide_int
&lh_ub
,
1817 const wide_int
&rh_lb
, const wide_int
&rh_ub
) const
1819 const wide_int dividend_min
= lh_lb
;
1820 const wide_int dividend_max
= lh_ub
;
1821 const wide_int divisor_min
= rh_lb
;
1822 const wide_int divisor_max
= rh_ub
;
1823 signop sign
= TYPE_SIGN (type
);
1824 unsigned prec
= TYPE_PRECISION (type
);
1825 wide_int extra_min
, extra_max
;
1827 // If we know we won't divide by zero, just do the division.
1828 if (!wi_includes_zero_p (type
, divisor_min
, divisor_max
))
1830 wi_cross_product (r
, type
, dividend_min
, dividend_max
,
1831 divisor_min
, divisor_max
);
1835 // If we're definitely dividing by zero, there's nothing to do.
1836 if (wi_zero_p (type
, divisor_min
, divisor_max
))
1842 // Perform the division in 2 parts, [LB, -1] and [1, UB], which will
1843 // skip any division by zero.
1845 // First divide by the negative numbers, if any.
1846 if (wi::neg_p (divisor_min
, sign
))
1847 wi_cross_product (r
, type
, dividend_min
, dividend_max
,
1848 divisor_min
, wi::minus_one (prec
));
1852 // Then divide by the non-zero positive numbers, if any.
1853 if (wi::gt_p (divisor_max
, wi::zero (prec
), sign
))
1856 wi_cross_product (tmp
, type
, dividend_min
, dividend_max
,
1857 wi::one (prec
), divisor_max
);
1860 // We shouldn't still have undefined here.
1861 gcc_checking_assert (!r
.undefined_p ());
1864 operator_div
op_trunc_div (TRUNC_DIV_EXPR
);
1865 operator_div
op_floor_div (FLOOR_DIV_EXPR
);
1866 operator_div
op_round_div (ROUND_DIV_EXPR
);
1867 operator_div
op_ceil_div (CEIL_DIV_EXPR
);
1870 class operator_exact_divide
: public operator_div
1873 operator_exact_divide () : operator_div (TRUNC_DIV_EXPR
) { }
1874 virtual bool op1_range (irange
&r
, tree type
,
1877 relation_kind rel ATTRIBUTE_UNUSED
) const;
1882 operator_exact_divide::op1_range (irange
&r
, tree type
,
1885 relation_kind rel ATTRIBUTE_UNUSED
) const
1888 // [2, 4] = op1 / [3,3] since its exact divide, no need to worry about
1889 // remainders in the endpoints, so op1 = [2,4] * [3,3] = [6,12].
1890 // We wont bother trying to enumerate all the in between stuff :-P
1891 // TRUE accuraacy is [6,6][9,9][12,12]. This is unlikely to matter most of
1892 // the time however.
1893 // If op2 is a multiple of 2, we would be able to set some non-zero bits.
1894 if (op2
.singleton_p (&offset
)
1895 && !integer_zerop (offset
))
1896 return range_op_handler (MULT_EXPR
, type
)->fold_range (r
, type
, lhs
, op2
);
1901 class operator_lshift
: public cross_product_operator
1904 virtual bool op1_range (irange
&r
, tree type
,
1907 relation_kind rel
= VREL_NONE
) const;
1908 virtual bool fold_range (irange
&r
, tree type
,
1911 relation_kind rel
= VREL_NONE
) const;
1913 virtual void wi_fold (irange
&r
, tree type
,
1914 const wide_int
&lh_lb
, const wide_int
&lh_ub
,
1915 const wide_int
&rh_lb
, const wide_int
&rh_ub
) const;
1916 virtual bool wi_op_overflows (wide_int
&res
,
1919 const wide_int
&) const;
1922 class operator_rshift
: public cross_product_operator
1925 virtual bool fold_range (irange
&r
, tree type
,
1928 relation_kind rel
= VREL_NONE
) const;
1929 virtual void wi_fold (irange
&r
, tree type
,
1930 const wide_int
&lh_lb
,
1931 const wide_int
&lh_ub
,
1932 const wide_int
&rh_lb
,
1933 const wide_int
&rh_ub
) const;
1934 virtual bool wi_op_overflows (wide_int
&res
,
1937 const wide_int
&w1
) const;
1938 virtual bool op1_range (irange
&, tree type
,
1941 relation_kind rel
= VREL_NONE
) const;
1942 virtual enum tree_code
lhs_op1_relation (const irange
&lhs
,
1944 const irange
&op2
) const;
1949 operator_rshift::lhs_op1_relation (const irange
&lhs ATTRIBUTE_UNUSED
,
1951 const irange
&op2
) const
1953 // If both operands range are >= 0, then the LHS <= op1.
1954 if (!op1
.undefined_p () && !op2
.undefined_p ()
1955 && wi::ge_p (op1
.lower_bound (), 0, TYPE_SIGN (op1
.type ()))
1956 && wi::ge_p (op2
.lower_bound (), 0, TYPE_SIGN (op2
.type ())))
1962 operator_lshift::fold_range (irange
&r
, tree type
,
1965 relation_kind rel
) const
1967 int_range_max shift_range
;
1968 if (!get_shift_range (shift_range
, type
, op2
))
1970 if (op2
.undefined_p ())
1973 r
.set_varying (type
);
1977 // Transform left shifts by constants into multiplies.
1978 if (shift_range
.singleton_p ())
1980 unsigned shift
= shift_range
.lower_bound ().to_uhwi ();
1981 wide_int tmp
= wi::set_bit_in_zero (shift
, TYPE_PRECISION (type
));
1982 int_range
<1> mult (type
, tmp
, tmp
);
1984 // Force wrapping multiplication.
1985 bool saved_flag_wrapv
= flag_wrapv
;
1986 bool saved_flag_wrapv_pointer
= flag_wrapv_pointer
;
1988 flag_wrapv_pointer
= 1;
1989 bool b
= op_mult
.fold_range (r
, type
, op1
, mult
);
1990 flag_wrapv
= saved_flag_wrapv
;
1991 flag_wrapv_pointer
= saved_flag_wrapv_pointer
;
1995 // Otherwise, invoke the generic fold routine.
1996 return range_operator::fold_range (r
, type
, op1
, shift_range
, rel
);
2000 operator_lshift::wi_fold (irange
&r
, tree type
,
2001 const wide_int
&lh_lb
, const wide_int
&lh_ub
,
2002 const wide_int
&rh_lb
, const wide_int
&rh_ub
) const
2004 signop sign
= TYPE_SIGN (type
);
2005 unsigned prec
= TYPE_PRECISION (type
);
2006 int overflow_pos
= sign
== SIGNED
? prec
- 1 : prec
;
2007 int bound_shift
= overflow_pos
- rh_ub
.to_shwi ();
2008 // If bound_shift == HOST_BITS_PER_WIDE_INT, the llshift can
2009 // overflow. However, for that to happen, rh.max needs to be zero,
2010 // which means rh is a singleton range of zero, which means we simply return
2011 // [lh_lb, lh_ub] as the range.
2012 if (wi::eq_p (rh_ub
, rh_lb
) && wi::eq_p (rh_ub
, 0))
2014 r
= int_range
<2> (type
, lh_lb
, lh_ub
);
2018 wide_int bound
= wi::set_bit_in_zero (bound_shift
, prec
);
2019 wide_int complement
= ~(bound
- 1);
2020 wide_int low_bound
, high_bound
;
2021 bool in_bounds
= false;
2023 if (sign
== UNSIGNED
)
2026 high_bound
= complement
;
2027 if (wi::ltu_p (lh_ub
, low_bound
))
2029 // [5, 6] << [1, 2] == [10, 24].
2030 // We're shifting out only zeroes, the value increases
2034 else if (wi::ltu_p (high_bound
, lh_lb
))
2036 // [0xffffff00, 0xffffffff] << [1, 2]
2037 // == [0xfffffc00, 0xfffffffe].
2038 // We're shifting out only ones, the value decreases
2045 // [-1, 1] << [1, 2] == [-4, 4]
2046 low_bound
= complement
;
2048 if (wi::lts_p (lh_ub
, high_bound
)
2049 && wi::lts_p (low_bound
, lh_lb
))
2051 // For non-negative numbers, we're shifting out only zeroes,
2052 // the value increases monotonically. For negative numbers,
2053 // we're shifting out only ones, the value decreases
2060 wi_cross_product (r
, type
, lh_lb
, lh_ub
, rh_lb
, rh_ub
);
2062 r
.set_varying (type
);
2066 operator_lshift::wi_op_overflows (wide_int
&res
, tree type
,
2067 const wide_int
&w0
, const wide_int
&w1
) const
2069 signop sign
= TYPE_SIGN (type
);
2072 // It's unclear from the C standard whether shifts can overflow.
2073 // The following code ignores overflow; perhaps a C standard
2074 // interpretation ruling is needed.
2075 res
= wi::rshift (w0
, -w1
, sign
);
2078 res
= wi::lshift (w0
, w1
);
2083 operator_lshift::op1_range (irange
&r
,
2087 relation_kind rel ATTRIBUTE_UNUSED
) const
2091 if (!lhs
.contains_p (build_zero_cst (type
)))
2092 r
.set_nonzero (type
);
2094 r
.set_varying (type
);
2096 if (op2
.singleton_p (&shift_amount
))
2098 wide_int shift
= wi::to_wide (shift_amount
);
2099 if (wi::lt_p (shift
, 0, SIGNED
))
2101 if (wi::ge_p (shift
, wi::uhwi (TYPE_PRECISION (type
),
2102 TYPE_PRECISION (op2
.type ())),
2111 // Work completely in unsigned mode to start.
2113 int_range_max tmp_range
;
2114 if (TYPE_SIGN (type
) == SIGNED
)
2116 int_range_max tmp
= lhs
;
2117 utype
= unsigned_type_for (type
);
2118 range_cast (tmp
, utype
);
2119 op_rshift
.fold_range (tmp_range
, utype
, tmp
, op2
);
2122 op_rshift
.fold_range (tmp_range
, utype
, lhs
, op2
);
2124 // Start with ranges which can produce the LHS by right shifting the
2125 // result by the shift amount.
2126 // ie [0x08, 0xF0] = op1 << 2 will start with
2127 // [00001000, 11110000] = op1 << 2
2128 // [0x02, 0x4C] aka [00000010, 00111100]
2130 // Then create a range from the LB with the least significant upper bit
2131 // set, to the upper bound with all the bits set.
2132 // This would be [0x42, 0xFC] aka [01000010, 11111100].
2134 // Ideally we do this for each subrange, but just lump them all for now.
2135 unsigned low_bits
= TYPE_PRECISION (utype
)
2136 - TREE_INT_CST_LOW (shift_amount
);
2137 wide_int up_mask
= wi::mask (low_bits
, true, TYPE_PRECISION (utype
));
2138 wide_int new_ub
= wi::bit_or (up_mask
, tmp_range
.upper_bound ());
2139 wide_int new_lb
= wi::set_bit (tmp_range
.lower_bound (), low_bits
);
2140 int_range
<2> fill_range (utype
, new_lb
, new_ub
);
2141 tmp_range
.union_ (fill_range
);
2144 range_cast (tmp_range
, type
);
2146 r
.intersect (tmp_range
);
2150 return !r
.varying_p ();
2154 operator_rshift::op1_range (irange
&r
,
2158 relation_kind rel ATTRIBUTE_UNUSED
) const
2161 if (op2
.singleton_p (&shift
))
2163 // Ignore nonsensical shifts.
2164 unsigned prec
= TYPE_PRECISION (type
);
2165 if (wi::ge_p (wi::to_wide (shift
),
2166 wi::uhwi (prec
, TYPE_PRECISION (TREE_TYPE (shift
))),
2169 if (wi::to_wide (shift
) == 0)
2175 // Folding the original operation may discard some impossible
2176 // ranges from the LHS.
2177 int_range_max lhs_refined
;
2178 op_rshift
.fold_range (lhs_refined
, type
, int_range
<1> (type
), op2
);
2179 lhs_refined
.intersect (lhs
);
2180 if (lhs_refined
.undefined_p ())
2185 int_range_max
shift_range (shift
, shift
);
2186 int_range_max lb
, ub
;
2187 op_lshift
.fold_range (lb
, type
, lhs_refined
, shift_range
);
2189 // 0000 0111 = OP1 >> 3
2191 // OP1 is anything from 0011 1000 to 0011 1111. That is, a
2192 // range from LHS<<3 plus a mask of the 3 bits we shifted on the
2193 // right hand side (0x07).
2194 tree mask
= fold_build1 (BIT_NOT_EXPR
, type
,
2195 fold_build2 (LSHIFT_EXPR
, type
,
2196 build_minus_one_cst (type
),
2198 int_range_max
mask_range (build_zero_cst (type
), mask
);
2199 op_plus
.fold_range (ub
, type
, lb
, mask_range
);
2202 if (!lhs_refined
.contains_p (build_zero_cst (type
)))
2204 mask_range
.invert ();
2205 r
.intersect (mask_range
);
2213 operator_rshift::wi_op_overflows (wide_int
&res
,
2216 const wide_int
&w1
) const
2218 signop sign
= TYPE_SIGN (type
);
2220 res
= wi::lshift (w0
, -w1
);
2223 // It's unclear from the C standard whether shifts can overflow.
2224 // The following code ignores overflow; perhaps a C standard
2225 // interpretation ruling is needed.
2226 res
= wi::rshift (w0
, w1
, sign
);
2232 operator_rshift::fold_range (irange
&r
, tree type
,
2235 relation_kind rel
) const
2237 int_range_max shift
;
2238 if (!get_shift_range (shift
, type
, op2
))
2240 if (op2
.undefined_p ())
2243 r
.set_varying (type
);
2247 return range_operator::fold_range (r
, type
, op1
, shift
, rel
);
2251 operator_rshift::wi_fold (irange
&r
, tree type
,
2252 const wide_int
&lh_lb
, const wide_int
&lh_ub
,
2253 const wide_int
&rh_lb
, const wide_int
&rh_ub
) const
2255 wi_cross_product (r
, type
, lh_lb
, lh_ub
, rh_lb
, rh_ub
);
2259 class operator_cast
: public range_operator
2262 virtual bool fold_range (irange
&r
, tree type
,
2265 relation_kind rel
= VREL_NONE
) const;
2266 virtual bool op1_range (irange
&r
, tree type
,
2269 relation_kind rel
= VREL_NONE
) const;
2271 bool truncating_cast_p (const irange
&inner
, const irange
&outer
) const;
2272 bool inside_domain_p (const wide_int
&min
, const wide_int
&max
,
2273 const irange
&outer
) const;
2274 void fold_pair (irange
&r
, unsigned index
, const irange
&inner
,
2275 const irange
&outer
) const;
2278 // Return TRUE if casting from INNER to OUTER is a truncating cast.
2281 operator_cast::truncating_cast_p (const irange
&inner
,
2282 const irange
&outer
) const
2284 return TYPE_PRECISION (outer
.type ()) < TYPE_PRECISION (inner
.type ());
2287 // Return TRUE if [MIN,MAX] is inside the domain of RANGE's type.
2290 operator_cast::inside_domain_p (const wide_int
&min
,
2291 const wide_int
&max
,
2292 const irange
&range
) const
2294 wide_int domain_min
= wi::to_wide (vrp_val_min (range
.type ()));
2295 wide_int domain_max
= wi::to_wide (vrp_val_max (range
.type ()));
2296 signop domain_sign
= TYPE_SIGN (range
.type ());
2297 return (wi::le_p (min
, domain_max
, domain_sign
)
2298 && wi::le_p (max
, domain_max
, domain_sign
)
2299 && wi::ge_p (min
, domain_min
, domain_sign
)
2300 && wi::ge_p (max
, domain_min
, domain_sign
));
2304 // Helper for fold_range which work on a pair at a time.
2307 operator_cast::fold_pair (irange
&r
, unsigned index
,
2308 const irange
&inner
,
2309 const irange
&outer
) const
2311 tree inner_type
= inner
.type ();
2312 tree outer_type
= outer
.type ();
2313 signop inner_sign
= TYPE_SIGN (inner_type
);
2314 unsigned outer_prec
= TYPE_PRECISION (outer_type
);
2316 // check to see if casting from INNER to OUTER is a conversion that
2317 // fits in the resulting OUTER type.
2318 wide_int inner_lb
= inner
.lower_bound (index
);
2319 wide_int inner_ub
= inner
.upper_bound (index
);
2320 if (truncating_cast_p (inner
, outer
))
2322 // We may be able to accomodate a truncating cast if the
2323 // resulting range can be represented in the target type...
2324 if (wi::rshift (wi::sub (inner_ub
, inner_lb
),
2325 wi::uhwi (outer_prec
, TYPE_PRECISION (inner
.type ())),
2328 r
.set_varying (outer_type
);
2332 // ...but we must still verify that the final range fits in the
2333 // domain. This catches -fstrict-enum restrictions where the domain
2334 // range is smaller than what fits in the underlying type.
2335 wide_int min
= wide_int::from (inner_lb
, outer_prec
, inner_sign
);
2336 wide_int max
= wide_int::from (inner_ub
, outer_prec
, inner_sign
);
2337 if (inside_domain_p (min
, max
, outer
))
2338 create_possibly_reversed_range (r
, outer_type
, min
, max
);
2340 r
.set_varying (outer_type
);
2345 operator_cast::fold_range (irange
&r
, tree type ATTRIBUTE_UNUSED
,
2346 const irange
&inner
,
2347 const irange
&outer
,
2348 relation_kind rel ATTRIBUTE_UNUSED
) const
2350 if (empty_range_varying (r
, type
, inner
, outer
))
2353 gcc_checking_assert (outer
.varying_p ());
2354 gcc_checking_assert (inner
.num_pairs () > 0);
2356 // Avoid a temporary by folding the first pair directly into the result.
2357 fold_pair (r
, 0, inner
, outer
);
2359 // Then process any additonal pairs by unioning with their results.
2360 for (unsigned x
= 1; x
< inner
.num_pairs (); ++x
)
2363 fold_pair (tmp
, x
, inner
, outer
);
2372 operator_cast::op1_range (irange
&r
, tree type
,
2375 relation_kind rel ATTRIBUTE_UNUSED
) const
2377 tree lhs_type
= lhs
.type ();
2378 gcc_checking_assert (types_compatible_p (op2
.type(), type
));
2380 // If we are calculating a pointer, shortcut to what we really care about.
2381 if (POINTER_TYPE_P (type
))
2383 // Conversion from other pointers or a constant (including 0/NULL)
2384 // are straightforward.
2385 if (POINTER_TYPE_P (lhs
.type ())
2386 || (lhs
.singleton_p ()
2387 && TYPE_PRECISION (lhs
.type ()) >= TYPE_PRECISION (type
)))
2390 range_cast (r
, type
);
2394 // If the LHS is not a pointer nor a singleton, then it is
2395 // either VARYING or non-zero.
2396 if (!lhs
.contains_p (build_zero_cst (lhs
.type ())))
2397 r
.set_nonzero (type
);
2399 r
.set_varying (type
);
2405 if (truncating_cast_p (op2
, lhs
))
2407 if (lhs
.varying_p ())
2408 r
.set_varying (type
);
2411 // We want to insert the LHS as an unsigned value since it
2412 // would not trigger the signed bit of the larger type.
2413 int_range_max converted_lhs
= lhs
;
2414 range_cast (converted_lhs
, unsigned_type_for (lhs_type
));
2415 range_cast (converted_lhs
, type
);
2416 // Start by building the positive signed outer range for the type.
2417 wide_int lim
= wi::set_bit_in_zero (TYPE_PRECISION (lhs_type
),
2418 TYPE_PRECISION (type
));
2419 r
= int_range
<1> (type
, lim
, wi::max_value (TYPE_PRECISION (type
),
2421 // For the signed part, we need to simply union the 2 ranges now.
2422 r
.union_ (converted_lhs
);
2424 // Create maximal negative number outside of LHS bits.
2425 lim
= wi::mask (TYPE_PRECISION (lhs_type
), true,
2426 TYPE_PRECISION (type
));
2427 // Add this to the unsigned LHS range(s).
2428 int_range_max
lim_range (type
, lim
, lim
);
2429 int_range_max lhs_neg
;
2430 range_op_handler (PLUS_EXPR
, type
)->fold_range (lhs_neg
,
2434 // lhs_neg now has all the negative versions of the LHS.
2435 // Now union in all the values from SIGNED MIN (0x80000) to
2436 // lim-1 in order to fill in all the ranges with the upper
2439 // PR 97317. If the lhs has only 1 bit less precision than the rhs,
2440 // we don't need to create a range from min to lim-1
2441 // calculate neg range traps trying to create [lim, lim - 1].
2442 wide_int min_val
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
2445 int_range_max
neg (type
,
2446 wi::min_value (TYPE_PRECISION (type
),
2449 lhs_neg
.union_ (neg
);
2451 // And finally, munge the signed and unsigned portions.
2454 // And intersect with any known value passed in the extra operand.
2460 if (TYPE_PRECISION (lhs_type
) == TYPE_PRECISION (type
))
2464 // The cast is not truncating, and the range is restricted to
2465 // the range of the RHS by this assignment.
2467 // Cast the range of the RHS to the type of the LHS.
2468 fold_range (tmp
, lhs_type
, int_range
<1> (type
), int_range
<1> (lhs_type
));
2469 // Intersect this with the LHS range will produce the range,
2470 // which will be cast to the RHS type before returning.
2471 tmp
.intersect (lhs
);
2474 // Cast the calculated range to the type of the RHS.
2475 fold_range (r
, type
, tmp
, int_range
<1> (type
));
2480 class operator_logical_and
: public range_operator
2483 virtual bool fold_range (irange
&r
, tree type
,
2486 relation_kind rel
= VREL_NONE
) const;
2487 virtual bool op1_range (irange
&r
, tree type
,
2490 relation_kind rel
= VREL_NONE
) const;
2491 virtual bool op2_range (irange
&r
, tree type
,
2494 relation_kind rel
= VREL_NONE
) const;
2499 operator_logical_and::fold_range (irange
&r
, tree type
,
2502 relation_kind rel ATTRIBUTE_UNUSED
) const
2504 if (empty_range_varying (r
, type
, lh
, rh
))
2507 // 0 && anything is 0.
2508 if ((wi::eq_p (lh
.lower_bound (), 0) && wi::eq_p (lh
.upper_bound (), 0))
2509 || (wi::eq_p (lh
.lower_bound (), 0) && wi::eq_p (rh
.upper_bound (), 0)))
2510 r
= range_false (type
);
2511 else if (lh
.contains_p (build_zero_cst (lh
.type ()))
2512 || rh
.contains_p (build_zero_cst (rh
.type ())))
2513 // To reach this point, there must be a logical 1 on each side, and
2514 // the only remaining question is whether there is a zero or not.
2515 r
= range_true_and_false (type
);
2517 r
= range_true (type
);
2522 operator_logical_and::op1_range (irange
&r
, tree type
,
2524 const irange
&op2 ATTRIBUTE_UNUSED
,
2525 relation_kind rel ATTRIBUTE_UNUSED
) const
2527 switch (get_bool_state (r
, lhs
, type
))
2530 // A true result means both sides of the AND must be true.
2531 r
= range_true (type
);
2534 // Any other result means only one side has to be false, the
2535 // other side can be anything. So we cannot be sure of any
2537 r
= range_true_and_false (type
);
2544 operator_logical_and::op2_range (irange
&r
, tree type
,
2547 relation_kind rel ATTRIBUTE_UNUSED
) const
2549 return operator_logical_and::op1_range (r
, type
, lhs
, op1
);
2553 class operator_bitwise_and
: public range_operator
2556 virtual bool fold_range (irange
&r
, tree type
,
2559 relation_kind rel
= VREL_NONE
) const;
2560 virtual bool op1_range (irange
&r
, tree type
,
2563 relation_kind rel
= VREL_NONE
) const;
2564 virtual bool op2_range (irange
&r
, tree type
,
2567 relation_kind rel
= VREL_NONE
) const;
2568 virtual void wi_fold (irange
&r
, tree type
,
2569 const wide_int
&lh_lb
,
2570 const wide_int
&lh_ub
,
2571 const wide_int
&rh_lb
,
2572 const wide_int
&rh_ub
) const;
2574 void simple_op1_range_solver (irange
&r
, tree type
,
2576 const irange
&op2
) const;
2577 void remove_impossible_ranges (irange
&r
, const irange
&rh
) const;
2581 unsigned_singleton_p (const irange
&op
)
2584 if (op
.singleton_p (&mask
))
2586 wide_int x
= wi::to_wide (mask
);
2587 return wi::ge_p (x
, 0, TYPE_SIGN (op
.type ()));
2592 // Remove any ranges from R that are known to be impossible when an
2593 // range is ANDed with MASK.
2596 operator_bitwise_and::remove_impossible_ranges (irange
&r
,
2597 const irange
&rmask
) const
2599 if (r
.undefined_p () || !unsigned_singleton_p (rmask
))
2602 wide_int mask
= rmask
.lower_bound ();
2603 tree type
= r
.type ();
2604 int prec
= TYPE_PRECISION (type
);
2605 int leading_zeros
= wi::clz (mask
);
2606 int_range_max impossible_ranges
;
2608 /* We know that starting at the most significant bit, any 0 in the
2609 mask means the resulting range cannot contain a 1 in that same
2610 position. This means the following ranges are impossible:
2614 01xx xxxx [0100 0000, 0111 1111]
2615 001x xxxx [0010 0000, 0011 1111]
2616 0000 01xx [0000 0100, 0000 0111]
2617 0000 0001 [0000 0001, 0000 0001]
2619 wide_int one
= wi::one (prec
);
2620 for (int i
= 0; i
< prec
- leading_zeros
- 1; ++i
)
2621 if (wi::bit_and (mask
, wi::lshift (one
, wi::uhwi (i
, prec
))) == 0)
2623 tree lb
= fold_build2 (LSHIFT_EXPR
, type
,
2624 build_one_cst (type
),
2625 build_int_cst (type
, i
));
2626 tree ub_left
= fold_build1 (BIT_NOT_EXPR
, type
,
2627 fold_build2 (LSHIFT_EXPR
, type
,
2628 build_minus_one_cst (type
),
2629 build_int_cst (type
, i
)));
2630 tree ub_right
= fold_build2 (LSHIFT_EXPR
, type
,
2631 build_one_cst (type
),
2632 build_int_cst (type
, i
));
2633 tree ub
= fold_build2 (BIT_IOR_EXPR
, type
, ub_left
, ub_right
);
2634 impossible_ranges
.union_ (int_range
<1> (lb
, ub
));
2636 if (!impossible_ranges
.undefined_p ())
2638 impossible_ranges
.invert ();
2639 r
.intersect (impossible_ranges
);
2644 operator_bitwise_and::fold_range (irange
&r
, tree type
,
2647 relation_kind rel ATTRIBUTE_UNUSED
) const
2649 if (range_operator::fold_range (r
, type
, lh
, rh
))
2651 // FIXME: This is temporarily disabled because, though it
2652 // generates better ranges, it's noticeably slower for evrp.
2653 // remove_impossible_ranges (r, rh);
2660 // Optimize BIT_AND_EXPR and BIT_IOR_EXPR in terms of a mask if
2661 // possible. Basically, see if we can optimize:
2665 // [LB op Z, UB op Z]
2667 // If the optimization was successful, accumulate the range in R and
2671 wi_optimize_and_or (irange
&r
,
2672 enum tree_code code
,
2674 const wide_int
&lh_lb
, const wide_int
&lh_ub
,
2675 const wide_int
&rh_lb
, const wide_int
&rh_ub
)
2677 // Calculate the singleton mask among the ranges, if any.
2678 wide_int lower_bound
, upper_bound
, mask
;
2679 if (wi::eq_p (rh_lb
, rh_ub
))
2682 lower_bound
= lh_lb
;
2683 upper_bound
= lh_ub
;
2685 else if (wi::eq_p (lh_lb
, lh_ub
))
2688 lower_bound
= rh_lb
;
2689 upper_bound
= rh_ub
;
2694 // If Z is a constant which (for op | its bitwise not) has n
2695 // consecutive least significant bits cleared followed by m 1
2696 // consecutive bits set immediately above it and either
2697 // m + n == precision, or (x >> (m + n)) == (y >> (m + n)).
2699 // The least significant n bits of all the values in the range are
2700 // cleared or set, the m bits above it are preserved and any bits
2701 // above these are required to be the same for all values in the
2705 if (code
== BIT_IOR_EXPR
)
2707 if (wi::eq_p (w
, 0))
2708 n
= w
.get_precision ();
2712 w
= ~(w
| wi::mask (n
, false, w
.get_precision ()));
2713 if (wi::eq_p (w
, 0))
2714 m
= w
.get_precision () - n
;
2716 m
= wi::ctz (w
) - n
;
2718 wide_int new_mask
= wi::mask (m
+ n
, true, w
.get_precision ());
2719 if ((new_mask
& lower_bound
) != (new_mask
& upper_bound
))
2722 wide_int res_lb
, res_ub
;
2723 if (code
== BIT_AND_EXPR
)
2725 res_lb
= wi::bit_and (lower_bound
, mask
);
2726 res_ub
= wi::bit_and (upper_bound
, mask
);
2728 else if (code
== BIT_IOR_EXPR
)
2730 res_lb
= wi::bit_or (lower_bound
, mask
);
2731 res_ub
= wi::bit_or (upper_bound
, mask
);
2735 value_range_with_overflow (r
, type
, res_lb
, res_ub
);
2737 // Furthermore, if the mask is non-zero, an IOR cannot contain zero.
2738 if (code
== BIT_IOR_EXPR
&& wi::ne_p (mask
, 0))
2741 tmp
.set_nonzero (type
);
2747 // For range [LB, UB] compute two wide_int bit masks.
2749 // In the MAYBE_NONZERO bit mask, if some bit is unset, it means that
2750 // for all numbers in the range the bit is 0, otherwise it might be 0
2753 // In the MUSTBE_NONZERO bit mask, if some bit is set, it means that
2754 // for all numbers in the range the bit is 1, otherwise it might be 0
2758 wi_set_zero_nonzero_bits (tree type
,
2759 const wide_int
&lb
, const wide_int
&ub
,
2760 wide_int
&maybe_nonzero
,
2761 wide_int
&mustbe_nonzero
)
2763 signop sign
= TYPE_SIGN (type
);
2765 if (wi::eq_p (lb
, ub
))
2766 maybe_nonzero
= mustbe_nonzero
= lb
;
2767 else if (wi::ge_p (lb
, 0, sign
) || wi::lt_p (ub
, 0, sign
))
2769 wide_int xor_mask
= lb
^ ub
;
2770 maybe_nonzero
= lb
| ub
;
2771 mustbe_nonzero
= lb
& ub
;
2774 wide_int mask
= wi::mask (wi::floor_log2 (xor_mask
), false,
2775 maybe_nonzero
.get_precision ());
2776 maybe_nonzero
= maybe_nonzero
| mask
;
2777 mustbe_nonzero
= wi::bit_and_not (mustbe_nonzero
, mask
);
2782 maybe_nonzero
= wi::minus_one (lb
.get_precision ());
2783 mustbe_nonzero
= wi::zero (lb
.get_precision ());
2788 operator_bitwise_and::wi_fold (irange
&r
, tree type
,
2789 const wide_int
&lh_lb
,
2790 const wide_int
&lh_ub
,
2791 const wide_int
&rh_lb
,
2792 const wide_int
&rh_ub
) const
2794 if (wi_optimize_and_or (r
, BIT_AND_EXPR
, type
, lh_lb
, lh_ub
, rh_lb
, rh_ub
))
2797 wide_int maybe_nonzero_lh
, mustbe_nonzero_lh
;
2798 wide_int maybe_nonzero_rh
, mustbe_nonzero_rh
;
2799 wi_set_zero_nonzero_bits (type
, lh_lb
, lh_ub
,
2800 maybe_nonzero_lh
, mustbe_nonzero_lh
);
2801 wi_set_zero_nonzero_bits (type
, rh_lb
, rh_ub
,
2802 maybe_nonzero_rh
, mustbe_nonzero_rh
);
2804 wide_int new_lb
= mustbe_nonzero_lh
& mustbe_nonzero_rh
;
2805 wide_int new_ub
= maybe_nonzero_lh
& maybe_nonzero_rh
;
2806 signop sign
= TYPE_SIGN (type
);
2807 unsigned prec
= TYPE_PRECISION (type
);
2808 // If both input ranges contain only negative values, we can
2809 // truncate the result range maximum to the minimum of the
2810 // input range maxima.
2811 if (wi::lt_p (lh_ub
, 0, sign
) && wi::lt_p (rh_ub
, 0, sign
))
2813 new_ub
= wi::min (new_ub
, lh_ub
, sign
);
2814 new_ub
= wi::min (new_ub
, rh_ub
, sign
);
2816 // If either input range contains only non-negative values
2817 // we can truncate the result range maximum to the respective
2818 // maximum of the input range.
2819 if (wi::ge_p (lh_lb
, 0, sign
))
2820 new_ub
= wi::min (new_ub
, lh_ub
, sign
);
2821 if (wi::ge_p (rh_lb
, 0, sign
))
2822 new_ub
= wi::min (new_ub
, rh_ub
, sign
);
2823 // PR68217: In case of signed & sign-bit-CST should
2824 // result in [-INF, 0] instead of [-INF, INF].
2825 if (wi::gt_p (new_lb
, new_ub
, sign
))
2827 wide_int sign_bit
= wi::set_bit_in_zero (prec
- 1, prec
);
2829 && ((wi::eq_p (lh_lb
, lh_ub
)
2830 && !wi::cmps (lh_lb
, sign_bit
))
2831 || (wi::eq_p (rh_lb
, rh_ub
)
2832 && !wi::cmps (rh_lb
, sign_bit
))))
2834 new_lb
= wi::min_value (prec
, sign
);
2835 new_ub
= wi::zero (prec
);
2838 // If the limits got swapped around, return varying.
2839 if (wi::gt_p (new_lb
, new_ub
,sign
))
2840 r
.set_varying (type
);
2842 value_range_with_overflow (r
, type
, new_lb
, new_ub
);
2846 set_nonzero_range_from_mask (irange
&r
, tree type
, const irange
&lhs
)
2848 if (!lhs
.contains_p (build_zero_cst (type
)))
2849 r
= range_nonzero (type
);
2851 r
.set_varying (type
);
2854 // This was shamelessly stolen from register_edge_assert_for_2 and
2855 // adjusted to work with iranges.
2858 operator_bitwise_and::simple_op1_range_solver (irange
&r
, tree type
,
2860 const irange
&op2
) const
2862 if (!op2
.singleton_p ())
2864 set_nonzero_range_from_mask (r
, type
, lhs
);
2867 unsigned int nprec
= TYPE_PRECISION (type
);
2868 wide_int cst2v
= op2
.lower_bound ();
2869 bool cst2n
= wi::neg_p (cst2v
, TYPE_SIGN (type
));
2872 sgnbit
= wi::set_bit_in_zero (nprec
- 1, nprec
);
2874 sgnbit
= wi::zero (nprec
);
2876 // Solve [lhs.lower_bound (), +INF] = x & MASK.
2878 // Minimum unsigned value for >= if (VAL & CST2) == VAL is VAL and
2879 // maximum unsigned value is ~0. For signed comparison, if CST2
2880 // doesn't have the most significant bit set, handle it similarly. If
2881 // CST2 has MSB set, the minimum is the same, and maximum is ~0U/2.
2882 wide_int valv
= lhs
.lower_bound ();
2883 wide_int minv
= valv
& cst2v
, maxv
;
2884 bool we_know_nothing
= false;
2887 // If (VAL & CST2) != VAL, X & CST2 can't be equal to VAL.
2888 minv
= masked_increment (valv
, cst2v
, sgnbit
, nprec
);
2891 // If we can't determine anything on this bound, fall
2892 // through and conservatively solve for the other end point.
2893 we_know_nothing
= true;
2896 maxv
= wi::mask (nprec
- (cst2n
? 1 : 0), false, nprec
);
2897 if (we_know_nothing
)
2898 r
.set_varying (type
);
2900 r
= int_range
<1> (type
, minv
, maxv
);
2902 // Solve [-INF, lhs.upper_bound ()] = x & MASK.
2904 // Minimum unsigned value for <= is 0 and maximum unsigned value is
2905 // VAL | ~CST2 if (VAL & CST2) == VAL. Otherwise, find smallest
2907 // VAL2 > VAL && (VAL2 & CST2) == VAL2 and use (VAL2 - 1) | ~CST2
2909 // For signed comparison, if CST2 doesn't have most significant bit
2910 // set, handle it similarly. If CST2 has MSB set, the maximum is
2911 // the same and minimum is INT_MIN.
2912 valv
= lhs
.upper_bound ();
2913 minv
= valv
& cst2v
;
2918 maxv
= masked_increment (valv
, cst2v
, sgnbit
, nprec
);
2921 // If we couldn't determine anything on either bound, return
2923 if (we_know_nothing
)
2931 int_range
<1> upper_bits (type
, minv
, maxv
);
2932 r
.intersect (upper_bits
);
2936 operator_bitwise_and::op1_range (irange
&r
, tree type
,
2939 relation_kind rel ATTRIBUTE_UNUSED
) const
2941 if (types_compatible_p (type
, boolean_type_node
))
2942 return op_logical_and
.op1_range (r
, type
, lhs
, op2
);
2945 for (unsigned i
= 0; i
< lhs
.num_pairs (); ++i
)
2947 int_range_max
chunk (lhs
.type (),
2948 lhs
.lower_bound (i
),
2949 lhs
.upper_bound (i
));
2951 simple_op1_range_solver (res
, type
, chunk
, op2
);
2954 if (r
.undefined_p ())
2955 set_nonzero_range_from_mask (r
, type
, lhs
);
2960 operator_bitwise_and::op2_range (irange
&r
, tree type
,
2963 relation_kind rel ATTRIBUTE_UNUSED
) const
2965 return operator_bitwise_and::op1_range (r
, type
, lhs
, op1
);
2969 class operator_logical_or
: public range_operator
2972 virtual bool fold_range (irange
&r
, tree type
,
2975 relation_kind rel
= VREL_NONE
) const;
2976 virtual bool op1_range (irange
&r
, tree type
,
2979 relation_kind rel
= VREL_NONE
) const;
2980 virtual bool op2_range (irange
&r
, tree type
,
2983 relation_kind rel
= VREL_NONE
) const;
2987 operator_logical_or::fold_range (irange
&r
, tree type ATTRIBUTE_UNUSED
,
2990 relation_kind rel ATTRIBUTE_UNUSED
) const
2992 if (empty_range_varying (r
, type
, lh
, rh
))
3001 operator_logical_or::op1_range (irange
&r
, tree type
,
3003 const irange
&op2 ATTRIBUTE_UNUSED
,
3004 relation_kind rel ATTRIBUTE_UNUSED
) const
3006 switch (get_bool_state (r
, lhs
, type
))
3009 // A false result means both sides of the OR must be false.
3010 r
= range_false (type
);
3013 // Any other result means only one side has to be true, the
3014 // other side can be anything. so we can't be sure of any result
3016 r
= range_true_and_false (type
);
3023 operator_logical_or::op2_range (irange
&r
, tree type
,
3026 relation_kind rel ATTRIBUTE_UNUSED
) const
3028 return operator_logical_or::op1_range (r
, type
, lhs
, op1
);
3032 class operator_bitwise_or
: public range_operator
3035 virtual bool op1_range (irange
&r
, tree type
,
3038 relation_kind rel
= VREL_NONE
) const;
3039 virtual bool op2_range (irange
&r
, tree type
,
3042 relation_kind rel
= VREL_NONE
) const;
3043 virtual void wi_fold (irange
&r
, tree type
,
3044 const wide_int
&lh_lb
,
3045 const wide_int
&lh_ub
,
3046 const wide_int
&rh_lb
,
3047 const wide_int
&rh_ub
) const;
3051 operator_bitwise_or::wi_fold (irange
&r
, tree type
,
3052 const wide_int
&lh_lb
,
3053 const wide_int
&lh_ub
,
3054 const wide_int
&rh_lb
,
3055 const wide_int
&rh_ub
) const
3057 if (wi_optimize_and_or (r
, BIT_IOR_EXPR
, type
, lh_lb
, lh_ub
, rh_lb
, rh_ub
))
3060 wide_int maybe_nonzero_lh
, mustbe_nonzero_lh
;
3061 wide_int maybe_nonzero_rh
, mustbe_nonzero_rh
;
3062 wi_set_zero_nonzero_bits (type
, lh_lb
, lh_ub
,
3063 maybe_nonzero_lh
, mustbe_nonzero_lh
);
3064 wi_set_zero_nonzero_bits (type
, rh_lb
, rh_ub
,
3065 maybe_nonzero_rh
, mustbe_nonzero_rh
);
3066 wide_int new_lb
= mustbe_nonzero_lh
| mustbe_nonzero_rh
;
3067 wide_int new_ub
= maybe_nonzero_lh
| maybe_nonzero_rh
;
3068 signop sign
= TYPE_SIGN (type
);
3069 // If the input ranges contain only positive values we can
3070 // truncate the minimum of the result range to the maximum
3071 // of the input range minima.
3072 if (wi::ge_p (lh_lb
, 0, sign
)
3073 && wi::ge_p (rh_lb
, 0, sign
))
3075 new_lb
= wi::max (new_lb
, lh_lb
, sign
);
3076 new_lb
= wi::max (new_lb
, rh_lb
, sign
);
3078 // If either input range contains only negative values
3079 // we can truncate the minimum of the result range to the
3080 // respective minimum range.
3081 if (wi::lt_p (lh_ub
, 0, sign
))
3082 new_lb
= wi::max (new_lb
, lh_lb
, sign
);
3083 if (wi::lt_p (rh_ub
, 0, sign
))
3084 new_lb
= wi::max (new_lb
, rh_lb
, sign
);
3085 // If the limits got swapped around, return a conservative range.
3086 if (wi::gt_p (new_lb
, new_ub
, sign
))
3088 // Make sure that nonzero|X is nonzero.
3089 if (wi::gt_p (lh_lb
, 0, sign
)
3090 || wi::gt_p (rh_lb
, 0, sign
)
3091 || wi::lt_p (lh_ub
, 0, sign
)
3092 || wi::lt_p (rh_ub
, 0, sign
))
3093 r
.set_nonzero (type
);
3095 r
.set_varying (type
);
3098 value_range_with_overflow (r
, type
, new_lb
, new_ub
);
3102 operator_bitwise_or::op1_range (irange
&r
, tree type
,
3105 relation_kind rel ATTRIBUTE_UNUSED
) const
3107 // If this is really a logical wi_fold, call that.
3108 if (types_compatible_p (type
, boolean_type_node
))
3109 return op_logical_or
.op1_range (r
, type
, lhs
, op2
);
3113 tree zero
= build_zero_cst (type
);
3114 r
= int_range
<1> (zero
, zero
);
3117 r
.set_varying (type
);
3122 operator_bitwise_or::op2_range (irange
&r
, tree type
,
3125 relation_kind rel ATTRIBUTE_UNUSED
) const
3127 return operator_bitwise_or::op1_range (r
, type
, lhs
, op1
);
3131 class operator_bitwise_xor
: public range_operator
3134 virtual void wi_fold (irange
&r
, tree type
,
3135 const wide_int
&lh_lb
,
3136 const wide_int
&lh_ub
,
3137 const wide_int
&rh_lb
,
3138 const wide_int
&rh_ub
) const;
3139 virtual bool op1_range (irange
&r
, tree type
,
3142 relation_kind rel
= VREL_NONE
) const;
3143 virtual bool op2_range (irange
&r
, tree type
,
3146 relation_kind rel
= VREL_NONE
) const;
3147 virtual bool op1_op2_relation_effect (irange
&lhs_range
,
3149 const irange
&op1_range
,
3150 const irange
&op2_range
,
3151 relation_kind rel
) const;
3155 operator_bitwise_xor::wi_fold (irange
&r
, tree type
,
3156 const wide_int
&lh_lb
,
3157 const wide_int
&lh_ub
,
3158 const wide_int
&rh_lb
,
3159 const wide_int
&rh_ub
) const
3161 signop sign
= TYPE_SIGN (type
);
3162 wide_int maybe_nonzero_lh
, mustbe_nonzero_lh
;
3163 wide_int maybe_nonzero_rh
, mustbe_nonzero_rh
;
3164 wi_set_zero_nonzero_bits (type
, lh_lb
, lh_ub
,
3165 maybe_nonzero_lh
, mustbe_nonzero_lh
);
3166 wi_set_zero_nonzero_bits (type
, rh_lb
, rh_ub
,
3167 maybe_nonzero_rh
, mustbe_nonzero_rh
);
3169 wide_int result_zero_bits
= ((mustbe_nonzero_lh
& mustbe_nonzero_rh
)
3170 | ~(maybe_nonzero_lh
| maybe_nonzero_rh
));
3171 wide_int result_one_bits
3172 = (wi::bit_and_not (mustbe_nonzero_lh
, maybe_nonzero_rh
)
3173 | wi::bit_and_not (mustbe_nonzero_rh
, maybe_nonzero_lh
));
3174 wide_int new_ub
= ~result_zero_bits
;
3175 wide_int new_lb
= result_one_bits
;
3177 // If the range has all positive or all negative values, the result
3178 // is better than VARYING.
3179 if (wi::lt_p (new_lb
, 0, sign
) || wi::ge_p (new_ub
, 0, sign
))
3180 value_range_with_overflow (r
, type
, new_lb
, new_ub
);
3182 r
.set_varying (type
);
3186 operator_bitwise_xor::op1_op2_relation_effect (irange
&lhs_range
,
3190 relation_kind rel
) const
3192 if (rel
== VREL_NONE
)
3195 int_range
<2> rel_range
;
3200 rel_range
.set_zero (type
);
3203 rel_range
.set_nonzero (type
);
3209 lhs_range
.intersect (rel_range
);
3214 operator_bitwise_xor::op1_range (irange
&r
, tree type
,
3217 relation_kind rel ATTRIBUTE_UNUSED
) const
3219 if (lhs
.undefined_p () || lhs
.varying_p ())
3224 if (types_compatible_p (type
, boolean_type_node
))
3226 switch (get_bool_state (r
, lhs
, type
))
3229 if (op2
.varying_p ())
3230 r
.set_varying (type
);
3231 else if (op2
.zero_p ())
3232 r
= range_true (type
);
3234 r
= range_false (type
);
3244 r
.set_varying (type
);
3249 operator_bitwise_xor::op2_range (irange
&r
, tree type
,
3252 relation_kind rel ATTRIBUTE_UNUSED
) const
3254 return operator_bitwise_xor::op1_range (r
, type
, lhs
, op1
);
3257 class operator_trunc_mod
: public range_operator
3260 virtual void wi_fold (irange
&r
, tree type
,
3261 const wide_int
&lh_lb
,
3262 const wide_int
&lh_ub
,
3263 const wide_int
&rh_lb
,
3264 const wide_int
&rh_ub
) const;
3265 virtual bool op1_range (irange
&r
, tree type
,
3268 relation_kind rel ATTRIBUTE_UNUSED
) const;
3269 virtual bool op2_range (irange
&r
, tree type
,
3272 relation_kind rel ATTRIBUTE_UNUSED
) const;
3276 operator_trunc_mod::wi_fold (irange
&r
, tree type
,
3277 const wide_int
&lh_lb
,
3278 const wide_int
&lh_ub
,
3279 const wide_int
&rh_lb
,
3280 const wide_int
&rh_ub
) const
3282 wide_int new_lb
, new_ub
, tmp
;
3283 signop sign
= TYPE_SIGN (type
);
3284 unsigned prec
= TYPE_PRECISION (type
);
3286 // Mod 0 is undefined.
3287 if (wi_zero_p (type
, rh_lb
, rh_ub
))
3293 // Check for constant and try to fold.
3294 if (lh_lb
== lh_ub
&& rh_lb
== rh_ub
)
3296 wi::overflow_type ov
= wi::OVF_NONE
;
3297 tmp
= wi::mod_trunc (lh_lb
, rh_lb
, sign
, &ov
);
3298 if (ov
== wi::OVF_NONE
)
3300 r
= int_range
<2> (type
, tmp
, tmp
);
3305 // ABS (A % B) < ABS (B) and either 0 <= A % B <= A or A <= A % B <= 0.
3310 new_ub
= wi::smax (new_ub
, tmp
);
3313 if (sign
== UNSIGNED
)
3314 new_lb
= wi::zero (prec
);
3319 if (wi::gts_p (tmp
, 0))
3320 tmp
= wi::zero (prec
);
3321 new_lb
= wi::smax (new_lb
, tmp
);
3324 if (sign
== SIGNED
&& wi::neg_p (tmp
))
3325 tmp
= wi::zero (prec
);
3326 new_ub
= wi::min (new_ub
, tmp
, sign
);
3328 value_range_with_overflow (r
, type
, new_lb
, new_ub
);
3332 operator_trunc_mod::op1_range (irange
&r
, tree type
,
3335 relation_kind rel ATTRIBUTE_UNUSED
) const
3338 signop sign
= TYPE_SIGN (type
);
3339 unsigned prec
= TYPE_PRECISION (type
);
3340 // (a % b) >= x && x > 0 , then a >= x.
3341 if (wi::gt_p (lhs
.lower_bound (), 0, sign
))
3343 r
= value_range (type
, lhs
.lower_bound (), wi::max_value (prec
, sign
));
3346 // (a % b) <= x && x < 0 , then a <= x.
3347 if (wi::lt_p (lhs
.upper_bound (), 0, sign
))
3349 r
= value_range (type
, wi::min_value (prec
, sign
), lhs
.upper_bound ());
3356 operator_trunc_mod::op2_range (irange
&r
, tree type
,
3359 relation_kind rel ATTRIBUTE_UNUSED
) const
3362 signop sign
= TYPE_SIGN (type
);
3363 unsigned prec
= TYPE_PRECISION (type
);
3364 // (a % b) >= x && x > 0 , then b is in ~[-x, x] for signed
3365 // or b > x for unsigned.
3366 if (wi::gt_p (lhs
.lower_bound (), 0, sign
))
3369 r
= value_range (type
, wi::neg (lhs
.lower_bound ()),
3370 lhs
.lower_bound (), VR_ANTI_RANGE
);
3371 else if (wi::lt_p (lhs
.lower_bound (), wi::max_value (prec
, sign
),
3373 r
= value_range (type
, lhs
.lower_bound () + 1,
3374 wi::max_value (prec
, sign
));
3379 // (a % b) <= x && x < 0 , then b is in ~[x, -x].
3380 if (wi::lt_p (lhs
.upper_bound (), 0, sign
))
3382 if (wi::gt_p (lhs
.upper_bound (), wi::min_value (prec
, sign
), sign
))
3383 r
= value_range (type
, lhs
.upper_bound (),
3384 wi::neg (lhs
.upper_bound ()), VR_ANTI_RANGE
);
3393 class operator_logical_not
: public range_operator
3396 virtual bool fold_range (irange
&r
, tree type
,
3399 relation_kind rel
= VREL_NONE
) const;
3400 virtual bool op1_range (irange
&r
, tree type
,
3403 relation_kind rel
= VREL_NONE
) const;
3406 // Folding a logical NOT, oddly enough, involves doing nothing on the
3407 // forward pass through. During the initial walk backwards, the
3408 // logical NOT reversed the desired outcome on the way back, so on the
3409 // way forward all we do is pass the range forward.
3414 // to determine the TRUE branch, walking backward
3415 // if (b_3) if ([1,1])
3416 // b_3 = !b_2 [1,1] = ![0,0]
3417 // b_2 = x_1 < 20 [0,0] = x_1 < 20, false, so x_1 == [20, 255]
3418 // which is the result we are looking for.. so.. pass it through.
3421 operator_logical_not::fold_range (irange
&r
, tree type
,
3423 const irange
&rh ATTRIBUTE_UNUSED
,
3424 relation_kind rel ATTRIBUTE_UNUSED
) const
3426 if (empty_range_varying (r
, type
, lh
, rh
))
3430 if (!lh
.varying_p () && !lh
.undefined_p ())
3437 operator_logical_not::op1_range (irange
&r
,
3441 relation_kind rel ATTRIBUTE_UNUSED
) const
3443 // Logical NOT is involutary...do it again.
3444 return fold_range (r
, type
, lhs
, op2
);
3448 class operator_bitwise_not
: public range_operator
3451 virtual bool fold_range (irange
&r
, tree type
,
3454 relation_kind rel
= VREL_NONE
) const;
3455 virtual bool op1_range (irange
&r
, tree type
,
3458 relation_kind rel
= VREL_NONE
) const;
3462 operator_bitwise_not::fold_range (irange
&r
, tree type
,
3465 relation_kind rel ATTRIBUTE_UNUSED
) const
3467 if (empty_range_varying (r
, type
, lh
, rh
))
3470 if (types_compatible_p (type
, boolean_type_node
))
3471 return op_logical_not
.fold_range (r
, type
, lh
, rh
);
3473 // ~X is simply -1 - X.
3474 int_range
<1> minusone (type
, wi::minus_one (TYPE_PRECISION (type
)),
3475 wi::minus_one (TYPE_PRECISION (type
)));
3476 return range_op_handler (MINUS_EXPR
, type
)->fold_range (r
, type
, minusone
,
3481 operator_bitwise_not::op1_range (irange
&r
, tree type
,
3484 relation_kind rel ATTRIBUTE_UNUSED
) const
3486 if (types_compatible_p (type
, boolean_type_node
))
3487 return op_logical_not
.op1_range (r
, type
, lhs
, op2
);
3489 // ~X is -1 - X and since bitwise NOT is involutary...do it again.
3490 return fold_range (r
, type
, lhs
, op2
);
3494 class operator_cst
: public range_operator
3497 virtual bool fold_range (irange
&r
, tree type
,
3500 relation_kind rel
= VREL_NONE
) const;
3504 operator_cst::fold_range (irange
&r
, tree type ATTRIBUTE_UNUSED
,
3506 const irange
&rh ATTRIBUTE_UNUSED
,
3507 relation_kind rel ATTRIBUTE_UNUSED
) const
3514 class operator_identity
: public range_operator
3517 virtual bool fold_range (irange
&r
, tree type
,
3520 relation_kind rel
= VREL_NONE
) const;
3521 virtual bool op1_range (irange
&r
, tree type
,
3524 relation_kind rel
= VREL_NONE
) const;
3525 virtual enum tree_code
lhs_op1_relation (const irange
&lhs
,
3527 const irange
&op2
) const;
3530 // Determine if there is a relationship between LHS and OP1.
3533 operator_identity::lhs_op1_relation (const irange
&lhs
,
3534 const irange
&op1 ATTRIBUTE_UNUSED
,
3535 const irange
&op2 ATTRIBUTE_UNUSED
) const
3537 if (lhs
.undefined_p ())
3539 // Simply a copy, so they are equivalent.
3544 operator_identity::fold_range (irange
&r
, tree type ATTRIBUTE_UNUSED
,
3546 const irange
&rh ATTRIBUTE_UNUSED
,
3547 relation_kind rel ATTRIBUTE_UNUSED
) const
3554 operator_identity::op1_range (irange
&r
, tree type ATTRIBUTE_UNUSED
,
3556 const irange
&op2 ATTRIBUTE_UNUSED
,
3557 relation_kind rel ATTRIBUTE_UNUSED
) const
3564 class operator_unknown
: public range_operator
3567 virtual bool fold_range (irange
&r
, tree type
,
3570 relation_kind rel
= VREL_NONE
) const;
3574 operator_unknown::fold_range (irange
&r
, tree type
,
3575 const irange
&lh ATTRIBUTE_UNUSED
,
3576 const irange
&rh ATTRIBUTE_UNUSED
,
3577 relation_kind rel ATTRIBUTE_UNUSED
) const
3579 r
.set_varying (type
);
3584 class operator_abs
: public range_operator
3587 virtual void wi_fold (irange
&r
, tree type
,
3588 const wide_int
&lh_lb
,
3589 const wide_int
&lh_ub
,
3590 const wide_int
&rh_lb
,
3591 const wide_int
&rh_ub
) const;
3592 virtual bool op1_range (irange
&r
, tree type
,
3595 relation_kind rel ATTRIBUTE_UNUSED
) const;
3599 operator_abs::wi_fold (irange
&r
, tree type
,
3600 const wide_int
&lh_lb
, const wide_int
&lh_ub
,
3601 const wide_int
&rh_lb ATTRIBUTE_UNUSED
,
3602 const wide_int
&rh_ub ATTRIBUTE_UNUSED
) const
3605 signop sign
= TYPE_SIGN (type
);
3606 unsigned prec
= TYPE_PRECISION (type
);
3608 // Pass through LH for the easy cases.
3609 if (sign
== UNSIGNED
|| wi::ge_p (lh_lb
, 0, sign
))
3611 r
= int_range
<1> (type
, lh_lb
, lh_ub
);
3615 // -TYPE_MIN_VALUE = TYPE_MIN_VALUE with flag_wrapv so we can't get
3617 wide_int min_value
= wi::min_value (prec
, sign
);
3618 wide_int max_value
= wi::max_value (prec
, sign
);
3619 if (!TYPE_OVERFLOW_UNDEFINED (type
) && wi::eq_p (lh_lb
, min_value
))
3621 r
.set_varying (type
);
3625 // ABS_EXPR may flip the range around, if the original range
3626 // included negative values.
3627 if (wi::eq_p (lh_lb
, min_value
))
3629 // ABS ([-MIN, -MIN]) isn't representable, but we have traditionally
3630 // returned [-MIN,-MIN] so this preserves that behaviour. PR37078
3631 if (wi::eq_p (lh_ub
, min_value
))
3633 r
= int_range
<1> (type
, min_value
, min_value
);
3639 min
= wi::abs (lh_lb
);
3641 if (wi::eq_p (lh_ub
, min_value
))
3644 max
= wi::abs (lh_ub
);
3646 // If the range contains zero then we know that the minimum value in the
3647 // range will be zero.
3648 if (wi::le_p (lh_lb
, 0, sign
) && wi::ge_p (lh_ub
, 0, sign
))
3650 if (wi::gt_p (min
, max
, sign
))
3652 min
= wi::zero (prec
);
3656 // If the range was reversed, swap MIN and MAX.
3657 if (wi::gt_p (min
, max
, sign
))
3658 std::swap (min
, max
);
3661 // If the new range has its limits swapped around (MIN > MAX), then
3662 // the operation caused one of them to wrap around. The only thing
3663 // we know is that the result is positive.
3664 if (wi::gt_p (min
, max
, sign
))
3666 min
= wi::zero (prec
);
3669 r
= int_range
<1> (type
, min
, max
);
3673 operator_abs::op1_range (irange
&r
, tree type
,
3676 relation_kind rel ATTRIBUTE_UNUSED
) const
3678 if (empty_range_varying (r
, type
, lhs
, op2
))
3680 if (TYPE_UNSIGNED (type
))
3685 // Start with the positives because negatives are an impossible result.
3686 int_range_max positives
= range_positives (type
);
3687 positives
.intersect (lhs
);
3689 // Then add the negative of each pair:
3690 // ABS(op1) = [5,20] would yield op1 => [-20,-5][5,20].
3691 for (unsigned i
= 0; i
< positives
.num_pairs (); ++i
)
3692 r
.union_ (int_range
<1> (type
,
3693 -positives
.upper_bound (i
),
3694 -positives
.lower_bound (i
)));
3695 // With flag_wrapv, -TYPE_MIN_VALUE = TYPE_MIN_VALUE which is
3696 // unrepresentable. Add -TYPE_MIN_VALUE in this case.
3697 wide_int min_value
= wi::min_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
3698 wide_int lb
= lhs
.lower_bound ();
3699 if (!TYPE_OVERFLOW_UNDEFINED (type
) && wi::eq_p (lb
, min_value
))
3700 r
.union_ (int_range
<2> (type
, lb
, lb
));
3705 class operator_absu
: public range_operator
3708 virtual void wi_fold (irange
&r
, tree type
,
3709 const wide_int
&lh_lb
, const wide_int
&lh_ub
,
3710 const wide_int
&rh_lb
, const wide_int
&rh_ub
) const;
3714 operator_absu::wi_fold (irange
&r
, tree type
,
3715 const wide_int
&lh_lb
, const wide_int
&lh_ub
,
3716 const wide_int
&rh_lb ATTRIBUTE_UNUSED
,
3717 const wide_int
&rh_ub ATTRIBUTE_UNUSED
) const
3719 wide_int new_lb
, new_ub
;
3721 // Pass through VR0 the easy cases.
3722 if (wi::ges_p (lh_lb
, 0))
3729 new_lb
= wi::abs (lh_lb
);
3730 new_ub
= wi::abs (lh_ub
);
3732 // If the range contains zero then we know that the minimum
3733 // value in the range will be zero.
3734 if (wi::ges_p (lh_ub
, 0))
3736 if (wi::gtu_p (new_lb
, new_ub
))
3738 new_lb
= wi::zero (TYPE_PRECISION (type
));
3741 std::swap (new_lb
, new_ub
);
3744 gcc_checking_assert (TYPE_UNSIGNED (type
));
3745 r
= int_range
<1> (type
, new_lb
, new_ub
);
3749 class operator_negate
: public range_operator
3752 virtual bool fold_range (irange
&r
, tree type
,
3755 relation_kind rel
= VREL_NONE
) const;
3756 virtual bool op1_range (irange
&r
, tree type
,
3759 relation_kind rel
= VREL_NONE
) const;
3763 operator_negate::fold_range (irange
&r
, tree type
,
3766 relation_kind rel ATTRIBUTE_UNUSED
) const
3768 if (empty_range_varying (r
, type
, lh
, rh
))
3770 // -X is simply 0 - X.
3771 return range_op_handler (MINUS_EXPR
, type
)->fold_range (r
, type
,
3777 operator_negate::op1_range (irange
&r
, tree type
,
3780 relation_kind rel ATTRIBUTE_UNUSED
) const
3782 // NEGATE is involutory.
3783 return fold_range (r
, type
, lhs
, op2
);
3787 class operator_addr_expr
: public range_operator
3790 virtual bool fold_range (irange
&r
, tree type
,
3793 relation_kind rel
= VREL_NONE
) const;
3794 virtual bool op1_range (irange
&r
, tree type
,
3797 relation_kind rel
= VREL_NONE
) const;
3801 operator_addr_expr::fold_range (irange
&r
, tree type
,
3804 relation_kind rel ATTRIBUTE_UNUSED
) const
3806 if (empty_range_varying (r
, type
, lh
, rh
))
3809 // Return a non-null pointer of the LHS type (passed in op2).
3811 r
= range_zero (type
);
3812 else if (!lh
.contains_p (build_zero_cst (lh
.type ())))
3813 r
= range_nonzero (type
);
3815 r
.set_varying (type
);
3820 operator_addr_expr::op1_range (irange
&r
, tree type
,
3823 relation_kind rel ATTRIBUTE_UNUSED
) const
3825 return operator_addr_expr::fold_range (r
, type
, lhs
, op2
);
3829 class pointer_plus_operator
: public range_operator
3832 virtual void wi_fold (irange
&r
, tree type
,
3833 const wide_int
&lh_lb
,
3834 const wide_int
&lh_ub
,
3835 const wide_int
&rh_lb
,
3836 const wide_int
&rh_ub
) const;
3840 pointer_plus_operator::wi_fold (irange
&r
, tree type
,
3841 const wide_int
&lh_lb
,
3842 const wide_int
&lh_ub
,
3843 const wide_int
&rh_lb
,
3844 const wide_int
&rh_ub
) const
3846 // Check for [0,0] + const, and simply return the const.
3847 if (lh_lb
== 0 && lh_ub
== 0 && rh_lb
== rh_ub
)
3849 tree val
= wide_int_to_tree (type
, rh_lb
);
3854 // For pointer types, we are really only interested in asserting
3855 // whether the expression evaluates to non-NULL.
3857 // With -fno-delete-null-pointer-checks we need to be more
3858 // conservative. As some object might reside at address 0,
3859 // then some offset could be added to it and the same offset
3860 // subtracted again and the result would be NULL.
3862 // static int a[12]; where &a[0] is NULL and
3865 // ptr will be NULL here, even when there is POINTER_PLUS_EXPR
3866 // where the first range doesn't include zero and the second one
3867 // doesn't either. As the second operand is sizetype (unsigned),
3868 // consider all ranges where the MSB could be set as possible
3869 // subtractions where the result might be NULL.
3870 if ((!wi_includes_zero_p (type
, lh_lb
, lh_ub
)
3871 || !wi_includes_zero_p (type
, rh_lb
, rh_ub
))
3872 && !TYPE_OVERFLOW_WRAPS (type
)
3873 && (flag_delete_null_pointer_checks
3874 || !wi::sign_mask (rh_ub
)))
3875 r
= range_nonzero (type
);
3876 else if (lh_lb
== lh_ub
&& lh_lb
== 0
3877 && rh_lb
== rh_ub
&& rh_lb
== 0)
3878 r
= range_zero (type
);
3880 r
.set_varying (type
);
3884 class pointer_min_max_operator
: public range_operator
3887 virtual void wi_fold (irange
& r
, tree type
,
3888 const wide_int
&lh_lb
, const wide_int
&lh_ub
,
3889 const wide_int
&rh_lb
, const wide_int
&rh_ub
) const;
3893 pointer_min_max_operator::wi_fold (irange
&r
, tree type
,
3894 const wide_int
&lh_lb
,
3895 const wide_int
&lh_ub
,
3896 const wide_int
&rh_lb
,
3897 const wide_int
&rh_ub
) const
3899 // For MIN/MAX expressions with pointers, we only care about
3900 // nullness. If both are non null, then the result is nonnull.
3901 // If both are null, then the result is null. Otherwise they
3903 if (!wi_includes_zero_p (type
, lh_lb
, lh_ub
)
3904 && !wi_includes_zero_p (type
, rh_lb
, rh_ub
))
3905 r
= range_nonzero (type
);
3906 else if (wi_zero_p (type
, lh_lb
, lh_ub
) && wi_zero_p (type
, rh_lb
, rh_ub
))
3907 r
= range_zero (type
);
3909 r
.set_varying (type
);
3913 class pointer_and_operator
: public range_operator
3916 virtual void wi_fold (irange
&r
, tree type
,
3917 const wide_int
&lh_lb
, const wide_int
&lh_ub
,
3918 const wide_int
&rh_lb
, const wide_int
&rh_ub
) const;
3922 pointer_and_operator::wi_fold (irange
&r
, tree type
,
3923 const wide_int
&lh_lb
,
3924 const wide_int
&lh_ub
,
3925 const wide_int
&rh_lb ATTRIBUTE_UNUSED
,
3926 const wide_int
&rh_ub ATTRIBUTE_UNUSED
) const
3928 // For pointer types, we are really only interested in asserting
3929 // whether the expression evaluates to non-NULL.
3930 if (wi_zero_p (type
, lh_lb
, lh_ub
) || wi_zero_p (type
, lh_lb
, lh_ub
))
3931 r
= range_zero (type
);
3933 r
.set_varying (type
);
3937 class pointer_or_operator
: public range_operator
3940 virtual bool op1_range (irange
&r
, tree type
,
3943 relation_kind rel
= VREL_NONE
) const;
3944 virtual bool op2_range (irange
&r
, tree type
,
3947 relation_kind rel
= VREL_NONE
) const;
3948 virtual void wi_fold (irange
&r
, tree type
,
3949 const wide_int
&lh_lb
, const wide_int
&lh_ub
,
3950 const wide_int
&rh_lb
, const wide_int
&rh_ub
) const;
3954 pointer_or_operator::op1_range (irange
&r
, tree type
,
3956 const irange
&op2 ATTRIBUTE_UNUSED
,
3957 relation_kind rel ATTRIBUTE_UNUSED
) const
3961 tree zero
= build_zero_cst (type
);
3962 r
= int_range
<1> (zero
, zero
);
3965 r
.set_varying (type
);
3970 pointer_or_operator::op2_range (irange
&r
, tree type
,
3973 relation_kind rel ATTRIBUTE_UNUSED
) const
3975 return pointer_or_operator::op1_range (r
, type
, lhs
, op1
);
3979 pointer_or_operator::wi_fold (irange
&r
, tree type
,
3980 const wide_int
&lh_lb
,
3981 const wide_int
&lh_ub
,
3982 const wide_int
&rh_lb
,
3983 const wide_int
&rh_ub
) const
3985 // For pointer types, we are really only interested in asserting
3986 // whether the expression evaluates to non-NULL.
3987 if (!wi_includes_zero_p (type
, lh_lb
, lh_ub
)
3988 && !wi_includes_zero_p (type
, rh_lb
, rh_ub
))
3989 r
= range_nonzero (type
);
3990 else if (wi_zero_p (type
, lh_lb
, lh_ub
) && wi_zero_p (type
, rh_lb
, rh_ub
))
3991 r
= range_zero (type
);
3993 r
.set_varying (type
);
3996 // This implements the range operator tables as local objects in this file.
3998 class range_op_table
4001 inline range_operator
*operator[] (enum tree_code code
);
4003 void set (enum tree_code code
, range_operator
&op
);
4005 range_operator
*m_range_tree
[MAX_TREE_CODES
];
4008 // Return a pointer to the range_operator instance, if there is one
4009 // associated with tree_code CODE.
4012 range_op_table::operator[] (enum tree_code code
)
4014 gcc_checking_assert (code
> 0 && code
< MAX_TREE_CODES
);
4015 return m_range_tree
[code
];
4018 // Add OP to the handler table for CODE.
4021 range_op_table::set (enum tree_code code
, range_operator
&op
)
4023 gcc_checking_assert (m_range_tree
[code
] == NULL
);
4024 m_range_tree
[code
] = &op
;
4027 // Instantiate a range op table for integral operations.
4029 class integral_table
: public range_op_table
4033 } integral_tree_table
;
4035 integral_table::integral_table ()
4037 set (EQ_EXPR
, op_equal
);
4038 set (NE_EXPR
, op_not_equal
);
4039 set (LT_EXPR
, op_lt
);
4040 set (LE_EXPR
, op_le
);
4041 set (GT_EXPR
, op_gt
);
4042 set (GE_EXPR
, op_ge
);
4043 set (PLUS_EXPR
, op_plus
);
4044 set (MINUS_EXPR
, op_minus
);
4045 set (MIN_EXPR
, op_min
);
4046 set (MAX_EXPR
, op_max
);
4047 set (MULT_EXPR
, op_mult
);
4048 set (TRUNC_DIV_EXPR
, op_trunc_div
);
4049 set (FLOOR_DIV_EXPR
, op_floor_div
);
4050 set (ROUND_DIV_EXPR
, op_round_div
);
4051 set (CEIL_DIV_EXPR
, op_ceil_div
);
4052 set (EXACT_DIV_EXPR
, op_exact_div
);
4053 set (LSHIFT_EXPR
, op_lshift
);
4054 set (RSHIFT_EXPR
, op_rshift
);
4055 set (NOP_EXPR
, op_convert
);
4056 set (CONVERT_EXPR
, op_convert
);
4057 set (TRUTH_AND_EXPR
, op_logical_and
);
4058 set (BIT_AND_EXPR
, op_bitwise_and
);
4059 set (TRUTH_OR_EXPR
, op_logical_or
);
4060 set (BIT_IOR_EXPR
, op_bitwise_or
);
4061 set (BIT_XOR_EXPR
, op_bitwise_xor
);
4062 set (TRUNC_MOD_EXPR
, op_trunc_mod
);
4063 set (TRUTH_NOT_EXPR
, op_logical_not
);
4064 set (BIT_NOT_EXPR
, op_bitwise_not
);
4065 set (INTEGER_CST
, op_integer_cst
);
4066 set (SSA_NAME
, op_identity
);
4067 set (PAREN_EXPR
, op_identity
);
4068 set (OBJ_TYPE_REF
, op_identity
);
4069 set (IMAGPART_EXPR
, op_unknown
);
4070 set (REALPART_EXPR
, op_unknown
);
4071 set (POINTER_DIFF_EXPR
, op_pointer_diff
);
4072 set (ABS_EXPR
, op_abs
);
4073 set (ABSU_EXPR
, op_absu
);
4074 set (NEGATE_EXPR
, op_negate
);
4075 set (ADDR_EXPR
, op_addr
);
4078 // Instantiate a range op table for pointer operations.
4080 class pointer_table
: public range_op_table
4084 } pointer_tree_table
;
4086 pointer_table::pointer_table ()
4088 set (BIT_AND_EXPR
, op_pointer_and
);
4089 set (BIT_IOR_EXPR
, op_pointer_or
);
4090 set (MIN_EXPR
, op_ptr_min_max
);
4091 set (MAX_EXPR
, op_ptr_min_max
);
4092 set (POINTER_PLUS_EXPR
, op_pointer_plus
);
4094 set (EQ_EXPR
, op_equal
);
4095 set (NE_EXPR
, op_not_equal
);
4096 set (LT_EXPR
, op_lt
);
4097 set (LE_EXPR
, op_le
);
4098 set (GT_EXPR
, op_gt
);
4099 set (GE_EXPR
, op_ge
);
4100 set (SSA_NAME
, op_identity
);
4101 set (INTEGER_CST
, op_integer_cst
);
4102 set (ADDR_EXPR
, op_addr
);
4103 set (NOP_EXPR
, op_convert
);
4104 set (CONVERT_EXPR
, op_convert
);
4106 set (BIT_NOT_EXPR
, op_bitwise_not
);
4107 set (BIT_XOR_EXPR
, op_bitwise_xor
);
4110 // The tables are hidden and accessed via a simple extern function.
4113 range_op_handler (enum tree_code code
, tree type
)
4115 // First check if there is a pointer specialization.
4116 if (POINTER_TYPE_P (type
))
4117 return pointer_tree_table
[code
];
4118 if (INTEGRAL_TYPE_P (type
))
4119 return integral_tree_table
[code
];
4123 // Cast the range in R to TYPE.
4126 range_cast (irange
&r
, tree type
)
4128 int_range_max tmp
= r
;
4129 range_operator
*op
= range_op_handler (CONVERT_EXPR
, type
);
4130 // Call op_convert, if it fails, the result is varying.
4131 if (!op
->fold_range (r
, type
, tmp
, int_range
<1> (type
)))
4132 r
.set_varying (type
);
4136 #include "selftest.h"
4140 #define INT(N) build_int_cst (integer_type_node, (N))
4141 #define UINT(N) build_int_cstu (unsigned_type_node, (N))
4142 #define INT16(N) build_int_cst (short_integer_type_node, (N))
4143 #define UINT16(N) build_int_cstu (short_unsigned_type_node, (N))
4144 #define SCHAR(N) build_int_cst (signed_char_type_node, (N))
4145 #define UCHAR(N) build_int_cstu (unsigned_char_type_node, (N))
4148 range_op_cast_tests ()
4150 int_range
<1> r0
, r1
, r2
, rold
;
4151 r0
.set_varying (integer_type_node
);
4152 tree maxint
= wide_int_to_tree (integer_type_node
, r0
.upper_bound ());
4154 // If a range is in any way outside of the range for the converted
4155 // to range, default to the range for the new type.
4156 r0
.set_varying (short_integer_type_node
);
4157 tree minshort
= wide_int_to_tree (short_integer_type_node
, r0
.lower_bound ());
4158 tree maxshort
= wide_int_to_tree (short_integer_type_node
, r0
.upper_bound ());
4159 if (TYPE_PRECISION (TREE_TYPE (maxint
))
4160 > TYPE_PRECISION (short_integer_type_node
))
4162 r1
= int_range
<1> (integer_zero_node
, maxint
);
4163 range_cast (r1
, short_integer_type_node
);
4164 ASSERT_TRUE (r1
.lower_bound () == wi::to_wide (minshort
)
4165 && r1
.upper_bound() == wi::to_wide (maxshort
));
4168 // (unsigned char)[-5,-1] => [251,255].
4169 r0
= rold
= int_range
<1> (SCHAR (-5), SCHAR (-1));
4170 range_cast (r0
, unsigned_char_type_node
);
4171 ASSERT_TRUE (r0
== int_range
<1> (UCHAR (251), UCHAR (255)));
4172 range_cast (r0
, signed_char_type_node
);
4173 ASSERT_TRUE (r0
== rold
);
4175 // (signed char)[15, 150] => [-128,-106][15,127].
4176 r0
= rold
= int_range
<1> (UCHAR (15), UCHAR (150));
4177 range_cast (r0
, signed_char_type_node
);
4178 r1
= int_range
<1> (SCHAR (15), SCHAR (127));
4179 r2
= int_range
<1> (SCHAR (-128), SCHAR (-106));
4181 ASSERT_TRUE (r1
== r0
);
4182 range_cast (r0
, unsigned_char_type_node
);
4183 ASSERT_TRUE (r0
== rold
);
4185 // (unsigned char)[-5, 5] => [0,5][251,255].
4186 r0
= rold
= int_range
<1> (SCHAR (-5), SCHAR (5));
4187 range_cast (r0
, unsigned_char_type_node
);
4188 r1
= int_range
<1> (UCHAR (251), UCHAR (255));
4189 r2
= int_range
<1> (UCHAR (0), UCHAR (5));
4191 ASSERT_TRUE (r0
== r1
);
4192 range_cast (r0
, signed_char_type_node
);
4193 ASSERT_TRUE (r0
== rold
);
4195 // (unsigned char)[-5,5] => [0,5][251,255].
4196 r0
= int_range
<1> (INT (-5), INT (5));
4197 range_cast (r0
, unsigned_char_type_node
);
4198 r1
= int_range
<1> (UCHAR (0), UCHAR (5));
4199 r1
.union_ (int_range
<1> (UCHAR (251), UCHAR (255)));
4200 ASSERT_TRUE (r0
== r1
);
4202 // (unsigned char)[5U,1974U] => [0,255].
4203 r0
= int_range
<1> (UINT (5), UINT (1974));
4204 range_cast (r0
, unsigned_char_type_node
);
4205 ASSERT_TRUE (r0
== int_range
<1> (UCHAR (0), UCHAR (255)));
4206 range_cast (r0
, integer_type_node
);
4207 // Going to a wider range should not sign extend.
4208 ASSERT_TRUE (r0
== int_range
<1> (INT (0), INT (255)));
4210 // (unsigned char)[-350,15] => [0,255].
4211 r0
= int_range
<1> (INT (-350), INT (15));
4212 range_cast (r0
, unsigned_char_type_node
);
4213 ASSERT_TRUE (r0
== (int_range
<1>
4214 (TYPE_MIN_VALUE (unsigned_char_type_node
),
4215 TYPE_MAX_VALUE (unsigned_char_type_node
))));
4217 // Casting [-120,20] from signed char to unsigned short.
4218 // => [0, 20][0xff88, 0xffff].
4219 r0
= int_range
<1> (SCHAR (-120), SCHAR (20));
4220 range_cast (r0
, short_unsigned_type_node
);
4221 r1
= int_range
<1> (UINT16 (0), UINT16 (20));
4222 r2
= int_range
<1> (UINT16 (0xff88), UINT16 (0xffff));
4224 ASSERT_TRUE (r0
== r1
);
4225 // A truncating cast back to signed char will work because [-120, 20]
4226 // is representable in signed char.
4227 range_cast (r0
, signed_char_type_node
);
4228 ASSERT_TRUE (r0
== int_range
<1> (SCHAR (-120), SCHAR (20)));
4230 // unsigned char -> signed short
4231 // (signed short)[(unsigned char)25, (unsigned char)250]
4232 // => [(signed short)25, (signed short)250]
4233 r0
= rold
= int_range
<1> (UCHAR (25), UCHAR (250));
4234 range_cast (r0
, short_integer_type_node
);
4235 r1
= int_range
<1> (INT16 (25), INT16 (250));
4236 ASSERT_TRUE (r0
== r1
);
4237 range_cast (r0
, unsigned_char_type_node
);
4238 ASSERT_TRUE (r0
== rold
);
4240 // Test casting a wider signed [-MIN,MAX] to a nar`rower unsigned.
4241 r0
= int_range
<1> (TYPE_MIN_VALUE (long_long_integer_type_node
),
4242 TYPE_MAX_VALUE (long_long_integer_type_node
));
4243 range_cast (r0
, short_unsigned_type_node
);
4244 r1
= int_range
<1> (TYPE_MIN_VALUE (short_unsigned_type_node
),
4245 TYPE_MAX_VALUE (short_unsigned_type_node
));
4246 ASSERT_TRUE (r0
== r1
);
4248 // Casting NONZERO to a narrower type will wrap/overflow so
4249 // it's just the entire range for the narrower type.
4251 // "NOT 0 at signed 32-bits" ==> [-MIN_32,-1][1, +MAX_32]. This is
4252 // is outside of the range of a smaller range, return the full
4254 if (TYPE_PRECISION (integer_type_node
)
4255 > TYPE_PRECISION (short_integer_type_node
))
4257 r0
= range_nonzero (integer_type_node
);
4258 range_cast (r0
, short_integer_type_node
);
4259 r1
= int_range
<1> (TYPE_MIN_VALUE (short_integer_type_node
),
4260 TYPE_MAX_VALUE (short_integer_type_node
));
4261 ASSERT_TRUE (r0
== r1
);
4264 // Casting NONZERO from a narrower signed to a wider signed.
4266 // NONZERO signed 16-bits is [-MIN_16,-1][1, +MAX_16].
4267 // Converting this to 32-bits signed is [-MIN_16,-1][1, +MAX_16].
4268 r0
= range_nonzero (short_integer_type_node
);
4269 range_cast (r0
, integer_type_node
);
4270 r1
= int_range
<1> (INT (-32768), INT (-1));
4271 r2
= int_range
<1> (INT (1), INT (32767));
4273 ASSERT_TRUE (r0
== r1
);
4277 range_op_lshift_tests ()
4279 // Test that 0x808.... & 0x8.... still contains 0x8....
4280 // for a large set of numbers.
4283 tree big_type
= long_long_unsigned_type_node
;
4284 // big_num = 0x808,0000,0000,0000
4285 tree big_num
= fold_build2 (LSHIFT_EXPR
, big_type
,
4286 build_int_cst (big_type
, 0x808),
4287 build_int_cst (big_type
, 48));
4288 op_bitwise_and
.fold_range (res
, big_type
,
4289 int_range
<1> (big_type
),
4290 int_range
<1> (big_num
, big_num
));
4291 // val = 0x8,0000,0000,0000
4292 tree val
= fold_build2 (LSHIFT_EXPR
, big_type
,
4293 build_int_cst (big_type
, 0x8),
4294 build_int_cst (big_type
, 48));
4295 ASSERT_TRUE (res
.contains_p (val
));
4298 if (TYPE_PRECISION (unsigned_type_node
) > 31)
4300 // unsigned VARYING = op1 << 1 should be VARYING.
4301 int_range
<2> lhs (unsigned_type_node
);
4302 int_range
<2> shift (INT (1), INT (1));
4304 op_lshift
.op1_range (op1
, unsigned_type_node
, lhs
, shift
);
4305 ASSERT_TRUE (op1
.varying_p ());
4307 // 0 = op1 << 1 should be [0,0], [0x8000000, 0x8000000].
4308 int_range
<2> zero (UINT (0), UINT (0));
4309 op_lshift
.op1_range (op1
, unsigned_type_node
, zero
, shift
);
4310 ASSERT_TRUE (op1
.num_pairs () == 2);
4311 // Remove the [0,0] range.
4312 op1
.intersect (zero
);
4313 ASSERT_TRUE (op1
.num_pairs () == 1);
4314 // op1 << 1 should be [0x8000,0x8000] << 1,
4315 // which should result in [0,0].
4316 int_range_max result
;
4317 op_lshift
.fold_range (result
, unsigned_type_node
, op1
, shift
);
4318 ASSERT_TRUE (result
== zero
);
4320 // signed VARYING = op1 << 1 should be VARYING.
4321 if (TYPE_PRECISION (integer_type_node
) > 31)
4323 // unsigned VARYING = op1 << 1 hould be VARYING.
4324 int_range
<2> lhs (integer_type_node
);
4325 int_range
<2> shift (INT (1), INT (1));
4327 op_lshift
.op1_range (op1
, integer_type_node
, lhs
, shift
);
4328 ASSERT_TRUE (op1
.varying_p ());
4330 // 0 = op1 << 1 should be [0,0], [0x8000000, 0x8000000].
4331 int_range
<2> zero (INT (0), INT (0));
4332 op_lshift
.op1_range (op1
, integer_type_node
, zero
, shift
);
4333 ASSERT_TRUE (op1
.num_pairs () == 2);
4334 // Remove the [0,0] range.
4335 op1
.intersect (zero
);
4336 ASSERT_TRUE (op1
.num_pairs () == 1);
4337 // op1 << 1 shuould be [0x8000,0x8000] << 1,
4338 // which should result in [0,0].
4339 int_range_max result
;
4340 op_lshift
.fold_range (result
, unsigned_type_node
, op1
, shift
);
4341 ASSERT_TRUE (result
== zero
);
4346 range_op_rshift_tests ()
4348 // unsigned: [3, MAX] = OP1 >> 1
4350 int_range_max
lhs (build_int_cst (unsigned_type_node
, 3),
4351 TYPE_MAX_VALUE (unsigned_type_node
));
4352 int_range_max
one (build_one_cst (unsigned_type_node
),
4353 build_one_cst (unsigned_type_node
));
4355 op_rshift
.op1_range (op1
, unsigned_type_node
, lhs
, one
);
4356 ASSERT_FALSE (op1
.contains_p (UINT (3)));
4359 // signed: [3, MAX] = OP1 >> 1
4361 int_range_max
lhs (INT (3), TYPE_MAX_VALUE (integer_type_node
));
4362 int_range_max
one (INT (1), INT (1));
4364 op_rshift
.op1_range (op1
, integer_type_node
, lhs
, one
);
4365 ASSERT_FALSE (op1
.contains_p (INT (-2)));
4368 // This is impossible, so OP1 should be [].
4369 // signed: [MIN, MIN] = OP1 >> 1
4371 int_range_max
lhs (TYPE_MIN_VALUE (integer_type_node
),
4372 TYPE_MIN_VALUE (integer_type_node
));
4373 int_range_max
one (INT (1), INT (1));
4375 op_rshift
.op1_range (op1
, integer_type_node
, lhs
, one
);
4376 ASSERT_TRUE (op1
.undefined_p ());
4379 // signed: ~[-1] = OP1 >> 31
4380 if (TYPE_PRECISION (integer_type_node
) > 31)
4382 int_range_max
lhs (INT (-1), INT (-1), VR_ANTI_RANGE
);
4383 int_range_max
shift (INT (31), INT (31));
4385 op_rshift
.op1_range (op1
, integer_type_node
, lhs
, shift
);
4386 int_range_max negatives
= range_negatives (integer_type_node
);
4387 negatives
.intersect (op1
);
4388 ASSERT_TRUE (negatives
.undefined_p ());
4393 range_op_bitwise_and_tests ()
4396 tree min
= vrp_val_min (integer_type_node
);
4397 tree max
= vrp_val_max (integer_type_node
);
4398 tree tiny
= fold_build2 (PLUS_EXPR
, integer_type_node
, min
,
4399 build_one_cst (integer_type_node
));
4400 int_range_max
i1 (tiny
, max
);
4401 int_range_max
i2 (build_int_cst (integer_type_node
, 255),
4402 build_int_cst (integer_type_node
, 255));
4404 // [MIN+1, MAX] = OP1 & 255: OP1 is VARYING
4405 op_bitwise_and
.op1_range (res
, integer_type_node
, i1
, i2
);
4406 ASSERT_TRUE (res
== int_range
<1> (integer_type_node
));
4408 // VARYING = OP1 & 255: OP1 is VARYING
4409 i1
= int_range
<1> (integer_type_node
);
4410 op_bitwise_and
.op1_range (res
, integer_type_node
, i1
, i2
);
4411 ASSERT_TRUE (res
== int_range
<1> (integer_type_node
));
4413 // (NONZERO | X) is nonzero.
4414 i1
.set_nonzero (integer_type_node
);
4415 i2
.set_varying (integer_type_node
);
4416 op_bitwise_or
.fold_range (res
, integer_type_node
, i1
, i2
);
4417 ASSERT_TRUE (res
.nonzero_p ());
4419 // (NEGATIVE | X) is nonzero.
4420 i1
= int_range
<1> (INT (-5), INT (-3));
4421 i2
.set_varying (integer_type_node
);
4422 op_bitwise_or
.fold_range (res
, integer_type_node
, i1
, i2
);
4423 ASSERT_FALSE (res
.contains_p (INT (0)));
4427 range_relational_tests ()
4429 int_range
<2> lhs (unsigned_char_type_node
);
4430 int_range
<2> op1 (UCHAR (8), UCHAR (10));
4431 int_range
<2> op2 (UCHAR (20), UCHAR (20));
4433 // Never wrapping additions mean LHS > OP1.
4434 tree_code code
= op_plus
.lhs_op1_relation (lhs
, op1
, op2
);
4435 ASSERT_TRUE (code
== GT_EXPR
);
4437 // Most wrapping additions mean nothing...
4438 op1
= int_range
<2> (UCHAR (8), UCHAR (10));
4439 op2
= int_range
<2> (UCHAR (0), UCHAR (255));
4440 code
= op_plus
.lhs_op1_relation (lhs
, op1
, op2
);
4441 ASSERT_TRUE (code
== VREL_NONE
);
4443 // However, always wrapping additions mean LHS < OP1.
4444 op1
= int_range
<2> (UCHAR (1), UCHAR (255));
4445 op2
= int_range
<2> (UCHAR (255), UCHAR (255));
4446 code
= op_plus
.lhs_op1_relation (lhs
, op1
, op2
);
4447 ASSERT_TRUE (code
== LT_EXPR
);
4453 range_op_rshift_tests ();
4454 range_op_lshift_tests ();
4455 range_op_bitwise_and_tests ();
4456 range_op_cast_tests ();
4457 range_relational_tests ();
4460 } // namespace selftest
4462 #endif // CHECKING_P