2 * Division and remainder, from Appendix E of the Sparc Version 8
3 * Architecture Manual, with fixes from Gordon Irlam.
7 * Input: dividend and divisor in %o0 and %o1 respectively.
10 * NAME name of function to generate
11 * OP OP=div => %o0 / %o1; OP=rem => %o0 % %o1
12 * S S=true => signed; S=false => unsigned
14 * Algorithm parameters:
15 * N how many bits per iteration we try to get (4)
16 * WORDSIZE total number of bits (32)
19 * TOPBITS number of bits in the top `decade' of a number
21 * Important variables:
22 * Q the partial quotient under development (initially 0)
23 * R the remainder so far, initially the dividend
24 * ITER number of main division loop iterations required;
25 * equal to ceil(log2(quotient) / N). Note that this
26 * is the log base (2^N) of the quotient.
27 * V the current comparand, initially divisor*2^(ITER*N-1)
30 * Current estimate for non-large dividend is
31 * ceil(log2(quotient) / N) * (10 + 7N/2) + C
32 * A large dividend is one greater than 2^(31-TOPBITS) and takes a
33 * different path, as the upper bits of the quotient must be developed
38 define(WORDSIZE, `32')dnl
39 define(TOPBITS, eval(WORDSIZE - N*((WORDSIZE-1)/N)))dnl
41 define(dividend, `%o0')dnl
42 define(divisor, `%o1')dnl
45 define(ITER, `%o4')dnl
48 dnl m4 reminder: ifelse(a,b,c,d) => if a is b, then c, else d
51 ifelse(S, `true', `define(SIGN, `%g6')')dnl
54 dnl This is the recursive definition for developing quotient digits.
57 dnl $1 the current depth, 1 <= $1 <= N
58 dnl $2 the current accumulation of quotient bits
61 dnl We add a new bit to $2 and either recurse or insert the bits in
62 dnl the quotient. R, Q, and V are inputs and outputs as defined above;
63 dnl the condition codes are expected to reflect the input R, and are
64 dnl modified to reflect the output R.
66 define(DEVELOP_QUOTIENT_BITS,
67 ` ! depth $1, accumulated bits $2
70 ! remainder is positive
75 ', ` DEVELOP_QUOTIENT_BITS(incr($1), `eval(2*$2+1)')')
77 ! remainder is negative
82 ', ` DEVELOP_QUOTIENT_BITS(incr($1), `eval(2*$2-1)')')
83 ifelse($1, 1, `9:')')dnl
87 #include <asm/traps.h>
92 #include <machine/trap.h>
98 ` ! compute sign of result; if neither is negative, no problem
99 orcc divisor, dividend, %g0 ! either negative?
100 bge 2f ! no, go do the divide
102 ` xor divisor, dividend, SIGN ! compute sign in any case',
103 ` mov dividend, SIGN ! sign of remainder matches dividend')
107 ! divisor is definitely negative; dividend might also be negative
108 bge 2f ! if dividend not negative...
109 sub %g0, divisor, divisor ! in any case, make divisor nonneg
110 1: ! dividend is negative, divisor is nonnegative
111 sub %g0, dividend, dividend ! make dividend nonnegative
114 ! Ready to divide. Compute size of quotient; scale comparand.
119 ! Divide by zero trap. If it returns, return 0 (about as
120 ! wrong as possible, but that is what SunOS does...).
126 cmp R, V ! if divisor exceeds dividend, done
127 blu Lgot_result ! (and algorithm fails otherwise)
129 sethi %hi(1 << (WORDSIZE - TOPBITS - 1)), T
134 ! `Here the dividend is >= 2**(31-N) or so. We must be careful here,
135 ! as our usual N-at-a-shot divide step will cause overflow and havoc.
136 ! The number of bits in the result here is N*ITER+SC, where SC <= N.
137 ! Compute ITER in an unorthodox manner: know we need to shift V into
138 ! the top decade: so do not even bother to compare to R.'
152 ! We get here if the divisor overflowed while shifting.
153 ! This means that R has the high-order bit set.
154 ! Restore V and subtract from R.
155 sll T, TOPBITS, T ! high order bit
156 srl V, 1, V ! rest of V
167 /* NB: these are commented out in the V8-Sparc manual as well */
168 /* (I do not understand this) */
169 ! V > R: went too far: back up 1 step
172 ! do single-bit divide steps
174 ! We have to be careful here. We know that R >= V, so we can do the
175 ! first divide step without thinking. BUT, the others are conditional,
176 ! and are only done if R >= 0. Because both R and V may have the high-
177 ! order bit set in the first step, just falling into the regular
178 ! division loop will mess up the first time around.
179 ! So we unroll slightly...
182 bl Lend_regular_divide
186 b Lend_single_divloop
204 b,a Lend_regular_divide
215 tst R ! set up for initial iteration
218 DEVELOP_QUOTIENT_BITS(1, 0)
224 ! non-restoring fixup here (one instruction only!)
227 ', ` add R, divisor, R
232 ` ! check to see if answer should be < 0
235 ifelse(OP, `div', `sub %g0, Q, Q', `sub %g0, R, R')
238 ifelse(OP, `div', `mov Q, %o0', `mov R, %o0')