Lines Matching refs:d0
203 mov.b NDIVISOR(%a6), %d0
204 eor.b %d0, NDIVIDEND(%a6) # chk if quotient is negative
227 # here, the result is in d1 and d0. the current strategy is to save
264 divu.w &0x0,%d0 # force a divbyzero exception
374 mov.w %d4,%d0
377 tst.w %d0 # is upper word set?
519 mov.l 0x8(%a6),%d0 # store multiplier in d0
546 mov.l %d0,%d2 # mr in d2
547 mov.l %d0,%d3 # mr in d3
553 mulu.w %d1,%d0 # [1] lo(mr) * lo(md)
562 swap %d0 # hi([1]) <==> lo([1])
563 add.w %d1,%d0 # hi([1]) + lo([2])
565 add.w %d2,%d0 # hi([1]) + lo([3])
567 swap %d0 # lo([1]) <==> hi([1])
588 # here, the result is in d1 and d0. the current strategy is to save
592 exg %d1,%d0
606 clr.l %d0
630 mov.l 0x8(%a6),%d0 # store multiplier in d0
637 tst.l %d0 # is multiplier negative?
639 neg.l %d0 # make multiplier positive
672 mov.l %d0,%d2 # mr in d2
673 mov.l %d0,%d3 # mr in d3
679 mulu.w %d1,%d0 # [1] lo(mr) * lo(md)
688 swap %d0 # hi([1]) <==> lo([1])
689 add.w %d1,%d0 # hi([1]) + lo([2])
691 add.w %d2,%d0 # hi([1]) + lo([3])
693 swap %d0 # lo([1]) <==> hi([1])
711 not.l %d0 # negate lo(result) bits
713 addq.l &1,%d0 # add 1 to lo(result)
725 # here, the result is in d1 and d0. the current strategy is to save
729 exg %d1,%d0
743 clr.l %d0
800 mov.b ([0xc,%a6],0x0),%d0
803 extb.l %d0 # sign extend lo bnd
819 mov.w ([0xc,%a6],0x0),%d0
822 ext.l %d0 # sign extend lo bnd
838 mov.l ([0xc,%a6],0x0),%d0
854 mov.b ([0xc,%a6],0x0),%d0
857 extb.l %d0 # sign extend lo bnd
877 mov.w ([0xc,%a6],0x0),%d0
880 ext.l %d0 # sign extend lo bnd
900 mov.l ([0xc,%a6],0x0),%d0
911 sub.l %d0, %d2 # (Rn - lo)
914 sub.l %d0, %d1 # (hi - lo)