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

Comparing jsr166/src/test/loops/ConcurrentDequeLoops.java (file contents):
Revision 1.7 by jsr166, Wed Sep 1 07:47:27 2010 UTC vs.
Revision 1.12 by jsr166, Mon Aug 10 03:13:33 2015 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.*;
# Line 18 | Line 18 | public class ConcurrentDequeLoops {
18          int maxStages = 8;
19          int items = 1000000;
20  
21 <        Class klass = null;
21 >        Class<?> klass = null;
22          if (args.length > 0) {
23              try {
24                  klass = Class.forName(args[0]);
# Line 43 | Line 43 | public class ConcurrentDequeLoops {
43          Thread.sleep(100);
44          print = true;
45  
46 <        int k = 1;
47 <        for (int i = 1; i <= maxStages;) {
46 >        for (int k = 1, i = 1; i <= maxStages;) {
47              oneRun(klass, i, items);
48              if (i == k) {
49                  k = i << 1;
# Line 54 | Line 53 | public class ConcurrentDequeLoops {
53                  i = k;
54          }
55          pool.shutdown();
56 <   }
56 >    }
57  
58      static class Stage implements Callable<Integer> {
59          final Deque<Integer> queue;
# Line 117 | Line 116 | public class ConcurrentDequeLoops {
116          }
117      }
118  
119 <    static void oneRun(Class klass, int n, int items) throws Exception {
119 >    static void oneRun(Class<?> klass, int n, int items) throws Exception {
120          Deque<Integer> q = (Deque<Integer>) klass.newInstance();
121          LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer();
122          CyclicBarrier barrier = new CyclicBarrier(n + 1, timer);
# Line 141 | Line 140 | public class ConcurrentDequeLoops {
140              System.out.println(LoopHelpers.rightJustify(time / (items * n)) + " ns per item");
141          if (total == 0) // avoid overoptimization
142              System.out.println("useless result: " + total);
144
143      }
144   }

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines