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

Comparing jsr166/src/test/loops/NoopNoLockLoops.java (file contents):
Revision 1.1 by dl, Mon May 2 19:19:38 2005 UTC vs.
Revision 1.7 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.*;
12 – import java.util.concurrent.locks.*;
9   import java.util.concurrent.atomic.*;
10 < import java.util.*;
10 > import java.util.concurrent.locks.*;
11  
12   public final class NoopNoLockLoops {
13      static final ExecutorService pool = Executors.newCachedThreadPool();
# Line 21 | Line 17 | public final class NoopNoLockLoops {
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;
32 <        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 56 | Line 51 | public final class NoopNoLockLoops {
51          }
52  
53          final void test() throws Exception {
54 <            for (int i = 0; i < nthreads; ++i)
54 >            for (int i = 0; i < nthreads; ++i)
55                  pool.execute(this);
56              barrier.await();
57              barrier.await();
58              if (print) {
59                  long time = timer.getTime();
60 <                long tpi = time / ((long)iters * nthreads);
60 >                long tpi = time / ((long) iters * nthreads);
61                  System.out.print("\t" + LoopHelpers.rightJustify(tpi) + " ns per lock");
62 <                double secs = (double)(time) / 1000000000.0;
62 >                double secs = (double) time / 1000000000.0;
63                  System.out.println("\t " + secs + "s run time");
64              }
65  
# Line 75 | Line 70 | public final class NoopNoLockLoops {
70  
71          public final void run() {
72              try {
73 <                barrier.await();
73 >                barrier.await();
74                  int sum = v + 1;
75                  int x = sum + 1;
76                  int n = iters;
# Line 89 | Line 84 | public final class NoopNoLockLoops {
84                  barrier.await();
85                  result += sum;
86              }
87 <            catch (Exception ie) {
88 <                return;
87 >            catch (Exception ie) {
88 >                return;
89              }
90          }
91      }
92  
93   }
99 –

Diff Legend

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