Add compare(Unsigned) to Integers/Longs

peterdettman · peterdettman · commit 31a2228b4e4b · 2025-12-02T18:48:08.000+07:00
diff --git a/core/src/main/j2me/java/math/BigInteger.java b/core/src/main/j2me/java/math/BigInteger.java
@@ -5,6 +5,7 @@
 import java.util.Vector;
 
 import org.bouncycastle.util.Arrays;
+import org.bouncycastle.util.Integers;
 
 public class BigInteger
 {
@@ -978,9 +979,10 @@ private static int compareNoLeadingZeroes(int xIndx, int[] x, int yIndx, int[] y
             int v1 = x[xIndx++];
             int v2 = y[yIndx++];
 
-            if (v1 != v2)
+            int c = Integers.compareUnsigned(v1, v2);
+            if (c != 0)
             {
-                return (v1 ^ Integer.MIN_VALUE) < (v2 ^ Integer.MIN_VALUE) ? -1 : 1;
+                return c;
             }
         }
 
diff --git a/core/src/main/j2me/org/bouncycastle/util/Integers.java b/core/src/main/j2me/org/bouncycastle/util/Integers.java
@@ -22,6 +22,16 @@ public static int bitCount(int i)
         return i;
     }
 
+    public static int compare(int x, int y)
+    {
+        return x < y ? -1 : x == y ? 0 : 1;
+    }
+
+    public static int compareUnsigned(int x, int y)
+    {
+        return compare(x + Integer.MIN_VALUE, y + Integer.MIN_VALUE);
+    }
+
     public static int highestOneBit(int i)
     {
         i |= (i >>  1);
diff --git a/core/src/main/j2me/org/bouncycastle/util/Longs.java b/core/src/main/j2me/org/bouncycastle/util/Longs.java
@@ -13,6 +13,16 @@ public class Longs
         0x3E, 0x33, 0x05, 0x19, 0x24, 0x27, 0x20, 0x2E, 0x3C, 0x2C, 0x2A, 0x14, 0x16, 0x39, 0x10, 0x09,
         0x32, 0x18, 0x23, 0x1F, 0x3B, 0x13, 0x38, 0x0F, 0x31, 0x1E, 0x12, 0x0E, 0x1D, 0x0D, 0x0C, 0x0B };
 
+    public static int compare(long x, long y)
+    {
+        return x < y ? -1 : x == y ? 0 : 1;
+    }
+
+    public static int compareUnsigned(long x, long y)
+    {
+        return compare(x + Long.MIN_VALUE, y + Long.MIN_VALUE);
+    }
+
     public static long highestOneBit(long i)
     {
         i |= (i >>  1);
diff --git a/core/src/main/java/org/bouncycastle/crypto/modes/ChaCha20Poly1305.java b/core/src/main/java/org/bouncycastle/crypto/modes/ChaCha20Poly1305.java
@@ -11,6 +11,7 @@
 import org.bouncycastle.crypto.params.KeyParameter;
 import org.bouncycastle.crypto.params.ParametersWithIV;
 import org.bouncycastle.util.Arrays;
+import org.bouncycastle.util.Longs;
 import org.bouncycastle.util.Pack;
 
 public class ChaCha20Poly1305
@@ -530,7 +531,7 @@ private void finishData(int nextState)
 
     private long incrementCount(long count, int increment, long limit)
     {
-        if (count + Long.MIN_VALUE > (limit - increment) + Long.MIN_VALUE)
+        if (Longs.compareUnsigned(count, limit - increment) > 0)
         {
             throw new IllegalStateException("Limit exceeded");
         }
diff --git a/core/src/main/java/org/bouncycastle/crypto/modes/GCMSIVBlockCipher.java b/core/src/main/java/org/bouncycastle/crypto/modes/GCMSIVBlockCipher.java
@@ -257,8 +257,7 @@ private void checkAEADStatus(final int pLen)
          }
 
          /* Make sure that we haven't breached AEAD data limit */
-         if (theAEADHasher.getBytesProcessed() + Long.MIN_VALUE
-              > (MAX_DATALEN - pLen) + Long.MIN_VALUE)
+         if (Longs.compareUnsigned(theAEADHasher.getBytesProcessed(), MAX_DATALEN - pLen) > 0)
          {
              throw new IllegalStateException("AEAD byte count exceeded");
          }
@@ -291,8 +290,7 @@ private void checkStatus(final int pLen)
              dataLimit += BUFLEN;
              currBytes = theEncData.size();
          }
-         if (currBytes + Long.MIN_VALUE
-               > (dataLimit - pLen) + Long.MIN_VALUE)
+         if (Longs.compareUnsigned(currBytes, dataLimit - pLen) > 0)
          {
              throw new IllegalStateException("byte count exceeded");
          }
diff --git a/core/src/main/java/org/bouncycastle/math/ec/rfc8032/Ed25519.java b/core/src/main/java/org/bouncycastle/math/ec/rfc8032/Ed25519.java
@@ -8,6 +8,7 @@
 import org.bouncycastle.math.ec.rfc7748.X25519Field;
 import org.bouncycastle.math.raw.Interleave;
 import org.bouncycastle.math.raw.Nat256;
+import org.bouncycastle.util.Integers;
 
 /**
  * A low-level implementation of the Ed25519, Ed25519ctx, and Ed25519ph instantiations of the Edwards-Curve
@@ -231,11 +232,11 @@ private static boolean checkPointFullVar(byte[] p)
         int y0 = Codec.decode32(p, 0);
 
         // Reject 0 and 1
-        if (t0 == 0 && (y0 + Integer.MIN_VALUE) <= (1 + Integer.MIN_VALUE))
+        if (t0 == 0 && Integers.compareUnsigned(y0, 1) <= 0)
             return false;
 
         // Reject P - 1 and non-canonical encodings (i.e. >= P)
-        if (t1 == 0 && (y0 + Integer.MIN_VALUE) >= (P[0] - 1 + Integer.MIN_VALUE))
+        if (t1 == 0 && Integers.compareUnsigned(y0, P[0] - 1) >= 0)
             return false;
 
         t2 |= y0 ^ ORDER8_y1[0];
diff --git a/core/src/main/java/org/bouncycastle/math/ec/rfc8032/Ed448.java b/core/src/main/java/org/bouncycastle/math/ec/rfc8032/Ed448.java
@@ -7,6 +7,7 @@
 import org.bouncycastle.math.ec.rfc7748.X448;
 import org.bouncycastle.math.ec.rfc7748.X448Field;
 import org.bouncycastle.math.raw.Nat;
+import org.bouncycastle.util.Integers;
 
 /**
  * A low-level implementation of the Ed448 and Ed448ph instantiations of the Edwards-Curve Digital Signature
@@ -191,7 +192,7 @@ private static boolean checkPointFullVar(byte[] p)
             int yi = Codec.decode32(p, i * 4);
 
             // Reject non-canonical encodings (i.e. >= P)
-            if (t1 == 0 && (yi + Integer.MIN_VALUE) > (P[i] + Integer.MIN_VALUE))
+            if (t1 == 0 && Integers.compareUnsigned(yi, P[i]) > 0)
                 return false;
 
             t0 |= yi;
@@ -201,11 +202,11 @@ private static boolean checkPointFullVar(byte[] p)
         int y0 = Codec.decode32(p, 0);
 
         // Reject 0 and 1
-        if (t0 == 0 && (y0 + Integer.MIN_VALUE) <= (1 + Integer.MIN_VALUE))
+        if (t0 == 0 && Integers.compareUnsigned(y0, 1) <= 0)
             return false;
 
         // Reject P - 1 and non-canonical encodings (i.e. >= P)
-        if (t1 == 0 && (y0 + Integer.MIN_VALUE) >= (P[0] - 1 + Integer.MIN_VALUE))
+        if (t1 == 0 && Integers.compareUnsigned(y0, P[0] - 1) >= 0)
             return false;
 
         return true;
diff --git a/core/src/main/java/org/bouncycastle/math/ec/rfc8032/Scalar25519.java b/core/src/main/java/org/bouncycastle/math/ec/rfc8032/Scalar25519.java
@@ -339,7 +339,7 @@ static boolean reduceBasisVar(int[] k, int[] z0, int[] z1)
                 ScalarUtil.subShifted_UV(3, s, u0, u1, v0, v1);
             }
 
-            if (ScalarUtil.lessThan(last, Nu, Nv))
+            if (ScalarUtil.lessThanUnsigned(last, Nu, Nv))
             {
                 int[] t0 = u0; u0 = v0; v0 = t0;
                 int[] t1 = u1; u1 = v1; v1 = t1;
diff --git a/core/src/main/java/org/bouncycastle/math/ec/rfc8032/Scalar448.java b/core/src/main/java/org/bouncycastle/math/ec/rfc8032/Scalar448.java
@@ -604,7 +604,7 @@ static boolean reduceBasisVar(int[] k, int[] z0, int[] z1)
                 ScalarUtil.subShifted_UV(7, s, u0, u1, v0, v1);
             }
 
-            if (ScalarUtil.lessThan(last, Nu, Nv))
+            if (ScalarUtil.lessThanUnsigned(last, Nu, Nv))
             {
                 int[] t0 = u0; u0 = v0; v0 = t0;
                 int[] t1 = u1; u1 = v1; v1 = t1;
diff --git a/core/src/main/java/org/bouncycastle/math/ec/rfc8032/ScalarUtil.java b/core/src/main/java/org/bouncycastle/math/ec/rfc8032/ScalarUtil.java
@@ -179,7 +179,7 @@ static int getBitLengthPositive(int last, int[] x)
         return i * 32 + 32 - Integers.numberOfLeadingZeros(x[i]);
     }
 
-    static boolean lessThan(int last, int[] x, int[] y)
+    static boolean lessThanUnsigned(int last, int[] x, int[] y)
     {
         int i = last;
         do
diff --git a/core/src/main/java/org/bouncycastle/math/raw/Nat.java b/core/src/main/java/org/bouncycastle/math/raw/Nat.java
@@ -272,8 +272,8 @@ public static int compare(int len, int[] x, int[] y)
     {
         for (int i = len - 1; i >= 0; --i)
         {
-            int x_i = x[i] ^ Integer.MIN_VALUE;
-            int y_i = y[i] ^ Integer.MIN_VALUE;
+            int x_i = x[i] + Integer.MIN_VALUE;
+            int y_i = y[i] + Integer.MIN_VALUE;
             if (x_i < y_i)
                 return -1;
             if (x_i > y_i)
@@ -286,8 +286,8 @@ public static int compare(int len, int[] x, int xOff, int[] y, int yOff)
     {
         for (int i = len - 1; i >= 0; --i)
         {
-            int x_i = x[xOff + i] ^ Integer.MIN_VALUE;
-            int y_i = y[yOff + i] ^ Integer.MIN_VALUE;
+            int x_i = x[xOff + i] + Integer.MIN_VALUE;
+            int y_i = y[yOff + i] + Integer.MIN_VALUE;
             if (x_i < y_i)
                 return -1;
             if (x_i > y_i)
@@ -596,8 +596,8 @@ public static boolean gte(int len, int[] x, int[] y)
     {
         for (int i = len - 1; i >= 0; --i)
         {
-            int x_i = x[i] ^ Integer.MIN_VALUE;
-            int y_i = y[i] ^ Integer.MIN_VALUE;
+            int x_i = x[i] + Integer.MIN_VALUE;
+            int y_i = y[i] + Integer.MIN_VALUE;
             if (x_i < y_i)
                 return false;
             if (x_i > y_i)
@@ -610,8 +610,8 @@ public static boolean gte(int len, int[] x, int xOff, int[] y, int yOff)
     {
         for (int i = len - 1; i >= 0; --i)
         {
-            int x_i = x[xOff + i] ^ Integer.MIN_VALUE;
-            int y_i = y[yOff + i] ^ Integer.MIN_VALUE;
+            int x_i = x[xOff + i] + Integer.MIN_VALUE;
+            int y_i = y[yOff + i] + Integer.MIN_VALUE;
             if (x_i < y_i)
                 return false;
             if (x_i > y_i)
diff --git a/core/src/main/java/org/bouncycastle/math/raw/Nat128.java b/core/src/main/java/org/bouncycastle/math/raw/Nat128.java
@@ -243,8 +243,8 @@ public static boolean gte(int[] x, int[] y)
     {
         for (int i = 3; i >= 0; --i)
         {
-            int x_i = x[i] ^ Integer.MIN_VALUE;
-            int y_i = y[i] ^ Integer.MIN_VALUE;
+            int x_i = x[i] + Integer.MIN_VALUE;
+            int y_i = y[i] + Integer.MIN_VALUE;
             if (x_i < y_i)
                 return false;
             if (x_i > y_i)
@@ -257,8 +257,8 @@ public static boolean gte(int[] x, int xOff, int[] y, int yOff)
     {
         for (int i = 3; i >= 0; --i)
         {
-            int x_i = x[xOff + i] ^ Integer.MIN_VALUE;
-            int y_i = y[yOff + i] ^ Integer.MIN_VALUE;
+            int x_i = x[xOff + i] + Integer.MIN_VALUE;
+            int y_i = y[yOff + i] + Integer.MIN_VALUE;
             if (x_i < y_i)
                 return false;
             if (x_i > y_i)
diff --git a/core/src/main/java/org/bouncycastle/math/raw/Nat160.java b/core/src/main/java/org/bouncycastle/math/raw/Nat160.java
@@ -209,8 +209,8 @@ public static boolean gte(int[] x, int[] y)
     {
         for (int i = 4; i >= 0; --i)
         {
-            int x_i = x[i] ^ Integer.MIN_VALUE;
-            int y_i = y[i] ^ Integer.MIN_VALUE;
+            int x_i = x[i] + Integer.MIN_VALUE;
+            int y_i = y[i] + Integer.MIN_VALUE;
             if (x_i < y_i)
                 return false;
             if (x_i > y_i)
@@ -223,8 +223,8 @@ public static boolean gte(int[] x, int xOff, int[] y, int yOff)
     {
         for (int i = 4; i >= 0; --i)
         {
-            int x_i = x[xOff + i] ^ Integer.MIN_VALUE;
-            int y_i = y[yOff + i] ^ Integer.MIN_VALUE;
+            int x_i = x[xOff + i] + Integer.MIN_VALUE;
+            int y_i = y[yOff + i] + Integer.MIN_VALUE;
             if (x_i < y_i)
                 return false;
             if (x_i > y_i)
diff --git a/core/src/main/java/org/bouncycastle/math/raw/Nat192.java b/core/src/main/java/org/bouncycastle/math/raw/Nat192.java
@@ -281,8 +281,8 @@ public static boolean gte(int[] x, int[] y)
     {
         for (int i = 5; i >= 0; --i)
         {
-            int x_i = x[i] ^ Integer.MIN_VALUE;
-            int y_i = y[i] ^ Integer.MIN_VALUE;
+            int x_i = x[i] + Integer.MIN_VALUE;
+            int y_i = y[i] + Integer.MIN_VALUE;
             if (x_i < y_i)
                 return false;
             if (x_i > y_i)
@@ -295,8 +295,8 @@ public static boolean gte(int[] x, int xOff, int[] y, int yOff)
     {
         for (int i = 5; i >= 0; --i)
         {
-            int x_i = x[xOff + i] ^ Integer.MIN_VALUE;
-            int y_i = y[yOff + i] ^ Integer.MIN_VALUE;
+            int x_i = x[xOff + i] + Integer.MIN_VALUE;
+            int y_i = y[yOff + i] + Integer.MIN_VALUE;
             if (x_i < y_i)
                 return false;
             if (x_i > y_i)
diff --git a/core/src/main/java/org/bouncycastle/math/raw/Nat224.java b/core/src/main/java/org/bouncycastle/math/raw/Nat224.java
@@ -326,8 +326,8 @@ public static boolean gte(int[] x, int[] y)
     {
         for (int i = 6; i >= 0; --i)
         {
-            int x_i = x[i] ^ Integer.MIN_VALUE;
-            int y_i = y[i] ^ Integer.MIN_VALUE;
+            int x_i = x[i] + Integer.MIN_VALUE;
+            int y_i = y[i] + Integer.MIN_VALUE;
             if (x_i < y_i)
                 return false;
             if (x_i > y_i)
@@ -340,8 +340,8 @@ public static boolean gte(int[] x, int xOff, int[] y, int yOff)
     {
         for (int i = 6; i >= 0; --i)
         {
-            int x_i = x[xOff + i] ^ Integer.MIN_VALUE;
-            int y_i = y[yOff + i] ^ Integer.MIN_VALUE;
+            int x_i = x[xOff + i] + Integer.MIN_VALUE;
+            int y_i = y[yOff + i] + Integer.MIN_VALUE;
             if (x_i < y_i)
                 return false;
             if (x_i > y_i)
diff --git a/core/src/main/java/org/bouncycastle/math/raw/Nat256.java b/core/src/main/java/org/bouncycastle/math/raw/Nat256.java
@@ -409,8 +409,8 @@ public static boolean gte(int[] x, int[] y)
     {
         for (int i = 7; i >= 0; --i)
         {
-            int x_i = x[i] ^ Integer.MIN_VALUE;
-            int y_i = y[i] ^ Integer.MIN_VALUE;
+            int x_i = x[i] + Integer.MIN_VALUE;
+            int y_i = y[i] + Integer.MIN_VALUE;
             if (x_i < y_i)
                 return false;
             if (x_i > y_i)
@@ -423,8 +423,8 @@ public static boolean gte(int[] x, int xOff, int[] y, int yOff)
     {
         for (int i = 7; i >= 0; --i)
         {
-            int x_i = x[xOff + i] ^ Integer.MIN_VALUE;
-            int y_i = y[yOff + i] ^ Integer.MIN_VALUE;
+            int x_i = x[xOff + i] + Integer.MIN_VALUE;
+            int y_i = y[yOff + i] + Integer.MIN_VALUE;
             if (x_i < y_i)
                 return false;
             if (x_i > y_i)
diff --git a/core/src/main/java/org/bouncycastle/util/Integers.java b/core/src/main/java/org/bouncycastle/util/Integers.java
@@ -13,6 +13,20 @@ public static int bitCount(int i)
         return Integer.bitCount(i);
     }
 
+    public static int compare(int x, int y)
+    {
+        // @since 1.7
+//        return Integer.compare(x, y);
+        return x < y ? -1 : x == y ? 0 : 1;
+    }
+
+    public static int compareUnsigned(int x, int y)
+    {
+        // @since 1.8
+//        return Integer.compareUnsigned(x, y);
+        return compare(x + Integer.MIN_VALUE, y + Integer.MIN_VALUE);
+    }
+
     public static int highestOneBit(int i)
     {
         return Integer.highestOneBit(i);
diff --git a/core/src/main/java/org/bouncycastle/util/Longs.java b/core/src/main/java/org/bouncycastle/util/Longs.java
@@ -8,6 +8,20 @@ public class Longs
     public static final int BYTES = 8;
     public static final int SIZE = Long.SIZE;
 
+    public static int compare(long x, long y)
+    {
+        // @since 1.7
+//        return Long.compare(x, y);
+        return x < y ? -1 : x == y ? 0 : 1;
+    }
+
+    public static int compareUnsigned(long x, long y)
+    {
+        // @since 1.8
+//        return Long.compareUnsigned(x, y);
+        return compare(x + Long.MIN_VALUE, y + Long.MIN_VALUE);
+    }
+
     public static long highestOneBit(long i)
     {
         return Long.highestOneBit(i);
diff --git a/core/src/main/jdk1.4/org/bouncycastle/util/Integers.java b/core/src/main/jdk1.4/org/bouncycastle/util/Integers.java
@@ -22,6 +22,16 @@ public static int bitCount(int i)
         return i;
     }
 
+    public static int compare(int x, int y)
+    {
+        return x < y ? -1 : x == y ? 0 : 1;
+    }
+
+    public static int compareUnsigned(int x, int y)
+    {
+        return compare(x + Integer.MIN_VALUE, y + Integer.MIN_VALUE);
+    }
+
     public static int highestOneBit(int i)
     {
         i |= (i >>  1);
diff --git a/core/src/main/jdk1.4/org/bouncycastle/util/Longs.java b/core/src/main/jdk1.4/org/bouncycastle/util/Longs.java

Original file line number	Diff line number	Diff line change
`@@ -5,6 +5,7 @@`
`5`	`5`	`import java.util.Vector;`
`6`	`6`
`7`	`7`	`import org.bouncycastle.util.Arrays;`
	`8`	`+import org.bouncycastle.util.Integers;`
`8`	`9`
`9`	`10`	`public class BigInteger`
`10`	`11`	`{`
`@@ -978,9 +979,10 @@ private static int compareNoLeadingZeroes(int xIndx, int[] x, int yIndx, int[] y`
`978`	`979`	`int v1 = x[xIndx++];`
`979`	`980`	`int v2 = y[yIndx++];`
`980`	`981`
`981`		`- if (v1 != v2)`
	`982`	`+ int c = Integers.compareUnsigned(v1, v2);`
	`983`	`+ if (c != 0)`
`982`	`984`	`{`
`983`		`- return (v1 ^ Integer.MIN_VALUE) < (v2 ^ Integer.MIN_VALUE) ? -1 : 1;`
	`985`	`+ return c;`
`984`	`986`	`}`
`985`	`987`	`}`
`986`	`988`
Original file line number	Diff line number	Diff line change
`@@ -11,6 +11,7 @@`
`11`	`11`	`import org.bouncycastle.crypto.params.KeyParameter;`
`12`	`12`	`import org.bouncycastle.crypto.params.ParametersWithIV;`
`13`	`13`	`import org.bouncycastle.util.Arrays;`
	`14`	`+import org.bouncycastle.util.Longs;`
`14`	`15`	`import org.bouncycastle.util.Pack;`
`15`	`16`
`16`	`17`	`public class ChaCha20Poly1305`
`@@ -530,7 +531,7 @@ private void finishData(int nextState)`
`530`	`531`
`531`	`532`	`private long incrementCount(long count, int increment, long limit)`
`532`	`533`	`{`
`533`		`- if (count + Long.MIN_VALUE > (limit - increment) + Long.MIN_VALUE)`
	`534`	`+ if (Longs.compareUnsigned(count, limit - increment) > 0)`
`534`	`535`	`{`
`535`	`536`	`throw new IllegalStateException("Limit exceeded");`
`536`	`537`	`}`
Original file line number	Diff line number	Diff line change
`@@ -257,8 +257,7 @@ private void checkAEADStatus(final int pLen)`
`257`	`257`	`}`
`258`	`258`
`259`	`259`	`/* Make sure that we haven't breached AEAD data limit */`
`260`		`- if (theAEADHasher.getBytesProcessed() + Long.MIN_VALUE`
`261`		`- > (MAX_DATALEN - pLen) + Long.MIN_VALUE)`
	`260`	`+ if (Longs.compareUnsigned(theAEADHasher.getBytesProcessed(), MAX_DATALEN - pLen) > 0)`
`262`	`261`	`{`
`263`	`262`	`throw new IllegalStateException("AEAD byte count exceeded");`
`264`	`263`	`}`
`@@ -291,8 +290,7 @@ private void checkStatus(final int pLen)`
`291`	`290`	`dataLimit += BUFLEN;`
`292`	`291`	`currBytes = theEncData.size();`
`293`	`292`	`}`
`294`		`- if (currBytes + Long.MIN_VALUE`
`295`		`- > (dataLimit - pLen) + Long.MIN_VALUE)`
	`293`	`+ if (Longs.compareUnsigned(currBytes, dataLimit - pLen) > 0)`
`296`	`294`	`{`
`297`	`295`	`throw new IllegalStateException("byte count exceeded");`
`298`	`296`	`}`
Original file line number	Diff line number	Diff line change
`@@ -339,7 +339,7 @@ static boolean reduceBasisVar(int[] k, int[] z0, int[] z1)`
`339`	`339`	`ScalarUtil.subShifted_UV(3, s, u0, u1, v0, v1);`
`340`	`340`	`}`
`341`	`341`
`342`		`- if (ScalarUtil.lessThan(last, Nu, Nv))`
	`342`	`+ if (ScalarUtil.lessThanUnsigned(last, Nu, Nv))`
`343`	`343`	`{`
`344`	`344`	`int[] t0 = u0; u0 = v0; v0 = t0;`
`345`	`345`	`int[] t1 = u1; u1 = v1; v1 = t1;`
Original file line number	Diff line number	Diff line change
`@@ -604,7 +604,7 @@ static boolean reduceBasisVar(int[] k, int[] z0, int[] z1)`
`604`	`604`	`ScalarUtil.subShifted_UV(7, s, u0, u1, v0, v1);`
`605`	`605`	`}`
`606`	`606`
`607`		`- if (ScalarUtil.lessThan(last, Nu, Nv))`
	`607`	`+ if (ScalarUtil.lessThanUnsigned(last, Nu, Nv))`
`608`	`608`	`{`
`609`	`609`	`int[] t0 = u0; u0 = v0; v0 = t0;`
`610`	`610`	`int[] t1 = u1; u1 = v1; v1 = t1;`
Original file line number	Diff line number	Diff line change
`@@ -179,7 +179,7 @@ static int getBitLengthPositive(int last, int[] x)`
`179`	`179`	`return i * 32 + 32 - Integers.numberOfLeadingZeros(x[i]);`
`180`	`180`	`}`
`181`	`181`
`182`		`- static boolean lessThan(int last, int[] x, int[] y)`
	`182`	`+ static boolean lessThanUnsigned(int last, int[] x, int[] y)`
`183`	`183`	`{`
`184`	`184`	`int i = last;`
`185`	`185`	`do`