xref: /freebsd/lib/msun/ld128/s_tanpil.c (revision 6312d144613f97bf59703c442ee4871be1450c46)
1dce5f3abSSteve Kargl /*-
2dce5f3abSSteve Kargl  * Copyright (c) 2017 Steven G. Kargl
3dce5f3abSSteve Kargl  * All rights reserved.
4dce5f3abSSteve Kargl  *
5dce5f3abSSteve Kargl  * Redistribution and use in source and binary forms, with or without
6dce5f3abSSteve Kargl  * modification, are permitted provided that the following conditions
7dce5f3abSSteve Kargl  * are met:
8dce5f3abSSteve Kargl  * 1. Redistributions of source code must retain the above copyright
9dce5f3abSSteve Kargl  *    notice unmodified, this list of conditions, and the following
10dce5f3abSSteve Kargl  *    disclaimer.
11dce5f3abSSteve Kargl  * 2. Redistributions in binary form must reproduce the above copyright
12dce5f3abSSteve Kargl  *    notice, this list of conditions and the following disclaimer in the
13dce5f3abSSteve Kargl  *    documentation and/or other materials provided with the distribution.
14dce5f3abSSteve Kargl  *
15dce5f3abSSteve Kargl  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
16dce5f3abSSteve Kargl  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17dce5f3abSSteve Kargl  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18dce5f3abSSteve Kargl  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
19dce5f3abSSteve Kargl  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20dce5f3abSSteve Kargl  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21dce5f3abSSteve Kargl  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22dce5f3abSSteve Kargl  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23dce5f3abSSteve Kargl  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24dce5f3abSSteve Kargl  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25dce5f3abSSteve Kargl  */
26dce5f3abSSteve Kargl 
27dce5f3abSSteve Kargl /*
28dce5f3abSSteve Kargl  * See ../src/s_tanpi.c for implementation details.
29dce5f3abSSteve Kargl  *
30dce5f3abSSteve Kargl  * FIXME: This has not been compiled nor has it been tested for accuracy.
31dce5f3abSSteve Kargl  * FIXME: This should use bit twiddling.
32dce5f3abSSteve Kargl  */
33dce5f3abSSteve Kargl 
34dce5f3abSSteve Kargl #include "math.h"
35dce5f3abSSteve Kargl #include "math_private.h"
36dce5f3abSSteve Kargl 
37dce5f3abSSteve Kargl /*
38dce5f3abSSteve Kargl  * pi_hi contains the leading 56 bits of a 169 bit approximation for pi.
39dce5f3abSSteve Kargl  */
40dce5f3abSSteve Kargl static const long double
41dce5f3abSSteve Kargl pi_hi = 3.14159265358979322702026593105983920e+00L,
42dce5f3abSSteve Kargl pi_lo = 1.14423774522196636802434264184180742e-17L;
43dce5f3abSSteve Kargl 
44dce5f3abSSteve Kargl static inline long double
45*6312d144SKonstantin Belousov __kernel_tanpil(long double x)
46dce5f3abSSteve Kargl {
47dce5f3abSSteve Kargl 	long double hi, lo, t;
48dce5f3abSSteve Kargl 
49dce5f3abSSteve Kargl 	if (x < 0.25) {
50dce5f3abSSteve Kargl 		hi = (double)x;
51dce5f3abSSteve Kargl 		lo = x - hi;
52dce5f3abSSteve Kargl 		lo = lo * (pi_lo + pi_hi) + hi * pi_lo;
53dce5f3abSSteve Kargl 		hi *= pi_hi;
54dce5f3abSSteve Kargl 		_2sumF(hi, lo);
55dce5f3abSSteve Kargl 		t = __kernel_tanl(hi, lo, -1);
56dce5f3abSSteve Kargl 	} else if (x > 0.25) {
57dce5f3abSSteve Kargl 		x = 0.5 - x;
58dce5f3abSSteve Kargl 		hi = (double)x;
59dce5f3abSSteve Kargl 		lo = x - hi;
60dce5f3abSSteve Kargl 		lo = lo * (pi_lo + pi_hi) + hi * pi_lo;
61dce5f3abSSteve Kargl 		hi *= pi_hi;
62dce5f3abSSteve Kargl 		_2sumF(hi, lo);
63dce5f3abSSteve Kargl 		t = - __kernel_tanl(hi, lo, 1);
64dce5f3abSSteve Kargl 	} else
65dce5f3abSSteve Kargl 		t = 1;
66dce5f3abSSteve Kargl 
67dce5f3abSSteve Kargl 	return (t);
68dce5f3abSSteve Kargl }
69dce5f3abSSteve Kargl 
70dce5f3abSSteve Kargl volatile static const double vzero = 0;
71dce5f3abSSteve Kargl 
72dce5f3abSSteve Kargl long double
73dce5f3abSSteve Kargl tanpil(long double x)
74dce5f3abSSteve Kargl {
75*6312d144SKonstantin Belousov 	long double ax, hi, lo, xf, t;
76dce5f3abSSteve Kargl 	uint32_t ix;
77dce5f3abSSteve Kargl 
78dce5f3abSSteve Kargl 	ax = fabsl(ax);
79dce5f3abSSteve Kargl 
80dce5f3abSSteve Kargl 	if (ax < 1) {
81dce5f3abSSteve Kargl 		if (ax < 0.5) {
82dce5f3abSSteve Kargl 			if (ax < 0x1p-60) {
83dce5f3abSSteve Kargl 				if (x == 0)
84dce5f3abSSteve Kargl 					return (x);
85dce5f3abSSteve Kargl 				hi = (double)x;
86*6312d144SKonstantin Belousov 				hi *= 0x1p113L;
87dce5f3abSSteve Kargl 				lo = x * 0x1p113L - hi;
88dce5f3abSSteve Kargl 				t = (pi_lo + pi_hi) * lo + pi_lo * lo +
89dce5f3abSSteve Kargl 				    pi_hi * hi;
90dce5f3abSSteve Kargl 				return (t * 0x1p-113L);
91dce5f3abSSteve Kargl 			}
92dce5f3abSSteve Kargl 			t = __kernel_tanpil(ax);
93dce5f3abSSteve Kargl 		} else if (ax == 0.5)
94dce5f3abSSteve Kargl 			return ((ax - ax) / (ax - ax));
95dce5f3abSSteve Kargl 		else
96dce5f3abSSteve Kargl 			t = -__kernel_tanpil(1 - ax);
97dce5f3abSSteve Kargl 		return (copysignl(t, x));
98dce5f3abSSteve Kargl 	}
99dce5f3abSSteve Kargl 
100dce5f3abSSteve Kargl 	if (ix < 0x1p112) {
101dce5f3abSSteve Kargl 		xf = floorl(ax);
102dce5f3abSSteve Kargl 		ax -= xf;
103dce5f3abSSteve Kargl 		if (ax < 0.5)
104dce5f3abSSteve Kargl 			t = ax == 0 ? 0 : __kernel_tanpil(ax);
105dce5f3abSSteve Kargl 		else if (ax == 0.5)
106dce5f3abSSteve Kargl 			return ((ax - ax) / (ax - ax));
107dce5f3abSSteve Kargl 		else
108dce5f3abSSteve Kargl 			t = -__kernel_tanpil(1 - ax);
109dce5f3abSSteve Kargl 		return (copysignl(t, x));
110dce5f3abSSteve Kargl 	}
111dce5f3abSSteve Kargl 
112dce5f3abSSteve Kargl 	/* x = +-inf or nan. */
113dce5f3abSSteve Kargl 	if (isinf(x) || isnan(x))
114dce5f3abSSteve Kargl 		return (vzero / vzero);
115dce5f3abSSteve Kargl 
116dce5f3abSSteve Kargl 	/*
117dce5f3abSSteve Kargl 	 * |x| >= 0x1p53 is always an integer, so return +-0.
118dce5f3abSSteve Kargl 	 */
119dce5f3abSSteve Kargl 	return (copysignl(0, x));
120dce5f3abSSteve Kargl }
121