Lines Matching defs:mag
114 * int ({@code mag[0]}) must be non-zero. This is necessary to
117 * zero-length mag array.
119 final int[] mag;
193 mag = makePositive(val);
196 mag = stripLeadingZeroBytes(val);
197 signum = (mag.length == 0 ? 0 : 1);
212 mag = makePositive(val);
215 mag = trustedStripLeadingZeroInts(val);
216 signum = (mag.length == 0 ? 0 : 1);
237 this.mag = stripLeadingZeroBytes(magnitude);
242 if (this.mag.length==0) {
258 this.mag = stripLeadingZeroInts(magnitude);
263 if (this.mag.length==0) {
320 mag = ZERO.mag;
353 mag = trustedStripLeadingZeroInts(magnitude);
379 mag = ZERO.mag;
407 mag = trustedStripLeadingZeroInts(magnitude);
539 mag = prime.mag;
626 p.mag[p.mag.length-1] &= 0xfffffffe;
637 p.mag[p.mag.length-1] &= 0xfffffffe;
791 int u = n.mag[n.mag.length-1];
925 this.mag = magnitude;
934 this.mag = stripLeadingZeroBytes(magnitude);
973 mag = new int[1];
974 mag[0] = (int)val;
976 mag = new int[2];
977 mag[0] = highWord;
978 mag[1] = (int)val;
1048 return new BigInteger(add(mag, val.mag), signum);
1053 int[] resultMag = (cmp > 0 ? subtract(mag, val.mag)
1054 : subtract(val.mag, mag));
1116 return new BigInteger(add(mag, val.mag), signum);
1121 int[] resultMag = (cmp > 0 ? subtract(mag, val.mag)
1122 : subtract(val.mag, mag));
1169 int[] result = multiplyToLen(mag, mag.length,
1170 val.mag, val.mag.length, null);
1190 int xlen = mag.length;
1191 int[] value = mag;
1259 int[] z = squareToLen(mag, mag.length, null);
1339 a = new MutableBigInteger(this.mag),
1340 b = new MutableBigInteger(val.mag);
1360 a = new MutableBigInteger(this.mag),
1361 b = new MutableBigInteger(val.mag);
1378 a = new MutableBigInteger(this.mag),
1379 b = new MutableBigInteger(val.mag);
1401 int[] baseToPow2 = this.mag;
1528 return new BigInteger(this.mag, -this.signum);
1708 int[] base = mag.clone();
1709 int[] exp = y.mag;
1710 int[] mod = z.mag;
2002 // Copy remaining ints of mag
2004 int[] mag = new int[numInts];
2006 mag[i] = this.mag[i + (this.mag.length - numInts)];
2010 mag[0] &= (1L << (32-excessBits)) - 1;
2012 return (mag[0]==0 ? new BigInteger(1, mag) : new BigInteger(mag, 1));
2075 int magLen = mag.length;
2081 newMag[i] = mag[i];
2085 int highBits = mag[0] >>> nBits2;
2094 newMag[i++] = mag[j++] << nBits | mag[j] >>> nBits2;
2095 newMag[i] = mag[j] << nBits;
2126 int magLen = mag.length;
2137 newMag[i] = mag[i];
2140 int highBits = mag[0] >>> nBits;
2151 newMag[i++] = (mag[j++] << nBits2) | (mag[j] >>> nBits);
2158 onesLost = (mag[i] != 0);
2160 onesLost = (mag[magLen - nInts - 1] << (32 - nBits) != 0);
2398 int[] m = mag;
2404 int magBitLength = ((len - 1) << 5) + bitLengthForInt(mag[0]);
2407 boolean pow2 = (Integer.bitCount(mag[0]) == 1);
2409 pow2 = (mag[i] == 0);
2434 for (int i=0; i<mag.length; i++)
2435 bc += Integer.bitCount(mag[i]);
2439 for (j=mag.length-1; mag[j]==0; j--)
2441 magTrailingZeroCount += Integer.numberOfTrailingZeros(mag[j]);
2515 int[] m1 = mag;
2517 int[] m2 = val.mag;
2551 int[] m = mag;
2553 int[] xm = xInt.mag;
2597 for (int i=0; i<mag.length; i++)
2598 hashCode = (int)(31*hashCode + (mag[i] & LONG_MASK));
2627 int maxNumDigitGroups = (4*mag.length + 6)/7;
2637 a = new MutableBigInteger(tmp.mag),
2638 b = new MutableBigInteger(d.mag);
3016 if (n >= mag.length)
3019 int magInt = mag[mag.length-n-1];
3037 int mlen = mag.length;
3038 for (i = mlen - 1; i >= 0 && mag[i] == 0; i--)
3119 // Calculate mag field from magnitude and discard magnitude
3133 (BigInteger.class.getDeclaredField("mag"));
3164 * Returns the mag array as an array of bytes.
3167 int len = mag.length;
3169 int bitLen = (len == 0 ? 0 : ((len - 1) << 5) + bitLengthForInt(mag[0]));
3176 nextInt = mag[intIndex--];