[A83] Re: 1 byte division routine


[Prev][Next][Index][Thread]

[A83] Re: 1 byte division routine




> Which routine is much slower for small divisors?  The 
routine I wrote is
> similar to the ROM one, with the same kind of effects.  
And what I put as
> the highest value for the ROM is the worst case, dividing 
65535 by 1,
> where it will do the sub c and inc l for each loop, 
taking 748 clock
> cycles then.  Thus I don't see what is so good about the 
1000 cycles
> routine you mentioned (which takes more cycles in each 
include of the
> math_d than the ROM one does in each cycles through the 
loop regardless of
> data).
Hmmm, which routine is that exactly?

PG






References: