ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/test/loops/ConcurrentDequeLoops.java

Comparing jsr166/src/test/loops/ConcurrentDequeLoops.java (file contents):
Revision 1.4 by jsr166, Mon Nov 2 23:42:46 2009 UTC vs.
Revision 1.14 by jsr166, Sat Dec 31 19:02:43 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 java.util.concurrent.atomic.*;
10	<	import java.util.concurrent.locks.*;
7	>	import java.util.ArrayList;
8	>	import java.util.Deque;
9	>	import java.util.concurrent.Callable;
10	>	import java.util.concurrent.CyclicBarrier;
11	>	import java.util.concurrent.ExecutorService;
12	>	import java.util.concurrent.Executors;
13	>	import java.util.concurrent.Future;
14	>	import java.util.concurrent.atomic.AtomicInteger;
15
16		public class ConcurrentDequeLoops {
17		static final ExecutorService pool = Executors.newCachedThreadPool();
#	Line 18 | Line 22 | public class ConcurrentDequeLoops {
22		int maxStages = 8;
23		int items = 1000000;
24
25	<	Class klass = null;
25	>	Class<?> klass = null;
26		if (args.length > 0) {
27		try {
28		klass = Class.forName(args[0]);
#	Line 43 | Line 47 | public class ConcurrentDequeLoops {
47		Thread.sleep(100);
48		print = true;
49
50	<	int k = 1;
47	<	for (int i = 1; i <= maxStages;) {
50	>	for (int k = 1, i = 1; i <= maxStages;) {
51		oneRun(klass, i, items);
52		if (i == k) {
53		k = i << 1;
#	Line 54 | Line 57 | public class ConcurrentDequeLoops {
57		i = k;
58		}
59		pool.shutdown();
60	<	}
60	>	}
61
62		static class Stage implements Callable<Integer> {
63		final Deque<Integer> queue;
64		final CyclicBarrier barrier;
65		final LoopHelpers.SimpleRandom rng = new LoopHelpers.SimpleRandom();
66		int items;
67	<	Stage (Deque<Integer> q, CyclicBarrier b, int items) {
67	>	Stage(Deque<Integer> q, CyclicBarrier b, int items) {
68		queue = q;
69		barrier = b;
70		this.items = items;
#	Line 72 | Line 75 | public class ConcurrentDequeLoops {
75		// transform it, and put back in.
76		try {
77		barrier.await();
78	<	int l = (int)System.nanoTime();
78	>	int l = (int) System.nanoTime();
79		int takes = 0;
80		for (;;) {
81		Integer item;
#	Line 117 | Line 120 | public class ConcurrentDequeLoops {
120		}
121		}
122
123	<	static void oneRun(Class klass, int n, int items) throws Exception {
124	<	Deque<Integer> q = (Deque<Integer>)klass.newInstance();
123	>	static void oneRun(Class<?> klass, int n, int items) throws Exception {
124	>	Deque<Integer> q =
125	>	(Deque<Integer>) klass.getConstructor().newInstance();
126		LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer();
127		CyclicBarrier barrier = new CyclicBarrier(n + 1, timer);
128		totalItems = new AtomicInteger(n * items);
#	Line 141 | Line 145 | public class ConcurrentDequeLoops {
145		System.out.println(LoopHelpers.rightJustify(time / (items * n)) + " ns per item");
146		if (total == 0) // avoid overoptimization
147		System.out.println("useless result: " + total);
144	–
148		}
149		}

Diff Legend

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