Lines Matching defs:iq
137 * iq[] integer array by breaking up q[] in 24-bits chunk.
192 int jz, jx, jv, jp, jk, carry, n, iq[20], i, j, k, m, q0, ih;
228 /* distill q[] into iq[] reversingly */
232 iq[i] = (int) (z - two24 * fw);
242 if (q0 > 0) /* need iq[jz - 1] to determine n */
244 i = (iq[jz - 1] >> (24 - q0));
246 iq[jz - 1] -= i << (24 - q0);
247 ih = iq[jz - 1] >> (23 - q0);
251 ih = iq[jz - 1] >> 23;
264 j = iq[i];
270 iq[i] = 0x1000000 - j;
275 iq[i] = 0xffffff - j;
284 iq[jz - 1] &= 0x7fffff;
289 iq[jz - 1] &= 0x3fffff;
310 j |= iq[i];
314 for (k = 1; iq[jk - k] == 0; k++) /* k = no. of terms needed */
337 while (iq[jz] == 0)
349 iq[jz] = (int) (z - two24 * fw);
352 iq[jz] = (int) fw;
356 iq[jz] = (int) z;
364 q[i] = fw * (double) iq[i];