1 /* @(#)k_sin.c 5.1 93/09/24 */
3 * ====================================================
4 * Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
6 * Developed at SunPro, a Sun Microsystems, Inc. business.
7 * Permission to use, copy, modify, and distribute this
8 * software is freely granted, provided that this notice
10 * ====================================================
12 * $FreeBSD: src/lib/msun/src/k_sin.c,v 1.5 1999/08/28 00:06:41 peter Exp $
13 * $DragonFly: src/lib/msun/src/Attic/k_sin.c,v 1.2 2003/06/17 04:26:53 dillon Exp $
16 /* __kernel_sin( x, y, iy)
17 * kernel sin function on [-pi/4, pi/4], pi/4 ~ 0.7854
18 * Input x is assumed to be bounded by ~pi/4 in magnitude.
19 * Input y is the tail of x.
20 * Input iy indicates whether y is 0. (if iy=0, y assume to be 0).
23 * 1. Since sin(-x) = -sin(x), we need only to consider positive x.
24 * 2. if x < 2^-27 (hx<0x3e400000 0), return x with inexact if x!=0.
25 * 3. sin(x) is approximated by a polynomial of degree 13 on
28 * sin(x) ~ x + S1*x + ... + S6*x
31 * |sin(x) 2 4 6 8 10 12 | -58
32 * |----- - (1+S1*x +S2*x +S3*x +S4*x +S5*x +S6*x )| <= 2
35 * 4. sin(x+y) = sin(x) + sin'(x')*y
36 * ~ sin(x) + (1-x*x/2)*y
37 * For better accuracy, let
39 * r = x *(S2+x *(S3+x *(S4+x *(S5+x *S6))))
41 * sin(x) = x + (S1*x + (x *(r-y/2)+y))
45 #include "math_private.h"
52 half = 5.00000000000000000000e-01, /* 0x3FE00000, 0x00000000 */
53 S1 = -1.66666666666666324348e-01, /* 0xBFC55555, 0x55555549 */
54 S2 = 8.33333333332248946124e-03, /* 0x3F811111, 0x1110F8A6 */
55 S3 = -1.98412698298579493134e-04, /* 0xBF2A01A0, 0x19C161D5 */
56 S4 = 2.75573137070700676789e-06, /* 0x3EC71DE3, 0x57B1FE7D */
57 S5 = -2.50507602534068634195e-08, /* 0xBE5AE5E6, 0x8A2B9CEB */
58 S6 = 1.58969099521155010221e-10; /* 0x3DE5D93A, 0x5ACFD57C */
61 double __kernel_sin(double x, double y, int iy)
63 double __kernel_sin(x, y, iy)
64 double x,y; int iy; /* iy=0 if y is zero */
70 ix &= 0x7fffffff; /* high word of x */
71 if(ix<0x3e400000) /* |x| < 2**-27 */
72 {if((int)x==0) return x;} /* generate inexact */
75 r = S2+z*(S3+z*(S4+z*(S5+z*S6)));
76 if(iy==0) return x+v*(S1+z*r);
77 else return x-((z*(half*y-v*r)-y)-v*S1);