1*cfe182f3Schristos /*-
2*cfe182f3Schristos * Copyright (c) 2017, 2023 Steven G. Kargl
3*cfe182f3Schristos * All rights reserved.
4*cfe182f3Schristos *
5*cfe182f3Schristos * Redistribution and use in source and binary forms, with or without
6*cfe182f3Schristos * modification, are permitted provided that the following conditions
7*cfe182f3Schristos * are met:
8*cfe182f3Schristos * 1. Redistributions of source code must retain the above copyright
9*cfe182f3Schristos * notice unmodified, this list of conditions, and the following
10*cfe182f3Schristos * disclaimer.
11*cfe182f3Schristos * 2. Redistributions in binary form must reproduce the above copyright
12*cfe182f3Schristos * notice, this list of conditions and the following disclaimer in the
13*cfe182f3Schristos * documentation and/or other materials provided with the distribution.
14*cfe182f3Schristos *
15*cfe182f3Schristos * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
16*cfe182f3Schristos * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17*cfe182f3Schristos * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18*cfe182f3Schristos * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
19*cfe182f3Schristos * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20*cfe182f3Schristos * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21*cfe182f3Schristos * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22*cfe182f3Schristos * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23*cfe182f3Schristos * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24*cfe182f3Schristos * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25*cfe182f3Schristos */
26*cfe182f3Schristos
27*cfe182f3Schristos /*
28*cfe182f3Schristos * See ../src/s_tanpi.c for implementation details.
29*cfe182f3Schristos */
30*cfe182f3Schristos
31*cfe182f3Schristos #include <stdint.h>
32*cfe182f3Schristos
33*cfe182f3Schristos #include "math.h"
34*cfe182f3Schristos #include "math_private.h"
35*cfe182f3Schristos
36*cfe182f3Schristos static const double
37*cfe182f3Schristos pi_hi = 3.1415926814079285e+00, /* 0x400921fb 0x58000000 */
38*cfe182f3Schristos pi_lo = -2.7818135228334233e-08; /* 0xbe5dde97 0x3dcb3b3a */
39*cfe182f3Schristos
40*cfe182f3Schristos static inline long double
__kernel_tanpil(long double x)41*cfe182f3Schristos __kernel_tanpil(long double x)
42*cfe182f3Schristos {
43*cfe182f3Schristos long double hi, lo, t;
44*cfe182f3Schristos
45*cfe182f3Schristos if (x < 0.25) {
46*cfe182f3Schristos hi = (float)x;
47*cfe182f3Schristos lo = x - hi;
48*cfe182f3Schristos lo = lo * (pi_lo + pi_hi) + hi * pi_lo;
49*cfe182f3Schristos hi *= pi_hi;
50*cfe182f3Schristos _2sumF(hi, lo);
51*cfe182f3Schristos t = __kernel_tanl(hi, lo, -1);
52*cfe182f3Schristos } else if (x > 0.25) {
53*cfe182f3Schristos x = 0.5 - x;
54*cfe182f3Schristos hi = (float)x;
55*cfe182f3Schristos lo = x - hi;
56*cfe182f3Schristos lo = lo * (pi_lo + pi_hi) + hi * pi_lo;
57*cfe182f3Schristos hi *= pi_hi;
58*cfe182f3Schristos _2sumF(hi, lo);
59*cfe182f3Schristos t = - __kernel_tanl(hi, lo, 1);
60*cfe182f3Schristos } else
61*cfe182f3Schristos t = 1;
62*cfe182f3Schristos
63*cfe182f3Schristos return (t);
64*cfe182f3Schristos }
65*cfe182f3Schristos
66*cfe182f3Schristos static volatile const double vzero = 0;
67*cfe182f3Schristos
68*cfe182f3Schristos long double
tanpil(long double x)69*cfe182f3Schristos tanpil(long double x)
70*cfe182f3Schristos {
71*cfe182f3Schristos long double ax, hi, lo, odd, t;
72*cfe182f3Schristos uint64_t lx;
73*cfe182f3Schristos uint32_t j0;
74*cfe182f3Schristos uint16_t hx, ix;
75*cfe182f3Schristos
76*cfe182f3Schristos EXTRACT_LDBL80_WORDS(hx, lx, x);
77*cfe182f3Schristos ix = hx & 0x7fff;
78*cfe182f3Schristos INSERT_LDBL80_WORDS(ax, ix, lx);
79*cfe182f3Schristos
80*cfe182f3Schristos ENTERI();
81*cfe182f3Schristos
82*cfe182f3Schristos if (ix < 0x3fff) { /* |x| < 1 */
83*cfe182f3Schristos if (ix < 0x3ffe) { /* |x| < 0.5 */
84*cfe182f3Schristos if (ix < 0x3fdd) { /* |x| < 0x1p-34 */
85*cfe182f3Schristos if (x == 0)
86*cfe182f3Schristos RETURNI(x);
87*cfe182f3Schristos INSERT_LDBL80_WORDS(hi, hx,
88*cfe182f3Schristos lx & 0xffffffff00000000ull);
89*cfe182f3Schristos hi *= 0x1p63L;
90*cfe182f3Schristos lo = x * 0x1p63L - hi;
91*cfe182f3Schristos t = (pi_lo + pi_hi) * lo + pi_lo * hi +
92*cfe182f3Schristos pi_hi * hi;
93*cfe182f3Schristos RETURNI(t * 0x1p-63L);
94*cfe182f3Schristos }
95*cfe182f3Schristos t = __kernel_tanpil(ax);
96*cfe182f3Schristos } else if (ax == 0.5)
97*cfe182f3Schristos t = 1 / vzero;
98*cfe182f3Schristos else
99*cfe182f3Schristos t = -__kernel_tanpil(1 - ax);
100*cfe182f3Schristos RETURNI((hx & 0x8000) ? -t : t);
101*cfe182f3Schristos }
102*cfe182f3Schristos
103*cfe182f3Schristos if (ix < 0x403e) { /* 1 <= |x| < 0x1p63 */
104*cfe182f3Schristos FFLOORL80(x, j0, ix, lx); /* Integer part of ax. */
105*cfe182f3Schristos odd = (uint64_t)x & 1 ? -1 : 1;
106*cfe182f3Schristos ax -= x;
107*cfe182f3Schristos EXTRACT_LDBL80_WORDS(ix, lx, ax);
108*cfe182f3Schristos
109*cfe182f3Schristos if (ix < 0x3ffe) /* |x| < 0.5 */
110*cfe182f3Schristos t = ix == 0 ? copysignl(0, odd) : __kernel_tanpil(ax);
111*cfe182f3Schristos else if (ax == 0.5L)
112*cfe182f3Schristos t = odd / vzero;
113*cfe182f3Schristos else
114*cfe182f3Schristos t = -__kernel_tanpil(1 - ax);
115*cfe182f3Schristos RETURNI((hx & 0x8000) ? -t : t);
116*cfe182f3Schristos }
117*cfe182f3Schristos
118*cfe182f3Schristos /* x = +-inf or nan. */
119*cfe182f3Schristos if (ix >= 0x7fff)
120*cfe182f3Schristos RETURNI(vzero / vzero);
121*cfe182f3Schristos
122*cfe182f3Schristos /*
123*cfe182f3Schristos * For 0x1p63 <= |x| < 0x1p64 need to determine if x is an even
124*cfe182f3Schristos * or odd integer to set t = +0 or -0.
125*cfe182f3Schristos * For |x| >= 0x1p64, it is always an even integer, so t = 0.
126*cfe182f3Schristos */
127*cfe182f3Schristos t = ix >= 0x403f ? 0 : (copysignl(0, (lx & 1) ? -1 : 1));
128*cfe182f3Schristos RETURNI((hx & 0x8000) ? -t : t);
129*cfe182f3Schristos }
130