Lines Matching refs:i
67 int i = nd0; in FDBigInt() local
70 while ( i < limit ){ in FDBigInt()
71 int ilim = i+5; in FDBigInt()
72 v = (int)digit[i++]-(int)'0'; in FDBigInt()
73 while( i <ilim ){ in FDBigInt()
74 v = 10*v + (int)digit[i++]-(int)'0'; in FDBigInt()
80 while ( i < nd ){ in FDBigInt()
81 v = 10*v + (int)digit[i++]-(int)'0'; in FDBigInt()
204 for( int i=0; i < nWords; i++ ) { in mult()
205 p += v * ((long)data[i]&0xffffffffL); in mult()
206 r[i] = (int)p; in mult()
231 for( int i=1; i < nWords; i++ ) { in multaddMe()
232 p += v * ((long)data[i]&0xffffffffL); in multaddMe()
233 data[i] = (int)p; in multaddMe()
250 int i; in mult() local
253 for( i = 0; i < this.nWords; i++ ){ in mult()
254 long v = (long)this.data[i] & 0xffffffffL; // UNSIGNED CONVERSION in mult()
258 …p += ((long)r[i+j]&0xffffffffL) + v*((long)other.data[j]&0xffffffffL); // UNSIGNED CONVERSIONS ALL… in mult()
259 r[i+j] = (int)p; in mult()
262 r[i+j] = (int)p; in mult()
265 for ( i = r.length-1; i> 0; i--) in mult()
266 if ( r[i] != 0 ) in mult()
268 return new FDBigInt( r, i+1 ); in mult()
276 int i; in add() local
294 for ( i = 0; i < n; i++ ){ in add()
295 c += (long)a[i] & 0xffffffffL; in add()
296 if ( i < m ){ in add()
297 c += (long)b[i] & 0xffffffffL; in add()
299 r[i] = (int) c; in add()
306 s[i++] = (int)c; in add()
307 return new FDBigInt( s, i ); in add()
309 return new FDBigInt( r, i ); in add()
319 int i; in sub() local
324 for ( i = 0; i < n; i++ ){ in sub()
325 c += (long)this.data[i] & 0xffffffffL; in sub()
326 if ( i < m ){ in sub()
327 c -= (long)other.data[i] & 0xffffffffL; in sub()
329 if ( ( r[i] = (int) c ) == 0 ) in sub()
336 assert dataInRangeIsZero(i, m, other); // negative result of subtract in sub()
340 private static boolean dataInRangeIsZero(int i, int m, FDBigInt other) { in dataInRangeIsZero() argument
341 while ( i < m ) in dataInRangeIsZero()
342 if (other.data[i++] != 0) in dataInRangeIsZero()
355 int i; in cmp() local
360 for ( i = this.nWords-1; i > j ; i-- ) in cmp()
361 if ( this.data[i] != 0 ) return 1; in cmp()
366 for ( i = other.nWords-1; i > j ; i-- ) in cmp()
367 if ( other.data[i] != 0 ) return -1; in cmp()
369 i = this.nWords-1; in cmp()
371 for ( ; i > 0 ; i-- ) in cmp()
372 if ( this.data[i] != other.data[i] ) in cmp()
376 int a = this.data[i]; in cmp()
377 int b = other.data[i]; in cmp()
421 for ( int i = 0; i <= n ; i++ ){ in quoRemIteration()
422 diff += ((long)data[i]&0xffffffffL) - q*((long)S.data[i]&0xffffffffL); in quoRemIteration()
423 data[i] = (int)diff; in quoRemIteration()
433 for ( int i = 0; i <= n; i++ ){ in quoRemIteration()
434 sum += ((long)data[i]&0xffffffffL) + ((long)S.data[i]&0xffffffffL); in quoRemIteration()
435 data[i] = (int) sum; in quoRemIteration()
455 for ( int i = 0; i <= n; i++ ){ in quoRemIteration()
456 p += 10*((long)data[i]&0xffffffffL); in quoRemIteration()
457 data[i] = (int)p; in quoRemIteration()
481 int i = Math.min( nWords-1, data.length-1) ; in toString() local
485 for( ; i> 0 ; i-- ){ in toString()
486 r.append( Integer.toHexString( data[i] ) ); in toString()