66 |
|
import java.util.Collection; |
67 |
|
import java.util.Collections; |
68 |
|
import java.util.Date; |
69 |
+ |
import java.util.Deque; |
70 |
|
import java.util.Enumeration; |
71 |
+ |
import java.util.HashSet; |
72 |
|
import java.util.Iterator; |
73 |
|
import java.util.List; |
74 |
|
import java.util.NoSuchElementException; |
75 |
|
import java.util.PropertyPermission; |
76 |
+ |
import java.util.Set; |
77 |
|
import java.util.concurrent.BlockingQueue; |
78 |
|
import java.util.concurrent.Callable; |
79 |
|
import java.util.concurrent.CountDownLatch; |
117 |
|
* |
118 |
|
* <ol> |
119 |
|
* |
120 |
< |
* <li>All assertions in code running in generated threads must use |
121 |
< |
* the forms {@link #threadFail}, {@link #threadAssertTrue}, {@link |
122 |
< |
* #threadAssertEquals}, or {@link #threadAssertNull}, (not |
123 |
< |
* {@code fail}, {@code assertTrue}, etc.) It is OK (but not |
124 |
< |
* particularly recommended) for other code to use these forms too. |
125 |
< |
* Only the most typically used JUnit assertion methods are defined |
126 |
< |
* this way, but enough to live with. |
120 |
> |
* <li>All code not running in the main test thread (manually spawned threads |
121 |
> |
* or the common fork join pool) must be checked for failure (and completion!). |
122 |
> |
* Mechanisms that can be used to ensure this are: |
123 |
> |
* <ol> |
124 |
> |
* <li>Signalling via a synchronizer like AtomicInteger or CountDownLatch |
125 |
> |
* that the task completed normally, which is checked before returning from |
126 |
> |
* the test method in the main thread. |
127 |
> |
* <li>Using the forms {@link #threadFail}, {@link #threadAssertTrue}, |
128 |
> |
* or {@link #threadAssertNull}, (not {@code fail}, {@code assertTrue}, etc.) |
129 |
> |
* Only the most typically used JUnit assertion methods are defined |
130 |
> |
* this way, but enough to live with. |
131 |
> |
* <li>Recording failure explicitly using {@link #threadUnexpectedException} |
132 |
> |
* or {@link #threadRecordFailure}. |
133 |
> |
* <li>Using a wrapper like CheckedRunnable that uses one the mechanisms above. |
134 |
> |
* </ol> |
135 |
|
* |
136 |
|
* <li>If you override {@link #setUp} or {@link #tearDown}, make sure |
137 |
|
* to invoke {@code super.setUp} and {@code super.tearDown} within |
288 |
|
// Avoid spurious reports with enormous runsPerTest. |
289 |
|
// A single test case run should never take more than 1 second. |
290 |
|
// But let's cap it at the high end too ... |
291 |
< |
final int timeoutMinutes = |
292 |
< |
Math.min(15, Math.max(runsPerTest / 60, 1)); |
291 |
> |
final int timeoutMinutesMin = Math.max(runsPerTest / 60, 1) |
292 |
> |
* Math.max((int) delayFactor, 1); |
293 |
> |
final int timeoutMinutes = Math.min(15, timeoutMinutesMin); |
294 |
|
for (TestCase lastTestCase = currentTestCase;;) { |
295 |
|
try { MINUTES.sleep(timeoutMinutes); } |
296 |
|
catch (InterruptedException unexpected) { break; } |
460 |
|
public static boolean atLeastJava8() { return JAVA_CLASS_VERSION >= 52.0; } |
461 |
|
public static boolean atLeastJava9() { return JAVA_CLASS_VERSION >= 53.0; } |
462 |
|
public static boolean atLeastJava10() { return JAVA_CLASS_VERSION >= 54.0; } |
463 |
+ |
public static boolean atLeastJava11() { return JAVA_CLASS_VERSION >= 55.0; } |
464 |
+ |
public static boolean atLeastJava12() { return JAVA_CLASS_VERSION >= 56.0; } |
465 |
+ |
public static boolean atLeastJava13() { return JAVA_CLASS_VERSION >= 57.0; } |
466 |
+ |
public static boolean atLeastJava14() { return JAVA_CLASS_VERSION >= 58.0; } |
467 |
+ |
public static boolean atLeastJava15() { return JAVA_CLASS_VERSION >= 59.0; } |
468 |
+ |
public static boolean atLeastJava16() { return JAVA_CLASS_VERSION >= 60.0; } |
469 |
+ |
public static boolean atLeastJava17() { return JAVA_CLASS_VERSION >= 61.0; } |
470 |
|
|
471 |
|
/** |
472 |
|
* Collects all JSR166 unit tests as one suite. |
518 |
|
ExecutorsTest.suite(), |
519 |
|
ExecutorCompletionServiceTest.suite(), |
520 |
|
FutureTaskTest.suite(), |
521 |
+ |
HashtableTest.suite(), |
522 |
|
LinkedBlockingDequeTest.suite(), |
523 |
|
LinkedBlockingQueueTest.suite(), |
524 |
|
LinkedListTest.suite(), |
558 |
|
"HashMapTest", |
559 |
|
"LinkedBlockingDeque8Test", |
560 |
|
"LinkedBlockingQueue8Test", |
561 |
+ |
"LinkedHashMapTest", |
562 |
|
"LongAccumulatorTest", |
563 |
|
"LongAdderTest", |
564 |
|
"SplittableRandomTest", |
685 |
|
static TimeUnit randomTimeUnit() { return RANDOM_TIMEUNIT; } |
686 |
|
|
687 |
|
/** |
688 |
+ |
* Returns a random boolean; a "coin flip". |
689 |
+ |
*/ |
690 |
+ |
static boolean randomBoolean() { |
691 |
+ |
return ThreadLocalRandom.current().nextBoolean(); |
692 |
+ |
} |
693 |
+ |
|
694 |
+ |
/** |
695 |
+ |
* Returns a random element from given choices. |
696 |
+ |
*/ |
697 |
+ |
<T> T chooseRandomly(T... choices) { |
698 |
+ |
return choices[ThreadLocalRandom.current().nextInt(choices.length)]; |
699 |
+ |
} |
700 |
+ |
|
701 |
+ |
/** |
702 |
|
* Returns the shortest timed delay. This can be scaled up for |
703 |
|
* slow machines using the jsr166.delay.factor system property, |
704 |
|
* or via jtreg's -timeoutFactor: flag. |
1322 |
|
/** |
1323 |
|
* Spin-waits up to the specified number of milliseconds for the given |
1324 |
|
* thread to enter a wait state: BLOCKED, WAITING, or TIMED_WAITING. |
1325 |
+ |
* @param waitingForGodot if non-null, an additional condition to satisfy |
1326 |
|
*/ |
1327 |
< |
void waitForThreadToEnterWaitState(Thread thread, long timeoutMillis) { |
1328 |
< |
long startTime = 0L; |
1329 |
< |
for (;;) { |
1330 |
< |
Thread.State s = thread.getState(); |
1331 |
< |
if (s == Thread.State.BLOCKED || |
1332 |
< |
s == Thread.State.WAITING || |
1333 |
< |
s == Thread.State.TIMED_WAITING) |
1334 |
< |
return; |
1335 |
< |
else if (s == Thread.State.TERMINATED) |
1327 |
> |
void waitForThreadToEnterWaitState(Thread thread, long timeoutMillis, |
1328 |
> |
Callable<Boolean> waitingForGodot) { |
1329 |
> |
for (long startTime = 0L;;) { |
1330 |
> |
switch (thread.getState()) { |
1331 |
> |
default: break; |
1332 |
> |
case BLOCKED: case WAITING: case TIMED_WAITING: |
1333 |
> |
try { |
1334 |
> |
if (waitingForGodot == null || waitingForGodot.call()) |
1335 |
> |
return; |
1336 |
> |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
1337 |
> |
break; |
1338 |
> |
case TERMINATED: |
1339 |
|
fail("Unexpected thread termination"); |
1340 |
< |
else if (startTime == 0L) |
1340 |
> |
} |
1341 |
> |
|
1342 |
> |
if (startTime == 0L) |
1343 |
|
startTime = System.nanoTime(); |
1344 |
|
else if (millisElapsedSince(startTime) > timeoutMillis) { |
1345 |
< |
threadAssertTrue(thread.isAlive()); |
1346 |
< |
fail("timed out waiting for thread to enter wait state"); |
1345 |
> |
assertTrue(thread.isAlive()); |
1346 |
> |
if (waitingForGodot == null |
1347 |
> |
|| thread.getState() == Thread.State.RUNNABLE) |
1348 |
> |
fail("timed out waiting for thread to enter wait state"); |
1349 |
> |
else |
1350 |
> |
fail("timed out waiting for condition, thread state=" |
1351 |
> |
+ thread.getState()); |
1352 |
|
} |
1353 |
|
Thread.yield(); |
1354 |
|
} |
1356 |
|
|
1357 |
|
/** |
1358 |
|
* Spin-waits up to the specified number of milliseconds for the given |
1359 |
< |
* thread to enter a wait state: BLOCKED, WAITING, or TIMED_WAITING, |
1314 |
< |
* and additionally satisfy the given condition. |
1359 |
> |
* thread to enter a wait state: BLOCKED, WAITING, or TIMED_WAITING. |
1360 |
|
*/ |
1361 |
< |
void waitForThreadToEnterWaitState( |
1362 |
< |
Thread thread, long timeoutMillis, Callable<Boolean> waitingForGodot) { |
1318 |
< |
long startTime = 0L; |
1319 |
< |
for (;;) { |
1320 |
< |
Thread.State s = thread.getState(); |
1321 |
< |
if (s == Thread.State.BLOCKED || |
1322 |
< |
s == Thread.State.WAITING || |
1323 |
< |
s == Thread.State.TIMED_WAITING) { |
1324 |
< |
try { |
1325 |
< |
if (waitingForGodot.call()) |
1326 |
< |
return; |
1327 |
< |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
1328 |
< |
} |
1329 |
< |
else if (s == Thread.State.TERMINATED) |
1330 |
< |
fail("Unexpected thread termination"); |
1331 |
< |
else if (startTime == 0L) |
1332 |
< |
startTime = System.nanoTime(); |
1333 |
< |
else if (millisElapsedSince(startTime) > timeoutMillis) { |
1334 |
< |
threadAssertTrue(thread.isAlive()); |
1335 |
< |
fail("timed out waiting for thread to enter wait state"); |
1336 |
< |
} |
1337 |
< |
Thread.yield(); |
1338 |
< |
} |
1361 |
> |
void waitForThreadToEnterWaitState(Thread thread, long timeoutMillis) { |
1362 |
> |
waitForThreadToEnterWaitState(thread, timeoutMillis, null); |
1363 |
|
} |
1364 |
|
|
1365 |
|
/** |
1367 |
|
* enter a wait state: BLOCKED, WAITING, or TIMED_WAITING. |
1368 |
|
*/ |
1369 |
|
void waitForThreadToEnterWaitState(Thread thread) { |
1370 |
< |
waitForThreadToEnterWaitState(thread, LONG_DELAY_MS); |
1370 |
> |
waitForThreadToEnterWaitState(thread, LONG_DELAY_MS, null); |
1371 |
|
} |
1372 |
|
|
1373 |
|
/** |
1375 |
|
* enter a wait state: BLOCKED, WAITING, or TIMED_WAITING, |
1376 |
|
* and additionally satisfy the given condition. |
1377 |
|
*/ |
1378 |
< |
void waitForThreadToEnterWaitState( |
1379 |
< |
Thread thread, Callable<Boolean> waitingForGodot) { |
1378 |
> |
void waitForThreadToEnterWaitState(Thread thread, |
1379 |
> |
Callable<Boolean> waitingForGodot) { |
1380 |
|
waitForThreadToEnterWaitState(thread, LONG_DELAY_MS, waitingForGodot); |
1381 |
|
} |
1382 |
|
|
1383 |
|
/** |
1384 |
+ |
* Spin-waits up to LONG_DELAY_MS milliseconds for the current thread to |
1385 |
+ |
* be interrupted. Clears the interrupt status before returning. |
1386 |
+ |
*/ |
1387 |
+ |
void awaitInterrupted() { |
1388 |
+ |
for (long startTime = 0L; !Thread.interrupted(); ) { |
1389 |
+ |
if (startTime == 0L) |
1390 |
+ |
startTime = System.nanoTime(); |
1391 |
+ |
else if (millisElapsedSince(startTime) > LONG_DELAY_MS) |
1392 |
+ |
fail("timed out waiting for thread interrupt"); |
1393 |
+ |
Thread.yield(); |
1394 |
+ |
} |
1395 |
+ |
} |
1396 |
+ |
|
1397 |
+ |
/** |
1398 |
|
* Returns the number of milliseconds since time given by |
1399 |
|
* startNanoTime, which must have been previously returned from a |
1400 |
|
* call to {@link System#nanoTime()}. |
1422 |
|
*/ |
1423 |
|
<T> void checkTimedGet(Future<T> f, T expectedValue, long timeoutMillis) { |
1424 |
|
long startTime = System.nanoTime(); |
1425 |
+ |
T actual = null; |
1426 |
|
try { |
1427 |
< |
assertEquals(expectedValue, f.get(timeoutMillis, MILLISECONDS)); |
1427 |
> |
actual = f.get(timeoutMillis, MILLISECONDS); |
1428 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
1429 |
+ |
assertEquals(expectedValue, actual); |
1430 |
|
if (millisElapsedSince(startTime) > timeoutMillis/2) |
1431 |
|
throw new AssertionError("timed get did not return promptly"); |
1432 |
|
} |
1455 |
|
t.join(timeoutMillis); |
1456 |
|
} catch (InterruptedException fail) { |
1457 |
|
threadUnexpectedException(fail); |
1458 |
< |
} finally { |
1459 |
< |
if (t.getState() != Thread.State.TERMINATED) { |
1460 |
< |
t.interrupt(); |
1461 |
< |
threadFail("timed out waiting for thread to terminate"); |
1462 |
< |
} |
1458 |
> |
} |
1459 |
> |
Thread.State state; |
1460 |
> |
if ((state = t.getState()) != Thread.State.TERMINATED) { |
1461 |
> |
t.interrupt(); |
1462 |
> |
threadFail("timed out waiting for thread to terminate; " |
1463 |
> |
+ "state=" + state); |
1464 |
|
} |
1465 |
|
} |
1466 |
|
|
1499 |
|
public final void run() { |
1500 |
|
try { |
1501 |
|
realRun(); |
1461 |
– |
threadShouldThrow(exceptionClass.getSimpleName()); |
1502 |
|
} catch (Throwable t) { |
1503 |
|
if (! exceptionClass.isInstance(t)) |
1504 |
|
threadUnexpectedException(t); |
1505 |
+ |
return; |
1506 |
|
} |
1507 |
+ |
threadShouldThrow(exceptionClass.getSimpleName()); |
1508 |
|
} |
1509 |
|
} |
1510 |
|
|
1514 |
|
public final void run() { |
1515 |
|
try { |
1516 |
|
realRun(); |
1475 |
– |
threadShouldThrow("InterruptedException"); |
1517 |
|
} catch (InterruptedException success) { |
1518 |
|
threadAssertFalse(Thread.interrupted()); |
1519 |
+ |
return; |
1520 |
|
} catch (Throwable fail) { |
1521 |
|
threadUnexpectedException(fail); |
1522 |
|
} |
1523 |
+ |
threadShouldThrow("InterruptedException"); |
1524 |
|
} |
1525 |
|
} |
1526 |
|
|
1532 |
|
return realCall(); |
1533 |
|
} catch (Throwable fail) { |
1534 |
|
threadUnexpectedException(fail); |
1492 |
– |
return null; |
1493 |
– |
} |
1494 |
– |
} |
1495 |
– |
} |
1496 |
– |
|
1497 |
– |
public abstract class CheckedInterruptedCallable<T> |
1498 |
– |
implements Callable<T> { |
1499 |
– |
protected abstract T realCall() throws Throwable; |
1500 |
– |
|
1501 |
– |
public final T call() { |
1502 |
– |
try { |
1503 |
– |
T result = realCall(); |
1504 |
– |
threadShouldThrow("InterruptedException"); |
1505 |
– |
return result; |
1506 |
– |
} catch (InterruptedException success) { |
1507 |
– |
threadAssertFalse(Thread.interrupted()); |
1508 |
– |
} catch (Throwable fail) { |
1509 |
– |
threadUnexpectedException(fail); |
1535 |
|
} |
1536 |
< |
return null; |
1536 |
> |
throw new AssertionError("unreached"); |
1537 |
|
} |
1538 |
|
} |
1539 |
|
|
1590 |
|
} |
1591 |
|
|
1592 |
|
public void await(CountDownLatch latch, long timeoutMillis) { |
1593 |
+ |
boolean timedOut = false; |
1594 |
|
try { |
1595 |
< |
if (!latch.await(timeoutMillis, MILLISECONDS)) |
1570 |
< |
fail("timed out waiting for CountDownLatch for " |
1571 |
< |
+ (timeoutMillis/1000) + " sec"); |
1595 |
> |
timedOut = !latch.await(timeoutMillis, MILLISECONDS); |
1596 |
|
} catch (Throwable fail) { |
1597 |
|
threadUnexpectedException(fail); |
1598 |
|
} |
1599 |
+ |
if (timedOut) |
1600 |
+ |
fail("timed out waiting for CountDownLatch for " |
1601 |
+ |
+ (timeoutMillis/1000) + " sec"); |
1602 |
|
} |
1603 |
|
|
1604 |
|
public void await(CountDownLatch latch) { |
1606 |
|
} |
1607 |
|
|
1608 |
|
public void await(Semaphore semaphore) { |
1609 |
+ |
boolean timedOut = false; |
1610 |
|
try { |
1611 |
< |
if (!semaphore.tryAcquire(LONG_DELAY_MS, MILLISECONDS)) |
1584 |
< |
fail("timed out waiting for Semaphore for " |
1585 |
< |
+ (LONG_DELAY_MS/1000) + " sec"); |
1611 |
> |
timedOut = !semaphore.tryAcquire(LONG_DELAY_MS, MILLISECONDS); |
1612 |
|
} catch (Throwable fail) { |
1613 |
|
threadUnexpectedException(fail); |
1614 |
|
} |
1615 |
+ |
if (timedOut) |
1616 |
+ |
fail("timed out waiting for Semaphore for " |
1617 |
+ |
+ (LONG_DELAY_MS/1000) + " sec"); |
1618 |
|
} |
1619 |
|
|
1620 |
|
public void await(CyclicBarrier barrier) { |
1648 |
|
public String call() { throw new NullPointerException(); } |
1649 |
|
} |
1650 |
|
|
1622 |
– |
public class SmallPossiblyInterruptedRunnable extends CheckedRunnable { |
1623 |
– |
protected void realRun() { |
1624 |
– |
try { |
1625 |
– |
delay(SMALL_DELAY_MS); |
1626 |
– |
} catch (InterruptedException ok) {} |
1627 |
– |
} |
1628 |
– |
} |
1629 |
– |
|
1651 |
|
public Runnable possiblyInterruptedRunnable(final long timeoutMillis) { |
1652 |
|
return new CheckedRunnable() { |
1653 |
|
protected void realRun() { |
1703 |
|
return realCompute(); |
1704 |
|
} catch (Throwable fail) { |
1705 |
|
threadUnexpectedException(fail); |
1685 |
– |
return null; |
1706 |
|
} |
1707 |
+ |
throw new AssertionError("unreached"); |
1708 |
|
} |
1709 |
|
} |
1710 |
|
|
1781 |
|
} |
1782 |
|
} |
1783 |
|
|
1784 |
< |
void assertImmutable(final Object o) { |
1784 |
> |
void assertImmutable(Object o) { |
1785 |
|
if (o instanceof Collection) { |
1786 |
|
assertThrows( |
1787 |
|
UnsupportedOperationException.class, |
1788 |
< |
new Runnable() { public void run() { |
1768 |
< |
((Collection) o).add(null);}}); |
1788 |
> |
() -> ((Collection) o).add(null)); |
1789 |
|
} |
1790 |
|
} |
1791 |
|
|
1792 |
|
@SuppressWarnings("unchecked") |
1793 |
|
<T> T serialClone(T o) { |
1794 |
+ |
T clone = null; |
1795 |
|
try { |
1796 |
|
ObjectInputStream ois = new ObjectInputStream |
1797 |
|
(new ByteArrayInputStream(serialBytes(o))); |
1798 |
< |
T clone = (T) ois.readObject(); |
1778 |
< |
if (o == clone) assertImmutable(o); |
1779 |
< |
assertSame(o.getClass(), clone.getClass()); |
1780 |
< |
return clone; |
1798 |
> |
clone = (T) ois.readObject(); |
1799 |
|
} catch (Throwable fail) { |
1800 |
|
threadUnexpectedException(fail); |
1783 |
– |
return null; |
1801 |
|
} |
1802 |
+ |
if (o == clone) assertImmutable(o); |
1803 |
+ |
else assertSame(o.getClass(), clone.getClass()); |
1804 |
+ |
return clone; |
1805 |
|
} |
1806 |
|
|
1807 |
|
/** |
1820 |
|
(new ByteArrayInputStream(bos.toByteArray())); |
1821 |
|
T clone = (T) ois.readObject(); |
1822 |
|
if (o == clone) assertImmutable(o); |
1823 |
< |
assertSame(o.getClass(), clone.getClass()); |
1823 |
> |
else assertSame(o.getClass(), clone.getClass()); |
1824 |
|
return clone; |
1825 |
|
} |
1826 |
|
|
1845 |
|
} |
1846 |
|
|
1847 |
|
public void assertThrows(Class<? extends Throwable> expectedExceptionClass, |
1848 |
< |
Runnable... throwingActions) { |
1849 |
< |
for (Runnable throwingAction : throwingActions) { |
1848 |
> |
Action... throwingActions) { |
1849 |
> |
for (Action throwingAction : throwingActions) { |
1850 |
|
boolean threw = false; |
1851 |
|
try { throwingAction.run(); } |
1852 |
|
catch (Throwable t) { |
2071 |
|
assertEquals(savedCompletedTaskCount, p.getCompletedTaskCount()); |
2072 |
|
assertEquals(savedQueueSize, p.getQueue().size()); |
2073 |
|
} |
2074 |
+ |
|
2075 |
+ |
void assertCollectionsEquals(Collection<?> x, Collection<?> y) { |
2076 |
+ |
assertEquals(x, y); |
2077 |
+ |
assertEquals(y, x); |
2078 |
+ |
assertEquals(x.isEmpty(), y.isEmpty()); |
2079 |
+ |
assertEquals(x.size(), y.size()); |
2080 |
+ |
if (x instanceof List) { |
2081 |
+ |
assertEquals(x.toString(), y.toString()); |
2082 |
+ |
} |
2083 |
+ |
if (x instanceof List || x instanceof Set) { |
2084 |
+ |
assertEquals(x.hashCode(), y.hashCode()); |
2085 |
+ |
} |
2086 |
+ |
if (x instanceof List || x instanceof Deque) { |
2087 |
+ |
assertTrue(Arrays.equals(x.toArray(), y.toArray())); |
2088 |
+ |
assertTrue(Arrays.equals(x.toArray(new Object[0]), |
2089 |
+ |
y.toArray(new Object[0]))); |
2090 |
+ |
} |
2091 |
+ |
} |
2092 |
+ |
|
2093 |
+ |
/** |
2094 |
+ |
* A weaker form of assertCollectionsEquals which does not insist |
2095 |
+ |
* that the two collections satisfy Object#equals(Object), since |
2096 |
+ |
* they may use identity semantics as Deques do. |
2097 |
+ |
*/ |
2098 |
+ |
void assertCollectionsEquivalent(Collection<?> x, Collection<?> y) { |
2099 |
+ |
if (x instanceof List || x instanceof Set) |
2100 |
+ |
assertCollectionsEquals(x, y); |
2101 |
+ |
else { |
2102 |
+ |
assertEquals(x.isEmpty(), y.isEmpty()); |
2103 |
+ |
assertEquals(x.size(), y.size()); |
2104 |
+ |
assertEquals(new HashSet(x), new HashSet(y)); |
2105 |
+ |
if (x instanceof Deque) { |
2106 |
+ |
assertTrue(Arrays.equals(x.toArray(), y.toArray())); |
2107 |
+ |
assertTrue(Arrays.equals(x.toArray(new Object[0]), |
2108 |
+ |
y.toArray(new Object[0]))); |
2109 |
+ |
} |
2110 |
+ |
} |
2111 |
+ |
} |
2112 |
|
} |