| /* | |
| * Copyright (c) 2006, 2018, 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 6384064 | |
| * @summary Check proper handling of interrupts | |
| * @author Martin Buchholz | |
| * @library /test/lib | |
| */ | |
| import static java.util.concurrent.TimeUnit.MILLISECONDS; | |
| import java.util.ArrayList; | |
| import java.util.List; | |
| import java.util.concurrent.ArrayBlockingQueue; | |
| import java.util.concurrent.BlockingDeque; | |
| import java.util.concurrent.BlockingQueue; | |
| import java.util.concurrent.LinkedBlockingDeque; | |
| import java.util.concurrent.LinkedBlockingQueue; | |
| import java.util.concurrent.SynchronousQueue; | |
| import java.util.concurrent.Executor; | |
| import java.util.concurrent.ScheduledThreadPoolExecutor; | |
| import jdk.test.lib.Utils; | |
| public class Interrupt { | |
| static final long LONG_DELAY_MS = Utils.adjustTimeout(10_000); | |
| static void checkInterrupted0(Iterable<Fun> fs, Executor ex) { | |
| for (Fun f : fs) { | |
| try { | |
| ex.execute(new Runnable() { | |
| final Thread thisThread = Thread.currentThread(); | |
| public void run() { thisThread.interrupt(); }}); | |
| f.f(); | |
| fail("Expected InterruptedException not thrown"); | |
| } catch (InterruptedException e) { | |
| check(! Thread.interrupted()); | |
| } catch (Throwable t) { unexpected(t); } | |
| } | |
| } | |
| static void checkInterrupted(Iterable<Fun> fs) | |
| throws InterruptedException { | |
| final Executor immediateExecutor = new Executor() { | |
| public void execute(Runnable r) { | |
| r.run(); }}; | |
| final ScheduledThreadPoolExecutor stpe | |
| = new ScheduledThreadPoolExecutor(1); | |
| final Executor delayedExecutor = new Executor() { | |
| public void execute(Runnable r) { | |
| stpe.schedule(r, 20, MILLISECONDS); }}; | |
| checkInterrupted0(fs, immediateExecutor); | |
| checkInterrupted0(fs, delayedExecutor); | |
| stpe.shutdown(); | |
| check(stpe.awaitTermination(LONG_DELAY_MS, MILLISECONDS)); | |
| } | |
| static void testQueue(final BlockingQueue<Object> q) { | |
| try { | |
| final BlockingDeque<Object> deq = | |
| (q instanceof BlockingDeque<?>) ? | |
| (BlockingDeque<Object>) q : null; | |
| q.clear(); | |
| List<Fun> fs = new ArrayList<>(); | |
| fs.add(() -> q.take()); | |
| fs.add(() -> q.poll(LONG_DELAY_MS, MILLISECONDS)); | |
| if (deq != null) { | |
| fs.add(() -> deq.takeFirst()); | |
| fs.add(() -> deq.takeLast()); | |
| fs.add(() -> deq.pollFirst(LONG_DELAY_MS, MILLISECONDS)); | |
| fs.add(() -> deq.pollLast(LONG_DELAY_MS, MILLISECONDS)); | |
| } | |
| checkInterrupted(fs); | |
| // fill q to capacity, to ensure insertions will block | |
| while (q.remainingCapacity() > 0) | |
| try { q.put(1); } | |
| catch (Throwable t) { unexpected(t); } | |
| fs.clear(); | |
| fs.add(() -> q.put(1)); | |
| fs.add(() -> q.offer(1, LONG_DELAY_MS, MILLISECONDS)); | |
| if (deq != null) { | |
| fs.add(() -> deq.putFirst(1)); | |
| fs.add(() -> deq.putLast(1)); | |
| fs.add(() -> deq.offerFirst(1, LONG_DELAY_MS, MILLISECONDS)); | |
| fs.add(() -> deq.offerLast(1, LONG_DELAY_MS, MILLISECONDS)); | |
| } | |
| checkInterrupted(fs); | |
| } catch (Throwable t) { | |
| System.out.printf("Failed: %s%n", q.getClass().getSimpleName()); | |
| unexpected(t); | |
| } finally { | |
| Thread.interrupted(); // clear interrupts, just in case | |
| } | |
| } | |
| private static void realMain(final String[] args) throws Throwable { | |
| testQueue(new SynchronousQueue<Object>()); | |
| testQueue(new ArrayBlockingQueue<Object>(1,false)); | |
| testQueue(new ArrayBlockingQueue<Object>(1,true)); | |
| testQueue(new LinkedBlockingQueue<Object>(1)); | |
| testQueue(new LinkedBlockingDeque<Object>(1)); | |
| } | |
| //--------------------- Infrastructure --------------------------- | |
| static volatile int passed = 0, failed = 0; | |
| static void pass() {passed++;} | |
| static void fail() {failed++; Thread.dumpStack();} | |
| static void fail(String msg) {System.out.println(msg); fail();} | |
| static void unexpected(Throwable t) {failed++; t.printStackTrace();} | |
| static void check(boolean cond) {if (cond) pass(); else fail();} | |
| static 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 { | |
| try {realMain(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");} | |
| interface Fun {void f() throws Throwable;} | |
| } |