76 |
|
import java.util.concurrent.CountDownLatch; |
77 |
|
import java.util.concurrent.CyclicBarrier; |
78 |
|
import java.util.concurrent.ExecutionException; |
79 |
+ |
import java.util.concurrent.Executor; |
80 |
|
import java.util.concurrent.Executors; |
81 |
|
import java.util.concurrent.ExecutorService; |
82 |
|
import java.util.concurrent.ForkJoinPool; |
83 |
|
import java.util.concurrent.Future; |
84 |
+ |
import java.util.concurrent.FutureTask; |
85 |
|
import java.util.concurrent.RecursiveAction; |
86 |
|
import java.util.concurrent.RecursiveTask; |
87 |
+ |
import java.util.concurrent.RejectedExecutionException; |
88 |
|
import java.util.concurrent.RejectedExecutionHandler; |
89 |
|
import java.util.concurrent.Semaphore; |
90 |
+ |
import java.util.concurrent.ScheduledExecutorService; |
91 |
+ |
import java.util.concurrent.ScheduledFuture; |
92 |
|
import java.util.concurrent.SynchronousQueue; |
93 |
|
import java.util.concurrent.ThreadFactory; |
94 |
|
import java.util.concurrent.ThreadLocalRandom; |
95 |
|
import java.util.concurrent.ThreadPoolExecutor; |
96 |
+ |
import java.util.concurrent.TimeUnit; |
97 |
|
import java.util.concurrent.TimeoutException; |
98 |
|
import java.util.concurrent.atomic.AtomicBoolean; |
99 |
|
import java.util.concurrent.atomic.AtomicReference; |
644 |
|
public static long MEDIUM_DELAY_MS; |
645 |
|
public static long LONG_DELAY_MS; |
646 |
|
|
647 |
+ |
private static final long RANDOM_TIMEOUT; |
648 |
+ |
private static final long RANDOM_EXPIRED_TIMEOUT; |
649 |
+ |
private static final TimeUnit RANDOM_TIMEUNIT; |
650 |
+ |
static { |
651 |
+ |
ThreadLocalRandom rnd = ThreadLocalRandom.current(); |
652 |
+ |
long[] timeouts = { Long.MIN_VALUE, -1, 0, 1, Long.MAX_VALUE }; |
653 |
+ |
RANDOM_TIMEOUT = timeouts[rnd.nextInt(timeouts.length)]; |
654 |
+ |
RANDOM_EXPIRED_TIMEOUT = timeouts[rnd.nextInt(3)]; |
655 |
+ |
TimeUnit[] timeUnits = TimeUnit.values(); |
656 |
+ |
RANDOM_TIMEUNIT = timeUnits[rnd.nextInt(timeUnits.length)]; |
657 |
+ |
} |
658 |
+ |
|
659 |
+ |
/** |
660 |
+ |
* Returns a timeout for use when any value at all will do. |
661 |
+ |
*/ |
662 |
+ |
static long randomTimeout() { return RANDOM_TIMEOUT; } |
663 |
+ |
|
664 |
+ |
/** |
665 |
+ |
* Returns a timeout that means "no waiting", i.e. not positive. |
666 |
+ |
*/ |
667 |
+ |
static long randomExpiredTimeout() { return RANDOM_EXPIRED_TIMEOUT; } |
668 |
+ |
|
669 |
+ |
/** |
670 |
+ |
* Returns a random non-null TimeUnit. |
671 |
+ |
*/ |
672 |
+ |
static TimeUnit randomTimeUnit() { return RANDOM_TIMEUNIT; } |
673 |
+ |
|
674 |
|
/** |
675 |
|
* Returns the shortest timed delay. This can be scaled up for |
676 |
|
* slow machines using the jsr166.delay.factor system property, |
691 |
|
LONG_DELAY_MS = SHORT_DELAY_MS * 200; |
692 |
|
} |
693 |
|
|
694 |
+ |
private static final long TIMEOUT_DELAY_MS |
695 |
+ |
= (long) (12.0 * Math.cbrt(delayFactor)); |
696 |
+ |
|
697 |
|
/** |
698 |
< |
* Returns a timeout in milliseconds to be used in tests that |
699 |
< |
* verify that operations block or time out. |
698 |
> |
* Returns a timeout in milliseconds to be used in tests that verify |
699 |
> |
* that operations block or time out. We want this to be longer |
700 |
> |
* than the OS scheduling quantum, but not too long, so don't scale |
701 |
> |
* linearly with delayFactor; we use "crazy" cube root instead. |
702 |
|
*/ |
703 |
< |
long timeoutMillis() { |
704 |
< |
return SHORT_DELAY_MS / 4; |
703 |
> |
static long timeoutMillis() { |
704 |
> |
return TIMEOUT_DELAY_MS; |
705 |
|
} |
706 |
|
|
707 |
|
/** |
1096 |
|
} |
1097 |
|
|
1098 |
|
/** |
1099 |
< |
* Checks that thread does not terminate within the default |
1062 |
< |
* millisecond delay of {@code timeoutMillis()}. |
1099 |
> |
* Checks that thread eventually enters the expected blocked thread state. |
1100 |
|
*/ |
1101 |
< |
void assertThreadStaysAlive(Thread thread) { |
1102 |
< |
assertThreadStaysAlive(thread, timeoutMillis()); |
1103 |
< |
} |
1104 |
< |
|
1105 |
< |
/** |
1106 |
< |
* Checks that thread does not terminate within the given millisecond delay. |
1107 |
< |
*/ |
1108 |
< |
void assertThreadStaysAlive(Thread thread, long millis) { |
1109 |
< |
try { |
1110 |
< |
// No need to optimize the failing case via Thread.join. |
1111 |
< |
delay(millis); |
1112 |
< |
assertTrue(thread.isAlive()); |
1113 |
< |
} catch (InterruptedException fail) { |
1077 |
< |
threadFail("Unexpected InterruptedException"); |
1078 |
< |
} |
1079 |
< |
} |
1080 |
< |
|
1081 |
< |
/** |
1082 |
< |
* Checks that the threads do not terminate within the default |
1083 |
< |
* millisecond delay of {@code timeoutMillis()}. |
1084 |
< |
*/ |
1085 |
< |
void assertThreadsStayAlive(Thread... threads) { |
1086 |
< |
assertThreadsStayAlive(timeoutMillis(), threads); |
1087 |
< |
} |
1088 |
< |
|
1089 |
< |
/** |
1090 |
< |
* Checks that the threads do not terminate within the given millisecond delay. |
1091 |
< |
*/ |
1092 |
< |
void assertThreadsStayAlive(long millis, Thread... threads) { |
1093 |
< |
try { |
1094 |
< |
// No need to optimize the failing case via Thread.join. |
1095 |
< |
delay(millis); |
1096 |
< |
for (Thread thread : threads) |
1097 |
< |
assertTrue(thread.isAlive()); |
1098 |
< |
} catch (InterruptedException fail) { |
1099 |
< |
threadFail("Unexpected InterruptedException"); |
1101 |
> |
void assertThreadBlocks(Thread thread, Thread.State expected) { |
1102 |
> |
// always sleep at least 1 ms, with high probability avoiding |
1103 |
> |
// transitory states |
1104 |
> |
for (long retries = LONG_DELAY_MS * 3 / 4; retries-->0; ) { |
1105 |
> |
try { delay(1); } |
1106 |
> |
catch (InterruptedException fail) { |
1107 |
> |
fail("Unexpected InterruptedException"); |
1108 |
> |
} |
1109 |
> |
Thread.State s = thread.getState(); |
1110 |
> |
if (s == expected) |
1111 |
> |
return; |
1112 |
> |
else if (s == Thread.State.TERMINATED) |
1113 |
> |
fail("Unexpected thread termination"); |
1114 |
|
} |
1115 |
+ |
fail("timed out waiting for thread to enter thread state " + expected); |
1116 |
|
} |
1117 |
|
|
1118 |
|
/** |
1627 |
|
} |
1628 |
|
} |
1629 |
|
|
1630 |
+ |
public void await(CyclicBarrier barrier) { |
1631 |
+ |
try { |
1632 |
+ |
barrier.await(LONG_DELAY_MS, MILLISECONDS); |
1633 |
+ |
} catch (Throwable fail) { |
1634 |
+ |
threadUnexpectedException(fail); |
1635 |
+ |
} |
1636 |
+ |
} |
1637 |
+ |
|
1638 |
|
// /** |
1639 |
|
// * Spin-waits up to LONG_DELAY_MS until flag becomes true. |
1640 |
|
// */ |
1658 |
|
public String call() { throw new NullPointerException(); } |
1659 |
|
} |
1660 |
|
|
1638 |
– |
public static class CallableOne implements Callable<Integer> { |
1639 |
– |
public Integer call() { return one; } |
1640 |
– |
} |
1641 |
– |
|
1642 |
– |
public class ShortRunnable extends CheckedRunnable { |
1643 |
– |
protected void realRun() throws Throwable { |
1644 |
– |
delay(SHORT_DELAY_MS); |
1645 |
– |
} |
1646 |
– |
} |
1647 |
– |
|
1648 |
– |
public class ShortInterruptedRunnable extends CheckedInterruptedRunnable { |
1649 |
– |
protected void realRun() throws InterruptedException { |
1650 |
– |
delay(SHORT_DELAY_MS); |
1651 |
– |
} |
1652 |
– |
} |
1653 |
– |
|
1654 |
– |
public class SmallRunnable extends CheckedRunnable { |
1655 |
– |
protected void realRun() throws Throwable { |
1656 |
– |
delay(SMALL_DELAY_MS); |
1657 |
– |
} |
1658 |
– |
} |
1659 |
– |
|
1661 |
|
public class SmallPossiblyInterruptedRunnable extends CheckedRunnable { |
1662 |
|
protected void realRun() { |
1663 |
|
try { |
1666 |
|
} |
1667 |
|
} |
1668 |
|
|
1668 |
– |
public class SmallCallable extends CheckedCallable { |
1669 |
– |
protected Object realCall() throws InterruptedException { |
1670 |
– |
delay(SMALL_DELAY_MS); |
1671 |
– |
return Boolean.TRUE; |
1672 |
– |
} |
1673 |
– |
} |
1674 |
– |
|
1675 |
– |
public class MediumRunnable extends CheckedRunnable { |
1676 |
– |
protected void realRun() throws Throwable { |
1677 |
– |
delay(MEDIUM_DELAY_MS); |
1678 |
– |
} |
1679 |
– |
} |
1680 |
– |
|
1681 |
– |
public class MediumInterruptedRunnable extends CheckedInterruptedRunnable { |
1682 |
– |
protected void realRun() throws InterruptedException { |
1683 |
– |
delay(MEDIUM_DELAY_MS); |
1684 |
– |
} |
1685 |
– |
} |
1686 |
– |
|
1669 |
|
public Runnable possiblyInterruptedRunnable(final long timeoutMillis) { |
1670 |
|
return new CheckedRunnable() { |
1671 |
|
protected void realRun() { |
1675 |
|
}}; |
1676 |
|
} |
1677 |
|
|
1696 |
– |
public class MediumPossiblyInterruptedRunnable extends CheckedRunnable { |
1697 |
– |
protected void realRun() { |
1698 |
– |
try { |
1699 |
– |
delay(MEDIUM_DELAY_MS); |
1700 |
– |
} catch (InterruptedException ok) {} |
1701 |
– |
} |
1702 |
– |
} |
1703 |
– |
|
1704 |
– |
public class LongPossiblyInterruptedRunnable extends CheckedRunnable { |
1705 |
– |
protected void realRun() { |
1706 |
– |
try { |
1707 |
– |
delay(LONG_DELAY_MS); |
1708 |
– |
} catch (InterruptedException ok) {} |
1709 |
– |
} |
1710 |
– |
} |
1711 |
– |
|
1678 |
|
/** |
1679 |
|
* For use as ThreadFactory in constructors |
1680 |
|
*/ |
1688 |
|
boolean isDone(); |
1689 |
|
} |
1690 |
|
|
1725 |
– |
public static TrackedRunnable trackedRunnable(final long timeoutMillis) { |
1726 |
– |
return new TrackedRunnable() { |
1727 |
– |
private volatile boolean done = false; |
1728 |
– |
public boolean isDone() { return done; } |
1729 |
– |
public void run() { |
1730 |
– |
try { |
1731 |
– |
delay(timeoutMillis); |
1732 |
– |
done = true; |
1733 |
– |
} catch (InterruptedException ok) {} |
1734 |
– |
} |
1735 |
– |
}; |
1736 |
– |
} |
1737 |
– |
|
1738 |
– |
public static class TrackedShortRunnable implements Runnable { |
1739 |
– |
public volatile boolean done = false; |
1740 |
– |
public void run() { |
1741 |
– |
try { |
1742 |
– |
delay(SHORT_DELAY_MS); |
1743 |
– |
done = true; |
1744 |
– |
} catch (InterruptedException ok) {} |
1745 |
– |
} |
1746 |
– |
} |
1747 |
– |
|
1748 |
– |
public static class TrackedSmallRunnable implements Runnable { |
1749 |
– |
public volatile boolean done = false; |
1750 |
– |
public void run() { |
1751 |
– |
try { |
1752 |
– |
delay(SMALL_DELAY_MS); |
1753 |
– |
done = true; |
1754 |
– |
} catch (InterruptedException ok) {} |
1755 |
– |
} |
1756 |
– |
} |
1757 |
– |
|
1758 |
– |
public static class TrackedMediumRunnable implements Runnable { |
1759 |
– |
public volatile boolean done = false; |
1760 |
– |
public void run() { |
1761 |
– |
try { |
1762 |
– |
delay(MEDIUM_DELAY_MS); |
1763 |
– |
done = true; |
1764 |
– |
} catch (InterruptedException ok) {} |
1765 |
– |
} |
1766 |
– |
} |
1767 |
– |
|
1768 |
– |
public static class TrackedLongRunnable implements Runnable { |
1769 |
– |
public volatile boolean done = false; |
1770 |
– |
public void run() { |
1771 |
– |
try { |
1772 |
– |
delay(LONG_DELAY_MS); |
1773 |
– |
done = true; |
1774 |
– |
} catch (InterruptedException ok) {} |
1775 |
– |
} |
1776 |
– |
} |
1777 |
– |
|
1691 |
|
public static class TrackedNoOpRunnable implements Runnable { |
1692 |
|
public volatile boolean done = false; |
1693 |
|
public void run() { |
1695 |
|
} |
1696 |
|
} |
1697 |
|
|
1785 |
– |
public static class TrackedCallable implements Callable { |
1786 |
– |
public volatile boolean done = false; |
1787 |
– |
public Object call() { |
1788 |
– |
try { |
1789 |
– |
delay(SMALL_DELAY_MS); |
1790 |
– |
done = true; |
1791 |
– |
} catch (InterruptedException ok) {} |
1792 |
– |
return Boolean.TRUE; |
1793 |
– |
} |
1794 |
– |
} |
1795 |
– |
|
1698 |
|
/** |
1699 |
|
* Analog of CheckedRunnable for RecursiveAction |
1700 |
|
*/ |
1761 |
|
assertEquals(0, q.size()); |
1762 |
|
assertNull(q.peek()); |
1763 |
|
assertNull(q.poll()); |
1764 |
< |
assertNull(q.poll(0, MILLISECONDS)); |
1764 |
> |
assertNull(q.poll(randomExpiredTimeout(), randomTimeUnit())); |
1765 |
|
assertEquals(q.toString(), "[]"); |
1766 |
|
assertTrue(Arrays.equals(q.toArray(), new Object[0])); |
1767 |
|
assertFalse(q.iterator().hasNext()); |
1912 |
|
static <T> void shuffle(T[] array) { |
1913 |
|
Collections.shuffle(Arrays.asList(array), ThreadLocalRandom.current()); |
1914 |
|
} |
1915 |
+ |
|
1916 |
+ |
// --- Shared assertions for Executor tests --- |
1917 |
+ |
|
1918 |
+ |
/** |
1919 |
+ |
* Returns maximum number of tasks that can be submitted to given |
1920 |
+ |
* pool (with bounded queue) before saturation (when submission |
1921 |
+ |
* throws RejectedExecutionException). |
1922 |
+ |
*/ |
1923 |
+ |
static final int saturatedSize(ThreadPoolExecutor pool) { |
1924 |
+ |
BlockingQueue<Runnable> q = pool.getQueue(); |
1925 |
+ |
return pool.getMaximumPoolSize() + q.size() + q.remainingCapacity(); |
1926 |
+ |
} |
1927 |
+ |
|
1928 |
+ |
@SuppressWarnings("FutureReturnValueIgnored") |
1929 |
+ |
void assertNullTaskSubmissionThrowsNullPointerException(Executor e) { |
1930 |
+ |
try { |
1931 |
+ |
e.execute((Runnable) null); |
1932 |
+ |
shouldThrow(); |
1933 |
+ |
} catch (NullPointerException success) {} |
1934 |
+ |
|
1935 |
+ |
if (! (e instanceof ExecutorService)) return; |
1936 |
+ |
ExecutorService es = (ExecutorService) e; |
1937 |
+ |
try { |
1938 |
+ |
es.submit((Runnable) null); |
1939 |
+ |
shouldThrow(); |
1940 |
+ |
} catch (NullPointerException success) {} |
1941 |
+ |
try { |
1942 |
+ |
es.submit((Runnable) null, Boolean.TRUE); |
1943 |
+ |
shouldThrow(); |
1944 |
+ |
} catch (NullPointerException success) {} |
1945 |
+ |
try { |
1946 |
+ |
es.submit((Callable) null); |
1947 |
+ |
shouldThrow(); |
1948 |
+ |
} catch (NullPointerException success) {} |
1949 |
+ |
|
1950 |
+ |
if (! (e instanceof ScheduledExecutorService)) return; |
1951 |
+ |
ScheduledExecutorService ses = (ScheduledExecutorService) e; |
1952 |
+ |
try { |
1953 |
+ |
ses.schedule((Runnable) null, |
1954 |
+ |
randomTimeout(), randomTimeUnit()); |
1955 |
+ |
shouldThrow(); |
1956 |
+ |
} catch (NullPointerException success) {} |
1957 |
+ |
try { |
1958 |
+ |
ses.schedule((Callable) null, |
1959 |
+ |
randomTimeout(), randomTimeUnit()); |
1960 |
+ |
shouldThrow(); |
1961 |
+ |
} catch (NullPointerException success) {} |
1962 |
+ |
try { |
1963 |
+ |
ses.scheduleAtFixedRate((Runnable) null, |
1964 |
+ |
randomTimeout(), LONG_DELAY_MS, MILLISECONDS); |
1965 |
+ |
shouldThrow(); |
1966 |
+ |
} catch (NullPointerException success) {} |
1967 |
+ |
try { |
1968 |
+ |
ses.scheduleWithFixedDelay((Runnable) null, |
1969 |
+ |
randomTimeout(), LONG_DELAY_MS, MILLISECONDS); |
1970 |
+ |
shouldThrow(); |
1971 |
+ |
} catch (NullPointerException success) {} |
1972 |
+ |
} |
1973 |
+ |
|
1974 |
+ |
void setRejectedExecutionHandler( |
1975 |
+ |
ThreadPoolExecutor p, RejectedExecutionHandler handler) { |
1976 |
+ |
p.setRejectedExecutionHandler(handler); |
1977 |
+ |
assertSame(handler, p.getRejectedExecutionHandler()); |
1978 |
+ |
} |
1979 |
+ |
|
1980 |
+ |
void assertTaskSubmissionsAreRejected(ThreadPoolExecutor p) { |
1981 |
+ |
final RejectedExecutionHandler savedHandler = p.getRejectedExecutionHandler(); |
1982 |
+ |
final long savedTaskCount = p.getTaskCount(); |
1983 |
+ |
final long savedCompletedTaskCount = p.getCompletedTaskCount(); |
1984 |
+ |
final int savedQueueSize = p.getQueue().size(); |
1985 |
+ |
final boolean stock = (p.getClass().getClassLoader() == null); |
1986 |
+ |
|
1987 |
+ |
Runnable r = () -> {}; |
1988 |
+ |
Callable<Boolean> c = () -> Boolean.TRUE; |
1989 |
+ |
|
1990 |
+ |
class Recorder implements RejectedExecutionHandler { |
1991 |
+ |
public volatile Runnable r = null; |
1992 |
+ |
public volatile ThreadPoolExecutor p = null; |
1993 |
+ |
public void reset() { r = null; p = null; } |
1994 |
+ |
public void rejectedExecution(Runnable r, ThreadPoolExecutor p) { |
1995 |
+ |
assertNull(this.r); |
1996 |
+ |
assertNull(this.p); |
1997 |
+ |
this.r = r; |
1998 |
+ |
this.p = p; |
1999 |
+ |
} |
2000 |
+ |
} |
2001 |
+ |
|
2002 |
+ |
// check custom handler is invoked exactly once per task |
2003 |
+ |
Recorder recorder = new Recorder(); |
2004 |
+ |
setRejectedExecutionHandler(p, recorder); |
2005 |
+ |
for (int i = 2; i--> 0; ) { |
2006 |
+ |
recorder.reset(); |
2007 |
+ |
p.execute(r); |
2008 |
+ |
if (stock && p.getClass() == ThreadPoolExecutor.class) |
2009 |
+ |
assertSame(r, recorder.r); |
2010 |
+ |
assertSame(p, recorder.p); |
2011 |
+ |
|
2012 |
+ |
recorder.reset(); |
2013 |
+ |
assertFalse(p.submit(r).isDone()); |
2014 |
+ |
if (stock) assertTrue(!((FutureTask) recorder.r).isDone()); |
2015 |
+ |
assertSame(p, recorder.p); |
2016 |
+ |
|
2017 |
+ |
recorder.reset(); |
2018 |
+ |
assertFalse(p.submit(r, Boolean.TRUE).isDone()); |
2019 |
+ |
if (stock) assertTrue(!((FutureTask) recorder.r).isDone()); |
2020 |
+ |
assertSame(p, recorder.p); |
2021 |
+ |
|
2022 |
+ |
recorder.reset(); |
2023 |
+ |
assertFalse(p.submit(c).isDone()); |
2024 |
+ |
if (stock) assertTrue(!((FutureTask) recorder.r).isDone()); |
2025 |
+ |
assertSame(p, recorder.p); |
2026 |
+ |
|
2027 |
+ |
if (p instanceof ScheduledExecutorService) { |
2028 |
+ |
ScheduledExecutorService s = (ScheduledExecutorService) p; |
2029 |
+ |
ScheduledFuture<?> future; |
2030 |
+ |
|
2031 |
+ |
recorder.reset(); |
2032 |
+ |
future = s.schedule(r, randomTimeout(), randomTimeUnit()); |
2033 |
+ |
assertFalse(future.isDone()); |
2034 |
+ |
if (stock) assertTrue(!((FutureTask) recorder.r).isDone()); |
2035 |
+ |
assertSame(p, recorder.p); |
2036 |
+ |
|
2037 |
+ |
recorder.reset(); |
2038 |
+ |
future = s.schedule(c, randomTimeout(), randomTimeUnit()); |
2039 |
+ |
assertFalse(future.isDone()); |
2040 |
+ |
if (stock) assertTrue(!((FutureTask) recorder.r).isDone()); |
2041 |
+ |
assertSame(p, recorder.p); |
2042 |
+ |
|
2043 |
+ |
recorder.reset(); |
2044 |
+ |
future = s.scheduleAtFixedRate(r, randomTimeout(), LONG_DELAY_MS, MILLISECONDS); |
2045 |
+ |
assertFalse(future.isDone()); |
2046 |
+ |
if (stock) assertTrue(!((FutureTask) recorder.r).isDone()); |
2047 |
+ |
assertSame(p, recorder.p); |
2048 |
+ |
|
2049 |
+ |
recorder.reset(); |
2050 |
+ |
future = s.scheduleWithFixedDelay(r, randomTimeout(), LONG_DELAY_MS, MILLISECONDS); |
2051 |
+ |
assertFalse(future.isDone()); |
2052 |
+ |
if (stock) assertTrue(!((FutureTask) recorder.r).isDone()); |
2053 |
+ |
assertSame(p, recorder.p); |
2054 |
+ |
} |
2055 |
+ |
} |
2056 |
+ |
|
2057 |
+ |
// Checking our custom handler above should be sufficient, but |
2058 |
+ |
// we add some integration tests of standard handlers. |
2059 |
+ |
final AtomicReference<Thread> thread = new AtomicReference<>(); |
2060 |
+ |
final Runnable setThread = () -> thread.set(Thread.currentThread()); |
2061 |
+ |
|
2062 |
+ |
setRejectedExecutionHandler(p, new ThreadPoolExecutor.AbortPolicy()); |
2063 |
+ |
try { |
2064 |
+ |
p.execute(setThread); |
2065 |
+ |
shouldThrow(); |
2066 |
+ |
} catch (RejectedExecutionException success) {} |
2067 |
+ |
assertNull(thread.get()); |
2068 |
+ |
|
2069 |
+ |
setRejectedExecutionHandler(p, new ThreadPoolExecutor.DiscardPolicy()); |
2070 |
+ |
p.execute(setThread); |
2071 |
+ |
assertNull(thread.get()); |
2072 |
+ |
|
2073 |
+ |
setRejectedExecutionHandler(p, new ThreadPoolExecutor.CallerRunsPolicy()); |
2074 |
+ |
p.execute(setThread); |
2075 |
+ |
if (p.isShutdown()) |
2076 |
+ |
assertNull(thread.get()); |
2077 |
+ |
else |
2078 |
+ |
assertSame(Thread.currentThread(), thread.get()); |
2079 |
+ |
|
2080 |
+ |
setRejectedExecutionHandler(p, savedHandler); |
2081 |
+ |
|
2082 |
+ |
// check that pool was not perturbed by handlers |
2083 |
+ |
assertEquals(savedTaskCount, p.getTaskCount()); |
2084 |
+ |
assertEquals(savedCompletedTaskCount, p.getCompletedTaskCount()); |
2085 |
+ |
assertEquals(savedQueueSize, p.getQueue().size()); |
2086 |
+ |
} |
2087 |
|
} |