Lines Matching refs:BITS
424 # FPSR/FPCR bits #
517 set mantissalen, 64 # length of mantissa in bits
4923 # within 0.5001 ulp to 53 bits if the result is subsequently #
5628 # within 0.5001 ulp to 53 bits if the result is subsequently #
5692 #--MOST 69 BITS LONG.
6058 # i.e. within 0.5001 ulp to 53 bits if the result is subsequently #
6068 # significant bits of X with a bit-1 attached at the 6-th #
6281 #--NOW WE SEE X AS +-2^K * 1.BBBBBBB....B <- 1. + 63 BITS
6283 #--THAT IS IT MATCHES THE EXPONENT AND FIRST 5 BITS OF X, THE
6284 #--SIXTH BITS IS SET TO BE 1. SINCE K = -4, -3, ..., 3, THERE
6290 and.l &0xF8000000,XFRAC(%a6) # FIRST 5 BITS
6305 mov.l %d1,%d2 # THE EXP AND 16 BITS OF X
6306 and.l &0x00007800,%d1 # 4 VARYING BITS OF F'S FRACTION
6310 add.l %d2,%d1 # THE 7 BITS IDENTIFYING F
6508 # i.e. within 0.5001 ulp to 53 bits if the result is subsequently #
6609 # i.e. within 0.5001 ulp to 53 bits if the result is subsequently #
6705 # i.e. within 0.5001 ulp to 53 bits if the result is subsequently #
6730 # 32-bit integer, the upper (more significant) 16 bits #
6732 # lower 16 bits are the 16 most significant fraction #
6733 # (including the explicit bit) bits of |X|. Consequently, #
6772 # approximate the value -log2/64 to 88 bits of accuracy. #
6773 # b) N*L1 is exact because N is no longer than 22 bits #
6774 # and L1 is no longer than 24 bits. #
6777 # 64 bits. #
6812 # 2^(J/64) to roughly 85 bits; T is in extended precision #
6814 # rounded to 62 bits so that the last two bits of T are #
6940 # 2^(J/64) to roughly 85 bits; T is in extended precision #
6942 # rounded to 62 bits so that the last two bits of T are #
7123 cmp.l %d1,&0x400CB167 # 16380 log2 trunc. 16 bits
7288 cmp.l %d1,&0x4004C215 # 70log2 rounded up to 16 bits
7586 # i.e. within 0.5001 ulp to 53 bits if the result is subsequently #
7700 # i.e. within 0.5001 ulp to 53 bits if the result is subsequently #
7818 # i.e. within 0.5001 ulp to 53 bits if the result is subsequently #
7984 # i.e. within 0.5001 ulp to 53 bits if the result is subsequently #
7995 # seven significant bits of Y plus 2**(-7), i.e. #
8249 #--WE DEFINE F = 1.XXXXXX1, I.E. FIRST 7 BITS OF Y AND ATTACH A 1.
8259 asr.l &8,%d1 # SHIFTED 16 BITS, BIASED EXPO. OF X
8268 and.l &0xFE000000,FFRAC(%a6) # FIRST 7 BITS OF Y
8393 #----normalize the input value by left shifting k bits (k to be determined
8475 #--CONTAINS AT LEAST 63 BITS OF INFORMATION OF Z. IN THAT CASE,
8495 #--TAKEN BECAUSE 1+Z CAN HAVE 67 BITS OF INFORMATION AND WE MUST
8579 # i.e. within 0.5001 ulp to 53 bits if the result is subsequently #
8669 # i.e. within 0.5003 ulp to 53 bits if the result is subsequently #
8833 # i.e. within 0.5001 ulp to 53 bits if the result is subsequently #
9231 mov.l %d0,-(%sp) # store off ctrl bits for now
9250 # don't want any accrued bits from the fintrz showing up later since
9325 mov.l (%sp)+,%d0 # restore ctrl bits
9340 fmov.l %d0,%fpcr # no; load control bits
9345 mov.l (%sp)+,%d0 # load control bits into d1
9401 # Step 8. Return signQ, last 7 bits of Q, and R as required. #
9405 # R := 0. Return signQ, last 7 bits of Q, and R. #
9430 mov.l %d0,-(%sp) # save ctrl bits
9437 mov.l %d0,-(%sp) # save ctrl bits
9694 and.l &0x0000007F,%d3 # 7 bits of Q
9695 or.l %d6,%d3 # sign and bits of Q
10066 mov.l LOCAL_LO(%a0),%d1 # are any of lo 11 bits of
10169 # set the FPSR bits and return. #
10489 mov.b &neg_bmask+z_bmask,FPSR_CC(%a6) # set 'N','Z' ccode bits
10524 mov.b &neg_bmask+inf_bmask,FPSR_CC(%a6) # set 'N','I' ccode bits
10857 bfextu %d1{&0:%d2}, %d3 # extract lo bits
10913 # hi(man) is all zeroes so see if any bits in lo(man) are set
10966 # only mantissa bits set are in lo(man)
Indexes created Fri Oct 31 04:09:52 GMT 2025