https://gcc.gnu.org/bugzilla/show_bug.cgi?id=97738
Richard Biener <rguenth at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
Keywords| |missed-optimization
Component|rtl-optimization |middle-end
--- Comment #1 from Richard Biener <rguenth at gcc dot gnu.org> ---
OK, guess that we should see to replace
x / y
with y known to have exactly one bit set to
x >> (ctz (y) + 1)
note I'm quite sure this isn't faster for all power-of-two y.
It's also not canonically simpler. In the end sth for
instruction selection / RTL expansion I guess.
