Lines Matching defs:and

9 THE SOFTWARE is provided on an "AS IS" basis and without warranty.
13 and any warranty against infringement with regard to the SOFTWARE
14 (INCLUDING ANY MODIFIED VERSIONS THEREOF) and any accompanying written materials.
21 Motorola assumes no responsibility for the maintenance and support of the SOFTWARE.
23 You are hereby granted a copyright license to use, modify, and distribute the SOFTWARE
24 so long as this entire notice is retained without alteration in any modified and/or
25 redistributed versions, and that such modified versions are clearly identified as such.
31 # and contains the entry points into the package. The user, in
67 # and therefore does not work exactly like the 680X0 div{s,u}.l #
84 # If the operands are signed, make them unsigned and save the #
141 # separate signed and unsigned divide
193 # separate into signed and unsigned finishes.
227 # here, the result is in d1 and d0. the current strategy is to save
271 # For this implementation b=2**16, and the target is U1U2U3U4/V1V2, #
272 # where U,V are words of the quadword dividend and longword divisor, #
273 # and U1, V1 are the most significant words. #
276 # in %d6. The divisor must be in the variable ddivisor, and the #
289 # Since the divisor is only a word (and larger than the mslw of the dividend),
295 # longword of the dividend as (0) remainder (see Knuth) and merely complete
296 # the last two divisions to get a quotient longword and word remainder:
315 mov.l %d1, %d6 # and quotient
322 # digit (word). After subtraction, the dividend is shifted and the
323 # process repeated. Before beginning, the divisor and quotient are
358 # now test the trial quotient and adjust. This step plus the
384 subq.l &0x1, %d1 # yes, decrement and recheck
387 # now test the word by multiplying it by the divisor (V1V2) and comparing
418 # first quotient digit now correct. store digit and shift the
448 # factors for the 32X32->64 multiplication are in %d5 and %d6.
462 # now use swap and addx to consolidate to two longwords
484 # and therefore does not work exactly like the 680X0 mul{s,u}.l #
500 # multiplies and "add" instructions. #
570 # now, clear lo, put hi in lo reg, and add to [4]
588 # here, the result is in d1 and d0. the current strategy is to save
604 # save the zero result to the register file and set the 'Z' ccode bit.
696 # now, clear lo, put hi in lo reg, and add to [4]
709 # -negate all bits and add 1
725 # here, the result is in d1 and d0. the current strategy is to save
741 # save the zero result to the register file and set the 'Z' ccode bit.
763 # and therefore does not work exactly like the 680X0 "cmp2" #
906 # (2) save 'Z' and 'N' bits from ((hi - lo) - (Rn - hi))
907 # (3) keep 'X', 'N', and 'V' from before instruction
919 andi.b &0x5, %d3 # keep 'Z' and 'N'