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

Comparing jsr166/src/test/loops/NoopLockLoops.java (file contents):
Revision 1.1 by dl, Mon May 2 19:19:38 2005 UTC vs.
Revision 1.8 by jsr166, Wed Dec 31 17:00:58 2014 UTC

# Line 1 | Line 1
1   /*
2 – * @test
3 – * @synopsis multiple threads using a single builtin lock
4 – */
5 – /*
2   * Written by Doug Lea with assistance from members of JCP JSR-166
3 < * Expert Group and released to the public domain. Use, modify, and
4 < * redistribute this code in any way without acknowledgement.
3 > * Expert Group and released to the public domain, as explained at
4 > * http://creativecommons.org/publicdomain/zero/1.0/
5   */
6  
7 + import java.util.*;
8   import java.util.concurrent.*;
9   import java.util.concurrent.locks.*;
13 – import java.util.*;
10  
11   public final class NoopLockLoops {
12      static final ExecutorService pool = Executors.newCachedThreadPool();
# Line 20 | Line 16 | public final class NoopLockLoops {
16  
17      public static void main(String[] args) throws Exception {
18          int maxThreads = 100;
19 <        if (args.length > 0)
19 >        if (args.length > 0)
20              maxThreads = Integer.parseInt(args[0]);
21  
22          new ReentrantLockLoop(1).test();
23          new ReentrantLockLoop(1).test();
24          print = true;
25  
26 <        int k = 1;
31 <        for (int i = 1; i <= maxThreads;) {
26 >        for (int k = 1, i = 1; i <= maxThreads;) {
27              System.out.print("Threads: " + i);
28              new ReentrantLockLoop(i).test();
29              Thread.sleep(100);
30              if (i == k) {
31                  k = i << 1;
32                  i = i + (i >>> 1);
33 <            }
34 <            else
33 >            }
34 >            else
35                  i = k;
36          }
37          pool.shutdown();
# Line 55 | Line 50 | public final class NoopLockLoops {
50          }
51  
52          final void test() throws Exception {
53 <            for (int i = 0; i < nthreads; ++i)
53 >            for (int i = 0; i < nthreads; ++i)
54                  pool.execute(this);
55              barrier.await();
56              barrier.await();
57              if (print) {
58                  long time = timer.getTime();
59 <                long tpi = time / ((long)iters * nthreads);
59 >                long tpi = time / ((long) iters * nthreads);
60                  System.out.print("\t" + LoopHelpers.rightJustify(tpi) + " ns per lock");
61 <                double secs = (double)(time) / 1000000000.0;
61 >                double secs = (double) time / 1000000000.0;
62                  System.out.println("\t " + secs + "s run time");
63              }
64  
# Line 74 | Line 69 | public final class NoopLockLoops {
69  
70          public final void run() {
71              try {
72 <                barrier.await();
72 >                barrier.await();
73                  int sum = v + 1;
74                  int x = sum + 1;
75                  int n = iters;
76                  while (n-- > 0) {
77 <                    synchronized(this) {
77 >                    synchronized (this) {
78                          x = LoopHelpers.compute4(x);
79                      }
80                      sum += x;
# Line 90 | Line 85 | public final class NoopLockLoops {
85                  barrier.await();
86                  result += sum;
87              }
88 <            catch (Exception ie) {
89 <                return;
88 >            catch (Exception ie) {
89 >                return;
90              }
91          }
92      }
93  
94   }
100 –

Diff Legend

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