Lines Matching defs:jk
69 // [jk] this is not 100% correct because the float word order may different
193 * jk jk+1 is the initial number of terms of ipio2[] needed
209 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
224 * fq[] final product of x*(2/pi) in fq[0],..,fq[jk]
241 static const int init_jk[] = {2,3,4,6}; /* initial value for jk */
261 int jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih;
264 /* initialize jk*/
265 jk = init_jk[prec];
266 jp = jk;
273 /* set up f[0] to f[jx+jk] where f[jx+jk] = ipio2[jv+jk] */
274 j = jv-jx; m = jx+jk;
277 /* compute q[0],q[1],...q[jk] */
278 for (i=0;i<=jk;i++) {
282 jz = jk;
332 for (i=jz-1;i>=jk;i--) j |= iq[i];
334 for(k=1;iq[jk-k]==0;k++); /* k = no. of terms needed */