1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234
|
/*
* Copyright (c) 2005, 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 6267833
* @summary Tests for invokeAny, invokeAll
* @author Martin Buchholz
*/
import static java.util.concurrent.TimeUnit.NANOSECONDS;
import static java.util.concurrent.TimeUnit.SECONDS;
import java.util.List;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
import java.util.concurrent.Callable;
import java.util.concurrent.CountDownLatch;
import java.util.concurrent.CyclicBarrier;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.Future;
import java.util.concurrent.ThreadLocalRandom;
import java.util.concurrent.atomic.AtomicLong;
public class Invoke {
static volatile int passed = 0, failed = 0;
static void fail(String msg) {
failed++;
new AssertionError(msg).printStackTrace();
}
static void pass() {
passed++;
}
static void unexpected(Throwable t) {
failed++;
t.printStackTrace();
}
static void check(boolean condition, String msg) {
if (condition) pass(); else fail(msg);
}
static void check(boolean condition) {
check(condition, "Assertion failure");
}
static long secondsElapsedSince(long startTime) {
return NANOSECONDS.toSeconds(System.nanoTime() - startTime);
}
static void awaitInterrupt(long timeoutSeconds) {
long startTime = System.nanoTime();
try {
Thread.sleep(SECONDS.toMillis(timeoutSeconds));
fail("timed out waiting for interrupt");
} catch (InterruptedException expected) {
check(secondsElapsedSince(startTime) < timeoutSeconds);
}
}
public static void main(String[] args) {
try {
testInvokeAll();
testInvokeAny();
testInvokeAny_cancellationInterrupt();
} catch (Throwable t) { unexpected(t); }
if (failed > 0)
throw new Error(
String.format("Passed = %d, failed = %d", passed, failed));
}
static final long timeoutSeconds = 10L;
static void testInvokeAll() throws Throwable {
final ThreadLocalRandom rnd = ThreadLocalRandom.current();
final int nThreads = rnd.nextInt(2, 7);
final boolean timed = rnd.nextBoolean();
final ExecutorService pool = Executors.newFixedThreadPool(nThreads);
final AtomicLong count = new AtomicLong(0);
class Task implements Callable<Long> {
public Long call() throws Exception {
return count.incrementAndGet();
}
}
try {
final List<Task> tasks =
IntStream.range(0, nThreads)
.mapToObj(i -> new Task())
.collect(Collectors.toList());
List<Future<Long>> futures;
if (timed) {
long startTime = System.nanoTime();
futures = pool.invokeAll(tasks, timeoutSeconds, SECONDS);
check(secondsElapsedSince(startTime) < timeoutSeconds);
}
else
futures = pool.invokeAll(tasks);
check(futures.size() == tasks.size());
check(count.get() == tasks.size());
long gauss = 0;
for (Future<Long> future : futures) gauss += future.get();
check(gauss == (tasks.size()+1)*tasks.size()/2);
pool.shutdown();
check(pool.awaitTermination(10L, SECONDS));
} finally {
pool.shutdownNow();
}
}
static void testInvokeAny() throws Throwable {
final ThreadLocalRandom rnd = ThreadLocalRandom.current();
final boolean timed = rnd.nextBoolean();
final ExecutorService pool = Executors.newSingleThreadExecutor();
final AtomicLong count = new AtomicLong(0);
final CountDownLatch invokeAnyDone = new CountDownLatch(1);
class Task implements Callable<Long> {
public Long call() throws Exception {
long x = count.incrementAndGet();
check(x <= 2);
if (x == 2) {
// wait for main thread to interrupt us ...
awaitInterrupt(timeoutSeconds);
// ... and then for invokeAny to return
check(invokeAnyDone.await(timeoutSeconds, SECONDS));
}
return x;
}
}
try {
final List<Task> tasks =
IntStream.range(0, rnd.nextInt(1, 7))
.mapToObj(i -> new Task())
.collect(Collectors.toList());
long val;
if (timed) {
long startTime = System.nanoTime();
val = pool.invokeAny(tasks, timeoutSeconds, SECONDS);
check(secondsElapsedSince(startTime) < timeoutSeconds);
}
else
val = pool.invokeAny(tasks);
check(val == 1);
invokeAnyDone.countDown();
// inherent race between main thread interrupt and
// start of second task
check(count.get() == 1 || count.get() == 2);
pool.shutdown();
check(pool.awaitTermination(timeoutSeconds, SECONDS));
} finally {
pool.shutdownNow();
}
}
/**
* Every remaining running task is sent an interrupt for cancellation.
*/
static void testInvokeAny_cancellationInterrupt() throws Throwable {
final ThreadLocalRandom rnd = ThreadLocalRandom.current();
final int nThreads = rnd.nextInt(2, 7);
final boolean timed = rnd.nextBoolean();
final ExecutorService pool = Executors.newFixedThreadPool(nThreads);
final AtomicLong count = new AtomicLong(0);
final AtomicLong interruptedCount = new AtomicLong(0);
final CyclicBarrier allStarted = new CyclicBarrier(nThreads);
class Task implements Callable<Long> {
public Long call() throws Exception {
allStarted.await();
long x = count.incrementAndGet();
if (x > 1)
// main thread will interrupt us
awaitInterrupt(timeoutSeconds);
return x;
}
}
try {
final List<Task> tasks =
IntStream.range(0, nThreads)
.mapToObj(i -> new Task())
.collect(Collectors.toList());
long val;
if (timed) {
long startTime = System.nanoTime();
val = pool.invokeAny(tasks, timeoutSeconds, SECONDS);
check(secondsElapsedSince(startTime) < timeoutSeconds);
}
else
val = pool.invokeAny(tasks);
check(val == 1);
pool.shutdown();
check(pool.awaitTermination(timeoutSeconds, SECONDS));
// Check after shutdown to avoid race
check(count.get() == nThreads);
} finally {
pool.shutdownNow();
}
}
}
|