Lines Matching refs:OF
12 INCLUDING IMPLIED WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE
18 (INCLUDING WITHOUT LIMITATION, DAMAGES FOR LOSS OF BUSINESS PROFITS,
19 BUSINESS INTERRUPTION, LOSS OF BUSINESS INFORMATION, OR OTHER PECUNIARY LOSS)
20 ARISING OF THE USE OR INABILITY TO USE THE SOFTWARE.
5157 lea PITBL+0x200(%pc),%a1 # TABLE OF N*PI/2, N = -32,...,32
5165 # A1 IS THE ADDRESS OF N*PIBY2
5180 #--LET J BE THE LEAST SIG. BIT OF D0, LET SGN := (-1)**J.
5202 # ...LEAST SIG. BIT OF D0 IN SIGN POSITION
5233 #--LET J BE THE LEAST SIG. BIT OF D0, LET SGN := (-1)**J.
5256 # ...LEAST SIG. BIT OF D0 IN SIGN POSITION
5369 lea PITBL+0x200(%pc),%a1 # TABLE OF N*PI/2, N = -32,...,32
5375 add.l %d1,%a1 # ADDRESS OF N*PIBY2, IN Y1, Y2
5558 #--SIN AND COS OF X FOR DENORMALIZED X
5625 #--FIND THE REMAINDER OF (R,r) W.R.T. 2**L * (PI/2). L IS SO CHOSEN
5631 mov.l &0x00003FFE,%d2 # BIASED EXP OF 2/PI
5632 sub.l %d1,%d2 # BIASED EXP OF 2**(-L)*(2/PI)
5651 fadd.s TWOTO63(%a6),%fp2 # THE FRACTIONAL PART OF FP1 IS ROUNDED
5658 add.l &0x00003FFF,%d2 # BIASED EXP OF 2**L * (PI/2)
5886 lea.l PITBL+0x200(%pc),%a1 # TABLE OF N*PI/2, N = -32,...,32
6056 #--FIND THE REMAINDER OF (R,r) W.R.T. 2**L * (PI/2). L IS SO CHOSEN
6062 mov.l &0x00003FFE,%d2 # BIASED EXP OF 2/PI
6063 sub.l %d1,%d2 # BIASED EXP OF 2**(-L)*(2/PI)
6082 fadd.s TWOTO63(%a6),%fp2 # THE FRACTIONAL PART OF FP1 IS ROUNDED
6089 add.l &0x00003FFF,%d2 # BIASED EXP OF 2**L * (PI/2)
6371 #--FETCH F AND SAVING OF REGISTERS CAN BE ALL HIDED UNDER THE
6380 #--THAT IS IT MATCHES THE EXPONENT AND FIRST 5 BITS OF X, THE
6389 mov.l &0x00000000,XFRACLO(%a6) # LOCATION OF X IS NOW F
6402 mov.l %d1,%d2 # THE EXP AND 16 BITS OF X
6403 and.l &0x00007800,%d1 # 4 VARYING BITS OF F'S FRACTION
6404 and.l &0x7FFF0000,%d2 # EXPONENT OF F
6408 asr.l &7,%d1 # INDEX INTO TBL OF ATAN(|F|)
6410 add.l %d1,%a1 # ADDRESS OF ATAN(|F|)
6674 and.l &0x80000000,%d1 # SIGN BIT OF X
7976 add.l &0x00010000,%d1 # EXPONENT OF 2|X|
8013 add.l &0x00010000,%d1 # EXPO OF 2|X|
8335 blt.w LOGNEG # LOG OF NEGATIVE ARGUMENT IS INVALID
8346 #--WE DEFINE F = 1.XXXXXX1, I.E. FIRST 7 BITS OF Y AND ATTACH A 1.
8354 #--GET K, Y, F, AND ADDRESS OF 1/F.
8356 asr.l &8,%d1 # SHIFTED 16 BITS, BIASED EXPO. OF X
8359 lea LOGTBL(%pc),%a0 # BASE ADDRESS OF 1/F AND LOG(F)
8362 #--WHILE THE CONVERSION IS GOING ON, WE GET F AND ADDRESS OF 1/F
8365 and.l &0xFE000000,FFRAC(%a6) # FIRST 7 BITS OF Y
8367 mov.l FFRAC(%a6),%d1 # READY TO GET ADDRESS OF 1/F
8379 #--SUMMARY: FP0 IS Y-F, A0 IS ADDRESS OF 1/F, FP1 IS K
8410 add.l &16,%a0 # ADDRESS OF LOG(F)
8566 ble.w LP1NEG0 # LOG OF ZERO OR -VE
8572 #--CONTAINS AT LEAST 63 BITS OF INFORMATION OF Z. IN THAT CASE,
8592 #--TAKEN BECAUSE 1+Z CAN HAVE 67 BITS OF INFORMATION AND WE MUST
8597 #--ON RETURNING TO LP1CONT1, WE MUST HAVE K IN FP1, ADDRESS OF
8619 lea LOGTBL(%pc),%a0 # A0 IS ADDRESS OF 1/F
8637 add.l %d1,%a0 # A0 IS ADDRESS OF 1/F
9115 lea TEXPTBL(%pc),%a1 # LOAD ADDRESS OF TABLE OF 2^(J/64)
9128 #--SUMMARY: a1 IS ADDRESS FOR THE LEADING PORTION OF 2^(J/64),
9212 lea TEXPTBL(%pc),%a1 # LOAD ADDRESS OF TABLE OF 2^(J/64)
9225 #--SUMMARY: a1 IS ADDRESS FOR THE LEADING PORTION OF 2^(J/64),