diff options
| author | Aldy Hernandez <aldyh@redhat.com> | 2021-04-17 14:24:15 +0200 |
|---|---|---|
| committer | Aldy Hernandez <aldyh@redhat.com> | 2021-04-26 15:42:50 +0200 |
| commit | 778032166d960d97541e652c59684d1187d0233c (patch) | |
| tree | f1308637d63494986959d0346435372079fc082a /gcc/value-range.h | |
| parent | 6ff66d1ea48960fe96bb51a750c01135e65fe452 (diff) | |
| download | gcc-778032166d960d97541e652c59684d1187d0233c.zip gcc-778032166d960d97541e652c59684d1187d0233c.tar.gz gcc-778032166d960d97541e652c59684d1187d0233c.tar.bz2 | |
Replace !irange::undefined_p checks with num_ranges > 0 for readability.
A few of the undefined_p checks in the irange code are really checking if
there are sub-ranges. It just so happens that undefined_p is
implemented with num_ranges > 0, so it was a shorthand used throughout.
This shorthand was making the code unreadable.
gcc/ChangeLog:
* value-range.cc (irange::legacy_lower_bound): Replace
!undefined_p check with num_ranges > 0.
(irange::legacy_upper_bound): Same.
* value-range.h (irange::type): Same.
(irange::lower_bound): Same.
(irange::upper_bound): Same.
Diffstat (limited to 'gcc/value-range.h')
| -rw-r--r-- | gcc/value-range.h | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/gcc/value-range.h b/gcc/value-range.h index bfc54a24..bb27e70 100644 --- a/gcc/value-range.h +++ b/gcc/value-range.h @@ -224,7 +224,7 @@ irange::num_pairs () const inline tree irange::type () const { - gcc_checking_assert (!undefined_p ()); + gcc_checking_assert (m_num_ranges > 0); return TREE_TYPE (m_base[0]); } @@ -501,7 +501,7 @@ irange::lower_bound (unsigned pair) const { if (legacy_mode_p ()) return legacy_lower_bound (pair); - gcc_checking_assert (!undefined_p ()); + gcc_checking_assert (m_num_ranges > 0); gcc_checking_assert (pair + 1 <= num_pairs ()); return wi::to_wide (tree_lower_bound (pair)); } @@ -514,7 +514,7 @@ irange::upper_bound (unsigned pair) const { if (legacy_mode_p ()) return legacy_upper_bound (pair); - gcc_checking_assert (!undefined_p ()); + gcc_checking_assert (m_num_ranges > 0); gcc_checking_assert (pair + 1 <= num_pairs ()); return wi::to_wide (tree_upper_bound (pair)); } |