Lines Matching defs:jk
83 * jk jk+1 is the initial number of terms of ipio2[] needed
99 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
114 * fq[] final product of x*(2/pi) in fq[0],..,fq[jk]
133 static const int init_jk[] = {2,3,4,6}; /* initial value for jk */
170 int jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih;
173 /* initialize jk*/
174 jk = init_jk[prec];
175 jp = jk;
182 /* set up f[0] to f[jx+jk] where f[jx+jk] = ipio2[jv+jk] */
183 j = jv-jx; m = jx+jk;
186 /* compute q[0],q[1],...q[jk] */
187 for (i=0;i<=jk;i++) {
191 jz = jk;
241 for (i=jz-1;i>=jk;i--) j |= iq[i];
243 for(k=1;iq[jk-k]==0;k++); /* k = no. of terms needed */
