Lines Matching full:d5
138 mov.l 0xc(%a6), %d5 # get dividend hi
155 tst.l %d5 # chk sign of hi(dividend)
161 negx.l %d5
167 tst.l %d5 # is (hi(dividend) == 0)
176 exg %d5,%d6 # q = 0, r = dividend
180 tdivu.l %d7, %d5:%d6 # it's only a 32/32 bit div!
187 cmp.l %d7,%d5
201 neg.l %d5 # sgn(rem) = sgn(dividend)
243 mov.l 0xc(%a6), %d5 # get dividend hi
275 # The most sig. longword of the 64 bit dividend must be in %d5, least #
278 # The quotient is returned in %d6, remainder in %d5, unless the #
299 swap %d5 # same as r*b if previous step rqd
301 mov.w %d6, %d5 # rb + u3
303 divu.w %d7, %d5
305 mov.w %d5, %d1 # first quotient word
307 mov.w %d6, %d5 # rb + u4
309 divu.w %d7, %d5
312 mov.w %d5, %d1 # 2nd quotient 'digit'
313 clr.w %d5
314 swap %d5 # now remainder
336 roxl.l &0x1, %d5 # shift u1,u2
343 mov.l %d5, %d2 # dividend mslw
351 mov.l %d5, %d1
369 mov.l %d5, %d4 # U1U2
389 mov.l %d5, -(%sp) # save %d5 (%d6 already saved)
392 mov.l %d7, %d5
394 mov.l %d5, %d2 # now %d2,%d3 are trial*divisor
396 mov.l (%sp)+, %d5 # restore dividend
399 subx.l %d2, %d5 # subtract double precision
410 addx.l %d2, %d5
414 add.l %d3, %d5
422 swap %d5
424 mov.w %d6, %d5
432 mov.w %d5, %d6
434 swap %d5
439 lsr.l &0x1, %d5 # shift into %d6
443 mov.l %d6, %d5 # remainder
448 # factors for the 32X32->64 multiplication are in %d5 and %d6.
449 # returns 64 bit result in %d5 (hi) %d6(lo).
455 mov.l %d5, %d4
458 mulu.w %d5, %d6 # %d6 <- lsw*lsw
459 mulu.w %d3, %d5 # %d5 <- msw-dest*lsw-source
465 add.w %d5, %d6 # add msw of l*l to lsw of m*l product
470 clr.w %d5
472 swap %d5 # now use msws of longwords
474 add.l %d2, %d5
475 add.l %d3, %d5 # %d5 now ms 32 bits of final product
624 movm.l &0x3c00,-(%sp) # save d2-d5
636 clr.b %d5 # clear sign tag
641 ori.b &0x1,%d5 # save multiplier sgn
649 eori.b &0x1,%d5 # calculate correct sign
704 tst.b %d5 # should result be signed?
734 movm.l (%sp)+,&0x003c # restore d2-d5