Is there a way of generating code for x/const without division?

I've been playing with a simple code generator for RISC CPUs. One of the
simple peephole optimisations it does is to replace multiplies by
constants with a series of shift/adds rather than using the general
multiplication.


I'm wondering whether a similar thing can be done for divide and modulo,
such that they are implemented by the code generator as a sequence of
simple instructions that is more efficient (in time) than the more general
way of performing divide/modulo.


Thanks,
Jeremy.


--
jeremy@softway.sw.oz.au ph:+61 2 698 2322-x122 fax:+61 2 699 9174
[I'd think that in most cases it should be possible to do as multiplication
if you can construct multiplies that discard one or the other half of the
product. -John]
--

Return to the comp.compilers page.
Search the comp.compilers archives again.