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