Home | History | Annotate | Download | only in dist

Lines Matching refs:INTEGER

376 set L_SCR3,		LV+28			# integer scratch 3
377 set L_SCR2, LV+24 # integer scratch 2
378 set L_SCR1, LV+20 # integer scratch 1
3166 # operand and save the appropriate minimum or maximum integer value
3205 short foperr_out_l - tbl_operr # long word integer
3209 short foperr_out_w - tbl_operr # word integer
3211 short foperr_out_b - tbl_operr # byte integer
3364 # operand and save the appropriate minimum or maximum integer value
3375 short fsnan_out_l - tbl_snan # long word integer
3379 short fsnan_out_w - tbl_snan # word integer
3381 short fsnan_out_b - tbl_snan # byte integer
3629 # longword integer directly into the upper longword of the mantissa along
3636 fmov.l FP_SRC_HI(%a6),%fp0 # load integer src
3637 fmov.x %fp0,FP_SRC(%a6) # store integer as extended precision
5168 fmov.l %fp1,INT(%a6) # CONVERT TO INTEGER
5380 fmov.l %fp1,INT(%a6) # CONVERT TO INTEGER
5615 #--integer quotient will be stored in N
5897 fmov.l %fp1,%d1 # CONVERT TO INTEGER
6046 #--integer quotient will be stored in N
6836 # 32-bit integer, the upper (more significant) 16 bits #
6841 # by integer comparison. Note also that the constant #
6851 # 2.2 N := round-to-nearest-integer( X * 64/log2 ). #
6860 # N := round-to-nearest-integer(Z) #
6962 # 8.2 N := round-to-integer( X * 64/log2 ) #
7008 # 2.1 N := round-to-nearest-integer( X * 64/log2 ). #
8829 # Step 1. If X is not an integer power of two, i.e., X != 2^k, #
8833 # 2.1 Get integer k, X = 2^k. #
20248 beq.b fout_byte_dn # must save to integer regfile
20294 beq.b fout_word_dn # must save to integer regfile
20341 beq.b fout_long_dn # must save to integer regfile
20482 beq.b fout_sgl_exg_write_dn # must save to integer regfile
20529 beq.b fout_sgl_unfl_dn # must save to integer regfile
20579 beq.b fout_sgl_ovfl_dn # must save to integer regfile
20858 # get rid of ext integer bit #
20923 # get rid of ext integer bit #
23019 # for the mantissa which is to be interpreted as 17 integer #
23020 # digits, rather than 1 integer and 16 fraction digits. #
23036 # SM = 0 a non-zero digit in the integer position #
23094 # 4. Subtract 16 to compensate for interpreting the mant as all integer digits.
23159 # get the integer digit then skip down & get the rest of the
23162 bfextu (%a0){&28:&4},%d0 # integer part is ls digit in long word
23516 # of decimal places needed to insure LEN integer digits #
23786 # of decimal places needed to insure LEN integer digits
24463 # binstr(): Converts a 64-bit binary integer to bcd. #
24466 # d2:d3 = 64-bit binary integer #
24473 # a0 = pointer to LEN bcd digits representing the 64-bit integer. #