Home | History | Annotate | Download | only in math

Lines Matching defs:jz

90  * 	jz	local integer variable indicating the number of
156 	int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih;
178 	jz = jk;
181 	for(i=0,j=jz,z=q[jz];j>0;i++,j--) {
193 	if(q0>0) {	/* need iq[jz-1] to determine n */
194 	    i  = (iq[jz-1]>>(24-q0)); n += i;
195 	    iq[jz-1] -= i<<(24-q0);
196 	    ih = iq[jz-1]>>(23-q0);
198 	else if(q0==0) ih = iq[jz-1]>>23;
203 	    for(i=0;i<jz ;i++) {	/* compute 1-q */
214 	    	   iq[jz-1] &= 0x7fffff; break;
216 	    	   iq[jz-1] &= 0x3fffff; break;
228 	    for (i=jz-1;i>=jk;i--) j |= iq[i];
232 		for(i=jz+1;i<=jz+k;i++) {   /* add q[jz+1] to q[jz+k] */
237 		jz += k;
244 	    jz -= 1; q0 -= 24;
245 	    while(iq[jz]==0) { jz--; q0-=24;}
250 		iq[jz] = (int32_t)(z-two24*fw);
251 		jz += 1; q0 += 24;
252 		iq[jz] = (int32_t) fw;
253 	    } else iq[jz] = (int32_t) z ;
258 	for(i=jz;i>=0;i--) {
262     /* compute PIo2[0,...,jp]*q[jz,...,0] */
263 	for(i=jz;i>=0;i--) {
264 	    for(fw=0.0,k=0;k<=jp&&k<=jz-i;k++) fw += PIo2[k]*q[i+k];
265 	    fq[jz-i] = fw;
272 		for (i=jz;i>=0;i--) fw += fq[i];
278 		for (i=jz;i>=0;i--) fw += fq[i];
281 		for (i=1;i<=jz;i++) fw += fq[i];
285 		for (i=jz;i>0;i--) {
293 		for (i=jz;i>1;i--) {
301 		for (fw=0.0,i=jz;i>=2;i--) fw += fq[i];