Lines Matching refs:divisor
74 # 0x4(sp) = divisor #
89 # codes before performing the final "rts". If the divisor was equal to #
134 mov.l 0x8(%a6),%d7 # fetch divisor
136 beq.w ldiv64eq0 # divisor is = 0!!!
145 # save the sign of the divisor
146 # make divisor unsigned if it's negative
165 # - is (hi(dividend) == 0 && (divisor <= lo(dividend))) ? (32-bit div)
173 cmp.l %d7,%d6 # is (divisor <= lo(dividend))
272 # where U,V are words of the quadword dividend and longword divisor, #
276 # in %d6. The divisor must be in the variable ddivisor, and the #
283 # if the divisor msw is 0, use simpler algorithm then the full blown
289 # Since the divisor is only a word (and larger than the mslw of the dividend),
292 # dividing the divisor word into each dividend word. In this case,
320 # In this algorithm, the divisor is treated as a 2 digit (word) number
323 # process repeated. Before beginning, the divisor and quotient are
332 bne.b lddnormalized # divisor (V1) must be >= 65536/2
334 lsl.l &0x1, %d7 # shift the divisor
342 mov.l %d7, %d3 # divisor
387 # now test the word by multiplying it by the divisor (V1V2) and comparing
394 mov.l %d5, %d2 # now %d2,%d3 are trial*divisor
402 # need to add back divisor longword to current ms 3 digits of dividend
404 # divisor, dividend selection.
408 clr.w %d3 # %d3 now ls word of divisor
412 clr.w %d3 # %d3 now ms word of divisor