1 /* Support routines for value ranges.
2 Copyright (C) 2019-2023 Free Software Foundation, Inc.
3 Major hacks by Aldy Hernandez <aldyh@redhat.com> and
4 Andrew MacLeod <amacleod@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"
29 #include "tree-pretty-print.h"
30 #include "value-range-pretty-print.h"
31 #include "fold-const.h"
32 #include "gimple-range.h"
35 irange::accept (const vrange_visitor
&v
) const
41 unsupported_range::accept (const vrange_visitor
&v
) const
46 // Convenience function only available for integers and pointers.
49 Value_Range::lower_bound () const
51 if (is_a
<irange
> (*m_vrange
))
52 return as_a
<irange
> (*m_vrange
).lower_bound ();
56 // Convenience function only available for integers and pointers.
59 Value_Range::upper_bound () const
61 if (is_a
<irange
> (*m_vrange
))
62 return as_a
<irange
> (*m_vrange
).upper_bound ();
67 Value_Range::dump (FILE *out
) const
72 fprintf (out
, "NULL");
76 debug (const Value_Range
&r
)
79 fprintf (stderr
, "\n");
83 debug (const irange_bitmask
&bm
)
86 fprintf (stderr
, "\n");
89 // Default vrange definitions.
92 vrange::contains_p (tree
) const
98 vrange::singleton_p (tree
*) const
104 vrange::set (tree min
, tree
, value_range_kind
)
106 set_varying (TREE_TYPE (min
));
110 vrange::type () const
112 return void_type_node
;
116 vrange::supports_type_p (const_tree
) const
122 vrange::set_undefined ()
124 m_kind
= VR_UNDEFINED
;
128 vrange::set_varying (tree
)
134 vrange::union_ (const vrange
&r
)
136 if (r
.undefined_p () || varying_p ())
138 if (undefined_p () || r
.varying_p ())
148 vrange::intersect (const vrange
&r
)
150 if (undefined_p () || r
.varying_p ())
152 if (r
.undefined_p ())
167 vrange::zero_p () const
173 vrange::nonzero_p () const
179 vrange::set_nonzero (tree type
)
185 vrange::set_zero (tree type
)
191 vrange::set_nonnegative (tree type
)
197 vrange::fits_p (const vrange
&) const
202 // Assignment operator for generic ranges. Copying incompatible types
206 vrange::operator= (const vrange
&src
)
208 if (is_a
<irange
> (src
))
209 as_a
<irange
> (*this) = as_a
<irange
> (src
);
210 else if (is_a
<frange
> (src
))
211 as_a
<frange
> (*this) = as_a
<frange
> (src
);
214 gcc_checking_assert (is_a
<unsupported_range
> (src
));
220 // Equality operator for generic ranges.
223 vrange::operator== (const vrange
&src
) const
225 if (is_a
<irange
> (src
))
226 return as_a
<irange
> (*this) == as_a
<irange
> (src
);
227 if (is_a
<frange
> (src
))
228 return as_a
<frange
> (*this) == as_a
<frange
> (src
);
232 // Wrapper for vrange_printer to dump a range to a file.
235 vrange::dump (FILE *file
) const
237 pretty_printer buffer
;
238 pp_needs_newline (&buffer
) = true;
239 buffer
.buffer
->stream
= file
;
240 vrange_printer
vrange_pp (&buffer
);
241 this->accept (vrange_pp
);
246 irange_bitmask::dump (FILE *file
) const
248 char buf
[WIDE_INT_PRINT_BUFFER_SIZE
];
249 pretty_printer buffer
;
251 pp_needs_newline (&buffer
) = true;
252 buffer
.buffer
->stream
= file
;
253 pp_string (&buffer
, "MASK ");
254 print_hex (m_mask
, buf
);
255 pp_string (&buffer
, buf
);
256 pp_string (&buffer
, " VALUE ");
257 print_hex (m_value
, buf
);
258 pp_string (&buffer
, buf
);
266 add_vrange (const vrange
&v
, inchash::hash
&hstate
,
269 if (v
.undefined_p ())
271 hstate
.add_int (VR_UNDEFINED
);
274 // Types are ignored throughout to inhibit two ranges being equal
275 // but having different hash values. This can happen when two
276 // ranges are equal and their types are different (but
277 // types_compatible_p is true).
278 if (is_a
<irange
> (v
))
280 const irange
&r
= as_a
<irange
> (v
);
282 hstate
.add_int (VR_VARYING
);
284 hstate
.add_int (VR_RANGE
);
285 for (unsigned i
= 0; i
< r
.num_pairs (); ++i
)
287 hstate
.add_wide_int (r
.lower_bound (i
));
288 hstate
.add_wide_int (r
.upper_bound (i
));
290 irange_bitmask bm
= r
.get_bitmask ();
291 hstate
.add_wide_int (bm
.value ());
292 hstate
.add_wide_int (bm
.mask ());
295 if (is_a
<frange
> (v
))
297 const frange
&r
= as_a
<frange
> (v
);
298 if (r
.known_isnan ())
299 hstate
.add_int (VR_NAN
);
302 hstate
.add_int (r
.varying_p () ? VR_VARYING
: VR_RANGE
);
303 hstate
.add_real_value (r
.lower_bound ());
304 hstate
.add_real_value (r
.upper_bound ());
306 nan_state nan
= r
.get_nan_state ();
307 hstate
.add_int (nan
.pos_p ());
308 hstate
.add_int (nan
.neg_p ());
314 } //namespace inchash
317 irange::supports_type_p (const_tree type
) const
319 return supports_p (type
);
322 // Return TRUE if R fits in THIS.
325 irange::fits_p (const vrange
&r
) const
327 return m_max_ranges
>= as_a
<irange
> (r
).num_pairs ();
331 irange::set_nonnegative (tree type
)
334 wi::zero (TYPE_PRECISION (type
)),
335 wi::to_wide (TYPE_MAX_VALUE (type
)));
339 frange::accept (const vrange_visitor
&v
) const
344 // Flush denormal endpoints to the appropriate 0.0.
347 frange::flush_denormals_to_zero ()
349 if (undefined_p () || known_isnan ())
352 machine_mode mode
= TYPE_MODE (type ());
353 // Flush [x, -DENORMAL] to [x, -0.0].
354 if (real_isdenormal (&m_max
, mode
) && real_isneg (&m_max
))
356 if (HONOR_SIGNED_ZEROS (m_type
))
361 // Flush [+DENORMAL, x] to [+0.0, x].
362 if (real_isdenormal (&m_min
, mode
) && !real_isneg (&m_min
))
366 // Setter for franges.
369 frange::set (tree type
,
370 const REAL_VALUE_TYPE
&min
, const REAL_VALUE_TYPE
&max
,
371 const nan_state
&nan
, value_range_kind kind
)
388 gcc_checking_assert (!real_isnan (&min
) && !real_isnan (&max
));
394 if (HONOR_NANS (m_type
))
396 m_pos_nan
= nan
.pos_p ();
397 m_neg_nan
= nan
.neg_p ();
405 if (!MODE_HAS_SIGNED_ZEROS (TYPE_MODE (m_type
)))
407 if (real_iszero (&m_min
, 1))
409 if (real_iszero (&m_max
, 1))
412 else if (!HONOR_SIGNED_ZEROS (m_type
))
414 if (real_iszero (&m_max
, 1))
416 if (real_iszero (&m_min
, 0))
420 // For -ffinite-math-only we can drop ranges outside the
421 // representable numbers to min/max for the type.
422 if (!HONOR_INFINITIES (m_type
))
424 REAL_VALUE_TYPE min_repr
= frange_val_min (m_type
);
425 REAL_VALUE_TYPE max_repr
= frange_val_max (m_type
);
426 if (real_less (&m_min
, &min_repr
))
428 else if (real_less (&max_repr
, &m_min
))
430 if (real_less (&max_repr
, &m_max
))
432 else if (real_less (&m_max
, &min_repr
))
436 // Check for swapped ranges.
437 gcc_checking_assert (real_compare (LE_EXPR
, &min
, &max
));
442 // Setter for an frange defaulting the NAN possibility to +-NAN when
446 frange::set (tree type
,
447 const REAL_VALUE_TYPE
&min
, const REAL_VALUE_TYPE
&max
,
448 value_range_kind kind
)
450 set (type
, min
, max
, nan_state (true), kind
);
454 frange::set (tree min
, tree max
, value_range_kind kind
)
456 set (TREE_TYPE (min
),
457 *TREE_REAL_CST_PTR (min
), *TREE_REAL_CST_PTR (max
), kind
);
460 // Normalize range to VARYING or UNDEFINED, or vice versa. Return
461 // TRUE if anything changed.
463 // A range with no known properties can be dropped to VARYING.
464 // Similarly, a VARYING with any properties should be dropped to a
465 // VR_RANGE. Normalizing ranges upon changing them ensures there is
466 // only one representation for a given range.
469 frange::normalize_kind ()
471 if (m_kind
== VR_RANGE
472 && frange_val_is_min (m_min
, m_type
)
473 && frange_val_is_max (m_max
, m_type
))
475 if (!HONOR_NANS (m_type
) || (m_pos_nan
&& m_neg_nan
))
477 set_varying (m_type
);
481 else if (m_kind
== VR_VARYING
)
483 if (HONOR_NANS (m_type
) && (!m_pos_nan
|| !m_neg_nan
))
486 m_min
= frange_val_min (m_type
);
487 m_max
= frange_val_max (m_type
);
493 else if (m_kind
== VR_NAN
&& !m_pos_nan
&& !m_neg_nan
)
498 // Union or intersect the zero endpoints of two ranges. For example:
499 // [-0, x] U [+0, x] => [-0, x]
500 // [ x, -0] U [ x, +0] => [ x, +0]
501 // [-0, x] ^ [+0, x] => [+0, x]
502 // [ x, -0] ^ [ x, +0] => [ x, -0]
504 // UNION_P is true when performing a union, or false when intersecting.
507 frange::combine_zeros (const frange
&r
, bool union_p
)
509 gcc_checking_assert (!undefined_p () && !known_isnan ());
511 bool changed
= false;
512 if (real_iszero (&m_min
) && real_iszero (&r
.m_min
)
513 && real_isneg (&m_min
) != real_isneg (&r
.m_min
))
515 m_min
.sign
= union_p
;
518 if (real_iszero (&m_max
) && real_iszero (&r
.m_max
)
519 && real_isneg (&m_max
) != real_isneg (&r
.m_max
))
521 m_max
.sign
= !union_p
;
524 // If the signs are swapped, the resulting range is empty.
525 if (m_min
.sign
== 0 && m_max
.sign
== 1)
536 // Union two ranges when one is known to be a NAN.
539 frange::union_nans (const frange
&r
)
541 gcc_checking_assert (known_isnan () || r
.known_isnan ());
549 m_pos_nan
|= r
.m_pos_nan
;
550 m_neg_nan
|= r
.m_neg_nan
;
556 frange::union_ (const vrange
&v
)
558 const frange
&r
= as_a
<frange
> (v
);
560 if (r
.undefined_p () || varying_p ())
562 if (undefined_p () || r
.varying_p ())
569 if (known_isnan () || r
.known_isnan ())
570 return union_nans (r
);
571 bool changed
= false;
572 if (m_pos_nan
!= r
.m_pos_nan
|| m_neg_nan
!= r
.m_neg_nan
)
574 m_pos_nan
|= r
.m_pos_nan
;
575 m_neg_nan
|= r
.m_neg_nan
;
579 // Combine endpoints.
580 if (real_less (&r
.m_min
, &m_min
))
585 if (real_less (&m_max
, &r
.m_max
))
591 if (HONOR_SIGNED_ZEROS (m_type
))
592 changed
|= combine_zeros (r
, true);
594 changed
|= normalize_kind ();
598 // Intersect two ranges when one is known to be a NAN.
601 frange::intersect_nans (const frange
&r
)
603 gcc_checking_assert (known_isnan () || r
.known_isnan ());
605 m_pos_nan
&= r
.m_pos_nan
;
606 m_neg_nan
&= r
.m_neg_nan
;
617 frange::intersect (const vrange
&v
)
619 const frange
&r
= as_a
<frange
> (v
);
621 if (undefined_p () || r
.varying_p ())
623 if (r
.undefined_p ())
635 if (known_isnan () || r
.known_isnan ())
636 return intersect_nans (r
);
637 bool changed
= false;
638 if (m_pos_nan
!= r
.m_pos_nan
|| m_neg_nan
!= r
.m_neg_nan
)
640 m_pos_nan
&= r
.m_pos_nan
;
641 m_neg_nan
&= r
.m_neg_nan
;
645 // Combine endpoints.
646 if (real_less (&m_min
, &r
.m_min
))
651 if (real_less (&r
.m_max
, &m_max
))
656 // If the endpoints are swapped, the resulting range is empty.
657 if (real_less (&m_max
, &m_min
))
668 if (HONOR_SIGNED_ZEROS (m_type
))
669 changed
|= combine_zeros (r
, false);
671 changed
|= normalize_kind ();
676 frange::operator= (const frange
&src
)
682 m_pos_nan
= src
.m_pos_nan
;
683 m_neg_nan
= src
.m_neg_nan
;
691 frange::operator== (const frange
&src
) const
693 if (m_kind
== src
.m_kind
)
699 return types_compatible_p (m_type
, src
.m_type
);
701 bool nan1
= known_isnan ();
702 bool nan2
= src
.known_isnan ();
706 return (m_pos_nan
== src
.m_pos_nan
707 && m_neg_nan
== src
.m_neg_nan
);
711 return (real_identical (&m_min
, &src
.m_min
)
712 && real_identical (&m_max
, &src
.m_max
)
713 && m_pos_nan
== src
.m_pos_nan
714 && m_neg_nan
== src
.m_neg_nan
715 && types_compatible_p (m_type
, src
.m_type
));
720 // Return TRUE if range contains R.
723 frange::contains_p (const REAL_VALUE_TYPE
&r
) const
725 gcc_checking_assert (m_kind
!= VR_ANTI_RANGE
);
736 if (!m_pos_nan
&& !m_neg_nan
)
738 // Both +NAN and -NAN are present.
739 if (m_pos_nan
&& m_neg_nan
)
741 return m_neg_nan
== r
.sign
;
746 if (real_compare (GE_EXPR
, &r
, &m_min
) && real_compare (LE_EXPR
, &r
, &m_max
))
748 // Make sure the signs are equal for signed zeros.
749 if (HONOR_SIGNED_ZEROS (m_type
) && real_iszero (&r
))
750 return r
.sign
== m_min
.sign
|| r
.sign
== m_max
.sign
;
756 // If range is a singleton, place it in RESULT and return TRUE. If
757 // RESULT is NULL, just return TRUE.
759 // A NAN can never be a singleton.
762 frange::internal_singleton_p (REAL_VALUE_TYPE
*result
) const
764 if (m_kind
== VR_RANGE
&& real_identical (&m_min
, &m_max
))
766 // Return false for any singleton that may be a NAN.
767 if (HONOR_NANS (m_type
) && maybe_isnan ())
770 if (MODE_COMPOSITE_P (TYPE_MODE (m_type
)))
772 // For IBM long doubles, if the value is +-Inf or is exactly
773 // representable in double, the other double could be +0.0
774 // or -0.0. Since this means there is more than one way to
775 // represent a value, return false to avoid propagating it.
776 // See libgcc/config/rs6000/ibm-ldouble-format for details.
777 if (real_isinf (&m_min
))
780 real_convert (&r
, DFmode
, &m_min
);
781 if (real_identical (&r
, &m_min
))
793 frange::singleton_p (tree
*result
) const
795 if (internal_singleton_p ())
798 *result
= build_real (m_type
, m_min
);
805 frange::singleton_p (REAL_VALUE_TYPE
&r
) const
807 return internal_singleton_p (&r
);
811 frange::supports_type_p (const_tree type
) const
813 return supports_p (type
);
817 frange::verify_range ()
820 gcc_checking_assert (HONOR_NANS (m_type
) || !maybe_isnan ());
824 gcc_checking_assert (!m_type
);
827 gcc_checking_assert (m_type
);
828 gcc_checking_assert (frange_val_is_min (m_min
, m_type
));
829 gcc_checking_assert (frange_val_is_max (m_max
, m_type
));
830 if (HONOR_NANS (m_type
))
831 gcc_checking_assert (m_pos_nan
&& m_neg_nan
);
833 gcc_checking_assert (!m_pos_nan
&& !m_neg_nan
);
836 gcc_checking_assert (m_type
);
839 gcc_checking_assert (m_type
);
840 gcc_checking_assert (m_pos_nan
|| m_neg_nan
);
846 // NANs cannot appear in the endpoints of a range.
847 gcc_checking_assert (!real_isnan (&m_min
) && !real_isnan (&m_max
));
849 // Make sure we don't have swapped ranges.
850 gcc_checking_assert (!real_less (&m_max
, &m_min
));
852 // [ +0.0, -0.0 ] is nonsensical.
853 gcc_checking_assert (!(real_iszero (&m_min
, 0) && real_iszero (&m_max
, 1)));
855 // If all the properties are clear, we better not span the entire
856 // domain, because that would make us varying.
857 if (m_pos_nan
&& m_neg_nan
)
858 gcc_checking_assert (!frange_val_is_min (m_min
, m_type
)
859 || !frange_val_is_max (m_max
, m_type
));
862 // We can't do much with nonzeros yet.
864 frange::set_nonzero (tree type
)
869 // We can't do much with nonzeros yet.
871 frange::nonzero_p () const
876 // Set range to [+0.0, +0.0] if honoring signed zeros, or [0.0, 0.0]
880 frange::set_zero (tree type
)
882 if (HONOR_SIGNED_ZEROS (type
))
884 set (type
, dconstm0
, dconst0
);
888 set (type
, dconst0
, dconst0
);
891 // Return TRUE for any zero regardless of sign.
894 frange::zero_p () const
896 return (m_kind
== VR_RANGE
897 && real_iszero (&m_min
)
898 && real_iszero (&m_max
));
901 // Set the range to non-negative numbers, that is [+0.0, +INF].
903 // The NAN in the resulting range (if HONOR_NANS) has a varying sign
904 // as there are no guarantees in IEEE 754 wrt to the sign of a NAN,
905 // except for copy, abs, and copysign. It is the responsibility of
906 // the caller to set the NAN's sign if desired.
909 frange::set_nonnegative (tree type
)
911 set (type
, dconst0
, frange_val_max (type
));
914 // Here we copy between any two irange's.
917 irange::operator= (const irange
&src
)
919 int needed
= src
.num_pairs ();
920 maybe_resize (needed
);
923 unsigned lim
= src
.m_num_ranges
;
924 if (lim
> m_max_ranges
)
927 for (x
= 0; x
< lim
* 2; ++x
)
928 m_base
[x
] = src
.m_base
[x
];
930 // If the range didn't fit, the last range should cover the rest.
931 if (lim
!= src
.m_num_ranges
)
932 m_base
[x
- 1] = src
.m_base
[src
.m_num_ranges
* 2 - 1];
937 m_bitmask
= src
.m_bitmask
;
938 if (m_max_ranges
== 1)
946 get_legacy_range (const irange
&r
, tree
&min
, tree
&max
)
948 if (r
.undefined_p ())
955 tree type
= r
.type ();
958 min
= wide_int_to_tree (type
, r
.lower_bound ());
959 max
= wide_int_to_tree (type
, r
.upper_bound ());
963 unsigned int precision
= TYPE_PRECISION (type
);
964 signop sign
= TYPE_SIGN (type
);
965 if (r
.num_pairs () > 1
967 && r
.lower_bound () == wi::min_value (precision
, sign
)
968 && r
.upper_bound () == wi::max_value (precision
, sign
))
970 int_range
<3> inv (r
);
972 min
= wide_int_to_tree (type
, inv
.lower_bound (0));
973 max
= wide_int_to_tree (type
, inv
.upper_bound (0));
974 return VR_ANTI_RANGE
;
977 min
= wide_int_to_tree (type
, r
.lower_bound ());
978 max
= wide_int_to_tree (type
, r
.upper_bound ());
982 /* Set value range to the canonical form of {VRTYPE, MIN, MAX, EQUIV}.
983 This means adjusting VRTYPE, MIN and MAX representing the case of a
984 wrapping range with MAX < MIN covering [MIN, type_max] U [type_min, MAX]
985 as anti-rage ~[MAX+1, MIN-1]. Likewise for wrapping anti-ranges.
986 In corner cases where MAX+1 or MIN-1 wraps this will fall back
988 This routine exists to ease canonicalization in the case where we
989 extract ranges from var + CST op limit. */
992 irange::set (tree type
, const wide_int
&min
, const wide_int
&max
,
993 value_range_kind kind
)
995 unsigned prec
= TYPE_PRECISION (type
);
996 signop sign
= TYPE_SIGN (type
);
997 wide_int min_value
= wi::min_value (prec
, sign
);
998 wide_int max_value
= wi::max_value (prec
, sign
);
1001 m_bitmask
.set_unknown (prec
);
1003 if (kind
== VR_RANGE
)
1008 if (min
== min_value
&& max
== max_value
)
1009 m_kind
= VR_VARYING
;
1015 gcc_checking_assert (kind
== VR_ANTI_RANGE
);
1016 gcc_checking_assert (m_max_ranges
> 1);
1018 m_kind
= VR_UNDEFINED
;
1020 wi::overflow_type ovf
;
1023 lim
= wi::add (min
, -1, sign
, &ovf
);
1025 lim
= wi::sub (min
, 1, sign
, &ovf
);
1030 m_base
[0] = min_value
;
1035 lim
= wi::sub (max
, -1, sign
, &ovf
);
1037 lim
= wi::add (max
, 1, sign
, &ovf
);
1041 m_base
[m_num_ranges
* 2] = lim
;
1042 m_base
[m_num_ranges
* 2 + 1] = max_value
;
1052 irange::set (tree min
, tree max
, value_range_kind kind
)
1054 if (POLY_INT_CST_P (min
) || POLY_INT_CST_P (max
))
1056 set_varying (TREE_TYPE (min
));
1060 gcc_checking_assert (TREE_CODE (min
) == INTEGER_CST
);
1061 gcc_checking_assert (TREE_CODE (max
) == INTEGER_CST
);
1063 return set (TREE_TYPE (min
), wi::to_wide (min
), wi::to_wide (max
), kind
);
1066 // Check the validity of the range.
1069 irange::verify_range ()
1071 gcc_checking_assert (m_discriminator
== VR_IRANGE
);
1072 if (m_kind
== VR_UNDEFINED
)
1074 gcc_checking_assert (m_num_ranges
== 0);
1077 gcc_checking_assert (m_num_ranges
<= m_max_ranges
);
1079 // Legacy allowed these to represent VARYING for unknown types.
1080 // Leave this in for now, until all users are converted. Eventually
1081 // we should abort in set_varying.
1082 if (m_kind
== VR_VARYING
&& m_type
== error_mark_node
)
1085 unsigned prec
= TYPE_PRECISION (m_type
);
1086 if (m_kind
== VR_VARYING
)
1088 gcc_checking_assert (m_bitmask
.unknown_p ());
1089 gcc_checking_assert (m_num_ranges
== 1);
1090 gcc_checking_assert (varying_compatible_p ());
1091 gcc_checking_assert (lower_bound ().get_precision () == prec
);
1092 gcc_checking_assert (upper_bound ().get_precision () == prec
);
1095 gcc_checking_assert (m_num_ranges
!= 0);
1096 gcc_checking_assert (!varying_compatible_p ());
1097 for (unsigned i
= 0; i
< m_num_ranges
; ++i
)
1099 wide_int lb
= lower_bound (i
);
1100 wide_int ub
= upper_bound (i
);
1101 gcc_checking_assert (lb
.get_precision () == prec
);
1102 gcc_checking_assert (ub
.get_precision () == prec
);
1103 int c
= wi::cmp (lb
, ub
, TYPE_SIGN (m_type
));
1104 gcc_checking_assert (c
== 0 || c
== -1);
1106 m_bitmask
.verify_mask ();
1110 irange::operator== (const irange
&other
) const
1112 if (m_num_ranges
!= other
.m_num_ranges
)
1115 if (m_num_ranges
== 0)
1118 signop sign1
= TYPE_SIGN (type ());
1119 signop sign2
= TYPE_SIGN (other
.type ());
1121 for (unsigned i
= 0; i
< m_num_ranges
; ++i
)
1123 widest_int lb
= widest_int::from (lower_bound (i
), sign1
);
1124 widest_int ub
= widest_int::from (upper_bound (i
), sign1
);
1125 widest_int lb_other
= widest_int::from (other
.lower_bound (i
), sign2
);
1126 widest_int ub_other
= widest_int::from (other
.upper_bound (i
), sign2
);
1127 if (lb
!= lb_other
|| ub
!= ub_other
)
1131 irange_bitmask bm1
= get_bitmask ();
1132 irange_bitmask bm2
= other
.get_bitmask ();
1133 widest_int tmp1
= widest_int::from (bm1
.mask (), sign1
);
1134 widest_int tmp2
= widest_int::from (bm2
.mask (), sign2
);
1137 if (bm1
.unknown_p ())
1139 tmp1
= widest_int::from (bm1
.value (), sign1
);
1140 tmp2
= widest_int::from (bm2
.value (), sign2
);
1141 return tmp1
== tmp2
;
1144 /* If range is a singleton, place it in RESULT and return TRUE. */
1147 irange::singleton_p (tree
*result
) const
1149 if (num_pairs () == 1 && lower_bound () == upper_bound ())
1152 *result
= wide_int_to_tree (type (), lower_bound ());
1159 irange::singleton_p (wide_int
&w
) const
1161 if (num_pairs () == 1 && lower_bound () == upper_bound ())
1169 /* Return 1 if CST is inside value range.
1170 0 if CST is not inside value range.
1172 Benchmark compile/20001226-1.c compilation time after changing this
1176 irange::contains_p (const wide_int
&cst
) const
1181 // See if we can exclude CST based on the known 0 bits.
1182 if (!m_bitmask
.unknown_p ()
1184 && wi::bit_and (m_bitmask
.get_nonzero_bits (), cst
) == 0)
1187 signop sign
= TYPE_SIGN (type ());
1188 for (unsigned r
= 0; r
< m_num_ranges
; ++r
)
1190 if (wi::lt_p (cst
, lower_bound (r
), sign
))
1192 if (wi::le_p (cst
, upper_bound (r
), sign
))
1199 // Perform an efficient union with R when both ranges have only a single pair.
1200 // Excluded are VARYING and UNDEFINED ranges.
1203 irange::irange_single_pair_union (const irange
&r
)
1205 gcc_checking_assert (!undefined_p () && !varying_p ());
1206 gcc_checking_assert (!r
.undefined_p () && !varying_p ());
1208 signop sign
= TYPE_SIGN (m_type
);
1209 // Check if current lower bound is also the new lower bound.
1210 if (wi::le_p (m_base
[0], r
.m_base
[0], sign
))
1212 // If current upper bound is new upper bound, we're done.
1213 if (wi::le_p (r
.m_base
[1], m_base
[1], sign
))
1214 return union_bitmask (r
);
1215 // Otherwise R has the new upper bound.
1216 // Check for overlap/touching ranges, or single target range.
1217 if (m_max_ranges
== 1
1218 || (widest_int::from (m_base
[1], sign
) + 1
1219 >= widest_int::from (r
.m_base
[0], TYPE_SIGN (r
.m_type
))))
1220 m_base
[1] = r
.m_base
[1];
1223 // This is a dual range result.
1224 m_base
[2] = r
.m_base
[0];
1225 m_base
[3] = r
.m_base
[1];
1228 // The range has been altered, so normalize it even if nothing
1229 // changed in the mask.
1230 if (!union_bitmask (r
))
1237 // Set the new lower bound to R's lower bound.
1238 wide_int lb
= m_base
[0];
1239 m_base
[0] = r
.m_base
[0];
1241 // If R fully contains THIS range, just set the upper bound.
1242 if (wi::ge_p (r
.m_base
[1], m_base
[1], sign
))
1243 m_base
[1] = r
.m_base
[1];
1244 // Check for overlapping ranges, or target limited to a single range.
1245 else if (m_max_ranges
== 1
1246 || (widest_int::from (r
.m_base
[1], TYPE_SIGN (r
.m_type
)) + 1
1247 >= widest_int::from (lb
, sign
)))
1251 // Left with 2 pairs.
1254 m_base
[3] = m_base
[1];
1255 m_base
[1] = r
.m_base
[1];
1257 // The range has been altered, so normalize it even if nothing
1258 // changed in the mask.
1259 if (!union_bitmask (r
))
1266 // Return TRUE if anything changes.
1269 irange::union_ (const vrange
&v
)
1271 const irange
&r
= as_a
<irange
> (v
);
1273 if (r
.undefined_p ())
1289 set_varying (type ());
1293 // Special case one range union one range.
1294 if (m_num_ranges
== 1 && r
.m_num_ranges
== 1)
1295 return irange_single_pair_union (r
);
1297 // If this ranges fully contains R, then we need do nothing.
1298 if (irange_contains_p (r
))
1299 return union_bitmask (r
);
1301 // Do not worry about merging and such by reserving twice as many
1302 // pairs as needed, and then simply sort the 2 ranges into this
1303 // intermediate form.
1305 // The intermediate result will have the property that the beginning
1306 // of each range is <= the beginning of the next range. There may
1307 // be overlapping ranges at this point. I.e. this would be valid
1308 // [-20, 10], [-10, 0], [0, 20], [40, 90] as it satisfies this
1309 // constraint : -20 < -10 < 0 < 40. When the range is rebuilt into r,
1310 // the merge is performed.
1312 // [Xi,Yi]..[Xn,Yn] U [Xj,Yj]..[Xm,Ym] --> [Xk,Yk]..[Xp,Yp]
1313 auto_vec
<wide_int
, 20> res (m_num_ranges
* 2 + r
.m_num_ranges
* 2);
1314 unsigned i
= 0, j
= 0, k
= 0;
1315 signop sign
= TYPE_SIGN (m_type
);
1317 while (i
< m_num_ranges
* 2 && j
< r
.m_num_ranges
* 2)
1319 // lower of Xi and Xj is the lowest point.
1320 if (widest_int::from (m_base
[i
], sign
)
1321 <= widest_int::from (r
.m_base
[j
], sign
))
1323 res
.quick_push (m_base
[i
]);
1324 res
.quick_push (m_base
[i
+ 1]);
1330 res
.quick_push (r
.m_base
[j
]);
1331 res
.quick_push (r
.m_base
[j
+ 1]);
1336 for ( ; i
< m_num_ranges
* 2; i
+= 2)
1338 res
.quick_push (m_base
[i
]);
1339 res
.quick_push (m_base
[i
+ 1]);
1342 for ( ; j
< r
.m_num_ranges
* 2; j
+= 2)
1344 res
.quick_push (r
.m_base
[j
]);
1345 res
.quick_push (r
.m_base
[j
+ 1]);
1349 // Now normalize the vector removing any overlaps.
1351 for (j
= 2; j
< k
; j
+= 2)
1353 // Current upper+1 is >= lower bound next pair, then we merge ranges.
1354 if (widest_int::from (res
[i
- 1], sign
) + 1
1355 >= widest_int::from (res
[j
], sign
))
1357 // New upper bounds is greater of current or the next one.
1358 if (widest_int::from (res
[j
+ 1], sign
)
1359 > widest_int::from (res
[i
- 1], sign
))
1360 res
[i
- 1] = res
[j
+ 1];
1364 // This is a new distinct range, but no point in copying it
1365 // if it is already in the right place.
1369 res
[i
++] = res
[j
+ 1];
1376 // At this point, the vector should have i ranges, none overlapping.
1377 // Now it simply needs to be copied, and if there are too many
1378 // ranges, merge some. We wont do any analysis as to what the
1379 // "best" merges are, simply combine the final ranges into one.
1380 maybe_resize (i
/ 2);
1381 if (i
> m_max_ranges
* 2)
1383 res
[m_max_ranges
* 2 - 1] = res
[i
- 1];
1384 i
= m_max_ranges
* 2;
1387 for (j
= 0; j
< i
; j
++)
1388 m_base
[j
] = res
[j
];
1389 m_num_ranges
= i
/ 2;
1392 // The range has been altered, so normalize it even if nothing
1393 // changed in the mask.
1394 if (!union_bitmask (r
))
1401 // Return TRUE if THIS fully contains R. No undefined or varying cases.
1404 irange::irange_contains_p (const irange
&r
) const
1406 gcc_checking_assert (!undefined_p () && !varying_p ());
1407 gcc_checking_assert (!r
.undefined_p () && !varying_p ());
1409 // In order for THIS to fully contain R, all of the pairs within R must
1410 // be fully contained by the pairs in this object.
1411 signop sign
= TYPE_SIGN (m_type
);
1414 wide_int rl
= r
.m_base
[0];
1415 wide_int ru
= r
.m_base
[1];
1416 wide_int l
= m_base
[0];
1417 wide_int u
= m_base
[1];
1420 // If r is contained within this range, move to the next R
1421 if (wi::ge_p (rl
, l
, sign
)
1422 && wi::le_p (ru
, u
, sign
))
1424 // This pair is OK, Either done, or bump to the next.
1425 if (++ri
>= r
.num_pairs ())
1427 rl
= r
.m_base
[ri
* 2];
1428 ru
= r
.m_base
[ri
* 2 + 1];
1431 // Otherwise, check if this's pair occurs before R's.
1432 if (wi::lt_p (u
, rl
, sign
))
1434 // There's still at least one pair of R left.
1435 if (++i
>= num_pairs ())
1438 u
= m_base
[i
* 2 + 1];
1447 // Return TRUE if anything changes.
1450 irange::intersect (const vrange
&v
)
1452 const irange
&r
= as_a
<irange
> (v
);
1453 gcc_checking_assert (undefined_p () || r
.undefined_p ()
1454 || range_compatible_p (type (), r
.type ()));
1458 if (r
.undefined_p ())
1471 if (r
.num_pairs () == 1)
1473 bool res
= intersect (r
.lower_bound (), r
.upper_bound ());
1477 res
|= intersect_bitmask (r
);
1483 // If R fully contains this, then intersection will change nothing.
1484 if (r
.irange_contains_p (*this))
1485 return intersect_bitmask (r
);
1487 // ?? We could probably come up with something smarter than the
1488 // worst case scenario here.
1489 int needed
= num_pairs () + r
.num_pairs ();
1490 maybe_resize (needed
);
1492 signop sign
= TYPE_SIGN (m_type
);
1493 unsigned bld_pair
= 0;
1494 unsigned bld_lim
= m_max_ranges
;
1495 int_range_max
r2 (*this);
1496 unsigned r2_lim
= r2
.num_pairs ();
1498 for (unsigned i
= 0; i
< r
.num_pairs (); )
1500 // If r1's upper is < r2's lower, we can skip r1's pair.
1501 wide_int ru
= r
.m_base
[i
* 2 + 1];
1502 wide_int r2l
= r2
.m_base
[i2
* 2];
1503 if (wi::lt_p (ru
, r2l
, sign
))
1508 // Likewise, skip r2's pair if its excluded.
1509 wide_int r2u
= r2
.m_base
[i2
* 2 + 1];
1510 wide_int rl
= r
.m_base
[i
* 2];
1511 if (wi::lt_p (r2u
, rl
, sign
))
1516 // No more r2, break.
1520 // Must be some overlap. Find the highest of the lower bounds,
1521 // and set it, unless the build limits lower bounds is already
1523 if (bld_pair
< bld_lim
)
1525 if (wi::ge_p (rl
, r2l
, sign
))
1526 m_base
[bld_pair
* 2] = rl
;
1528 m_base
[bld_pair
* 2] = r2l
;
1531 // Decrease and set a new upper.
1534 // ...and choose the lower of the upper bounds.
1535 if (wi::le_p (ru
, r2u
, sign
))
1537 m_base
[bld_pair
* 2 + 1] = ru
;
1539 // Move past the r1 pair and keep trying.
1545 m_base
[bld_pair
* 2 + 1] = r2u
;
1550 // No more r2, break.
1553 // r2 has the higher lower bound.
1556 // At the exit of this loop, it is one of 2 things:
1557 // ran out of r1, or r2, but either means we are done.
1558 m_num_ranges
= bld_pair
;
1559 if (m_num_ranges
== 0)
1566 // The range has been altered, so normalize it even if nothing
1567 // changed in the mask.
1568 if (!intersect_bitmask (r
))
1576 // Multirange intersect for a specified wide_int [lb, ub] range.
1577 // Return TRUE if intersect changed anything.
1579 // NOTE: It is the caller's responsibility to intersect the mask.
1582 irange::intersect (const wide_int
& lb
, const wide_int
& ub
)
1584 // Undefined remains undefined.
1588 tree range_type
= type();
1589 signop sign
= TYPE_SIGN (range_type
);
1591 gcc_checking_assert (TYPE_PRECISION (range_type
) == wi::get_precision (lb
));
1592 gcc_checking_assert (TYPE_PRECISION (range_type
) == wi::get_precision (ub
));
1594 // If this range is fully contained, then intersection will do nothing.
1595 if (wi::ge_p (lower_bound (), lb
, sign
)
1596 && wi::le_p (upper_bound (), ub
, sign
))
1599 unsigned bld_index
= 0;
1600 unsigned pair_lim
= num_pairs ();
1601 for (unsigned i
= 0; i
< pair_lim
; i
++)
1603 wide_int pairl
= m_base
[i
* 2];
1604 wide_int pairu
= m_base
[i
* 2 + 1];
1605 // Once UB is less than a pairs lower bound, we're done.
1606 if (wi::lt_p (ub
, pairl
, sign
))
1608 // if LB is greater than this pairs upper, this pair is excluded.
1609 if (wi::lt_p (pairu
, lb
, sign
))
1612 // Must be some overlap. Find the highest of the lower bounds,
1614 if (wi::gt_p (lb
, pairl
, sign
))
1615 m_base
[bld_index
* 2] = lb
;
1617 m_base
[bld_index
* 2] = pairl
;
1619 // ...and choose the lower of the upper bounds and if the base pair
1620 // has the lower upper bound, need to check next pair too.
1621 if (wi::lt_p (ub
, pairu
, sign
))
1623 m_base
[bld_index
++ * 2 + 1] = ub
;
1627 m_base
[bld_index
++ * 2 + 1] = pairu
;
1630 m_num_ranges
= bld_index
;
1631 if (m_num_ranges
== 0)
1638 // The caller must normalize and verify the range, as the bitmask
1639 // still needs to be handled.
1644 // Signed 1-bits are strange. You can't subtract 1, because you can't
1645 // represent the number 1. This works around that for the invert routine.
1647 static wide_int
inline
1648 subtract_one (const wide_int
&x
, tree type
, wi::overflow_type
&overflow
)
1650 if (TYPE_SIGN (type
) == SIGNED
)
1651 return wi::add (x
, -1, SIGNED
, &overflow
);
1653 return wi::sub (x
, 1, UNSIGNED
, &overflow
);
1656 // The analogous function for adding 1.
1658 static wide_int
inline
1659 add_one (const wide_int
&x
, tree type
, wi::overflow_type
&overflow
)
1661 if (TYPE_SIGN (type
) == SIGNED
)
1662 return wi::sub (x
, -1, SIGNED
, &overflow
);
1664 return wi::add (x
, 1, UNSIGNED
, &overflow
);
1667 // Return the inverse of a range.
1672 gcc_checking_assert (!undefined_p () && !varying_p ());
1674 // We always need one more set of bounds to represent an inverse, so
1675 // if we're at the limit, we can't properly represent things.
1677 // For instance, to represent the inverse of a 2 sub-range set
1678 // [5, 10][20, 30], we would need a 3 sub-range set
1679 // [-MIN, 4][11, 19][31, MAX].
1681 // In this case, return the most conservative thing.
1683 // However, if any of the extremes of the range are -MIN/+MAX, we
1684 // know we will not need an extra bound. For example:
1686 // INVERT([-MIN,20][30,40]) => [21,29][41,+MAX]
1687 // INVERT([-MIN,20][30,MAX]) => [21,29]
1688 tree ttype
= type ();
1689 unsigned prec
= TYPE_PRECISION (ttype
);
1690 signop sign
= TYPE_SIGN (ttype
);
1691 wide_int type_min
= wi::min_value (prec
, sign
);
1692 wide_int type_max
= wi::max_value (prec
, sign
);
1693 m_bitmask
.set_unknown (prec
);
1695 // At this point, we need one extra sub-range to represent the
1697 maybe_resize (m_num_ranges
+ 1);
1699 // The algorithm is as follows. To calculate INVERT ([a,b][c,d]), we
1700 // generate [-MIN, a-1][b+1, c-1][d+1, MAX].
1702 // If there is an over/underflow in the calculation for any
1703 // sub-range, we eliminate that subrange. This allows us to easily
1704 // calculate INVERT([-MIN, 5]) with: [-MIN, -MIN-1][6, MAX]. And since
1705 // we eliminate the underflow, only [6, MAX] remains.
1707 wi::overflow_type ovf
;
1708 // Construct leftmost range.
1709 int_range_max
orig_range (*this);
1710 unsigned nitems
= 0;
1712 // If this is going to underflow on the MINUS 1, don't even bother
1713 // checking. This also handles subtracting one from an unsigned 0,
1714 // which doesn't set the underflow bit.
1715 if (type_min
!= orig_range
.lower_bound ())
1717 m_base
[nitems
++] = type_min
;
1718 tmp
= subtract_one (orig_range
.lower_bound (), ttype
, ovf
);
1719 m_base
[nitems
++] = tmp
;
1724 // Construct middle ranges if applicable.
1725 if (orig_range
.num_pairs () > 1)
1728 for (; j
< (orig_range
.num_pairs () * 2) - 1; j
+= 2)
1730 // The middle ranges cannot have MAX/MIN, so there's no need
1731 // to check for unsigned overflow on the +1 and -1 here.
1732 tmp
= wi::add (orig_range
.m_base
[j
], 1, sign
, &ovf
);
1733 m_base
[nitems
++] = tmp
;
1734 tmp
= subtract_one (orig_range
.m_base
[j
+ 1], ttype
, ovf
);
1735 m_base
[nitems
++] = tmp
;
1741 // Construct rightmost range.
1743 // However, if this will overflow on the PLUS 1, don't even bother.
1744 // This also handles adding one to an unsigned MAX, which doesn't
1745 // set the overflow bit.
1746 if (type_max
!= orig_range
.m_base
[i
])
1748 tmp
= add_one (orig_range
.m_base
[i
], ttype
, ovf
);
1749 m_base
[nitems
++] = tmp
;
1750 m_base
[nitems
++] = type_max
;
1754 m_num_ranges
= nitems
/ 2;
1756 // We disallow undefined or varying coming in, so the result can
1757 // only be a VR_RANGE.
1758 gcc_checking_assert (m_kind
== VR_RANGE
);
1764 // Return the bitmask inherent in the range.
1767 irange::get_bitmask_from_range () const
1769 unsigned prec
= TYPE_PRECISION (type ());
1770 wide_int min
= lower_bound ();
1771 wide_int max
= upper_bound ();
1773 // All the bits of a singleton are known.
1776 wide_int mask
= wi::zero (prec
);
1777 wide_int value
= lower_bound ();
1778 return irange_bitmask (value
, mask
);
1781 wide_int xorv
= min
^ max
;
1784 xorv
= wi::mask (prec
- wi::clz (xorv
), false, prec
);
1786 return irange_bitmask (wi::zero (prec
), min
| xorv
);
1789 // If the the mask can be trivially converted to a range, do so and
1793 irange::set_range_from_bitmask ()
1795 gcc_checking_assert (!undefined_p ());
1796 if (m_bitmask
.unknown_p ())
1799 // If all the bits are known, this is a singleton.
1800 if (m_bitmask
.mask () == 0)
1802 set (m_type
, m_bitmask
.value (), m_bitmask
.value ());
1806 unsigned popcount
= wi::popcount (m_bitmask
.get_nonzero_bits ());
1808 // If we have only one bit set in the mask, we can figure out the
1809 // range immediately.
1812 // Make sure we don't pessimize the range.
1813 if (!contains_p (m_bitmask
.get_nonzero_bits ()))
1816 bool has_zero
= contains_zero_p (*this);
1817 wide_int nz
= m_bitmask
.get_nonzero_bits ();
1818 set (m_type
, nz
, nz
);
1819 m_bitmask
.set_nonzero_bits (nz
);
1823 zero
.set_zero (type ());
1830 else if (popcount
== 0)
1839 irange::update_bitmask (const irange_bitmask
&bm
)
1841 gcc_checking_assert (!undefined_p ());
1843 // Drop VARYINGs with known bits to a plain range.
1844 if (m_kind
== VR_VARYING
&& !bm
.unknown_p ())
1848 if (!set_range_from_bitmask ())
1854 // Return the bitmask of known bits that includes the bitmask inherent
1858 irange::get_bitmask () const
1860 gcc_checking_assert (!undefined_p ());
1862 // The mask inherent in the range is calculated on-demand. For
1863 // example, [0,255] does not have known bits set by default. This
1864 // saves us considerable time, because setting it at creation incurs
1865 // a large penalty for irange::set. At the time of writing there
1866 // was a 5% slowdown in VRP if we kept the mask precisely up to date
1867 // at all times. Instead, we default to -1 and set it when
1868 // explicitly requested. However, this function will always return
1869 // the correct mask.
1871 // This also means that the mask may have a finer granularity than
1872 // the range and thus contradict it. Think of the mask as an
1873 // enhancement to the range. For example:
1875 // [3, 1000] MASK 0xfffffffe VALUE 0x0
1877 // 3 is in the range endpoints, but is excluded per the known 0 bits
1879 irange_bitmask bm
= get_bitmask_from_range ();
1880 if (!m_bitmask
.unknown_p ())
1881 bm
.intersect (m_bitmask
);
1885 // Set the nonzero bits in R into THIS. Return TRUE and
1886 // normalize the range if anything changed.
1889 irange::set_nonzero_bits (const wide_int
&bits
)
1891 gcc_checking_assert (!undefined_p ());
1892 irange_bitmask
bm (wi::zero (TYPE_PRECISION (type ())), bits
);
1893 update_bitmask (bm
);
1896 // Return the nonzero bits in R.
1899 irange::get_nonzero_bits () const
1901 gcc_checking_assert (!undefined_p ());
1902 irange_bitmask bm
= get_bitmask ();
1903 return bm
.value () | bm
.mask ();
1906 // Intersect the bitmask in R into THIS and normalize the range.
1907 // Return TRUE if the intersection changed anything.
1910 irange::intersect_bitmask (const irange
&r
)
1912 gcc_checking_assert (!undefined_p () && !r
.undefined_p ());
1914 if (m_bitmask
== r
.m_bitmask
)
1917 irange_bitmask bm
= get_bitmask ();
1918 if (!bm
.intersect (r
.get_bitmask ()))
1922 if (!set_range_from_bitmask ())
1929 // Union the bitmask in R into THIS. Return TRUE and normalize the
1930 // range if anything changed.
1933 irange::union_bitmask (const irange
&r
)
1935 gcc_checking_assert (!undefined_p () && !r
.undefined_p ());
1937 if (m_bitmask
== r
.m_bitmask
)
1940 irange_bitmask bm
= get_bitmask ();
1941 if (!bm
.union_ (r
.get_bitmask ()))
1945 // No need to call set_range_from_mask, because we'll never
1946 // narrow the range. Besides, it would cause endless recursion
1947 // because of the union_ in set_range_from_mask.
1953 irange_bitmask::verify_mask () const
1955 gcc_assert (m_value
.get_precision () == m_mask
.get_precision ());
1956 // Unknown bits must have their corresponding value bits cleared as
1957 // it simplifies union and intersect.
1958 gcc_assert (wi::bit_and (m_mask
, m_value
) == 0);
1962 dump_value_range (FILE *file
, const vrange
*vr
)
1968 debug (const vrange
*vr
)
1970 dump_value_range (stderr
, vr
);
1971 fprintf (stderr
, "\n");
1975 debug (const vrange
&vr
)
1981 debug (const value_range
*vr
)
1983 dump_value_range (stderr
, vr
);
1984 fprintf (stderr
, "\n");
1988 debug (const value_range
&vr
)
1990 dump_value_range (stderr
, &vr
);
1991 fprintf (stderr
, "\n");
1994 /* Return true, if VAL1 and VAL2 are equal values for VRP purposes. */
1997 vrp_operand_equal_p (const_tree val1
, const_tree val2
)
2001 if (!val1
|| !val2
|| !operand_equal_p (val1
, val2
, 0))
2007 gt_ggc_mx (irange
*x
)
2009 if (!x
->undefined_p ())
2010 gt_ggc_mx (x
->m_type
);
2014 gt_pch_nx (irange
*x
)
2016 if (!x
->undefined_p ())
2017 gt_pch_nx (x
->m_type
);
2021 gt_pch_nx (irange
*x
, gt_pointer_operator op
, void *cookie
)
2023 for (unsigned i
= 0; i
< x
->m_num_ranges
; ++i
)
2025 op (&x
->m_base
[i
* 2], NULL
, cookie
);
2026 op (&x
->m_base
[i
* 2 + 1], NULL
, cookie
);
2031 gt_ggc_mx (frange
*x
)
2033 gt_ggc_mx (x
->m_type
);
2037 gt_pch_nx (frange
*x
)
2039 gt_pch_nx (x
->m_type
);
2043 gt_pch_nx (frange
*x
, gt_pointer_operator op
, void *cookie
)
2045 op (&x
->m_type
, NULL
, cookie
);
2049 gt_ggc_mx (vrange
*x
)
2051 if (is_a
<irange
> (*x
))
2052 return gt_ggc_mx ((irange
*) x
);
2053 if (is_a
<frange
> (*x
))
2054 return gt_ggc_mx ((frange
*) x
);
2059 gt_pch_nx (vrange
*x
)
2061 if (is_a
<irange
> (*x
))
2062 return gt_pch_nx ((irange
*) x
);
2063 if (is_a
<frange
> (*x
))
2064 return gt_pch_nx ((frange
*) x
);
2069 gt_pch_nx (vrange
*x
, gt_pointer_operator op
, void *cookie
)
2071 if (is_a
<irange
> (*x
))
2072 gt_pch_nx ((irange
*) x
, op
, cookie
);
2073 else if (is_a
<frange
> (*x
))
2074 gt_pch_nx ((frange
*) x
, op
, cookie
);
2079 #define DEFINE_INT_RANGE_INSTANCE(N) \
2080 template int_range<N>::int_range(tree_node *, \
2083 value_range_kind); \
2084 template int_range<N>::int_range(tree); \
2085 template int_range<N>::int_range(const irange &); \
2086 template int_range<N>::int_range(const int_range &); \
2087 template int_range<N>& int_range<N>::operator= (const int_range &);
2089 DEFINE_INT_RANGE_INSTANCE(1)
2090 DEFINE_INT_RANGE_INSTANCE(2)
2091 DEFINE_INT_RANGE_INSTANCE(3)
2092 DEFINE_INT_RANGE_INSTANCE(255)
2095 #include "selftest.h"
2097 #define INT(x) wi::shwi ((x), TYPE_PRECISION (integer_type_node))
2098 #define UINT(x) wi::uhwi ((x), TYPE_PRECISION (unsigned_type_node))
2099 #define SCHAR(x) wi::shwi ((x), TYPE_PRECISION (signed_char_type_node))
2105 range (tree type
, int a
, int b
, value_range_kind kind
= VR_RANGE
)
2108 if (TYPE_UNSIGNED (type
))
2110 w1
= wi::uhwi (a
, TYPE_PRECISION (type
));
2111 w2
= wi::uhwi (b
, TYPE_PRECISION (type
));
2115 w1
= wi::shwi (a
, TYPE_PRECISION (type
));
2116 w2
= wi::shwi (b
, TYPE_PRECISION (type
));
2118 return int_range
<2> (type
, w1
, w2
, kind
);
2122 range_int (int a
, int b
, value_range_kind kind
= VR_RANGE
)
2124 return range (integer_type_node
, a
, b
, kind
);
2128 range_uint (int a
, int b
, value_range_kind kind
= VR_RANGE
)
2130 return range (unsigned_type_node
, a
, b
, kind
);
2134 range_uint128 (int a
, int b
, value_range_kind kind
= VR_RANGE
)
2136 tree u128_type_node
= build_nonstandard_integer_type (128, 1);
2137 return range (u128_type_node
, a
, b
, kind
);
2141 range_uchar (int a
, int b
, value_range_kind kind
= VR_RANGE
)
2143 return range (unsigned_char_type_node
, a
, b
, kind
);
2147 range_char (int a
, int b
, value_range_kind kind
= VR_RANGE
)
2149 return range (signed_char_type_node
, a
, b
, kind
);
2153 build_range3 (int a
, int b
, int c
, int d
, int e
, int f
)
2155 int_range
<3> i1
= range_int (a
, b
);
2156 int_range
<3> i2
= range_int (c
, d
);
2157 int_range
<3> i3
= range_int (e
, f
);
2164 range_tests_irange3 ()
2166 int_range
<3> r0
, r1
, r2
;
2167 int_range
<3> i1
, i2
, i3
;
2169 // ([10,20] U [5,8]) U [1,3] ==> [1,3][5,8][10,20].
2170 r0
= range_int (10, 20);
2171 r1
= range_int (5, 8);
2173 r1
= range_int (1, 3);
2175 ASSERT_TRUE (r0
== build_range3 (1, 3, 5, 8, 10, 20));
2177 // [1,3][5,8][10,20] U [-5,0] => [-5,3][5,8][10,20].
2178 r1
= range_int (-5, 0);
2180 ASSERT_TRUE (r0
== build_range3 (-5, 3, 5, 8, 10, 20));
2182 // [10,20][30,40] U [50,60] ==> [10,20][30,40][50,60].
2183 r1
= range_int (50, 60);
2184 r0
= range_int (10, 20);
2185 r0
.union_ (range_int (30, 40));
2187 ASSERT_TRUE (r0
== build_range3 (10, 20, 30, 40, 50, 60));
2188 // [10,20][30,40][50,60] U [70, 80] ==> [10,20][30,40][50,60][70,80].
2189 r1
= range_int (70, 80);
2192 r2
= build_range3 (10, 20, 30, 40, 50, 60);
2193 r2
.union_ (range_int (70, 80));
2194 ASSERT_TRUE (r0
== r2
);
2196 // [10,20][30,40][50,60] U [6,35] => [6,40][50,60].
2197 r0
= build_range3 (10, 20, 30, 40, 50, 60);
2198 r1
= range_int (6, 35);
2200 r1
= range_int (6, 40);
2201 r1
.union_ (range_int (50, 60));
2202 ASSERT_TRUE (r0
== r1
);
2204 // [10,20][30,40][50,60] U [6,60] => [6,60].
2205 r0
= build_range3 (10, 20, 30, 40, 50, 60);
2206 r1
= range_int (6, 60);
2208 ASSERT_TRUE (r0
== range_int (6, 60));
2210 // [10,20][30,40][50,60] U [6,70] => [6,70].
2211 r0
= build_range3 (10, 20, 30, 40, 50, 60);
2212 r1
= range_int (6, 70);
2214 ASSERT_TRUE (r0
== range_int (6, 70));
2216 // [10,20][30,40][50,60] U [35,70] => [10,20][30,70].
2217 r0
= build_range3 (10, 20, 30, 40, 50, 60);
2218 r1
= range_int (35, 70);
2220 r1
= range_int (10, 20);
2221 r1
.union_ (range_int (30, 70));
2222 ASSERT_TRUE (r0
== r1
);
2224 // [10,20][30,40][50,60] U [15,35] => [10,40][50,60].
2225 r0
= build_range3 (10, 20, 30, 40, 50, 60);
2226 r1
= range_int (15, 35);
2228 r1
= range_int (10, 40);
2229 r1
.union_ (range_int (50, 60));
2230 ASSERT_TRUE (r0
== r1
);
2232 // [10,20][30,40][50,60] U [35,35] => [10,20][30,40][50,60].
2233 r0
= build_range3 (10, 20, 30, 40, 50, 60);
2234 r1
= range_int (35, 35);
2236 ASSERT_TRUE (r0
== build_range3 (10, 20, 30, 40, 50, 60));
2240 range_tests_int_range_max ()
2243 unsigned int nrange
;
2245 // Build a huge multi-range range.
2246 for (nrange
= 0; nrange
< 50; ++nrange
)
2248 int_range
<1> tmp
= range_int (nrange
*10, nrange
*10 + 5);
2251 ASSERT_TRUE (big
.num_pairs () == nrange
);
2253 // Verify that we can copy it without loosing precision.
2254 int_range_max
copy (big
);
2255 ASSERT_TRUE (copy
.num_pairs () == nrange
);
2257 // Inverting it should produce one more sub-range.
2259 ASSERT_TRUE (big
.num_pairs () == nrange
+ 1);
2261 int_range
<1> tmp
= range_int (5, 37);
2262 big
.intersect (tmp
);
2263 ASSERT_TRUE (big
.num_pairs () == 4);
2265 // Test that [10,10][20,20] does NOT contain 15.
2267 int_range_max i1
= range_int (10, 10);
2268 int_range_max i2
= range_int (20, 20);
2270 ASSERT_FALSE (i1
.contains_p (INT (15)));
2274 // Simulate -fstrict-enums where the domain of a type is less than the
2278 range_tests_strict_enum ()
2280 // The enum can only hold [0, 3].
2281 tree rtype
= copy_node (unsigned_type_node
);
2282 TYPE_MIN_VALUE (rtype
) = build_int_cstu (rtype
, 0);
2283 TYPE_MAX_VALUE (rtype
) = build_int_cstu (rtype
, 3);
2285 // Test that even though vr1 covers the strict enum domain ([0, 3]),
2286 // it does not cover the domain of the underlying type.
2287 int_range
<1> vr1
= range (rtype
, 0, 1);
2288 int_range
<1> vr2
= range (rtype
, 2, 3);
2290 ASSERT_TRUE (vr1
== range (rtype
, 0, 3));
2291 ASSERT_FALSE (vr1
.varying_p ());
2293 // Test that copying to a multi-range does not change things.
2294 int_range
<2> ir1 (vr1
);
2295 ASSERT_TRUE (ir1
== vr1
);
2296 ASSERT_FALSE (ir1
.varying_p ());
2298 // The same test as above, but using TYPE_{MIN,MAX}_VALUE instead of [0,3].
2299 vr1
= int_range
<2> (rtype
,
2300 wi::to_wide (TYPE_MIN_VALUE (rtype
)),
2301 wi::to_wide (TYPE_MAX_VALUE (rtype
)));
2303 ASSERT_TRUE (ir1
== vr1
);
2304 ASSERT_FALSE (ir1
.varying_p ());
2310 tree u128_type
= build_nonstandard_integer_type (128, /*unsigned=*/1);
2311 int_range
<2> i1
, i2
, i3
;
2312 int_range
<2> r0
, r1
, rold
;
2314 // Test 1-bit signed integer union.
2315 // [-1,-1] U [0,0] = VARYING.
2316 tree one_bit_type
= build_nonstandard_integer_type (1, 0);
2317 wide_int one_bit_min
= irange_val_min (one_bit_type
);
2318 wide_int one_bit_max
= irange_val_max (one_bit_type
);
2320 int_range
<2> min
= int_range
<2> (one_bit_type
, one_bit_min
, one_bit_min
);
2321 int_range
<2> max
= int_range
<2> (one_bit_type
, one_bit_max
, one_bit_max
);
2323 ASSERT_TRUE (max
.varying_p ());
2325 // Test that we can set a range of true+false for a 1-bit signed int.
2326 r0
= range_true_and_false (one_bit_type
);
2328 // Test inversion of 1-bit signed integers.
2330 int_range
<2> min
= int_range
<2> (one_bit_type
, one_bit_min
, one_bit_min
);
2331 int_range
<2> max
= int_range
<2> (one_bit_type
, one_bit_max
, one_bit_max
);
2335 ASSERT_TRUE (t
== max
);
2338 ASSERT_TRUE (t
== min
);
2341 // Test that NOT(255) is [0..254] in 8-bit land.
2342 int_range
<1> not_255
= range_uchar (255, 255, VR_ANTI_RANGE
);
2343 ASSERT_TRUE (not_255
== range_uchar (0, 254));
2345 // Test that NOT(0) is [1..255] in 8-bit land.
2346 int_range
<2> not_zero
= range_nonzero (unsigned_char_type_node
);
2347 ASSERT_TRUE (not_zero
== range_uchar (1, 255));
2349 // Check that [0,127][0x..ffffff80,0x..ffffff]
2350 // => ~[128, 0x..ffffff7f].
2351 r0
= range_uint128 (0, 127);
2352 wide_int high
= wi::minus_one (128);
2353 // low = -1 - 127 => 0x..ffffff80.
2354 wide_int low
= wi::sub (high
, wi::uhwi (127, 128));
2355 r1
= int_range
<1> (u128_type
, low
, high
); // [0x..ffffff80, 0x..ffffffff]
2356 // r0 = [0,127][0x..ffffff80,0x..fffffff].
2358 // r1 = [128, 0x..ffffff7f].
2359 r1
= int_range
<1> (u128_type
,
2360 wi::uhwi (128, 128),
2361 wi::sub (wi::minus_one (128), wi::uhwi (128, 128)));
2363 ASSERT_TRUE (r0
== r1
);
2365 r0
.set_varying (integer_type_node
);
2366 wide_int minint
= r0
.lower_bound ();
2367 wide_int maxint
= r0
.upper_bound ();
2369 r0
.set_varying (short_integer_type_node
);
2371 r0
.set_varying (unsigned_type_node
);
2372 wide_int maxuint
= r0
.upper_bound ();
2374 // Check that ~[0,5] => [6,MAX] for unsigned int.
2375 r0
= range_uint (0, 5);
2377 ASSERT_TRUE (r0
== int_range
<1> (unsigned_type_node
,
2378 wi::uhwi (6, TYPE_PRECISION (unsigned_type_node
)),
2381 // Check that ~[10,MAX] => [0,9] for unsigned int.
2382 r0
= int_range
<1> (unsigned_type_node
,
2383 wi::uhwi (10, TYPE_PRECISION (unsigned_type_node
)),
2386 ASSERT_TRUE (r0
== range_uint (0, 9));
2388 // Check that ~[0,5] => [6,MAX] for unsigned 128-bit numbers.
2389 r0
= range_uint128 (0, 5, VR_ANTI_RANGE
);
2390 r1
= int_range
<1> (u128_type
, wi::uhwi (6, 128), wi::minus_one (128));
2391 ASSERT_TRUE (r0
== r1
);
2393 // Check that [~5] is really [-MIN,4][6,MAX].
2394 r0
= range_int (5, 5, VR_ANTI_RANGE
);
2395 r1
= int_range
<1> (integer_type_node
, minint
, INT (4));
2396 r1
.union_ (int_range
<1> (integer_type_node
, INT (6), maxint
));
2397 ASSERT_FALSE (r1
.undefined_p ());
2398 ASSERT_TRUE (r0
== r1
);
2400 r1
= range_int (5, 5);
2401 int_range
<2> r2 (r1
);
2402 ASSERT_TRUE (r1
== r2
);
2404 r1
= range_int (5, 10);
2406 r1
= range_int (5, 10);
2407 ASSERT_TRUE (r1
.contains_p (INT (7)));
2409 r1
= range_char (0, 20);
2410 ASSERT_TRUE (r1
.contains_p (SCHAR(15)));
2411 ASSERT_FALSE (r1
.contains_p (SCHAR(300)));
2413 // NOT([10,20]) ==> [-MIN,9][21,MAX].
2414 r0
= r1
= range_int (10, 20);
2415 r2
= int_range
<1> (integer_type_node
, minint
, INT(9));
2416 r2
.union_ (int_range
<1> (integer_type_node
, INT(21), maxint
));
2417 ASSERT_FALSE (r2
.undefined_p ());
2419 ASSERT_TRUE (r1
== r2
);
2420 // Test that NOT(NOT(x)) == x.
2422 ASSERT_TRUE (r0
== r2
);
2424 // Test that booleans and their inverse work as expected.
2425 r0
= range_zero (boolean_type_node
);
2426 ASSERT_TRUE (r0
== range_false ());
2428 ASSERT_TRUE (r0
== range_true ());
2430 // Make sure NULL and non-NULL of pointer types work, and that
2431 // inverses of them are consistent.
2432 tree voidp
= build_pointer_type (void_type_node
);
2433 r0
= range_zero (voidp
);
2437 ASSERT_TRUE (r0
== r1
);
2439 // [10,20] U [15, 30] => [10, 30].
2440 r0
= range_int (10, 20);
2441 r1
= range_int (15, 30);
2443 ASSERT_TRUE (r0
== range_int (10, 30));
2445 // [15,40] U [] => [15,40].
2446 r0
= range_int (15, 40);
2447 r1
.set_undefined ();
2449 ASSERT_TRUE (r0
== range_int (15, 40));
2451 // [10,20] U [10,10] => [10,20].
2452 r0
= range_int (10, 20);
2453 r1
= range_int (10, 10);
2455 ASSERT_TRUE (r0
== range_int (10, 20));
2457 // [10,20] U [9,9] => [9,20].
2458 r0
= range_int (10, 20);
2459 r1
= range_int (9, 9);
2461 ASSERT_TRUE (r0
== range_int (9, 20));
2463 // [10,20] ^ [15,30] => [15,20].
2464 r0
= range_int (10, 20);
2465 r1
= range_int (15, 30);
2467 ASSERT_TRUE (r0
== range_int (15, 20));
2469 // Test the internal sanity of wide_int's wrt HWIs.
2470 ASSERT_TRUE (wi::max_value (TYPE_PRECISION (boolean_type_node
),
2471 TYPE_SIGN (boolean_type_node
))
2472 == wi::uhwi (1, TYPE_PRECISION (boolean_type_node
)));
2475 r0
= range_int (0, 0);
2476 ASSERT_TRUE (r0
.zero_p ());
2478 // Test nonzero_p().
2479 r0
= range_int (0, 0);
2481 ASSERT_TRUE (r0
.nonzero_p ());
2484 r0
= range_int (1, 1, VR_ANTI_RANGE
);
2486 r1
= range_int (3, 3, VR_ANTI_RANGE
);
2488 // vv = [0,0][2,2][4, MAX]
2489 int_range
<3> vv
= r0
;
2492 ASSERT_TRUE (vv
.contains_p (UINT (2)));
2493 ASSERT_TRUE (vv
.num_pairs () == 3);
2495 r0
= range_int (1, 1);
2496 // And union it with [0,0][2,2][4,MAX] multi range
2498 // The result should be [0,2][4,MAX], or ~[3,3] but it must contain 2
2499 ASSERT_TRUE (r0
.contains_p (INT (2)));
2503 range_tests_nonzero_bits ()
2505 int_range
<2> r0
, r1
;
2507 // Adding nonzero bits to a varying drops the varying.
2508 r0
.set_varying (integer_type_node
);
2509 r0
.set_nonzero_bits (INT (255));
2510 ASSERT_TRUE (!r0
.varying_p ());
2511 // Dropping the nonzero bits brings us back to varying.
2512 r0
.set_nonzero_bits (INT (-1));
2513 ASSERT_TRUE (r0
.varying_p ());
2515 // Test contains_p with nonzero bits.
2516 r0
.set_zero (integer_type_node
);
2517 ASSERT_TRUE (r0
.contains_p (INT (0)));
2518 ASSERT_FALSE (r0
.contains_p (INT (1)));
2519 r0
.set_nonzero_bits (INT (0xfe));
2520 ASSERT_FALSE (r0
.contains_p (INT (0x100)));
2521 ASSERT_FALSE (r0
.contains_p (INT (0x3)));
2523 // Union of nonzero bits.
2524 r0
.set_varying (integer_type_node
);
2525 r0
.set_nonzero_bits (INT (0xf0));
2526 r1
.set_varying (integer_type_node
);
2527 r1
.set_nonzero_bits (INT (0xf));
2529 ASSERT_TRUE (r0
.get_nonzero_bits () == 0xff);
2531 // Intersect of nonzero bits.
2532 r0
= range_int (0, 255);
2533 r0
.set_nonzero_bits (INT (0xfe));
2534 r1
.set_varying (integer_type_node
);
2535 r1
.set_nonzero_bits (INT (0xf0));
2537 ASSERT_TRUE (r0
.get_nonzero_bits () == 0xf0);
2539 // Intersect where the mask of nonzero bits is implicit from the range.
2540 r0
.set_varying (integer_type_node
);
2541 r1
= range_int (0, 255);
2543 ASSERT_TRUE (r0
.get_nonzero_bits () == 0xff);
2545 // The union of a mask of 0xff..ffff00 with a mask of 0xff spans the
2546 // entire domain, and makes the range a varying.
2547 r0
.set_varying (integer_type_node
);
2548 wide_int x
= wi::shwi (0xff, TYPE_PRECISION (integer_type_node
));
2549 x
= wi::bit_not (x
);
2550 r0
.set_nonzero_bits (x
); // 0xff..ff00
2551 r1
.set_varying (integer_type_node
);
2552 r1
.set_nonzero_bits (INT (0xff));
2554 ASSERT_TRUE (r0
.varying_p ());
2556 // Test that setting a nonzero bit of 1 does not pessimize the range.
2557 r0
.set_zero (integer_type_node
);
2558 r0
.set_nonzero_bits (INT (1));
2559 ASSERT_TRUE (r0
.zero_p ());
2562 // Build an frange from string endpoints.
2564 static inline frange
2565 frange_float (const char *lb
, const char *ub
, tree type
= float_type_node
)
2567 REAL_VALUE_TYPE min
, max
;
2568 gcc_assert (real_from_string (&min
, lb
) == 0);
2569 gcc_assert (real_from_string (&max
, ub
) == 0);
2570 return frange (type
, min
, max
);
2577 REAL_VALUE_TYPE q
, r
;
2580 // Equal ranges but with differing NAN bits are not equal.
2581 if (HONOR_NANS (float_type_node
))
2583 r1
= frange_float ("10", "12");
2591 // [10, 20] NAN ^ [30, 40] NAN = NAN.
2592 r0
= frange_float ("10", "20");
2593 r1
= frange_float ("30", "40");
2595 ASSERT_TRUE (r0
.known_isnan ());
2597 // [3,5] U [5,10] NAN = ... NAN
2598 r0
= frange_float ("3", "5");
2600 r1
= frange_float ("5", "10");
2602 ASSERT_TRUE (r0
.maybe_isnan ());
2605 // [5,6] U NAN = [5,6] NAN.
2606 r0
= frange_float ("5", "6");
2608 r1
.set_nan (float_type_node
);
2610 real_from_string (&q
, "5");
2611 real_from_string (&r
, "6");
2612 ASSERT_TRUE (real_identical (&q
, &r0
.lower_bound ()));
2613 ASSERT_TRUE (real_identical (&r
, &r0
.upper_bound ()));
2614 ASSERT_TRUE (r0
.maybe_isnan ());
2617 r0
.set_nan (float_type_node
);
2618 r1
.set_nan (float_type_node
);
2620 ASSERT_TRUE (r0
.known_isnan ());
2622 // [INF, INF] NAN ^ NAN = NAN
2623 r0
.set_nan (float_type_node
);
2624 r1
= frange_float ("+Inf", "+Inf");
2625 if (!HONOR_NANS (float_type_node
))
2628 ASSERT_TRUE (r0
.known_isnan ());
2631 r0
.set_nan (float_type_node
);
2632 r1
.set_nan (float_type_node
);
2634 ASSERT_TRUE (r0
.known_isnan ());
2636 // +NAN ^ -NAN = UNDEFINED
2637 r0
.set_nan (float_type_node
, false);
2638 r1
.set_nan (float_type_node
, true);
2640 ASSERT_TRUE (r0
.undefined_p ());
2642 // VARYING ^ NAN = NAN.
2643 r0
.set_nan (float_type_node
);
2644 r1
.set_varying (float_type_node
);
2646 ASSERT_TRUE (r0
.known_isnan ());
2648 // [3,4] ^ NAN = UNDEFINED.
2649 r0
= frange_float ("3", "4");
2651 r1
.set_nan (float_type_node
);
2653 ASSERT_TRUE (r0
.undefined_p ());
2655 // [-3, 5] ^ NAN = UNDEFINED
2656 r0
= frange_float ("-3", "5");
2658 r1
.set_nan (float_type_node
);
2660 ASSERT_TRUE (r0
.undefined_p ());
2662 // Setting the NAN bit to yes does not make us a known NAN.
2663 r0
.set_varying (float_type_node
);
2665 ASSERT_FALSE (r0
.known_isnan ());
2667 // NAN is in a VARYING.
2668 r0
.set_varying (float_type_node
);
2669 real_nan (&r
, "", 1, TYPE_MODE (float_type_node
));
2670 REAL_VALUE_TYPE nan
= r
;
2671 ASSERT_TRUE (r0
.contains_p (nan
));
2673 // -NAN is in a VARYING.
2674 r0
.set_varying (float_type_node
);
2675 q
= real_value_negate (&r
);
2676 REAL_VALUE_TYPE neg_nan
= q
;
2677 ASSERT_TRUE (r0
.contains_p (neg_nan
));
2679 // Clearing the NAN on a [] NAN is the empty set.
2680 r0
.set_nan (float_type_node
);
2682 ASSERT_TRUE (r0
.undefined_p ());
2684 // [10,20] NAN ^ [21,25] NAN = [NAN]
2685 r0
= frange_float ("10", "20");
2687 r1
= frange_float ("21", "25");
2690 ASSERT_TRUE (r0
.known_isnan ());
2692 // NAN U [5,6] should be [5,6] +-NAN.
2693 r0
.set_nan (float_type_node
);
2694 r1
= frange_float ("5", "6");
2697 real_from_string (&q
, "5");
2698 real_from_string (&r
, "6");
2699 ASSERT_TRUE (real_identical (&q
, &r0
.lower_bound ()));
2700 ASSERT_TRUE (real_identical (&r
, &r0
.upper_bound ()));
2701 ASSERT_TRUE (!r0
.signbit_p (signbit
));
2702 ASSERT_TRUE (r0
.maybe_isnan ());
2706 range_tests_signed_zeros ()
2708 REAL_VALUE_TYPE zero
= dconst0
;
2709 REAL_VALUE_TYPE neg_zero
= zero
;
2714 // [0,0] contains [0,0] but not [-0,-0] and vice versa.
2715 r0
= frange_float ("0.0", "0.0");
2716 r1
= frange_float ("-0.0", "-0.0");
2717 ASSERT_TRUE (r0
.contains_p (zero
));
2718 ASSERT_TRUE (!r0
.contains_p (neg_zero
));
2719 ASSERT_TRUE (r1
.contains_p (neg_zero
));
2720 ASSERT_TRUE (!r1
.contains_p (zero
));
2722 // Test contains_p() when we know the sign of the zero.
2723 r0
= frange_float ("0.0", "0.0");
2724 ASSERT_TRUE (r0
.contains_p (zero
));
2725 ASSERT_FALSE (r0
.contains_p (neg_zero
));
2726 r0
= frange_float ("-0.0", "-0.0");
2727 ASSERT_TRUE (r0
.contains_p (neg_zero
));
2728 ASSERT_FALSE (r0
.contains_p (zero
));
2730 r0
= frange_float ("-0.0", "0.0");
2731 ASSERT_TRUE (r0
.contains_p (neg_zero
));
2732 ASSERT_TRUE (r0
.contains_p (zero
));
2734 r0
= frange_float ("-3", "5");
2735 ASSERT_TRUE (r0
.contains_p (neg_zero
));
2736 ASSERT_TRUE (r0
.contains_p (zero
));
2738 // The intersection of zeros that differ in sign is a NAN (or
2739 // undefined if not honoring NANs).
2740 r0
= frange_float ("-0.0", "-0.0");
2741 r1
= frange_float ("0.0", "0.0");
2743 if (HONOR_NANS (float_type_node
))
2744 ASSERT_TRUE (r0
.known_isnan ());
2746 ASSERT_TRUE (r0
.undefined_p ());
2748 // The union of zeros that differ in sign is a zero with unknown sign.
2749 r0
= frange_float ("0.0", "0.0");
2750 r1
= frange_float ("-0.0", "-0.0");
2752 ASSERT_TRUE (r0
.zero_p () && !r0
.signbit_p (signbit
));
2754 // [-0, +0] has an unknown sign.
2755 r0
= frange_float ("-0.0", "0.0");
2756 ASSERT_TRUE (r0
.zero_p () && !r0
.signbit_p (signbit
));
2758 // [-0, +0] ^ [0, 0] is [0, 0]
2759 r0
= frange_float ("-0.0", "0.0");
2760 r1
= frange_float ("0.0", "0.0");
2762 ASSERT_TRUE (r0
.zero_p ());
2764 r0
= frange_float ("+0", "5");
2766 ASSERT_TRUE (r0
.signbit_p (signbit
) && !signbit
);
2768 r0
= frange_float ("-0", "5");
2770 ASSERT_TRUE (!r0
.signbit_p (signbit
));
2772 r0
= frange_float ("-0", "10");
2773 r1
= frange_float ("0", "5");
2775 ASSERT_TRUE (real_iszero (&r0
.lower_bound (), false));
2777 r0
= frange_float ("-0", "5");
2778 r1
= frange_float ("0", "5");
2780 ASSERT_TRUE (real_iszero (&r0
.lower_bound (), true));
2782 r0
= frange_float ("-5", "-0");
2784 r1
= frange_float ("0", "0");
2787 if (HONOR_NANS (float_type_node
))
2788 ASSERT_TRUE (r0
.known_isnan ());
2790 ASSERT_TRUE (r0
.undefined_p ());
2792 r0
.set_nonnegative (float_type_node
);
2793 if (HONOR_NANS (float_type_node
))
2794 ASSERT_TRUE (r0
.maybe_isnan ());
2796 // Numbers containing zero should have an unknown SIGNBIT.
2797 r0
= frange_float ("0", "10");
2799 ASSERT_TRUE (r0
.signbit_p (signbit
) && !signbit
);
2803 range_tests_signbit ()
2808 // Negative numbers should have the SIGNBIT set.
2809 r0
= frange_float ("-5", "-1");
2811 ASSERT_TRUE (r0
.signbit_p (signbit
) && signbit
);
2812 // Positive numbers should have the SIGNBIT clear.
2813 r0
= frange_float ("1", "10");
2815 ASSERT_TRUE (r0
.signbit_p (signbit
) && !signbit
);
2816 // Numbers spanning both positive and negative should have an
2818 r0
= frange_float ("-10", "10");
2820 ASSERT_TRUE (!r0
.signbit_p (signbit
));
2821 r0
.set_varying (float_type_node
);
2822 ASSERT_TRUE (!r0
.signbit_p (signbit
));
2826 range_tests_floats ()
2830 if (HONOR_NANS (float_type_node
))
2832 range_tests_signbit ();
2834 if (HONOR_SIGNED_ZEROS (float_type_node
))
2835 range_tests_signed_zeros ();
2837 // A range of [-INF,+INF] is actually VARYING if no other properties
2839 r0
= frange_float ("-Inf", "+Inf");
2840 ASSERT_TRUE (r0
.varying_p ());
2841 // ...unless it has some special property...
2842 if (HONOR_NANS (r0
.type ()))
2845 ASSERT_FALSE (r0
.varying_p ());
2848 // For most architectures, where float and double are different
2849 // sizes, having the same endpoints does not necessarily mean the
2850 // ranges are equal.
2851 if (!types_compatible_p (float_type_node
, double_type_node
))
2853 r0
= frange_float ("3.0", "3.0", float_type_node
);
2854 r1
= frange_float ("3.0", "3.0", double_type_node
);
2858 // [3,5] U [10,12] = [3,12].
2859 r0
= frange_float ("3", "5");
2860 r1
= frange_float ("10", "12");
2862 ASSERT_EQ (r0
, frange_float ("3", "12"));
2864 // [5,10] U [4,8] = [4,10]
2865 r0
= frange_float ("5", "10");
2866 r1
= frange_float ("4", "8");
2868 ASSERT_EQ (r0
, frange_float ("4", "10"));
2870 // [3,5] U [4,10] = [3,10]
2871 r0
= frange_float ("3", "5");
2872 r1
= frange_float ("4", "10");
2874 ASSERT_EQ (r0
, frange_float ("3", "10"));
2876 // [4,10] U [5,11] = [4,11]
2877 r0
= frange_float ("4", "10");
2878 r1
= frange_float ("5", "11");
2880 ASSERT_EQ (r0
, frange_float ("4", "11"));
2882 // [3,12] ^ [10,12] = [10,12].
2883 r0
= frange_float ("3", "12");
2884 r1
= frange_float ("10", "12");
2886 ASSERT_EQ (r0
, frange_float ("10", "12"));
2888 // [10,12] ^ [11,11] = [11,11]
2889 r0
= frange_float ("10", "12");
2890 r1
= frange_float ("11", "11");
2892 ASSERT_EQ (r0
, frange_float ("11", "11"));
2894 // [10,20] ^ [5,15] = [10,15]
2895 r0
= frange_float ("10", "20");
2896 r1
= frange_float ("5", "15");
2898 ASSERT_EQ (r0
, frange_float ("10", "15"));
2900 // [10,20] ^ [15,25] = [15,20]
2901 r0
= frange_float ("10", "20");
2902 r1
= frange_float ("15", "25");
2904 ASSERT_EQ (r0
, frange_float ("15", "20"));
2906 // [10,20] ^ [21,25] = []
2907 r0
= frange_float ("10", "20");
2909 r1
= frange_float ("21", "25");
2912 ASSERT_TRUE (r0
.undefined_p ());
2914 if (HONOR_INFINITIES (float_type_node
))
2916 // Make sure [-Inf, -Inf] doesn't get normalized.
2917 r0
= frange_float ("-Inf", "-Inf");
2918 ASSERT_TRUE (real_isinf (&r0
.lower_bound (), true));
2919 ASSERT_TRUE (real_isinf (&r0
.upper_bound (), true));
2922 // Test that reading back a global range yields the same result as
2923 // what we wrote into it.
2924 tree ssa
= make_temp_ssa_name (float_type_node
, NULL
, "blah");
2925 r0
.set_varying (float_type_node
);
2927 set_range_info (ssa
, r0
);
2928 get_global_range_query ()->range_of_expr (r1
, ssa
);
2932 // Run floating range tests for various combinations of NAN and INF
2936 range_tests_floats_various ()
2938 int save_finite_math_only
= flag_finite_math_only
;
2940 // Test -ffinite-math-only.
2941 flag_finite_math_only
= 1;
2942 range_tests_floats ();
2943 // Test -fno-finite-math-only.
2944 flag_finite_math_only
= 0;
2945 range_tests_floats ();
2947 flag_finite_math_only
= save_finite_math_only
;
2953 range_tests_irange3 ();
2954 range_tests_int_range_max ();
2955 range_tests_strict_enum ();
2956 range_tests_nonzero_bits ();
2957 range_tests_floats_various ();
2958 range_tests_misc ();
2961 } // namespace selftest
2963 #endif // CHECKING_P