Lines Matching full:2

11    2. Redistributions in binary form must reproduce the above copyright
37 Worst-case error: 0.54 ULP (~= ulperr_exp + 1024*Ln2*relerr_log*2^53)
38 relerr_log: 1.3 * 2^-68 (Relative error of log, 1.5 * 2^-68 without fma)
62 /* double_t for better performance on targets with FLT_EVAL_METHOD==2. */ in log_inline()
67 /* x = 2^k z; where z is in range [OFF,2*OFF) and exact. in log_inline()
82 /* Note: 1/c is j/N or j/N/2 where j is an integer in [N,2N) and in log_inline()
121 * (A[1] + r * A[2] + ar2 * (A[3] + r * A[4] + ar2 * (A[5] + r * A[6])))); in log_inline()
168 #if FLT_EVAL_METHOD == 2 in specialcase()
175 range to avoid double rounding that can cause 0.5+E/2 ulp error where in specialcase()
197 /* Computes sign*exp(x+xtail) where |xtail| < 2^-8/N and |xtail| <= |x|.
204 /* double_t for better performance on targets with FLT_EVAL_METHOD==2. */ in exp_inline()
229 /* exp(x) = 2^(k/N) * exp(r), with exp(r) in [2^(-1/2N),2^(1/2N)]. */ in exp_inline()
230 /* x = ln2/N*k + r, with int k and r in [-ln2/2N, ln2/2N]. */ in exp_inline()
236 /* z - kd is in [-0.5-2^-16, 0.5] in all rounding modes. */ in exp_inline()
247 /* The code assumes 2^-200 < |xtail| < 2^-8/N. */ in exp_inline()
249 /* 2^(k/N) ~= scale * (1 + tail). */ in exp_inline()
250 idx = 2 * (ki % N); in exp_inline()
255 /* exp(x) = 2^(k/N) * exp(r) ~= scale + scale * (tail + exp(r) - 1). */ in exp_inline()
259 /* Worst case error is less than 0.5+1.11/N+(abs poly error * 2^53) ulp. */ in exp_inline()
270 /* Note: tmp == 0 or |tmp| > 2^-200 and scale > 2^-739, so there in exp_inline()
275 /* Returns 0 if not int, 1 if odd int, 2 if even int. The argument is
284 return 2; in checkint()
289 return 2; in checkint()
296 return 2 * i - 1 >= 2 * asuint64 ((double) INFINITY) - 1; in zeroinfnan()
313 /* Note: if |y| > 1075 * ln2 * 2^53 ~= 0x1.749p62 then pow(x,y) = inf/0 in pow()
314 and if |y| < 2^-54 / 1075 ~= 0x1.e7b6p-65 then pow(x,y) = +-1. */ in pow()
319 if (2 * iy == 0) in pow()
323 if (2 * ix > 2 * asuint64 ((double) INFINITY) in pow()
324 || 2 * iy > 2 * asuint64 ((double) INFINITY)) in pow()
326 if (2 * ix == 2 * asuint64 (1.0)) in pow()
328 if ((2 * ix < 2 * asuint64 (1.0)) == !(iy >> 63)) in pow()
340 if (WANT_ERRNO && 2 * ix == 0 && iy >> 63) in pow()
365 /* |y| < 2^-65, x^y ~= 1 + y*log(x). */ in pow()
395 elo = ylo * lhi + y * llo; /* |elo| < |ehi| * 2^-25. */ in pow()