Index: benchmark/mutex/JavaThread.java
===================================================================
--- benchmark/mutex/JavaThread.java	(revision 2316525c0ab1029715c0c8bc2f6fe53ca84525fe)
+++ benchmark/mutex/JavaThread.java	(revision 4ab3cf9baf3e233dbc2cc634d736e22c234f3cfc)
@@ -1,30 +1,30 @@
 public class JavaThread {
 	// Simplistic low-quality Marsaglia Shift-XOR pseudo-random number generator.
-	// Bijective   
+	// Bijective
 	// Cycle length for non-zero values is 4G-1.
 	// 0 is absorbing and should be avoided -- fixed point.
 	// The returned value is typically masked to produce a positive value.
-	static volatile int Ticket = 0 ; 
+	static volatile int Ticket = 0 ;
 
 	private static int nextRandom (int x) {
-		if (x == 0) { 
+		if (x == 0) {
 			// reseed the PRNG
-			// Ticket is accessed infrequently and does not constitute a coherence hot-spot. 
-			// Note that we use a non-atomic racy increment -- the race is rare and benign. 
-			// If the race is a concern switch to an AtomicInteger.  
-			// In addition accesses to the RW volatile global "Ticket"  variable are not 
-			// (readily) predictable at compile-time so the JIT will not be able to elide 
-			// nextRandom() invocations.  
-			x = ++Ticket ; 
-			if (x == 0) x = 1 ; 
+			// Ticket is accessed infrequently and does not constitute a coherence hot-spot.
+			// Note that we use a non-atomic racy increment -- the race is rare and benign.
+			// If the race is a concern switch to an AtomicInteger.
+			// In addition accesses to the RW volatile global "Ticket"  variable are not
+			// (readily) predictable at compile-time so the JIT will not be able to elide
+			// nextRandom() invocations.
+			x = ++Ticket ;
+			if (x == 0) x = 1 ;
 		}
 		x ^= x << 6;
 		x ^= x >>> 21;
 		x ^= x << 7;
-		return x ;   
+		return x ;
 	}
 	static int x = 2;
 
-	static private int times = Integer.parseInt("100000000");
+	static private long times = Long.parseLong("100000000");
 
 	public synchronized void noop() {
@@ -34,6 +34,6 @@
 		JavaThread j = new JavaThread();
 		// Inhibit biased locking ...
-		x = (j.hashCode() ^ System.identityHashCode(j)) | 1 ;     
-		for(int i = 1; i <= times; i += 1) {
+		x = (j.hashCode() ^ System.identityHashCode(j)) | 1 ;
+		for(long i = 1; i <= times; i += 1) {
 			x = nextRandom(x);
 			j.noop();
@@ -48,7 +48,7 @@
 	public static void main(String[] args) throws InterruptedException {
 		if ( args.length > 2 ) System.exit( 1 );
-		if ( args.length == 2 ) { times = Integer.parseInt(args[1]); }
+		if ( args.length == 2 ) { times = Long.parseLong(args[1]); }
 
-		for (int n = Integer.parseInt("5"); --n >= 0 ; ) { 
+		for (int n = Integer.parseInt("5"); --n >= 0 ; ) {
 			InnerMain();
 			Thread.sleep(2000);     // 2 seconds