--- jsr166/src/test/loops/OfferPollLoops.java 2010/09/27 19:15:15 1.5 +++ jsr166/src/test/loops/OfferPollLoops.java 2016/12/31 19:29:58 1.10 @@ -1,12 +1,23 @@ /* * Written by Doug Lea with assistance from members of JCP JSR-166 * Expert Group and released to the public domain, as explained at - * http://creativecommons.org/licenses/publicdomain + * http://creativecommons.org/publicdomain/zero/1.0/ */ -import java.util.*; -import java.util.concurrent.*; -//import jsr166y.*; +import java.util.Queue; +import java.util.Random; +import java.util.concurrent.ArrayBlockingQueue; +import java.util.concurrent.CyclicBarrier; +import java.util.concurrent.BlockingQueue; +import java.util.concurrent.ConcurrentLinkedDeque; +import java.util.concurrent.ConcurrentLinkedQueue; +import java.util.concurrent.ExecutorService; +import java.util.concurrent.Executors; +import java.util.concurrent.LinkedBlockingDeque; +import java.util.concurrent.LinkedBlockingQueue; +import java.util.concurrent.LinkedTransferQueue; +import java.util.concurrent.Phaser; +import java.util.concurrent.PriorityBlockingQueue; public class OfferPollLoops { static final int NCPUS = Runtime.getRuntime().availableProcessors(); @@ -54,8 +65,7 @@ public class OfferPollLoops { warmup(); print = true; - int k = 1; - for (int i = 1; i <= maxN;) { + for (int k = 1, i = 1; i <= maxN;) { System.out.println("Pairs:" + i); oneTest(i, ITERS); if (i == k) { @@ -126,7 +136,6 @@ public class OfferPollLoops { System.out.print("ArrayBlockingQueue "); oneRun(new ArrayBlockingQueue(POOL_SIZE), n, iters); - Thread.sleep(100); // System.gc(); if (print) System.out.print("PriorityBlockingQueue "); @@ -136,7 +145,6 @@ public class OfferPollLoops { if (print) System.out.print("ArrayBlockingQueue(fair)"); oneRun(new ArrayBlockingQueue(POOL_SIZE, true), n, fairIters); - } abstract static class Stage implements Runnable { @@ -237,5 +245,4 @@ public class OfferPollLoops { System.out.println("\t: " + LoopHelpers.rightJustify(time / (iters * n)) + " ns per transfer"); } - }