https://gcc.gnu.org/bugzilla/show_bug.cgi?id=82853
Alexander Monakov <amonakov at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
CC| |amonakov at gcc dot gnu.org
--- Comment #17 from Alexander Monakov <amonakov at gcc dot gnu.org> ---
(In reply to Jakub Jelinek from comment #16)
> For unsigned x % y == z if y is odd constant we can handle it for any
> constant z, by computing m = mul_inv (y, 2^prec) and d = (2^prec / y) and
> using x * m - (z * m) < d .
Is that preferable to testing (x - z) % y == 0? Why?
