--- Comment #1 from Marc Glisse <glisse at gcc dot> ---
To simplify 1/n to 0, we would have to notice that n cannot be ±1 (the last bit
is zero since n is 2*x2), and it cannot be 0 either in that division. That
seems quite specialized, but rather easy to add to match.pd using
get_nonzero_bits if someone wants to write it... Is there anything more general
that can be done based on that?

Reply via email to