ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/jsr166/jsr166/src/test/loops/SimpleReentrantLockLoops.java
(Generate patch)

Comparing jsr166/src/test/loops/SimpleReentrantLockLoops.java (file contents):
Revision 1.3 by dl, Mon Feb 19 00:46:06 2007 UTC vs.
Revision 1.9 by jsr166, Sat Dec 31 02:07:30 2016 UTC

# Line 1 | Line 1
1   /*
2   * Written by Doug Lea with assistance from members of JCP JSR-166
3   * Expert Group and released to the public domain, as explained at
4 < * http://creativecommons.org/licenses/publicdomain
4 > * http://creativecommons.org/publicdomain/zero/1.0/
5   */
6  
7 < import java.util.concurrent.*;
8 < import java.util.concurrent.locks.*;
9 < import java.util.*;
7 > import java.util.concurrent.CyclicBarrier;
8 > import java.util.concurrent.ExecutorService;
9 > import java.util.concurrent.Executors;
10 > import java.util.concurrent.locks.ReentrantLock;
11  
12   public final class SimpleReentrantLockLoops {
13      static final ExecutorService pool = Executors.newCachedThreadPool();
# Line 16 | Line 17 | public final class SimpleReentrantLockLo
17  
18      public static void main(String[] args) throws Exception {
19          int maxThreads = 100;
20 <        if (args.length > 0)
20 >        if (args.length > 0)
21              maxThreads = Integer.parseInt(args[0]);
22  
23          new ReentrantLockLoop(1).test();
24          new ReentrantLockLoop(1).test();
25          print = true;
26  
27 <        int k = 1;
27 <        for (int i = 1; i <= maxThreads;) {
27 >        for (int k = 1, i = 1; i <= maxThreads;) {
28              System.out.print("Threads: " + i);
29              new ReentrantLockLoop(i).test();
30              Thread.sleep(100);
31              if (i == k) {
32                  k = i << 1;
33                  i = i + (i >>> 1);
34 <            }
35 <            else
34 >            }
35 >            else
36                  i = k;
37          }
38          pool.shutdown();
# Line 52 | Line 52 | public final class SimpleReentrantLockLo
52          }
53  
54          final void test() throws Exception {
55 <            for (int i = 0; i < nthreads; ++i)
55 >            for (int i = 0; i < nthreads; ++i)
56                  pool.execute(this);
57              barrier.await();
58              barrier.await();
59              if (print) {
60                  long time = timer.getTime();
61 <                long tpi = time / ((long)iters * nthreads);
61 >                long tpi = time / ((long) iters * nthreads);
62                  System.out.print("\t" + LoopHelpers.rightJustify(tpi) + " ns per lock");
63 <                double secs = (double)(time) / 1000000000.0;
63 >                double secs = (double) time / 1000000000.0;
64                  System.out.println("\t " + secs + "s run time");
65              }
66  
# Line 72 | Line 72 | public final class SimpleReentrantLockLo
72          public final void run() {
73              final ReentrantLock lock = this.lock;
74              try {
75 <                barrier.await();
75 >                barrier.await();
76                  int sum = v + 1;
77                  int x = 0;
78                  int n = iters;
# Line 91 | Line 91 | public final class SimpleReentrantLockLo
91                          ++readBarrier;
92                      for (int l = x & 7; l > 0; --l)
93                          sum += LoopHelpers.compute6(sum);
94 <                }
94 >                }
95                  barrier.await();
96                  result += sum;
97              }
98 <            catch (Exception ie) {
99 <                return;
98 >            catch (Exception ie) {
99 >                return;
100              }
101          }
102      }

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines