undefect. CWE-407 — 63 sites patched across 27 ecosystems
Authors: russell@unturf.com · brackishbert@gmail.com · foxhop.net · TimeHexOn.com Patches, unit tests, benchmarks, whitepaper, and outreach briefs. Public domain — no copyright claimed. Use freely.
This commit is contained in:
commit
0a580b313d
70422 changed files with 17213626 additions and 0 deletions
|
|
@ -0,0 +1,206 @@
|
|||
/*
|
||||
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||
*
|
||||
* This code is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 only, as
|
||||
* published by the Free Software Foundation.
|
||||
*
|
||||
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||||
* version 2 for more details (a copy is included in the LICENSE file that
|
||||
* accompanied this code).
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License version
|
||||
* 2 along with this work; if not, write to the Free Software Foundation,
|
||||
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
*
|
||||
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||||
* or visit www.oracle.com if you need additional information or have any
|
||||
* questions.
|
||||
*/
|
||||
|
||||
/*
|
||||
* This file is available under and governed by the GNU General Public
|
||||
* License version 2 only, as published by the Free Software Foundation.
|
||||
* However, the following notice accompanied the original version of this
|
||||
* file:
|
||||
*
|
||||
* 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/publicdomain/zero/1.0/
|
||||
*/
|
||||
|
||||
/*
|
||||
* @test
|
||||
* @bug 4486658 6785442
|
||||
* @summary Checks that a set of threads can repeatedly get and modify items
|
||||
* @library /test/lib
|
||||
* @run main ConcurrentQueueLoops 8 123456
|
||||
*/
|
||||
|
||||
import static java.util.concurrent.TimeUnit.MILLISECONDS;
|
||||
|
||||
import java.util.ArrayList;
|
||||
import java.util.Collection;
|
||||
import java.util.Collections;
|
||||
import java.util.List;
|
||||
import java.util.Queue;
|
||||
import java.util.concurrent.ArrayBlockingQueue;
|
||||
import java.util.concurrent.ConcurrentLinkedDeque;
|
||||
import java.util.concurrent.ConcurrentLinkedQueue;
|
||||
import java.util.concurrent.Callable;
|
||||
import java.util.concurrent.CyclicBarrier;
|
||||
import java.util.concurrent.ExecutorService;
|
||||
import java.util.concurrent.Executors;
|
||||
import java.util.concurrent.Future;
|
||||
import java.util.concurrent.LinkedBlockingDeque;
|
||||
import java.util.concurrent.LinkedBlockingQueue;
|
||||
import java.util.concurrent.LinkedTransferQueue;
|
||||
import java.util.concurrent.atomic.AtomicInteger;
|
||||
import jdk.test.lib.Utils;
|
||||
|
||||
public class ConcurrentQueueLoops {
|
||||
static final long LONG_DELAY_MS = Utils.adjustTimeout(10_000);
|
||||
ExecutorService pool;
|
||||
AtomicInteger totalItems;
|
||||
boolean print;
|
||||
|
||||
// Suitable for benchmarking. Overridden by args[0] for testing.
|
||||
int maxStages = 20;
|
||||
|
||||
// Suitable for benchmarking. Overridden by args[1] for testing.
|
||||
int items = 1024 * 1024;
|
||||
|
||||
Collection<Queue<Integer>> concurrentQueues() {
|
||||
List<Queue<Integer>> queues = new ArrayList<>();
|
||||
queues.add(new ConcurrentLinkedDeque<Integer>());
|
||||
queues.add(new ConcurrentLinkedQueue<Integer>());
|
||||
queues.add(new ArrayBlockingQueue<Integer>(items, false));
|
||||
//queues.add(new ArrayBlockingQueue<Integer>(count, true));
|
||||
queues.add(new LinkedBlockingQueue<Integer>());
|
||||
queues.add(new LinkedBlockingDeque<Integer>());
|
||||
queues.add(new LinkedTransferQueue<Integer>());
|
||||
|
||||
// Following additional implementations are available from:
|
||||
// http://gee.cs.oswego.edu/dl/concurrency-interest/index.html
|
||||
// queues.add(new SynchronizedLinkedListQueue<Integer>());
|
||||
|
||||
// Avoid "first fast, second slow" benchmark effect.
|
||||
Collections.shuffle(queues);
|
||||
return queues;
|
||||
}
|
||||
|
||||
void test(String[] args) throws Throwable {
|
||||
if (args.length > 0)
|
||||
maxStages = Integer.parseInt(args[0]);
|
||||
if (args.length > 1)
|
||||
items = Integer.parseInt(args[1]);
|
||||
|
||||
for (Queue<Integer> queue : concurrentQueues())
|
||||
test(queue);
|
||||
}
|
||||
|
||||
void test(final Queue<Integer> q) throws Throwable {
|
||||
System.out.println(q.getClass().getSimpleName());
|
||||
pool = Executors.newCachedThreadPool();
|
||||
print = false;
|
||||
|
||||
print = false;
|
||||
System.out.println("Warmup...");
|
||||
oneRun(1, items, q);
|
||||
oneRun(3, items, q);
|
||||
print = true;
|
||||
|
||||
for (int i = 1; i <= maxStages; i += (i+1) >>> 1) {
|
||||
oneRun(i, items, q);
|
||||
}
|
||||
pool.shutdown();
|
||||
check(pool.awaitTermination(LONG_DELAY_MS, MILLISECONDS));
|
||||
}
|
||||
|
||||
class Stage implements Callable<Integer> {
|
||||
final Queue<Integer> queue;
|
||||
final CyclicBarrier barrier;
|
||||
int items;
|
||||
Stage(Queue<Integer> q, CyclicBarrier b, int items) {
|
||||
queue = q;
|
||||
barrier = b;
|
||||
this.items = items;
|
||||
}
|
||||
|
||||
public Integer call() {
|
||||
// Repeatedly take something from queue if possible,
|
||||
// transform it, and put back in.
|
||||
try {
|
||||
barrier.await();
|
||||
int l = 4321;
|
||||
int takes = 0;
|
||||
for (;;) {
|
||||
Integer item = queue.poll();
|
||||
if (item != null) {
|
||||
++takes;
|
||||
l = LoopHelpers.compute2(item.intValue());
|
||||
}
|
||||
else if (takes != 0) {
|
||||
totalItems.getAndAdd(-takes);
|
||||
takes = 0;
|
||||
}
|
||||
else if (totalItems.get() <= 0)
|
||||
break;
|
||||
l = LoopHelpers.compute1(l);
|
||||
if (items > 0) {
|
||||
--items;
|
||||
queue.offer(new Integer(l));
|
||||
}
|
||||
else if ( (l & (3 << 5)) == 0) // spinwait
|
||||
Thread.sleep(1);
|
||||
}
|
||||
return new Integer(l);
|
||||
}
|
||||
catch (Throwable t) { unexpected(t); return null; }
|
||||
}
|
||||
}
|
||||
|
||||
void oneRun(int n, int items, final Queue<Integer> q) throws Exception {
|
||||
LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer();
|
||||
CyclicBarrier barrier = new CyclicBarrier(n + 1, timer);
|
||||
totalItems = new AtomicInteger(n * items);
|
||||
ArrayList<Future<Integer>> results = new ArrayList<>(n);
|
||||
for (int i = 0; i < n; ++i)
|
||||
results.add(pool.submit(new Stage(q, barrier, items)));
|
||||
|
||||
if (print)
|
||||
System.out.print("Threads: " + n + "\t:");
|
||||
barrier.await();
|
||||
int total = 0;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
Future<Integer> f = results.get(i);
|
||||
Integer r = f.get();
|
||||
total += r.intValue();
|
||||
}
|
||||
long endTime = System.nanoTime();
|
||||
long time = endTime - timer.startTime;
|
||||
if (print)
|
||||
System.out.println(LoopHelpers.rightJustify(time / (items * n)) + " ns per item");
|
||||
if (total == 0) // avoid overoptimization
|
||||
System.out.println("useless result: " + total);
|
||||
}
|
||||
|
||||
//--------------------- Infrastructure ---------------------------
|
||||
volatile int passed = 0, failed = 0;
|
||||
void pass() {passed++;}
|
||||
void fail() {failed++; Thread.dumpStack();}
|
||||
void fail(String msg) {System.err.println(msg); fail();}
|
||||
void unexpected(Throwable t) {failed++; t.printStackTrace();}
|
||||
void check(boolean cond) {if (cond) pass(); else fail();}
|
||||
void equal(Object x, Object y) {
|
||||
if (x == null ? y == null : x.equals(y)) pass();
|
||||
else fail(x + " not equal to " + y);}
|
||||
public static void main(String[] args) throws Throwable {
|
||||
new ConcurrentQueueLoops().instanceMain(args);}
|
||||
public void instanceMain(String[] args) throws Throwable {
|
||||
try {test(args);} catch (Throwable t) {unexpected(t);}
|
||||
System.out.printf("%nPassed = %d, failed = %d%n%n", passed, failed);
|
||||
if (failed > 0) throw new AssertionError("Some tests failed");}
|
||||
}
|
||||
189
test/jdk/java/util/concurrent/ConcurrentQueues/GCRetention.java
Normal file
189
test/jdk/java/util/concurrent/ConcurrentQueues/GCRetention.java
Normal file
|
|
@ -0,0 +1,189 @@
|
|||
/*
|
||||
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||
*
|
||||
* This code is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 only, as
|
||||
* published by the Free Software Foundation.
|
||||
*
|
||||
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||||
* version 2 for more details (a copy is included in the LICENSE file that
|
||||
* accompanied this code).
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License version
|
||||
* 2 along with this work; if not, write to the Free Software Foundation,
|
||||
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
*
|
||||
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||||
* or visit www.oracle.com if you need additional information or have any
|
||||
* questions.
|
||||
*/
|
||||
|
||||
/*
|
||||
* This file is available under and governed by the GNU General Public
|
||||
* License version 2 only, as published by the Free Software Foundation.
|
||||
* However, the following notice accompanied the original version of this
|
||||
* file:
|
||||
*
|
||||
* 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/publicdomain/zero/1.0/
|
||||
*/
|
||||
/*
|
||||
* @test
|
||||
* @bug 6785442
|
||||
* @summary Benchmark that tries to GC-tenure head, followed by
|
||||
* many add/remove operations.
|
||||
* @run main GCRetention just-testing
|
||||
*/
|
||||
|
||||
import static java.util.concurrent.TimeUnit.MILLISECONDS;
|
||||
|
||||
import java.lang.ref.ReferenceQueue;
|
||||
import java.lang.ref.WeakReference;
|
||||
import java.util.concurrent.ArrayBlockingQueue;
|
||||
import java.util.concurrent.ConcurrentHashMap;
|
||||
import java.util.concurrent.ConcurrentLinkedDeque;
|
||||
import java.util.concurrent.ConcurrentLinkedQueue;
|
||||
import java.util.concurrent.CountDownLatch;
|
||||
import java.util.concurrent.LinkedBlockingDeque;
|
||||
import java.util.concurrent.LinkedBlockingQueue;
|
||||
import java.util.concurrent.LinkedTransferQueue;
|
||||
import java.util.concurrent.PriorityBlockingQueue;
|
||||
import java.util.LinkedList;
|
||||
import java.util.PriorityQueue;
|
||||
import java.util.ArrayList;
|
||||
import java.util.Collection;
|
||||
import java.util.Collections;
|
||||
import java.util.List;
|
||||
import java.util.Queue;
|
||||
import java.util.Map;
|
||||
|
||||
public class GCRetention {
|
||||
boolean benchmarkMode;
|
||||
int count;
|
||||
|
||||
/** No guarantees, but effective in practice. */
|
||||
static void forceFullGc() {
|
||||
long timeoutMillis = 1000L;
|
||||
CountDownLatch finalized = new CountDownLatch(1);
|
||||
ReferenceQueue<Object> queue = new ReferenceQueue<>();
|
||||
WeakReference<Object> ref = new WeakReference<>(
|
||||
new Object() { protected void finalize() { finalized.countDown(); }},
|
||||
queue);
|
||||
try {
|
||||
for (int tries = 3; tries--> 0; ) {
|
||||
System.gc();
|
||||
if (finalized.await(timeoutMillis, MILLISECONDS)
|
||||
&& queue.remove(timeoutMillis) != null
|
||||
&& ref.get() == null) {
|
||||
System.runFinalization(); // try to pick up stragglers
|
||||
return;
|
||||
}
|
||||
timeoutMillis *= 4;
|
||||
}
|
||||
} catch (InterruptedException unexpected) {
|
||||
throw new AssertionError("unexpected InterruptedException");
|
||||
}
|
||||
throw new AssertionError("failed to do a \"full\" gc");
|
||||
}
|
||||
|
||||
final Map<String,String> results = new ConcurrentHashMap<>();
|
||||
|
||||
Collection<Queue<Boolean>> queues() {
|
||||
List<Queue<Boolean>> queues = new ArrayList<>();
|
||||
queues.add(new ConcurrentLinkedDeque<Boolean>());
|
||||
queues.add(new ConcurrentLinkedQueue<Boolean>());
|
||||
queues.add(new ArrayBlockingQueue<Boolean>(count, false));
|
||||
queues.add(new ArrayBlockingQueue<Boolean>(count, true));
|
||||
queues.add(new LinkedBlockingQueue<Boolean>());
|
||||
queues.add(new LinkedBlockingDeque<Boolean>());
|
||||
queues.add(new PriorityBlockingQueue<Boolean>());
|
||||
queues.add(new PriorityQueue<Boolean>());
|
||||
queues.add(new LinkedList<Boolean>());
|
||||
queues.add(new LinkedTransferQueue<Boolean>());
|
||||
|
||||
// Following additional implementations are available from:
|
||||
// http://gee.cs.oswego.edu/dl/concurrency-interest/index.html
|
||||
// queues.add(new SynchronizedLinkedListQueue<Boolean>());
|
||||
|
||||
// Avoid "first fast, second slow" benchmark effect.
|
||||
Collections.shuffle(queues);
|
||||
return queues;
|
||||
}
|
||||
|
||||
void prettyPrintResults() {
|
||||
List<String> classNames = new ArrayList<>(results.keySet());
|
||||
Collections.sort(classNames);
|
||||
int maxClassNameLength = 0;
|
||||
int maxNanosLength = 0;
|
||||
for (String name : classNames) {
|
||||
if (maxClassNameLength < name.length())
|
||||
maxClassNameLength = name.length();
|
||||
if (maxNanosLength < results.get(name).length())
|
||||
maxNanosLength = results.get(name).length();
|
||||
}
|
||||
String format = String.format("%%%ds %%%ds nanos/item%%n",
|
||||
maxClassNameLength, maxNanosLength);
|
||||
for (String name : classNames)
|
||||
System.out.printf(format, name, results.get(name));
|
||||
}
|
||||
|
||||
void test(String[] args) {
|
||||
benchmarkMode = ! (args.length > 0 && args[0].equals("just-testing"));
|
||||
count = benchmarkMode ? 1024 * 1024 : 30;
|
||||
|
||||
// Warmup
|
||||
for (Queue<Boolean> queue : queues())
|
||||
test(queue);
|
||||
results.clear();
|
||||
for (Queue<Boolean> queue : queues())
|
||||
test(queue);
|
||||
|
||||
prettyPrintResults();
|
||||
}
|
||||
|
||||
void test(Queue<Boolean> q) {
|
||||
long t0 = System.nanoTime();
|
||||
for (int i = 0; i < count; i++)
|
||||
check(q.add(Boolean.TRUE));
|
||||
if (benchmarkMode) forceFullGc();
|
||||
// forceFullGc();
|
||||
Boolean x;
|
||||
while ((x = q.poll()) != null)
|
||||
equal(x, Boolean.TRUE);
|
||||
check(q.isEmpty());
|
||||
|
||||
for (int i = 0; i < 10 * count; i++) {
|
||||
for (int k = 0; k < 3; k++)
|
||||
check(q.add(Boolean.TRUE));
|
||||
for (int k = 0; k < 3; k++)
|
||||
if (q.poll() != Boolean.TRUE)
|
||||
fail();
|
||||
}
|
||||
check(q.isEmpty());
|
||||
|
||||
String className = q.getClass().getSimpleName();
|
||||
long elapsed = System.nanoTime() - t0;
|
||||
int nanos = (int) ((double) elapsed / (10 * 3 * count));
|
||||
results.put(className, String.valueOf(nanos));
|
||||
}
|
||||
|
||||
//--------------------- Infrastructure ---------------------------
|
||||
volatile int passed = 0, failed = 0;
|
||||
void pass() {passed++;}
|
||||
void fail() {failed++; Thread.dumpStack();}
|
||||
void fail(String msg) {System.err.println(msg); fail();}
|
||||
void unexpected(Throwable t) {failed++; t.printStackTrace();}
|
||||
void check(boolean cond) {if (cond) pass(); else fail();}
|
||||
void equal(Object x, Object y) {
|
||||
if (x == null ? y == null : x.equals(y)) pass();
|
||||
else fail(x + " not equal to " + y);}
|
||||
public static void main(String[] args) throws Throwable {
|
||||
new GCRetention().instanceMain(args);}
|
||||
public void instanceMain(String[] args) throws Throwable {
|
||||
try {test(args);} catch (Throwable t) {unexpected(t);}
|
||||
System.out.printf("%nPassed = %d, failed = %d%n%n", passed, failed);
|
||||
if (failed > 0) throw new AssertionError("Some tests failed");}
|
||||
}
|
||||
|
|
@ -0,0 +1,278 @@
|
|||
/*
|
||||
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||
*
|
||||
* This code is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 only, as
|
||||
* published by the Free Software Foundation.
|
||||
*
|
||||
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||||
* version 2 for more details (a copy is included in the LICENSE file that
|
||||
* accompanied this code).
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License version
|
||||
* 2 along with this work; if not, write to the Free Software Foundation,
|
||||
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
*
|
||||
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||||
* or visit www.oracle.com if you need additional information or have any
|
||||
* questions.
|
||||
*/
|
||||
|
||||
/*
|
||||
* This file is available under and governed by the GNU General Public
|
||||
* License version 2 only, as published by the Free Software Foundation.
|
||||
* However, the following notice accompanied the original version of this
|
||||
* file:
|
||||
*
|
||||
* 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/publicdomain/zero/1.0/
|
||||
*/
|
||||
|
||||
/*
|
||||
* @test
|
||||
* @bug 6805775 6815766
|
||||
* @summary Check weak consistency of concurrent queue iterators
|
||||
*/
|
||||
|
||||
import java.util.ArrayList;
|
||||
import java.util.Arrays;
|
||||
import java.util.Collection;
|
||||
import java.util.Iterator;
|
||||
import java.util.List;
|
||||
import java.util.NoSuchElementException;
|
||||
import java.util.Queue;
|
||||
import java.util.concurrent.ArrayBlockingQueue;
|
||||
import java.util.concurrent.BlockingQueue;
|
||||
import java.util.concurrent.ConcurrentLinkedDeque;
|
||||
import java.util.concurrent.ConcurrentLinkedQueue;
|
||||
import java.util.concurrent.LinkedBlockingDeque;
|
||||
import java.util.concurrent.LinkedBlockingQueue;
|
||||
import java.util.concurrent.LinkedTransferQueue;
|
||||
import java.util.concurrent.ThreadLocalRandom;
|
||||
|
||||
@SuppressWarnings({"unchecked", "rawtypes"})
|
||||
public class IteratorWeakConsistency {
|
||||
final ThreadLocalRandom rnd = ThreadLocalRandom.current();
|
||||
|
||||
void test(String[] args) throws Throwable {
|
||||
test(new LinkedBlockingQueue());
|
||||
test(new LinkedBlockingQueue(20));
|
||||
test(new LinkedBlockingDeque());
|
||||
test(new LinkedBlockingDeque(20));
|
||||
test(new ConcurrentLinkedDeque());
|
||||
test(new ConcurrentLinkedQueue());
|
||||
test(new LinkedTransferQueue());
|
||||
test(new ArrayBlockingQueue(20));
|
||||
}
|
||||
|
||||
void checkExhausted(Iterator it) {
|
||||
if (rnd.nextBoolean()) {
|
||||
check(!it.hasNext());
|
||||
}
|
||||
if (rnd.nextBoolean()) {
|
||||
it.forEachRemaining(e -> { throw new AssertionError(); });
|
||||
}
|
||||
if (rnd.nextBoolean())
|
||||
try { it.next(); fail("should throw"); }
|
||||
catch (NoSuchElementException success) {}
|
||||
}
|
||||
|
||||
void checkRemoveThrowsISE(Iterator it) {
|
||||
if (rnd.nextBoolean()) {
|
||||
try { it.remove(); fail("should throw"); }
|
||||
catch (IllegalStateException success) {}
|
||||
}
|
||||
}
|
||||
|
||||
void checkRemoveHasNoEffect(Iterator it, Collection c) {
|
||||
if (rnd.nextBoolean()) {
|
||||
int size = c.size();
|
||||
it.remove(); // no effect
|
||||
equal(c.size(), size);
|
||||
checkRemoveThrowsISE(it);
|
||||
}
|
||||
}
|
||||
|
||||
void test(Queue q) {
|
||||
//----------------------------------------------------------------
|
||||
// Check iterators on an empty q
|
||||
//----------------------------------------------------------------
|
||||
try {
|
||||
for (int i = 0; i < 4; i++) {
|
||||
Iterator it = q.iterator();
|
||||
if (rnd.nextBoolean()) checkExhausted(it);
|
||||
checkRemoveThrowsISE(it);
|
||||
}
|
||||
} catch (Throwable t) { unexpected(t); }
|
||||
|
||||
// TODO: make this more general
|
||||
try {
|
||||
for (int i = 0; i < 10; i++)
|
||||
q.add(i);
|
||||
Iterator it = q.iterator();
|
||||
q.poll();
|
||||
q.poll();
|
||||
q.poll();
|
||||
q.remove(7);
|
||||
List list = new ArrayList();
|
||||
while (it.hasNext())
|
||||
list.add(it.next());
|
||||
equal(list, Arrays.asList(0, 3, 4, 5, 6, 8, 9));
|
||||
check(! list.contains(null));
|
||||
System.err.printf("%s: %s%n",
|
||||
q.getClass().getSimpleName(),
|
||||
list);
|
||||
} catch (Throwable t) { unexpected(t); }
|
||||
|
||||
try {
|
||||
q.clear();
|
||||
q.add(1);
|
||||
q.add(2);
|
||||
q.add(3);
|
||||
q.add(4);
|
||||
Iterator it = q.iterator();
|
||||
it.next();
|
||||
q.remove(2);
|
||||
q.remove(1);
|
||||
q.remove(3);
|
||||
boolean found4 = false;
|
||||
while (it.hasNext()) {
|
||||
found4 |= it.next().equals(4);
|
||||
}
|
||||
check(found4);
|
||||
} catch (Throwable t) { unexpected(t); }
|
||||
|
||||
try {
|
||||
q.clear();
|
||||
Object x = new Object();
|
||||
for (int i = 0; i < 20; i++)
|
||||
q.add(x);
|
||||
equal(20, q.size());
|
||||
Iterator it1 = q.iterator();
|
||||
Iterator it2 = q.iterator();
|
||||
try { it1.remove(); fail(); }
|
||||
catch (IllegalStateException success) {}
|
||||
try { it2.remove(); fail(); }
|
||||
catch (IllegalStateException success) {}
|
||||
|
||||
check(it1.next() == x);
|
||||
check(it2.hasNext());
|
||||
check(it2.next() == x);
|
||||
it1.remove();
|
||||
it2.remove();
|
||||
equal(19, q.size());
|
||||
try { it1.remove(); fail(); }
|
||||
catch (IllegalStateException success) {}
|
||||
try { it2.remove(); fail(); }
|
||||
catch (IllegalStateException success) {}
|
||||
equal(19, q.size());
|
||||
|
||||
it1.next();
|
||||
check(it2.hasNext());
|
||||
it2.next();
|
||||
it2.remove();
|
||||
it1.remove();
|
||||
equal(18, q.size());
|
||||
|
||||
it1.next();
|
||||
it2.next();
|
||||
check(q.remove() == x);
|
||||
equal(17, q.size());
|
||||
it1.remove();
|
||||
it2.remove();
|
||||
equal(17, q.size());
|
||||
} catch (Throwable t) { unexpected(t); }
|
||||
|
||||
//----------------------------------------------------------------
|
||||
// Check "interior" removal of alternating elements
|
||||
//----------------------------------------------------------------
|
||||
try {
|
||||
q.clear();
|
||||
final int remainingCapacity = (q instanceof BlockingQueue) ?
|
||||
((BlockingQueue)q).remainingCapacity() :
|
||||
Integer.MAX_VALUE;
|
||||
final int capacity = Math.min(20, remainingCapacity);
|
||||
List<Iterator> its = new ArrayList<>();
|
||||
// Move to "middle"
|
||||
for (int i = 0; i < capacity/2; i++) {
|
||||
check(q.add(i));
|
||||
equal(q.poll(), i);
|
||||
}
|
||||
for (int i = 0; i < capacity; i++)
|
||||
check(q.add(i));
|
||||
for (int i = 0; i < capacity; i++) {
|
||||
Iterator it = q.iterator();
|
||||
its.add(it);
|
||||
for (int j = 0; j < i; j++)
|
||||
equal(j, it.next());
|
||||
}
|
||||
|
||||
// Remove all even elements, in either direction using
|
||||
// q.remove(), or iterator.remove()
|
||||
switch (rnd.nextInt(3)) {
|
||||
case 0:
|
||||
for (int i = 0; i < capacity; i+=2)
|
||||
check(q.remove(i));
|
||||
break;
|
||||
case 1:
|
||||
for (int i = capacity - 2; i >= 0; i-=2)
|
||||
check(q.remove(i));
|
||||
break;
|
||||
case 2:
|
||||
Iterator it = q.iterator();
|
||||
while (it.hasNext()) {
|
||||
int i = (Integer) it.next();
|
||||
if ((i & 1) == 0)
|
||||
it.remove();
|
||||
}
|
||||
break;
|
||||
default: throw new AssertionError();
|
||||
}
|
||||
|
||||
for (int i = 0; i < capacity; i++) {
|
||||
Iterator it = its.get(i);
|
||||
boolean even = ((i & 1) == 0);
|
||||
if (even) {
|
||||
if (rnd.nextBoolean()) check(it.hasNext());
|
||||
equal(i, it.next());
|
||||
for (int j = i+1; j < capacity; j += 2)
|
||||
equal(j, it.next());
|
||||
check(!it.hasNext());
|
||||
} else { /* odd */
|
||||
if (rnd.nextBoolean()) check(it.hasNext());
|
||||
checkRemoveHasNoEffect(it, q);
|
||||
equal(i, it.next());
|
||||
for (int j = i+2; j < capacity; j += 2)
|
||||
equal(j, it.next());
|
||||
check(!it.hasNext());
|
||||
}
|
||||
}
|
||||
|
||||
// q only contains odd elements
|
||||
for (int i = 0; i < capacity; i++)
|
||||
check(q.contains(i) ^ ((i & 1) == 0));
|
||||
|
||||
} catch (Throwable t) { unexpected(t); }
|
||||
|
||||
}
|
||||
|
||||
//--------------------- Infrastructure ---------------------------
|
||||
volatile int passed = 0, failed = 0;
|
||||
void pass() {passed++;}
|
||||
void fail() {failed++; Thread.dumpStack();}
|
||||
void fail(String msg) {System.err.println(msg); fail();}
|
||||
void unexpected(Throwable t) {failed++; t.printStackTrace();}
|
||||
void check(boolean cond) {if (cond) pass(); else fail();}
|
||||
void equal(Object x, Object y) {
|
||||
if (x == null ? y == null : x.equals(y)) pass();
|
||||
else fail(x + " not equal to " + y);}
|
||||
public static void main(String[] args) throws Throwable {
|
||||
new IteratorWeakConsistency().instanceMain(args);}
|
||||
public void instanceMain(String[] args) throws Throwable {
|
||||
try {test(args);} catch (Throwable t) {unexpected(t);}
|
||||
System.err.printf("%nPassed = %d, failed = %d%n%n", passed, failed);
|
||||
if (failed > 0) throw new AssertionError("Some tests failed");}
|
||||
}
|
||||
103
test/jdk/java/util/concurrent/ConcurrentQueues/LoopHelpers.java
Normal file
103
test/jdk/java/util/concurrent/ConcurrentQueues/LoopHelpers.java
Normal file
|
|
@ -0,0 +1,103 @@
|
|||
/*
|
||||
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||
*
|
||||
* This code is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 only, as
|
||||
* published by the Free Software Foundation.
|
||||
*
|
||||
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||||
* version 2 for more details (a copy is included in the LICENSE file that
|
||||
* accompanied this code).
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License version
|
||||
* 2 along with this work; if not, write to the Free Software Foundation,
|
||||
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
*
|
||||
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||||
* or visit www.oracle.com if you need additional information or have any
|
||||
* questions.
|
||||
*/
|
||||
|
||||
/*
|
||||
* This file is available under and governed by the GNU General Public
|
||||
* License version 2 only, as published by the Free Software Foundation.
|
||||
* However, the following notice accompanied the original version of this
|
||||
* file:
|
||||
*
|
||||
* 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/publicdomain/zero/1.0/
|
||||
*/
|
||||
|
||||
/**
|
||||
* Misc utilities in JSR166 performance tests
|
||||
*/
|
||||
class LoopHelpers {
|
||||
|
||||
// Some mindless computation to do between synchronizations...
|
||||
|
||||
/**
|
||||
* generates 32 bit pseudo-random numbers.
|
||||
* Adapted from http://www.snippets.org
|
||||
*/
|
||||
public static int compute1(int x) {
|
||||
int lo = 16807 * (x & 0xFFFF);
|
||||
int hi = 16807 * (x >>> 16);
|
||||
lo += (hi & 0x7FFF) << 16;
|
||||
if ((lo & 0x80000000) != 0) {
|
||||
lo &= 0x7fffffff;
|
||||
++lo;
|
||||
}
|
||||
lo += hi >>> 15;
|
||||
if (lo == 0 || (lo & 0x80000000) != 0) {
|
||||
lo &= 0x7fffffff;
|
||||
++lo;
|
||||
}
|
||||
return lo;
|
||||
}
|
||||
|
||||
/**
|
||||
* Computes a linear congruential random number a random number
|
||||
* of times.
|
||||
*/
|
||||
public static int compute2(int x) {
|
||||
int loops = (x >>> 4) & 7;
|
||||
while (loops-- > 0) {
|
||||
x = (x * 2147483647) % 16807;
|
||||
}
|
||||
return x;
|
||||
}
|
||||
|
||||
public static class BarrierTimer implements Runnable {
|
||||
public volatile long startTime;
|
||||
public volatile long endTime;
|
||||
public void run() {
|
||||
long t = System.nanoTime();
|
||||
if (startTime == 0)
|
||||
startTime = t;
|
||||
else
|
||||
endTime = t;
|
||||
}
|
||||
public void clear() {
|
||||
startTime = 0;
|
||||
endTime = 0;
|
||||
}
|
||||
public long getTime() {
|
||||
return endTime - startTime;
|
||||
}
|
||||
}
|
||||
|
||||
public static String rightJustify(long n) {
|
||||
// There's probably a better way to do this...
|
||||
String field = " ";
|
||||
String num = Long.toString(n);
|
||||
if (num.length() >= field.length())
|
||||
return num;
|
||||
StringBuilder b = new StringBuilder(field);
|
||||
b.replace(b.length()-num.length(), b.length(), num);
|
||||
return b.toString();
|
||||
}
|
||||
|
||||
}
|
||||
|
|
@ -0,0 +1,190 @@
|
|||
/*
|
||||
* Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved.
|
||||
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||
*
|
||||
* This code is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 only, as
|
||||
* published by the Free Software Foundation.
|
||||
*
|
||||
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||||
* version 2 for more details (a copy is included in the LICENSE file that
|
||||
* accompanied this code).
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License version
|
||||
* 2 along with this work; if not, write to the Free Software Foundation,
|
||||
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
*
|
||||
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||||
* or visit www.oracle.com if you need additional information or have any
|
||||
* questions.
|
||||
*/
|
||||
|
||||
/*
|
||||
* @test
|
||||
* @bug 6316155 6595669 6871697 6868712
|
||||
* @summary Test concurrent offer vs. remove
|
||||
* @library /test/lib
|
||||
* @run main OfferRemoveLoops 100
|
||||
* @author Martin Buchholz
|
||||
*/
|
||||
|
||||
import static java.util.concurrent.TimeUnit.MILLISECONDS;
|
||||
|
||||
import java.util.Arrays;
|
||||
import java.util.Queue;
|
||||
import java.util.SplittableRandom;
|
||||
import java.util.concurrent.ArrayBlockingQueue;
|
||||
import java.util.concurrent.CountDownLatch;
|
||||
import java.util.concurrent.ConcurrentLinkedDeque;
|
||||
import java.util.concurrent.ConcurrentLinkedQueue;
|
||||
import java.util.concurrent.LinkedBlockingDeque;
|
||||
import java.util.concurrent.LinkedBlockingQueue;
|
||||
import java.util.concurrent.LinkedTransferQueue;
|
||||
import java.util.concurrent.PriorityBlockingQueue;
|
||||
import java.util.concurrent.Semaphore;
|
||||
import jdk.test.lib.Utils;
|
||||
|
||||
@SuppressWarnings({"unchecked", "rawtypes", "deprecation"})
|
||||
public class OfferRemoveLoops {
|
||||
static final long LONG_DELAY_MS = Utils.adjustTimeout(10_000);
|
||||
final long testDurationMillisDefault = 10_000L;
|
||||
final long testDurationMillis;
|
||||
|
||||
OfferRemoveLoops(String[] args) {
|
||||
testDurationMillis = (args.length > 0) ?
|
||||
Long.valueOf(args[0]) : testDurationMillisDefault;
|
||||
}
|
||||
|
||||
void checkNotContainsNull(Iterable it) {
|
||||
for (Object x : it)
|
||||
check(x != null);
|
||||
}
|
||||
|
||||
void test(String[] args) throws Throwable {
|
||||
testQueue(new LinkedBlockingQueue(10));
|
||||
testQueue(new LinkedBlockingQueue());
|
||||
testQueue(new LinkedBlockingDeque(10));
|
||||
testQueue(new LinkedBlockingDeque());
|
||||
testQueue(new ArrayBlockingQueue(10));
|
||||
testQueue(new PriorityBlockingQueue(10));
|
||||
testQueue(new ConcurrentLinkedDeque());
|
||||
testQueue(new ConcurrentLinkedQueue());
|
||||
testQueue(new LinkedTransferQueue());
|
||||
}
|
||||
|
||||
void testQueue(final Queue q) throws Throwable {
|
||||
System.err.println(q.getClass().getSimpleName());
|
||||
final long testDurationNanos = testDurationMillis * 1000L * 1000L;
|
||||
final long quittingTimeNanos = System.nanoTime() + testDurationNanos;
|
||||
final int maxChunkSize = 1042;
|
||||
final int maxQueueSize = 10 * maxChunkSize;
|
||||
final CountDownLatch done = new CountDownLatch(3);
|
||||
final SplittableRandom rnd = new SplittableRandom();
|
||||
|
||||
// Poor man's bounded buffer; prevents unbounded queue expansion.
|
||||
final Semaphore offers = new Semaphore(maxQueueSize);
|
||||
|
||||
abstract class CheckedThread extends Thread {
|
||||
final SplittableRandom rnd;
|
||||
|
||||
CheckedThread(String name, SplittableRandom rnd) {
|
||||
super(name);
|
||||
this.rnd = rnd;
|
||||
setDaemon(true);
|
||||
start();
|
||||
}
|
||||
/** Polls for quitting time. */
|
||||
protected boolean quittingTime() {
|
||||
return System.nanoTime() - quittingTimeNanos > 0;
|
||||
}
|
||||
/** Polls occasionally for quitting time. */
|
||||
protected boolean quittingTime(long i) {
|
||||
return (i % 1024) == 0 && quittingTime();
|
||||
}
|
||||
protected abstract void realRun() throws Exception;
|
||||
public void run() {
|
||||
try { realRun(); } catch (Throwable t) { unexpected(t); }
|
||||
}
|
||||
}
|
||||
|
||||
Thread offerer = new CheckedThread("offerer", rnd.split()) {
|
||||
protected void realRun() throws InterruptedException {
|
||||
final int chunkSize = rnd.nextInt(maxChunkSize) + 20;
|
||||
long c = 0;
|
||||
while (! quittingTime()) {
|
||||
if (q.offer(Long.valueOf(c))) {
|
||||
if ((++c % chunkSize) == 0) {
|
||||
offers.acquire(chunkSize);
|
||||
}
|
||||
} else {
|
||||
Thread.yield();
|
||||
}
|
||||
}
|
||||
done.countDown();
|
||||
}};
|
||||
|
||||
Thread remover = new CheckedThread("remover", rnd.split()) {
|
||||
protected void realRun() {
|
||||
final int chunkSize = rnd.nextInt(maxChunkSize) + 20;
|
||||
long c = 0;
|
||||
while (! quittingTime()) {
|
||||
if (q.remove(Long.valueOf(c))) {
|
||||
if ((++c % chunkSize) == 0) {
|
||||
offers.release(chunkSize);
|
||||
}
|
||||
} else {
|
||||
Thread.yield();
|
||||
}
|
||||
}
|
||||
q.clear();
|
||||
offers.release(1<<30); // Releases waiting offerer thread
|
||||
done.countDown();
|
||||
}};
|
||||
|
||||
Thread scanner = new CheckedThread("scanner", rnd.split()) {
|
||||
protected void realRun() {
|
||||
while (! quittingTime()) {
|
||||
switch (rnd.nextInt(3)) {
|
||||
case 0: checkNotContainsNull(q); break;
|
||||
case 1: q.size(); break;
|
||||
case 2: checkNotContainsNull
|
||||
(Arrays.asList(q.toArray(new Long[0])));
|
||||
break;
|
||||
}
|
||||
Thread.yield();
|
||||
}
|
||||
done.countDown();
|
||||
}};
|
||||
|
||||
if (! done.await(LONG_DELAY_MS + testDurationMillis, MILLISECONDS)) {
|
||||
for (Thread thread : new Thread[] { offerer, remover, scanner }) {
|
||||
if (thread.isAlive()) {
|
||||
System.err.printf("Hung thread: %s%n", thread.getName());
|
||||
failed++;
|
||||
for (StackTraceElement e : thread.getStackTrace())
|
||||
System.err.println(e);
|
||||
thread.interrupt();
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
//--------------------- Infrastructure ---------------------------
|
||||
volatile int passed = 0, failed = 0;
|
||||
void pass() {passed++;}
|
||||
void fail() {failed++; Thread.dumpStack();}
|
||||
void fail(String msg) {System.err.println(msg); fail();}
|
||||
void unexpected(Throwable t) {failed++; t.printStackTrace();}
|
||||
void check(boolean cond) {if (cond) pass(); else fail();}
|
||||
void equal(Object x, Object y) {
|
||||
if (x == null ? y == null : x.equals(y)) pass();
|
||||
else fail(x + " not equal to " + y);}
|
||||
public static void main(String[] args) throws Throwable {
|
||||
new OfferRemoveLoops(args).instanceMain(args);}
|
||||
public void instanceMain(String[] args) throws Throwable {
|
||||
try {test(args);} catch (Throwable t) {unexpected(t);}
|
||||
System.out.printf("%nPassed = %d, failed = %d%n%n", passed, failed);
|
||||
if (failed > 0) throw new AssertionError("Some tests failed");}
|
||||
}
|
||||
|
|
@ -0,0 +1,228 @@
|
|||
/*
|
||||
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||
*
|
||||
* This code is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 only, as
|
||||
* published by the Free Software Foundation.
|
||||
*
|
||||
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||||
* version 2 for more details (a copy is included in the LICENSE file that
|
||||
* accompanied this code).
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License version
|
||||
* 2 along with this work; if not, write to the Free Software Foundation,
|
||||
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
*
|
||||
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||||
* or visit www.oracle.com if you need additional information or have any
|
||||
* questions.
|
||||
*/
|
||||
|
||||
/*
|
||||
* This file is available under and governed by the GNU General Public
|
||||
* License version 2 only, as published by the Free Software Foundation.
|
||||
* However, the following notice accompanied the original version of this
|
||||
* file:
|
||||
*
|
||||
* 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/publicdomain/zero/1.0/
|
||||
*/
|
||||
|
||||
/*
|
||||
* @test
|
||||
* @bug 6785442
|
||||
* @summary Checks race between poll and remove(Object), while
|
||||
* occasionally moonlighting as a microbenchmark.
|
||||
* @run main RemovePollRace 1234
|
||||
*/
|
||||
|
||||
import java.util.concurrent.ArrayBlockingQueue;
|
||||
import java.util.concurrent.ConcurrentHashMap;
|
||||
import java.util.concurrent.ConcurrentLinkedDeque;
|
||||
import java.util.concurrent.ConcurrentLinkedQueue;
|
||||
import java.util.concurrent.CountDownLatch;
|
||||
import java.util.concurrent.LinkedBlockingDeque;
|
||||
import java.util.concurrent.LinkedBlockingQueue;
|
||||
import java.util.concurrent.LinkedTransferQueue;
|
||||
import java.util.concurrent.atomic.AtomicLong;
|
||||
import java.util.ArrayList;
|
||||
import java.util.Collection;
|
||||
import java.util.Collections;
|
||||
import java.util.List;
|
||||
import java.util.Queue;
|
||||
import java.util.Map;
|
||||
|
||||
public class RemovePollRace {
|
||||
// Suitable for benchmarking. Overridden by args[0] for testing.
|
||||
int count = 1024 * 1024;
|
||||
|
||||
final Map<String,String> results = new ConcurrentHashMap<>();
|
||||
|
||||
Collection<Queue<Boolean>> concurrentQueues() {
|
||||
List<Queue<Boolean>> queues = new ArrayList<>();
|
||||
queues.add(new ConcurrentLinkedDeque<Boolean>());
|
||||
queues.add(new ConcurrentLinkedQueue<Boolean>());
|
||||
queues.add(new ArrayBlockingQueue<Boolean>(count, false));
|
||||
queues.add(new ArrayBlockingQueue<Boolean>(count, true));
|
||||
queues.add(new LinkedBlockingQueue<Boolean>());
|
||||
queues.add(new LinkedBlockingDeque<Boolean>());
|
||||
queues.add(new LinkedTransferQueue<Boolean>());
|
||||
|
||||
// Following additional implementations are available from:
|
||||
// http://gee.cs.oswego.edu/dl/concurrency-interest/index.html
|
||||
// queues.add(new SynchronizedLinkedListQueue<Boolean>());
|
||||
|
||||
// Avoid "first fast, second slow" benchmark effect.
|
||||
Collections.shuffle(queues);
|
||||
return queues;
|
||||
}
|
||||
|
||||
void prettyPrintResults() {
|
||||
List<String> classNames = new ArrayList<>(results.keySet());
|
||||
Collections.sort(classNames);
|
||||
int maxClassNameLength = 0;
|
||||
int maxNanosLength = 0;
|
||||
for (String name : classNames) {
|
||||
if (maxClassNameLength < name.length())
|
||||
maxClassNameLength = name.length();
|
||||
if (maxNanosLength < results.get(name).length())
|
||||
maxNanosLength = results.get(name).length();
|
||||
}
|
||||
String format = String.format("%%%ds %%%ds nanos/item%%n",
|
||||
maxClassNameLength, maxNanosLength);
|
||||
for (String name : classNames)
|
||||
System.out.printf(format, name, results.get(name));
|
||||
}
|
||||
|
||||
void test(String[] args) throws Throwable {
|
||||
if (args.length > 0)
|
||||
count = Integer.valueOf(args[0]);
|
||||
|
||||
// Warmup
|
||||
for (Queue<Boolean> queue : concurrentQueues())
|
||||
test(queue);
|
||||
results.clear();
|
||||
for (Queue<Boolean> queue : concurrentQueues())
|
||||
test(queue);
|
||||
|
||||
prettyPrintResults();
|
||||
}
|
||||
|
||||
void await(CountDownLatch latch) {
|
||||
try { latch.await(); }
|
||||
catch (InterruptedException e) { unexpected(e); }
|
||||
}
|
||||
|
||||
void test(final Queue<Boolean> q) throws Throwable {
|
||||
long t0 = System.nanoTime();
|
||||
final int SPINS = 5;
|
||||
final AtomicLong removes = new AtomicLong(0);
|
||||
final AtomicLong polls = new AtomicLong(0);
|
||||
|
||||
// We need at least 3 threads, but we don't want to use too
|
||||
// many on massively multi-core systems.
|
||||
final int cpus = Runtime.getRuntime().availableProcessors();
|
||||
final int threadsToUse = Math.max(3, Math.min(cpus, 16));
|
||||
final int adderCount = threadsToUse / 3;
|
||||
final int removerCount = adderCount;
|
||||
final int pollerCount = removerCount;
|
||||
final int threadCount = adderCount + removerCount + pollerCount;
|
||||
|
||||
final CountDownLatch startingGate = new CountDownLatch(1);
|
||||
final CountDownLatch addersDone = new CountDownLatch(adderCount);
|
||||
final Runnable remover = new Runnable() {
|
||||
public void run() {
|
||||
await(startingGate);
|
||||
int spins = 0;
|
||||
for (;;) {
|
||||
boolean quittingTime = (addersDone.getCount() == 0);
|
||||
if (q.remove(Boolean.TRUE))
|
||||
removes.getAndIncrement();
|
||||
else if (quittingTime)
|
||||
break;
|
||||
else if (++spins > SPINS) {
|
||||
Thread.yield();
|
||||
spins = 0;
|
||||
}}}};
|
||||
final Runnable poller = new Runnable() {
|
||||
public void run() {
|
||||
await(startingGate);
|
||||
int spins = 0;
|
||||
for (;;) {
|
||||
boolean quittingTime = (addersDone.getCount() == 0);
|
||||
if (q.poll() == Boolean.TRUE)
|
||||
polls.getAndIncrement();
|
||||
else if (quittingTime)
|
||||
break;
|
||||
else if (++spins > SPINS) {
|
||||
Thread.yield();
|
||||
spins = 0;
|
||||
}}}};
|
||||
final Runnable adder = new Runnable() {
|
||||
public void run() {
|
||||
await(startingGate);
|
||||
for (int i = 0; i < count; i++) {
|
||||
for (;;) {
|
||||
try { q.add(Boolean.TRUE); break; }
|
||||
catch (IllegalStateException e) { Thread.yield(); }
|
||||
}
|
||||
}
|
||||
addersDone.countDown();
|
||||
}};
|
||||
|
||||
final List<Thread> adders = new ArrayList<>();
|
||||
final List<Thread> removers = new ArrayList<>();
|
||||
final List<Thread> pollers = new ArrayList<>();
|
||||
for (int i = 0; i < adderCount; i++)
|
||||
adders.add(checkedThread(adder));
|
||||
for (int i = 0; i < removerCount; i++)
|
||||
removers.add(checkedThread(remover));
|
||||
for (int i = 0; i < pollerCount; i++)
|
||||
pollers.add(checkedThread(poller));
|
||||
|
||||
final List<Thread> allThreads = new ArrayList<>();
|
||||
allThreads.addAll(removers);
|
||||
allThreads.addAll(pollers);
|
||||
allThreads.addAll(adders);
|
||||
|
||||
for (Thread t : allThreads)
|
||||
t.start();
|
||||
startingGate.countDown();
|
||||
for (Thread t : allThreads)
|
||||
t.join();
|
||||
|
||||
String className = q.getClass().getSimpleName();
|
||||
long elapsed = System.nanoTime() - t0;
|
||||
int nanos = (int) ((double) elapsed / (adderCount * count));
|
||||
results.put(className, String.valueOf(nanos));
|
||||
if (removes.get() + polls.get() != adderCount * count) {
|
||||
String msg = String.format
|
||||
("class=%s removes=%s polls=%d count=%d",
|
||||
className, removes.get(), polls.get(), count);
|
||||
fail(msg);
|
||||
}
|
||||
}
|
||||
|
||||
//--------------------- Infrastructure ---------------------------
|
||||
volatile int passed = 0, failed = 0;
|
||||
void pass() {passed++;}
|
||||
void fail() {failed++; Thread.dumpStack();}
|
||||
void fail(String msg) {System.err.println(msg); fail();}
|
||||
void unexpected(Throwable t) {failed++; t.printStackTrace();}
|
||||
void check(boolean cond) {if (cond) pass(); else fail();}
|
||||
void equal(Object x, Object y) {
|
||||
if (x == null ? y == null : x.equals(y)) pass();
|
||||
else fail(x + " not equal to " + y);}
|
||||
public static void main(String[] args) throws Throwable {
|
||||
new RemovePollRace().instanceMain(args);}
|
||||
public void instanceMain(String[] args) throws Throwable {
|
||||
try {test(args);} catch (Throwable t) {unexpected(t);}
|
||||
System.out.printf("%nPassed = %d, failed = %d%n%n", passed, failed);
|
||||
if (failed > 0) throw new AssertionError("Some tests failed");}
|
||||
Thread checkedThread(final Runnable r) {
|
||||
return new Thread() {public void run() {
|
||||
try {r.run();} catch (Throwable t) {unexpected(t);}}};}
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue