Lines Matching refs:quotient
2080 # quotient and remainder in the appropriate data registers on the stack.#
2184 eor.b %d0, NDIVIDEND(%a6) # chk if quotient is negative
2209 quotient gets saved.
2210 # so, if we always save the quotient second, we save ourselves a cmp&beq
2212 mov.l %d6, (EXC_DREGS,%a6,%d1.w*4) # save quotient
2238 # The quotient is returned in %d6, remainder in %d5, unless the #
2251 # In the general case, four quotient words would be created by
2253 # the first two quotient words must be zero, or overflow would occur.
2256 # the last two divisions to get a quotient longword and word remainder:
2265 mov.w %d5, %d1 # first quotient word
2272 mov.w %d5, %d1 # 2nd quotient 'digit'
2275 mov.l %d1, %d6 # and quotient
2281 # which is divided into a 3 digit (word) dividend to get one quotient
2283 # process repeated. Before beginning, the divisor and quotient are
2284 # 'normalized' so that the process of estimating the quotient digit
2288 clr.b DDSECOND(%a6) # clear flag for quotient digits
2289 clr.l %d1 # %d1 will hold trial quotient
2300 # Now calculate an estimate of the quotient words (msw first, then lsw).
2301 # The comments use subscripts for the first quotient digit determination.
2308 mov.w &0xffff, %d1 # use max trial quotient word
2313 divu.w %d3, %d1 # use quotient of mslw/msw
2318 # now test the trial quotient and adjust. This step plus the
2320 # quotient will be at worst 1 too large.
2360 bcc dd2nd # no carry, do next quotient digit
2378 # first quotient digit now correct. store digit and shift the
2389 # add 2nd word to quotient, get the remainder.
2404 mov.l DDQUOTIENT(%a6), %d6 # quotient