Lines Matching refs:jk
75 * jk jk+1 is the initial number of terms of ipio2[] needed
77 * for jk is 3,4,4,6 for single, double, extended, and quad.
78 * jk+1 must be 2 larger than you might expect so that our
96 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
111 * fq[] final product of x*(2/pi) in fq[0],..,fq[jk]
127 static const int init_jk[] = {3,4,4,6}; /* initial value for jk */
138 * NB: This table must have at least (e0-3)/24 + jk terms.
139 * For quad precision (e0 <= 16360, jk = 6), this is 686.
275 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih;
278 /* initialize jk*/
279 jk = init_jk[prec];
280 jp = jk;
287 /* set up f[0] to f[jx+jk] where f[jx+jk] = ipio2[jv+jk] */
288 j = jv-jx; m = jx+jk;
292 /* compute q[0],q[1],...q[jk] */
293 for (i=0; i<=jk; i++) {
299 jz = jk;
352 for (i=jz-1; i>=jk; i--) j |= iq[i];
354 for (k=1; iq[jk-k]==0; k++); /* k = no. of terms needed */