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.2 by jsr166, Thu Oct 29 23:09:07 2009 UTC vs.
Revision 1.13 by jsr166, Sat Dec 31 22:17:40 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.Queue;
8 > import java.util.concurrent.ArrayBlockingQueue;
9 > import java.util.concurrent.CyclicBarrier;
10 > import java.util.concurrent.ConcurrentLinkedDeque;
11 > import java.util.concurrent.ConcurrentLinkedQueue;
12 > import java.util.concurrent.ExecutorService;
13 > import java.util.concurrent.Executors;
14 > import java.util.concurrent.LinkedBlockingDeque;
15 > import java.util.concurrent.LinkedBlockingQueue;
16 > import java.util.concurrent.LinkedTransferQueue;
17 > import java.util.concurrent.Phaser;
18 > import java.util.concurrent.PriorityBlockingQueue;
19  
20   public class OfferPollLoops {
21      static final int NCPUS = Runtime.getRuntime().availableProcessors();
13 –    static final Random rng = new Random();
22      static final ExecutorService pool = Executors.newCachedThreadPool();
23      static boolean print = false;
24      static int producerSum;
# Line 54 | Line 62 | public class OfferPollLoops {
62  
63          warmup();
64          print = true;
65 <        int k = 1;
58 <        for (int i = 1; i <= maxN;) {
65 >        for (int k = 1, i = 1; i <= maxN;) {
66              System.out.println("Pairs:" + i);
67              oneTest(i, ITERS);
68              if (i == k) {
# Line 103 | Line 110 | public class OfferPollLoops {
110  
111          Thread.sleep(100); // System.gc();
112          if (print)
113 +            System.out.print("ConcurrentLinkedDeque   ");
114 +        oneRun(new ConcurrentLinkedDeque<Integer>(), n, iters);
115 +
116 +        Thread.sleep(100); // System.gc();
117 +        if (print)
118              System.out.print("LinkedBlockingQueue     ");
119          oneRun(new LinkedBlockingQueue<Integer>(), n, iters);
120  
# Line 121 | Line 133 | public class OfferPollLoops {
133              System.out.print("ArrayBlockingQueue      ");
134          oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE), n, iters);
135  
124 –
136          Thread.sleep(100); // System.gc();
137          if (print)
138              System.out.print("PriorityBlockingQueue   ");
# Line 131 | Line 142 | public class OfferPollLoops {
142          if (print)
143              System.out.print("ArrayBlockingQueue(fair)");
144          oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE, true), n, fairIters);
134 –
145      }
146  
147 <    static abstract class Stage implements Runnable {
147 >    abstract static class Stage implements Runnable {
148          final int iters;
149          final Queue<Integer> queue;
150          final CyclicBarrier barrier;
151          final Phaser lagPhaser;
152 <        Stage (Queue<Integer> q, CyclicBarrier b, Phaser s,
143 <               int iters) {
152 >        Stage(Queue<Integer> q, CyclicBarrier b, Phaser s, int iters) {
153              queue = q;
154              barrier = b;
155              lagPhaser = s;
# Line 233 | Line 242 | public class OfferPollLoops {
242              System.out.println("\t: " + LoopHelpers.rightJustify(time / (iters * n)) + " ns per transfer");
243      }
244  
236 –
245   }

Diff Legend

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