/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* 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 4499763
* @summary Check for race condition between close and available
*/
/*
* Note: this is a probabalistic test and will not always fail on
* a workspace where the race condition can occur. However it should
* never fail on a workspace where the bug has been fixed.
*/
public class CloseAndAvailableRC {
}
private volatile boolean stop = false;
private volatile boolean stopTest = false;
for (long i=0; i<2000; i++) {
if (stopTest) {
cleanup();
throw new RuntimeException("Test failed");
}
resetPipes();
}
cleanup();
}
// Cleanup old threads
stop = true;
try {
} catch (InterruptedException e) {
}
stop = false;
// Input Stream will have been closed already
}
}
cleanup();
// Init pipe; Note: output never read
inPipe = new PipedInputStream();
// Put stuff in pipe so that available() > 0
for (byte b = 0; b < 10; b++)
}
public void run() {
while (!stop) {
try {
if (num < 0) {
// Bug detected; stop the test
stopTest = true;
}
} catch (final IOException e) {
}
}
}
}
}