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

Comparing jsr166/src/test/loops/ProducerConsumerLoops.java (file contents):
Revision 1.3 by dl, Fri Oct 23 19:57:06 2009 UTC vs.
Revision 1.14 by jsr166, Sat Dec 31 21:34:47 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.*;
8 < import java.util.concurrent.*;
9 < //import jsr166y.*;
7 > import java.util.concurrent.ArrayBlockingQueue;
8 > import java.util.concurrent.BlockingQueue;
9 > import java.util.concurrent.CyclicBarrier;
10 > import java.util.concurrent.ExecutorService;
11 > import java.util.concurrent.Executors;
12 > import java.util.concurrent.LinkedBlockingDeque;
13 > import java.util.concurrent.LinkedBlockingQueue;
14 > import java.util.concurrent.LinkedTransferQueue;
15 > import java.util.concurrent.Phaser;
16 > import java.util.concurrent.PriorityBlockingQueue;
17 > import java.util.concurrent.SynchronousQueue;
18  
19   public class ProducerConsumerLoops {
20      static final int NCPUS = Runtime.getRuntime().availableProcessors();
13 –    static final Random rng = new Random();
21      static final ExecutorService pool = Executors.newCachedThreadPool();
22      static boolean print = false;
23      static int producerSum;
# Line 34 | Line 41 | public class ProducerConsumerLoops {
41      static final int POOL_MASK = POOL_SIZE-1;
42      static final Integer[] intPool = new Integer[POOL_SIZE];
43      static {
44 <        for (int i = 0; i < POOL_SIZE; ++i)
44 >        for (int i = 0; i < POOL_SIZE; ++i)
45              intPool[i] = Integer.valueOf(i);
46      }
47  
48      // Number of puts by producers or takes by consumers
49      static final int ITERS = 1 << 20;
50  
51 <    // max lag between a producer and consumer to avoid
51 >    // max lag between a producer and consumer to avoid
52      // this becoming a GC test rather than queue test.
53      // Used only per-pair to lessen impact on queue sync
54      static final int LAG_MASK = (1 << 12) - 1;
# Line 49 | Line 56 | public class ProducerConsumerLoops {
56      public static void main(String[] args) throws Exception {
57          int maxPairs = NCPUS * 3 / 2;
58  
59 <        if (args.length > 0)
59 >        if (args.length > 0)
60              maxPairs = Integer.parseInt(args[0]);
61  
62          warmup();
63          print = true;
64 <        int k = 1;
58 <        for (int i = 1; i <= maxPairs;) {
64 >        for (int k = 1, i = 1; i <= maxPairs;) {
65              System.out.println("Pairs:" + i);
66              oneTest(i, ITERS);
67              if (i == k) {
68                  k = i << 1;
69                  i = i + (i >>> 1);
70 <            }
71 <            else
70 >            }
71 >            else
72                  i = k;
73          }
74          pool.shutdown();
# Line 73 | Line 79 | public class ProducerConsumerLoops {
79          System.out.print("Warmup ");
80          int it = 2000;
81          for (int j = 5; j > 0; --j) {
82 <            oneTest(j, it);
82 >            oneTest(j, it);
83              System.out.print(".");
84              it += 1000;
85          }
86          System.gc();
87          it = 20000;
88          for (int j = 5; j > 0; --j) {
89 <            oneTest(j, it);
89 >            oneTest(j, it);
90              System.out.print(".");
91              it += 10000;
92          }
# Line 110 | Line 116 | public class ProducerConsumerLoops {
116          if (print)
117              System.out.print("LinkedBlockingDeque     ");
118          oneRun(new LinkedBlockingDeque<Integer>(), n, iters);
119 <        
119 >
120          Thread.sleep(100); // System.gc();
121          if (print)
122              System.out.print("ArrayBlockingQueue      ");
# Line 121 | Line 127 | public class ProducerConsumerLoops {
127              System.out.print("SynchronousQueue        ");
128          oneRun(new SynchronousQueue<Integer>(), n, iters);
129  
124 –        
130          Thread.sleep(100); // System.gc();
131          if (print)
132              System.out.print("SynchronousQueue(fair)  ");
# Line 136 | Line 141 | public class ProducerConsumerLoops {
141          if (print)
142              System.out.print("LinkedTransferQueue(half)");
143          oneRun(new HalfSyncLTQ<Integer>(), n, iters);
144 <        
144 >
145          Thread.sleep(100); // System.gc();
146          if (print)
147              System.out.print("PriorityBlockingQueue   ");
# Line 146 | Line 151 | public class ProducerConsumerLoops {
151          if (print)
152              System.out.print("ArrayBlockingQueue(fair)");
153          oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE, true), n, fairIters);
149 –
154      }
155 <    
156 <    static abstract class Stage implements Runnable {
155 >
156 >    abstract static class Stage implements Runnable {
157          final int iters;
158          final BlockingQueue<Integer> queue;
159          final CyclicBarrier barrier;
160          final Phaser lagPhaser;
161 <        Stage (BlockingQueue<Integer> q, CyclicBarrier b, Phaser s,
162 <               int iters) {
159 <            queue = q;
161 >        Stage(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s, int iters) {
162 >            queue = q;
163              barrier = b;
164              lagPhaser = s;
165              this.iters = iters;
# Line 186 | Line 189 | public class ProducerConsumerLoops {
189                  addProducerSum(ps);
190                  barrier.await();
191              }
192 <            catch (Exception ie) {
193 <                ie.printStackTrace();
194 <                return;
192 >            catch (Exception ie) {
193 >                ie.printStackTrace();
194 >                return;
195              }
196          }
197      }
198  
199      static class Consumer extends Stage {
200          Consumer(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s,
201 <                 int iters) {
201 >                 int iters) {
202              super(q, b, s, iters);
203          }
204  
# Line 213 | Line 216 | public class ProducerConsumerLoops {
216                  addConsumerSum(cs);
217                  barrier.await();
218              }
219 <            catch (Exception ie) {
220 <                ie.printStackTrace();
221 <                return;
219 >            catch (Exception ie) {
220 >                ie.printStackTrace();
221 >                return;
222              }
223          }
224  
# Line 240 | Line 243 | public class ProducerConsumerLoops {
243      static final class LTQasSQ<T> extends LinkedTransferQueue<T> {
244          LTQasSQ() { super(); }
245          public void put(T x) {
246 <            try { super.transfer(x);
247 <            } catch (InterruptedException ex) { throw new Error(); }
246 >            try { super.transfer(x); }
247 >            catch (InterruptedException ex) { throw new Error(ex); }
248          }
249      }
250  
# Line 252 | Line 255 | public class ProducerConsumerLoops {
255              if ((++calls & 1) == 0)
256                  super.put(x);
257              else {
258 <                try { super.transfer(x);
259 <                } catch (InterruptedException ex) {
257 <                    throw new Error();
258 <                }
258 >                try { super.transfer(x); }
259 >                catch (InterruptedException ex) { throw new Error(ex); }
260              }
261          }
262      }

Diff Legend

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