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

Comparing jsr166/src/test/loops/OfferPollLoops.java (file contents):
Revision 1.1 by dl, Fri Oct 23 19:57:06 2009 UTC vs.
Revision 1.7 by jsr166, Thu Dec 18 18:13:06 2014 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 34 | Line 34 | public class OfferPollLoops {
34      static final int POOL_MASK = POOL_SIZE-1;
35      static final Integer[] intPool = new Integer[POOL_SIZE];
36      static {
37 <        for (int i = 0; i < POOL_SIZE; ++i)
37 >        for (int i = 0; i < POOL_SIZE; ++i)
38              intPool[i] = Integer.valueOf(i);
39      }
40  
41      // Number of puts by producers or takes by consumers
42      static final int ITERS = 1 << 20;
43  
44 <    // max lag between a producer and consumer to avoid
44 >    // max lag between a producer and consumer to avoid
45      // this becoming a GC test rather than queue test.
46      // Used only per-pair to lessen impact on queue sync
47      static final int LAG_MASK = (1 << 12) - 1;
# Line 49 | Line 49 | public class OfferPollLoops {
49      public static void main(String[] args) throws Exception {
50          int maxN = NCPUS * 3 / 2;
51  
52 <        if (args.length > 0)
52 >        if (args.length > 0)
53              maxN = Integer.parseInt(args[0]);
54  
55          warmup();
56          print = true;
57 <        int k = 1;
58 <        for (int i = 1; i <= maxN;) {
57 >        for (int k = 1, i = 1; i <= maxN;) {
58              System.out.println("Pairs:" + i);
59              oneTest(i, ITERS);
60              if (i == k) {
61                  k = i << 1;
62                  i = i + (i >>> 1);
63 <            }
64 <            else
63 >            }
64 >            else
65                  i = k;
66          }
67          pool.shutdown();
# Line 73 | Line 72 | public class OfferPollLoops {
72          System.out.print("Warmup ");
73          int it = 2000;
74          for (int j = 5; j > 0; --j) {
75 <            oneTest(j, it);
75 >            oneTest(j, it);
76              System.out.print(".");
77              it += 1000;
78          }
79          System.gc();
80          it = 20000;
81          for (int j = 5; j > 0; --j) {
82 <            oneTest(j, it);
82 >            oneTest(j, it);
83              System.out.print(".");
84              it += 10000;
85          }
# Line 103 | Line 102 | public class OfferPollLoops {
102  
103          Thread.sleep(100); // System.gc();
104          if (print)
105 +            System.out.print("ConcurrentLinkedDeque   ");
106 +        oneRun(new ConcurrentLinkedDeque<Integer>(), n, iters);
107 +
108 +        Thread.sleep(100); // System.gc();
109 +        if (print)
110              System.out.print("LinkedBlockingQueue     ");
111          oneRun(new LinkedBlockingQueue<Integer>(), n, iters);
112  
# Line 115 | Line 119 | public class OfferPollLoops {
119          if (print)
120              System.out.print("LinkedBlockingDeque     ");
121          oneRun(new LinkedBlockingDeque<Integer>(), n, iters);
122 <        
122 >
123          Thread.sleep(100); // System.gc();
124          if (print)
125              System.out.print("ArrayBlockingQueue      ");
# Line 133 | Line 137 | public class OfferPollLoops {
137          oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE, true), n, fairIters);
138  
139      }
140 <    
141 <    static abstract class Stage implements Runnable {
140 >
141 >    abstract static class Stage implements Runnable {
142          final int iters;
143          final Queue<Integer> queue;
144          final CyclicBarrier barrier;
145          final Phaser lagPhaser;
146 <        Stage (Queue<Integer> q, CyclicBarrier b, Phaser s,
147 <               int iters) {
144 <            queue = q;
146 >        Stage(Queue<Integer> q, CyclicBarrier b, Phaser s, int iters) {
147 >            queue = q;
148              barrier = b;
149              lagPhaser = s;
150              this.iters = iters;
# Line 171 | Line 174 | public class OfferPollLoops {
174                              break;
175                          if ((i & LAG_MASK) == LAG_MASK)
176                              lagPhaser.arriveAndAwaitAdvance();
177 <                    }                        
177 >                    }
178                  }
179                  addProducerSum(ps);
180                  barrier.await();
181              }
182 <            catch (Exception ie) {
183 <                ie.printStackTrace();
184 <                return;
182 >            catch (Exception ie) {
183 >                ie.printStackTrace();
184 >                return;
185              }
186          }
187      }
188  
189      static class Consumer extends Stage {
190          Consumer(Queue<Integer> q, CyclicBarrier b, Phaser s,
191 <                 int iters) {
191 >                 int iters) {
192              super(q, b, s, iters);
193          }
194  
# Line 209 | Line 212 | public class OfferPollLoops {
212                  addConsumerSum(cs);
213                  barrier.await();
214              }
215 <            catch (Exception ie) {
216 <                ie.printStackTrace();
217 <                return;
215 >            catch (Exception ie) {
216 >                ie.printStackTrace();
217 >                return;
218              }
219          }
220  
# Line 235 | Line 238 | public class OfferPollLoops {
238  
239  
240   }
238 –

Diff Legend

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