1 /* Single-precision floating point 2^x.
2 Copyright (C) 1997,1998,2000,2001,2005,2006 Free Software Foundation, Inc.
3 This file is part of the GNU C Library.
4 Contributed by Geoffrey Keating <geoffk@ozemail.com.au>
6 The GNU C Library is free software; you can redistribute it and/or
7 modify it under the terms of the GNU Lesser General Public
8 License as published by the Free Software Foundation; either
9 version 2.1 of the License, or (at your option) any later version.
11 The GNU C Library is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 Lesser General Public License for more details.
16 You should have received a copy of the GNU Lesser General Public
17 License along with the GNU C Library; if not, write to the Free
18 Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
21 /* The basic design here is from
22 Shmuel Gal and Boris Bachelis, "An Accurate Elementary Mathematical
23 Library for the IEEE Floating Point Standard", ACM Trans. Math. Soft.,
24 17 (1), March 1991, pp. 26-45.
25 It has been slightly modified to compute 2^x instead of e^x, and for
37 #include <math_private.h>
41 static const volatile float TWOM100
= 7.88860905e-31;
42 static const volatile float TWO127
= 1.7014118346e+38;
45 __ieee754_exp2f (float x
)
47 static const float himark
= (float) FLT_MAX_EXP
;
48 static const float lomark
= (float) (FLT_MIN_EXP
- FLT_MANT_DIG
- 1);
50 /* Check for usual case. */
51 if (isless (x
, himark
) && isgreaterequal (x
, lomark
))
53 static const float THREEp14
= 49152.0;
55 float rx
, x22
, result
;
56 union ieee754_float ex2_u
, scale_u
;
59 feholdexcept (&oldenv
);
61 /* If we don't have this, it's too bad. */
62 fesetround (FE_TONEAREST
);
65 /* 1. Argument reduction.
66 Choose integers ex, -128 <= t < 128, and some real
67 -1/512 <= x1 <= 1/512 so that
70 First, calculate rx = ex + t/256. */
73 x
-= rx
; /* Compute x=x1. */
74 /* Compute tval = (ex*256 + t)+128.
75 Now, t = (tval mod 256)-128 and ex=tval/256 [that's mod, NOT %; and
76 /-round-to-nearest not the usual c integer /]. */
77 tval
= (int) (rx
* 256.0f
+ 128.0f
);
79 /* 2. Adjust for accurate table entry.
81 x = ex + t/256 + e + x2
82 where -7e-4 < e < 7e-4, and
84 is accurate to one part in 2^-64. */
86 /* 'tval & 255' is the same as 'tval%256' except that it's always
89 x
-= __exp2f_deltatable
[tval
& 255];
91 /* 3. Compute ex2 = 2^(t/255+e+ex). */
92 ex2_u
.f
= __exp2f_atable
[tval
& 255];
94 unsafe
= abs(tval
) >= -FLT_MIN_EXP
- 1;
95 ex2_u
.ieee
.exponent
+= tval
>> unsafe
;
97 scale_u
.ieee
.exponent
+= tval
- (tval
>> unsafe
);
99 /* 4. Approximate 2^x2 - 1, using a second-degree polynomial,
100 with maximum error in [-2^-9 - 2^-14, 2^-9 + 2^-14]
101 less than 1.3e-10. */
103 x22
= (.24022656679f
* x
+ .69314736128f
) * ex2_u
.f
;
105 /* 5. Return (2^x2-1) * 2^(t/512+e+ex) + 2^(t/512+e+ex). */
108 result
= x22
* x
+ ex2_u
.f
;
113 return result
* scale_u
.f
;
115 /* Exceptional cases: */
116 else if (isless (x
, himark
))
119 /* e^-inf == 0, with no error. */
123 return TWOM100
* TWOM100
;
126 /* Return x, if x is a NaN or Inf; or overflow, otherwise. */