Lines Matching defs:ipio2
31 * (2/pi) is represented by an array of 24-bit integers in ipio2[].
64 * expand the ipio2 table.
80 * jk jk+1 is the initial number of terms of ipio2[] needed
90 * terms of ipio2[] used.
94 * jv index for pointing to the suitable ipio2[] for the
96 * ( 2^e0*x[0] * ipio2[jv-1]*2^(-24jv) )/8
112 * f[] ipio2[] in floating point
146 * ipio2[i] * 2^(-24(i+1)).
151 static const int32_t ipio2[] = {
166 #error "ipio2 table needs to be expanded"
308 /* set up f[0] to f[jx+jk] where f[jx+jk] = ipio2[jv+jk] */
310 for(i=0;i<=m;i++,j++) f[i] = (j<0)? zero : (double) ipio2[j];
372 f[jx+i] = (double) ipio2[jv+i];