Lines Matching defs:THE
9 THE SOFTWARE is provided on an "AS IS" basis and without warranty.
20 ARISING OF THE USE OR INABILITY TO USE THE SOFTWARE.
5151 #--THIS IS THE USUAL CASE, |X| <= 15 PI.
5152 #--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
5165 # A1 IS THE ADDRESS OF N*PIBY2
5180 #--LET J BE THE LEAST SIG. BIT OF D0, LET SGN := (-1)**J.
5233 #--LET J BE THE LEAST SIG. BIT OF D0, LET SGN := (-1)**J.
5298 #--IF |X| > 15PI, WE USE THE GENERAL ARGUMENT REDUCTION.
5362 #--THIS IS THE USUAL CASE, |X| <= 15 PI.
5363 #--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
5568 #--WHEN REDUCEX IS USED, THE CODE WILL INEVITABLY BE SLOW.
5570 #--THE REMAINDER INSTRUCTION WHICH IS NOW IN SOFTWARE.
5625 #--FIND THE REMAINDER OF (R,r) W.R.T. 2**L * (PI/2). L IS SO CHOSEN
5642 #--FLOATING POINT FORMAT, THE TWO FMOVE'S FMOVE.L FP <--> N
5643 #--WILL BE TOO INEFFICIENT. THE WAY AROUND IT IS THAT
5645 #--US THE DESIRED VALUE IN FLOATING POINT.
5651 fadd.s TWOTO63(%a6),%fp2 # THE FRACTIONAL PART OF FP1 IS ROUNDED
5881 #--THIS IS THE USUAL CASE, |X| <= 15 PI.
5882 #--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
5982 #--IF |X| > 15PI, WE USE THE GENERAL ARGUMENT REDUCTION.
5999 #--WHEN REDUCEX IS USED, THE CODE WILL INEVITABLY BE SLOW.
6001 #--THE REMAINDER INSTRUCTION WHICH IS NOW IN SOFTWARE.
6056 #--FIND THE REMAINDER OF (R,r) W.R.T. 2**L * (PI/2). L IS SO CHOSEN
6073 #--FLOATING POINT FORMAT, THE TWO FMOVE'S FMOVE.L FP <--> N
6074 #--WILL BE TOO INEFFICIENT. THE WAY AROUND IT IS THAT
6076 #--US THE DESIRED VALUE IN FLOATING POINT.
6082 fadd.s TWOTO63(%a6),%fp2 # THE FRACTIONAL PART OF FP1 IS ROUNDED
6364 #--THE MOST LIKELY CASE, |X| IN [1/16, 16). WE USE TABLE TECHNIQUE
6365 #--THE IDEA IS ATAN(X) = ATAN(F) + ATAN( [X-F] / [1+XF] ).
6369 #--TRUE THAT A DIVIDE IS NOW NEEDED, BUT THE APPROXIMATION FOR
6370 #--ATAN(U) IS A VERY SHORT POLYNOMIAL AND THE INDEXING TO
6371 #--FETCH F AND SAVING OF REGISTERS CAN BE ALL HIDED UNDER THE
6372 #--DIVIDE. IN THE END THIS METHOD IS MUCH FASTER THAN A TRADITIONAL
6373 #--ONE. NOTE ALSO THAT THE TRADITIONAL SCHEME THAT APPROXIMATE
6380 #--THAT IS IT MATCHES THE EXPONENT AND FIRST 5 BITS OF X, THE
6397 #--WHILE THE DIVISION IS TAKING ITS TIME, WE FETCH ATAN(|F|)
6402 mov.l %d1,%d2 # THE EXP AND 16 BITS OF X
6407 add.l %d2,%d1 # THE 7 BITS IDENTIFYING F
6420 #--BUT ALAS, THE DIVIDE IS STILL CRANKING!
6424 #--THE POLYNOMIAL MAY LOOK STRANGE, BUT IS NEVERTHELESS CORRECT.
6425 #--THE NATURAL FORM IS U + U*V*(A1 + V*(A2 + V*A3))
6427 #--THE REASON FOR THIS REARRANGEMENT IS TO MAKE THE INDEPENDENT
6646 #--THIS IS THE USUAL CASE, |X| < 1
6739 #--THIS IS THE USUAL CASE, |X| < 1
7259 #--TO FULLY UTILIZE THE PIPELINE, WE COMPUTE S = R*R
7422 #--TO FULLY UTILIZE THE PIPELINE, WE COMPUTE S = R*R
7729 #--THIS IS THE USUAL CASE, |X| < 16380 LOG2
7842 #--THIS IS THE USUAL CASE, |X| < 16380 LOG2
7970 #--THIS IS THE USUAL CASE
8343 #--THIS SHOULD BE THE USUAL CASE, X NOT VERY CLOSE TO 1
8347 #--THE IDEA IS THAT LOG(X) = K*LOG2 + LOG(Y)
8351 #--ALSO NOTE THAT THE VALUE 1/F IS STORED IN A TABLE SO THAT NO
8362 #--WHILE THE CONVERSION IS GOING ON, WE GET F AND ADDRESS OF 1/F
8366 or.l &0x01000000,FFRAC(%a6) # GET F: ATTACH A 1 AT THE EIGHTH BIT
8371 asr.l &4,%d1 # SHIFTED 20, D0 IS THE DISPLACEMENT
8372 add.l %d1,%a0 # A0 IS THE ADDRESS FOR 1/F
8433 #--REGISTERS SAVED: FPCR, FP1. FP0 CONTAINS THE INPUT.
8591 #--HERE WE USE THE USUAL TABLE DRIVEN APPROACH. CARE HAS TO BE
8593 #--PRESERVE ALL THE INFORMATION. BECAUSE 1+Z IS IN [1/2,3/2],
8713 #--THIS IS THE USUAL CASE, |X| < 1
9128 #--SUMMARY: a1 IS ADDRESS FOR THE LEADING PORTION OF 2^(J/64),
9225 #--SUMMARY: a1 IS ADDRESS FOR THE LEADING PORTION OF 2^(J/64),
9256 #--FP0 IS R. THE FOLLOWING CODE COMPUTES