div by 10 on Z80 was RE: Reading Polymorphic ---

From: dkelvey at hotmail.com Hi Chuck I'm not sure how effective that would be in Z80 code. It looks like I'd at least need to do 32 bit coding to keep track of things. I'd still need to calculate the remainder when done( I need both ). The maximum sector index would be 800 decimal. I came up with the following code to do this all in Z80 code but I'm interested both compact and fast, with more emphasis on compact. Here is the code I've made so far: ; hl is value to be divided by 10 ; max hl will be 800 ; uses a, bc, de and hl ; returns a = quotient ; h = remainder ; uses 42 bytes div10: xor a ld bc -640d ld de 640d call div10s call div10s call div10s call div10s call div10s call div10s call div10s add hl,hl ret div10s: add a,a add hl,bc jp c,div10s1 add hl,de jp div10s2 div10s1: inc a div10s2: add hl,hl ret After the first two calls, I could do the rest as byte operations but I think the total byte cost would be greater. I'm looking for other ideas on smaller code. It would be nice to hace one more 8 bit register as a counter. Dwight