https://gcc.gnu.org/bugzilla/show_bug.cgi?id=96697
Jakub Jelinek <jakub at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
CC| |amacleod at redhat dot com,
| |jakub at gcc dot gnu.org
--- Comment #2 from Jakub Jelinek <jakub at gcc dot gnu.org> ---
Shall we do that as a specific matcher or e.g. in the ranger once it gets code
for symbolic comparisons? I mean, for signed t = x % y note that t is in [-y +
1, y + 1] and on the division use that information to determine the division
result range to be [0, 0] ?
It could then handle even e.g. ((unsigned) x % y) / (y + 32) for signed y etc.
