--- jsr166/src/test/loops/LockLoops.java	2005/05/02 19:19:38	1.1
+++ jsr166/src/test/loops/LockLoops.java	2014/12/31 17:00:58	1.9
@@ -1,10 +1,15 @@
 /*
+ * Written by Doug Lea with assistance from members of JCP JSR-166
+ * Expert Group and released to the public domain, as explained at
+ * http://creativecommons.org/publicdomain/zero/1.0/
+ */
+/*
  * A simple test program. Feel free to play.
  */
 
+import java.util.*;
 import java.util.concurrent.*;
 import java.util.concurrent.locks.*;
-import java.util.*;
 
 public final class LockLoops {
     static final ExecutorService pool = Executors.newCachedThreadPool();
@@ -13,20 +18,20 @@ public final class LockLoops {
     static boolean doBuiltin = true;
     static boolean doReadWrite = true;
     static boolean doSemaphore = true;
-    static boolean doFair =  true;
+    static boolean doFair = true;
 
     public static void main(String[] args) throws Exception {
         int maxThreads = 100;
         int iters = 1000000;
         int replications = 1;
 
-        if (args.length > 0) 
+        if (args.length > 0)
             maxThreads = Integer.parseInt(args[0]);
 
-        if (args.length > 1) 
+        if (args.length > 1)
             iters = Integer.parseInt(args[1]);
 
-        if (args.length > 2) 
+        if (args.length > 2)
             replications = Integer.parseInt(args[2]);
 
         rng.setSeed(3122688L);
@@ -126,7 +131,7 @@ public final class LockLoops {
 
     }
 
-    static abstract class LockLoop implements Runnable {
+    abstract static class LockLoop implements Runnable {
         int v;
         int iters;
         volatile int result;
@@ -137,7 +142,7 @@ public final class LockLoops {
             v = initialValue;
             this.iters = iters;
             barrier = new CyclicBarrier(nthreads+1, timer);
-            for (int i = 0; i < nthreads; ++i) 
+            for (int i = 0; i < nthreads; ++i)
                 pool.execute(this);
             barrier.await();
             barrier.await();
@@ -145,7 +150,7 @@ public final class LockLoops {
             if (print) {
                 long tpi = time / (iters * nthreads);
                 System.out.print("\t" + LoopHelpers.rightJustify(tpi) + " ns per update");
-                //                double secs = (double)(time) / 1000000000.0;
+                //                double secs = (double) time / 1000000000.0;
                 //                System.out.print("\t " + secs + "s run time");
                 System.out.println();
             }
@@ -156,12 +161,12 @@ public final class LockLoops {
         abstract int loop(int n);
         public final void run() {
             try {
-                barrier.await(); 
+                barrier.await();
                 result += loop(iters);
                 barrier.await();
             }
-            catch (Exception ie) { 
-                return; 
+            catch (Exception ie) {
+                return;
             }
         }
 
@@ -171,7 +176,7 @@ public final class LockLoops {
         final int loop(int n) {
             int sum = 0;
             while (n-- > 0) {
-                synchronized(this) {
+                synchronized (this) {
                     v = LoopHelpers.compute1(v);
                 }
                 sum += LoopHelpers.compute2(v);
@@ -193,7 +198,7 @@ public final class LockLoops {
     }
 
     private static class NoLockVolatileLoop extends LockLoop {
-        volatile private int vv;
+        private volatile int vv;
         final int loop(int n) {
             int sum = 0;
             while (n-- > 0) {
@@ -206,7 +211,7 @@ public final class LockLoops {
     }
 
     private static class ReentrantLockLoop extends LockLoop {
-        final private ReentrantLock lock = new ReentrantLock();
+        private final ReentrantLock lock = new ReentrantLock();
         final int loop(int n) {
             int sum = 0;
             while (n-- > 0) {
@@ -224,7 +229,7 @@ public final class LockLoops {
     }
 
     private static class FairReentrantLockLoop extends LockLoop {
-        final private ReentrantLock lock = new ReentrantLock(true);
+        private final ReentrantLock lock = new ReentrantLock(true);
         final int loop(int n) {
             int sum = 0;
             while (n-- > 0) {
@@ -242,7 +247,7 @@ public final class LockLoops {
     }
 
     private static class ReentrantWriteLockLoop extends LockLoop {
-        final private Lock lock = new ReentrantReadWriteLock().writeLock();
+        private final Lock lock = new ReentrantReadWriteLock().writeLock();
         final int loop(int n) {
             int sum = 0;
             while (n-- > 0) {
@@ -260,7 +265,7 @@ public final class LockLoops {
     }
 
     private static class ReentrantReadWriteLockLoop extends LockLoop {
-        final private ReentrantReadWriteLock lock = new ReentrantReadWriteLock();
+        private final ReentrantReadWriteLock lock = new ReentrantReadWriteLock();
         final int loop(int n) {
             int sum = 0;
             while (n-- > 0) {
@@ -304,7 +309,7 @@ public final class LockLoops {
     }
 
     private static class SemaphoreLoop extends LockLoop {
-        final private Semaphore sem = new Semaphore(1, false);
+        private final Semaphore sem = new Semaphore(1, false);
         final int loop(int n) {
             int sum = 0;
             try {
@@ -326,7 +331,7 @@ public final class LockLoops {
         }
     }
     private static class FairSemaphoreLoop extends LockLoop {
-        final private Semaphore sem = new Semaphore(1, true);
+        private final Semaphore sem = new Semaphore(1, true);
         final int loop(int n) {
             int sum = 0;
             try {
@@ -349,7 +354,7 @@ public final class LockLoops {
     }
 
     private static class FairReentrantReadWriteLockLoop extends LockLoop {
-        final private ReentrantReadWriteLock lock = new ReentrantReadWriteLock(true);
+        private final ReentrantReadWriteLock lock = new ReentrantReadWriteLock(true);
         final int loop(int n) {
             int sum = 0;
             while (n-- > 0) {