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

Comparing jsr166/src/test/loops/TimeoutProducerConsumerLoops.java (file contents):
Revision 1.5 by dl, Sat Nov 14 20:58:11 2009 UTC vs.
Revision 1.12 by jsr166, Thu Jan 15 18:34:19 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.concurrent.*;
8  
9 –
9   public class TimeoutProducerConsumerLoops {
10      static final int NCPUS = Runtime.getRuntime().availableProcessors();
11      static final ExecutorService pool = Executors.newCachedThreadPool();
# Line 17 | Line 16 | public class TimeoutProducerConsumerLoop
16      static final int POOL_MASK = POOL_SIZE-1;
17      static final Integer[] intPool = new Integer[POOL_SIZE];
18      static {
19 <        for (int i = 0; i < POOL_SIZE; ++i)
19 >        for (int i = 0; i < POOL_SIZE; ++i)
20              intPool[i] = Integer.valueOf(i);
21      }
22  
23 <    // max lag between a producer and consumer to avoid
23 >    // max lag between a producer and consumer to avoid
24      // this becoming a GC test rather than queue test.
25      // Used only per-pair to lessen impact on queue sync
26      static final int LAG_MASK = (1 << 12) - 1;
# Line 47 | Line 46 | public class TimeoutProducerConsumerLoop
46          int maxPairs = NCPUS * 3 / 2;
47          int iters = 1000000;
48  
49 <        if (args.length > 0)
49 >        if (args.length > 0)
50              maxPairs = Integer.parseInt(args[0]);
51  
52          print = true;
53 <        int k = 1;
55 <        for (int i = 1; i <= maxPairs;) {
53 >        for (int k = 1, i = 1; i <= maxPairs;) {
54              System.out.println("Pairs:" + i);
55              oneTest(i, iters);
56              Thread.sleep(100);
57              if (i == k) {
58                  k = i << 1;
59                  i = i + (i >>> 1);
60 <            }
61 <            else
60 >            }
61 >            else
62                  i = k;
63          }
64          pool.shutdown();
65 <   }
65 >    }
66  
67      static void oneTest(int n, int iters) throws Exception {
68          if (print)
# Line 108 | Line 106 | public class TimeoutProducerConsumerLoop
106          oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE, true), n, iters/16);
107  
108      }
109 <    
110 <    static abstract class Stage implements Runnable {
109 >
110 >    abstract static class Stage implements Runnable {
111          final int iters;
112          final BlockingQueue<Integer> queue;
113          final CyclicBarrier barrier;
114          final Phaser lagPhaser;
115 <        Stage (BlockingQueue<Integer> q, CyclicBarrier b, Phaser s, int iters) {
116 <            queue = q;
115 >        Stage(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s, int iters) {
116 >            queue = q;
117              barrier = b;
118              lagPhaser = s;
119              this.iters = iters;
# Line 151 | Line 149 | public class TimeoutProducerConsumerLoop
149                  addProducerSum(s);
150                  barrier.await();
151              }
152 <            catch (Exception ie) {
153 <                ie.printStackTrace();
154 <                return;
152 >            catch (Exception ie) {
153 >                ie.printStackTrace();
154 >                return;
155              }
156          }
157      }
158  
159      static class Consumer extends Stage {
160 <        Consumer(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s, int iters) {
160 >        Consumer(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s, int iters) {
161              super(q, b, s, iters);
162          }
163  
# Line 171 | Line 169 | public class TimeoutProducerConsumerLoop
169                  int i = 0;
170                  long timeout = 1000;
171                  while (i < iters) {
172 <                    Integer e = queue.poll(timeout,
172 >                    Integer e = queue.poll(timeout,
173                                             TimeUnit.NANOSECONDS);
174                      if (e != null) {
175                          l = LoopHelpers.compute4(e.intValue());
# Line 188 | Line 186 | public class TimeoutProducerConsumerLoop
186                  addConsumerSum(s);
187                  barrier.await();
188              }
189 <            catch (Exception ie) {
190 <                ie.printStackTrace();
191 <                return;
189 >            catch (Exception ie) {
190 >                ie.printStackTrace();
191 >                return;
192              }
193          }
194  
# Line 216 | Line 214 | public class TimeoutProducerConsumerLoop
214      static final class LTQasSQ<T> extends LinkedTransferQueue<T> {
215          LTQasSQ() { super(); }
216          public void put(T x) {
217 <            try { super.transfer(x);
217 >            try { super.transfer(x);
218              } catch (InterruptedException ex) { throw new Error(); }
219          }
220  
221          public boolean offer(T x, long timeout, TimeUnit unit) {
222 <            return super.offer(x, timeout, unit);
222 >            return super.offer(x, timeout, unit);
223          }
224  
225      }

Diff Legend

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