1 /* Quad-precision floating point e^x.
2 Copyright (C) 1999, 2011 Free Software Foundation, Inc.
3 This file is part of the GNU C Library.
4 Contributed by Jakub Jelinek <jj@ultra.linux.cz>
5 Partly based on double-precision code
6 by Geoffrey Keating <geoffk@ozemail.com.au>
8 The GNU C Library is free software; you can redistribute it and/or
9 modify it under the terms of the GNU Lesser General Public
10 License as published by the Free Software Foundation; either
11 version 2.1 of the License, or (at your option) any later version.
13 The GNU C Library is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 Lesser General Public License for more details.
18 You should have received a copy of the GNU Lesser General Public
19 License along with the GNU C Library; if not, see
20 <http://www.gnu.org/licenses/>. */
22 /* The basic design here is from
23 Abraham Ziv, "Fast Evaluation of Elementary Mathematical Functions with
24 Correctly Rounded Last Bit", ACM Trans. Math. Soft., 17 (3), September 1991,
27 We work with number pairs where the first number is the high part and
28 the second one is the low part. Arithmetic with the high part numbers must
29 be exact, without any roundoff errors.
31 The input value, X, is written as
32 X = n * ln(2)_0 + arg1[t1]_0 + arg2[t2]_0 + x
33 - n * ln(2)_1 + arg1[t1]_1 + arg2[t2]_1 + xl
36 - n is an integer, 16384 >= n >= -16495;
37 - ln(2)_0 is the first 93 bits of ln(2), and |ln(2)_0-ln(2)-ln(2)_1| < 2^-205
38 - t1 is an integer, 89 >= t1 >= -89
39 - t2 is an integer, 65 >= t2 >= -65
40 - |arg1[t1]-t1/256.0| < 2^-53
41 - |arg2[t2]-t2/32768.0| < 2^-53
42 - x + xl is whatever is left, |x + xl| < 2^-16 + 2^-53
44 Then e^x is approximated as
46 e^x = 2^n_1 ( 2^n_0 e^(arg1[t1]_0 + arg1[t1]_1) e^(arg2[t2]_0 + arg2[t2]_1)
47 + 2^n_0 e^(arg1[t1]_0 + arg1[t1]_1) e^(arg2[t2]_0 + arg2[t2]_1)
48 * p (x + xl + n * ln(2)_1))
50 - p(x) is a polynomial approximating e(x)-1
51 - e^(arg1[t1]_0 + arg1[t1]_1) is obtained from a table
52 - e^(arg2[t2]_0 + arg2[t2]_1) likewise
53 - n_1 + n_0 = n, so that |n_0| < -LDBL_MIN_EXP-1.
55 If it happens that n_1 == 0 (this is the usual case), that multiplication
67 #include <math_private.h>
71 static const long double C
[] = {
72 /* Smallest integer x for which e^x overflows. */
74 11356.523406294143949491931077970765L,
76 /* Largest integer x for which e^x underflows. */
78 -11433.4627433362978788372438434526231L,
82 59421121885698253195157962752.0L,
85 #define THREEp103 C[3]
86 30423614405477505635920876929024.0L,
89 #define THREEp111 C[4]
90 7788445287802241442795744493830144.0L,
94 1.44269504088896340735992468100189204L,
96 /* first 93 bits of ln(2) */
98 0.693147180559945309417232121457981864L,
102 -1.94704509238074995158795957333327386E-31L,
104 /* very small number */
109 #define TWO16383 C[9]
110 5.94865747678615882542879663314003565E+4931L,
120 /* Chebyshev polynom coeficients for (exp(x)-1)/x */
128 1.66666666666666666666666666666666683E-01L,
129 4.16666666666666666666654902320001674E-02L,
130 8.33333333333333333333314659767198461E-03L,
131 1.38888888889899438565058018857254025E-03L,
132 1.98412698413981650382436541785404286E-04L,
136 __ieee754_expl (long double x
)
138 /* Check for usual case. */
139 if (isless (x
, himark
) && isgreater (x
, lomark
))
141 int tval1
, tval2
, unsafe
, n_i
;
142 long double x22
, n
, t
, result
, xl
;
143 union ieee854_long_double ex2_u
, scale_u
;
146 feholdexcept (&oldenv
);
148 fesetround (FE_TONEAREST
);
152 n
= x
* M_1_LN2
+ THREEp111
;
157 /* Calculate t/256. */
161 /* Compute tval1 = t. */
162 tval1
= (int) (t
* TWO8
);
164 x
-= __expl_table
[T_EXPL_ARG1
+2*tval1
];
165 xl
-= __expl_table
[T_EXPL_ARG1
+2*tval1
+1];
167 /* Calculate t/32768. */
171 /* Compute tval2 = t. */
172 tval2
= (int) (t
* TWO15
);
174 x
-= __expl_table
[T_EXPL_ARG2
+2*tval2
];
175 xl
-= __expl_table
[T_EXPL_ARG2
+2*tval2
+1];
179 /* Compute ex2 = 2^n_0 e^(argtable[tval1]) e^(argtable[tval2]). */
180 ex2_u
.d
= __expl_table
[T_EXPL_RES1
+ tval1
]
181 * __expl_table
[T_EXPL_RES2
+ tval2
];
183 /* 'unsafe' is 1 iff n_1 != 0. */
184 unsafe
= abs(n_i
) >= -LDBL_MIN_EXP
- 1;
185 ex2_u
.ieee
.exponent
+= n_i
>> unsafe
;
187 /* Compute scale = 2^n_1. */
189 scale_u
.ieee
.exponent
+= n_i
- (n_i
>> unsafe
);
191 /* Approximate e^x2 - 1, using a seventh-degree polynomial,
192 with maximum error in [-2^-16-2^-53,2^-16+2^-53]
193 less than 4.8e-39. */
194 x22
= x
+ x
*x
*(P1
+x
*(P2
+x
*(P3
+x
*(P4
+x
*(P5
+x
*P6
)))));
199 result
= x22
* ex2_u
.d
+ ex2_u
.d
;
201 /* Now we can test whether the result is ultimate or if we are unsure.
202 In the later case we should probably call a mpn based routine to give
204 Empirically, this routine is already ultimate in about 99.9986% of
205 cases, the test below for the round to nearest case will be false
206 in ~ 99.9963% of cases.
207 Without proc2 routine maximum error which has been seen is
210 union ieee854_long_double ex3_u;
213 fesetround (FE_TONEAREST);
215 ex3_u.d = (result - ex2_u.d) - x22 * ex2_u.d;
217 ex3_u.ieee.exponent += LDBL_MANT_DIG + 15 + IEEE854_LONG_DOUBLE_BIAS
218 - ex2_u.ieee.exponent;
223 if (fegetround () == FE_TONEAREST)
227 return __ieee754_expl_proc2 (origx);
233 return result
* scale_u
.d
;
235 /* Exceptional cases: */
236 else if (isless (x
, himark
))
239 /* e^-inf == 0, with no error. */
246 /* Return x, if x is a NaN or Inf; or overflow, otherwise. */
249 strong_alias (__ieee754_expl
, __expl_finite
)