0N/A/*
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
0N/A * published by the Free Software Foundation.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
2362N/A * or visit www.oracle.com if you need additional information or have any
2362N/A * questions.
0N/A */
0N/A
0N/A/*
0N/A * This file is available under and governed by the GNU General Public
0N/A * License version 2 only, as published by the Free Software Foundation.
0N/A * However, the following notice accompanied the original version of this
0N/A * file:
0N/A *
0N/A * Written by Doug Lea with assistance from members of JCP JSR-166
0N/A * Expert Group and released to the public domain, as explained at
3984N/A * http://creativecommons.org/publicdomain/zero/1.0/
0N/A */
0N/A
0N/A/*
0N/A * @test
0N/A * @bug 6236036 6264015
0N/A * @compile PollMemoryLeak.java
0N/A * @run main/othervm -Xmx8m PollMemoryLeak
0N/A * @summary Checks for OutOfMemoryError when an unbounded
0N/A * number of aborted timed waits occur without a signal.
0N/A */
0N/A
0N/Aimport java.util.concurrent.*;
0N/A
0N/Apublic class PollMemoryLeak {
0N/A public static void main(String[] args) throws InterruptedException {
0N/A final BlockingQueue[] qs = {
0N/A new LinkedBlockingQueue(10),
1771N/A new LinkedTransferQueue(),
0N/A new ArrayBlockingQueue(10),
0N/A new SynchronousQueue(),
0N/A new SynchronousQueue(true),
0N/A };
0N/A final long start = System.currentTimeMillis();
0N/A final long end = start + 10 * 1000;
0N/A while (System.currentTimeMillis() < end)
0N/A for (BlockingQueue q : qs)
0N/A q.poll(1, TimeUnit.NANOSECONDS);
0N/A }
0N/A}