https://gcc.gnu.org/bugzilla/show_bug.cgi?id=94802
--- Comment #6 from Richard Biener <rguenth at gcc dot gnu.org> --- We can't really hash them the same but what is possible is at elimination time see whether x - y is available when x >= y is encountered and replace the latter with avail >= 0. If x - y is not available at the point x>= y is computed (but only later) then I fear we cannot do this since computing x - y before might overflow.
