14 /* PI / 4.  */
20   double sign[4];		/* Sign of sine in quadrants 0..3.  */
30 /* Table with 4/PI to 192 bit precision.  */
40 /* Compute the sine and cosine of inputs X and X2 (X squared), using the
44 sincosf_poly (double x, double x2, const sincos_t *p, int n, float *sinp,  in sincosf_poly()  argument
49   x4 = x2 * x2;  in sincosf_poly()
50   x3 = x2 * x;  in sincosf_poly()
51   c2 = p->c3 + x2 * p->c4;  in sincosf_poly()
52   s1 = p->s2 + x2 * p->s3;  in sincosf_poly()
59   c1 = p->c0 + x2 * p->c1;  in sincosf_poly()
60   x5 = x3 * x2;  in sincosf_poly()
61   x6 = x4 * x2;  in sincosf_poly()
70 /* Return the sine of inputs X and X2 (X squared) using the polynomial P.
73 sinf_poly (double x, double x2, const sincos_t *p, int n)  in sinf_poly()  argument
79       x3 = x * x2;  in sinf_poly()
80       s1 = p->s2 + x2 * p->s3;  in sinf_poly()
82       x7 = x3 * x2;  in sinf_poly()
89       x4 = x2 * x2;  in sinf_poly()
90       c2 = p->c3 + x2 * p->c4;  in sinf_poly()
91       c1 = p->c0 + x2 * p->c1;  in sinf_poly()
93       x6 = x4 * x2;  in sinf_poly()
101    X as a value between -PI/4 and PI/4 and store the quadrant in NP.
103    is accurate to 55 bits and the worst-case cancellation happens at 6 * PI/4,
127    Return the modulo between -PI/4 and PI/4 and store the quadrant in NP.
128    Reduction uses a table of 4/PI with 192 bits of precision.  A 32x96->128 bit
143   res1 = (uint64_t)xi * arr[4];  in reduce_large()