Lines Matching +defs:val +defs:src
91 * the int val.
93 MutableBigInteger(int val) {
96 value[0] = val;
103 MutableBigInteger(int[] val) {
104 value = val;
105 intLen = val.length;
121 MutableBigInteger(MutableBigInteger val) {
122 intLen = val.intLen;
123 value = Arrays.copyOfRange(val.value, val.offset, val.offset + intLen);
247 int[] val = value;
251 long v = val[i++] & LONG_MASK;
342 * Sets the int at index+offset in this MutableBigInteger to val.
346 void setInt(int index, int val) {
347 value[offset + index] = val;
354 void setValue(int[] val, int length) {
355 value = val;
364 void copyValue(MutableBigInteger src) {
365 int len = src.intLen;
368 System.arraycopy(src.value, src.offset, value, 0, len);
377 void copyValue(int[] val) {
378 int len = val.length;
381 System.arraycopy(val, 0, value, 0, len);
552 int[] val = value;
554 for (int i=offset+intLen-1, c=val[i]; i>offset; i--) {
556 c = val[i-1];
557 val[i] = (c << n2) | (b >>> n);
559 val[offset] >>>= n;
568 int[] val = value;
570 for (int i=offset, c=val[i], m=i+intLen-1; i<m; i++) {
572 c = val[i+1];
573 val[i] = (b << n) | (c >>> n2);
575 val[offset+intLen-1] <<= n;
1293 * Returns the multiplicative inverse of val mod 2^32. Assumes val is odd.
1295 static int inverseMod32(int val) {
1297 int t = val;
1298 t *= 2 - val*t;
1299 t *= 2 - val*t;
1300 t *= 2 - val*t;
1301 t *= 2 - val*t;