Lines Matching +full:70 +full:a

4 |	The entry point setox computes the exponential of a value.
5 |	setoxd does the same except the input value is a denormalized
40 |	argument X, 0.25 <= |X| < 70log2. For |X| < 0.25, it takes
65 |		 To avoid the use of floating-point comparisons, a
66 |		 compact representation of |X| is used. This format is a
75 |		 to have a small number of cases where |X| is less than,
95 |		 Using a single-precision constant avoids memory access.
96 |		 Another effect of using a single-precision "constant" is
106 |	Notes:	a) The way L1 and L2 are chosen ensures L1+L2 approximate
127 |	Step 4.	Approximate exp(R)-1 by a polynomial
129 |	Notes:	a) In order to reduce memory access, the coefficients are
148 |		 reason for such a special form is that T-1, T-2, and T-8
149 |		 will all be exact --- a property that will give much
224 |		1.3	If |X| < 70 log(2), go to Step 2.
244 |		 shows that |R| <= 0.0055 (note that |X| <= 70 log2 in
247 |	Step 4.	Approximate exp(R)-1 by a polynomial
249 |	Notes:	a) In order to reduce memory access, the coefficients are
268 |		 reason for such a special form is that T-1, T-2, and T-8
269 |		 will all be exact --- a property that will be exploited
301 |	Step 9.	Calculate exp(X)-1, |X| < 1/4, by a polynomial
303 |	Notes:	a) In order to reduce memory access, the coefficients are
319 |	Step 10.	Calculate exp(X)-1 for |X| >= 70 log 2.
320 |		10.1 If X >= 70log2 , exp(X) - 1 = exp(X) for all practical
322 |		10.2 If X <= -70log2, exp(X) - 1 = -1 for all practical purposes.
512 |--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
641 	cmpil		#0x4004C215,%d0	| ...70log2 rounded up to 16 bits
642 	bles		EM1MAIN	 | ...1/4 <= |X| <= 70log2
647 |--This is the case:	1/4 <= |X| <= 70 log2.
664 	movel		%d0,L_SCR1(%a6)			| ...save a copy of M
679 |--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
799 |--Step 9	exp(X)-1 by a simple polynomial
853 |--Step 10	|X| > 70 log2