9 |
|
import static java.util.concurrent.TimeUnit.SECONDS; |
10 |
|
|
11 |
|
import java.util.ArrayList; |
12 |
+ |
import java.util.Collection; |
13 |
+ |
import java.util.Collections; |
14 |
|
import java.util.HashSet; |
15 |
|
import java.util.List; |
16 |
|
import java.util.concurrent.BlockingQueue; |
27 |
|
import java.util.concurrent.ScheduledFuture; |
28 |
|
import java.util.concurrent.ScheduledThreadPoolExecutor; |
29 |
|
import java.util.concurrent.ThreadFactory; |
30 |
+ |
import java.util.concurrent.ThreadLocalRandom; |
31 |
|
import java.util.concurrent.ThreadPoolExecutor; |
32 |
|
import java.util.concurrent.TimeoutException; |
33 |
|
import java.util.concurrent.TimeUnit; |
34 |
|
import java.util.concurrent.atomic.AtomicBoolean; |
35 |
|
import java.util.concurrent.atomic.AtomicInteger; |
36 |
|
import java.util.concurrent.atomic.AtomicLong; |
37 |
+ |
import java.util.stream.Stream; |
38 |
|
|
39 |
|
import junit.framework.Test; |
40 |
|
import junit.framework.TestSuite; |
48 |
|
} |
49 |
|
|
50 |
|
static class CustomTask<V> implements RunnableScheduledFuture<V> { |
51 |
< |
RunnableScheduledFuture<V> task; |
51 |
> |
private final RunnableScheduledFuture<V> task; |
52 |
|
volatile boolean ran; |
53 |
< |
CustomTask(RunnableScheduledFuture<V> t) { task = t; } |
53 |
> |
CustomTask(RunnableScheduledFuture<V> task) { this.task = task; } |
54 |
|
public boolean isPeriodic() { return task.isPeriodic(); } |
55 |
|
public void run() { |
56 |
|
ran = true; |
123 |
|
final CustomExecutor p = new CustomExecutor(1); |
124 |
|
try (PoolCleaner cleaner = cleaner(p, done)) { |
125 |
|
final long startTime = System.nanoTime(); |
126 |
< |
Callable task = new CheckedCallable<Boolean>() { |
126 |
> |
Callable<Boolean> task = new CheckedCallable<Boolean>() { |
127 |
|
public Boolean realCall() { |
128 |
|
done.countDown(); |
129 |
|
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
130 |
|
return Boolean.TRUE; |
131 |
|
}}; |
132 |
< |
Future f = p.schedule(task, timeoutMillis(), MILLISECONDS); |
132 |
> |
Future<Boolean> f = p.schedule(task, timeoutMillis(), MILLISECONDS); |
133 |
|
assertSame(Boolean.TRUE, f.get()); |
134 |
|
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
135 |
|
} |
148 |
|
done.countDown(); |
149 |
|
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
150 |
|
}}; |
151 |
< |
Future f = p.schedule(task, timeoutMillis(), MILLISECONDS); |
151 |
> |
Future<?> f = p.schedule(task, timeoutMillis(), MILLISECONDS); |
152 |
|
await(done); |
153 |
|
assertNull(f.get(LONG_DELAY_MS, MILLISECONDS)); |
154 |
|
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
168 |
|
done.countDown(); |
169 |
|
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
170 |
|
}}; |
171 |
< |
ScheduledFuture f = |
171 |
> |
ScheduledFuture<?> f = |
172 |
|
p.scheduleAtFixedRate(task, timeoutMillis(), |
173 |
|
LONG_DELAY_MS, MILLISECONDS); |
174 |
|
await(done); |
190 |
|
done.countDown(); |
191 |
|
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
192 |
|
}}; |
193 |
< |
ScheduledFuture f = |
193 |
> |
ScheduledFuture<?> f = |
194 |
|
p.scheduleWithFixedDelay(task, timeoutMillis(), |
195 |
|
LONG_DELAY_MS, MILLISECONDS); |
196 |
|
await(done); |
218 |
|
final CountDownLatch done = new CountDownLatch(cycles); |
219 |
|
final Runnable task = new CheckedRunnable() { |
220 |
|
public void realRun() { done.countDown(); }}; |
221 |
< |
final ScheduledFuture periodicTask = |
221 |
> |
final ScheduledFuture<?> periodicTask = |
222 |
|
p.scheduleAtFixedRate(task, 0, delay, MILLISECONDS); |
223 |
|
final int totalDelayMillis = (cycles - 1) * delay; |
224 |
|
await(done, totalDelayMillis + LONG_DELAY_MS); |
264 |
|
previous.set(now); |
265 |
|
done.countDown(); |
266 |
|
}}; |
267 |
< |
final ScheduledFuture periodicTask = |
267 |
> |
final ScheduledFuture<?> periodicTask = |
268 |
|
p.scheduleWithFixedDelay(task, 0, delay, MILLISECONDS); |
269 |
|
final int totalDelayMillis = (cycles - 1) * delay; |
270 |
|
await(done, totalDelayMillis + cycles * LONG_DELAY_MS); |
280 |
|
} |
281 |
|
|
282 |
|
/** |
283 |
< |
* execute(null) throws NPE |
283 |
> |
* Submitting null tasks throws NullPointerException |
284 |
|
*/ |
285 |
< |
public void testExecuteNull() throws InterruptedException { |
285 |
> |
public void testNullTaskSubmission() { |
286 |
|
final CustomExecutor p = new CustomExecutor(1); |
287 |
|
try (PoolCleaner cleaner = cleaner(p)) { |
288 |
< |
try { |
285 |
< |
p.execute(null); |
286 |
< |
shouldThrow(); |
287 |
< |
} catch (NullPointerException success) {} |
288 |
> |
assertNullTaskSubmissionThrowsNullPointerException(p); |
289 |
|
} |
290 |
|
} |
291 |
|
|
292 |
|
/** |
293 |
< |
* schedule(null) throws NPE |
293 |
> |
* Submitted tasks are rejected when shutdown |
294 |
|
*/ |
295 |
< |
public void testScheduleNull() throws InterruptedException { |
296 |
< |
final CustomExecutor p = new CustomExecutor(1); |
297 |
< |
try (PoolCleaner cleaner = cleaner(p)) { |
298 |
< |
try { |
299 |
< |
TrackedCallable callable = null; |
300 |
< |
Future f = p.schedule(callable, SHORT_DELAY_MS, MILLISECONDS); |
301 |
< |
shouldThrow(); |
302 |
< |
} catch (NullPointerException success) {} |
303 |
< |
} |
304 |
< |
} |
295 |
> |
public void testSubmittedTasksRejectedWhenShutdown() throws InterruptedException { |
296 |
> |
final CustomExecutor p = new CustomExecutor(2); |
297 |
> |
final ThreadLocalRandom rnd = ThreadLocalRandom.current(); |
298 |
> |
final CountDownLatch threadsStarted = new CountDownLatch(p.getCorePoolSize()); |
299 |
> |
final CountDownLatch done = new CountDownLatch(1); |
300 |
> |
final Runnable r = () -> { |
301 |
> |
threadsStarted.countDown(); |
302 |
> |
for (;;) { |
303 |
> |
try { |
304 |
> |
done.await(); |
305 |
> |
return; |
306 |
> |
} catch (InterruptedException shutdownNowDeliberatelyIgnored) {} |
307 |
> |
}}; |
308 |
> |
final Callable<Boolean> c = () -> { |
309 |
> |
threadsStarted.countDown(); |
310 |
> |
for (;;) { |
311 |
> |
try { |
312 |
> |
done.await(); |
313 |
> |
return Boolean.TRUE; |
314 |
> |
} catch (InterruptedException shutdownNowDeliberatelyIgnored) {} |
315 |
> |
}}; |
316 |
|
|
317 |
< |
/** |
318 |
< |
* execute throws RejectedExecutionException if shutdown |
319 |
< |
*/ |
320 |
< |
public void testSchedule1_RejectedExecutionException() { |
321 |
< |
final CustomExecutor p = new CustomExecutor(1); |
322 |
< |
try (PoolCleaner cleaner = cleaner(p)) { |
323 |
< |
try { |
324 |
< |
p.shutdown(); |
325 |
< |
p.schedule(new NoOpRunnable(), |
314 |
< |
MEDIUM_DELAY_MS, MILLISECONDS); |
315 |
< |
shouldThrow(); |
316 |
< |
} catch (RejectedExecutionException success) { |
317 |
< |
} catch (SecurityException ok) {} |
318 |
< |
} |
319 |
< |
} |
317 |
> |
try (PoolCleaner cleaner = cleaner(p, done)) { |
318 |
> |
for (int i = p.getCorePoolSize(); i--> 0; ) { |
319 |
> |
switch (rnd.nextInt(4)) { |
320 |
> |
case 0: p.execute(r); break; |
321 |
> |
case 1: assertFalse(p.submit(r).isDone()); break; |
322 |
> |
case 2: assertFalse(p.submit(r, Boolean.TRUE).isDone()); break; |
323 |
> |
case 3: assertFalse(p.submit(c).isDone()); break; |
324 |
> |
} |
325 |
> |
} |
326 |
|
|
327 |
< |
/** |
328 |
< |
* schedule throws RejectedExecutionException if shutdown |
323 |
< |
*/ |
324 |
< |
public void testSchedule2_RejectedExecutionException() { |
325 |
< |
final CustomExecutor p = new CustomExecutor(1); |
326 |
< |
try (PoolCleaner cleaner = cleaner(p)) { |
327 |
< |
try { |
328 |
< |
p.shutdown(); |
329 |
< |
p.schedule(new NoOpCallable(), |
330 |
< |
MEDIUM_DELAY_MS, MILLISECONDS); |
331 |
< |
shouldThrow(); |
332 |
< |
} catch (RejectedExecutionException success) { |
333 |
< |
} catch (SecurityException ok) {} |
334 |
< |
} |
335 |
< |
} |
327 |
> |
// ScheduledThreadPoolExecutor has an unbounded queue, so never saturated. |
328 |
> |
await(threadsStarted); |
329 |
|
|
330 |
< |
/** |
331 |
< |
* schedule callable throws RejectedExecutionException if shutdown |
332 |
< |
*/ |
340 |
< |
public void testSchedule3_RejectedExecutionException() { |
341 |
< |
final CustomExecutor p = new CustomExecutor(1); |
342 |
< |
try (PoolCleaner cleaner = cleaner(p)) { |
343 |
< |
try { |
330 |
> |
if (rnd.nextBoolean()) |
331 |
> |
p.shutdownNow(); |
332 |
> |
else |
333 |
|
p.shutdown(); |
334 |
< |
p.schedule(new NoOpCallable(), |
335 |
< |
MEDIUM_DELAY_MS, MILLISECONDS); |
336 |
< |
shouldThrow(); |
348 |
< |
} catch (RejectedExecutionException success) { |
349 |
< |
} catch (SecurityException ok) {} |
350 |
< |
} |
351 |
< |
} |
334 |
> |
// Pool is shutdown, but not yet terminated |
335 |
> |
assertTaskSubmissionsAreRejected(p); |
336 |
> |
assertFalse(p.isTerminated()); |
337 |
|
|
338 |
< |
/** |
339 |
< |
* scheduleAtFixedRate throws RejectedExecutionException if shutdown |
355 |
< |
*/ |
356 |
< |
public void testScheduleAtFixedRate1_RejectedExecutionException() { |
357 |
< |
final CustomExecutor p = new CustomExecutor(1); |
358 |
< |
try (PoolCleaner cleaner = cleaner(p)) { |
359 |
< |
try { |
360 |
< |
p.shutdown(); |
361 |
< |
p.scheduleAtFixedRate(new NoOpRunnable(), |
362 |
< |
MEDIUM_DELAY_MS, MEDIUM_DELAY_MS, MILLISECONDS); |
363 |
< |
shouldThrow(); |
364 |
< |
} catch (RejectedExecutionException success) { |
365 |
< |
} catch (SecurityException ok) {} |
366 |
< |
} |
367 |
< |
} |
338 |
> |
done.countDown(); // release blocking tasks |
339 |
> |
assertTrue(p.awaitTermination(LONG_DELAY_MS, MILLISECONDS)); |
340 |
|
|
341 |
< |
/** |
370 |
< |
* scheduleWithFixedDelay throws RejectedExecutionException if shutdown |
371 |
< |
*/ |
372 |
< |
public void testScheduleWithFixedDelay1_RejectedExecutionException() { |
373 |
< |
final CustomExecutor p = new CustomExecutor(1); |
374 |
< |
try (PoolCleaner cleaner = cleaner(p)) { |
375 |
< |
try { |
376 |
< |
p.shutdown(); |
377 |
< |
p.scheduleWithFixedDelay(new NoOpRunnable(), |
378 |
< |
MEDIUM_DELAY_MS, MEDIUM_DELAY_MS, MILLISECONDS); |
379 |
< |
shouldThrow(); |
380 |
< |
} catch (RejectedExecutionException success) { |
381 |
< |
} catch (SecurityException ok) {} |
341 |
> |
assertTaskSubmissionsAreRejected(p); |
342 |
|
} |
343 |
+ |
assertEquals(p.getCorePoolSize(), p.getCompletedTaskCount()); |
344 |
|
} |
345 |
|
|
346 |
|
/** |
379 |
|
public void realRun() throws InterruptedException { |
380 |
|
threadStarted.countDown(); |
381 |
|
assertEquals(0, p.getCompletedTaskCount()); |
382 |
< |
threadProceed.await(); |
382 |
> |
await(threadProceed); |
383 |
|
threadDone.countDown(); |
384 |
|
}}); |
385 |
|
await(threadStarted); |
386 |
|
assertEquals(0, p.getCompletedTaskCount()); |
387 |
|
threadProceed.countDown(); |
388 |
< |
threadDone.await(); |
388 |
> |
await(threadDone); |
389 |
|
long startTime = System.nanoTime(); |
390 |
|
while (p.getCompletedTaskCount() != 1) { |
391 |
|
if (millisElapsedSince(startTime) > LONG_DELAY_MS) |
591 |
|
final ScheduledThreadPoolExecutor p = new CustomExecutor(1); |
592 |
|
try (PoolCleaner cleaner = cleaner(p, done)) { |
593 |
|
final CountDownLatch threadStarted = new CountDownLatch(1); |
594 |
< |
ScheduledFuture[] tasks = new ScheduledFuture[5]; |
594 |
> |
@SuppressWarnings("unchecked") |
595 |
> |
ScheduledFuture<?>[] tasks = (ScheduledFuture<?>[])new ScheduledFuture[5]; |
596 |
|
for (int i = 0; i < tasks.length; i++) { |
597 |
|
Runnable r = new CheckedRunnable() { |
598 |
|
public void realRun() throws InterruptedException { |
615 |
|
final CountDownLatch done = new CountDownLatch(1); |
616 |
|
final ScheduledThreadPoolExecutor p = new CustomExecutor(1); |
617 |
|
try (PoolCleaner cleaner = cleaner(p, done)) { |
618 |
< |
ScheduledFuture[] tasks = new ScheduledFuture[5]; |
618 |
> |
@SuppressWarnings("unchecked") |
619 |
> |
ScheduledFuture<?>[] tasks = (ScheduledFuture<?>[])new ScheduledFuture[5]; |
620 |
|
final CountDownLatch threadStarted = new CountDownLatch(1); |
621 |
|
for (int i = 0; i < tasks.length; i++) { |
622 |
|
Runnable r = new CheckedRunnable() { |
644 |
|
* purge removes cancelled tasks from the queue |
645 |
|
*/ |
646 |
|
public void testPurge() throws InterruptedException { |
647 |
< |
final ScheduledFuture[] tasks = new ScheduledFuture[5]; |
647 |
> |
@SuppressWarnings("unchecked") |
648 |
> |
ScheduledFuture<?>[] tasks = (ScheduledFuture<?>[])new ScheduledFuture[5]; |
649 |
|
final Runnable releaser = new Runnable() { public void run() { |
650 |
< |
for (ScheduledFuture task : tasks) |
650 |
> |
for (ScheduledFuture<?> task : tasks) |
651 |
|
if (task != null) task.cancel(true); }}; |
652 |
|
final CustomExecutor p = new CustomExecutor(1); |
653 |
|
try (PoolCleaner cleaner = cleaner(p, releaser)) { |
654 |
|
for (int i = 0; i < tasks.length; i++) |
655 |
< |
tasks[i] = p.schedule(new SmallPossiblyInterruptedRunnable(), |
655 |
> |
tasks[i] = p.schedule(possiblyInterruptedRunnable(SMALL_DELAY_MS), |
656 |
|
LONG_DELAY_MS, MILLISECONDS); |
657 |
|
int max = tasks.length; |
658 |
|
if (tasks[4].cancel(true)) --max; |
683 |
|
Runnable waiter = new CheckedRunnable() { public void realRun() { |
684 |
|
threadsStarted.countDown(); |
685 |
|
try { |
686 |
< |
MILLISECONDS.sleep(2 * LONG_DELAY_MS); |
686 |
> |
MILLISECONDS.sleep(LONGER_DELAY_MS); |
687 |
|
} catch (InterruptedException success) {} |
688 |
|
ran.getAndIncrement(); |
689 |
|
}}; |
713 |
|
*/ |
714 |
|
public void testShutdownNow_delayedTasks() throws InterruptedException { |
715 |
|
final CustomExecutor p = new CustomExecutor(1); |
716 |
< |
List<ScheduledFuture> tasks = new ArrayList<>(); |
716 |
> |
List<ScheduledFuture<?>> tasks = new ArrayList<>(); |
717 |
|
for (int i = 0; i < 3; i++) { |
718 |
|
Runnable r = new NoOpRunnable(); |
719 |
|
tasks.add(p.schedule(r, 9, SECONDS)); |
721 |
|
tasks.add(p.scheduleWithFixedDelay(r, 9, 9, SECONDS)); |
722 |
|
} |
723 |
|
if (testImplementationDetails) |
724 |
< |
assertEquals(new HashSet(tasks), new HashSet(p.getQueue())); |
724 |
> |
assertEquals(new HashSet<Object>(tasks), new HashSet<Object>(p.getQueue())); |
725 |
|
final List<Runnable> queuedTasks; |
726 |
|
try { |
727 |
|
queuedTasks = p.shutdownNow(); |
731 |
|
assertTrue(p.isShutdown()); |
732 |
|
assertTrue(p.getQueue().isEmpty()); |
733 |
|
if (testImplementationDetails) |
734 |
< |
assertEquals(new HashSet(tasks), new HashSet(queuedTasks)); |
734 |
> |
assertEquals(new HashSet<Object>(tasks), new HashSet<Object>(queuedTasks)); |
735 |
|
assertEquals(tasks.size(), queuedTasks.size()); |
736 |
< |
for (ScheduledFuture task : tasks) { |
736 |
> |
for (ScheduledFuture<?> task : tasks) { |
737 |
|
assertFalse(((CustomTask)task).ran); |
738 |
|
assertFalse(task.isDone()); |
739 |
|
assertFalse(task.isCancelled()); |
749 |
|
* - setExecuteExistingDelayedTasksAfterShutdownPolicy |
750 |
|
* - setContinueExistingPeriodicTasksAfterShutdownPolicy |
751 |
|
*/ |
752 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
753 |
|
public void testShutdown_cancellation() throws Exception { |
754 |
< |
Boolean[] allBooleans = { null, Boolean.FALSE, Boolean.TRUE }; |
790 |
< |
for (Boolean policy : allBooleans) |
791 |
< |
{ |
792 |
< |
final int poolSize = 2; |
754 |
> |
final int poolSize = 4; |
755 |
|
final CustomExecutor p = new CustomExecutor(poolSize); |
756 |
< |
final boolean effectiveDelayedPolicy = (policy != Boolean.FALSE); |
757 |
< |
final boolean effectivePeriodicPolicy = (policy == Boolean.TRUE); |
758 |
< |
final boolean effectiveRemovePolicy = (policy == Boolean.TRUE); |
759 |
< |
if (policy != null) { |
760 |
< |
p.setExecuteExistingDelayedTasksAfterShutdownPolicy(policy); |
761 |
< |
p.setContinueExistingPeriodicTasksAfterShutdownPolicy(policy); |
762 |
< |
p.setRemoveOnCancelPolicy(policy); |
763 |
< |
} |
756 |
> |
final BlockingQueue<Runnable> q = p.getQueue(); |
757 |
> |
final ThreadLocalRandom rnd = ThreadLocalRandom.current(); |
758 |
> |
final long delay = rnd.nextInt(2); |
759 |
> |
final int rounds = rnd.nextInt(1, 3); |
760 |
> |
final boolean effectiveDelayedPolicy; |
761 |
> |
final boolean effectivePeriodicPolicy; |
762 |
> |
final boolean effectiveRemovePolicy; |
763 |
> |
|
764 |
> |
if (rnd.nextBoolean()) |
765 |
> |
p.setExecuteExistingDelayedTasksAfterShutdownPolicy( |
766 |
> |
effectiveDelayedPolicy = rnd.nextBoolean()); |
767 |
> |
else |
768 |
> |
effectiveDelayedPolicy = true; |
769 |
|
assertEquals(effectiveDelayedPolicy, |
770 |
|
p.getExecuteExistingDelayedTasksAfterShutdownPolicy()); |
771 |
+ |
|
772 |
+ |
if (rnd.nextBoolean()) |
773 |
+ |
p.setContinueExistingPeriodicTasksAfterShutdownPolicy( |
774 |
+ |
effectivePeriodicPolicy = rnd.nextBoolean()); |
775 |
+ |
else |
776 |
+ |
effectivePeriodicPolicy = false; |
777 |
|
assertEquals(effectivePeriodicPolicy, |
778 |
|
p.getContinueExistingPeriodicTasksAfterShutdownPolicy()); |
779 |
+ |
|
780 |
+ |
if (rnd.nextBoolean()) |
781 |
+ |
p.setRemoveOnCancelPolicy( |
782 |
+ |
effectiveRemovePolicy = rnd.nextBoolean()); |
783 |
+ |
else |
784 |
+ |
effectiveRemovePolicy = false; |
785 |
|
assertEquals(effectiveRemovePolicy, |
786 |
|
p.getRemoveOnCancelPolicy()); |
787 |
< |
// Strategy: Wedge the pool with poolSize "blocker" threads |
787 |
> |
|
788 |
> |
final boolean periodicTasksContinue = effectivePeriodicPolicy && rnd.nextBoolean(); |
789 |
> |
|
790 |
> |
// Strategy: Wedge the pool with one wave of "blocker" tasks, |
791 |
> |
// then add a second wave that waits in the queue until unblocked. |
792 |
|
final AtomicInteger ran = new AtomicInteger(0); |
793 |
|
final CountDownLatch poolBlocked = new CountDownLatch(poolSize); |
794 |
|
final CountDownLatch unblock = new CountDownLatch(1); |
795 |
< |
final CountDownLatch periodicLatch1 = new CountDownLatch(2); |
813 |
< |
final CountDownLatch periodicLatch2 = new CountDownLatch(2); |
814 |
< |
Runnable task = new CheckedRunnable() { public void realRun() |
815 |
< |
throws InterruptedException { |
816 |
< |
poolBlocked.countDown(); |
817 |
< |
assertTrue(unblock.await(LONG_DELAY_MS, MILLISECONDS)); |
818 |
< |
ran.getAndIncrement(); |
819 |
< |
}}; |
820 |
< |
List<Future<?>> blockers = new ArrayList<>(); |
821 |
< |
List<Future<?>> periodics = new ArrayList<>(); |
822 |
< |
List<Future<?>> delayeds = new ArrayList<>(); |
823 |
< |
for (int i = 0; i < poolSize; i++) |
824 |
< |
blockers.add(p.submit(task)); |
825 |
< |
assertTrue(poolBlocked.await(LONG_DELAY_MS, MILLISECONDS)); |
826 |
< |
|
827 |
< |
periodics.add(p.scheduleAtFixedRate(countDowner(periodicLatch1), |
828 |
< |
1, 1, MILLISECONDS)); |
829 |
< |
periodics.add(p.scheduleWithFixedDelay(countDowner(periodicLatch2), |
830 |
< |
1, 1, MILLISECONDS)); |
831 |
< |
delayeds.add(p.schedule(task, 1, MILLISECONDS)); |
795 |
> |
final RuntimeException exception = new RuntimeException(); |
796 |
|
|
797 |
< |
assertTrue(p.getQueue().containsAll(periodics)); |
798 |
< |
assertTrue(p.getQueue().containsAll(delayeds)); |
799 |
< |
try { p.shutdown(); } catch (SecurityException ok) { return; } |
800 |
< |
assertTrue(p.isShutdown()); |
801 |
< |
assertFalse(p.isTerminated()); |
802 |
< |
for (Future<?> periodic : periodics) { |
803 |
< |
assertTrue(effectivePeriodicPolicy ^ periodic.isCancelled()); |
840 |
< |
assertTrue(effectivePeriodicPolicy ^ periodic.isDone()); |
841 |
< |
} |
842 |
< |
for (Future<?> delayed : delayeds) { |
843 |
< |
assertTrue(effectiveDelayedPolicy ^ delayed.isCancelled()); |
844 |
< |
assertTrue(effectiveDelayedPolicy ^ delayed.isDone()); |
845 |
< |
} |
846 |
< |
if (testImplementationDetails) { |
847 |
< |
assertEquals(effectivePeriodicPolicy, |
848 |
< |
p.getQueue().containsAll(periodics)); |
849 |
< |
assertEquals(effectiveDelayedPolicy, |
850 |
< |
p.getQueue().containsAll(delayeds)); |
851 |
< |
} |
852 |
< |
// Release all pool threads |
853 |
< |
unblock.countDown(); |
854 |
< |
|
855 |
< |
for (Future<?> delayed : delayeds) { |
856 |
< |
if (effectiveDelayedPolicy) { |
857 |
< |
assertNull(delayed.get()); |
797 |
> |
class Task implements Runnable { |
798 |
> |
public void run() { |
799 |
> |
try { |
800 |
> |
ran.getAndIncrement(); |
801 |
> |
poolBlocked.countDown(); |
802 |
> |
await(unblock); |
803 |
> |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
804 |
|
} |
805 |
|
} |
806 |
< |
if (effectivePeriodicPolicy) { |
807 |
< |
assertTrue(periodicLatch1.await(LONG_DELAY_MS, MILLISECONDS)); |
808 |
< |
assertTrue(periodicLatch2.await(LONG_DELAY_MS, MILLISECONDS)); |
809 |
< |
for (Future<?> periodic : periodics) { |
810 |
< |
assertTrue(periodic.cancel(false)); |
811 |
< |
assertTrue(periodic.isCancelled()); |
812 |
< |
assertTrue(periodic.isDone()); |
806 |
> |
|
807 |
> |
class PeriodicTask extends Task { |
808 |
> |
PeriodicTask(int rounds) { this.rounds = rounds; } |
809 |
> |
int rounds; |
810 |
> |
public void run() { |
811 |
> |
if (--rounds == 0) super.run(); |
812 |
> |
// throw exception to surely terminate this periodic task, |
813 |
> |
// but in a separate execution and in a detectable way. |
814 |
> |
if (rounds == -1) throw exception; |
815 |
|
} |
816 |
|
} |
817 |
+ |
|
818 |
+ |
Runnable task = new Task(); |
819 |
+ |
|
820 |
+ |
List<Future<?>> immediates = new ArrayList<>(); |
821 |
+ |
List<Future<?>> delayeds = new ArrayList<>(); |
822 |
+ |
List<Future<?>> periodics = new ArrayList<>(); |
823 |
+ |
|
824 |
+ |
immediates.add(p.submit(task)); |
825 |
+ |
delayeds.add(p.schedule(task, delay, MILLISECONDS)); |
826 |
+ |
periodics.add(p.scheduleAtFixedRate( |
827 |
+ |
new PeriodicTask(rounds), delay, 1, MILLISECONDS)); |
828 |
+ |
periodics.add(p.scheduleWithFixedDelay( |
829 |
+ |
new PeriodicTask(rounds), delay, 1, MILLISECONDS)); |
830 |
+ |
|
831 |
+ |
await(poolBlocked); |
832 |
+ |
|
833 |
+ |
assertEquals(poolSize, ran.get()); |
834 |
+ |
assertEquals(poolSize, p.getActiveCount()); |
835 |
+ |
assertTrue(q.isEmpty()); |
836 |
+ |
|
837 |
+ |
// Add second wave of tasks. |
838 |
+ |
immediates.add(p.submit(task)); |
839 |
+ |
delayeds.add(p.schedule(task, effectiveDelayedPolicy ? delay : LONG_DELAY_MS, MILLISECONDS)); |
840 |
+ |
periodics.add(p.scheduleAtFixedRate( |
841 |
+ |
new PeriodicTask(rounds), delay, 1, MILLISECONDS)); |
842 |
+ |
periodics.add(p.scheduleWithFixedDelay( |
843 |
+ |
new PeriodicTask(rounds), delay, 1, MILLISECONDS)); |
844 |
+ |
|
845 |
+ |
assertEquals(poolSize, q.size()); |
846 |
+ |
assertEquals(poolSize, ran.get()); |
847 |
+ |
|
848 |
+ |
immediates.forEach( |
849 |
+ |
f -> assertTrue(((ScheduledFuture)f).getDelay(NANOSECONDS) <= 0L)); |
850 |
+ |
|
851 |
+ |
Stream.of(immediates, delayeds, periodics).flatMap(Collection::stream) |
852 |
+ |
.forEach(f -> assertFalse(f.isDone())); |
853 |
+ |
|
854 |
+ |
try { p.shutdown(); } catch (SecurityException ok) { return; } |
855 |
+ |
assertTrue(p.isShutdown()); |
856 |
+ |
assertTrue(p.isTerminating()); |
857 |
+ |
assertFalse(p.isTerminated()); |
858 |
+ |
|
859 |
+ |
if (rnd.nextBoolean()) |
860 |
+ |
assertThrows( |
861 |
+ |
RejectedExecutionException.class, |
862 |
+ |
() -> p.submit(task), |
863 |
+ |
() -> p.schedule(task, 1, SECONDS), |
864 |
+ |
() -> p.scheduleAtFixedRate( |
865 |
+ |
new PeriodicTask(1), 1, 1, SECONDS), |
866 |
+ |
() -> p.scheduleWithFixedDelay( |
867 |
+ |
new PeriodicTask(2), 1, 1, SECONDS)); |
868 |
+ |
|
869 |
+ |
assertTrue(q.contains(immediates.get(1))); |
870 |
+ |
assertTrue(!effectiveDelayedPolicy |
871 |
+ |
^ q.contains(delayeds.get(1))); |
872 |
+ |
assertTrue(!effectivePeriodicPolicy |
873 |
+ |
^ q.containsAll(periodics.subList(2, 4))); |
874 |
+ |
|
875 |
+ |
immediates.forEach(f -> assertFalse(f.isDone())); |
876 |
+ |
|
877 |
+ |
assertFalse(delayeds.get(0).isDone()); |
878 |
+ |
if (effectiveDelayedPolicy) |
879 |
+ |
assertFalse(delayeds.get(1).isDone()); |
880 |
+ |
else |
881 |
+ |
assertTrue(delayeds.get(1).isCancelled()); |
882 |
+ |
|
883 |
+ |
if (effectivePeriodicPolicy) |
884 |
+ |
periodics.forEach( |
885 |
+ |
f -> { |
886 |
+ |
assertFalse(f.isDone()); |
887 |
+ |
if (!periodicTasksContinue) { |
888 |
+ |
assertTrue(f.cancel(false)); |
889 |
+ |
assertTrue(f.isCancelled()); |
890 |
+ |
} |
891 |
+ |
}); |
892 |
+ |
else { |
893 |
+ |
periodics.subList(0, 2).forEach(f -> assertFalse(f.isDone())); |
894 |
+ |
periodics.subList(2, 4).forEach(f -> assertTrue(f.isCancelled())); |
895 |
+ |
} |
896 |
+ |
|
897 |
+ |
unblock.countDown(); // Release all pool threads |
898 |
+ |
|
899 |
|
assertTrue(p.awaitTermination(LONG_DELAY_MS, MILLISECONDS)); |
900 |
+ |
assertFalse(p.isTerminating()); |
901 |
|
assertTrue(p.isTerminated()); |
902 |
< |
assertEquals(2 + (effectiveDelayedPolicy ? 1 : 0), ran.get()); |
903 |
< |
}} |
902 |
> |
|
903 |
> |
assertTrue(q.isEmpty()); |
904 |
> |
|
905 |
> |
Stream.of(immediates, delayeds, periodics).flatMap(Collection::stream) |
906 |
> |
.forEach(f -> assertTrue(f.isDone())); |
907 |
> |
|
908 |
> |
for (Future<?> f : immediates) assertNull(f.get()); |
909 |
> |
|
910 |
> |
assertNull(delayeds.get(0).get()); |
911 |
> |
if (effectiveDelayedPolicy) |
912 |
> |
assertNull(delayeds.get(1).get()); |
913 |
> |
else |
914 |
> |
assertTrue(delayeds.get(1).isCancelled()); |
915 |
> |
|
916 |
> |
if (periodicTasksContinue) |
917 |
> |
periodics.forEach( |
918 |
> |
f -> { |
919 |
> |
try { f.get(); } |
920 |
> |
catch (ExecutionException success) { |
921 |
> |
assertSame(exception, success.getCause()); |
922 |
> |
} |
923 |
> |
catch (Throwable fail) { threadUnexpectedException(fail); } |
924 |
> |
}); |
925 |
> |
else |
926 |
> |
periodics.forEach(f -> assertTrue(f.isCancelled())); |
927 |
> |
|
928 |
> |
assertEquals(poolSize + 1 |
929 |
> |
+ (effectiveDelayedPolicy ? 1 : 0) |
930 |
> |
+ (periodicTasksContinue ? 2 : 0), |
931 |
> |
ran.get()); |
932 |
> |
} |
933 |
|
|
934 |
|
/** |
935 |
|
* completed submit of callable returns result |
981 |
|
} |
982 |
|
|
983 |
|
/** |
984 |
< |
* invokeAny(empty collection) throws IAE |
984 |
> |
* invokeAny(empty collection) throws IllegalArgumentException |
985 |
|
*/ |
986 |
|
public void testInvokeAny2() throws Exception { |
987 |
|
final ExecutorService e = new CustomExecutor(2); |
1000 |
|
final CountDownLatch latch = new CountDownLatch(1); |
1001 |
|
final ExecutorService e = new CustomExecutor(2); |
1002 |
|
try (PoolCleaner cleaner = cleaner(e)) { |
1003 |
< |
List<Callable<String>> l = new ArrayList<Callable<String>>(); |
1003 |
> |
List<Callable<String>> l = new ArrayList<>(); |
1004 |
|
l.add(latchAwaitingStringTask(latch)); |
1005 |
|
l.add(null); |
1006 |
|
try { |
1017 |
|
public void testInvokeAny4() throws Exception { |
1018 |
|
final ExecutorService e = new CustomExecutor(2); |
1019 |
|
try (PoolCleaner cleaner = cleaner(e)) { |
1020 |
< |
List<Callable<String>> l = new ArrayList<Callable<String>>(); |
1020 |
> |
List<Callable<String>> l = new ArrayList<>(); |
1021 |
|
l.add(new NPETask()); |
1022 |
|
try { |
1023 |
|
e.invokeAny(l); |
1034 |
|
public void testInvokeAny5() throws Exception { |
1035 |
|
final ExecutorService e = new CustomExecutor(2); |
1036 |
|
try (PoolCleaner cleaner = cleaner(e)) { |
1037 |
< |
List<Callable<String>> l = new ArrayList<Callable<String>>(); |
1037 |
> |
List<Callable<String>> l = new ArrayList<>(); |
1038 |
|
l.add(new StringTask()); |
1039 |
|
l.add(new StringTask()); |
1040 |
|
String result = e.invokeAny(l); |
1056 |
|
} |
1057 |
|
|
1058 |
|
/** |
1059 |
< |
* invokeAll(empty collection) returns empty collection |
1059 |
> |
* invokeAll(empty collection) returns empty list |
1060 |
|
*/ |
1061 |
|
public void testInvokeAll2() throws Exception { |
1062 |
|
final ExecutorService e = new CustomExecutor(2); |
1063 |
+ |
final Collection<Callable<String>> emptyCollection |
1064 |
+ |
= Collections.emptyList(); |
1065 |
|
try (PoolCleaner cleaner = cleaner(e)) { |
1066 |
< |
List<Future<String>> r = e.invokeAll(new ArrayList<Callable<String>>()); |
1066 |
> |
List<Future<String>> r = e.invokeAll(emptyCollection); |
1067 |
|
assertTrue(r.isEmpty()); |
1068 |
|
} |
1069 |
|
} |
1074 |
|
public void testInvokeAll3() throws Exception { |
1075 |
|
final ExecutorService e = new CustomExecutor(2); |
1076 |
|
try (PoolCleaner cleaner = cleaner(e)) { |
1077 |
< |
List<Callable<String>> l = new ArrayList<Callable<String>>(); |
1077 |
> |
List<Callable<String>> l = new ArrayList<>(); |
1078 |
|
l.add(new StringTask()); |
1079 |
|
l.add(null); |
1080 |
|
try { |
1090 |
|
public void testInvokeAll4() throws Exception { |
1091 |
|
final ExecutorService e = new CustomExecutor(2); |
1092 |
|
try (PoolCleaner cleaner = cleaner(e)) { |
1093 |
< |
List<Callable<String>> l = new ArrayList<Callable<String>>(); |
1093 |
> |
List<Callable<String>> l = new ArrayList<>(); |
1094 |
|
l.add(new NPETask()); |
1095 |
|
List<Future<String>> futures = e.invokeAll(l); |
1096 |
|
assertEquals(1, futures.size()); |
1109 |
|
public void testInvokeAll5() throws Exception { |
1110 |
|
final ExecutorService e = new CustomExecutor(2); |
1111 |
|
try (PoolCleaner cleaner = cleaner(e)) { |
1112 |
< |
List<Callable<String>> l = new ArrayList<Callable<String>>(); |
1112 |
> |
List<Callable<String>> l = new ArrayList<>(); |
1113 |
|
l.add(new StringTask()); |
1114 |
|
l.add(new StringTask()); |
1115 |
|
List<Future<String>> futures = e.invokeAll(l); |
1126 |
|
final ExecutorService e = new CustomExecutor(2); |
1127 |
|
try (PoolCleaner cleaner = cleaner(e)) { |
1128 |
|
try { |
1129 |
< |
e.invokeAny(null, MEDIUM_DELAY_MS, MILLISECONDS); |
1129 |
> |
e.invokeAny(null, randomTimeout(), randomTimeUnit()); |
1130 |
|
shouldThrow(); |
1131 |
|
} catch (NullPointerException success) {} |
1132 |
|
} |
1138 |
|
public void testTimedInvokeAnyNullTimeUnit() throws Exception { |
1139 |
|
final ExecutorService e = new CustomExecutor(2); |
1140 |
|
try (PoolCleaner cleaner = cleaner(e)) { |
1141 |
< |
List<Callable<String>> l = new ArrayList<Callable<String>>(); |
1141 |
> |
List<Callable<String>> l = new ArrayList<>(); |
1142 |
|
l.add(new StringTask()); |
1143 |
|
try { |
1144 |
< |
e.invokeAny(l, MEDIUM_DELAY_MS, null); |
1144 |
> |
e.invokeAny(l, randomTimeout(), null); |
1145 |
|
shouldThrow(); |
1146 |
|
} catch (NullPointerException success) {} |
1147 |
|
} |
1148 |
|
} |
1149 |
|
|
1150 |
|
/** |
1151 |
< |
* timed invokeAny(empty collection) throws IAE |
1151 |
> |
* timed invokeAny(empty collection) throws IllegalArgumentException |
1152 |
|
*/ |
1153 |
|
public void testTimedInvokeAny2() throws Exception { |
1154 |
|
final ExecutorService e = new CustomExecutor(2); |
1155 |
+ |
final Collection<Callable<String>> emptyCollection |
1156 |
+ |
= Collections.emptyList(); |
1157 |
|
try (PoolCleaner cleaner = cleaner(e)) { |
1158 |
|
try { |
1159 |
< |
e.invokeAny(new ArrayList<Callable<String>>(), MEDIUM_DELAY_MS, MILLISECONDS); |
1159 |
> |
e.invokeAny(emptyCollection, randomTimeout(), randomTimeUnit()); |
1160 |
|
shouldThrow(); |
1161 |
|
} catch (IllegalArgumentException success) {} |
1162 |
|
} |
1169 |
|
CountDownLatch latch = new CountDownLatch(1); |
1170 |
|
final ExecutorService e = new CustomExecutor(2); |
1171 |
|
try (PoolCleaner cleaner = cleaner(e)) { |
1172 |
< |
List<Callable<String>> l = new ArrayList<Callable<String>>(); |
1172 |
> |
List<Callable<String>> l = new ArrayList<>(); |
1173 |
|
l.add(latchAwaitingStringTask(latch)); |
1174 |
|
l.add(null); |
1175 |
|
try { |
1176 |
< |
e.invokeAny(l, MEDIUM_DELAY_MS, MILLISECONDS); |
1176 |
> |
e.invokeAny(l, randomTimeout(), randomTimeUnit()); |
1177 |
|
shouldThrow(); |
1178 |
|
} catch (NullPointerException success) {} |
1179 |
|
latch.countDown(); |
1187 |
|
final ExecutorService e = new CustomExecutor(2); |
1188 |
|
try (PoolCleaner cleaner = cleaner(e)) { |
1189 |
|
long startTime = System.nanoTime(); |
1190 |
< |
List<Callable<String>> l = new ArrayList<Callable<String>>(); |
1190 |
> |
List<Callable<String>> l = new ArrayList<>(); |
1191 |
|
l.add(new NPETask()); |
1192 |
|
try { |
1193 |
|
e.invokeAny(l, LONG_DELAY_MS, MILLISECONDS); |
1206 |
|
final ExecutorService e = new CustomExecutor(2); |
1207 |
|
try (PoolCleaner cleaner = cleaner(e)) { |
1208 |
|
long startTime = System.nanoTime(); |
1209 |
< |
List<Callable<String>> l = new ArrayList<Callable<String>>(); |
1209 |
> |
List<Callable<String>> l = new ArrayList<>(); |
1210 |
|
l.add(new StringTask()); |
1211 |
|
l.add(new StringTask()); |
1212 |
|
String result = e.invokeAny(l, LONG_DELAY_MS, MILLISECONDS); |
1216 |
|
} |
1217 |
|
|
1218 |
|
/** |
1219 |
< |
* timed invokeAll(null) throws NPE |
1219 |
> |
* timed invokeAll(null) throws NullPointerException |
1220 |
|
*/ |
1221 |
|
public void testTimedInvokeAll1() throws Exception { |
1222 |
|
final ExecutorService e = new CustomExecutor(2); |
1223 |
|
try (PoolCleaner cleaner = cleaner(e)) { |
1224 |
|
try { |
1225 |
< |
e.invokeAll(null, MEDIUM_DELAY_MS, MILLISECONDS); |
1225 |
> |
e.invokeAll(null, randomTimeout(), randomTimeUnit()); |
1226 |
|
shouldThrow(); |
1227 |
|
} catch (NullPointerException success) {} |
1228 |
|
} |
1229 |
|
} |
1230 |
|
|
1231 |
|
/** |
1232 |
< |
* timed invokeAll(,,null) throws NPE |
1232 |
> |
* timed invokeAll(,,null) throws NullPointerException |
1233 |
|
*/ |
1234 |
|
public void testTimedInvokeAllNullTimeUnit() throws Exception { |
1235 |
|
final ExecutorService e = new CustomExecutor(2); |
1236 |
|
try (PoolCleaner cleaner = cleaner(e)) { |
1237 |
< |
List<Callable<String>> l = new ArrayList<Callable<String>>(); |
1237 |
> |
List<Callable<String>> l = new ArrayList<>(); |
1238 |
|
l.add(new StringTask()); |
1239 |
|
try { |
1240 |
< |
e.invokeAll(l, MEDIUM_DELAY_MS, null); |
1240 |
> |
e.invokeAll(l, randomTimeout(), null); |
1241 |
|
shouldThrow(); |
1242 |
|
} catch (NullPointerException success) {} |
1243 |
|
} |
1244 |
|
} |
1245 |
|
|
1246 |
|
/** |
1247 |
< |
* timed invokeAll(empty collection) returns empty collection |
1247 |
> |
* timed invokeAll(empty collection) returns empty list |
1248 |
|
*/ |
1249 |
|
public void testTimedInvokeAll2() throws Exception { |
1250 |
|
final ExecutorService e = new CustomExecutor(2); |
1251 |
+ |
final Collection<Callable<String>> emptyCollection |
1252 |
+ |
= Collections.emptyList(); |
1253 |
|
try (PoolCleaner cleaner = cleaner(e)) { |
1254 |
< |
List<Future<String>> r = e.invokeAll(new ArrayList<Callable<String>>(), MEDIUM_DELAY_MS, MILLISECONDS); |
1254 |
> |
List<Future<String>> r = |
1255 |
> |
e.invokeAll(emptyCollection, randomTimeout(), randomTimeUnit()); |
1256 |
|
assertTrue(r.isEmpty()); |
1257 |
|
} |
1258 |
|
} |
1263 |
|
public void testTimedInvokeAll3() throws Exception { |
1264 |
|
final ExecutorService e = new CustomExecutor(2); |
1265 |
|
try (PoolCleaner cleaner = cleaner(e)) { |
1266 |
< |
List<Callable<String>> l = new ArrayList<Callable<String>>(); |
1266 |
> |
List<Callable<String>> l = new ArrayList<>(); |
1267 |
|
l.add(new StringTask()); |
1268 |
|
l.add(null); |
1269 |
|
try { |
1270 |
< |
e.invokeAll(l, MEDIUM_DELAY_MS, MILLISECONDS); |
1270 |
> |
e.invokeAll(l, randomTimeout(), randomTimeUnit()); |
1271 |
|
shouldThrow(); |
1272 |
|
} catch (NullPointerException success) {} |
1273 |
|
} |
1278 |
|
*/ |
1279 |
|
public void testTimedInvokeAll4() throws Exception { |
1280 |
|
final ExecutorService e = new CustomExecutor(2); |
1281 |
+ |
final Collection<Callable<String>> c = new ArrayList<>(); |
1282 |
+ |
c.add(new NPETask()); |
1283 |
|
try (PoolCleaner cleaner = cleaner(e)) { |
1215 |
– |
List<Callable<String>> l = new ArrayList<Callable<String>>(); |
1216 |
– |
l.add(new NPETask()); |
1284 |
|
List<Future<String>> futures = |
1285 |
< |
e.invokeAll(l, MEDIUM_DELAY_MS, MILLISECONDS); |
1285 |
> |
e.invokeAll(c, LONG_DELAY_MS, MILLISECONDS); |
1286 |
|
assertEquals(1, futures.size()); |
1287 |
|
try { |
1288 |
|
futures.get(0).get(); |
1299 |
|
public void testTimedInvokeAll5() throws Exception { |
1300 |
|
final ExecutorService e = new CustomExecutor(2); |
1301 |
|
try (PoolCleaner cleaner = cleaner(e)) { |
1302 |
< |
List<Callable<String>> l = new ArrayList<Callable<String>>(); |
1302 |
> |
List<Callable<String>> l = new ArrayList<>(); |
1303 |
|
l.add(new StringTask()); |
1304 |
|
l.add(new StringTask()); |
1305 |
|
List<Future<String>> futures = |
1332 |
|
p.invokeAll(tasks, timeout, MILLISECONDS); |
1333 |
|
assertEquals(tasks.size(), futures.size()); |
1334 |
|
assertTrue(millisElapsedSince(startTime) >= timeout); |
1335 |
< |
for (Future future : futures) |
1335 |
> |
for (Future<?> future : futures) |
1336 |
|
assertTrue(future.isDone()); |
1337 |
|
assertTrue(futures.get(1).isCancelled()); |
1338 |
|
try { |