Home | History | Annotate | Download | only in base

Lines Matching defs:jz

465  *      jz      local integer variable indicating the number of
525 int32_t jz, jx, jv, jp, jk, carry, n, iq[20], i, j, k, m, q0, ih;
551 jz = jk;
554 for (i = 0, j = jz, z = q[jz]; j > 0; i++, j--) {
566 if (q0 > 0) { /* need iq[jz-1] to determine n */
567 i = (iq[jz - 1] >> (24 - q0));
569 iq[jz - 1] -= i << (24 - q0);
570 ih = iq[jz - 1] >> (23 - q0);
572 ih = iq[jz - 1] >> 23;
580 for (i = 0; i < jz; i++) { /* compute 1-q */
594 iq[jz - 1] &= 0x7fffff;
597 iq[jz - 1] &= 0x3fffff;
610 for (i = jz - 1; i >= jk; i--) j |= iq[i];
616 for (i = jz + 1; i <= jz + k; i++) { /* add q[jz+1] to q[jz+k] */
621 jz += k;
628 jz -= 1;
630 while (iq[jz] == 0) {
631 jz--;
638 iq[jz] = z - two24 * fw;
639 jz += 1;
641 iq[jz] = fw;
643 iq[jz] = z;
649 for (i = jz; i >= 0; i--) {
654 /* compute PIo2[0,...,jp]*q[jz,...,0] */
655 for (i = jz; i >= 0; i--) {
656 for (fw = 0.0, k = 0; k <= jp && k <= jz - i; k++) fw += PIo2[k] * q[i + k];
657 fq[jz - i] = fw;
664 for (i = jz; i >= 0; i--) fw += fq[i];
670 for (i = jz; i >= 0; i--) fw += fq[i];
673 for (i = 1; i <= jz; i++) fw += fq[i];
677 for (i = jz; i > 0; i--) {
682 for (i = jz; i > 1; i--) {
687 for (fw = 0.0, i = jz; i >= 2; i--) fw += fq[i];