/ Unsigned long quotient .globl auldiv .globl csv, cret auldiv: jsr r5,csv tst 6.(r5) bne hardldiv mov 8.(r5),r3 bmi hardldiv mov 4(r5),r1 mov 2(r1),r2 mov (r1),r1 bmi hardest clr r0 div r3,r0 mov r0,r4 /high quotient mov r1,r0 mov r2,r1 div r3,r0 bvc 1f sub r3,r0 / this is the clever part div r3,r0 tst r1 sxt r1 add r1,r0 / cannot overflow! 1: mov 4.(r5),r2 mov r4,(r2)+ mov r0,(r2) jmp cret / The divisor is known to be >= 2^15 so only 16 cycles are needed. hardldiv: mov 4.(r5),r0 mov 2(r0),r2 mov (r0),r1 clr r0 mov 6.(r5),r3 mov $16.,r4 1: clc rol r2 rol r1 rol r0 cmp r3,r0 bhi 3f blo 2f cmp 8.(r5),r1 blos 2f 3: sob r4,1b br 1f 2: sub 8.(r5),r1 sbc r0 sub r3,r0 inc r2 sob r4,1b 1: mov 4.(r5),r3 clr (r3)+ mov r2,(r3) jmp cret / The dividend is known to be >= 2^31 so 32 cycles are needed. hardest: mov 4.(r5),r0 mov 2(r0),r3 mov (r0),r2 clr r1 clr r0 mov $32.,r4 1: clc rol r3 rol r2 rol r1 rol r0 cmp 6.(r5),r0 bhi 3f blo 2f cmp 8.(r5),r1 blos 2f 3: sob r4,1b br 1f 2: sub 8.(r5),r1 sbc r0 sub 6.(r5),r0 inc r3 sob r4,1b 1: mov 4.(r5),r0 mov r2,(r0)+ mov r3,(r0) jmp cret