Lines Matching defs:jk
87 * jk jk+1 is the initial number of terms of ipio2[] needed
103 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
118 * fq[] final product of x*(2/pi) in fq[0],..,fq[jk]
137 static const int init_jk[] = {2,3,4,6}; /* initial value for jk */
158 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih;
161 /* initialize jk*/
162 jk = init_jk[prec];
163 jp = jk;
170 /* set up f[0] to f[jx+jk] where f[jx+jk] = ipio2[jv+jk] */
171 j = jv-jx; m = jx+jk;
174 /* compute q[0],q[1],...q[jk] */
175 for (i=0;i<=jk;i++) {
179 jz = jk;
229 for (i=jz-1;i>=jk;i--) j |= iq[i];
231 for(k=1;iq[jk-k]==0;k++); /* k = no. of terms needed */
