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::nonnegative_p () const
319 return wi::ge_p (lower_bound (), 0, TYPE_SIGN (type ()));
323 irange::nonpositive_p () const
325 return wi::le_p (upper_bound (), 0, TYPE_SIGN (type ()));
329 irange::supports_type_p (const_tree type
) const
331 return supports_p (type
);
334 // Return TRUE if R fits in THIS.
337 irange::fits_p (const vrange
&r
) const
339 return m_max_ranges
>= as_a
<irange
> (r
).num_pairs ();
343 irange::set_nonnegative (tree type
)
346 wi::zero (TYPE_PRECISION (type
)),
347 wi::to_wide (TYPE_MAX_VALUE (type
)));
351 frange::accept (const vrange_visitor
&v
) const
356 // Flush denormal endpoints to the appropriate 0.0.
359 frange::flush_denormals_to_zero ()
361 if (undefined_p () || known_isnan ())
364 machine_mode mode
= TYPE_MODE (type ());
365 // Flush [x, -DENORMAL] to [x, -0.0].
366 if (real_isdenormal (&m_max
, mode
) && real_isneg (&m_max
))
368 if (HONOR_SIGNED_ZEROS (m_type
))
373 // Flush [+DENORMAL, x] to [+0.0, x].
374 if (real_isdenormal (&m_min
, mode
) && !real_isneg (&m_min
))
378 // Setter for franges.
381 frange::set (tree type
,
382 const REAL_VALUE_TYPE
&min
, const REAL_VALUE_TYPE
&max
,
383 const nan_state
&nan
, value_range_kind kind
)
400 gcc_checking_assert (!real_isnan (&min
) && !real_isnan (&max
));
406 if (HONOR_NANS (m_type
))
408 m_pos_nan
= nan
.pos_p ();
409 m_neg_nan
= nan
.neg_p ();
417 if (!MODE_HAS_SIGNED_ZEROS (TYPE_MODE (m_type
)))
419 if (real_iszero (&m_min
, 1))
421 if (real_iszero (&m_max
, 1))
424 else if (!HONOR_SIGNED_ZEROS (m_type
))
426 if (real_iszero (&m_max
, 1))
428 if (real_iszero (&m_min
, 0))
432 // For -ffinite-math-only we can drop ranges outside the
433 // representable numbers to min/max for the type.
434 if (!HONOR_INFINITIES (m_type
))
436 REAL_VALUE_TYPE min_repr
= frange_val_min (m_type
);
437 REAL_VALUE_TYPE max_repr
= frange_val_max (m_type
);
438 if (real_less (&m_min
, &min_repr
))
440 else if (real_less (&max_repr
, &m_min
))
442 if (real_less (&max_repr
, &m_max
))
444 else if (real_less (&m_max
, &min_repr
))
448 // Check for swapped ranges.
449 gcc_checking_assert (real_compare (LE_EXPR
, &min
, &max
));
454 // Setter for an frange defaulting the NAN possibility to +-NAN when
458 frange::set (tree type
,
459 const REAL_VALUE_TYPE
&min
, const REAL_VALUE_TYPE
&max
,
460 value_range_kind kind
)
462 set (type
, min
, max
, nan_state (true), kind
);
466 frange::set (tree min
, tree max
, value_range_kind kind
)
468 set (TREE_TYPE (min
),
469 *TREE_REAL_CST_PTR (min
), *TREE_REAL_CST_PTR (max
), kind
);
472 // Normalize range to VARYING or UNDEFINED, or vice versa. Return
473 // TRUE if anything changed.
475 // A range with no known properties can be dropped to VARYING.
476 // Similarly, a VARYING with any properties should be dropped to a
477 // VR_RANGE. Normalizing ranges upon changing them ensures there is
478 // only one representation for a given range.
481 frange::normalize_kind ()
483 if (m_kind
== VR_RANGE
484 && frange_val_is_min (m_min
, m_type
)
485 && frange_val_is_max (m_max
, m_type
))
487 if (!HONOR_NANS (m_type
) || (m_pos_nan
&& m_neg_nan
))
489 set_varying (m_type
);
493 else if (m_kind
== VR_VARYING
)
495 if (HONOR_NANS (m_type
) && (!m_pos_nan
|| !m_neg_nan
))
498 m_min
= frange_val_min (m_type
);
499 m_max
= frange_val_max (m_type
);
505 else if (m_kind
== VR_NAN
&& !m_pos_nan
&& !m_neg_nan
)
510 // Union or intersect the zero endpoints of two ranges. For example:
511 // [-0, x] U [+0, x] => [-0, x]
512 // [ x, -0] U [ x, +0] => [ x, +0]
513 // [-0, x] ^ [+0, x] => [+0, x]
514 // [ x, -0] ^ [ x, +0] => [ x, -0]
516 // UNION_P is true when performing a union, or false when intersecting.
519 frange::combine_zeros (const frange
&r
, bool union_p
)
521 gcc_checking_assert (!undefined_p () && !known_isnan ());
523 bool changed
= false;
524 if (real_iszero (&m_min
) && real_iszero (&r
.m_min
)
525 && real_isneg (&m_min
) != real_isneg (&r
.m_min
))
527 m_min
.sign
= union_p
;
530 if (real_iszero (&m_max
) && real_iszero (&r
.m_max
)
531 && real_isneg (&m_max
) != real_isneg (&r
.m_max
))
533 m_max
.sign
= !union_p
;
536 // If the signs are swapped, the resulting range is empty.
537 if (m_min
.sign
== 0 && m_max
.sign
== 1)
548 // Union two ranges when one is known to be a NAN.
551 frange::union_nans (const frange
&r
)
553 gcc_checking_assert (known_isnan () || r
.known_isnan ());
555 bool changed
= false;
556 if (known_isnan () && m_kind
!= r
.m_kind
)
563 if (m_pos_nan
!= r
.m_pos_nan
|| m_neg_nan
!= r
.m_neg_nan
)
565 m_pos_nan
|= r
.m_pos_nan
;
566 m_neg_nan
|= r
.m_neg_nan
;
578 frange::union_ (const vrange
&v
)
580 const frange
&r
= as_a
<frange
> (v
);
582 if (r
.undefined_p () || varying_p ())
584 if (undefined_p () || r
.varying_p ())
591 if (known_isnan () || r
.known_isnan ())
592 return union_nans (r
);
593 bool changed
= false;
594 if (m_pos_nan
!= r
.m_pos_nan
|| m_neg_nan
!= r
.m_neg_nan
)
596 m_pos_nan
|= r
.m_pos_nan
;
597 m_neg_nan
|= r
.m_neg_nan
;
601 // Combine endpoints.
602 if (real_less (&r
.m_min
, &m_min
))
607 if (real_less (&m_max
, &r
.m_max
))
613 if (HONOR_SIGNED_ZEROS (m_type
))
614 changed
|= combine_zeros (r
, true);
616 changed
|= normalize_kind ();
620 // Intersect two ranges when one is known to be a NAN.
623 frange::intersect_nans (const frange
&r
)
625 gcc_checking_assert (known_isnan () || r
.known_isnan ());
627 m_pos_nan
&= r
.m_pos_nan
;
628 m_neg_nan
&= r
.m_neg_nan
;
639 frange::intersect (const vrange
&v
)
641 const frange
&r
= as_a
<frange
> (v
);
643 if (undefined_p () || r
.varying_p ())
645 if (r
.undefined_p ())
657 if (known_isnan () || r
.known_isnan ())
658 return intersect_nans (r
);
659 bool changed
= false;
660 if (m_pos_nan
!= r
.m_pos_nan
|| m_neg_nan
!= r
.m_neg_nan
)
662 m_pos_nan
&= r
.m_pos_nan
;
663 m_neg_nan
&= r
.m_neg_nan
;
667 // Combine endpoints.
668 if (real_less (&m_min
, &r
.m_min
))
673 if (real_less (&r
.m_max
, &m_max
))
678 // If the endpoints are swapped, the resulting range is empty.
679 if (real_less (&m_max
, &m_min
))
690 if (HONOR_SIGNED_ZEROS (m_type
))
691 changed
|= combine_zeros (r
, false);
693 changed
|= normalize_kind ();
698 frange::operator= (const frange
&src
)
704 m_pos_nan
= src
.m_pos_nan
;
705 m_neg_nan
= src
.m_neg_nan
;
713 frange::operator== (const frange
&src
) const
715 if (m_kind
== src
.m_kind
)
721 return types_compatible_p (m_type
, src
.m_type
);
723 bool nan1
= known_isnan ();
724 bool nan2
= src
.known_isnan ();
728 return (m_pos_nan
== src
.m_pos_nan
729 && m_neg_nan
== src
.m_neg_nan
);
733 return (real_identical (&m_min
, &src
.m_min
)
734 && real_identical (&m_max
, &src
.m_max
)
735 && m_pos_nan
== src
.m_pos_nan
736 && m_neg_nan
== src
.m_neg_nan
737 && types_compatible_p (m_type
, src
.m_type
));
742 // Return TRUE if range contains R.
745 frange::contains_p (const REAL_VALUE_TYPE
&r
) const
747 gcc_checking_assert (m_kind
!= VR_ANTI_RANGE
);
758 if (!m_pos_nan
&& !m_neg_nan
)
760 // Both +NAN and -NAN are present.
761 if (m_pos_nan
&& m_neg_nan
)
763 return m_neg_nan
== r
.sign
;
768 if (real_compare (GE_EXPR
, &r
, &m_min
) && real_compare (LE_EXPR
, &r
, &m_max
))
770 // Make sure the signs are equal for signed zeros.
771 if (HONOR_SIGNED_ZEROS (m_type
) && real_iszero (&r
))
772 return r
.sign
== m_min
.sign
|| r
.sign
== m_max
.sign
;
778 // If range is a singleton, place it in RESULT and return TRUE. If
779 // RESULT is NULL, just return TRUE.
781 // A NAN can never be a singleton.
784 frange::internal_singleton_p (REAL_VALUE_TYPE
*result
) const
786 if (m_kind
== VR_RANGE
&& real_identical (&m_min
, &m_max
))
788 // Return false for any singleton that may be a NAN.
789 if (HONOR_NANS (m_type
) && maybe_isnan ())
792 if (MODE_COMPOSITE_P (TYPE_MODE (m_type
)))
794 // For IBM long doubles, if the value is +-Inf or is exactly
795 // representable in double, the other double could be +0.0
796 // or -0.0. Since this means there is more than one way to
797 // represent a value, return false to avoid propagating it.
798 // See libgcc/config/rs6000/ibm-ldouble-format for details.
799 if (real_isinf (&m_min
))
802 real_convert (&r
, DFmode
, &m_min
);
803 if (real_identical (&r
, &m_min
))
815 frange::singleton_p (tree
*result
) const
817 if (internal_singleton_p ())
820 *result
= build_real (m_type
, m_min
);
827 frange::singleton_p (REAL_VALUE_TYPE
&r
) const
829 return internal_singleton_p (&r
);
833 frange::supports_type_p (const_tree type
) const
835 return supports_p (type
);
839 frange::verify_range ()
842 gcc_checking_assert (HONOR_NANS (m_type
) || !maybe_isnan ());
846 gcc_checking_assert (!m_type
);
849 gcc_checking_assert (m_type
);
850 gcc_checking_assert (frange_val_is_min (m_min
, m_type
));
851 gcc_checking_assert (frange_val_is_max (m_max
, m_type
));
852 if (HONOR_NANS (m_type
))
853 gcc_checking_assert (m_pos_nan
&& m_neg_nan
);
855 gcc_checking_assert (!m_pos_nan
&& !m_neg_nan
);
858 gcc_checking_assert (m_type
);
861 gcc_checking_assert (m_type
);
862 gcc_checking_assert (m_pos_nan
|| m_neg_nan
);
868 // NANs cannot appear in the endpoints of a range.
869 gcc_checking_assert (!real_isnan (&m_min
) && !real_isnan (&m_max
));
871 // Make sure we don't have swapped ranges.
872 gcc_checking_assert (!real_less (&m_max
, &m_min
));
874 // [ +0.0, -0.0 ] is nonsensical.
875 gcc_checking_assert (!(real_iszero (&m_min
, 0) && real_iszero (&m_max
, 1)));
877 // If all the properties are clear, we better not span the entire
878 // domain, because that would make us varying.
879 if (m_pos_nan
&& m_neg_nan
)
880 gcc_checking_assert (!frange_val_is_min (m_min
, m_type
)
881 || !frange_val_is_max (m_max
, m_type
));
884 // We can't do much with nonzeros yet.
886 frange::set_nonzero (tree type
)
891 // We can't do much with nonzeros yet.
893 frange::nonzero_p () const
898 // Set range to [+0.0, +0.0] if honoring signed zeros, or [0.0, 0.0]
902 frange::set_zero (tree type
)
904 if (HONOR_SIGNED_ZEROS (type
))
906 set (type
, dconstm0
, dconst0
);
910 set (type
, dconst0
, dconst0
);
913 // Return TRUE for any zero regardless of sign.
916 frange::zero_p () const
918 return (m_kind
== VR_RANGE
919 && real_iszero (&m_min
)
920 && real_iszero (&m_max
));
923 // Set the range to non-negative numbers, that is [+0.0, +INF].
925 // The NAN in the resulting range (if HONOR_NANS) has a varying sign
926 // as there are no guarantees in IEEE 754 wrt to the sign of a NAN,
927 // except for copy, abs, and copysign. It is the responsibility of
928 // the caller to set the NAN's sign if desired.
931 frange::set_nonnegative (tree type
)
933 set (type
, dconst0
, frange_val_max (type
));
936 // Here we copy between any two irange's.
939 irange::operator= (const irange
&src
)
941 int needed
= src
.num_pairs ();
942 maybe_resize (needed
);
945 unsigned lim
= src
.m_num_ranges
;
946 if (lim
> m_max_ranges
)
949 for (x
= 0; x
< lim
* 2; ++x
)
950 m_base
[x
] = src
.m_base
[x
];
952 // If the range didn't fit, the last range should cover the rest.
953 if (lim
!= src
.m_num_ranges
)
954 m_base
[x
- 1] = src
.m_base
[src
.m_num_ranges
* 2 - 1];
959 m_bitmask
= src
.m_bitmask
;
960 if (m_max_ranges
== 1)
968 get_legacy_range (const irange
&r
, tree
&min
, tree
&max
)
970 if (r
.undefined_p ())
977 tree type
= r
.type ();
980 min
= wide_int_to_tree (type
, r
.lower_bound ());
981 max
= wide_int_to_tree (type
, r
.upper_bound ());
985 unsigned int precision
= TYPE_PRECISION (type
);
986 signop sign
= TYPE_SIGN (type
);
987 if (r
.num_pairs () > 1
989 && r
.lower_bound () == wi::min_value (precision
, sign
)
990 && r
.upper_bound () == wi::max_value (precision
, sign
))
992 int_range
<3> inv (r
);
994 min
= wide_int_to_tree (type
, inv
.lower_bound (0));
995 max
= wide_int_to_tree (type
, inv
.upper_bound (0));
996 return VR_ANTI_RANGE
;
999 min
= wide_int_to_tree (type
, r
.lower_bound ());
1000 max
= wide_int_to_tree (type
, r
.upper_bound ());
1004 /* Set value range to the canonical form of {VRTYPE, MIN, MAX, EQUIV}.
1005 This means adjusting VRTYPE, MIN and MAX representing the case of a
1006 wrapping range with MAX < MIN covering [MIN, type_max] U [type_min, MAX]
1007 as anti-rage ~[MAX+1, MIN-1]. Likewise for wrapping anti-ranges.
1008 In corner cases where MAX+1 or MIN-1 wraps this will fall back
1010 This routine exists to ease canonicalization in the case where we
1011 extract ranges from var + CST op limit. */
1014 irange::set (tree type
, const wide_int
&min
, const wide_int
&max
,
1015 value_range_kind kind
)
1017 unsigned prec
= TYPE_PRECISION (type
);
1018 signop sign
= TYPE_SIGN (type
);
1019 wide_int min_value
= wi::min_value (prec
, sign
);
1020 wide_int max_value
= wi::max_value (prec
, sign
);
1023 m_bitmask
.set_unknown (prec
);
1025 if (kind
== VR_RANGE
)
1030 if (min
== min_value
&& max
== max_value
)
1031 m_kind
= VR_VARYING
;
1037 gcc_checking_assert (kind
== VR_ANTI_RANGE
);
1038 gcc_checking_assert (m_max_ranges
> 1);
1040 m_kind
= VR_UNDEFINED
;
1042 wi::overflow_type ovf
;
1045 lim
= wi::add (min
, -1, sign
, &ovf
);
1047 lim
= wi::sub (min
, 1, sign
, &ovf
);
1052 m_base
[0] = min_value
;
1057 lim
= wi::sub (max
, -1, sign
, &ovf
);
1059 lim
= wi::add (max
, 1, sign
, &ovf
);
1063 m_base
[m_num_ranges
* 2] = lim
;
1064 m_base
[m_num_ranges
* 2 + 1] = max_value
;
1074 irange::set (tree min
, tree max
, value_range_kind kind
)
1076 if (POLY_INT_CST_P (min
) || POLY_INT_CST_P (max
))
1078 set_varying (TREE_TYPE (min
));
1082 gcc_checking_assert (TREE_CODE (min
) == INTEGER_CST
);
1083 gcc_checking_assert (TREE_CODE (max
) == INTEGER_CST
);
1085 return set (TREE_TYPE (min
), wi::to_wide (min
), wi::to_wide (max
), kind
);
1088 // Check the validity of the range.
1091 irange::verify_range ()
1093 gcc_checking_assert (m_discriminator
== VR_IRANGE
);
1094 if (m_kind
== VR_UNDEFINED
)
1096 gcc_checking_assert (m_num_ranges
== 0);
1099 gcc_checking_assert (m_num_ranges
<= m_max_ranges
);
1101 // Legacy allowed these to represent VARYING for unknown types.
1102 // Leave this in for now, until all users are converted. Eventually
1103 // we should abort in set_varying.
1104 if (m_kind
== VR_VARYING
&& m_type
== error_mark_node
)
1107 unsigned prec
= TYPE_PRECISION (m_type
);
1108 if (m_kind
== VR_VARYING
)
1110 gcc_checking_assert (m_bitmask
.unknown_p ());
1111 gcc_checking_assert (m_num_ranges
== 1);
1112 gcc_checking_assert (varying_compatible_p ());
1113 gcc_checking_assert (lower_bound ().get_precision () == prec
);
1114 gcc_checking_assert (upper_bound ().get_precision () == prec
);
1117 gcc_checking_assert (m_num_ranges
!= 0);
1118 gcc_checking_assert (!varying_compatible_p ());
1119 for (unsigned i
= 0; i
< m_num_ranges
; ++i
)
1121 wide_int lb
= lower_bound (i
);
1122 wide_int ub
= upper_bound (i
);
1123 gcc_checking_assert (lb
.get_precision () == prec
);
1124 gcc_checking_assert (ub
.get_precision () == prec
);
1125 int c
= wi::cmp (lb
, ub
, TYPE_SIGN (m_type
));
1126 gcc_checking_assert (c
== 0 || c
== -1);
1128 m_bitmask
.verify_mask ();
1132 irange::operator== (const irange
&other
) const
1134 if (m_num_ranges
!= other
.m_num_ranges
)
1137 if (m_num_ranges
== 0)
1140 signop sign1
= TYPE_SIGN (type ());
1141 signop sign2
= TYPE_SIGN (other
.type ());
1143 for (unsigned i
= 0; i
< m_num_ranges
; ++i
)
1145 widest_int lb
= widest_int::from (lower_bound (i
), sign1
);
1146 widest_int ub
= widest_int::from (upper_bound (i
), sign1
);
1147 widest_int lb_other
= widest_int::from (other
.lower_bound (i
), sign2
);
1148 widest_int ub_other
= widest_int::from (other
.upper_bound (i
), sign2
);
1149 if (lb
!= lb_other
|| ub
!= ub_other
)
1153 irange_bitmask bm1
= get_bitmask ();
1154 irange_bitmask bm2
= other
.get_bitmask ();
1155 widest_int tmp1
= widest_int::from (bm1
.mask (), sign1
);
1156 widest_int tmp2
= widest_int::from (bm2
.mask (), sign2
);
1159 if (bm1
.unknown_p ())
1161 tmp1
= widest_int::from (bm1
.value (), sign1
);
1162 tmp2
= widest_int::from (bm2
.value (), sign2
);
1163 return tmp1
== tmp2
;
1166 /* If range is a singleton, place it in RESULT and return TRUE. */
1169 irange::singleton_p (tree
*result
) const
1171 if (num_pairs () == 1 && lower_bound () == upper_bound ())
1174 *result
= wide_int_to_tree (type (), lower_bound ());
1181 irange::singleton_p (wide_int
&w
) const
1183 if (num_pairs () == 1 && lower_bound () == upper_bound ())
1191 /* Return 1 if CST is inside value range.
1192 0 if CST is not inside value range.
1194 Benchmark compile/20001226-1.c compilation time after changing this
1198 irange::contains_p (const wide_int
&cst
) const
1203 // See if we can exclude CST based on the known 0 bits.
1204 if (!m_bitmask
.unknown_p ()
1206 && wi::bit_and (m_bitmask
.get_nonzero_bits (), cst
) == 0)
1209 signop sign
= TYPE_SIGN (type ());
1210 for (unsigned r
= 0; r
< m_num_ranges
; ++r
)
1212 if (wi::lt_p (cst
, lower_bound (r
), sign
))
1214 if (wi::le_p (cst
, upper_bound (r
), sign
))
1221 // Perform an efficient union with R when both ranges have only a single pair.
1222 // Excluded are VARYING and UNDEFINED ranges.
1225 irange::irange_single_pair_union (const irange
&r
)
1227 gcc_checking_assert (!undefined_p () && !varying_p ());
1228 gcc_checking_assert (!r
.undefined_p () && !varying_p ());
1230 signop sign
= TYPE_SIGN (m_type
);
1231 // Check if current lower bound is also the new lower bound.
1232 if (wi::le_p (m_base
[0], r
.m_base
[0], sign
))
1234 // If current upper bound is new upper bound, we're done.
1235 if (wi::le_p (r
.m_base
[1], m_base
[1], sign
))
1236 return union_bitmask (r
);
1237 // Otherwise R has the new upper bound.
1238 // Check for overlap/touching ranges, or single target range.
1239 if (m_max_ranges
== 1
1240 || (widest_int::from (m_base
[1], sign
) + 1
1241 >= widest_int::from (r
.m_base
[0], TYPE_SIGN (r
.m_type
))))
1242 m_base
[1] = r
.m_base
[1];
1245 // This is a dual range result.
1246 m_base
[2] = r
.m_base
[0];
1247 m_base
[3] = r
.m_base
[1];
1250 // The range has been altered, so normalize it even if nothing
1251 // changed in the mask.
1252 if (!union_bitmask (r
))
1259 // Set the new lower bound to R's lower bound.
1260 wide_int lb
= m_base
[0];
1261 m_base
[0] = r
.m_base
[0];
1263 // If R fully contains THIS range, just set the upper bound.
1264 if (wi::ge_p (r
.m_base
[1], m_base
[1], sign
))
1265 m_base
[1] = r
.m_base
[1];
1266 // Check for overlapping ranges, or target limited to a single range.
1267 else if (m_max_ranges
== 1
1268 || (widest_int::from (r
.m_base
[1], TYPE_SIGN (r
.m_type
)) + 1
1269 >= widest_int::from (lb
, sign
)))
1273 // Left with 2 pairs.
1276 m_base
[3] = m_base
[1];
1277 m_base
[1] = r
.m_base
[1];
1279 // The range has been altered, so normalize it even if nothing
1280 // changed in the mask.
1281 if (!union_bitmask (r
))
1288 // Return TRUE if anything changes.
1291 irange::union_ (const vrange
&v
)
1293 const irange
&r
= as_a
<irange
> (v
);
1295 if (r
.undefined_p ())
1311 set_varying (type ());
1315 // Special case one range union one range.
1316 if (m_num_ranges
== 1 && r
.m_num_ranges
== 1)
1317 return irange_single_pair_union (r
);
1319 // If this ranges fully contains R, then we need do nothing.
1320 if (irange_contains_p (r
))
1321 return union_bitmask (r
);
1323 // Do not worry about merging and such by reserving twice as many
1324 // pairs as needed, and then simply sort the 2 ranges into this
1325 // intermediate form.
1327 // The intermediate result will have the property that the beginning
1328 // of each range is <= the beginning of the next range. There may
1329 // be overlapping ranges at this point. I.e. this would be valid
1330 // [-20, 10], [-10, 0], [0, 20], [40, 90] as it satisfies this
1331 // constraint : -20 < -10 < 0 < 40. When the range is rebuilt into r,
1332 // the merge is performed.
1334 // [Xi,Yi]..[Xn,Yn] U [Xj,Yj]..[Xm,Ym] --> [Xk,Yk]..[Xp,Yp]
1335 auto_vec
<wide_int
, 20> res (m_num_ranges
* 2 + r
.m_num_ranges
* 2);
1336 unsigned i
= 0, j
= 0, k
= 0;
1337 signop sign
= TYPE_SIGN (m_type
);
1339 while (i
< m_num_ranges
* 2 && j
< r
.m_num_ranges
* 2)
1341 // lower of Xi and Xj is the lowest point.
1342 if (widest_int::from (m_base
[i
], sign
)
1343 <= widest_int::from (r
.m_base
[j
], sign
))
1345 res
.quick_push (m_base
[i
]);
1346 res
.quick_push (m_base
[i
+ 1]);
1352 res
.quick_push (r
.m_base
[j
]);
1353 res
.quick_push (r
.m_base
[j
+ 1]);
1358 for ( ; i
< m_num_ranges
* 2; i
+= 2)
1360 res
.quick_push (m_base
[i
]);
1361 res
.quick_push (m_base
[i
+ 1]);
1364 for ( ; j
< r
.m_num_ranges
* 2; j
+= 2)
1366 res
.quick_push (r
.m_base
[j
]);
1367 res
.quick_push (r
.m_base
[j
+ 1]);
1371 // Now normalize the vector removing any overlaps.
1373 for (j
= 2; j
< k
; j
+= 2)
1375 // Current upper+1 is >= lower bound next pair, then we merge ranges.
1376 if (widest_int::from (res
[i
- 1], sign
) + 1
1377 >= widest_int::from (res
[j
], sign
))
1379 // New upper bounds is greater of current or the next one.
1380 if (widest_int::from (res
[j
+ 1], sign
)
1381 > widest_int::from (res
[i
- 1], sign
))
1382 res
[i
- 1] = res
[j
+ 1];
1386 // This is a new distinct range, but no point in copying it
1387 // if it is already in the right place.
1391 res
[i
++] = res
[j
+ 1];
1398 // At this point, the vector should have i ranges, none overlapping.
1399 // Now it simply needs to be copied, and if there are too many
1400 // ranges, merge some. We wont do any analysis as to what the
1401 // "best" merges are, simply combine the final ranges into one.
1402 maybe_resize (i
/ 2);
1403 if (i
> m_max_ranges
* 2)
1405 res
[m_max_ranges
* 2 - 1] = res
[i
- 1];
1406 i
= m_max_ranges
* 2;
1409 for (j
= 0; j
< i
; j
++)
1410 m_base
[j
] = res
[j
];
1411 m_num_ranges
= i
/ 2;
1414 // The range has been altered, so normalize it even if nothing
1415 // changed in the mask.
1416 if (!union_bitmask (r
))
1423 // Return TRUE if THIS fully contains R. No undefined or varying cases.
1426 irange::irange_contains_p (const irange
&r
) const
1428 gcc_checking_assert (!undefined_p () && !varying_p ());
1429 gcc_checking_assert (!r
.undefined_p () && !varying_p ());
1431 // In order for THIS to fully contain R, all of the pairs within R must
1432 // be fully contained by the pairs in this object.
1433 signop sign
= TYPE_SIGN (m_type
);
1436 wide_int rl
= r
.m_base
[0];
1437 wide_int ru
= r
.m_base
[1];
1438 wide_int l
= m_base
[0];
1439 wide_int u
= m_base
[1];
1442 // If r is contained within this range, move to the next R
1443 if (wi::ge_p (rl
, l
, sign
)
1444 && wi::le_p (ru
, u
, sign
))
1446 // This pair is OK, Either done, or bump to the next.
1447 if (++ri
>= r
.num_pairs ())
1449 rl
= r
.m_base
[ri
* 2];
1450 ru
= r
.m_base
[ri
* 2 + 1];
1453 // Otherwise, check if this's pair occurs before R's.
1454 if (wi::lt_p (u
, rl
, sign
))
1456 // There's still at least one pair of R left.
1457 if (++i
>= num_pairs ())
1460 u
= m_base
[i
* 2 + 1];
1469 // Return TRUE if anything changes.
1472 irange::intersect (const vrange
&v
)
1474 const irange
&r
= as_a
<irange
> (v
);
1475 gcc_checking_assert (undefined_p () || r
.undefined_p ()
1476 || range_compatible_p (type (), r
.type ()));
1480 if (r
.undefined_p ())
1493 if (r
.num_pairs () == 1)
1495 bool res
= intersect (r
.lower_bound (), r
.upper_bound ());
1499 res
|= intersect_bitmask (r
);
1505 // If R fully contains this, then intersection will change nothing.
1506 if (r
.irange_contains_p (*this))
1507 return intersect_bitmask (r
);
1509 // ?? We could probably come up with something smarter than the
1510 // worst case scenario here.
1511 int needed
= num_pairs () + r
.num_pairs ();
1512 maybe_resize (needed
);
1514 signop sign
= TYPE_SIGN (m_type
);
1515 unsigned bld_pair
= 0;
1516 unsigned bld_lim
= m_max_ranges
;
1517 int_range_max
r2 (*this);
1518 unsigned r2_lim
= r2
.num_pairs ();
1520 for (unsigned i
= 0; i
< r
.num_pairs (); )
1522 // If r1's upper is < r2's lower, we can skip r1's pair.
1523 wide_int ru
= r
.m_base
[i
* 2 + 1];
1524 wide_int r2l
= r2
.m_base
[i2
* 2];
1525 if (wi::lt_p (ru
, r2l
, sign
))
1530 // Likewise, skip r2's pair if its excluded.
1531 wide_int r2u
= r2
.m_base
[i2
* 2 + 1];
1532 wide_int rl
= r
.m_base
[i
* 2];
1533 if (wi::lt_p (r2u
, rl
, sign
))
1538 // No more r2, break.
1542 // Must be some overlap. Find the highest of the lower bounds,
1543 // and set it, unless the build limits lower bounds is already
1545 if (bld_pair
< bld_lim
)
1547 if (wi::ge_p (rl
, r2l
, sign
))
1548 m_base
[bld_pair
* 2] = rl
;
1550 m_base
[bld_pair
* 2] = r2l
;
1553 // Decrease and set a new upper.
1556 // ...and choose the lower of the upper bounds.
1557 if (wi::le_p (ru
, r2u
, sign
))
1559 m_base
[bld_pair
* 2 + 1] = ru
;
1561 // Move past the r1 pair and keep trying.
1567 m_base
[bld_pair
* 2 + 1] = r2u
;
1572 // No more r2, break.
1575 // r2 has the higher lower bound.
1578 // At the exit of this loop, it is one of 2 things:
1579 // ran out of r1, or r2, but either means we are done.
1580 m_num_ranges
= bld_pair
;
1581 if (m_num_ranges
== 0)
1588 // The range has been altered, so normalize it even if nothing
1589 // changed in the mask.
1590 if (!intersect_bitmask (r
))
1598 // Multirange intersect for a specified wide_int [lb, ub] range.
1599 // Return TRUE if intersect changed anything.
1601 // NOTE: It is the caller's responsibility to intersect the mask.
1604 irange::intersect (const wide_int
& lb
, const wide_int
& ub
)
1606 // Undefined remains undefined.
1610 tree range_type
= type();
1611 signop sign
= TYPE_SIGN (range_type
);
1613 gcc_checking_assert (TYPE_PRECISION (range_type
) == wi::get_precision (lb
));
1614 gcc_checking_assert (TYPE_PRECISION (range_type
) == wi::get_precision (ub
));
1616 // If this range is fully contained, then intersection will do nothing.
1617 if (wi::ge_p (lower_bound (), lb
, sign
)
1618 && wi::le_p (upper_bound (), ub
, sign
))
1621 unsigned bld_index
= 0;
1622 unsigned pair_lim
= num_pairs ();
1623 for (unsigned i
= 0; i
< pair_lim
; i
++)
1625 wide_int pairl
= m_base
[i
* 2];
1626 wide_int pairu
= m_base
[i
* 2 + 1];
1627 // Once UB is less than a pairs lower bound, we're done.
1628 if (wi::lt_p (ub
, pairl
, sign
))
1630 // if LB is greater than this pairs upper, this pair is excluded.
1631 if (wi::lt_p (pairu
, lb
, sign
))
1634 // Must be some overlap. Find the highest of the lower bounds,
1636 if (wi::gt_p (lb
, pairl
, sign
))
1637 m_base
[bld_index
* 2] = lb
;
1639 m_base
[bld_index
* 2] = pairl
;
1641 // ...and choose the lower of the upper bounds and if the base pair
1642 // has the lower upper bound, need to check next pair too.
1643 if (wi::lt_p (ub
, pairu
, sign
))
1645 m_base
[bld_index
++ * 2 + 1] = ub
;
1649 m_base
[bld_index
++ * 2 + 1] = pairu
;
1652 m_num_ranges
= bld_index
;
1653 if (m_num_ranges
== 0)
1660 // The caller must normalize and verify the range, as the bitmask
1661 // still needs to be handled.
1666 // Signed 1-bits are strange. You can't subtract 1, because you can't
1667 // represent the number 1. This works around that for the invert routine.
1669 static wide_int
inline
1670 subtract_one (const wide_int
&x
, tree type
, wi::overflow_type
&overflow
)
1672 if (TYPE_SIGN (type
) == SIGNED
)
1673 return wi::add (x
, -1, SIGNED
, &overflow
);
1675 return wi::sub (x
, 1, UNSIGNED
, &overflow
);
1678 // The analogous function for adding 1.
1680 static wide_int
inline
1681 add_one (const wide_int
&x
, tree type
, wi::overflow_type
&overflow
)
1683 if (TYPE_SIGN (type
) == SIGNED
)
1684 return wi::sub (x
, -1, SIGNED
, &overflow
);
1686 return wi::add (x
, 1, UNSIGNED
, &overflow
);
1689 // Return the inverse of a range.
1694 gcc_checking_assert (!undefined_p () && !varying_p ());
1696 // We always need one more set of bounds to represent an inverse, so
1697 // if we're at the limit, we can't properly represent things.
1699 // For instance, to represent the inverse of a 2 sub-range set
1700 // [5, 10][20, 30], we would need a 3 sub-range set
1701 // [-MIN, 4][11, 19][31, MAX].
1703 // In this case, return the most conservative thing.
1705 // However, if any of the extremes of the range are -MIN/+MAX, we
1706 // know we will not need an extra bound. For example:
1708 // INVERT([-MIN,20][30,40]) => [21,29][41,+MAX]
1709 // INVERT([-MIN,20][30,MAX]) => [21,29]
1710 tree ttype
= type ();
1711 unsigned prec
= TYPE_PRECISION (ttype
);
1712 signop sign
= TYPE_SIGN (ttype
);
1713 wide_int type_min
= wi::min_value (prec
, sign
);
1714 wide_int type_max
= wi::max_value (prec
, sign
);
1715 m_bitmask
.set_unknown (prec
);
1717 // At this point, we need one extra sub-range to represent the
1719 maybe_resize (m_num_ranges
+ 1);
1721 // The algorithm is as follows. To calculate INVERT ([a,b][c,d]), we
1722 // generate [-MIN, a-1][b+1, c-1][d+1, MAX].
1724 // If there is an over/underflow in the calculation for any
1725 // sub-range, we eliminate that subrange. This allows us to easily
1726 // calculate INVERT([-MIN, 5]) with: [-MIN, -MIN-1][6, MAX]. And since
1727 // we eliminate the underflow, only [6, MAX] remains.
1729 wi::overflow_type ovf
;
1730 // Construct leftmost range.
1731 int_range_max
orig_range (*this);
1732 unsigned nitems
= 0;
1734 // If this is going to underflow on the MINUS 1, don't even bother
1735 // checking. This also handles subtracting one from an unsigned 0,
1736 // which doesn't set the underflow bit.
1737 if (type_min
!= orig_range
.lower_bound ())
1739 m_base
[nitems
++] = type_min
;
1740 tmp
= subtract_one (orig_range
.lower_bound (), ttype
, ovf
);
1741 m_base
[nitems
++] = tmp
;
1746 // Construct middle ranges if applicable.
1747 if (orig_range
.num_pairs () > 1)
1750 for (; j
< (orig_range
.num_pairs () * 2) - 1; j
+= 2)
1752 // The middle ranges cannot have MAX/MIN, so there's no need
1753 // to check for unsigned overflow on the +1 and -1 here.
1754 tmp
= wi::add (orig_range
.m_base
[j
], 1, sign
, &ovf
);
1755 m_base
[nitems
++] = tmp
;
1756 tmp
= subtract_one (orig_range
.m_base
[j
+ 1], ttype
, ovf
);
1757 m_base
[nitems
++] = tmp
;
1763 // Construct rightmost range.
1765 // However, if this will overflow on the PLUS 1, don't even bother.
1766 // This also handles adding one to an unsigned MAX, which doesn't
1767 // set the overflow bit.
1768 if (type_max
!= orig_range
.m_base
[i
])
1770 tmp
= add_one (orig_range
.m_base
[i
], ttype
, ovf
);
1771 m_base
[nitems
++] = tmp
;
1772 m_base
[nitems
++] = type_max
;
1776 m_num_ranges
= nitems
/ 2;
1778 // We disallow undefined or varying coming in, so the result can
1779 // only be a VR_RANGE.
1780 gcc_checking_assert (m_kind
== VR_RANGE
);
1786 // Return the bitmask inherent in the range.
1789 irange::get_bitmask_from_range () const
1791 unsigned prec
= TYPE_PRECISION (type ());
1792 wide_int min
= lower_bound ();
1793 wide_int max
= upper_bound ();
1795 // All the bits of a singleton are known.
1798 wide_int mask
= wi::zero (prec
);
1799 wide_int value
= lower_bound ();
1800 return irange_bitmask (value
, mask
);
1803 wide_int xorv
= min
^ max
;
1806 xorv
= wi::mask (prec
- wi::clz (xorv
), false, prec
);
1808 return irange_bitmask (wi::zero (prec
), min
| xorv
);
1811 // If the the mask can be trivially converted to a range, do so and
1815 irange::set_range_from_bitmask ()
1817 gcc_checking_assert (!undefined_p ());
1818 if (m_bitmask
.unknown_p ())
1821 // If all the bits are known, this is a singleton.
1822 if (m_bitmask
.mask () == 0)
1824 set (m_type
, m_bitmask
.value (), m_bitmask
.value ());
1828 unsigned popcount
= wi::popcount (m_bitmask
.get_nonzero_bits ());
1830 // If we have only one bit set in the mask, we can figure out the
1831 // range immediately.
1834 // Make sure we don't pessimize the range.
1835 if (!contains_p (m_bitmask
.get_nonzero_bits ()))
1838 bool has_zero
= contains_zero_p (*this);
1839 wide_int nz
= m_bitmask
.get_nonzero_bits ();
1840 set (m_type
, nz
, nz
);
1841 m_bitmask
.set_nonzero_bits (nz
);
1845 zero
.set_zero (type ());
1852 else if (popcount
== 0)
1861 irange::update_bitmask (const irange_bitmask
&bm
)
1863 gcc_checking_assert (!undefined_p ());
1865 // Drop VARYINGs with known bits to a plain range.
1866 if (m_kind
== VR_VARYING
&& !bm
.unknown_p ())
1870 if (!set_range_from_bitmask ())
1876 // Return the bitmask of known bits that includes the bitmask inherent
1880 irange::get_bitmask () const
1882 gcc_checking_assert (!undefined_p ());
1884 // The mask inherent in the range is calculated on-demand. For
1885 // example, [0,255] does not have known bits set by default. This
1886 // saves us considerable time, because setting it at creation incurs
1887 // a large penalty for irange::set. At the time of writing there
1888 // was a 5% slowdown in VRP if we kept the mask precisely up to date
1889 // at all times. Instead, we default to -1 and set it when
1890 // explicitly requested. However, this function will always return
1891 // the correct mask.
1893 // This also means that the mask may have a finer granularity than
1894 // the range and thus contradict it. Think of the mask as an
1895 // enhancement to the range. For example:
1897 // [3, 1000] MASK 0xfffffffe VALUE 0x0
1899 // 3 is in the range endpoints, but is excluded per the known 0 bits
1902 // See also the note in irange_bitmask::intersect.
1903 irange_bitmask bm
= get_bitmask_from_range ();
1904 if (!m_bitmask
.unknown_p ())
1905 bm
.intersect (m_bitmask
);
1909 // Set the nonzero bits in R into THIS. Return TRUE and
1910 // normalize the range if anything changed.
1913 irange::set_nonzero_bits (const wide_int
&bits
)
1915 gcc_checking_assert (!undefined_p ());
1916 irange_bitmask
bm (wi::zero (TYPE_PRECISION (type ())), bits
);
1917 update_bitmask (bm
);
1920 // Return the nonzero bits in R.
1923 irange::get_nonzero_bits () const
1925 gcc_checking_assert (!undefined_p ());
1926 irange_bitmask bm
= get_bitmask ();
1927 return bm
.value () | bm
.mask ();
1930 // Intersect the bitmask in R into THIS and normalize the range.
1931 // Return TRUE if the intersection changed anything.
1934 irange::intersect_bitmask (const irange
&r
)
1936 gcc_checking_assert (!undefined_p () && !r
.undefined_p ());
1938 if (m_bitmask
== r
.m_bitmask
)
1941 irange_bitmask bm
= get_bitmask ();
1942 irange_bitmask save
= bm
;
1943 if (!bm
.intersect (r
.get_bitmask ()))
1948 // Updating m_bitmask may still yield a semantic bitmask (as
1949 // returned by get_bitmask) which is functionally equivalent to what
1950 // we originally had. In which case, there's still no change.
1951 if (save
== get_bitmask ())
1954 if (!set_range_from_bitmask ())
1961 // Union the bitmask in R into THIS. Return TRUE and normalize the
1962 // range if anything changed.
1965 irange::union_bitmask (const irange
&r
)
1967 gcc_checking_assert (!undefined_p () && !r
.undefined_p ());
1969 if (m_bitmask
== r
.m_bitmask
)
1972 irange_bitmask bm
= get_bitmask ();
1973 irange_bitmask save
= bm
;
1974 if (!bm
.union_ (r
.get_bitmask ()))
1979 // Updating m_bitmask may still yield a semantic bitmask (as
1980 // returned by get_bitmask) which is functionally equivalent to what
1981 // we originally had. In which case, there's still no change.
1982 if (save
== get_bitmask ())
1985 // No need to call set_range_from_mask, because we'll never
1986 // narrow the range. Besides, it would cause endless recursion
1987 // because of the union_ in set_range_from_mask.
1993 irange_bitmask::verify_mask () const
1995 gcc_assert (m_value
.get_precision () == m_mask
.get_precision ());
1999 dump_value_range (FILE *file
, const vrange
*vr
)
2005 debug (const vrange
*vr
)
2007 dump_value_range (stderr
, vr
);
2008 fprintf (stderr
, "\n");
2012 debug (const vrange
&vr
)
2018 debug (const value_range
*vr
)
2020 dump_value_range (stderr
, vr
);
2021 fprintf (stderr
, "\n");
2025 debug (const value_range
&vr
)
2027 dump_value_range (stderr
, &vr
);
2028 fprintf (stderr
, "\n");
2031 /* Return true, if VAL1 and VAL2 are equal values for VRP purposes. */
2034 vrp_operand_equal_p (const_tree val1
, const_tree val2
)
2038 if (!val1
|| !val2
|| !operand_equal_p (val1
, val2
, 0))
2044 gt_ggc_mx (irange
*x
)
2046 if (!x
->undefined_p ())
2047 gt_ggc_mx (x
->m_type
);
2051 gt_pch_nx (irange
*x
)
2053 if (!x
->undefined_p ())
2054 gt_pch_nx (x
->m_type
);
2058 gt_pch_nx (irange
*x
, gt_pointer_operator op
, void *cookie
)
2060 for (unsigned i
= 0; i
< x
->m_num_ranges
; ++i
)
2062 op (&x
->m_base
[i
* 2], NULL
, cookie
);
2063 op (&x
->m_base
[i
* 2 + 1], NULL
, cookie
);
2068 gt_ggc_mx (frange
*x
)
2070 gt_ggc_mx (x
->m_type
);
2074 gt_pch_nx (frange
*x
)
2076 gt_pch_nx (x
->m_type
);
2080 gt_pch_nx (frange
*x
, gt_pointer_operator op
, void *cookie
)
2082 op (&x
->m_type
, NULL
, cookie
);
2086 gt_ggc_mx (vrange
*x
)
2088 if (is_a
<irange
> (*x
))
2089 return gt_ggc_mx ((irange
*) x
);
2090 if (is_a
<frange
> (*x
))
2091 return gt_ggc_mx ((frange
*) x
);
2096 gt_pch_nx (vrange
*x
)
2098 if (is_a
<irange
> (*x
))
2099 return gt_pch_nx ((irange
*) x
);
2100 if (is_a
<frange
> (*x
))
2101 return gt_pch_nx ((frange
*) x
);
2106 gt_pch_nx (vrange
*x
, gt_pointer_operator op
, void *cookie
)
2108 if (is_a
<irange
> (*x
))
2109 gt_pch_nx ((irange
*) x
, op
, cookie
);
2110 else if (is_a
<frange
> (*x
))
2111 gt_pch_nx ((frange
*) x
, op
, cookie
);
2116 #define DEFINE_INT_RANGE_INSTANCE(N) \
2117 template int_range<N>::int_range(tree_node *, \
2120 value_range_kind); \
2121 template int_range<N>::int_range(tree); \
2122 template int_range<N>::int_range(const irange &); \
2123 template int_range<N>::int_range(const int_range &); \
2124 template int_range<N>& int_range<N>::operator= (const int_range &);
2126 DEFINE_INT_RANGE_INSTANCE(1)
2127 DEFINE_INT_RANGE_INSTANCE(2)
2128 DEFINE_INT_RANGE_INSTANCE(3)
2129 DEFINE_INT_RANGE_INSTANCE(255)
2132 #include "selftest.h"
2134 #define INT(x) wi::shwi ((x), TYPE_PRECISION (integer_type_node))
2135 #define UINT(x) wi::uhwi ((x), TYPE_PRECISION (unsigned_type_node))
2136 #define SCHAR(x) wi::shwi ((x), TYPE_PRECISION (signed_char_type_node))
2142 range (tree type
, int a
, int b
, value_range_kind kind
= VR_RANGE
)
2145 if (TYPE_UNSIGNED (type
))
2147 w1
= wi::uhwi (a
, TYPE_PRECISION (type
));
2148 w2
= wi::uhwi (b
, TYPE_PRECISION (type
));
2152 w1
= wi::shwi (a
, TYPE_PRECISION (type
));
2153 w2
= wi::shwi (b
, TYPE_PRECISION (type
));
2155 return int_range
<2> (type
, w1
, w2
, kind
);
2159 range_int (int a
, int b
, value_range_kind kind
= VR_RANGE
)
2161 return range (integer_type_node
, a
, b
, kind
);
2165 range_uint (int a
, int b
, value_range_kind kind
= VR_RANGE
)
2167 return range (unsigned_type_node
, a
, b
, kind
);
2171 range_uint128 (int a
, int b
, value_range_kind kind
= VR_RANGE
)
2173 tree u128_type_node
= build_nonstandard_integer_type (128, 1);
2174 return range (u128_type_node
, a
, b
, kind
);
2178 range_uchar (int a
, int b
, value_range_kind kind
= VR_RANGE
)
2180 return range (unsigned_char_type_node
, a
, b
, kind
);
2184 range_char (int a
, int b
, value_range_kind kind
= VR_RANGE
)
2186 return range (signed_char_type_node
, a
, b
, kind
);
2190 build_range3 (int a
, int b
, int c
, int d
, int e
, int f
)
2192 int_range
<3> i1
= range_int (a
, b
);
2193 int_range
<3> i2
= range_int (c
, d
);
2194 int_range
<3> i3
= range_int (e
, f
);
2201 range_tests_irange3 ()
2203 int_range
<3> r0
, r1
, r2
;
2204 int_range
<3> i1
, i2
, i3
;
2206 // ([10,20] U [5,8]) U [1,3] ==> [1,3][5,8][10,20].
2207 r0
= range_int (10, 20);
2208 r1
= range_int (5, 8);
2210 r1
= range_int (1, 3);
2212 ASSERT_TRUE (r0
== build_range3 (1, 3, 5, 8, 10, 20));
2214 // [1,3][5,8][10,20] U [-5,0] => [-5,3][5,8][10,20].
2215 r1
= range_int (-5, 0);
2217 ASSERT_TRUE (r0
== build_range3 (-5, 3, 5, 8, 10, 20));
2219 // [10,20][30,40] U [50,60] ==> [10,20][30,40][50,60].
2220 r1
= range_int (50, 60);
2221 r0
= range_int (10, 20);
2222 r0
.union_ (range_int (30, 40));
2224 ASSERT_TRUE (r0
== build_range3 (10, 20, 30, 40, 50, 60));
2225 // [10,20][30,40][50,60] U [70, 80] ==> [10,20][30,40][50,60][70,80].
2226 r1
= range_int (70, 80);
2229 r2
= build_range3 (10, 20, 30, 40, 50, 60);
2230 r2
.union_ (range_int (70, 80));
2231 ASSERT_TRUE (r0
== r2
);
2233 // [10,20][30,40][50,60] U [6,35] => [6,40][50,60].
2234 r0
= build_range3 (10, 20, 30, 40, 50, 60);
2235 r1
= range_int (6, 35);
2237 r1
= range_int (6, 40);
2238 r1
.union_ (range_int (50, 60));
2239 ASSERT_TRUE (r0
== r1
);
2241 // [10,20][30,40][50,60] U [6,60] => [6,60].
2242 r0
= build_range3 (10, 20, 30, 40, 50, 60);
2243 r1
= range_int (6, 60);
2245 ASSERT_TRUE (r0
== range_int (6, 60));
2247 // [10,20][30,40][50,60] U [6,70] => [6,70].
2248 r0
= build_range3 (10, 20, 30, 40, 50, 60);
2249 r1
= range_int (6, 70);
2251 ASSERT_TRUE (r0
== range_int (6, 70));
2253 // [10,20][30,40][50,60] U [35,70] => [10,20][30,70].
2254 r0
= build_range3 (10, 20, 30, 40, 50, 60);
2255 r1
= range_int (35, 70);
2257 r1
= range_int (10, 20);
2258 r1
.union_ (range_int (30, 70));
2259 ASSERT_TRUE (r0
== r1
);
2261 // [10,20][30,40][50,60] U [15,35] => [10,40][50,60].
2262 r0
= build_range3 (10, 20, 30, 40, 50, 60);
2263 r1
= range_int (15, 35);
2265 r1
= range_int (10, 40);
2266 r1
.union_ (range_int (50, 60));
2267 ASSERT_TRUE (r0
== r1
);
2269 // [10,20][30,40][50,60] U [35,35] => [10,20][30,40][50,60].
2270 r0
= build_range3 (10, 20, 30, 40, 50, 60);
2271 r1
= range_int (35, 35);
2273 ASSERT_TRUE (r0
== build_range3 (10, 20, 30, 40, 50, 60));
2277 range_tests_int_range_max ()
2280 unsigned int nrange
;
2282 // Build a huge multi-range range.
2283 for (nrange
= 0; nrange
< 50; ++nrange
)
2285 int_range
<1> tmp
= range_int (nrange
*10, nrange
*10 + 5);
2288 ASSERT_TRUE (big
.num_pairs () == nrange
);
2290 // Verify that we can copy it without loosing precision.
2291 int_range_max
copy (big
);
2292 ASSERT_TRUE (copy
.num_pairs () == nrange
);
2294 // Inverting it should produce one more sub-range.
2296 ASSERT_TRUE (big
.num_pairs () == nrange
+ 1);
2298 int_range
<1> tmp
= range_int (5, 37);
2299 big
.intersect (tmp
);
2300 ASSERT_TRUE (big
.num_pairs () == 4);
2302 // Test that [10,10][20,20] does NOT contain 15.
2304 int_range_max i1
= range_int (10, 10);
2305 int_range_max i2
= range_int (20, 20);
2307 ASSERT_FALSE (i1
.contains_p (INT (15)));
2311 // Simulate -fstrict-enums where the domain of a type is less than the
2315 range_tests_strict_enum ()
2317 // The enum can only hold [0, 3].
2318 tree rtype
= copy_node (unsigned_type_node
);
2319 TYPE_MIN_VALUE (rtype
) = build_int_cstu (rtype
, 0);
2320 TYPE_MAX_VALUE (rtype
) = build_int_cstu (rtype
, 3);
2322 // Test that even though vr1 covers the strict enum domain ([0, 3]),
2323 // it does not cover the domain of the underlying type.
2324 int_range
<1> vr1
= range (rtype
, 0, 1);
2325 int_range
<1> vr2
= range (rtype
, 2, 3);
2327 ASSERT_TRUE (vr1
== range (rtype
, 0, 3));
2328 ASSERT_FALSE (vr1
.varying_p ());
2330 // Test that copying to a multi-range does not change things.
2331 int_range
<2> ir1 (vr1
);
2332 ASSERT_TRUE (ir1
== vr1
);
2333 ASSERT_FALSE (ir1
.varying_p ());
2335 // The same test as above, but using TYPE_{MIN,MAX}_VALUE instead of [0,3].
2336 vr1
= int_range
<2> (rtype
,
2337 wi::to_wide (TYPE_MIN_VALUE (rtype
)),
2338 wi::to_wide (TYPE_MAX_VALUE (rtype
)));
2340 ASSERT_TRUE (ir1
== vr1
);
2341 ASSERT_FALSE (ir1
.varying_p ());
2347 tree u128_type
= build_nonstandard_integer_type (128, /*unsigned=*/1);
2348 int_range
<2> i1
, i2
, i3
;
2349 int_range
<2> r0
, r1
, rold
;
2351 // Test 1-bit signed integer union.
2352 // [-1,-1] U [0,0] = VARYING.
2353 tree one_bit_type
= build_nonstandard_integer_type (1, 0);
2354 wide_int one_bit_min
= irange_val_min (one_bit_type
);
2355 wide_int one_bit_max
= irange_val_max (one_bit_type
);
2357 int_range
<2> min
= int_range
<2> (one_bit_type
, one_bit_min
, one_bit_min
);
2358 int_range
<2> max
= int_range
<2> (one_bit_type
, one_bit_max
, one_bit_max
);
2360 ASSERT_TRUE (max
.varying_p ());
2362 // Test that we can set a range of true+false for a 1-bit signed int.
2363 r0
= range_true_and_false (one_bit_type
);
2365 // Test inversion of 1-bit signed integers.
2367 int_range
<2> min
= int_range
<2> (one_bit_type
, one_bit_min
, one_bit_min
);
2368 int_range
<2> max
= int_range
<2> (one_bit_type
, one_bit_max
, one_bit_max
);
2372 ASSERT_TRUE (t
== max
);
2375 ASSERT_TRUE (t
== min
);
2378 // Test that NOT(255) is [0..254] in 8-bit land.
2379 int_range
<1> not_255
= range_uchar (255, 255, VR_ANTI_RANGE
);
2380 ASSERT_TRUE (not_255
== range_uchar (0, 254));
2382 // Test that NOT(0) is [1..255] in 8-bit land.
2383 int_range
<2> not_zero
= range_nonzero (unsigned_char_type_node
);
2384 ASSERT_TRUE (not_zero
== range_uchar (1, 255));
2386 // Check that [0,127][0x..ffffff80,0x..ffffff]
2387 // => ~[128, 0x..ffffff7f].
2388 r0
= range_uint128 (0, 127);
2389 wide_int high
= wi::minus_one (128);
2390 // low = -1 - 127 => 0x..ffffff80.
2391 wide_int low
= wi::sub (high
, wi::uhwi (127, 128));
2392 r1
= int_range
<1> (u128_type
, low
, high
); // [0x..ffffff80, 0x..ffffffff]
2393 // r0 = [0,127][0x..ffffff80,0x..fffffff].
2395 // r1 = [128, 0x..ffffff7f].
2396 r1
= int_range
<1> (u128_type
,
2397 wi::uhwi (128, 128),
2398 wi::sub (wi::minus_one (128), wi::uhwi (128, 128)));
2400 ASSERT_TRUE (r0
== r1
);
2402 r0
.set_varying (integer_type_node
);
2403 wide_int minint
= r0
.lower_bound ();
2404 wide_int maxint
= r0
.upper_bound ();
2406 r0
.set_varying (short_integer_type_node
);
2408 r0
.set_varying (unsigned_type_node
);
2409 wide_int maxuint
= r0
.upper_bound ();
2411 // Check that ~[0,5] => [6,MAX] for unsigned int.
2412 r0
= range_uint (0, 5);
2414 ASSERT_TRUE (r0
== int_range
<1> (unsigned_type_node
,
2415 wi::uhwi (6, TYPE_PRECISION (unsigned_type_node
)),
2418 // Check that ~[10,MAX] => [0,9] for unsigned int.
2419 r0
= int_range
<1> (unsigned_type_node
,
2420 wi::uhwi (10, TYPE_PRECISION (unsigned_type_node
)),
2423 ASSERT_TRUE (r0
== range_uint (0, 9));
2425 // Check that ~[0,5] => [6,MAX] for unsigned 128-bit numbers.
2426 r0
= range_uint128 (0, 5, VR_ANTI_RANGE
);
2427 r1
= int_range
<1> (u128_type
, wi::uhwi (6, 128), wi::minus_one (128));
2428 ASSERT_TRUE (r0
== r1
);
2430 // Check that [~5] is really [-MIN,4][6,MAX].
2431 r0
= range_int (5, 5, VR_ANTI_RANGE
);
2432 r1
= int_range
<1> (integer_type_node
, minint
, INT (4));
2433 r1
.union_ (int_range
<1> (integer_type_node
, INT (6), maxint
));
2434 ASSERT_FALSE (r1
.undefined_p ());
2435 ASSERT_TRUE (r0
== r1
);
2437 r1
= range_int (5, 5);
2438 int_range
<2> r2 (r1
);
2439 ASSERT_TRUE (r1
== r2
);
2441 r1
= range_int (5, 10);
2443 r1
= range_int (5, 10);
2444 ASSERT_TRUE (r1
.contains_p (INT (7)));
2446 r1
= range_char (0, 20);
2447 ASSERT_TRUE (r1
.contains_p (SCHAR(15)));
2448 ASSERT_FALSE (r1
.contains_p (SCHAR(300)));
2450 // NOT([10,20]) ==> [-MIN,9][21,MAX].
2451 r0
= r1
= range_int (10, 20);
2452 r2
= int_range
<1> (integer_type_node
, minint
, INT(9));
2453 r2
.union_ (int_range
<1> (integer_type_node
, INT(21), maxint
));
2454 ASSERT_FALSE (r2
.undefined_p ());
2456 ASSERT_TRUE (r1
== r2
);
2457 // Test that NOT(NOT(x)) == x.
2459 ASSERT_TRUE (r0
== r2
);
2461 // Test that booleans and their inverse work as expected.
2462 r0
= range_zero (boolean_type_node
);
2463 ASSERT_TRUE (r0
== range_false ());
2465 ASSERT_TRUE (r0
== range_true ());
2467 // Make sure NULL and non-NULL of pointer types work, and that
2468 // inverses of them are consistent.
2469 tree voidp
= build_pointer_type (void_type_node
);
2470 r0
= range_zero (voidp
);
2474 ASSERT_TRUE (r0
== r1
);
2476 // [10,20] U [15, 30] => [10, 30].
2477 r0
= range_int (10, 20);
2478 r1
= range_int (15, 30);
2480 ASSERT_TRUE (r0
== range_int (10, 30));
2482 // [15,40] U [] => [15,40].
2483 r0
= range_int (15, 40);
2484 r1
.set_undefined ();
2486 ASSERT_TRUE (r0
== range_int (15, 40));
2488 // [10,20] U [10,10] => [10,20].
2489 r0
= range_int (10, 20);
2490 r1
= range_int (10, 10);
2492 ASSERT_TRUE (r0
== range_int (10, 20));
2494 // [10,20] U [9,9] => [9,20].
2495 r0
= range_int (10, 20);
2496 r1
= range_int (9, 9);
2498 ASSERT_TRUE (r0
== range_int (9, 20));
2500 // [10,20] ^ [15,30] => [15,20].
2501 r0
= range_int (10, 20);
2502 r1
= range_int (15, 30);
2504 ASSERT_TRUE (r0
== range_int (15, 20));
2506 // Test the internal sanity of wide_int's wrt HWIs.
2507 ASSERT_TRUE (wi::max_value (TYPE_PRECISION (boolean_type_node
),
2508 TYPE_SIGN (boolean_type_node
))
2509 == wi::uhwi (1, TYPE_PRECISION (boolean_type_node
)));
2512 r0
= range_int (0, 0);
2513 ASSERT_TRUE (r0
.zero_p ());
2515 // Test nonzero_p().
2516 r0
= range_int (0, 0);
2518 ASSERT_TRUE (r0
.nonzero_p ());
2521 r0
= range_int (1, 1, VR_ANTI_RANGE
);
2523 r1
= range_int (3, 3, VR_ANTI_RANGE
);
2525 // vv = [0,0][2,2][4, MAX]
2526 int_range
<3> vv
= r0
;
2529 ASSERT_TRUE (vv
.contains_p (UINT (2)));
2530 ASSERT_TRUE (vv
.num_pairs () == 3);
2532 r0
= range_int (1, 1);
2533 // And union it with [0,0][2,2][4,MAX] multi range
2535 // The result should be [0,2][4,MAX], or ~[3,3] but it must contain 2
2536 ASSERT_TRUE (r0
.contains_p (INT (2)));
2540 range_tests_nonzero_bits ()
2542 int_range
<2> r0
, r1
;
2544 // Adding nonzero bits to a varying drops the varying.
2545 r0
.set_varying (integer_type_node
);
2546 r0
.set_nonzero_bits (INT (255));
2547 ASSERT_TRUE (!r0
.varying_p ());
2548 // Dropping the nonzero bits brings us back to varying.
2549 r0
.set_nonzero_bits (INT (-1));
2550 ASSERT_TRUE (r0
.varying_p ());
2552 // Test contains_p with nonzero bits.
2553 r0
.set_zero (integer_type_node
);
2554 ASSERT_TRUE (r0
.contains_p (INT (0)));
2555 ASSERT_FALSE (r0
.contains_p (INT (1)));
2556 r0
.set_nonzero_bits (INT (0xfe));
2557 ASSERT_FALSE (r0
.contains_p (INT (0x100)));
2558 ASSERT_FALSE (r0
.contains_p (INT (0x3)));
2560 // Union of nonzero bits.
2561 r0
.set_varying (integer_type_node
);
2562 r0
.set_nonzero_bits (INT (0xf0));
2563 r1
.set_varying (integer_type_node
);
2564 r1
.set_nonzero_bits (INT (0xf));
2566 ASSERT_TRUE (r0
.get_nonzero_bits () == 0xff);
2568 // Intersect of nonzero bits.
2569 r0
= range_int (0, 255);
2570 r0
.set_nonzero_bits (INT (0xfe));
2571 r1
.set_varying (integer_type_node
);
2572 r1
.set_nonzero_bits (INT (0xf0));
2574 ASSERT_TRUE (r0
.get_nonzero_bits () == 0xf0);
2576 // Intersect where the mask of nonzero bits is implicit from the range.
2577 r0
.set_varying (integer_type_node
);
2578 r1
= range_int (0, 255);
2580 ASSERT_TRUE (r0
.get_nonzero_bits () == 0xff);
2582 // The union of a mask of 0xff..ffff00 with a mask of 0xff spans the
2583 // entire domain, and makes the range a varying.
2584 r0
.set_varying (integer_type_node
);
2585 wide_int x
= wi::shwi (0xff, TYPE_PRECISION (integer_type_node
));
2586 x
= wi::bit_not (x
);
2587 r0
.set_nonzero_bits (x
); // 0xff..ff00
2588 r1
.set_varying (integer_type_node
);
2589 r1
.set_nonzero_bits (INT (0xff));
2591 ASSERT_TRUE (r0
.varying_p ());
2593 // Test that setting a nonzero bit of 1 does not pessimize the range.
2594 r0
.set_zero (integer_type_node
);
2595 r0
.set_nonzero_bits (INT (1));
2596 ASSERT_TRUE (r0
.zero_p ());
2599 // Build an frange from string endpoints.
2601 static inline frange
2602 frange_float (const char *lb
, const char *ub
, tree type
= float_type_node
)
2604 REAL_VALUE_TYPE min
, max
;
2605 gcc_assert (real_from_string (&min
, lb
) == 0);
2606 gcc_assert (real_from_string (&max
, ub
) == 0);
2607 return frange (type
, min
, max
);
2614 REAL_VALUE_TYPE q
, r
;
2617 // Equal ranges but with differing NAN bits are not equal.
2618 if (HONOR_NANS (float_type_node
))
2620 r1
= frange_float ("10", "12");
2628 // [10, 20] NAN ^ [30, 40] NAN = NAN.
2629 r0
= frange_float ("10", "20");
2630 r1
= frange_float ("30", "40");
2632 ASSERT_TRUE (r0
.known_isnan ());
2634 // [3,5] U [5,10] NAN = ... NAN
2635 r0
= frange_float ("3", "5");
2637 r1
= frange_float ("5", "10");
2639 ASSERT_TRUE (r0
.maybe_isnan ());
2642 // [5,6] U NAN = [5,6] NAN.
2643 r0
= frange_float ("5", "6");
2645 r1
.set_nan (float_type_node
);
2647 real_from_string (&q
, "5");
2648 real_from_string (&r
, "6");
2649 ASSERT_TRUE (real_identical (&q
, &r0
.lower_bound ()));
2650 ASSERT_TRUE (real_identical (&r
, &r0
.upper_bound ()));
2651 ASSERT_TRUE (r0
.maybe_isnan ());
2654 r0
.set_nan (float_type_node
);
2655 r1
.set_nan (float_type_node
);
2657 ASSERT_TRUE (r0
.known_isnan ());
2659 // [INF, INF] NAN ^ NAN = NAN
2660 r0
.set_nan (float_type_node
);
2661 r1
= frange_float ("+Inf", "+Inf");
2662 if (!HONOR_NANS (float_type_node
))
2665 ASSERT_TRUE (r0
.known_isnan ());
2668 r0
.set_nan (float_type_node
);
2669 r1
.set_nan (float_type_node
);
2671 ASSERT_TRUE (r0
.known_isnan ());
2673 // +NAN ^ -NAN = UNDEFINED
2674 r0
.set_nan (float_type_node
, false);
2675 r1
.set_nan (float_type_node
, true);
2677 ASSERT_TRUE (r0
.undefined_p ());
2679 // VARYING ^ NAN = NAN.
2680 r0
.set_nan (float_type_node
);
2681 r1
.set_varying (float_type_node
);
2683 ASSERT_TRUE (r0
.known_isnan ());
2685 // [3,4] ^ NAN = UNDEFINED.
2686 r0
= frange_float ("3", "4");
2688 r1
.set_nan (float_type_node
);
2690 ASSERT_TRUE (r0
.undefined_p ());
2692 // [-3, 5] ^ NAN = UNDEFINED
2693 r0
= frange_float ("-3", "5");
2695 r1
.set_nan (float_type_node
);
2697 ASSERT_TRUE (r0
.undefined_p ());
2699 // Setting the NAN bit to yes does not make us a known NAN.
2700 r0
.set_varying (float_type_node
);
2702 ASSERT_FALSE (r0
.known_isnan ());
2704 // NAN is in a VARYING.
2705 r0
.set_varying (float_type_node
);
2706 real_nan (&r
, "", 1, TYPE_MODE (float_type_node
));
2707 REAL_VALUE_TYPE nan
= r
;
2708 ASSERT_TRUE (r0
.contains_p (nan
));
2710 // -NAN is in a VARYING.
2711 r0
.set_varying (float_type_node
);
2712 q
= real_value_negate (&r
);
2713 REAL_VALUE_TYPE neg_nan
= q
;
2714 ASSERT_TRUE (r0
.contains_p (neg_nan
));
2716 // Clearing the NAN on a [] NAN is the empty set.
2717 r0
.set_nan (float_type_node
);
2719 ASSERT_TRUE (r0
.undefined_p ());
2721 // [10,20] NAN ^ [21,25] NAN = [NAN]
2722 r0
= frange_float ("10", "20");
2724 r1
= frange_float ("21", "25");
2727 ASSERT_TRUE (r0
.known_isnan ());
2729 // NAN U [5,6] should be [5,6] +-NAN.
2730 r0
.set_nan (float_type_node
);
2731 r1
= frange_float ("5", "6");
2734 real_from_string (&q
, "5");
2735 real_from_string (&r
, "6");
2736 ASSERT_TRUE (real_identical (&q
, &r0
.lower_bound ()));
2737 ASSERT_TRUE (real_identical (&r
, &r0
.upper_bound ()));
2738 ASSERT_TRUE (!r0
.signbit_p (signbit
));
2739 ASSERT_TRUE (r0
.maybe_isnan ());
2741 // NAN U NAN shouldn't change anything.
2742 r0
.set_nan (float_type_node
);
2743 r1
.set_nan (float_type_node
);
2744 ASSERT_FALSE (r0
.union_ (r1
));
2746 // [3,5] NAN U NAN shouldn't change anything.
2747 r0
= frange_float ("3", "5");
2748 r1
.set_nan (float_type_node
);
2749 ASSERT_FALSE (r0
.union_ (r1
));
2751 // [3,5] U NAN *does* trigger a change.
2752 r0
= frange_float ("3", "5");
2754 r1
.set_nan (float_type_node
);
2755 ASSERT_TRUE (r0
.union_ (r1
));
2759 range_tests_signed_zeros ()
2761 REAL_VALUE_TYPE zero
= dconst0
;
2762 REAL_VALUE_TYPE neg_zero
= zero
;
2767 // [0,0] contains [0,0] but not [-0,-0] and vice versa.
2768 r0
= frange_float ("0.0", "0.0");
2769 r1
= frange_float ("-0.0", "-0.0");
2770 ASSERT_TRUE (r0
.contains_p (zero
));
2771 ASSERT_TRUE (!r0
.contains_p (neg_zero
));
2772 ASSERT_TRUE (r1
.contains_p (neg_zero
));
2773 ASSERT_TRUE (!r1
.contains_p (zero
));
2775 // Test contains_p() when we know the sign of the zero.
2776 r0
= frange_float ("0.0", "0.0");
2777 ASSERT_TRUE (r0
.contains_p (zero
));
2778 ASSERT_FALSE (r0
.contains_p (neg_zero
));
2779 r0
= frange_float ("-0.0", "-0.0");
2780 ASSERT_TRUE (r0
.contains_p (neg_zero
));
2781 ASSERT_FALSE (r0
.contains_p (zero
));
2783 r0
= frange_float ("-0.0", "0.0");
2784 ASSERT_TRUE (r0
.contains_p (neg_zero
));
2785 ASSERT_TRUE (r0
.contains_p (zero
));
2787 r0
= frange_float ("-3", "5");
2788 ASSERT_TRUE (r0
.contains_p (neg_zero
));
2789 ASSERT_TRUE (r0
.contains_p (zero
));
2791 // The intersection of zeros that differ in sign is a NAN (or
2792 // undefined if not honoring NANs).
2793 r0
= frange_float ("-0.0", "-0.0");
2794 r1
= frange_float ("0.0", "0.0");
2796 if (HONOR_NANS (float_type_node
))
2797 ASSERT_TRUE (r0
.known_isnan ());
2799 ASSERT_TRUE (r0
.undefined_p ());
2801 // The union of zeros that differ in sign is a zero with unknown sign.
2802 r0
= frange_float ("0.0", "0.0");
2803 r1
= frange_float ("-0.0", "-0.0");
2805 ASSERT_TRUE (r0
.zero_p () && !r0
.signbit_p (signbit
));
2807 // [-0, +0] has an unknown sign.
2808 r0
= frange_float ("-0.0", "0.0");
2809 ASSERT_TRUE (r0
.zero_p () && !r0
.signbit_p (signbit
));
2811 // [-0, +0] ^ [0, 0] is [0, 0]
2812 r0
= frange_float ("-0.0", "0.0");
2813 r1
= frange_float ("0.0", "0.0");
2815 ASSERT_TRUE (r0
.zero_p ());
2817 r0
= frange_float ("+0", "5");
2819 ASSERT_TRUE (r0
.signbit_p (signbit
) && !signbit
);
2821 r0
= frange_float ("-0", "5");
2823 ASSERT_TRUE (!r0
.signbit_p (signbit
));
2825 r0
= frange_float ("-0", "10");
2826 r1
= frange_float ("0", "5");
2828 ASSERT_TRUE (real_iszero (&r0
.lower_bound (), false));
2830 r0
= frange_float ("-0", "5");
2831 r1
= frange_float ("0", "5");
2833 ASSERT_TRUE (real_iszero (&r0
.lower_bound (), true));
2835 r0
= frange_float ("-5", "-0");
2837 r1
= frange_float ("0", "0");
2840 if (HONOR_NANS (float_type_node
))
2841 ASSERT_TRUE (r0
.known_isnan ());
2843 ASSERT_TRUE (r0
.undefined_p ());
2845 r0
.set_nonnegative (float_type_node
);
2846 if (HONOR_NANS (float_type_node
))
2847 ASSERT_TRUE (r0
.maybe_isnan ());
2849 // Numbers containing zero should have an unknown SIGNBIT.
2850 r0
= frange_float ("0", "10");
2852 ASSERT_TRUE (r0
.signbit_p (signbit
) && !signbit
);
2856 range_tests_signbit ()
2861 // Negative numbers should have the SIGNBIT set.
2862 r0
= frange_float ("-5", "-1");
2864 ASSERT_TRUE (r0
.signbit_p (signbit
) && signbit
);
2865 // Positive numbers should have the SIGNBIT clear.
2866 r0
= frange_float ("1", "10");
2868 ASSERT_TRUE (r0
.signbit_p (signbit
) && !signbit
);
2869 // Numbers spanning both positive and negative should have an
2871 r0
= frange_float ("-10", "10");
2873 ASSERT_TRUE (!r0
.signbit_p (signbit
));
2874 r0
.set_varying (float_type_node
);
2875 ASSERT_TRUE (!r0
.signbit_p (signbit
));
2879 range_tests_floats ()
2883 if (HONOR_NANS (float_type_node
))
2885 range_tests_signbit ();
2887 if (HONOR_SIGNED_ZEROS (float_type_node
))
2888 range_tests_signed_zeros ();
2890 // A range of [-INF,+INF] is actually VARYING if no other properties
2892 r0
= frange_float ("-Inf", "+Inf");
2893 ASSERT_TRUE (r0
.varying_p ());
2894 // ...unless it has some special property...
2895 if (HONOR_NANS (r0
.type ()))
2898 ASSERT_FALSE (r0
.varying_p ());
2901 // For most architectures, where float and double are different
2902 // sizes, having the same endpoints does not necessarily mean the
2903 // ranges are equal.
2904 if (!types_compatible_p (float_type_node
, double_type_node
))
2906 r0
= frange_float ("3.0", "3.0", float_type_node
);
2907 r1
= frange_float ("3.0", "3.0", double_type_node
);
2911 // [3,5] U [10,12] = [3,12].
2912 r0
= frange_float ("3", "5");
2913 r1
= frange_float ("10", "12");
2915 ASSERT_EQ (r0
, frange_float ("3", "12"));
2917 // [5,10] U [4,8] = [4,10]
2918 r0
= frange_float ("5", "10");
2919 r1
= frange_float ("4", "8");
2921 ASSERT_EQ (r0
, frange_float ("4", "10"));
2923 // [3,5] U [4,10] = [3,10]
2924 r0
= frange_float ("3", "5");
2925 r1
= frange_float ("4", "10");
2927 ASSERT_EQ (r0
, frange_float ("3", "10"));
2929 // [4,10] U [5,11] = [4,11]
2930 r0
= frange_float ("4", "10");
2931 r1
= frange_float ("5", "11");
2933 ASSERT_EQ (r0
, frange_float ("4", "11"));
2935 // [3,12] ^ [10,12] = [10,12].
2936 r0
= frange_float ("3", "12");
2937 r1
= frange_float ("10", "12");
2939 ASSERT_EQ (r0
, frange_float ("10", "12"));
2941 // [10,12] ^ [11,11] = [11,11]
2942 r0
= frange_float ("10", "12");
2943 r1
= frange_float ("11", "11");
2945 ASSERT_EQ (r0
, frange_float ("11", "11"));
2947 // [10,20] ^ [5,15] = [10,15]
2948 r0
= frange_float ("10", "20");
2949 r1
= frange_float ("5", "15");
2951 ASSERT_EQ (r0
, frange_float ("10", "15"));
2953 // [10,20] ^ [15,25] = [15,20]
2954 r0
= frange_float ("10", "20");
2955 r1
= frange_float ("15", "25");
2957 ASSERT_EQ (r0
, frange_float ("15", "20"));
2959 // [10,20] ^ [21,25] = []
2960 r0
= frange_float ("10", "20");
2962 r1
= frange_float ("21", "25");
2965 ASSERT_TRUE (r0
.undefined_p ());
2967 if (HONOR_INFINITIES (float_type_node
))
2969 // Make sure [-Inf, -Inf] doesn't get normalized.
2970 r0
= frange_float ("-Inf", "-Inf");
2971 ASSERT_TRUE (real_isinf (&r0
.lower_bound (), true));
2972 ASSERT_TRUE (real_isinf (&r0
.upper_bound (), true));
2975 // Test that reading back a global range yields the same result as
2976 // what we wrote into it.
2977 tree ssa
= make_temp_ssa_name (float_type_node
, NULL
, "blah");
2978 r0
.set_varying (float_type_node
);
2980 set_range_info (ssa
, r0
);
2981 get_global_range_query ()->range_of_expr (r1
, ssa
);
2985 // Run floating range tests for various combinations of NAN and INF
2989 range_tests_floats_various ()
2991 int save_finite_math_only
= flag_finite_math_only
;
2993 // Test -ffinite-math-only.
2994 flag_finite_math_only
= 1;
2995 range_tests_floats ();
2996 // Test -fno-finite-math-only.
2997 flag_finite_math_only
= 0;
2998 range_tests_floats ();
3000 flag_finite_math_only
= save_finite_math_only
;
3006 range_tests_irange3 ();
3007 range_tests_int_range_max ();
3008 range_tests_strict_enum ();
3009 range_tests_nonzero_bits ();
3010 range_tests_floats_various ();
3011 range_tests_misc ();
3014 } // namespace selftest
3016 #endif // CHECKING_P