xref: /llvm-project/libc/AOR_v20.02/math/log.c (revision 0928368f623a0f885894f9c3ef1b740b060c0d9c)
1*0928368fSKristof Beyls /*
2*0928368fSKristof Beyls  * Double-precision log(x) function.
3*0928368fSKristof Beyls  *
4*0928368fSKristof Beyls  * Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
5*0928368fSKristof Beyls  * See https://llvm.org/LICENSE.txt for license information.
6*0928368fSKristof Beyls  * SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7*0928368fSKristof Beyls  */
8*0928368fSKristof Beyls 
9*0928368fSKristof Beyls #include <float.h>
10*0928368fSKristof Beyls #include <math.h>
11*0928368fSKristof Beyls #include <stdint.h>
12*0928368fSKristof Beyls #include "math_config.h"
13*0928368fSKristof Beyls 
14*0928368fSKristof Beyls #define T __log_data.tab
15*0928368fSKristof Beyls #define T2 __log_data.tab2
16*0928368fSKristof Beyls #define B __log_data.poly1
17*0928368fSKristof Beyls #define A __log_data.poly
18*0928368fSKristof Beyls #define Ln2hi __log_data.ln2hi
19*0928368fSKristof Beyls #define Ln2lo __log_data.ln2lo
20*0928368fSKristof Beyls #define N (1 << LOG_TABLE_BITS)
21*0928368fSKristof Beyls #define OFF 0x3fe6000000000000
22*0928368fSKristof Beyls 
23*0928368fSKristof Beyls /* Top 16 bits of a double.  */
24*0928368fSKristof Beyls static inline uint32_t
top16(double x)25*0928368fSKristof Beyls top16 (double x)
26*0928368fSKristof Beyls {
27*0928368fSKristof Beyls   return asuint64 (x) >> 48;
28*0928368fSKristof Beyls }
29*0928368fSKristof Beyls 
30*0928368fSKristof Beyls double
log(double x)31*0928368fSKristof Beyls log (double x)
32*0928368fSKristof Beyls {
33*0928368fSKristof Beyls   /* double_t for better performance on targets with FLT_EVAL_METHOD==2.  */
34*0928368fSKristof Beyls   double_t w, z, r, r2, r3, y, invc, logc, kd, hi, lo;
35*0928368fSKristof Beyls   uint64_t ix, iz, tmp;
36*0928368fSKristof Beyls   uint32_t top;
37*0928368fSKristof Beyls   int k, i;
38*0928368fSKristof Beyls 
39*0928368fSKristof Beyls   ix = asuint64 (x);
40*0928368fSKristof Beyls   top = top16 (x);
41*0928368fSKristof Beyls 
42*0928368fSKristof Beyls #if LOG_POLY1_ORDER == 10 || LOG_POLY1_ORDER == 11
43*0928368fSKristof Beyls # define LO asuint64 (1.0 - 0x1p-5)
44*0928368fSKristof Beyls # define HI asuint64 (1.0 + 0x1.1p-5)
45*0928368fSKristof Beyls #elif LOG_POLY1_ORDER == 12
46*0928368fSKristof Beyls # define LO asuint64 (1.0 - 0x1p-4)
47*0928368fSKristof Beyls # define HI asuint64 (1.0 + 0x1.09p-4)
48*0928368fSKristof Beyls #endif
49*0928368fSKristof Beyls   if (unlikely (ix - LO < HI - LO))
50*0928368fSKristof Beyls     {
51*0928368fSKristof Beyls       /* Handle close to 1.0 inputs separately.  */
52*0928368fSKristof Beyls       /* Fix sign of zero with downward rounding when x==1.  */
53*0928368fSKristof Beyls       if (WANT_ROUNDING && unlikely (ix == asuint64 (1.0)))
54*0928368fSKristof Beyls 	return 0;
55*0928368fSKristof Beyls       r = x - 1.0;
56*0928368fSKristof Beyls       r2 = r * r;
57*0928368fSKristof Beyls       r3 = r * r2;
58*0928368fSKristof Beyls #if LOG_POLY1_ORDER == 10
59*0928368fSKristof Beyls       /* Worst-case error is around 0.516 ULP.  */
60*0928368fSKristof Beyls       y = r3 * (B[1] + r * B[2] + r2 * B[3]
61*0928368fSKristof Beyls 		+ r3 * (B[4] + r * B[5] + r2 * B[6] + r3 * (B[7] + r * B[8])));
62*0928368fSKristof Beyls       w = B[0] * r2; /* B[0] == -0.5.  */
63*0928368fSKristof Beyls       hi = r + w;
64*0928368fSKristof Beyls       y += r - hi + w;
65*0928368fSKristof Beyls       y += hi;
66*0928368fSKristof Beyls #elif LOG_POLY1_ORDER == 11
67*0928368fSKristof Beyls       /* Worst-case error is around 0.516 ULP.  */
68*0928368fSKristof Beyls       y = r3 * (B[1] + r * B[2]
69*0928368fSKristof Beyls 		+ r2 * (B[3] + r * B[4] + r2 * B[5]
70*0928368fSKristof Beyls 			+ r3 * (B[6] + r * B[7] + r2 * B[8] + r3 * B[9])));
71*0928368fSKristof Beyls       w = B[0] * r2; /* B[0] == -0.5.  */
72*0928368fSKristof Beyls       hi = r + w;
73*0928368fSKristof Beyls       y += r - hi + w;
74*0928368fSKristof Beyls       y += hi;
75*0928368fSKristof Beyls #elif LOG_POLY1_ORDER == 12
76*0928368fSKristof Beyls       y = r3 * (B[1] + r * B[2] + r2 * B[3]
77*0928368fSKristof Beyls 		+ r3 * (B[4] + r * B[5] + r2 * B[6]
78*0928368fSKristof Beyls 			+ r3 * (B[7] + r * B[8] + r2 * B[9] + r3 * B[10])));
79*0928368fSKristof Beyls # if N <= 64
80*0928368fSKristof Beyls       /* Worst-case error is around 0.532 ULP.  */
81*0928368fSKristof Beyls       w = B[0] * r2; /* B[0] == -0.5.  */
82*0928368fSKristof Beyls       hi = r + w;
83*0928368fSKristof Beyls       y += r - hi + w;
84*0928368fSKristof Beyls       y += hi;
85*0928368fSKristof Beyls # else
86*0928368fSKristof Beyls       /* Worst-case error is around 0.507 ULP.  */
87*0928368fSKristof Beyls       w = r * 0x1p27;
88*0928368fSKristof Beyls       double_t rhi = r + w - w;
89*0928368fSKristof Beyls       double_t rlo = r - rhi;
90*0928368fSKristof Beyls       w = rhi * rhi * B[0]; /* B[0] == -0.5.  */
91*0928368fSKristof Beyls       hi = r + w;
92*0928368fSKristof Beyls       lo = r - hi + w;
93*0928368fSKristof Beyls       lo += B[0] * rlo * (rhi + r);
94*0928368fSKristof Beyls       y += lo;
95*0928368fSKristof Beyls       y += hi;
96*0928368fSKristof Beyls # endif
97*0928368fSKristof Beyls #endif
98*0928368fSKristof Beyls       return eval_as_double (y);
99*0928368fSKristof Beyls     }
100*0928368fSKristof Beyls   if (unlikely (top - 0x0010 >= 0x7ff0 - 0x0010))
101*0928368fSKristof Beyls     {
102*0928368fSKristof Beyls       /* x < 0x1p-1022 or inf or nan.  */
103*0928368fSKristof Beyls       if (ix * 2 == 0)
104*0928368fSKristof Beyls 	return __math_divzero (1);
105*0928368fSKristof Beyls       if (ix == asuint64 (INFINITY)) /* log(inf) == inf.  */
106*0928368fSKristof Beyls 	return x;
107*0928368fSKristof Beyls       if ((top & 0x8000) || (top & 0x7ff0) == 0x7ff0)
108*0928368fSKristof Beyls 	return __math_invalid (x);
109*0928368fSKristof Beyls       /* x is subnormal, normalize it.  */
110*0928368fSKristof Beyls       ix = asuint64 (x * 0x1p52);
111*0928368fSKristof Beyls       ix -= 52ULL << 52;
112*0928368fSKristof Beyls     }
113*0928368fSKristof Beyls 
114*0928368fSKristof Beyls   /* x = 2^k z; where z is in range [OFF,2*OFF) and exact.
115*0928368fSKristof Beyls      The range is split into N subintervals.
116*0928368fSKristof Beyls      The ith subinterval contains z and c is near its center.  */
117*0928368fSKristof Beyls   tmp = ix - OFF;
118*0928368fSKristof Beyls   i = (tmp >> (52 - LOG_TABLE_BITS)) % N;
119*0928368fSKristof Beyls   k = (int64_t) tmp >> 52; /* arithmetic shift */
120*0928368fSKristof Beyls   iz = ix - (tmp & 0xfffULL << 52);
121*0928368fSKristof Beyls   invc = T[i].invc;
122*0928368fSKristof Beyls   logc = T[i].logc;
123*0928368fSKristof Beyls   z = asdouble (iz);
124*0928368fSKristof Beyls 
125*0928368fSKristof Beyls   /* log(x) = log1p(z/c-1) + log(c) + k*Ln2.  */
126*0928368fSKristof Beyls   /* r ~= z/c - 1, |r| < 1/(2*N).  */
127*0928368fSKristof Beyls #if HAVE_FAST_FMA
128*0928368fSKristof Beyls   /* rounding error: 0x1p-55/N.  */
129*0928368fSKristof Beyls   r = fma (z, invc, -1.0);
130*0928368fSKristof Beyls #else
131*0928368fSKristof Beyls   /* rounding error: 0x1p-55/N + 0x1p-66.  */
132*0928368fSKristof Beyls   r = (z - T2[i].chi - T2[i].clo) * invc;
133*0928368fSKristof Beyls #endif
134*0928368fSKristof Beyls   kd = (double_t) k;
135*0928368fSKristof Beyls 
136*0928368fSKristof Beyls   /* hi + lo = r + log(c) + k*Ln2.  */
137*0928368fSKristof Beyls   w = kd * Ln2hi + logc;
138*0928368fSKristof Beyls   hi = w + r;
139*0928368fSKristof Beyls   lo = w - hi + r + kd * Ln2lo;
140*0928368fSKristof Beyls 
141*0928368fSKristof Beyls   /* log(x) = lo + (log1p(r) - r) + hi.  */
142*0928368fSKristof Beyls   r2 = r * r; /* rounding error: 0x1p-54/N^2.  */
143*0928368fSKristof Beyls   /* Worst case error if |y| > 0x1p-5:
144*0928368fSKristof Beyls      0.5 + 4.13/N + abs-poly-error*2^57 ULP (+ 0.002 ULP without fma)
145*0928368fSKristof Beyls      Worst case error if |y| > 0x1p-4:
146*0928368fSKristof Beyls      0.5 + 2.06/N + abs-poly-error*2^56 ULP (+ 0.001 ULP without fma).  */
147*0928368fSKristof Beyls #if LOG_POLY_ORDER == 6
148*0928368fSKristof Beyls   y = lo + r2 * A[0] + r * r2 * (A[1] + r * A[2] + r2 * (A[3] + r * A[4])) + hi;
149*0928368fSKristof Beyls #elif LOG_POLY_ORDER == 7
150*0928368fSKristof Beyls   y = lo
151*0928368fSKristof Beyls       + r2 * (A[0] + r * A[1] + r2 * (A[2] + r * A[3])
152*0928368fSKristof Beyls 	      + r2 * r2 * (A[4] + r * A[5]))
153*0928368fSKristof Beyls       + hi;
154*0928368fSKristof Beyls #endif
155*0928368fSKristof Beyls   return eval_as_double (y);
156*0928368fSKristof Beyls }
157*0928368fSKristof Beyls #if USE_GLIBC_ABI
strong_alias(log,__log_finite)158*0928368fSKristof Beyls strong_alias (log, __log_finite)
159*0928368fSKristof Beyls hidden_alias (log, __ieee754_log)
160*0928368fSKristof Beyls # if LDBL_MANT_DIG == 53
161*0928368fSKristof Beyls long double logl (long double x) { return log (x); }
162*0928368fSKristof Beyls # endif
163*0928368fSKristof Beyls #endif
164