Lines Matching defs:iq
112 * iq[] integer array by breaking up q[] in 24-bits chunk.
170 int jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih;
193 /* distill q[] into iq[] reversingly */
196 iq[i] = (int)(z-two24*fw);
206 if(q0>0) { /* need iq[jz-1] to determine n */
207 i = (iq[jz-1]>>(24-q0)); n += i;
208 iq[jz-1] -= i<<(24-q0);
209 ih = iq[jz-1]>>(23-q0);
211 else if(q0==0) ih = iq[jz-1]>>23;
217 j = iq[i];
220 carry = 1; iq[i] = 0x1000000- j;
222 } else iq[i] = 0xffffff - j;
227 iq[jz-1] &= 0x7fffff; break;
229 iq[jz-1] &= 0x3fffff; break;
241 for (i=jz-1;i>=jk;i--) j |= iq[i];
243 for(k=1;iq[jk-k]==0;k++); /* k = no. of terms needed */
258 while(iq[jz]==0) { jz--; q0-=24;}
263 iq[jz] = (int)(z-two24*fw);
265 iq[jz] = (int) fw;
266 } else iq[jz] = (int) z ;
272 q[i] = fw*(double)iq[i]; fw*=twon24;
