Lines Matching full:iq
110 * iq[] integer array by breaking up q[] in 24-bits chunk.
292 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; in __kernel_rem_pio2() local
315 /* distill q[] into iq[] reversingly */ in __kernel_rem_pio2()
318 iq[i] = (int32_t)(z-two24*fw); in __kernel_rem_pio2()
328 if(q0>0) { /* need iq[jz-1] to determine n */ in __kernel_rem_pio2()
329 i = (iq[jz-1]>>(24-q0)); n += i; in __kernel_rem_pio2()
330 iq[jz-1] -= i<<(24-q0); in __kernel_rem_pio2()
331 ih = iq[jz-1]>>(23-q0); in __kernel_rem_pio2()
333 else if(q0==0) ih = iq[jz-1]>>23; in __kernel_rem_pio2()
339 j = iq[i]; in __kernel_rem_pio2()
342 carry = 1; iq[i] = 0x1000000- j; in __kernel_rem_pio2()
344 } else iq[i] = 0xffffff - j; in __kernel_rem_pio2()
349 iq[jz-1] &= 0x7fffff; break; in __kernel_rem_pio2()
351 iq[jz-1] &= 0x3fffff; break; in __kernel_rem_pio2()
363 for (i=jz-1;i>=jk;i--) j |= iq[i]; in __kernel_rem_pio2()
365 for(k=1;iq[jk-k]==0;k++); /* k = no. of terms needed */ in __kernel_rem_pio2()
380 while(iq[jz]==0) { jz--; q0-=24;} in __kernel_rem_pio2()
385 iq[jz] = (int32_t)(z-two24*fw); in __kernel_rem_pio2()
387 iq[jz] = (int32_t) fw; in __kernel_rem_pio2()
388 } else iq[jz] = (int32_t) z ; in __kernel_rem_pio2()
394 q[i] = fw*(double)iq[i]; fw*=twon24; in __kernel_rem_pio2()