Searched refs:ipio2 (Results 1 - 3 of 3) sorted by relevance

/illumos-gate/usr/src/lib/libmvec/common/
H A D__vrem_pio2m.c64 * array ipio2 of the first term we need to use. The variable eq0
133 static const double ipio2[] = { variable
181 /* compute q[0,...,5] = x * ipio2 and initialize nq and eqnqm1 */
183 q[0] = x[0] * ipio2[ip+2] + x[1] * ipio2[ip+1] + x[2] * ipio2[ip];
184 q[1] = x[0] * ipio2[ip+3] + x[1] * ipio2[ip+2] + x[2] * ipio2[ip+1];
185 q[2] = x[0] * ipio2[i
[all...]
/illumos-gate/usr/src/lib/libm/common/Q/
H A D__rem_pio2l.c57 const int *ipio2; local
75 ipio2 = _TBL_ipio2l_inf;
76 n = __rem_pio2m(t, v, e0, nx, 3, (const int *) ipio2);
/illumos-gate/usr/src/lib/libm/common/C/
H A D__rem_pio2m.c30 * int __rem_pio2m(x,y,e0,nx,prec,ipio2)
31 * double x[],y[]; int e0,nx,prec; const int ipio2[];
43 * (2/PI) is represented by an array of 24-bit integers in ipio2[].
86 * ipio2[]
91 * ipio2[i] * 2^(-24(i+1)).
99 * jk jk+1 is the initial number of terms of ipio2[] needed
104 * terms of ipio2[] used.
108 * jv index for pointing to the suitable ipio2[] for the
110 * ( 2^e0*x[0] * ipio2[jv-1]*2^(-24jv) )/8
126 * f[] ipio2[] i
166 __rem_pio2m(double *x, double *y, int e0, int nx, int prec, const int *ipio2) argument
[all...]

Completed in 237 milliseconds