Print this page
11210 libm should be cstyle(1ONBLD) clean

*** 16,36 **** * fields enclosed by brackets "[]" replaced with your own identifying * information: Portions Copyright [yyyy] [name of copyright owner] * * CDDL HEADER END */ /* * Copyright 2011 Nexenta Systems, Inc. All rights reserved. */ /* * Copyright 2005 Sun Microsystems, Inc. All rights reserved. * Use is subject to license terms. */ #pragma weak __log1p = log1p ! /* INDENT OFF */ /* * Method : * 1. Argument Reduction: find k and f such that * 1+x = 2^k * (1+f), * where sqrt(2)/2 < 1+f < sqrt(2) . --- 16,38 ---- * fields enclosed by brackets "[]" replaced with your own identifying * information: Portions Copyright [yyyy] [name of copyright owner] * * CDDL HEADER END */ + /* * Copyright 2011 Nexenta Systems, Inc. All rights reserved. */ + /* * Copyright 2005 Sun Microsystems, Inc. All rights reserved. * Use is subject to license terms. */ #pragma weak __log1p = log1p ! /* * Method : * 1. Argument Reduction: find k and f such that * 1+x = 2^k * (1+f), * where sqrt(2)/2 < 1+f < sqrt(2) .
*** 90,105 **** * if (u == 1.0) return x ; else * return log(u)*(x/(u-1.0)); * * See HP-15C Advanced Functions Handbook, p.193. */ - /* INDENT ON */ #include "libm.h" static const double xxx[] = { ! /* ln2_hi */ 6.93147180369123816490e-01, /* 3fe62e42 fee00000 */ /* ln2_lo */ 1.90821492927058770002e-10, /* 3dea39ef 35793c76 */ /* two54 */ 1.80143985094819840000e+16, /* 43500000 00000000 */ /* Lp1 */ 6.666666666666735130e-01, /* 3FE55555 55555593 */ /* Lp2 */ 3.999999999940941908e-01, /* 3FD99999 9997FA04 */ /* Lp3 */ 2.857142874366239149e-01, /* 3FD24924 94229359 */ --- 92,107 ---- * if (u == 1.0) return x ; else * return log(u)*(x/(u-1.0)); * * See HP-15C Advanced Functions Handbook, p.193. */ #include "libm.h" static const double xxx[] = { ! /* ln2_hi */ ! 6.93147180369123816490e-01, /* 3fe62e42 fee00000 */ /* ln2_lo */ 1.90821492927058770002e-10, /* 3dea39ef 35793c76 */ /* two54 */ 1.80143985094819840000e+16, /* 43500000 00000000 */ /* Lp1 */ 6.666666666666735130e-01, /* 3FE55555 55555593 */ /* Lp2 */ 3.999999999940941908e-01, /* 3FD99999 9997FA04 */ /* Lp3 */ 2.857142874366239149e-01, /* 3FD24924 94229359 */
*** 107,116 **** --- 109,119 ---- /* Lp5 */ 1.818357216161805012e-01, /* 3FC74664 96CB03DE */ /* Lp6 */ 1.531383769920937332e-01, /* 3FC39A09 D078C69F */ /* Lp7 */ 1.479819860511658591e-01, /* 3FC2F112 DF3E5244 */ /* zero */ 0.0 }; + #define ln2_hi xxx[0] #define ln2_lo xxx[1] #define two54 xxx[2] #define Lp1 xxx[3] #define Lp2 xxx[4]
*** 120,165 **** #define Lp6 xxx[8] #define Lp7 xxx[9] #define zero xxx[10] double ! log1p(double x) { double hfsq, f, c = 0.0, s, z, R, u; int k, hx, hu, ax; hx = ((int *)&x)[HIWORD]; /* high word of x */ ax = hx & 0x7fffffff; if (ax >= 0x7ff00000) { /* x is inf or nan */ if (((hx - 0xfff00000) | ((int *)&x)[LOWORD]) == 0) /* -inf */ return (_SVID_libm_err(x, x, 44)); return (x * x); } k = 1; if (hx < 0x3FDA827A) { /* x < 0.41422 */ if (ax >= 0x3ff00000) /* x <= -1.0 */ return (_SVID_libm_err(x, x, x == -1.0 ? 43 : 44)); if (ax < 0x3e200000) { /* |x| < 2**-29 */ if (two54 + x > zero && /* raise inexact */ ax < 0x3c900000) /* |x| < 2**-54 */ return (x); else return (x - x * x * 0.5); } if (hx > 0 || hx <= (int)0xbfd2bec3) { /* -0.2929<x<0.41422 */ k = 0; f = x; hu = 1; } } /* We will initialize 'c' here. */ if (k != 0) { if (hx < 0x43400000) { u = 1.0 + x; hu = ((int *)&u)[HIWORD]; /* high word of u */ k = (hu >> 20) - 1023; /* * correction term */ c = k > 0 ? 1.0 - (u - x) : x - (u - 1.0); c /= u; --- 123,175 ---- #define Lp6 xxx[8] #define Lp7 xxx[9] #define zero xxx[10] double ! log1p(double x) ! { double hfsq, f, c = 0.0, s, z, R, u; int k, hx, hu, ax; hx = ((int *)&x)[HIWORD]; /* high word of x */ ax = hx & 0x7fffffff; if (ax >= 0x7ff00000) { /* x is inf or nan */ if (((hx - 0xfff00000) | ((int *)&x)[LOWORD]) == 0) /* -inf */ return (_SVID_libm_err(x, x, 44)); + return (x * x); } k = 1; + if (hx < 0x3FDA827A) { /* x < 0.41422 */ if (ax >= 0x3ff00000) /* x <= -1.0 */ return (_SVID_libm_err(x, x, x == -1.0 ? 43 : 44)); + if (ax < 0x3e200000) { /* |x| < 2**-29 */ if (two54 + x > zero && /* raise inexact */ ax < 0x3c900000) /* |x| < 2**-54 */ return (x); else return (x - x * x * 0.5); } + if (hx > 0 || hx <= (int)0xbfd2bec3) { /* -0.2929<x<0.41422 */ k = 0; f = x; hu = 1; } } + /* We will initialize 'c' here. */ if (k != 0) { if (hx < 0x43400000) { u = 1.0 + x; hu = ((int *)&u)[HIWORD]; /* high word of u */ k = (hu >> 20) - 1023; + /* * correction term */ c = k > 0 ? 1.0 - (u - x) : x - (u - 1.0); c /= u;
*** 167,204 **** u = x; hu = ((int *)&u)[HIWORD]; /* high word of u */ k = (hu >> 20) - 1023; c = 0; } hu &= 0x000fffff; if (hu < 0x6a09e) { /* normalize u */ ((int *)&u)[HIWORD] = hu | 0x3ff00000; } else { /* normalize u/2 */ k += 1; ((int *)&u)[HIWORD] = hu | 0x3fe00000; hu = (0x00100000 - hu) >> 2; } f = u - 1.0; } hfsq = 0.5 * f * f; if (hu == 0) { /* |f| < 2**-20 */ if (f == zero) { if (k == 0) return (zero); /* We already initialized 'c' before, when (k != 0) */ c += k * ln2_lo; return (k * ln2_hi + c); } R = hfsq * (1.0 - 0.66666666666666666 * f); if (k == 0) return (f - R); return (k * ln2_hi - ((R - (k * ln2_lo + c)) - f)); } s = f / (2.0 + f); z = s * s; ! R = z * (Lp1 + z * (Lp2 + z * (Lp3 + z * (Lp4 + z * (Lp5 + ! z * (Lp6 + z * Lp7)))))); if (k == 0) return (f - (hfsq - s * (hfsq + R))); ! return (k * ln2_hi - ((hfsq - (s * (hfsq + R) + ! (k * ln2_lo + c))) - f)); } --- 177,226 ---- u = x; hu = ((int *)&u)[HIWORD]; /* high word of u */ k = (hu >> 20) - 1023; c = 0; } + hu &= 0x000fffff; + if (hu < 0x6a09e) { /* normalize u */ ((int *)&u)[HIWORD] = hu | 0x3ff00000; } else { /* normalize u/2 */ k += 1; ((int *)&u)[HIWORD] = hu | 0x3fe00000; hu = (0x00100000 - hu) >> 2; } + f = u - 1.0; } + hfsq = 0.5 * f * f; + if (hu == 0) { /* |f| < 2**-20 */ if (f == zero) { if (k == 0) return (zero); + /* We already initialized 'c' before, when (k != 0) */ c += k * ln2_lo; return (k * ln2_hi + c); } + R = hfsq * (1.0 - 0.66666666666666666 * f); + if (k == 0) return (f - R); + return (k * ln2_hi - ((R - (k * ln2_lo + c)) - f)); } + s = f / (2.0 + f); z = s * s; ! R = z * (Lp1 + z * (Lp2 + z * (Lp3 + z * (Lp4 + z * (Lp5 + z * (Lp6 + ! z * Lp7)))))); ! if (k == 0) return (f - (hfsq - s * (hfsq + R))); ! ! return (k * ln2_hi - ! ((hfsq - (s * (hfsq + R) + (k * ln2_lo + c))) - f)); }