1dce5f3abSSteve Kargl /*-
2*2d3b0a68SSteve Kargl * Copyright (c) 2017-2023 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_sinpi.c for implementation details.
29dce5f3abSSteve Kargl */
30dce5f3abSSteve Kargl
31*2d3b0a68SSteve Kargl #include "fpmath.h"
32dce5f3abSSteve Kargl #include "math.h"
33dce5f3abSSteve Kargl #include "math_private.h"
34dce5f3abSSteve Kargl
35dce5f3abSSteve Kargl /*
36dce5f3abSSteve Kargl * pi_hi contains the leading 56 bits of a 169 bit approximation for pi.
37dce5f3abSSteve Kargl */
38dce5f3abSSteve Kargl static const long double
39dce5f3abSSteve Kargl pi_hi = 3.14159265358979322702026593105983920e+00L,
40dce5f3abSSteve Kargl pi_lo = 1.14423774522196636802434264184180742e-17L;
41dce5f3abSSteve Kargl
42dce5f3abSSteve Kargl #include "k_cospil.h"
43dce5f3abSSteve Kargl #include "k_sinpil.h"
44dce5f3abSSteve Kargl
45dce5f3abSSteve Kargl volatile static const double vzero = 0;
46dce5f3abSSteve Kargl
47dce5f3abSSteve Kargl long double
sinpil(long double x)48dce5f3abSSteve Kargl sinpil(long double x)
49dce5f3abSSteve Kargl {
50*2d3b0a68SSteve Kargl long double ai, ar, ax, hi, lo, s, xhi, xlo;
51dce5f3abSSteve Kargl
52dce5f3abSSteve Kargl ax = fabsl(x);
53dce5f3abSSteve Kargl
54dce5f3abSSteve Kargl if (ax < 1) {
55dce5f3abSSteve Kargl if (ax < 0.25) {
56dce5f3abSSteve Kargl if (ax < 0x1p-60) {
57dce5f3abSSteve Kargl if (x == 0)
58dce5f3abSSteve Kargl return (x);
59dce5f3abSSteve Kargl hi = (double)x;
60dce5f3abSSteve Kargl hi *= 0x1p113L;
61dce5f3abSSteve Kargl lo = x * 0x1p113L - hi;
62dce5f3abSSteve Kargl s = (pi_lo + pi_hi) * lo + pi_lo * lo +
63dce5f3abSSteve Kargl pi_hi * hi;
64dce5f3abSSteve Kargl return (s * 0x1p-113L);
65dce5f3abSSteve Kargl }
66dce5f3abSSteve Kargl
67dce5f3abSSteve Kargl s = __kernel_sinpil(ax);
684f889260SSteve Kargl return (x < 0 ? -s : s);
69dce5f3abSSteve Kargl }
70dce5f3abSSteve Kargl
71dce5f3abSSteve Kargl if (ax < 0.5)
72dce5f3abSSteve Kargl s = __kernel_cospil(0.5 - ax);
73dce5f3abSSteve Kargl else if (ax < 0.75)
74dce5f3abSSteve Kargl s = __kernel_cospil(ax - 0.5);
75dce5f3abSSteve Kargl else
76dce5f3abSSteve Kargl s = __kernel_sinpil(1 - ax);
774f889260SSteve Kargl return (x < 0 ? -s : s);
78dce5f3abSSteve Kargl }
79dce5f3abSSteve Kargl
80dce5f3abSSteve Kargl if (ax < 0x1p112) {
81*2d3b0a68SSteve Kargl /* Split ax = ai + ar with 0 <= ar < 1. */
82*2d3b0a68SSteve Kargl FFLOORL128(ax, ai, ar);
834f889260SSteve Kargl
84*2d3b0a68SSteve Kargl if (ar == 0) {
85dce5f3abSSteve Kargl s = 0;
86dce5f3abSSteve Kargl } else {
87*2d3b0a68SSteve Kargl if (ar < 0.5) {
88*2d3b0a68SSteve Kargl if (ar <= 0.25)
89*2d3b0a68SSteve Kargl s = __kernel_sinpil(ar);
90dce5f3abSSteve Kargl else
91*2d3b0a68SSteve Kargl s = __kernel_cospil(0.5 - ar);
92dce5f3abSSteve Kargl } else {
93*2d3b0a68SSteve Kargl if (ar < 0.75)
94*2d3b0a68SSteve Kargl s = __kernel_cospil(ar - 0.5);
95dce5f3abSSteve Kargl else
96*2d3b0a68SSteve Kargl s = __kernel_sinpil(1 - ar);
97dce5f3abSSteve Kargl }
98dce5f3abSSteve Kargl
99*2d3b0a68SSteve Kargl s = fmodl(ai, 2.L) == 0 ? s : -s;
100dce5f3abSSteve Kargl }
1014f889260SSteve Kargl return (x < 0 ? -s : s);
102dce5f3abSSteve Kargl }
103dce5f3abSSteve Kargl
104dce5f3abSSteve Kargl if (isinf(x) || isnan(x))
105dce5f3abSSteve Kargl return (vzero / vzero);
106dce5f3abSSteve Kargl
107dce5f3abSSteve Kargl /*
108dce5f3abSSteve Kargl * |x| >= 0x1p112 is always an integer, so return +-0.
109dce5f3abSSteve Kargl */
110dce5f3abSSteve Kargl return (copysignl(0, x));
111dce5f3abSSteve Kargl }
112