Lines Matching refs:jk
406 * jk jk+1 is the initial number of terms of ipio2[] needed
422 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
437 * fq[] final product of x*(2/pi) in fq[0],..,fq[jk]
451 static const int init_jk[] = {2, 3, 4, 6}; /* initial value for jk */
470 int32_t jz, jx, jv, jp, jk, carry, n, iq[20], i, j, k, m, q0, ih;
473 /* initialize jk*/
474 jk = init_jk[prec];
475 jp = jk;
483 /* set up f[0] to f[jx+jk] where f[jx+jk] = ipio2[jv+jk] */
485 m = jx + jk;
490 /* compute q[0],q[1],...q[jk] */
491 for (i = 0; i <= jk; i++) {
496 jz = jk;
555 for (i = jz - 1; i >= jk; i--) j |= iq[i];
557 for (k = 1; jk >= k && iq[jk - k] == 0; k++) {