Lines Matching refs:iq
222 * iq[] integer array by breaking up q[] in 24-bits chunk.
261 int jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih;
284 /* distill q[] into iq[] reversingly */
287 iq[i] = (int)(z-two24B*fw);
297 if(q0>0) { /* need iq[jz-1] to determine n */
298 i = (iq[jz-1]>>(24-q0)); n += i;
299 iq[jz-1] -= i<<(24-q0);
300 ih = iq[jz-1]>>(23-q0);
302 else if(q0==0) ih = iq[jz-1]>>23;
308 j = iq[i];
311 carry = 1; iq[i] = 0x1000000- j;
313 } else iq[i] = 0xffffff - j;
318 iq[jz-1] &= 0x7fffff; break;
320 iq[jz-1] &= 0x3fffff; break;
332 for (i=jz-1;i>=jk;i--) j |= iq[i];
334 for(k=1;iq[jk-k]==0;k++); /* k = no. of terms needed */
349 while(iq[jz]==0) { jz--; q0-=24;}
354 iq[jz] = (int)(z-two24B*fw);
356 iq[jz] = (int) fw;
357 } else iq[jz] = (int) z ;
363 q[i] = fw*(double)iq[i]; fw*=twon24;