Lines Matching refs:d6
149 mov.l 0x10(%a6), %d6 # get dividend lo
170 negx.l %d6 # complement signed dividend
180 tst.l %d6 # is (lo(dividend) == 0), too
183 cmp.l %d7,%d6 # is (divisor <= lo(dividend))
186 exg %d5,%d6 # q = 0, r = dividend
190 tdivu.l %d7, %d5:%d6 # it's only a 32/32 bit div!
219 cmpi.l %d6, &0x80000000 # will (-quot) fit in 32 bits?
222 neg.l %d6 # make (-quot) 2's comp
227 btst &0x1f, %d6 # will (+quot) fit in 32 bits?
235 tst.l %d6 # may set 'N' ccode bit
254 mov.l 0x10(%a6), %d6 # get dividend lo
286 # in %d6. The divisor must be in the variable ddivisor, and the #
288 # The quotient is returned in %d6, remainder in %d5, unless the #
310 swap %d6 # get u3 to lsw position
311 mov.w %d6, %d5 # rb + u3
316 swap %d6 # get u4
317 mov.w %d6, %d5 # rb + u4
325 mov.l %d1, %d6 # and quotient
345 lsl.l &0x1, %d6 # shift u4,u3 with overflow to u2
371 mov.l %d6, -(%sp)
372 clr.w %d6 # word u3 left
373 swap %d6 # in lsw position
385 mov.w %d6,%d4 # insert lower word (U3)
390 # add.l %d6, %d4 # (U1U2 - V1q) + U3
399 mov.l %d5, -(%sp) # save %d5 (%d6 already saved)
400 mov.l %d1, %d6
401 swap %d6 # shift answer to ms 3 words
405 mov.l %d6, %d3
407 mov.l (%sp)+, %d6
408 sub.l %d3, %d6
419 add.l %d3, %d6 # aligned with 3rd word of dividend
433 swap %d6
434 mov.w %d6, %d5
435 clr.w %d6
442 mov.w %d5, %d6
443 swap %d6
449 lsr.l &0x1, %d5 # shift into %d6
450 roxr.l &0x1, %d6
453 mov.l %d6, %d5 # remainder
454 mov.l DDQUOTIENT(%a6), %d6 # quotient
458 # factors for the 32X32->64 multiplication are in %d5 and %d6.
459 # returns 64 bit result in %d5 (hi) %d6(lo).
463 mov.l %d6, %d2
464 mov.l %d6, %d3
468 mulu.w %d5, %d6 # %d6 <- lsw*lsw
474 swap %d6
475 add.w %d5, %d6 # add msw of l*l to lsw of m*l product
477 add.w %d2, %d6 # add in lsw of other m*l product
479 swap %d6 # %d6 is low 32 bits of final product
Indexes created Tue Oct 28 12:10:06 GMT 2025