https://gcc.gnu.org/bugzilla/show_bug.cgi?id=72443
Andrew Pinski <pinskia at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
Last reconfirmed|2016-07-26 00:00:00 |2021-7-20
Severity|normal |enhancement
Keywords| |missed-optimization
--- Comment #3 from Andrew Pinski <pinskia at gcc dot gnu.org> ---
(In reply to Richard Biener from comment #2)
> Sth that would greatly simplify VRP (IMHO) is to dump anti-ranges from the
> range representation and instead have the lattice value be composed of
> the union of two ranges (that's more powerful for ranges _and_ it can
> represent all anti-ranges) [just make it the union of N ranges with N
> being configurable - it might be possible to ditch equivalences on the
> way though they compose the range as intersections of N ranges]
I noticed the ranger work has that implemented.
